| /linux-4.19.296/fs/proc/ |
| D | task_nommu.c | 29 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()
|
| D | nommu.c | 92 for (p = rb_first(&nommu_region_tree); p; p = rb_next(p)) in nommu_region_list_start()
|
| /linux-4.19.296/lib/ |
| D | rbtree_test.c | 212 for (rb = rb_first(&root.rb_root); rb; rb = rb_next(rb)) { in check()
238 for (rb = rb_first(&root.rb_root); rb; rb = rb_next(rb)) { in check_augmented()
297 for (node = rb_first(&root.rb_root); node; node = rb_next(node)) in rbtree_test_init()
311 node = rb_first(&root.rb_root); in rbtree_test_init()
|
| D | rbtree.c | 502 struct rb_node *rb_first(const struct rb_root *root) in rb_first() function
513 EXPORT_SYMBOL(rb_first);
|
| /linux-4.19.296/drivers/base/regmap/ |
| D | regcache-rbtree.c | 152 for (node = rb_first(&rbtree_ctx->root); node != NULL; in rbtree_show()
239 next = rb_first(&rbtree_ctx->root); in regcache_rbtree_exit()
490 for (node = rb_first(&rbtree_ctx->root); node; node = rb_next(node)) { in regcache_rbtree_sync()
530 for (node = rb_first(&rbtree_ctx->root); node; node = rb_next(node)) { in regcache_rbtree_drop()
|
| /linux-4.19.296/fs/ocfs2/ |
| D | reservations.c | 96 node = rb_first(&resmap->m_reservations); in ocfs2_dump_resv()
151 node = rb_first(&resmap->m_reservations); in ocfs2_check_resmap()
378 node = rb_first(&resmap->m_reservations); in ocfs2_find_resv_lhs()
537 next = rb_first(root); in __ocfs2_resv_find_window()
|
| /linux-4.19.296/include/linux/ |
| D | rbtree.h | 84 extern struct rb_node *rb_first(const struct rb_root *);
|
| /linux-4.19.296/fs/btrfs/ |
| D | ref-verify.c | 250 while ((n = rb_first(&be->roots))) { in free_block_entry()
256 while((n = rb_first(&be->refs))) { in free_block_entry()
655 for (n = rb_first(&be->refs); n; n = rb_next(n)) { in dump_block_entry()
663 for (n = rb_first(&be->roots); n; n = rb_next(n)) { in dump_block_entry()
909 while ((n = rb_first(&fs_info->block_tree))) { in btrfs_free_ref_cache()
|
| D | free-space-cache.c | 643 for (n = rb_first(&ctl->free_space_offset); n; n = rb_next(n)) { in merge_space_tree()
933 struct rb_node *node = rb_first(&ctl->free_space_offset); in write_cache_extent_entries()
946 node = rb_first(&cluster->root); in write_cache_extent_entries()
968 node = rb_first(&cluster->root); in write_cache_extent_entries()
2088 node = rb_first(&cluster->root); in insert_into_bitmap()
2497 for (n = rb_first(&ctl->free_space_offset); n; n = rb_next(n)) { in btrfs_dump_free_space()
2556 node = rb_first(&cluster->root); in __btrfs_return_cluster_to_free_space()
2766 node = rb_first(&cluster->root); in btrfs_alloc_from_cluster()
3448 entry = rb_entry(rb_first(&ctl->free_space_offset), in btrfs_find_ino_for_alloc()
|
| D | delayed-ref.c | 190 n = rb_first(root); in find_ref_head()
315 for (node = rb_first(&head->ref_tree); node; node = rb_next(node)) { in btrfs_merge_delayed_refs()
|
| D | backref.c | 643 while ((rnode = rb_first(&preftrees->indirect.root))) { in resolve_indirect_refs()
737 while ((node = rb_first(&tree->root))) { in add_missing_keys()
786 for (n = rb_first(&head->ref_tree); n; n = rb_next(n)) { in add_delayed_refs()
1285 node = rb_first(&preftrees.direct.root);
|
| /linux-4.19.296/fs/dlm/ |
| D | debug_fs.c | 456 for (node = rb_first(tree); node; node = rb_next(node)) { in table_seq_start()
488 node = rb_first(tree); in table_seq_start()
554 next = rb_first(tree); in table_seq_next()
|
| D | recover.c | 909 for (n = rb_first(&ls->ls_rsbtbl[i].keep); n; n = rb_next(n)) { in dlm_create_root_list()
945 for (n = rb_first(&ls->ls_rsbtbl[i].toss); n; n = next) { in dlm_clear_toss()
|
| D | lockspace.c | 825 while ((n = rb_first(&ls->ls_rsbtbl[i].keep))) { in release_lockspace()
831 while ((n = rb_first(&ls->ls_rsbtbl[i].toss))) { in release_lockspace()
|
| /linux-4.19.296/fs/jffs2/ |
| D | nodelist.h | 329 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-4.19.296/fs/ext4/ |
| D | dir.c | 569 info->curr_node = rb_first(&info->root); in ext4_dx_readdir()
591 info->curr_node = rb_first(&info->root); in ext4_dx_readdir()
|
| D | block_validity.c | 132 node = rb_first(&sbi->system_blks->root); in debug_print_tree()
|
| /linux-4.19.296/fs/btrfs/tests/ |
| D | extent-map-tests.c | 16 node = rb_first(&em_tree->map); in free_extent_map_tree()
|
| /linux-4.19.296/fs/ceph/ |
| D | debugfs.c | 60 for (rp = rb_first(&mdsc->request_tree); rp; rp = rb_next(rp)) { in mdsc_show()
|
| D | caps.c | 450 for (p = rb_first(&ci->i_caps); p; p = rb_next(p)) { in __ceph_get_cap_mds()
793 for (p = rb_first(&ci->i_caps); p; p = rb_next(p)) { in __ceph_caps_issued()
824 for (p = rb_first(&ci->i_caps); p; p = rb_next(p)) { in __ceph_caps_issued_other()
874 for (p = rb_first(&ci->i_caps); p; p = rb_next(p)) { in __ceph_caps_issued_mask()
900 for (q = rb_first(&ci->i_caps); q != p; in __ceph_caps_issued_mask()
925 for (p = rb_first(&ci->i_caps); p; p = rb_next(p)) { in __ceph_caps_revoking_other()
989 for (p = rb_first(&ci->i_caps); p; p = rb_next(p)) { in __ceph_caps_mds_wanted()
1006 return rb_first(&ci->i_caps) == rb_last(&ci->i_caps); in __ceph_is_single_caps()
1257 p = rb_first(&ci->i_caps); in ceph_queue_caps_release()
1935 for (p = rb_first(&ci->i_caps); p; p = rb_next(p)) { in ceph_check_caps()
|
| D | xattr.c | 590 p = rb_first(&ci->i_xattrs.index); in __copy_xattr_names()
613 p = rb_first(&ci->i_xattrs.index); in __ceph_destroy_xattrs()
762 p = rb_first(&ci->i_xattrs.index); in __ceph_build_xattrs_blob()
|
| /linux-4.19.296/fs/f2fs/ |
| D | extent_cache.c | 166 struct rb_node *cur = rb_first(root), *next; in f2fs_check_rb_tree_consistence()
300 node = rb_first(&et->root); in __free_extent_tree()
|
| /linux-4.19.296/fs/gfs2/ |
| D | rgrp.c | 556 n = rb_first(&sdp->sd_rindex_tree); in gfs2_rgrpd_get_first()
578 n = rb_first(&sdp->sd_rindex_tree); in gfs2_rgrpd_get_next()
716 while ((n = rb_first(&rgd->rd_rstree))) { in return_all_reservations()
729 while ((n = rb_first(&sdp->sd_rindex_tree))) { in gfs2_clear_rgrpd()
2267 for (n = rb_first(&rgd->rd_rstree); n; n = rb_next(&trs->rs_node)) { in gfs2_rgrp_dump()
|
| /linux-4.19.296/block/ |
| D | bfq-cgroup.c | 752 entity = bfq_entity_of(rb_first(active)); in bfq_reparent_active_entities()
754 for (; entity ; entity = bfq_entity_of(rb_first(active))) in bfq_reparent_active_entities()
|
| /linux-4.19.296/fs/nfs/ |
| D | nfs4state.c | 203 for (pos = rb_first(&server->state_owners); in nfs4_get_renew_cred_server_locked()
1717 for (pos = rb_first(&server->state_owners); in nfs4_reset_seqids()
1769 for (pos = rb_first(&server->state_owners); in nfs4_clear_reclaim_server()
1877 for (pos = rb_first(&server->state_owners); in nfs4_do_reclaim()
|