20 struct ovl_cache_entry {  struct
27 	struct ovl_cache_entry *next_maybe_whiteout;  argument
50 	struct ovl_cache_entry *first_maybe_whiteout;  argument
68 static struct ovl_cache_entry *ovl_cache_entry_from_node(struct rb_node *n)  in ovl_cache_entry_from_node()
70 	return rb_entry(n, struct ovl_cache_entry, node);  in ovl_cache_entry_from_node()
108 		struct ovl_cache_entry *tmp;  in ovl_cache_entry_find_link()
125 static struct ovl_cache_entry *ovl_cache_entry_find(struct rb_root *root,  in ovl_cache_entry_find()
132 		struct ovl_cache_entry *p = ovl_cache_entry_from_node(node);  in ovl_cache_entry_find()
147 			   struct ovl_cache_entry *p)  in ovl_calc_d_ino()
176 static struct ovl_cache_entry *ovl_cache_entry_new(struct ovl_readdir_data *rdd,  in ovl_cache_entry_new()
181 	struct ovl_cache_entry *p;  in ovl_cache_entry_new()
225 	struct ovl_cache_entry *p;  in ovl_cache_entry_add_rb()
249 	struct ovl_cache_entry *p;  in ovl_fill_lowest()
267 static void ovl_cache_entry_free(struct ovl_cache_entry *p)  in ovl_cache_entry_free()
276 	struct ovl_cache_entry *p;  in ovl_cache_free()
277 	struct ovl_cache_entry *n;  in ovl_cache_free()
356 		struct ovl_cache_entry *p =  in ovl_check_whiteouts()
551 static int ovl_cache_update(const struct path *path, struct ovl_cache_entry *p, bool update_ino)  in ovl_cache_update()
633 	struct ovl_cache_entry *p;  in ovl_fill_plain()
653 	struct ovl_cache_entry *p, *n;  in ovl_dir_read_impure()
762 		struct ovl_cache_entry *p;  in ovl_fill_real()
840 	struct ovl_cache_entry *p;  in ovl_iterate_merged()
856 		p = list_entry(od->cursor, struct ovl_cache_entry, l_node);  in ovl_iterate_merged()
1080 	struct ovl_cache_entry *p, *n;  in ovl_check_empty_dir()
1117 	struct ovl_cache_entry *p;  in ovl_cleanup_whiteouts()
1182 	struct ovl_cache_entry *p;  in ovl_workdir_cleanup_recurse()
1263 	struct ovl_cache_entry *p;  in ovl_indexdir_cleanup()