Home
last modified time | relevance | path

Searched refs:rb_node (Results 1 – 25 of 125) sorted by relevance

12345

/fs/btrfs/
A Dmisc.h67 struct rb_node rb_node; member
71 static inline struct rb_node *rb_simple_search(const struct rb_root *root, u64 bytenr) in rb_simple_search()
73 struct rb_node *node = root->rb_node; in rb_simple_search()
77 entry = rb_entry(node, struct rb_simple_node, rb_node); in rb_simple_search()
98 static inline struct rb_node *rb_simple_search_first(const struct rb_root *root, in rb_simple_search_first()
101 struct rb_node *node = root->rb_node, *ret = NULL; in rb_simple_search_first()
105 entry = rb_entry(node, struct rb_simple_node, rb_node); in rb_simple_search_first()
124 static int rb_simple_node_bytenr_cmp(struct rb_node *new, const struct rb_node *existing) in rb_simple_node_bytenr_cmp()
126 struct rb_simple_node *new_entry = rb_entry(new, struct rb_simple_node, rb_node); in rb_simple_node_bytenr_cmp()
137 static inline struct rb_node *rb_simple_insert(struct rb_root *root, in rb_simple_insert()
[all …]
A Dextent_map.c93 struct rb_node **p = &root->rb_node; in tree_insert()
142 struct rb_node *n = root->rb_node; in tree_search()
346 struct rb_node *rb; in try_merge_map()
515 struct rb_node *rb_node; in lookup_extent_mapping() local
520 if (!rb_node) { in lookup_extent_mapping()
527 em = rb_entry(rb_node, struct extent_map, rb_node); in lookup_extent_mapping()
610 rb_replace_node(&cur->rb_node, &new->rb_node, &tree->root); in replace_extent_mapping()
618 struct rb_node *next; in next_extent_map()
628 struct rb_node *prev; in prev_extent_map()
764 struct rb_node *node; in drop_all_extent_maps_fast()
[all …]
A Dordered-data.c39 struct rb_node **p = &root->rb_node; in tree_insert()
67 struct rb_node *n = root->rb_node; in __tree_search()
69 struct rb_node *test; in __tree_search()
93 rb_node); in __tree_search()
101 rb_node); in __tree_search()
107 rb_node); in __tree_search()
131 struct rb_node *ret; in ordered_tree_search()
136 rb_node); in ordered_tree_search()
230 struct rb_node *node; in insert_ordered_extent()
515 rb_node); in btrfs_mark_ordered_io_finished()
[all …]
A Dulist.c132 static int ulist_node_val_key_cmp(const void *key, const struct rb_node *node) in ulist_node_val_key_cmp()
135 const struct ulist_node *unode = rb_entry(node, struct ulist_node, rb_node); in ulist_node_val_key_cmp()
147 struct rb_node *node; in ulist_rbtree_search()
150 return rb_entry_safe(node, struct ulist_node, rb_node); in ulist_rbtree_search()
155 rb_erase(&node->rb_node, &ulist->root); in ulist_rbtree_erase()
162 static int ulist_node_val_cmp(struct rb_node *new, const struct rb_node *existing) in ulist_node_val_cmp()
164 const struct ulist_node *unode = rb_entry(new, struct ulist_node, rb_node); in ulist_node_val_cmp()
171 struct rb_node *node; in ulist_rbtree_insert()
173 node = rb_find_add(&ins->rb_node, &ulist->root, ulist_node_val_cmp); in ulist_rbtree_insert()
A Dextent-io-tree.c206 struct rb_node *next = rb_next(&state->rb_node); in next_state()
213 struct rb_node *next = rb_prev(&state->rb_node); in prev_state()
243 struct rb_node **node = &root->rb_node; in tree_search_for_insert()
244 struct rb_node *prev = NULL; in tree_search_for_insert()
293 struct rb_node **node = &root->rb_node; in tree_search_prev_next()
425 struct rb_node **node; in insert_state()
433 node = &tree->state.rb_node; in insert_state()
507 struct rb_node **node; in split_state()
517 parent = &orig->rb_node; in split_state()
1054 struct rb_node **p = NULL; in set_extent_bit()
[all …]
A Dref-verify.c25 struct rb_node node;
39 struct rb_node node;
74 struct rb_node node;
101 struct rb_node *node; in insert_block_entry()
109 struct rb_node *node; in lookup_block_entry()
138 struct rb_node *node; in insert_root_entry()
176 struct rb_node *node; in insert_ref_entry()
222 struct rb_node *n; in free_block_entry()
619 struct rb_node *n; in dump_block_entry()
891 struct rb_node *n; in btrfs_free_ref_cache()
[all …]
A Dbackref.c444 struct rb_node **p = &preftrees->direct.root.rb_root.rb_node; in is_shared_data_backref()
893 struct rb_node *n; in add_delayed_refs()
3191 struct rb_node *rb_node; in handle_direct_tree_backref() local
3221 if (!rb_node) { in handle_direct_tree_backref()
3237 upper = rb_entry(rb_node, struct btrfs_backref_node, rb_node); in handle_direct_tree_backref()
3271 struct rb_node *rb_node; in handle_indirect_tree_backref() local
3360 if (!rb_node) { in handle_indirect_tree_backref()
3405 rb_node); in handle_indirect_tree_backref()
3413 if (rb_node) { in handle_indirect_tree_backref()
3564 struct rb_node *rb_node; in btrfs_backref_finish_upper_links() local
[all …]
A Drelocation.c96 struct rb_node rb_node; member
117 struct rb_node rb_node; member
308 struct rb_node *rb_node; in find_reloc_root() local
316 node = rb_entry(rb_node, struct mapping_node, rb_node); in find_reloc_root()
481 struct rb_node *rb_node; in __add_reloc_root() local
513 struct rb_node *rb_node; in __del_reloc_root() local
557 struct rb_node *rb_node; in __update_reloc_root() local
565 node = rb_entry(rb_node, struct mapping_node, rb_node); in __update_reloc_root()
578 if (rb_node) in __update_reloc_root()
1931 struct rb_node *rb_node; in free_block_list() local
[all …]
A Ddefrag.c26 struct rb_node rb_node; member
63 static int inode_defrag_cmp(struct rb_node *new, const struct rb_node *existing) in inode_defrag_cmp()
82 struct rb_node *node; in btrfs_insert_inode_defrag()
84 node = rb_find_add(&defrag->rb_node, &fs_info->defrag_inodes, inode_defrag_cmp); in btrfs_insert_inode_defrag()
88 entry = rb_entry(node, struct inode_defrag, rb_node); in btrfs_insert_inode_defrag()
164 struct rb_node *p; in btrfs_pick_defrag_inode()
165 struct rb_node *parent = NULL; in btrfs_pick_defrag_inode()
172 p = fs_info->defrag_inodes.rb_node; in btrfs_pick_defrag_inode()
175 entry = rb_entry(parent, struct inode_defrag, rb_node); in btrfs_pick_defrag_inode()
188 entry = rb_entry_safe(parent, struct inode_defrag, rb_node); in btrfs_pick_defrag_inode()
[all …]
A Ddelayed-inode.c329 RB_CLEAR_NODE(&item->rb_node); in btrfs_alloc_delayed_item()
341 struct btrfs_delayed_item, rb_node); in delayed_item_index_cmp()
364 struct rb_node *node; in __btrfs_lookup_delayed_item()
370 static int btrfs_delayed_item_cmp(const struct rb_node *new, in btrfs_delayed_item_cmp()
371 const struct rb_node *exist) in btrfs_delayed_item_cmp()
374 rb_entry(new, struct btrfs_delayed_item, rb_node); in btrfs_delayed_item_cmp()
383 struct rb_node *exist; in __btrfs_add_delayed_item()
420 if (RB_EMPTY_NODE(&delayed_item->rb_node)) in __btrfs_remove_delayed_item()
433 rb_erase_cached(&delayed_item->rb_node, root); in __btrfs_remove_delayed_item()
434 RB_CLEAR_NODE(&delayed_item->rb_node); in __btrfs_remove_delayed_item()
[all …]
/fs/ext4/
A Dextents_status.c213 struct rb_node *node; in ext4_es_print_tree()
245 struct rb_node *node = root->rb_node; in __es_tree_search()
295 struct rb_node *node; in __es_find_extent_range()
604 struct rb_node *node; in ext4_es_try_to_merge_left()
628 struct rb_node *node; in ext4_es_try_to_merge_right()
822 struct rb_node **p = &tree->root.rb_node; in __es_insert_extent()
1085 rb_node); in ext4_es_lookup_extent()
1247 struct rb_node *node = root->rb_node; in __pr_tree_search()
1346 rb_node); in get_rsvd()
1391 rb_node); in get_rsvd()
[all …]
A Dblock_validity.c24 struct rb_node node;
74 struct rb_node **n = &system_blks->root.rb_node, *node; in add_system_zone()
75 struct rb_node *parent = NULL, *new_node; in add_system_zone()
127 struct rb_node *node; in debug_print_tree()
301 struct rb_node *n; in ext4_sb_block_valid()
319 n = system_blks->root.rb_node; in ext4_sb_block_valid()
A Dextents_status.h66 struct rb_node rb_node; member
124 struct rb_node rb_node; member
/fs/xfs/
A Dxfs_extent_busy.c41 struct rb_node **rbp; in xfs_extent_busy_insert_list()
42 struct rb_node *parent = NULL; in xfs_extent_busy_insert_list()
56 rbp = &eb->eb_tree.rb_node; in xfs_extent_busy_insert_list()
72 rb_link_node(&new->rb_node, parent, rbp); in xfs_extent_busy_insert_list()
118 struct rb_node *rbp; in xfs_extent_busy_search()
124 rbp = eb->eb_tree.rb_node; in xfs_extent_busy_search()
254 rb_erase(&busyp->rb_node, &eb->eb_tree); in xfs_extent_busy_update_extent()
315 struct rb_node *rbp; in xfs_extent_busy_reuse()
320 rbp = eb->eb_tree.rb_node; in xfs_extent_busy_reuse()
366 struct rb_node *rbp; in xfs_extent_busy_trim()
[all …]
/fs/f2fs/
A Dextent_cache.c185 struct rb_node *node = root->rb_root.rb_node; in __lookup_extent_node()
221 struct rb_node ***insert_p, in __lookup_extent_node_ret()
225 struct rb_node **pnode = &root->rb_root.rb_node; in __lookup_extent_node_ret()
276 struct extent_node, rb_node); in __lookup_extent_node_ret()
292 struct rb_node *parent, struct rb_node **p, in __attach_extent_node()
384 struct rb_node *node, *next; in __free_extent_tree()
579 struct rb_node **insert_p, in __insert_extent_tree()
584 struct rb_node **p = &et->root.rb_root.rb_node; in __insert_extent_tree()
585 struct rb_node *parent = NULL; in __insert_extent_tree()
744 struct rb_node *node = rb_next(&en->rb_node); in __update_extent_tree_range()
[all …]
/fs/
A Dxattr.c1277 const struct rb_node *node) in rbtree_simple_xattr_node_cmp()
1303 struct rb_node *rbp; in simple_xattr_get()
1353 struct rb_node *parent = NULL, **rbp; in simple_xattr_set()
1370 rbp = &xattrs->rb_root.rb_node; in simple_xattr_set()
1392 rb_replace_node(&old_xattr->rb_node, in simple_xattr_set()
1393 &new_xattr->rb_node, &xattrs->rb_root); in simple_xattr_set()
1464 struct rb_node *rbp; in simple_xattr_list()
1516 const struct rb_node *node) in rbtree_simple_xattr_less()
1560 struct rb_node *rbp; in simple_xattrs_free()
1567 struct rb_node *rbp_next; in simple_xattrs_free()
[all …]
A Dmount.h15 struct rb_node *mnt_last_node; /* last (rightmost) mount in the rbtree */
16 struct rb_node *mnt_first_node; /* first (leftmost) mount in the rbtree */
33 struct rb_node mnt_ns_tree_node; /* node in the mnt_ns_tree */
55 struct rb_node mnt_node; /* node in the ns->mounts rbtree */
/fs/ubifs/
A Dlog.c32 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()
A Dorphan.c56 struct rb_node **p, *parent = NULL; in ubifs_add_orphan()
70 p = &c->orph_tree.rb_node; in ubifs_add_orphan()
100 struct rb_node *p; in lookup_orphan()
102 p = c->orph_tree.rb_node; in lookup_orphan()
732 struct rb_node rb;
759 struct rb_node **p, *parent = NULL; in dbg_ins_check_orphan()
766 p = &root->rb_node; in dbg_ins_check_orphan()
787 struct rb_node *p; in dbg_find_check_orphan()
789 p = root->rb_node; in dbg_find_check_orphan()
/fs/ocfs2/
A Dreservations.c76 struct rb_node *node; in ocfs2_dump_resv()
135 struct rb_node *node; in ocfs2_check_resmap()
267 struct rb_node *node; in ocfs2_resmap_clear_all_resv()
303 struct rb_node *parent = NULL; in ocfs2_resv_insert()
304 struct rb_node **p = &root->rb_node; in ocfs2_resv_insert()
356 struct rb_node *node = resmap->m_reservations.rb_node; in ocfs2_find_resv_lhs()
462 struct rb_node *prev, *next; in __ocfs2_resv_find_window()
A Duptodate.c50 struct rb_node c_node;
132 struct rb_node *node; in ocfs2_purge_copied_metadata_tree()
210 struct rb_node * n = ci->ci_cache.ci_tree.rb_node; in ocfs2_search_cache_tree()
307 struct rb_node *parent = NULL; in __ocfs2_insert_cache_tree()
308 struct rb_node **p = &ci->ci_cache.ci_tree.rb_node; in __ocfs2_insert_cache_tree()
/fs/proc/
A Dnommu.c74 struct rb_node *p = _p; in nommu_region_list_show()
81 struct rb_node *p; in nommu_region_list_start()
100 return rb_next((struct rb_node *) v); in nommu_region_list_next()
/fs/ntfs3/
A Dbitmap.c26 struct rb_node node;
125 struct rb_node *node, *next; in wnd_close()
144 struct rb_node **p = &root->rb_node; in rb_lookup()
145 struct rb_node *r = NULL; in rb_lookup()
169 struct rb_node **p = &root->rb_node; in rb_insert_count()
170 struct rb_node *parent = NULL; in rb_insert_count()
202 struct rb_node **p = &root->rb_node; in rb_insert_start()
236 struct rb_node *n; in wnd_add_free_ext()
364 struct rb_node *n, *n3; in wnd_remove_free_ext()
873 struct rb_node *n; in wnd_is_free()
[all …]
/fs/nfs/blocklayout/
A Dextent_tree.c14 ext_node(struct rb_node *node) in ext_node()
22 struct rb_node *node = rb_first(root); in ext_tree_first()
29 struct rb_node *node = rb_prev(&be->be_node); in ext_tree_prev()
36 struct rb_node *node = rb_next(&be->be_node); in ext_tree_next()
49 struct rb_node *node = root->rb_node; in __ext_tree_search()
140 struct rb_node **p = &root->rb_node, *parent = NULL; in __ext_tree_insert()
326 struct rb_node *node; in __ext_tree_lookup()
329 node = root->rb_node; in __ext_tree_lookup()
/fs/nilfs2/
A Dthe_nilfs.c846 struct rb_node *n; in nilfs_lookup_root()
850 n = nilfs->ns_cptree.rb_node; in nilfs_lookup_root()
852 root = rb_entry(n, struct nilfs_root, rb_node); in nilfs_lookup_root()
872 struct rb_node **p, *parent; in nilfs_find_or_create_root()
886 p = &nilfs->ns_cptree.rb_node; in nilfs_find_or_create_root()
891 root = rb_entry(parent, struct nilfs_root, rb_node); in nilfs_find_or_create_root()
912 rb_link_node(&new->rb_node, parent, p); in nilfs_find_or_create_root()
913 rb_insert_color(&new->rb_node, &nilfs->ns_cptree); in nilfs_find_or_create_root()
931 rb_erase(&root->rb_node, &nilfs->ns_cptree); in nilfs_put_root()

Completed in 92 milliseconds

12345