| /tools/lib/ |
| D | rbtree.c | 78 struct rb_node *parent = rb_parent(old); in __rb_rotate_set_parents() local
81 __rb_change_child(old, new, parent, root); in __rb_rotate_set_parents()
88 struct rb_node *parent = rb_red_parent(node), *gparent, *tmp; in __rb_insert() local
94 if (unlikely(!parent)) { in __rb_insert()
110 if(rb_is_black(parent)) in __rb_insert()
113 gparent = rb_red_parent(parent); in __rb_insert()
116 if (parent != tmp) { /* parent == gparent->rb_left */ in __rb_insert()
132 rb_set_parent_color(parent, gparent, RB_BLACK); in __rb_insert()
134 parent = rb_parent(node); in __rb_insert()
135 rb_set_parent_color(node, parent, RB_RED); in __rb_insert()
[all …]
|
| /tools/testing/selftests/cgroup/ |
| D | test_kmem.c | 125 static int cg_run_in_subcgroups(const char *parent, in cg_run_in_subcgroups() argument
133 child = cg_name_indexed(parent, "child", i); in cg_run_in_subcgroups()
167 char *parent; in test_kmem_memcg_deletion() local
169 parent = cg_name(root, "kmem_memcg_deletion_test"); in test_kmem_memcg_deletion()
170 if (!parent) in test_kmem_memcg_deletion()
173 if (cg_create(parent)) in test_kmem_memcg_deletion()
176 if (cg_write(parent, "cgroup.subtree_control", "+memory")) in test_kmem_memcg_deletion()
179 if (cg_run_in_subcgroups(parent, alloc_kmem_smp, NULL, 100)) in test_kmem_memcg_deletion()
182 current = cg_read_long(parent, "memory.current"); in test_kmem_memcg_deletion()
183 slab = cg_read_key_long(parent, "memory.stat", "slab "); in test_kmem_memcg_deletion()
[all …]
|
| D | test_memcontrol.c | 29 char *parent, *child, *parent2 = NULL, *child2 = NULL; in test_memcg_subtree_control() local
34 parent = cg_name(root, "memcg_test_0"); in test_memcg_subtree_control()
36 if (!parent || !child) in test_memcg_subtree_control()
39 if (cg_create(parent)) in test_memcg_subtree_control()
42 if (cg_write(parent, "cgroup.subtree_control", "+memory")) in test_memcg_subtree_control()
81 cg_destroy(parent); in test_memcg_subtree_control()
83 free(parent); in test_memcg_subtree_control()
267 char *parent[3] = {NULL}; in test_memcg_min() local
277 parent[0] = cg_name(root, "memcg_test_0"); in test_memcg_min()
278 if (!parent[0]) in test_memcg_min()
[all …]
|
| D | test_core.c | 276 char *grandparent = NULL, *parent = NULL, *child = NULL; in test_cgcore_invalid_domain() local
279 parent = cg_name(root, "cg_test_grandparent/cg_test_parent"); in test_cgcore_invalid_domain()
281 if (!parent || !child || !grandparent) in test_cgcore_invalid_domain()
287 if (cg_create(parent)) in test_cgcore_invalid_domain()
293 if (cg_write(parent, "cgroup.type", "threaded")) in test_cgcore_invalid_domain()
321 if (parent) in test_cgcore_invalid_domain()
322 cg_destroy(parent); in test_cgcore_invalid_domain()
326 free(parent); in test_cgcore_invalid_domain()
338 char *parent = NULL, *child = NULL; in test_cgcore_parent_becomes_threaded() local
340 parent = cg_name(root, "cg_test_parent"); in test_cgcore_parent_becomes_threaded()
[all …]
|
| D | test_freezer.c | 459 char *parent, *child = NULL; in test_cgfreezer_mkdir() local
462 parent = cg_name(root, "cg_test_mkdir_A"); in test_cgfreezer_mkdir()
463 if (!parent) in test_cgfreezer_mkdir()
466 child = cg_name(parent, "cg_test_mkdir_B"); in test_cgfreezer_mkdir()
470 if (cg_create(parent)) in test_cgfreezer_mkdir()
473 if (cg_freeze_wait(parent, true)) in test_cgfreezer_mkdir()
489 if (cg_check_frozen(parent, true)) in test_cgfreezer_mkdir()
498 if (parent) in test_cgfreezer_mkdir()
499 cg_destroy(parent); in test_cgfreezer_mkdir()
500 free(parent); in test_cgfreezer_mkdir()
[all …]
|
| /tools/perf/util/ |
| D | call-path.c | 14 static void call_path__init(struct call_path *cp, struct call_path *parent, in call_path__init() argument
17 cp->parent = parent; in call_path__init()
50 struct call_path *parent, in call_path__new() argument
72 call_path__init(cp, parent, sym, ip, in_kernel); in call_path__new()
78 struct call_path *parent, in call_path__findnew() argument
89 if (!parent) in call_path__findnew()
90 return call_path__new(cpr, parent, sym, ip, in_kernel); in call_path__findnew()
92 p = &parent->children.rb_node; in call_path__findnew()
106 cp = call_path__new(cpr, parent, sym, ip, in_kernel); in call_path__findnew()
111 rb_insert_color(&cp->rb_node, &parent->children); in call_path__findnew()
|
| D | rblist.c | 16 struct rb_node *parent = NULL, *new_node; in rblist__add_node() local
22 parent = *p; in rblist__add_node()
24 rc = rblist->node_cmp(parent, new_entry); in rblist__add_node()
39 rb_link_node(new_node, parent, p); in rblist__add_node()
58 struct rb_node *parent = NULL, *new_node = NULL; in __rblist__findnew() local
64 parent = *p; in __rblist__findnew()
66 rc = rblist->node_cmp(parent, entry); in __rblist__findnew()
74 return parent; in __rblist__findnew()
80 rb_link_node(new_node, parent, p); in __rblist__findnew()
|
| D | block-range.c | 36 struct rb_node *parent = NULL; in block_range__find() local
40 parent = *p; in block_range__find()
41 entry = rb_entry(parent, struct block_range, node); in block_range__find()
44 p = &parent->rb_left; in block_range__find()
46 p = &parent->rb_right; in block_range__find()
84 struct rb_node *n, *parent = NULL; in block_range__create() local
89 parent = *p; in block_range__create()
90 entry = rb_entry(parent, struct block_range, node); in block_range__create()
93 p = &parent->rb_left; in block_range__create()
95 p = &parent->rb_right; in block_range__create()
[all …]
|
| D | mem2node.c | 21 struct rb_node *parent = NULL; in phys_entry__insert() local
25 parent = *p; in phys_entry__insert()
26 e = rb_entry(parent, struct phys_entry, rb_node); in phys_entry__insert()
34 rb_link_node(&entry->rb_node, parent, p); in phys_entry__insert()
120 struct rb_node **p, *parent = NULL; in mem2node__node() local
125 parent = *p; in mem2node__node()
126 entry = rb_entry(parent, struct phys_entry, rb_node); in mem2node__node()
|
| D | callchain.c | 376 struct rb_node *parent = NULL; in rb_insert_callchain() local
383 parent = *p; in rb_insert_callchain()
384 rnode = rb_entry(parent, struct callchain_node, rb_node); in rb_insert_callchain()
408 rb_link_node(&chain->rb_node, parent, p); in rb_insert_callchain()
526 create_child(struct callchain_node *parent, bool inherit_children) in create_child() argument
535 new->parent = parent; in create_child()
543 new->rb_root_in = parent->rb_root_in; in create_child()
544 parent->rb_root_in = RB_ROOT; in create_child()
549 child->parent = new; in create_child()
554 rb_link_node(&new->rb_node_in, NULL, &parent->rb_root_in.rb_node); in create_child()
[all …]
|
| D | expr.h | 18 struct expr_id *parent; member
23 struct expr_id *parent; member
34 struct expr_id *parent; member
|
| D | hist.c | 112 if (h->parent) in hists__calc_col_len()
113 hists__new_col_len(hists, HISTC_PARENT, h->parent->namelen); in hists__calc_col_len()
562 static u8 symbol__parent_filter(const struct symbol *parent) in symbol__parent_filter() argument
564 if (symbol_conf.exclude_other && parent == NULL) in symbol__parent_filter()
585 struct rb_node *parent = NULL; in hists__findnew_entry() local
595 parent = *p; in hists__findnew_entry()
596 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__findnew_entry()
651 rb_link_node(&he->rb_node_in, parent, p); in hists__findnew_entry()
723 .parent = sym_parent, in __hists__add_entry()
838 he = hists__add_entry(hists, al, iter->parent, NULL, mi, in iter_add_single_mem_entry()
[all …]
|
| D | thread.c | 376 static int thread__clone_maps(struct thread *thread, struct thread *parent, bool do_maps_clone) in thread__clone_maps() argument
379 if (thread->pid_ == parent->pid_) in thread__clone_maps()
382 if (thread->maps == parent->maps) { in thread__clone_maps()
384 thread->pid_, thread->tid, parent->pid_, parent->tid); in thread__clone_maps()
388 return do_maps_clone ? maps__clone(thread, parent->maps) : 0; in thread__clone_maps()
391 int thread__fork(struct thread *thread, struct thread *parent, u64 timestamp, bool do_maps_clone) in thread__fork() argument
393 if (parent->comm_set) { in thread__fork()
394 const char *comm = thread__comm_str(parent); in thread__fork()
403 thread->ppid = parent->tid; in thread__fork()
404 return thread__clone_maps(thread, parent, do_maps_clone); in thread__fork()
|
| D | comm.c | 64 struct rb_node *parent = NULL; in __comm_str__findnew() local
69 parent = *p; in __comm_str__findnew()
70 iter = rb_entry(parent, struct comm_str, rb_node); in __comm_str__findnew()
91 rb_link_node(&new->rb_node, parent, p); in __comm_str__findnew()
|
| D | call-path.h | 29 struct call_path *parent; member
65 struct call_path *parent,
|
| D | rb_resort.h | 79 struct rb_node **p = &sorted->entries.rb_node, *parent = NULL; \
81 parent = *p; \
82 if (__name##_sorted__cmp(sorted_nd, parent)) \
87 rb_link_node(sorted_nd, parent, p); \
|
| D | metricgroup.c | 691 struct expr_id *parent, in __add_metric() argument
715 parent = expr_ids__alloc(ids); in __add_metric()
716 if (!parent) { in __add_metric()
721 parent->id = strdup(pe->metric_name); in __add_metric()
722 if (!parent->id) { in __add_metric()
753 WARN_ON_ONCE(!parent); in __add_metric()
754 m->pctx.parent = parent; in __add_metric()
819 static int recursion_check(struct metric *m, const char *id, struct expr_id **parent, in recursion_check() argument
836 p = data->parent; in recursion_check()
838 while (p->parent) { in recursion_check()
[all …]
|
| /tools/include/linux/ |
| D | rbtree_augmented.h | 172 struct rb_node *parent, struct rb_root *root) in __rb_change_child() argument
174 if (parent) { in __rb_change_child()
175 if (parent->rb_left == old) in __rb_change_child()
176 WRITE_ONCE(parent->rb_left, new); in __rb_change_child()
178 WRITE_ONCE(parent->rb_right, new); in __rb_change_child()
183 extern void __rb_erase_color(struct rb_node *parent, struct rb_root *root,
192 struct rb_node *parent, *rebalance; in __rb_erase_augmented() local
204 parent = __rb_parent(pc); in __rb_erase_augmented()
205 __rb_change_child(node, child, parent, root); in __rb_erase_augmented()
210 rebalance = __rb_is_black(pc) ? parent : NULL; in __rb_erase_augmented()
[all …]
|
| /tools/perf/Documentation/ |
| D | asciidoctor-extensions.rb | 11 def process(parent, target, attrs) argument
12 if parent.document.basebackend? 'html'
14 elsif parent.document.basebackend? 'manpage'
16 elsif parent.document.basebackend? 'docbook'
|
| /tools/testing/nvdimm/test/ |
| D | iomap.c | 222 struct resource *parent, resource_size_t start,
242 struct resource *parent, resource_size_t start, in nfit_test_release_region() argument
245 if (parent == &iomem_resource) { in nfit_test_release_region()
279 struct resource *parent, resource_size_t start, in nfit_test_request_region() argument
284 if (parent == &iomem_resource) { in nfit_test_request_region()
320 res->flags = resource_type(parent); in nfit_test_request_region()
343 return __devm_request_region(dev, parent, start, n, name); in nfit_test_request_region()
344 return __request_region(parent, start, n, name, flags); in nfit_test_request_region()
347 struct resource *__wrap___request_region(struct resource *parent, in __wrap___request_region() argument
351 return nfit_test_request_region(NULL, parent, start, n, name, flags); in __wrap___request_region()
[all …]
|
| /tools/testing/selftests/x86/ |
| D | mov_ss_trap.c | 54 pid_t parent = getpid(); in enable_watchpoint() local
74 if (ptrace(PTRACE_ATTACH, parent, NULL, NULL) != 0) in enable_watchpoint()
77 if (waitpid(parent, &status, 0) != parent) in enable_watchpoint()
80 if (ptrace(PTRACE_POKEUSER, parent, (void *)offsetof(struct user, u_debugreg[0]), dr0) != 0) in enable_watchpoint()
83 if (ptrace(PTRACE_POKEUSER, parent, (void *)offsetof(struct user, u_debugreg[1]), dr1) != 0) in enable_watchpoint()
86 if (ptrace(PTRACE_POKEUSER, parent, (void *)offsetof(struct user, u_debugreg[7]), dr7) != 0) in enable_watchpoint()
91 if (ptrace(PTRACE_DETACH, parent, NULL, NULL) != 0) in enable_watchpoint()
|
| /tools/testing/selftests/kvm/lib/ |
| D | sparsebit.c | 169 struct node *parent; member
237 while (nodep->parent && nodep == nodep->parent->right) in node_next()
238 nodep = nodep->parent; in node_next()
240 return nodep->parent; in node_next()
265 while (nodep->parent && nodep == nodep->parent->left) in node_prev()
266 nodep = nodep->parent; in node_prev()
268 return (struct node *) nodep->parent; in node_prev()
294 root->left->parent = root; in node_copy_subtree()
299 root->right->parent = root; in node_copy_subtree()
361 nodep->parent = parentp; in node_add()
[all …]
|
| /tools/lib/traceevent/plugins/ |
| D | plugin_function.c | 82 static int add_and_get_index(const char *parent, const char *child, int cpu) in add_and_get_index() argument
107 if (strcmp(parent, fstack[cpu].stack[i]) == 0) { in add_and_get_index()
114 add_child(&fstack[cpu], parent, 0); in add_and_get_index()
138 const char *parent; in function_handler() local
149 parent = tep_find_function(tep, pfunction); in function_handler()
151 if (parent && ftrace_indent->set) in function_handler()
152 index = add_and_get_index(parent, func, record->cpu); in function_handler()
163 if (parent) in function_handler()
164 show_function(s, tep, parent, pfunction); in function_handler()
|
| /tools/testing/selftests/drivers/net/mlxsw/ |
| D | sch_red_ets.sh | 30 tc qdisc add dev $swp3 parent 10:8 handle 108: red \
33 tc qdisc add dev $swp3 parent 10:7 handle 107: red \
41 tc qdisc del dev $swp3 parent 10:7
42 tc qdisc del dev $swp3 parent 10:8
|
| /tools/perf/scripts/python/ |
| D | exported-sql-viewer.py | 193 def __init__(self, task, param=None, parent=None): argument
194 super(Thread, self).__init__(parent)
212 def __init__(self, glb, params, parent=None): argument
213 super(TreeModel, self).__init__(parent)
219 def Item(self, parent): argument
220 if parent.isValid():
221 return parent.internalPointer()
225 def rowCount(self, parent): argument
226 result = self.Item(parent).childCount()
229 self.dataChanged.emit(parent, parent)
[all …]
|