/Linux-v4.19/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-v4.19/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() 216 for (p = rb_first(&mm->mm_rb); p; p = rb_next(p)) in m_start()
|
D | nommu.c | 92 for (p = rb_first(&nommu_region_tree); p; p = rb_next(p)) in nommu_region_list_start()
|
/Linux-v4.19/tools/perf/util/ |
D | rblist.c | 106 struct rb_node *pos, *next = rb_first(&rblist->entries); in rblist__exit() 127 for (node = rb_first(&rblist->entries); node; node = rb_next(node)) { in rblist__entry()
|
D | rb_resort.h | 96 for (nd = rb_first(entries); nd; nd = rb_next(nd)) { \ 128 for (__nd = rb_first(&__name->entries); \
|
D | hist.c | 212 struct rb_node *next = rb_first(&hists->entries); in hists__output_recalc_col_len() 299 struct rb_node *node = rb_first(&he->hroot_out); in hists__decay_entry() 340 struct rb_node *next = rb_first(&hists->entries); in hists__decay_entries() 356 struct rb_node *next = rb_first(&hists->entries); in hists__delete_entries() 1482 next = rb_first(root); in hists__collapse_resort() 1561 node = rb_first(&hists->entries); in hierarchy_recalc_total_periods() 1620 node = rb_first(root_in); in hists__hierarchy_output_resort() 1739 next = rb_first(root); in output_resort() 1812 node = rb_first(&he->hroot_out); in __rb_hierarchy_next() 1850 node = rb_first(&he->hroot_out); in hist_entry__has_hierarchy_children() [all …]
|
D | callchain.c | 412 n = rb_first(&node->rb_root_in); in __sort_chain_flat() 443 n = rb_first(&node->rb_root_in); in __sort_chain_graph_abs() 474 n = rb_first(&node->rb_root_in); in __sort_chain_graph_rel() 539 n = rb_first(&new->rb_root_in); in create_child() 1013 n = rb_first(&src->rb_root_in); in merge_chain_branch() 1253 n = rb_first(&node->rb_root_in); in callchain_node_branch_counts_cumul() 1457 n = rb_first(&node->rb_root_in); in free_callchain_node() 1482 n = rb_first(&node->rb_root_in); in decay_callchain_node()
|
D | map.c | 288 struct rb_node *nd = rb_first(symbols); in map__fixup_start() 514 struct rb_node *next = rb_first(root); in __maps__purge() 594 for (nd = rb_first(&maps->entries); nd; nd = rb_next(nd)) { in maps__find_symbol_by_name() 646 for (nd = rb_first(&maps->entries); nd; nd = rb_next(nd)) { in maps__fprintf() 877 struct rb_node *first = rb_first(&maps->entries); in maps__first()
|
D | intlist.h | 48 struct rb_node *rn = rb_first(&ilist->rblist.entries); in intlist__first()
|
D | strlist.h | 60 struct rb_node *rn = rb_first(&slist->rblist.entries); in strlist__first()
|
D | symbol.c | 174 nd = rb_first(symbols); in symbols__fixup_duplicate() 202 struct rb_node *nd, *prevnd = rb_first(symbols); in symbols__fixup_end() 288 struct rb_node *next = rb_first(symbols); in symbols__delete() 358 struct rb_node *n = rb_first(symbols); in symbols__first() 411 for (nd = rb_first(source); nd; nd = rb_next(nd)) { in symbols__sort_by_name() 685 struct rb_node *next = rb_first(root); in map_groups__split_kallsyms_for_kcore() 737 struct rb_node *next = rb_first(root); in map_groups__split_kallsyms() 917 struct rb_node *next = rb_first(modules); in delete_modules() 1000 from_node = rb_first(&from_modules); in compare_proc_modules() 1001 to_node = rb_first(&to_modules); in compare_proc_modules()
|
D | symbol_fprintf.c | 67 for (nd = rb_first(&dso->symbol_names); nd; nd = rb_next(nd)) { in dso__fprintf_symbols_by_name()
|
/Linux-v4.19/tools/perf/ui/gtk/ |
D | hists.c | 99 bool has_single_node = (rb_first(root) == rb_last(root)); in perf_gtk__add_callchain_flat() 101 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in perf_gtk__add_callchain_flat() 163 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in perf_gtk__add_callchain_folded() 222 bool has_single_node = (rb_first(root) == rb_last(root)); in perf_gtk__add_callchain_graph() 224 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in perf_gtk__add_callchain_graph() 356 for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) { in perf_gtk__show_hists() 418 for (node = rb_first(root); node; node = rb_next(node)) { in perf_gtk__add_hierarchy_entries()
|
/Linux-v4.19/tools/perf/tests/ |
D | hists_output.c | 106 node = rb_first(root_out); in del_hist_entries() 165 node = rb_first(root); in test1() 265 node = rb_first(root); in test2() 319 node = rb_first(root); in test3() 397 node = rb_first(root); in test4() 500 node = rb_first(root); in test5()
|
D | hists_common.c | 173 node = rb_first(root); in print_hists_in() 200 node = rb_first(root); in print_hists_out()
|
D | hists_cumulate.c | 140 node = rb_first(root_out); in del_hist_entries() 202 for (node = rb_first(root), i = 0; in do_test() 224 cnode = rb_entry(rb_first(root), struct callchain_node, rb_node); in do_test()
|
/Linux-v4.19/drivers/net/ethernet/mellanox/mlx5/core/ |
D | fs_counters.c | 183 node = rb_first(&fc_stats->counters); in mlx5_fc_stats_work() 204 node = rb_first(&fc_stats->counters); in mlx5_fc_stats_work() 303 node = rb_first(&fc_stats->counters); in mlx5_cleanup_fc_stats()
|
/Linux-v4.19/lib/ |
D | rbtree_test.c | 212 for (rb = rb_first(&root.rb_root); rb; rb = rb_next(rb)) { in check() 238 for (rb = rb_first(&root.rb_root); rb; rb = rb_next(rb)) { in check_augmented() 297 for (node = rb_first(&root.rb_root); node; node = rb_next(node)) in rbtree_test_init() 311 node = rb_first(&root.rb_root); in rbtree_test_init()
|
/Linux-v4.19/tools/perf/ui/browsers/ |
D | hists.c | 52 for (nd = rb_first(&hists->entries); in hist_browser__get_folding() 166 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { in callchain_node__count_rows_rb_tree() 249 for (nd = rb_first(chain); nd; nd = rb_next(nd)) { in callchain__count_rows() 270 node = rb_first(&he->hroot_out); in hierarchy_count_rows() 315 struct rb_node *nd = rb_first(&node->rb_root); in callchain_node__init_have_children_rb_tree() 317 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { in callchain_node__init_have_children_rb_tree() 354 struct rb_node *nd = rb_first(root); in callchain__init_have_children() 357 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in callchain__init_have_children() 454 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { in callchain_node__set_folding_rb_tree() 495 for (nd = rb_first(chain); nd; nd = rb_next(nd)) { in callchain__set_folding() [all …]
|
/Linux-v4.19/arch/powerpc/kernel/ |
D | eeh_cache.c | 112 n = rb_first(&cache->rb_root); in eeh_addr_cache_print() 237 n = rb_first(&pci_io_addr_cache_root.rb_root); in __eeh_addr_cache_rmv_dev()
|
/Linux-v4.19/drivers/base/regmap/ |
D | regcache-rbtree.c | 152 for (node = rb_first(&rbtree_ctx->root); node != NULL; in rbtree_show() 239 next = rb_first(&rbtree_ctx->root); in regcache_rbtree_exit() 490 for (node = rb_first(&rbtree_ctx->root); node; node = rb_next(node)) { in regcache_rbtree_sync() 530 for (node = rb_first(&rbtree_ctx->root); node; node = rb_next(node)) { in regcache_rbtree_drop()
|
/Linux-v4.19/fs/ocfs2/ |
D | reservations.c | 96 node = rb_first(&resmap->m_reservations); in ocfs2_dump_resv() 151 node = rb_first(&resmap->m_reservations); in ocfs2_check_resmap() 378 node = rb_first(&resmap->m_reservations); in ocfs2_find_resv_lhs() 537 next = rb_first(root); in __ocfs2_resv_find_window()
|
/Linux-v4.19/tools/perf/ui/stdio/ |
D | hist.c | 117 node = rb_first(root); in __callchain__fprintf_graph() 222 node = rb_first(root); in callchain__fprintf_graph() 303 struct rb_node *rb_node = rb_first(tree); in callchain__fprintf_flat() 354 struct rb_node *rb_node = rb_first(tree); in callchain__fprintf_folded() 791 for (nd = rb_first(&hists->entries); nd; nd = __rb_hierarchy_next(nd, HMD_FORCE_CHILD)) { in hists__fprintf()
|
/Linux-v4.19/tools/include/linux/ |
D | rbtree.h | 68 extern struct rb_node *rb_first(const struct rb_root *);
|
/Linux-v4.19/kernel/trace/ |
D | trace_stat.c | 190 node = rb_first(&session->stat_root); in stat_seq_start() 205 return rb_first(&session->stat_root); in stat_seq_next()
|