| /tools/lib/ |
| D | rbtree.c | 154 tmp = node->rb_left; in __rb_insert()
156 WRITE_ONCE(node->rb_left, parent); in __rb_insert()
176 WRITE_ONCE(gparent->rb_left, tmp); /* == parent->rb_right */ in __rb_insert()
184 tmp = gparent->rb_left; in __rb_insert()
195 tmp = parent->rb_left; in __rb_insert()
199 WRITE_ONCE(parent->rb_left, tmp); in __rb_insert()
207 tmp = node->rb_left; in __rb_insert()
212 WRITE_ONCE(parent->rb_left, gparent); in __rb_insert()
252 tmp1 = sibling->rb_left; in ____rb_erase_color()
254 WRITE_ONCE(sibling->rb_left, parent); in ____rb_erase_color()
[all …]
|
| /tools/include/linux/ |
| D | rbtree_augmented.h | 128 if (node->RBFIELD.rb_left) { \
129 child = rb_entry(node->RBFIELD.rb_left, RBSTRUCT, RBFIELD); \
175 if (parent->rb_left == old) in __rb_change_child()
176 WRITE_ONCE(parent->rb_left, new); in __rb_change_child()
191 struct rb_node *tmp = node->rb_left; in __rb_erase_augmented()
222 tmp = child->rb_left; in __rb_erase_augmented()
255 tmp = tmp->rb_left; in __rb_erase_augmented()
258 WRITE_ONCE(parent->rb_left, child2); in __rb_erase_augmented()
266 tmp = node->rb_left; in __rb_erase_augmented()
267 WRITE_ONCE(successor->rb_left, tmp); in __rb_erase_augmented()
|
| D | rbtree.h | 26 struct rb_node *rb_left; member
70 node->rb_left = node->rb_right = NULL; in rb_link_node()
|
| /tools/perf/util/ |
| D | block-range.c | 44 p = &parent->rb_left; in block_range__find()
56 struct rb_node **p = &node->rb_left; in rb_link_left_of_node()
69 p = &node->rb_left; in rb_link_right_of_node()
93 p = &parent->rb_left; in block_range__create()
|
| D | rblist.c | 26 p = &(*p)->rb_left; in rblist__add_node()
68 p = &(*p)->rb_left; in __rblist__findnew()
|
| D | mem2node.c | 28 p = &(*p)->rb_left; in phys_entry__insert()
127 p = &(*p)->rb_left; in mem2node__node()
|
| D | env.c | 31 p = &(*p)->rb_left; in perf_env__insert_bpf_prog_info()
59 n = n->rb_left; in perf_env__find_bpf_prog_info()
86 p = &(*p)->rb_left; in perf_env__insert_btf()
113 n = n->rb_left; in perf_env__find_btf()
|
| D | srcline.c | 620 p = &(*p)->rb_left; in srcline__tree_insert()
639 n = n->rb_left; in srcline__tree_find()
704 p = &(*p)->rb_left; in inlines__tree_insert()
723 n = n->rb_left; in inlines__tree_find()
|
| D | comm.c | 82 p = &(*p)->rb_left; in __comm_str__findnew()
|
| D | call-path.c | 101 p = &(*p)->rb_left; in call_path__findnew()
|
| D | rb_resort.h | 83 p = &(*p)->rb_left; \
|
| D | dsos.c | 77 p = &parent->rb_left; in __dsos__findnew_link_by_longname()
|
| D | map.c | 796 next = next->rb_left; in maps__fixup_overlappings()
922 p = &(*p)->rb_left; in __maps__insert()
944 p = &(*p)->rb_left; in __maps__insert_name()
988 p = p->rb_left; in maps__find()
|
| D | hist.c | 621 p = &(*p)->rb_left; in hists__findnew_entry()
1424 p = &parent->rb_left; in hierarchy_insert_entry()
1551 p = &(*p)->rb_left; in hists__collapse_insert_entry()
1714 p = &parent->rb_left; in hierarchy_insert_output_entry()
1814 p = &(*p)->rb_left; in __hists__insert_output_entry()
2125 p = &(*p)->rb_left; in resort_filtered_entry()
2303 p = &(*p)->rb_left; in hists__add_dummy_entry()
2351 p = &parent->rb_left; in add_dummy_hierarchy_entry()
2387 n = n->rb_left; in hists__find_entry()
2415 n = n->rb_left; in hists__find_hierarchy_entry()
|
| D | symbol.c | 341 p = &(*p)->rb_left; in __symbols__insert()
369 n = n->rb_left; in symbols__find()
422 p = &(*p)->rb_left; in symbols__insert_by_name()
479 n = n->rb_left; in symbols__find_by_name()
935 p = &(*p)->rb_left; in add_module()
969 n = n->rb_left; in find_module()
1802 node = node->rb_left; in map_groups__find_by_name()
|
| D | callchain.c | 391 p = &(*p)->rb_left; in rb_insert_callchain()
398 p = &(*p)->rb_left; in rb_insert_callchain()
848 pp = &p->rb_left; in split_add_child()
895 p = &parent->rb_left; in append_chain_children()
|
| D | dso.c | 786 p = &(*p)->rb_left; in dso_cache__find()
814 p = &(*p)->rb_left; in dso_cache__insert()
|
| D | machine.c | 280 p = &(*p)->rb_left; in machines__add()
320 p = &(*p)->rb_left; in machines__find()
518 p = &(*p)->rb_left; in ____machine__findnew_thread()
|
| D | annotate.c | 2137 p = &(*p)->rb_left; in insert_source_line()
2175 p = &(*p)->rb_left; in __resort_source_line()
|
| /tools/perf/ |
| D | builtin-lock.c | 134 node = node->rb_left; in thread_stat_find()
153 rb = &(*rb)->rb_left; in thread_stat_insert()
294 rb = &(*rb)->rb_left; in insert_to_result()
311 while (node->rb_left) in pop_from_result()
312 node = node->rb_left; in pop_from_result()
|
| D | builtin-kmem.c | 99 node = &(*node)->rb_left; in insert_alloc_stat()
144 node = &(*node)->rb_left; in insert_caller_stat()
226 node = node->rb_left; in search_alloc_stat()
456 node = &parent->rb_left; in __page_stat__findnew_page()
511 node = &parent->rb_left; in __page_stat__findnew_alloc()
566 node = &parent->rb_left; in __page_stat__findnew_caller()
1274 new = &((*new)->rb_left); in sort_slab_insert()
1321 new = &parent->rb_left; in sort_page_insert()
|
| D | builtin-sched.c | 974 node = node->rb_left; in thread_atoms_search()
1002 new = &((*new)->rb_left); in __thread_latency_insert()
3099 new = &((*new)->rb_left); in __merge_work_atoms()
|
| D | builtin-kvm.c | 519 rb = &(*rb)->rb_left; in insert_to_result()
|
| /tools/lib/lockdep/ |
| D | preload.c | 113 node = &l->node.rb_left; in __get_lock_node()
|
| /tools/perf/ui/browsers/ |
| D | annotate.c | 257 p = &(*p)->rb_left; in disasm_rb_tree__insert()
|