18 static u64 entry_end(struct btrfs_ordered_extent *entry)  in entry_end()  argument
20 	if (entry->file_offset + entry->len < entry->file_offset)  in entry_end()
22 	return entry->file_offset + entry->len;  in entry_end()
33 	struct btrfs_ordered_extent *entry;  in tree_insert()  local
37 		entry = rb_entry(parent, struct btrfs_ordered_extent, rb_node);  in tree_insert()
39 		if (file_offset < entry->file_offset)  in tree_insert()
41 		else if (file_offset >= entry_end(entry))  in tree_insert()
70 	struct btrfs_ordered_extent *entry;  in __tree_search()  local
74 		entry = rb_entry(n, struct btrfs_ordered_extent, rb_node);  in __tree_search()
76 		prev_entry = entry;  in __tree_search()
78 		if (file_offset < entry->file_offset)  in __tree_search()
80 		else if (file_offset >= entry_end(entry))  in __tree_search()
117 static int offset_in_entry(struct btrfs_ordered_extent *entry, u64 file_offset)  in offset_in_entry()  argument
119 	if (file_offset < entry->file_offset ||  in offset_in_entry()
120 	    entry->file_offset + entry->len <= file_offset)  in offset_in_entry()
125 static int range_overlaps(struct btrfs_ordered_extent *entry, u64 file_offset,  in range_overlaps()  argument
128 	if (file_offset + len <= entry->file_offset ||  in range_overlaps()
129 	    entry->file_offset + entry->len <= file_offset)  in range_overlaps()
144 	struct btrfs_ordered_extent *entry;  in tree_search()  local
147 		entry = rb_entry(tree->last, struct btrfs_ordered_extent,  in tree_search()
149 		if (offset_in_entry(entry, file_offset))  in tree_search()
179 	struct btrfs_ordered_extent *entry;  in __btrfs_add_ordered_extent()  local
182 	entry = kmem_cache_zalloc(btrfs_ordered_extent_cache, GFP_NOFS);  in __btrfs_add_ordered_extent()
183 	if (!entry)  in __btrfs_add_ordered_extent()
186 	entry->file_offset = file_offset;  in __btrfs_add_ordered_extent()
187 	entry->start = start;  in __btrfs_add_ordered_extent()
188 	entry->len = len;  in __btrfs_add_ordered_extent()
189 	entry->disk_len = disk_len;  in __btrfs_add_ordered_extent()
190 	entry->bytes_left = len;  in __btrfs_add_ordered_extent()
191 	entry->inode = igrab(inode);  in __btrfs_add_ordered_extent()
192 	entry->compress_type = compress_type;  in __btrfs_add_ordered_extent()
193 	entry->truncated_len = (u64)-1;  in __btrfs_add_ordered_extent()
195 		set_bit(type, &entry->flags);  in __btrfs_add_ordered_extent()
198 		set_bit(BTRFS_ORDERED_DIRECT, &entry->flags);  in __btrfs_add_ordered_extent()
201 	refcount_set(&entry->refs, 1);  in __btrfs_add_ordered_extent()
202 	init_waitqueue_head(&entry->wait);  in __btrfs_add_ordered_extent()
203 	INIT_LIST_HEAD(&entry->list);  in __btrfs_add_ordered_extent()
204 	INIT_LIST_HEAD(&entry->root_extent_list);  in __btrfs_add_ordered_extent()
205 	INIT_LIST_HEAD(&entry->work_list);  in __btrfs_add_ordered_extent()
206 	init_completion(&entry->completion);  in __btrfs_add_ordered_extent()
207 	INIT_LIST_HEAD(&entry->log_list);  in __btrfs_add_ordered_extent()
208 	INIT_LIST_HEAD(&entry->trans_list);  in __btrfs_add_ordered_extent()
210 	trace_btrfs_ordered_extent_add(inode, entry);  in __btrfs_add_ordered_extent()
214 			   &entry->rb_node);  in __btrfs_add_ordered_extent()
220 	list_add_tail(&entry->root_extent_list,  in __btrfs_add_ordered_extent()
274 			   struct btrfs_ordered_extent *entry,  in btrfs_add_ordered_sum()  argument
281 	list_add_tail(&sum->list, &entry->list);  in btrfs_add_ordered_sum()
304 	struct btrfs_ordered_extent *entry = NULL;  in btrfs_dec_test_first_ordered_pending()  local
319 	entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_dec_test_first_ordered_pending()
320 	if (!offset_in_entry(entry, *file_offset)) {  in btrfs_dec_test_first_ordered_pending()
325 	dec_start = max(*file_offset, entry->file_offset);  in btrfs_dec_test_first_ordered_pending()
326 	dec_end = min(*file_offset + io_size, entry->file_offset +  in btrfs_dec_test_first_ordered_pending()
327 		      entry->len);  in btrfs_dec_test_first_ordered_pending()
334 	if (to_dec > entry->bytes_left) {  in btrfs_dec_test_first_ordered_pending()
337 			   entry->bytes_left, to_dec);  in btrfs_dec_test_first_ordered_pending()
339 	entry->bytes_left -= to_dec;  in btrfs_dec_test_first_ordered_pending()
341 		set_bit(BTRFS_ORDERED_IOERR, &entry->flags);  in btrfs_dec_test_first_ordered_pending()
343 	if (entry->bytes_left == 0) {  in btrfs_dec_test_first_ordered_pending()
344 		ret = test_and_set_bit(BTRFS_ORDERED_IO_DONE, &entry->flags);  in btrfs_dec_test_first_ordered_pending()
346 		cond_wake_up_nomb(&entry->wait);  in btrfs_dec_test_first_ordered_pending()
351 	if (!ret && cached && entry) {  in btrfs_dec_test_first_ordered_pending()
352 		*cached = entry;  in btrfs_dec_test_first_ordered_pending()
353 		refcount_inc(&entry->refs);  in btrfs_dec_test_first_ordered_pending()
374 	struct btrfs_ordered_extent *entry = NULL;  in btrfs_dec_test_ordered_pending()  local
381 		entry = *cached;  in btrfs_dec_test_ordered_pending()
391 	entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_dec_test_ordered_pending()
393 	if (!offset_in_entry(entry, file_offset)) {  in btrfs_dec_test_ordered_pending()
398 	if (io_size > entry->bytes_left) {  in btrfs_dec_test_ordered_pending()
401 		       entry->bytes_left, io_size);  in btrfs_dec_test_ordered_pending()
403 	entry->bytes_left -= io_size;  in btrfs_dec_test_ordered_pending()
405 		set_bit(BTRFS_ORDERED_IOERR, &entry->flags);  in btrfs_dec_test_ordered_pending()
407 	if (entry->bytes_left == 0) {  in btrfs_dec_test_ordered_pending()
408 		ret = test_and_set_bit(BTRFS_ORDERED_IO_DONE, &entry->flags);  in btrfs_dec_test_ordered_pending()
410 		cond_wake_up_nomb(&entry->wait);  in btrfs_dec_test_ordered_pending()
415 	if (!ret && cached && entry) {  in btrfs_dec_test_ordered_pending()
416 		*cached = entry;  in btrfs_dec_test_ordered_pending()
417 		refcount_inc(&entry->refs);  in btrfs_dec_test_ordered_pending()
427 void btrfs_put_ordered_extent(struct btrfs_ordered_extent *entry)  in btrfs_put_ordered_extent()  argument
432 	trace_btrfs_ordered_extent_put(entry->inode, entry);  in btrfs_put_ordered_extent()
434 	if (refcount_dec_and_test(&entry->refs)) {  in btrfs_put_ordered_extent()
435 		ASSERT(list_empty(&entry->log_list));  in btrfs_put_ordered_extent()
436 		ASSERT(list_empty(&entry->trans_list));  in btrfs_put_ordered_extent()
437 		ASSERT(list_empty(&entry->root_extent_list));  in btrfs_put_ordered_extent()
438 		ASSERT(RB_EMPTY_NODE(&entry->rb_node));  in btrfs_put_ordered_extent()
439 		if (entry->inode)  in btrfs_put_ordered_extent()
440 			btrfs_add_delayed_iput(entry->inode);  in btrfs_put_ordered_extent()
441 		while (!list_empty(&entry->list)) {  in btrfs_put_ordered_extent()
442 			cur = entry->list.next;  in btrfs_put_ordered_extent()
447 		kmem_cache_free(btrfs_ordered_extent_cache, entry);  in btrfs_put_ordered_extent()
456 				 struct btrfs_ordered_extent *entry)  in btrfs_remove_ordered_extent()  argument
470 		btrfs_delalloc_release_metadata(btrfs_inode, entry->len, false);  in btrfs_remove_ordered_extent()
474 	node = &entry->rb_node;  in btrfs_remove_ordered_extent()
479 	set_bit(BTRFS_ORDERED_COMPLETE, &entry->flags);  in btrfs_remove_ordered_extent()
480 	if (test_and_clear_bit(BTRFS_ORDERED_PENDING, &entry->flags))  in btrfs_remove_ordered_extent()
512 	list_del_init(&entry->root_extent_list);  in btrfs_remove_ordered_extent()
515 	trace_btrfs_ordered_extent_remove(inode, entry);  in btrfs_remove_ordered_extent()
524 	wake_up(&entry->wait);  in btrfs_remove_ordered_extent()
644 				       struct btrfs_ordered_extent *entry,  in btrfs_start_ordered_extent()  argument
647 	u64 start = entry->file_offset;  in btrfs_start_ordered_extent()
648 	u64 end = start + entry->len - 1;  in btrfs_start_ordered_extent()
650 	trace_btrfs_ordered_extent_start(inode, entry);  in btrfs_start_ordered_extent()
657 	if (!test_bit(BTRFS_ORDERED_DIRECT, &entry->flags))  in btrfs_start_ordered_extent()
660 		wait_event(entry->wait, test_bit(BTRFS_ORDERED_COMPLETE,  in btrfs_start_ordered_extent()
661 						 &entry->flags));  in btrfs_start_ordered_extent()
734 	struct btrfs_ordered_extent *entry = NULL;  in btrfs_lookup_ordered_extent()  local
742 	entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_lookup_ordered_extent()
743 	if (!offset_in_entry(entry, file_offset))  in btrfs_lookup_ordered_extent()
744 		entry = NULL;  in btrfs_lookup_ordered_extent()
745 	if (entry)  in btrfs_lookup_ordered_extent()
746 		refcount_inc(&entry->refs);  in btrfs_lookup_ordered_extent()
749 	return entry;  in btrfs_lookup_ordered_extent()
760 	struct btrfs_ordered_extent *entry = NULL;  in btrfs_lookup_ordered_range()  local
772 		entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_lookup_ordered_range()
773 		if (range_overlaps(entry, file_offset, len))  in btrfs_lookup_ordered_range()
776 		if (entry->file_offset >= file_offset + len) {  in btrfs_lookup_ordered_range()
777 			entry = NULL;  in btrfs_lookup_ordered_range()
780 		entry = NULL;  in btrfs_lookup_ordered_range()
786 	if (entry)  in btrfs_lookup_ordered_range()
787 		refcount_inc(&entry->refs);  in btrfs_lookup_ordered_range()
789 	return entry;  in btrfs_lookup_ordered_range()
801 	struct btrfs_ordered_extent *entry = NULL;  in btrfs_lookup_first_ordered_extent()  local
809 	entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_lookup_first_ordered_extent()
810 	refcount_inc(&entry->refs);  in btrfs_lookup_first_ordered_extent()
813 	return entry;  in btrfs_lookup_first_ordered_extent()