| /tools/lib/ |
| D | rbtree.c | 115 tmp = gparent->rb_right; in __rb_insert()
139 tmp = parent->rb_right; in __rb_insert()
155 WRITE_ONCE(parent->rb_right, tmp); in __rb_insert()
163 tmp = node->rb_right; in __rb_insert()
177 WRITE_ONCE(parent->rb_right, gparent); in __rb_insert()
198 tmp = node->rb_right; in __rb_insert()
200 WRITE_ONCE(node->rb_right, parent); in __rb_insert()
211 WRITE_ONCE(gparent->rb_right, tmp); /* == parent->rb_left */ in __rb_insert()
240 sibling = parent->rb_right; in ____rb_erase_color()
253 WRITE_ONCE(parent->rb_right, tmp1); in ____rb_erase_color()
[all …]
|
| /tools/include/linux/ |
| D | interval_tree_generic.h | 54 link = &parent->ITRB.rb_right; \
107 if (node->ITRB.rb_right) { \
108 node = rb_entry(node->ITRB.rb_right, \
154 struct rb_node *rb = node->ITRB.rb_right, *prev; \
178 rb = node->ITRB.rb_right; \
|
| D | rbtree.h | 25 struct rb_node *rb_right; member
70 node->rb_left = node->rb_right = NULL; in rb_link_node()
190 link = &parent->rb_right; in rb_add_cached()
217 link = &parent->rb_right; in rb_add()
248 link = &parent->rb_right; in rb_find_add()
278 node = node->rb_right; in rb_find()
309 node = node->rb_right; in rb_find_first()
|
| D | rbtree_augmented.h | 133 if (node->RBFIELD.rb_right) { \
134 child = rb_entry(node->RBFIELD.rb_right, RBSTRUCT, RBFIELD); \
178 WRITE_ONCE(parent->rb_right, new); in __rb_change_child()
190 struct rb_node *child = node->rb_right; in __rb_erase_augmented()
234 child2 = successor->rb_right; in __rb_erase_augmented()
257 child2 = successor->rb_right; in __rb_erase_augmented()
259 WRITE_ONCE(successor->rb_right, child); in __rb_erase_augmented()
|
| /tools/perf/util/ |
| D | block-range.c | 42 p = &parent->rb_right; in block_range__find()
55 p = &node->rb_right; in rb_link_left_of_node()
62 struct rb_node **p = &node->rb_right; in rb_link_right_of_node()
91 p = &parent->rb_right; in block_range__create()
|
| D | rblist.c | 28 p = &(*p)->rb_right; in rblist__add_node()
70 p = &(*p)->rb_right; in __rblist__findnew()
|
| D | mem2node.c | 31 p = &(*p)->rb_right; in phys_entry__insert()
131 p = &(*p)->rb_right; in mem2node__node()
|
| D | env.c | 46 p = &(*p)->rb_right; in __perf_env__insert_bpf_prog_info()
72 n = n->rb_right; in perf_env__find_bpf_prog_info()
108 p = &(*p)->rb_right; in __perf_env__insert_btf()
143 n = n->rb_right; in __perf_env__find_btf()
|
| D | call-path.c | 103 p = &(*p)->rb_right; in call_path__findnew()
|
| D | comm.c | 84 p = &(*p)->rb_right; in __comm_str__findnew()
|
| D | rb_resort.h | 85 p = &(*p)->rb_right; \
|
| D | srcline.c | 939 p = &(*p)->rb_right; in srcline__tree_insert()
958 n = n->rb_right; in srcline__tree_find()
1023 p = &(*p)->rb_right; in inlines__tree_insert()
1042 n = n->rb_right; in inlines__tree_find()
|
| D | maps.c | 56 p = &(*p)->rb_right; in __maps__insert()
302 next = next->rb_right; in maps__fixup_overlappings()
444 p = p->rb_right; in maps__find()
|
| D | hist.c | 650 p = &(*p)->rb_right; in hists__findnew_entry()
1506 p = &parent->rb_right; in hierarchy_insert_entry()
1642 p = &(*p)->rb_right; in hists__collapse_insert_entry()
1805 p = &parent->rb_right; in hierarchy_insert_output_entry()
1905 p = &(*p)->rb_right; in __hists__insert_output_entry()
2216 p = &(*p)->rb_right; in resort_filtered_entry()
2404 p = &(*p)->rb_right; in hists__add_dummy_entry()
2452 p = &parent->rb_right; in add_dummy_hierarchy_entry()
2488 n = n->rb_right; in hists__find_entry()
2516 n = n->rb_right; in hists__find_hierarchy_entry()
|
| D | dsos.c | 169 p = &parent->rb_right; in __dsos__findnew_link_by_longname_id()
|
| D | callchain.c | 400 p = &(*p)->rb_right; in rb_insert_callchain()
407 p = &(*p)->rb_right; in rb_insert_callchain()
859 pp = &p->rb_right; in split_add_child()
906 p = &parent->rb_right; in append_chain_children()
|
| D | cgroup.c | 528 p = &(*p)->rb_right; in __cgroup__findnew()
|
| D | symbol.c | 344 p = &(*p)->rb_right; in __symbols__insert()
372 n = n->rb_right; in symbols__find()
999 p = &(*p)->rb_right; in add_module()
1033 n = n->rb_right; in find_module()
|
| D | dso.c | 870 p = &(*p)->rb_right; in __dso_cache__find()
898 p = &(*p)->rb_right; in dso_cache__insert()
|
| /tools/perf/ |
| D | builtin-kmem.c | 99 node = &(*node)->rb_right; in insert_alloc_stat()
144 node = &(*node)->rb_right; in insert_caller_stat()
239 node = node->rb_right; in search_alloc_stat()
478 node = &parent->rb_right; in __page_stat__findnew_page()
533 node = &parent->rb_right; in __page_stat__findnew_alloc()
588 node = &parent->rb_right; in __page_stat__findnew_caller()
1293 new = &((*new)->rb_right); in sort_slab_insert()
1340 new = &parent->rb_right; in sort_page_insert()
|
| D | builtin-lock.c | 99 node = node->rb_right; in thread_stat_find()
118 rb = &(*rb)->rb_right; in thread_stat_insert()
432 rb = &(*rb)->rb_right; in combine_lock_stats()
456 rb = &(*rb)->rb_right; in insert_to_result()
|
| D | builtin-kwork.c | 280 node = node->rb_right; in work_search()
306 new = &((*new)->rb_right); in work_insert()
|
| /tools/bpf/resolve_btfids/ |
| D | main.c | 189 p = p->rb_right; in btf_id__find()
211 p = &(*p)->rb_right; in btf_id__add()
|
| /tools/testing/selftests/kvm/lib/ |
| D | kvm_util.c | 587 node = node->rb_right; in userspace_mem_region_find()
844 cur = &(*cur)->rb_right; in vm_userspace_mem_region_gpa_insert()
869 cur = &(*cur)->rb_right; in vm_userspace_mem_region_hva_insert()
1524 node = node->rb_right; in addr_hva2gpa()
|
| /tools/perf/ui/browsers/ |
| D | annotate.c | 264 p = &(*p)->rb_right; in disasm_rb_tree__insert()
|