Home
last modified time | relevance | path

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

123456789

/openbmc/linux/tools/perf/tests/
H A Dhists_output.c185 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 …]
H A Dhists_common.c191 node = rb_next(node); in print_hists_in()
221 node = rb_next(node); in print_hists_out()
/openbmc/linux/net/ceph/
H A Ddebugfs.c69 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 …]
/openbmc/linux/security/keys/
H A Dproc.c68 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()
/openbmc/linux/fs/proc/
H A Dnommu.c86 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()
/openbmc/linux/arch/powerpc/kernel/
H A Deeh_cache.c111 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()
/openbmc/linux/tools/perf/util/
H A Drblist.c116 next = rb_next(pos); in rblist__exit()
134 node = rb_next(node)) { in rblist__entry()
H A Drb_resort.h96 for (nd = rb_first(entries); nd; nd = rb_next(nd)) { \
131 __nd = rb_next(__nd))
H A Dhist.c265 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()
1701 next = rb_next(&n->rb_node_in); in hists__collapse_resort()
1786 node = rb_next(node); in hierarchy_recalc_total_periods()
1840 node = rb_next(node); in hists__hierarchy_output_resort()
1964 next = rb_next(&n->rb_node_in); in output_resort()
2040 node = rb_next(node); in __rb_hierarchy_next()
[all …]
H A Dcallchain.c429 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 …]
H A Dsymbol.c194 nd = rb_next(&curr->rb_node); in symbols__fixup_duplicate()
212 nd = rb_next(&curr->rb_node); in symbols__fixup_duplicate()
230 for (nd = rb_next(prevnd); nd; nd = rb_next(nd)) { in symbols__fixup_end()
312 next = rb_next(&pos->rb_node); in symbols__delete()
402 struct rb_node *n = rb_next(&sym->rb_node); in symbols__next()
424 for (nd = rb_first_cached(source); nd; nd = rb_next(nd)) in symbols__sort_by_name()
431 for (nd = rb_first_cached(source); nd; nd = rb_next(nd)) { in symbols__sort_by_name()
777 next = rb_next(&pos->rb_node); in maps__split_kallsyms_for_kcore()
835 next = rb_next(&pos->rb_node); in maps__split_kallsyms()
1012 next = rb_next(&mi->rb_node); in delete_modules()
[all …]
H A Dblock-range.h40 struct rb_node *n = rb_next(&br->node); in block_range__next()
H A Dblock-range.c18 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()
/openbmc/linux/tools/include/linux/
H A Drbtree.h53 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()
/openbmc/linux/include/linux/
H A Drbtree.h44 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()
/openbmc/linux/fs/ext4/
H A Dextents_status.c193 node = rb_next(node); in ext4_es_print_tree()
231 node = rb_next(&es->rb_node); in __es_tree_search()
285 while ((node = rb_next(&es1->rb_node)) != NULL) { in __es_find_extent_range()
599 node = rb_next(&es->rb_node); in ext4_es_try_to_merge_right()
1035 node = rb_next(&es1->rb_node); in ext4_es_lookup_extent()
1216 node = rb_next(&pr->rb_node); in __pr_tree_search()
1286 node = rb_next(&right_es->rb_node); in get_rsvd()
1297 node = rb_next(&es->rb_node); in get_rsvd()
1340 node = rb_next(&pr->rb_node); in get_rsvd()
1445 node = rb_next(&es->rb_node); in __es_remove_extent()
[all …]
/openbmc/linux/scripts/gdb/linux/
H A Drbtree.py54 def rb_next(node): function
150 result = rb_next(node)
/openbmc/linux/drivers/base/regmap/
H A Dregcache-rbtree.c149 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()
/openbmc/linux/tools/perf/ui/gtk/
H A Dhists.c103 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()
/openbmc/linux/tools/perf/
H A Dbuiltin-annotate.c357 nd = rb_next(nd); in hists__find_annotations()
379 nd = rb_next(nd); in hists__find_annotations()
390 next = rb_next(nd); in hists__find_annotations()
404 nd = rb_next(nd); in hists__find_annotations()
/openbmc/linux/fs/ocfs2/
H A Dreservations.c92 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()
/openbmc/linux/lib/
H A Dtimerqueue.c79 next = rb_next(&node->node); in timerqueue_iterate_next()
H A Drbtree_test.c197 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()
/openbmc/linux/Documentation/translations/zh_CN/core-api/
H A Drbtree.rst167 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))
/openbmc/linux/fs/btrfs/
H A Dfree-space-cache.c1111 node = rb_next(node); in write_cache_extent_entries()
1736 n = rb_next(n); in tree_search_offset()
1800 n = rb_next(&entry->offset_index); in tree_search_offset()
2032 for (; node; node = rb_next(node)) { in find_free_space()
2083 struct rb_node *old_next = rb_next(node); in find_free_space()
2103 if (use_bytes_index && old_next != rb_next(node)) in find_free_space()
2186 struct rb_node *next = rb_next(&bitmap_info->offset_index); in remove_from_bitmap()
2933 for (n = rb_first(&ctl->free_space_offset); n; n = rb_next(n)) { in btrfs_dump_free_space()
3001 node = rb_next(&entry->offset_index); in __btrfs_return_cluster_to_free_space()
3076 node = rb_next(node); in btrfs_is_free_space_trimmed()
[all …]

123456789