121  * look find the first ordered struct that has this offset, otherwise
149  * The tree is given a single reference on the ordered extent that was
172 		 * The ordered extent has reserved qgroup space, release now  in __btrfs_add_ordered_extent()
222 				"inconsistency in ordered tree at offset %llu",  in __btrfs_add_ordered_extent()
287  * when an ordered extent is finished.  If the list covers more than one
288  * ordered extent, it is split across multiples.
302  * Mark all ordered extents io inside the specified range finished.
306  *		 updated to indicate whether the pending ordered io is finished.
310  * @finish_func: The function to be executed when all the IO of an ordered
313  * This function is called for endio, thus the range must have ordered
345 		/* No ordered extents at all */  in btrfs_mark_ordered_io_finished()
358 			/* No more ordered extents, exit */  in btrfs_mark_ordered_io_finished()
364 			/* Go to next ordered extent and continue */  in btrfs_mark_ordered_io_finished()
379 		 * Now we are definitely inside one ordered extent.  in btrfs_mark_ordered_io_finished()
392 			 * Ordered (Private2) bit indicates whether we still  in btrfs_mark_ordered_io_finished()
393 			 * have pending io unfinished for the ordered extent.  in btrfs_mark_ordered_io_finished()
408 "bad ordered extent accounting, root=%llu ino=%llu OE offset=%llu OE len=%llu to_dec=%u left=%llu",  in btrfs_mark_ordered_io_finished()
423 		 * All the IO of the ordered extent is finished, we need to queue  in btrfs_mark_ordered_io_finished()
441  * Finish IO for one ordered extent across a given range.  The range can only
442  * contain one ordered extent.
444  * @cached:	 The cached ordered extent. If not NULL, we can skip the tree
445  *               search and use the ordered extent directly.
446  * 		 Will be also used to store the finished ordered extent.
450  * Return true if the ordered extent is finished in the range, and update
454  * NOTE: The range can NOT cross multiple ordered extents.
455  * Thus caller should ensure the range doesn't cross ordered extents.
484 			   "bad ordered accounting left %llu size %llu",  in btrfs_dec_test_ordered_pending()
508  * used to drop a reference on an ordered extent.  This will free
535  * remove an ordered extent from the tree.  No references are dropped
614 	struct btrfs_ordered_extent *ordered;  in btrfs_run_ordered_extent_work()  local
616 	ordered = container_of(work, struct btrfs_ordered_extent, flush_work);  in btrfs_run_ordered_extent_work()
617 	btrfs_start_ordered_extent(ordered, 1);  in btrfs_run_ordered_extent_work()
618 	complete(&ordered->completion);  in btrfs_run_ordered_extent_work()
622  * wait for all the ordered extents in a root.  This is done when balancing
632 	struct btrfs_ordered_extent *ordered, *next;  in btrfs_wait_ordered_extents()  local
640 		ordered = list_first_entry(&splice, struct btrfs_ordered_extent,  in btrfs_wait_ordered_extents()
643 		if (range_end <= ordered->disk_bytenr ||  in btrfs_wait_ordered_extents()
644 		    ordered->disk_bytenr + ordered->disk_num_bytes <= range_start) {  in btrfs_wait_ordered_extents()
645 			list_move_tail(&ordered->root_extent_list, &skipped);  in btrfs_wait_ordered_extents()
650 		list_move_tail(&ordered->root_extent_list,  in btrfs_wait_ordered_extents()
652 		refcount_inc(&ordered->refs);  in btrfs_wait_ordered_extents()
655 		btrfs_init_work(&ordered->flush_work,  in btrfs_wait_ordered_extents()
657 		list_add_tail(&ordered->work_list, &works);  in btrfs_wait_ordered_extents()
658 		btrfs_queue_work(fs_info->flush_workers, &ordered->flush_work);  in btrfs_wait_ordered_extents()
670 	list_for_each_entry_safe(ordered, next, &works, work_list) {  in btrfs_wait_ordered_extents()
671 		list_del_init(&ordered->work_list);  in btrfs_wait_ordered_extents()
672 		wait_for_completion(&ordered->completion);  in btrfs_wait_ordered_extents()
673 		btrfs_put_ordered_extent(ordered);  in btrfs_wait_ordered_extents()
717  * Used to start IO or wait for a given ordered extent to finish.
745  * Used to wait on ordered extents across a large range of bytes.
753 	struct btrfs_ordered_extent *ordered;  in btrfs_wait_ordered_range()  local
772 	 * for any ordered extents that haven't completed yet. This is to make  in btrfs_wait_ordered_range()
774 	 * before the ordered extents complete - to avoid failures (-EEXIST)  in btrfs_wait_ordered_range()
775 	 * when adding the new ordered extents to the ordered tree.  in btrfs_wait_ordered_range()
781 		ordered = btrfs_lookup_first_ordered_extent(BTRFS_I(inode), end);  in btrfs_wait_ordered_range()
782 		if (!ordered)  in btrfs_wait_ordered_range()
784 		if (ordered->file_offset > orig_end) {  in btrfs_wait_ordered_range()
785 			btrfs_put_ordered_extent(ordered);  in btrfs_wait_ordered_range()
788 		if (ordered->file_offset + ordered->num_bytes <= start) {  in btrfs_wait_ordered_range()
789 			btrfs_put_ordered_extent(ordered);  in btrfs_wait_ordered_range()
792 		btrfs_start_ordered_extent(ordered, 1);  in btrfs_wait_ordered_range()
793 		end = ordered->file_offset;  in btrfs_wait_ordered_range()
795 		 * If the ordered extent had an error save the error but don't  in btrfs_wait_ordered_range()
796 		 * exit without waiting first for all other ordered extents in  in btrfs_wait_ordered_range()
799 		if (test_bit(BTRFS_ORDERED_IOERR, &ordered->flags))  in btrfs_wait_ordered_range()
801 		btrfs_put_ordered_extent(ordered);  in btrfs_wait_ordered_range()
810  * find an ordered extent corresponding to file_offset.  return NULL if
837 /* Since the DIO code tries to lock a wide area we need to look for any ordered
878  * Adds all ordered extents to the given list. The list ends up sorted by the
879  * file_offset of the ordered extents.
891 		struct btrfs_ordered_extent *ordered;  in btrfs_get_ordered_extents_for_logging()  local
893 		ordered = rb_entry(n, struct btrfs_ordered_extent, rb_node);  in btrfs_get_ordered_extents_for_logging()
895 		if (test_bit(BTRFS_ORDERED_LOGGED, &ordered->flags))  in btrfs_get_ordered_extents_for_logging()
898 		ASSERT(list_empty(&ordered->log_list));  in btrfs_get_ordered_extents_for_logging()
899 		list_add_tail(&ordered->log_list, list);  in btrfs_get_ordered_extents_for_logging()
900 		refcount_inc(&ordered->refs);  in btrfs_get_ordered_extents_for_logging()
930  * Lookup the first ordered extent that overlaps the range
934  * that this one won't return any ordered extent that does not overlap the range.
936  * ensures the first ordered extent gets returned.
953 	 * And __tree_search() can't return the adjacent ordered extents  in btrfs_lookup_first_ordered_range()
965 			 * Direct hit, got an ordered extent that starts at  in btrfs_lookup_first_ordered_range()
995 	/* No ordered extent in the range */  in btrfs_lookup_first_ordered_range()
1006  * ordered extents in it are run to completion.
1008  * @inode:        Inode whose ordered tree is to be searched
1021 	struct btrfs_ordered_extent *ordered;  in btrfs_lock_and_flush_ordered_range()  local
1030 		ordered = btrfs_lookup_ordered_range(inode, start,  in btrfs_lock_and_flush_ordered_range()
1032 		if (!ordered) {  in btrfs_lock_and_flush_ordered_range()
1043 		btrfs_start_ordered_extent(ordered, 1);  in btrfs_lock_and_flush_ordered_range()
1044 		btrfs_put_ordered_extent(ordered);  in btrfs_lock_and_flush_ordered_range()
1048 static int clone_ordered_extent(struct btrfs_ordered_extent *ordered, u64 pos,  in clone_ordered_extent()  argument
1051 	struct inode *inode = ordered->inode;  in clone_ordered_extent()
1053 	u64 file_offset = ordered->file_offset + pos;  in clone_ordered_extent()
1054 	u64 disk_bytenr = ordered->disk_bytenr + pos;  in clone_ordered_extent()
1058 	unsigned long flags_masked = ordered->flags & ~(1 << BTRFS_ORDERED_DIRECT);  in clone_ordered_extent()
1059 	int compress_type = ordered->compress_type;  in clone_ordered_extent()
1077 	if (test_bit(BTRFS_ORDERED_COMPRESSED, &ordered->flags)) {  in clone_ordered_extent()
1082 	} else if (test_bit(BTRFS_ORDERED_DIRECT, &ordered->flags)) {  in clone_ordered_extent()
1093 int btrfs_split_ordered_extent(struct btrfs_ordered_extent *ordered, u64 pre,  in btrfs_split_ordered_extent()  argument
1096 	struct inode *inode = ordered->inode;  in btrfs_split_ordered_extent()
1104 	node = &ordered->rb_node;  in btrfs_split_ordered_extent()
1110 	ordered->file_offset += pre;  in btrfs_split_ordered_extent()
1111 	ordered->disk_bytenr += pre;  in btrfs_split_ordered_extent()
1112 	ordered->num_bytes -= (pre + post);  in btrfs_split_ordered_extent()
1113 	ordered->disk_num_bytes -= (pre + post);  in btrfs_split_ordered_extent()
1114 	ordered->bytes_left -= (pre + post);  in btrfs_split_ordered_extent()
1117 	node = tree_insert(&tree->tree, ordered->file_offset, &ordered->rb_node);  in btrfs_split_ordered_extent()
1120 			"zoned: inconsistency in ordered tree at offset %llu",  in btrfs_split_ordered_extent()
1121 			    ordered->file_offset);  in btrfs_split_ordered_extent()
1126 		ret = clone_ordered_extent(ordered, 0, pre);  in btrfs_split_ordered_extent()
1128 		ret = clone_ordered_extent(ordered, pre + ordered->disk_num_bytes,  in btrfs_split_ordered_extent()