137 struct search_list {  struct
160 	struct search_list *search_lists[MAX_ZONES];  argument
235 					 struct search_list **list_ptr)  in make_search_list()
237 	struct search_list *list;  in make_search_list()
242 	bytes = (sizeof(struct search_list) +  in make_search_list()
370 static inline void set_newest_entry(struct search_list *search_list, u8 index)  in set_newest_entry()  argument
375 		newest = search_list->entries[index];  in set_newest_entry()
376 		memmove(&search_list->entries[1], &search_list->entries[0],  in set_newest_entry()
378 		search_list->entries[0] = newest;  in set_newest_entry()
385 	if (search_list->first_dead_entry <= index)  in set_newest_entry()
386 		search_list->first_dead_entry++;  in set_newest_entry()
392 	struct search_list *search_list;  in uds_sparse_cache_contains()  local
403 	search_list = cache->search_lists[zone_number];  in uds_sparse_cache_contains()
404 	for (i = 0; i < search_list->first_dead_entry; i++) {  in uds_sparse_cache_contains()
405 		chapter = search_list->entries[i];  in uds_sparse_cache_contains()
411 			set_newest_entry(search_list, i);  in uds_sparse_cache_contains()
424 static void purge_search_list(struct search_list *search_list,  in purge_search_list()  argument
436 	entries = &search_list->entries[0];  in purge_search_list()
438 	dead = &cache->scratch_entries[search_list->capacity];  in purge_search_list()
440 	for (i = 0; i < search_list->first_dead_entry; i++) {  in purge_search_list()
441 		chapter = search_list->entries[i];  in purge_search_list()
455 	search_list->first_dead_entry = next_alive + next_skipped;  in purge_search_list()
479 static inline void copy_search_list(const struct search_list *source,  in copy_search_list()
480 				    struct search_list *target)  in copy_search_list()
516 		struct search_list *list = cache->search_lists[ZONE_ZERO];  in uds_update_sparse_cache()
582 	struct search_list *search_list;  in uds_search_sparse_cache()  local
588 	search_list = cache->search_lists[zone->id];  in uds_search_sparse_cache()
589 	for (i = 0; i < search_list->first_dead_entry; i++) {  in uds_search_sparse_cache()
590 		chapter = search_list->entries[i];  in uds_search_sparse_cache()
608 			set_newest_entry(search_list, i);  in uds_search_sparse_cache()