RepoMirrors/haproxy
1
0
Fork 0
mirror of http://git.haproxy.org/git/haproxy.git/ synced 2024-12-23 21:22:17 +00:00
Code Issues Packages Projects Releases Wiki Activity

MINOR: lru: Add lru64_lookup function

Browse Source 
It lookup a key in a LRU cache for use with specified domain and revision. It
differs from lru64_get as it does not create missing keys. The function returns
NULL if an error or a cache miss occurs.
This commit is contained in:
Christopher Faulet 2015-06-11 13:33:13 +02:00 committed by Willy Tarreau
parent f90ac55d9e
commit 92939d20fa
2 changed files with 37 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
include/import/lru.h
View File

@ -66,6 +66,8 @@ struct lru64 {
void (*free)(void *data); /* function to release data, if needed */
};
struct lru64 *lru64_lookup(unsigned long long key, struct lru64_head *lru, void *domain, unsigned long long revision);
struct lru64 *lru64_get(unsigned long long key, struct lru64_head *lru, void *domain, unsigned long long revision);
void lru64_commit(struct lru64 *elem, void *data, void *domain, unsigned long long revision, void (*free)(void *));
struct lru64_head *lru64_new(int size);

35
src/lru.c
View File

@ -28,6 +28,41 @@
#define LIST_ADD(lh, el) ({ (el)->n = (lh)->n; (el)->n->p = (lh)->n = (el); (el)->p = (lh); })
#define LIST_DEL(el) ({ (el)->n->p = (el)->p; (el)->p->n = (el)->n; })
/* Lookup key <key> in LRU cache <lru> for use with domain <domain> whose data's
* current version is <revision>. It differs from lru64_get as it does not
* create missing keys. The function returns NULL if an error or a cache miss
* occurs. */
struct lru64 *lru64_lookup(unsigned long long key, struct lru64_head *lru,
void *domain, unsigned long long revision)
{
struct eb64_node *node;
struct lru64 *elem;
if (!lru->spare) {
if (!lru->cache_size)
return NULL;
lru->spare = malloc(sizeof(*lru->spare));
if (!lru->spare)
return NULL;
lru->spare->domain = NULL;
}
node = __eb64_lookup(&lru->keys, key);
elem = container_of(node, typeof(*elem), node);
if (elem) {
/* Existing entry found, check validity then move it at the
* head of the LRU list.
*/
if (elem->domain == domain && elem->revision == revision) {
LIST_DEL(&elem->lru);
LIST_ADD(&lru->list, &elem->lru);
return elem;
}
}
return NULL;
}
/* Get key <key> from LRU cache <lru> for use with domain <domain> whose data's
* current revision is <revision>. If the key doesn't exist it's first created
* with ->domain = NULL. The caller detects this situation by checking ->domain