306 struct entry {  struct
325 	struct entry *entries, *entries_end;
334 	ep->entries = vzalloc(sizeof(struct entry) * nr_entries);  in epool_init()
354 static struct entry *alloc_entry(struct entry_pool *ep)  in alloc_entry()
356 	struct entry *e;  in alloc_entry()
361 	e = list_entry(list_pop(&ep->free), struct entry, list);  in alloc_entry()
372 static struct entry *alloc_particular_entry(struct entry_pool *ep, dm_cblock_t cblock)  in alloc_particular_entry()
374 	struct entry *e = ep->entries + from_cblock(cblock);  in alloc_particular_entry()
383 static void free_entry(struct entry_pool *ep, struct entry *e)  in free_entry()
394 static struct entry *epool_find(struct entry_pool *ep, dm_cblock_t cblock)  in epool_find()
396 	struct entry *e = ep->entries + from_cblock(cblock);  in epool_find()
405 static bool in_pool(struct entry_pool *ep, struct entry *e)  in in_pool()
410 static dm_cblock_t infer_cblock(struct entry_pool *ep, struct entry *e)  in infer_cblock()
495 static void hash_insert(struct mq_policy *mq, struct entry *e)  in hash_insert()
502 static struct entry *hash_lookup(struct mq_policy *mq, dm_oblock_t oblock)  in hash_lookup()
506 	struct entry *e;  in hash_lookup()
518 static void hash_remove(struct entry *e)  in hash_remove()
546 static unsigned queue_level(struct entry *e)  in queue_level()
551 static bool in_cache(struct mq_policy *mq, struct entry *e)  in in_cache()
561 static void push(struct mq_policy *mq, struct entry *e)  in push()
575 static void del(struct mq_policy *mq, struct entry *e)  in del()
589 static struct entry *pop(struct mq_policy *mq, struct queue *q)  in pop()
591 	struct entry *e;  in pop()
597 	e = container_of(h, struct entry, list);  in pop()
603 static struct entry *pop_old(struct mq_policy *mq, struct queue *q)  in pop_old()
605 	struct entry *e;  in pop_old()
611 	e = container_of(h, struct entry, list);  in pop_old()
617 static struct entry *peek(struct queue *q)  in peek()
620 	return h ? container_of(h, struct entry, list) : NULL;  in peek()
642 	struct entry *e;  in check_generation()
674 static void requeue(struct mq_policy *mq, struct entry *e)  in requeue()
699 	struct entry *demoted = peek(&mq->cache_clean);  in demote_cblock()
737 	struct entry *e;  in promote_threshold()
780 static bool should_promote(struct mq_policy *mq, struct entry *e,  in should_promote()
788 			     struct entry *e,  in cache_entry_found()
805 static int pre_cache_to_cache(struct mq_policy *mq, struct entry *e,  in pre_cache_to_cache()
810 	struct entry *new_e;  in pre_cache_to_cache()
840 static int pre_cache_entry_found(struct mq_policy *mq, struct entry *e,  in pre_cache_entry_found()
865 	struct entry *e = alloc_entry(&mq->pre_cache_pool);  in insert_in_pre_cache()
890 	struct entry *e;  in insert_in_cache()
948 	struct entry *e = hash_lookup(mq, oblock);  in map()
995 	struct entry *e = container_of(h, struct entry, list);  in update_pre_cache_hits()
1002 	struct entry *e = container_of(h, struct entry, list);  in update_cache_hits()
1057 	struct entry *e;  in mq_lookup()
1076 	struct entry *e;  in __mq_set_clear_dirty()
1109 	struct entry *e;  in mq_load_mapping()
1126 	struct entry *e;  in mq_save_hints()
1133 			e = container_of(h, struct entry, list);  in mq_save_hints()
1162 	struct entry *e;  in __remove_mapping()
1182 	struct entry *e = epool_find(&mq->cache_pool, cblock);  in __remove_cblock()
1222 	struct entry *e = pop_old(mq, &mq->cache_dirty);  in __mq_writeback_work()
1254 	struct entry *e = hash_lookup(mq, current_oblock);  in __force_mapping()
1445 					   sizeof(struct entry),  in mq_init()
1446 					   __alignof__(struct entry),  in mq_init()