Home
last modified time | relevance | path

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

/kernel/
A Daudit_tree.c98 if (tree) { in alloc_tree()
108 return tree; in alloc_tree()
618 for (p = tree->chunks.next; p != &tree->chunks; p = q) { in trim_marked()
631 if (!tree->root && !tree->goner) { in trim_marked()
650 tree = rule->tree; in audit_remove_tree_rule()
651 if (tree) { in audit_remove_tree_rule()
654 if (list_empty(&tree->rules) && !tree->goner) { in audit_remove_tree_rule()
805 struct audit_tree *seed = rule->tree, *tree; in audit_add_tree_rule() local
815 rule->tree = tree; in audit_add_tree_rule()
820 tree = seed; in audit_add_tree_rule()
[all …]
A Dauditfilter.c615 if (entry->rule.tree) in audit_data_to_entry()
852 new->tree = old->tree; in audit_dupe_rule()
944 struct audit_tree *tree = entry->rule.tree; in audit_add_rule() local
965 if (tree) in audit_add_rule()
966 audit_put_tree(tree); in audit_add_rule()
979 if (tree) in audit_add_rule()
980 audit_put_tree(tree); in audit_add_rule()
984 if (tree) { in audit_add_rule()
1027 struct audit_tree *tree = entry->rule.tree; in audit_del_rule() local
1052 if (e->rule.tree) in audit_del_rule()
[all …]
A Daudit.h292 struct audit_tree *tree);
298 extern const char *audit_tree_path(struct audit_tree *tree);
299 extern void audit_put_tree(struct audit_tree *tree);
328 #define audit_put_tree(tree) do { } while (0) argument
A Dauditsc.c310 static int match_tree_refs(struct audit_context *ctx, struct audit_tree *tree) in match_tree_refs() argument
315 if (!tree) in match_tree_refs()
320 if (audit_tree_match(p->c[n], tree)) in match_tree_refs()
326 if (audit_tree_match(p->c[n], tree)) in match_tree_refs()
643 result = match_tree_refs(ctx, rule->tree); in audit_filter_rules()
A Daudit_watch.c189 krule->inode_f || krule->watch || krule->tree) in audit_to_watch()
/kernel/module/
A 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()
103 struct module *mod_find(unsigned long addr, struct mod_tree_root *tree) in mod_find() argument
107 ltn = latch_tree_find((void *)addr, &tree->root, &mod_tree_ops); in mod_find()
A Dinternal.h311 struct module *mod_find(unsigned long addr, struct mod_tree_root *tree);
317 static inline struct module *mod_find(unsigned long addr, struct mod_tree_root *tree) in mod_find() argument
A Dmain.c98 unsigned int size, struct mod_tree_root *tree) in __mod_update_bounds() argument
105 if (min < tree->data_addr_min) in __mod_update_bounds()
106 tree->data_addr_min = min; in __mod_update_bounds()
107 if (max > tree->data_addr_max) in __mod_update_bounds()
108 tree->data_addr_max = max; in __mod_update_bounds()
112 if (min < tree->addr_min) in __mod_update_bounds()
113 tree->addr_min = min; in __mod_update_bounds()
114 if (max > tree->addr_max) in __mod_update_bounds()
115 tree->addr_max = max; in __mod_update_bounds()
A DKconfig446 If unsure, or if you need to build out-of-tree modules, say N.
456 exported at all times, even in absence of in-tree users. The value to
459 source or obj tree.
/kernel/locking/
A Drtmutex.c368 waiter->tree.prio = __waiter_prio(task); in waiter_update_prio()
369 waiter->tree.deadline = task->dl.deadline; in waiter_update_prio()
382 waiter->pi_tree.prio = waiter->tree.prio; in waiter_clone_prio()
383 waiter->pi_tree.deadline = waiter->tree.deadline; in waiter_clone_prio()
433 if (rt_waiter_node_less(&waiter->tree, &top_waiter->tree)) in rt_mutex_steal()
441 if (rt_or_dl_prio(waiter->tree.prio)) in rt_mutex_steal()
444 return rt_waiter_node_equal(&waiter->tree, &top_waiter->tree); in rt_mutex_steal()
458 if (rt_waiter_node_less(&aw->tree, &bw->tree)) in __waiter_less()
464 if (rt_waiter_node_less(&bw->tree, &aw->tree)) in __waiter_less()
492 if (RB_EMPTY_NODE(&waiter->tree.entry)) in rt_mutex_dequeue()
[all …]
A Drtmutex_common.h53 struct rt_waiter_node tree; member
126 return rb_entry(leftmost, struct rt_mutex_waiter, tree.entry) == waiter; in rt_mutex_waiter_is_top_waiter()
137 w = rb_entry(leftmost, struct rt_mutex_waiter, tree.entry); in rt_mutex_top_waiter()
216 RB_CLEAR_NODE(&waiter->tree.entry); in rt_mutex_init_waiter()
A Dww_mutex.h99 return rb_entry(n, struct rt_mutex_waiter, tree.entry); in __ww_waiter_first()
105 struct rb_node *n = rb_next(&w->tree.entry); in __ww_waiter_next()
108 return rb_entry(n, struct rt_mutex_waiter, tree.entry); in __ww_waiter_next()
114 struct rb_node *n = rb_prev(&w->tree.entry); in __ww_waiter_prev()
117 return rb_entry(n, struct rt_mutex_waiter, tree.entry); in __ww_waiter_prev()
126 return rb_entry(n, struct rt_mutex_waiter, tree.entry); in __ww_waiter_last()
A Drtmutex_api.c486 if (!waiter || rt_waiter_node_equal(&waiter->tree, task_to_waiter_node(task))) { in rt_mutex_adjust_pi()
/kernel/configs/
A Dx86_debug.config1 # Help: Debugging options for tip tree testing
/kernel/rcu/
A DMakefile16 obj-$(CONFIG_TREE_RCU) += tree.o
A DKconfig151 making these warnings mandatory for the tree variants.
/kernel/events/
A Dcore.c1655 groups->tree = RB_ROOT; in perf_event_groups_init()
1777 rb_add(&event->group_node, &groups->tree, __group_less); in perf_event_groups_insert()
1800 RB_EMPTY_ROOT(&groups->tree)); in perf_event_groups_delete()
1802 rb_erase(&event->group_node, &groups->tree); in perf_event_groups_delete()
1832 node = rb_find_first(&key, &groups->tree, __group_cmp); in perf_event_groups_first()
1864 for (event = rb_entry_safe(rb_first(&((groups)->tree)), \
4139 if (!RB_EMPTY_ROOT(&ctx->pinned_groups.tree)) { in perf_event_context_sched_in()
4148 if (!RB_EMPTY_ROOT(&ctx->pinned_groups.tree)) in perf_event_context_sched_in()
4396 struct rb_root *tree; in ctx_event_to_rotate() local
4408 tree = &pmu_ctx->ctx->flexible_groups.tree; in ctx_event_to_rotate()
[all …]

Completed in 65 milliseconds