29  * extent_map_tree_init - initialize extent map tree
30  * @tree:		tree to initialize
32  * Initialize the extent tree @tree.  Should be called for each new inode
35 void extent_map_tree_init(struct extent_map_tree *tree)  in extent_map_tree_init()  argument
37 	tree->map = RB_ROOT;  in extent_map_tree_init()
38 	rwlock_init(&tree->lock);  in extent_map_tree_init()
108  * search through the tree for an extent_map with a given offset.  If
186 static void try_merge_map(struct extent_map_tree *tree, struct extent_map *em)  in try_merge_map()  argument
201 			rb_erase(&merge->rb_node, &tree->map);  in try_merge_map()
212 		rb_erase(&merge->rb_node, &tree->map);  in try_merge_map()
218 int unpin_extent_cache(struct extent_map_tree *tree, u64 start, u64 len)  in unpin_extent_cache()  argument
223 	write_lock(&tree->lock);  in unpin_extent_cache()
224 	em = lookup_extent_mapping(tree, start, len);  in unpin_extent_cache()
233 	try_merge_map(tree, em);  in unpin_extent_cache()
237 	write_unlock(&tree->lock);  in unpin_extent_cache()
243  * add_extent_mapping - add new extent map to the extent tree
244  * @tree:	tree to insert new map in
247  * Insert @em into @tree or perform a simple forward/backward merge with
249  * into the tree directly, with an additional reference taken, or a
252 int add_extent_mapping(struct extent_map_tree *tree,  in add_extent_mapping()  argument
259 	exist = lookup_extent_mapping(tree, em->start, em->len);  in add_extent_mapping()
265 	rb = tree_insert(&tree->map, em->start, &em->rb_node);  in add_extent_mapping()
272 	try_merge_map(tree, em);  in add_extent_mapping()
285 struct extent_map *__lookup_extent_mapping(struct extent_map_tree *tree,  in __lookup_extent_mapping()  argument
294 	rb_node = __tree_search(&tree->map, start, &prev, &next);  in __lookup_extent_mapping()
315  * @tree:	tree to lookup in
319  * Find and return the first extent_map struct in @tree that intersects the
320  * [start, len] range.  There may be additional objects in the tree that
324 struct extent_map *lookup_extent_mapping(struct extent_map_tree *tree,  in lookup_extent_mapping()  argument
327 	return __lookup_extent_mapping(tree, start, len, 1);  in lookup_extent_mapping()
332  * @tree:	tree to lookup in
336  * Find and return the first extent_map struct in @tree that intersects the
341 struct extent_map *search_extent_mapping(struct extent_map_tree *tree,  in search_extent_mapping()  argument
344 	return __lookup_extent_mapping(tree, start, len, 0);  in search_extent_mapping()
348  * remove_extent_mapping - removes an extent_map from the extent tree
349  * @tree:	extent tree to remove from
352  * Removes @em from @tree.  No reference counts are dropped, and no checks
355 int remove_extent_mapping(struct extent_map_tree *tree, struct extent_map *em)  in remove_extent_mapping()  argument
360 	rb_erase(&em->rb_node, &tree->map);  in remove_extent_mapping()