| /Linux-v5.4/tools/perf/tests/ |
| D | hists_output.c | 172 node = rb_next(node); in test1()
178 node = rb_next(node); in test1()
184 node = rb_next(node); in test1()
190 node = rb_next(node); in test1()
196 node = rb_next(node); in test1()
202 node = rb_next(node); in test1()
208 node = rb_next(node); in test1()
214 node = rb_next(node); in test1()
271 node = rb_next(node); in test2()
326 node = rb_next(node); in test3()
[all …]
|
| D | hists_common.c | 189 node = rb_next(node); in print_hists_in()
217 node = rb_next(node); in print_hists_out()
|
| /Linux-v5.4/net/ceph/ |
| D | debugfs.c | 69 for (n = rb_first(&map->pg_pools); n; n = rb_next(n)) { in osdmap_show()
90 for (n = rb_first(&map->pg_temp); n; n = rb_next(n)) { in osdmap_show()
101 for (n = rb_first(&map->primary_temp); n; n = rb_next(n)) { in osdmap_show()
108 for (n = rb_first(&map->pg_upmap); n; n = rb_next(n)) { in osdmap_show()
119 for (n = rb_first(&map->pg_upmap_items); n; n = rb_next(n)) { in osdmap_show()
158 for (rp = rb_first(&monc->generic_request_tree); rp; rp = rb_next(rp)) { in monc_show()
234 for (n = rb_first(&osd->o_requests); n; n = rb_next(n)) { in dump_requests()
260 for (n = rb_first(&osd->o_linger_requests); n; n = rb_next(n)) { in dump_linger_requests()
321 for (n = rb_first(&osd->o_backoffs_by_id); n; n = rb_next(n)) { in dump_backoffs()
347 for (n = rb_first(&osdc->osds); n; n = rb_next(n)) { in osdc_show()
[all …]
|
| /Linux-v5.4/fs/proc/ |
| D | task_nommu.c | 29 for (p = rb_first(&mm->mm_rb); p; p = rb_next(p)) { in task_mem()
90 for (p = rb_first(&mm->mm_rb); p; p = rb_next(p)) { in task_vsize()
108 for (p = rb_first(&mm->mm_rb); p; p = rb_next(p)) { in task_statm()
220 for (p = rb_first(&mm->mm_rb); p; p = rb_next(p)) in m_start()
248 return p ? rb_next(p) : NULL; in m_next()
|
| D | nommu.c | 88 for (p = rb_first(&nommu_region_tree); p; p = rb_next(p)) in nommu_region_list_start()
102 return rb_next((struct rb_node *) v); in nommu_region_list_next()
|
| /Linux-v5.4/arch/x86/mm/ |
| D | pat_rbtree.c | 110 node = rb_next(&match->rb); in memtype_rb_match()
139 node = rb_next(&match->rb); in memtype_rb_check_conflict()
151 node = rb_next(&match->rb); in memtype_rb_check_conflict()
256 node = rb_next(node); in rbt_memtype_copy_nth_element()
|
| /Linux-v5.4/security/keys/ |
| D | proc.c | 68 n = rb_next(n); in key_serial_next()
73 n = rb_next(n); in key_serial_next()
105 n = rb_next(&minkey->serial_node); in find_ge_key()
256 n = rb_next(n); in __key_user_next()
263 return __key_user_next(user_ns, rb_next(n)); in key_user_next()
|
| /Linux-v5.4/arch/powerpc/kernel/ |
| D | eeh_cache.c | 111 n = rb_next(n); in eeh_addr_cache_print()
238 n = rb_next(n); in __eeh_addr_cache_rmv_dev()
277 for (n = rb_first(&pci_io_addr_cache_root.rb_root); n; n = rb_next(n)) { in eeh_addr_cache_show()
|
| /Linux-v5.4/tools/perf/util/ |
| D | rblist.c | 116 next = rb_next(pos); in rblist__exit()
134 node = rb_next(node)) { in rblist__entry()
|
| D | rb_resort.h | 96 for (nd = rb_first(entries); nd; nd = rb_next(nd)) { \
131 __nd = rb_next(__nd))
|
| D | hist.c | 236 next = rb_next(&n->rb_node); in hists__output_recalc_col_len()
324 node = rb_next(node); in hists__decay_entry()
367 next = rb_next(&n->rb_node); in hists__decay_entries()
383 next = rb_next(&n->rb_node); in hists__delete_entries()
400 next = rb_next(&n->rb_node); in hists__get_entry()
1607 next = rb_next(&n->rb_node_in); in hists__collapse_resort()
1692 node = rb_next(node); in hierarchy_recalc_total_periods()
1746 node = rb_next(node); in hists__hierarchy_output_resort()
1870 next = rb_next(&n->rb_node_in); in output_resort()
1946 node = rb_next(node); in __rb_hierarchy_next()
[all …]
|
| D | symbol.c | 198 nd = rb_next(&curr->rb_node); in symbols__fixup_duplicate()
212 nd = rb_next(&curr->rb_node); in symbols__fixup_duplicate()
229 for (nd = rb_next(prevnd); nd; nd = rb_next(nd)) { in symbols__fixup_end()
311 next = rb_next(&pos->rb_node); in symbols__delete()
401 struct rb_node *n = rb_next(&sym->rb_node); in symbols__next()
437 for (nd = rb_first_cached(source); nd; nd = rb_next(nd)) { in symbols__sort_by_name()
550 struct rb_node *n = rb_next(&s->rb_node); in symbol__next_by_name()
723 next = rb_next(&pos->rb_node); in map_groups__split_kallsyms_for_kcore()
781 next = rb_next(&pos->rb_node); in map_groups__split_kallsyms()
950 next = rb_next(&mi->rb_node); in delete_modules()
[all …]
|
| D | callchain.c | 422 n = rb_next(n); in __sort_chain_flat()
454 n = rb_next(n); in __sort_chain_graph_abs()
484 n = rb_next(n); in __sort_chain_graph_rel()
550 n = rb_next(n); in create_child()
1024 n = rb_next(n); in merge_chain_branch()
1264 n = rb_next(n); in callchain_node_branch_counts_cumul()
1475 n = rb_next(n); in free_callchain_node()
1502 n = rb_next(n); in decay_callchain_node()
1543 chain->has_children = rb_prev(&node->rb_node) || rb_next(&node->rb_node); in callchain_node__make_parent_list()
|
| D | block-range.h | 40 struct rb_node *n = rb_next(&br->node); in block_range__next()
|
| D | map.c | 603 next = rb_next(&pos->rb_node); in __maps__purge()
617 next = rb_next(&pos->rb_node_name); in __maps__purge_names()
694 for (nd = rb_first(&maps->entries); nd; nd = rb_next(nd)) { in maps__find_symbol_by_name()
746 for (nd = rb_first(&maps->entries); nd; nd = rb_next(nd)) { in maps__fprintf()
804 next = rb_next(&pos->rb_node); in maps__fixup_overlappings()
1012 struct rb_node *next = rb_next(&map->rb_node); in map__next()
|
| /Linux-v5.4/tools/include/linux/ |
| D | rbtree.h | 53 extern struct rb_node *rb_next(const struct rb_node *);
142 root->rb_leftmost = rb_next(node); in rb_erase_cached()
|
| /Linux-v5.4/include/linux/ |
| D | rbtree.h | 54 extern struct rb_node *rb_next(const struct rb_node *);
148 root->rb_leftmost = rb_next(node); in rb_erase_cached()
|
| /Linux-v5.4/fs/ext4/ |
| D | extents_status.c | 192 node = rb_next(node); in ext4_es_print_tree()
230 node = rb_next(&es->rb_node); in __es_tree_search()
286 while ((node = rb_next(&es1->rb_node)) != NULL) { in __es_find_extent_range()
559 node = rb_next(&es->rb_node); in ext4_es_try_to_merge_right()
953 node = rb_next(&es1->rb_node); in ext4_es_lookup_extent()
1134 node = rb_next(&pr->rb_node); in __pr_tree_search()
1204 node = rb_next(&right_es->rb_node); in get_rsvd()
1215 node = rb_next(&es->rb_node); in get_rsvd()
1258 node = rb_next(&pr->rb_node); in get_rsvd()
1364 node = rb_next(&es->rb_node); in __es_remove_extent()
[all …]
|
| /Linux-v5.4/scripts/gdb/linux/ |
| D | rbtree.py | 54 def rb_next(node): function
150 result = rb_next(node)
|
| /Linux-v5.4/tools/perf/ |
| D | builtin-annotate.c | 333 nd = rb_next(nd); in hists__find_annotations()
355 nd = rb_next(nd); in hists__find_annotations()
365 next = rb_next(nd); in hists__find_annotations()
378 nd = rb_next(nd); in hists__find_annotations()
|
| /Linux-v5.4/drivers/base/regmap/ |
| D | regcache-rbtree.c | 149 node = rb_next(node)) { in rbtree_show()
228 next = rb_next(&rbtree_node->node); in regcache_rbtree_exit()
476 for (node = rb_first(&rbtree_ctx->root); node; node = rb_next(node)) { in regcache_rbtree_sync()
516 for (node = rb_first(&rbtree_ctx->root); node; node = rb_next(node)) { in regcache_rbtree_drop()
|
| /Linux-v5.4/tools/perf/ui/gtk/ |
| D | hists.c | 103 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in perf_gtk__add_callchain_flat()
165 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in perf_gtk__add_callchain_folded()
226 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in perf_gtk__add_callchain_graph()
358 for (nd = rb_first_cached(&hists->entries); nd; nd = rb_next(nd)) { in perf_gtk__show_hists()
420 for (node = rb_first_cached(root); node; node = rb_next(node)) { in perf_gtk__add_hierarchy_entries()
|
| /Linux-v5.4/fs/ocfs2/ |
| D | reservations.c | 97 node = rb_next(node); in ocfs2_dump_resv()
175 node = rb_next(node); in ocfs2_check_resmap()
384 node = rb_next(node); in ocfs2_find_resv_lhs()
565 next = rb_next(prev); in __ocfs2_resv_find_window()
|
| /Linux-v5.4/lib/ |
| D | timerqueue.c | 89 next = rb_next(&node->node); in timerqueue_iterate_next()
|
| /Linux-v5.4/fs/btrfs/ |
| D | extent_map.c | 119 parent = rb_next(parent); in tree_insert()
171 prev = rb_next(prev); in __tree_search()
256 rb = rb_next(&em->rb_node); in try_merge_map()
503 next = rb_next(&em->rb_node); in next_extent_map()
|
