Home
last modified time | relevance | path

Searched refs:rb_right (Results 1 – 25 of 25) sorted by relevance

/tools/lib/
A Drbtree.c115 tmp = gparent->rb_right; in __rb_insert()
139 tmp = parent->rb_right; in __rb_insert()
163 tmp = node->rb_right; in __rb_insert()
198 tmp = node->rb_right; in __rb_insert()
481 while (n->rb_right) in rb_last()
482 n = n->rb_right; in rb_last()
497 if (node->rb_right) { in rb_next()
498 node = node->rb_right; in rb_next()
530 while (node->rb_right) in rb_prev()
531 node = node->rb_right; in rb_prev()
[all …]
/tools/include/linux/
A Dinterval_tree_generic.h54 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; \
A Drbtree.h25 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()
A Drbtree_augmented.h133 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/
A Dblock-range.c42 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()
A Drblist.c28 p = &(*p)->rb_right; in rblist__add_node()
70 p = &(*p)->rb_right; in __rblist__findnew()
A Dmem2node.c31 p = &(*p)->rb_right; in phys_entry__insert()
131 p = &(*p)->rb_right; in mem2node__node()
A Dcall-path.c103 p = &(*p)->rb_right; in call_path__findnew()
A Denv.c54 p = &(*p)->rb_right; in __perf_env__insert_bpf_prog_info()
81 n = n->rb_right; in perf_env__find_bpf_prog_info()
131 p = &(*p)->rb_right; in __perf_env__insert_btf()
166 n = n->rb_right; in __perf_env__find_btf()
A Dsrcline.c999 p = &(*p)->rb_right; in srcline__tree_insert()
1018 n = n->rb_right; in srcline__tree_find()
1083 p = &(*p)->rb_right; in inlines__tree_insert()
1102 n = n->rb_right; in inlines__tree_find()
A Dhist.c740 p = &(*p)->rb_right; in hists__findnew_entry()
1651 p = &parent->rb_right; in hierarchy_insert_entry()
1793 p = &(*p)->rb_right; in hists__collapse_insert_entry()
1948 p = &parent->rb_right; in hierarchy_insert_output_entry()
2048 p = &(*p)->rb_right; in __hists__insert_output_entry()
2369 p = &(*p)->rb_right; in resort_filtered_entry()
2572 p = &(*p)->rb_right; in hists__add_dummy_entry()
2614 p = &parent->rb_right; in add_dummy_hierarchy_entry()
2650 n = n->rb_right; in hists__find_entry()
2672 n = n->rb_right; in hists__find_hierarchy_entry()
A Dcallchain.c400 p = &(*p)->rb_right; in rb_insert_callchain()
407 p = &(*p)->rb_right; in rb_insert_callchain()
874 pp = &p->rb_right; in split_add_child()
921 p = &parent->rb_right; in append_chain_children()
A Dsymbol.c388 p = &(*p)->rb_right; in __symbols__insert()
416 n = n->rb_right; in symbols__find()
1050 p = &(*p)->rb_right; in add_module()
1084 n = n->rb_right; in find_module()
A Dcgroup.c531 p = &(*p)->rb_right; in __cgroup__findnew()
A Ddso.c918 p = &(*p)->rb_right; in __dso_cache__find()
946 p = &(*p)->rb_right; in dso_cache__insert()
A Dannotate.c1086 p = &(*p)->rb_right; in insert_source_line()
1124 p = &(*p)->rb_right; in __resort_source_line()
A Dmachine.c266 p = &(*p)->rb_right; in machines__add()
308 p = &(*p)->rb_right; in machines__find()
A Dintel-pt.c336 p = &(*p)->rb_right; in intel_pt_findnew_vmcs()
/tools/perf/
A Dbuiltin-kmem.c99 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()
1286 new = &((*new)->rb_right); in sort_slab_insert()
1333 new = &parent->rb_right; in sort_page_insert()
A Dbuiltin-lock.c83 node = node->rb_right; in thread_stat_find()
102 rb = &(*rb)->rb_right; in thread_stat_insert()
416 rb = &(*rb)->rb_right; in combine_lock_stats()
437 rb = &(*rb)->rb_right; in insert_to()
A Dbuiltin-kwork.c324 node = node->rb_right; in work_search()
350 new = &((*new)->rb_right); in work_insert()
A Dbuiltin-sched.c995 node = node->rb_right; in thread_atoms_search()
1023 new = &((*new)->rb_right); in __thread_latency_insert()
3444 new = &((*new)->rb_right); in __merge_work_atoms()
/tools/bpf/resolve_btfids/
A Dmain.c190 p = p->rb_right; in btf_id__find()
212 p = &(*p)->rb_right; in btf_id__add()
/tools/testing/selftests/kvm/lib/
A Dkvm_util.c728 node = node->rb_right; in userspace_mem_region_find()
899 cur = &(*cur)->rb_right; in vm_userspace_mem_region_gpa_insert()
924 cur = &(*cur)->rb_right; in vm_userspace_mem_region_hva_insert()
1686 node = node->rb_right; in addr_hva2gpa()
/tools/perf/ui/browsers/
A Dannotate.c263 p = &(*p)->rb_right; in disasm_rb_tree__insert()

Completed in 76 milliseconds