Home
last modified time | relevance | path

Searched refs:tree (Results 1 – 5 of 5) sorted by relevance

/fs/btrfs/
A Dextent-cache.h25 void cache_tree_init(struct cache_tree *tree);
27 struct cache_extent *first_cache_extent(struct cache_tree *tree);
28 struct cache_extent *last_cache_extent(struct cache_tree *tree);
44 struct cache_extent *lookup_cache_extent(struct cache_tree *tree,
52 int add_cache_extent(struct cache_tree *tree, u64 start, u64 size);
60 static inline int cache_tree_empty(struct cache_tree *tree) in cache_tree_empty() argument
62 return RB_EMPTY_ROOT(&tree->root); in cache_tree_empty()
67 void cache_tree_free_extents(struct cache_tree *tree,
71 static void free_##name##_tree(struct cache_tree *tree) \
73 cache_tree_free_extents(tree, free_func); \
[all …]
A Dextent-io.c19 cache_tree_init(&tree->state); in extent_io_tree_init()
20 cache_tree_init(&tree->cache); in extent_io_tree_init()
21 tree->cache_size = 0; in extent_io_tree_init()
125 merge_state(tree, state); in insert_state()
162 merge_state(tree, state); in clear_state_bit()
359 merge_state(tree, state); in set_extent_bits()
390 merge_state(tree, state); in set_extent_bits()
431 merge_state(tree, prealloc); in set_extent_bits()
611 BUG_ON(tree->cache_size < eb->len); in free_extent_buffer_final()
612 tree->cache_size -= eb->len; in free_extent_buffer_final()
[all …]
A Dextent-cache.c83 void cache_tree_init(struct cache_tree *tree) in cache_tree_init() argument
85 tree->root = RB_ROOT; in cache_tree_init()
109 ret = insert_cache_extent(tree, pe); in add_cache_extent()
239 rb_erase(&pe->rb_node, &tree->root); in remove_cache_extent()
247 while ((ce = first_cache_extent(tree))) { in cache_tree_free_extents()
248 remove_cache_extent(tree, ce); in cache_tree_free_extents()
272 if (cache_tree_empty(tree)) in add_merge_cache_extent()
275 cache = search_cache_extent(tree, start); in add_merge_cache_extent()
282 prev = last_cache_extent(tree); in add_merge_cache_extent()
308 remove_cache_extent(tree, prev); in add_merge_cache_extent()
[all …]
A Dextent-io.h96 void extent_io_tree_init(struct extent_io_tree *tree);
97 void extent_io_tree_cleanup(struct extent_io_tree *tree);
98 int set_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, int bits);
100 int find_first_extent_bit(struct extent_io_tree *tree, u64 start,
102 int test_range_bit(struct extent_io_tree *tree, u64 start, u64 end,
104 int set_extent_dirty(struct extent_io_tree *tree, u64 start, u64 end);
105 int clear_extent_dirty(struct extent_io_tree *tree, u64 start, u64 end);
127 int set_state_private(struct extent_io_tree *tree, u64 start, u64 xprivate);
128 int get_state_private(struct extent_io_tree *tree, u64 start, u64 *xprivate);
129 struct extent_buffer *find_extent_buffer(struct extent_io_tree *tree,
[all …]
A DMakefile7 common/rbtree-utils.o extent-cache.o volumes.o root-tree.o

Completed in 8 milliseconds