| /fs/btrfs/ |
| D | extent_map.c | 56 RB_CLEAR_NODE(&em->rb_node); in alloc_extent_map()
96 struct rb_node **p = &root->rb_root.rb_node; in tree_insert()
97 struct rb_node *parent = NULL; in tree_insert()
99 struct rb_node *orig_parent = NULL; in tree_insert()
105 entry = rb_entry(parent, struct extent_map, rb_node); in tree_insert()
120 entry = rb_entry(parent, struct extent_map, rb_node); in tree_insert()
127 entry = rb_entry(parent, struct extent_map, rb_node); in tree_insert()
130 entry = rb_entry(parent, struct extent_map, rb_node); in tree_insert()
136 rb_link_node(&em->rb_node, orig_parent, p); in tree_insert()
137 rb_insert_color_cached(&em->rb_node, root, leftmost); in tree_insert()
[all …]
|
| D | ordered-data.c | 31 static struct rb_node *tree_insert(struct rb_root *root, u64 file_offset, in tree_insert()
32 struct rb_node *node) in tree_insert()
34 struct rb_node **p = &root->rb_node; in tree_insert()
35 struct rb_node *parent = NULL; in tree_insert()
40 entry = rb_entry(parent, struct btrfs_ordered_extent, rb_node); in tree_insert()
67 static struct rb_node *__tree_search(struct rb_root *root, u64 file_offset, in __tree_search()
68 struct rb_node **prev_ret) in __tree_search()
70 struct rb_node *n = root->rb_node; in __tree_search()
71 struct rb_node *prev = NULL; in __tree_search()
72 struct rb_node *test; in __tree_search()
[all …]
|
| D | relocation.c | 30 struct rb_node rb_node; member
38 struct rb_node rb_node; member
118 struct rb_node rb_node; member
132 struct rb_node rb_node; member
248 RB_CLEAR_NODE(&node->rb_node); in alloc_backref_node()
282 static struct rb_node *tree_insert(struct rb_root *root, u64 bytenr, in tree_insert()
283 struct rb_node *node) in tree_insert()
285 struct rb_node **p = &root->rb_node; in tree_insert()
286 struct rb_node *parent = NULL; in tree_insert()
291 entry = rb_entry(parent, struct tree_entry, rb_node); in tree_insert()
[all …]
|
| D | ulist.c | 120 struct rb_node *n = ulist->root.rb_node; in ulist_rbtree_search()
124 u = rb_entry(n, struct ulist_node, rb_node); in ulist_rbtree_search()
137 rb_erase(&node->rb_node, &ulist->root); in ulist_rbtree_erase()
146 struct rb_node **p = &ulist->root.rb_node; in ulist_rbtree_insert()
147 struct rb_node *parent = NULL; in ulist_rbtree_insert()
152 cur = rb_entry(parent, struct ulist_node, rb_node); in ulist_rbtree_insert()
161 rb_link_node(&ins->rb_node, parent, p); in ulist_rbtree_insert()
162 rb_insert_color(&ins->rb_node, &ulist->root); in ulist_rbtree_insert()
|
| D | ref-verify.c | 22 struct rb_node node;
36 struct rb_node node;
71 struct rb_node node;
78 struct rb_node **p = &root->rb_node; in insert_block_entry()
79 struct rb_node *parent_node = NULL; in insert_block_entry()
100 struct rb_node *n; in lookup_block_entry()
103 n = root->rb_node; in lookup_block_entry()
119 struct rb_node **p = &root->rb_node; in insert_root_entry()
120 struct rb_node *parent_node = NULL; in insert_root_entry()
164 struct rb_node **p = &root->rb_node; in insert_ref_entry()
[all …]
|
| D | extent_io.c | 33 return !RB_EMPTY_NODE(&state->rb_node); in extent_state_in_tree()
115 struct rb_node rb_node; member
273 struct rb_node *node; in extent_io_tree_release()
277 state = rb_entry(node, struct extent_state, rb_node); in extent_io_tree_release()
278 rb_erase(&state->rb_node, &tree->state); in extent_io_tree_release()
279 RB_CLEAR_NODE(&state->rb_node); in extent_io_tree_release()
306 RB_CLEAR_NODE(&state->rb_node); in alloc_extent_state()
326 static struct rb_node *tree_insert(struct rb_root *root, in tree_insert()
327 struct rb_node *search_start, in tree_insert()
329 struct rb_node *node, in tree_insert()
[all …]
|
| D | delayed-ref.c | 279 struct rb_node *node) in htree_insert()
281 struct rb_node **p = &root->rb_root.rb_node; in htree_insert()
282 struct rb_node *parent_node = NULL; in htree_insert()
313 struct rb_node **p = &root->rb_root.rb_node; in tree_insert()
314 struct rb_node *node = &ins->ref_node; in tree_insert()
315 struct rb_node *parent_node = NULL; in tree_insert()
344 struct rb_node *n; in find_first_ref_head()
366 struct rb_node *n; in find_ref_head()
369 n = root->rb_node; in find_ref_head()
437 struct rb_node *node = rb_next(&ref->ref_node); in merge_ref()
[all …]
|
| D | extent_map.h | 31 struct rb_node rb_node; member
67 return !RB_EMPTY_NODE(&em->rb_node); in extent_map_in_tree()
|
| D | delayed-inode.c | 346 struct rb_node *node, *prev_node = NULL; in __btrfs_lookup_delayed_item()
350 node = root->rb_node; in __btrfs_lookup_delayed_item()
354 rb_node); in __btrfs_lookup_delayed_item()
372 rb_node); in __btrfs_lookup_delayed_item()
384 rb_node); in __btrfs_lookup_delayed_item()
403 struct rb_node **p, *node; in __btrfs_add_delayed_item()
404 struct rb_node *parent_node = NULL; in __btrfs_add_delayed_item()
416 p = &root->rb_root.rb_node; in __btrfs_add_delayed_item()
417 node = &ins->rb_node; in __btrfs_add_delayed_item()
422 rb_node); in __btrfs_add_delayed_item()
[all …]
|
| D | ordered-data.h | 13 struct rb_node *last;
120 struct rb_node rb_node; member
|
| /fs/f2fs/ |
| D | extent_cache.c | 33 struct rb_node *node = root->rb_root.rb_node; in __lookup_rb_tree_slow()
37 re = rb_entry(node, struct rb_entry, rb_node); in __lookup_rb_tree_slow()
61 struct rb_node **f2fs_lookup_rb_tree_for_insert(struct f2fs_sb_info *sbi, in f2fs_lookup_rb_tree_for_insert()
63 struct rb_node **parent, in f2fs_lookup_rb_tree_for_insert()
66 struct rb_node **p = &root->rb_root.rb_node; in f2fs_lookup_rb_tree_for_insert()
71 re = rb_entry(*parent, struct rb_entry, rb_node); in f2fs_lookup_rb_tree_for_insert()
100 struct rb_node ***insert_p, in f2fs_lookup_rb_tree_ret()
101 struct rb_node **insert_parent, in f2fs_lookup_rb_tree_ret()
104 struct rb_node **pnode = &root->rb_root.rb_node; in f2fs_lookup_rb_tree_ret()
105 struct rb_node *parent = NULL, *tmp_node; in f2fs_lookup_rb_tree_ret()
[all …]
|
| /fs/ext4/ |
| D | extents_status.c | 184 struct rb_node *node; in ext4_es_print_tree()
191 es = rb_entry(node, struct extent_status, rb_node); in ext4_es_print_tree()
216 struct rb_node *node = root->rb_node; in __es_tree_search()
220 es = rb_entry(node, struct extent_status, rb_node); in __es_tree_search()
233 node = rb_next(&es->rb_node); in __es_tree_search()
234 return node ? rb_entry(node, struct extent_status, rb_node) : in __es_tree_search()
266 struct rb_node *node; in __es_find_extent_range()
287 while ((node = rb_next(&es1->rb_node)) != NULL) { in __es_find_extent_range()
288 es1 = rb_entry(node, struct extent_status, rb_node); in __es_find_extent_range()
564 struct rb_node *node; in ext4_es_try_to_merge_left()
[all …]
|
| D | block_validity.c | 24 struct rb_node node;
72 struct rb_node **n = &system_blks->root.rb_node, *node; in add_system_zone()
73 struct rb_node *parent = NULL, *new_node = NULL; in add_system_zone()
124 struct rb_node *node; in debug_print_tree()
151 struct rb_node *n; in ext4_data_block_valid_rcu()
163 n = system_blks->root.rb_node; in ext4_data_block_valid_rcu()
|
| D | extents_status.h | 60 struct rb_node rb_node; member
118 struct rb_node rb_node; member
|
| /fs/xfs/ |
| D | xfs_extent_busy.c | 33 struct rb_node **rbp; in xfs_extent_busy_insert()
34 struct rb_node *parent = NULL; in xfs_extent_busy_insert()
48 rbp = &pag->pagb_tree.rb_node; in xfs_extent_busy_insert()
51 busyp = rb_entry(parent, struct xfs_extent_busy, rb_node); in xfs_extent_busy_insert()
64 rb_link_node(&new->rb_node, parent, rbp); in xfs_extent_busy_insert()
65 rb_insert_color(&new->rb_node, &pag->pagb_tree); in xfs_extent_busy_insert()
89 struct rb_node *rbp; in xfs_extent_busy_search()
96 rbp = pag->pagb_tree.rb_node; in xfs_extent_busy_search()
100 busyp = rb_entry(rbp, struct xfs_extent_busy, rb_node); in xfs_extent_busy_search()
228 rb_erase(&busyp->rb_node, &pag->pagb_tree); in xfs_extent_busy_update_extent()
[all …]
|
| /fs/ubifs/ |
| D | log.c | 32 struct rb_node *p; in ubifs_search_bud()
36 p = c->buds.rb_node; in ubifs_search_bud()
61 struct rb_node *p; in ubifs_get_wbuf()
69 p = c->buds.rb_node; in ubifs_get_wbuf()
114 struct rb_node **p, *parent = NULL; in ubifs_add_bud()
119 p = &c->buds.rb_node; in ubifs_add_bud()
299 struct rb_node *p; in remove_buds()
306 struct rb_node *p1 = p; in remove_buds()
549 struct rb_node rb;
563 struct rb_node **p = &done_tree->rb_node, *parent = NULL; in done_already()
|
| D | orphan.c | 49 struct rb_node **p, *parent = NULL; in orphan_add()
64 p = &c->orph_tree.rb_node; in orphan_add()
99 struct rb_node *p; in lookup_orphan()
101 p = c->orph_tree.rb_node; in lookup_orphan()
585 struct rb_node **p, *parent = NULL; in insert_dead_orphan()
592 p = &c->orph_tree.rb_node; in insert_dead_orphan()
839 struct rb_node rb;
866 struct rb_node **p, *parent = NULL; in dbg_ins_check_orphan()
873 p = &root->rb_node; in dbg_ins_check_orphan()
894 struct rb_node *p; in dbg_find_check_orphan()
[all …]
|
| /fs/proc/ |
| D | task_nommu.c | 25 struct rb_node *p; in task_mem()
86 struct rb_node *p; in task_vsize()
104 struct rb_node *p; in task_statm()
193 struct rb_node *p = _p; in show_map()
202 struct rb_node *p; in m_start()
245 struct rb_node *p = _p; in m_next()
|
| D | nommu.c | 76 struct rb_node *p = _p; in nommu_region_list_show()
83 struct rb_node *p; in nommu_region_list_start()
102 return rb_next((struct rb_node *) v); in nommu_region_list_next()
|
| /fs/ocfs2/ |
| D | reservations.c | 81 struct rb_node *node; in ocfs2_dump_resv()
140 struct rb_node *node; in ocfs2_check_resmap()
274 struct rb_node *node; in ocfs2_resmap_clear_all_resv()
310 struct rb_node *parent = NULL; in ocfs2_resv_insert()
311 struct rb_node **p = &root->rb_node; in ocfs2_resv_insert()
363 struct rb_node *node = resmap->m_reservations.rb_node; in ocfs2_find_resv_lhs()
469 struct rb_node *prev, *next; in __ocfs2_resv_find_window()
|
| D | uptodate.c | 52 struct rb_node c_node;
134 struct rb_node *node; in ocfs2_purge_copied_metadata_tree()
212 struct rb_node * n = ci->ci_cache.ci_tree.rb_node; in ocfs2_search_cache_tree()
309 struct rb_node *parent = NULL; in __ocfs2_insert_cache_tree()
310 struct rb_node **p = &ci->ci_cache.ci_tree.rb_node; in __ocfs2_insert_cache_tree()
|
| /fs/nfs/blocklayout/ |
| D | extent_tree.c | 13 ext_node(struct rb_node *node) in ext_node()
21 struct rb_node *node = rb_first(root); in ext_tree_first()
28 struct rb_node *node = rb_prev(&be->be_node); in ext_tree_prev()
35 struct rb_node *node = rb_next(&be->be_node); in ext_tree_next()
48 struct rb_node *node = root->rb_node; in __ext_tree_search()
139 struct rb_node **p = &root->rb_node, *parent = NULL; in __ext_tree_insert()
325 struct rb_node *node; in __ext_tree_lookup()
328 node = root->rb_node; in __ext_tree_lookup()
|
| /fs/overlayfs/ |
| D | readdir.c | 24 struct rb_node node;
61 static struct ovl_cache_entry *ovl_cache_entry_from_node(struct rb_node *n) in ovl_cache_entry_from_node()
67 struct rb_node ***link, in ovl_cache_entry_find_link()
68 struct rb_node **parent) in ovl_cache_entry_find_link()
71 struct rb_node **newp = *link; in ovl_cache_entry_find_link()
95 struct rb_node *node = root->rb_node; in ovl_cache_entry_find()
177 struct rb_node **newp = &rdd->root->rb_node; in ovl_cache_entry_add_rb()
178 struct rb_node *parent = NULL; in ovl_cache_entry_add_rb()
582 struct rb_node **newp = &root->rb_node; in ovl_dir_read_impure()
583 struct rb_node *parent = NULL; in ovl_dir_read_impure()
|
| /fs/nilfs2/ |
| D | the_nilfs.c | 788 struct rb_node *n; in nilfs_lookup_root()
792 n = nilfs->ns_cptree.rb_node; in nilfs_lookup_root()
794 root = rb_entry(n, struct nilfs_root, rb_node); in nilfs_lookup_root()
814 struct rb_node **p, *parent; in nilfs_find_or_create_root()
828 p = &nilfs->ns_cptree.rb_node; in nilfs_find_or_create_root()
833 root = rb_entry(parent, struct nilfs_root, rb_node); in nilfs_find_or_create_root()
854 rb_link_node(&new->rb_node, parent, p); in nilfs_find_or_create_root()
855 rb_insert_color(&new->rb_node, &nilfs->ns_cptree); in nilfs_find_or_create_root()
873 rb_erase(&root->rb_node, &nilfs->ns_cptree); in nilfs_put_root()
|
| /fs/ceph/ |
| D | inode.c | 118 struct rb_node **p; in __get_or_create_frag()
119 struct rb_node *parent = NULL; in __get_or_create_frag()
123 p = &ci->i_fragtree.rb_node; in __get_or_create_frag()
158 struct rb_node *n = ci->i_fragtree.rb_node; in __ceph_find_frag()
325 struct rb_node *rb_node; in ceph_fill_fragtree() local
340 rb_node = rb_first(&ci->i_fragtree); in ceph_fill_fragtree()
341 frag = rb_entry(rb_node, struct ceph_inode_frag, node); in ceph_fill_fragtree()
342 if (frag->frag != ceph_frag_make(0, 0) || rb_next(rb_node)) in ceph_fill_fragtree()
359 rb_node = rb_first(&ci->i_fragtree); in ceph_fill_fragtree()
370 while (rb_node) { in ceph_fill_fragtree()
[all …]
|