Home
last modified time | relevance | path

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

12345678

/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 …]
H A Dosd_client.c1138 for (n = rb_first(&osdc->osds); n; n = rb_next(n)) { in DEFINE_RB_FUNCS()
1141 for (p = rb_first(&osd->o_requests); p; ) { in DEFINE_RB_FUNCS()
1151 for (p = rb_first(&osdc->homeless_osd.o_requests); p; ) { in DEFINE_RB_FUNCS()
1296 for (n = rb_first(&osd->o_requests); n; ) { in close_osd()
1306 for (n = rb_first(&osd->o_linger_requests); n; ) { in close_osd()
1347 for (n = rb_first(&osd->o_requests); n; n = rb_next(n)) { in reopen_osd()
1439 for (n = rb_first(&osdc->osdmap->pg_pools); n; n = rb_next(n)) { in have_pool_full()
1912 rb_entry(rb_first(&osd->o_backoff_mappings), in DEFINE_RB_FUNCS()
1917 rb_entry(rb_first(&spg->backoffs), in DEFINE_RB_FUNCS()
3370 for (n = rb_first(&osdc->osds); n; n = rb_next(n)) { in handle_timeout()
[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()
H A Dnommu.c87 for (p = rb_first(&nommu_region_tree); p; p = rb_next(p)) in nommu_region_list_start()
/OK3568_Linux_fs/kernel/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()
/OK3568_Linux_fs/kernel/tools/perf/util/
H A Drb_resort.h96 for (nd = rb_first(entries); nd; nd = rb_next(nd)) { \
128 for (__nd = rb_first(&__name->entries); \
H A Dcallchain.c419 n = rb_first(&node->rb_root_in); in __sort_chain_flat()
450 n = rb_first(&node->rb_root_in); in __sort_chain_graph_abs()
481 n = rb_first(&node->rb_root_in); in __sort_chain_graph_rel()
546 n = rb_first(&new->rb_root_in); in create_child()
1020 n = rb_first(&src->rb_root_in); in merge_chain_branch()
1261 n = rb_first(&node->rb_root_in); in callchain_node_branch_counts_cumul()
1472 n = rb_first(&node->rb_root_in); in free_callchain_node()
1497 n = rb_first(&node->rb_root_in); in decay_callchain_node()
1674 struct rb_node *rb_node = rb_first(root); in count_callchain_hits()
/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()
309 node = rb_first(&root.rb_root); in rbtree_test_init()
/OK3568_Linux_fs/kernel/scripts/gdb/linux/
H A Drbtree.py13 def rb_first(root): function
110 result = rb_first(root)
/OK3568_Linux_fs/kernel/drivers/base/regmap/
H A Dregcache-rbtree.c148 for (node = rb_first(&rbtree_ctx->root); node != NULL; in rbtree_show()
225 next = rb_first(&rbtree_ctx->root); 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/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()
/OK3568_Linux_fs/kernel/drivers/md/
H A Ddm-bow.c335 first_br = container_of(rb_first(&bc->ranges), struct bow_range, node); in backup_log_sector()
419 first_br = container_of(rb_first(&bc->ranges), struct bow_range, node); in prepare_log()
549 container_of(rb_first(&bc->ranges), struct bow_range, in state_store()
603 while (rb_first(&bc->ranges)) { in dm_bow_dtr()
604 struct bow_range *br = container_of(rb_first(&bc->ranges), in dm_bow_dtr()
1175 if (!rb_first(&bc->ranges)) { in dm_bow_tablestatus()
1180 if (container_of(rb_first(&bc->ranges), struct bow_range, node) in dm_bow_tablestatus()
1188 for (i = rb_first(&bc->ranges); i; i = rb_next(i)) { in dm_bow_tablestatus()
/OK3568_Linux_fs/kernel/fs/ocfs2/
H A Dreservations.c85 node = rb_first(&resmap->m_reservations); in ocfs2_dump_resv()
140 node = rb_first(&resmap->m_reservations); in ocfs2_check_resmap()
367 node = rb_first(&resmap->m_reservations); in ocfs2_find_resv_lhs()
526 next = rb_first(root); in __ocfs2_resv_find_window()
/OK3568_Linux_fs/kernel/drivers/gpu/arm/bifrost/
H A Dmali_kbase_gwt.c56 rb_first(&(kctx->reg_rbtree_same))); in kbase_gpu_gwt_setup_pages()
58 rb_first(&(kctx->reg_rbtree_custom))); in kbase_gpu_gwt_setup_pages()
H A Dmali_kbase_debug_mem_allocs.c62 for (p = rb_first(rbtree); p; p = rb_next(p)) { in debug_zone_mem_allocs_show()
/OK3568_Linux_fs/kernel/drivers/android/
H A Dbinder_alloc.c356 for (n = rb_first(&alloc->allocated_buffers); n != NULL; in debug_low_async_space_locked()
460 for (n = rb_first(&alloc->allocated_buffers); n != NULL; in binder_alloc_new_buf_locked()
469 for (n = rb_first(&alloc->free_buffers); n != NULL; in binder_alloc_new_buf_locked()
824 while ((n = rb_first(&alloc->allocated_buffers))) { in binder_alloc_deferred_release()
904 for (n = rb_first(&alloc->allocated_buffers); n != NULL; n = rb_next(n)) in binder_alloc_print_allocated()
957 for (n = rb_first(&alloc->allocated_buffers); n != NULL; n = rb_next(n)) in binder_alloc_get_allocated_count()
/OK3568_Linux_fs/kernel/kernel/trace/
H A Dtrace_stat.c188 node = rb_first(&session->stat_root); in stat_seq_start()
203 return rb_first(&session->stat_root); in stat_seq_next()
/OK3568_Linux_fs/kernel/net/netfilter/
H A Dnf_conncount.c457 for (node = rb_first(root); node != NULL; node = rb_next(node)) { in tree_gc_worker()
472 node = rb_first(root); in tree_gc_worker()
564 while ((node = rb_first(r)) != NULL) { in destroy_tree()
/OK3568_Linux_fs/kernel/fs/btrfs/
H A Dref-verify.c239 while ((n = rb_first(&be->roots))) { in free_block_entry()
245 while((n = rb_first(&be->refs))) { in free_block_entry()
645 for (n = rb_first(&be->refs); n; n = rb_next(n)) { in dump_block_entry()
653 for (n = rb_first(&be->roots); n; n = rb_next(n)) { in dump_block_entry()
915 while ((n = rb_first(&fs_info->block_tree))) { in btrfs_free_ref_cache()
/OK3568_Linux_fs/u-boot/include/linux/
H A Drbtree.h58 extern struct rb_node *rb_first(const struct rb_root *);
/OK3568_Linux_fs/kernel/tools/perf/ui/stdio/
H A Dhist.c125 node = rb_first(root); in __callchain__fprintf_graph()
230 node = rb_first(root); in callchain__fprintf_graph()
311 struct rb_node *rb_node = rb_first(tree); in callchain__fprintf_flat()
362 struct rb_node *rb_node = rb_first(tree); in callchain__fprintf_folded()
/OK3568_Linux_fs/kernel/drivers/vfio/
H A Dvfio_iommu_type1.c239 for (p = rb_first(&dma->pfn_list); p; p = rb_next(p)) { in vfio_dma_populate_bitmap()
251 for (n = rb_first(&iommu->dma_list); n; n = rb_next(n)) { in vfio_iommu_populate_bitmap_full()
262 for (n = rb_first(&iommu->dma_list); n; n = rb_next(n)) { in vfio_dma_bitmap_alloc_all()
287 for (n = rb_first(&iommu->dma_list); n; n = rb_next(n)) { in vfio_dma_bitmap_free_all()
1121 for (n = rb_first(&iommu->dma_list); n; n = rb_next(n)) { in vfio_iova_dirty_bitmap()
1529 n = rb_first(&iommu->dma_list); in vfio_iommu_replay()
1604 for (n = rb_first(&iommu->dma_list); n; n = rb_next(n)) { in vfio_iommu_replay()
2308 while ((node = rb_first(&iommu->dma_list))) in vfio_iommu_unmap_unpin_all()
2316 n = rb_first(&iommu->dma_list); in vfio_iommu_unmap_unpin_reaccount()
2323 p = rb_first(&dma->pfn_list); in vfio_iommu_unmap_unpin_reaccount()
/OK3568_Linux_fs/kernel/drivers/infiniband/hw/mlx4/
H A Dcm.c548 while (rb_first(sl_id_map)) { in mlx4_ib_cm_paravirt_clean()
550 rb_entry(rb_first(sl_id_map), in mlx4_ib_cm_paravirt_clean()
559 nd = rb_first(sl_id_map); in mlx4_ib_cm_paravirt_clean()
/OK3568_Linux_fs/kernel/tools/perf/ui/browsers/
H A Dhists.c181 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { in callchain_node__count_rows_rb_tree()
264 for (nd = rb_first(chain); nd; nd = rb_next(nd)) { in callchain__count_rows()
330 struct rb_node *nd = rb_first(&node->rb_root); in callchain_node__init_have_children_rb_tree()
332 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { in callchain_node__init_have_children_rb_tree()
369 struct rb_node *nd = rb_first(root); in callchain__init_have_children()
372 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in callchain__init_have_children()
520 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { in callchain_node__set_folding_rb_tree()
561 for (nd = rb_first(chain); nd; nd = rb_next(nd)) { in callchain__set_folding()
929 node = rb_first(root); in hist_browser__show_callchain_flat()
1033 node = rb_first(root); in hist_browser__show_callchain_folded()
[all …]
/OK3568_Linux_fs/u-boot/lib/
H A Drbtree.c409 struct rb_node *rb_first(const struct rb_root *root) in rb_first() function
420 EXPORT_SYMBOL(rb_first);

12345678