Home
last modified time | relevance | path

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

1234567

/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/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.h
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 Dcallchain.c439 n = rb_next(n); in __sort_chain_flat()
471 n = rb_next(n); in __sort_chain_graph_abs()
501 n = rb_next(n); in __sort_chain_graph_rel()
567 n = rb_next(n); in create_child()
1065 n = rb_next(n); in merge_chain_branch()
1308 n = rb_next(n); in callchain_node_branch_counts_cumul()
1516 n = rb_next(n); in free_callchain_node()
1543 n = rb_next(n); in decay_callchain_node()
1584 chain->has_children = rb_prev(&node->rb_node) || rb_next(&node->rb_node); in callchain_node__make_parent_list()
1772 rb_node = rb_next(rb_node); in count_callchain_hits()
[all …]
H A Dsymbol.c231 nd = rb_next(&curr->rb_node); in symbols__fixup_duplicate()
248 nd = rb_next(&curr->rb_node); in symbols__fixup_duplicate()
266 for (nd = rb_next(prevnd); nd; nd = rb_next(nd)) { in symbols__fixup_end()
365 next = rb_next(&pos->rb_node); in symbols__delete()
455 struct rb_node *n = rb_next(&sym->rb_node); in symbols__next()
477 for (nd = rb_first_cached(source); nd; nd = rb_next(nd)) in symbols__sort_by_name()
484 for (nd = rb_first_cached(source); nd; nd = rb_next(nd)) { in symbols__sort_by_name()
833 next = rb_next(&pos->rb_node); in maps__split_kallsyms_for_kcore()
892 next = rb_next(&pos->rb_node); in maps__split_kallsyms()
1075 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 Dintlist.h56 rn = rb_next(&in->rb_node); in intlist__next()
H A Dstrlist.h68 rn = rb_next(&sn->rb_node); in strlist__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()
/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/scripts/gdb/linux/
H A Drbtree.py66 def rb_next(node): function
162 result = rb_next(node)
/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/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/lib/
H A Dtimerqueue.c79 next = rb_next(&node->node); in timerqueue_iterate_next()
/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/kernel/trace/
H A Dtrace_stat.c187 node = rb_next(node); in stat_seq_start()
202 return rb_next(node); in stat_seq_next()
/linux/fs/btrfs/
H A Dextent_map.c113 parent = rb_next(parent); in tree_insert()
165 prev = rb_next(prev); in tree_search()
381 rb = rb_next(&em->rb_node); in try_merge_map()
620 next = rb_next(&em->rb_node); in next_extent_map()
770 struct rb_node *next = rb_next(node); in drop_all_extent_maps_fast()
1151 struct rb_node *next = rb_next(node); in btrfs_scan_inode()
/linux/drivers/vfio/
H A Dvfio_iommu_type1.c273 for (p = rb_first(&dma->pfn_list); p; p = rb_next(p)) { in vfio_dma_populate_bitmap()
285 for (n = rb_first(&iommu->dma_list); n; n = rb_next(n)) { in vfio_iommu_populate_bitmap_full()
296 for (n = rb_first(&iommu->dma_list); n; n = rb_next(n)) { in vfio_dma_bitmap_alloc_all()
321 for (n = rb_first(&iommu->dma_list); n; n = rb_next(n)) { in vfio_dma_bitmap_free_all()
661 while ((next = rb_next(next))) { in vpfn_pages()
1330 for (n = rb_first(&iommu->dma_list); n; n = rb_next(n)) { in vfio_iova_dirty_bitmap()
1504 for (n = first_n; n != last_n; n = rb_next(n)) { in vfio_dma_do_unmap()
1517 n = rb_next(n); in vfio_dma_do_unmap()
1541 n = rb_next(n); in vfio_dma_do_unmap()
1822 for (; n; n = rb_next(n)) { in vfio_iommu_replay()
[all …]

1234567