blob: b2d1e95de7be7e9a9691408aa0e4e357703b6bcd [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
Chris Masondc17ff82008-01-08 15:46:30 -050019#include <linux/slab.h>
Chris Masond6bfde82008-04-30 13:59:35 -040020#include <linux/blkdev.h>
Chris Masonf4219502008-07-22 11:18:09 -040021#include <linux/writeback.h>
22#include <linux/pagevec.h>
Chris Masondc17ff82008-01-08 15:46:30 -050023#include "ctree.h"
24#include "transaction.h"
25#include "btrfs_inode.h"
Chris Masone6dcd2d2008-07-17 12:53:50 -040026#include "extent_io.h"
Miao Xie199c2a92013-05-15 07:48:23 +000027#include "disk-io.h"
Anand Jainebb87652016-03-10 17:26:59 +080028#include "compression.h"
Chris Masondc17ff82008-01-08 15:46:30 -050029
Miao Xie6352b912012-09-06 04:01:51 -060030static struct kmem_cache *btrfs_ordered_extent_cache;
31
Chris Masone6dcd2d2008-07-17 12:53:50 -040032static u64 entry_end(struct btrfs_ordered_extent *entry)
Chris Masondc17ff82008-01-08 15:46:30 -050033{
Chris Masone6dcd2d2008-07-17 12:53:50 -040034 if (entry->file_offset + entry->len < entry->file_offset)
35 return (u64)-1;
36 return entry->file_offset + entry->len;
Chris Masondc17ff82008-01-08 15:46:30 -050037}
38
Chris Masond352ac62008-09-29 15:18:18 -040039/* returns NULL if the insertion worked, or it returns the node it did find
40 * in the tree
41 */
Chris Masone6dcd2d2008-07-17 12:53:50 -040042static struct rb_node *tree_insert(struct rb_root *root, u64 file_offset,
43 struct rb_node *node)
Chris Masondc17ff82008-01-08 15:46:30 -050044{
Chris Masond3977122009-01-05 21:25:51 -050045 struct rb_node **p = &root->rb_node;
46 struct rb_node *parent = NULL;
Chris Masone6dcd2d2008-07-17 12:53:50 -040047 struct btrfs_ordered_extent *entry;
Chris Masondc17ff82008-01-08 15:46:30 -050048
Chris Masond3977122009-01-05 21:25:51 -050049 while (*p) {
Chris Masondc17ff82008-01-08 15:46:30 -050050 parent = *p;
Chris Masone6dcd2d2008-07-17 12:53:50 -040051 entry = rb_entry(parent, struct btrfs_ordered_extent, rb_node);
Chris Masondc17ff82008-01-08 15:46:30 -050052
Chris Masone6dcd2d2008-07-17 12:53:50 -040053 if (file_offset < entry->file_offset)
Chris Masondc17ff82008-01-08 15:46:30 -050054 p = &(*p)->rb_left;
Chris Masone6dcd2d2008-07-17 12:53:50 -040055 else if (file_offset >= entry_end(entry))
Chris Masondc17ff82008-01-08 15:46:30 -050056 p = &(*p)->rb_right;
57 else
58 return parent;
59 }
60
61 rb_link_node(node, parent, p);
62 rb_insert_color(node, root);
63 return NULL;
64}
65
Jeff Mahoney43c04fb2011-10-03 23:22:33 -040066static void ordered_data_tree_panic(struct inode *inode, int errno,
67 u64 offset)
68{
69 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
Jeff Mahoney5d163e02016-09-20 10:05:00 -040070 btrfs_panic(fs_info, errno,
71 "Inconsistency in ordered tree at offset %llu", offset);
Jeff Mahoney43c04fb2011-10-03 23:22:33 -040072}
73
Chris Masond352ac62008-09-29 15:18:18 -040074/*
75 * look for a given offset in the tree, and if it can't be found return the
76 * first lesser offset
77 */
Chris Masone6dcd2d2008-07-17 12:53:50 -040078static struct rb_node *__tree_search(struct rb_root *root, u64 file_offset,
79 struct rb_node **prev_ret)
Chris Masondc17ff82008-01-08 15:46:30 -050080{
Chris Masond3977122009-01-05 21:25:51 -050081 struct rb_node *n = root->rb_node;
Chris Masondc17ff82008-01-08 15:46:30 -050082 struct rb_node *prev = NULL;
Chris Masone6dcd2d2008-07-17 12:53:50 -040083 struct rb_node *test;
84 struct btrfs_ordered_extent *entry;
85 struct btrfs_ordered_extent *prev_entry = NULL;
Chris Masondc17ff82008-01-08 15:46:30 -050086
Chris Masond3977122009-01-05 21:25:51 -050087 while (n) {
Chris Masone6dcd2d2008-07-17 12:53:50 -040088 entry = rb_entry(n, struct btrfs_ordered_extent, rb_node);
Chris Masondc17ff82008-01-08 15:46:30 -050089 prev = n;
90 prev_entry = entry;
Chris Masondc17ff82008-01-08 15:46:30 -050091
Chris Masone6dcd2d2008-07-17 12:53:50 -040092 if (file_offset < entry->file_offset)
Chris Masondc17ff82008-01-08 15:46:30 -050093 n = n->rb_left;
Chris Masone6dcd2d2008-07-17 12:53:50 -040094 else if (file_offset >= entry_end(entry))
Chris Masondc17ff82008-01-08 15:46:30 -050095 n = n->rb_right;
96 else
97 return n;
98 }
99 if (!prev_ret)
100 return NULL;
101
Chris Masond3977122009-01-05 21:25:51 -0500102 while (prev && file_offset >= entry_end(prev_entry)) {
Chris Masone6dcd2d2008-07-17 12:53:50 -0400103 test = rb_next(prev);
104 if (!test)
105 break;
106 prev_entry = rb_entry(test, struct btrfs_ordered_extent,
107 rb_node);
108 if (file_offset < entry_end(prev_entry))
109 break;
110
111 prev = test;
112 }
113 if (prev)
114 prev_entry = rb_entry(prev, struct btrfs_ordered_extent,
115 rb_node);
Chris Masond3977122009-01-05 21:25:51 -0500116 while (prev && file_offset < entry_end(prev_entry)) {
Chris Masone6dcd2d2008-07-17 12:53:50 -0400117 test = rb_prev(prev);
118 if (!test)
119 break;
120 prev_entry = rb_entry(test, struct btrfs_ordered_extent,
121 rb_node);
122 prev = test;
Chris Masondc17ff82008-01-08 15:46:30 -0500123 }
124 *prev_ret = prev;
125 return NULL;
126}
127
Chris Masond352ac62008-09-29 15:18:18 -0400128/*
129 * helper to check if a given offset is inside a given entry
130 */
Chris Masone6dcd2d2008-07-17 12:53:50 -0400131static int offset_in_entry(struct btrfs_ordered_extent *entry, u64 file_offset)
Chris Masondc17ff82008-01-08 15:46:30 -0500132{
Chris Masone6dcd2d2008-07-17 12:53:50 -0400133 if (file_offset < entry->file_offset ||
134 entry->file_offset + entry->len <= file_offset)
135 return 0;
136 return 1;
137}
138
Josef Bacik4b46fce2010-05-23 11:00:55 -0400139static int range_overlaps(struct btrfs_ordered_extent *entry, u64 file_offset,
140 u64 len)
141{
142 if (file_offset + len <= entry->file_offset ||
143 entry->file_offset + entry->len <= file_offset)
144 return 0;
145 return 1;
146}
147
Chris Masond352ac62008-09-29 15:18:18 -0400148/*
149 * look find the first ordered struct that has this offset, otherwise
150 * the first one less than this offset
151 */
Chris Masone6dcd2d2008-07-17 12:53:50 -0400152static inline struct rb_node *tree_search(struct btrfs_ordered_inode_tree *tree,
153 u64 file_offset)
154{
155 struct rb_root *root = &tree->tree;
Chris Masonc87fb6f2011-01-31 19:54:59 -0500156 struct rb_node *prev = NULL;
Chris Masondc17ff82008-01-08 15:46:30 -0500157 struct rb_node *ret;
Chris Masone6dcd2d2008-07-17 12:53:50 -0400158 struct btrfs_ordered_extent *entry;
159
160 if (tree->last) {
161 entry = rb_entry(tree->last, struct btrfs_ordered_extent,
162 rb_node);
163 if (offset_in_entry(entry, file_offset))
164 return tree->last;
165 }
166 ret = __tree_search(root, file_offset, &prev);
Chris Masondc17ff82008-01-08 15:46:30 -0500167 if (!ret)
Chris Masone6dcd2d2008-07-17 12:53:50 -0400168 ret = prev;
169 if (ret)
170 tree->last = ret;
Chris Masondc17ff82008-01-08 15:46:30 -0500171 return ret;
172}
173
Chris Masoneb84ae02008-07-17 13:53:27 -0400174/* allocate and add a new ordered_extent into the per-inode tree.
175 * file_offset is the logical offset in the file
176 *
177 * start is the disk block number of an extent already reserved in the
178 * extent allocation tree
179 *
180 * len is the length of the extent
181 *
Chris Masoneb84ae02008-07-17 13:53:27 -0400182 * The tree is given a single reference on the ordered extent that was
183 * inserted.
184 */
Josef Bacik4b46fce2010-05-23 11:00:55 -0400185static int __btrfs_add_ordered_extent(struct inode *inode, u64 file_offset,
186 u64 start, u64 len, u64 disk_len,
Li Zefan261507a02010-12-17 14:21:50 +0800187 int type, int dio, int compress_type)
Chris Masondc17ff82008-01-08 15:46:30 -0500188{
Miao Xie199c2a92013-05-15 07:48:23 +0000189 struct btrfs_root *root = BTRFS_I(inode)->root;
Chris Masondc17ff82008-01-08 15:46:30 -0500190 struct btrfs_ordered_inode_tree *tree;
Chris Masone6dcd2d2008-07-17 12:53:50 -0400191 struct rb_node *node;
192 struct btrfs_ordered_extent *entry;
Chris Masondc17ff82008-01-08 15:46:30 -0500193
Chris Masone6dcd2d2008-07-17 12:53:50 -0400194 tree = &BTRFS_I(inode)->ordered_tree;
Miao Xie6352b912012-09-06 04:01:51 -0600195 entry = kmem_cache_zalloc(btrfs_ordered_extent_cache, GFP_NOFS);
Chris Masondc17ff82008-01-08 15:46:30 -0500196 if (!entry)
197 return -ENOMEM;
198
Chris Masone6dcd2d2008-07-17 12:53:50 -0400199 entry->file_offset = file_offset;
200 entry->start = start;
201 entry->len = len;
Chris Masonc8b97812008-10-29 14:49:59 -0400202 entry->disk_len = disk_len;
Chris Mason8b62b722009-09-02 16:53:46 -0400203 entry->bytes_left = len;
Josef Bacik5fd02042012-05-02 14:00:54 -0400204 entry->inode = igrab(inode);
Li Zefan261507a02010-12-17 14:21:50 +0800205 entry->compress_type = compress_type;
Josef Bacik77cef2e2013-08-29 13:57:21 -0400206 entry->truncated_len = (u64)-1;
Yan Zhengd899e052008-10-30 14:25:28 -0400207 if (type != BTRFS_ORDERED_IO_DONE && type != BTRFS_ORDERED_COMPLETE)
Yan Zheng80ff3852008-10-30 14:20:02 -0400208 set_bit(type, &entry->flags);
Chris Mason3eaa2882008-07-24 11:57:52 -0400209
Josef Bacik4b46fce2010-05-23 11:00:55 -0400210 if (dio)
211 set_bit(BTRFS_ORDERED_DIRECT, &entry->flags);
212
Chris Masone6dcd2d2008-07-17 12:53:50 -0400213 /* one ref for the tree */
214 atomic_set(&entry->refs, 1);
215 init_waitqueue_head(&entry->wait);
216 INIT_LIST_HEAD(&entry->list);
Chris Mason3eaa2882008-07-24 11:57:52 -0400217 INIT_LIST_HEAD(&entry->root_extent_list);
Miao Xie9afab882012-10-25 09:41:36 +0000218 INIT_LIST_HEAD(&entry->work_list);
219 init_completion(&entry->completion);
Josef Bacik2ab28f32012-10-12 15:27:49 -0400220 INIT_LIST_HEAD(&entry->log_list);
Josef Bacik50d9aa92014-11-21 14:52:38 -0500221 INIT_LIST_HEAD(&entry->trans_list);
Chris Masondc17ff82008-01-08 15:46:30 -0500222
liubo1abe9b82011-03-24 11:18:59 +0000223 trace_btrfs_ordered_extent_add(inode, entry);
224
Josef Bacik5fd02042012-05-02 14:00:54 -0400225 spin_lock_irq(&tree->lock);
Chris Masone6dcd2d2008-07-17 12:53:50 -0400226 node = tree_insert(&tree->tree, file_offset,
227 &entry->rb_node);
Jeff Mahoney43c04fb2011-10-03 23:22:33 -0400228 if (node)
229 ordered_data_tree_panic(inode, -EEXIST, file_offset);
Josef Bacik5fd02042012-05-02 14:00:54 -0400230 spin_unlock_irq(&tree->lock);
Chris Masond3977122009-01-05 21:25:51 -0500231
Miao Xie199c2a92013-05-15 07:48:23 +0000232 spin_lock(&root->ordered_extent_lock);
Chris Mason3eaa2882008-07-24 11:57:52 -0400233 list_add_tail(&entry->root_extent_list,
Miao Xie199c2a92013-05-15 07:48:23 +0000234 &root->ordered_extents);
235 root->nr_ordered_extents++;
236 if (root->nr_ordered_extents == 1) {
237 spin_lock(&root->fs_info->ordered_root_lock);
238 BUG_ON(!list_empty(&root->ordered_root));
239 list_add_tail(&root->ordered_root,
240 &root->fs_info->ordered_roots);
241 spin_unlock(&root->fs_info->ordered_root_lock);
242 }
243 spin_unlock(&root->ordered_extent_lock);
Chris Mason3eaa2882008-07-24 11:57:52 -0400244
Chris Masone6dcd2d2008-07-17 12:53:50 -0400245 return 0;
246}
Chris Masondc17ff82008-01-08 15:46:30 -0500247
Josef Bacik4b46fce2010-05-23 11:00:55 -0400248int btrfs_add_ordered_extent(struct inode *inode, u64 file_offset,
249 u64 start, u64 len, u64 disk_len, int type)
250{
251 return __btrfs_add_ordered_extent(inode, file_offset, start, len,
Li Zefan261507a02010-12-17 14:21:50 +0800252 disk_len, type, 0,
253 BTRFS_COMPRESS_NONE);
Josef Bacik4b46fce2010-05-23 11:00:55 -0400254}
255
256int btrfs_add_ordered_extent_dio(struct inode *inode, u64 file_offset,
257 u64 start, u64 len, u64 disk_len, int type)
258{
259 return __btrfs_add_ordered_extent(inode, file_offset, start, len,
Li Zefan261507a02010-12-17 14:21:50 +0800260 disk_len, type, 1,
261 BTRFS_COMPRESS_NONE);
262}
263
264int btrfs_add_ordered_extent_compress(struct inode *inode, u64 file_offset,
265 u64 start, u64 len, u64 disk_len,
266 int type, int compress_type)
267{
268 return __btrfs_add_ordered_extent(inode, file_offset, start, len,
269 disk_len, type, 0,
270 compress_type);
Josef Bacik4b46fce2010-05-23 11:00:55 -0400271}
272
Chris Masoneb84ae02008-07-17 13:53:27 -0400273/*
274 * Add a struct btrfs_ordered_sum into the list of checksums to be inserted
Chris Mason3edf7d32008-07-18 06:17:13 -0400275 * when an ordered extent is finished. If the list covers more than one
276 * ordered extent, it is split across multiples.
Chris Masoneb84ae02008-07-17 13:53:27 -0400277 */
Jeff Mahoney143bede2012-03-01 14:56:26 +0100278void btrfs_add_ordered_sum(struct inode *inode,
279 struct btrfs_ordered_extent *entry,
280 struct btrfs_ordered_sum *sum)
Chris Masone6dcd2d2008-07-17 12:53:50 -0400281{
282 struct btrfs_ordered_inode_tree *tree;
Chris Mason1b1e2132008-06-25 16:01:31 -0400283
Chris Masone6dcd2d2008-07-17 12:53:50 -0400284 tree = &BTRFS_I(inode)->ordered_tree;
Josef Bacik5fd02042012-05-02 14:00:54 -0400285 spin_lock_irq(&tree->lock);
Chris Masone6dcd2d2008-07-17 12:53:50 -0400286 list_add_tail(&sum->list, &entry->list);
Josef Bacik5fd02042012-05-02 14:00:54 -0400287 spin_unlock_irq(&tree->lock);
Chris Masone6dcd2d2008-07-17 12:53:50 -0400288}
289
Chris Masoneb84ae02008-07-17 13:53:27 -0400290/*
291 * this is used to account for finished IO across a given range
Chris Mason163cf092010-11-28 19:56:33 -0500292 * of the file. The IO may span ordered extents. If
293 * a given ordered_extent is completely done, 1 is returned, otherwise
294 * 0.
295 *
296 * test_and_set_bit on a flag in the struct btrfs_ordered_extent is used
297 * to make sure this function only returns 1 once for a given ordered extent.
298 *
299 * file_offset is updated to one byte past the range that is recorded as
300 * complete. This allows you to walk forward in the file.
301 */
302int btrfs_dec_test_first_ordered_pending(struct inode *inode,
303 struct btrfs_ordered_extent **cached,
Josef Bacik5fd02042012-05-02 14:00:54 -0400304 u64 *file_offset, u64 io_size, int uptodate)
Chris Mason163cf092010-11-28 19:56:33 -0500305{
306 struct btrfs_ordered_inode_tree *tree;
307 struct rb_node *node;
308 struct btrfs_ordered_extent *entry = NULL;
309 int ret;
Josef Bacik5fd02042012-05-02 14:00:54 -0400310 unsigned long flags;
Chris Mason163cf092010-11-28 19:56:33 -0500311 u64 dec_end;
312 u64 dec_start;
313 u64 to_dec;
314
315 tree = &BTRFS_I(inode)->ordered_tree;
Josef Bacik5fd02042012-05-02 14:00:54 -0400316 spin_lock_irqsave(&tree->lock, flags);
Chris Mason163cf092010-11-28 19:56:33 -0500317 node = tree_search(tree, *file_offset);
318 if (!node) {
319 ret = 1;
320 goto out;
321 }
322
323 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
324 if (!offset_in_entry(entry, *file_offset)) {
325 ret = 1;
326 goto out;
327 }
328
329 dec_start = max(*file_offset, entry->file_offset);
330 dec_end = min(*file_offset + io_size, entry->file_offset +
331 entry->len);
332 *file_offset = dec_end;
333 if (dec_start > dec_end) {
Frank Holtonefe120a2013-12-20 11:37:06 -0500334 btrfs_crit(BTRFS_I(inode)->root->fs_info,
335 "bad ordering dec_start %llu end %llu", dec_start, dec_end);
Chris Mason163cf092010-11-28 19:56:33 -0500336 }
337 to_dec = dec_end - dec_start;
338 if (to_dec > entry->bytes_left) {
Frank Holtonefe120a2013-12-20 11:37:06 -0500339 btrfs_crit(BTRFS_I(inode)->root->fs_info,
340 "bad ordered accounting left %llu size %llu",
341 entry->bytes_left, to_dec);
Chris Mason163cf092010-11-28 19:56:33 -0500342 }
343 entry->bytes_left -= to_dec;
Josef Bacik5fd02042012-05-02 14:00:54 -0400344 if (!uptodate)
345 set_bit(BTRFS_ORDERED_IOERR, &entry->flags);
346
Miao Xieaf7a6502014-03-06 13:54:56 +0800347 if (entry->bytes_left == 0) {
Chris Mason163cf092010-11-28 19:56:33 -0500348 ret = test_and_set_bit(BTRFS_ORDERED_IO_DONE, &entry->flags);
David Sterbaa83342a2015-02-16 19:36:47 +0100349 /*
350 * Implicit memory barrier after test_and_set_bit
351 */
Miao Xieaf7a6502014-03-06 13:54:56 +0800352 if (waitqueue_active(&entry->wait))
353 wake_up(&entry->wait);
354 } else {
Chris Mason163cf092010-11-28 19:56:33 -0500355 ret = 1;
Miao Xieaf7a6502014-03-06 13:54:56 +0800356 }
Chris Mason163cf092010-11-28 19:56:33 -0500357out:
358 if (!ret && cached && entry) {
359 *cached = entry;
360 atomic_inc(&entry->refs);
361 }
Josef Bacik5fd02042012-05-02 14:00:54 -0400362 spin_unlock_irqrestore(&tree->lock, flags);
Chris Mason163cf092010-11-28 19:56:33 -0500363 return ret == 0;
364}
365
366/*
367 * this is used to account for finished IO across a given range
Chris Masoneb84ae02008-07-17 13:53:27 -0400368 * of the file. The IO should not span ordered extents. If
369 * a given ordered_extent is completely done, 1 is returned, otherwise
370 * 0.
371 *
372 * test_and_set_bit on a flag in the struct btrfs_ordered_extent is used
373 * to make sure this function only returns 1 once for a given ordered extent.
374 */
Chris Masone6dcd2d2008-07-17 12:53:50 -0400375int btrfs_dec_test_ordered_pending(struct inode *inode,
Josef Bacik5a1a3df2010-02-02 20:51:14 +0000376 struct btrfs_ordered_extent **cached,
Josef Bacik5fd02042012-05-02 14:00:54 -0400377 u64 file_offset, u64 io_size, int uptodate)
Chris Masone6dcd2d2008-07-17 12:53:50 -0400378{
379 struct btrfs_ordered_inode_tree *tree;
380 struct rb_node *node;
Josef Bacik5a1a3df2010-02-02 20:51:14 +0000381 struct btrfs_ordered_extent *entry = NULL;
Josef Bacik5fd02042012-05-02 14:00:54 -0400382 unsigned long flags;
Chris Masone6dcd2d2008-07-17 12:53:50 -0400383 int ret;
384
385 tree = &BTRFS_I(inode)->ordered_tree;
Josef Bacik5fd02042012-05-02 14:00:54 -0400386 spin_lock_irqsave(&tree->lock, flags);
387 if (cached && *cached) {
388 entry = *cached;
389 goto have_entry;
390 }
391
Chris Masone6dcd2d2008-07-17 12:53:50 -0400392 node = tree_search(tree, file_offset);
393 if (!node) {
394 ret = 1;
395 goto out;
396 }
397
398 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
Josef Bacik5fd02042012-05-02 14:00:54 -0400399have_entry:
Chris Masone6dcd2d2008-07-17 12:53:50 -0400400 if (!offset_in_entry(entry, file_offset)) {
401 ret = 1;
402 goto out;
403 }
404
Chris Mason8b62b722009-09-02 16:53:46 -0400405 if (io_size > entry->bytes_left) {
Frank Holtonefe120a2013-12-20 11:37:06 -0500406 btrfs_crit(BTRFS_I(inode)->root->fs_info,
407 "bad ordered accounting left %llu size %llu",
Geert Uytterhoevenc1c9ff72013-08-20 13:20:07 +0200408 entry->bytes_left, io_size);
Chris Mason8b62b722009-09-02 16:53:46 -0400409 }
410 entry->bytes_left -= io_size;
Josef Bacik5fd02042012-05-02 14:00:54 -0400411 if (!uptodate)
412 set_bit(BTRFS_ORDERED_IOERR, &entry->flags);
413
Miao Xieaf7a6502014-03-06 13:54:56 +0800414 if (entry->bytes_left == 0) {
Chris Masone6dcd2d2008-07-17 12:53:50 -0400415 ret = test_and_set_bit(BTRFS_ORDERED_IO_DONE, &entry->flags);
David Sterbaa83342a2015-02-16 19:36:47 +0100416 /*
417 * Implicit memory barrier after test_and_set_bit
418 */
Miao Xieaf7a6502014-03-06 13:54:56 +0800419 if (waitqueue_active(&entry->wait))
420 wake_up(&entry->wait);
421 } else {
Chris Mason8b62b722009-09-02 16:53:46 -0400422 ret = 1;
Miao Xieaf7a6502014-03-06 13:54:56 +0800423 }
Chris Masone6dcd2d2008-07-17 12:53:50 -0400424out:
Josef Bacik5a1a3df2010-02-02 20:51:14 +0000425 if (!ret && cached && entry) {
426 *cached = entry;
427 atomic_inc(&entry->refs);
428 }
Josef Bacik5fd02042012-05-02 14:00:54 -0400429 spin_unlock_irqrestore(&tree->lock, flags);
Chris Masone6dcd2d2008-07-17 12:53:50 -0400430 return ret == 0;
431}
432
Josef Bacik2ab28f32012-10-12 15:27:49 -0400433/* Needs to either be called under a log transaction or the log_mutex */
Miao Xie827463c2014-01-14 20:31:51 +0800434void btrfs_get_logged_extents(struct inode *inode,
Filipe Manana08702952014-11-13 17:00:35 +0000435 struct list_head *logged_list,
436 const loff_t start,
437 const loff_t end)
Josef Bacik2ab28f32012-10-12 15:27:49 -0400438{
439 struct btrfs_ordered_inode_tree *tree;
440 struct btrfs_ordered_extent *ordered;
441 struct rb_node *n;
Filipe Manana08702952014-11-13 17:00:35 +0000442 struct rb_node *prev;
Josef Bacik2ab28f32012-10-12 15:27:49 -0400443
444 tree = &BTRFS_I(inode)->ordered_tree;
445 spin_lock_irq(&tree->lock);
Filipe Manana08702952014-11-13 17:00:35 +0000446 n = __tree_search(&tree->tree, end, &prev);
447 if (!n)
448 n = prev;
449 for (; n; n = rb_prev(n)) {
Josef Bacik2ab28f32012-10-12 15:27:49 -0400450 ordered = rb_entry(n, struct btrfs_ordered_extent, rb_node);
Filipe Manana08702952014-11-13 17:00:35 +0000451 if (ordered->file_offset > end)
452 continue;
453 if (entry_end(ordered) <= start)
454 break;
Filipe Manana4d884fc2015-02-09 17:17:43 +0000455 if (test_and_set_bit(BTRFS_ORDERED_LOGGED, &ordered->flags))
Josef Bacik50d9aa92014-11-21 14:52:38 -0500456 continue;
Filipe Manana08702952014-11-13 17:00:35 +0000457 list_add(&ordered->log_list, logged_list);
Miao Xie827463c2014-01-14 20:31:51 +0800458 atomic_inc(&ordered->refs);
Josef Bacik2ab28f32012-10-12 15:27:49 -0400459 }
460 spin_unlock_irq(&tree->lock);
461}
462
Miao Xie827463c2014-01-14 20:31:51 +0800463void btrfs_put_logged_extents(struct list_head *logged_list)
464{
465 struct btrfs_ordered_extent *ordered;
466
467 while (!list_empty(logged_list)) {
468 ordered = list_first_entry(logged_list,
469 struct btrfs_ordered_extent,
470 log_list);
471 list_del_init(&ordered->log_list);
472 btrfs_put_ordered_extent(ordered);
473 }
474}
475
476void btrfs_submit_logged_extents(struct list_head *logged_list,
477 struct btrfs_root *log)
478{
479 int index = log->log_transid % 2;
480
481 spin_lock_irq(&log->log_extents_lock[index]);
482 list_splice_tail(logged_list, &log->logged_list[index]);
483 spin_unlock_irq(&log->log_extents_lock[index]);
484}
485
Josef Bacik50d9aa92014-11-21 14:52:38 -0500486void btrfs_wait_logged_extents(struct btrfs_trans_handle *trans,
487 struct btrfs_root *log, u64 transid)
Josef Bacik2ab28f32012-10-12 15:27:49 -0400488{
489 struct btrfs_ordered_extent *ordered;
490 int index = transid % 2;
491
492 spin_lock_irq(&log->log_extents_lock[index]);
493 while (!list_empty(&log->logged_list[index])) {
Josef Bacik161c35492015-09-24 16:17:39 -0400494 struct inode *inode;
Josef Bacik2ab28f32012-10-12 15:27:49 -0400495 ordered = list_first_entry(&log->logged_list[index],
496 struct btrfs_ordered_extent,
497 log_list);
498 list_del_init(&ordered->log_list);
Josef Bacik161c35492015-09-24 16:17:39 -0400499 inode = ordered->inode;
Josef Bacik2ab28f32012-10-12 15:27:49 -0400500 spin_unlock_irq(&log->log_extents_lock[index]);
Liu Bo98ce2de2014-07-17 16:08:36 +0800501
502 if (!test_bit(BTRFS_ORDERED_IO_DONE, &ordered->flags) &&
503 !test_bit(BTRFS_ORDERED_DIRECT, &ordered->flags)) {
Liu Bo98ce2de2014-07-17 16:08:36 +0800504 u64 start = ordered->file_offset;
505 u64 end = ordered->file_offset + ordered->len - 1;
506
507 WARN_ON(!inode);
508 filemap_fdatawrite_range(inode->i_mapping, start, end);
509 }
Josef Bacik2ab28f32012-10-12 15:27:49 -0400510 wait_event(ordered->wait, test_bit(BTRFS_ORDERED_IO_DONE,
511 &ordered->flags));
Liu Bo98ce2de2014-07-17 16:08:36 +0800512
Filipe Manana7558c8b2015-04-17 17:08:37 +0100513 /*
Josef Bacik161c35492015-09-24 16:17:39 -0400514 * In order to keep us from losing our ordered extent
515 * information when committing the transaction we have to make
516 * sure that any logged extents are completed when we go to
517 * commit the transaction. To do this we simply increase the
518 * current transactions pending_ordered counter and decrement it
519 * when the ordered extent completes.
Filipe Manana7558c8b2015-04-17 17:08:37 +0100520 */
Josef Bacik161c35492015-09-24 16:17:39 -0400521 if (!test_bit(BTRFS_ORDERED_COMPLETE, &ordered->flags)) {
522 struct btrfs_ordered_inode_tree *tree;
Filipe Manana7558c8b2015-04-17 17:08:37 +0100523
Josef Bacik161c35492015-09-24 16:17:39 -0400524 tree = &BTRFS_I(inode)->ordered_tree;
525 spin_lock_irq(&tree->lock);
526 if (!test_bit(BTRFS_ORDERED_COMPLETE, &ordered->flags)) {
527 set_bit(BTRFS_ORDERED_PENDING, &ordered->flags);
528 atomic_inc(&trans->transaction->pending_ordered);
529 }
530 spin_unlock_irq(&tree->lock);
531 }
532 btrfs_put_ordered_extent(ordered);
Josef Bacik2ab28f32012-10-12 15:27:49 -0400533 spin_lock_irq(&log->log_extents_lock[index]);
534 }
535 spin_unlock_irq(&log->log_extents_lock[index]);
536}
537
538void btrfs_free_logged_extents(struct btrfs_root *log, u64 transid)
539{
540 struct btrfs_ordered_extent *ordered;
541 int index = transid % 2;
542
543 spin_lock_irq(&log->log_extents_lock[index]);
544 while (!list_empty(&log->logged_list[index])) {
545 ordered = list_first_entry(&log->logged_list[index],
546 struct btrfs_ordered_extent,
547 log_list);
548 list_del_init(&ordered->log_list);
549 spin_unlock_irq(&log->log_extents_lock[index]);
550 btrfs_put_ordered_extent(ordered);
551 spin_lock_irq(&log->log_extents_lock[index]);
552 }
553 spin_unlock_irq(&log->log_extents_lock[index]);
554}
555
Chris Masoneb84ae02008-07-17 13:53:27 -0400556/*
557 * used to drop a reference on an ordered extent. This will free
558 * the extent if the last reference is dropped
559 */
Jeff Mahoney143bede2012-03-01 14:56:26 +0100560void btrfs_put_ordered_extent(struct btrfs_ordered_extent *entry)
Chris Masone6dcd2d2008-07-17 12:53:50 -0400561{
Chris Masonba1da2f2008-07-17 12:54:15 -0400562 struct list_head *cur;
563 struct btrfs_ordered_sum *sum;
564
liubo1abe9b82011-03-24 11:18:59 +0000565 trace_btrfs_ordered_extent_put(entry->inode, entry);
566
Chris Masonba1da2f2008-07-17 12:54:15 -0400567 if (atomic_dec_and_test(&entry->refs)) {
Filipe Manana61de7182015-07-01 12:13:10 +0100568 ASSERT(list_empty(&entry->log_list));
569 ASSERT(list_empty(&entry->trans_list));
570 ASSERT(list_empty(&entry->root_extent_list));
571 ASSERT(RB_EMPTY_NODE(&entry->rb_node));
Josef Bacik5fd02042012-05-02 14:00:54 -0400572 if (entry->inode)
573 btrfs_add_delayed_iput(entry->inode);
Chris Masond3977122009-01-05 21:25:51 -0500574 while (!list_empty(&entry->list)) {
Chris Masonba1da2f2008-07-17 12:54:15 -0400575 cur = entry->list.next;
576 sum = list_entry(cur, struct btrfs_ordered_sum, list);
577 list_del(&sum->list);
578 kfree(sum);
579 }
Miao Xie6352b912012-09-06 04:01:51 -0600580 kmem_cache_free(btrfs_ordered_extent_cache, entry);
Chris Masonba1da2f2008-07-17 12:54:15 -0400581 }
Chris Masondc17ff82008-01-08 15:46:30 -0500582}
583
Chris Masoneb84ae02008-07-17 13:53:27 -0400584/*
585 * remove an ordered extent from the tree. No references are dropped
Josef Bacik5fd02042012-05-02 14:00:54 -0400586 * and waiters are woken up.
Chris Masoneb84ae02008-07-17 13:53:27 -0400587 */
Josef Bacik5fd02042012-05-02 14:00:54 -0400588void btrfs_remove_ordered_extent(struct inode *inode,
589 struct btrfs_ordered_extent *entry)
Chris Masondc17ff82008-01-08 15:46:30 -0500590{
Chris Masone6dcd2d2008-07-17 12:53:50 -0400591 struct btrfs_ordered_inode_tree *tree;
Josef Bacik287a0ab2010-03-19 18:07:23 +0000592 struct btrfs_root *root = BTRFS_I(inode)->root;
Chris Masondc17ff82008-01-08 15:46:30 -0500593 struct rb_node *node;
Josef Bacik161c35492015-09-24 16:17:39 -0400594 bool dec_pending_ordered = false;
Chris Masondc17ff82008-01-08 15:46:30 -0500595
Chris Masone6dcd2d2008-07-17 12:53:50 -0400596 tree = &BTRFS_I(inode)->ordered_tree;
Josef Bacik5fd02042012-05-02 14:00:54 -0400597 spin_lock_irq(&tree->lock);
Chris Masone6dcd2d2008-07-17 12:53:50 -0400598 node = &entry->rb_node;
Chris Masondc17ff82008-01-08 15:46:30 -0500599 rb_erase(node, &tree->tree);
Filipe Manana61de7182015-07-01 12:13:10 +0100600 RB_CLEAR_NODE(node);
Filipe David Borba Manana1b8e7e42013-11-22 18:54:58 +0000601 if (tree->last == node)
602 tree->last = NULL;
Chris Masone6dcd2d2008-07-17 12:53:50 -0400603 set_bit(BTRFS_ORDERED_COMPLETE, &entry->flags);
Josef Bacik161c35492015-09-24 16:17:39 -0400604 if (test_and_clear_bit(BTRFS_ORDERED_PENDING, &entry->flags))
605 dec_pending_ordered = true;
Josef Bacik5fd02042012-05-02 14:00:54 -0400606 spin_unlock_irq(&tree->lock);
Chris Mason3eaa2882008-07-24 11:57:52 -0400607
Josef Bacik161c35492015-09-24 16:17:39 -0400608 /*
609 * The current running transaction is waiting on us, we need to let it
610 * know that we're complete and wake it up.
611 */
612 if (dec_pending_ordered) {
613 struct btrfs_transaction *trans;
614
615 /*
616 * The checks for trans are just a formality, it should be set,
617 * but if it isn't we don't want to deref/assert under the spin
618 * lock, so be nice and check if trans is set, but ASSERT() so
619 * if it isn't set a developer will notice.
620 */
621 spin_lock(&root->fs_info->trans_lock);
622 trans = root->fs_info->running_transaction;
623 if (trans)
624 atomic_inc(&trans->use_count);
625 spin_unlock(&root->fs_info->trans_lock);
626
627 ASSERT(trans);
628 if (trans) {
629 if (atomic_dec_and_test(&trans->pending_ordered))
630 wake_up(&trans->pending_wait);
631 btrfs_put_transaction(trans);
632 }
633 }
634
Miao Xie199c2a92013-05-15 07:48:23 +0000635 spin_lock(&root->ordered_extent_lock);
Chris Mason3eaa2882008-07-24 11:57:52 -0400636 list_del_init(&entry->root_extent_list);
Miao Xie199c2a92013-05-15 07:48:23 +0000637 root->nr_ordered_extents--;
Chris Mason5a3f23d2009-03-31 13:27:11 -0400638
liubo1abe9b82011-03-24 11:18:59 +0000639 trace_btrfs_ordered_extent_remove(inode, entry);
640
Miao Xie199c2a92013-05-15 07:48:23 +0000641 if (!root->nr_ordered_extents) {
642 spin_lock(&root->fs_info->ordered_root_lock);
643 BUG_ON(list_empty(&root->ordered_root));
644 list_del_init(&root->ordered_root);
645 spin_unlock(&root->fs_info->ordered_root_lock);
646 }
647 spin_unlock(&root->ordered_extent_lock);
Chris Masone6dcd2d2008-07-17 12:53:50 -0400648 wake_up(&entry->wait);
Chris Mason81d7ed22008-04-25 08:51:48 -0400649}
Chris Masone6dcd2d2008-07-17 12:53:50 -0400650
Qu Wenruod458b052014-02-28 10:46:19 +0800651static void btrfs_run_ordered_extent_work(struct btrfs_work *work)
Miao Xie9afab882012-10-25 09:41:36 +0000652{
653 struct btrfs_ordered_extent *ordered;
654
655 ordered = container_of(work, struct btrfs_ordered_extent, flush_work);
656 btrfs_start_ordered_extent(ordered->inode, ordered, 1);
657 complete(&ordered->completion);
658}
659
Chris Masond352ac62008-09-29 15:18:18 -0400660/*
661 * wait for all the ordered extents in a root. This is done when balancing
662 * space between drives.
663 */
Filipe Manana578def72016-04-26 15:36:38 +0100664int btrfs_wait_ordered_extents(struct btrfs_root *root, int nr,
665 const u64 range_start, const u64 range_len)
Chris Mason3eaa2882008-07-24 11:57:52 -0400666{
Filipe Manana578def72016-04-26 15:36:38 +0100667 LIST_HEAD(splice);
668 LIST_HEAD(skipped);
669 LIST_HEAD(works);
Miao Xie9afab882012-10-25 09:41:36 +0000670 struct btrfs_ordered_extent *ordered, *next;
Miao Xieb0244192013-11-04 23:13:25 +0800671 int count = 0;
Filipe Manana578def72016-04-26 15:36:38 +0100672 const u64 range_end = range_start + range_len;
Chris Mason3eaa2882008-07-24 11:57:52 -0400673
Miao Xie31f3d252014-03-06 13:55:02 +0800674 mutex_lock(&root->ordered_extent_mutex);
Miao Xie199c2a92013-05-15 07:48:23 +0000675 spin_lock(&root->ordered_extent_lock);
676 list_splice_init(&root->ordered_extents, &splice);
Miao Xieb0244192013-11-04 23:13:25 +0800677 while (!list_empty(&splice) && nr) {
Miao Xie199c2a92013-05-15 07:48:23 +0000678 ordered = list_first_entry(&splice, struct btrfs_ordered_extent,
679 root_extent_list);
Filipe Manana578def72016-04-26 15:36:38 +0100680
681 if (range_end <= ordered->start ||
682 ordered->start + ordered->disk_len <= range_start) {
683 list_move_tail(&ordered->root_extent_list, &skipped);
684 cond_resched_lock(&root->ordered_extent_lock);
685 continue;
686 }
687
Miao Xie199c2a92013-05-15 07:48:23 +0000688 list_move_tail(&ordered->root_extent_list,
689 &root->ordered_extents);
Miao Xie199c2a92013-05-15 07:48:23 +0000690 atomic_inc(&ordered->refs);
691 spin_unlock(&root->ordered_extent_lock);
692
Qu Wenruoa44903a2014-02-28 10:46:09 +0800693 btrfs_init_work(&ordered->flush_work,
Liu Bo9e0af232014-08-15 23:36:53 +0800694 btrfs_flush_delalloc_helper,
Qu Wenruoa44903a2014-02-28 10:46:09 +0800695 btrfs_run_ordered_extent_work, NULL, NULL);
Miao Xie199c2a92013-05-15 07:48:23 +0000696 list_add_tail(&ordered->work_list, &works);
Qu Wenruoa44903a2014-02-28 10:46:09 +0800697 btrfs_queue_work(root->fs_info->flush_workers,
698 &ordered->flush_work);
Miao Xie199c2a92013-05-15 07:48:23 +0000699
Miao Xie9afab882012-10-25 09:41:36 +0000700 cond_resched();
Miao Xie199c2a92013-05-15 07:48:23 +0000701 spin_lock(&root->ordered_extent_lock);
Miao Xieb0244192013-11-04 23:13:25 +0800702 if (nr != -1)
703 nr--;
704 count++;
Chris Mason3eaa2882008-07-24 11:57:52 -0400705 }
Filipe Manana578def72016-04-26 15:36:38 +0100706 list_splice_tail(&skipped, &root->ordered_extents);
Miao Xieb0244192013-11-04 23:13:25 +0800707 list_splice_tail(&splice, &root->ordered_extents);
Miao Xie199c2a92013-05-15 07:48:23 +0000708 spin_unlock(&root->ordered_extent_lock);
Miao Xie9afab882012-10-25 09:41:36 +0000709
710 list_for_each_entry_safe(ordered, next, &works, work_list) {
711 list_del_init(&ordered->work_list);
712 wait_for_completion(&ordered->completion);
Miao Xie9afab882012-10-25 09:41:36 +0000713 btrfs_put_ordered_extent(ordered);
Miao Xie9afab882012-10-25 09:41:36 +0000714 cond_resched();
715 }
Miao Xie31f3d252014-03-06 13:55:02 +0800716 mutex_unlock(&root->ordered_extent_mutex);
Miao Xieb0244192013-11-04 23:13:25 +0800717
718 return count;
Chris Mason3eaa2882008-07-24 11:57:52 -0400719}
720
Filipe Mananaf0e9b7d2016-05-14 09:12:53 +0100721int btrfs_wait_ordered_roots(struct btrfs_fs_info *fs_info, int nr,
Filipe Manana578def72016-04-26 15:36:38 +0100722 const u64 range_start, const u64 range_len)
Miao Xie199c2a92013-05-15 07:48:23 +0000723{
724 struct btrfs_root *root;
725 struct list_head splice;
Miao Xieb0244192013-11-04 23:13:25 +0800726 int done;
Filipe Mananaf0e9b7d2016-05-14 09:12:53 +0100727 int total_done = 0;
Miao Xie199c2a92013-05-15 07:48:23 +0000728
729 INIT_LIST_HEAD(&splice);
730
Miao Xie8b9d83c2014-03-06 13:54:55 +0800731 mutex_lock(&fs_info->ordered_operations_mutex);
Miao Xie199c2a92013-05-15 07:48:23 +0000732 spin_lock(&fs_info->ordered_root_lock);
733 list_splice_init(&fs_info->ordered_roots, &splice);
Miao Xieb0244192013-11-04 23:13:25 +0800734 while (!list_empty(&splice) && nr) {
Miao Xie199c2a92013-05-15 07:48:23 +0000735 root = list_first_entry(&splice, struct btrfs_root,
736 ordered_root);
737 root = btrfs_grab_fs_root(root);
738 BUG_ON(!root);
739 list_move_tail(&root->ordered_root,
740 &fs_info->ordered_roots);
741 spin_unlock(&fs_info->ordered_root_lock);
742
Filipe Manana578def72016-04-26 15:36:38 +0100743 done = btrfs_wait_ordered_extents(root, nr,
744 range_start, range_len);
Miao Xie199c2a92013-05-15 07:48:23 +0000745 btrfs_put_fs_root(root);
Filipe Mananaf0e9b7d2016-05-14 09:12:53 +0100746 total_done += done;
Miao Xie199c2a92013-05-15 07:48:23 +0000747
748 spin_lock(&fs_info->ordered_root_lock);
Miao Xieb0244192013-11-04 23:13:25 +0800749 if (nr != -1) {
750 nr -= done;
751 WARN_ON(nr < 0);
752 }
Miao Xie199c2a92013-05-15 07:48:23 +0000753 }
Miao Xie931aa872013-11-14 17:33:21 +0800754 list_splice_tail(&splice, &fs_info->ordered_roots);
Miao Xie199c2a92013-05-15 07:48:23 +0000755 spin_unlock(&fs_info->ordered_root_lock);
Miao Xie8b9d83c2014-03-06 13:54:55 +0800756 mutex_unlock(&fs_info->ordered_operations_mutex);
Filipe Mananaf0e9b7d2016-05-14 09:12:53 +0100757
758 return total_done;
Miao Xie199c2a92013-05-15 07:48:23 +0000759}
760
Chris Masoneb84ae02008-07-17 13:53:27 -0400761/*
762 * Used to start IO or wait for a given ordered extent to finish.
763 *
764 * If wait is one, this effectively waits on page writeback for all the pages
765 * in the extent, and it waits on the io completion code to insert
766 * metadata into the btree corresponding to the extent
767 */
768void btrfs_start_ordered_extent(struct inode *inode,
769 struct btrfs_ordered_extent *entry,
770 int wait)
Chris Masone6dcd2d2008-07-17 12:53:50 -0400771{
772 u64 start = entry->file_offset;
773 u64 end = start + entry->len - 1;
774
liubo1abe9b82011-03-24 11:18:59 +0000775 trace_btrfs_ordered_extent_start(inode, entry);
776
Chris Masoneb84ae02008-07-17 13:53:27 -0400777 /*
778 * pages in the range can be dirty, clean or writeback. We
779 * start IO on any dirty ones so the wait doesn't stall waiting
Artem Bityutskiyb2570312012-07-25 18:12:06 +0300780 * for the flusher thread to find them
Chris Masoneb84ae02008-07-17 13:53:27 -0400781 */
Josef Bacik4b46fce2010-05-23 11:00:55 -0400782 if (!test_bit(BTRFS_ORDERED_DIRECT, &entry->flags))
783 filemap_fdatawrite_range(inode->i_mapping, start, end);
Chris Masonc8b97812008-10-29 14:49:59 -0400784 if (wait) {
Chris Masone6dcd2d2008-07-17 12:53:50 -0400785 wait_event(entry->wait, test_bit(BTRFS_ORDERED_COMPLETE,
786 &entry->flags));
Chris Masonc8b97812008-10-29 14:49:59 -0400787 }
Chris Masone6dcd2d2008-07-17 12:53:50 -0400788}
789
Chris Masoneb84ae02008-07-17 13:53:27 -0400790/*
791 * Used to wait on ordered extents across a large range of bytes.
792 */
Josef Bacik0ef8b722013-10-25 16:13:35 -0400793int btrfs_wait_ordered_range(struct inode *inode, u64 start, u64 len)
Chris Masone6dcd2d2008-07-17 12:53:50 -0400794{
Josef Bacik0ef8b722013-10-25 16:13:35 -0400795 int ret = 0;
Filipe Manana28aeeac2015-05-05 19:03:10 +0100796 int ret_wb = 0;
Chris Masone6dcd2d2008-07-17 12:53:50 -0400797 u64 end;
Chris Masone5a22172008-07-18 20:42:20 -0400798 u64 orig_end;
Chris Masone6dcd2d2008-07-17 12:53:50 -0400799 struct btrfs_ordered_extent *ordered;
Chris Masone6dcd2d2008-07-17 12:53:50 -0400800
Chris Masone5a22172008-07-18 20:42:20 -0400801 if (start + len < start) {
Chris Masonf4219502008-07-22 11:18:09 -0400802 orig_end = INT_LIMIT(loff_t);
Chris Masone5a22172008-07-18 20:42:20 -0400803 } else {
804 orig_end = start + len - 1;
Chris Masonf4219502008-07-22 11:18:09 -0400805 if (orig_end > INT_LIMIT(loff_t))
806 orig_end = INT_LIMIT(loff_t);
Chris Masone5a22172008-07-18 20:42:20 -0400807 }
Josef Bacik551ebb22012-04-23 14:41:09 -0400808
Chris Masone5a22172008-07-18 20:42:20 -0400809 /* start IO across the range first to instantiate any delalloc
810 * extents
811 */
Filipe Manana728404d2014-10-10 09:43:11 +0100812 ret = btrfs_fdatawrite_range(inode, start, orig_end);
Josef Bacik0ef8b722013-10-25 16:13:35 -0400813 if (ret)
814 return ret;
Filipe Manana728404d2014-10-10 09:43:11 +0100815
Filipe Manana28aeeac2015-05-05 19:03:10 +0100816 /*
817 * If we have a writeback error don't return immediately. Wait first
818 * for any ordered extents that haven't completed yet. This is to make
819 * sure no one can dirty the same page ranges and call writepages()
820 * before the ordered extents complete - to avoid failures (-EEXIST)
821 * when adding the new ordered extents to the ordered tree.
822 */
823 ret_wb = filemap_fdatawait_range(inode->i_mapping, start, orig_end);
Chris Masonf4219502008-07-22 11:18:09 -0400824
825 end = orig_end;
Chris Masond3977122009-01-05 21:25:51 -0500826 while (1) {
Chris Masone6dcd2d2008-07-17 12:53:50 -0400827 ordered = btrfs_lookup_first_ordered_extent(inode, end);
Chris Masond3977122009-01-05 21:25:51 -0500828 if (!ordered)
Chris Masone6dcd2d2008-07-17 12:53:50 -0400829 break;
Chris Masone5a22172008-07-18 20:42:20 -0400830 if (ordered->file_offset > orig_end) {
Chris Masone6dcd2d2008-07-17 12:53:50 -0400831 btrfs_put_ordered_extent(ordered);
832 break;
833 }
Filipe David Borba Mananab52abf12013-11-06 15:12:40 +0000834 if (ordered->file_offset + ordered->len <= start) {
Chris Masone6dcd2d2008-07-17 12:53:50 -0400835 btrfs_put_ordered_extent(ordered);
836 break;
837 }
Chris Masone5a22172008-07-18 20:42:20 -0400838 btrfs_start_ordered_extent(inode, ordered, 1);
Chris Masone6dcd2d2008-07-17 12:53:50 -0400839 end = ordered->file_offset;
Josef Bacik0ef8b722013-10-25 16:13:35 -0400840 if (test_bit(BTRFS_ORDERED_IOERR, &ordered->flags))
841 ret = -EIO;
Chris Masone6dcd2d2008-07-17 12:53:50 -0400842 btrfs_put_ordered_extent(ordered);
Josef Bacik0ef8b722013-10-25 16:13:35 -0400843 if (ret || end == 0 || end == start)
Chris Masone6dcd2d2008-07-17 12:53:50 -0400844 break;
845 end--;
846 }
Filipe Manana28aeeac2015-05-05 19:03:10 +0100847 return ret_wb ? ret_wb : ret;
Chris Masone6dcd2d2008-07-17 12:53:50 -0400848}
849
Chris Masoneb84ae02008-07-17 13:53:27 -0400850/*
851 * find an ordered extent corresponding to file_offset. return NULL if
852 * nothing is found, otherwise take a reference on the extent and return it
853 */
Chris Masone6dcd2d2008-07-17 12:53:50 -0400854struct btrfs_ordered_extent *btrfs_lookup_ordered_extent(struct inode *inode,
855 u64 file_offset)
856{
857 struct btrfs_ordered_inode_tree *tree;
858 struct rb_node *node;
859 struct btrfs_ordered_extent *entry = NULL;
860
861 tree = &BTRFS_I(inode)->ordered_tree;
Josef Bacik5fd02042012-05-02 14:00:54 -0400862 spin_lock_irq(&tree->lock);
Chris Masone6dcd2d2008-07-17 12:53:50 -0400863 node = tree_search(tree, file_offset);
864 if (!node)
865 goto out;
866
867 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
868 if (!offset_in_entry(entry, file_offset))
869 entry = NULL;
870 if (entry)
871 atomic_inc(&entry->refs);
872out:
Josef Bacik5fd02042012-05-02 14:00:54 -0400873 spin_unlock_irq(&tree->lock);
Chris Masone6dcd2d2008-07-17 12:53:50 -0400874 return entry;
875}
876
Josef Bacik4b46fce2010-05-23 11:00:55 -0400877/* Since the DIO code tries to lock a wide area we need to look for any ordered
878 * extents that exist in the range, rather than just the start of the range.
879 */
880struct btrfs_ordered_extent *btrfs_lookup_ordered_range(struct inode *inode,
881 u64 file_offset,
882 u64 len)
883{
884 struct btrfs_ordered_inode_tree *tree;
885 struct rb_node *node;
886 struct btrfs_ordered_extent *entry = NULL;
887
888 tree = &BTRFS_I(inode)->ordered_tree;
Josef Bacik5fd02042012-05-02 14:00:54 -0400889 spin_lock_irq(&tree->lock);
Josef Bacik4b46fce2010-05-23 11:00:55 -0400890 node = tree_search(tree, file_offset);
891 if (!node) {
892 node = tree_search(tree, file_offset + len);
893 if (!node)
894 goto out;
895 }
896
897 while (1) {
898 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
899 if (range_overlaps(entry, file_offset, len))
900 break;
901
902 if (entry->file_offset >= file_offset + len) {
903 entry = NULL;
904 break;
905 }
906 entry = NULL;
907 node = rb_next(node);
908 if (!node)
909 break;
910 }
911out:
912 if (entry)
913 atomic_inc(&entry->refs);
Josef Bacik5fd02042012-05-02 14:00:54 -0400914 spin_unlock_irq(&tree->lock);
Josef Bacik4b46fce2010-05-23 11:00:55 -0400915 return entry;
916}
917
Filipe Mananab659ef02015-03-31 14:16:52 +0100918bool btrfs_have_ordered_extents_in_range(struct inode *inode,
919 u64 file_offset,
920 u64 len)
921{
922 struct btrfs_ordered_extent *oe;
923
924 oe = btrfs_lookup_ordered_range(inode, file_offset, len);
925 if (oe) {
926 btrfs_put_ordered_extent(oe);
927 return true;
928 }
929 return false;
930}
931
Chris Masoneb84ae02008-07-17 13:53:27 -0400932/*
933 * lookup and return any extent before 'file_offset'. NULL is returned
934 * if none is found
935 */
Chris Masone6dcd2d2008-07-17 12:53:50 -0400936struct btrfs_ordered_extent *
Chris Masond3977122009-01-05 21:25:51 -0500937btrfs_lookup_first_ordered_extent(struct inode *inode, u64 file_offset)
Chris Masone6dcd2d2008-07-17 12:53:50 -0400938{
939 struct btrfs_ordered_inode_tree *tree;
940 struct rb_node *node;
941 struct btrfs_ordered_extent *entry = NULL;
942
943 tree = &BTRFS_I(inode)->ordered_tree;
Josef Bacik5fd02042012-05-02 14:00:54 -0400944 spin_lock_irq(&tree->lock);
Chris Masone6dcd2d2008-07-17 12:53:50 -0400945 node = tree_search(tree, file_offset);
946 if (!node)
947 goto out;
948
949 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
950 atomic_inc(&entry->refs);
951out:
Josef Bacik5fd02042012-05-02 14:00:54 -0400952 spin_unlock_irq(&tree->lock);
Chris Masone6dcd2d2008-07-17 12:53:50 -0400953 return entry;
954}
Chris Masondbe674a2008-07-17 12:54:05 -0400955
Chris Masoneb84ae02008-07-17 13:53:27 -0400956/*
957 * After an extent is done, call this to conditionally update the on disk
958 * i_size. i_size is updated to cover any fully written part of the file.
959 */
Yan, Zhengc2167752009-11-12 09:34:21 +0000960int btrfs_ordered_update_i_size(struct inode *inode, u64 offset,
Chris Masondbe674a2008-07-17 12:54:05 -0400961 struct btrfs_ordered_extent *ordered)
962{
963 struct btrfs_ordered_inode_tree *tree = &BTRFS_I(inode)->ordered_tree;
Chris Masondbe674a2008-07-17 12:54:05 -0400964 u64 disk_i_size;
965 u64 new_i_size;
Yan, Zhengc2167752009-11-12 09:34:21 +0000966 u64 i_size = i_size_read(inode);
Chris Masondbe674a2008-07-17 12:54:05 -0400967 struct rb_node *node;
Yan, Zhengc2167752009-11-12 09:34:21 +0000968 struct rb_node *prev = NULL;
Chris Masondbe674a2008-07-17 12:54:05 -0400969 struct btrfs_ordered_extent *test;
Yan, Zhengc2167752009-11-12 09:34:21 +0000970 int ret = 1;
Wang Xiaoguangc0d2f612016-06-22 09:57:01 +0800971 u64 orig_offset = offset;
Yan, Zhengc2167752009-11-12 09:34:21 +0000972
Josef Bacik5fd02042012-05-02 14:00:54 -0400973 spin_lock_irq(&tree->lock);
Josef Bacik77cef2e2013-08-29 13:57:21 -0400974 if (ordered) {
975 offset = entry_end(ordered);
976 if (test_bit(BTRFS_ORDERED_TRUNCATED, &ordered->flags))
977 offset = min(offset,
978 ordered->file_offset +
979 ordered->truncated_len);
980 } else {
981 offset = ALIGN(offset, BTRFS_I(inode)->root->sectorsize);
982 }
Chris Masondbe674a2008-07-17 12:54:05 -0400983 disk_i_size = BTRFS_I(inode)->disk_i_size;
984
Yan, Zhengc2167752009-11-12 09:34:21 +0000985 /* truncate file */
986 if (disk_i_size > i_size) {
Wang Xiaoguangc0d2f612016-06-22 09:57:01 +0800987 BTRFS_I(inode)->disk_i_size = orig_offset;
Yan, Zhengc2167752009-11-12 09:34:21 +0000988 ret = 0;
989 goto out;
990 }
991
Chris Masondbe674a2008-07-17 12:54:05 -0400992 /*
993 * if the disk i_size is already at the inode->i_size, or
994 * this ordered extent is inside the disk i_size, we're done
995 */
Josef Bacik5d1f4022013-01-30 14:17:31 -0500996 if (disk_i_size == i_size)
Chris Masondbe674a2008-07-17 12:54:05 -0400997 goto out;
Josef Bacik5d1f4022013-01-30 14:17:31 -0500998
999 /*
1000 * We still need to update disk_i_size if outstanding_isize is greater
1001 * than disk_i_size.
1002 */
1003 if (offset <= disk_i_size &&
1004 (!ordered || ordered->outstanding_isize <= disk_i_size))
1005 goto out;
Chris Masondbe674a2008-07-17 12:54:05 -04001006
1007 /*
Chris Masondbe674a2008-07-17 12:54:05 -04001008 * walk backward from this ordered extent to disk_i_size.
1009 * if we find an ordered extent then we can't update disk i_size
1010 * yet
1011 */
Yan, Zhengc2167752009-11-12 09:34:21 +00001012 if (ordered) {
1013 node = rb_prev(&ordered->rb_node);
1014 } else {
1015 prev = tree_search(tree, offset);
1016 /*
1017 * we insert file extents without involving ordered struct,
1018 * so there should be no ordered struct cover this offset
1019 */
1020 if (prev) {
1021 test = rb_entry(prev, struct btrfs_ordered_extent,
1022 rb_node);
1023 BUG_ON(offset_in_entry(test, offset));
1024 }
1025 node = prev;
1026 }
Josef Bacik5fd02042012-05-02 14:00:54 -04001027 for (; node; node = rb_prev(node)) {
Chris Masondbe674a2008-07-17 12:54:05 -04001028 test = rb_entry(node, struct btrfs_ordered_extent, rb_node);
Josef Bacik5fd02042012-05-02 14:00:54 -04001029
Adam Buchbinderbb7ab3b2016-03-04 11:23:12 -08001030 /* We treat this entry as if it doesn't exist */
Josef Bacik5fd02042012-05-02 14:00:54 -04001031 if (test_bit(BTRFS_ORDERED_UPDATED_ISIZE, &test->flags))
1032 continue;
Chris Masondbe674a2008-07-17 12:54:05 -04001033 if (test->file_offset + test->len <= disk_i_size)
1034 break;
Yan, Zhengc2167752009-11-12 09:34:21 +00001035 if (test->file_offset >= i_size)
Chris Masondbe674a2008-07-17 12:54:05 -04001036 break;
Josef Bacik59fe4f42013-01-30 14:31:31 -05001037 if (entry_end(test) > disk_i_size) {
Miao Xieb9a8cc52012-09-06 04:01:21 -06001038 /*
1039 * we don't update disk_i_size now, so record this
1040 * undealt i_size. Or we will not know the real
1041 * i_size.
1042 */
1043 if (test->outstanding_isize < offset)
1044 test->outstanding_isize = offset;
1045 if (ordered &&
1046 ordered->outstanding_isize >
1047 test->outstanding_isize)
1048 test->outstanding_isize =
1049 ordered->outstanding_isize;
Chris Masondbe674a2008-07-17 12:54:05 -04001050 goto out;
Miao Xieb9a8cc52012-09-06 04:01:21 -06001051 }
Chris Masondbe674a2008-07-17 12:54:05 -04001052 }
Yan, Zhengc2167752009-11-12 09:34:21 +00001053 new_i_size = min_t(u64, offset, i_size);
Chris Masondbe674a2008-07-17 12:54:05 -04001054
1055 /*
Miao Xieb9a8cc52012-09-06 04:01:21 -06001056 * Some ordered extents may completed before the current one, and
1057 * we hold the real i_size in ->outstanding_isize.
Chris Masondbe674a2008-07-17 12:54:05 -04001058 */
Miao Xieb9a8cc52012-09-06 04:01:21 -06001059 if (ordered && ordered->outstanding_isize > new_i_size)
1060 new_i_size = min_t(u64, ordered->outstanding_isize, i_size);
Chris Masondbe674a2008-07-17 12:54:05 -04001061 BTRFS_I(inode)->disk_i_size = new_i_size;
Yan, Zhengc2167752009-11-12 09:34:21 +00001062 ret = 0;
Chris Masondbe674a2008-07-17 12:54:05 -04001063out:
Yan, Zhengc2167752009-11-12 09:34:21 +00001064 /*
Josef Bacik5fd02042012-05-02 14:00:54 -04001065 * We need to do this because we can't remove ordered extents until
1066 * after the i_disk_size has been updated and then the inode has been
1067 * updated to reflect the change, so we need to tell anybody who finds
1068 * this ordered extent that we've already done all the real work, we
1069 * just haven't completed all the other work.
Yan, Zhengc2167752009-11-12 09:34:21 +00001070 */
1071 if (ordered)
Josef Bacik5fd02042012-05-02 14:00:54 -04001072 set_bit(BTRFS_ORDERED_UPDATED_ISIZE, &ordered->flags);
1073 spin_unlock_irq(&tree->lock);
Yan, Zhengc2167752009-11-12 09:34:21 +00001074 return ret;
Chris Masondbe674a2008-07-17 12:54:05 -04001075}
Chris Masonba1da2f2008-07-17 12:54:15 -04001076
Chris Masoneb84ae02008-07-17 13:53:27 -04001077/*
1078 * search the ordered extents for one corresponding to 'offset' and
1079 * try to find a checksum. This is used because we allow pages to
1080 * be reclaimed before their checksum is actually put into the btree
1081 */
Chris Masond20f7042008-12-08 16:58:54 -05001082int btrfs_find_ordered_sum(struct inode *inode, u64 offset, u64 disk_bytenr,
Miao Xiee4100d92013-04-05 07:20:56 +00001083 u32 *sum, int len)
Chris Masonba1da2f2008-07-17 12:54:15 -04001084{
1085 struct btrfs_ordered_sum *ordered_sum;
Chris Masonba1da2f2008-07-17 12:54:15 -04001086 struct btrfs_ordered_extent *ordered;
1087 struct btrfs_ordered_inode_tree *tree = &BTRFS_I(inode)->ordered_tree;
Chris Mason3edf7d32008-07-18 06:17:13 -04001088 unsigned long num_sectors;
1089 unsigned long i;
1090 u32 sectorsize = BTRFS_I(inode)->root->sectorsize;
Miao Xiee4100d92013-04-05 07:20:56 +00001091 int index = 0;
Chris Masonba1da2f2008-07-17 12:54:15 -04001092
1093 ordered = btrfs_lookup_ordered_extent(inode, offset);
1094 if (!ordered)
Miao Xiee4100d92013-04-05 07:20:56 +00001095 return 0;
Chris Masonba1da2f2008-07-17 12:54:15 -04001096
Josef Bacik5fd02042012-05-02 14:00:54 -04001097 spin_lock_irq(&tree->lock);
Qinghuang Fengc6e30872009-01-21 10:59:08 -05001098 list_for_each_entry_reverse(ordered_sum, &ordered->list, list) {
Miao Xiee4100d92013-04-05 07:20:56 +00001099 if (disk_bytenr >= ordered_sum->bytenr &&
1100 disk_bytenr < ordered_sum->bytenr + ordered_sum->len) {
1101 i = (disk_bytenr - ordered_sum->bytenr) >>
1102 inode->i_sb->s_blocksize_bits;
Miao Xiee4100d92013-04-05 07:20:56 +00001103 num_sectors = ordered_sum->len >>
1104 inode->i_sb->s_blocksize_bits;
Miao Xief51a4a12013-06-19 10:36:09 +08001105 num_sectors = min_t(int, len - index, num_sectors - i);
1106 memcpy(sum + index, ordered_sum->sums + i,
1107 num_sectors);
1108
1109 index += (int)num_sectors;
1110 if (index == len)
1111 goto out;
1112 disk_bytenr += num_sectors * sectorsize;
Chris Masonba1da2f2008-07-17 12:54:15 -04001113 }
1114 }
1115out:
Josef Bacik5fd02042012-05-02 14:00:54 -04001116 spin_unlock_irq(&tree->lock);
Chris Mason89642222008-07-24 09:41:53 -04001117 btrfs_put_ordered_extent(ordered);
Miao Xiee4100d92013-04-05 07:20:56 +00001118 return index;
Chris Masonba1da2f2008-07-17 12:54:15 -04001119}
1120
Miao Xie6352b912012-09-06 04:01:51 -06001121int __init ordered_data_init(void)
1122{
1123 btrfs_ordered_extent_cache = kmem_cache_create("btrfs_ordered_extent",
1124 sizeof(struct btrfs_ordered_extent), 0,
Nikolay Borisovfba4b692016-06-23 21:17:08 +03001125 SLAB_MEM_SPREAD,
Miao Xie6352b912012-09-06 04:01:51 -06001126 NULL);
1127 if (!btrfs_ordered_extent_cache)
1128 return -ENOMEM;
Miao Xie25287e02012-10-25 09:31:03 +00001129
Miao Xie6352b912012-09-06 04:01:51 -06001130 return 0;
1131}
1132
1133void ordered_data_exit(void)
1134{
Kinglong Mee5598e902016-01-29 21:36:35 +08001135 kmem_cache_destroy(btrfs_ordered_extent_cache);
Miao Xie6352b912012-09-06 04:01:51 -06001136}