Home
last modified time | relevance | path

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

/linux/kernel/
H A Daudit_tree.c45 static LIST_HEAD(tree_list);
695 list_add(&cursor, &tree_list); in audit_trim_trees()
696 while (cursor.next != &tree_list) { in audit_trim_trees()
831 list_for_each_entry(tree, &tree_list, list) { in audit_add_tree_rule()
840 list_add(&tree->list, &tree_list); in audit_add_tree_rule()
917 list_add(&barrier, &tree_list); in audit_tag_tree()
920 while (cursor.next != &tree_list) { in audit_tag_tree()
951 list_move(&tree->list, &tree_list); in audit_tag_tree()
957 while (barrier.prev != &tree_list) { in audit_tag_tree()
/linux/fs/btrfs/
H A Ddelayed-inode.c694 list_add_tail(&first_item->tree_list, &item_list); in btrfs_insert_delayed_item()
720 list_add_tail(&next->tree_list, &item_list); in btrfs_insert_delayed_item()
746 list_for_each_entry(curr, &item_list, tree_list) { in btrfs_insert_delayed_item()
759 list_for_each_entry(curr, &item_list, tree_list) { in btrfs_insert_delayed_item()
808 list_for_each_entry_safe(curr, next, &item_list, tree_list) { in btrfs_insert_delayed_item()
809 list_del(&curr->tree_list); in btrfs_insert_delayed_item()
867 list_add_tail(&curr->tree_list, &batch_list); in btrfs_batch_delete_items()
889 list_add_tail(&curr->tree_list, &batch_list); in btrfs_batch_delete_items()
909 list_for_each_entry_safe(curr, next, &batch_list, tree_list) { in btrfs_batch_delete_items()
910 list_del(&curr->tree_list); in btrfs_batch_delete_items()
[all...]
/linux/fs/
H A Dpnode.c312 struct mount *source_mnt, struct hlist_head *tree_list) in propagate_mnt() argument
350 hlist_add_head(&this->mnt_hash, tree_list); in propagate_mnt()
358 hlist_for_each_entry(n, tree_list, mnt_hash) { in propagate_mnt()
H A Dnamespace.c2639 HLIST_HEAD(tree_list); in attach_recursive_mnt()
2691 err = propagate_mnt(dest_mnt, dest_mp, source_mnt, &tree_list); in attach_recursive_mnt()
2725 hlist_add_head(&source_mnt->mnt_hash, &tree_list); in attach_recursive_mnt()
2727 hlist_for_each_entry_safe(child, n, &tree_list, mnt_hash) { in attach_recursive_mnt()
2766 while (!hlist_empty(&tree_list)) { in attach_recursive_mnt()
2767 child = hlist_entry(tree_list.first, struct mount, mnt_hash); in attach_recursive_mnt()