Home
last modified time | relevance | path

Searched refs:tree_list (Results 1 – 5 of 5) sorted by relevance

/Linux-v5.4/kernel/
Daudit_tree.c45 static LIST_HEAD(tree_list);
684 list_add(&cursor, &tree_list); in audit_trim_trees()
685 while (cursor.next != &tree_list) { in audit_trim_trees()
810 list_for_each_entry(tree, &tree_list, list) { in audit_add_tree_rule()
819 list_add(&tree->list, &tree_list); in audit_add_tree_rule()
895 list_add(&barrier, &tree_list); in audit_tag_tree()
898 while (cursor.next != &tree_list) { in audit_tag_tree()
931 list_add(&tree->list, &tree_list); in audit_tag_tree()
937 while (barrier.prev != &tree_list) { in audit_tag_tree()
/Linux-v5.4/fs/
Dpnode.c290 struct mount *source_mnt, struct hlist_head *tree_list) in propagate_mnt() argument
304 list = tree_list; in propagate_mnt()
328 hlist_for_each_entry(n, tree_list, mnt_hash) { in propagate_mnt()
Dnamespace.c2046 HLIST_HEAD(tree_list); in attach_recursive_mnt()
2071 err = propagate_mnt(dest_mnt, dest_mp, source_mnt, &tree_list); in attach_recursive_mnt()
2093 hlist_for_each_entry_safe(child, n, &tree_list, mnt_hash) { in attach_recursive_mnt()
2112 while (!hlist_empty(&tree_list)) { in attach_recursive_mnt()
2113 child = hlist_entry(tree_list.first, struct mount, mnt_hash); in attach_recursive_mnt()
/Linux-v5.4/fs/btrfs/
Ddelayed-inode.h66 struct list_head tree_list; /* used for batch insert/delete items */ member
Ddelayed-inode.c727 list_add_tail(&next->tree_list, &head); in btrfs_batch_insert_items()
765 list_for_each_entry(next, &head, tree_list) { in btrfs_batch_insert_items()
777 list_for_each_entry_safe(curr, next, &head, tree_list) { in btrfs_batch_insert_items()
786 list_del(&curr->tree_list); in btrfs_batch_insert_items()
899 list_add_tail(&next->tree_list, &head); in btrfs_batch_delete_items()
923 list_for_each_entry_safe(curr, next, &head, tree_list) { in btrfs_batch_delete_items()
925 list_del(&curr->tree_list); in btrfs_batch_delete_items()