Home
last modified time | relevance | path

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

/tools/lib/
A Drbtree.c154 tmp = node->rb_left; in __rb_insert()
195 tmp = parent->rb_left; in __rb_insert()
207 tmp = node->rb_left; in __rb_insert()
469 while (n->rb_left) in rb_first()
470 n = n->rb_left; in rb_first()
499 while (node->rb_left) in rb_next()
500 node = node->rb_left; in rb_next()
528 if (node->rb_left) { in rb_prev()
529 node = node->rb_left; in rb_prev()
554 if (victim->rb_left) in rb_replace_node()
[all …]
/tools/include/linux/
A Drbtree_augmented.h128 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()
A Drbtree.h26 struct rb_node *rb_left; member
70 node->rb_left = node->rb_right = NULL; in rb_link_node()
188 link = &parent->rb_left; in rb_add_cached()
215 link = &parent->rb_left; in rb_add()
246 link = &parent->rb_left; in rb_find_add()
276 node = node->rb_left; in rb_find()
307 node = node->rb_left; in rb_find_first()
A Dinterval_tree_generic.h52 link = &parent->ITRB.rb_left; \
88 if (node->ITRB.rb_left) { \
89 ITSTRUCT *left = rb_entry(node->ITRB.rb_left, \
/tools/perf/util/
A Dblock-range.c40 p = &parent->rb_left; in block_range__find()
52 struct rb_node **p = &node->rb_left; in rb_link_left_of_node()
65 p = &node->rb_left; in rb_link_right_of_node()
89 p = &parent->rb_left; in block_range__create()
A Drblist.c26 p = &(*p)->rb_left; in rblist__add_node()
68 p = &(*p)->rb_left; in __rblist__findnew()
A Dmem2node.c29 p = &(*p)->rb_left; in phys_entry__insert()
129 p = &(*p)->rb_left; in mem2node__node()
A Dcall-path.c101 p = &(*p)->rb_left; in call_path__findnew()
A Denv.c52 p = &(*p)->rb_left; in __perf_env__insert_bpf_prog_info()
79 n = n->rb_left; in perf_env__find_bpf_prog_info()
129 p = &(*p)->rb_left; in __perf_env__insert_btf()
164 n = n->rb_left; in __perf_env__find_btf()
A Dsrcline.c997 p = &(*p)->rb_left; in srcline__tree_insert()
1016 n = n->rb_left; in srcline__tree_find()
1081 p = &(*p)->rb_left; in inlines__tree_insert()
1100 n = n->rb_left; in inlines__tree_find()
A Dhist.c738 p = &(*p)->rb_left; in hists__findnew_entry()
1649 p = &parent->rb_left; in hierarchy_insert_entry()
1791 p = &(*p)->rb_left; in hists__collapse_insert_entry()
1946 p = &parent->rb_left; in hierarchy_insert_output_entry()
2046 p = &(*p)->rb_left; in __hists__insert_output_entry()
2367 p = &(*p)->rb_left; in resort_filtered_entry()
2570 p = &(*p)->rb_left; in hists__add_dummy_entry()
2612 p = &parent->rb_left; in add_dummy_hierarchy_entry()
2648 n = n->rb_left; in hists__find_entry()
2670 n = n->rb_left; in hists__find_hierarchy_entry()
A Dcallchain.c398 p = &(*p)->rb_left; in rb_insert_callchain()
405 p = &(*p)->rb_left; in rb_insert_callchain()
872 pp = &p->rb_left; in split_add_child()
919 p = &parent->rb_left; in append_chain_children()
A Dsymbol.c386 p = &(*p)->rb_left; in __symbols__insert()
414 n = n->rb_left; in symbols__find()
1048 p = &(*p)->rb_left; in add_module()
1082 n = n->rb_left; in find_module()
A Dcgroup.c529 p = &(*p)->rb_left; in __cgroup__findnew()
A Ddso.c916 p = &(*p)->rb_left; in __dso_cache__find()
944 p = &(*p)->rb_left; in dso_cache__insert()
A Dannotate.c1084 p = &(*p)->rb_left; in insert_source_line()
1122 p = &(*p)->rb_left; in __resort_source_line()
A Dmachine.c264 p = &(*p)->rb_left; in machines__add()
306 p = &(*p)->rb_left; in machines__find()
A Dintel-pt.c334 p = &(*p)->rb_left; in intel_pt_findnew_vmcs()
/tools/perf/
A Dbuiltin-kmem.c101 node = &(*node)->rb_left; in insert_alloc_stat()
146 node = &(*node)->rb_left; in insert_caller_stat()
237 node = node->rb_left; in search_alloc_stat()
476 node = &parent->rb_left; in __page_stat__findnew_page()
531 node = &parent->rb_left; in __page_stat__findnew_alloc()
586 node = &parent->rb_left; in __page_stat__findnew_caller()
1284 new = &((*new)->rb_left); in sort_slab_insert()
1331 new = &parent->rb_left; in sort_page_insert()
A Dbuiltin-lock.c81 node = node->rb_left; in thread_stat_find()
100 rb = &(*rb)->rb_left; in thread_stat_insert()
414 rb = &(*rb)->rb_left; in combine_lock_stats()
435 rb = &(*rb)->rb_left; in insert_to()
460 while (node->rb_left) in pop_from()
461 node = node->rb_left; in pop_from()
A Dbuiltin-kwork.c322 node = node->rb_left; in work_search()
348 new = &((*new)->rb_left); in work_insert()
A Dbuiltin-sched.c993 node = node->rb_left; in thread_atoms_search()
1021 new = &((*new)->rb_left); in __thread_latency_insert()
3442 new = &((*new)->rb_left); in __merge_work_atoms()
/tools/bpf/resolve_btfids/
A Dmain.c188 p = p->rb_left; in btf_id__find()
210 p = &(*p)->rb_left; in btf_id__add()
/tools/testing/selftests/kvm/lib/
A Dkvm_util.c726 node = node->rb_left; in userspace_mem_region_find()
893 cur = &(*cur)->rb_left; in vm_userspace_mem_region_gpa_insert()
918 cur = &(*cur)->rb_left; in vm_userspace_mem_region_hva_insert()
1688 node = node->rb_left; in addr_hva2gpa()
/tools/perf/ui/browsers/
A Dannotate.c261 p = &(*p)->rb_left; in disasm_rb_tree__insert()

Completed in 83 milliseconds