18 struct ovl_cache_entry {  struct
25 	struct ovl_cache_entry *next_maybe_whiteout;  argument
46 	struct ovl_cache_entry *first_maybe_whiteout;  argument
63 static struct ovl_cache_entry *ovl_cache_entry_from_node(struct rb_node *n)  in ovl_cache_entry_from_node()
65 	return rb_entry(n, struct ovl_cache_entry, node);  in ovl_cache_entry_from_node()
77 		struct ovl_cache_entry *tmp;  in ovl_cache_entry_find_link()
94 static struct ovl_cache_entry *ovl_cache_entry_find(struct rb_root *root,  in ovl_cache_entry_find()
101 		struct ovl_cache_entry *p = ovl_cache_entry_from_node(node);  in ovl_cache_entry_find()
116 			   struct ovl_cache_entry *p)  in ovl_calc_d_ino()
145 static struct ovl_cache_entry *ovl_cache_entry_new(struct ovl_readdir_data *rdd,  in ovl_cache_entry_new()
149 	struct ovl_cache_entry *p;  in ovl_cache_entry_new()
150 	size_t size = offsetof(struct ovl_cache_entry, name[len + 1]);  in ovl_cache_entry_new()
183 	struct ovl_cache_entry *p;  in ovl_cache_entry_add_rb()
205 	struct ovl_cache_entry *p;  in ovl_fill_lowest()
223 	struct ovl_cache_entry *p;  in ovl_cache_free()
224 	struct ovl_cache_entry *n;  in ovl_cache_free()
274 	struct ovl_cache_entry *p;  in ovl_check_whiteouts()
469 static int ovl_cache_update(const struct path *path, struct ovl_cache_entry *p, bool update_ino)  in ovl_cache_update()
551 	struct ovl_cache_entry *p;  in ovl_fill_plain()
571 	struct ovl_cache_entry *p, *n;  in ovl_dir_read_impure()
679 		struct ovl_cache_entry *p;  in ovl_fill_real()
755 	struct ovl_cache_entry *p;  in ovl_iterate()
793 		p = list_entry(od->cursor, struct ovl_cache_entry, l_node);  in ovl_iterate()
984 	struct ovl_cache_entry *p, *n;  in ovl_check_empty_dir()
1027 	struct ovl_cache_entry *p;  in ovl_cleanup_whiteouts()
1094 	struct ovl_cache_entry *p;  in ovl_workdir_cleanup_recurse()
1178 	struct ovl_cache_entry *p;  in ovl_indexdir_cleanup()