76 lines
2.2 KiB
C
76 lines
2.2 KiB
C
|
#include <config.h>
|
||
|
|
#include <stdlib.h>
|
||
|
|
#include <lladd/replacementPolicy.h>
|
||
|
|
//#include <lladd/lhtable.h>
|
||
|
|
#include <lladd/doubleLinkedList.h>
|
||
|
|
#include <assert.h>
|
||
|
|
|
||
|
|
typedef LL_ENTRY(value_t) value_t;
|
||
|
|
typedef struct LL_ENTRY(node_t) node_t;
|
||
|
|
typedef struct LL_ENTRY(list) list;
|
||
|
|
|
||
|
|
typedef struct lruFast {
|
||
|
|
// struct LH_ENTRY(table) * hash;
|
||
|
|
struct LL_ENTRY(list) * lru;
|
||
|
|
node_t * (*getNode)(void * page, void * conf);
|
||
|
|
void (*setNode)(void * page, node_t * n,
|
||
|
|
void * conf);
|
||
|
|
void * conf;
|
||
|
|
} lruFast;
|
||
|
|
|
||
|
|
static void hit(struct replacementPolicy * r, void * p) {
|
||
|
|
lruFast * l = r->impl;
|
||
|
|
// node_t * n = LH_ENTRY(find)(l->hash, &id, sizeof(int));
|
||
|
|
node_t * n = l->getNode(p, l->conf);
|
||
|
|
assert(n);
|
||
|
|
LL_ENTRY(removeNoFree)(l->lru, n);
|
||
|
|
LL_ENTRY(pushNode)(l->lru, n);
|
||
|
|
}
|
||
|
|
static void* getStale(struct replacementPolicy * r) {
|
||
|
|
lruFast * l = r->impl;
|
||
|
|
return LL_ENTRY(head)(l->lru);
|
||
|
|
}
|
||
|
|
static void* remove(struct replacementPolicy* r, void * p) {
|
||
|
|
lruFast * l = r->impl;
|
||
|
|
node_t * n = l->getNode(p, l->conf); //LH_ENTRY(remove)(l->hash, &id, sizeof(int));
|
||
|
|
assert(n);
|
||
|
|
value_t * v = n->v;
|
||
|
|
LL_ENTRY(remove)(l->lru, n);
|
||
|
|
return v;
|
||
|
|
}
|
||
|
|
static void insert(struct replacementPolicy* r,
|
||
|
|
void * p) {
|
||
|
|
lruFast * l = r->impl;
|
||
|
|
node_t * n = LL_ENTRY(push)(l->lru, p);
|
||
|
|
// LH_ENTRY(insert)(l->hash, &id, sizeof(int), n);
|
||
|
|
l->setNode(p, n, l->conf);
|
||
|
|
}
|
||
|
|
static void deinit(struct replacementPolicy * r) {
|
||
|
|
lruFast * l = r->impl;
|
||
|
|
// the node_t's get freed by LL_ENTRY. It's the caller's
|
||
|
|
// responsibility to free the void *'s passed into us.
|
||
|
|
//LH_ENTRY(destroy)(l->hash);
|
||
|
|
LL_ENTRY(destroy)(l->lru);
|
||
|
|
free(r);
|
||
|
|
}
|
||
|
|
replacementPolicy * lruFastInit(
|
||
|
|
struct LL_ENTRY(node_t) * (*getNode)(void * page, void * conf),
|
||
|
|
void (*setNode)(void * page,
|
||
|
|
struct LL_ENTRY(node_t) * n,
|
||
|
|
void * conf),
|
||
|
|
void * conf) {
|
||
|
|
struct replacementPolicy * ret = malloc(sizeof(struct replacementPolicy));
|
||
|
|
ret->deinit = deinit;
|
||
|
|
ret->hit = hit;
|
||
|
|
ret->getStale = getStale;
|
||
|
|
ret->remove = remove;
|
||
|
|
ret->insert = insert;
|
||
|
|
lruFast * l = malloc(sizeof(lruFast));
|
||
|
|
// l->hash = LH_ENTRY(create)(256);
|
||
|
|
l->lru = LL_ENTRY(create)();
|
||
|
|
l->getNode = getNode;
|
||
|
|
l->setNode = setNode;
|
||
|
|
ret->impl = l;
|
||
|
|
return ret;
|
||
|
|
}
|