Commit | Line | Data |
---|---|---|
6cbd5570 CM |
1 | /* |
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 | ||
39279cc3 CM |
19 | #include <linux/fs.h> |
20 | #include <linux/pagemap.h> | |
21 | #include <linux/highmem.h> | |
22 | #include <linux/time.h> | |
23 | #include <linux/init.h> | |
24 | #include <linux/string.h> | |
39279cc3 CM |
25 | #include <linux/backing-dev.h> |
26 | #include <linux/mpage.h> | |
2fe17c10 | 27 | #include <linux/falloc.h> |
39279cc3 CM |
28 | #include <linux/swap.h> |
29 | #include <linux/writeback.h> | |
30 | #include <linux/statfs.h> | |
31 | #include <linux/compat.h> | |
5a0e3ad6 | 32 | #include <linux/slab.h> |
55e301fd | 33 | #include <linux/btrfs.h> |
39279cc3 CM |
34 | #include "ctree.h" |
35 | #include "disk-io.h" | |
36 | #include "transaction.h" | |
37 | #include "btrfs_inode.h" | |
39279cc3 | 38 | #include "print-tree.h" |
e02119d5 CM |
39 | #include "tree-log.h" |
40 | #include "locking.h" | |
12fa8ec6 | 41 | #include "compat.h" |
2aaa6655 | 42 | #include "volumes.h" |
39279cc3 | 43 | |
9247f317 | 44 | static struct kmem_cache *btrfs_inode_defrag_cachep; |
4cb5300b CM |
45 | /* |
46 | * when auto defrag is enabled we | |
47 | * queue up these defrag structs to remember which | |
48 | * inodes need defragging passes | |
49 | */ | |
50 | struct inode_defrag { | |
51 | struct rb_node rb_node; | |
52 | /* objectid */ | |
53 | u64 ino; | |
54 | /* | |
55 | * transid where the defrag was added, we search for | |
56 | * extents newer than this | |
57 | */ | |
58 | u64 transid; | |
59 | ||
60 | /* root objectid */ | |
61 | u64 root; | |
62 | ||
63 | /* last offset we were able to defrag */ | |
64 | u64 last_offset; | |
65 | ||
66 | /* if we've wrapped around back to zero once already */ | |
67 | int cycled; | |
68 | }; | |
69 | ||
762f2263 MX |
70 | static int __compare_inode_defrag(struct inode_defrag *defrag1, |
71 | struct inode_defrag *defrag2) | |
72 | { | |
73 | if (defrag1->root > defrag2->root) | |
74 | return 1; | |
75 | else if (defrag1->root < defrag2->root) | |
76 | return -1; | |
77 | else if (defrag1->ino > defrag2->ino) | |
78 | return 1; | |
79 | else if (defrag1->ino < defrag2->ino) | |
80 | return -1; | |
81 | else | |
82 | return 0; | |
83 | } | |
84 | ||
4cb5300b CM |
85 | /* pop a record for an inode into the defrag tree. The lock |
86 | * must be held already | |
87 | * | |
88 | * If you're inserting a record for an older transid than an | |
89 | * existing record, the transid already in the tree is lowered | |
90 | * | |
91 | * If an existing record is found the defrag item you | |
92 | * pass in is freed | |
93 | */ | |
8ddc4734 | 94 | static int __btrfs_add_inode_defrag(struct inode *inode, |
4cb5300b CM |
95 | struct inode_defrag *defrag) |
96 | { | |
97 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
98 | struct inode_defrag *entry; | |
99 | struct rb_node **p; | |
100 | struct rb_node *parent = NULL; | |
762f2263 | 101 | int ret; |
4cb5300b CM |
102 | |
103 | p = &root->fs_info->defrag_inodes.rb_node; | |
104 | while (*p) { | |
105 | parent = *p; | |
106 | entry = rb_entry(parent, struct inode_defrag, rb_node); | |
107 | ||
762f2263 MX |
108 | ret = __compare_inode_defrag(defrag, entry); |
109 | if (ret < 0) | |
4cb5300b | 110 | p = &parent->rb_left; |
762f2263 | 111 | else if (ret > 0) |
4cb5300b CM |
112 | p = &parent->rb_right; |
113 | else { | |
114 | /* if we're reinserting an entry for | |
115 | * an old defrag run, make sure to | |
116 | * lower the transid of our existing record | |
117 | */ | |
118 | if (defrag->transid < entry->transid) | |
119 | entry->transid = defrag->transid; | |
120 | if (defrag->last_offset > entry->last_offset) | |
121 | entry->last_offset = defrag->last_offset; | |
8ddc4734 | 122 | return -EEXIST; |
4cb5300b CM |
123 | } |
124 | } | |
72ac3c0d | 125 | set_bit(BTRFS_INODE_IN_DEFRAG, &BTRFS_I(inode)->runtime_flags); |
4cb5300b CM |
126 | rb_link_node(&defrag->rb_node, parent, p); |
127 | rb_insert_color(&defrag->rb_node, &root->fs_info->defrag_inodes); | |
8ddc4734 MX |
128 | return 0; |
129 | } | |
4cb5300b | 130 | |
8ddc4734 MX |
131 | static inline int __need_auto_defrag(struct btrfs_root *root) |
132 | { | |
133 | if (!btrfs_test_opt(root, AUTO_DEFRAG)) | |
134 | return 0; | |
135 | ||
136 | if (btrfs_fs_closing(root->fs_info)) | |
137 | return 0; | |
4cb5300b | 138 | |
8ddc4734 | 139 | return 1; |
4cb5300b CM |
140 | } |
141 | ||
142 | /* | |
143 | * insert a defrag record for this inode if auto defrag is | |
144 | * enabled | |
145 | */ | |
146 | int btrfs_add_inode_defrag(struct btrfs_trans_handle *trans, | |
147 | struct inode *inode) | |
148 | { | |
149 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
150 | struct inode_defrag *defrag; | |
4cb5300b | 151 | u64 transid; |
8ddc4734 | 152 | int ret; |
4cb5300b | 153 | |
8ddc4734 | 154 | if (!__need_auto_defrag(root)) |
4cb5300b CM |
155 | return 0; |
156 | ||
72ac3c0d | 157 | if (test_bit(BTRFS_INODE_IN_DEFRAG, &BTRFS_I(inode)->runtime_flags)) |
4cb5300b CM |
158 | return 0; |
159 | ||
160 | if (trans) | |
161 | transid = trans->transid; | |
162 | else | |
163 | transid = BTRFS_I(inode)->root->last_trans; | |
164 | ||
9247f317 | 165 | defrag = kmem_cache_zalloc(btrfs_inode_defrag_cachep, GFP_NOFS); |
4cb5300b CM |
166 | if (!defrag) |
167 | return -ENOMEM; | |
168 | ||
a4689d2b | 169 | defrag->ino = btrfs_ino(inode); |
4cb5300b CM |
170 | defrag->transid = transid; |
171 | defrag->root = root->root_key.objectid; | |
172 | ||
173 | spin_lock(&root->fs_info->defrag_inodes_lock); | |
8ddc4734 MX |
174 | if (!test_bit(BTRFS_INODE_IN_DEFRAG, &BTRFS_I(inode)->runtime_flags)) { |
175 | /* | |
176 | * If we set IN_DEFRAG flag and evict the inode from memory, | |
177 | * and then re-read this inode, this new inode doesn't have | |
178 | * IN_DEFRAG flag. At the case, we may find the existed defrag. | |
179 | */ | |
180 | ret = __btrfs_add_inode_defrag(inode, defrag); | |
181 | if (ret) | |
182 | kmem_cache_free(btrfs_inode_defrag_cachep, defrag); | |
183 | } else { | |
9247f317 | 184 | kmem_cache_free(btrfs_inode_defrag_cachep, defrag); |
8ddc4734 | 185 | } |
4cb5300b | 186 | spin_unlock(&root->fs_info->defrag_inodes_lock); |
a0f98dde | 187 | return 0; |
4cb5300b CM |
188 | } |
189 | ||
190 | /* | |
8ddc4734 MX |
191 | * Requeue the defrag object. If there is a defrag object that points to |
192 | * the same inode in the tree, we will merge them together (by | |
193 | * __btrfs_add_inode_defrag()) and free the one that we want to requeue. | |
4cb5300b | 194 | */ |
48a3b636 ES |
195 | static void btrfs_requeue_inode_defrag(struct inode *inode, |
196 | struct inode_defrag *defrag) | |
8ddc4734 MX |
197 | { |
198 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
199 | int ret; | |
200 | ||
201 | if (!__need_auto_defrag(root)) | |
202 | goto out; | |
203 | ||
204 | /* | |
205 | * Here we don't check the IN_DEFRAG flag, because we need merge | |
206 | * them together. | |
207 | */ | |
208 | spin_lock(&root->fs_info->defrag_inodes_lock); | |
209 | ret = __btrfs_add_inode_defrag(inode, defrag); | |
210 | spin_unlock(&root->fs_info->defrag_inodes_lock); | |
211 | if (ret) | |
212 | goto out; | |
213 | return; | |
214 | out: | |
215 | kmem_cache_free(btrfs_inode_defrag_cachep, defrag); | |
216 | } | |
217 | ||
4cb5300b | 218 | /* |
26176e7c MX |
219 | * pick the defragable inode that we want, if it doesn't exist, we will get |
220 | * the next one. | |
4cb5300b | 221 | */ |
26176e7c MX |
222 | static struct inode_defrag * |
223 | btrfs_pick_defrag_inode(struct btrfs_fs_info *fs_info, u64 root, u64 ino) | |
4cb5300b CM |
224 | { |
225 | struct inode_defrag *entry = NULL; | |
762f2263 | 226 | struct inode_defrag tmp; |
4cb5300b CM |
227 | struct rb_node *p; |
228 | struct rb_node *parent = NULL; | |
762f2263 MX |
229 | int ret; |
230 | ||
231 | tmp.ino = ino; | |
232 | tmp.root = root; | |
4cb5300b | 233 | |
26176e7c MX |
234 | spin_lock(&fs_info->defrag_inodes_lock); |
235 | p = fs_info->defrag_inodes.rb_node; | |
4cb5300b CM |
236 | while (p) { |
237 | parent = p; | |
238 | entry = rb_entry(parent, struct inode_defrag, rb_node); | |
239 | ||
762f2263 MX |
240 | ret = __compare_inode_defrag(&tmp, entry); |
241 | if (ret < 0) | |
4cb5300b | 242 | p = parent->rb_left; |
762f2263 | 243 | else if (ret > 0) |
4cb5300b CM |
244 | p = parent->rb_right; |
245 | else | |
26176e7c | 246 | goto out; |
4cb5300b CM |
247 | } |
248 | ||
26176e7c MX |
249 | if (parent && __compare_inode_defrag(&tmp, entry) > 0) { |
250 | parent = rb_next(parent); | |
251 | if (parent) | |
4cb5300b | 252 | entry = rb_entry(parent, struct inode_defrag, rb_node); |
26176e7c MX |
253 | else |
254 | entry = NULL; | |
4cb5300b | 255 | } |
26176e7c MX |
256 | out: |
257 | if (entry) | |
258 | rb_erase(parent, &fs_info->defrag_inodes); | |
259 | spin_unlock(&fs_info->defrag_inodes_lock); | |
260 | return entry; | |
4cb5300b CM |
261 | } |
262 | ||
26176e7c | 263 | void btrfs_cleanup_defrag_inodes(struct btrfs_fs_info *fs_info) |
4cb5300b CM |
264 | { |
265 | struct inode_defrag *defrag; | |
26176e7c MX |
266 | struct rb_node *node; |
267 | ||
268 | spin_lock(&fs_info->defrag_inodes_lock); | |
269 | node = rb_first(&fs_info->defrag_inodes); | |
270 | while (node) { | |
271 | rb_erase(node, &fs_info->defrag_inodes); | |
272 | defrag = rb_entry(node, struct inode_defrag, rb_node); | |
273 | kmem_cache_free(btrfs_inode_defrag_cachep, defrag); | |
274 | ||
275 | if (need_resched()) { | |
276 | spin_unlock(&fs_info->defrag_inodes_lock); | |
277 | cond_resched(); | |
278 | spin_lock(&fs_info->defrag_inodes_lock); | |
279 | } | |
280 | ||
281 | node = rb_first(&fs_info->defrag_inodes); | |
282 | } | |
283 | spin_unlock(&fs_info->defrag_inodes_lock); | |
284 | } | |
285 | ||
286 | #define BTRFS_DEFRAG_BATCH 1024 | |
287 | ||
288 | static int __btrfs_run_defrag_inode(struct btrfs_fs_info *fs_info, | |
289 | struct inode_defrag *defrag) | |
290 | { | |
4cb5300b CM |
291 | struct btrfs_root *inode_root; |
292 | struct inode *inode; | |
4cb5300b CM |
293 | struct btrfs_key key; |
294 | struct btrfs_ioctl_defrag_range_args range; | |
4cb5300b | 295 | int num_defrag; |
6f1c3605 LB |
296 | int index; |
297 | int ret; | |
4cb5300b | 298 | |
26176e7c MX |
299 | /* get the inode */ |
300 | key.objectid = defrag->root; | |
301 | btrfs_set_key_type(&key, BTRFS_ROOT_ITEM_KEY); | |
302 | key.offset = (u64)-1; | |
6f1c3605 LB |
303 | |
304 | index = srcu_read_lock(&fs_info->subvol_srcu); | |
305 | ||
26176e7c MX |
306 | inode_root = btrfs_read_fs_root_no_name(fs_info, &key); |
307 | if (IS_ERR(inode_root)) { | |
6f1c3605 LB |
308 | ret = PTR_ERR(inode_root); |
309 | goto cleanup; | |
310 | } | |
26176e7c MX |
311 | |
312 | key.objectid = defrag->ino; | |
313 | btrfs_set_key_type(&key, BTRFS_INODE_ITEM_KEY); | |
314 | key.offset = 0; | |
315 | inode = btrfs_iget(fs_info->sb, &key, inode_root, NULL); | |
316 | if (IS_ERR(inode)) { | |
6f1c3605 LB |
317 | ret = PTR_ERR(inode); |
318 | goto cleanup; | |
26176e7c | 319 | } |
6f1c3605 | 320 | srcu_read_unlock(&fs_info->subvol_srcu, index); |
26176e7c MX |
321 | |
322 | /* do a chunk of defrag */ | |
323 | clear_bit(BTRFS_INODE_IN_DEFRAG, &BTRFS_I(inode)->runtime_flags); | |
4cb5300b CM |
324 | memset(&range, 0, sizeof(range)); |
325 | range.len = (u64)-1; | |
26176e7c | 326 | range.start = defrag->last_offset; |
b66f00da MX |
327 | |
328 | sb_start_write(fs_info->sb); | |
26176e7c MX |
329 | num_defrag = btrfs_defrag_file(inode, NULL, &range, defrag->transid, |
330 | BTRFS_DEFRAG_BATCH); | |
b66f00da | 331 | sb_end_write(fs_info->sb); |
26176e7c MX |
332 | /* |
333 | * if we filled the whole defrag batch, there | |
334 | * must be more work to do. Queue this defrag | |
335 | * again | |
336 | */ | |
337 | if (num_defrag == BTRFS_DEFRAG_BATCH) { | |
338 | defrag->last_offset = range.start; | |
339 | btrfs_requeue_inode_defrag(inode, defrag); | |
340 | } else if (defrag->last_offset && !defrag->cycled) { | |
341 | /* | |
342 | * we didn't fill our defrag batch, but | |
343 | * we didn't start at zero. Make sure we loop | |
344 | * around to the start of the file. | |
345 | */ | |
346 | defrag->last_offset = 0; | |
347 | defrag->cycled = 1; | |
348 | btrfs_requeue_inode_defrag(inode, defrag); | |
349 | } else { | |
350 | kmem_cache_free(btrfs_inode_defrag_cachep, defrag); | |
351 | } | |
352 | ||
353 | iput(inode); | |
354 | return 0; | |
6f1c3605 LB |
355 | cleanup: |
356 | srcu_read_unlock(&fs_info->subvol_srcu, index); | |
357 | kmem_cache_free(btrfs_inode_defrag_cachep, defrag); | |
358 | return ret; | |
26176e7c MX |
359 | } |
360 | ||
361 | /* | |
362 | * run through the list of inodes in the FS that need | |
363 | * defragging | |
364 | */ | |
365 | int btrfs_run_defrag_inodes(struct btrfs_fs_info *fs_info) | |
366 | { | |
367 | struct inode_defrag *defrag; | |
368 | u64 first_ino = 0; | |
369 | u64 root_objectid = 0; | |
4cb5300b CM |
370 | |
371 | atomic_inc(&fs_info->defrag_running); | |
4cb5300b | 372 | while(1) { |
dc81cdc5 MX |
373 | /* Pause the auto defragger. */ |
374 | if (test_bit(BTRFS_FS_STATE_REMOUNTING, | |
375 | &fs_info->fs_state)) | |
376 | break; | |
377 | ||
26176e7c MX |
378 | if (!__need_auto_defrag(fs_info->tree_root)) |
379 | break; | |
4cb5300b CM |
380 | |
381 | /* find an inode to defrag */ | |
26176e7c MX |
382 | defrag = btrfs_pick_defrag_inode(fs_info, root_objectid, |
383 | first_ino); | |
4cb5300b | 384 | if (!defrag) { |
26176e7c | 385 | if (root_objectid || first_ino) { |
762f2263 | 386 | root_objectid = 0; |
4cb5300b CM |
387 | first_ino = 0; |
388 | continue; | |
389 | } else { | |
390 | break; | |
391 | } | |
392 | } | |
393 | ||
4cb5300b | 394 | first_ino = defrag->ino + 1; |
762f2263 | 395 | root_objectid = defrag->root; |
4cb5300b | 396 | |
26176e7c | 397 | __btrfs_run_defrag_inode(fs_info, defrag); |
4cb5300b | 398 | } |
4cb5300b CM |
399 | atomic_dec(&fs_info->defrag_running); |
400 | ||
401 | /* | |
402 | * during unmount, we use the transaction_wait queue to | |
403 | * wait for the defragger to stop | |
404 | */ | |
405 | wake_up(&fs_info->transaction_wait); | |
406 | return 0; | |
407 | } | |
39279cc3 | 408 | |
d352ac68 CM |
409 | /* simple helper to fault in pages and copy. This should go away |
410 | * and be replaced with calls into generic code. | |
411 | */ | |
d397712b | 412 | static noinline int btrfs_copy_from_user(loff_t pos, int num_pages, |
d0215f3e | 413 | size_t write_bytes, |
a1b32a59 | 414 | struct page **prepared_pages, |
11c65dcc | 415 | struct iov_iter *i) |
39279cc3 | 416 | { |
914ee295 | 417 | size_t copied = 0; |
d0215f3e | 418 | size_t total_copied = 0; |
11c65dcc | 419 | int pg = 0; |
39279cc3 CM |
420 | int offset = pos & (PAGE_CACHE_SIZE - 1); |
421 | ||
11c65dcc | 422 | while (write_bytes > 0) { |
39279cc3 CM |
423 | size_t count = min_t(size_t, |
424 | PAGE_CACHE_SIZE - offset, write_bytes); | |
11c65dcc | 425 | struct page *page = prepared_pages[pg]; |
914ee295 XZ |
426 | /* |
427 | * Copy data from userspace to the current page | |
428 | * | |
429 | * Disable pagefault to avoid recursive lock since | |
430 | * the pages are already locked | |
431 | */ | |
432 | pagefault_disable(); | |
433 | copied = iov_iter_copy_from_user_atomic(page, i, offset, count); | |
434 | pagefault_enable(); | |
11c65dcc | 435 | |
39279cc3 CM |
436 | /* Flush processor's dcache for this page */ |
437 | flush_dcache_page(page); | |
31339acd CM |
438 | |
439 | /* | |
440 | * if we get a partial write, we can end up with | |
441 | * partially up to date pages. These add | |
442 | * a lot of complexity, so make sure they don't | |
443 | * happen by forcing this copy to be retried. | |
444 | * | |
445 | * The rest of the btrfs_file_write code will fall | |
446 | * back to page at a time copies after we return 0. | |
447 | */ | |
448 | if (!PageUptodate(page) && copied < count) | |
449 | copied = 0; | |
450 | ||
11c65dcc JB |
451 | iov_iter_advance(i, copied); |
452 | write_bytes -= copied; | |
914ee295 | 453 | total_copied += copied; |
39279cc3 | 454 | |
914ee295 | 455 | /* Return to btrfs_file_aio_write to fault page */ |
9f570b8d | 456 | if (unlikely(copied == 0)) |
914ee295 | 457 | break; |
11c65dcc JB |
458 | |
459 | if (unlikely(copied < PAGE_CACHE_SIZE - offset)) { | |
460 | offset += copied; | |
461 | } else { | |
462 | pg++; | |
463 | offset = 0; | |
464 | } | |
39279cc3 | 465 | } |
914ee295 | 466 | return total_copied; |
39279cc3 CM |
467 | } |
468 | ||
d352ac68 CM |
469 | /* |
470 | * unlocks pages after btrfs_file_write is done with them | |
471 | */ | |
48a3b636 | 472 | static void btrfs_drop_pages(struct page **pages, size_t num_pages) |
39279cc3 CM |
473 | { |
474 | size_t i; | |
475 | for (i = 0; i < num_pages; i++) { | |
d352ac68 CM |
476 | /* page checked is some magic around finding pages that |
477 | * have been modified without going through btrfs_set_page_dirty | |
478 | * clear it here | |
479 | */ | |
4a096752 | 480 | ClearPageChecked(pages[i]); |
39279cc3 CM |
481 | unlock_page(pages[i]); |
482 | mark_page_accessed(pages[i]); | |
483 | page_cache_release(pages[i]); | |
484 | } | |
485 | } | |
486 | ||
d352ac68 CM |
487 | /* |
488 | * after copy_from_user, pages need to be dirtied and we need to make | |
489 | * sure holes are created between the current EOF and the start of | |
490 | * any next extents (if required). | |
491 | * | |
492 | * this also makes the decision about creating an inline extent vs | |
493 | * doing real data extents, marking pages dirty and delalloc as required. | |
494 | */ | |
be1a12a0 | 495 | int btrfs_dirty_pages(struct btrfs_root *root, struct inode *inode, |
48a3b636 ES |
496 | struct page **pages, size_t num_pages, |
497 | loff_t pos, size_t write_bytes, | |
498 | struct extent_state **cached) | |
39279cc3 | 499 | { |
39279cc3 | 500 | int err = 0; |
a52d9a80 | 501 | int i; |
db94535d | 502 | u64 num_bytes; |
a52d9a80 CM |
503 | u64 start_pos; |
504 | u64 end_of_last_block; | |
505 | u64 end_pos = pos + write_bytes; | |
506 | loff_t isize = i_size_read(inode); | |
39279cc3 | 507 | |
5f39d397 | 508 | start_pos = pos & ~((u64)root->sectorsize - 1); |
fda2832f | 509 | num_bytes = ALIGN(write_bytes + pos - start_pos, root->sectorsize); |
39279cc3 | 510 | |
db94535d | 511 | end_of_last_block = start_pos + num_bytes - 1; |
2ac55d41 | 512 | err = btrfs_set_extent_delalloc(inode, start_pos, end_of_last_block, |
be1a12a0 | 513 | cached); |
d0215f3e JB |
514 | if (err) |
515 | return err; | |
9ed74f2d | 516 | |
c8b97818 CM |
517 | for (i = 0; i < num_pages; i++) { |
518 | struct page *p = pages[i]; | |
519 | SetPageUptodate(p); | |
520 | ClearPageChecked(p); | |
521 | set_page_dirty(p); | |
a52d9a80 | 522 | } |
9f570b8d JB |
523 | |
524 | /* | |
525 | * we've only changed i_size in ram, and we haven't updated | |
526 | * the disk i_size. There is no need to log the inode | |
527 | * at this time. | |
528 | */ | |
529 | if (end_pos > isize) | |
a52d9a80 | 530 | i_size_write(inode, end_pos); |
a22285a6 | 531 | return 0; |
39279cc3 CM |
532 | } |
533 | ||
d352ac68 CM |
534 | /* |
535 | * this drops all the extents in the cache that intersect the range | |
536 | * [start, end]. Existing extents are split as required. | |
537 | */ | |
7014cdb4 JB |
538 | void btrfs_drop_extent_cache(struct inode *inode, u64 start, u64 end, |
539 | int skip_pinned) | |
a52d9a80 CM |
540 | { |
541 | struct extent_map *em; | |
3b951516 CM |
542 | struct extent_map *split = NULL; |
543 | struct extent_map *split2 = NULL; | |
a52d9a80 | 544 | struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; |
39b5637f | 545 | u64 len = end - start + 1; |
5dc562c5 | 546 | u64 gen; |
3b951516 CM |
547 | int ret; |
548 | int testend = 1; | |
5b21f2ed | 549 | unsigned long flags; |
c8b97818 | 550 | int compressed = 0; |
09a2a8f9 | 551 | bool modified; |
a52d9a80 | 552 | |
e6dcd2dc | 553 | WARN_ON(end < start); |
3b951516 | 554 | if (end == (u64)-1) { |
39b5637f | 555 | len = (u64)-1; |
3b951516 CM |
556 | testend = 0; |
557 | } | |
d397712b | 558 | while (1) { |
7014cdb4 JB |
559 | int no_splits = 0; |
560 | ||
09a2a8f9 | 561 | modified = false; |
3b951516 | 562 | if (!split) |
172ddd60 | 563 | split = alloc_extent_map(); |
3b951516 | 564 | if (!split2) |
172ddd60 | 565 | split2 = alloc_extent_map(); |
7014cdb4 JB |
566 | if (!split || !split2) |
567 | no_splits = 1; | |
3b951516 | 568 | |
890871be | 569 | write_lock(&em_tree->lock); |
39b5637f | 570 | em = lookup_extent_mapping(em_tree, start, len); |
d1310b2e | 571 | if (!em) { |
890871be | 572 | write_unlock(&em_tree->lock); |
a52d9a80 | 573 | break; |
d1310b2e | 574 | } |
5b21f2ed | 575 | flags = em->flags; |
5dc562c5 | 576 | gen = em->generation; |
5b21f2ed | 577 | if (skip_pinned && test_bit(EXTENT_FLAG_PINNED, &em->flags)) { |
55ef6899 | 578 | if (testend && em->start + em->len >= start + len) { |
5b21f2ed | 579 | free_extent_map(em); |
a1ed835e | 580 | write_unlock(&em_tree->lock); |
5b21f2ed ZY |
581 | break; |
582 | } | |
55ef6899 YZ |
583 | start = em->start + em->len; |
584 | if (testend) | |
5b21f2ed | 585 | len = start + len - (em->start + em->len); |
5b21f2ed | 586 | free_extent_map(em); |
a1ed835e | 587 | write_unlock(&em_tree->lock); |
5b21f2ed ZY |
588 | continue; |
589 | } | |
c8b97818 | 590 | compressed = test_bit(EXTENT_FLAG_COMPRESSED, &em->flags); |
3ce7e67a | 591 | clear_bit(EXTENT_FLAG_PINNED, &em->flags); |
3b277594 | 592 | clear_bit(EXTENT_FLAG_LOGGING, &flags); |
09a2a8f9 | 593 | modified = !list_empty(&em->list); |
a52d9a80 | 594 | remove_extent_mapping(em_tree, em); |
7014cdb4 JB |
595 | if (no_splits) |
596 | goto next; | |
3b951516 CM |
597 | |
598 | if (em->block_start < EXTENT_MAP_LAST_BYTE && | |
599 | em->start < start) { | |
600 | split->start = em->start; | |
601 | split->len = start - em->start; | |
ff5b7ee3 | 602 | split->orig_start = em->orig_start; |
3b951516 | 603 | split->block_start = em->block_start; |
c8b97818 CM |
604 | |
605 | if (compressed) | |
606 | split->block_len = em->block_len; | |
607 | else | |
608 | split->block_len = split->len; | |
cc95bef6 | 609 | split->ram_bytes = em->ram_bytes; |
b4939680 JB |
610 | split->orig_block_len = max(split->block_len, |
611 | em->orig_block_len); | |
5dc562c5 | 612 | split->generation = gen; |
3b951516 | 613 | split->bdev = em->bdev; |
5b21f2ed | 614 | split->flags = flags; |
261507a0 | 615 | split->compress_type = em->compress_type; |
09a2a8f9 | 616 | ret = add_extent_mapping(em_tree, split, modified); |
79787eaa | 617 | BUG_ON(ret); /* Logic error */ |
3b951516 CM |
618 | free_extent_map(split); |
619 | split = split2; | |
620 | split2 = NULL; | |
621 | } | |
622 | if (em->block_start < EXTENT_MAP_LAST_BYTE && | |
623 | testend && em->start + em->len > start + len) { | |
624 | u64 diff = start + len - em->start; | |
625 | ||
626 | split->start = start + len; | |
627 | split->len = em->start + em->len - (start + len); | |
628 | split->bdev = em->bdev; | |
5b21f2ed | 629 | split->flags = flags; |
261507a0 | 630 | split->compress_type = em->compress_type; |
5dc562c5 | 631 | split->generation = gen; |
b4939680 JB |
632 | split->orig_block_len = max(em->block_len, |
633 | em->orig_block_len); | |
cc95bef6 | 634 | split->ram_bytes = em->ram_bytes; |
3b951516 | 635 | |
c8b97818 CM |
636 | if (compressed) { |
637 | split->block_len = em->block_len; | |
638 | split->block_start = em->block_start; | |
445a6944 | 639 | split->orig_start = em->orig_start; |
c8b97818 CM |
640 | } else { |
641 | split->block_len = split->len; | |
642 | split->block_start = em->block_start + diff; | |
70c8a91c | 643 | split->orig_start = em->orig_start; |
c8b97818 | 644 | } |
3b951516 | 645 | |
09a2a8f9 | 646 | ret = add_extent_mapping(em_tree, split, modified); |
79787eaa | 647 | BUG_ON(ret); /* Logic error */ |
3b951516 CM |
648 | free_extent_map(split); |
649 | split = NULL; | |
650 | } | |
7014cdb4 | 651 | next: |
890871be | 652 | write_unlock(&em_tree->lock); |
d1310b2e | 653 | |
a52d9a80 CM |
654 | /* once for us */ |
655 | free_extent_map(em); | |
656 | /* once for the tree*/ | |
657 | free_extent_map(em); | |
658 | } | |
3b951516 CM |
659 | if (split) |
660 | free_extent_map(split); | |
661 | if (split2) | |
662 | free_extent_map(split2); | |
a52d9a80 CM |
663 | } |
664 | ||
39279cc3 CM |
665 | /* |
666 | * this is very complex, but the basic idea is to drop all extents | |
667 | * in the range start - end. hint_block is filled in with a block number | |
668 | * that would be a good hint to the block allocator for this file. | |
669 | * | |
670 | * If an extent intersects the range but is not entirely inside the range | |
671 | * it is either truncated or split. Anything entirely inside the range | |
672 | * is deleted from the tree. | |
673 | */ | |
5dc562c5 JB |
674 | int __btrfs_drop_extents(struct btrfs_trans_handle *trans, |
675 | struct btrfs_root *root, struct inode *inode, | |
676 | struct btrfs_path *path, u64 start, u64 end, | |
2aaa6655 | 677 | u64 *drop_end, int drop_cache) |
39279cc3 | 678 | { |
5f39d397 | 679 | struct extent_buffer *leaf; |
920bbbfb | 680 | struct btrfs_file_extent_item *fi; |
00f5c795 | 681 | struct btrfs_key key; |
920bbbfb | 682 | struct btrfs_key new_key; |
33345d01 | 683 | u64 ino = btrfs_ino(inode); |
920bbbfb YZ |
684 | u64 search_start = start; |
685 | u64 disk_bytenr = 0; | |
686 | u64 num_bytes = 0; | |
687 | u64 extent_offset = 0; | |
688 | u64 extent_end = 0; | |
689 | int del_nr = 0; | |
690 | int del_slot = 0; | |
691 | int extent_type; | |
ccd467d6 | 692 | int recow; |
00f5c795 | 693 | int ret; |
dc7fdde3 | 694 | int modify_tree = -1; |
5dc562c5 | 695 | int update_refs = (root->ref_cows || root == root->fs_info->tree_root); |
c3308f84 | 696 | int found = 0; |
39279cc3 | 697 | |
a1ed835e CM |
698 | if (drop_cache) |
699 | btrfs_drop_extent_cache(inode, start, end - 1, 0); | |
a52d9a80 | 700 | |
dc7fdde3 CM |
701 | if (start >= BTRFS_I(inode)->disk_i_size) |
702 | modify_tree = 0; | |
703 | ||
d397712b | 704 | while (1) { |
ccd467d6 | 705 | recow = 0; |
33345d01 | 706 | ret = btrfs_lookup_file_extent(trans, root, path, ino, |
dc7fdde3 | 707 | search_start, modify_tree); |
39279cc3 | 708 | if (ret < 0) |
920bbbfb YZ |
709 | break; |
710 | if (ret > 0 && path->slots[0] > 0 && search_start == start) { | |
711 | leaf = path->nodes[0]; | |
712 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0] - 1); | |
33345d01 | 713 | if (key.objectid == ino && |
920bbbfb YZ |
714 | key.type == BTRFS_EXTENT_DATA_KEY) |
715 | path->slots[0]--; | |
39279cc3 | 716 | } |
920bbbfb | 717 | ret = 0; |
8c2383c3 | 718 | next_slot: |
5f39d397 | 719 | leaf = path->nodes[0]; |
920bbbfb YZ |
720 | if (path->slots[0] >= btrfs_header_nritems(leaf)) { |
721 | BUG_ON(del_nr > 0); | |
722 | ret = btrfs_next_leaf(root, path); | |
723 | if (ret < 0) | |
724 | break; | |
725 | if (ret > 0) { | |
726 | ret = 0; | |
727 | break; | |
8c2383c3 | 728 | } |
920bbbfb YZ |
729 | leaf = path->nodes[0]; |
730 | recow = 1; | |
731 | } | |
732 | ||
733 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
33345d01 | 734 | if (key.objectid > ino || |
920bbbfb YZ |
735 | key.type > BTRFS_EXTENT_DATA_KEY || key.offset >= end) |
736 | break; | |
737 | ||
738 | fi = btrfs_item_ptr(leaf, path->slots[0], | |
739 | struct btrfs_file_extent_item); | |
740 | extent_type = btrfs_file_extent_type(leaf, fi); | |
741 | ||
742 | if (extent_type == BTRFS_FILE_EXTENT_REG || | |
743 | extent_type == BTRFS_FILE_EXTENT_PREALLOC) { | |
744 | disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); | |
745 | num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi); | |
746 | extent_offset = btrfs_file_extent_offset(leaf, fi); | |
747 | extent_end = key.offset + | |
748 | btrfs_file_extent_num_bytes(leaf, fi); | |
749 | } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) { | |
750 | extent_end = key.offset + | |
751 | btrfs_file_extent_inline_len(leaf, fi); | |
8c2383c3 | 752 | } else { |
920bbbfb | 753 | WARN_ON(1); |
8c2383c3 | 754 | extent_end = search_start; |
39279cc3 CM |
755 | } |
756 | ||
920bbbfb YZ |
757 | if (extent_end <= search_start) { |
758 | path->slots[0]++; | |
8c2383c3 | 759 | goto next_slot; |
39279cc3 CM |
760 | } |
761 | ||
c3308f84 | 762 | found = 1; |
920bbbfb | 763 | search_start = max(key.offset, start); |
dc7fdde3 CM |
764 | if (recow || !modify_tree) { |
765 | modify_tree = -1; | |
b3b4aa74 | 766 | btrfs_release_path(path); |
920bbbfb | 767 | continue; |
39279cc3 | 768 | } |
6643558d | 769 | |
920bbbfb YZ |
770 | /* |
771 | * | - range to drop - | | |
772 | * | -------- extent -------- | | |
773 | */ | |
774 | if (start > key.offset && end < extent_end) { | |
775 | BUG_ON(del_nr > 0); | |
776 | BUG_ON(extent_type == BTRFS_FILE_EXTENT_INLINE); | |
777 | ||
778 | memcpy(&new_key, &key, sizeof(new_key)); | |
779 | new_key.offset = start; | |
780 | ret = btrfs_duplicate_item(trans, root, path, | |
781 | &new_key); | |
782 | if (ret == -EAGAIN) { | |
b3b4aa74 | 783 | btrfs_release_path(path); |
920bbbfb | 784 | continue; |
6643558d | 785 | } |
920bbbfb YZ |
786 | if (ret < 0) |
787 | break; | |
788 | ||
789 | leaf = path->nodes[0]; | |
790 | fi = btrfs_item_ptr(leaf, path->slots[0] - 1, | |
791 | struct btrfs_file_extent_item); | |
792 | btrfs_set_file_extent_num_bytes(leaf, fi, | |
793 | start - key.offset); | |
794 | ||
795 | fi = btrfs_item_ptr(leaf, path->slots[0], | |
796 | struct btrfs_file_extent_item); | |
797 | ||
798 | extent_offset += start - key.offset; | |
799 | btrfs_set_file_extent_offset(leaf, fi, extent_offset); | |
800 | btrfs_set_file_extent_num_bytes(leaf, fi, | |
801 | extent_end - start); | |
802 | btrfs_mark_buffer_dirty(leaf); | |
803 | ||
5dc562c5 | 804 | if (update_refs && disk_bytenr > 0) { |
771ed689 | 805 | ret = btrfs_inc_extent_ref(trans, root, |
920bbbfb YZ |
806 | disk_bytenr, num_bytes, 0, |
807 | root->root_key.objectid, | |
808 | new_key.objectid, | |
66d7e7f0 | 809 | start - extent_offset, 0); |
79787eaa | 810 | BUG_ON(ret); /* -ENOMEM */ |
771ed689 | 811 | } |
920bbbfb | 812 | key.offset = start; |
6643558d | 813 | } |
920bbbfb YZ |
814 | /* |
815 | * | ---- range to drop ----- | | |
816 | * | -------- extent -------- | | |
817 | */ | |
818 | if (start <= key.offset && end < extent_end) { | |
819 | BUG_ON(extent_type == BTRFS_FILE_EXTENT_INLINE); | |
6643558d | 820 | |
920bbbfb YZ |
821 | memcpy(&new_key, &key, sizeof(new_key)); |
822 | new_key.offset = end; | |
afe5fea7 | 823 | btrfs_set_item_key_safe(root, path, &new_key); |
6643558d | 824 | |
920bbbfb YZ |
825 | extent_offset += end - key.offset; |
826 | btrfs_set_file_extent_offset(leaf, fi, extent_offset); | |
827 | btrfs_set_file_extent_num_bytes(leaf, fi, | |
828 | extent_end - end); | |
829 | btrfs_mark_buffer_dirty(leaf); | |
2671485d | 830 | if (update_refs && disk_bytenr > 0) |
920bbbfb | 831 | inode_sub_bytes(inode, end - key.offset); |
920bbbfb | 832 | break; |
39279cc3 | 833 | } |
771ed689 | 834 | |
920bbbfb YZ |
835 | search_start = extent_end; |
836 | /* | |
837 | * | ---- range to drop ----- | | |
838 | * | -------- extent -------- | | |
839 | */ | |
840 | if (start > key.offset && end >= extent_end) { | |
841 | BUG_ON(del_nr > 0); | |
842 | BUG_ON(extent_type == BTRFS_FILE_EXTENT_INLINE); | |
8c2383c3 | 843 | |
920bbbfb YZ |
844 | btrfs_set_file_extent_num_bytes(leaf, fi, |
845 | start - key.offset); | |
846 | btrfs_mark_buffer_dirty(leaf); | |
2671485d | 847 | if (update_refs && disk_bytenr > 0) |
920bbbfb | 848 | inode_sub_bytes(inode, extent_end - start); |
920bbbfb YZ |
849 | if (end == extent_end) |
850 | break; | |
c8b97818 | 851 | |
920bbbfb YZ |
852 | path->slots[0]++; |
853 | goto next_slot; | |
31840ae1 ZY |
854 | } |
855 | ||
920bbbfb YZ |
856 | /* |
857 | * | ---- range to drop ----- | | |
858 | * | ------ extent ------ | | |
859 | */ | |
860 | if (start <= key.offset && end >= extent_end) { | |
861 | if (del_nr == 0) { | |
862 | del_slot = path->slots[0]; | |
863 | del_nr = 1; | |
864 | } else { | |
865 | BUG_ON(del_slot + del_nr != path->slots[0]); | |
866 | del_nr++; | |
867 | } | |
31840ae1 | 868 | |
5dc562c5 JB |
869 | if (update_refs && |
870 | extent_type == BTRFS_FILE_EXTENT_INLINE) { | |
a76a3cd4 | 871 | inode_sub_bytes(inode, |
920bbbfb YZ |
872 | extent_end - key.offset); |
873 | extent_end = ALIGN(extent_end, | |
874 | root->sectorsize); | |
5dc562c5 | 875 | } else if (update_refs && disk_bytenr > 0) { |
31840ae1 | 876 | ret = btrfs_free_extent(trans, root, |
920bbbfb YZ |
877 | disk_bytenr, num_bytes, 0, |
878 | root->root_key.objectid, | |
5d4f98a2 | 879 | key.objectid, key.offset - |
66d7e7f0 | 880 | extent_offset, 0); |
79787eaa | 881 | BUG_ON(ret); /* -ENOMEM */ |
920bbbfb YZ |
882 | inode_sub_bytes(inode, |
883 | extent_end - key.offset); | |
31840ae1 | 884 | } |
31840ae1 | 885 | |
920bbbfb YZ |
886 | if (end == extent_end) |
887 | break; | |
888 | ||
889 | if (path->slots[0] + 1 < btrfs_header_nritems(leaf)) { | |
890 | path->slots[0]++; | |
891 | goto next_slot; | |
892 | } | |
893 | ||
894 | ret = btrfs_del_items(trans, root, path, del_slot, | |
895 | del_nr); | |
79787eaa JM |
896 | if (ret) { |
897 | btrfs_abort_transaction(trans, root, ret); | |
5dc562c5 | 898 | break; |
79787eaa | 899 | } |
920bbbfb YZ |
900 | |
901 | del_nr = 0; | |
902 | del_slot = 0; | |
903 | ||
b3b4aa74 | 904 | btrfs_release_path(path); |
920bbbfb | 905 | continue; |
39279cc3 | 906 | } |
920bbbfb YZ |
907 | |
908 | BUG_ON(1); | |
39279cc3 | 909 | } |
920bbbfb | 910 | |
79787eaa | 911 | if (!ret && del_nr > 0) { |
920bbbfb | 912 | ret = btrfs_del_items(trans, root, path, del_slot, del_nr); |
79787eaa JM |
913 | if (ret) |
914 | btrfs_abort_transaction(trans, root, ret); | |
6643558d | 915 | } |
920bbbfb | 916 | |
2aaa6655 | 917 | if (drop_end) |
c3308f84 | 918 | *drop_end = found ? min(end, extent_end) : end; |
5dc562c5 JB |
919 | btrfs_release_path(path); |
920 | return ret; | |
921 | } | |
922 | ||
923 | int btrfs_drop_extents(struct btrfs_trans_handle *trans, | |
924 | struct btrfs_root *root, struct inode *inode, u64 start, | |
2671485d | 925 | u64 end, int drop_cache) |
5dc562c5 JB |
926 | { |
927 | struct btrfs_path *path; | |
928 | int ret; | |
929 | ||
930 | path = btrfs_alloc_path(); | |
931 | if (!path) | |
932 | return -ENOMEM; | |
2aaa6655 | 933 | ret = __btrfs_drop_extents(trans, root, inode, path, start, end, NULL, |
2671485d | 934 | drop_cache); |
920bbbfb | 935 | btrfs_free_path(path); |
39279cc3 CM |
936 | return ret; |
937 | } | |
938 | ||
d899e052 | 939 | static int extent_mergeable(struct extent_buffer *leaf, int slot, |
6c7d54ac YZ |
940 | u64 objectid, u64 bytenr, u64 orig_offset, |
941 | u64 *start, u64 *end) | |
d899e052 YZ |
942 | { |
943 | struct btrfs_file_extent_item *fi; | |
944 | struct btrfs_key key; | |
945 | u64 extent_end; | |
946 | ||
947 | if (slot < 0 || slot >= btrfs_header_nritems(leaf)) | |
948 | return 0; | |
949 | ||
950 | btrfs_item_key_to_cpu(leaf, &key, slot); | |
951 | if (key.objectid != objectid || key.type != BTRFS_EXTENT_DATA_KEY) | |
952 | return 0; | |
953 | ||
954 | fi = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item); | |
955 | if (btrfs_file_extent_type(leaf, fi) != BTRFS_FILE_EXTENT_REG || | |
956 | btrfs_file_extent_disk_bytenr(leaf, fi) != bytenr || | |
6c7d54ac | 957 | btrfs_file_extent_offset(leaf, fi) != key.offset - orig_offset || |
d899e052 YZ |
958 | btrfs_file_extent_compression(leaf, fi) || |
959 | btrfs_file_extent_encryption(leaf, fi) || | |
960 | btrfs_file_extent_other_encoding(leaf, fi)) | |
961 | return 0; | |
962 | ||
963 | extent_end = key.offset + btrfs_file_extent_num_bytes(leaf, fi); | |
964 | if ((*start && *start != key.offset) || (*end && *end != extent_end)) | |
965 | return 0; | |
966 | ||
967 | *start = key.offset; | |
968 | *end = extent_end; | |
969 | return 1; | |
970 | } | |
971 | ||
972 | /* | |
973 | * Mark extent in the range start - end as written. | |
974 | * | |
975 | * This changes extent type from 'pre-allocated' to 'regular'. If only | |
976 | * part of extent is marked as written, the extent will be split into | |
977 | * two or three. | |
978 | */ | |
979 | int btrfs_mark_extent_written(struct btrfs_trans_handle *trans, | |
d899e052 YZ |
980 | struct inode *inode, u64 start, u64 end) |
981 | { | |
920bbbfb | 982 | struct btrfs_root *root = BTRFS_I(inode)->root; |
d899e052 YZ |
983 | struct extent_buffer *leaf; |
984 | struct btrfs_path *path; | |
985 | struct btrfs_file_extent_item *fi; | |
986 | struct btrfs_key key; | |
920bbbfb | 987 | struct btrfs_key new_key; |
d899e052 YZ |
988 | u64 bytenr; |
989 | u64 num_bytes; | |
990 | u64 extent_end; | |
5d4f98a2 | 991 | u64 orig_offset; |
d899e052 YZ |
992 | u64 other_start; |
993 | u64 other_end; | |
920bbbfb YZ |
994 | u64 split; |
995 | int del_nr = 0; | |
996 | int del_slot = 0; | |
6c7d54ac | 997 | int recow; |
d899e052 | 998 | int ret; |
33345d01 | 999 | u64 ino = btrfs_ino(inode); |
d899e052 | 1000 | |
d899e052 | 1001 | path = btrfs_alloc_path(); |
d8926bb3 MF |
1002 | if (!path) |
1003 | return -ENOMEM; | |
d899e052 | 1004 | again: |
6c7d54ac | 1005 | recow = 0; |
920bbbfb | 1006 | split = start; |
33345d01 | 1007 | key.objectid = ino; |
d899e052 | 1008 | key.type = BTRFS_EXTENT_DATA_KEY; |
920bbbfb | 1009 | key.offset = split; |
d899e052 YZ |
1010 | |
1011 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); | |
41415730 JB |
1012 | if (ret < 0) |
1013 | goto out; | |
d899e052 YZ |
1014 | if (ret > 0 && path->slots[0] > 0) |
1015 | path->slots[0]--; | |
1016 | ||
1017 | leaf = path->nodes[0]; | |
1018 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
33345d01 | 1019 | BUG_ON(key.objectid != ino || key.type != BTRFS_EXTENT_DATA_KEY); |
d899e052 YZ |
1020 | fi = btrfs_item_ptr(leaf, path->slots[0], |
1021 | struct btrfs_file_extent_item); | |
920bbbfb YZ |
1022 | BUG_ON(btrfs_file_extent_type(leaf, fi) != |
1023 | BTRFS_FILE_EXTENT_PREALLOC); | |
d899e052 YZ |
1024 | extent_end = key.offset + btrfs_file_extent_num_bytes(leaf, fi); |
1025 | BUG_ON(key.offset > start || extent_end < end); | |
1026 | ||
1027 | bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); | |
1028 | num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi); | |
5d4f98a2 | 1029 | orig_offset = key.offset - btrfs_file_extent_offset(leaf, fi); |
6c7d54ac YZ |
1030 | memcpy(&new_key, &key, sizeof(new_key)); |
1031 | ||
1032 | if (start == key.offset && end < extent_end) { | |
1033 | other_start = 0; | |
1034 | other_end = start; | |
1035 | if (extent_mergeable(leaf, path->slots[0] - 1, | |
33345d01 | 1036 | ino, bytenr, orig_offset, |
6c7d54ac YZ |
1037 | &other_start, &other_end)) { |
1038 | new_key.offset = end; | |
afe5fea7 | 1039 | btrfs_set_item_key_safe(root, path, &new_key); |
6c7d54ac YZ |
1040 | fi = btrfs_item_ptr(leaf, path->slots[0], |
1041 | struct btrfs_file_extent_item); | |
224ecce5 JB |
1042 | btrfs_set_file_extent_generation(leaf, fi, |
1043 | trans->transid); | |
6c7d54ac YZ |
1044 | btrfs_set_file_extent_num_bytes(leaf, fi, |
1045 | extent_end - end); | |
1046 | btrfs_set_file_extent_offset(leaf, fi, | |
1047 | end - orig_offset); | |
1048 | fi = btrfs_item_ptr(leaf, path->slots[0] - 1, | |
1049 | struct btrfs_file_extent_item); | |
224ecce5 JB |
1050 | btrfs_set_file_extent_generation(leaf, fi, |
1051 | trans->transid); | |
6c7d54ac YZ |
1052 | btrfs_set_file_extent_num_bytes(leaf, fi, |
1053 | end - other_start); | |
1054 | btrfs_mark_buffer_dirty(leaf); | |
1055 | goto out; | |
1056 | } | |
1057 | } | |
1058 | ||
1059 | if (start > key.offset && end == extent_end) { | |
1060 | other_start = end; | |
1061 | other_end = 0; | |
1062 | if (extent_mergeable(leaf, path->slots[0] + 1, | |
33345d01 | 1063 | ino, bytenr, orig_offset, |
6c7d54ac YZ |
1064 | &other_start, &other_end)) { |
1065 | fi = btrfs_item_ptr(leaf, path->slots[0], | |
1066 | struct btrfs_file_extent_item); | |
1067 | btrfs_set_file_extent_num_bytes(leaf, fi, | |
1068 | start - key.offset); | |
224ecce5 JB |
1069 | btrfs_set_file_extent_generation(leaf, fi, |
1070 | trans->transid); | |
6c7d54ac YZ |
1071 | path->slots[0]++; |
1072 | new_key.offset = start; | |
afe5fea7 | 1073 | btrfs_set_item_key_safe(root, path, &new_key); |
6c7d54ac YZ |
1074 | |
1075 | fi = btrfs_item_ptr(leaf, path->slots[0], | |
1076 | struct btrfs_file_extent_item); | |
224ecce5 JB |
1077 | btrfs_set_file_extent_generation(leaf, fi, |
1078 | trans->transid); | |
6c7d54ac YZ |
1079 | btrfs_set_file_extent_num_bytes(leaf, fi, |
1080 | other_end - start); | |
1081 | btrfs_set_file_extent_offset(leaf, fi, | |
1082 | start - orig_offset); | |
1083 | btrfs_mark_buffer_dirty(leaf); | |
1084 | goto out; | |
1085 | } | |
1086 | } | |
d899e052 | 1087 | |
920bbbfb YZ |
1088 | while (start > key.offset || end < extent_end) { |
1089 | if (key.offset == start) | |
1090 | split = end; | |
1091 | ||
920bbbfb YZ |
1092 | new_key.offset = split; |
1093 | ret = btrfs_duplicate_item(trans, root, path, &new_key); | |
1094 | if (ret == -EAGAIN) { | |
b3b4aa74 | 1095 | btrfs_release_path(path); |
920bbbfb | 1096 | goto again; |
d899e052 | 1097 | } |
79787eaa JM |
1098 | if (ret < 0) { |
1099 | btrfs_abort_transaction(trans, root, ret); | |
1100 | goto out; | |
1101 | } | |
d899e052 | 1102 | |
920bbbfb YZ |
1103 | leaf = path->nodes[0]; |
1104 | fi = btrfs_item_ptr(leaf, path->slots[0] - 1, | |
d899e052 | 1105 | struct btrfs_file_extent_item); |
224ecce5 | 1106 | btrfs_set_file_extent_generation(leaf, fi, trans->transid); |
d899e052 | 1107 | btrfs_set_file_extent_num_bytes(leaf, fi, |
920bbbfb YZ |
1108 | split - key.offset); |
1109 | ||
1110 | fi = btrfs_item_ptr(leaf, path->slots[0], | |
1111 | struct btrfs_file_extent_item); | |
1112 | ||
224ecce5 | 1113 | btrfs_set_file_extent_generation(leaf, fi, trans->transid); |
920bbbfb YZ |
1114 | btrfs_set_file_extent_offset(leaf, fi, split - orig_offset); |
1115 | btrfs_set_file_extent_num_bytes(leaf, fi, | |
1116 | extent_end - split); | |
d899e052 YZ |
1117 | btrfs_mark_buffer_dirty(leaf); |
1118 | ||
920bbbfb YZ |
1119 | ret = btrfs_inc_extent_ref(trans, root, bytenr, num_bytes, 0, |
1120 | root->root_key.objectid, | |
66d7e7f0 | 1121 | ino, orig_offset, 0); |
79787eaa | 1122 | BUG_ON(ret); /* -ENOMEM */ |
d899e052 | 1123 | |
920bbbfb YZ |
1124 | if (split == start) { |
1125 | key.offset = start; | |
1126 | } else { | |
1127 | BUG_ON(start != key.offset); | |
d899e052 | 1128 | path->slots[0]--; |
920bbbfb | 1129 | extent_end = end; |
d899e052 | 1130 | } |
6c7d54ac | 1131 | recow = 1; |
d899e052 YZ |
1132 | } |
1133 | ||
920bbbfb YZ |
1134 | other_start = end; |
1135 | other_end = 0; | |
6c7d54ac | 1136 | if (extent_mergeable(leaf, path->slots[0] + 1, |
33345d01 | 1137 | ino, bytenr, orig_offset, |
6c7d54ac YZ |
1138 | &other_start, &other_end)) { |
1139 | if (recow) { | |
b3b4aa74 | 1140 | btrfs_release_path(path); |
6c7d54ac YZ |
1141 | goto again; |
1142 | } | |
920bbbfb YZ |
1143 | extent_end = other_end; |
1144 | del_slot = path->slots[0] + 1; | |
1145 | del_nr++; | |
1146 | ret = btrfs_free_extent(trans, root, bytenr, num_bytes, | |
1147 | 0, root->root_key.objectid, | |
66d7e7f0 | 1148 | ino, orig_offset, 0); |
79787eaa | 1149 | BUG_ON(ret); /* -ENOMEM */ |
d899e052 | 1150 | } |
920bbbfb YZ |
1151 | other_start = 0; |
1152 | other_end = start; | |
6c7d54ac | 1153 | if (extent_mergeable(leaf, path->slots[0] - 1, |
33345d01 | 1154 | ino, bytenr, orig_offset, |
6c7d54ac YZ |
1155 | &other_start, &other_end)) { |
1156 | if (recow) { | |
b3b4aa74 | 1157 | btrfs_release_path(path); |
6c7d54ac YZ |
1158 | goto again; |
1159 | } | |
920bbbfb YZ |
1160 | key.offset = other_start; |
1161 | del_slot = path->slots[0]; | |
1162 | del_nr++; | |
1163 | ret = btrfs_free_extent(trans, root, bytenr, num_bytes, | |
1164 | 0, root->root_key.objectid, | |
66d7e7f0 | 1165 | ino, orig_offset, 0); |
79787eaa | 1166 | BUG_ON(ret); /* -ENOMEM */ |
920bbbfb YZ |
1167 | } |
1168 | if (del_nr == 0) { | |
3f6fae95 SL |
1169 | fi = btrfs_item_ptr(leaf, path->slots[0], |
1170 | struct btrfs_file_extent_item); | |
920bbbfb YZ |
1171 | btrfs_set_file_extent_type(leaf, fi, |
1172 | BTRFS_FILE_EXTENT_REG); | |
224ecce5 | 1173 | btrfs_set_file_extent_generation(leaf, fi, trans->transid); |
920bbbfb | 1174 | btrfs_mark_buffer_dirty(leaf); |
6c7d54ac | 1175 | } else { |
3f6fae95 SL |
1176 | fi = btrfs_item_ptr(leaf, del_slot - 1, |
1177 | struct btrfs_file_extent_item); | |
6c7d54ac YZ |
1178 | btrfs_set_file_extent_type(leaf, fi, |
1179 | BTRFS_FILE_EXTENT_REG); | |
224ecce5 | 1180 | btrfs_set_file_extent_generation(leaf, fi, trans->transid); |
6c7d54ac YZ |
1181 | btrfs_set_file_extent_num_bytes(leaf, fi, |
1182 | extent_end - key.offset); | |
1183 | btrfs_mark_buffer_dirty(leaf); | |
920bbbfb | 1184 | |
6c7d54ac | 1185 | ret = btrfs_del_items(trans, root, path, del_slot, del_nr); |
79787eaa JM |
1186 | if (ret < 0) { |
1187 | btrfs_abort_transaction(trans, root, ret); | |
1188 | goto out; | |
1189 | } | |
6c7d54ac | 1190 | } |
920bbbfb | 1191 | out: |
d899e052 YZ |
1192 | btrfs_free_path(path); |
1193 | return 0; | |
1194 | } | |
1195 | ||
b1bf862e CM |
1196 | /* |
1197 | * on error we return an unlocked page and the error value | |
1198 | * on success we return a locked page and 0 | |
1199 | */ | |
b6316429 JB |
1200 | static int prepare_uptodate_page(struct page *page, u64 pos, |
1201 | bool force_uptodate) | |
b1bf862e CM |
1202 | { |
1203 | int ret = 0; | |
1204 | ||
b6316429 JB |
1205 | if (((pos & (PAGE_CACHE_SIZE - 1)) || force_uptodate) && |
1206 | !PageUptodate(page)) { | |
b1bf862e CM |
1207 | ret = btrfs_readpage(NULL, page); |
1208 | if (ret) | |
1209 | return ret; | |
1210 | lock_page(page); | |
1211 | if (!PageUptodate(page)) { | |
1212 | unlock_page(page); | |
1213 | return -EIO; | |
1214 | } | |
1215 | } | |
1216 | return 0; | |
1217 | } | |
1218 | ||
39279cc3 | 1219 | /* |
d352ac68 CM |
1220 | * this gets pages into the page cache and locks them down, it also properly |
1221 | * waits for data=ordered extents to finish before allowing the pages to be | |
1222 | * modified. | |
39279cc3 | 1223 | */ |
d397712b | 1224 | static noinline int prepare_pages(struct btrfs_root *root, struct file *file, |
98ed5174 CM |
1225 | struct page **pages, size_t num_pages, |
1226 | loff_t pos, unsigned long first_index, | |
b6316429 | 1227 | size_t write_bytes, bool force_uptodate) |
39279cc3 | 1228 | { |
2ac55d41 | 1229 | struct extent_state *cached_state = NULL; |
39279cc3 CM |
1230 | int i; |
1231 | unsigned long index = pos >> PAGE_CACHE_SHIFT; | |
496ad9aa | 1232 | struct inode *inode = file_inode(file); |
3b16a4e3 | 1233 | gfp_t mask = btrfs_alloc_write_mask(inode->i_mapping); |
39279cc3 | 1234 | int err = 0; |
b1bf862e | 1235 | int faili = 0; |
8c2383c3 | 1236 | u64 start_pos; |
e6dcd2dc | 1237 | u64 last_pos; |
8c2383c3 | 1238 | |
5f39d397 | 1239 | start_pos = pos & ~((u64)root->sectorsize - 1); |
e6dcd2dc | 1240 | last_pos = ((u64)index + num_pages) << PAGE_CACHE_SHIFT; |
39279cc3 | 1241 | |
e6dcd2dc | 1242 | again: |
39279cc3 | 1243 | for (i = 0; i < num_pages; i++) { |
a94733d0 | 1244 | pages[i] = find_or_create_page(inode->i_mapping, index + i, |
e3a41a5b | 1245 | mask | __GFP_WRITE); |
39279cc3 | 1246 | if (!pages[i]) { |
b1bf862e CM |
1247 | faili = i - 1; |
1248 | err = -ENOMEM; | |
1249 | goto fail; | |
1250 | } | |
1251 | ||
1252 | if (i == 0) | |
b6316429 JB |
1253 | err = prepare_uptodate_page(pages[i], pos, |
1254 | force_uptodate); | |
b1bf862e CM |
1255 | if (i == num_pages - 1) |
1256 | err = prepare_uptodate_page(pages[i], | |
b6316429 | 1257 | pos + write_bytes, false); |
b1bf862e CM |
1258 | if (err) { |
1259 | page_cache_release(pages[i]); | |
1260 | faili = i - 1; | |
1261 | goto fail; | |
39279cc3 | 1262 | } |
ccd467d6 | 1263 | wait_on_page_writeback(pages[i]); |
39279cc3 | 1264 | } |
b1bf862e | 1265 | err = 0; |
0762704b | 1266 | if (start_pos < inode->i_size) { |
e6dcd2dc | 1267 | struct btrfs_ordered_extent *ordered; |
2ac55d41 | 1268 | lock_extent_bits(&BTRFS_I(inode)->io_tree, |
d0082371 | 1269 | start_pos, last_pos - 1, 0, &cached_state); |
d397712b CM |
1270 | ordered = btrfs_lookup_first_ordered_extent(inode, |
1271 | last_pos - 1); | |
e6dcd2dc CM |
1272 | if (ordered && |
1273 | ordered->file_offset + ordered->len > start_pos && | |
1274 | ordered->file_offset < last_pos) { | |
1275 | btrfs_put_ordered_extent(ordered); | |
2ac55d41 JB |
1276 | unlock_extent_cached(&BTRFS_I(inode)->io_tree, |
1277 | start_pos, last_pos - 1, | |
1278 | &cached_state, GFP_NOFS); | |
e6dcd2dc CM |
1279 | for (i = 0; i < num_pages; i++) { |
1280 | unlock_page(pages[i]); | |
1281 | page_cache_release(pages[i]); | |
1282 | } | |
1283 | btrfs_wait_ordered_range(inode, start_pos, | |
1284 | last_pos - start_pos); | |
1285 | goto again; | |
1286 | } | |
1287 | if (ordered) | |
1288 | btrfs_put_ordered_extent(ordered); | |
1289 | ||
2ac55d41 | 1290 | clear_extent_bit(&BTRFS_I(inode)->io_tree, start_pos, |
32c00aff | 1291 | last_pos - 1, EXTENT_DIRTY | EXTENT_DELALLOC | |
9e8a4a8b LB |
1292 | EXTENT_DO_ACCOUNTING | EXTENT_DEFRAG, |
1293 | 0, 0, &cached_state, GFP_NOFS); | |
2ac55d41 JB |
1294 | unlock_extent_cached(&BTRFS_I(inode)->io_tree, |
1295 | start_pos, last_pos - 1, &cached_state, | |
1296 | GFP_NOFS); | |
0762704b | 1297 | } |
e6dcd2dc | 1298 | for (i = 0; i < num_pages; i++) { |
32c7f202 WF |
1299 | if (clear_page_dirty_for_io(pages[i])) |
1300 | account_page_redirty(pages[i]); | |
e6dcd2dc CM |
1301 | set_page_extent_mapped(pages[i]); |
1302 | WARN_ON(!PageLocked(pages[i])); | |
1303 | } | |
39279cc3 | 1304 | return 0; |
b1bf862e CM |
1305 | fail: |
1306 | while (faili >= 0) { | |
1307 | unlock_page(pages[faili]); | |
1308 | page_cache_release(pages[faili]); | |
1309 | faili--; | |
1310 | } | |
1311 | return err; | |
1312 | ||
39279cc3 CM |
1313 | } |
1314 | ||
d0215f3e JB |
1315 | static noinline ssize_t __btrfs_buffered_write(struct file *file, |
1316 | struct iov_iter *i, | |
1317 | loff_t pos) | |
4b46fce2 | 1318 | { |
496ad9aa | 1319 | struct inode *inode = file_inode(file); |
11c65dcc | 1320 | struct btrfs_root *root = BTRFS_I(inode)->root; |
11c65dcc | 1321 | struct page **pages = NULL; |
39279cc3 | 1322 | unsigned long first_index; |
d0215f3e JB |
1323 | size_t num_written = 0; |
1324 | int nrptrs; | |
c9149235 | 1325 | int ret = 0; |
b6316429 | 1326 | bool force_page_uptodate = false; |
4b46fce2 | 1327 | |
d0215f3e | 1328 | nrptrs = min((iov_iter_count(i) + PAGE_CACHE_SIZE - 1) / |
11c65dcc JB |
1329 | PAGE_CACHE_SIZE, PAGE_CACHE_SIZE / |
1330 | (sizeof(struct page *))); | |
142349f5 WF |
1331 | nrptrs = min(nrptrs, current->nr_dirtied_pause - current->nr_dirtied); |
1332 | nrptrs = max(nrptrs, 8); | |
8c2383c3 | 1333 | pages = kmalloc(nrptrs * sizeof(struct page *), GFP_KERNEL); |
d0215f3e JB |
1334 | if (!pages) |
1335 | return -ENOMEM; | |
ab93dbec | 1336 | |
39279cc3 | 1337 | first_index = pos >> PAGE_CACHE_SHIFT; |
39279cc3 | 1338 | |
d0215f3e | 1339 | while (iov_iter_count(i) > 0) { |
39279cc3 | 1340 | size_t offset = pos & (PAGE_CACHE_SIZE - 1); |
d0215f3e | 1341 | size_t write_bytes = min(iov_iter_count(i), |
11c65dcc | 1342 | nrptrs * (size_t)PAGE_CACHE_SIZE - |
8c2383c3 | 1343 | offset); |
3a90983d YZ |
1344 | size_t num_pages = (write_bytes + offset + |
1345 | PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT; | |
d0215f3e JB |
1346 | size_t dirty_pages; |
1347 | size_t copied; | |
39279cc3 | 1348 | |
8c2383c3 | 1349 | WARN_ON(num_pages > nrptrs); |
1832a6d5 | 1350 | |
914ee295 XZ |
1351 | /* |
1352 | * Fault pages before locking them in prepare_pages | |
1353 | * to avoid recursive lock | |
1354 | */ | |
d0215f3e | 1355 | if (unlikely(iov_iter_fault_in_readable(i, write_bytes))) { |
914ee295 | 1356 | ret = -EFAULT; |
d0215f3e | 1357 | break; |
914ee295 XZ |
1358 | } |
1359 | ||
1360 | ret = btrfs_delalloc_reserve_space(inode, | |
1361 | num_pages << PAGE_CACHE_SHIFT); | |
1832a6d5 | 1362 | if (ret) |
d0215f3e | 1363 | break; |
1832a6d5 | 1364 | |
4a64001f JB |
1365 | /* |
1366 | * This is going to setup the pages array with the number of | |
1367 | * pages we want, so we don't really need to worry about the | |
1368 | * contents of pages from loop to loop | |
1369 | */ | |
39279cc3 | 1370 | ret = prepare_pages(root, file, pages, num_pages, |
b6316429 JB |
1371 | pos, first_index, write_bytes, |
1372 | force_page_uptodate); | |
6a63209f | 1373 | if (ret) { |
914ee295 XZ |
1374 | btrfs_delalloc_release_space(inode, |
1375 | num_pages << PAGE_CACHE_SHIFT); | |
d0215f3e | 1376 | break; |
6a63209f | 1377 | } |
39279cc3 | 1378 | |
914ee295 | 1379 | copied = btrfs_copy_from_user(pos, num_pages, |
d0215f3e | 1380 | write_bytes, pages, i); |
b1bf862e CM |
1381 | |
1382 | /* | |
1383 | * if we have trouble faulting in the pages, fall | |
1384 | * back to one page at a time | |
1385 | */ | |
1386 | if (copied < write_bytes) | |
1387 | nrptrs = 1; | |
1388 | ||
b6316429 JB |
1389 | if (copied == 0) { |
1390 | force_page_uptodate = true; | |
b1bf862e | 1391 | dirty_pages = 0; |
b6316429 JB |
1392 | } else { |
1393 | force_page_uptodate = false; | |
b1bf862e CM |
1394 | dirty_pages = (copied + offset + |
1395 | PAGE_CACHE_SIZE - 1) >> | |
1396 | PAGE_CACHE_SHIFT; | |
b6316429 | 1397 | } |
914ee295 | 1398 | |
d0215f3e JB |
1399 | /* |
1400 | * If we had a short copy we need to release the excess delaloc | |
1401 | * bytes we reserved. We need to increment outstanding_extents | |
1402 | * because btrfs_delalloc_release_space will decrement it, but | |
1403 | * we still have an outstanding extent for the chunk we actually | |
1404 | * managed to copy. | |
1405 | */ | |
914ee295 | 1406 | if (num_pages > dirty_pages) { |
9e0baf60 JB |
1407 | if (copied > 0) { |
1408 | spin_lock(&BTRFS_I(inode)->lock); | |
1409 | BTRFS_I(inode)->outstanding_extents++; | |
1410 | spin_unlock(&BTRFS_I(inode)->lock); | |
1411 | } | |
914ee295 XZ |
1412 | btrfs_delalloc_release_space(inode, |
1413 | (num_pages - dirty_pages) << | |
1414 | PAGE_CACHE_SHIFT); | |
1415 | } | |
1416 | ||
1417 | if (copied > 0) { | |
be1a12a0 JB |
1418 | ret = btrfs_dirty_pages(root, inode, pages, |
1419 | dirty_pages, pos, copied, | |
1420 | NULL); | |
d0215f3e JB |
1421 | if (ret) { |
1422 | btrfs_delalloc_release_space(inode, | |
1423 | dirty_pages << PAGE_CACHE_SHIFT); | |
1424 | btrfs_drop_pages(pages, num_pages); | |
1425 | break; | |
1426 | } | |
54aa1f4d | 1427 | } |
39279cc3 | 1428 | |
39279cc3 CM |
1429 | btrfs_drop_pages(pages, num_pages); |
1430 | ||
d0215f3e JB |
1431 | cond_resched(); |
1432 | ||
d0e1d66b | 1433 | balance_dirty_pages_ratelimited(inode->i_mapping); |
d0215f3e | 1434 | if (dirty_pages < (root->leafsize >> PAGE_CACHE_SHIFT) + 1) |
b53d3f5d | 1435 | btrfs_btree_balance_dirty(root); |
cb843a6f | 1436 | |
914ee295 XZ |
1437 | pos += copied; |
1438 | num_written += copied; | |
d0215f3e | 1439 | } |
39279cc3 | 1440 | |
d0215f3e JB |
1441 | kfree(pages); |
1442 | ||
1443 | return num_written ? num_written : ret; | |
1444 | } | |
1445 | ||
1446 | static ssize_t __btrfs_direct_write(struct kiocb *iocb, | |
1447 | const struct iovec *iov, | |
1448 | unsigned long nr_segs, loff_t pos, | |
1449 | loff_t *ppos, size_t count, size_t ocount) | |
1450 | { | |
1451 | struct file *file = iocb->ki_filp; | |
d0215f3e JB |
1452 | struct iov_iter i; |
1453 | ssize_t written; | |
1454 | ssize_t written_buffered; | |
1455 | loff_t endbyte; | |
1456 | int err; | |
1457 | ||
1458 | written = generic_file_direct_write(iocb, iov, &nr_segs, pos, ppos, | |
1459 | count, ocount); | |
1460 | ||
d0215f3e JB |
1461 | if (written < 0 || written == count) |
1462 | return written; | |
1463 | ||
1464 | pos += written; | |
1465 | count -= written; | |
1466 | iov_iter_init(&i, iov, nr_segs, count, written); | |
1467 | written_buffered = __btrfs_buffered_write(file, &i, pos); | |
1468 | if (written_buffered < 0) { | |
1469 | err = written_buffered; | |
1470 | goto out; | |
39279cc3 | 1471 | } |
d0215f3e JB |
1472 | endbyte = pos + written_buffered - 1; |
1473 | err = filemap_write_and_wait_range(file->f_mapping, pos, endbyte); | |
1474 | if (err) | |
1475 | goto out; | |
1476 | written += written_buffered; | |
1477 | *ppos = pos + written_buffered; | |
1478 | invalidate_mapping_pages(file->f_mapping, pos >> PAGE_CACHE_SHIFT, | |
1479 | endbyte >> PAGE_CACHE_SHIFT); | |
39279cc3 | 1480 | out: |
d0215f3e JB |
1481 | return written ? written : err; |
1482 | } | |
5b92ee72 | 1483 | |
6c760c07 JB |
1484 | static void update_time_for_write(struct inode *inode) |
1485 | { | |
1486 | struct timespec now; | |
1487 | ||
1488 | if (IS_NOCMTIME(inode)) | |
1489 | return; | |
1490 | ||
1491 | now = current_fs_time(inode->i_sb); | |
1492 | if (!timespec_equal(&inode->i_mtime, &now)) | |
1493 | inode->i_mtime = now; | |
1494 | ||
1495 | if (!timespec_equal(&inode->i_ctime, &now)) | |
1496 | inode->i_ctime = now; | |
1497 | ||
1498 | if (IS_I_VERSION(inode)) | |
1499 | inode_inc_iversion(inode); | |
1500 | } | |
1501 | ||
d0215f3e JB |
1502 | static ssize_t btrfs_file_aio_write(struct kiocb *iocb, |
1503 | const struct iovec *iov, | |
1504 | unsigned long nr_segs, loff_t pos) | |
1505 | { | |
1506 | struct file *file = iocb->ki_filp; | |
496ad9aa | 1507 | struct inode *inode = file_inode(file); |
d0215f3e JB |
1508 | struct btrfs_root *root = BTRFS_I(inode)->root; |
1509 | loff_t *ppos = &iocb->ki_pos; | |
0c1a98c8 | 1510 | u64 start_pos; |
d0215f3e JB |
1511 | ssize_t num_written = 0; |
1512 | ssize_t err = 0; | |
1513 | size_t count, ocount; | |
b812ce28 | 1514 | bool sync = (file->f_flags & O_DSYNC) || IS_SYNC(file->f_mapping->host); |
d0215f3e | 1515 | |
b2b5ef5c | 1516 | sb_start_write(inode->i_sb); |
d0215f3e JB |
1517 | |
1518 | mutex_lock(&inode->i_mutex); | |
1519 | ||
1520 | err = generic_segment_checks(iov, &nr_segs, &ocount, VERIFY_READ); | |
1521 | if (err) { | |
1522 | mutex_unlock(&inode->i_mutex); | |
1523 | goto out; | |
1524 | } | |
1525 | count = ocount; | |
1526 | ||
1527 | current->backing_dev_info = inode->i_mapping->backing_dev_info; | |
1528 | err = generic_write_checks(file, &pos, &count, S_ISBLK(inode->i_mode)); | |
1529 | if (err) { | |
1530 | mutex_unlock(&inode->i_mutex); | |
1531 | goto out; | |
1532 | } | |
1533 | ||
1534 | if (count == 0) { | |
1535 | mutex_unlock(&inode->i_mutex); | |
1536 | goto out; | |
1537 | } | |
1538 | ||
1539 | err = file_remove_suid(file); | |
1540 | if (err) { | |
1541 | mutex_unlock(&inode->i_mutex); | |
1542 | goto out; | |
1543 | } | |
1544 | ||
1545 | /* | |
1546 | * If BTRFS flips readonly due to some impossible error | |
1547 | * (fs_info->fs_state now has BTRFS_SUPER_FLAG_ERROR), | |
1548 | * although we have opened a file as writable, we have | |
1549 | * to stop this write operation to ensure FS consistency. | |
1550 | */ | |
87533c47 | 1551 | if (test_bit(BTRFS_FS_STATE_ERROR, &root->fs_info->fs_state)) { |
d0215f3e JB |
1552 | mutex_unlock(&inode->i_mutex); |
1553 | err = -EROFS; | |
1554 | goto out; | |
1555 | } | |
1556 | ||
6c760c07 JB |
1557 | /* |
1558 | * We reserve space for updating the inode when we reserve space for the | |
1559 | * extent we are going to write, so we will enospc out there. We don't | |
1560 | * need to start yet another transaction to update the inode as we will | |
1561 | * update the inode when we finish writing whatever data we write. | |
1562 | */ | |
1563 | update_time_for_write(inode); | |
d0215f3e | 1564 | |
0c1a98c8 MX |
1565 | start_pos = round_down(pos, root->sectorsize); |
1566 | if (start_pos > i_size_read(inode)) { | |
1567 | err = btrfs_cont_expand(inode, i_size_read(inode), start_pos); | |
1568 | if (err) { | |
1569 | mutex_unlock(&inode->i_mutex); | |
1570 | goto out; | |
1571 | } | |
1572 | } | |
1573 | ||
b812ce28 JB |
1574 | if (sync) |
1575 | atomic_inc(&BTRFS_I(inode)->sync_writers); | |
1576 | ||
d0215f3e JB |
1577 | if (unlikely(file->f_flags & O_DIRECT)) { |
1578 | num_written = __btrfs_direct_write(iocb, iov, nr_segs, | |
1579 | pos, ppos, count, ocount); | |
1580 | } else { | |
1581 | struct iov_iter i; | |
1582 | ||
1583 | iov_iter_init(&i, iov, nr_segs, count, num_written); | |
1584 | ||
1585 | num_written = __btrfs_buffered_write(file, &i, pos); | |
1586 | if (num_written > 0) | |
1587 | *ppos = pos + num_written; | |
1588 | } | |
1589 | ||
1590 | mutex_unlock(&inode->i_mutex); | |
2ff3e9b6 | 1591 | |
5a3f23d5 CM |
1592 | /* |
1593 | * we want to make sure fsync finds this change | |
1594 | * but we haven't joined a transaction running right now. | |
1595 | * | |
1596 | * Later on, someone is sure to update the inode and get the | |
1597 | * real transid recorded. | |
1598 | * | |
1599 | * We set last_trans now to the fs_info generation + 1, | |
1600 | * this will either be one more than the running transaction | |
1601 | * or the generation used for the next transaction if there isn't | |
1602 | * one running right now. | |
6c760c07 JB |
1603 | * |
1604 | * We also have to set last_sub_trans to the current log transid, | |
1605 | * otherwise subsequent syncs to a file that's been synced in this | |
1606 | * transaction will appear to have already occured. | |
5a3f23d5 CM |
1607 | */ |
1608 | BTRFS_I(inode)->last_trans = root->fs_info->generation + 1; | |
6c760c07 | 1609 | BTRFS_I(inode)->last_sub_trans = root->log_transid; |
d0215f3e JB |
1610 | if (num_written > 0 || num_written == -EIOCBQUEUED) { |
1611 | err = generic_write_sync(file, pos, num_written); | |
1612 | if (err < 0 && num_written > 0) | |
2ff3e9b6 CM |
1613 | num_written = err; |
1614 | } | |
0a3404dc | 1615 | |
b812ce28 JB |
1616 | if (sync) |
1617 | atomic_dec(&BTRFS_I(inode)->sync_writers); | |
0a3404dc | 1618 | out: |
b2b5ef5c | 1619 | sb_end_write(inode->i_sb); |
39279cc3 | 1620 | current->backing_dev_info = NULL; |
39279cc3 CM |
1621 | return num_written ? num_written : err; |
1622 | } | |
1623 | ||
d397712b | 1624 | int btrfs_release_file(struct inode *inode, struct file *filp) |
e1b81e67 | 1625 | { |
5a3f23d5 CM |
1626 | /* |
1627 | * ordered_data_close is set by settattr when we are about to truncate | |
1628 | * a file from a non-zero size to a zero size. This tries to | |
1629 | * flush down new bytes that may have been written if the | |
1630 | * application were using truncate to replace a file in place. | |
1631 | */ | |
72ac3c0d JB |
1632 | if (test_and_clear_bit(BTRFS_INODE_ORDERED_DATA_CLOSE, |
1633 | &BTRFS_I(inode)->runtime_flags)) { | |
569e0f35 JB |
1634 | struct btrfs_trans_handle *trans; |
1635 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
1636 | ||
1637 | /* | |
1638 | * We need to block on a committing transaction to keep us from | |
1639 | * throwing a ordered operation on to the list and causing | |
1640 | * something like sync to deadlock trying to flush out this | |
1641 | * inode. | |
1642 | */ | |
1643 | trans = btrfs_start_transaction(root, 0); | |
1644 | if (IS_ERR(trans)) | |
1645 | return PTR_ERR(trans); | |
1646 | btrfs_add_ordered_operation(trans, BTRFS_I(inode)->root, inode); | |
1647 | btrfs_end_transaction(trans, root); | |
5a3f23d5 CM |
1648 | if (inode->i_size > BTRFS_ORDERED_OPERATIONS_FLUSH_LIMIT) |
1649 | filemap_flush(inode->i_mapping); | |
1650 | } | |
6bf13c0c SW |
1651 | if (filp->private_data) |
1652 | btrfs_ioctl_trans_end(filp); | |
e1b81e67 M |
1653 | return 0; |
1654 | } | |
1655 | ||
d352ac68 CM |
1656 | /* |
1657 | * fsync call for both files and directories. This logs the inode into | |
1658 | * the tree log instead of forcing full commits whenever possible. | |
1659 | * | |
1660 | * It needs to call filemap_fdatawait so that all ordered extent updates are | |
1661 | * in the metadata btree are up to date for copying to the log. | |
1662 | * | |
1663 | * It drops the inode mutex before doing the tree log commit. This is an | |
1664 | * important optimization for directories because holding the mutex prevents | |
1665 | * new operations on the dir while we write to disk. | |
1666 | */ | |
02c24a82 | 1667 | int btrfs_sync_file(struct file *file, loff_t start, loff_t end, int datasync) |
39279cc3 | 1668 | { |
7ea80859 | 1669 | struct dentry *dentry = file->f_path.dentry; |
39279cc3 CM |
1670 | struct inode *inode = dentry->d_inode; |
1671 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
15ee9bc7 | 1672 | int ret = 0; |
39279cc3 | 1673 | struct btrfs_trans_handle *trans; |
2ab28f32 | 1674 | bool full_sync = 0; |
39279cc3 | 1675 | |
1abe9b8a | 1676 | trace_btrfs_sync_file(file, datasync); |
257c62e1 | 1677 | |
90abccf2 MX |
1678 | /* |
1679 | * We write the dirty pages in the range and wait until they complete | |
1680 | * out of the ->i_mutex. If so, we can flush the dirty pages by | |
2ab28f32 JB |
1681 | * multi-task, and make the performance up. See |
1682 | * btrfs_wait_ordered_range for an explanation of the ASYNC check. | |
90abccf2 | 1683 | */ |
b812ce28 | 1684 | atomic_inc(&BTRFS_I(inode)->sync_writers); |
2ab28f32 JB |
1685 | ret = filemap_fdatawrite_range(inode->i_mapping, start, end); |
1686 | if (!ret && test_bit(BTRFS_INODE_HAS_ASYNC_EXTENT, | |
1687 | &BTRFS_I(inode)->runtime_flags)) | |
1688 | ret = filemap_fdatawrite_range(inode->i_mapping, start, end); | |
b812ce28 | 1689 | atomic_dec(&BTRFS_I(inode)->sync_writers); |
90abccf2 MX |
1690 | if (ret) |
1691 | return ret; | |
1692 | ||
02c24a82 JB |
1693 | mutex_lock(&inode->i_mutex); |
1694 | ||
0885ef5b | 1695 | /* |
90abccf2 MX |
1696 | * We flush the dirty pages again to avoid some dirty pages in the |
1697 | * range being left. | |
0885ef5b | 1698 | */ |
2ecb7923 | 1699 | atomic_inc(&root->log_batch); |
2ab28f32 JB |
1700 | full_sync = test_bit(BTRFS_INODE_NEEDS_FULL_SYNC, |
1701 | &BTRFS_I(inode)->runtime_flags); | |
1702 | if (full_sync) | |
1703 | btrfs_wait_ordered_range(inode, start, end - start + 1); | |
2ecb7923 | 1704 | atomic_inc(&root->log_batch); |
257c62e1 | 1705 | |
39279cc3 | 1706 | /* |
15ee9bc7 JB |
1707 | * check the transaction that last modified this inode |
1708 | * and see if its already been committed | |
39279cc3 | 1709 | */ |
02c24a82 JB |
1710 | if (!BTRFS_I(inode)->last_trans) { |
1711 | mutex_unlock(&inode->i_mutex); | |
15ee9bc7 | 1712 | goto out; |
02c24a82 | 1713 | } |
a2135011 | 1714 | |
257c62e1 CM |
1715 | /* |
1716 | * if the last transaction that changed this file was before | |
1717 | * the current transaction, we can bail out now without any | |
1718 | * syncing | |
1719 | */ | |
a4abeea4 | 1720 | smp_mb(); |
22ee6985 JB |
1721 | if (btrfs_inode_in_log(inode, root->fs_info->generation) || |
1722 | BTRFS_I(inode)->last_trans <= | |
15ee9bc7 JB |
1723 | root->fs_info->last_trans_committed) { |
1724 | BTRFS_I(inode)->last_trans = 0; | |
5dc562c5 JB |
1725 | |
1726 | /* | |
1727 | * We'v had everything committed since the last time we were | |
1728 | * modified so clear this flag in case it was set for whatever | |
1729 | * reason, it's no longer relevant. | |
1730 | */ | |
1731 | clear_bit(BTRFS_INODE_NEEDS_FULL_SYNC, | |
1732 | &BTRFS_I(inode)->runtime_flags); | |
02c24a82 | 1733 | mutex_unlock(&inode->i_mutex); |
15ee9bc7 JB |
1734 | goto out; |
1735 | } | |
15ee9bc7 JB |
1736 | |
1737 | /* | |
a52d9a80 CM |
1738 | * ok we haven't committed the transaction yet, lets do a commit |
1739 | */ | |
6f902af4 | 1740 | if (file->private_data) |
6bf13c0c SW |
1741 | btrfs_ioctl_trans_end(file); |
1742 | ||
a22285a6 YZ |
1743 | trans = btrfs_start_transaction(root, 0); |
1744 | if (IS_ERR(trans)) { | |
1745 | ret = PTR_ERR(trans); | |
02c24a82 | 1746 | mutex_unlock(&inode->i_mutex); |
39279cc3 CM |
1747 | goto out; |
1748 | } | |
e02119d5 | 1749 | |
2cfbd50b | 1750 | ret = btrfs_log_dentry_safe(trans, root, dentry); |
02c24a82 JB |
1751 | if (ret < 0) { |
1752 | mutex_unlock(&inode->i_mutex); | |
e02119d5 | 1753 | goto out; |
02c24a82 | 1754 | } |
49eb7e46 CM |
1755 | |
1756 | /* we've logged all the items and now have a consistent | |
1757 | * version of the file in the log. It is possible that | |
1758 | * someone will come in and modify the file, but that's | |
1759 | * fine because the log is consistent on disk, and we | |
1760 | * have references to all of the file's extents | |
1761 | * | |
1762 | * It is possible that someone will come in and log the | |
1763 | * file again, but that will end up using the synchronization | |
1764 | * inside btrfs_sync_log to keep things safe. | |
1765 | */ | |
02c24a82 | 1766 | mutex_unlock(&inode->i_mutex); |
49eb7e46 | 1767 | |
257c62e1 CM |
1768 | if (ret != BTRFS_NO_LOG_SYNC) { |
1769 | if (ret > 0) { | |
2ab28f32 JB |
1770 | /* |
1771 | * If we didn't already wait for ordered extents we need | |
1772 | * to do that now. | |
1773 | */ | |
1774 | if (!full_sync) | |
1775 | btrfs_wait_ordered_range(inode, start, | |
1776 | end - start + 1); | |
12fcfd22 | 1777 | ret = btrfs_commit_transaction(trans, root); |
257c62e1 CM |
1778 | } else { |
1779 | ret = btrfs_sync_log(trans, root); | |
2ab28f32 | 1780 | if (ret == 0) { |
257c62e1 | 1781 | ret = btrfs_end_transaction(trans, root); |
2ab28f32 JB |
1782 | } else { |
1783 | if (!full_sync) | |
1784 | btrfs_wait_ordered_range(inode, start, | |
1785 | end - | |
1786 | start + 1); | |
257c62e1 | 1787 | ret = btrfs_commit_transaction(trans, root); |
2ab28f32 | 1788 | } |
257c62e1 CM |
1789 | } |
1790 | } else { | |
1791 | ret = btrfs_end_transaction(trans, root); | |
e02119d5 | 1792 | } |
39279cc3 | 1793 | out: |
014e4ac4 | 1794 | return ret > 0 ? -EIO : ret; |
39279cc3 CM |
1795 | } |
1796 | ||
f0f37e2f | 1797 | static const struct vm_operations_struct btrfs_file_vm_ops = { |
92fee66d | 1798 | .fault = filemap_fault, |
9ebefb18 | 1799 | .page_mkwrite = btrfs_page_mkwrite, |
0b173bc4 | 1800 | .remap_pages = generic_file_remap_pages, |
9ebefb18 CM |
1801 | }; |
1802 | ||
1803 | static int btrfs_file_mmap(struct file *filp, struct vm_area_struct *vma) | |
1804 | { | |
058a457e MX |
1805 | struct address_space *mapping = filp->f_mapping; |
1806 | ||
1807 | if (!mapping->a_ops->readpage) | |
1808 | return -ENOEXEC; | |
1809 | ||
9ebefb18 | 1810 | file_accessed(filp); |
058a457e | 1811 | vma->vm_ops = &btrfs_file_vm_ops; |
058a457e | 1812 | |
9ebefb18 CM |
1813 | return 0; |
1814 | } | |
1815 | ||
2aaa6655 JB |
1816 | static int hole_mergeable(struct inode *inode, struct extent_buffer *leaf, |
1817 | int slot, u64 start, u64 end) | |
1818 | { | |
1819 | struct btrfs_file_extent_item *fi; | |
1820 | struct btrfs_key key; | |
1821 | ||
1822 | if (slot < 0 || slot >= btrfs_header_nritems(leaf)) | |
1823 | return 0; | |
1824 | ||
1825 | btrfs_item_key_to_cpu(leaf, &key, slot); | |
1826 | if (key.objectid != btrfs_ino(inode) || | |
1827 | key.type != BTRFS_EXTENT_DATA_KEY) | |
1828 | return 0; | |
1829 | ||
1830 | fi = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item); | |
1831 | ||
1832 | if (btrfs_file_extent_type(leaf, fi) != BTRFS_FILE_EXTENT_REG) | |
1833 | return 0; | |
1834 | ||
1835 | if (btrfs_file_extent_disk_bytenr(leaf, fi)) | |
1836 | return 0; | |
1837 | ||
1838 | if (key.offset == end) | |
1839 | return 1; | |
1840 | if (key.offset + btrfs_file_extent_num_bytes(leaf, fi) == start) | |
1841 | return 1; | |
1842 | return 0; | |
1843 | } | |
1844 | ||
1845 | static int fill_holes(struct btrfs_trans_handle *trans, struct inode *inode, | |
1846 | struct btrfs_path *path, u64 offset, u64 end) | |
1847 | { | |
1848 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
1849 | struct extent_buffer *leaf; | |
1850 | struct btrfs_file_extent_item *fi; | |
1851 | struct extent_map *hole_em; | |
1852 | struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; | |
1853 | struct btrfs_key key; | |
1854 | int ret; | |
1855 | ||
1856 | key.objectid = btrfs_ino(inode); | |
1857 | key.type = BTRFS_EXTENT_DATA_KEY; | |
1858 | key.offset = offset; | |
1859 | ||
1860 | ||
1861 | ret = btrfs_search_slot(trans, root, &key, path, 0, 1); | |
1862 | if (ret < 0) | |
1863 | return ret; | |
1864 | BUG_ON(!ret); | |
1865 | ||
1866 | leaf = path->nodes[0]; | |
1867 | if (hole_mergeable(inode, leaf, path->slots[0]-1, offset, end)) { | |
1868 | u64 num_bytes; | |
1869 | ||
1870 | path->slots[0]--; | |
1871 | fi = btrfs_item_ptr(leaf, path->slots[0], | |
1872 | struct btrfs_file_extent_item); | |
1873 | num_bytes = btrfs_file_extent_num_bytes(leaf, fi) + | |
1874 | end - offset; | |
1875 | btrfs_set_file_extent_num_bytes(leaf, fi, num_bytes); | |
1876 | btrfs_set_file_extent_ram_bytes(leaf, fi, num_bytes); | |
1877 | btrfs_set_file_extent_offset(leaf, fi, 0); | |
1878 | btrfs_mark_buffer_dirty(leaf); | |
1879 | goto out; | |
1880 | } | |
1881 | ||
1882 | if (hole_mergeable(inode, leaf, path->slots[0]+1, offset, end)) { | |
1883 | u64 num_bytes; | |
1884 | ||
1885 | path->slots[0]++; | |
1886 | key.offset = offset; | |
afe5fea7 | 1887 | btrfs_set_item_key_safe(root, path, &key); |
2aaa6655 JB |
1888 | fi = btrfs_item_ptr(leaf, path->slots[0], |
1889 | struct btrfs_file_extent_item); | |
1890 | num_bytes = btrfs_file_extent_num_bytes(leaf, fi) + end - | |
1891 | offset; | |
1892 | btrfs_set_file_extent_num_bytes(leaf, fi, num_bytes); | |
1893 | btrfs_set_file_extent_ram_bytes(leaf, fi, num_bytes); | |
1894 | btrfs_set_file_extent_offset(leaf, fi, 0); | |
1895 | btrfs_mark_buffer_dirty(leaf); | |
1896 | goto out; | |
1897 | } | |
1898 | btrfs_release_path(path); | |
1899 | ||
1900 | ret = btrfs_insert_file_extent(trans, root, btrfs_ino(inode), offset, | |
1901 | 0, 0, end - offset, 0, end - offset, | |
1902 | 0, 0, 0); | |
1903 | if (ret) | |
1904 | return ret; | |
1905 | ||
1906 | out: | |
1907 | btrfs_release_path(path); | |
1908 | ||
1909 | hole_em = alloc_extent_map(); | |
1910 | if (!hole_em) { | |
1911 | btrfs_drop_extent_cache(inode, offset, end - 1, 0); | |
1912 | set_bit(BTRFS_INODE_NEEDS_FULL_SYNC, | |
1913 | &BTRFS_I(inode)->runtime_flags); | |
1914 | } else { | |
1915 | hole_em->start = offset; | |
1916 | hole_em->len = end - offset; | |
cc95bef6 | 1917 | hole_em->ram_bytes = hole_em->len; |
2aaa6655 JB |
1918 | hole_em->orig_start = offset; |
1919 | ||
1920 | hole_em->block_start = EXTENT_MAP_HOLE; | |
1921 | hole_em->block_len = 0; | |
b4939680 | 1922 | hole_em->orig_block_len = 0; |
2aaa6655 JB |
1923 | hole_em->bdev = root->fs_info->fs_devices->latest_bdev; |
1924 | hole_em->compress_type = BTRFS_COMPRESS_NONE; | |
1925 | hole_em->generation = trans->transid; | |
1926 | ||
1927 | do { | |
1928 | btrfs_drop_extent_cache(inode, offset, end - 1, 0); | |
1929 | write_lock(&em_tree->lock); | |
09a2a8f9 | 1930 | ret = add_extent_mapping(em_tree, hole_em, 1); |
2aaa6655 JB |
1931 | write_unlock(&em_tree->lock); |
1932 | } while (ret == -EEXIST); | |
1933 | free_extent_map(hole_em); | |
1934 | if (ret) | |
1935 | set_bit(BTRFS_INODE_NEEDS_FULL_SYNC, | |
1936 | &BTRFS_I(inode)->runtime_flags); | |
1937 | } | |
1938 | ||
1939 | return 0; | |
1940 | } | |
1941 | ||
1942 | static int btrfs_punch_hole(struct inode *inode, loff_t offset, loff_t len) | |
1943 | { | |
1944 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
1945 | struct extent_state *cached_state = NULL; | |
1946 | struct btrfs_path *path; | |
1947 | struct btrfs_block_rsv *rsv; | |
1948 | struct btrfs_trans_handle *trans; | |
0061280d MX |
1949 | u64 lockstart = round_up(offset, BTRFS_I(inode)->root->sectorsize); |
1950 | u64 lockend = round_down(offset + len, | |
1951 | BTRFS_I(inode)->root->sectorsize) - 1; | |
2aaa6655 JB |
1952 | u64 cur_offset = lockstart; |
1953 | u64 min_size = btrfs_calc_trunc_metadata_size(root, 1); | |
1954 | u64 drop_end; | |
2aaa6655 JB |
1955 | int ret = 0; |
1956 | int err = 0; | |
6347b3c4 MX |
1957 | bool same_page = ((offset >> PAGE_CACHE_SHIFT) == |
1958 | ((offset + len - 1) >> PAGE_CACHE_SHIFT)); | |
2aaa6655 JB |
1959 | |
1960 | btrfs_wait_ordered_range(inode, offset, len); | |
1961 | ||
1962 | mutex_lock(&inode->i_mutex); | |
7426cc04 MX |
1963 | /* |
1964 | * We needn't truncate any page which is beyond the end of the file | |
1965 | * because we are sure there is no data there. | |
1966 | */ | |
2aaa6655 JB |
1967 | /* |
1968 | * Only do this if we are in the same page and we aren't doing the | |
1969 | * entire page. | |
1970 | */ | |
1971 | if (same_page && len < PAGE_CACHE_SIZE) { | |
7426cc04 MX |
1972 | if (offset < round_up(inode->i_size, PAGE_CACHE_SIZE)) |
1973 | ret = btrfs_truncate_page(inode, offset, len, 0); | |
2aaa6655 JB |
1974 | mutex_unlock(&inode->i_mutex); |
1975 | return ret; | |
1976 | } | |
1977 | ||
1978 | /* zero back part of the first page */ | |
7426cc04 MX |
1979 | if (offset < round_up(inode->i_size, PAGE_CACHE_SIZE)) { |
1980 | ret = btrfs_truncate_page(inode, offset, 0, 0); | |
1981 | if (ret) { | |
1982 | mutex_unlock(&inode->i_mutex); | |
1983 | return ret; | |
1984 | } | |
2aaa6655 JB |
1985 | } |
1986 | ||
1987 | /* zero the front end of the last page */ | |
0061280d MX |
1988 | if (offset + len < round_up(inode->i_size, PAGE_CACHE_SIZE)) { |
1989 | ret = btrfs_truncate_page(inode, offset + len, 0, 1); | |
1990 | if (ret) { | |
1991 | mutex_unlock(&inode->i_mutex); | |
1992 | return ret; | |
1993 | } | |
2aaa6655 JB |
1994 | } |
1995 | ||
1996 | if (lockend < lockstart) { | |
1997 | mutex_unlock(&inode->i_mutex); | |
1998 | return 0; | |
1999 | } | |
2000 | ||
2001 | while (1) { | |
2002 | struct btrfs_ordered_extent *ordered; | |
2003 | ||
2004 | truncate_pagecache_range(inode, lockstart, lockend); | |
2005 | ||
2006 | lock_extent_bits(&BTRFS_I(inode)->io_tree, lockstart, lockend, | |
2007 | 0, &cached_state); | |
2008 | ordered = btrfs_lookup_first_ordered_extent(inode, lockend); | |
2009 | ||
2010 | /* | |
2011 | * We need to make sure we have no ordered extents in this range | |
2012 | * and nobody raced in and read a page in this range, if we did | |
2013 | * we need to try again. | |
2014 | */ | |
2015 | if ((!ordered || | |
2016 | (ordered->file_offset + ordered->len < lockstart || | |
2017 | ordered->file_offset > lockend)) && | |
2018 | !test_range_bit(&BTRFS_I(inode)->io_tree, lockstart, | |
2019 | lockend, EXTENT_UPTODATE, 0, | |
2020 | cached_state)) { | |
2021 | if (ordered) | |
2022 | btrfs_put_ordered_extent(ordered); | |
2023 | break; | |
2024 | } | |
2025 | if (ordered) | |
2026 | btrfs_put_ordered_extent(ordered); | |
2027 | unlock_extent_cached(&BTRFS_I(inode)->io_tree, lockstart, | |
2028 | lockend, &cached_state, GFP_NOFS); | |
2029 | btrfs_wait_ordered_range(inode, lockstart, | |
2030 | lockend - lockstart + 1); | |
2031 | } | |
2032 | ||
2033 | path = btrfs_alloc_path(); | |
2034 | if (!path) { | |
2035 | ret = -ENOMEM; | |
2036 | goto out; | |
2037 | } | |
2038 | ||
66d8f3dd | 2039 | rsv = btrfs_alloc_block_rsv(root, BTRFS_BLOCK_RSV_TEMP); |
2aaa6655 JB |
2040 | if (!rsv) { |
2041 | ret = -ENOMEM; | |
2042 | goto out_free; | |
2043 | } | |
2044 | rsv->size = btrfs_calc_trunc_metadata_size(root, 1); | |
2045 | rsv->failfast = 1; | |
2046 | ||
2047 | /* | |
2048 | * 1 - update the inode | |
2049 | * 1 - removing the extents in the range | |
2050 | * 1 - adding the hole extent | |
2051 | */ | |
2052 | trans = btrfs_start_transaction(root, 3); | |
2053 | if (IS_ERR(trans)) { | |
2054 | err = PTR_ERR(trans); | |
2055 | goto out_free; | |
2056 | } | |
2057 | ||
2058 | ret = btrfs_block_rsv_migrate(&root->fs_info->trans_block_rsv, rsv, | |
2059 | min_size); | |
2060 | BUG_ON(ret); | |
2061 | trans->block_rsv = rsv; | |
2062 | ||
2063 | while (cur_offset < lockend) { | |
2064 | ret = __btrfs_drop_extents(trans, root, inode, path, | |
2065 | cur_offset, lockend + 1, | |
2066 | &drop_end, 1); | |
2067 | if (ret != -ENOSPC) | |
2068 | break; | |
2069 | ||
2070 | trans->block_rsv = &root->fs_info->trans_block_rsv; | |
2071 | ||
2072 | ret = fill_holes(trans, inode, path, cur_offset, drop_end); | |
2073 | if (ret) { | |
2074 | err = ret; | |
2075 | break; | |
2076 | } | |
2077 | ||
2078 | cur_offset = drop_end; | |
2079 | ||
2080 | ret = btrfs_update_inode(trans, root, inode); | |
2081 | if (ret) { | |
2082 | err = ret; | |
2083 | break; | |
2084 | } | |
2085 | ||
2aaa6655 | 2086 | btrfs_end_transaction(trans, root); |
b53d3f5d | 2087 | btrfs_btree_balance_dirty(root); |
2aaa6655 JB |
2088 | |
2089 | trans = btrfs_start_transaction(root, 3); | |
2090 | if (IS_ERR(trans)) { | |
2091 | ret = PTR_ERR(trans); | |
2092 | trans = NULL; | |
2093 | break; | |
2094 | } | |
2095 | ||
2096 | ret = btrfs_block_rsv_migrate(&root->fs_info->trans_block_rsv, | |
2097 | rsv, min_size); | |
2098 | BUG_ON(ret); /* shouldn't happen */ | |
2099 | trans->block_rsv = rsv; | |
2100 | } | |
2101 | ||
2102 | if (ret) { | |
2103 | err = ret; | |
2104 | goto out_trans; | |
2105 | } | |
2106 | ||
2107 | trans->block_rsv = &root->fs_info->trans_block_rsv; | |
2108 | ret = fill_holes(trans, inode, path, cur_offset, drop_end); | |
2109 | if (ret) { | |
2110 | err = ret; | |
2111 | goto out_trans; | |
2112 | } | |
2113 | ||
2114 | out_trans: | |
2115 | if (!trans) | |
2116 | goto out_free; | |
2117 | ||
e1f5790e TI |
2118 | inode_inc_iversion(inode); |
2119 | inode->i_mtime = inode->i_ctime = CURRENT_TIME; | |
2120 | ||
2aaa6655 JB |
2121 | trans->block_rsv = &root->fs_info->trans_block_rsv; |
2122 | ret = btrfs_update_inode(trans, root, inode); | |
2aaa6655 | 2123 | btrfs_end_transaction(trans, root); |
b53d3f5d | 2124 | btrfs_btree_balance_dirty(root); |
2aaa6655 JB |
2125 | out_free: |
2126 | btrfs_free_path(path); | |
2127 | btrfs_free_block_rsv(root, rsv); | |
2128 | out: | |
2129 | unlock_extent_cached(&BTRFS_I(inode)->io_tree, lockstart, lockend, | |
2130 | &cached_state, GFP_NOFS); | |
2131 | mutex_unlock(&inode->i_mutex); | |
2132 | if (ret && !err) | |
2133 | err = ret; | |
2134 | return err; | |
2135 | } | |
2136 | ||
2fe17c10 CH |
2137 | static long btrfs_fallocate(struct file *file, int mode, |
2138 | loff_t offset, loff_t len) | |
2139 | { | |
496ad9aa | 2140 | struct inode *inode = file_inode(file); |
2fe17c10 | 2141 | struct extent_state *cached_state = NULL; |
6113077c | 2142 | struct btrfs_root *root = BTRFS_I(inode)->root; |
2fe17c10 CH |
2143 | u64 cur_offset; |
2144 | u64 last_byte; | |
2145 | u64 alloc_start; | |
2146 | u64 alloc_end; | |
2147 | u64 alloc_hint = 0; | |
2148 | u64 locked_end; | |
2fe17c10 | 2149 | struct extent_map *em; |
797f4277 | 2150 | int blocksize = BTRFS_I(inode)->root->sectorsize; |
2fe17c10 CH |
2151 | int ret; |
2152 | ||
797f4277 MX |
2153 | alloc_start = round_down(offset, blocksize); |
2154 | alloc_end = round_up(offset + len, blocksize); | |
2fe17c10 | 2155 | |
2aaa6655 JB |
2156 | /* Make sure we aren't being give some crap mode */ |
2157 | if (mode & ~(FALLOC_FL_KEEP_SIZE | FALLOC_FL_PUNCH_HOLE)) | |
2fe17c10 CH |
2158 | return -EOPNOTSUPP; |
2159 | ||
2aaa6655 JB |
2160 | if (mode & FALLOC_FL_PUNCH_HOLE) |
2161 | return btrfs_punch_hole(inode, offset, len); | |
2162 | ||
d98456fc CM |
2163 | /* |
2164 | * Make sure we have enough space before we do the | |
2165 | * allocation. | |
2166 | */ | |
0ff6fabd | 2167 | ret = btrfs_check_data_free_space(inode, alloc_end - alloc_start); |
d98456fc CM |
2168 | if (ret) |
2169 | return ret; | |
6113077c WS |
2170 | if (root->fs_info->quota_enabled) { |
2171 | ret = btrfs_qgroup_reserve(root, alloc_end - alloc_start); | |
2172 | if (ret) | |
2173 | goto out_reserve_fail; | |
2174 | } | |
d98456fc | 2175 | |
2fe17c10 CH |
2176 | /* |
2177 | * wait for ordered IO before we have any locks. We'll loop again | |
2178 | * below with the locks held. | |
2179 | */ | |
2180 | btrfs_wait_ordered_range(inode, alloc_start, alloc_end - alloc_start); | |
2181 | ||
2182 | mutex_lock(&inode->i_mutex); | |
2183 | ret = inode_newsize_ok(inode, alloc_end); | |
2184 | if (ret) | |
2185 | goto out; | |
2186 | ||
2187 | if (alloc_start > inode->i_size) { | |
a41ad394 JB |
2188 | ret = btrfs_cont_expand(inode, i_size_read(inode), |
2189 | alloc_start); | |
2fe17c10 CH |
2190 | if (ret) |
2191 | goto out; | |
2192 | } | |
2193 | ||
2fe17c10 CH |
2194 | locked_end = alloc_end - 1; |
2195 | while (1) { | |
2196 | struct btrfs_ordered_extent *ordered; | |
2197 | ||
2198 | /* the extent lock is ordered inside the running | |
2199 | * transaction | |
2200 | */ | |
2201 | lock_extent_bits(&BTRFS_I(inode)->io_tree, alloc_start, | |
d0082371 | 2202 | locked_end, 0, &cached_state); |
2fe17c10 CH |
2203 | ordered = btrfs_lookup_first_ordered_extent(inode, |
2204 | alloc_end - 1); | |
2205 | if (ordered && | |
2206 | ordered->file_offset + ordered->len > alloc_start && | |
2207 | ordered->file_offset < alloc_end) { | |
2208 | btrfs_put_ordered_extent(ordered); | |
2209 | unlock_extent_cached(&BTRFS_I(inode)->io_tree, | |
2210 | alloc_start, locked_end, | |
2211 | &cached_state, GFP_NOFS); | |
2212 | /* | |
2213 | * we can't wait on the range with the transaction | |
2214 | * running or with the extent lock held | |
2215 | */ | |
2216 | btrfs_wait_ordered_range(inode, alloc_start, | |
2217 | alloc_end - alloc_start); | |
2218 | } else { | |
2219 | if (ordered) | |
2220 | btrfs_put_ordered_extent(ordered); | |
2221 | break; | |
2222 | } | |
2223 | } | |
2224 | ||
2225 | cur_offset = alloc_start; | |
2226 | while (1) { | |
f1e490a7 JB |
2227 | u64 actual_end; |
2228 | ||
2fe17c10 CH |
2229 | em = btrfs_get_extent(inode, NULL, 0, cur_offset, |
2230 | alloc_end - cur_offset, 0); | |
79787eaa JM |
2231 | if (IS_ERR_OR_NULL(em)) { |
2232 | if (!em) | |
2233 | ret = -ENOMEM; | |
2234 | else | |
2235 | ret = PTR_ERR(em); | |
2236 | break; | |
2237 | } | |
2fe17c10 | 2238 | last_byte = min(extent_map_end(em), alloc_end); |
f1e490a7 | 2239 | actual_end = min_t(u64, extent_map_end(em), offset + len); |
797f4277 | 2240 | last_byte = ALIGN(last_byte, blocksize); |
f1e490a7 | 2241 | |
2fe17c10 CH |
2242 | if (em->block_start == EXTENT_MAP_HOLE || |
2243 | (cur_offset >= inode->i_size && | |
2244 | !test_bit(EXTENT_FLAG_PREALLOC, &em->flags))) { | |
2245 | ret = btrfs_prealloc_file_range(inode, mode, cur_offset, | |
2246 | last_byte - cur_offset, | |
2247 | 1 << inode->i_blkbits, | |
2248 | offset + len, | |
2249 | &alloc_hint); | |
1b9c332b | 2250 | |
2fe17c10 CH |
2251 | if (ret < 0) { |
2252 | free_extent_map(em); | |
2253 | break; | |
2254 | } | |
f1e490a7 JB |
2255 | } else if (actual_end > inode->i_size && |
2256 | !(mode & FALLOC_FL_KEEP_SIZE)) { | |
2257 | /* | |
2258 | * We didn't need to allocate any more space, but we | |
2259 | * still extended the size of the file so we need to | |
2260 | * update i_size. | |
2261 | */ | |
2262 | inode->i_ctime = CURRENT_TIME; | |
2263 | i_size_write(inode, actual_end); | |
2264 | btrfs_ordered_update_i_size(inode, actual_end, NULL); | |
2fe17c10 CH |
2265 | } |
2266 | free_extent_map(em); | |
2267 | ||
2268 | cur_offset = last_byte; | |
2269 | if (cur_offset >= alloc_end) { | |
2270 | ret = 0; | |
2271 | break; | |
2272 | } | |
2273 | } | |
2274 | unlock_extent_cached(&BTRFS_I(inode)->io_tree, alloc_start, locked_end, | |
2275 | &cached_state, GFP_NOFS); | |
2fe17c10 CH |
2276 | out: |
2277 | mutex_unlock(&inode->i_mutex); | |
6113077c WS |
2278 | if (root->fs_info->quota_enabled) |
2279 | btrfs_qgroup_free(root, alloc_end - alloc_start); | |
2280 | out_reserve_fail: | |
d98456fc | 2281 | /* Let go of our reservation. */ |
0ff6fabd | 2282 | btrfs_free_reserved_data_space(inode, alloc_end - alloc_start); |
2fe17c10 CH |
2283 | return ret; |
2284 | } | |
2285 | ||
965c8e59 | 2286 | static int find_desired_extent(struct inode *inode, loff_t *offset, int whence) |
b2675157 JB |
2287 | { |
2288 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
2289 | struct extent_map *em; | |
2290 | struct extent_state *cached_state = NULL; | |
2291 | u64 lockstart = *offset; | |
2292 | u64 lockend = i_size_read(inode); | |
2293 | u64 start = *offset; | |
2294 | u64 orig_start = *offset; | |
2295 | u64 len = i_size_read(inode); | |
2296 | u64 last_end = 0; | |
2297 | int ret = 0; | |
2298 | ||
2299 | lockend = max_t(u64, root->sectorsize, lockend); | |
2300 | if (lockend <= lockstart) | |
2301 | lockend = lockstart + root->sectorsize; | |
2302 | ||
1214b53f | 2303 | lockend--; |
b2675157 JB |
2304 | len = lockend - lockstart + 1; |
2305 | ||
2306 | len = max_t(u64, len, root->sectorsize); | |
2307 | if (inode->i_size == 0) | |
2308 | return -ENXIO; | |
2309 | ||
2310 | lock_extent_bits(&BTRFS_I(inode)->io_tree, lockstart, lockend, 0, | |
d0082371 | 2311 | &cached_state); |
b2675157 JB |
2312 | |
2313 | /* | |
2314 | * Delalloc is such a pain. If we have a hole and we have pending | |
2315 | * delalloc for a portion of the hole we will get back a hole that | |
2316 | * exists for the entire range since it hasn't been actually written | |
2317 | * yet. So to take care of this case we need to look for an extent just | |
2318 | * before the position we want in case there is outstanding delalloc | |
2319 | * going on here. | |
2320 | */ | |
965c8e59 | 2321 | if (whence == SEEK_HOLE && start != 0) { |
b2675157 JB |
2322 | if (start <= root->sectorsize) |
2323 | em = btrfs_get_extent_fiemap(inode, NULL, 0, 0, | |
2324 | root->sectorsize, 0); | |
2325 | else | |
2326 | em = btrfs_get_extent_fiemap(inode, NULL, 0, | |
2327 | start - root->sectorsize, | |
2328 | root->sectorsize, 0); | |
2329 | if (IS_ERR(em)) { | |
6af021d8 | 2330 | ret = PTR_ERR(em); |
b2675157 JB |
2331 | goto out; |
2332 | } | |
2333 | last_end = em->start + em->len; | |
2334 | if (em->block_start == EXTENT_MAP_DELALLOC) | |
2335 | last_end = min_t(u64, last_end, inode->i_size); | |
2336 | free_extent_map(em); | |
2337 | } | |
2338 | ||
2339 | while (1) { | |
2340 | em = btrfs_get_extent_fiemap(inode, NULL, 0, start, len, 0); | |
2341 | if (IS_ERR(em)) { | |
6af021d8 | 2342 | ret = PTR_ERR(em); |
b2675157 JB |
2343 | break; |
2344 | } | |
2345 | ||
2346 | if (em->block_start == EXTENT_MAP_HOLE) { | |
2347 | if (test_bit(EXTENT_FLAG_VACANCY, &em->flags)) { | |
2348 | if (last_end <= orig_start) { | |
2349 | free_extent_map(em); | |
2350 | ret = -ENXIO; | |
2351 | break; | |
2352 | } | |
2353 | } | |
2354 | ||
965c8e59 | 2355 | if (whence == SEEK_HOLE) { |
b2675157 JB |
2356 | *offset = start; |
2357 | free_extent_map(em); | |
2358 | break; | |
2359 | } | |
2360 | } else { | |
965c8e59 | 2361 | if (whence == SEEK_DATA) { |
b2675157 JB |
2362 | if (em->block_start == EXTENT_MAP_DELALLOC) { |
2363 | if (start >= inode->i_size) { | |
2364 | free_extent_map(em); | |
2365 | ret = -ENXIO; | |
2366 | break; | |
2367 | } | |
2368 | } | |
2369 | ||
f9e4fb53 LB |
2370 | if (!test_bit(EXTENT_FLAG_PREALLOC, |
2371 | &em->flags)) { | |
2372 | *offset = start; | |
2373 | free_extent_map(em); | |
2374 | break; | |
2375 | } | |
b2675157 JB |
2376 | } |
2377 | } | |
2378 | ||
2379 | start = em->start + em->len; | |
2380 | last_end = em->start + em->len; | |
2381 | ||
2382 | if (em->block_start == EXTENT_MAP_DELALLOC) | |
2383 | last_end = min_t(u64, last_end, inode->i_size); | |
2384 | ||
2385 | if (test_bit(EXTENT_FLAG_VACANCY, &em->flags)) { | |
2386 | free_extent_map(em); | |
2387 | ret = -ENXIO; | |
2388 | break; | |
2389 | } | |
2390 | free_extent_map(em); | |
2391 | cond_resched(); | |
2392 | } | |
2393 | if (!ret) | |
2394 | *offset = min(*offset, inode->i_size); | |
2395 | out: | |
2396 | unlock_extent_cached(&BTRFS_I(inode)->io_tree, lockstart, lockend, | |
2397 | &cached_state, GFP_NOFS); | |
2398 | return ret; | |
2399 | } | |
2400 | ||
965c8e59 | 2401 | static loff_t btrfs_file_llseek(struct file *file, loff_t offset, int whence) |
b2675157 JB |
2402 | { |
2403 | struct inode *inode = file->f_mapping->host; | |
2404 | int ret; | |
2405 | ||
2406 | mutex_lock(&inode->i_mutex); | |
965c8e59 | 2407 | switch (whence) { |
b2675157 JB |
2408 | case SEEK_END: |
2409 | case SEEK_CUR: | |
965c8e59 | 2410 | offset = generic_file_llseek(file, offset, whence); |
b2675157 JB |
2411 | goto out; |
2412 | case SEEK_DATA: | |
2413 | case SEEK_HOLE: | |
48802c8a JL |
2414 | if (offset >= i_size_read(inode)) { |
2415 | mutex_unlock(&inode->i_mutex); | |
2416 | return -ENXIO; | |
2417 | } | |
2418 | ||
965c8e59 | 2419 | ret = find_desired_extent(inode, &offset, whence); |
b2675157 JB |
2420 | if (ret) { |
2421 | mutex_unlock(&inode->i_mutex); | |
2422 | return ret; | |
2423 | } | |
2424 | } | |
2425 | ||
9a4327ca | 2426 | if (offset < 0 && !(file->f_mode & FMODE_UNSIGNED_OFFSET)) { |
48802c8a | 2427 | offset = -EINVAL; |
9a4327ca DC |
2428 | goto out; |
2429 | } | |
2430 | if (offset > inode->i_sb->s_maxbytes) { | |
48802c8a | 2431 | offset = -EINVAL; |
9a4327ca DC |
2432 | goto out; |
2433 | } | |
b2675157 JB |
2434 | |
2435 | /* Special lock needed here? */ | |
2436 | if (offset != file->f_pos) { | |
2437 | file->f_pos = offset; | |
2438 | file->f_version = 0; | |
2439 | } | |
2440 | out: | |
2441 | mutex_unlock(&inode->i_mutex); | |
2442 | return offset; | |
2443 | } | |
2444 | ||
828c0950 | 2445 | const struct file_operations btrfs_file_operations = { |
b2675157 | 2446 | .llseek = btrfs_file_llseek, |
39279cc3 | 2447 | .read = do_sync_read, |
4a001071 | 2448 | .write = do_sync_write, |
9ebefb18 | 2449 | .aio_read = generic_file_aio_read, |
e9906a98 | 2450 | .splice_read = generic_file_splice_read, |
11c65dcc | 2451 | .aio_write = btrfs_file_aio_write, |
9ebefb18 | 2452 | .mmap = btrfs_file_mmap, |
39279cc3 | 2453 | .open = generic_file_open, |
e1b81e67 | 2454 | .release = btrfs_release_file, |
39279cc3 | 2455 | .fsync = btrfs_sync_file, |
2fe17c10 | 2456 | .fallocate = btrfs_fallocate, |
34287aa3 | 2457 | .unlocked_ioctl = btrfs_ioctl, |
39279cc3 | 2458 | #ifdef CONFIG_COMPAT |
34287aa3 | 2459 | .compat_ioctl = btrfs_ioctl, |
39279cc3 CM |
2460 | #endif |
2461 | }; | |
9247f317 MX |
2462 | |
2463 | void btrfs_auto_defrag_exit(void) | |
2464 | { | |
2465 | if (btrfs_inode_defrag_cachep) | |
2466 | kmem_cache_destroy(btrfs_inode_defrag_cachep); | |
2467 | } | |
2468 | ||
2469 | int btrfs_auto_defrag_init(void) | |
2470 | { | |
2471 | btrfs_inode_defrag_cachep = kmem_cache_create("btrfs_inode_defrag", | |
2472 | sizeof(struct inode_defrag), 0, | |
2473 | SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, | |
2474 | NULL); | |
2475 | if (!btrfs_inode_defrag_cachep) | |
2476 | return -ENOMEM; | |
2477 | ||
2478 | return 0; | |
2479 | } |