Lines Matching defs:list
16 * the code is named as if it's the priorities) are written in an arbitrary list
25 * batch this up: We fill up the free_inc list with freshly invalidated buckets,
27 * free_inc list and optionally discard them.
31 * smaller freelist, and buckets on that list are always ready to be used.
34 * free_inc list to the free list.
40 * them (because they were overwritten). That's the unused list - buckets on the
41 * unused list move to the free list, optionally being discarded in the process.
60 * invalidated, and then invalidate them and stick them on the free_inc list -
327 * the free list:
351 * them to the free_inc list:
535 struct list_head list;
573 list_for_each_entry_reverse(ret, &c->data_buckets, list)
583 struct open_bucket, list);
667 list_move_tail(&b->list, &c->data_buckets);
704 struct open_bucket, list);
705 list_del(&b->list);
722 list_add(&b->list, &c->data_buckets);