Lines Matching refs:tree
76 struct audit_tree *tree; in alloc_tree() local
78 tree = kmalloc(sizeof(struct audit_tree) + strlen(s) + 1, GFP_KERNEL); in alloc_tree()
79 if (tree) { in alloc_tree()
80 atomic_set(&tree->count, 1); in alloc_tree()
81 tree->goner = 0; in alloc_tree()
82 INIT_LIST_HEAD(&tree->chunks); in alloc_tree()
83 INIT_LIST_HEAD(&tree->rules); in alloc_tree()
84 INIT_LIST_HEAD(&tree->list); in alloc_tree()
85 INIT_LIST_HEAD(&tree->same_root); in alloc_tree()
86 tree->root = NULL; in alloc_tree()
87 strcpy(tree->pathname, s); in alloc_tree()
89 return tree; in alloc_tree()
92 static inline void get_tree(struct audit_tree *tree) in get_tree() argument
94 atomic_inc(&tree->count); in get_tree()
97 static inline void put_tree(struct audit_tree *tree) in put_tree() argument
99 if (atomic_dec_and_test(&tree->count)) in put_tree()
100 kfree_rcu(tree, head); in put_tree()
104 const char *audit_tree_path(struct audit_tree *tree) in audit_tree_path() argument
106 return tree->pathname; in audit_tree_path()
200 bool audit_tree_match(struct audit_chunk *chunk, struct audit_tree *tree) in audit_tree_match() argument
204 if (chunk->owners[n].owner == tree) in audit_tree_match()
317 static int create_chunk(struct inode *inode, struct audit_tree *tree) in create_chunk() argument
332 if (tree->goner) { in create_chunk()
341 chunk->owners[0].owner = tree; in create_chunk()
342 get_tree(tree); in create_chunk()
343 list_add(&chunk->owners[0].list, &tree->chunks); in create_chunk()
344 if (!tree->root) { in create_chunk()
345 tree->root = chunk; in create_chunk()
346 list_add(&tree->same_root, &chunk->trees); in create_chunk()
356 static int tag_chunk(struct inode *inode, struct audit_tree *tree) in tag_chunk() argument
366 return create_chunk(inode, tree); in tag_chunk()
373 if (old->owners[n].owner == tree) { in tag_chunk()
411 if (tree->goner) { in tag_chunk()
434 p->owner = tree; in tag_chunk()
435 get_tree(tree); in tag_chunk()
436 list_add(&p->list, &tree->chunks); in tag_chunk()
441 if (!tree->root) { in tag_chunk()
442 tree->root = chunk; in tag_chunk()
443 list_add(&tree->same_root, &chunk->trees); in tag_chunk()
464 audit_log_untrustedstring(ab, rule->tree->pathname); in audit_tree_log_remove_rule()
470 static void kill_rules(struct audit_tree *tree) in kill_rules() argument
475 list_for_each_entry_safe(rule, next, &tree->rules, rlist) { in kill_rules()
479 if (rule->tree) { in kill_rules()
484 rule->tree = NULL; in kill_rules()
511 static void trim_marked(struct audit_tree *tree) in trim_marked() argument
515 if (tree->goner) { in trim_marked()
520 for (p = tree->chunks.next; p != &tree->chunks; p = q) { in trim_marked()
525 list_add(p, &tree->chunks); in trim_marked()
529 while (!list_empty(&tree->chunks)) { in trim_marked()
532 node = list_entry(tree->chunks.next, struct node, list); in trim_marked()
540 if (!tree->root && !tree->goner) { in trim_marked()
541 tree->goner = 1; in trim_marked()
544 kill_rules(tree); in trim_marked()
545 list_del_init(&tree->list); in trim_marked()
547 prune_one(tree); in trim_marked()
558 struct audit_tree *tree; in audit_remove_tree_rule() local
559 tree = rule->tree; in audit_remove_tree_rule()
560 if (tree) { in audit_remove_tree_rule()
563 if (list_empty(&tree->rules) && !tree->goner) { in audit_remove_tree_rule()
564 tree->root = NULL; in audit_remove_tree_rule()
565 list_del_init(&tree->same_root); in audit_remove_tree_rule()
566 tree->goner = 1; in audit_remove_tree_rule()
567 list_move(&tree->list, &prune_list); in audit_remove_tree_rule()
568 rule->tree = NULL; in audit_remove_tree_rule()
573 rule->tree = NULL; in audit_remove_tree_rule()
592 struct audit_tree *tree; in audit_trim_trees() local
598 tree = container_of(cursor.next, struct audit_tree, list); in audit_trim_trees()
599 get_tree(tree); in audit_trim_trees()
601 list_add(&cursor, &tree->list); in audit_trim_trees()
604 err = kern_path(tree->pathname, 0, &path); in audit_trim_trees()
614 list_for_each_entry(node, &tree->chunks, list) { in audit_trim_trees()
623 trim_marked(tree); in audit_trim_trees()
626 put_tree(tree); in audit_trim_trees()
639 rule->inode_f || rule->watch || rule->tree) in audit_make_tree()
641 rule->tree = alloc_tree(pathname); in audit_make_tree()
642 if (!rule->tree) in audit_make_tree()
647 void audit_put_tree(struct audit_tree *tree) in audit_put_tree() argument
649 put_tree(tree); in audit_put_tree()
711 struct audit_tree *seed = rule->tree, *tree; in audit_add_tree_rule() local
716 rule->tree = NULL; in audit_add_tree_rule()
717 list_for_each_entry(tree, &tree_list, list) { in audit_add_tree_rule()
718 if (!strcmp(seed->pathname, tree->pathname)) { in audit_add_tree_rule()
720 rule->tree = tree; in audit_add_tree_rule()
721 list_add(&rule->rlist, &tree->rules); in audit_add_tree_rule()
725 tree = seed; in audit_add_tree_rule()
726 list_add(&tree->list, &tree_list); in audit_add_tree_rule()
727 list_add(&rule->rlist, &tree->rules); in audit_add_tree_rule()
737 err = kern_path(tree->pathname, 0, &path); in audit_add_tree_rule()
747 get_tree(tree); in audit_add_tree_rule()
748 err = iterate_mounts(tag_mount, tree, mnt); in audit_add_tree_rule()
754 list_for_each_entry(node, &tree->chunks, list) in audit_add_tree_rule()
758 trim_marked(tree); in audit_add_tree_rule()
764 put_tree(tree); in audit_add_tree_rule()
767 rule->tree = tree; in audit_add_tree_rule()
768 put_tree(tree); in audit_add_tree_rule()
773 list_del_init(&tree->list); in audit_add_tree_rule()
774 list_del_init(&tree->rules); in audit_add_tree_rule()
775 put_tree(tree); in audit_add_tree_rule()
806 struct audit_tree *tree; in audit_tag_tree() local
809 tree = container_of(cursor.next, struct audit_tree, list); in audit_tag_tree()
810 get_tree(tree); in audit_tag_tree()
812 list_add(&cursor, &tree->list); in audit_tag_tree()
815 err = kern_path(tree->pathname, 0, &path2); in audit_tag_tree()
822 put_tree(tree); in audit_tag_tree()
827 failed = iterate_mounts(tag_mount, tree, tagged); in audit_tag_tree()
829 put_tree(tree); in audit_tag_tree()
836 if (!tree->goner) { in audit_tag_tree()
837 list_del(&tree->list); in audit_tag_tree()
838 list_add(&tree->list, &tree_list); in audit_tag_tree()
841 put_tree(tree); in audit_tag_tree()
845 struct audit_tree *tree; in audit_tag_tree() local
847 tree = container_of(barrier.prev, struct audit_tree, list); in audit_tag_tree()
848 get_tree(tree); in audit_tag_tree()
849 list_del(&tree->list); in audit_tag_tree()
850 list_add(&tree->list, &barrier); in audit_tag_tree()
856 list_for_each_entry(node, &tree->chunks, list) in audit_tag_tree()
860 trim_marked(tree); in audit_tag_tree()
863 put_tree(tree); in audit_tag_tree()