| /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()
248 return p ? rb_next(p) : NULL; in m_next()
|
| D | nommu.c | 92 for (p = rb_first(&nommu_region_tree); p; p = rb_next(p)) in nommu_region_list_start()
106 return rb_next((struct rb_node *) v); in nommu_region_list_next()
|
| /linux-4.19.296/lib/ |
| D | timerqueue.c | 102 next = rb_next(&node->node); in timerqueue_iterate_next()
|
| 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()
|
| D | rbtree.c | 528 struct rb_node *rb_next(const struct rb_node *node) in rb_next() function
558 EXPORT_SYMBOL(rb_next);
|
| /linux-4.19.296/fs/btrfs/ |
| D | extent_map.c | 115 parent = rb_next(parent); in tree_insert()
167 prev = rb_next(prev); in __tree_search()
262 rb = rb_next(&em->rb_node); in try_merge_map()
473 next = rb_next(&em->rb_node); in next_extent_map()
|
| D | delayed-ref.c | 188 n = rb_next(&entry->href_node); in find_ref_head()
246 struct rb_node *node = rb_next(&ref->ref_node); in merge_ref()
253 node = rb_next(node); in merge_ref()
315 for (node = rb_first(&head->ref_tree); node; node = rb_next(node)) { in btrfs_merge_delayed_refs()
373 node = rb_next(&head->href_node); in btrfs_select_ref_head()
|
| D | free-space-cache.c | 643 for (n = rb_first(&ctl->free_space_offset); n; n = rb_next(n)) { in merge_space_tree()
966 node = rb_next(node); in write_cache_extent_entries()
1550 n = rb_next(n); in tree_search_offset()
1623 n = rb_next(&entry->offset_index); in tree_search_offset()
1832 for (node = &entry->offset_index; node; node = rb_next(node)) { in find_free_space()
1941 struct rb_node *next = rb_next(&bitmap_info->offset_index); in remove_from_bitmap()
2497 for (n = rb_first(&ctl->free_space_offset); n; n = rb_next(n)) { in btrfs_dump_free_space()
2561 node = rb_next(&entry->offset_index); in __btrfs_return_cluster_to_free_space()
2778 node = rb_next(&entry->offset_index); in btrfs_alloc_from_cluster()
2792 node = rb_next(&entry->offset_index); in btrfs_alloc_from_cluster()
[all …]
|
| D | ref-verify.c | 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()
958 n = rb_next(n); in btrfs_free_ref_tree_range()
|
| /linux-4.19.296/drivers/base/regmap/ |
| D | regcache-rbtree.c | 153 node = rb_next(node)) { in rbtree_show()
242 next = rb_next(&rbtree_node->node); 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/ext4/ |
| D | extents_status.c | 189 node = rb_next(node); in ext4_es_print_tree()
227 node = rb_next(&es->rb_node); in __es_tree_search()
275 while ((node = rb_next(&es1->rb_node)) != NULL) { in ext4_es_find_delayed_extent_range()
443 node = rb_next(&es->rb_node); in ext4_es_try_to_merge_right()
905 node = rb_next(&es->rb_node); in __es_remove_extent()
913 node = rb_next(&es->rb_node); in __es_remove_extent()
1204 node = rb_next(&es->rb_node); in es_do_reclaim_extents()
|
| D | block_validity.c | 113 node = rb_next(new_node); in add_system_zone()
138 node = rb_next(node); in debug_print_tree()
|
| /linux-4.19.296/fs/ocfs2/ |
| D | reservations.c | 105 node = rb_next(node); in ocfs2_dump_resv()
183 node = rb_next(node); in ocfs2_check_resmap()
392 node = rb_next(node); in ocfs2_find_resv_lhs()
573 next = rb_next(prev); in __ocfs2_resv_find_window()
|
| /linux-4.19.296/fs/f2fs/ |
| D | extent_cache.c | 139 tmp_node = rb_next(parent); in f2fs_lookup_rb_tree_ret()
156 tmp_node = rb_next(&re->rb_node); in f2fs_lookup_rb_tree_ret()
173 next = rb_next(cur); in f2fs_check_rb_tree_consistence()
302 next = rb_next(node); in __free_extent_tree()
565 struct rb_node *node = rb_next(&en->rb_node); in f2fs_update_extent_tree_range()
|
| /linux-4.19.296/include/linux/ |
| D | rbtree.h | 82 extern struct rb_node *rb_next(const struct rb_node *);
|
| D | rbtree_augmented.h | 174 *leftmost = rb_next(node); in __rb_erase_augmented()
|
| /linux-4.19.296/fs/jffs2/ |
| D | nodelist.h | 347 #define frag_next(frag) rb_entry(rb_next(&(frag)->rb), struct jffs2_node_frag, rb)
354 #define tn_next(tn) rb_entry(rb_next(&(tn)->rb), struct jffs2_tmp_dnode_info, rb)
|
| /linux-4.19.296/fs/ext2/ |
| D | balloc.c | 235 n = rb_next(n); in __rsv_window_dump()
812 next = rb_next(&rsv->rsv_node); in find_next_reservable_window()
1050 next = rb_next(&my_rsv->rsv_node); in try_to_extend_reservation()
|
| /linux-4.19.296/fs/dlm/ |
| D | recover.c | 909 for (n = rb_first(&ls->ls_rsbtbl[i].keep); n; n = rb_next(n)) { in dlm_create_root_list()
946 next = rb_next(n); in dlm_clear_toss()
|
| D | debug_fs.c | 456 for (node = rb_first(tree); node; node = rb_next(node)) { in table_seq_start()
520 next = rb_next(&rp->res_hashnode); in table_seq_next()
|
| /linux-4.19.296/drivers/dma-buf/ |
| D | sw_sync.c | 285 parent = rb_next(&pt->node); in sync_pt_create()
|
| /linux-4.19.296/fs/ |
| D | eventpoll.c | 832 for (rbp = rb_first_cached(&ep->rbr); rbp; rbp = rb_next(rbp)) { in ep_free()
951 for (rbp = rb_first_cached(&ep->rbr); rbp; rbp = rb_next(rbp)) { in ep_show_fdinfo()
1075 for (rbp = rb_first_cached(&ep->rbr); rbp; rbp = rb_next(rbp)) { in ep_find_tfd()
1870 for (rbp = rb_first_cached(&ep->rbr); rbp; rbp = rb_next(rbp)) { in ep_loop_check_proc()
|
| /linux-4.19.296/fs/kernfs/ |
| D | dir.c | 1240 rbn = rb_next(&pos->rb); in kernfs_next_descendant_post()
1643 struct rb_node *node = rb_next(&pos->rb); in kernfs_dir_pos()
1658 struct rb_node *node = rb_next(&pos->rb); in kernfs_dir_next_pos()
|
| /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 | xattr.c | 602 p = rb_next(p); in __copy_xattr_names()
620 p = rb_next(tmp); in __ceph_destroy_xattrs()
776 p = rb_next(p); in __ceph_build_xattrs_blob()
|