2 * Copyright (C) 2007 Oracle. All rights reserved.
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public
6 * License v2 as published by the Free Software Foundation.
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * General Public License for more details.
13 * You should have received a copy of the GNU General Public
14 * License along with this program; if not, write to the
15 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
16 * Boston, MA 021110-1307, USA.
19 #include <linux/gfp.h>
20 #include <linux/slab.h>
21 #include <linux/blkdev.h>
23 #include "transaction.h"
24 #include "btrfs_inode.h"
25 #include "extent_io.h"
28 static u64 entry_end(struct btrfs_ordered_extent *entry)
30 if (entry->file_offset + entry->len < entry->file_offset)
32 return entry->file_offset + entry->len;
35 static struct rb_node *tree_insert(struct rb_root *root, u64 file_offset,
38 struct rb_node ** p = &root->rb_node;
39 struct rb_node * parent = NULL;
40 struct btrfs_ordered_extent *entry;
44 entry = rb_entry(parent, struct btrfs_ordered_extent, rb_node);
46 if (file_offset < entry->file_offset)
48 else if (file_offset >= entry_end(entry))
54 rb_link_node(node, parent, p);
55 rb_insert_color(node, root);
59 static struct rb_node *__tree_search(struct rb_root *root, u64 file_offset,
60 struct rb_node **prev_ret)
62 struct rb_node * n = root->rb_node;
63 struct rb_node *prev = NULL;
65 struct btrfs_ordered_extent *entry;
66 struct btrfs_ordered_extent *prev_entry = NULL;
69 entry = rb_entry(n, struct btrfs_ordered_extent, rb_node);
73 if (file_offset < entry->file_offset)
75 else if (file_offset >= entry_end(entry))
83 while(prev && file_offset >= entry_end(prev_entry)) {
87 prev_entry = rb_entry(test, struct btrfs_ordered_extent,
89 if (file_offset < entry_end(prev_entry))
95 prev_entry = rb_entry(prev, struct btrfs_ordered_extent,
97 while(prev && file_offset < entry_end(prev_entry)) {
101 prev_entry = rb_entry(test, struct btrfs_ordered_extent,
109 static int offset_in_entry(struct btrfs_ordered_extent *entry, u64 file_offset)
111 if (file_offset < entry->file_offset ||
112 entry->file_offset + entry->len <= file_offset)
117 static inline struct rb_node *tree_search(struct btrfs_ordered_inode_tree *tree,
120 struct rb_root *root = &tree->tree;
121 struct rb_node *prev;
123 struct btrfs_ordered_extent *entry;
126 entry = rb_entry(tree->last, struct btrfs_ordered_extent,
128 if (offset_in_entry(entry, file_offset))
131 ret = __tree_search(root, file_offset, &prev);
139 int btrfs_add_ordered_extent(struct inode *inode, u64 file_offset,
142 struct btrfs_ordered_inode_tree *tree;
143 struct rb_node *node;
144 struct btrfs_ordered_extent *entry;
146 tree = &BTRFS_I(inode)->ordered_tree;
147 entry = kzalloc(sizeof(*entry), GFP_NOFS);
151 mutex_lock(&tree->mutex);
152 entry->file_offset = file_offset;
153 entry->start = start;
155 entry->inode = inode;
156 /* one ref for the tree */
157 atomic_set(&entry->refs, 1);
158 init_waitqueue_head(&entry->wait);
159 INIT_LIST_HEAD(&entry->list);
161 node = tree_insert(&tree->tree, file_offset,
164 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
165 atomic_inc(&entry->refs);
167 set_extent_ordered(&BTRFS_I(inode)->io_tree, file_offset,
168 entry_end(entry) - 1, GFP_NOFS);
170 set_bit(BTRFS_ORDERED_START, &entry->flags);
171 mutex_unlock(&tree->mutex);
176 int btrfs_add_ordered_sum(struct inode *inode, struct btrfs_ordered_sum *sum)
178 struct btrfs_ordered_inode_tree *tree;
179 struct rb_node *node;
180 struct btrfs_ordered_extent *entry;
182 tree = &BTRFS_I(inode)->ordered_tree;
183 mutex_lock(&tree->mutex);
184 node = tree_search(tree, sum->file_offset);
187 printk("add ordered sum failed to find a node for inode %lu offset %Lu\n", inode->i_ino, sum->file_offset);
188 node = rb_first(&tree->tree);
190 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
191 printk("entry %Lu %Lu %Lu\n", entry->file_offset, entry->file_offset + entry->len, entry->start);
192 node = rb_next(node);
198 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
199 if (!offset_in_entry(entry, sum->file_offset)) {
203 list_add_tail(&sum->list, &entry->list);
204 mutex_unlock(&tree->mutex);
208 int btrfs_dec_test_ordered_pending(struct inode *inode,
209 u64 file_offset, u64 io_size)
211 struct btrfs_ordered_inode_tree *tree;
212 struct rb_node *node;
213 struct btrfs_ordered_extent *entry;
214 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
217 tree = &BTRFS_I(inode)->ordered_tree;
218 mutex_lock(&tree->mutex);
219 clear_extent_ordered(io_tree, file_offset, file_offset + io_size - 1,
221 node = tree_search(tree, file_offset);
227 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
228 if (!offset_in_entry(entry, file_offset)) {
233 ret = test_range_bit(io_tree, entry->file_offset,
234 entry->file_offset + entry->len - 1,
236 if (!test_bit(BTRFS_ORDERED_START, &entry->flags)) {
237 printk("inode %lu not ready yet for extent %Lu %Lu\n", inode->i_ino, entry->file_offset, entry_end(entry));
240 ret = test_and_set_bit(BTRFS_ORDERED_IO_DONE, &entry->flags);
242 mutex_unlock(&tree->mutex);
246 int btrfs_put_ordered_extent(struct btrfs_ordered_extent *entry)
248 if (atomic_dec_and_test(&entry->refs))
253 int btrfs_remove_ordered_extent(struct inode *inode,
254 struct btrfs_ordered_extent *entry)
256 struct btrfs_ordered_inode_tree *tree;
257 struct rb_node *node;
259 tree = &BTRFS_I(inode)->ordered_tree;
260 mutex_lock(&tree->mutex);
261 node = &entry->rb_node;
262 rb_erase(node, &tree->tree);
264 set_bit(BTRFS_ORDERED_COMPLETE, &entry->flags);
265 mutex_unlock(&tree->mutex);
266 wake_up(&entry->wait);
270 void btrfs_wait_ordered_extent(struct inode *inode,
271 struct btrfs_ordered_extent *entry)
273 u64 start = entry->file_offset;
274 u64 end = start + entry->len - 1;
275 #if LINUX_VERSION_CODE < KERNEL_VERSION(2,6,22)
276 do_sync_file_range(file, start, end, SYNC_FILE_RANGE_WRITE);
278 do_sync_mapping_range(inode->i_mapping, start, end,
279 SYNC_FILE_RANGE_WRITE);
281 wait_event(entry->wait,
282 test_bit(BTRFS_ORDERED_COMPLETE, &entry->flags));
285 static void btrfs_start_ordered_extent(struct inode *inode,
286 struct btrfs_ordered_extent *entry, int wait)
288 u64 start = entry->file_offset;
289 u64 end = start + entry->len - 1;
291 #if LINUX_VERSION_CODE < KERNEL_VERSION(2,6,22)
292 do_sync_file_range(file, start, end, SYNC_FILE_RANGE_WRITE);
294 do_sync_mapping_range(inode->i_mapping, start, end,
295 SYNC_FILE_RANGE_WRITE);
298 wait_event(entry->wait, test_bit(BTRFS_ORDERED_COMPLETE,
302 void btrfs_wait_ordered_range(struct inode *inode, u64 start, u64 len)
305 struct btrfs_ordered_extent *ordered;
310 if (start + len < start)
313 end = start + len - 1;
316 ordered = btrfs_lookup_first_ordered_extent(inode, end);
320 if (ordered->file_offset >= start + len) {
321 btrfs_put_ordered_extent(ordered);
324 if (ordered->file_offset + ordered->len < start) {
325 btrfs_put_ordered_extent(ordered);
328 btrfs_start_ordered_extent(inode, ordered, should_wait);
330 end = ordered->file_offset;
331 btrfs_put_ordered_extent(ordered);
336 if (should_wait && found) {
342 int btrfs_add_ordered_pending(struct inode *inode,
343 struct btrfs_ordered_extent *ordered,
350 struct btrfs_ordered_inode_tree *tree;
351 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
353 tree = &BTRFS_I(inode)->ordered_tree;
354 mutex_lock(&tree->mutex);
355 if (test_bit(BTRFS_ORDERED_IO_DONE, &ordered->flags)) {
359 set_extent_ordered(io_tree, start, start + len - 1, GFP_NOFS);
362 mutex_unlock(&tree->mutex);
367 struct btrfs_ordered_extent *btrfs_lookup_ordered_extent(struct inode *inode,
370 struct btrfs_ordered_inode_tree *tree;
371 struct rb_node *node;
372 struct btrfs_ordered_extent *entry = NULL;
374 tree = &BTRFS_I(inode)->ordered_tree;
375 mutex_lock(&tree->mutex);
376 node = tree_search(tree, file_offset);
380 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
381 if (!offset_in_entry(entry, file_offset))
384 atomic_inc(&entry->refs);
386 mutex_unlock(&tree->mutex);
390 struct btrfs_ordered_extent *
391 btrfs_lookup_first_ordered_extent(struct inode * inode, u64 file_offset)
393 struct btrfs_ordered_inode_tree *tree;
394 struct rb_node *node;
395 struct btrfs_ordered_extent *entry = NULL;
397 tree = &BTRFS_I(inode)->ordered_tree;
398 mutex_lock(&tree->mutex);
399 node = tree_search(tree, file_offset);
403 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
404 atomic_inc(&entry->refs);
406 mutex_unlock(&tree->mutex);
410 int btrfs_ordered_update_i_size(struct inode *inode,
411 struct btrfs_ordered_extent *ordered)
413 struct btrfs_ordered_inode_tree *tree = &BTRFS_I(inode)->ordered_tree;
414 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
418 struct rb_node *node;
419 struct btrfs_ordered_extent *test;
421 mutex_lock(&tree->mutex);
422 disk_i_size = BTRFS_I(inode)->disk_i_size;
425 * if the disk i_size is already at the inode->i_size, or
426 * this ordered extent is inside the disk i_size, we're done
428 if (disk_i_size >= inode->i_size ||
429 ordered->file_offset + ordered->len <= disk_i_size) {
434 * we can't update the disk_isize if there are delalloc bytes
435 * between disk_i_size and this ordered extent
437 if (test_range_bit(io_tree, disk_i_size,
438 ordered->file_offset + ordered->len - 1,
439 EXTENT_DELALLOC, 0)) {
443 * walk backward from this ordered extent to disk_i_size.
444 * if we find an ordered extent then we can't update disk i_size
448 node = rb_prev(&ordered->rb_node);
451 test = rb_entry(node, struct btrfs_ordered_extent, rb_node);
452 if (test->file_offset + test->len <= disk_i_size)
454 if (test->file_offset >= inode->i_size)
456 if (test->file_offset >= disk_i_size)
459 new_i_size = min_t(u64, entry_end(ordered), i_size_read(inode));
462 * at this point, we know we can safely update i_size to at least
463 * the offset from this ordered extent. But, we need to
464 * walk forward and see if ios from higher up in the file have
467 node = rb_next(&ordered->rb_node);
471 * do we have an area where IO might have finished
472 * between our ordered extent and the next one.
474 test = rb_entry(node, struct btrfs_ordered_extent, rb_node);
475 if (test->file_offset > entry_end(ordered)) {
476 i_size_test = test->file_offset - 1;
479 i_size_test = i_size_read(inode);
483 * i_size_test is the end of a region after this ordered
484 * extent where there are no ordered extents. As long as there
485 * are no delalloc bytes in this area, it is safe to update
486 * disk_i_size to the end of the region.
488 if (i_size_test > entry_end(ordered) &&
489 !test_range_bit(io_tree, entry_end(ordered), i_size_test,
490 EXTENT_DELALLOC, 0)) {
491 new_i_size = min_t(u64, i_size_test, i_size_read(inode));
493 BTRFS_I(inode)->disk_i_size = new_i_size;
495 mutex_unlock(&tree->mutex);