| /Linux-v6.6/tools/perf/tests/ |
| D | hists_output.c | 185 node = rb_next(node); in test1()
191 node = rb_next(node); in test1()
197 node = rb_next(node); in test1()
203 node = rb_next(node); in test1()
209 node = rb_next(node); in test1()
215 node = rb_next(node); in test1()
221 node = rb_next(node); in test1()
227 node = rb_next(node); in test1()
284 node = rb_next(node); in test2()
339 node = rb_next(node); in test3()
[all …]
|
| D | hists_common.c | 191 node = rb_next(node); in print_hists_in()
221 node = rb_next(node); in print_hists_out()
|
| /Linux-v6.6/net/ceph/ |
| D | debugfs.c | 69 for (n = rb_first(&map->pg_pools); n; n = rb_next(n)) { in osdmap_show()
92 for (n = rb_first(&map->pg_temp); n; n = rb_next(n)) { in osdmap_show()
103 for (n = rb_first(&map->primary_temp); n; n = rb_next(n)) { in osdmap_show()
110 for (n = rb_first(&map->pg_upmap); n; n = rb_next(n)) { in osdmap_show()
121 for (n = rb_first(&map->pg_upmap_items); n; n = rb_next(n)) { in osdmap_show()
160 for (rp = rb_first(&monc->generic_request_tree); rp; rp = rb_next(rp)) { in monc_show()
239 for (n = rb_first(&osd->o_requests); n; n = rb_next(n)) { in dump_requests()
265 for (n = rb_first(&osd->o_linger_requests); n; n = rb_next(n)) { in dump_linger_requests()
326 for (n = rb_first(&osd->o_backoffs_by_id); n; n = rb_next(n)) { in dump_backoffs()
352 for (n = rb_first(&osdc->osds); n; n = rb_next(n)) { in osdc_show()
[all …]
|
| /Linux-v6.6/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()
258 n = rb_next(n); in __key_user_next()
265 return __key_user_next(user_ns, rb_next(n)); in key_user_next()
|
| /Linux-v6.6/fs/proc/ |
| D | nommu.c | 86 for (p = rb_first(&nommu_region_tree); p; p = rb_next(p)) in nommu_region_list_start()
100 return rb_next((struct rb_node *) v); in nommu_region_list_next()
|
| /Linux-v6.6/arch/powerpc/kernel/ |
| D | eeh_cache.c | 111 n = rb_next(n); in eeh_addr_cache_print()
230 n = rb_next(n); in __eeh_addr_cache_rmv_dev()
270 for (n = rb_first(&pci_io_addr_cache_root.rb_root); n; n = rb_next(n)) { in eeh_addr_cache_show()
|
| /Linux-v6.6/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 | 265 next = rb_next(&n->rb_node); in hists__output_recalc_col_len()
349 node = rb_next(node); in hists__decay_entry()
392 next = rb_next(&n->rb_node); in hists__decay_entries()
408 next = rb_next(&n->rb_node); in hists__delete_entries()
425 next = rb_next(&n->rb_node); in hists__get_entry()
1696 next = rb_next(&n->rb_node_in); in hists__collapse_resort()
1781 node = rb_next(node); in hierarchy_recalc_total_periods()
1835 node = rb_next(node); in hists__hierarchy_output_resort()
1959 next = rb_next(&n->rb_node_in); in output_resort()
2035 node = rb_next(node); in __rb_hierarchy_next()
[all …]
|
| D | callchain.c | 429 n = rb_next(n); in __sort_chain_flat()
461 n = rb_next(n); in __sort_chain_graph_abs()
491 n = rb_next(n); in __sort_chain_graph_rel()
557 n = rb_next(n); in create_child()
1041 n = rb_next(n); in merge_chain_branch()
1287 n = rb_next(n); in callchain_node_branch_counts_cumul()
1492 n = rb_next(n); in free_callchain_node()
1519 n = rb_next(n); in decay_callchain_node()
1560 chain->has_children = rb_prev(&node->rb_node) || rb_next(&node->rb_node); in callchain_node__make_parent_list()
1750 rb_node = rb_next(rb_node); in count_callchain_hits()
[all …]
|
| D | block-range.h | 40 struct rb_node *n = rb_next(&br->node); in block_range__next()
|
| D | symbol.c | 204 nd = rb_next(&curr->rb_node); in symbols__fixup_duplicate()
222 nd = rb_next(&curr->rb_node); in symbols__fixup_duplicate()
240 for (nd = rb_next(prevnd); nd; nd = rb_next(nd)) { in symbols__fixup_end()
345 next = rb_next(&pos->rb_node); in symbols__delete()
435 struct rb_node *n = rb_next(&sym->rb_node); in symbols__next()
457 for (nd = rb_first_cached(source); nd; nd = rb_next(nd)) in symbols__sort_by_name()
464 for (nd = rb_first_cached(source); nd; nd = rb_next(nd)) { in symbols__sort_by_name()
810 next = rb_next(&pos->rb_node); in maps__split_kallsyms_for_kcore()
868 next = rb_next(&pos->rb_node); in maps__split_kallsyms()
1045 next = rb_next(&mi->rb_node); in delete_modules()
[all …]
|
| D | block-range.c | 18 for (rb = rb_first(&block_ranges.root); rb; rb = rb_next(rb)) { in block_range__debug()
109 n = rb_next(n); in block_range__create()
|
| /Linux-v6.6/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()
328 node = rb_next(node); in rb_next_match()
|
| /Linux-v6.6/include/linux/ |
| D | rbtree.h | 44 extern struct rb_node *rb_next(const struct rb_node *);
124 leftmost = root->rb_leftmost = rb_next(node); in rb_erase_cached()
317 node = rb_next(node); in rb_next_match()
|
| /Linux-v6.6/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()
284 while ((node = rb_next(&es1->rb_node)) != NULL) { in __es_find_extent_range()
583 node = rb_next(&es->rb_node); in ext4_es_try_to_merge_right()
1007 node = rb_next(&es1->rb_node); in ext4_es_lookup_extent()
1188 node = rb_next(&pr->rb_node); in __pr_tree_search()
1258 node = rb_next(&right_es->rb_node); in get_rsvd()
1269 node = rb_next(&es->rb_node); in get_rsvd()
1312 node = rb_next(&pr->rb_node); in get_rsvd()
1417 node = rb_next(&es->rb_node); in __es_remove_extent()
[all …]
|
| /Linux-v6.6/scripts/gdb/linux/ |
| D | rbtree.py | 54 def rb_next(node): function
150 result = rb_next(node)
|
| /Linux-v6.6/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()
478 for (node = rb_first(&rbtree_ctx->root); node; node = rb_next(node)) { in regcache_rbtree_sync()
520 for (node = rb_first(&rbtree_ctx->root); node; node = rb_next(node)) { in regcache_rbtree_drop()
|
| /Linux-v6.6/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-v6.6/fs/ocfs2/ |
| D | reservations.c | 92 node = rb_next(node); in ocfs2_dump_resv()
170 node = rb_next(node); in ocfs2_check_resmap()
377 node = rb_next(node); in ocfs2_find_resv_lhs()
558 next = rb_next(prev); in __ocfs2_resv_find_window()
|
| /Linux-v6.6/tools/perf/ |
| D | builtin-annotate.c | 358 nd = rb_next(nd); in hists__find_annotations()
381 nd = rb_next(nd); in hists__find_annotations()
392 next = rb_next(nd); in hists__find_annotations()
406 nd = rb_next(nd); in hists__find_annotations()
|
| /Linux-v6.6/lib/ |
| D | timerqueue.c | 79 next = rb_next(&node->node); in timerqueue_iterate_next()
|
| D | rbtree_test.c | 197 for (rb = rb_first(&root.rb_root); rb; rb = rb_next(rb)) { in check()
223 for (rb = rb_first(&root.rb_root); rb; rb = rb_next(rb)) { in check_augmented()
295 for (node = rb_first(&root.rb_root); node; node = rb_next(node)) in rbtree_test_init()
|
| /Linux-v6.6/Documentation/translations/zh_CN/core-api/ |
| D | rbtree.rst | 167 struct rb_node *rb_next(struct rb_node *node);
172 rb_next()或rb_prev()来获取下一个或上一个结点。当没有剩余的结点时，将返回NULL。
181 for (node = rb_first(&mytree); node; node = rb_next(node))
|
| /Linux-v6.6/fs/btrfs/ |
| D | free-space-cache.c | 1110 node = rb_next(node); in write_cache_extent_entries()
1735 n = rb_next(n); in tree_search_offset()
1799 n = rb_next(&entry->offset_index); in tree_search_offset()
2031 for (; node; node = rb_next(node)) { in find_free_space()
2082 struct rb_node *old_next = rb_next(node); in find_free_space()
2102 if (use_bytes_index && old_next != rb_next(node)) in find_free_space()
2185 struct rb_node *next = rb_next(&bitmap_info->offset_index); in remove_from_bitmap()
2928 for (n = rb_first(&ctl->free_space_offset); n; n = rb_next(n)) { in btrfs_dump_free_space()
2996 node = rb_next(&entry->offset_index); in __btrfs_return_cluster_to_free_space()
3071 node = rb_next(node); in btrfs_is_free_space_trimmed()
[all …]
|
