23 	if (entry->file_offset + entry->len < entry->file_offset)  in entry_end()
25 	return entry->file_offset + entry->len;  in entry_end()
31 static struct rb_node *tree_insert(struct rb_root *root, u64 file_offset,  in tree_insert()  argument
42 		if (file_offset < entry->file_offset)  in tree_insert()
44 		else if (file_offset >= entry_end(entry))  in tree_insert()
67 static struct rb_node *__tree_search(struct rb_root *root, u64 file_offset,  in __tree_search()  argument
81 		if (file_offset < entry->file_offset)  in __tree_search()
83 		else if (file_offset >= entry_end(entry))  in __tree_search()
91 	while (prev && file_offset >= entry_end(prev_entry)) {  in __tree_search()
97 		if (file_offset < entry_end(prev_entry))  in __tree_search()
105 	while (prev && file_offset < entry_end(prev_entry)) {  in __tree_search()
120 static int offset_in_entry(struct btrfs_ordered_extent *entry, u64 file_offset)  in offset_in_entry()  argument
122 	if (file_offset < entry->file_offset ||  in offset_in_entry()
123 	    entry->file_offset + entry->len <= file_offset)  in offset_in_entry()
128 static int range_overlaps(struct btrfs_ordered_extent *entry, u64 file_offset,  in range_overlaps()  argument
131 	if (file_offset + len <= entry->file_offset ||  in range_overlaps()
132 	    entry->file_offset + entry->len <= file_offset)  in range_overlaps()
142 					  u64 file_offset)  in tree_search()  argument
152 		if (offset_in_entry(entry, file_offset))  in tree_search()
155 	ret = __tree_search(root, file_offset, &prev);  in tree_search()
174 static int __btrfs_add_ordered_extent(struct inode *inode, u64 file_offset,  in __btrfs_add_ordered_extent()  argument
189 	entry->file_offset = file_offset;  in __btrfs_add_ordered_extent()
219 	node = tree_insert(&tree->tree, file_offset,  in __btrfs_add_ordered_extent()
222 		ordered_data_tree_panic(inode, -EEXIST, file_offset);  in __btrfs_add_ordered_extent()
249 int btrfs_add_ordered_extent(struct inode *inode, u64 file_offset,  in btrfs_add_ordered_extent()  argument
252 	return __btrfs_add_ordered_extent(inode, file_offset, start, len,  in btrfs_add_ordered_extent()
257 int btrfs_add_ordered_extent_dio(struct inode *inode, u64 file_offset,  in btrfs_add_ordered_extent_dio()  argument
260 	return __btrfs_add_ordered_extent(inode, file_offset, start, len,  in btrfs_add_ordered_extent_dio()
265 int btrfs_add_ordered_extent_compress(struct inode *inode, u64 file_offset,  in btrfs_add_ordered_extent_compress()  argument
269 	return __btrfs_add_ordered_extent(inode, file_offset, start, len,  in btrfs_add_ordered_extent_compress()
304 				   u64 *file_offset, u64 io_size, int uptodate)  in btrfs_dec_test_first_ordered_pending()  argument
318 	node = tree_search(tree, *file_offset);  in btrfs_dec_test_first_ordered_pending()
325 	if (!offset_in_entry(entry, *file_offset)) {  in btrfs_dec_test_first_ordered_pending()
330 	dec_start = max(*file_offset, entry->file_offset);  in btrfs_dec_test_first_ordered_pending()
331 	dec_end = min(*file_offset + io_size, entry->file_offset +  in btrfs_dec_test_first_ordered_pending()
333 	*file_offset = dec_end;  in btrfs_dec_test_first_ordered_pending()
375 				   u64 file_offset, u64 io_size, int uptodate)  in btrfs_dec_test_ordered_pending()  argument
390 	node = tree_search(tree, file_offset);  in btrfs_dec_test_ordered_pending()
398 	if (!offset_in_entry(entry, file_offset)) {  in btrfs_dec_test_ordered_pending()
626 	u64 start = entry->file_offset;  in btrfs_start_ordered_extent()
684 		if (ordered->file_offset > orig_end) {  in btrfs_wait_ordered_range()
688 		if (ordered->file_offset + ordered->len <= start) {  in btrfs_wait_ordered_range()
693 		end = ordered->file_offset;  in btrfs_wait_ordered_range()
709 							 u64 file_offset)  in btrfs_lookup_ordered_extent()  argument
717 	node = tree_search(tree, file_offset);  in btrfs_lookup_ordered_extent()
722 	if (!offset_in_entry(entry, file_offset))  in btrfs_lookup_ordered_extent()
735 		struct btrfs_inode *inode, u64 file_offset, u64 len)  in btrfs_lookup_ordered_range()  argument
743 	node = tree_search(tree, file_offset);  in btrfs_lookup_ordered_range()
745 		node = tree_search(tree, file_offset + len);  in btrfs_lookup_ordered_range()
752 		if (range_overlaps(entry, file_offset, len))  in btrfs_lookup_ordered_range()
755 		if (entry->file_offset >= file_offset + len) {  in btrfs_lookup_ordered_range()
776 btrfs_lookup_first_ordered_extent(struct inode *inode, u64 file_offset)  in btrfs_lookup_first_ordered_extent()  argument
784 	node = tree_search(tree, file_offset);  in btrfs_lookup_first_ordered_extent()
817 				     ordered->file_offset +  in btrfs_ordered_update_i_size()
885 		if (test->file_offset >= i_size)  in btrfs_ordered_update_i_size()