| /fs/nfs/blocklayout/ |
| D | extent_tree.c | 19 ext_tree_first(struct rb_root *root) in ext_tree_first()
46 __ext_tree_search(struct rb_root *root, sector_t start) in __ext_tree_search()
95 ext_try_to_merge_left(struct rb_root *root, struct pnfs_block_extent *be) in ext_try_to_merge_left()
111 ext_try_to_merge_right(struct rb_root *root, struct pnfs_block_extent *be) in ext_try_to_merge_right()
136 __ext_tree_insert(struct rb_root *root, in __ext_tree_insert()
177 __ext_tree_remove(struct rb_root *root, in __ext_tree_remove()
258 struct rb_root *root; in ext_tree_insert()
322 __ext_tree_lookup(struct rb_root *root, sector_t isect, in __ext_tree_lookup()
380 ext_tree_split(struct rb_root *root, struct pnfs_block_extent *be, in ext_tree_split()
408 struct rb_root *root = &bl->bl_ext_rw; in ext_tree_mark_written()
[all …]
|
| D | blocklayout.h | 139 struct rb_root bl_ext_rw;
140 struct rb_root bl_ext_ro;
|
| /fs/ceph/ |
| D | mds_client.h | 403 struct rb_root quotarealms_inodes;
415 struct rb_root snap_realms;
423 struct rb_root request_tree; /* pending mds requests */
470 struct rb_root snapid_map_tree;
474 struct rb_root pool_perm_tree;
|
| /fs/jffs2/ |
| 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);
|
| 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()
|
| D | jffs2_fs_i.h | 33 struct rb_root fragtree;
|
| /fs/nfsd/ |
| D | netns.h | 60 struct rb_root conf_name_tree;
62 struct rb_root unconf_name_tree;
|
| /fs/btrfs/ |
| D | misc.h | 73 static inline struct rb_node *rb_simple_search(struct rb_root *root, u64 bytenr) in rb_simple_search()
91 static inline struct rb_node *rb_simple_insert(struct rb_root *root, u64 bytenr, in rb_simple_insert()
|
| D | backref.h | 234 struct rb_root rb_root; member
351 rb_erase(&node->rb_node, &tree->rb_root); in btrfs_backref_drop_node()
|
| D | relocation.c | 89 struct rb_root rb_root; member
174 tree->rb_root = RB_ROOT; in mapping_tree_init()
230 rb_erase(&node->rb_node, &cache->rb_root); in update_backref_node()
232 rb_node = rb_simple_insert(&cache->rb_root, node->bytenr, &node->rb_node); in update_backref_node()
359 rb_node = rb_simple_search(&rc->reloc_root_tree.rb_root, bytenr); in find_reloc_root()
435 rb_erase(&cur->rb_node, &cache->rb_root); in handle_useless_nodes()
551 rb_node = rb_simple_search(&cache->rb_root, src->commit_root->start); in clone_backref_node()
561 rb_node = rb_simple_search(&cache->rb_root, in clone_backref_node()
596 rb_node = rb_simple_insert(&cache->rb_root, new_node->bytenr, in clone_backref_node()
637 rb_node = rb_simple_insert(&rc->reloc_root_tree.rb_root, in __add_reloc_root()
[all …]
|
| D | ref-verify.c | 69 struct rb_root roots;
70 struct rb_root refs;
75 static struct block_entry *insert_block_entry(struct rb_root *root, in insert_block_entry()
98 static struct block_entry *lookup_block_entry(struct rb_root *root, u64 bytenr) in lookup_block_entry()
116 static struct root_entry *insert_root_entry(struct rb_root *root, in insert_root_entry()
161 static struct ref_entry *insert_ref_entry(struct rb_root *root, in insert_ref_entry()
187 static struct root_entry *lookup_root_entry(struct rb_root *root, u64 objectid) in lookup_root_entry()
|
| D | delayed-ref.c | 280 struct rb_node **p = &root->rb_root.rb_node; in htree_insert()
312 struct rb_node **p = &root->rb_root.rb_node; in tree_insert()
364 struct rb_root *root = &dr->href_root.rb_root; in find_ref_head()
487 if (RB_EMPTY_ROOT(&head->ref_tree.rb_root)) in btrfs_merge_delayed_refs()
|
| D | ulist.h | 42 struct rb_root root;
|
| D | backref.c | 238 p = &root->rb_root.rb_node; in prelim_ref_insert()
291 &preftree->root.rb_root, rbnode) { in prelim_release()
395 struct rb_node **p = &preftrees->direct.root.rb_root.rb_node; in is_shared_data_backref()
1327 WARN_ON(!RB_EMPTY_ROOT(&preftrees.indirect_missing_keys.root.rb_root));
1334 WARN_ON(!RB_EMPTY_ROOT(&preftrees.indirect.root.rb_root));
2548 cache->rb_root = RB_ROOT;
2658 ASSERT(RB_EMPTY_ROOT(&cache->rb_root));
2710 rb_node = rb_simple_search(&cache->rb_root, ref_key->offset);
2843 rb_node = rb_simple_search(&cache->rb_root, eb->start);
3051 rb_node = rb_simple_insert(&cache->rb_root, start->bytenr,
[all …]
|
| D | extent_map.c | 96 struct rb_node **p = &root->rb_root.rb_node; in tree_insert()
145 static struct rb_node *__tree_search(struct rb_root *root, u64 offset, in __tree_search()
427 rb_node = __tree_search(&tree->map.rb_root, start, &prev, &next); in __lookup_extent_mapping()
|
| /fs/overlayfs/ |
| D | readdir.c | 35 struct rb_root root;
42 struct rb_root *root;
92 static struct ovl_cache_entry *ovl_cache_entry_find(struct rb_root *root, in ovl_cache_entry_find()
344 struct rb_root *root) in ovl_dir_read_merged()
549 struct rb_root *root) in ovl_dir_read_impure()
964 struct rb_root root = RB_ROOT; in ovl_check_empty_dir()
1071 struct rb_root root = RB_ROOT; in ovl_workdir_cleanup_recurse()
1159 struct rb_root root = RB_ROOT; in ovl_indexdir_cleanup()
|
| /fs/ext4/ |
| D | extents_status.h | 67 struct rb_root root;
123 struct rb_root root;
|
| /fs/f2fs/ |
| D | extent_cache.c | 142 struct rb_node *node = root->rb_root.rb_node; in __lookup_rb_tree_slow()
175 struct rb_node **p = &root->rb_root.rb_node; in f2fs_lookup_rb_tree_ext()
198 struct rb_node **p = &root->rb_root.rb_node; in f2fs_lookup_rb_tree_for_insert()
236 struct rb_node **pnode = &root->rb_root.rb_node; in f2fs_lookup_rb_tree_ret()
245 if (RB_EMPTY_ROOT(&root->rb_root)) in f2fs_lookup_rb_tree_ret()
493 &et->root.rb_root.rb_node, true); in f2fs_init_read_extent_tree()
|
| /fs/cifs/ |
| D | cifs_fs_sb.h | 60 struct rb_root tlink_tree;
|
| /fs/ocfs2/cluster/ |
| D | nodemanager.h | 48 struct rb_root cl_node_ip_tree;
|
| /fs/ocfs2/ |
| D | reservations.h | 41 struct rb_root m_reservations;
|
| /fs/ubifs/ |
| D | orphan.c | 849 struct rb_root root;
863 static int dbg_ins_check_orphan(struct rb_root *root, ino_t inum) in dbg_ins_check_orphan()
891 static int dbg_find_check_orphan(struct rb_root *root, ino_t inum) in dbg_find_check_orphan()
909 static void dbg_free_check_tree(struct rb_root *root) in dbg_free_check_tree()
|
| 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/ext2/ |
| D | balloc.c | 199 static void __rsv_window_dump(struct rb_root *root, int verbose, in __rsv_window_dump()
291 search_reserve_window(struct rb_root *root, ext2_fsblk_t goal) in search_reserve_window()
332 struct rb_root *root = &EXT2_SB(sb)->s_rsv_window_root; in ext2_rsv_window_add()
880 struct rb_root *fs_rsv_root = &EXT2_SB(sb)->s_rsv_window_root; in alloc_new_reservation()
|
| /fs/dlm/ |
| D | lock.h | 33 int dlm_search_rsb_tree(struct rb_root *tree, char *name, int len,
|