Home
last modified time | relevance | path

Searched refs:rb_first (Results 1 – 25 of 114) sorted by relevance

12345

/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/arch/powerpc/kernel/
H A Deeh_cache.c103 n = rb_first(&cache->rb_root); in eeh_addr_cache_print()
218 n = rb_first(&pci_io_addr_cache_root.rb_root); 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 Drb_resort.h
H A Dcallchain.c484 n = rb_first(&node->rb_root_in); in sort_chain_graph_abs()
515 n = rb_first(&node->rb_root_in); in sort_chain_graph_rel()
546 n = rb_first(&node->rb_root_in); in create_child()
611 n = rb_first(&new->rb_root_in); in fill_node()
1110 n = rb_first(&src->rb_root_in); in callchain_cursor_append()
1354 n = rb_first(&node->rb_root_in); in count_float_printf()
1562 n = rb_first(&node->rb_root_in); in callchain_node__make_parent_list()
1602 n = rb_first(&node->rb_root_in);
1829 struct rb_node *rb_node = rb_first(root); in sample__for_each_callchain_node()
H A Denv.c102 first = rb_first(&env->bpf_progs.infos); in perf_env__iterate_bpf_prog_info()
184 next = rb_first(root); in perf_env__purge_bpf()
200 next = rb_first(root); in perf_env__purge_bpf()
/linux/Documentation/translations/zh_CN/core-api/
H A Drbtree.rst165 struct rb_node *rb_first(struct rb_root *tree);
170 要开始迭代，需要使用一个指向树根的指针调用rb_first()或rb_last()，它将返回一个指向
181 for (node = rb_first(&mytree); node; node = rb_next(node))
189 时间复杂度为O(logN)的rb_first()的调用，以简单地获取指针，避免了潜在的昂贵的树迭代。
/linux/scripts/gdb/linux/
H A Drbtree.py25 def rb_first(root): function
122 result = rb_first(root)
/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()
305 node = rb_first(&root.rb_root); in basic_check()
/linux/rust/helpers/
H A Drbtree.c14 return rb_first(root); in rust_helper_rb_first()
/linux/tools/perf/ui/gtk/
H A Dhists.c101 bool has_single_node = (rb_first(root) == rb_last(root)); in perf_gtk__add_callchain_flat()
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()
224 bool has_single_node = (rb_first(root) == rb_last(root)); in perf_gtk__add_callchain_graph()
226 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in perf_gtk__add_callchain_graph()
/linux/kernel/trace/
H A Dtrace_stat.c185 node = rb_first(&session->stat_root); in stat_seq_start()
200 return rb_first(&session->stat_root); in stat_seq_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()
/linux/fs/btrfs/
H A Dref-verify.c224 while ((n = rb_first(&be->roots))) { in free_block_entry()
230 while((n = rb_first(&be->refs))) { in free_block_entry()
626 for (n = rb_first(&be->refs); n; n = rb_next(n)) { in dump_block_entry()
634 for (n = rb_first(&be->roots); n; n = rb_next(n)) { in dump_block_entry()
897 while ((n = rb_first(&fs_info->block_tree))) { in btrfs_free_ref_cache()
/linux/tools/perf/ui/stdio/
H A Dhist.c129 node = rb_first(root); in __callchain__fprintf_graph()
234 node = rb_first(root); in callchain__fprintf_graph()
315 struct rb_node *rb_node = rb_first(tree); in callchain__fprintf_flat()
366 struct rb_node *rb_node = rb_first(tree); in callchain__fprintf_folded()
/linux/rust/kernel/
H A Drbtree.rs206 // - `bindings::rb_first` produces a valid pointer to a node given `root` is valid. in iter()
209 next: unsafe { bindings::rb_first(&self.root) }, in iter()
221 // - `bindings::rb_first` produces a valid pointer to a node given `root` is valid. in iter_mut()
224 next: unsafe { bindings::rb_first(from_mut(&mut self.root)) }, in iter_mut()
249 let current = unsafe { bindings::rb_first(root) }; in cursor_front_mut()
264 let current = unsafe { bindings::rb_first(root) }; in cursor_front()
/linux/tools/perf/tests/
H A Dhists_cumulate.c215 for (node = rb_first(root), i = 0; in do_test()
237 cnode = rb_entry(rb_first(root), struct callchain_node, rb_node); in do_test()
/linux/tools/perf/ui/browsers/
H A Dmap.c122 for (nd = rb_first(mb.b.entries); nd; nd = rb_next(nd)) { in map__browse()
H A Dhists.c183 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { in callchain_node__count_rows_rb_tree()
266 for (nd = rb_first(chain); nd; nd = rb_next(nd)) { in callchain__count_rows()
332 struct rb_node *nd = rb_first(&node->rb_root); in callchain_node__init_have_children_rb_tree()
334 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { in callchain_node__init_have_children_rb_tree()
371 struct rb_node *nd = rb_first(root); in callchain__init_have_children()
374 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in callchain__init_have_children()
517 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { in callchain_node__set_folding_rb_tree()
558 for (nd = rb_first(chain); nd; nd = rb_next(nd)) { in callchain__set_folding()
922 node = rb_first(root); in hist_browser__show_callchain_flat()
1026 node = rb_first(roo in hist_browser__show_callchain_folded()
[all...]
/linux/tools/bpf/resolve_btfids/
H A Dmain.c419 next = rb_first(root); in btf_id__free_all()
823 next = rb_first(root); in __symbols_patch()
848 next = rb_first(&obj->sets); in sets_patch()
1044 next = rb_first(root); in free_kfuncs()
1097 for (next = rb_first(&obj->sets); next; next = rb_next(next)) { in collect_kfuncs()
1481 for (next = rb_first(&ctx.kfuncs); next; next = rb_next(next)) { in btf2btf()
/linux/drivers/android/tests/
H A Dbinder_alloc_kunit.c430 n = rb_first(&alloc->allocated_buffers); in binder_alloc_test_mmap()
433 n = rb_first(&alloc->free_buffers); in binder_alloc_test_mmap()
/linux/fs/xfs/scrub/
H A Dbitmap.c63 for ((bn) = rb_entry_safe(rb_first(&(bitmap)->xb_root.rb_root), \ in INTERVAL_TREE_DEFINE()
338 for ((bn) = rb_entry_safe(rb_first(&(bitmap)->xb_root.rb_root), \ in INTERVAL_TREE_DEFINE()
/linux/fs/jffs2/
H A Dnodelist.h329 struct rb_node *node = rb_first(root); in frag_first()
361 #define tn_first(list) rb_entry(rb_first(list), struct jffs2_tmp_dnode_info, rb)
/linux/tools/perf/
H A Dbuiltin-kmem.c1034 next = rb_first(root); in __print_slab_result()
1087 struct rb_node *next = rb_first(&page_alloc_sorted); in __print_page_alloc_result()
1136 struct rb_node *next = rb_first(&page_caller_sorted); in __print_page_caller_result()
1323 node = rb_first(root); in sort_page_insert()
1370 node = rb_first(root); in sort_result()
/linux/net/sched/
H A Dsch_fq.c552 struct rb_node *p = rb_first(&q->delayed); in fq_enqueue()
683 while ((p = rb_first(&q->delayed)) != NULL) { in fq_dequeue()
845 struct rb_node *p = rb_first(&flow->t_root); in fq_rehash()
877 while ((p = rb_first(root)) != NULL) { in fq_rehash()
909 while ((op = rb_first(oroot)) != NULL) { in fq_resize()
/linux/fs/ext4/
H A Ddir.c604 info->curr_node = rb_first(&info->root); in ext4_dx_readdir()
626 info->curr_node = rb_first(&info->root); in ext4_dx_readdir()

12345