Home
last modified time | relevance | path

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

/linux-6.12.1/kernel/
Daudit_tree.c45 static LIST_HEAD(tree_list);
682 list_add(&cursor, &tree_list); in audit_trim_trees()
683 while (cursor.next != &tree_list) { in audit_trim_trees()
808 list_for_each_entry(tree, &tree_list, list) { in audit_add_tree_rule()
817 list_add(&tree->list, &tree_list); in audit_add_tree_rule()
893 list_add(&barrier, &tree_list); in audit_tag_tree()
896 while (cursor.next != &tree_list) { in audit_tag_tree()
927 list_move(&tree->list, &tree_list); in audit_tag_tree()
933 while (barrier.prev != &tree_list) { in audit_tag_tree()
/linux-6.12.1/fs/btrfs/
Ddelayed-inode.c695 list_add_tail(&first_item->tree_list, &item_list); in btrfs_insert_delayed_item()
721 list_add_tail(&next->tree_list, &item_list); in btrfs_insert_delayed_item()
749 list_for_each_entry(curr, &item_list, tree_list) { in btrfs_insert_delayed_item()
762 list_for_each_entry(curr, &item_list, tree_list) { in btrfs_insert_delayed_item()
811 list_for_each_entry_safe(curr, next, &item_list, tree_list) { in btrfs_insert_delayed_item()
812 list_del(&curr->tree_list); in btrfs_insert_delayed_item()
871 list_add_tail(&curr->tree_list, &batch_list); in btrfs_batch_delete_items()
893 list_add_tail(&curr->tree_list, &batch_list); in btrfs_batch_delete_items()
913 list_for_each_entry_safe(curr, next, &batch_list, tree_list) { in btrfs_batch_delete_items()
914 list_del(&curr->tree_list); in btrfs_batch_delete_items()
Ddelayed-inode.h87 struct list_head tree_list; /* used for batch insert/delete items */ member
/linux-6.12.1/fs/
Dpnode.c288 struct mount *source_mnt, struct hlist_head *tree_list) in propagate_mnt() argument
301 list = tree_list; in propagate_mnt()
325 hlist_for_each_entry(n, tree_list, mnt_hash) { in propagate_mnt()
Dnamespace.c2454 HLIST_HEAD(tree_list); in attach_recursive_mnt()
2486 err = propagate_mnt(dest_mnt, dest_mp, source_mnt, &tree_list); in attach_recursive_mnt()
2519 hlist_for_each_entry_safe(child, n, &tree_list, mnt_hash) { in attach_recursive_mnt()
2538 while (!hlist_empty(&tree_list)) { in attach_recursive_mnt()
2539 child = hlist_entry(tree_list.first, struct mount, mnt_hash); in attach_recursive_mnt()