Home
last modified time | relevance | path

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

123456789

/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()
/linux/net/ceph/
H A Ddebugfs.c74 for (n = rb_first(&map->pg_pools); n; n = rb_next(n)) { in osdmap_show()
97 for (n = rb_first(&map->pg_temp); n; n = rb_next(n)) { in osdmap_show()
108 for (n = rb_first(&map->primary_temp); n; n = rb_next(n)) { in osdmap_show()
115 for (n = rb_first(&map->pg_upmap); n; n = rb_next(n)) { in osdmap_show()
126 for (n = rb_first(&map->pg_upmap_items); n; n = rb_next(n)) { in osdmap_show()
166 for (rp = rb_first(&monc->generic_request_tree); rp; rp = rb_next(rp)) { in monc_show()
245 for (n = rb_first(&osd->o_requests); n; n = rb_next(n)) { in dump_requests()
271 for (n = rb_first(&osd->o_linger_requests); n; n = rb_next(n)) { in dump_linger_requests()
332 for (n = rb_first(&osd->o_backoffs_by_id); n; n = rb_next(n)) { in dump_backoffs()
358 for (n = rb_first(&osdc->osds); n; n = rb_next(n)) { in osdc_show()
[all …]
/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()
/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()
/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()
/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()
/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 Dhist.c275 next = rb_next(&n->rb_node); in hists__output_recalc_col_len()
435 node = rb_next(node); in hists__decay_entry()
478 next = rb_next(&n->rb_node); in hists__decay_entries()
494 next = rb_next(&n->rb_node); in hists__delete_entries()
511 next = rb_next(&n->rb_node); in hists__get_entry()
1846 next = rb_next(&n->rb_node_in); in hists__collapse_resort()
1919 node = rb_next(node); in hierarchy_recalc_total_periods()
1976 node = rb_next(node); in hists__hierarchy_output_resort()
2100 next = rb_next(&n->rb_node_in); in output_resort()
2176 node = rb_next(node); in __rb_hierarchy_next()
[all …]
H A Dsymbol.c220 nd = rb_next(&curr->rb_node); in symbols__fixup_duplicate()
237 nd = rb_next(&curr->rb_node); in symbols__fixup_duplicate()
255 for (nd = rb_next(prevnd); nd; nd = rb_next(nd)) { in symbols__fixup_end()
354 next = rb_next(&pos->rb_node); in symbols__delete()
444 struct rb_node *n = rb_next(&sym->rb_node); in symbols__next()
466 for (nd = rb_first_cached(source); nd; nd = rb_next(nd)) in symbols__sort_by_name()
473 for (nd = rb_first_cached(source); nd; nd = rb_next(nd)) { in symbols__sort_by_name()
822 next = rb_next(&pos->rb_node); in maps__split_kallsyms_for_kcore()
881 next = rb_next(&pos->rb_node); in maps__split_kallsyms()
1064 next = rb_next(&mi->rb_node); in delete_modules()
[all …]
H A Dcallchain.c440 n = rb_next(n); in __sort_chain_flat()
472 n = rb_next(n); in __sort_chain_graph_abs()
502 n = rb_next(n); in __sort_chain_graph_rel()
568 n = rb_next(n); in create_child()
1066 n = rb_next(n); in merge_chain_branch()
1310 n = rb_next(n); in callchain_node_branch_counts_cumul()
1518 n = rb_next(n); in free_callchain_node()
1545 n = rb_next(n); in decay_callchain_node()
1586 chain->has_children = rb_prev(&node->rb_node) || rb_next(&node->rb_node); in callchain_node__make_parent_list()
1774 rb_node = rb_next(rb_node); in count_callchain_hits()
[all …]
H A Dblock-range.h40 struct rb_node *n = rb_next(&br->node); in block_range__next()
/linux/fs/ext4/
H A Dextents_status.c226 node = rb_next(node); in ext4_es_print_tree()
286 node = rb_next(&es->rb_node); in __es_tree_search()
340 while ((node = rb_next(&es1->rb_node)) != NULL) { in __es_find_extent_range()
654 node = rb_next(&es->rb_node); in ext4_es_try_to_merge_right()
1145 node = rb_next(&es1->rb_node); in ext4_es_lookup_extent()
1327 node = rb_next(&pr->rb_node); in __pr_tree_search()
1396 node = rb_next(&right_es->rb_node); in get_rsvd()
1407 node = rb_next(&es->rb_node); in get_rsvd()
1450 node = rb_next(&pr->rb_node); in get_rsvd()
1565 node = rb_next(&es->rb_node); in __es_remove_extent()
[all …]
/linux/include/linux/
H A Drbtree.h44 extern struct rb_node *rb_next(const struct rb_node *);
152 leftmost = root->rb_leftmost = rb_next(node); in rb_erase_cached()
449 node = rb_next(node); in rb_next_match()
/linux/scripts/gdb/linux/
H A Drbtree.py66 def rb_next(node): function
162 result = rb_next(node)
/linux/drivers/base/regmap/
H A Dregcache-rbtree.c149 node = rb_next(node)) { in rbtree_show()
214 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/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()
/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()
/linux/tools/perf/
H A Dbuiltin-annotate.c449 nd = rb_next(nd); in hists__find_annotations()
487 next = rb_next(nd); in hists__find_annotations()
521 nd = rb_next(nd); in hists__find_annotations()
532 next = rb_next(nd); in hists__find_annotations()
546 nd = rb_next(nd); in hists__find_annotations()
/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))
/linux/fs/btrfs/
H A Dfree-space-cache.c1111 node = rb_next(node); in write_cache_extent_entries()
1733 n = rb_next(n); in tree_search_offset()
1797 n = rb_next(&entry->offset_index); in tree_search_offset()
2029 for (; node; node = rb_next(node)) { in find_free_space()
2080 struct rb_node *old_next = rb_next(node); in find_free_space()
2100 if (use_bytes_index && old_next != rb_next(node)) in find_free_space()
2183 struct rb_node *next = rb_next(&bitmap_info->offset_index); in remove_from_bitmap()
2932 for (n = rb_first(&ctl->free_space_offset); n; n = rb_next(n)) { in btrfs_dump_free_space()
2999 node = rb_next(&entry->offset_index); in __btrfs_return_cluster_to_free_space()
3080 node = rb_next(node); in btrfs_is_free_space_trimmed()
[all …]
/linux/net/netfilter/
H A Dnft_set_rbtree.c276 node = rb_next(node); in __nft_rbtree_next_active()
289 return __nft_rbtree_next_active(rb_next(&rbe->node), genmask); in nft_rbtree_next_active()
384 next = rb_next(node); in __nft_rbtree_insert()
740 node = rb_next(&rbe->node); in nft_rbtree_next_inactive()
850 for (node = rb_first(&priv->root); node != NULL; node = rb_next(node)) { in nft_rbtree_do_walk()
903 next = rb_next(node); in nft_rbtree_gc_scan()
/linux/lib/
H A Drbtree_test.c198 for (rb = rb_first(&root.rb_root); rb; rb = rb_next(rb)) { in check()
224 for (rb = rb_first(&root.rb_root); rb; rb = rb_next(rb)) { in check_augmented()
291 for (node = rb_first(&root.rb_root); node; node = rb_next(node)) in basic_check()
H A Dtimerqueue.c79 next = rb_next(&node->node); in timerqueue_iterate_next()
/linux/kernel/trace/
H A Dtrace_stat.c187 node = rb_next(node); in stat_seq_start()
202 return rb_next(node); in stat_seq_next()

123456789