Home
last modified time | relevance | path

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

/linux-4.1.27/kernel/
Daudit_tree.c38 static LIST_HEAD(tree_list);
588 list_add(&cursor, &tree_list); in audit_trim_trees()
589 while (cursor.next != &tree_list) { in audit_trim_trees()
715 list_for_each_entry(tree, &tree_list, list) { in audit_add_tree_rule()
724 list_add(&tree->list, &tree_list); in audit_add_tree_rule()
800 list_add(&barrier, &tree_list); in audit_tag_tree()
803 while (cursor.next != &tree_list) { in audit_tag_tree()
836 list_add(&tree->list, &tree_list); in audit_tag_tree()
842 while (barrier.prev != &tree_list) { in audit_tag_tree()
/linux-4.1.27/fs/
Dpnode.c279 struct mount *source_mnt, struct hlist_head *tree_list) in propagate_mnt() argument
294 list = tree_list; in propagate_mnt()
318 hlist_for_each_entry(n, tree_list, mnt_hash) { in propagate_mnt()
Dnamespace.c1891 HLIST_HEAD(tree_list); in attach_recursive_mnt()
1900 err = propagate_mnt(dest_mnt, dest_mp, source_mnt, &tree_list); in attach_recursive_mnt()
1918 hlist_for_each_entry_safe(child, n, &tree_list, mnt_hash) { in attach_recursive_mnt()
1930 while (!hlist_empty(&tree_list)) { in attach_recursive_mnt()
1931 child = hlist_entry(tree_list.first, struct mount, mnt_hash); in attach_recursive_mnt()
/linux-4.1.27/fs/btrfs/
Ddelayed-inode.h79 struct list_head tree_list; /* used for batch insert/delete items */ member
Ddelayed-inode.c752 list_add_tail(&next->tree_list, &head); in btrfs_batch_insert_items()
790 list_for_each_entry(next, &head, tree_list) { in btrfs_batch_insert_items()
805 list_for_each_entry_safe(curr, next, &head, tree_list) { in btrfs_batch_insert_items()
814 list_del(&curr->tree_list); in btrfs_batch_insert_items()
927 list_add_tail(&next->tree_list, &head); in btrfs_batch_delete_items()
951 list_for_each_entry_safe(curr, next, &head, tree_list) { in btrfs_batch_delete_items()
953 list_del(&curr->tree_list); in btrfs_batch_delete_items()