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> |
39279cc3 CM |
33 | #include "ctree.h" |
34 | #include "disk-io.h" | |
35 | #include "transaction.h" | |
36 | #include "btrfs_inode.h" | |
37 | #include "ioctl.h" | |
38 | #include "print-tree.h" | |
e02119d5 CM |
39 | #include "tree-log.h" |
40 | #include "locking.h" | |
12fa8ec6 | 41 | #include "compat.h" |
39279cc3 | 42 | |
4cb5300b CM |
43 | /* |
44 | * when auto defrag is enabled we | |
45 | * queue up these defrag structs to remember which | |
46 | * inodes need defragging passes | |
47 | */ | |
48 | struct inode_defrag { | |
49 | struct rb_node rb_node; | |
50 | /* objectid */ | |
51 | u64 ino; | |
52 | /* | |
53 | * transid where the defrag was added, we search for | |
54 | * extents newer than this | |
55 | */ | |
56 | u64 transid; | |
57 | ||
58 | /* root objectid */ | |
59 | u64 root; | |
60 | ||
61 | /* last offset we were able to defrag */ | |
62 | u64 last_offset; | |
63 | ||
64 | /* if we've wrapped around back to zero once already */ | |
65 | int cycled; | |
66 | }; | |
67 | ||
68 | /* pop a record for an inode into the defrag tree. The lock | |
69 | * must be held already | |
70 | * | |
71 | * If you're inserting a record for an older transid than an | |
72 | * existing record, the transid already in the tree is lowered | |
73 | * | |
74 | * If an existing record is found the defrag item you | |
75 | * pass in is freed | |
76 | */ | |
a0f98dde | 77 | static void __btrfs_add_inode_defrag(struct inode *inode, |
4cb5300b CM |
78 | struct inode_defrag *defrag) |
79 | { | |
80 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
81 | struct inode_defrag *entry; | |
82 | struct rb_node **p; | |
83 | struct rb_node *parent = NULL; | |
84 | ||
85 | p = &root->fs_info->defrag_inodes.rb_node; | |
86 | while (*p) { | |
87 | parent = *p; | |
88 | entry = rb_entry(parent, struct inode_defrag, rb_node); | |
89 | ||
90 | if (defrag->ino < entry->ino) | |
91 | p = &parent->rb_left; | |
92 | else if (defrag->ino > entry->ino) | |
93 | p = &parent->rb_right; | |
94 | else { | |
95 | /* if we're reinserting an entry for | |
96 | * an old defrag run, make sure to | |
97 | * lower the transid of our existing record | |
98 | */ | |
99 | if (defrag->transid < entry->transid) | |
100 | entry->transid = defrag->transid; | |
101 | if (defrag->last_offset > entry->last_offset) | |
102 | entry->last_offset = defrag->last_offset; | |
103 | goto exists; | |
104 | } | |
105 | } | |
106 | BTRFS_I(inode)->in_defrag = 1; | |
107 | rb_link_node(&defrag->rb_node, parent, p); | |
108 | rb_insert_color(&defrag->rb_node, &root->fs_info->defrag_inodes); | |
a0f98dde | 109 | return; |
4cb5300b CM |
110 | |
111 | exists: | |
112 | kfree(defrag); | |
a0f98dde | 113 | return; |
4cb5300b CM |
114 | |
115 | } | |
116 | ||
117 | /* | |
118 | * insert a defrag record for this inode if auto defrag is | |
119 | * enabled | |
120 | */ | |
121 | int btrfs_add_inode_defrag(struct btrfs_trans_handle *trans, | |
122 | struct inode *inode) | |
123 | { | |
124 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
125 | struct inode_defrag *defrag; | |
4cb5300b CM |
126 | u64 transid; |
127 | ||
128 | if (!btrfs_test_opt(root, AUTO_DEFRAG)) | |
129 | return 0; | |
130 | ||
7841cb28 | 131 | if (btrfs_fs_closing(root->fs_info)) |
4cb5300b CM |
132 | return 0; |
133 | ||
134 | if (BTRFS_I(inode)->in_defrag) | |
135 | return 0; | |
136 | ||
137 | if (trans) | |
138 | transid = trans->transid; | |
139 | else | |
140 | transid = BTRFS_I(inode)->root->last_trans; | |
141 | ||
142 | defrag = kzalloc(sizeof(*defrag), GFP_NOFS); | |
143 | if (!defrag) | |
144 | return -ENOMEM; | |
145 | ||
a4689d2b | 146 | defrag->ino = btrfs_ino(inode); |
4cb5300b CM |
147 | defrag->transid = transid; |
148 | defrag->root = root->root_key.objectid; | |
149 | ||
150 | spin_lock(&root->fs_info->defrag_inodes_lock); | |
151 | if (!BTRFS_I(inode)->in_defrag) | |
a0f98dde | 152 | __btrfs_add_inode_defrag(inode, defrag); |
f4ac904c DC |
153 | else |
154 | kfree(defrag); | |
4cb5300b | 155 | spin_unlock(&root->fs_info->defrag_inodes_lock); |
a0f98dde | 156 | return 0; |
4cb5300b CM |
157 | } |
158 | ||
159 | /* | |
160 | * must be called with the defrag_inodes lock held | |
161 | */ | |
162 | struct inode_defrag *btrfs_find_defrag_inode(struct btrfs_fs_info *info, u64 ino, | |
163 | struct rb_node **next) | |
164 | { | |
165 | struct inode_defrag *entry = NULL; | |
166 | struct rb_node *p; | |
167 | struct rb_node *parent = NULL; | |
168 | ||
169 | p = info->defrag_inodes.rb_node; | |
170 | while (p) { | |
171 | parent = p; | |
172 | entry = rb_entry(parent, struct inode_defrag, rb_node); | |
173 | ||
174 | if (ino < entry->ino) | |
175 | p = parent->rb_left; | |
176 | else if (ino > entry->ino) | |
177 | p = parent->rb_right; | |
178 | else | |
179 | return entry; | |
180 | } | |
181 | ||
182 | if (next) { | |
183 | while (parent && ino > entry->ino) { | |
184 | parent = rb_next(parent); | |
185 | entry = rb_entry(parent, struct inode_defrag, rb_node); | |
186 | } | |
187 | *next = parent; | |
188 | } | |
189 | return NULL; | |
190 | } | |
191 | ||
192 | /* | |
193 | * run through the list of inodes in the FS that need | |
194 | * defragging | |
195 | */ | |
196 | int btrfs_run_defrag_inodes(struct btrfs_fs_info *fs_info) | |
197 | { | |
198 | struct inode_defrag *defrag; | |
199 | struct btrfs_root *inode_root; | |
200 | struct inode *inode; | |
201 | struct rb_node *n; | |
202 | struct btrfs_key key; | |
203 | struct btrfs_ioctl_defrag_range_args range; | |
204 | u64 first_ino = 0; | |
205 | int num_defrag; | |
206 | int defrag_batch = 1024; | |
207 | ||
208 | memset(&range, 0, sizeof(range)); | |
209 | range.len = (u64)-1; | |
210 | ||
211 | atomic_inc(&fs_info->defrag_running); | |
212 | spin_lock(&fs_info->defrag_inodes_lock); | |
213 | while(1) { | |
214 | n = NULL; | |
215 | ||
216 | /* find an inode to defrag */ | |
217 | defrag = btrfs_find_defrag_inode(fs_info, first_ino, &n); | |
218 | if (!defrag) { | |
219 | if (n) | |
220 | defrag = rb_entry(n, struct inode_defrag, rb_node); | |
221 | else if (first_ino) { | |
222 | first_ino = 0; | |
223 | continue; | |
224 | } else { | |
225 | break; | |
226 | } | |
227 | } | |
228 | ||
229 | /* remove it from the rbtree */ | |
230 | first_ino = defrag->ino + 1; | |
231 | rb_erase(&defrag->rb_node, &fs_info->defrag_inodes); | |
232 | ||
7841cb28 | 233 | if (btrfs_fs_closing(fs_info)) |
4cb5300b CM |
234 | goto next_free; |
235 | ||
236 | spin_unlock(&fs_info->defrag_inodes_lock); | |
237 | ||
238 | /* get the inode */ | |
239 | key.objectid = defrag->root; | |
240 | btrfs_set_key_type(&key, BTRFS_ROOT_ITEM_KEY); | |
241 | key.offset = (u64)-1; | |
242 | inode_root = btrfs_read_fs_root_no_name(fs_info, &key); | |
243 | if (IS_ERR(inode_root)) | |
244 | goto next; | |
245 | ||
246 | key.objectid = defrag->ino; | |
247 | btrfs_set_key_type(&key, BTRFS_INODE_ITEM_KEY); | |
248 | key.offset = 0; | |
249 | ||
250 | inode = btrfs_iget(fs_info->sb, &key, inode_root, NULL); | |
251 | if (IS_ERR(inode)) | |
252 | goto next; | |
253 | ||
254 | /* do a chunk of defrag */ | |
255 | BTRFS_I(inode)->in_defrag = 0; | |
256 | range.start = defrag->last_offset; | |
257 | num_defrag = btrfs_defrag_file(inode, NULL, &range, defrag->transid, | |
258 | defrag_batch); | |
259 | /* | |
260 | * if we filled the whole defrag batch, there | |
261 | * must be more work to do. Queue this defrag | |
262 | * again | |
263 | */ | |
264 | if (num_defrag == defrag_batch) { | |
265 | defrag->last_offset = range.start; | |
266 | __btrfs_add_inode_defrag(inode, defrag); | |
267 | /* | |
268 | * we don't want to kfree defrag, we added it back to | |
269 | * the rbtree | |
270 | */ | |
271 | defrag = NULL; | |
272 | } else if (defrag->last_offset && !defrag->cycled) { | |
273 | /* | |
274 | * we didn't fill our defrag batch, but | |
275 | * we didn't start at zero. Make sure we loop | |
276 | * around to the start of the file. | |
277 | */ | |
278 | defrag->last_offset = 0; | |
279 | defrag->cycled = 1; | |
280 | __btrfs_add_inode_defrag(inode, defrag); | |
281 | defrag = NULL; | |
282 | } | |
283 | ||
284 | iput(inode); | |
285 | next: | |
286 | spin_lock(&fs_info->defrag_inodes_lock); | |
287 | next_free: | |
288 | kfree(defrag); | |
289 | } | |
290 | spin_unlock(&fs_info->defrag_inodes_lock); | |
291 | ||
292 | atomic_dec(&fs_info->defrag_running); | |
293 | ||
294 | /* | |
295 | * during unmount, we use the transaction_wait queue to | |
296 | * wait for the defragger to stop | |
297 | */ | |
298 | wake_up(&fs_info->transaction_wait); | |
299 | return 0; | |
300 | } | |
39279cc3 | 301 | |
d352ac68 CM |
302 | /* simple helper to fault in pages and copy. This should go away |
303 | * and be replaced with calls into generic code. | |
304 | */ | |
d397712b | 305 | static noinline int btrfs_copy_from_user(loff_t pos, int num_pages, |
d0215f3e | 306 | size_t write_bytes, |
a1b32a59 | 307 | struct page **prepared_pages, |
11c65dcc | 308 | struct iov_iter *i) |
39279cc3 | 309 | { |
914ee295 | 310 | size_t copied = 0; |
d0215f3e | 311 | size_t total_copied = 0; |
11c65dcc | 312 | int pg = 0; |
39279cc3 CM |
313 | int offset = pos & (PAGE_CACHE_SIZE - 1); |
314 | ||
11c65dcc | 315 | while (write_bytes > 0) { |
39279cc3 CM |
316 | size_t count = min_t(size_t, |
317 | PAGE_CACHE_SIZE - offset, write_bytes); | |
11c65dcc | 318 | struct page *page = prepared_pages[pg]; |
914ee295 XZ |
319 | /* |
320 | * Copy data from userspace to the current page | |
321 | * | |
322 | * Disable pagefault to avoid recursive lock since | |
323 | * the pages are already locked | |
324 | */ | |
325 | pagefault_disable(); | |
326 | copied = iov_iter_copy_from_user_atomic(page, i, offset, count); | |
327 | pagefault_enable(); | |
11c65dcc | 328 | |
39279cc3 CM |
329 | /* Flush processor's dcache for this page */ |
330 | flush_dcache_page(page); | |
31339acd CM |
331 | |
332 | /* | |
333 | * if we get a partial write, we can end up with | |
334 | * partially up to date pages. These add | |
335 | * a lot of complexity, so make sure they don't | |
336 | * happen by forcing this copy to be retried. | |
337 | * | |
338 | * The rest of the btrfs_file_write code will fall | |
339 | * back to page at a time copies after we return 0. | |
340 | */ | |
341 | if (!PageUptodate(page) && copied < count) | |
342 | copied = 0; | |
343 | ||
11c65dcc JB |
344 | iov_iter_advance(i, copied); |
345 | write_bytes -= copied; | |
914ee295 | 346 | total_copied += copied; |
39279cc3 | 347 | |
914ee295 | 348 | /* Return to btrfs_file_aio_write to fault page */ |
9f570b8d | 349 | if (unlikely(copied == 0)) |
914ee295 | 350 | break; |
11c65dcc JB |
351 | |
352 | if (unlikely(copied < PAGE_CACHE_SIZE - offset)) { | |
353 | offset += copied; | |
354 | } else { | |
355 | pg++; | |
356 | offset = 0; | |
357 | } | |
39279cc3 | 358 | } |
914ee295 | 359 | return total_copied; |
39279cc3 CM |
360 | } |
361 | ||
d352ac68 CM |
362 | /* |
363 | * unlocks pages after btrfs_file_write is done with them | |
364 | */ | |
be1a12a0 | 365 | void btrfs_drop_pages(struct page **pages, size_t num_pages) |
39279cc3 CM |
366 | { |
367 | size_t i; | |
368 | for (i = 0; i < num_pages; i++) { | |
d352ac68 CM |
369 | /* page checked is some magic around finding pages that |
370 | * have been modified without going through btrfs_set_page_dirty | |
371 | * clear it here | |
372 | */ | |
4a096752 | 373 | ClearPageChecked(pages[i]); |
39279cc3 CM |
374 | unlock_page(pages[i]); |
375 | mark_page_accessed(pages[i]); | |
376 | page_cache_release(pages[i]); | |
377 | } | |
378 | } | |
379 | ||
d352ac68 CM |
380 | /* |
381 | * after copy_from_user, pages need to be dirtied and we need to make | |
382 | * sure holes are created between the current EOF and the start of | |
383 | * any next extents (if required). | |
384 | * | |
385 | * this also makes the decision about creating an inline extent vs | |
386 | * doing real data extents, marking pages dirty and delalloc as required. | |
387 | */ | |
be1a12a0 JB |
388 | int btrfs_dirty_pages(struct btrfs_root *root, struct inode *inode, |
389 | struct page **pages, size_t num_pages, | |
390 | loff_t pos, size_t write_bytes, | |
391 | struct extent_state **cached) | |
39279cc3 | 392 | { |
39279cc3 | 393 | int err = 0; |
a52d9a80 | 394 | int i; |
db94535d | 395 | u64 num_bytes; |
a52d9a80 CM |
396 | u64 start_pos; |
397 | u64 end_of_last_block; | |
398 | u64 end_pos = pos + write_bytes; | |
399 | loff_t isize = i_size_read(inode); | |
39279cc3 | 400 | |
5f39d397 | 401 | start_pos = pos & ~((u64)root->sectorsize - 1); |
db94535d CM |
402 | num_bytes = (write_bytes + pos - start_pos + |
403 | root->sectorsize - 1) & ~((u64)root->sectorsize - 1); | |
39279cc3 | 404 | |
db94535d | 405 | end_of_last_block = start_pos + num_bytes - 1; |
2ac55d41 | 406 | err = btrfs_set_extent_delalloc(inode, start_pos, end_of_last_block, |
be1a12a0 | 407 | cached); |
d0215f3e JB |
408 | if (err) |
409 | return err; | |
9ed74f2d | 410 | |
c8b97818 CM |
411 | for (i = 0; i < num_pages; i++) { |
412 | struct page *p = pages[i]; | |
413 | SetPageUptodate(p); | |
414 | ClearPageChecked(p); | |
415 | set_page_dirty(p); | |
a52d9a80 | 416 | } |
9f570b8d JB |
417 | |
418 | /* | |
419 | * we've only changed i_size in ram, and we haven't updated | |
420 | * the disk i_size. There is no need to log the inode | |
421 | * at this time. | |
422 | */ | |
423 | if (end_pos > isize) | |
a52d9a80 | 424 | i_size_write(inode, end_pos); |
a22285a6 | 425 | return 0; |
39279cc3 CM |
426 | } |
427 | ||
d352ac68 CM |
428 | /* |
429 | * this drops all the extents in the cache that intersect the range | |
430 | * [start, end]. Existing extents are split as required. | |
431 | */ | |
5b21f2ed ZY |
432 | int btrfs_drop_extent_cache(struct inode *inode, u64 start, u64 end, |
433 | int skip_pinned) | |
a52d9a80 CM |
434 | { |
435 | struct extent_map *em; | |
3b951516 CM |
436 | struct extent_map *split = NULL; |
437 | struct extent_map *split2 = NULL; | |
a52d9a80 | 438 | struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; |
39b5637f | 439 | u64 len = end - start + 1; |
3b951516 CM |
440 | int ret; |
441 | int testend = 1; | |
5b21f2ed | 442 | unsigned long flags; |
c8b97818 | 443 | int compressed = 0; |
a52d9a80 | 444 | |
e6dcd2dc | 445 | WARN_ON(end < start); |
3b951516 | 446 | if (end == (u64)-1) { |
39b5637f | 447 | len = (u64)-1; |
3b951516 CM |
448 | testend = 0; |
449 | } | |
d397712b | 450 | while (1) { |
3b951516 | 451 | if (!split) |
172ddd60 | 452 | split = alloc_extent_map(); |
3b951516 | 453 | if (!split2) |
172ddd60 | 454 | split2 = alloc_extent_map(); |
79787eaa | 455 | BUG_ON(!split || !split2); /* -ENOMEM */ |
3b951516 | 456 | |
890871be | 457 | write_lock(&em_tree->lock); |
39b5637f | 458 | em = lookup_extent_mapping(em_tree, start, len); |
d1310b2e | 459 | if (!em) { |
890871be | 460 | write_unlock(&em_tree->lock); |
a52d9a80 | 461 | break; |
d1310b2e | 462 | } |
5b21f2ed ZY |
463 | flags = em->flags; |
464 | if (skip_pinned && test_bit(EXTENT_FLAG_PINNED, &em->flags)) { | |
55ef6899 | 465 | if (testend && em->start + em->len >= start + len) { |
5b21f2ed | 466 | free_extent_map(em); |
a1ed835e | 467 | write_unlock(&em_tree->lock); |
5b21f2ed ZY |
468 | break; |
469 | } | |
55ef6899 YZ |
470 | start = em->start + em->len; |
471 | if (testend) | |
5b21f2ed | 472 | len = start + len - (em->start + em->len); |
5b21f2ed | 473 | free_extent_map(em); |
a1ed835e | 474 | write_unlock(&em_tree->lock); |
5b21f2ed ZY |
475 | continue; |
476 | } | |
c8b97818 | 477 | compressed = test_bit(EXTENT_FLAG_COMPRESSED, &em->flags); |
3ce7e67a | 478 | clear_bit(EXTENT_FLAG_PINNED, &em->flags); |
a52d9a80 | 479 | remove_extent_mapping(em_tree, em); |
3b951516 CM |
480 | |
481 | if (em->block_start < EXTENT_MAP_LAST_BYTE && | |
482 | em->start < start) { | |
483 | split->start = em->start; | |
484 | split->len = start - em->start; | |
ff5b7ee3 | 485 | split->orig_start = em->orig_start; |
3b951516 | 486 | split->block_start = em->block_start; |
c8b97818 CM |
487 | |
488 | if (compressed) | |
489 | split->block_len = em->block_len; | |
490 | else | |
491 | split->block_len = split->len; | |
492 | ||
3b951516 | 493 | split->bdev = em->bdev; |
5b21f2ed | 494 | split->flags = flags; |
261507a0 | 495 | split->compress_type = em->compress_type; |
3b951516 | 496 | ret = add_extent_mapping(em_tree, split); |
79787eaa | 497 | BUG_ON(ret); /* Logic error */ |
3b951516 CM |
498 | free_extent_map(split); |
499 | split = split2; | |
500 | split2 = NULL; | |
501 | } | |
502 | if (em->block_start < EXTENT_MAP_LAST_BYTE && | |
503 | testend && em->start + em->len > start + len) { | |
504 | u64 diff = start + len - em->start; | |
505 | ||
506 | split->start = start + len; | |
507 | split->len = em->start + em->len - (start + len); | |
508 | split->bdev = em->bdev; | |
5b21f2ed | 509 | split->flags = flags; |
261507a0 | 510 | split->compress_type = em->compress_type; |
3b951516 | 511 | |
c8b97818 CM |
512 | if (compressed) { |
513 | split->block_len = em->block_len; | |
514 | split->block_start = em->block_start; | |
445a6944 | 515 | split->orig_start = em->orig_start; |
c8b97818 CM |
516 | } else { |
517 | split->block_len = split->len; | |
518 | split->block_start = em->block_start + diff; | |
445a6944 | 519 | split->orig_start = split->start; |
c8b97818 | 520 | } |
3b951516 CM |
521 | |
522 | ret = add_extent_mapping(em_tree, split); | |
79787eaa | 523 | BUG_ON(ret); /* Logic error */ |
3b951516 CM |
524 | free_extent_map(split); |
525 | split = NULL; | |
526 | } | |
890871be | 527 | write_unlock(&em_tree->lock); |
d1310b2e | 528 | |
a52d9a80 CM |
529 | /* once for us */ |
530 | free_extent_map(em); | |
531 | /* once for the tree*/ | |
532 | free_extent_map(em); | |
533 | } | |
3b951516 CM |
534 | if (split) |
535 | free_extent_map(split); | |
536 | if (split2) | |
537 | free_extent_map(split2); | |
a52d9a80 CM |
538 | return 0; |
539 | } | |
540 | ||
39279cc3 CM |
541 | /* |
542 | * this is very complex, but the basic idea is to drop all extents | |
543 | * in the range start - end. hint_block is filled in with a block number | |
544 | * that would be a good hint to the block allocator for this file. | |
545 | * | |
546 | * If an extent intersects the range but is not entirely inside the range | |
547 | * it is either truncated or split. Anything entirely inside the range | |
548 | * is deleted from the tree. | |
549 | */ | |
920bbbfb YZ |
550 | int btrfs_drop_extents(struct btrfs_trans_handle *trans, struct inode *inode, |
551 | u64 start, u64 end, u64 *hint_byte, int drop_cache) | |
39279cc3 | 552 | { |
920bbbfb | 553 | struct btrfs_root *root = BTRFS_I(inode)->root; |
5f39d397 | 554 | struct extent_buffer *leaf; |
920bbbfb | 555 | struct btrfs_file_extent_item *fi; |
39279cc3 | 556 | struct btrfs_path *path; |
00f5c795 | 557 | struct btrfs_key key; |
920bbbfb | 558 | struct btrfs_key new_key; |
33345d01 | 559 | u64 ino = btrfs_ino(inode); |
920bbbfb YZ |
560 | u64 search_start = start; |
561 | u64 disk_bytenr = 0; | |
562 | u64 num_bytes = 0; | |
563 | u64 extent_offset = 0; | |
564 | u64 extent_end = 0; | |
565 | int del_nr = 0; | |
566 | int del_slot = 0; | |
567 | int extent_type; | |
ccd467d6 | 568 | int recow; |
00f5c795 | 569 | int ret; |
dc7fdde3 | 570 | int modify_tree = -1; |
39279cc3 | 571 | |
a1ed835e CM |
572 | if (drop_cache) |
573 | btrfs_drop_extent_cache(inode, start, end - 1, 0); | |
a52d9a80 | 574 | |
39279cc3 CM |
575 | path = btrfs_alloc_path(); |
576 | if (!path) | |
577 | return -ENOMEM; | |
920bbbfb | 578 | |
dc7fdde3 CM |
579 | if (start >= BTRFS_I(inode)->disk_i_size) |
580 | modify_tree = 0; | |
581 | ||
d397712b | 582 | while (1) { |
ccd467d6 | 583 | recow = 0; |
33345d01 | 584 | ret = btrfs_lookup_file_extent(trans, root, path, ino, |
dc7fdde3 | 585 | search_start, modify_tree); |
39279cc3 | 586 | if (ret < 0) |
920bbbfb YZ |
587 | break; |
588 | if (ret > 0 && path->slots[0] > 0 && search_start == start) { | |
589 | leaf = path->nodes[0]; | |
590 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0] - 1); | |
33345d01 | 591 | if (key.objectid == ino && |
920bbbfb YZ |
592 | key.type == BTRFS_EXTENT_DATA_KEY) |
593 | path->slots[0]--; | |
39279cc3 | 594 | } |
920bbbfb | 595 | ret = 0; |
8c2383c3 | 596 | next_slot: |
5f39d397 | 597 | leaf = path->nodes[0]; |
920bbbfb YZ |
598 | if (path->slots[0] >= btrfs_header_nritems(leaf)) { |
599 | BUG_ON(del_nr > 0); | |
600 | ret = btrfs_next_leaf(root, path); | |
601 | if (ret < 0) | |
602 | break; | |
603 | if (ret > 0) { | |
604 | ret = 0; | |
605 | break; | |
8c2383c3 | 606 | } |
920bbbfb YZ |
607 | leaf = path->nodes[0]; |
608 | recow = 1; | |
609 | } | |
610 | ||
611 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
33345d01 | 612 | if (key.objectid > ino || |
920bbbfb YZ |
613 | key.type > BTRFS_EXTENT_DATA_KEY || key.offset >= end) |
614 | break; | |
615 | ||
616 | fi = btrfs_item_ptr(leaf, path->slots[0], | |
617 | struct btrfs_file_extent_item); | |
618 | extent_type = btrfs_file_extent_type(leaf, fi); | |
619 | ||
620 | if (extent_type == BTRFS_FILE_EXTENT_REG || | |
621 | extent_type == BTRFS_FILE_EXTENT_PREALLOC) { | |
622 | disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); | |
623 | num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi); | |
624 | extent_offset = btrfs_file_extent_offset(leaf, fi); | |
625 | extent_end = key.offset + | |
626 | btrfs_file_extent_num_bytes(leaf, fi); | |
627 | } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) { | |
628 | extent_end = key.offset + | |
629 | btrfs_file_extent_inline_len(leaf, fi); | |
8c2383c3 | 630 | } else { |
920bbbfb | 631 | WARN_ON(1); |
8c2383c3 | 632 | extent_end = search_start; |
39279cc3 CM |
633 | } |
634 | ||
920bbbfb YZ |
635 | if (extent_end <= search_start) { |
636 | path->slots[0]++; | |
8c2383c3 | 637 | goto next_slot; |
39279cc3 CM |
638 | } |
639 | ||
920bbbfb | 640 | search_start = max(key.offset, start); |
dc7fdde3 CM |
641 | if (recow || !modify_tree) { |
642 | modify_tree = -1; | |
b3b4aa74 | 643 | btrfs_release_path(path); |
920bbbfb | 644 | continue; |
39279cc3 | 645 | } |
6643558d | 646 | |
920bbbfb YZ |
647 | /* |
648 | * | - range to drop - | | |
649 | * | -------- extent -------- | | |
650 | */ | |
651 | if (start > key.offset && end < extent_end) { | |
652 | BUG_ON(del_nr > 0); | |
653 | BUG_ON(extent_type == BTRFS_FILE_EXTENT_INLINE); | |
654 | ||
655 | memcpy(&new_key, &key, sizeof(new_key)); | |
656 | new_key.offset = start; | |
657 | ret = btrfs_duplicate_item(trans, root, path, | |
658 | &new_key); | |
659 | if (ret == -EAGAIN) { | |
b3b4aa74 | 660 | btrfs_release_path(path); |
920bbbfb | 661 | continue; |
6643558d | 662 | } |
920bbbfb YZ |
663 | if (ret < 0) |
664 | break; | |
665 | ||
666 | leaf = path->nodes[0]; | |
667 | fi = btrfs_item_ptr(leaf, path->slots[0] - 1, | |
668 | struct btrfs_file_extent_item); | |
669 | btrfs_set_file_extent_num_bytes(leaf, fi, | |
670 | start - key.offset); | |
671 | ||
672 | fi = btrfs_item_ptr(leaf, path->slots[0], | |
673 | struct btrfs_file_extent_item); | |
674 | ||
675 | extent_offset += start - key.offset; | |
676 | btrfs_set_file_extent_offset(leaf, fi, extent_offset); | |
677 | btrfs_set_file_extent_num_bytes(leaf, fi, | |
678 | extent_end - start); | |
679 | btrfs_mark_buffer_dirty(leaf); | |
680 | ||
681 | if (disk_bytenr > 0) { | |
771ed689 | 682 | ret = btrfs_inc_extent_ref(trans, root, |
920bbbfb YZ |
683 | disk_bytenr, num_bytes, 0, |
684 | root->root_key.objectid, | |
685 | new_key.objectid, | |
66d7e7f0 | 686 | start - extent_offset, 0); |
79787eaa | 687 | BUG_ON(ret); /* -ENOMEM */ |
920bbbfb | 688 | *hint_byte = disk_bytenr; |
771ed689 | 689 | } |
920bbbfb | 690 | key.offset = start; |
6643558d | 691 | } |
920bbbfb YZ |
692 | /* |
693 | * | ---- range to drop ----- | | |
694 | * | -------- extent -------- | | |
695 | */ | |
696 | if (start <= key.offset && end < extent_end) { | |
697 | BUG_ON(extent_type == BTRFS_FILE_EXTENT_INLINE); | |
6643558d | 698 | |
920bbbfb YZ |
699 | memcpy(&new_key, &key, sizeof(new_key)); |
700 | new_key.offset = end; | |
701 | btrfs_set_item_key_safe(trans, root, path, &new_key); | |
6643558d | 702 | |
920bbbfb YZ |
703 | extent_offset += end - key.offset; |
704 | btrfs_set_file_extent_offset(leaf, fi, extent_offset); | |
705 | btrfs_set_file_extent_num_bytes(leaf, fi, | |
706 | extent_end - end); | |
707 | btrfs_mark_buffer_dirty(leaf); | |
708 | if (disk_bytenr > 0) { | |
709 | inode_sub_bytes(inode, end - key.offset); | |
710 | *hint_byte = disk_bytenr; | |
39279cc3 | 711 | } |
920bbbfb | 712 | break; |
39279cc3 | 713 | } |
771ed689 | 714 | |
920bbbfb YZ |
715 | search_start = extent_end; |
716 | /* | |
717 | * | ---- range to drop ----- | | |
718 | * | -------- extent -------- | | |
719 | */ | |
720 | if (start > key.offset && end >= extent_end) { | |
721 | BUG_ON(del_nr > 0); | |
722 | BUG_ON(extent_type == BTRFS_FILE_EXTENT_INLINE); | |
8c2383c3 | 723 | |
920bbbfb YZ |
724 | btrfs_set_file_extent_num_bytes(leaf, fi, |
725 | start - key.offset); | |
726 | btrfs_mark_buffer_dirty(leaf); | |
727 | if (disk_bytenr > 0) { | |
728 | inode_sub_bytes(inode, extent_end - start); | |
729 | *hint_byte = disk_bytenr; | |
730 | } | |
731 | if (end == extent_end) | |
732 | break; | |
c8b97818 | 733 | |
920bbbfb YZ |
734 | path->slots[0]++; |
735 | goto next_slot; | |
31840ae1 ZY |
736 | } |
737 | ||
920bbbfb YZ |
738 | /* |
739 | * | ---- range to drop ----- | | |
740 | * | ------ extent ------ | | |
741 | */ | |
742 | if (start <= key.offset && end >= extent_end) { | |
743 | if (del_nr == 0) { | |
744 | del_slot = path->slots[0]; | |
745 | del_nr = 1; | |
746 | } else { | |
747 | BUG_ON(del_slot + del_nr != path->slots[0]); | |
748 | del_nr++; | |
749 | } | |
31840ae1 | 750 | |
920bbbfb | 751 | if (extent_type == BTRFS_FILE_EXTENT_INLINE) { |
a76a3cd4 | 752 | inode_sub_bytes(inode, |
920bbbfb YZ |
753 | extent_end - key.offset); |
754 | extent_end = ALIGN(extent_end, | |
755 | root->sectorsize); | |
756 | } else if (disk_bytenr > 0) { | |
31840ae1 | 757 | ret = btrfs_free_extent(trans, root, |
920bbbfb YZ |
758 | disk_bytenr, num_bytes, 0, |
759 | root->root_key.objectid, | |
5d4f98a2 | 760 | key.objectid, key.offset - |
66d7e7f0 | 761 | extent_offset, 0); |
79787eaa | 762 | BUG_ON(ret); /* -ENOMEM */ |
920bbbfb YZ |
763 | inode_sub_bytes(inode, |
764 | extent_end - key.offset); | |
765 | *hint_byte = disk_bytenr; | |
31840ae1 | 766 | } |
31840ae1 | 767 | |
920bbbfb YZ |
768 | if (end == extent_end) |
769 | break; | |
770 | ||
771 | if (path->slots[0] + 1 < btrfs_header_nritems(leaf)) { | |
772 | path->slots[0]++; | |
773 | goto next_slot; | |
774 | } | |
775 | ||
776 | ret = btrfs_del_items(trans, root, path, del_slot, | |
777 | del_nr); | |
79787eaa JM |
778 | if (ret) { |
779 | btrfs_abort_transaction(trans, root, ret); | |
780 | goto out; | |
781 | } | |
920bbbfb YZ |
782 | |
783 | del_nr = 0; | |
784 | del_slot = 0; | |
785 | ||
b3b4aa74 | 786 | btrfs_release_path(path); |
920bbbfb | 787 | continue; |
39279cc3 | 788 | } |
920bbbfb YZ |
789 | |
790 | BUG_ON(1); | |
39279cc3 | 791 | } |
920bbbfb | 792 | |
79787eaa | 793 | if (!ret && del_nr > 0) { |
920bbbfb | 794 | ret = btrfs_del_items(trans, root, path, del_slot, del_nr); |
79787eaa JM |
795 | if (ret) |
796 | btrfs_abort_transaction(trans, root, ret); | |
6643558d | 797 | } |
920bbbfb | 798 | |
79787eaa | 799 | out: |
920bbbfb | 800 | btrfs_free_path(path); |
39279cc3 CM |
801 | return ret; |
802 | } | |
803 | ||
d899e052 | 804 | static int extent_mergeable(struct extent_buffer *leaf, int slot, |
6c7d54ac YZ |
805 | u64 objectid, u64 bytenr, u64 orig_offset, |
806 | u64 *start, u64 *end) | |
d899e052 YZ |
807 | { |
808 | struct btrfs_file_extent_item *fi; | |
809 | struct btrfs_key key; | |
810 | u64 extent_end; | |
811 | ||
812 | if (slot < 0 || slot >= btrfs_header_nritems(leaf)) | |
813 | return 0; | |
814 | ||
815 | btrfs_item_key_to_cpu(leaf, &key, slot); | |
816 | if (key.objectid != objectid || key.type != BTRFS_EXTENT_DATA_KEY) | |
817 | return 0; | |
818 | ||
819 | fi = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item); | |
820 | if (btrfs_file_extent_type(leaf, fi) != BTRFS_FILE_EXTENT_REG || | |
821 | btrfs_file_extent_disk_bytenr(leaf, fi) != bytenr || | |
6c7d54ac | 822 | btrfs_file_extent_offset(leaf, fi) != key.offset - orig_offset || |
d899e052 YZ |
823 | btrfs_file_extent_compression(leaf, fi) || |
824 | btrfs_file_extent_encryption(leaf, fi) || | |
825 | btrfs_file_extent_other_encoding(leaf, fi)) | |
826 | return 0; | |
827 | ||
828 | extent_end = key.offset + btrfs_file_extent_num_bytes(leaf, fi); | |
829 | if ((*start && *start != key.offset) || (*end && *end != extent_end)) | |
830 | return 0; | |
831 | ||
832 | *start = key.offset; | |
833 | *end = extent_end; | |
834 | return 1; | |
835 | } | |
836 | ||
837 | /* | |
838 | * Mark extent in the range start - end as written. | |
839 | * | |
840 | * This changes extent type from 'pre-allocated' to 'regular'. If only | |
841 | * part of extent is marked as written, the extent will be split into | |
842 | * two or three. | |
843 | */ | |
844 | int btrfs_mark_extent_written(struct btrfs_trans_handle *trans, | |
d899e052 YZ |
845 | struct inode *inode, u64 start, u64 end) |
846 | { | |
920bbbfb | 847 | struct btrfs_root *root = BTRFS_I(inode)->root; |
d899e052 YZ |
848 | struct extent_buffer *leaf; |
849 | struct btrfs_path *path; | |
850 | struct btrfs_file_extent_item *fi; | |
851 | struct btrfs_key key; | |
920bbbfb | 852 | struct btrfs_key new_key; |
d899e052 YZ |
853 | u64 bytenr; |
854 | u64 num_bytes; | |
855 | u64 extent_end; | |
5d4f98a2 | 856 | u64 orig_offset; |
d899e052 YZ |
857 | u64 other_start; |
858 | u64 other_end; | |
920bbbfb YZ |
859 | u64 split; |
860 | int del_nr = 0; | |
861 | int del_slot = 0; | |
6c7d54ac | 862 | int recow; |
d899e052 | 863 | int ret; |
33345d01 | 864 | u64 ino = btrfs_ino(inode); |
d899e052 YZ |
865 | |
866 | btrfs_drop_extent_cache(inode, start, end - 1, 0); | |
867 | ||
868 | path = btrfs_alloc_path(); | |
d8926bb3 MF |
869 | if (!path) |
870 | return -ENOMEM; | |
d899e052 | 871 | again: |
6c7d54ac | 872 | recow = 0; |
920bbbfb | 873 | split = start; |
33345d01 | 874 | key.objectid = ino; |
d899e052 | 875 | key.type = BTRFS_EXTENT_DATA_KEY; |
920bbbfb | 876 | key.offset = split; |
d899e052 YZ |
877 | |
878 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); | |
41415730 JB |
879 | if (ret < 0) |
880 | goto out; | |
d899e052 YZ |
881 | if (ret > 0 && path->slots[0] > 0) |
882 | path->slots[0]--; | |
883 | ||
884 | leaf = path->nodes[0]; | |
885 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
33345d01 | 886 | BUG_ON(key.objectid != ino || key.type != BTRFS_EXTENT_DATA_KEY); |
d899e052 YZ |
887 | fi = btrfs_item_ptr(leaf, path->slots[0], |
888 | struct btrfs_file_extent_item); | |
920bbbfb YZ |
889 | BUG_ON(btrfs_file_extent_type(leaf, fi) != |
890 | BTRFS_FILE_EXTENT_PREALLOC); | |
d899e052 YZ |
891 | extent_end = key.offset + btrfs_file_extent_num_bytes(leaf, fi); |
892 | BUG_ON(key.offset > start || extent_end < end); | |
893 | ||
894 | bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); | |
895 | num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi); | |
5d4f98a2 | 896 | orig_offset = key.offset - btrfs_file_extent_offset(leaf, fi); |
6c7d54ac YZ |
897 | memcpy(&new_key, &key, sizeof(new_key)); |
898 | ||
899 | if (start == key.offset && end < extent_end) { | |
900 | other_start = 0; | |
901 | other_end = start; | |
902 | if (extent_mergeable(leaf, path->slots[0] - 1, | |
33345d01 | 903 | ino, bytenr, orig_offset, |
6c7d54ac YZ |
904 | &other_start, &other_end)) { |
905 | new_key.offset = end; | |
906 | btrfs_set_item_key_safe(trans, root, path, &new_key); | |
907 | fi = btrfs_item_ptr(leaf, path->slots[0], | |
908 | struct btrfs_file_extent_item); | |
909 | btrfs_set_file_extent_num_bytes(leaf, fi, | |
910 | extent_end - end); | |
911 | btrfs_set_file_extent_offset(leaf, fi, | |
912 | end - orig_offset); | |
913 | fi = btrfs_item_ptr(leaf, path->slots[0] - 1, | |
914 | struct btrfs_file_extent_item); | |
915 | btrfs_set_file_extent_num_bytes(leaf, fi, | |
916 | end - other_start); | |
917 | btrfs_mark_buffer_dirty(leaf); | |
918 | goto out; | |
919 | } | |
920 | } | |
921 | ||
922 | if (start > key.offset && end == extent_end) { | |
923 | other_start = end; | |
924 | other_end = 0; | |
925 | if (extent_mergeable(leaf, path->slots[0] + 1, | |
33345d01 | 926 | ino, bytenr, orig_offset, |
6c7d54ac YZ |
927 | &other_start, &other_end)) { |
928 | fi = btrfs_item_ptr(leaf, path->slots[0], | |
929 | struct btrfs_file_extent_item); | |
930 | btrfs_set_file_extent_num_bytes(leaf, fi, | |
931 | start - key.offset); | |
932 | path->slots[0]++; | |
933 | new_key.offset = start; | |
934 | btrfs_set_item_key_safe(trans, root, path, &new_key); | |
935 | ||
936 | fi = btrfs_item_ptr(leaf, path->slots[0], | |
937 | struct btrfs_file_extent_item); | |
938 | btrfs_set_file_extent_num_bytes(leaf, fi, | |
939 | other_end - start); | |
940 | btrfs_set_file_extent_offset(leaf, fi, | |
941 | start - orig_offset); | |
942 | btrfs_mark_buffer_dirty(leaf); | |
943 | goto out; | |
944 | } | |
945 | } | |
d899e052 | 946 | |
920bbbfb YZ |
947 | while (start > key.offset || end < extent_end) { |
948 | if (key.offset == start) | |
949 | split = end; | |
950 | ||
920bbbfb YZ |
951 | new_key.offset = split; |
952 | ret = btrfs_duplicate_item(trans, root, path, &new_key); | |
953 | if (ret == -EAGAIN) { | |
b3b4aa74 | 954 | btrfs_release_path(path); |
920bbbfb | 955 | goto again; |
d899e052 | 956 | } |
79787eaa JM |
957 | if (ret < 0) { |
958 | btrfs_abort_transaction(trans, root, ret); | |
959 | goto out; | |
960 | } | |
d899e052 | 961 | |
920bbbfb YZ |
962 | leaf = path->nodes[0]; |
963 | fi = btrfs_item_ptr(leaf, path->slots[0] - 1, | |
d899e052 | 964 | struct btrfs_file_extent_item); |
d899e052 | 965 | btrfs_set_file_extent_num_bytes(leaf, fi, |
920bbbfb YZ |
966 | split - key.offset); |
967 | ||
968 | fi = btrfs_item_ptr(leaf, path->slots[0], | |
969 | struct btrfs_file_extent_item); | |
970 | ||
971 | btrfs_set_file_extent_offset(leaf, fi, split - orig_offset); | |
972 | btrfs_set_file_extent_num_bytes(leaf, fi, | |
973 | extent_end - split); | |
d899e052 YZ |
974 | btrfs_mark_buffer_dirty(leaf); |
975 | ||
920bbbfb YZ |
976 | ret = btrfs_inc_extent_ref(trans, root, bytenr, num_bytes, 0, |
977 | root->root_key.objectid, | |
66d7e7f0 | 978 | ino, orig_offset, 0); |
79787eaa | 979 | BUG_ON(ret); /* -ENOMEM */ |
d899e052 | 980 | |
920bbbfb YZ |
981 | if (split == start) { |
982 | key.offset = start; | |
983 | } else { | |
984 | BUG_ON(start != key.offset); | |
d899e052 | 985 | path->slots[0]--; |
920bbbfb | 986 | extent_end = end; |
d899e052 | 987 | } |
6c7d54ac | 988 | recow = 1; |
d899e052 YZ |
989 | } |
990 | ||
920bbbfb YZ |
991 | other_start = end; |
992 | other_end = 0; | |
6c7d54ac | 993 | if (extent_mergeable(leaf, path->slots[0] + 1, |
33345d01 | 994 | ino, bytenr, orig_offset, |
6c7d54ac YZ |
995 | &other_start, &other_end)) { |
996 | if (recow) { | |
b3b4aa74 | 997 | btrfs_release_path(path); |
6c7d54ac YZ |
998 | goto again; |
999 | } | |
920bbbfb YZ |
1000 | extent_end = other_end; |
1001 | del_slot = path->slots[0] + 1; | |
1002 | del_nr++; | |
1003 | ret = btrfs_free_extent(trans, root, bytenr, num_bytes, | |
1004 | 0, root->root_key.objectid, | |
66d7e7f0 | 1005 | ino, orig_offset, 0); |
79787eaa | 1006 | BUG_ON(ret); /* -ENOMEM */ |
d899e052 | 1007 | } |
920bbbfb YZ |
1008 | other_start = 0; |
1009 | other_end = start; | |
6c7d54ac | 1010 | if (extent_mergeable(leaf, path->slots[0] - 1, |
33345d01 | 1011 | ino, bytenr, orig_offset, |
6c7d54ac YZ |
1012 | &other_start, &other_end)) { |
1013 | if (recow) { | |
b3b4aa74 | 1014 | btrfs_release_path(path); |
6c7d54ac YZ |
1015 | goto again; |
1016 | } | |
920bbbfb YZ |
1017 | key.offset = other_start; |
1018 | del_slot = path->slots[0]; | |
1019 | del_nr++; | |
1020 | ret = btrfs_free_extent(trans, root, bytenr, num_bytes, | |
1021 | 0, root->root_key.objectid, | |
66d7e7f0 | 1022 | ino, orig_offset, 0); |
79787eaa | 1023 | BUG_ON(ret); /* -ENOMEM */ |
920bbbfb YZ |
1024 | } |
1025 | if (del_nr == 0) { | |
3f6fae95 SL |
1026 | fi = btrfs_item_ptr(leaf, path->slots[0], |
1027 | struct btrfs_file_extent_item); | |
920bbbfb YZ |
1028 | btrfs_set_file_extent_type(leaf, fi, |
1029 | BTRFS_FILE_EXTENT_REG); | |
1030 | btrfs_mark_buffer_dirty(leaf); | |
6c7d54ac | 1031 | } else { |
3f6fae95 SL |
1032 | fi = btrfs_item_ptr(leaf, del_slot - 1, |
1033 | struct btrfs_file_extent_item); | |
6c7d54ac YZ |
1034 | btrfs_set_file_extent_type(leaf, fi, |
1035 | BTRFS_FILE_EXTENT_REG); | |
1036 | btrfs_set_file_extent_num_bytes(leaf, fi, | |
1037 | extent_end - key.offset); | |
1038 | btrfs_mark_buffer_dirty(leaf); | |
920bbbfb | 1039 | |
6c7d54ac | 1040 | ret = btrfs_del_items(trans, root, path, del_slot, del_nr); |
79787eaa JM |
1041 | if (ret < 0) { |
1042 | btrfs_abort_transaction(trans, root, ret); | |
1043 | goto out; | |
1044 | } | |
6c7d54ac | 1045 | } |
920bbbfb | 1046 | out: |
d899e052 YZ |
1047 | btrfs_free_path(path); |
1048 | return 0; | |
1049 | } | |
1050 | ||
b1bf862e CM |
1051 | /* |
1052 | * on error we return an unlocked page and the error value | |
1053 | * on success we return a locked page and 0 | |
1054 | */ | |
b6316429 JB |
1055 | static int prepare_uptodate_page(struct page *page, u64 pos, |
1056 | bool force_uptodate) | |
b1bf862e CM |
1057 | { |
1058 | int ret = 0; | |
1059 | ||
b6316429 JB |
1060 | if (((pos & (PAGE_CACHE_SIZE - 1)) || force_uptodate) && |
1061 | !PageUptodate(page)) { | |
b1bf862e CM |
1062 | ret = btrfs_readpage(NULL, page); |
1063 | if (ret) | |
1064 | return ret; | |
1065 | lock_page(page); | |
1066 | if (!PageUptodate(page)) { | |
1067 | unlock_page(page); | |
1068 | return -EIO; | |
1069 | } | |
1070 | } | |
1071 | return 0; | |
1072 | } | |
1073 | ||
39279cc3 | 1074 | /* |
d352ac68 CM |
1075 | * this gets pages into the page cache and locks them down, it also properly |
1076 | * waits for data=ordered extents to finish before allowing the pages to be | |
1077 | * modified. | |
39279cc3 | 1078 | */ |
d397712b | 1079 | static noinline int prepare_pages(struct btrfs_root *root, struct file *file, |
98ed5174 CM |
1080 | struct page **pages, size_t num_pages, |
1081 | loff_t pos, unsigned long first_index, | |
b6316429 | 1082 | size_t write_bytes, bool force_uptodate) |
39279cc3 | 1083 | { |
2ac55d41 | 1084 | struct extent_state *cached_state = NULL; |
39279cc3 CM |
1085 | int i; |
1086 | unsigned long index = pos >> PAGE_CACHE_SHIFT; | |
6da6abae | 1087 | struct inode *inode = fdentry(file)->d_inode; |
3b16a4e3 | 1088 | gfp_t mask = btrfs_alloc_write_mask(inode->i_mapping); |
39279cc3 | 1089 | int err = 0; |
b1bf862e | 1090 | int faili = 0; |
8c2383c3 | 1091 | u64 start_pos; |
e6dcd2dc | 1092 | u64 last_pos; |
8c2383c3 | 1093 | |
5f39d397 | 1094 | start_pos = pos & ~((u64)root->sectorsize - 1); |
e6dcd2dc | 1095 | last_pos = ((u64)index + num_pages) << PAGE_CACHE_SHIFT; |
39279cc3 | 1096 | |
e6dcd2dc | 1097 | again: |
39279cc3 | 1098 | for (i = 0; i < num_pages; i++) { |
a94733d0 | 1099 | pages[i] = find_or_create_page(inode->i_mapping, index + i, |
e3a41a5b | 1100 | mask | __GFP_WRITE); |
39279cc3 | 1101 | if (!pages[i]) { |
b1bf862e CM |
1102 | faili = i - 1; |
1103 | err = -ENOMEM; | |
1104 | goto fail; | |
1105 | } | |
1106 | ||
1107 | if (i == 0) | |
b6316429 JB |
1108 | err = prepare_uptodate_page(pages[i], pos, |
1109 | force_uptodate); | |
b1bf862e CM |
1110 | if (i == num_pages - 1) |
1111 | err = prepare_uptodate_page(pages[i], | |
b6316429 | 1112 | pos + write_bytes, false); |
b1bf862e CM |
1113 | if (err) { |
1114 | page_cache_release(pages[i]); | |
1115 | faili = i - 1; | |
1116 | goto fail; | |
39279cc3 | 1117 | } |
ccd467d6 | 1118 | wait_on_page_writeback(pages[i]); |
39279cc3 | 1119 | } |
b1bf862e | 1120 | err = 0; |
0762704b | 1121 | if (start_pos < inode->i_size) { |
e6dcd2dc | 1122 | struct btrfs_ordered_extent *ordered; |
2ac55d41 | 1123 | lock_extent_bits(&BTRFS_I(inode)->io_tree, |
d0082371 | 1124 | start_pos, last_pos - 1, 0, &cached_state); |
d397712b CM |
1125 | ordered = btrfs_lookup_first_ordered_extent(inode, |
1126 | last_pos - 1); | |
e6dcd2dc CM |
1127 | if (ordered && |
1128 | ordered->file_offset + ordered->len > start_pos && | |
1129 | ordered->file_offset < last_pos) { | |
1130 | btrfs_put_ordered_extent(ordered); | |
2ac55d41 JB |
1131 | unlock_extent_cached(&BTRFS_I(inode)->io_tree, |
1132 | start_pos, last_pos - 1, | |
1133 | &cached_state, GFP_NOFS); | |
e6dcd2dc CM |
1134 | for (i = 0; i < num_pages; i++) { |
1135 | unlock_page(pages[i]); | |
1136 | page_cache_release(pages[i]); | |
1137 | } | |
1138 | btrfs_wait_ordered_range(inode, start_pos, | |
1139 | last_pos - start_pos); | |
1140 | goto again; | |
1141 | } | |
1142 | if (ordered) | |
1143 | btrfs_put_ordered_extent(ordered); | |
1144 | ||
2ac55d41 | 1145 | clear_extent_bit(&BTRFS_I(inode)->io_tree, start_pos, |
32c00aff | 1146 | last_pos - 1, EXTENT_DIRTY | EXTENT_DELALLOC | |
2ac55d41 | 1147 | EXTENT_DO_ACCOUNTING, 0, 0, &cached_state, |
0762704b | 1148 | GFP_NOFS); |
2ac55d41 JB |
1149 | unlock_extent_cached(&BTRFS_I(inode)->io_tree, |
1150 | start_pos, last_pos - 1, &cached_state, | |
1151 | GFP_NOFS); | |
0762704b | 1152 | } |
e6dcd2dc | 1153 | for (i = 0; i < num_pages; i++) { |
32c7f202 WF |
1154 | if (clear_page_dirty_for_io(pages[i])) |
1155 | account_page_redirty(pages[i]); | |
e6dcd2dc CM |
1156 | set_page_extent_mapped(pages[i]); |
1157 | WARN_ON(!PageLocked(pages[i])); | |
1158 | } | |
39279cc3 | 1159 | return 0; |
b1bf862e CM |
1160 | fail: |
1161 | while (faili >= 0) { | |
1162 | unlock_page(pages[faili]); | |
1163 | page_cache_release(pages[faili]); | |
1164 | faili--; | |
1165 | } | |
1166 | return err; | |
1167 | ||
39279cc3 CM |
1168 | } |
1169 | ||
d0215f3e JB |
1170 | static noinline ssize_t __btrfs_buffered_write(struct file *file, |
1171 | struct iov_iter *i, | |
1172 | loff_t pos) | |
4b46fce2 | 1173 | { |
11c65dcc JB |
1174 | struct inode *inode = fdentry(file)->d_inode; |
1175 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
11c65dcc | 1176 | struct page **pages = NULL; |
39279cc3 | 1177 | unsigned long first_index; |
d0215f3e JB |
1178 | size_t num_written = 0; |
1179 | int nrptrs; | |
c9149235 | 1180 | int ret = 0; |
b6316429 | 1181 | bool force_page_uptodate = false; |
4b46fce2 | 1182 | |
d0215f3e | 1183 | nrptrs = min((iov_iter_count(i) + PAGE_CACHE_SIZE - 1) / |
11c65dcc JB |
1184 | PAGE_CACHE_SIZE, PAGE_CACHE_SIZE / |
1185 | (sizeof(struct page *))); | |
142349f5 WF |
1186 | nrptrs = min(nrptrs, current->nr_dirtied_pause - current->nr_dirtied); |
1187 | nrptrs = max(nrptrs, 8); | |
8c2383c3 | 1188 | pages = kmalloc(nrptrs * sizeof(struct page *), GFP_KERNEL); |
d0215f3e JB |
1189 | if (!pages) |
1190 | return -ENOMEM; | |
ab93dbec | 1191 | |
39279cc3 | 1192 | first_index = pos >> PAGE_CACHE_SHIFT; |
39279cc3 | 1193 | |
d0215f3e | 1194 | while (iov_iter_count(i) > 0) { |
39279cc3 | 1195 | size_t offset = pos & (PAGE_CACHE_SIZE - 1); |
d0215f3e | 1196 | size_t write_bytes = min(iov_iter_count(i), |
11c65dcc | 1197 | nrptrs * (size_t)PAGE_CACHE_SIZE - |
8c2383c3 | 1198 | offset); |
3a90983d YZ |
1199 | size_t num_pages = (write_bytes + offset + |
1200 | PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT; | |
d0215f3e JB |
1201 | size_t dirty_pages; |
1202 | size_t copied; | |
39279cc3 | 1203 | |
8c2383c3 | 1204 | WARN_ON(num_pages > nrptrs); |
1832a6d5 | 1205 | |
914ee295 XZ |
1206 | /* |
1207 | * Fault pages before locking them in prepare_pages | |
1208 | * to avoid recursive lock | |
1209 | */ | |
d0215f3e | 1210 | if (unlikely(iov_iter_fault_in_readable(i, write_bytes))) { |
914ee295 | 1211 | ret = -EFAULT; |
d0215f3e | 1212 | break; |
914ee295 XZ |
1213 | } |
1214 | ||
1215 | ret = btrfs_delalloc_reserve_space(inode, | |
1216 | num_pages << PAGE_CACHE_SHIFT); | |
1832a6d5 | 1217 | if (ret) |
d0215f3e | 1218 | break; |
1832a6d5 | 1219 | |
4a64001f JB |
1220 | /* |
1221 | * This is going to setup the pages array with the number of | |
1222 | * pages we want, so we don't really need to worry about the | |
1223 | * contents of pages from loop to loop | |
1224 | */ | |
39279cc3 | 1225 | ret = prepare_pages(root, file, pages, num_pages, |
b6316429 JB |
1226 | pos, first_index, write_bytes, |
1227 | force_page_uptodate); | |
6a63209f | 1228 | if (ret) { |
914ee295 XZ |
1229 | btrfs_delalloc_release_space(inode, |
1230 | num_pages << PAGE_CACHE_SHIFT); | |
d0215f3e | 1231 | break; |
6a63209f | 1232 | } |
39279cc3 | 1233 | |
914ee295 | 1234 | copied = btrfs_copy_from_user(pos, num_pages, |
d0215f3e | 1235 | write_bytes, pages, i); |
b1bf862e CM |
1236 | |
1237 | /* | |
1238 | * if we have trouble faulting in the pages, fall | |
1239 | * back to one page at a time | |
1240 | */ | |
1241 | if (copied < write_bytes) | |
1242 | nrptrs = 1; | |
1243 | ||
b6316429 JB |
1244 | if (copied == 0) { |
1245 | force_page_uptodate = true; | |
b1bf862e | 1246 | dirty_pages = 0; |
b6316429 JB |
1247 | } else { |
1248 | force_page_uptodate = false; | |
b1bf862e CM |
1249 | dirty_pages = (copied + offset + |
1250 | PAGE_CACHE_SIZE - 1) >> | |
1251 | PAGE_CACHE_SHIFT; | |
b6316429 | 1252 | } |
914ee295 | 1253 | |
d0215f3e JB |
1254 | /* |
1255 | * If we had a short copy we need to release the excess delaloc | |
1256 | * bytes we reserved. We need to increment outstanding_extents | |
1257 | * because btrfs_delalloc_release_space will decrement it, but | |
1258 | * we still have an outstanding extent for the chunk we actually | |
1259 | * managed to copy. | |
1260 | */ | |
914ee295 | 1261 | if (num_pages > dirty_pages) { |
9e0baf60 JB |
1262 | if (copied > 0) { |
1263 | spin_lock(&BTRFS_I(inode)->lock); | |
1264 | BTRFS_I(inode)->outstanding_extents++; | |
1265 | spin_unlock(&BTRFS_I(inode)->lock); | |
1266 | } | |
914ee295 XZ |
1267 | btrfs_delalloc_release_space(inode, |
1268 | (num_pages - dirty_pages) << | |
1269 | PAGE_CACHE_SHIFT); | |
1270 | } | |
1271 | ||
1272 | if (copied > 0) { | |
be1a12a0 JB |
1273 | ret = btrfs_dirty_pages(root, inode, pages, |
1274 | dirty_pages, pos, copied, | |
1275 | NULL); | |
d0215f3e JB |
1276 | if (ret) { |
1277 | btrfs_delalloc_release_space(inode, | |
1278 | dirty_pages << PAGE_CACHE_SHIFT); | |
1279 | btrfs_drop_pages(pages, num_pages); | |
1280 | break; | |
1281 | } | |
54aa1f4d | 1282 | } |
39279cc3 | 1283 | |
39279cc3 CM |
1284 | btrfs_drop_pages(pages, num_pages); |
1285 | ||
d0215f3e JB |
1286 | cond_resched(); |
1287 | ||
1288 | balance_dirty_pages_ratelimited_nr(inode->i_mapping, | |
1289 | dirty_pages); | |
1290 | if (dirty_pages < (root->leafsize >> PAGE_CACHE_SHIFT) + 1) | |
1291 | btrfs_btree_balance_dirty(root, 1); | |
cb843a6f | 1292 | |
914ee295 XZ |
1293 | pos += copied; |
1294 | num_written += copied; | |
d0215f3e | 1295 | } |
39279cc3 | 1296 | |
d0215f3e JB |
1297 | kfree(pages); |
1298 | ||
1299 | return num_written ? num_written : ret; | |
1300 | } | |
1301 | ||
1302 | static ssize_t __btrfs_direct_write(struct kiocb *iocb, | |
1303 | const struct iovec *iov, | |
1304 | unsigned long nr_segs, loff_t pos, | |
1305 | loff_t *ppos, size_t count, size_t ocount) | |
1306 | { | |
1307 | struct file *file = iocb->ki_filp; | |
1308 | struct inode *inode = fdentry(file)->d_inode; | |
1309 | struct iov_iter i; | |
1310 | ssize_t written; | |
1311 | ssize_t written_buffered; | |
1312 | loff_t endbyte; | |
1313 | int err; | |
1314 | ||
1315 | written = generic_file_direct_write(iocb, iov, &nr_segs, pos, ppos, | |
1316 | count, ocount); | |
1317 | ||
1318 | /* | |
1319 | * the generic O_DIRECT will update in-memory i_size after the | |
1320 | * DIOs are done. But our endio handlers that update the on | |
1321 | * disk i_size never update past the in memory i_size. So we | |
1322 | * need one more update here to catch any additions to the | |
1323 | * file | |
1324 | */ | |
1325 | if (inode->i_size != BTRFS_I(inode)->disk_i_size) { | |
1326 | btrfs_ordered_update_i_size(inode, inode->i_size, NULL); | |
1327 | mark_inode_dirty(inode); | |
1328 | } | |
1329 | ||
1330 | if (written < 0 || written == count) | |
1331 | return written; | |
1332 | ||
1333 | pos += written; | |
1334 | count -= written; | |
1335 | iov_iter_init(&i, iov, nr_segs, count, written); | |
1336 | written_buffered = __btrfs_buffered_write(file, &i, pos); | |
1337 | if (written_buffered < 0) { | |
1338 | err = written_buffered; | |
1339 | goto out; | |
39279cc3 | 1340 | } |
d0215f3e JB |
1341 | endbyte = pos + written_buffered - 1; |
1342 | err = filemap_write_and_wait_range(file->f_mapping, pos, endbyte); | |
1343 | if (err) | |
1344 | goto out; | |
1345 | written += written_buffered; | |
1346 | *ppos = pos + written_buffered; | |
1347 | invalidate_mapping_pages(file->f_mapping, pos >> PAGE_CACHE_SHIFT, | |
1348 | endbyte >> PAGE_CACHE_SHIFT); | |
39279cc3 | 1349 | out: |
d0215f3e JB |
1350 | return written ? written : err; |
1351 | } | |
5b92ee72 | 1352 | |
d0215f3e JB |
1353 | static ssize_t btrfs_file_aio_write(struct kiocb *iocb, |
1354 | const struct iovec *iov, | |
1355 | unsigned long nr_segs, loff_t pos) | |
1356 | { | |
1357 | struct file *file = iocb->ki_filp; | |
1358 | struct inode *inode = fdentry(file)->d_inode; | |
1359 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
1360 | loff_t *ppos = &iocb->ki_pos; | |
0c1a98c8 | 1361 | u64 start_pos; |
d0215f3e JB |
1362 | ssize_t num_written = 0; |
1363 | ssize_t err = 0; | |
1364 | size_t count, ocount; | |
1365 | ||
1366 | vfs_check_frozen(inode->i_sb, SB_FREEZE_WRITE); | |
1367 | ||
1368 | mutex_lock(&inode->i_mutex); | |
1369 | ||
1370 | err = generic_segment_checks(iov, &nr_segs, &ocount, VERIFY_READ); | |
1371 | if (err) { | |
1372 | mutex_unlock(&inode->i_mutex); | |
1373 | goto out; | |
1374 | } | |
1375 | count = ocount; | |
1376 | ||
1377 | current->backing_dev_info = inode->i_mapping->backing_dev_info; | |
1378 | err = generic_write_checks(file, &pos, &count, S_ISBLK(inode->i_mode)); | |
1379 | if (err) { | |
1380 | mutex_unlock(&inode->i_mutex); | |
1381 | goto out; | |
1382 | } | |
1383 | ||
1384 | if (count == 0) { | |
1385 | mutex_unlock(&inode->i_mutex); | |
1386 | goto out; | |
1387 | } | |
1388 | ||
1389 | err = file_remove_suid(file); | |
1390 | if (err) { | |
1391 | mutex_unlock(&inode->i_mutex); | |
1392 | goto out; | |
1393 | } | |
1394 | ||
1395 | /* | |
1396 | * If BTRFS flips readonly due to some impossible error | |
1397 | * (fs_info->fs_state now has BTRFS_SUPER_FLAG_ERROR), | |
1398 | * although we have opened a file as writable, we have | |
1399 | * to stop this write operation to ensure FS consistency. | |
1400 | */ | |
1401 | if (root->fs_info->fs_state & BTRFS_SUPER_FLAG_ERROR) { | |
1402 | mutex_unlock(&inode->i_mutex); | |
1403 | err = -EROFS; | |
1404 | goto out; | |
1405 | } | |
1406 | ||
22c44fe6 JB |
1407 | err = btrfs_update_time(file); |
1408 | if (err) { | |
1409 | mutex_unlock(&inode->i_mutex); | |
1410 | goto out; | |
1411 | } | |
d0215f3e | 1412 | |
0c1a98c8 MX |
1413 | start_pos = round_down(pos, root->sectorsize); |
1414 | if (start_pos > i_size_read(inode)) { | |
1415 | err = btrfs_cont_expand(inode, i_size_read(inode), start_pos); | |
1416 | if (err) { | |
1417 | mutex_unlock(&inode->i_mutex); | |
1418 | goto out; | |
1419 | } | |
1420 | } | |
1421 | ||
d0215f3e JB |
1422 | if (unlikely(file->f_flags & O_DIRECT)) { |
1423 | num_written = __btrfs_direct_write(iocb, iov, nr_segs, | |
1424 | pos, ppos, count, ocount); | |
1425 | } else { | |
1426 | struct iov_iter i; | |
1427 | ||
1428 | iov_iter_init(&i, iov, nr_segs, count, num_written); | |
1429 | ||
1430 | num_written = __btrfs_buffered_write(file, &i, pos); | |
1431 | if (num_written > 0) | |
1432 | *ppos = pos + num_written; | |
1433 | } | |
1434 | ||
1435 | mutex_unlock(&inode->i_mutex); | |
2ff3e9b6 | 1436 | |
5a3f23d5 CM |
1437 | /* |
1438 | * we want to make sure fsync finds this change | |
1439 | * but we haven't joined a transaction running right now. | |
1440 | * | |
1441 | * Later on, someone is sure to update the inode and get the | |
1442 | * real transid recorded. | |
1443 | * | |
1444 | * We set last_trans now to the fs_info generation + 1, | |
1445 | * this will either be one more than the running transaction | |
1446 | * or the generation used for the next transaction if there isn't | |
1447 | * one running right now. | |
1448 | */ | |
1449 | BTRFS_I(inode)->last_trans = root->fs_info->generation + 1; | |
d0215f3e JB |
1450 | if (num_written > 0 || num_written == -EIOCBQUEUED) { |
1451 | err = generic_write_sync(file, pos, num_written); | |
1452 | if (err < 0 && num_written > 0) | |
2ff3e9b6 CM |
1453 | num_written = err; |
1454 | } | |
d0215f3e | 1455 | out: |
39279cc3 | 1456 | current->backing_dev_info = NULL; |
39279cc3 CM |
1457 | return num_written ? num_written : err; |
1458 | } | |
1459 | ||
d397712b | 1460 | int btrfs_release_file(struct inode *inode, struct file *filp) |
e1b81e67 | 1461 | { |
5a3f23d5 CM |
1462 | /* |
1463 | * ordered_data_close is set by settattr when we are about to truncate | |
1464 | * a file from a non-zero size to a zero size. This tries to | |
1465 | * flush down new bytes that may have been written if the | |
1466 | * application were using truncate to replace a file in place. | |
1467 | */ | |
1468 | if (BTRFS_I(inode)->ordered_data_close) { | |
1469 | BTRFS_I(inode)->ordered_data_close = 0; | |
1470 | btrfs_add_ordered_operation(NULL, BTRFS_I(inode)->root, inode); | |
1471 | if (inode->i_size > BTRFS_ORDERED_OPERATIONS_FLUSH_LIMIT) | |
1472 | filemap_flush(inode->i_mapping); | |
1473 | } | |
6bf13c0c SW |
1474 | if (filp->private_data) |
1475 | btrfs_ioctl_trans_end(filp); | |
e1b81e67 M |
1476 | return 0; |
1477 | } | |
1478 | ||
d352ac68 CM |
1479 | /* |
1480 | * fsync call for both files and directories. This logs the inode into | |
1481 | * the tree log instead of forcing full commits whenever possible. | |
1482 | * | |
1483 | * It needs to call filemap_fdatawait so that all ordered extent updates are | |
1484 | * in the metadata btree are up to date for copying to the log. | |
1485 | * | |
1486 | * It drops the inode mutex before doing the tree log commit. This is an | |
1487 | * important optimization for directories because holding the mutex prevents | |
1488 | * new operations on the dir while we write to disk. | |
1489 | */ | |
02c24a82 | 1490 | int btrfs_sync_file(struct file *file, loff_t start, loff_t end, int datasync) |
39279cc3 | 1491 | { |
7ea80859 | 1492 | struct dentry *dentry = file->f_path.dentry; |
39279cc3 CM |
1493 | struct inode *inode = dentry->d_inode; |
1494 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
15ee9bc7 | 1495 | int ret = 0; |
39279cc3 CM |
1496 | struct btrfs_trans_handle *trans; |
1497 | ||
1abe9b8a | 1498 | trace_btrfs_sync_file(file, datasync); |
257c62e1 | 1499 | |
02c24a82 JB |
1500 | ret = filemap_write_and_wait_range(inode->i_mapping, start, end); |
1501 | if (ret) | |
1502 | return ret; | |
1503 | mutex_lock(&inode->i_mutex); | |
1504 | ||
257c62e1 CM |
1505 | /* we wait first, since the writeback may change the inode */ |
1506 | root->log_batch++; | |
257c62e1 CM |
1507 | btrfs_wait_ordered_range(inode, 0, (u64)-1); |
1508 | root->log_batch++; | |
1509 | ||
39279cc3 | 1510 | /* |
15ee9bc7 JB |
1511 | * check the transaction that last modified this inode |
1512 | * and see if its already been committed | |
39279cc3 | 1513 | */ |
02c24a82 JB |
1514 | if (!BTRFS_I(inode)->last_trans) { |
1515 | mutex_unlock(&inode->i_mutex); | |
15ee9bc7 | 1516 | goto out; |
02c24a82 | 1517 | } |
a2135011 | 1518 | |
257c62e1 CM |
1519 | /* |
1520 | * if the last transaction that changed this file was before | |
1521 | * the current transaction, we can bail out now without any | |
1522 | * syncing | |
1523 | */ | |
a4abeea4 | 1524 | smp_mb(); |
15ee9bc7 JB |
1525 | if (BTRFS_I(inode)->last_trans <= |
1526 | root->fs_info->last_trans_committed) { | |
1527 | BTRFS_I(inode)->last_trans = 0; | |
02c24a82 | 1528 | mutex_unlock(&inode->i_mutex); |
15ee9bc7 JB |
1529 | goto out; |
1530 | } | |
15ee9bc7 JB |
1531 | |
1532 | /* | |
a52d9a80 CM |
1533 | * ok we haven't committed the transaction yet, lets do a commit |
1534 | */ | |
6f902af4 | 1535 | if (file->private_data) |
6bf13c0c SW |
1536 | btrfs_ioctl_trans_end(file); |
1537 | ||
a22285a6 YZ |
1538 | trans = btrfs_start_transaction(root, 0); |
1539 | if (IS_ERR(trans)) { | |
1540 | ret = PTR_ERR(trans); | |
02c24a82 | 1541 | mutex_unlock(&inode->i_mutex); |
39279cc3 CM |
1542 | goto out; |
1543 | } | |
e02119d5 | 1544 | |
2cfbd50b | 1545 | ret = btrfs_log_dentry_safe(trans, root, dentry); |
02c24a82 JB |
1546 | if (ret < 0) { |
1547 | mutex_unlock(&inode->i_mutex); | |
e02119d5 | 1548 | goto out; |
02c24a82 | 1549 | } |
49eb7e46 CM |
1550 | |
1551 | /* we've logged all the items and now have a consistent | |
1552 | * version of the file in the log. It is possible that | |
1553 | * someone will come in and modify the file, but that's | |
1554 | * fine because the log is consistent on disk, and we | |
1555 | * have references to all of the file's extents | |
1556 | * | |
1557 | * It is possible that someone will come in and log the | |
1558 | * file again, but that will end up using the synchronization | |
1559 | * inside btrfs_sync_log to keep things safe. | |
1560 | */ | |
02c24a82 | 1561 | mutex_unlock(&inode->i_mutex); |
49eb7e46 | 1562 | |
257c62e1 CM |
1563 | if (ret != BTRFS_NO_LOG_SYNC) { |
1564 | if (ret > 0) { | |
12fcfd22 | 1565 | ret = btrfs_commit_transaction(trans, root); |
257c62e1 CM |
1566 | } else { |
1567 | ret = btrfs_sync_log(trans, root); | |
1568 | if (ret == 0) | |
1569 | ret = btrfs_end_transaction(trans, root); | |
1570 | else | |
1571 | ret = btrfs_commit_transaction(trans, root); | |
1572 | } | |
1573 | } else { | |
1574 | ret = btrfs_end_transaction(trans, root); | |
e02119d5 | 1575 | } |
39279cc3 | 1576 | out: |
014e4ac4 | 1577 | return ret > 0 ? -EIO : ret; |
39279cc3 CM |
1578 | } |
1579 | ||
f0f37e2f | 1580 | static const struct vm_operations_struct btrfs_file_vm_ops = { |
92fee66d | 1581 | .fault = filemap_fault, |
9ebefb18 CM |
1582 | .page_mkwrite = btrfs_page_mkwrite, |
1583 | }; | |
1584 | ||
1585 | static int btrfs_file_mmap(struct file *filp, struct vm_area_struct *vma) | |
1586 | { | |
058a457e MX |
1587 | struct address_space *mapping = filp->f_mapping; |
1588 | ||
1589 | if (!mapping->a_ops->readpage) | |
1590 | return -ENOEXEC; | |
1591 | ||
9ebefb18 | 1592 | file_accessed(filp); |
058a457e MX |
1593 | vma->vm_ops = &btrfs_file_vm_ops; |
1594 | vma->vm_flags |= VM_CAN_NONLINEAR; | |
1595 | ||
9ebefb18 CM |
1596 | return 0; |
1597 | } | |
1598 | ||
2fe17c10 CH |
1599 | static long btrfs_fallocate(struct file *file, int mode, |
1600 | loff_t offset, loff_t len) | |
1601 | { | |
1602 | struct inode *inode = file->f_path.dentry->d_inode; | |
1603 | struct extent_state *cached_state = NULL; | |
1604 | u64 cur_offset; | |
1605 | u64 last_byte; | |
1606 | u64 alloc_start; | |
1607 | u64 alloc_end; | |
1608 | u64 alloc_hint = 0; | |
1609 | u64 locked_end; | |
1610 | u64 mask = BTRFS_I(inode)->root->sectorsize - 1; | |
1611 | struct extent_map *em; | |
1612 | int ret; | |
1613 | ||
1614 | alloc_start = offset & ~mask; | |
1615 | alloc_end = (offset + len + mask) & ~mask; | |
1616 | ||
1617 | /* We only support the FALLOC_FL_KEEP_SIZE mode */ | |
1618 | if (mode & ~FALLOC_FL_KEEP_SIZE) | |
1619 | return -EOPNOTSUPP; | |
1620 | ||
d98456fc CM |
1621 | /* |
1622 | * Make sure we have enough space before we do the | |
1623 | * allocation. | |
1624 | */ | |
1625 | ret = btrfs_check_data_free_space(inode, len); | |
1626 | if (ret) | |
1627 | return ret; | |
1628 | ||
2fe17c10 CH |
1629 | /* |
1630 | * wait for ordered IO before we have any locks. We'll loop again | |
1631 | * below with the locks held. | |
1632 | */ | |
1633 | btrfs_wait_ordered_range(inode, alloc_start, alloc_end - alloc_start); | |
1634 | ||
1635 | mutex_lock(&inode->i_mutex); | |
1636 | ret = inode_newsize_ok(inode, alloc_end); | |
1637 | if (ret) | |
1638 | goto out; | |
1639 | ||
1640 | if (alloc_start > inode->i_size) { | |
a41ad394 JB |
1641 | ret = btrfs_cont_expand(inode, i_size_read(inode), |
1642 | alloc_start); | |
2fe17c10 CH |
1643 | if (ret) |
1644 | goto out; | |
1645 | } | |
1646 | ||
2fe17c10 CH |
1647 | locked_end = alloc_end - 1; |
1648 | while (1) { | |
1649 | struct btrfs_ordered_extent *ordered; | |
1650 | ||
1651 | /* the extent lock is ordered inside the running | |
1652 | * transaction | |
1653 | */ | |
1654 | lock_extent_bits(&BTRFS_I(inode)->io_tree, alloc_start, | |
d0082371 | 1655 | locked_end, 0, &cached_state); |
2fe17c10 CH |
1656 | ordered = btrfs_lookup_first_ordered_extent(inode, |
1657 | alloc_end - 1); | |
1658 | if (ordered && | |
1659 | ordered->file_offset + ordered->len > alloc_start && | |
1660 | ordered->file_offset < alloc_end) { | |
1661 | btrfs_put_ordered_extent(ordered); | |
1662 | unlock_extent_cached(&BTRFS_I(inode)->io_tree, | |
1663 | alloc_start, locked_end, | |
1664 | &cached_state, GFP_NOFS); | |
1665 | /* | |
1666 | * we can't wait on the range with the transaction | |
1667 | * running or with the extent lock held | |
1668 | */ | |
1669 | btrfs_wait_ordered_range(inode, alloc_start, | |
1670 | alloc_end - alloc_start); | |
1671 | } else { | |
1672 | if (ordered) | |
1673 | btrfs_put_ordered_extent(ordered); | |
1674 | break; | |
1675 | } | |
1676 | } | |
1677 | ||
1678 | cur_offset = alloc_start; | |
1679 | while (1) { | |
f1e490a7 JB |
1680 | u64 actual_end; |
1681 | ||
2fe17c10 CH |
1682 | em = btrfs_get_extent(inode, NULL, 0, cur_offset, |
1683 | alloc_end - cur_offset, 0); | |
79787eaa JM |
1684 | if (IS_ERR_OR_NULL(em)) { |
1685 | if (!em) | |
1686 | ret = -ENOMEM; | |
1687 | else | |
1688 | ret = PTR_ERR(em); | |
1689 | break; | |
1690 | } | |
2fe17c10 | 1691 | last_byte = min(extent_map_end(em), alloc_end); |
f1e490a7 | 1692 | actual_end = min_t(u64, extent_map_end(em), offset + len); |
2fe17c10 | 1693 | last_byte = (last_byte + mask) & ~mask; |
f1e490a7 | 1694 | |
2fe17c10 CH |
1695 | if (em->block_start == EXTENT_MAP_HOLE || |
1696 | (cur_offset >= inode->i_size && | |
1697 | !test_bit(EXTENT_FLAG_PREALLOC, &em->flags))) { | |
1698 | ret = btrfs_prealloc_file_range(inode, mode, cur_offset, | |
1699 | last_byte - cur_offset, | |
1700 | 1 << inode->i_blkbits, | |
1701 | offset + len, | |
1702 | &alloc_hint); | |
1b9c332b | 1703 | |
2fe17c10 CH |
1704 | if (ret < 0) { |
1705 | free_extent_map(em); | |
1706 | break; | |
1707 | } | |
f1e490a7 JB |
1708 | } else if (actual_end > inode->i_size && |
1709 | !(mode & FALLOC_FL_KEEP_SIZE)) { | |
1710 | /* | |
1711 | * We didn't need to allocate any more space, but we | |
1712 | * still extended the size of the file so we need to | |
1713 | * update i_size. | |
1714 | */ | |
1715 | inode->i_ctime = CURRENT_TIME; | |
1716 | i_size_write(inode, actual_end); | |
1717 | btrfs_ordered_update_i_size(inode, actual_end, NULL); | |
2fe17c10 CH |
1718 | } |
1719 | free_extent_map(em); | |
1720 | ||
1721 | cur_offset = last_byte; | |
1722 | if (cur_offset >= alloc_end) { | |
1723 | ret = 0; | |
1724 | break; | |
1725 | } | |
1726 | } | |
1727 | unlock_extent_cached(&BTRFS_I(inode)->io_tree, alloc_start, locked_end, | |
1728 | &cached_state, GFP_NOFS); | |
2fe17c10 CH |
1729 | out: |
1730 | mutex_unlock(&inode->i_mutex); | |
d98456fc CM |
1731 | /* Let go of our reservation. */ |
1732 | btrfs_free_reserved_data_space(inode, len); | |
2fe17c10 CH |
1733 | return ret; |
1734 | } | |
1735 | ||
b2675157 JB |
1736 | static int find_desired_extent(struct inode *inode, loff_t *offset, int origin) |
1737 | { | |
1738 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
1739 | struct extent_map *em; | |
1740 | struct extent_state *cached_state = NULL; | |
1741 | u64 lockstart = *offset; | |
1742 | u64 lockend = i_size_read(inode); | |
1743 | u64 start = *offset; | |
1744 | u64 orig_start = *offset; | |
1745 | u64 len = i_size_read(inode); | |
1746 | u64 last_end = 0; | |
1747 | int ret = 0; | |
1748 | ||
1749 | lockend = max_t(u64, root->sectorsize, lockend); | |
1750 | if (lockend <= lockstart) | |
1751 | lockend = lockstart + root->sectorsize; | |
1752 | ||
1753 | len = lockend - lockstart + 1; | |
1754 | ||
1755 | len = max_t(u64, len, root->sectorsize); | |
1756 | if (inode->i_size == 0) | |
1757 | return -ENXIO; | |
1758 | ||
1759 | lock_extent_bits(&BTRFS_I(inode)->io_tree, lockstart, lockend, 0, | |
d0082371 | 1760 | &cached_state); |
b2675157 JB |
1761 | |
1762 | /* | |
1763 | * Delalloc is such a pain. If we have a hole and we have pending | |
1764 | * delalloc for a portion of the hole we will get back a hole that | |
1765 | * exists for the entire range since it hasn't been actually written | |
1766 | * yet. So to take care of this case we need to look for an extent just | |
1767 | * before the position we want in case there is outstanding delalloc | |
1768 | * going on here. | |
1769 | */ | |
1770 | if (origin == SEEK_HOLE && start != 0) { | |
1771 | if (start <= root->sectorsize) | |
1772 | em = btrfs_get_extent_fiemap(inode, NULL, 0, 0, | |
1773 | root->sectorsize, 0); | |
1774 | else | |
1775 | em = btrfs_get_extent_fiemap(inode, NULL, 0, | |
1776 | start - root->sectorsize, | |
1777 | root->sectorsize, 0); | |
1778 | if (IS_ERR(em)) { | |
6af021d8 | 1779 | ret = PTR_ERR(em); |
b2675157 JB |
1780 | goto out; |
1781 | } | |
1782 | last_end = em->start + em->len; | |
1783 | if (em->block_start == EXTENT_MAP_DELALLOC) | |
1784 | last_end = min_t(u64, last_end, inode->i_size); | |
1785 | free_extent_map(em); | |
1786 | } | |
1787 | ||
1788 | while (1) { | |
1789 | em = btrfs_get_extent_fiemap(inode, NULL, 0, start, len, 0); | |
1790 | if (IS_ERR(em)) { | |
6af021d8 | 1791 | ret = PTR_ERR(em); |
b2675157 JB |
1792 | break; |
1793 | } | |
1794 | ||
1795 | if (em->block_start == EXTENT_MAP_HOLE) { | |
1796 | if (test_bit(EXTENT_FLAG_VACANCY, &em->flags)) { | |
1797 | if (last_end <= orig_start) { | |
1798 | free_extent_map(em); | |
1799 | ret = -ENXIO; | |
1800 | break; | |
1801 | } | |
1802 | } | |
1803 | ||
1804 | if (origin == SEEK_HOLE) { | |
1805 | *offset = start; | |
1806 | free_extent_map(em); | |
1807 | break; | |
1808 | } | |
1809 | } else { | |
1810 | if (origin == SEEK_DATA) { | |
1811 | if (em->block_start == EXTENT_MAP_DELALLOC) { | |
1812 | if (start >= inode->i_size) { | |
1813 | free_extent_map(em); | |
1814 | ret = -ENXIO; | |
1815 | break; | |
1816 | } | |
1817 | } | |
1818 | ||
1819 | *offset = start; | |
1820 | free_extent_map(em); | |
1821 | break; | |
1822 | } | |
1823 | } | |
1824 | ||
1825 | start = em->start + em->len; | |
1826 | last_end = em->start + em->len; | |
1827 | ||
1828 | if (em->block_start == EXTENT_MAP_DELALLOC) | |
1829 | last_end = min_t(u64, last_end, inode->i_size); | |
1830 | ||
1831 | if (test_bit(EXTENT_FLAG_VACANCY, &em->flags)) { | |
1832 | free_extent_map(em); | |
1833 | ret = -ENXIO; | |
1834 | break; | |
1835 | } | |
1836 | free_extent_map(em); | |
1837 | cond_resched(); | |
1838 | } | |
1839 | if (!ret) | |
1840 | *offset = min(*offset, inode->i_size); | |
1841 | out: | |
1842 | unlock_extent_cached(&BTRFS_I(inode)->io_tree, lockstart, lockend, | |
1843 | &cached_state, GFP_NOFS); | |
1844 | return ret; | |
1845 | } | |
1846 | ||
1847 | static loff_t btrfs_file_llseek(struct file *file, loff_t offset, int origin) | |
1848 | { | |
1849 | struct inode *inode = file->f_mapping->host; | |
1850 | int ret; | |
1851 | ||
1852 | mutex_lock(&inode->i_mutex); | |
1853 | switch (origin) { | |
1854 | case SEEK_END: | |
1855 | case SEEK_CUR: | |
ef3d0fd2 | 1856 | offset = generic_file_llseek(file, offset, origin); |
b2675157 JB |
1857 | goto out; |
1858 | case SEEK_DATA: | |
1859 | case SEEK_HOLE: | |
48802c8a JL |
1860 | if (offset >= i_size_read(inode)) { |
1861 | mutex_unlock(&inode->i_mutex); | |
1862 | return -ENXIO; | |
1863 | } | |
1864 | ||
b2675157 JB |
1865 | ret = find_desired_extent(inode, &offset, origin); |
1866 | if (ret) { | |
1867 | mutex_unlock(&inode->i_mutex); | |
1868 | return ret; | |
1869 | } | |
1870 | } | |
1871 | ||
9a4327ca | 1872 | if (offset < 0 && !(file->f_mode & FMODE_UNSIGNED_OFFSET)) { |
48802c8a | 1873 | offset = -EINVAL; |
9a4327ca DC |
1874 | goto out; |
1875 | } | |
1876 | if (offset > inode->i_sb->s_maxbytes) { | |
48802c8a | 1877 | offset = -EINVAL; |
9a4327ca DC |
1878 | goto out; |
1879 | } | |
b2675157 JB |
1880 | |
1881 | /* Special lock needed here? */ | |
1882 | if (offset != file->f_pos) { | |
1883 | file->f_pos = offset; | |
1884 | file->f_version = 0; | |
1885 | } | |
1886 | out: | |
1887 | mutex_unlock(&inode->i_mutex); | |
1888 | return offset; | |
1889 | } | |
1890 | ||
828c0950 | 1891 | const struct file_operations btrfs_file_operations = { |
b2675157 | 1892 | .llseek = btrfs_file_llseek, |
39279cc3 | 1893 | .read = do_sync_read, |
4a001071 | 1894 | .write = do_sync_write, |
9ebefb18 | 1895 | .aio_read = generic_file_aio_read, |
e9906a98 | 1896 | .splice_read = generic_file_splice_read, |
11c65dcc | 1897 | .aio_write = btrfs_file_aio_write, |
9ebefb18 | 1898 | .mmap = btrfs_file_mmap, |
39279cc3 | 1899 | .open = generic_file_open, |
e1b81e67 | 1900 | .release = btrfs_release_file, |
39279cc3 | 1901 | .fsync = btrfs_sync_file, |
2fe17c10 | 1902 | .fallocate = btrfs_fallocate, |
34287aa3 | 1903 | .unlocked_ioctl = btrfs_ioctl, |
39279cc3 | 1904 | #ifdef CONFIG_COMPAT |
34287aa3 | 1905 | .compat_ioctl = btrfs_ioctl, |
39279cc3 CM |
1906 | #endif |
1907 | }; |