399  * existing mappings.  The extent_map struct passed in will be inserted
545  * Helper for btrfs_get_extent.  Given an existing extent in the tree,
546  * the existing extent is the nearest extent to map_start,
551 					 struct extent_map *existing,  in merge_extent_mapping()  argument
563 	if (existing->start > map_start) {  in merge_extent_mapping()
564 		next = existing;  in merge_extent_mapping()
567 		prev = existing;  in merge_extent_mapping()
600  * a) Returning the existing extent in @em_in if @start is within the
601  *    existing em.
602  * b) Merge the existing extent with @em_in passed in.
627 		struct extent_map *existing;  in btrfs_add_extent_mapping()  local
631 		existing = search_extent_mapping(em_tree, start, len);  in btrfs_add_extent_mapping()
633 		trace_btrfs_handle_em_exist(fs_info, existing, em, start, len);  in btrfs_add_extent_mapping()
636 		 * existing will always be non-NULL, since there must be  in btrfs_add_extent_mapping()
639 		if (start >= existing->start &&  in btrfs_add_extent_mapping()
640 		    start < extent_map_end(existing)) {  in btrfs_add_extent_mapping()
642 			*em_in = existing;  in btrfs_add_extent_mapping()
649 			 * The existing extent map is the one nearest to  in btrfs_add_extent_mapping()
652 			ret = merge_extent_mapping(em_tree, existing,  in btrfs_add_extent_mapping()
658 "unexpected error %d: merge existing(start %llu len %llu) with em(start %llu len %llu)\n",  in btrfs_add_extent_mapping()
659 					  ret, existing->start, existing->len,  in btrfs_add_extent_mapping()
662 			free_extent_map(existing);  in btrfs_add_extent_mapping()