43 	struct list_head *list;  member
190 	list_add_tail(&p->l_node, rdd->list);  in ovl_cache_entry_add_rb()
217 void ovl_cache_free(struct list_head *list)  in ovl_cache_free()  argument
222 	list_for_each_entry_safe(p, n, list, l_node)  in ovl_cache_free()
225 	INIT_LIST_HEAD(list);  in ovl_cache_free()
355 static int ovl_dir_read_merged(struct dentry *dentry, struct list_head *list,  in ovl_dir_read_merged()  argument
363 		.list = list,  in ovl_dir_read_merged()
382 			list_add(&rdd.middle, rdd.list);  in ovl_dir_read_merged()
540 	list_add_tail(&p->l_node, rdd->list);  in ovl_fill_plain()
545 static int ovl_dir_read_impure(struct path *path,  struct list_head *list,  in ovl_dir_read_impure()  argument
553 		.list = list,  in ovl_dir_read_impure()
557 	INIT_LIST_HEAD(list);  in ovl_dir_read_impure()
565 	list_for_each_entry_safe(p, n, list, l_node) {  in ovl_dir_read_impure()
912 int ovl_check_empty_dir(struct dentry *dentry, struct list_head *list)  in ovl_check_empty_dir()  argument
920 	err = ovl_dir_read_merged(dentry, list, &root);  in ovl_check_empty_dir()
927 	list_for_each_entry_safe(p, n, list, l_node) {  in ovl_check_empty_dir()
955 void ovl_cleanup_whiteouts(struct dentry *upper, struct list_head *list)  in ovl_cleanup_whiteouts()  argument
960 	list_for_each_entry(p, list, l_node) {  in ovl_cleanup_whiteouts()
1020 	LIST_HEAD(list);  in ovl_workdir_cleanup_recurse()
1026 		.list = &list,  in ovl_workdir_cleanup_recurse()
1036 	list_for_each_entry(p, &list, l_node) {  in ovl_workdir_cleanup_recurse()
1054 	ovl_cache_free(&list);  in ovl_workdir_cleanup_recurse()
1085 	LIST_HEAD(list);  in ovl_indexdir_cleanup()
1091 		.list = &list,  in ovl_indexdir_cleanup()
1101 	list_for_each_entry(p, &list, l_node) {  in ovl_indexdir_cleanup()
1148 	ovl_cache_free(&list);  in ovl_indexdir_cleanup()