23 	struct list_head l_node;  member
194 	list_add_tail(&p->l_node, rdd->list);  in ovl_cache_entry_add_rb()
209 		list_move_tail(&p->l_node, &rdd->middle);  in ovl_fill_lowest()
215 			list_add_tail(&p->l_node, &rdd->middle);  in ovl_fill_lowest()
226 	list_for_each_entry_safe(p, n, list, l_node)  in ovl_cache_free()
561 	list_add_tail(&p->l_node, rdd->list);  in ovl_fill_plain()
586 	list_for_each_entry_safe(p, n, list, l_node) {  in ovl_dir_read_impure()
594 			list_del(&p->l_node);  in ovl_dir_read_impure()
793 		p = list_entry(od->cursor, struct ovl_cache_entry, l_node);  in ovl_iterate()
806 		od->cursor = p->l_node.next;  in ovl_iterate()
996 	list_for_each_entry_safe(p, n, list, l_node) {  in ovl_check_empty_dir()
1017 		list_del(&p->l_node);  in ovl_check_empty_dir()
1030 	list_for_each_entry(p, list, l_node) {  in ovl_cleanup_whiteouts()
1118 	list_for_each_entry(p, &list, l_node) {  in ovl_workdir_cleanup_recurse()
1189 	list_for_each_entry(p, &list, l_node) {  in ovl_indexdir_cleanup()