| /fs/nfs/blocklayout/ |
| A D | extent_tree.c | 20 ext_tree_first(struct rb_root *root) in ext_tree_first()
47 __ext_tree_search(struct rb_root *root, sector_t start) in __ext_tree_search()
96 ext_try_to_merge_left(struct rb_root *root, struct pnfs_block_extent *be) in ext_try_to_merge_left()
112 ext_try_to_merge_right(struct rb_root *root, struct pnfs_block_extent *be) in ext_try_to_merge_right()
137 __ext_tree_insert(struct rb_root *root, in __ext_tree_insert()
178 __ext_tree_remove(struct rb_root *root, in __ext_tree_remove()
259 struct rb_root *root; in ext_tree_insert()
323 __ext_tree_lookup(struct rb_root *root, sector_t isect, in __ext_tree_lookup()
381 ext_tree_split(struct rb_root *root, struct pnfs_block_extent *be, in ext_tree_split()
409 struct rb_root *root = &bl->bl_ext_rw; in ext_tree_mark_written()
[all …]
|
| A D | blocklayout.h | 145 struct rb_root bl_ext_rw;
146 struct rb_root bl_ext_ro;
|
| /fs/btrfs/ |
| A D | misc.h | 71 static inline struct rb_node *rb_simple_search(const struct rb_root *root, u64 bytenr) in rb_simple_search()
98 static inline struct rb_node *rb_simple_search_first(const struct rb_root *root, in rb_simple_search_first()
137 static inline struct rb_node *rb_simple_insert(struct rb_root *root, in rb_simple_insert()
|
| A D | fs.h | 348 struct rb_root root;
445 struct rb_root global_root_tree;
592 struct rb_root tree_mod_log;
690 struct rb_root defrag_inodes;
738 struct rb_root qgroup_tree;
824 struct rb_root swapfile_pins;
883 struct rb_root block_tree;
|
| A D | ref-verify.c | 72 struct rb_root roots;
73 struct rb_root refs;
98 static struct block_entry *insert_block_entry(struct rb_root *root, in insert_block_entry()
107 static struct block_entry *lookup_block_entry(struct rb_root *root, u64 bytenr) in lookup_block_entry()
135 static struct root_entry *insert_root_entry(struct rb_root *root, in insert_root_entry()
173 static struct ref_entry *insert_ref_entry(struct rb_root *root, in insert_ref_entry()
182 static struct root_entry *lookup_root_entry(struct rb_root *root, u64 objectid) in lookup_root_entry()
|
| A D | backref.h | 392 struct rb_root rb_root; member
|
| A D | relocation.c | 106 struct rb_root rb_root; member
383 rb_erase(&cur->rb_node, &cache->rb_root); in handle_useless_nodes()
562 rb_node = rb_simple_search(&rc->reloc_root_tree.rb_root, in __update_reloc_root()
1928 static void free_block_list(struct rb_root *blocks) in free_block_list()
2607 struct reloc_control *rc, struct rb_root *blocks) in relocate_tree_blocks()
3059 struct rb_root *blocks) in add_tree_block()
3158 struct rb_root *blocks) in __add_tree_block()
3312 struct rb_root *blocks) in add_data_references()
3510 struct rb_root blocks = RB_ROOT; in relocate_block_group()
3847 rc->reloc_root_tree.rb_root = RB_ROOT; in alloc_reloc_control()
[all …]
|
| A D | ulist.h | 43 struct rb_root root;
|
| A D | backref.c | 340 &preftree->root.rb_root, rbnode) { in prelim_release()
444 struct rb_node **p = &preftrees->direct.root.rb_root.rb_node; in is_shared_data_backref()
1568 WARN_ON(!RB_EMPTY_ROOT(&preftrees.indirect_missing_keys.root.rb_root)); in find_parent_nodes()
1574 WARN_ON(!RB_EMPTY_ROOT(&preftrees.indirect.root.rb_root)); in find_parent_nodes()
3021 cache->rb_root = RB_ROOT; in btrfs_backref_init_cache()
3117 rb_erase(&node->rb_node, &tree->rb_root); in btrfs_backref_drop_node()
3154 while ((node = rb_entry_safe(rb_first(&cache->rb_root), in btrfs_backref_release_cache()
3220 rb_node = rb_simple_search(&cache->rb_root, ref_key->offset); in handle_direct_tree_backref()
3359 rb_node = rb_simple_search(&cache->rb_root, eb->start); in handle_indirect_tree_backref()
3569 rb_node = rb_simple_insert(&cache->rb_root, &start->simple_node); in btrfs_backref_finish_upper_links()
[all …]
|
| /fs/jffs2/ |
| A D | nodelist.h | 242 struct rb_root tn_root;
327 static inline struct jffs2_node_frag *frag_first(struct rb_root *root) in frag_first()
337 static inline struct jffs2_node_frag *frag_last(struct rb_root *root) in frag_last()
371 struct jffs2_node_frag *jffs2_lookup_node_frag(struct rb_root *fragtree, uint32_t offset);
372 void jffs2_kill_fragtree(struct rb_root *root, struct jffs2_sb_info *c_delete);
374 uint32_t jffs2_truncate_fragtree (struct jffs2_sb_info *c, struct rb_root *list, uint32_t size);
|
| A D | nodelist.c | 59 uint32_t jffs2_truncate_fragtree(struct jffs2_sb_info *c, struct rb_root *list, uint32_t size) in jffs2_truncate_fragtree()
169 static int no_overlapping_node(struct jffs2_sb_info *c, struct rb_root *root, in no_overlapping_node()
215 static int jffs2_add_frag_to_fragtree(struct jffs2_sb_info *c, struct rb_root *root, struct jffs2_n… in jffs2_add_frag_to_fragtree()
524 struct jffs2_node_frag *jffs2_lookup_node_frag(struct rb_root *fragtree, uint32_t offset) in jffs2_lookup_node_frag()
565 void jffs2_kill_fragtree(struct rb_root *root, struct jffs2_sb_info *c) in jffs2_kill_fragtree()
|
| A D | jffs2_fs_i.h | 33 struct rb_root fragtree;
|
| /fs/ceph/ |
| A D | mds_client.h | 469 struct rb_root quotarealms_inodes;
481 struct rb_root snap_realms;
489 struct rb_root request_tree; /* pending mds requests */
541 struct rb_root snapid_map_tree;
545 struct rb_root pool_perm_tree;
|
| /fs/ |
| A D | xattr.c | 1307 rbp = rb_find(name, &xattrs->rb_root, rbtree_simple_xattr_cmp); in simple_xattr_get()
1370 rbp = &xattrs->rb_root.rb_node; in simple_xattr_set()
1393 &new_xattr->rb_node, &xattrs->rb_root); in simple_xattr_set()
1395 rb_erase(&old_xattr->rb_node, &xattrs->rb_root); in simple_xattr_set()
1409 rb_insert_color(&new_xattr->rb_node, &xattrs->rb_root); in simple_xattr_set()
1485 for (rbp = rb_first(&xattrs->rb_root); rbp; rbp = rb_next(rbp)) { in simple_xattr_list()
1534 rb_add(&new_xattr->rb_node, &xattrs->rb_root, rbtree_simple_xattr_less); in simple_xattr_add()
1546 xattrs->rb_root = RB_ROOT; in simple_xattrs_init()
1564 rbp = rb_first(&xattrs->rb_root); in simple_xattrs_free()
1571 rb_erase(&xattr->rb_node, &xattrs->rb_root); in simple_xattrs_free()
|
| /fs/nfsd/ |
| A D | netns.h | 86 struct rb_root conf_name_tree;
88 struct rb_root unconf_name_tree;
|
| /fs/xfs/scrub/ |
| A D | bitmap.c | 63 for ((bn) = rb_entry_safe(rb_first(&(bitmap)->xb_root.rb_root), \ in INTERVAL_TREE_DEFINE()
272 return bitmap->xb_root.rb_root.rb_node == NULL; in xbitmap64_empty()
338 for ((bn) = rb_entry_safe(rb_first(&(bitmap)->xb_root.rb_root), \ in INTERVAL_TREE_DEFINE()
547 return bitmap->xb_root.rb_root.rb_node == NULL; in xbitmap32_empty()
|
| /fs/ext4/ |
| A D | extents_status.h | 73 struct rb_root root;
129 struct rb_root root;
|
| /fs/smb/client/ |
| A D | cifs_fs_sb.h | 51 struct rb_root tlink_tree;
|
| /fs/overlayfs/ |
| A D | readdir.c | 37 struct rb_root root;
44 struct rb_root *root;
95 static struct ovl_cache_entry *ovl_cache_entry_find(struct rb_root *root, in ovl_cache_entry_find()
349 struct rb_root *root) in ovl_dir_read_merged()
569 struct rb_root *root) in ovl_dir_read_impure()
993 struct rb_root root = RB_ROOT; in ovl_check_empty_dir()
|
| /fs/ubifs/ |
| A D | orphan.c | 742 struct rb_root root;
756 static int dbg_ins_check_orphan(struct rb_root *root, ino_t inum) in dbg_ins_check_orphan()
784 static int dbg_find_check_orphan(struct rb_root *root, ino_t inum) in dbg_find_check_orphan()
802 static void dbg_free_check_tree(struct rb_root *root) in dbg_free_check_tree()
|
| A D | log.c | 561 static int done_already(struct rb_root *done_tree, int lnum) in done_already()
593 static void destroy_done_tree(struct rb_root *done_tree) in destroy_done_tree()
646 struct rb_root done_tree = RB_ROOT; in ubifs_consolidate_log()
|
| /fs/ocfs2/cluster/ |
| A D | nodemanager.h | 46 struct rb_root cl_node_ip_tree;
|
| /fs/ocfs2/ |
| A D | reservations.h | 39 struct rb_root m_reservations;
|
| /fs/ntfs3/ |
| A D | bitmap.c | 142 static struct rb_node *rb_lookup(struct rb_root *root, size_t v) in rb_lookup()
167 static inline bool rb_insert_count(struct rb_root *root, struct e_node *e) in rb_insert_count()
200 static inline bool rb_insert_start(struct rb_root *root, struct e_node *e) in rb_insert_start()
1078 struct rb_root start_tree; in wnd_find()
1081 sizeof(struct rb_root)); in wnd_find()
1082 memset(&wnd->start_tree, 0, sizeof(struct rb_root)); in wnd_find()
1093 sizeof(struct rb_root)); in wnd_find()
|
| /fs/f2fs/ |
| A D | extent_cache.c | 185 struct rb_node *node = root->rb_root.rb_node; in __lookup_extent_node()
225 struct rb_node **pnode = &root->rb_root.rb_node; in __lookup_extent_node_ret()
234 if (RB_EMPTY_ROOT(&root->rb_root)) in __lookup_extent_node_ret()
444 &et->root.rb_root.rb_node, true); in f2fs_init_read_extent_tree()
584 struct rb_node **p = &et->root.rb_root.rb_node; in __insert_extent_tree()
|