124  * look find the first ordered struct that has this offset, otherwise
165 		 * The ordered extent has reserved qgroup space, release now  in alloc_ordered_extent()
229 				"inconsistency in ordered tree at offset %llu",  in insert_ordered_extent()
247  * Add an ordered extent to the per-inode tree.
260  * tree is given a single reference on the ordered extent that was inserted, and
263  * Return: the new ordered extent or error pointer.
285  * when an ordered extent is finished.  If the list covers more than one
286  * ordered extent, it is split across multiples.
306 static bool can_finish_ordered_extent(struct btrfs_ordered_extent *ordered,  in can_finish_ordered_extent()  argument
310 	struct btrfs_inode *inode = BTRFS_I(ordered->inode);  in can_finish_ordered_extent()
321 		 * Ordered (Private2) bit indicates whether we still have  in can_finish_ordered_extent()
322 		 * pending io unfinished for the ordered extent.  in can_finish_ordered_extent()
333 	if (WARN_ON_ONCE(len > ordered->bytes_left)) {  in can_finish_ordered_extent()
335 "bad ordered extent accounting, root=%llu ino=%llu OE offset=%llu OE len=%llu to_dec=%llu left=%llu…  in can_finish_ordered_extent()
337 			   ordered->file_offset, ordered->num_bytes,  in can_finish_ordered_extent()
338 			   len, ordered->bytes_left);  in can_finish_ordered_extent()
339 		ordered->bytes_left = 0;  in can_finish_ordered_extent()
341 		ordered->bytes_left -= len;  in can_finish_ordered_extent()
345 		set_bit(BTRFS_ORDERED_IOERR, &ordered->flags);  in can_finish_ordered_extent()
347 	if (ordered->bytes_left)  in can_finish_ordered_extent()
351 	 * All the IO of the ordered extent is finished, we need to queue  in can_finish_ordered_extent()
354 	set_bit(BTRFS_ORDERED_IO_DONE, &ordered->flags);  in can_finish_ordered_extent()
355 	cond_wake_up(&ordered->wait);  in can_finish_ordered_extent()
356 	refcount_inc(&ordered->refs);  in can_finish_ordered_extent()
357 	trace_btrfs_ordered_extent_mark_finished(inode, ordered);  in can_finish_ordered_extent()
361 static void btrfs_queue_ordered_fn(struct btrfs_ordered_extent *ordered)  in btrfs_queue_ordered_fn()  argument
363 	struct btrfs_inode *inode = BTRFS_I(ordered->inode);  in btrfs_queue_ordered_fn()
368 	btrfs_init_work(&ordered->work, finish_ordered_fn, NULL);  in btrfs_queue_ordered_fn()
369 	btrfs_queue_work(wq, &ordered->work);  in btrfs_queue_ordered_fn()
372 bool btrfs_finish_ordered_extent(struct btrfs_ordered_extent *ordered,  in btrfs_finish_ordered_extent()  argument
376 	struct btrfs_inode *inode = BTRFS_I(ordered->inode);  in btrfs_finish_ordered_extent()
383 	ret = can_finish_ordered_extent(ordered, page, file_offset, len, uptodate);  in btrfs_finish_ordered_extent()
387 		btrfs_queue_ordered_fn(ordered);  in btrfs_finish_ordered_extent()
392  * Mark all ordered extents io inside the specified range finished.
396  *		 updated to indicate whether the pending ordered io is finished.
401  * This function is called for endio, thus the range must have ordered
424 		/* No ordered extents at all */  in btrfs_mark_ordered_io_finished()
437 			/* No more ordered extents, exit */  in btrfs_mark_ordered_io_finished()
443 			/* Go to next ordered extent and continue */  in btrfs_mark_ordered_io_finished()
458 		 * Now we are definitely inside one ordered extent.  in btrfs_mark_ordered_io_finished()
480  * Finish IO for one ordered extent across a given range.  The range can only
481  * contain one ordered extent.
483  * @cached:	 The cached ordered extent. If not NULL, we can skip the tree
484  *               search and use the ordered extent directly.
485  * 		 Will be also used to store the finished ordered extent.
489  * Return true if the ordered extent is finished in the range, and update
493  * NOTE: The range can NOT cross multiple ordered extents.
494  * Thus caller should ensure the range doesn't cross ordered extents.
522 			   "bad ordered accounting left %llu size %llu",  in btrfs_dec_test_ordered_pending()
547  * used to drop a reference on an ordered extent.  This will free
574  * remove an ordered extent from the tree.  No references are dropped
587 	 * If this is a free space inode the thread has not acquired the ordered  in btrfs_remove_ordered_extent()
671 	struct btrfs_ordered_extent *ordered;  in btrfs_run_ordered_extent_work()  local
673 	ordered = container_of(work, struct btrfs_ordered_extent, flush_work);  in btrfs_run_ordered_extent_work()
674 	btrfs_start_ordered_extent(ordered);  in btrfs_run_ordered_extent_work()
675 	complete(&ordered->completion);  in btrfs_run_ordered_extent_work()
679  * wait for all the ordered extents in a root.  This is done when balancing
689 	struct btrfs_ordered_extent *ordered, *next;  in btrfs_wait_ordered_extents()  local
697 		ordered = list_first_entry(&splice, struct btrfs_ordered_extent,  in btrfs_wait_ordered_extents()
700 		if (range_end <= ordered->disk_bytenr ||  in btrfs_wait_ordered_extents()
701 		    ordered->disk_bytenr + ordered->disk_num_bytes <= range_start) {  in btrfs_wait_ordered_extents()
702 			list_move_tail(&ordered->root_extent_list, &skipped);  in btrfs_wait_ordered_extents()
707 		list_move_tail(&ordered->root_extent_list,  in btrfs_wait_ordered_extents()
709 		refcount_inc(&ordered->refs);  in btrfs_wait_ordered_extents()
712 		btrfs_init_work(&ordered->flush_work,  in btrfs_wait_ordered_extents()
714 		list_add_tail(&ordered->work_list, &works);  in btrfs_wait_ordered_extents()
715 		btrfs_queue_work(fs_info->flush_workers, &ordered->flush_work);  in btrfs_wait_ordered_extents()
727 	list_for_each_entry_safe(ordered, next, &works, work_list) {  in btrfs_wait_ordered_extents()
728 		list_del_init(&ordered->work_list);  in btrfs_wait_ordered_extents()
729 		wait_for_completion(&ordered->completion);  in btrfs_wait_ordered_extents()
730 		btrfs_put_ordered_extent(ordered);  in btrfs_wait_ordered_extents()
772  * Start IO and wait for a given ordered extent to finish.
787 	 * If this is a free space inode do not take the ordered extents lockdep  in btrfs_start_ordered_extent()
806  * Used to wait on ordered extents across a large range of bytes.
814 	struct btrfs_ordered_extent *ordered;  in btrfs_wait_ordered_range()  local
833 	 * for any ordered extents that haven't completed yet. This is to make  in btrfs_wait_ordered_range()
835 	 * before the ordered extents complete - to avoid failures (-EEXIST)  in btrfs_wait_ordered_range()
836 	 * when adding the new ordered extents to the ordered tree.  in btrfs_wait_ordered_range()
842 		ordered = btrfs_lookup_first_ordered_extent(BTRFS_I(inode), end);  in btrfs_wait_ordered_range()
843 		if (!ordered)  in btrfs_wait_ordered_range()
845 		if (ordered->file_offset > orig_end) {  in btrfs_wait_ordered_range()
846 			btrfs_put_ordered_extent(ordered);  in btrfs_wait_ordered_range()
849 		if (ordered->file_offset + ordered->num_bytes <= start) {  in btrfs_wait_ordered_range()
850 			btrfs_put_ordered_extent(ordered);  in btrfs_wait_ordered_range()
853 		btrfs_start_ordered_extent(ordered);  in btrfs_wait_ordered_range()
854 		end = ordered->file_offset;  in btrfs_wait_ordered_range()
856 		 * If the ordered extent had an error save the error but don't  in btrfs_wait_ordered_range()
857 		 * exit without waiting first for all other ordered extents in  in btrfs_wait_ordered_range()
860 		if (test_bit(BTRFS_ORDERED_IOERR, &ordered->flags))  in btrfs_wait_ordered_range()
862 		btrfs_put_ordered_extent(ordered);  in btrfs_wait_ordered_range()
871  * find an ordered extent corresponding to file_offset.  return NULL if
898 /* Since the DIO code tries to lock a wide area we need to look for any ordered
939  * Adds all ordered extents to the given list. The list ends up sorted by the
940  * file_offset of the ordered extents.
951 		struct btrfs_ordered_extent *ordered;  in btrfs_get_ordered_extents_for_logging()  local
953 		ordered = rb_entry(n, struct btrfs_ordered_extent, rb_node);  in btrfs_get_ordered_extents_for_logging()
955 		if (test_bit(BTRFS_ORDERED_LOGGED, &ordered->flags))  in btrfs_get_ordered_extents_for_logging()
958 		ASSERT(list_empty(&ordered->log_list));  in btrfs_get_ordered_extents_for_logging()
959 		list_add_tail(&ordered->log_list, list);  in btrfs_get_ordered_extents_for_logging()
960 		refcount_inc(&ordered->refs);  in btrfs_get_ordered_extents_for_logging()
961 		trace_btrfs_ordered_extent_lookup_for_logging(inode, ordered);  in btrfs_get_ordered_extents_for_logging()
990  * Lookup the first ordered extent that overlaps the range
994  * that this one won't return any ordered extent that does not overlap the range.
996  * ensures the first ordered extent gets returned.
1012 	 * And __tree_search() can't return the adjacent ordered extents  in btrfs_lookup_first_ordered_range()
1024 			 * Direct hit, got an ordered extent that starts at  in btrfs_lookup_first_ordered_range()
1054 	/* No ordered extent in the range */  in btrfs_lookup_first_ordered_range()
1067  * Lock the passed range and ensures all pending ordered extents in it are run
1070  * @inode:        Inode whose ordered tree is to be searched
1084 	struct btrfs_ordered_extent *ordered;  in btrfs_lock_and_flush_ordered_range()  local
1093 		ordered = btrfs_lookup_ordered_range(inode, start,  in btrfs_lock_and_flush_ordered_range()
1095 		if (!ordered) {  in btrfs_lock_and_flush_ordered_range()
1106 		btrfs_start_ordered_extent(ordered);  in btrfs_lock_and_flush_ordered_range()
1107 		btrfs_put_ordered_extent(ordered);  in btrfs_lock_and_flush_ordered_range()
1112  * Lock the passed range and ensure all pending ordered extents in it are run
1121 	struct btrfs_ordered_extent *ordered;  in btrfs_try_lock_ordered_range()  local
1126 	ordered = btrfs_lookup_ordered_range(inode, start, end - start + 1);  in btrfs_try_lock_ordered_range()
1127 	if (!ordered)  in btrfs_try_lock_ordered_range()
1130 	btrfs_put_ordered_extent(ordered);  in btrfs_try_lock_ordered_range()
1136 /* Split out a new ordered extent for this first @len bytes of @ordered. */
1138 			struct btrfs_ordered_extent *ordered, u64 len)  in btrfs_split_ordered_extent()  argument
1140 	struct btrfs_inode *inode = BTRFS_I(ordered->inode);  in btrfs_split_ordered_extent()
1143 	u64 file_offset = ordered->file_offset;  in btrfs_split_ordered_extent()
1144 	u64 disk_bytenr = ordered->disk_bytenr;  in btrfs_split_ordered_extent()
1145 	unsigned long flags = ordered->flags;  in btrfs_split_ordered_extent()
1151 	trace_btrfs_ordered_extent_split(inode, ordered);  in btrfs_split_ordered_extent()
1156 	 * The entire bio must be covered by the ordered extent, but we can't  in btrfs_split_ordered_extent()
1159 	if (WARN_ON_ONCE(len >= ordered->num_bytes))  in btrfs_split_ordered_extent()
1161 	/* We cannot split partially completed ordered extents. */  in btrfs_split_ordered_extent()
1162 	if (ordered->bytes_left) {  in btrfs_split_ordered_extent()
1164 		if (WARN_ON_ONCE(ordered->bytes_left != ordered->disk_num_bytes))  in btrfs_split_ordered_extent()
1167 	/* We cannot split a compressed ordered extent. */  in btrfs_split_ordered_extent()
1168 	if (WARN_ON_ONCE(ordered->disk_num_bytes != ordered->num_bytes))  in btrfs_split_ordered_extent()
1172 				   len, 0, flags, ordered->compress_type);  in btrfs_split_ordered_extent()
1182 	node = &ordered->rb_node;  in btrfs_split_ordered_extent()
1188 	ordered->file_offset += len;  in btrfs_split_ordered_extent()
1189 	ordered->disk_bytenr += len;  in btrfs_split_ordered_extent()
1190 	ordered->num_bytes -= len;  in btrfs_split_ordered_extent()
1191 	ordered->disk_num_bytes -= len;  in btrfs_split_ordered_extent()
1193 	if (test_bit(BTRFS_ORDERED_IO_DONE, &ordered->flags)) {  in btrfs_split_ordered_extent()
1194 		ASSERT(ordered->bytes_left == 0);  in btrfs_split_ordered_extent()
1197 		ordered->bytes_left -= len;  in btrfs_split_ordered_extent()
1200 	if (test_bit(BTRFS_ORDERED_TRUNCATED, &ordered->flags)) {  in btrfs_split_ordered_extent()
1201 		if (ordered->truncated_len > len) {  in btrfs_split_ordered_extent()
1202 			ordered->truncated_len -= len;  in btrfs_split_ordered_extent()
1204 			new->truncated_len = ordered->truncated_len;  in btrfs_split_ordered_extent()
1205 			ordered->truncated_len = 0;  in btrfs_split_ordered_extent()
1209 	list_for_each_entry_safe(sum, tmpsum, &ordered->list, list) {  in btrfs_split_ordered_extent()
1217 	node = tree_insert(&inode->ordered_tree, ordered->file_offset,  in btrfs_split_ordered_extent()
1218 			   &ordered->rb_node);  in btrfs_split_ordered_extent()
1221 			"zoned: inconsistency in ordered tree at offset %llu",  in btrfs_split_ordered_extent()
1222 			ordered->file_offset);  in btrfs_split_ordered_extent()
1227 			"zoned: inconsistency in ordered tree at offset %llu",  in btrfs_split_ordered_extent()