Home
last modified time | relevance | path

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

123456789

/OK3568_Linux_fs/kernel/tools/perf/tests/
H A Dhists_output.c172 node = rb_next(node); in test1()
178 node = rb_next(node); in test1()
184 node = rb_next(node); in test1()
190 node = rb_next(node); in test1()
196 node = rb_next(node); in test1()
202 node = rb_next(node); in test1()
208 node = rb_next(node); in test1()
214 node = rb_next(node); in test1()
271 node = rb_next(node); in test2()
326 node = rb_next(node); in test3()
[all …]
H A Dhists_common.c189 node = rb_next(node); in print_hists_in()
217 node = rb_next(node); in print_hists_out()
/OK3568_Linux_fs/kernel/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 …]
/OK3568_Linux_fs/kernel/fs/proc/
H A Dtask_nommu.c29 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()
220 for (p = rb_first(&mm->mm_rb); p; p = rb_next(p)) in m_start()
248 return p ? rb_next(p) : NULL; in m_next()
H A Dnommu.c87 for (p = rb_first(&nommu_region_tree); p; p = rb_next(p)) in nommu_region_list_start()
101 return rb_next((struct rb_node *) v); in nommu_region_list_next()
/OK3568_Linux_fs/kernel/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()
/OK3568_Linux_fs/kernel/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()
/OK3568_Linux_fs/kernel/fs/ext4/
H A Dextents_status.c192 node = rb_next(node); in ext4_es_print_tree()
230 node = rb_next(&es->rb_node); in __es_tree_search()
286 while ((node = rb_next(&es1->rb_node)) != NULL) { in __es_find_extent_range()
568 node = rb_next(&es->rb_node); in ext4_es_try_to_merge_right()
971 node = rb_next(&es1->rb_node); in ext4_es_lookup_extent()
1152 node = rb_next(&pr->rb_node); in __pr_tree_search()
1222 node = rb_next(&right_es->rb_node); in get_rsvd()
1233 node = rb_next(&es->rb_node); in get_rsvd()
1276 node = rb_next(&pr->rb_node); in get_rsvd()
1382 node = rb_next(&es->rb_node); in __es_remove_extent()
[all …]
/OK3568_Linux_fs/kernel/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.c251 next = rb_next(&n->rb_node); in hists__output_recalc_col_len()
339 node = rb_next(node); in hists__decay_entry()
382 next = rb_next(&n->rb_node); in hists__decay_entries()
398 next = rb_next(&n->rb_node); in hists__delete_entries()
415 next = rb_next(&n->rb_node); in hists__get_entry()
1654 next = rb_next(&n->rb_node_in); in hists__collapse_resort()
1739 node = rb_next(node); in hierarchy_recalc_total_periods()
1793 node = rb_next(node); in hists__hierarchy_output_resort()
1917 next = rb_next(&n->rb_node_in); in output_resort()
1993 node = rb_next(node); in __rb_hierarchy_next()
[all …]
H A Drb_resort.h96 for (nd = rb_first(entries); nd; nd = rb_next(nd)) { \
131 __nd = rb_next(__nd))
H A Dcallchain.c422 n = rb_next(n); in __sort_chain_flat()
454 n = rb_next(n); in __sort_chain_graph_abs()
484 n = rb_next(n); in __sort_chain_graph_rel()
550 n = rb_next(n); in create_child()
1023 n = rb_next(n); in merge_chain_branch()
1264 n = rb_next(n); in callchain_node_branch_counts_cumul()
1475 n = rb_next(n); in free_callchain_node()
1502 n = rb_next(n); in decay_callchain_node()
1543 chain->has_children = rb_prev(&node->rb_node) || rb_next(&node->rb_node); in callchain_node__make_parent_list()
1681 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()
208 nd = rb_next(&curr->rb_node); in symbols__fixup_duplicate()
226 for (nd = rb_next(prevnd); nd; nd = rb_next(nd)) { in symbols__fixup_end()
324 next = rb_next(&pos->rb_node); in symbols__delete()
414 struct rb_node *n = rb_next(&sym->rb_node); in symbols__next()
450 for (nd = rb_first_cached(source); nd; nd = rb_next(nd)) { in symbols__sort_by_name()
570 struct rb_node *n = rb_next(&s->rb_node); in symbol__next_by_name()
767 next = rb_next(&pos->rb_node); in maps__split_kallsyms_for_kcore()
825 next = rb_next(&pos->rb_node); in maps__split_kallsyms()
994 next = rb_next(&mi->rb_node); in delete_modules()
[all …]
H A Dblock-range.c22 for (rb = rb_first(&block_ranges.root); rb; rb = rb_next(rb)) { in block_range__debug()
113 n = rb_next(n); in block_range__create()
H A Dblock-range.h40 struct rb_node *n = rb_next(&br->node); in block_range__next()
/OK3568_Linux_fs/kernel/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()
/OK3568_Linux_fs/kernel/include/linux/
H A Drbtree.h54 extern struct rb_node *rb_next(const struct rb_node *);
148 root->rb_leftmost = rb_next(node); in rb_erase_cached()
/OK3568_Linux_fs/kernel/scripts/gdb/linux/
H A Drbtree.py54 def rb_next(node): function
150 result = rb_next(node)
/OK3568_Linux_fs/kernel/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()
475 for (node = rb_first(&rbtree_ctx->root); node; node = rb_next(node)) { in regcache_rbtree_sync()
515 for (node = rb_first(&rbtree_ctx->root); node; node = rb_next(node)) { in regcache_rbtree_drop()
/OK3568_Linux_fs/kernel/tools/perf/
H A Dbuiltin-annotate.c331 nd = rb_next(nd); in hists__find_annotations()
353 nd = rb_next(nd); in hists__find_annotations()
363 next = rb_next(nd); in hists__find_annotations()
376 nd = rb_next(nd); in hists__find_annotations()
/OK3568_Linux_fs/kernel/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()
/OK3568_Linux_fs/kernel/fs/ocfs2/
H A Dreservations.c94 node = rb_next(node); in ocfs2_dump_resv()
172 node = rb_next(node); in ocfs2_check_resmap()
381 node = rb_next(node); in ocfs2_find_resv_lhs()
562 next = rb_next(prev); in __ocfs2_resv_find_window()
/OK3568_Linux_fs/kernel/fs/btrfs/
H A Dextent_map.c119 parent = rb_next(parent); in tree_insert()
171 prev = rb_next(prev); in __tree_search()
271 rb = rb_next(&em->rb_node); in try_merge_map()
518 next = rb_next(&em->rb_node); in next_extent_map()
H A Dfree-space-cache.c644 for (n = rb_first(&ctl->free_space_offset); n; n = rb_next(n)) { in merge_space_tree()
983 node = rb_next(node); in write_cache_extent_entries()
1557 n = rb_next(n); in tree_search_offset()
1630 n = rb_next(&entry->offset_index); in tree_search_offset()
1868 for (node = &entry->offset_index; node; node = rb_next(node)) { in find_free_space()
2013 struct rb_node *next = rb_next(&bitmap_info->offset_index); in remove_from_bitmap()
2666 for (n = rb_first(&ctl->free_space_offset); n; n = rb_next(n)) { in btrfs_dump_free_space()
2731 node = rb_next(&entry->offset_index); in __btrfs_return_cluster_to_free_space()
2837 node = rb_next(node); in btrfs_is_free_space_trimmed()
3008 node = rb_next(&entry->offset_index); in btrfs_alloc_from_cluster()
[all …]
/OK3568_Linux_fs/kernel/lib/
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()

123456789