Home
last modified time | relevance | path

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

/linux/kernel/ !
H A Daudit_tree.c45 static LIST_HEAD(tree_list);
678 list_add(&cursor, &tree_list); in audit_trim_trees()
679 while (cursor.next != &tree_list) { in audit_trim_trees()
814 list_for_each_entry(tree, &tree_list, list) { in audit_add_tree_rule()
823 list_add(&tree->list, &tree_list); in audit_add_tree_rule()
900 list_add(&barrier, &tree_list); in audit_tag_tree()
903 while (cursor.next != &tree_list) { in audit_tag_tree()
934 list_move(&tree->list, &tree_list); in audit_tag_tree()
940 while (barrier.prev != &tree_list) { in audit_tag_tree()
/linux/fs/btrfs/ !
H A Ddelayed-inode.c697 list_add_tail(&first_item->tree_list, &item_list); in btrfs_insert_delayed_item()
723 list_add_tail(&next->tree_list, &item_list); in btrfs_insert_delayed_item()
751 list_for_each_entry(curr, &item_list, tree_list) { in btrfs_insert_delayed_item()
764 list_for_each_entry(curr, &item_list, tree_list) { in btrfs_insert_delayed_item()
813 list_for_each_entry_safe(curr, next, &item_list, tree_list) { in btrfs_insert_delayed_item()
814 list_del(&curr->tree_list); in btrfs_insert_delayed_item()
873 list_add_tail(&curr->tree_list, &batch_list); in btrfs_batch_delete_items()
895 list_add_tail(&curr->tree_list, &batch_list); in btrfs_batch_delete_items()
915 list_for_each_entry_safe(curr, next, &batch_list, tree_list) { in btrfs_batch_delete_items()
916 list_del(&curr->tree_list); in btrfs_batch_delete_items()
H A Ddelayed-inode.h110 struct list_head tree_list; /* used for batch insert/delete items */ member
/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.c2564 HLIST_HEAD(tree_list); in attach_recursive_mnt()
2597 err = propagate_mnt(dest_mnt, dest_mp, source_mnt, &tree_list); in attach_recursive_mnt()
2631 hlist_add_head(&source_mnt->mnt_hash, &tree_list); in attach_recursive_mnt()
2633 hlist_for_each_entry_safe(child, n, &tree_list, mnt_hash) { in attach_recursive_mnt()
2657 while (!hlist_empty(&tree_list)) { in attach_recursive_mnt()
2658 child = hlist_entry(tree_list.first, struct mount, mnt_hash); in attach_recursive_mnt()