tree_list 728 fs/btrfs/delayed-inode.c list_add_tail(&next->tree_list, &head); tree_list 766 fs/btrfs/delayed-inode.c list_for_each_entry(next, &head, tree_list) { tree_list 778 fs/btrfs/delayed-inode.c list_for_each_entry_safe(curr, next, &head, tree_list) { tree_list 787 fs/btrfs/delayed-inode.c list_del(&curr->tree_list); tree_list 903 fs/btrfs/delayed-inode.c list_add_tail(&next->tree_list, &head); tree_list 927 fs/btrfs/delayed-inode.c list_for_each_entry_safe(curr, next, &head, tree_list) { tree_list 929 fs/btrfs/delayed-inode.c list_del(&curr->tree_list); tree_list 66 fs/btrfs/delayed-inode.h struct list_head tree_list; /* used for batch insert/delete items */ tree_list 2046 fs/namespace.c HLIST_HEAD(tree_list); tree_list 2071 fs/namespace.c err = propagate_mnt(dest_mnt, dest_mp, source_mnt, &tree_list); tree_list 2093 fs/namespace.c hlist_for_each_entry_safe(child, n, &tree_list, mnt_hash) { tree_list 2112 fs/namespace.c while (!hlist_empty(&tree_list)) { tree_list 2113 fs/namespace.c child = hlist_entry(tree_list.first, struct mount, mnt_hash); tree_list 289 fs/pnode.c struct mount *source_mnt, struct hlist_head *tree_list) tree_list 303 fs/pnode.c list = tree_list; tree_list 327 fs/pnode.c hlist_for_each_entry(n, tree_list, mnt_hash) { tree_list 45 kernel/audit_tree.c static LIST_HEAD(tree_list); tree_list 684 kernel/audit_tree.c list_add(&cursor, &tree_list); tree_list 685 kernel/audit_tree.c while (cursor.next != &tree_list) { tree_list 810 kernel/audit_tree.c list_for_each_entry(tree, &tree_list, list) { tree_list 819 kernel/audit_tree.c list_add(&tree->list, &tree_list); tree_list 895 kernel/audit_tree.c list_add(&barrier, &tree_list); tree_list 898 kernel/audit_tree.c while (cursor.next != &tree_list) { tree_list 931 kernel/audit_tree.c list_add(&tree->list, &tree_list); tree_list 937 kernel/audit_tree.c while (barrier.prev != &tree_list) {