]>
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> | |
25 | #include <linux/smp_lock.h> | |
26 | #include <linux/backing-dev.h> | |
27 | #include <linux/mpage.h> | |
28 | #include <linux/swap.h> | |
29 | #include <linux/writeback.h> | |
30 | #include <linux/statfs.h> | |
31 | #include <linux/compat.h> | |
32 | #include "ctree.h" | |
33 | #include "disk-io.h" | |
34 | #include "transaction.h" | |
35 | #include "btrfs_inode.h" | |
36 | #include "ioctl.h" | |
37 | #include "print-tree.h" | |
e02119d5 CM |
38 | #include "tree-log.h" |
39 | #include "locking.h" | |
12fa8ec6 | 40 | #include "compat.h" |
39279cc3 CM |
41 | |
42 | ||
d352ac68 CM |
43 | /* simple helper to fault in pages and copy. This should go away |
44 | * and be replaced with calls into generic code. | |
45 | */ | |
d397712b | 46 | static noinline int btrfs_copy_from_user(loff_t pos, int num_pages, |
a1b32a59 CM |
47 | int write_bytes, |
48 | struct page **prepared_pages, | |
d397712b | 49 | const char __user *buf) |
39279cc3 CM |
50 | { |
51 | long page_fault = 0; | |
52 | int i; | |
53 | int offset = pos & (PAGE_CACHE_SIZE - 1); | |
54 | ||
55 | for (i = 0; i < num_pages && write_bytes > 0; i++, offset = 0) { | |
56 | size_t count = min_t(size_t, | |
57 | PAGE_CACHE_SIZE - offset, write_bytes); | |
58 | struct page *page = prepared_pages[i]; | |
59 | fault_in_pages_readable(buf, count); | |
60 | ||
61 | /* Copy data from userspace to the current page */ | |
62 | kmap(page); | |
63 | page_fault = __copy_from_user(page_address(page) + offset, | |
64 | buf, count); | |
65 | /* Flush processor's dcache for this page */ | |
66 | flush_dcache_page(page); | |
67 | kunmap(page); | |
68 | buf += count; | |
69 | write_bytes -= count; | |
70 | ||
71 | if (page_fault) | |
72 | break; | |
73 | } | |
74 | return page_fault ? -EFAULT : 0; | |
75 | } | |
76 | ||
d352ac68 CM |
77 | /* |
78 | * unlocks pages after btrfs_file_write is done with them | |
79 | */ | |
d397712b | 80 | static noinline void btrfs_drop_pages(struct page **pages, size_t num_pages) |
39279cc3 CM |
81 | { |
82 | size_t i; | |
83 | for (i = 0; i < num_pages; i++) { | |
84 | if (!pages[i]) | |
85 | break; | |
d352ac68 CM |
86 | /* page checked is some magic around finding pages that |
87 | * have been modified without going through btrfs_set_page_dirty | |
88 | * clear it here | |
89 | */ | |
4a096752 | 90 | ClearPageChecked(pages[i]); |
39279cc3 CM |
91 | unlock_page(pages[i]); |
92 | mark_page_accessed(pages[i]); | |
93 | page_cache_release(pages[i]); | |
94 | } | |
95 | } | |
96 | ||
d352ac68 CM |
97 | /* |
98 | * after copy_from_user, pages need to be dirtied and we need to make | |
99 | * sure holes are created between the current EOF and the start of | |
100 | * any next extents (if required). | |
101 | * | |
102 | * this also makes the decision about creating an inline extent vs | |
103 | * doing real data extents, marking pages dirty and delalloc as required. | |
104 | */ | |
d397712b | 105 | static noinline int dirty_and_release_pages(struct btrfs_trans_handle *trans, |
39279cc3 CM |
106 | struct btrfs_root *root, |
107 | struct file *file, | |
108 | struct page **pages, | |
109 | size_t num_pages, | |
110 | loff_t pos, | |
111 | size_t write_bytes) | |
112 | { | |
39279cc3 | 113 | int err = 0; |
a52d9a80 | 114 | int i; |
6da6abae | 115 | struct inode *inode = fdentry(file)->d_inode; |
d1310b2e | 116 | struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; |
db94535d CM |
117 | u64 hint_byte; |
118 | u64 num_bytes; | |
a52d9a80 CM |
119 | u64 start_pos; |
120 | u64 end_of_last_block; | |
121 | u64 end_pos = pos + write_bytes; | |
122 | loff_t isize = i_size_read(inode); | |
39279cc3 | 123 | |
5f39d397 | 124 | start_pos = pos & ~((u64)root->sectorsize - 1); |
db94535d CM |
125 | num_bytes = (write_bytes + pos - start_pos + |
126 | root->sectorsize - 1) & ~((u64)root->sectorsize - 1); | |
39279cc3 | 127 | |
db94535d CM |
128 | end_of_last_block = start_pos + num_bytes - 1; |
129 | ||
d1310b2e | 130 | lock_extent(io_tree, start_pos, end_of_last_block, GFP_NOFS); |
37d1aeee | 131 | trans = btrfs_join_transaction(root, 1); |
a52d9a80 CM |
132 | if (!trans) { |
133 | err = -ENOMEM; | |
134 | goto out_unlock; | |
135 | } | |
136 | btrfs_set_trans_block_group(trans, inode); | |
db94535d | 137 | hint_byte = 0; |
a52d9a80 | 138 | |
d1310b2e | 139 | set_extent_uptodate(io_tree, start_pos, end_of_last_block, GFP_NOFS); |
a52d9a80 | 140 | |
c8b97818 CM |
141 | /* check for reserved extents on each page, we don't want |
142 | * to reset the delalloc bit on things that already have | |
143 | * extents reserved. | |
a52d9a80 | 144 | */ |
c8b97818 CM |
145 | btrfs_set_extent_delalloc(inode, start_pos, end_of_last_block); |
146 | for (i = 0; i < num_pages; i++) { | |
147 | struct page *p = pages[i]; | |
148 | SetPageUptodate(p); | |
149 | ClearPageChecked(p); | |
150 | set_page_dirty(p); | |
a52d9a80 CM |
151 | } |
152 | if (end_pos > isize) { | |
153 | i_size_write(inode, end_pos); | |
154 | btrfs_update_inode(trans, root, inode); | |
39279cc3 | 155 | } |
017e5369 | 156 | err = btrfs_end_transaction(trans, root); |
a52d9a80 | 157 | out_unlock: |
d1310b2e | 158 | unlock_extent(io_tree, start_pos, end_of_last_block, GFP_NOFS); |
39279cc3 CM |
159 | return err; |
160 | } | |
161 | ||
d352ac68 CM |
162 | /* |
163 | * this drops all the extents in the cache that intersect the range | |
164 | * [start, end]. Existing extents are split as required. | |
165 | */ | |
5b21f2ed ZY |
166 | int btrfs_drop_extent_cache(struct inode *inode, u64 start, u64 end, |
167 | int skip_pinned) | |
a52d9a80 CM |
168 | { |
169 | struct extent_map *em; | |
3b951516 CM |
170 | struct extent_map *split = NULL; |
171 | struct extent_map *split2 = NULL; | |
a52d9a80 | 172 | struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; |
39b5637f | 173 | u64 len = end - start + 1; |
3b951516 CM |
174 | int ret; |
175 | int testend = 1; | |
5b21f2ed | 176 | unsigned long flags; |
c8b97818 | 177 | int compressed = 0; |
a52d9a80 | 178 | |
e6dcd2dc | 179 | WARN_ON(end < start); |
3b951516 | 180 | if (end == (u64)-1) { |
39b5637f | 181 | len = (u64)-1; |
3b951516 CM |
182 | testend = 0; |
183 | } | |
d397712b | 184 | while (1) { |
3b951516 CM |
185 | if (!split) |
186 | split = alloc_extent_map(GFP_NOFS); | |
187 | if (!split2) | |
188 | split2 = alloc_extent_map(GFP_NOFS); | |
189 | ||
d1310b2e | 190 | spin_lock(&em_tree->lock); |
39b5637f | 191 | em = lookup_extent_mapping(em_tree, start, len); |
d1310b2e CM |
192 | if (!em) { |
193 | spin_unlock(&em_tree->lock); | |
a52d9a80 | 194 | break; |
d1310b2e | 195 | } |
5b21f2ed ZY |
196 | flags = em->flags; |
197 | if (skip_pinned && test_bit(EXTENT_FLAG_PINNED, &em->flags)) { | |
198 | spin_unlock(&em_tree->lock); | |
199 | if (em->start <= start && | |
200 | (!testend || em->start + em->len >= start + len)) { | |
201 | free_extent_map(em); | |
202 | break; | |
203 | } | |
204 | if (start < em->start) { | |
205 | len = em->start - start; | |
206 | } else { | |
207 | len = start + len - (em->start + em->len); | |
208 | start = em->start + em->len; | |
209 | } | |
210 | free_extent_map(em); | |
211 | continue; | |
212 | } | |
c8b97818 | 213 | compressed = test_bit(EXTENT_FLAG_COMPRESSED, &em->flags); |
3ce7e67a | 214 | clear_bit(EXTENT_FLAG_PINNED, &em->flags); |
a52d9a80 | 215 | remove_extent_mapping(em_tree, em); |
3b951516 CM |
216 | |
217 | if (em->block_start < EXTENT_MAP_LAST_BYTE && | |
218 | em->start < start) { | |
219 | split->start = em->start; | |
220 | split->len = start - em->start; | |
ff5b7ee3 | 221 | split->orig_start = em->orig_start; |
3b951516 | 222 | split->block_start = em->block_start; |
c8b97818 CM |
223 | |
224 | if (compressed) | |
225 | split->block_len = em->block_len; | |
226 | else | |
227 | split->block_len = split->len; | |
228 | ||
3b951516 | 229 | split->bdev = em->bdev; |
5b21f2ed | 230 | split->flags = flags; |
3b951516 CM |
231 | ret = add_extent_mapping(em_tree, split); |
232 | BUG_ON(ret); | |
233 | free_extent_map(split); | |
234 | split = split2; | |
235 | split2 = NULL; | |
236 | } | |
237 | if (em->block_start < EXTENT_MAP_LAST_BYTE && | |
238 | testend && em->start + em->len > start + len) { | |
239 | u64 diff = start + len - em->start; | |
240 | ||
241 | split->start = start + len; | |
242 | split->len = em->start + em->len - (start + len); | |
243 | split->bdev = em->bdev; | |
5b21f2ed | 244 | split->flags = flags; |
3b951516 | 245 | |
c8b97818 CM |
246 | if (compressed) { |
247 | split->block_len = em->block_len; | |
248 | split->block_start = em->block_start; | |
445a6944 | 249 | split->orig_start = em->orig_start; |
c8b97818 CM |
250 | } else { |
251 | split->block_len = split->len; | |
252 | split->block_start = em->block_start + diff; | |
445a6944 | 253 | split->orig_start = split->start; |
c8b97818 | 254 | } |
3b951516 CM |
255 | |
256 | ret = add_extent_mapping(em_tree, split); | |
257 | BUG_ON(ret); | |
258 | free_extent_map(split); | |
259 | split = NULL; | |
260 | } | |
d1310b2e CM |
261 | spin_unlock(&em_tree->lock); |
262 | ||
a52d9a80 CM |
263 | /* once for us */ |
264 | free_extent_map(em); | |
265 | /* once for the tree*/ | |
266 | free_extent_map(em); | |
267 | } | |
3b951516 CM |
268 | if (split) |
269 | free_extent_map(split); | |
270 | if (split2) | |
271 | free_extent_map(split2); | |
a52d9a80 CM |
272 | return 0; |
273 | } | |
274 | ||
39279cc3 CM |
275 | /* |
276 | * this is very complex, but the basic idea is to drop all extents | |
277 | * in the range start - end. hint_block is filled in with a block number | |
278 | * that would be a good hint to the block allocator for this file. | |
279 | * | |
280 | * If an extent intersects the range but is not entirely inside the range | |
281 | * it is either truncated or split. Anything entirely inside the range | |
282 | * is deleted from the tree. | |
d352ac68 CM |
283 | * |
284 | * inline_limit is used to tell this code which offsets in the file to keep | |
285 | * if they contain inline extents. | |
39279cc3 | 286 | */ |
d397712b | 287 | noinline int btrfs_drop_extents(struct btrfs_trans_handle *trans, |
39279cc3 | 288 | struct btrfs_root *root, struct inode *inode, |
e980b50c CM |
289 | u64 start, u64 end, u64 locked_end, |
290 | u64 inline_limit, u64 *hint_byte) | |
39279cc3 | 291 | { |
00f5c795 CM |
292 | u64 extent_end = 0; |
293 | u64 search_start = start; | |
c8b97818 | 294 | u64 ram_bytes = 0; |
771ed689 | 295 | u64 disk_bytenr = 0; |
e980b50c | 296 | u64 orig_locked_end = locked_end; |
70b99e69 CM |
297 | u8 compression; |
298 | u8 encryption; | |
c8b97818 | 299 | u16 other_encoding = 0; |
5f39d397 | 300 | struct extent_buffer *leaf; |
39279cc3 | 301 | struct btrfs_file_extent_item *extent; |
39279cc3 | 302 | struct btrfs_path *path; |
00f5c795 CM |
303 | struct btrfs_key key; |
304 | struct btrfs_file_extent_item old; | |
305 | int keep; | |
306 | int slot; | |
39279cc3 | 307 | int bookend; |
d899e052 | 308 | int found_type = 0; |
39279cc3 CM |
309 | int found_extent; |
310 | int found_inline; | |
ccd467d6 | 311 | int recow; |
00f5c795 | 312 | int ret; |
39279cc3 | 313 | |
c8b97818 | 314 | inline_limit = 0; |
5b21f2ed | 315 | btrfs_drop_extent_cache(inode, start, end - 1, 0); |
a52d9a80 | 316 | |
39279cc3 CM |
317 | path = btrfs_alloc_path(); |
318 | if (!path) | |
319 | return -ENOMEM; | |
d397712b | 320 | while (1) { |
ccd467d6 | 321 | recow = 0; |
39279cc3 CM |
322 | btrfs_release_path(root, path); |
323 | ret = btrfs_lookup_file_extent(trans, root, path, inode->i_ino, | |
324 | search_start, -1); | |
325 | if (ret < 0) | |
326 | goto out; | |
327 | if (ret > 0) { | |
328 | if (path->slots[0] == 0) { | |
329 | ret = 0; | |
330 | goto out; | |
331 | } | |
332 | path->slots[0]--; | |
333 | } | |
8c2383c3 | 334 | next_slot: |
39279cc3 CM |
335 | keep = 0; |
336 | bookend = 0; | |
337 | found_extent = 0; | |
338 | found_inline = 0; | |
70b99e69 CM |
339 | compression = 0; |
340 | encryption = 0; | |
39279cc3 | 341 | extent = NULL; |
5f39d397 | 342 | leaf = path->nodes[0]; |
39279cc3 | 343 | slot = path->slots[0]; |
8c2383c3 | 344 | ret = 0; |
5f39d397 | 345 | btrfs_item_key_to_cpu(leaf, &key, slot); |
7261009c Y |
346 | if (btrfs_key_type(&key) == BTRFS_EXTENT_DATA_KEY && |
347 | key.offset >= end) { | |
39279cc3 CM |
348 | goto out; |
349 | } | |
7261009c Y |
350 | if (btrfs_key_type(&key) > BTRFS_EXTENT_DATA_KEY || |
351 | key.objectid != inode->i_ino) { | |
39279cc3 CM |
352 | goto out; |
353 | } | |
ccd467d6 | 354 | if (recow) { |
8247b41a | 355 | search_start = max(key.offset, start); |
ccd467d6 CM |
356 | continue; |
357 | } | |
8c2383c3 CM |
358 | if (btrfs_key_type(&key) == BTRFS_EXTENT_DATA_KEY) { |
359 | extent = btrfs_item_ptr(leaf, slot, | |
360 | struct btrfs_file_extent_item); | |
5f39d397 | 361 | found_type = btrfs_file_extent_type(leaf, extent); |
c8b97818 CM |
362 | compression = btrfs_file_extent_compression(leaf, |
363 | extent); | |
364 | encryption = btrfs_file_extent_encryption(leaf, | |
365 | extent); | |
366 | other_encoding = btrfs_file_extent_other_encoding(leaf, | |
367 | extent); | |
d899e052 YZ |
368 | if (found_type == BTRFS_FILE_EXTENT_REG || |
369 | found_type == BTRFS_FILE_EXTENT_PREALLOC) { | |
257d0ce3 CM |
370 | extent_end = |
371 | btrfs_file_extent_disk_bytenr(leaf, | |
372 | extent); | |
373 | if (extent_end) | |
374 | *hint_byte = extent_end; | |
375 | ||
8c2383c3 | 376 | extent_end = key.offset + |
db94535d | 377 | btrfs_file_extent_num_bytes(leaf, extent); |
c8b97818 CM |
378 | ram_bytes = btrfs_file_extent_ram_bytes(leaf, |
379 | extent); | |
8c2383c3 CM |
380 | found_extent = 1; |
381 | } else if (found_type == BTRFS_FILE_EXTENT_INLINE) { | |
382 | found_inline = 1; | |
383 | extent_end = key.offset + | |
c8b97818 | 384 | btrfs_file_extent_inline_len(leaf, extent); |
8c2383c3 CM |
385 | } |
386 | } else { | |
387 | extent_end = search_start; | |
39279cc3 CM |
388 | } |
389 | ||
390 | /* we found nothing we can drop */ | |
8c2383c3 CM |
391 | if ((!found_extent && !found_inline) || |
392 | search_start >= extent_end) { | |
393 | int nextret; | |
394 | u32 nritems; | |
5f39d397 | 395 | nritems = btrfs_header_nritems(leaf); |
8c2383c3 CM |
396 | if (slot >= nritems - 1) { |
397 | nextret = btrfs_next_leaf(root, path); | |
398 | if (nextret) | |
399 | goto out; | |
ccd467d6 | 400 | recow = 1; |
8c2383c3 CM |
401 | } else { |
402 | path->slots[0]++; | |
403 | } | |
404 | goto next_slot; | |
39279cc3 CM |
405 | } |
406 | ||
c8b97818 | 407 | if (end <= extent_end && start >= key.offset && found_inline) |
179e29e4 | 408 | *hint_byte = EXTENT_MAP_INLINE; |
31840ae1 ZY |
409 | |
410 | if (found_extent) { | |
411 | read_extent_buffer(leaf, &old, (unsigned long)extent, | |
412 | sizeof(old)); | |
179e29e4 | 413 | } |
31840ae1 | 414 | |
39279cc3 | 415 | if (end < extent_end && end >= key.offset) { |
179e29e4 | 416 | bookend = 1; |
0181e58f | 417 | if (found_inline && start <= key.offset) |
179e29e4 | 418 | keep = 1; |
39279cc3 | 419 | } |
6643558d | 420 | |
771ed689 CM |
421 | if (bookend && found_extent) { |
422 | if (locked_end < extent_end) { | |
423 | ret = try_lock_extent(&BTRFS_I(inode)->io_tree, | |
424 | locked_end, extent_end - 1, | |
425 | GFP_NOFS); | |
426 | if (!ret) { | |
427 | btrfs_release_path(root, path); | |
428 | lock_extent(&BTRFS_I(inode)->io_tree, | |
429 | locked_end, extent_end - 1, | |
430 | GFP_NOFS); | |
431 | locked_end = extent_end; | |
432 | continue; | |
433 | } | |
6643558d | 434 | locked_end = extent_end; |
6643558d | 435 | } |
771ed689 CM |
436 | disk_bytenr = le64_to_cpu(old.disk_bytenr); |
437 | if (disk_bytenr != 0) { | |
438 | ret = btrfs_inc_extent_ref(trans, root, | |
439 | disk_bytenr, | |
5d4f98a2 YZ |
440 | le64_to_cpu(old.disk_num_bytes), 0, |
441 | root->root_key.objectid, | |
442 | key.objectid, key.offset - | |
443 | le64_to_cpu(old.offset)); | |
771ed689 CM |
444 | BUG_ON(ret); |
445 | } | |
6643558d YZ |
446 | } |
447 | ||
448 | if (found_inline) { | |
449 | u64 mask = root->sectorsize - 1; | |
450 | search_start = (extent_end + mask) & ~mask; | |
451 | } else | |
452 | search_start = extent_end; | |
453 | ||
39279cc3 CM |
454 | /* truncate existing extent */ |
455 | if (start > key.offset) { | |
456 | u64 new_num; | |
457 | u64 old_num; | |
458 | keep = 1; | |
5f39d397 | 459 | WARN_ON(start & (root->sectorsize - 1)); |
39279cc3 | 460 | if (found_extent) { |
db94535d CM |
461 | new_num = start - key.offset; |
462 | old_num = btrfs_file_extent_num_bytes(leaf, | |
463 | extent); | |
464 | *hint_byte = | |
465 | btrfs_file_extent_disk_bytenr(leaf, | |
466 | extent); | |
467 | if (btrfs_file_extent_disk_bytenr(leaf, | |
468 | extent)) { | |
a76a3cd4 YZ |
469 | inode_sub_bytes(inode, old_num - |
470 | new_num); | |
39279cc3 | 471 | } |
771ed689 CM |
472 | btrfs_set_file_extent_num_bytes(leaf, |
473 | extent, new_num); | |
5f39d397 | 474 | btrfs_mark_buffer_dirty(leaf); |
00f5c795 CM |
475 | } else if (key.offset < inline_limit && |
476 | (end > extent_end) && | |
477 | (inline_limit < extent_end)) { | |
3326d1b0 CM |
478 | u32 new_size; |
479 | new_size = btrfs_file_extent_calc_inline_size( | |
00f5c795 | 480 | inline_limit - key.offset); |
a76a3cd4 YZ |
481 | inode_sub_bytes(inode, extent_end - |
482 | inline_limit); | |
70b99e69 CM |
483 | btrfs_set_file_extent_ram_bytes(leaf, extent, |
484 | new_size); | |
485 | if (!compression && !encryption) { | |
486 | btrfs_truncate_item(trans, root, path, | |
487 | new_size, 1); | |
488 | } | |
39279cc3 CM |
489 | } |
490 | } | |
491 | /* delete the entire extent */ | |
492 | if (!keep) { | |
a76a3cd4 YZ |
493 | if (found_inline) |
494 | inode_sub_bytes(inode, extent_end - | |
495 | key.offset); | |
39279cc3 | 496 | ret = btrfs_del_item(trans, root, path); |
54aa1f4d | 497 | /* TODO update progress marker and return */ |
39279cc3 | 498 | BUG_ON(ret); |
39279cc3 | 499 | extent = NULL; |
31840ae1 ZY |
500 | btrfs_release_path(root, path); |
501 | /* the extent will be freed later */ | |
39279cc3 | 502 | } |
0181e58f | 503 | if (bookend && found_inline && start <= key.offset) { |
179e29e4 CM |
504 | u32 new_size; |
505 | new_size = btrfs_file_extent_calc_inline_size( | |
0181e58f | 506 | extent_end - end); |
a76a3cd4 | 507 | inode_sub_bytes(inode, end - key.offset); |
70b99e69 CM |
508 | btrfs_set_file_extent_ram_bytes(leaf, extent, |
509 | new_size); | |
510 | if (!compression && !encryption) | |
511 | ret = btrfs_truncate_item(trans, root, path, | |
512 | new_size, 0); | |
31840ae1 | 513 | BUG_ON(ret); |
179e29e4 | 514 | } |
39279cc3 CM |
515 | /* create bookend, splitting the extent in two */ |
516 | if (bookend && found_extent) { | |
517 | struct btrfs_key ins; | |
518 | ins.objectid = inode->i_ino; | |
519 | ins.offset = end; | |
39279cc3 | 520 | btrfs_set_key_type(&ins, BTRFS_EXTENT_DATA_KEY); |
771ed689 | 521 | |
39279cc3 | 522 | btrfs_release_path(root, path); |
b9473439 | 523 | path->leave_spinning = 1; |
39279cc3 CM |
524 | ret = btrfs_insert_empty_item(trans, root, path, &ins, |
525 | sizeof(*extent)); | |
31840ae1 | 526 | BUG_ON(ret); |
8c2383c3 | 527 | |
5f39d397 | 528 | leaf = path->nodes[0]; |
5f39d397 CM |
529 | extent = btrfs_item_ptr(leaf, path->slots[0], |
530 | struct btrfs_file_extent_item); | |
531 | write_extent_buffer(leaf, &old, | |
532 | (unsigned long)extent, sizeof(old)); | |
533 | ||
c8b97818 CM |
534 | btrfs_set_file_extent_compression(leaf, extent, |
535 | compression); | |
536 | btrfs_set_file_extent_encryption(leaf, extent, | |
537 | encryption); | |
538 | btrfs_set_file_extent_other_encoding(leaf, extent, | |
539 | other_encoding); | |
5f39d397 | 540 | btrfs_set_file_extent_offset(leaf, extent, |
db94535d CM |
541 | le64_to_cpu(old.offset) + end - key.offset); |
542 | WARN_ON(le64_to_cpu(old.num_bytes) < | |
543 | (extent_end - end)); | |
544 | btrfs_set_file_extent_num_bytes(leaf, extent, | |
545 | extent_end - end); | |
c8b97818 CM |
546 | |
547 | /* | |
548 | * set the ram bytes to the size of the full extent | |
549 | * before splitting. This is a worst case flag, | |
550 | * but its the best we can do because we don't know | |
551 | * how splitting affects compression | |
552 | */ | |
553 | btrfs_set_file_extent_ram_bytes(leaf, extent, | |
554 | ram_bytes); | |
d899e052 | 555 | btrfs_set_file_extent_type(leaf, extent, found_type); |
db94535d | 556 | |
b9473439 | 557 | btrfs_unlock_up_safe(path, 1); |
39279cc3 | 558 | btrfs_mark_buffer_dirty(path->nodes[0]); |
b9473439 | 559 | btrfs_set_lock_blocking(path->nodes[0]); |
31840ae1 | 560 | |
b9473439 | 561 | path->leave_spinning = 0; |
31840ae1 | 562 | btrfs_release_path(root, path); |
d397712b | 563 | if (disk_bytenr != 0) |
a76a3cd4 | 564 | inode_add_bytes(inode, extent_end - end); |
31840ae1 ZY |
565 | } |
566 | ||
567 | if (found_extent && !keep) { | |
6e430f94 | 568 | u64 old_disk_bytenr = le64_to_cpu(old.disk_bytenr); |
31840ae1 | 569 | |
6e430f94 | 570 | if (old_disk_bytenr != 0) { |
a76a3cd4 YZ |
571 | inode_sub_bytes(inode, |
572 | le64_to_cpu(old.num_bytes)); | |
31840ae1 | 573 | ret = btrfs_free_extent(trans, root, |
6e430f94 | 574 | old_disk_bytenr, |
31840ae1 | 575 | le64_to_cpu(old.disk_num_bytes), |
5d4f98a2 YZ |
576 | 0, root->root_key.objectid, |
577 | key.objectid, key.offset - | |
578 | le64_to_cpu(old.offset)); | |
31840ae1 | 579 | BUG_ON(ret); |
6e430f94 | 580 | *hint_byte = old_disk_bytenr; |
31840ae1 ZY |
581 | } |
582 | } | |
583 | ||
584 | if (search_start >= end) { | |
39279cc3 CM |
585 | ret = 0; |
586 | goto out; | |
587 | } | |
588 | } | |
589 | out: | |
590 | btrfs_free_path(path); | |
e980b50c CM |
591 | if (locked_end > orig_locked_end) { |
592 | unlock_extent(&BTRFS_I(inode)->io_tree, orig_locked_end, | |
593 | locked_end - 1, GFP_NOFS); | |
6643558d | 594 | } |
39279cc3 CM |
595 | return ret; |
596 | } | |
597 | ||
d899e052 YZ |
598 | static int extent_mergeable(struct extent_buffer *leaf, int slot, |
599 | u64 objectid, u64 bytenr, u64 *start, u64 *end) | |
600 | { | |
601 | struct btrfs_file_extent_item *fi; | |
602 | struct btrfs_key key; | |
603 | u64 extent_end; | |
604 | ||
605 | if (slot < 0 || slot >= btrfs_header_nritems(leaf)) | |
606 | return 0; | |
607 | ||
608 | btrfs_item_key_to_cpu(leaf, &key, slot); | |
609 | if (key.objectid != objectid || key.type != BTRFS_EXTENT_DATA_KEY) | |
610 | return 0; | |
611 | ||
612 | fi = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item); | |
613 | if (btrfs_file_extent_type(leaf, fi) != BTRFS_FILE_EXTENT_REG || | |
614 | btrfs_file_extent_disk_bytenr(leaf, fi) != bytenr || | |
615 | btrfs_file_extent_compression(leaf, fi) || | |
616 | btrfs_file_extent_encryption(leaf, fi) || | |
617 | btrfs_file_extent_other_encoding(leaf, fi)) | |
618 | return 0; | |
619 | ||
620 | extent_end = key.offset + btrfs_file_extent_num_bytes(leaf, fi); | |
621 | if ((*start && *start != key.offset) || (*end && *end != extent_end)) | |
622 | return 0; | |
623 | ||
624 | *start = key.offset; | |
625 | *end = extent_end; | |
626 | return 1; | |
627 | } | |
628 | ||
629 | /* | |
630 | * Mark extent in the range start - end as written. | |
631 | * | |
632 | * This changes extent type from 'pre-allocated' to 'regular'. If only | |
633 | * part of extent is marked as written, the extent will be split into | |
634 | * two or three. | |
635 | */ | |
636 | int btrfs_mark_extent_written(struct btrfs_trans_handle *trans, | |
637 | struct btrfs_root *root, | |
638 | struct inode *inode, u64 start, u64 end) | |
639 | { | |
640 | struct extent_buffer *leaf; | |
641 | struct btrfs_path *path; | |
642 | struct btrfs_file_extent_item *fi; | |
643 | struct btrfs_key key; | |
644 | u64 bytenr; | |
645 | u64 num_bytes; | |
646 | u64 extent_end; | |
5d4f98a2 | 647 | u64 orig_offset; |
d899e052 YZ |
648 | u64 other_start; |
649 | u64 other_end; | |
650 | u64 split = start; | |
651 | u64 locked_end = end; | |
652 | int extent_type; | |
653 | int split_end = 1; | |
654 | int ret; | |
655 | ||
656 | btrfs_drop_extent_cache(inode, start, end - 1, 0); | |
657 | ||
658 | path = btrfs_alloc_path(); | |
659 | BUG_ON(!path); | |
660 | again: | |
661 | key.objectid = inode->i_ino; | |
662 | key.type = BTRFS_EXTENT_DATA_KEY; | |
663 | if (split == start) | |
664 | key.offset = split; | |
665 | else | |
666 | key.offset = split - 1; | |
667 | ||
668 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); | |
669 | if (ret > 0 && path->slots[0] > 0) | |
670 | path->slots[0]--; | |
671 | ||
672 | leaf = path->nodes[0]; | |
673 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
674 | BUG_ON(key.objectid != inode->i_ino || | |
675 | key.type != BTRFS_EXTENT_DATA_KEY); | |
676 | fi = btrfs_item_ptr(leaf, path->slots[0], | |
677 | struct btrfs_file_extent_item); | |
678 | extent_type = btrfs_file_extent_type(leaf, fi); | |
679 | BUG_ON(extent_type != BTRFS_FILE_EXTENT_PREALLOC); | |
680 | extent_end = key.offset + btrfs_file_extent_num_bytes(leaf, fi); | |
681 | BUG_ON(key.offset > start || extent_end < end); | |
682 | ||
683 | bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); | |
684 | num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi); | |
5d4f98a2 | 685 | orig_offset = key.offset - btrfs_file_extent_offset(leaf, fi); |
d899e052 YZ |
686 | |
687 | if (key.offset == start) | |
688 | split = end; | |
689 | ||
690 | if (key.offset == start && extent_end == end) { | |
691 | int del_nr = 0; | |
692 | int del_slot = 0; | |
d899e052 YZ |
693 | other_start = end; |
694 | other_end = 0; | |
695 | if (extent_mergeable(leaf, path->slots[0] + 1, inode->i_ino, | |
696 | bytenr, &other_start, &other_end)) { | |
697 | extent_end = other_end; | |
698 | del_slot = path->slots[0] + 1; | |
699 | del_nr++; | |
700 | ret = btrfs_free_extent(trans, root, bytenr, num_bytes, | |
5d4f98a2 YZ |
701 | 0, root->root_key.objectid, |
702 | inode->i_ino, orig_offset); | |
d899e052 YZ |
703 | BUG_ON(ret); |
704 | } | |
705 | other_start = 0; | |
706 | other_end = start; | |
707 | if (extent_mergeable(leaf, path->slots[0] - 1, inode->i_ino, | |
708 | bytenr, &other_start, &other_end)) { | |
709 | key.offset = other_start; | |
710 | del_slot = path->slots[0]; | |
711 | del_nr++; | |
712 | ret = btrfs_free_extent(trans, root, bytenr, num_bytes, | |
5d4f98a2 YZ |
713 | 0, root->root_key.objectid, |
714 | inode->i_ino, orig_offset); | |
d899e052 YZ |
715 | BUG_ON(ret); |
716 | } | |
717 | split_end = 0; | |
718 | if (del_nr == 0) { | |
719 | btrfs_set_file_extent_type(leaf, fi, | |
720 | BTRFS_FILE_EXTENT_REG); | |
721 | goto done; | |
722 | } | |
723 | ||
724 | fi = btrfs_item_ptr(leaf, del_slot - 1, | |
725 | struct btrfs_file_extent_item); | |
726 | btrfs_set_file_extent_type(leaf, fi, BTRFS_FILE_EXTENT_REG); | |
727 | btrfs_set_file_extent_num_bytes(leaf, fi, | |
728 | extent_end - key.offset); | |
729 | btrfs_mark_buffer_dirty(leaf); | |
730 | ||
731 | ret = btrfs_del_items(trans, root, path, del_slot, del_nr); | |
732 | BUG_ON(ret); | |
546888da | 733 | goto release; |
d899e052 YZ |
734 | } else if (split == start) { |
735 | if (locked_end < extent_end) { | |
736 | ret = try_lock_extent(&BTRFS_I(inode)->io_tree, | |
737 | locked_end, extent_end - 1, GFP_NOFS); | |
738 | if (!ret) { | |
739 | btrfs_release_path(root, path); | |
740 | lock_extent(&BTRFS_I(inode)->io_tree, | |
741 | locked_end, extent_end - 1, GFP_NOFS); | |
742 | locked_end = extent_end; | |
743 | goto again; | |
744 | } | |
745 | locked_end = extent_end; | |
746 | } | |
747 | btrfs_set_file_extent_num_bytes(leaf, fi, split - key.offset); | |
d899e052 YZ |
748 | } else { |
749 | BUG_ON(key.offset != start); | |
d899e052 | 750 | key.offset = split; |
5d4f98a2 YZ |
751 | btrfs_set_file_extent_offset(leaf, fi, key.offset - |
752 | orig_offset); | |
753 | btrfs_set_file_extent_num_bytes(leaf, fi, extent_end - split); | |
d899e052 YZ |
754 | btrfs_set_item_key_safe(trans, root, path, &key); |
755 | extent_end = split; | |
756 | } | |
757 | ||
758 | if (extent_end == end) { | |
759 | split_end = 0; | |
760 | extent_type = BTRFS_FILE_EXTENT_REG; | |
761 | } | |
762 | if (extent_end == end && split == start) { | |
763 | other_start = end; | |
764 | other_end = 0; | |
765 | if (extent_mergeable(leaf, path->slots[0] + 1, inode->i_ino, | |
766 | bytenr, &other_start, &other_end)) { | |
767 | path->slots[0]++; | |
768 | fi = btrfs_item_ptr(leaf, path->slots[0], | |
769 | struct btrfs_file_extent_item); | |
770 | key.offset = split; | |
771 | btrfs_set_item_key_safe(trans, root, path, &key); | |
5d4f98a2 YZ |
772 | btrfs_set_file_extent_offset(leaf, fi, key.offset - |
773 | orig_offset); | |
d899e052 YZ |
774 | btrfs_set_file_extent_num_bytes(leaf, fi, |
775 | other_end - split); | |
776 | goto done; | |
777 | } | |
778 | } | |
779 | if (extent_end == end && split == end) { | |
780 | other_start = 0; | |
781 | other_end = start; | |
782 | if (extent_mergeable(leaf, path->slots[0] - 1 , inode->i_ino, | |
783 | bytenr, &other_start, &other_end)) { | |
784 | path->slots[0]--; | |
785 | fi = btrfs_item_ptr(leaf, path->slots[0], | |
786 | struct btrfs_file_extent_item); | |
787 | btrfs_set_file_extent_num_bytes(leaf, fi, extent_end - | |
788 | other_start); | |
789 | goto done; | |
790 | } | |
791 | } | |
792 | ||
793 | btrfs_mark_buffer_dirty(leaf); | |
c36047d7 | 794 | |
5d4f98a2 YZ |
795 | ret = btrfs_inc_extent_ref(trans, root, bytenr, num_bytes, 0, |
796 | root->root_key.objectid, | |
797 | inode->i_ino, orig_offset); | |
c36047d7 | 798 | BUG_ON(ret); |
d899e052 YZ |
799 | btrfs_release_path(root, path); |
800 | ||
801 | key.offset = start; | |
802 | ret = btrfs_insert_empty_item(trans, root, path, &key, sizeof(*fi)); | |
803 | BUG_ON(ret); | |
804 | ||
805 | leaf = path->nodes[0]; | |
806 | fi = btrfs_item_ptr(leaf, path->slots[0], | |
807 | struct btrfs_file_extent_item); | |
808 | btrfs_set_file_extent_generation(leaf, fi, trans->transid); | |
809 | btrfs_set_file_extent_type(leaf, fi, extent_type); | |
810 | btrfs_set_file_extent_disk_bytenr(leaf, fi, bytenr); | |
811 | btrfs_set_file_extent_disk_num_bytes(leaf, fi, num_bytes); | |
5d4f98a2 | 812 | btrfs_set_file_extent_offset(leaf, fi, key.offset - orig_offset); |
d899e052 YZ |
813 | btrfs_set_file_extent_num_bytes(leaf, fi, extent_end - key.offset); |
814 | btrfs_set_file_extent_ram_bytes(leaf, fi, num_bytes); | |
815 | btrfs_set_file_extent_compression(leaf, fi, 0); | |
816 | btrfs_set_file_extent_encryption(leaf, fi, 0); | |
817 | btrfs_set_file_extent_other_encoding(leaf, fi, 0); | |
d899e052 YZ |
818 | done: |
819 | btrfs_mark_buffer_dirty(leaf); | |
546888da CM |
820 | |
821 | release: | |
d899e052 YZ |
822 | btrfs_release_path(root, path); |
823 | if (split_end && split == start) { | |
824 | split = end; | |
825 | goto again; | |
826 | } | |
827 | if (locked_end > end) { | |
828 | unlock_extent(&BTRFS_I(inode)->io_tree, end, locked_end - 1, | |
829 | GFP_NOFS); | |
830 | } | |
831 | btrfs_free_path(path); | |
832 | return 0; | |
833 | } | |
834 | ||
39279cc3 | 835 | /* |
d352ac68 CM |
836 | * this gets pages into the page cache and locks them down, it also properly |
837 | * waits for data=ordered extents to finish before allowing the pages to be | |
838 | * modified. | |
39279cc3 | 839 | */ |
d397712b | 840 | static noinline int prepare_pages(struct btrfs_root *root, struct file *file, |
98ed5174 CM |
841 | struct page **pages, size_t num_pages, |
842 | loff_t pos, unsigned long first_index, | |
843 | unsigned long last_index, size_t write_bytes) | |
39279cc3 CM |
844 | { |
845 | int i; | |
846 | unsigned long index = pos >> PAGE_CACHE_SHIFT; | |
6da6abae | 847 | struct inode *inode = fdentry(file)->d_inode; |
39279cc3 | 848 | int err = 0; |
8c2383c3 | 849 | u64 start_pos; |
e6dcd2dc | 850 | u64 last_pos; |
8c2383c3 | 851 | |
5f39d397 | 852 | start_pos = pos & ~((u64)root->sectorsize - 1); |
e6dcd2dc | 853 | last_pos = ((u64)index + num_pages) << PAGE_CACHE_SHIFT; |
39279cc3 | 854 | |
9036c102 YZ |
855 | if (start_pos > inode->i_size) { |
856 | err = btrfs_cont_expand(inode, start_pos); | |
857 | if (err) | |
858 | return err; | |
859 | } | |
860 | ||
39279cc3 | 861 | memset(pages, 0, num_pages * sizeof(struct page *)); |
e6dcd2dc | 862 | again: |
39279cc3 CM |
863 | for (i = 0; i < num_pages; i++) { |
864 | pages[i] = grab_cache_page(inode->i_mapping, index + i); | |
865 | if (!pages[i]) { | |
866 | err = -ENOMEM; | |
a52d9a80 | 867 | BUG_ON(1); |
39279cc3 | 868 | } |
ccd467d6 | 869 | wait_on_page_writeback(pages[i]); |
39279cc3 | 870 | } |
0762704b | 871 | if (start_pos < inode->i_size) { |
e6dcd2dc | 872 | struct btrfs_ordered_extent *ordered; |
d99cb30a CM |
873 | lock_extent(&BTRFS_I(inode)->io_tree, |
874 | start_pos, last_pos - 1, GFP_NOFS); | |
d397712b CM |
875 | ordered = btrfs_lookup_first_ordered_extent(inode, |
876 | last_pos - 1); | |
e6dcd2dc CM |
877 | if (ordered && |
878 | ordered->file_offset + ordered->len > start_pos && | |
879 | ordered->file_offset < last_pos) { | |
880 | btrfs_put_ordered_extent(ordered); | |
881 | unlock_extent(&BTRFS_I(inode)->io_tree, | |
882 | start_pos, last_pos - 1, GFP_NOFS); | |
883 | for (i = 0; i < num_pages; i++) { | |
884 | unlock_page(pages[i]); | |
885 | page_cache_release(pages[i]); | |
886 | } | |
887 | btrfs_wait_ordered_range(inode, start_pos, | |
888 | last_pos - start_pos); | |
889 | goto again; | |
890 | } | |
891 | if (ordered) | |
892 | btrfs_put_ordered_extent(ordered); | |
893 | ||
0762704b CM |
894 | clear_extent_bits(&BTRFS_I(inode)->io_tree, start_pos, |
895 | last_pos - 1, EXTENT_DIRTY | EXTENT_DELALLOC, | |
896 | GFP_NOFS); | |
d99cb30a CM |
897 | unlock_extent(&BTRFS_I(inode)->io_tree, |
898 | start_pos, last_pos - 1, GFP_NOFS); | |
0762704b | 899 | } |
e6dcd2dc | 900 | for (i = 0; i < num_pages; i++) { |
f87f057b | 901 | clear_page_dirty_for_io(pages[i]); |
e6dcd2dc CM |
902 | set_page_extent_mapped(pages[i]); |
903 | WARN_ON(!PageLocked(pages[i])); | |
904 | } | |
39279cc3 | 905 | return 0; |
39279cc3 CM |
906 | } |
907 | ||
908 | static ssize_t btrfs_file_write(struct file *file, const char __user *buf, | |
909 | size_t count, loff_t *ppos) | |
910 | { | |
911 | loff_t pos; | |
2ff3e9b6 CM |
912 | loff_t start_pos; |
913 | ssize_t num_written = 0; | |
914 | ssize_t err = 0; | |
39279cc3 | 915 | int ret = 0; |
6da6abae | 916 | struct inode *inode = fdentry(file)->d_inode; |
39279cc3 | 917 | struct btrfs_root *root = BTRFS_I(inode)->root; |
8c2383c3 CM |
918 | struct page **pages = NULL; |
919 | int nrptrs; | |
39279cc3 CM |
920 | struct page *pinned[2]; |
921 | unsigned long first_index; | |
922 | unsigned long last_index; | |
cb843a6f CM |
923 | int will_write; |
924 | ||
925 | will_write = ((file->f_flags & O_SYNC) || IS_SYNC(inode) || | |
926 | (file->f_flags & O_DIRECT)); | |
8c2383c3 CM |
927 | |
928 | nrptrs = min((count + PAGE_CACHE_SIZE - 1) / PAGE_CACHE_SIZE, | |
929 | PAGE_CACHE_SIZE / (sizeof(struct page *))); | |
39279cc3 CM |
930 | pinned[0] = NULL; |
931 | pinned[1] = NULL; | |
2ff3e9b6 | 932 | |
39279cc3 | 933 | pos = *ppos; |
2ff3e9b6 CM |
934 | start_pos = pos; |
935 | ||
39279cc3 CM |
936 | vfs_check_frozen(inode->i_sb, SB_FREEZE_WRITE); |
937 | current->backing_dev_info = inode->i_mapping->backing_dev_info; | |
938 | err = generic_write_checks(file, &pos, &count, S_ISBLK(inode->i_mode)); | |
939 | if (err) | |
1832a6d5 | 940 | goto out_nolock; |
39279cc3 | 941 | if (count == 0) |
1832a6d5 | 942 | goto out_nolock; |
2b1f55b0 | 943 | |
0ee0fda0 | 944 | err = file_remove_suid(file); |
39279cc3 | 945 | if (err) |
1832a6d5 | 946 | goto out_nolock; |
39279cc3 CM |
947 | file_update_time(file); |
948 | ||
8c2383c3 | 949 | pages = kmalloc(nrptrs * sizeof(struct page *), GFP_KERNEL); |
39279cc3 CM |
950 | |
951 | mutex_lock(&inode->i_mutex); | |
c3027eb5 | 952 | BTRFS_I(inode)->sequence++; |
39279cc3 CM |
953 | first_index = pos >> PAGE_CACHE_SHIFT; |
954 | last_index = (pos + count) >> PAGE_CACHE_SHIFT; | |
955 | ||
956 | /* | |
957 | * there are lots of better ways to do this, but this code | |
958 | * makes sure the first and last page in the file range are | |
959 | * up to date and ready for cow | |
960 | */ | |
961 | if ((pos & (PAGE_CACHE_SIZE - 1))) { | |
962 | pinned[0] = grab_cache_page(inode->i_mapping, first_index); | |
963 | if (!PageUptodate(pinned[0])) { | |
9ebefb18 | 964 | ret = btrfs_readpage(NULL, pinned[0]); |
39279cc3 CM |
965 | BUG_ON(ret); |
966 | wait_on_page_locked(pinned[0]); | |
967 | } else { | |
968 | unlock_page(pinned[0]); | |
969 | } | |
970 | } | |
971 | if ((pos + count) & (PAGE_CACHE_SIZE - 1)) { | |
972 | pinned[1] = grab_cache_page(inode->i_mapping, last_index); | |
973 | if (!PageUptodate(pinned[1])) { | |
9ebefb18 | 974 | ret = btrfs_readpage(NULL, pinned[1]); |
39279cc3 CM |
975 | BUG_ON(ret); |
976 | wait_on_page_locked(pinned[1]); | |
977 | } else { | |
978 | unlock_page(pinned[1]); | |
979 | } | |
980 | } | |
981 | ||
d397712b | 982 | while (count > 0) { |
39279cc3 | 983 | size_t offset = pos & (PAGE_CACHE_SIZE - 1); |
11bd143f CM |
984 | size_t write_bytes = min(count, nrptrs * |
985 | (size_t)PAGE_CACHE_SIZE - | |
8c2383c3 | 986 | offset); |
39279cc3 CM |
987 | size_t num_pages = (write_bytes + PAGE_CACHE_SIZE - 1) >> |
988 | PAGE_CACHE_SHIFT; | |
989 | ||
8c2383c3 | 990 | WARN_ON(num_pages > nrptrs); |
9aead435 | 991 | memset(pages, 0, sizeof(struct page *) * nrptrs); |
1832a6d5 | 992 | |
6a63209f | 993 | ret = btrfs_check_data_free_space(root, inode, write_bytes); |
1832a6d5 CM |
994 | if (ret) |
995 | goto out; | |
996 | ||
39279cc3 CM |
997 | ret = prepare_pages(root, file, pages, num_pages, |
998 | pos, first_index, last_index, | |
8c2383c3 | 999 | write_bytes); |
6a63209f JB |
1000 | if (ret) { |
1001 | btrfs_free_reserved_data_space(root, inode, | |
1002 | write_bytes); | |
54aa1f4d | 1003 | goto out; |
6a63209f | 1004 | } |
39279cc3 | 1005 | |
39279cc3 CM |
1006 | ret = btrfs_copy_from_user(pos, num_pages, |
1007 | write_bytes, pages, buf); | |
54aa1f4d | 1008 | if (ret) { |
6a63209f JB |
1009 | btrfs_free_reserved_data_space(root, inode, |
1010 | write_bytes); | |
54aa1f4d CM |
1011 | btrfs_drop_pages(pages, num_pages); |
1012 | goto out; | |
1013 | } | |
39279cc3 CM |
1014 | |
1015 | ret = dirty_and_release_pages(NULL, root, file, pages, | |
1016 | num_pages, pos, write_bytes); | |
39279cc3 | 1017 | btrfs_drop_pages(pages, num_pages); |
6a63209f JB |
1018 | if (ret) { |
1019 | btrfs_free_reserved_data_space(root, inode, | |
1020 | write_bytes); | |
54aa1f4d | 1021 | goto out; |
6a63209f | 1022 | } |
39279cc3 | 1023 | |
cb843a6f CM |
1024 | if (will_write) { |
1025 | btrfs_fdatawrite_range(inode->i_mapping, pos, | |
1026 | pos + write_bytes - 1, | |
d313d7a3 | 1027 | WB_SYNC_ALL); |
cb843a6f CM |
1028 | } else { |
1029 | balance_dirty_pages_ratelimited_nr(inode->i_mapping, | |
1030 | num_pages); | |
1031 | if (num_pages < | |
1032 | (root->leafsize >> PAGE_CACHE_SHIFT) + 1) | |
1033 | btrfs_btree_balance_dirty(root, 1); | |
1034 | btrfs_throttle(root); | |
1035 | } | |
1036 | ||
39279cc3 CM |
1037 | buf += write_bytes; |
1038 | count -= write_bytes; | |
1039 | pos += write_bytes; | |
1040 | num_written += write_bytes; | |
1041 | ||
39279cc3 CM |
1042 | cond_resched(); |
1043 | } | |
39279cc3 | 1044 | out: |
1832a6d5 | 1045 | mutex_unlock(&inode->i_mutex); |
6a63209f JB |
1046 | if (ret) |
1047 | err = ret; | |
5b92ee72 | 1048 | |
1832a6d5 | 1049 | out_nolock: |
8c2383c3 | 1050 | kfree(pages); |
39279cc3 CM |
1051 | if (pinned[0]) |
1052 | page_cache_release(pinned[0]); | |
1053 | if (pinned[1]) | |
1054 | page_cache_release(pinned[1]); | |
1055 | *ppos = pos; | |
2ff3e9b6 | 1056 | |
5a3f23d5 CM |
1057 | /* |
1058 | * we want to make sure fsync finds this change | |
1059 | * but we haven't joined a transaction running right now. | |
1060 | * | |
1061 | * Later on, someone is sure to update the inode and get the | |
1062 | * real transid recorded. | |
1063 | * | |
1064 | * We set last_trans now to the fs_info generation + 1, | |
1065 | * this will either be one more than the running transaction | |
1066 | * or the generation used for the next transaction if there isn't | |
1067 | * one running right now. | |
1068 | */ | |
1069 | BTRFS_I(inode)->last_trans = root->fs_info->generation + 1; | |
1070 | ||
cb843a6f | 1071 | if (num_written > 0 && will_write) { |
e02119d5 CM |
1072 | struct btrfs_trans_handle *trans; |
1073 | ||
cb843a6f CM |
1074 | err = btrfs_wait_ordered_range(inode, start_pos, num_written); |
1075 | if (err) | |
2ff3e9b6 | 1076 | num_written = err; |
e02119d5 | 1077 | |
cb843a6f CM |
1078 | if ((file->f_flags & O_SYNC) || IS_SYNC(inode)) { |
1079 | trans = btrfs_start_transaction(root, 1); | |
1080 | ret = btrfs_log_dentry_safe(trans, root, | |
1081 | file->f_dentry); | |
1082 | if (ret == 0) { | |
12fcfd22 CM |
1083 | ret = btrfs_sync_log(trans, root); |
1084 | if (ret == 0) | |
1085 | btrfs_end_transaction(trans, root); | |
1086 | else | |
1087 | btrfs_commit_transaction(trans, root); | |
cb843a6f CM |
1088 | } else { |
1089 | btrfs_commit_transaction(trans, root); | |
1090 | } | |
1091 | } | |
1092 | if (file->f_flags & O_DIRECT) { | |
1093 | invalidate_mapping_pages(inode->i_mapping, | |
1094 | start_pos >> PAGE_CACHE_SHIFT, | |
1095 | (start_pos + num_written - 1) >> PAGE_CACHE_SHIFT); | |
e02119d5 | 1096 | } |
2ff3e9b6 | 1097 | } |
39279cc3 | 1098 | current->backing_dev_info = NULL; |
39279cc3 CM |
1099 | return num_written ? num_written : err; |
1100 | } | |
1101 | ||
d397712b | 1102 | int btrfs_release_file(struct inode *inode, struct file *filp) |
e1b81e67 | 1103 | { |
5a3f23d5 CM |
1104 | /* |
1105 | * ordered_data_close is set by settattr when we are about to truncate | |
1106 | * a file from a non-zero size to a zero size. This tries to | |
1107 | * flush down new bytes that may have been written if the | |
1108 | * application were using truncate to replace a file in place. | |
1109 | */ | |
1110 | if (BTRFS_I(inode)->ordered_data_close) { | |
1111 | BTRFS_I(inode)->ordered_data_close = 0; | |
1112 | btrfs_add_ordered_operation(NULL, BTRFS_I(inode)->root, inode); | |
1113 | if (inode->i_size > BTRFS_ORDERED_OPERATIONS_FLUSH_LIMIT) | |
1114 | filemap_flush(inode->i_mapping); | |
1115 | } | |
6bf13c0c SW |
1116 | if (filp->private_data) |
1117 | btrfs_ioctl_trans_end(filp); | |
e1b81e67 M |
1118 | return 0; |
1119 | } | |
1120 | ||
d352ac68 CM |
1121 | /* |
1122 | * fsync call for both files and directories. This logs the inode into | |
1123 | * the tree log instead of forcing full commits whenever possible. | |
1124 | * | |
1125 | * It needs to call filemap_fdatawait so that all ordered extent updates are | |
1126 | * in the metadata btree are up to date for copying to the log. | |
1127 | * | |
1128 | * It drops the inode mutex before doing the tree log commit. This is an | |
1129 | * important optimization for directories because holding the mutex prevents | |
1130 | * new operations on the dir while we write to disk. | |
1131 | */ | |
e02119d5 | 1132 | int btrfs_sync_file(struct file *file, struct dentry *dentry, int datasync) |
39279cc3 CM |
1133 | { |
1134 | struct inode *inode = dentry->d_inode; | |
1135 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
15ee9bc7 | 1136 | int ret = 0; |
39279cc3 CM |
1137 | struct btrfs_trans_handle *trans; |
1138 | ||
1139 | /* | |
15ee9bc7 JB |
1140 | * check the transaction that last modified this inode |
1141 | * and see if its already been committed | |
39279cc3 | 1142 | */ |
15ee9bc7 JB |
1143 | if (!BTRFS_I(inode)->last_trans) |
1144 | goto out; | |
a2135011 | 1145 | |
15ee9bc7 JB |
1146 | mutex_lock(&root->fs_info->trans_mutex); |
1147 | if (BTRFS_I(inode)->last_trans <= | |
1148 | root->fs_info->last_trans_committed) { | |
1149 | BTRFS_I(inode)->last_trans = 0; | |
1150 | mutex_unlock(&root->fs_info->trans_mutex); | |
1151 | goto out; | |
1152 | } | |
1153 | mutex_unlock(&root->fs_info->trans_mutex); | |
1154 | ||
7237f183 | 1155 | root->log_batch++; |
580afd76 CM |
1156 | filemap_fdatawrite(inode->i_mapping); |
1157 | btrfs_wait_ordered_range(inode, 0, (u64)-1); | |
7237f183 | 1158 | root->log_batch++; |
e02119d5 | 1159 | |
524724ed HH |
1160 | if (datasync && !(inode->i_state & I_DIRTY_PAGES)) |
1161 | goto out; | |
15ee9bc7 | 1162 | /* |
a52d9a80 CM |
1163 | * ok we haven't committed the transaction yet, lets do a commit |
1164 | */ | |
2cfbd50b | 1165 | if (file && file->private_data) |
6bf13c0c SW |
1166 | btrfs_ioctl_trans_end(file); |
1167 | ||
39279cc3 CM |
1168 | trans = btrfs_start_transaction(root, 1); |
1169 | if (!trans) { | |
1170 | ret = -ENOMEM; | |
1171 | goto out; | |
1172 | } | |
e02119d5 | 1173 | |
2cfbd50b | 1174 | ret = btrfs_log_dentry_safe(trans, root, dentry); |
d397712b | 1175 | if (ret < 0) |
e02119d5 | 1176 | goto out; |
49eb7e46 CM |
1177 | |
1178 | /* we've logged all the items and now have a consistent | |
1179 | * version of the file in the log. It is possible that | |
1180 | * someone will come in and modify the file, but that's | |
1181 | * fine because the log is consistent on disk, and we | |
1182 | * have references to all of the file's extents | |
1183 | * | |
1184 | * It is possible that someone will come in and log the | |
1185 | * file again, but that will end up using the synchronization | |
1186 | * inside btrfs_sync_log to keep things safe. | |
1187 | */ | |
2cfbd50b | 1188 | mutex_unlock(&dentry->d_inode->i_mutex); |
49eb7e46 | 1189 | |
e02119d5 CM |
1190 | if (ret > 0) { |
1191 | ret = btrfs_commit_transaction(trans, root); | |
1192 | } else { | |
12fcfd22 CM |
1193 | ret = btrfs_sync_log(trans, root); |
1194 | if (ret == 0) | |
1195 | ret = btrfs_end_transaction(trans, root); | |
1196 | else | |
1197 | ret = btrfs_commit_transaction(trans, root); | |
e02119d5 | 1198 | } |
2cfbd50b | 1199 | mutex_lock(&dentry->d_inode->i_mutex); |
39279cc3 CM |
1200 | out: |
1201 | return ret > 0 ? EIO : ret; | |
1202 | } | |
1203 | ||
9ebefb18 | 1204 | static struct vm_operations_struct btrfs_file_vm_ops = { |
92fee66d | 1205 | .fault = filemap_fault, |
9ebefb18 CM |
1206 | .page_mkwrite = btrfs_page_mkwrite, |
1207 | }; | |
1208 | ||
1209 | static int btrfs_file_mmap(struct file *filp, struct vm_area_struct *vma) | |
1210 | { | |
1211 | vma->vm_ops = &btrfs_file_vm_ops; | |
1212 | file_accessed(filp); | |
1213 | return 0; | |
1214 | } | |
1215 | ||
39279cc3 CM |
1216 | struct file_operations btrfs_file_operations = { |
1217 | .llseek = generic_file_llseek, | |
1218 | .read = do_sync_read, | |
9ebefb18 | 1219 | .aio_read = generic_file_aio_read, |
e9906a98 | 1220 | .splice_read = generic_file_splice_read, |
39279cc3 | 1221 | .write = btrfs_file_write, |
9ebefb18 | 1222 | .mmap = btrfs_file_mmap, |
39279cc3 | 1223 | .open = generic_file_open, |
e1b81e67 | 1224 | .release = btrfs_release_file, |
39279cc3 | 1225 | .fsync = btrfs_sync_file, |
34287aa3 | 1226 | .unlocked_ioctl = btrfs_ioctl, |
39279cc3 | 1227 | #ifdef CONFIG_COMPAT |
34287aa3 | 1228 | .compat_ioctl = btrfs_ioctl, |
39279cc3 CM |
1229 | #endif |
1230 | }; |