26 	struct list_head l_node;  member
193 	list_add_tail(&p->l_node, rdd->list);  in ovl_cache_entry_add_rb()
208 		list_move_tail(&p->l_node, &rdd->middle);  in ovl_fill_lowest()
214 			list_add_tail(&p->l_node, &rdd->middle);  in ovl_fill_lowest()
225 	list_for_each_entry_safe(p, n, list, l_node)  in ovl_cache_free()
543 	list_add_tail(&p->l_node, rdd->list);  in ovl_fill_plain()
568 	list_for_each_entry_safe(p, n, list, l_node) {  in ovl_dir_read_impure()
576 			list_del(&p->l_node);  in ovl_dir_read_impure()
764 		p = list_entry(od->cursor, struct ovl_cache_entry, l_node);  in ovl_iterate()
774 		od->cursor = p->l_node.next;  in ovl_iterate()
930 	list_for_each_entry_safe(p, n, list, l_node) {  in ovl_check_empty_dir()
951 		list_del(&p->l_node);  in ovl_check_empty_dir()
963 	list_for_each_entry(p, list, l_node) {  in ovl_cleanup_whiteouts()
1039 	list_for_each_entry(p, &list, l_node) {  in ovl_workdir_cleanup_recurse()
1104 	list_for_each_entry(p, &list, l_node) {  in ovl_indexdir_cleanup()