33 	if (entry->file_offset + entry->len < entry->file_offset)  in entry_end()
35 	return entry->file_offset + entry->len;  in entry_end()
41 static struct rb_node *tree_insert(struct rb_root *root, u64 file_offset,  in tree_insert()  argument
52 		if (file_offset < entry->file_offset)  in tree_insert()
54 		else if (file_offset >= entry_end(entry))  in tree_insert()
77 static struct rb_node *__tree_search(struct rb_root *root, u64 file_offset,  in __tree_search()  argument
91 		if (file_offset < entry->file_offset)  in __tree_search()
93 		else if (file_offset >= entry_end(entry))  in __tree_search()
101 	while (prev && file_offset >= entry_end(prev_entry)) {  in __tree_search()
107 		if (file_offset < entry_end(prev_entry))  in __tree_search()
115 	while (prev && file_offset < entry_end(prev_entry)) {  in __tree_search()
130 static int offset_in_entry(struct btrfs_ordered_extent *entry, u64 file_offset)  in offset_in_entry()  argument
132 	if (file_offset < entry->file_offset ||  in offset_in_entry()
133 	    entry->file_offset + entry->len <= file_offset)  in offset_in_entry()
138 static int range_overlaps(struct btrfs_ordered_extent *entry, u64 file_offset,  in range_overlaps()  argument
141 	if (file_offset + len <= entry->file_offset ||  in range_overlaps()
142 	    entry->file_offset + entry->len <= file_offset)  in range_overlaps()
152 					  u64 file_offset)  in tree_search()  argument
162 		if (offset_in_entry(entry, file_offset))  in tree_search()
165 	ret = __tree_search(root, file_offset, &prev);  in tree_search()
184 static int __btrfs_add_ordered_extent(struct inode *inode, u64 file_offset,  in __btrfs_add_ordered_extent()  argument
198 	entry->file_offset = file_offset;  in __btrfs_add_ordered_extent()
225 	node = tree_insert(&tree->tree, file_offset,  in __btrfs_add_ordered_extent()
228 		ordered_data_tree_panic(inode, -EEXIST, file_offset);  in __btrfs_add_ordered_extent()
247 int btrfs_add_ordered_extent(struct inode *inode, u64 file_offset,  in btrfs_add_ordered_extent()  argument
250 	return __btrfs_add_ordered_extent(inode, file_offset, start, len,  in btrfs_add_ordered_extent()
255 int btrfs_add_ordered_extent_dio(struct inode *inode, u64 file_offset,  in btrfs_add_ordered_extent_dio()  argument
258 	return __btrfs_add_ordered_extent(inode, file_offset, start, len,  in btrfs_add_ordered_extent_dio()
263 int btrfs_add_ordered_extent_compress(struct inode *inode, u64 file_offset,  in btrfs_add_ordered_extent_compress()  argument
267 	return __btrfs_add_ordered_extent(inode, file_offset, start, len,  in btrfs_add_ordered_extent_compress()
303 				   u64 *file_offset, u64 io_size, int uptodate)  in btrfs_dec_test_first_ordered_pending()  argument
316 	node = tree_search(tree, *file_offset);  in btrfs_dec_test_first_ordered_pending()
323 	if (!offset_in_entry(entry, *file_offset)) {  in btrfs_dec_test_first_ordered_pending()
328 	dec_start = max(*file_offset, entry->file_offset);  in btrfs_dec_test_first_ordered_pending()
329 	dec_end = min(*file_offset + io_size, entry->file_offset +  in btrfs_dec_test_first_ordered_pending()
331 	*file_offset = dec_end;  in btrfs_dec_test_first_ordered_pending()
376 				   u64 file_offset, u64 io_size, int uptodate)  in btrfs_dec_test_ordered_pending()  argument
391 	node = tree_search(tree, file_offset);  in btrfs_dec_test_ordered_pending()
399 	if (!offset_in_entry(entry, file_offset)) {  in btrfs_dec_test_ordered_pending()
450 		if (ordered->file_offset > end)  in btrfs_get_logged_extents()
503 			u64 start = ordered->file_offset;  in btrfs_wait_logged_extents()
504 			u64 end = ordered->file_offset + ordered->len - 1;  in btrfs_wait_logged_extents()
755 	u64 start = entry->file_offset;  in btrfs_start_ordered_extent()
813 		if (ordered->file_offset > orig_end) {  in btrfs_wait_ordered_range()
817 		if (ordered->file_offset + ordered->len <= start) {  in btrfs_wait_ordered_range()
822 		end = ordered->file_offset;  in btrfs_wait_ordered_range()
838 							 u64 file_offset)  in btrfs_lookup_ordered_extent()  argument
846 	node = tree_search(tree, file_offset);  in btrfs_lookup_ordered_extent()
851 	if (!offset_in_entry(entry, file_offset))  in btrfs_lookup_ordered_extent()
864 							u64 file_offset,  in btrfs_lookup_ordered_range()  argument
873 	node = tree_search(tree, file_offset);  in btrfs_lookup_ordered_range()
875 		node = tree_search(tree, file_offset + len);  in btrfs_lookup_ordered_range()
882 		if (range_overlaps(entry, file_offset, len))  in btrfs_lookup_ordered_range()
885 		if (entry->file_offset >= file_offset + len) {  in btrfs_lookup_ordered_range()
902 					 u64 file_offset,  in btrfs_have_ordered_extents_in_range()  argument
907 	oe = btrfs_lookup_ordered_range(inode, file_offset, len);  in btrfs_have_ordered_extents_in_range()
920 btrfs_lookup_first_ordered_extent(struct inode *inode, u64 file_offset)  in btrfs_lookup_first_ordered_extent()  argument
928 	node = tree_search(tree, file_offset);  in btrfs_lookup_first_ordered_extent()
960 				     ordered->file_offset +  in btrfs_ordered_update_i_size()
1015 		if (test->file_offset + test->len <= disk_i_size)  in btrfs_ordered_update_i_size()
1017 		if (test->file_offset >= i_size)  in btrfs_ordered_update_i_size()