166 int btrfs_drop_extent_cache(struct inode *inode, u64 start, u64 end,  in btrfs_drop_extent_cache()  argument
173 	u64 len = end - start + 1;  in btrfs_drop_extent_cache()
179 	WARN_ON(end < start);  in btrfs_drop_extent_cache()
191 		em = lookup_extent_mapping(em_tree, start, len);  in btrfs_drop_extent_cache()
199 			if (em->start <= start &&  in btrfs_drop_extent_cache()
200 			    (!testend || em->start + em->len >= start + len)) {  in btrfs_drop_extent_cache()
204 			if (start < em->start) {  in btrfs_drop_extent_cache()
205 				len = em->start - start;  in btrfs_drop_extent_cache()
207 				len = start + len - (em->start + em->len);  in btrfs_drop_extent_cache()
208 				start = em->start + em->len;  in btrfs_drop_extent_cache()
218 		    em->start < start) {  in btrfs_drop_extent_cache()
219 			split->start = em->start;  in btrfs_drop_extent_cache()
220 			split->len = start - em->start;  in btrfs_drop_extent_cache()
238 		    testend && em->start + em->len > start + len) {  in btrfs_drop_extent_cache()
239 			u64 diff = start + len - em->start;  in btrfs_drop_extent_cache()
241 			split->start = start + len;  in btrfs_drop_extent_cache()
242 			split->len = em->start + em->len - (start + len);  in btrfs_drop_extent_cache()
253 				split->orig_start = split->start;  in btrfs_drop_extent_cache()
366 		       u64 start, u64 end, u64 inline_limit, u64 *hint_byte)  in btrfs_drop_extents()  argument
370 	u64 search_start = start;  in btrfs_drop_extents()
395 	btrfs_drop_extent_cache(inode, start, end - 1, 0);  in btrfs_drop_extents()
438 			search_start = max(key.offset, start);  in btrfs_drop_extents()
490 		if (end <= extent_end && start >= key.offset && found_inline)  in btrfs_drop_extents()
498 			leaf_start = leaf->start;  in btrfs_drop_extents()
503 			if (found_inline && start <= key.offset)  in btrfs_drop_extents()
522 			orig_parent = path->nodes[0]->start;  in btrfs_drop_extents()
541 		if (start > key.offset) {  in btrfs_drop_extents()
545 			WARN_ON(start & (root->sectorsize - 1));  in btrfs_drop_extents()
547 				new_num = start - key.offset;  in btrfs_drop_extents()
589 		if (bookend && found_inline && start <= key.offset) {  in btrfs_drop_extents()
647 						leaf->start,  in btrfs_drop_extents()
690 			    u64 objectid, u64 bytenr, u64 *start, u64 *end)  in extent_mergeable()  argument
712 	if ((*start && *start != key.offset) || (*end && *end != extent_end))  in extent_mergeable()
715 	*start = key.offset;  in extent_mergeable()
729 			      struct inode *inode, u64 start, u64 end)  in btrfs_mark_extent_written()  argument
741 	u64 split = start;  in btrfs_mark_extent_written()
748 	btrfs_drop_extent_cache(inode, start, end - 1, 0);  in btrfs_mark_extent_written()
755 	if (split == start)  in btrfs_mark_extent_written()
773 	BUG_ON(key.offset > start || extent_end < end);  in btrfs_mark_extent_written()
779 	if (key.offset == start)  in btrfs_mark_extent_written()
782 	if (key.offset == start && extent_end == end) {  in btrfs_mark_extent_written()
795 						leaf->start, leaf_owner,  in btrfs_mark_extent_written()
800 		other_end = start;  in btrfs_mark_extent_written()
807 						leaf->start, leaf_owner,  in btrfs_mark_extent_written()
828 	} else if (split == start) {  in btrfs_mark_extent_written()
844 		BUG_ON(key.offset != start);  in btrfs_mark_extent_written()
857 	if (extent_end == end && split == start) {  in btrfs_mark_extent_written()
875 		other_end = start;  in btrfs_mark_extent_written()
889 	orig_parent = leaf->start;  in btrfs_mark_extent_written()
896 	key.offset = start;  in btrfs_mark_extent_written()
914 	if (orig_parent != leaf->start) {  in btrfs_mark_extent_written()
916 					      orig_parent, leaf->start,  in btrfs_mark_extent_written()
924 	if (split_end && split == start) {  in btrfs_mark_extent_written()