Home
last modified time | relevance | path

Searched refs:tree (Results 1 – 13 of 13) sorted by relevance

/kernel/
Daudit_tree.c95 struct audit_tree *tree; in alloc_tree() local
97 tree = kmalloc(struct_size(tree, pathname, 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()
[all …]
Dauditfilter.c158 krule->inode_f || krule->watch || krule->tree || in audit_to_inode()
614 if (entry->rule.tree) in audit_data_to_entry()
615 audit_put_tree(entry->rule.tree); /* that's the temporary one */ in audit_data_to_entry()
676 audit_tree_path(krule->tree)); in audit_krule_to_data()
740 if (strcmp(audit_tree_path(a->tree), in audit_compare_rule()
741 audit_tree_path(b->tree))) in audit_compare_rule()
850 new->tree = old->tree; in audit_dupe_rule()
942 struct audit_tree *tree = entry->rule.tree; in audit_add_rule() local
963 if (tree) in audit_add_rule()
964 audit_put_tree(tree); in audit_add_rule()
[all …]
Daudit.h291 struct audit_tree *tree);
297 extern const char *audit_tree_path(struct audit_tree *tree);
298 extern void audit_put_tree(struct audit_tree *tree);
327 #define audit_put_tree(tree) do { } while (0) argument
Dauditsc.c307 static int match_tree_refs(struct audit_context *ctx, struct audit_tree *tree) in match_tree_refs() argument
312 if (!tree) in match_tree_refs()
317 if (audit_tree_match(p->c[n], tree)) in match_tree_refs()
323 if (audit_tree_match(p->c[n], tree)) in match_tree_refs()
640 result = match_tree_refs(ctx, rule->tree); in audit_filter_rules()
Daudit_watch.c189 krule->inode_f || krule->watch || krule->tree) in audit_to_watch()
Dfork.c694 mt_clear_in_rcu(mas.tree); in dup_mmap()
792 mt_set_in_rcu(mas.tree); in dup_mmap()
/kernel/module/
Dtree_lookup.c64 static noinline void __mod_tree_insert(struct mod_tree_node *node, struct mod_tree_root *tree) in __mod_tree_insert() argument
66 latch_tree_insert(&node->node, &tree->root, &mod_tree_ops); in __mod_tree_insert()
69 static void __mod_tree_remove(struct mod_tree_node *node, struct mod_tree_root *tree) in __mod_tree_remove() argument
71 latch_tree_erase(&node->node, &tree->root, &mod_tree_ops); in __mod_tree_remove()
108 struct module *mod_find(unsigned long addr, struct mod_tree_root *tree) in mod_find() argument
112 ltn = latch_tree_find((void *)addr, &tree->root, &mod_tree_ops); in mod_find()
Dinternal.h202 struct module *mod_find(unsigned long addr, struct mod_tree_root *tree);
208 static inline struct module *mod_find(unsigned long addr, struct mod_tree_root *tree) in mod_find() argument
Dmain.c104 static void __mod_update_bounds(void *base, unsigned int size, struct mod_tree_root *tree) in __mod_update_bounds() argument
109 if (min < tree->addr_min) in __mod_update_bounds()
110 tree->addr_min = min; in __mod_update_bounds()
111 if (max > tree->addr_max) in __mod_update_bounds()
112 tree->addr_max = max; in __mod_update_bounds()
3106 struct mod_tree_root *tree; in __module_address() local
3109 tree = &mod_tree; in __module_address()
3112 tree = &mod_data_tree; in __module_address()
3119 mod = mod_find(addr, tree); in __module_address()
DKconfig301 If unsure, or if you need to build out-of-tree modules, say N.
311 exported at all times, even in absence of in-tree users. The value to
314 source tree.
/kernel/rcu/
DMakefile16 obj-$(CONFIG_TREE_RCU) += tree.o
DKconfig139 making these warnings mandatory for the tree variants.
/kernel/events/
Dcore.c1578 groups->tree = RB_ROOT; in perf_event_groups_init()
1680 rb_add(&event->group_node, &groups->tree, __group_less); in perf_event_groups_insert()
1703 RB_EMPTY_ROOT(&groups->tree)); in perf_event_groups_delete()
1705 rb_erase(&event->group_node, &groups->tree); in perf_event_groups_delete()
1734 node = rb_find_first(&key, &groups->tree, __group_cmp); in perf_event_groups_first()
1764 for (event = rb_entry_safe(rb_first(&((groups)->tree)), \
3943 if (!RB_EMPTY_ROOT(&ctx->pinned_groups.tree)) in perf_event_context_sched_in()
4193 event = rb_entry_safe(rb_first(&ctx->flexible_groups.tree), in ctx_event_to_rotate()