Lines Matching refs:lfu_policy
365 struct cache_lfu_policy_ *lfu_policy;
369 lfu_policy = (struct cache_lfu_policy_ *)policy;
373 TAILQ_INSERT_HEAD(&(lfu_policy->groups[CACHELIB_MAX_FREQUENCY - 1]),
386 struct cache_lfu_policy_ *lfu_policy;
391 lfu_policy = (struct cache_lfu_policy_ *)policy;
414 TAILQ_REMOVE(&(lfu_policy->groups[lfu_item->frequency]), lfu_item,
417 TAILQ_INSERT_HEAD(&(lfu_policy->groups[index]), lfu_item, entries);
426 struct cache_lfu_policy_ *lfu_policy;
430 lfu_policy = (struct cache_lfu_policy_ *)policy;
433 TAILQ_REMOVE(&(lfu_policy->groups[lfu_item->frequency]), lfu_item,
441 struct cache_lfu_policy_ *lfu_policy;
447 lfu_policy = (struct cache_lfu_policy_ *)policy;
449 if (!TAILQ_EMPTY(&(lfu_policy->groups[i]))) {
450 lfu_item = TAILQ_FIRST(&(lfu_policy->groups[i]));
461 struct cache_lfu_policy_ *lfu_policy;
467 lfu_policy = (struct cache_lfu_policy_ *)policy;
469 if (!TAILQ_EMPTY(&(lfu_policy->groups[i]))) {
470 lfu_item = TAILQ_LAST(&(lfu_policy->groups[i]),
483 struct cache_lfu_policy_ *lfu_policy;
488 lfu_policy = (struct cache_lfu_policy_ *)policy;
494 if (!TAILQ_EMPTY(&(lfu_policy->groups[i]))) {
495 lfu_item = TAILQ_FIRST(&(lfu_policy->groups[i]));
509 struct cache_lfu_policy_ *lfu_policy;
514 lfu_policy = (struct cache_lfu_policy_ *)policy;
521 if (!TAILQ_EMPTY(&(lfu_policy->groups[i]))) {
522 lfu_item = TAILQ_LAST(&(lfu_policy->groups[i]),
574 struct cache_lfu_policy_ *lfu_policy;
578 lfu_policy = (struct cache_lfu_policy_ *)policy;
580 while (!TAILQ_EMPTY(&(lfu_policy->groups[i]))) {
581 lfu_item = TAILQ_FIRST(&(lfu_policy->groups[i]));
582 TAILQ_REMOVE(&(lfu_policy->groups[i]), lfu_item,