Lines Matching refs:tree
95 struct audit_tree *tree; in alloc_tree() local
97 tree = kmalloc(sizeof(struct audit_tree) + strlen(s) + 1, GFP_KERNEL); in alloc_tree()
98 if (tree) { in alloc_tree()
99 refcount_set(&tree->count, 1); in alloc_tree()
100 tree->goner = 0; in alloc_tree()
101 INIT_LIST_HEAD(&tree->chunks); in alloc_tree()
102 INIT_LIST_HEAD(&tree->rules); in alloc_tree()
103 INIT_LIST_HEAD(&tree->list); in alloc_tree()
104 INIT_LIST_HEAD(&tree->same_root); in alloc_tree()
105 tree->root = NULL; in alloc_tree()
106 strcpy(tree->pathname, s); in alloc_tree()
108 return tree; in alloc_tree()
111 static inline void get_tree(struct audit_tree *tree) in get_tree() argument
113 refcount_inc(&tree->count); in get_tree()
116 static inline void put_tree(struct audit_tree *tree) in put_tree() argument
118 if (refcount_dec_and_test(&tree->count)) in put_tree()
119 kfree_rcu(tree, head); in put_tree()
123 const char *audit_tree_path(struct audit_tree *tree) in audit_tree_path() argument
125 return tree->pathname; in audit_tree_path()
263 bool audit_tree_match(struct audit_chunk *chunk, struct audit_tree *tree) in audit_tree_match() argument
267 if (chunk->owners[n].owner == tree) in audit_tree_match()
399 static int create_chunk(struct inode *inode, struct audit_tree *tree) in create_chunk() argument
424 if (tree->goner) { in create_chunk()
435 chunk->owners[0].owner = tree; in create_chunk()
436 get_tree(tree); in create_chunk()
437 list_add(&chunk->owners[0].list, &tree->chunks); in create_chunk()
438 if (!tree->root) { in create_chunk()
439 tree->root = chunk; in create_chunk()
440 list_add(&tree->same_root, &chunk->trees); in create_chunk()
460 static int tag_chunk(struct inode *inode, struct audit_tree *tree) in tag_chunk() argument
470 return create_chunk(inode, tree); in tag_chunk()
481 if (old->owners[n].owner == tree) { in tag_chunk()
498 if (tree->goner) { in tag_chunk()
507 p->owner = tree; in tag_chunk()
508 get_tree(tree); in tag_chunk()
509 list_add(&p->list, &tree->chunks); in tag_chunk()
510 if (!tree->root) { in tag_chunk()
511 tree->root = chunk; in tag_chunk()
512 list_add(&tree->same_root, &chunk->trees); in tag_chunk()
538 audit_log_untrustedstring(ab, rule->tree->pathname); in audit_tree_log_remove_rule()
544 static void kill_rules(struct audit_context *context, struct audit_tree *tree) in kill_rules() argument
549 list_for_each_entry_safe(rule, next, &tree->rules, rlist) { in kill_rules()
553 if (rule->tree) { in kill_rules()
558 rule->tree = NULL; in kill_rules()
611 static void trim_marked(struct audit_tree *tree) in trim_marked() argument
615 if (tree->goner) { in trim_marked()
620 for (p = tree->chunks.next; p != &tree->chunks; p = q) { in trim_marked()
625 list_add(p, &tree->chunks); in trim_marked()
630 prune_tree_chunks(tree, true); in trim_marked()
633 if (!tree->root && !tree->goner) { in trim_marked()
634 tree->goner = 1; in trim_marked()
637 kill_rules(audit_context(), tree); in trim_marked()
638 list_del_init(&tree->list); in trim_marked()
640 prune_one(tree); in trim_marked()
651 struct audit_tree *tree; in audit_remove_tree_rule() local
652 tree = rule->tree; in audit_remove_tree_rule()
653 if (tree) { in audit_remove_tree_rule()
656 if (list_empty(&tree->rules) && !tree->goner) { in audit_remove_tree_rule()
657 tree->root = NULL; in audit_remove_tree_rule()
658 list_del_init(&tree->same_root); in audit_remove_tree_rule()
659 tree->goner = 1; in audit_remove_tree_rule()
660 list_move(&tree->list, &prune_list); in audit_remove_tree_rule()
661 rule->tree = NULL; in audit_remove_tree_rule()
666 rule->tree = NULL; in audit_remove_tree_rule()
686 struct audit_tree *tree; in audit_trim_trees() local
692 tree = container_of(cursor.next, struct audit_tree, list); in audit_trim_trees()
693 get_tree(tree); in audit_trim_trees()
695 list_add(&cursor, &tree->list); in audit_trim_trees()
698 err = kern_path(tree->pathname, 0, &path); in audit_trim_trees()
708 list_for_each_entry(node, &tree->chunks, list) { in audit_trim_trees()
718 trim_marked(tree); in audit_trim_trees()
721 put_tree(tree); in audit_trim_trees()
734 rule->inode_f || rule->watch || rule->tree) in audit_make_tree()
736 rule->tree = alloc_tree(pathname); in audit_make_tree()
737 if (!rule->tree) in audit_make_tree()
742 void audit_put_tree(struct audit_tree *tree) in audit_put_tree() argument
744 put_tree(tree); in audit_put_tree()
804 struct audit_tree *seed = rule->tree, *tree; in audit_add_tree_rule() local
809 rule->tree = NULL; in audit_add_tree_rule()
810 list_for_each_entry(tree, &tree_list, list) { in audit_add_tree_rule()
811 if (!strcmp(seed->pathname, tree->pathname)) { in audit_add_tree_rule()
813 rule->tree = tree; in audit_add_tree_rule()
814 list_add(&rule->rlist, &tree->rules); in audit_add_tree_rule()
818 tree = seed; in audit_add_tree_rule()
819 list_add(&tree->list, &tree_list); in audit_add_tree_rule()
820 list_add(&rule->rlist, &tree->rules); in audit_add_tree_rule()
830 err = kern_path(tree->pathname, 0, &path); in audit_add_tree_rule()
840 get_tree(tree); in audit_add_tree_rule()
841 err = iterate_mounts(tag_mount, tree, mnt); in audit_add_tree_rule()
847 list_for_each_entry(node, &tree->chunks, list) in audit_add_tree_rule()
851 trim_marked(tree); in audit_add_tree_rule()
857 put_tree(tree); in audit_add_tree_rule()
860 rule->tree = tree; in audit_add_tree_rule()
861 put_tree(tree); in audit_add_tree_rule()
866 list_del_init(&tree->list); in audit_add_tree_rule()
867 list_del_init(&tree->rules); in audit_add_tree_rule()
868 put_tree(tree); in audit_add_tree_rule()
899 struct audit_tree *tree; in audit_tag_tree() local
902 tree = container_of(cursor.next, struct audit_tree, list); in audit_tag_tree()
903 get_tree(tree); in audit_tag_tree()
905 list_add(&cursor, &tree->list); in audit_tag_tree()
908 err = kern_path(tree->pathname, 0, &path2); in audit_tag_tree()
915 put_tree(tree); in audit_tag_tree()
920 failed = iterate_mounts(tag_mount, tree, tagged); in audit_tag_tree()
922 put_tree(tree); in audit_tag_tree()
929 if (!tree->goner) { in audit_tag_tree()
930 list_del(&tree->list); in audit_tag_tree()
931 list_add(&tree->list, &tree_list); in audit_tag_tree()
934 put_tree(tree); in audit_tag_tree()
938 struct audit_tree *tree; in audit_tag_tree() local
940 tree = container_of(barrier.prev, struct audit_tree, list); in audit_tag_tree()
941 get_tree(tree); in audit_tag_tree()
942 list_del(&tree->list); in audit_tag_tree()
943 list_add(&tree->list, &barrier); in audit_tag_tree()
949 list_for_each_entry(node, &tree->chunks, list) in audit_tag_tree()
953 trim_marked(tree); in audit_tag_tree()
956 put_tree(tree); in audit_tag_tree()