blob: 5c2a9e78a949a03ff239db3b99843c258ce7cd84 [file] [log] [blame]
Chris Masondc17ff82008-01-08 15:46:30 -05001/*
2 * Copyright (C) 2007 Oracle. All rights reserved.
3 *
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.
7 *
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.
12 *
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.
17 */
18
19#include <linux/gfp.h>
20#include <linux/slab.h>
Chris Masond6bfde82008-04-30 13:59:35 -040021#include <linux/blkdev.h>
Chris Masonf4219502008-07-22 11:18:09 -040022#include <linux/writeback.h>
23#include <linux/pagevec.h>
Chris Masondc17ff82008-01-08 15:46:30 -050024#include "ctree.h"
25#include "transaction.h"
26#include "btrfs_inode.h"
Chris Masone6dcd2d2008-07-17 12:53:50 -040027#include "extent_io.h"
Chris Masondc17ff82008-01-08 15:46:30 -050028
Chris Masone6dcd2d2008-07-17 12:53:50 -040029static u64 entry_end(struct btrfs_ordered_extent *entry)
Chris Masondc17ff82008-01-08 15:46:30 -050030{
Chris Masone6dcd2d2008-07-17 12:53:50 -040031 if (entry->file_offset + entry->len < entry->file_offset)
32 return (u64)-1;
33 return entry->file_offset + entry->len;
Chris Masondc17ff82008-01-08 15:46:30 -050034}
35
Chris Masond352ac62008-09-29 15:18:18 -040036/* returns NULL if the insertion worked, or it returns the node it did find
37 * in the tree
38 */
Chris Masone6dcd2d2008-07-17 12:53:50 -040039static struct rb_node *tree_insert(struct rb_root *root, u64 file_offset,
40 struct rb_node *node)
Chris Masondc17ff82008-01-08 15:46:30 -050041{
Chris Masond3977122009-01-05 21:25:51 -050042 struct rb_node **p = &root->rb_node;
43 struct rb_node *parent = NULL;
Chris Masone6dcd2d2008-07-17 12:53:50 -040044 struct btrfs_ordered_extent *entry;
Chris Masondc17ff82008-01-08 15:46:30 -050045
Chris Masond3977122009-01-05 21:25:51 -050046 while (*p) {
Chris Masondc17ff82008-01-08 15:46:30 -050047 parent = *p;
Chris Masone6dcd2d2008-07-17 12:53:50 -040048 entry = rb_entry(parent, struct btrfs_ordered_extent, rb_node);
Chris Masondc17ff82008-01-08 15:46:30 -050049
Chris Masone6dcd2d2008-07-17 12:53:50 -040050 if (file_offset < entry->file_offset)
Chris Masondc17ff82008-01-08 15:46:30 -050051 p = &(*p)->rb_left;
Chris Masone6dcd2d2008-07-17 12:53:50 -040052 else if (file_offset >= entry_end(entry))
Chris Masondc17ff82008-01-08 15:46:30 -050053 p = &(*p)->rb_right;
54 else
55 return parent;
56 }
57
58 rb_link_node(node, parent, p);
59 rb_insert_color(node, root);
60 return NULL;
61}
62
Chris Masond352ac62008-09-29 15:18:18 -040063/*
64 * look for a given offset in the tree, and if it can't be found return the
65 * first lesser offset
66 */
Chris Masone6dcd2d2008-07-17 12:53:50 -040067static struct rb_node *__tree_search(struct rb_root *root, u64 file_offset,
68 struct rb_node **prev_ret)
Chris Masondc17ff82008-01-08 15:46:30 -050069{
Chris Masond3977122009-01-05 21:25:51 -050070 struct rb_node *n = root->rb_node;
Chris Masondc17ff82008-01-08 15:46:30 -050071 struct rb_node *prev = NULL;
Chris Masone6dcd2d2008-07-17 12:53:50 -040072 struct rb_node *test;
73 struct btrfs_ordered_extent *entry;
74 struct btrfs_ordered_extent *prev_entry = NULL;
Chris Masondc17ff82008-01-08 15:46:30 -050075
Chris Masond3977122009-01-05 21:25:51 -050076 while (n) {
Chris Masone6dcd2d2008-07-17 12:53:50 -040077 entry = rb_entry(n, struct btrfs_ordered_extent, rb_node);
Chris Masondc17ff82008-01-08 15:46:30 -050078 prev = n;
79 prev_entry = entry;
Chris Masondc17ff82008-01-08 15:46:30 -050080
Chris Masone6dcd2d2008-07-17 12:53:50 -040081 if (file_offset < entry->file_offset)
Chris Masondc17ff82008-01-08 15:46:30 -050082 n = n->rb_left;
Chris Masone6dcd2d2008-07-17 12:53:50 -040083 else if (file_offset >= entry_end(entry))
Chris Masondc17ff82008-01-08 15:46:30 -050084 n = n->rb_right;
85 else
86 return n;
87 }
88 if (!prev_ret)
89 return NULL;
90
Chris Masond3977122009-01-05 21:25:51 -050091 while (prev && file_offset >= entry_end(prev_entry)) {
Chris Masone6dcd2d2008-07-17 12:53:50 -040092 test = rb_next(prev);
93 if (!test)
94 break;
95 prev_entry = rb_entry(test, struct btrfs_ordered_extent,
96 rb_node);
97 if (file_offset < entry_end(prev_entry))
98 break;
99
100 prev = test;
101 }
102 if (prev)
103 prev_entry = rb_entry(prev, struct btrfs_ordered_extent,
104 rb_node);
Chris Masond3977122009-01-05 21:25:51 -0500105 while (prev && file_offset < entry_end(prev_entry)) {
Chris Masone6dcd2d2008-07-17 12:53:50 -0400106 test = rb_prev(prev);
107 if (!test)
108 break;
109 prev_entry = rb_entry(test, struct btrfs_ordered_extent,
110 rb_node);
111 prev = test;
Chris Masondc17ff82008-01-08 15:46:30 -0500112 }
113 *prev_ret = prev;
114 return NULL;
115}
116
Chris Masond352ac62008-09-29 15:18:18 -0400117/*
118 * helper to check if a given offset is inside a given entry
119 */
Chris Masone6dcd2d2008-07-17 12:53:50 -0400120static int offset_in_entry(struct btrfs_ordered_extent *entry, u64 file_offset)
Chris Masondc17ff82008-01-08 15:46:30 -0500121{
Chris Masone6dcd2d2008-07-17 12:53:50 -0400122 if (file_offset < entry->file_offset ||
123 entry->file_offset + entry->len <= file_offset)
124 return 0;
125 return 1;
126}
127
Chris Masond352ac62008-09-29 15:18:18 -0400128/*
129 * look find the first ordered struct that has this offset, otherwise
130 * the first one less than this offset
131 */
Chris Masone6dcd2d2008-07-17 12:53:50 -0400132static inline struct rb_node *tree_search(struct btrfs_ordered_inode_tree *tree,
133 u64 file_offset)
134{
135 struct rb_root *root = &tree->tree;
Chris Masondc17ff82008-01-08 15:46:30 -0500136 struct rb_node *prev;
137 struct rb_node *ret;
Chris Masone6dcd2d2008-07-17 12:53:50 -0400138 struct btrfs_ordered_extent *entry;
139
140 if (tree->last) {
141 entry = rb_entry(tree->last, struct btrfs_ordered_extent,
142 rb_node);
143 if (offset_in_entry(entry, file_offset))
144 return tree->last;
145 }
146 ret = __tree_search(root, file_offset, &prev);
Chris Masondc17ff82008-01-08 15:46:30 -0500147 if (!ret)
Chris Masone6dcd2d2008-07-17 12:53:50 -0400148 ret = prev;
149 if (ret)
150 tree->last = ret;
Chris Masondc17ff82008-01-08 15:46:30 -0500151 return ret;
152}
153
Chris Masoneb84ae02008-07-17 13:53:27 -0400154/* allocate and add a new ordered_extent into the per-inode tree.
155 * file_offset is the logical offset in the file
156 *
157 * start is the disk block number of an extent already reserved in the
158 * extent allocation tree
159 *
160 * len is the length of the extent
161 *
Chris Masoneb84ae02008-07-17 13:53:27 -0400162 * The tree is given a single reference on the ordered extent that was
163 * inserted.
164 */
Chris Masone6dcd2d2008-07-17 12:53:50 -0400165int btrfs_add_ordered_extent(struct inode *inode, u64 file_offset,
Yan Zheng80ff3852008-10-30 14:20:02 -0400166 u64 start, u64 len, u64 disk_len, int type)
Chris Masondc17ff82008-01-08 15:46:30 -0500167{
Chris Masondc17ff82008-01-08 15:46:30 -0500168 struct btrfs_ordered_inode_tree *tree;
Chris Masone6dcd2d2008-07-17 12:53:50 -0400169 struct rb_node *node;
170 struct btrfs_ordered_extent *entry;
Chris Masondc17ff82008-01-08 15:46:30 -0500171
Chris Masone6dcd2d2008-07-17 12:53:50 -0400172 tree = &BTRFS_I(inode)->ordered_tree;
173 entry = kzalloc(sizeof(*entry), GFP_NOFS);
Chris Masondc17ff82008-01-08 15:46:30 -0500174 if (!entry)
175 return -ENOMEM;
176
Chris Masone6dcd2d2008-07-17 12:53:50 -0400177 mutex_lock(&tree->mutex);
178 entry->file_offset = file_offset;
179 entry->start = start;
180 entry->len = len;
Chris Masonc8b97812008-10-29 14:49:59 -0400181 entry->disk_len = disk_len;
Chris Mason8b62b722009-09-02 16:53:46 -0400182 entry->bytes_left = len;
Chris Mason3eaa2882008-07-24 11:57:52 -0400183 entry->inode = inode;
Yan Zhengd899e052008-10-30 14:25:28 -0400184 if (type != BTRFS_ORDERED_IO_DONE && type != BTRFS_ORDERED_COMPLETE)
Yan Zheng80ff3852008-10-30 14:20:02 -0400185 set_bit(type, &entry->flags);
Chris Mason3eaa2882008-07-24 11:57:52 -0400186
Chris Masone6dcd2d2008-07-17 12:53:50 -0400187 /* one ref for the tree */
188 atomic_set(&entry->refs, 1);
189 init_waitqueue_head(&entry->wait);
190 INIT_LIST_HEAD(&entry->list);
Chris Mason3eaa2882008-07-24 11:57:52 -0400191 INIT_LIST_HEAD(&entry->root_extent_list);
Chris Masondc17ff82008-01-08 15:46:30 -0500192
Chris Masone6dcd2d2008-07-17 12:53:50 -0400193 node = tree_insert(&tree->tree, file_offset,
194 &entry->rb_node);
Chris Masond3977122009-01-05 21:25:51 -0500195 BUG_ON(node);
196
Chris Mason3eaa2882008-07-24 11:57:52 -0400197 spin_lock(&BTRFS_I(inode)->root->fs_info->ordered_extent_lock);
198 list_add_tail(&entry->root_extent_list,
199 &BTRFS_I(inode)->root->fs_info->ordered_extents);
200 spin_unlock(&BTRFS_I(inode)->root->fs_info->ordered_extent_lock);
201
Chris Masone6dcd2d2008-07-17 12:53:50 -0400202 mutex_unlock(&tree->mutex);
203 BUG_ON(node);
204 return 0;
205}
Chris Masondc17ff82008-01-08 15:46:30 -0500206
Chris Masoneb84ae02008-07-17 13:53:27 -0400207/*
208 * Add a struct btrfs_ordered_sum into the list of checksums to be inserted
Chris Mason3edf7d32008-07-18 06:17:13 -0400209 * when an ordered extent is finished. If the list covers more than one
210 * ordered extent, it is split across multiples.
Chris Masoneb84ae02008-07-17 13:53:27 -0400211 */
Chris Mason3edf7d32008-07-18 06:17:13 -0400212int btrfs_add_ordered_sum(struct inode *inode,
213 struct btrfs_ordered_extent *entry,
214 struct btrfs_ordered_sum *sum)
Chris Masone6dcd2d2008-07-17 12:53:50 -0400215{
216 struct btrfs_ordered_inode_tree *tree;
Chris Mason1b1e2132008-06-25 16:01:31 -0400217
Chris Masone6dcd2d2008-07-17 12:53:50 -0400218 tree = &BTRFS_I(inode)->ordered_tree;
219 mutex_lock(&tree->mutex);
Chris Masone6dcd2d2008-07-17 12:53:50 -0400220 list_add_tail(&sum->list, &entry->list);
221 mutex_unlock(&tree->mutex);
222 return 0;
223}
224
Chris Masoneb84ae02008-07-17 13:53:27 -0400225/*
226 * this is used to account for finished IO across a given range
227 * of the file. The IO should not span ordered extents. If
228 * a given ordered_extent is completely done, 1 is returned, otherwise
229 * 0.
230 *
231 * test_and_set_bit on a flag in the struct btrfs_ordered_extent is used
232 * to make sure this function only returns 1 once for a given ordered extent.
233 */
Chris Masone6dcd2d2008-07-17 12:53:50 -0400234int btrfs_dec_test_ordered_pending(struct inode *inode,
235 u64 file_offset, u64 io_size)
236{
237 struct btrfs_ordered_inode_tree *tree;
238 struct rb_node *node;
239 struct btrfs_ordered_extent *entry;
Chris Masone6dcd2d2008-07-17 12:53:50 -0400240 int ret;
241
242 tree = &BTRFS_I(inode)->ordered_tree;
243 mutex_lock(&tree->mutex);
Chris Masone6dcd2d2008-07-17 12:53:50 -0400244 node = tree_search(tree, file_offset);
245 if (!node) {
246 ret = 1;
247 goto out;
248 }
249
250 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
251 if (!offset_in_entry(entry, file_offset)) {
252 ret = 1;
253 goto out;
254 }
255
Chris Mason8b62b722009-09-02 16:53:46 -0400256 if (io_size > entry->bytes_left) {
257 printk(KERN_CRIT "bad ordered accounting left %llu size %llu\n",
258 (unsigned long long)entry->bytes_left,
259 (unsigned long long)io_size);
260 }
261 entry->bytes_left -= io_size;
262 if (entry->bytes_left == 0)
Chris Masone6dcd2d2008-07-17 12:53:50 -0400263 ret = test_and_set_bit(BTRFS_ORDERED_IO_DONE, &entry->flags);
Chris Mason8b62b722009-09-02 16:53:46 -0400264 else
265 ret = 1;
Chris Masone6dcd2d2008-07-17 12:53:50 -0400266out:
267 mutex_unlock(&tree->mutex);
268 return ret == 0;
269}
270
Chris Masoneb84ae02008-07-17 13:53:27 -0400271/*
272 * used to drop a reference on an ordered extent. This will free
273 * the extent if the last reference is dropped
274 */
Chris Masone6dcd2d2008-07-17 12:53:50 -0400275int btrfs_put_ordered_extent(struct btrfs_ordered_extent *entry)
276{
Chris Masonba1da2f2008-07-17 12:54:15 -0400277 struct list_head *cur;
278 struct btrfs_ordered_sum *sum;
279
280 if (atomic_dec_and_test(&entry->refs)) {
Chris Masond3977122009-01-05 21:25:51 -0500281 while (!list_empty(&entry->list)) {
Chris Masonba1da2f2008-07-17 12:54:15 -0400282 cur = entry->list.next;
283 sum = list_entry(cur, struct btrfs_ordered_sum, list);
284 list_del(&sum->list);
285 kfree(sum);
286 }
Chris Masondc17ff82008-01-08 15:46:30 -0500287 kfree(entry);
Chris Masonba1da2f2008-07-17 12:54:15 -0400288 }
Chris Masondc17ff82008-01-08 15:46:30 -0500289 return 0;
290}
291
Chris Masoneb84ae02008-07-17 13:53:27 -0400292/*
293 * remove an ordered extent from the tree. No references are dropped
Yan, Zhengc2167752009-11-12 09:34:21 +0000294 * and you must wake_up entry->wait. You must hold the tree mutex
295 * while you call this function.
Chris Masoneb84ae02008-07-17 13:53:27 -0400296 */
Yan, Zhengc2167752009-11-12 09:34:21 +0000297static int __btrfs_remove_ordered_extent(struct inode *inode,
Chris Masone6dcd2d2008-07-17 12:53:50 -0400298 struct btrfs_ordered_extent *entry)
Chris Masondc17ff82008-01-08 15:46:30 -0500299{
Chris Masone6dcd2d2008-07-17 12:53:50 -0400300 struct btrfs_ordered_inode_tree *tree;
Chris Masondc17ff82008-01-08 15:46:30 -0500301 struct rb_node *node;
302
Chris Masone6dcd2d2008-07-17 12:53:50 -0400303 tree = &BTRFS_I(inode)->ordered_tree;
Chris Masone6dcd2d2008-07-17 12:53:50 -0400304 node = &entry->rb_node;
Chris Masondc17ff82008-01-08 15:46:30 -0500305 rb_erase(node, &tree->tree);
Chris Masone6dcd2d2008-07-17 12:53:50 -0400306 tree->last = NULL;
307 set_bit(BTRFS_ORDERED_COMPLETE, &entry->flags);
Chris Mason3eaa2882008-07-24 11:57:52 -0400308
Josef Bacik32c00af2009-10-08 13:34:05 -0400309 spin_lock(&BTRFS_I(inode)->accounting_lock);
310 BTRFS_I(inode)->outstanding_extents--;
311 spin_unlock(&BTRFS_I(inode)->accounting_lock);
312 btrfs_unreserve_metadata_for_delalloc(BTRFS_I(inode)->root,
313 inode, 1);
314
Chris Mason3eaa2882008-07-24 11:57:52 -0400315 spin_lock(&BTRFS_I(inode)->root->fs_info->ordered_extent_lock);
316 list_del_init(&entry->root_extent_list);
Chris Mason5a3f23d2009-03-31 13:27:11 -0400317
318 /*
319 * we have no more ordered extents for this inode and
320 * no dirty pages. We can safely remove it from the
321 * list of ordered extents
322 */
323 if (RB_EMPTY_ROOT(&tree->tree) &&
324 !mapping_tagged(inode->i_mapping, PAGECACHE_TAG_DIRTY)) {
325 list_del_init(&BTRFS_I(inode)->ordered_operations);
326 }
Chris Mason3eaa2882008-07-24 11:57:52 -0400327 spin_unlock(&BTRFS_I(inode)->root->fs_info->ordered_extent_lock);
328
Yan, Zhengc2167752009-11-12 09:34:21 +0000329 return 0;
330}
331
332/*
333 * remove an ordered extent from the tree. No references are dropped
334 * but any waiters are woken.
335 */
336int btrfs_remove_ordered_extent(struct inode *inode,
337 struct btrfs_ordered_extent *entry)
338{
339 struct btrfs_ordered_inode_tree *tree;
340 int ret;
341
342 tree = &BTRFS_I(inode)->ordered_tree;
343 mutex_lock(&tree->mutex);
344 ret = __btrfs_remove_ordered_extent(inode, entry);
Chris Masone6dcd2d2008-07-17 12:53:50 -0400345 mutex_unlock(&tree->mutex);
346 wake_up(&entry->wait);
Yan, Zhengc2167752009-11-12 09:34:21 +0000347
348 return ret;
Chris Mason81d7ed22008-04-25 08:51:48 -0400349}
Chris Masone6dcd2d2008-07-17 12:53:50 -0400350
Chris Masond352ac62008-09-29 15:18:18 -0400351/*
352 * wait for all the ordered extents in a root. This is done when balancing
353 * space between drives.
354 */
Yan, Zheng24bbcf02009-11-12 09:36:34 +0000355int btrfs_wait_ordered_extents(struct btrfs_root *root,
356 int nocow_only, int delay_iput)
Chris Mason3eaa2882008-07-24 11:57:52 -0400357{
358 struct list_head splice;
359 struct list_head *cur;
360 struct btrfs_ordered_extent *ordered;
361 struct inode *inode;
362
363 INIT_LIST_HEAD(&splice);
364
365 spin_lock(&root->fs_info->ordered_extent_lock);
366 list_splice_init(&root->fs_info->ordered_extents, &splice);
Zheng Yan5b21f2e2008-09-26 10:05:38 -0400367 while (!list_empty(&splice)) {
Chris Mason3eaa2882008-07-24 11:57:52 -0400368 cur = splice.next;
369 ordered = list_entry(cur, struct btrfs_ordered_extent,
370 root_extent_list);
Yan Zheng7ea394f2008-08-05 13:05:02 -0400371 if (nocow_only &&
Yan Zhengd899e052008-10-30 14:25:28 -0400372 !test_bit(BTRFS_ORDERED_NOCOW, &ordered->flags) &&
373 !test_bit(BTRFS_ORDERED_PREALLOC, &ordered->flags)) {
Zheng Yan5b21f2e2008-09-26 10:05:38 -0400374 list_move(&ordered->root_extent_list,
375 &root->fs_info->ordered_extents);
Yan Zheng7ea394f2008-08-05 13:05:02 -0400376 cond_resched_lock(&root->fs_info->ordered_extent_lock);
377 continue;
378 }
379
Chris Mason3eaa2882008-07-24 11:57:52 -0400380 list_del_init(&ordered->root_extent_list);
381 atomic_inc(&ordered->refs);
Chris Mason3eaa2882008-07-24 11:57:52 -0400382
383 /*
Zheng Yan5b21f2e2008-09-26 10:05:38 -0400384 * the inode may be getting freed (in sys_unlink path).
Chris Mason3eaa2882008-07-24 11:57:52 -0400385 */
Zheng Yan5b21f2e2008-09-26 10:05:38 -0400386 inode = igrab(ordered->inode);
387
Chris Mason3eaa2882008-07-24 11:57:52 -0400388 spin_unlock(&root->fs_info->ordered_extent_lock);
389
Zheng Yan5b21f2e2008-09-26 10:05:38 -0400390 if (inode) {
391 btrfs_start_ordered_extent(inode, ordered, 1);
392 btrfs_put_ordered_extent(ordered);
Yan, Zheng24bbcf02009-11-12 09:36:34 +0000393 if (delay_iput)
394 btrfs_add_delayed_iput(inode);
395 else
396 iput(inode);
Zheng Yan5b21f2e2008-09-26 10:05:38 -0400397 } else {
398 btrfs_put_ordered_extent(ordered);
399 }
Chris Mason3eaa2882008-07-24 11:57:52 -0400400
401 spin_lock(&root->fs_info->ordered_extent_lock);
402 }
403 spin_unlock(&root->fs_info->ordered_extent_lock);
404 return 0;
405}
406
Chris Masoneb84ae02008-07-17 13:53:27 -0400407/*
Chris Mason5a3f23d2009-03-31 13:27:11 -0400408 * this is used during transaction commit to write all the inodes
409 * added to the ordered operation list. These files must be fully on
410 * disk before the transaction commits.
411 *
412 * we have two modes here, one is to just start the IO via filemap_flush
413 * and the other is to wait for all the io. When we wait, we have an
414 * extra check to make sure the ordered operation list really is empty
415 * before we return
416 */
417int btrfs_run_ordered_operations(struct btrfs_root *root, int wait)
418{
419 struct btrfs_inode *btrfs_inode;
420 struct inode *inode;
421 struct list_head splice;
422
423 INIT_LIST_HEAD(&splice);
424
425 mutex_lock(&root->fs_info->ordered_operations_mutex);
426 spin_lock(&root->fs_info->ordered_extent_lock);
427again:
428 list_splice_init(&root->fs_info->ordered_operations, &splice);
429
430 while (!list_empty(&splice)) {
431 btrfs_inode = list_entry(splice.next, struct btrfs_inode,
432 ordered_operations);
433
434 inode = &btrfs_inode->vfs_inode;
435
436 list_del_init(&btrfs_inode->ordered_operations);
437
438 /*
439 * the inode may be getting freed (in sys_unlink path).
440 */
441 inode = igrab(inode);
442
443 if (!wait && inode) {
444 list_add_tail(&BTRFS_I(inode)->ordered_operations,
445 &root->fs_info->ordered_operations);
446 }
447 spin_unlock(&root->fs_info->ordered_extent_lock);
448
449 if (inode) {
450 if (wait)
451 btrfs_wait_ordered_range(inode, 0, (u64)-1);
452 else
453 filemap_flush(inode->i_mapping);
Yan, Zheng24bbcf02009-11-12 09:36:34 +0000454 btrfs_add_delayed_iput(inode);
Chris Mason5a3f23d2009-03-31 13:27:11 -0400455 }
456
457 cond_resched();
458 spin_lock(&root->fs_info->ordered_extent_lock);
459 }
460 if (wait && !list_empty(&root->fs_info->ordered_operations))
461 goto again;
462
463 spin_unlock(&root->fs_info->ordered_extent_lock);
464 mutex_unlock(&root->fs_info->ordered_operations_mutex);
465
466 return 0;
467}
468
469/*
Chris Masoneb84ae02008-07-17 13:53:27 -0400470 * Used to start IO or wait for a given ordered extent to finish.
471 *
472 * If wait is one, this effectively waits on page writeback for all the pages
473 * in the extent, and it waits on the io completion code to insert
474 * metadata into the btree corresponding to the extent
475 */
476void btrfs_start_ordered_extent(struct inode *inode,
477 struct btrfs_ordered_extent *entry,
478 int wait)
Chris Masone6dcd2d2008-07-17 12:53:50 -0400479{
480 u64 start = entry->file_offset;
481 u64 end = start + entry->len - 1;
482
Chris Masoneb84ae02008-07-17 13:53:27 -0400483 /*
484 * pages in the range can be dirty, clean or writeback. We
485 * start IO on any dirty ones so the wait doesn't stall waiting
486 * for pdflush to find them
487 */
Christoph Hellwig8aa38c32009-10-01 12:58:30 -0400488 filemap_fdatawrite_range(inode->i_mapping, start, end);
Chris Masonc8b97812008-10-29 14:49:59 -0400489 if (wait) {
Chris Masone6dcd2d2008-07-17 12:53:50 -0400490 wait_event(entry->wait, test_bit(BTRFS_ORDERED_COMPLETE,
491 &entry->flags));
Chris Masonc8b97812008-10-29 14:49:59 -0400492 }
Chris Masone6dcd2d2008-07-17 12:53:50 -0400493}
494
Chris Masoneb84ae02008-07-17 13:53:27 -0400495/*
496 * Used to wait on ordered extents across a large range of bytes.
497 */
Chris Masoncb843a62008-10-03 12:30:02 -0400498int btrfs_wait_ordered_range(struct inode *inode, u64 start, u64 len)
Chris Masone6dcd2d2008-07-17 12:53:50 -0400499{
500 u64 end;
Chris Masone5a22172008-07-18 20:42:20 -0400501 u64 orig_end;
502 u64 wait_end;
Chris Masone6dcd2d2008-07-17 12:53:50 -0400503 struct btrfs_ordered_extent *ordered;
Chris Mason8b62b722009-09-02 16:53:46 -0400504 int found;
Chris Masone6dcd2d2008-07-17 12:53:50 -0400505
Chris Masone5a22172008-07-18 20:42:20 -0400506 if (start + len < start) {
Chris Masonf4219502008-07-22 11:18:09 -0400507 orig_end = INT_LIMIT(loff_t);
Chris Masone5a22172008-07-18 20:42:20 -0400508 } else {
509 orig_end = start + len - 1;
Chris Masonf4219502008-07-22 11:18:09 -0400510 if (orig_end > INT_LIMIT(loff_t))
511 orig_end = INT_LIMIT(loff_t);
Chris Masone5a22172008-07-18 20:42:20 -0400512 }
Chris Masonf4219502008-07-22 11:18:09 -0400513 wait_end = orig_end;
Chris Mason4a096752008-07-21 10:29:44 -0400514again:
Chris Masone5a22172008-07-18 20:42:20 -0400515 /* start IO across the range first to instantiate any delalloc
516 * extents
517 */
Christoph Hellwig8aa38c32009-10-01 12:58:30 -0400518 filemap_fdatawrite_range(inode->i_mapping, start, orig_end);
Chris Masone5a22172008-07-18 20:42:20 -0400519
Chris Mason771ed682008-11-06 22:02:51 -0500520 /* The compression code will leave pages locked but return from
521 * writepage without setting the page writeback. Starting again
522 * with WB_SYNC_ALL will end up waiting for the IO to actually start.
523 */
Christoph Hellwig8aa38c32009-10-01 12:58:30 -0400524 filemap_fdatawrite_range(inode->i_mapping, start, orig_end);
Chris Mason771ed682008-11-06 22:02:51 -0500525
Christoph Hellwig8aa38c32009-10-01 12:58:30 -0400526 filemap_fdatawait_range(inode->i_mapping, start, orig_end);
Chris Masonf4219502008-07-22 11:18:09 -0400527
528 end = orig_end;
Chris Mason8b62b722009-09-02 16:53:46 -0400529 found = 0;
Chris Masond3977122009-01-05 21:25:51 -0500530 while (1) {
Chris Masone6dcd2d2008-07-17 12:53:50 -0400531 ordered = btrfs_lookup_first_ordered_extent(inode, end);
Chris Masond3977122009-01-05 21:25:51 -0500532 if (!ordered)
Chris Masone6dcd2d2008-07-17 12:53:50 -0400533 break;
Chris Masone5a22172008-07-18 20:42:20 -0400534 if (ordered->file_offset > orig_end) {
Chris Masone6dcd2d2008-07-17 12:53:50 -0400535 btrfs_put_ordered_extent(ordered);
536 break;
537 }
538 if (ordered->file_offset + ordered->len < start) {
539 btrfs_put_ordered_extent(ordered);
540 break;
541 }
Chris Mason8b62b722009-09-02 16:53:46 -0400542 found++;
Chris Masone5a22172008-07-18 20:42:20 -0400543 btrfs_start_ordered_extent(inode, ordered, 1);
Chris Masone6dcd2d2008-07-17 12:53:50 -0400544 end = ordered->file_offset;
545 btrfs_put_ordered_extent(ordered);
Chris Masone5a22172008-07-18 20:42:20 -0400546 if (end == 0 || end == start)
Chris Masone6dcd2d2008-07-17 12:53:50 -0400547 break;
548 end--;
549 }
Chris Mason8b62b722009-09-02 16:53:46 -0400550 if (found || test_range_bit(&BTRFS_I(inode)->io_tree, start, orig_end,
551 EXTENT_DELALLOC, 0, NULL)) {
Chris Mason771ed682008-11-06 22:02:51 -0500552 schedule_timeout(1);
Chris Mason4a096752008-07-21 10:29:44 -0400553 goto again;
554 }
Chris Masoncb843a62008-10-03 12:30:02 -0400555 return 0;
Chris Masone6dcd2d2008-07-17 12:53:50 -0400556}
557
Chris Masoneb84ae02008-07-17 13:53:27 -0400558/*
559 * find an ordered extent corresponding to file_offset. return NULL if
560 * nothing is found, otherwise take a reference on the extent and return it
561 */
Chris Masone6dcd2d2008-07-17 12:53:50 -0400562struct btrfs_ordered_extent *btrfs_lookup_ordered_extent(struct inode *inode,
563 u64 file_offset)
564{
565 struct btrfs_ordered_inode_tree *tree;
566 struct rb_node *node;
567 struct btrfs_ordered_extent *entry = NULL;
568
569 tree = &BTRFS_I(inode)->ordered_tree;
570 mutex_lock(&tree->mutex);
571 node = tree_search(tree, file_offset);
572 if (!node)
573 goto out;
574
575 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
576 if (!offset_in_entry(entry, file_offset))
577 entry = NULL;
578 if (entry)
579 atomic_inc(&entry->refs);
580out:
581 mutex_unlock(&tree->mutex);
582 return entry;
583}
584
Chris Masoneb84ae02008-07-17 13:53:27 -0400585/*
586 * lookup and return any extent before 'file_offset'. NULL is returned
587 * if none is found
588 */
Chris Masone6dcd2d2008-07-17 12:53:50 -0400589struct btrfs_ordered_extent *
Chris Masond3977122009-01-05 21:25:51 -0500590btrfs_lookup_first_ordered_extent(struct inode *inode, u64 file_offset)
Chris Masone6dcd2d2008-07-17 12:53:50 -0400591{
592 struct btrfs_ordered_inode_tree *tree;
593 struct rb_node *node;
594 struct btrfs_ordered_extent *entry = NULL;
595
596 tree = &BTRFS_I(inode)->ordered_tree;
597 mutex_lock(&tree->mutex);
598 node = tree_search(tree, file_offset);
599 if (!node)
600 goto out;
601
602 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
603 atomic_inc(&entry->refs);
604out:
605 mutex_unlock(&tree->mutex);
606 return entry;
607}
Chris Masondbe674a2008-07-17 12:54:05 -0400608
Chris Masoneb84ae02008-07-17 13:53:27 -0400609/*
610 * After an extent is done, call this to conditionally update the on disk
611 * i_size. i_size is updated to cover any fully written part of the file.
612 */
Yan, Zhengc2167752009-11-12 09:34:21 +0000613int btrfs_ordered_update_i_size(struct inode *inode, u64 offset,
Chris Masondbe674a2008-07-17 12:54:05 -0400614 struct btrfs_ordered_extent *ordered)
615{
616 struct btrfs_ordered_inode_tree *tree = &BTRFS_I(inode)->ordered_tree;
617 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
618 u64 disk_i_size;
619 u64 new_i_size;
620 u64 i_size_test;
Yan, Zhengc2167752009-11-12 09:34:21 +0000621 u64 i_size = i_size_read(inode);
Chris Masondbe674a2008-07-17 12:54:05 -0400622 struct rb_node *node;
Yan, Zhengc2167752009-11-12 09:34:21 +0000623 struct rb_node *prev = NULL;
Chris Masondbe674a2008-07-17 12:54:05 -0400624 struct btrfs_ordered_extent *test;
Yan, Zhengc2167752009-11-12 09:34:21 +0000625 int ret = 1;
626
627 if (ordered)
628 offset = entry_end(ordered);
Yan, Zhenga038fab02009-12-28 05:01:58 +0000629 else
630 offset = ALIGN(offset, BTRFS_I(inode)->root->sectorsize);
Chris Masondbe674a2008-07-17 12:54:05 -0400631
632 mutex_lock(&tree->mutex);
633 disk_i_size = BTRFS_I(inode)->disk_i_size;
634
Yan, Zhengc2167752009-11-12 09:34:21 +0000635 /* truncate file */
636 if (disk_i_size > i_size) {
637 BTRFS_I(inode)->disk_i_size = i_size;
638 ret = 0;
639 goto out;
640 }
641
Chris Masondbe674a2008-07-17 12:54:05 -0400642 /*
643 * if the disk i_size is already at the inode->i_size, or
644 * this ordered extent is inside the disk i_size, we're done
645 */
Yan, Zhengc2167752009-11-12 09:34:21 +0000646 if (disk_i_size == i_size || offset <= disk_i_size) {
Chris Masondbe674a2008-07-17 12:54:05 -0400647 goto out;
648 }
649
650 /*
651 * we can't update the disk_isize if there are delalloc bytes
652 * between disk_i_size and this ordered extent
653 */
Yan, Zhengc2167752009-11-12 09:34:21 +0000654 if (test_range_bit(io_tree, disk_i_size, offset - 1,
Chris Mason9655d292009-09-02 15:22:30 -0400655 EXTENT_DELALLOC, 0, NULL)) {
Chris Masondbe674a2008-07-17 12:54:05 -0400656 goto out;
657 }
658 /*
659 * walk backward from this ordered extent to disk_i_size.
660 * if we find an ordered extent then we can't update disk i_size
661 * yet
662 */
Yan, Zhengc2167752009-11-12 09:34:21 +0000663 if (ordered) {
664 node = rb_prev(&ordered->rb_node);
665 } else {
666 prev = tree_search(tree, offset);
667 /*
668 * we insert file extents without involving ordered struct,
669 * so there should be no ordered struct cover this offset
670 */
671 if (prev) {
672 test = rb_entry(prev, struct btrfs_ordered_extent,
673 rb_node);
674 BUG_ON(offset_in_entry(test, offset));
675 }
676 node = prev;
677 }
678 while (node) {
Chris Masondbe674a2008-07-17 12:54:05 -0400679 test = rb_entry(node, struct btrfs_ordered_extent, rb_node);
680 if (test->file_offset + test->len <= disk_i_size)
681 break;
Yan, Zhengc2167752009-11-12 09:34:21 +0000682 if (test->file_offset >= i_size)
Chris Masondbe674a2008-07-17 12:54:05 -0400683 break;
684 if (test->file_offset >= disk_i_size)
685 goto out;
Yan, Zhengc2167752009-11-12 09:34:21 +0000686 node = rb_prev(node);
Chris Masondbe674a2008-07-17 12:54:05 -0400687 }
Yan, Zhengc2167752009-11-12 09:34:21 +0000688 new_i_size = min_t(u64, offset, i_size);
Chris Masondbe674a2008-07-17 12:54:05 -0400689
690 /*
691 * at this point, we know we can safely update i_size to at least
692 * the offset from this ordered extent. But, we need to
693 * walk forward and see if ios from higher up in the file have
694 * finished.
695 */
Yan, Zhengc2167752009-11-12 09:34:21 +0000696 if (ordered) {
697 node = rb_next(&ordered->rb_node);
698 } else {
699 if (prev)
700 node = rb_next(prev);
701 else
702 node = rb_first(&tree->tree);
703 }
Chris Masondbe674a2008-07-17 12:54:05 -0400704 i_size_test = 0;
705 if (node) {
706 /*
707 * do we have an area where IO might have finished
708 * between our ordered extent and the next one.
709 */
710 test = rb_entry(node, struct btrfs_ordered_extent, rb_node);
Yan, Zhengc2167752009-11-12 09:34:21 +0000711 if (test->file_offset > offset)
Yan Zhengb48652c2008-08-04 23:23:47 -0400712 i_size_test = test->file_offset;
Chris Masondbe674a2008-07-17 12:54:05 -0400713 } else {
Yan, Zhengc2167752009-11-12 09:34:21 +0000714 i_size_test = i_size;
Chris Masondbe674a2008-07-17 12:54:05 -0400715 }
716
717 /*
718 * i_size_test is the end of a region after this ordered
719 * extent where there are no ordered extents. As long as there
720 * are no delalloc bytes in this area, it is safe to update
721 * disk_i_size to the end of the region.
722 */
Yan, Zhengc2167752009-11-12 09:34:21 +0000723 if (i_size_test > offset &&
724 !test_range_bit(io_tree, offset, i_size_test - 1,
725 EXTENT_DELALLOC, 0, NULL)) {
726 new_i_size = min_t(u64, i_size_test, i_size);
Chris Masondbe674a2008-07-17 12:54:05 -0400727 }
728 BTRFS_I(inode)->disk_i_size = new_i_size;
Yan, Zhengc2167752009-11-12 09:34:21 +0000729 ret = 0;
Chris Masondbe674a2008-07-17 12:54:05 -0400730out:
Yan, Zhengc2167752009-11-12 09:34:21 +0000731 /*
732 * we need to remove the ordered extent with the tree lock held
733 * so that other people calling this function don't find our fully
734 * processed ordered entry and skip updating the i_size
735 */
736 if (ordered)
737 __btrfs_remove_ordered_extent(inode, ordered);
Chris Masondbe674a2008-07-17 12:54:05 -0400738 mutex_unlock(&tree->mutex);
Yan, Zhengc2167752009-11-12 09:34:21 +0000739 if (ordered)
740 wake_up(&ordered->wait);
741 return ret;
Chris Masondbe674a2008-07-17 12:54:05 -0400742}
Chris Masonba1da2f2008-07-17 12:54:15 -0400743
Chris Masoneb84ae02008-07-17 13:53:27 -0400744/*
745 * search the ordered extents for one corresponding to 'offset' and
746 * try to find a checksum. This is used because we allow pages to
747 * be reclaimed before their checksum is actually put into the btree
748 */
Chris Masond20f7042008-12-08 16:58:54 -0500749int btrfs_find_ordered_sum(struct inode *inode, u64 offset, u64 disk_bytenr,
750 u32 *sum)
Chris Masonba1da2f2008-07-17 12:54:15 -0400751{
752 struct btrfs_ordered_sum *ordered_sum;
753 struct btrfs_sector_sum *sector_sums;
754 struct btrfs_ordered_extent *ordered;
755 struct btrfs_ordered_inode_tree *tree = &BTRFS_I(inode)->ordered_tree;
Chris Mason3edf7d32008-07-18 06:17:13 -0400756 unsigned long num_sectors;
757 unsigned long i;
758 u32 sectorsize = BTRFS_I(inode)->root->sectorsize;
Chris Masonba1da2f2008-07-17 12:54:15 -0400759 int ret = 1;
Chris Masonba1da2f2008-07-17 12:54:15 -0400760
761 ordered = btrfs_lookup_ordered_extent(inode, offset);
762 if (!ordered)
763 return 1;
764
765 mutex_lock(&tree->mutex);
Qinghuang Fengc6e30872009-01-21 10:59:08 -0500766 list_for_each_entry_reverse(ordered_sum, &ordered->list, list) {
Chris Masond20f7042008-12-08 16:58:54 -0500767 if (disk_bytenr >= ordered_sum->bytenr) {
Chris Mason3edf7d32008-07-18 06:17:13 -0400768 num_sectors = ordered_sum->len / sectorsize;
Chris Masoned98b562008-07-22 23:06:42 -0400769 sector_sums = ordered_sum->sums;
Chris Mason3edf7d32008-07-18 06:17:13 -0400770 for (i = 0; i < num_sectors; i++) {
Chris Masond20f7042008-12-08 16:58:54 -0500771 if (sector_sums[i].bytenr == disk_bytenr) {
Chris Mason3edf7d32008-07-18 06:17:13 -0400772 *sum = sector_sums[i].sum;
773 ret = 0;
774 goto out;
775 }
776 }
Chris Masonba1da2f2008-07-17 12:54:15 -0400777 }
778 }
779out:
780 mutex_unlock(&tree->mutex);
Chris Mason89642222008-07-24 09:41:53 -0400781 btrfs_put_ordered_extent(ordered);
Chris Masonba1da2f2008-07-17 12:54:15 -0400782 return ret;
783}
784
Chris Masonf4219502008-07-22 11:18:09 -0400785
Chris Mason5a3f23d2009-03-31 13:27:11 -0400786/*
787 * add a given inode to the list of inodes that must be fully on
788 * disk before a transaction commit finishes.
789 *
790 * This basically gives us the ext3 style data=ordered mode, and it is mostly
791 * used to make sure renamed files are fully on disk.
792 *
793 * It is a noop if the inode is already fully on disk.
794 *
795 * If trans is not null, we'll do a friendly check for a transaction that
796 * is already flushing things and force the IO down ourselves.
797 */
798int btrfs_add_ordered_operation(struct btrfs_trans_handle *trans,
799 struct btrfs_root *root,
800 struct inode *inode)
801{
802 u64 last_mod;
803
804 last_mod = max(BTRFS_I(inode)->generation, BTRFS_I(inode)->last_trans);
805
806 /*
807 * if this file hasn't been changed since the last transaction
808 * commit, we can safely return without doing anything
809 */
810 if (last_mod < root->fs_info->last_trans_committed)
811 return 0;
812
813 /*
814 * the transaction is already committing. Just start the IO and
815 * don't bother with all of this list nonsense
816 */
817 if (trans && root->fs_info->running_transaction->blocked) {
818 btrfs_wait_ordered_range(inode, 0, (u64)-1);
819 return 0;
820 }
821
822 spin_lock(&root->fs_info->ordered_extent_lock);
823 if (list_empty(&BTRFS_I(inode)->ordered_operations)) {
824 list_add_tail(&BTRFS_I(inode)->ordered_operations,
825 &root->fs_info->ordered_operations);
826 }
827 spin_unlock(&root->fs_info->ordered_extent_lock);
828
829 return 0;
830}