21 struct ovl_cache_entry {  struct
28 	struct ovl_cache_entry *next_maybe_whiteout;  argument
48 	struct ovl_cache_entry *first_maybe_whiteout;  argument
64 static struct ovl_cache_entry *ovl_cache_entry_from_node(struct rb_node *n)  in ovl_cache_entry_from_node()
66 	return rb_entry(n, struct ovl_cache_entry, node);  in ovl_cache_entry_from_node()
78 		struct ovl_cache_entry *tmp;  in ovl_cache_entry_find_link()
95 static struct ovl_cache_entry *ovl_cache_entry_find(struct rb_root *root,  in ovl_cache_entry_find()
102 		struct ovl_cache_entry *p = ovl_cache_entry_from_node(node);  in ovl_cache_entry_find()
117 			   struct ovl_cache_entry *p)  in ovl_calc_d_ino()
146 static struct ovl_cache_entry *ovl_cache_entry_new(struct ovl_readdir_data *rdd,  in ovl_cache_entry_new()
150 	struct ovl_cache_entry *p;  in ovl_cache_entry_new()
151 	size_t size = offsetof(struct ovl_cache_entry, name[len + 1]);  in ovl_cache_entry_new()
182 	struct ovl_cache_entry *p;  in ovl_cache_entry_add_rb()
204 	struct ovl_cache_entry *p;  in ovl_fill_lowest()
222 	struct ovl_cache_entry *p;  in ovl_cache_free()
223 	struct ovl_cache_entry *n;  in ovl_cache_free()
273 	struct ovl_cache_entry *p;  in ovl_check_whiteouts()
465 static int ovl_cache_update_ino(struct path *path, struct ovl_cache_entry *p)  in ovl_cache_update_ino()
539 	struct ovl_cache_entry *p;  in ovl_fill_plain()
559 	struct ovl_cache_entry *p, *n;  in ovl_dir_read_impure()
664 		struct ovl_cache_entry *p;  in ovl_fill_real()
737 	struct ovl_cache_entry *p;  in ovl_iterate()
770 		p = list_entry(od->cursor, struct ovl_cache_entry, l_node);  in ovl_iterate()
924 	struct ovl_cache_entry *p, *n;  in ovl_check_empty_dir()
966 	struct ovl_cache_entry *p;  in ovl_cleanup_whiteouts()
1031 	struct ovl_cache_entry *p;  in ovl_workdir_cleanup_recurse()
1096 	struct ovl_cache_entry *p;  in ovl_indexdir_cleanup()