search_list
list_add(&src->search_list, &traverse_list);
list_for_each_entry_safe(node, n, &traverse_list, search_list) {
list_add_tail(&tmp->search_list, &edge_list);
list_for_each_entry_reverse(n, &visited_list, search_list)
struct search_list *search_lists[MAX_ZONES];
struct search_list **list_ptr)
struct search_list *list;
bytes = (sizeof(struct search_list) +
static inline void set_newest_entry(struct search_list *search_list, u8 index)
newest = search_list->entries[index];
memmove(&search_list->entries[1], &search_list->entries[0],
search_list->entries[0] = newest;
if (search_list->first_dead_entry <= index)
search_list->first_dead_entry++;
struct search_list *search_list;
search_list = cache->search_lists[zone_number];
for (i = 0; i < search_list->first_dead_entry; i++) {
chapter = search_list->entries[i];
set_newest_entry(search_list, i);
static void purge_search_list(struct search_list *search_list,
entries = &search_list->entries[0];
dead = &cache->scratch_entries[search_list->capacity];
for (i = 0; i < search_list->first_dead_entry; i++) {
chapter = search_list->entries[i];
search_list->first_dead_entry = next_alive + next_skipped;
static inline void copy_search_list(const struct search_list *source,
struct search_list *target)
struct search_list *list = cache->search_lists[ZONE_ZERO];
struct search_list *search_list;
search_list = cache->search_lists[zone->id];
for (i = 0; i < search_list->first_dead_entry; i++) {
chapter = search_list->entries[i];
set_newest_entry(search_list, i);
struct list_head search_list;