51 	struct extent_map *em;  in alloc_extent_map()  local
52 	em = kmem_cache_zalloc(extent_map_cache, GFP_NOFS);  in alloc_extent_map()
53 	if (!em)  in alloc_extent_map()
55 	RB_CLEAR_NODE(&em->rb_node);  in alloc_extent_map()
56 	em->flags = 0;  in alloc_extent_map()
57 	em->compress_type = BTRFS_COMPRESS_NONE;  in alloc_extent_map()
58 	em->generation = 0;  in alloc_extent_map()
59 	refcount_set(&em->refs, 1);  in alloc_extent_map()
60 	INIT_LIST_HEAD(&em->list);  in alloc_extent_map()
61 	return em;  in alloc_extent_map()
71 void free_extent_map(struct extent_map *em)  in free_extent_map()  argument
73 	if (!em)  in free_extent_map()
75 	WARN_ON(refcount_read(&em->refs) == 0);  in free_extent_map()
76 	if (refcount_dec_and_test(&em->refs)) {  in free_extent_map()
77 		WARN_ON(extent_map_in_tree(em));  in free_extent_map()
78 		WARN_ON(!list_empty(&em->list));  in free_extent_map()
79 		if (test_bit(EXTENT_FLAG_FS_MAPPING, &em->flags))  in free_extent_map()
80 			kfree(em->map_lookup);  in free_extent_map()
81 		kmem_cache_free(extent_map_cache, em);  in free_extent_map()
93 static int tree_insert(struct rb_root *root, struct extent_map *em)  in tree_insert()  argument
99 	u64 end = range_end(em->start, em->len);  in tree_insert()
105 		if (em->start < entry->start)  in tree_insert()
107 		else if (em->start >= extent_map_end(entry))  in tree_insert()
114 	while (parent && em->start >= extent_map_end(entry)) {  in tree_insert()
119 		if (end > entry->start && em->start < extent_map_end(entry))  in tree_insert()
124 	while (parent && em->start < entry->start) {  in tree_insert()
129 		if (end > entry->start && em->start < extent_map_end(entry))  in tree_insert()
132 	rb_link_node(&em->rb_node, orig_parent, p);  in tree_insert()
133 	rb_insert_color(&em->rb_node, root);  in tree_insert()
226 static void try_merge_map(struct extent_map_tree *tree, struct extent_map *em)  in try_merge_map()  argument
231 	if (em->start != 0) {  in try_merge_map()
232 		rb = rb_prev(&em->rb_node);  in try_merge_map()
235 		if (rb && mergable_maps(merge, em)) {  in try_merge_map()
236 			em->start = merge->start;  in try_merge_map()
237 			em->orig_start = merge->orig_start;  in try_merge_map()
238 			em->len += merge->len;  in try_merge_map()
239 			em->block_len += merge->block_len;  in try_merge_map()
240 			em->block_start = merge->block_start;  in try_merge_map()
241 			em->mod_len = (em->mod_len + em->mod_start) - merge->mod_start;  in try_merge_map()
242 			em->mod_start = merge->mod_start;  in try_merge_map()
243 			em->generation = max(em->generation, merge->generation);  in try_merge_map()
251 	rb = rb_next(&em->rb_node);  in try_merge_map()
254 	if (rb && mergable_maps(em, merge)) {  in try_merge_map()
255 		em->len += merge->len;  in try_merge_map()
256 		em->block_len += merge->block_len;  in try_merge_map()
259 		em->mod_len = (merge->mod_start + merge->mod_len) - em->mod_start;  in try_merge_map()
260 		em->generation = max(em->generation, merge->generation);  in try_merge_map()
280 	struct extent_map *em;  in unpin_extent_cache()  local
284 	em = lookup_extent_mapping(tree, start, len);  in unpin_extent_cache()
286 	WARN_ON(!em || em->start != start);  in unpin_extent_cache()
288 	if (!em)  in unpin_extent_cache()
291 	em->generation = gen;  in unpin_extent_cache()
292 	clear_bit(EXTENT_FLAG_PINNED, &em->flags);  in unpin_extent_cache()
293 	em->mod_start = em->start;  in unpin_extent_cache()
294 	em->mod_len = em->len;  in unpin_extent_cache()
296 	if (test_bit(EXTENT_FLAG_FILLING, &em->flags)) {  in unpin_extent_cache()
298 		clear_bit(EXTENT_FLAG_FILLING, &em->flags);  in unpin_extent_cache()
301 	try_merge_map(tree, em);  in unpin_extent_cache()
304 		em->mod_start = em->start;  in unpin_extent_cache()
305 		em->mod_len = em->len;  in unpin_extent_cache()
308 	free_extent_map(em);  in unpin_extent_cache()
315 void clear_em_logging(struct extent_map_tree *tree, struct extent_map *em)  in clear_em_logging()  argument
317 	clear_bit(EXTENT_FLAG_LOGGING, &em->flags);  in clear_em_logging()
318 	if (extent_map_in_tree(em))  in clear_em_logging()
319 		try_merge_map(tree, em);  in clear_em_logging()
323 					struct extent_map *em,  in setup_extent_mapping()  argument
326 	refcount_inc(&em->refs);  in setup_extent_mapping()
327 	em->mod_start = em->start;  in setup_extent_mapping()
328 	em->mod_len = em->len;  in setup_extent_mapping()
331 		list_move(&em->list, &tree->modified_extents);  in setup_extent_mapping()
333 		try_merge_map(tree, em);  in setup_extent_mapping()
347 		       struct extent_map *em, int modified)  in add_extent_mapping()  argument
351 	ret = tree_insert(&tree->map, em);  in add_extent_mapping()
355 	setup_extent_mapping(tree, em, modified);  in add_extent_mapping()
364 	struct extent_map *em;  in __lookup_extent_mapping()  local
380 	em = rb_entry(rb_node, struct extent_map, rb_node);  in __lookup_extent_mapping()
382 	if (strict && !(end > em->start && start < extent_map_end(em)))  in __lookup_extent_mapping()
385 	refcount_inc(&em->refs);  in __lookup_extent_mapping()
386 	return em;  in __lookup_extent_mapping()
431 int remove_extent_mapping(struct extent_map_tree *tree, struct extent_map *em)  in remove_extent_mapping()  argument
435 	WARN_ON(test_bit(EXTENT_FLAG_PINNED, &em->flags));  in remove_extent_mapping()
436 	rb_erase(&em->rb_node, &tree->map);  in remove_extent_mapping()
437 	if (!test_bit(EXTENT_FLAG_LOGGING, &em->flags))  in remove_extent_mapping()
438 		list_del_init(&em->list);  in remove_extent_mapping()
439 	RB_CLEAR_NODE(&em->rb_node);  in remove_extent_mapping()
458 static struct extent_map *next_extent_map(struct extent_map *em)  in next_extent_map()  argument
462 	next = rb_next(&em->rb_node);  in next_extent_map()
468 static struct extent_map *prev_extent_map(struct extent_map *em)  in prev_extent_map()  argument
472 	prev = rb_prev(&em->rb_node);  in prev_extent_map()
485 					 struct extent_map *em,  in merge_extent_mapping()  argument
494 	BUG_ON(map_start < em->start || map_start >= extent_map_end(em));  in merge_extent_mapping()
504 	start = prev ? extent_map_end(prev) : em->start;  in merge_extent_mapping()
505 	start = max_t(u64, start, em->start);  in merge_extent_mapping()
506 	end = next ? next->start : extent_map_end(em);  in merge_extent_mapping()
507 	end = min_t(u64, end, extent_map_end(em));  in merge_extent_mapping()
508 	start_diff = start - em->start;  in merge_extent_mapping()
509 	em->start = start;  in merge_extent_mapping()
510 	em->len = end - start;  in merge_extent_mapping()
511 	if (em->block_start < EXTENT_MAP_LAST_BYTE &&  in merge_extent_mapping()
512 	    !test_bit(EXTENT_FLAG_COMPRESSED, &em->flags)) {  in merge_extent_mapping()
513 		em->block_start += start_diff;  in merge_extent_mapping()
514 		em->block_len = em->len;  in merge_extent_mapping()
516 	return add_extent_mapping(em_tree, em, 0);  in merge_extent_mapping()
544 	struct extent_map *em = *em_in;  in btrfs_add_extent_mapping()  local
546 	ret = add_extent_mapping(em_tree, em, 0);  in btrfs_add_extent_mapping()
558 		trace_btrfs_handle_em_exist(fs_info, existing, em, start, len);  in btrfs_add_extent_mapping()
566 			free_extent_map(em);  in btrfs_add_extent_mapping()
570 			u64 orig_start = em->start;  in btrfs_add_extent_mapping()
571 			u64 orig_len = em->len;  in btrfs_add_extent_mapping()
578 						   em, start);  in btrfs_add_extent_mapping()
580 				free_extent_map(em);  in btrfs_add_extent_mapping()