]>
Commit | Line | Data |
---|---|---|
c1d7c514 | 1 | // SPDX-License-Identifier: GPL-2.0 |
6cbd5570 CM |
2 | /* |
3 | * Copyright (C) 2007 Oracle. All rights reserved. | |
6cbd5570 CM |
4 | */ |
5 | ||
7999096f | 6 | #include <crypto/hash.h> |
8f18cf13 | 7 | #include <linux/kernel.h> |
065631f6 | 8 | #include <linux/bio.h> |
348332e0 | 9 | #include <linux/blk-cgroup.h> |
f2eb0a24 | 10 | #include <linux/file.h> |
39279cc3 CM |
11 | #include <linux/fs.h> |
12 | #include <linux/pagemap.h> | |
13 | #include <linux/highmem.h> | |
14 | #include <linux/time.h> | |
15 | #include <linux/init.h> | |
16 | #include <linux/string.h> | |
39279cc3 | 17 | #include <linux/backing-dev.h> |
39279cc3 | 18 | #include <linux/writeback.h> |
39279cc3 | 19 | #include <linux/compat.h> |
5103e947 | 20 | #include <linux/xattr.h> |
33268eaf | 21 | #include <linux/posix_acl.h> |
d899e052 | 22 | #include <linux/falloc.h> |
5a0e3ad6 | 23 | #include <linux/slab.h> |
7a36ddec | 24 | #include <linux/ratelimit.h> |
55e301fd | 25 | #include <linux/btrfs.h> |
53b381b3 | 26 | #include <linux/blkdev.h> |
f23b5a59 | 27 | #include <linux/posix_acl_xattr.h> |
e2e40f2c | 28 | #include <linux/uio.h> |
69fe2d75 | 29 | #include <linux/magic.h> |
ae5e165d | 30 | #include <linux/iversion.h> |
ed46ff3d | 31 | #include <linux/swap.h> |
f8e66081 | 32 | #include <linux/migrate.h> |
b1c16ac9 | 33 | #include <linux/sched/mm.h> |
f85781fb | 34 | #include <linux/iomap.h> |
92d32170 | 35 | #include <asm/unaligned.h> |
14605409 | 36 | #include <linux/fsverity.h> |
602cbe91 | 37 | #include "misc.h" |
39279cc3 CM |
38 | #include "ctree.h" |
39 | #include "disk-io.h" | |
40 | #include "transaction.h" | |
41 | #include "btrfs_inode.h" | |
39279cc3 | 42 | #include "print-tree.h" |
e6dcd2dc | 43 | #include "ordered-data.h" |
95819c05 | 44 | #include "xattr.h" |
e02119d5 | 45 | #include "tree-log.h" |
103c1972 | 46 | #include "bio.h" |
c8b97818 | 47 | #include "compression.h" |
b4ce94de | 48 | #include "locking.h" |
dc89e982 | 49 | #include "free-space-cache.h" |
63541927 | 50 | #include "props.h" |
31193213 | 51 | #include "qgroup.h" |
86736342 | 52 | #include "delalloc-space.h" |
aac0023c | 53 | #include "block-group.h" |
467dc47e | 54 | #include "space-info.h" |
d8e3fb10 | 55 | #include "zoned.h" |
b945a463 | 56 | #include "subpage.h" |
26c2c454 | 57 | #include "inode-item.h" |
c7f13d42 | 58 | #include "fs.h" |
ad1ac501 | 59 | #include "accessors.h" |
a0231804 | 60 | #include "extent-tree.h" |
45c40c8f | 61 | #include "root-tree.h" |
59b818e0 | 62 | #include "defrag.h" |
f2b39277 | 63 | #include "dir-item.h" |
7c8ede16 | 64 | #include "file-item.h" |
c7a03b52 | 65 | #include "uuid-tree.h" |
7572dec8 | 66 | #include "ioctl.h" |
af142b6f | 67 | #include "file.h" |
33cf97a7 | 68 | #include "acl.h" |
67707479 | 69 | #include "relocation.h" |
5c11adcc | 70 | #include "verity.h" |
7f0add25 | 71 | #include "super.h" |
aa5d3003 | 72 | #include "orphan.h" |
b9a9a850 | 73 | #include "backref.h" |
02c372e1 | 74 | #include "raid-stripe-tree.h" |
39279cc3 CM |
75 | |
76 | struct btrfs_iget_args { | |
0202e83f | 77 | u64 ino; |
39279cc3 CM |
78 | struct btrfs_root *root; |
79 | }; | |
80 | ||
f28a4928 | 81 | struct btrfs_dio_data { |
f85781fb GR |
82 | ssize_t submitted; |
83 | struct extent_changeset *data_reserved; | |
53f2c206 | 84 | struct btrfs_ordered_extent *ordered; |
f5585f4f FM |
85 | bool data_space_reserved; |
86 | bool nocow_done; | |
f28a4928 FM |
87 | }; |
88 | ||
a3e171a0 | 89 | struct btrfs_dio_private { |
67d66982 | 90 | /* Range of I/O */ |
a3e171a0 | 91 | u64 file_offset; |
a3e171a0 CH |
92 | u32 bytes; |
93 | ||
642c5d34 | 94 | /* This must be last */ |
67d66982 | 95 | struct btrfs_bio bbio; |
a3e171a0 CH |
96 | }; |
97 | ||
642c5d34 CH |
98 | static struct bio_set btrfs_dio_bioset; |
99 | ||
88d2beec FM |
100 | struct btrfs_rename_ctx { |
101 | /* Output field. Stores the index number of the old directory entry. */ | |
102 | u64 index; | |
103 | }; | |
104 | ||
b9a9a850 QW |
105 | /* |
106 | * Used by data_reloc_print_warning_inode() to pass needed info for filename | |
107 | * resolution and output of error message. | |
108 | */ | |
109 | struct data_reloc_warn { | |
110 | struct btrfs_path path; | |
111 | struct btrfs_fs_info *fs_info; | |
112 | u64 extent_item_size; | |
113 | u64 logical; | |
114 | int mirror_num; | |
115 | }; | |
116 | ||
6e1d5dcc AD |
117 | static const struct inode_operations btrfs_dir_inode_operations; |
118 | static const struct inode_operations btrfs_symlink_inode_operations; | |
6e1d5dcc AD |
119 | static const struct inode_operations btrfs_special_inode_operations; |
120 | static const struct inode_operations btrfs_file_inode_operations; | |
7f09410b | 121 | static const struct address_space_operations btrfs_aops; |
828c0950 | 122 | static const struct file_operations btrfs_dir_file_operations; |
39279cc3 CM |
123 | |
124 | static struct kmem_cache *btrfs_inode_cachep; | |
39279cc3 | 125 | |
3972f260 | 126 | static int btrfs_setsize(struct inode *inode, struct iattr *attr); |
d9dcae67 | 127 | static int btrfs_truncate(struct btrfs_inode *inode, bool skip_writeback); |
ba9145ad | 128 | |
256b0cf9 CH |
129 | static noinline int run_delalloc_cow(struct btrfs_inode *inode, |
130 | struct page *locked_page, u64 start, | |
131 | u64 end, struct writeback_control *wbc, | |
132 | bool pages_dirty); | |
4b67c11d NB |
133 | static struct extent_map *create_io_em(struct btrfs_inode *inode, u64 start, |
134 | u64 len, u64 orig_start, u64 block_start, | |
6f9994db LB |
135 | u64 block_len, u64 orig_block_len, |
136 | u64 ram_bytes, int compress_type, | |
137 | int type); | |
7b128766 | 138 | |
b9a9a850 QW |
139 | static int data_reloc_print_warning_inode(u64 inum, u64 offset, u64 num_bytes, |
140 | u64 root, void *warn_ctx) | |
141 | { | |
142 | struct data_reloc_warn *warn = warn_ctx; | |
143 | struct btrfs_fs_info *fs_info = warn->fs_info; | |
144 | struct extent_buffer *eb; | |
145 | struct btrfs_inode_item *inode_item; | |
146 | struct inode_fs_paths *ipath = NULL; | |
147 | struct btrfs_root *local_root; | |
148 | struct btrfs_key key; | |
149 | unsigned int nofs_flag; | |
150 | u32 nlink; | |
151 | int ret; | |
152 | ||
153 | local_root = btrfs_get_fs_root(fs_info, root, true); | |
154 | if (IS_ERR(local_root)) { | |
155 | ret = PTR_ERR(local_root); | |
156 | goto err; | |
157 | } | |
158 | ||
159 | /* This makes the path point to (inum INODE_ITEM ioff). */ | |
160 | key.objectid = inum; | |
161 | key.type = BTRFS_INODE_ITEM_KEY; | |
162 | key.offset = 0; | |
163 | ||
164 | ret = btrfs_search_slot(NULL, local_root, &key, &warn->path, 0, 0); | |
165 | if (ret) { | |
166 | btrfs_put_root(local_root); | |
167 | btrfs_release_path(&warn->path); | |
168 | goto err; | |
169 | } | |
170 | ||
171 | eb = warn->path.nodes[0]; | |
172 | inode_item = btrfs_item_ptr(eb, warn->path.slots[0], struct btrfs_inode_item); | |
173 | nlink = btrfs_inode_nlink(eb, inode_item); | |
174 | btrfs_release_path(&warn->path); | |
175 | ||
176 | nofs_flag = memalloc_nofs_save(); | |
177 | ipath = init_ipath(4096, local_root, &warn->path); | |
178 | memalloc_nofs_restore(nofs_flag); | |
179 | if (IS_ERR(ipath)) { | |
180 | btrfs_put_root(local_root); | |
181 | ret = PTR_ERR(ipath); | |
182 | ipath = NULL; | |
183 | /* | |
184 | * -ENOMEM, not a critical error, just output an generic error | |
185 | * without filename. | |
186 | */ | |
187 | btrfs_warn(fs_info, | |
188 | "checksum error at logical %llu mirror %u root %llu, inode %llu offset %llu", | |
189 | warn->logical, warn->mirror_num, root, inum, offset); | |
190 | return ret; | |
191 | } | |
192 | ret = paths_from_inode(inum, ipath); | |
193 | if (ret < 0) | |
194 | goto err; | |
195 | ||
196 | /* | |
197 | * We deliberately ignore the bit ipath might have been too small to | |
198 | * hold all of the paths here | |
199 | */ | |
200 | for (int i = 0; i < ipath->fspath->elem_cnt; i++) { | |
201 | btrfs_warn(fs_info, | |
202 | "checksum error at logical %llu mirror %u root %llu inode %llu offset %llu length %u links %u (path: %s)", | |
203 | warn->logical, warn->mirror_num, root, inum, offset, | |
204 | fs_info->sectorsize, nlink, | |
205 | (char *)(unsigned long)ipath->fspath->val[i]); | |
206 | } | |
207 | ||
208 | btrfs_put_root(local_root); | |
209 | free_ipath(ipath); | |
210 | return 0; | |
211 | ||
212 | err: | |
213 | btrfs_warn(fs_info, | |
214 | "checksum error at logical %llu mirror %u root %llu inode %llu offset %llu, path resolving failed with ret=%d", | |
215 | warn->logical, warn->mirror_num, root, inum, offset, ret); | |
216 | ||
217 | free_ipath(ipath); | |
218 | return ret; | |
219 | } | |
220 | ||
221 | /* | |
222 | * Do extra user-friendly error output (e.g. lookup all the affected files). | |
223 | * | |
224 | * Return true if we succeeded doing the backref lookup. | |
225 | * Return false if such lookup failed, and has to fallback to the old error message. | |
226 | */ | |
227 | static void print_data_reloc_error(const struct btrfs_inode *inode, u64 file_off, | |
228 | const u8 *csum, const u8 *csum_expected, | |
229 | int mirror_num) | |
230 | { | |
231 | struct btrfs_fs_info *fs_info = inode->root->fs_info; | |
232 | struct btrfs_path path = { 0 }; | |
233 | struct btrfs_key found_key = { 0 }; | |
234 | struct extent_buffer *eb; | |
235 | struct btrfs_extent_item *ei; | |
236 | const u32 csum_size = fs_info->csum_size; | |
237 | u64 logical; | |
238 | u64 flags; | |
239 | u32 item_size; | |
240 | int ret; | |
241 | ||
242 | mutex_lock(&fs_info->reloc_mutex); | |
243 | logical = btrfs_get_reloc_bg_bytenr(fs_info); | |
244 | mutex_unlock(&fs_info->reloc_mutex); | |
245 | ||
246 | if (logical == U64_MAX) { | |
247 | btrfs_warn_rl(fs_info, "has data reloc tree but no running relocation"); | |
248 | btrfs_warn_rl(fs_info, | |
249 | "csum failed root %lld ino %llu off %llu csum " CSUM_FMT " expected csum " CSUM_FMT " mirror %d", | |
250 | inode->root->root_key.objectid, btrfs_ino(inode), file_off, | |
251 | CSUM_FMT_VALUE(csum_size, csum), | |
252 | CSUM_FMT_VALUE(csum_size, csum_expected), | |
253 | mirror_num); | |
254 | return; | |
255 | } | |
256 | ||
257 | logical += file_off; | |
258 | btrfs_warn_rl(fs_info, | |
259 | "csum failed root %lld ino %llu off %llu logical %llu csum " CSUM_FMT " expected csum " CSUM_FMT " mirror %d", | |
260 | inode->root->root_key.objectid, | |
261 | btrfs_ino(inode), file_off, logical, | |
262 | CSUM_FMT_VALUE(csum_size, csum), | |
263 | CSUM_FMT_VALUE(csum_size, csum_expected), | |
264 | mirror_num); | |
265 | ||
266 | ret = extent_from_logical(fs_info, logical, &path, &found_key, &flags); | |
267 | if (ret < 0) { | |
268 | btrfs_err_rl(fs_info, "failed to lookup extent item for logical %llu: %d", | |
269 | logical, ret); | |
270 | return; | |
271 | } | |
272 | eb = path.nodes[0]; | |
273 | ei = btrfs_item_ptr(eb, path.slots[0], struct btrfs_extent_item); | |
274 | item_size = btrfs_item_size(eb, path.slots[0]); | |
275 | if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) { | |
276 | unsigned long ptr = 0; | |
277 | u64 ref_root; | |
278 | u8 ref_level; | |
279 | ||
b7f9945a | 280 | while (true) { |
b9a9a850 QW |
281 | ret = tree_backref_for_extent(&ptr, eb, &found_key, ei, |
282 | item_size, &ref_root, | |
283 | &ref_level); | |
b7f9945a QW |
284 | if (ret < 0) { |
285 | btrfs_warn_rl(fs_info, | |
286 | "failed to resolve tree backref for logical %llu: %d", | |
287 | logical, ret); | |
288 | break; | |
289 | } | |
290 | if (ret > 0) | |
291 | break; | |
292 | ||
b9a9a850 QW |
293 | btrfs_warn_rl(fs_info, |
294 | "csum error at logical %llu mirror %u: metadata %s (level %d) in tree %llu", | |
295 | logical, mirror_num, | |
296 | (ref_level ? "node" : "leaf"), | |
b7f9945a QW |
297 | ref_level, ref_root); |
298 | } | |
b9a9a850 QW |
299 | btrfs_release_path(&path); |
300 | } else { | |
301 | struct btrfs_backref_walk_ctx ctx = { 0 }; | |
302 | struct data_reloc_warn reloc_warn = { 0 }; | |
303 | ||
304 | btrfs_release_path(&path); | |
305 | ||
306 | ctx.bytenr = found_key.objectid; | |
307 | ctx.extent_item_pos = logical - found_key.objectid; | |
308 | ctx.fs_info = fs_info; | |
309 | ||
310 | reloc_warn.logical = logical; | |
311 | reloc_warn.extent_item_size = found_key.offset; | |
312 | reloc_warn.mirror_num = mirror_num; | |
313 | reloc_warn.fs_info = fs_info; | |
314 | ||
315 | iterate_extent_inodes(&ctx, true, | |
316 | data_reloc_print_warning_inode, &reloc_warn); | |
317 | } | |
318 | } | |
319 | ||
f60acad3 JB |
320 | static void __cold btrfs_print_data_csum_error(struct btrfs_inode *inode, |
321 | u64 logical_start, u8 *csum, u8 *csum_expected, int mirror_num) | |
322 | { | |
323 | struct btrfs_root *root = inode->root; | |
324 | const u32 csum_size = root->fs_info->csum_size; | |
325 | ||
b9a9a850 QW |
326 | /* For data reloc tree, it's better to do a backref lookup instead. */ |
327 | if (root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID) | |
328 | return print_data_reloc_error(inode, logical_start, csum, | |
329 | csum_expected, mirror_num); | |
330 | ||
f60acad3 JB |
331 | /* Output without objectid, which is more meaningful */ |
332 | if (root->root_key.objectid >= BTRFS_LAST_FREE_OBJECTID) { | |
333 | btrfs_warn_rl(root->fs_info, | |
334 | "csum failed root %lld ino %lld off %llu csum " CSUM_FMT " expected csum " CSUM_FMT " mirror %d", | |
335 | root->root_key.objectid, btrfs_ino(inode), | |
336 | logical_start, | |
337 | CSUM_FMT_VALUE(csum_size, csum), | |
338 | CSUM_FMT_VALUE(csum_size, csum_expected), | |
339 | mirror_num); | |
340 | } else { | |
341 | btrfs_warn_rl(root->fs_info, | |
342 | "csum failed root %llu ino %llu off %llu csum " CSUM_FMT " expected csum " CSUM_FMT " mirror %d", | |
343 | root->root_key.objectid, btrfs_ino(inode), | |
344 | logical_start, | |
345 | CSUM_FMT_VALUE(csum_size, csum), | |
346 | CSUM_FMT_VALUE(csum_size, csum_expected), | |
347 | mirror_num); | |
348 | } | |
349 | } | |
350 | ||
a14b78ad | 351 | /* |
9580503b | 352 | * Lock inode i_rwsem based on arguments passed. |
a14b78ad GR |
353 | * |
354 | * ilock_flags can have the following bit set: | |
355 | * | |
356 | * BTRFS_ILOCK_SHARED - acquire a shared lock on the inode | |
357 | * BTRFS_ILOCK_TRY - try to acquire the lock, if fails on first attempt | |
358 | * return -EAGAIN | |
8318ba79 | 359 | * BTRFS_ILOCK_MMAP - acquire a write lock on the i_mmap_lock |
a14b78ad | 360 | */ |
29b6352b | 361 | int btrfs_inode_lock(struct btrfs_inode *inode, unsigned int ilock_flags) |
a14b78ad GR |
362 | { |
363 | if (ilock_flags & BTRFS_ILOCK_SHARED) { | |
364 | if (ilock_flags & BTRFS_ILOCK_TRY) { | |
29b6352b | 365 | if (!inode_trylock_shared(&inode->vfs_inode)) |
a14b78ad GR |
366 | return -EAGAIN; |
367 | else | |
368 | return 0; | |
369 | } | |
29b6352b | 370 | inode_lock_shared(&inode->vfs_inode); |
a14b78ad GR |
371 | } else { |
372 | if (ilock_flags & BTRFS_ILOCK_TRY) { | |
29b6352b | 373 | if (!inode_trylock(&inode->vfs_inode)) |
a14b78ad GR |
374 | return -EAGAIN; |
375 | else | |
376 | return 0; | |
377 | } | |
29b6352b | 378 | inode_lock(&inode->vfs_inode); |
a14b78ad | 379 | } |
8318ba79 | 380 | if (ilock_flags & BTRFS_ILOCK_MMAP) |
29b6352b | 381 | down_write(&inode->i_mmap_lock); |
a14b78ad GR |
382 | return 0; |
383 | } | |
384 | ||
385 | /* | |
9580503b | 386 | * Unock inode i_rwsem. |
a14b78ad GR |
387 | * |
388 | * ilock_flags should contain the same bits set as passed to btrfs_inode_lock() | |
389 | * to decide whether the lock acquired is shared or exclusive. | |
390 | */ | |
e5d4d75b | 391 | void btrfs_inode_unlock(struct btrfs_inode *inode, unsigned int ilock_flags) |
a14b78ad | 392 | { |
8318ba79 | 393 | if (ilock_flags & BTRFS_ILOCK_MMAP) |
e5d4d75b | 394 | up_write(&inode->i_mmap_lock); |
a14b78ad | 395 | if (ilock_flags & BTRFS_ILOCK_SHARED) |
e5d4d75b | 396 | inode_unlock_shared(&inode->vfs_inode); |
a14b78ad | 397 | else |
e5d4d75b | 398 | inode_unlock(&inode->vfs_inode); |
a14b78ad GR |
399 | } |
400 | ||
52427260 QW |
401 | /* |
402 | * Cleanup all submitted ordered extents in specified range to handle errors | |
52042d8e | 403 | * from the btrfs_run_delalloc_range() callback. |
52427260 QW |
404 | * |
405 | * NOTE: caller must ensure that when an error happens, it can not call | |
406 | * extent_clear_unlock_delalloc() to clear both the bits EXTENT_DO_ACCOUNTING | |
407 | * and EXTENT_DELALLOC simultaneously, because that causes the reserved metadata | |
408 | * to be released, which we want to happen only when finishing the ordered | |
d1051d6e | 409 | * extent (btrfs_finish_ordered_io()). |
52427260 | 410 | */ |
64e1db56 | 411 | static inline void btrfs_cleanup_ordered_extents(struct btrfs_inode *inode, |
d1051d6e NB |
412 | struct page *locked_page, |
413 | u64 offset, u64 bytes) | |
52427260 | 414 | { |
63d71450 NA |
415 | unsigned long index = offset >> PAGE_SHIFT; |
416 | unsigned long end_index = (offset + bytes - 1) >> PAGE_SHIFT; | |
0e47b25c | 417 | u64 page_start = 0, page_end = 0; |
63d71450 NA |
418 | struct page *page; |
419 | ||
99826e4c NA |
420 | if (locked_page) { |
421 | page_start = page_offset(locked_page); | |
422 | page_end = page_start + PAGE_SIZE - 1; | |
423 | } | |
424 | ||
63d71450 | 425 | while (index <= end_index) { |
968f2566 | 426 | /* |
9783e4de CH |
427 | * For locked page, we will call btrfs_mark_ordered_io_finished |
428 | * through btrfs_mark_ordered_io_finished() on it | |
429 | * in run_delalloc_range() for the error handling, which will | |
430 | * clear page Ordered and run the ordered extent accounting. | |
968f2566 QW |
431 | * |
432 | * Here we can't just clear the Ordered bit, or | |
433 | * btrfs_mark_ordered_io_finished() would skip the accounting | |
434 | * for the page range, and the ordered extent will never finish. | |
435 | */ | |
99826e4c | 436 | if (locked_page && index == (page_start >> PAGE_SHIFT)) { |
968f2566 QW |
437 | index++; |
438 | continue; | |
439 | } | |
64e1db56 | 440 | page = find_get_page(inode->vfs_inode.i_mapping, index); |
63d71450 NA |
441 | index++; |
442 | if (!page) | |
443 | continue; | |
968f2566 QW |
444 | |
445 | /* | |
446 | * Here we just clear all Ordered bits for every page in the | |
711f447b | 447 | * range, then btrfs_mark_ordered_io_finished() will handle |
968f2566 QW |
448 | * the ordered extent accounting for the range. |
449 | */ | |
b945a463 QW |
450 | btrfs_page_clamp_clear_ordered(inode->root->fs_info, page, |
451 | offset, bytes); | |
63d71450 NA |
452 | put_page(page); |
453 | } | |
d1051d6e | 454 | |
99826e4c NA |
455 | if (locked_page) { |
456 | /* The locked page covers the full range, nothing needs to be done */ | |
457 | if (bytes + offset <= page_start + PAGE_SIZE) | |
458 | return; | |
459 | /* | |
460 | * In case this page belongs to the delalloc range being | |
461 | * instantiated then skip it, since the first page of a range is | |
462 | * going to be properly cleaned up by the caller of | |
463 | * run_delalloc_range | |
464 | */ | |
465 | if (page_start >= offset && page_end <= (offset + bytes - 1)) { | |
466 | bytes = offset + bytes - page_offset(locked_page) - PAGE_SIZE; | |
467 | offset = page_offset(locked_page) + PAGE_SIZE; | |
468 | } | |
d1051d6e NB |
469 | } |
470 | ||
711f447b | 471 | return btrfs_mark_ordered_io_finished(inode, NULL, offset, bytes, false); |
52427260 QW |
472 | } |
473 | ||
7152b425 | 474 | static int btrfs_dirty_inode(struct btrfs_inode *inode); |
7b128766 | 475 | |
f34f57a3 | 476 | static int btrfs_init_inode_security(struct btrfs_trans_handle *trans, |
3538d68d | 477 | struct btrfs_new_inode_args *args) |
0279b4cd JO |
478 | { |
479 | int err; | |
480 | ||
3538d68d OS |
481 | if (args->default_acl) { |
482 | err = __btrfs_set_acl(trans, args->inode, args->default_acl, | |
483 | ACL_TYPE_DEFAULT); | |
484 | if (err) | |
485 | return err; | |
486 | } | |
487 | if (args->acl) { | |
488 | err = __btrfs_set_acl(trans, args->inode, args->acl, ACL_TYPE_ACCESS); | |
489 | if (err) | |
490 | return err; | |
491 | } | |
492 | if (!args->default_acl && !args->acl) | |
493 | cache_no_acl(args->inode); | |
494 | return btrfs_xattr_security_init(trans, args->inode, args->dir, | |
495 | &args->dentry->d_name); | |
0279b4cd JO |
496 | } |
497 | ||
c8b97818 CM |
498 | /* |
499 | * this does all the hard work for inserting an inline extent into | |
500 | * the btree. The caller should have done a btrfs_drop_extents so that | |
501 | * no overlapping inline items exist in the btree | |
502 | */ | |
40f76580 | 503 | static int insert_inline_extent(struct btrfs_trans_handle *trans, |
8dd9872d OS |
504 | struct btrfs_path *path, |
505 | struct btrfs_inode *inode, bool extent_inserted, | |
506 | size_t size, size_t compressed_size, | |
fe3f566c | 507 | int compress_type, |
d9496e8a OS |
508 | struct page **compressed_pages, |
509 | bool update_i_size) | |
c8b97818 | 510 | { |
8dd9872d | 511 | struct btrfs_root *root = inode->root; |
c8b97818 CM |
512 | struct extent_buffer *leaf; |
513 | struct page *page = NULL; | |
514 | char *kaddr; | |
515 | unsigned long ptr; | |
516 | struct btrfs_file_extent_item *ei; | |
c8b97818 CM |
517 | int ret; |
518 | size_t cur_size = size; | |
d9496e8a | 519 | u64 i_size; |
c8b97818 | 520 | |
982f1f5d JJB |
521 | ASSERT((compressed_size > 0 && compressed_pages) || |
522 | (compressed_size == 0 && !compressed_pages)); | |
523 | ||
fe3f566c | 524 | if (compressed_size && compressed_pages) |
c8b97818 | 525 | cur_size = compressed_size; |
c8b97818 | 526 | |
1acae57b FDBM |
527 | if (!extent_inserted) { |
528 | struct btrfs_key key; | |
529 | size_t datasize; | |
c8b97818 | 530 | |
8dd9872d OS |
531 | key.objectid = btrfs_ino(inode); |
532 | key.offset = 0; | |
962a298f | 533 | key.type = BTRFS_EXTENT_DATA_KEY; |
c8b97818 | 534 | |
1acae57b | 535 | datasize = btrfs_file_extent_calc_inline_size(cur_size); |
1acae57b FDBM |
536 | ret = btrfs_insert_empty_item(trans, root, path, &key, |
537 | datasize); | |
79b4f4c6 | 538 | if (ret) |
1acae57b | 539 | goto fail; |
c8b97818 CM |
540 | } |
541 | leaf = path->nodes[0]; | |
542 | ei = btrfs_item_ptr(leaf, path->slots[0], | |
543 | struct btrfs_file_extent_item); | |
544 | btrfs_set_file_extent_generation(leaf, ei, trans->transid); | |
545 | btrfs_set_file_extent_type(leaf, ei, BTRFS_FILE_EXTENT_INLINE); | |
546 | btrfs_set_file_extent_encryption(leaf, ei, 0); | |
547 | btrfs_set_file_extent_other_encoding(leaf, ei, 0); | |
548 | btrfs_set_file_extent_ram_bytes(leaf, ei, size); | |
549 | ptr = btrfs_file_extent_inline_start(ei); | |
550 | ||
261507a0 | 551 | if (compress_type != BTRFS_COMPRESS_NONE) { |
c8b97818 CM |
552 | struct page *cpage; |
553 | int i = 0; | |
d397712b | 554 | while (compressed_size > 0) { |
c8b97818 | 555 | cpage = compressed_pages[i]; |
5b050f04 | 556 | cur_size = min_t(unsigned long, compressed_size, |
09cbfeaf | 557 | PAGE_SIZE); |
c8b97818 | 558 | |
4cb2e5e8 | 559 | kaddr = kmap_local_page(cpage); |
c8b97818 | 560 | write_extent_buffer(leaf, kaddr, ptr, cur_size); |
4cb2e5e8 | 561 | kunmap_local(kaddr); |
c8b97818 CM |
562 | |
563 | i++; | |
564 | ptr += cur_size; | |
565 | compressed_size -= cur_size; | |
566 | } | |
567 | btrfs_set_file_extent_compression(leaf, ei, | |
261507a0 | 568 | compress_type); |
c8b97818 | 569 | } else { |
8dd9872d | 570 | page = find_get_page(inode->vfs_inode.i_mapping, 0); |
c8b97818 | 571 | btrfs_set_file_extent_compression(leaf, ei, 0); |
4cb2e5e8 | 572 | kaddr = kmap_local_page(page); |
8dd9872d | 573 | write_extent_buffer(leaf, kaddr, ptr, size); |
4cb2e5e8 | 574 | kunmap_local(kaddr); |
09cbfeaf | 575 | put_page(page); |
c8b97818 | 576 | } |
50564b65 | 577 | btrfs_mark_buffer_dirty(trans, leaf); |
1acae57b | 578 | btrfs_release_path(path); |
c8b97818 | 579 | |
9ddc959e JB |
580 | /* |
581 | * We align size to sectorsize for inline extents just for simplicity | |
582 | * sake. | |
583 | */ | |
8dd9872d OS |
584 | ret = btrfs_inode_set_file_extent_range(inode, 0, |
585 | ALIGN(size, root->fs_info->sectorsize)); | |
9ddc959e JB |
586 | if (ret) |
587 | goto fail; | |
588 | ||
c2167754 | 589 | /* |
d9496e8a OS |
590 | * We're an inline extent, so nobody can extend the file past i_size |
591 | * without locking a page we already have locked. | |
c2167754 | 592 | * |
d9496e8a OS |
593 | * We must do any i_size and inode updates before we unlock the pages. |
594 | * Otherwise we could end up racing with unlink. | |
c2167754 | 595 | */ |
d9496e8a OS |
596 | i_size = i_size_read(&inode->vfs_inode); |
597 | if (update_i_size && size > i_size) { | |
598 | i_size_write(&inode->vfs_inode, size); | |
599 | i_size = size; | |
600 | } | |
601 | inode->disk_i_size = i_size; | |
8dd9872d | 602 | |
c8b97818 | 603 | fail: |
79b4f4c6 | 604 | return ret; |
c8b97818 CM |
605 | } |
606 | ||
607 | ||
608 | /* | |
609 | * conditionally insert an inline extent into the file. This | |
610 | * does the checks required to make sure the data is small enough | |
611 | * to fit as an inline extent. | |
612 | */ | |
8dd9872d OS |
613 | static noinline int cow_file_range_inline(struct btrfs_inode *inode, u64 size, |
614 | size_t compressed_size, | |
00361589 | 615 | int compress_type, |
d9496e8a OS |
616 | struct page **compressed_pages, |
617 | bool update_i_size) | |
c8b97818 | 618 | { |
5893dfb9 | 619 | struct btrfs_drop_extents_args drop_args = { 0 }; |
a0349401 | 620 | struct btrfs_root *root = inode->root; |
0b246afa | 621 | struct btrfs_fs_info *fs_info = root->fs_info; |
00361589 | 622 | struct btrfs_trans_handle *trans; |
8dd9872d | 623 | u64 data_len = (compressed_size ?: size); |
c8b97818 | 624 | int ret; |
1acae57b | 625 | struct btrfs_path *path; |
c8b97818 | 626 | |
8dd9872d OS |
627 | /* |
628 | * We can create an inline extent if it ends at or beyond the current | |
629 | * i_size, is no larger than a sector (decompressed), and the (possibly | |
630 | * compressed) data fits in a leaf and the configured maximum inline | |
631 | * size. | |
632 | */ | |
633 | if (size < i_size_read(&inode->vfs_inode) || | |
634 | size > fs_info->sectorsize || | |
0b246afa | 635 | data_len > BTRFS_MAX_INLINE_DATA_SIZE(fs_info) || |
8dd9872d | 636 | data_len > fs_info->max_inline) |
c8b97818 | 637 | return 1; |
c8b97818 | 638 | |
1acae57b FDBM |
639 | path = btrfs_alloc_path(); |
640 | if (!path) | |
641 | return -ENOMEM; | |
642 | ||
00361589 | 643 | trans = btrfs_join_transaction(root); |
1acae57b FDBM |
644 | if (IS_ERR(trans)) { |
645 | btrfs_free_path(path); | |
00361589 | 646 | return PTR_ERR(trans); |
1acae57b | 647 | } |
a0349401 | 648 | trans->block_rsv = &inode->block_rsv; |
00361589 | 649 | |
5893dfb9 | 650 | drop_args.path = path; |
8dd9872d OS |
651 | drop_args.start = 0; |
652 | drop_args.end = fs_info->sectorsize; | |
5893dfb9 FM |
653 | drop_args.drop_cache = true; |
654 | drop_args.replace_extent = true; | |
8dd9872d | 655 | drop_args.extent_item_size = btrfs_file_extent_calc_inline_size(data_len); |
5893dfb9 | 656 | ret = btrfs_drop_extents(trans, root, inode, &drop_args); |
00361589 | 657 | if (ret) { |
66642832 | 658 | btrfs_abort_transaction(trans, ret); |
00361589 JB |
659 | goto out; |
660 | } | |
c8b97818 | 661 | |
8dd9872d OS |
662 | ret = insert_inline_extent(trans, path, inode, drop_args.extent_inserted, |
663 | size, compressed_size, compress_type, | |
d9496e8a | 664 | compressed_pages, update_i_size); |
2adcac1a | 665 | if (ret && ret != -ENOSPC) { |
66642832 | 666 | btrfs_abort_transaction(trans, ret); |
00361589 | 667 | goto out; |
2adcac1a | 668 | } else if (ret == -ENOSPC) { |
00361589 JB |
669 | ret = 1; |
670 | goto out; | |
79787eaa | 671 | } |
2adcac1a | 672 | |
8dd9872d | 673 | btrfs_update_inode_bytes(inode, size, drop_args.bytes_found); |
8b9d0322 | 674 | ret = btrfs_update_inode(trans, inode); |
2766ff61 FM |
675 | if (ret && ret != -ENOSPC) { |
676 | btrfs_abort_transaction(trans, ret); | |
677 | goto out; | |
678 | } else if (ret == -ENOSPC) { | |
679 | ret = 1; | |
680 | goto out; | |
681 | } | |
682 | ||
23e3337f | 683 | btrfs_set_inode_full_sync(inode); |
00361589 | 684 | out: |
94ed938a QW |
685 | /* |
686 | * Don't forget to free the reserved space, as for inlined extent | |
687 | * it won't count as data extent, free them directly here. | |
688 | * And at reserve time, it's always aligned to page size, so | |
689 | * just free one page here. | |
690 | */ | |
a0349401 | 691 | btrfs_qgroup_free_data(inode, NULL, 0, PAGE_SIZE); |
1acae57b | 692 | btrfs_free_path(path); |
3a45bb20 | 693 | btrfs_end_transaction(trans); |
00361589 | 694 | return ret; |
c8b97818 CM |
695 | } |
696 | ||
771ed689 CM |
697 | struct async_extent { |
698 | u64 start; | |
699 | u64 ram_size; | |
700 | u64 compressed_size; | |
701 | struct page **pages; | |
702 | unsigned long nr_pages; | |
261507a0 | 703 | int compress_type; |
771ed689 CM |
704 | struct list_head list; |
705 | }; | |
706 | ||
97db1204 | 707 | struct async_chunk { |
99a81a44 | 708 | struct btrfs_inode *inode; |
771ed689 CM |
709 | struct page *locked_page; |
710 | u64 start; | |
711 | u64 end; | |
bf9486d6 | 712 | blk_opf_t write_flags; |
771ed689 | 713 | struct list_head extents; |
ec39f769 | 714 | struct cgroup_subsys_state *blkcg_css; |
771ed689 | 715 | struct btrfs_work work; |
9e895a8f | 716 | struct async_cow *async_cow; |
771ed689 CM |
717 | }; |
718 | ||
97db1204 | 719 | struct async_cow { |
97db1204 NB |
720 | atomic_t num_chunks; |
721 | struct async_chunk chunks[]; | |
771ed689 CM |
722 | }; |
723 | ||
97db1204 | 724 | static noinline int add_async_extent(struct async_chunk *cow, |
771ed689 CM |
725 | u64 start, u64 ram_size, |
726 | u64 compressed_size, | |
727 | struct page **pages, | |
261507a0 LZ |
728 | unsigned long nr_pages, |
729 | int compress_type) | |
771ed689 CM |
730 | { |
731 | struct async_extent *async_extent; | |
732 | ||
733 | async_extent = kmalloc(sizeof(*async_extent), GFP_NOFS); | |
79787eaa | 734 | BUG_ON(!async_extent); /* -ENOMEM */ |
771ed689 CM |
735 | async_extent->start = start; |
736 | async_extent->ram_size = ram_size; | |
737 | async_extent->compressed_size = compressed_size; | |
738 | async_extent->pages = pages; | |
739 | async_extent->nr_pages = nr_pages; | |
261507a0 | 740 | async_extent->compress_type = compress_type; |
771ed689 CM |
741 | list_add_tail(&async_extent->list, &cow->extents); |
742 | return 0; | |
743 | } | |
744 | ||
42c16da6 QW |
745 | /* |
746 | * Check if the inode needs to be submitted to compression, based on mount | |
747 | * options, defragmentation, properties or heuristics. | |
748 | */ | |
808a1292 NB |
749 | static inline int inode_need_compress(struct btrfs_inode *inode, u64 start, |
750 | u64 end) | |
f79707b0 | 751 | { |
808a1292 | 752 | struct btrfs_fs_info *fs_info = inode->root->fs_info; |
f79707b0 | 753 | |
e6f9d696 | 754 | if (!btrfs_inode_can_compress(inode)) { |
42c16da6 QW |
755 | WARN(IS_ENABLED(CONFIG_BTRFS_DEBUG), |
756 | KERN_ERR "BTRFS: unexpected compression for ino %llu\n", | |
808a1292 | 757 | btrfs_ino(inode)); |
42c16da6 QW |
758 | return 0; |
759 | } | |
0cf9b244 QW |
760 | /* |
761 | * Special check for subpage. | |
762 | * | |
763 | * We lock the full page then run each delalloc range in the page, thus | |
764 | * for the following case, we will hit some subpage specific corner case: | |
765 | * | |
766 | * 0 32K 64K | |
767 | * | |///////| |///////| | |
768 | * \- A \- B | |
769 | * | |
770 | * In above case, both range A and range B will try to unlock the full | |
771 | * page [0, 64K), causing the one finished later will have page | |
772 | * unlocked already, triggering various page lock requirement BUG_ON()s. | |
773 | * | |
774 | * So here we add an artificial limit that subpage compression can only | |
775 | * if the range is fully page aligned. | |
776 | * | |
777 | * In theory we only need to ensure the first page is fully covered, but | |
778 | * the tailing partial page will be locked until the full compression | |
779 | * finishes, delaying the write of other range. | |
780 | * | |
781 | * TODO: Make btrfs_run_delalloc_range() to lock all delalloc range | |
782 | * first to prevent any submitted async extent to unlock the full page. | |
783 | * By this, we can ensure for subpage case that only the last async_cow | |
784 | * will unlock the full page. | |
785 | */ | |
786 | if (fs_info->sectorsize < PAGE_SIZE) { | |
1280d2d1 FK |
787 | if (!PAGE_ALIGNED(start) || |
788 | !PAGE_ALIGNED(end + 1)) | |
0cf9b244 QW |
789 | return 0; |
790 | } | |
791 | ||
f79707b0 | 792 | /* force compress */ |
0b246afa | 793 | if (btrfs_test_opt(fs_info, FORCE_COMPRESS)) |
f79707b0 | 794 | return 1; |
eec63c65 | 795 | /* defrag ioctl */ |
808a1292 | 796 | if (inode->defrag_compress) |
eec63c65 | 797 | return 1; |
f79707b0 | 798 | /* bad compression ratios */ |
808a1292 | 799 | if (inode->flags & BTRFS_INODE_NOCOMPRESS) |
f79707b0 | 800 | return 0; |
0b246afa | 801 | if (btrfs_test_opt(fs_info, COMPRESS) || |
808a1292 NB |
802 | inode->flags & BTRFS_INODE_COMPRESS || |
803 | inode->prop_compress) | |
804 | return btrfs_compress_heuristic(&inode->vfs_inode, start, end); | |
f79707b0 WS |
805 | return 0; |
806 | } | |
807 | ||
6158e1ce | 808 | static inline void inode_should_defrag(struct btrfs_inode *inode, |
558732df | 809 | u64 start, u64 end, u64 num_bytes, u32 small_write) |
26d30f85 AJ |
810 | { |
811 | /* If this is a small write inside eof, kick off a defrag */ | |
812 | if (num_bytes < small_write && | |
6158e1ce | 813 | (start > 0 || end + 1 < inode->disk_i_size)) |
558732df | 814 | btrfs_add_inode_defrag(NULL, inode, small_write); |
26d30f85 AJ |
815 | } |
816 | ||
d352ac68 | 817 | /* |
c15d8cf2 | 818 | * Work queue call back to started compression on a file and pages. |
c8b97818 | 819 | * |
c15d8cf2 CH |
820 | * This is done inside an ordered work queue, and the compression is spread |
821 | * across many cpus. The actual IO submission is step two, and the ordered work | |
822 | * queue takes care of making sure that happens in the same order things were | |
823 | * put onto the queue by writepages and friends. | |
c8b97818 | 824 | * |
c15d8cf2 CH |
825 | * If this code finds it can't get good compression, it puts an entry onto the |
826 | * work queue to write the uncompressed bytes. This makes sure that both | |
827 | * compressed inodes and uncompressed inodes are written in the same order that | |
828 | * the flusher thread sent them down. | |
d352ac68 | 829 | */ |
c15d8cf2 | 830 | static void compress_file_range(struct btrfs_work *work) |
b888db2b | 831 | { |
c15d8cf2 CH |
832 | struct async_chunk *async_chunk = |
833 | container_of(work, struct async_chunk, work); | |
99a01bd6 DS |
834 | struct btrfs_inode *inode = async_chunk->inode; |
835 | struct btrfs_fs_info *fs_info = inode->root->fs_info; | |
a994310a | 836 | struct address_space *mapping = inode->vfs_inode.i_mapping; |
0b246afa | 837 | u64 blocksize = fs_info->sectorsize; |
1368c6da NB |
838 | u64 start = async_chunk->start; |
839 | u64 end = async_chunk->end; | |
c8b97818 | 840 | u64 actual_end; |
d98da499 | 841 | u64 i_size; |
e6dcd2dc | 842 | int ret = 0; |
e94e54e8 | 843 | struct page **pages; |
c8b97818 | 844 | unsigned long nr_pages; |
c8b97818 CM |
845 | unsigned long total_compressed = 0; |
846 | unsigned long total_in = 0; | |
e94e54e8 | 847 | unsigned int poff; |
c8b97818 | 848 | int i; |
0b246afa | 849 | int compress_type = fs_info->compress_type; |
b888db2b | 850 | |
99a01bd6 | 851 | inode_should_defrag(inode, start, end, end - start + 1, SZ_16K); |
4cb5300b | 852 | |
44962ca3 CH |
853 | /* |
854 | * We need to call clear_page_dirty_for_io on each page in the range. | |
855 | * Otherwise applications with the file mmap'd can wander in and change | |
856 | * the page contents while we are compressing them. | |
857 | */ | |
858 | extent_range_clear_dirty_for_io(&inode->vfs_inode, start, end); | |
859 | ||
d98da499 JB |
860 | /* |
861 | * We need to save i_size before now because it could change in between | |
862 | * us evaluating the size and assigning it. This is because we lock and | |
863 | * unlock the page in truncate and fallocate, and then modify the i_size | |
864 | * later on. | |
865 | * | |
866 | * The barriers are to emulate READ_ONCE, remove that once i_size_read | |
867 | * does that for us. | |
868 | */ | |
869 | barrier(); | |
99a01bd6 | 870 | i_size = i_size_read(&inode->vfs_inode); |
d98da499 JB |
871 | barrier(); |
872 | actual_end = min_t(u64, i_size, end + 1); | |
c8b97818 | 873 | again: |
e94e54e8 | 874 | pages = NULL; |
09cbfeaf | 875 | nr_pages = (end >> PAGE_SHIFT) - (start >> PAGE_SHIFT) + 1; |
544fe4a9 | 876 | nr_pages = min_t(unsigned long, nr_pages, BTRFS_MAX_COMPRESSED_PAGES); |
be20aa9d | 877 | |
f03d9301 CM |
878 | /* |
879 | * we don't want to send crud past the end of i_size through | |
880 | * compression, that's just a waste of CPU time. So, if the | |
881 | * end of the file is before the start of our current | |
882 | * requested range of bytes, we bail out to the uncompressed | |
883 | * cleanup code that can deal with all of this. | |
884 | * | |
885 | * It isn't really the fastest way to fix things, but this is a | |
886 | * very uncommon corner. | |
887 | */ | |
888 | if (actual_end <= start) | |
889 | goto cleanup_and_bail_uncompressed; | |
890 | ||
c8b97818 CM |
891 | total_compressed = actual_end - start; |
892 | ||
4bcbb332 | 893 | /* |
0cf9b244 | 894 | * Skip compression for a small file range(<=blocksize) that |
01327610 | 895 | * isn't an inline extent, since it doesn't save disk space at all. |
4bcbb332 SW |
896 | */ |
897 | if (total_compressed <= blocksize && | |
99a01bd6 | 898 | (start > 0 || end + 1 < inode->disk_i_size)) |
4bcbb332 SW |
899 | goto cleanup_and_bail_uncompressed; |
900 | ||
0cf9b244 QW |
901 | /* |
902 | * For subpage case, we require full page alignment for the sector | |
903 | * aligned range. | |
904 | * Thus we must also check against @actual_end, not just @end. | |
905 | */ | |
906 | if (blocksize < PAGE_SIZE) { | |
1280d2d1 FK |
907 | if (!PAGE_ALIGNED(start) || |
908 | !PAGE_ALIGNED(round_up(actual_end, blocksize))) | |
0cf9b244 QW |
909 | goto cleanup_and_bail_uncompressed; |
910 | } | |
911 | ||
069eac78 DS |
912 | total_compressed = min_t(unsigned long, total_compressed, |
913 | BTRFS_MAX_UNCOMPRESSED); | |
c8b97818 CM |
914 | total_in = 0; |
915 | ret = 0; | |
db94535d | 916 | |
771ed689 | 917 | /* |
e94e54e8 CH |
918 | * We do compression for mount -o compress and when the inode has not |
919 | * been flagged as NOCOMPRESS. This flag can change at any time if we | |
920 | * discover bad compression ratios. | |
c8b97818 | 921 | */ |
e94e54e8 | 922 | if (!inode_need_compress(inode, start, end)) |
6a7167bf | 923 | goto cleanup_and_bail_uncompressed; |
261507a0 | 924 | |
e94e54e8 CH |
925 | pages = kcalloc(nr_pages, sizeof(struct page *), GFP_NOFS); |
926 | if (!pages) { | |
4adaa611 | 927 | /* |
e94e54e8 CH |
928 | * Memory allocation failure is not a fatal error, we can fall |
929 | * back to uncompressed code. | |
4adaa611 | 930 | */ |
6a7167bf | 931 | goto cleanup_and_bail_uncompressed; |
e94e54e8 | 932 | } |
f51d2b59 | 933 | |
e94e54e8 CH |
934 | if (inode->defrag_compress) |
935 | compress_type = inode->defrag_compress; | |
936 | else if (inode->prop_compress) | |
937 | compress_type = inode->prop_compress; | |
938 | ||
e94e54e8 CH |
939 | /* Compression level is applied here. */ |
940 | ret = btrfs_compress_pages(compress_type | (fs_info->compress_level << 4), | |
941 | mapping, start, pages, &nr_pages, &total_in, | |
942 | &total_compressed); | |
943 | if (ret) | |
184aa1ff | 944 | goto mark_incompressible; |
c8b97818 | 945 | |
e94e54e8 CH |
946 | /* |
947 | * Zero the tail end of the last page, as we might be sending it down | |
948 | * to disk. | |
949 | */ | |
950 | poff = offset_in_page(total_compressed); | |
951 | if (poff) | |
952 | memzero_page(pages[nr_pages - 1], poff, PAGE_SIZE - poff); | |
c8b97818 | 953 | |
7367253a | 954 | /* |
6a7167bf CH |
955 | * Try to create an inline extent. |
956 | * | |
957 | * If we didn't compress the entire range, try to create an uncompressed | |
958 | * inline extent, else a compressed one. | |
959 | * | |
7367253a | 960 | * Check cow_file_range() for why we don't even try to create inline |
e94e54e8 | 961 | * extent for the subpage case. |
7367253a QW |
962 | */ |
963 | if (start == 0 && fs_info->sectorsize == PAGE_SIZE) { | |
6a7167bf CH |
964 | if (total_in < actual_end) { |
965 | ret = cow_file_range_inline(inode, actual_end, 0, | |
966 | BTRFS_COMPRESS_NONE, NULL, | |
967 | false); | |
c8b97818 | 968 | } else { |
99a01bd6 | 969 | ret = cow_file_range_inline(inode, actual_end, |
fe3f566c | 970 | total_compressed, |
d9496e8a OS |
971 | compress_type, pages, |
972 | false); | |
c8b97818 | 973 | } |
79787eaa | 974 | if (ret <= 0) { |
151a41bc | 975 | unsigned long clear_flags = EXTENT_DELALLOC | |
8b62f87b JB |
976 | EXTENT_DELALLOC_NEW | EXTENT_DEFRAG | |
977 | EXTENT_DO_ACCOUNTING; | |
e6eb4314 | 978 | |
a994310a CH |
979 | if (ret < 0) |
980 | mapping_set_error(mapping, -EIO); | |
151a41bc | 981 | |
771ed689 | 982 | /* |
79787eaa JM |
983 | * inline extent creation worked or returned error, |
984 | * we don't need to create any more async work items. | |
985 | * Unlock and free up our temp pages. | |
8b62f87b JB |
986 | * |
987 | * We use DO_ACCOUNTING here because we need the | |
988 | * delalloc_release_metadata to be done _after_ we drop | |
989 | * our outstanding extent for clearing delalloc for this | |
990 | * range. | |
771ed689 | 991 | */ |
99a01bd6 | 992 | extent_clear_unlock_delalloc(inode, start, end, |
ad7ff17b | 993 | NULL, |
74e9194a | 994 | clear_flags, |
ba8b04c1 | 995 | PAGE_UNLOCK | |
6869b0a8 | 996 | PAGE_START_WRITEBACK | |
c2790a2e | 997 | PAGE_END_WRITEBACK); |
f778b6b8 | 998 | goto free_pages; |
c8b97818 CM |
999 | } |
1000 | } | |
1001 | ||
e94e54e8 CH |
1002 | /* |
1003 | * We aren't doing an inline extent. Round the compressed size up to a | |
1004 | * block size boundary so the allocator does sane things. | |
1005 | */ | |
1006 | total_compressed = ALIGN(total_compressed, blocksize); | |
c8b97818 | 1007 | |
e94e54e8 CH |
1008 | /* |
1009 | * One last check to make sure the compression is really a win, compare | |
1010 | * the page count read with the blocks on disk, compression must free at | |
1011 | * least one sector. | |
1012 | */ | |
1013 | total_in = round_up(total_in, fs_info->sectorsize); | |
1014 | if (total_compressed + blocksize > total_in) | |
184aa1ff | 1015 | goto mark_incompressible; |
c8bb0c8b | 1016 | |
e94e54e8 CH |
1017 | /* |
1018 | * The async work queues will take care of doing actual allocation on | |
1019 | * disk for these compressed pages, and will submit the bios. | |
1020 | */ | |
1021 | add_async_extent(async_chunk, start, total_in, total_compressed, pages, | |
1022 | nr_pages, compress_type); | |
1023 | if (start + total_in < end) { | |
1024 | start += total_in; | |
1025 | cond_resched(); | |
1026 | goto again; | |
c8b97818 | 1027 | } |
e94e54e8 CH |
1028 | return; |
1029 | ||
184aa1ff CH |
1030 | mark_incompressible: |
1031 | if (!btrfs_test_opt(fs_info, FORCE_COMPRESS) && !inode->prop_compress) | |
1032 | inode->flags |= BTRFS_INODE_NOCOMPRESS; | |
e94e54e8 | 1033 | cleanup_and_bail_uncompressed: |
b5326271 | 1034 | add_async_extent(async_chunk, start, end - start + 1, 0, NULL, 0, |
c8bb0c8b | 1035 | BTRFS_COMPRESS_NONE); |
f778b6b8 | 1036 | free_pages: |
c8bb0c8b | 1037 | if (pages) { |
4d3a800e | 1038 | for (i = 0; i < nr_pages; i++) { |
70b99e69 | 1039 | WARN_ON(pages[i]->mapping); |
09cbfeaf | 1040 | put_page(pages[i]); |
c8b97818 CM |
1041 | } |
1042 | kfree(pages); | |
c8b97818 | 1043 | } |
771ed689 | 1044 | } |
771ed689 | 1045 | |
40ae837b FM |
1046 | static void free_async_extent_pages(struct async_extent *async_extent) |
1047 | { | |
1048 | int i; | |
1049 | ||
1050 | if (!async_extent->pages) | |
1051 | return; | |
1052 | ||
1053 | for (i = 0; i < async_extent->nr_pages; i++) { | |
1054 | WARN_ON(async_extent->pages[i]->mapping); | |
09cbfeaf | 1055 | put_page(async_extent->pages[i]); |
40ae837b FM |
1056 | } |
1057 | kfree(async_extent->pages); | |
1058 | async_extent->nr_pages = 0; | |
1059 | async_extent->pages = NULL; | |
771ed689 CM |
1060 | } |
1061 | ||
ff20d6a4 CH |
1062 | static void submit_uncompressed_range(struct btrfs_inode *inode, |
1063 | struct async_extent *async_extent, | |
1064 | struct page *locked_page) | |
771ed689 | 1065 | { |
2b83a0ee QW |
1066 | u64 start = async_extent->start; |
1067 | u64 end = async_extent->start + async_extent->ram_size - 1; | |
2b83a0ee | 1068 | int ret; |
7027f871 CH |
1069 | struct writeback_control wbc = { |
1070 | .sync_mode = WB_SYNC_ALL, | |
1071 | .range_start = start, | |
1072 | .range_end = end, | |
1073 | .no_cgroup_owner = 1, | |
1074 | }; | |
771ed689 | 1075 | |
256b0cf9 CH |
1076 | wbc_attach_fdatawrite_inode(&wbc, &inode->vfs_inode); |
1077 | ret = run_delalloc_cow(inode, locked_page, start, end, &wbc, false); | |
1078 | wbc_detach_inode(&wbc); | |
2b83a0ee | 1079 | if (ret < 0) { |
71aa147b NA |
1080 | btrfs_cleanup_ordered_extents(inode, locked_page, start, end - start + 1); |
1081 | if (locked_page) { | |
1082 | const u64 page_start = page_offset(locked_page); | |
71aa147b | 1083 | |
71aa147b NA |
1084 | set_page_writeback(locked_page); |
1085 | end_page_writeback(locked_page); | |
9783e4de CH |
1086 | btrfs_mark_ordered_io_finished(inode, locked_page, |
1087 | page_start, PAGE_SIZE, | |
1088 | !ret); | |
9783e4de | 1089 | mapping_set_error(locked_page->mapping, ret); |
2b83a0ee | 1090 | unlock_page(locked_page); |
71aa147b | 1091 | } |
2b83a0ee | 1092 | } |
2b83a0ee | 1093 | } |
79787eaa | 1094 | |
84f262f0 CH |
1095 | static void submit_one_async_extent(struct async_chunk *async_chunk, |
1096 | struct async_extent *async_extent, | |
1097 | u64 *alloc_hint) | |
771ed689 | 1098 | { |
84f262f0 | 1099 | struct btrfs_inode *inode = async_chunk->inode; |
b4ccace8 QW |
1100 | struct extent_io_tree *io_tree = &inode->io_tree; |
1101 | struct btrfs_root *root = inode->root; | |
1102 | struct btrfs_fs_info *fs_info = root->fs_info; | |
d611935b | 1103 | struct btrfs_ordered_extent *ordered; |
771ed689 | 1104 | struct btrfs_key ins; |
2b83a0ee | 1105 | struct page *locked_page = NULL; |
771ed689 | 1106 | struct extent_map *em; |
f5a84ee3 | 1107 | int ret = 0; |
b4ccace8 QW |
1108 | u64 start = async_extent->start; |
1109 | u64 end = async_extent->start + async_extent->ram_size - 1; | |
771ed689 | 1110 | |
896d7c1a CH |
1111 | if (async_chunk->blkcg_css) |
1112 | kthread_associate_blkcg(async_chunk->blkcg_css); | |
1113 | ||
2b83a0ee QW |
1114 | /* |
1115 | * If async_chunk->locked_page is in the async_extent range, we need to | |
1116 | * handle it. | |
1117 | */ | |
1118 | if (async_chunk->locked_page) { | |
1119 | u64 locked_page_start = page_offset(async_chunk->locked_page); | |
1120 | u64 locked_page_end = locked_page_start + PAGE_SIZE - 1; | |
3e04e7f1 | 1121 | |
2b83a0ee QW |
1122 | if (!(start >= locked_page_end || end <= locked_page_start)) |
1123 | locked_page = async_chunk->locked_page; | |
b4ccace8 | 1124 | } |
570eb97b | 1125 | lock_extent(io_tree, start, end, NULL); |
ce62003f | 1126 | |
67583468 | 1127 | if (async_extent->compress_type == BTRFS_COMPRESS_NONE) { |
ff20d6a4 | 1128 | submit_uncompressed_range(inode, async_extent, locked_page); |
e43a6210 CH |
1129 | goto done; |
1130 | } | |
ce62003f | 1131 | |
b4ccace8 QW |
1132 | ret = btrfs_reserve_extent(root, async_extent->ram_size, |
1133 | async_extent->compressed_size, | |
1134 | async_extent->compressed_size, | |
1135 | 0, *alloc_hint, &ins, 1, 1); | |
1136 | if (ret) { | |
c2167754 | 1137 | /* |
b4ccace8 QW |
1138 | * Here we used to try again by going back to non-compressed |
1139 | * path for ENOSPC. But we can't reserve space even for | |
1140 | * compressed size, how could it work for uncompressed size | |
1141 | * which requires larger size? So here we directly go error | |
1142 | * path. | |
c2167754 | 1143 | */ |
b4ccace8 QW |
1144 | goto out_free; |
1145 | } | |
1146 | ||
1147 | /* Here we're doing allocation and writeback of the compressed pages */ | |
1148 | em = create_io_em(inode, start, | |
1149 | async_extent->ram_size, /* len */ | |
1150 | start, /* orig_start */ | |
1151 | ins.objectid, /* block_start */ | |
1152 | ins.offset, /* block_len */ | |
1153 | ins.offset, /* orig_block_len */ | |
1154 | async_extent->ram_size, /* ram_bytes */ | |
1155 | async_extent->compress_type, | |
1156 | BTRFS_ORDERED_COMPRESSED); | |
1157 | if (IS_ERR(em)) { | |
1158 | ret = PTR_ERR(em); | |
1159 | goto out_free_reserve; | |
1160 | } | |
1161 | free_extent_map(em); | |
771ed689 | 1162 | |
d611935b | 1163 | ordered = btrfs_alloc_ordered_extent(inode, start, /* file_offset */ |
cb36a9bb OS |
1164 | async_extent->ram_size, /* num_bytes */ |
1165 | async_extent->ram_size, /* ram_bytes */ | |
1166 | ins.objectid, /* disk_bytenr */ | |
1167 | ins.offset, /* disk_num_bytes */ | |
1168 | 0, /* offset */ | |
1169 | 1 << BTRFS_ORDERED_COMPRESSED, | |
1170 | async_extent->compress_type); | |
d611935b | 1171 | if (IS_ERR(ordered)) { |
4c0c8cfc | 1172 | btrfs_drop_extent_map_range(inode, start, end, false); |
d611935b | 1173 | ret = PTR_ERR(ordered); |
b4ccace8 | 1174 | goto out_free_reserve; |
771ed689 | 1175 | } |
b4ccace8 QW |
1176 | btrfs_dec_block_group_reservations(fs_info, ins.objectid); |
1177 | ||
1178 | /* Clear dirty, set writeback and unlock the pages. */ | |
1179 | extent_clear_unlock_delalloc(inode, start, end, | |
1180 | NULL, EXTENT_LOCKED | EXTENT_DELALLOC, | |
1181 | PAGE_UNLOCK | PAGE_START_WRITEBACK); | |
d611935b | 1182 | btrfs_submit_compressed_write(ordered, |
b4ccace8 QW |
1183 | async_extent->pages, /* compressed_pages */ |
1184 | async_extent->nr_pages, | |
05d06a5c | 1185 | async_chunk->write_flags, true); |
b4ccace8 | 1186 | *alloc_hint = ins.objectid + ins.offset; |
e43a6210 | 1187 | done: |
896d7c1a CH |
1188 | if (async_chunk->blkcg_css) |
1189 | kthread_associate_blkcg(NULL); | |
b4ccace8 | 1190 | kfree(async_extent); |
84f262f0 | 1191 | return; |
b4ccace8 | 1192 | |
3e04e7f1 | 1193 | out_free_reserve: |
0b246afa | 1194 | btrfs_dec_block_group_reservations(fs_info, ins.objectid); |
2ff7e61e | 1195 | btrfs_free_reserved_extent(fs_info, ins.objectid, ins.offset, 1); |
79787eaa | 1196 | out_free: |
a994310a | 1197 | mapping_set_error(inode->vfs_inode.i_mapping, -EIO); |
b4ccace8 | 1198 | extent_clear_unlock_delalloc(inode, start, end, |
c2790a2e | 1199 | NULL, EXTENT_LOCKED | EXTENT_DELALLOC | |
a7e3b975 | 1200 | EXTENT_DELALLOC_NEW | |
151a41bc | 1201 | EXTENT_DEFRAG | EXTENT_DO_ACCOUNTING, |
6869b0a8 | 1202 | PAGE_UNLOCK | PAGE_START_WRITEBACK | |
a994310a | 1203 | PAGE_END_WRITEBACK); |
40ae837b | 1204 | free_async_extent_pages(async_extent); |
84f262f0 CH |
1205 | if (async_chunk->blkcg_css) |
1206 | kthread_associate_blkcg(NULL); | |
1207 | btrfs_debug(fs_info, | |
b4ccace8 | 1208 | "async extent submission failed root=%lld inode=%llu start=%llu len=%llu ret=%d", |
84f262f0 CH |
1209 | root->root_key.objectid, btrfs_ino(inode), start, |
1210 | async_extent->ram_size, ret); | |
1211 | kfree(async_extent); | |
771ed689 CM |
1212 | } |
1213 | ||
43c69849 | 1214 | static u64 get_extent_allocation_hint(struct btrfs_inode *inode, u64 start, |
4b46fce2 JB |
1215 | u64 num_bytes) |
1216 | { | |
43c69849 | 1217 | struct extent_map_tree *em_tree = &inode->extent_tree; |
4b46fce2 JB |
1218 | struct extent_map *em; |
1219 | u64 alloc_hint = 0; | |
1220 | ||
1221 | read_lock(&em_tree->lock); | |
1222 | em = search_extent_mapping(em_tree, start, num_bytes); | |
1223 | if (em) { | |
1224 | /* | |
1225 | * if block start isn't an actual block number then find the | |
1226 | * first block in this inode and use that as a hint. If that | |
1227 | * block is also bogus then just don't worry about it. | |
1228 | */ | |
1229 | if (em->block_start >= EXTENT_MAP_LAST_BYTE) { | |
1230 | free_extent_map(em); | |
1231 | em = search_extent_mapping(em_tree, 0, 0); | |
1232 | if (em && em->block_start < EXTENT_MAP_LAST_BYTE) | |
1233 | alloc_hint = em->block_start; | |
1234 | if (em) | |
1235 | free_extent_map(em); | |
1236 | } else { | |
1237 | alloc_hint = em->block_start; | |
1238 | free_extent_map(em); | |
1239 | } | |
1240 | } | |
1241 | read_unlock(&em_tree->lock); | |
1242 | ||
1243 | return alloc_hint; | |
1244 | } | |
1245 | ||
771ed689 CM |
1246 | /* |
1247 | * when extent_io.c finds a delayed allocation range in the file, | |
1248 | * the call backs end up in this code. The basic idea is to | |
1249 | * allocate extents on disk for the range, and create ordered data structs | |
1250 | * in ram to track those extents. | |
1251 | * | |
1252 | * locked_page is the page that writepage had locked already. We use | |
1253 | * it to make sure we don't do extra locks or unlocks. | |
1254 | * | |
ba9145ad | 1255 | * When this function fails, it unlocks all pages except @locked_page. |
9ce7466f | 1256 | * |
c56cbe90 CH |
1257 | * When this function successfully creates an inline extent, it returns 1 and |
1258 | * unlocks all pages including locked_page and starts I/O on them. | |
ba9145ad CH |
1259 | * (In reality inline extents are limited to a single page, so locked_page is |
1260 | * the only page handled anyway). | |
9ce7466f | 1261 | * |
ba9145ad CH |
1262 | * When this function succeed and creates a normal extent, the page locking |
1263 | * status depends on the passed in flags: | |
9ce7466f | 1264 | * |
ba9145ad CH |
1265 | * - If @keep_locked is set, all pages are kept locked. |
1266 | * - Else all pages except for @locked_page are unlocked. | |
9ce7466f NA |
1267 | * |
1268 | * When a failure happens in the second or later iteration of the | |
1269 | * while-loop, the ordered extents created in previous iterations are kept | |
1270 | * intact. So, the caller must clean them up by calling | |
1271 | * btrfs_cleanup_ordered_extents(). See btrfs_run_delalloc_range() for | |
1272 | * example. | |
771ed689 | 1273 | */ |
6e26c442 | 1274 | static noinline int cow_file_range(struct btrfs_inode *inode, |
c56cbe90 CH |
1275 | struct page *locked_page, u64 start, u64 end, |
1276 | u64 *done_offset, | |
53ffb30a | 1277 | bool keep_locked, bool no_inline) |
771ed689 | 1278 | { |
6e26c442 NB |
1279 | struct btrfs_root *root = inode->root; |
1280 | struct btrfs_fs_info *fs_info = root->fs_info; | |
771ed689 | 1281 | u64 alloc_hint = 0; |
9ce7466f | 1282 | u64 orig_start = start; |
771ed689 CM |
1283 | u64 num_bytes; |
1284 | unsigned long ram_size; | |
a315e68f | 1285 | u64 cur_alloc_size = 0; |
432cd2a1 | 1286 | u64 min_alloc_size; |
0b246afa | 1287 | u64 blocksize = fs_info->sectorsize; |
771ed689 CM |
1288 | struct btrfs_key ins; |
1289 | struct extent_map *em; | |
a315e68f FM |
1290 | unsigned clear_bits; |
1291 | unsigned long page_ops; | |
1292 | bool extent_reserved = false; | |
771ed689 CM |
1293 | int ret = 0; |
1294 | ||
6e26c442 | 1295 | if (btrfs_is_free_space_inode(inode)) { |
29bce2f3 JB |
1296 | ret = -EINVAL; |
1297 | goto out_unlock; | |
02ecd2c2 | 1298 | } |
771ed689 | 1299 | |
fda2832f | 1300 | num_bytes = ALIGN(end - start + 1, blocksize); |
771ed689 | 1301 | num_bytes = max(blocksize, num_bytes); |
566b1760 | 1302 | ASSERT(num_bytes <= btrfs_super_total_bytes(fs_info->super_copy)); |
771ed689 | 1303 | |
6e26c442 | 1304 | inode_should_defrag(inode, start, end, num_bytes, SZ_64K); |
4cb5300b | 1305 | |
7367253a QW |
1306 | /* |
1307 | * Due to the page size limit, for subpage we can only trigger the | |
1308 | * writeback for the dirty sectors of page, that means data writeback | |
1309 | * is doing more writeback than what we want. | |
1310 | * | |
1311 | * This is especially unexpected for some call sites like fallocate, | |
1312 | * where we only increase i_size after everything is done. | |
1313 | * This means we can trigger inline extent even if we didn't want to. | |
1314 | * So here we skip inline extent creation completely. | |
1315 | */ | |
53ffb30a | 1316 | if (start == 0 && fs_info->sectorsize == PAGE_SIZE && !no_inline) { |
8dd9872d OS |
1317 | u64 actual_end = min_t(u64, i_size_read(&inode->vfs_inode), |
1318 | end + 1); | |
1319 | ||
771ed689 | 1320 | /* lets try to make an inline extent */ |
8dd9872d | 1321 | ret = cow_file_range_inline(inode, actual_end, 0, |
d9496e8a | 1322 | BTRFS_COMPRESS_NONE, NULL, false); |
771ed689 | 1323 | if (ret == 0) { |
8b62f87b JB |
1324 | /* |
1325 | * We use DO_ACCOUNTING here because we need the | |
1326 | * delalloc_release_metadata to be run _after_ we drop | |
1327 | * our outstanding extent for clearing delalloc for this | |
1328 | * range. | |
1329 | */ | |
4750af3b QW |
1330 | extent_clear_unlock_delalloc(inode, start, end, |
1331 | locked_page, | |
c2790a2e | 1332 | EXTENT_LOCKED | EXTENT_DELALLOC | |
8b62f87b JB |
1333 | EXTENT_DELALLOC_NEW | EXTENT_DEFRAG | |
1334 | EXTENT_DO_ACCOUNTING, PAGE_UNLOCK | | |
6869b0a8 | 1335 | PAGE_START_WRITEBACK | PAGE_END_WRITEBACK); |
4750af3b QW |
1336 | /* |
1337 | * locked_page is locked by the caller of | |
1338 | * writepage_delalloc(), not locked by | |
1339 | * __process_pages_contig(). | |
1340 | * | |
1341 | * We can't let __process_pages_contig() to unlock it, | |
1342 | * as it doesn't have any subpage::writers recorded. | |
1343 | * | |
1344 | * Here we manually unlock the page, since the caller | |
c56cbe90 CH |
1345 | * can't determine if it's an inline extent or a |
1346 | * compressed extent. | |
4750af3b QW |
1347 | */ |
1348 | unlock_page(locked_page); | |
6e144bf1 CH |
1349 | ret = 1; |
1350 | goto done; | |
79787eaa | 1351 | } else if (ret < 0) { |
79787eaa | 1352 | goto out_unlock; |
771ed689 CM |
1353 | } |
1354 | } | |
1355 | ||
6e26c442 | 1356 | alloc_hint = get_extent_allocation_hint(inode, start, num_bytes); |
771ed689 | 1357 | |
432cd2a1 FM |
1358 | /* |
1359 | * Relocation relies on the relocated extents to have exactly the same | |
1360 | * size as the original extents. Normally writeback for relocation data | |
1361 | * extents follows a NOCOW path because relocation preallocates the | |
1362 | * extents. However, due to an operation such as scrub turning a block | |
1363 | * group to RO mode, it may fallback to COW mode, so we must make sure | |
1364 | * an extent allocated during COW has exactly the requested size and can | |
1365 | * not be split into smaller extents, otherwise relocation breaks and | |
1366 | * fails during the stage where it updates the bytenr of file extent | |
1367 | * items. | |
1368 | */ | |
37f00a6d | 1369 | if (btrfs_is_data_reloc_root(root)) |
432cd2a1 FM |
1370 | min_alloc_size = num_bytes; |
1371 | else | |
1372 | min_alloc_size = fs_info->sectorsize; | |
1373 | ||
3752d22f | 1374 | while (num_bytes > 0) { |
34bfaf15 CH |
1375 | struct btrfs_ordered_extent *ordered; |
1376 | ||
3752d22f | 1377 | cur_alloc_size = num_bytes; |
18513091 | 1378 | ret = btrfs_reserve_extent(root, cur_alloc_size, cur_alloc_size, |
432cd2a1 | 1379 | min_alloc_size, 0, alloc_hint, |
e570fd27 | 1380 | &ins, 1, 1); |
6e144bf1 CH |
1381 | if (ret == -EAGAIN) { |
1382 | /* | |
1383 | * btrfs_reserve_extent only returns -EAGAIN for zoned | |
1384 | * file systems, which is an indication that there are | |
1385 | * no active zones to allocate from at the moment. | |
1386 | * | |
1387 | * If this is the first loop iteration, wait for at | |
1388 | * least one zone to finish before retrying the | |
1389 | * allocation. Otherwise ask the caller to write out | |
1390 | * the already allocated blocks before coming back to | |
1391 | * us, or return -ENOSPC if it can't handle retries. | |
1392 | */ | |
1393 | ASSERT(btrfs_is_zoned(fs_info)); | |
1394 | if (start == orig_start) { | |
1395 | wait_on_bit_io(&inode->root->fs_info->flags, | |
1396 | BTRFS_FS_NEED_ZONE_FINISH, | |
1397 | TASK_UNINTERRUPTIBLE); | |
1398 | continue; | |
1399 | } | |
1400 | if (done_offset) { | |
1401 | *done_offset = start - 1; | |
1402 | return 0; | |
1403 | } | |
1404 | ret = -ENOSPC; | |
1405 | } | |
00361589 | 1406 | if (ret < 0) |
79787eaa | 1407 | goto out_unlock; |
a315e68f FM |
1408 | cur_alloc_size = ins.offset; |
1409 | extent_reserved = true; | |
d397712b | 1410 | |
771ed689 | 1411 | ram_size = ins.offset; |
6e26c442 | 1412 | em = create_io_em(inode, start, ins.offset, /* len */ |
6f9994db LB |
1413 | start, /* orig_start */ |
1414 | ins.objectid, /* block_start */ | |
1415 | ins.offset, /* block_len */ | |
1416 | ins.offset, /* orig_block_len */ | |
1417 | ram_size, /* ram_bytes */ | |
1418 | BTRFS_COMPRESS_NONE, /* compress_type */ | |
1af4a0aa | 1419 | BTRFS_ORDERED_REGULAR /* type */); |
090a127a SY |
1420 | if (IS_ERR(em)) { |
1421 | ret = PTR_ERR(em); | |
ace68bac | 1422 | goto out_reserve; |
090a127a | 1423 | } |
6f9994db | 1424 | free_extent_map(em); |
e6dcd2dc | 1425 | |
34bfaf15 CH |
1426 | ordered = btrfs_alloc_ordered_extent(inode, start, ram_size, |
1427 | ram_size, ins.objectid, cur_alloc_size, | |
1428 | 0, 1 << BTRFS_ORDERED_REGULAR, | |
1429 | BTRFS_COMPRESS_NONE); | |
1430 | if (IS_ERR(ordered)) { | |
1431 | ret = PTR_ERR(ordered); | |
d9f85963 | 1432 | goto out_drop_extent_cache; |
34bfaf15 | 1433 | } |
c8b97818 | 1434 | |
37f00a6d | 1435 | if (btrfs_is_data_reloc_root(root)) { |
34bfaf15 CH |
1436 | ret = btrfs_reloc_clone_csums(ordered); |
1437 | ||
4dbd80fb QW |
1438 | /* |
1439 | * Only drop cache here, and process as normal. | |
1440 | * | |
1441 | * We must not allow extent_clear_unlock_delalloc() | |
1442 | * at out_unlock label to free meta of this ordered | |
1443 | * extent, as its meta should be freed by | |
1444 | * btrfs_finish_ordered_io(). | |
1445 | * | |
1446 | * So we must continue until @start is increased to | |
1447 | * skip current ordered extent. | |
1448 | */ | |
00361589 | 1449 | if (ret) |
4c0c8cfc FM |
1450 | btrfs_drop_extent_map_range(inode, start, |
1451 | start + ram_size - 1, | |
1452 | false); | |
17d217fe | 1453 | } |
34bfaf15 | 1454 | btrfs_put_ordered_extent(ordered); |
17d217fe | 1455 | |
0b246afa | 1456 | btrfs_dec_block_group_reservations(fs_info, ins.objectid); |
9cfa3e34 | 1457 | |
f57ad937 QW |
1458 | /* |
1459 | * We're not doing compressed IO, don't unlock the first page | |
1460 | * (which the caller expects to stay locked), don't clear any | |
1461 | * dirty bits and don't set any writeback bits | |
8b62b72b | 1462 | * |
f57ad937 QW |
1463 | * Do set the Ordered (Private2) bit so we know this page was |
1464 | * properly setup for writepage. | |
c8b97818 | 1465 | */ |
ba9145ad | 1466 | page_ops = (keep_locked ? 0 : PAGE_UNLOCK); |
f57ad937 | 1467 | page_ops |= PAGE_SET_ORDERED; |
a791e35e | 1468 | |
6e26c442 | 1469 | extent_clear_unlock_delalloc(inode, start, start + ram_size - 1, |
74e9194a | 1470 | locked_page, |
c2790a2e | 1471 | EXTENT_LOCKED | EXTENT_DELALLOC, |
a315e68f | 1472 | page_ops); |
3752d22f AJ |
1473 | if (num_bytes < cur_alloc_size) |
1474 | num_bytes = 0; | |
4dbd80fb | 1475 | else |
3752d22f | 1476 | num_bytes -= cur_alloc_size; |
c59f8951 CM |
1477 | alloc_hint = ins.objectid + ins.offset; |
1478 | start += cur_alloc_size; | |
a315e68f | 1479 | extent_reserved = false; |
4dbd80fb QW |
1480 | |
1481 | /* | |
1482 | * btrfs_reloc_clone_csums() error, since start is increased | |
1483 | * extent_clear_unlock_delalloc() at out_unlock label won't | |
1484 | * free metadata of current ordered extent, we're OK to exit. | |
1485 | */ | |
1486 | if (ret) | |
1487 | goto out_unlock; | |
b888db2b | 1488 | } |
6e144bf1 CH |
1489 | done: |
1490 | if (done_offset) | |
1491 | *done_offset = end; | |
be20aa9d | 1492 | return ret; |
b7d5b0a8 | 1493 | |
d9f85963 | 1494 | out_drop_extent_cache: |
4c0c8cfc | 1495 | btrfs_drop_extent_map_range(inode, start, start + ram_size - 1, false); |
ace68bac | 1496 | out_reserve: |
0b246afa | 1497 | btrfs_dec_block_group_reservations(fs_info, ins.objectid); |
2ff7e61e | 1498 | btrfs_free_reserved_extent(fs_info, ins.objectid, ins.offset, 1); |
79787eaa | 1499 | out_unlock: |
9ce7466f NA |
1500 | /* |
1501 | * Now, we have three regions to clean up: | |
1502 | * | |
1503 | * |-------(1)----|---(2)---|-------------(3)----------| | |
1504 | * `- orig_start `- start `- start + cur_alloc_size `- end | |
1505 | * | |
1506 | * We process each region below. | |
1507 | */ | |
1508 | ||
a7e3b975 FM |
1509 | clear_bits = EXTENT_LOCKED | EXTENT_DELALLOC | EXTENT_DELALLOC_NEW | |
1510 | EXTENT_DEFRAG | EXTENT_CLEAR_META_RESV; | |
6869b0a8 | 1511 | page_ops = PAGE_UNLOCK | PAGE_START_WRITEBACK | PAGE_END_WRITEBACK; |
9ce7466f | 1512 | |
a315e68f | 1513 | /* |
9ce7466f NA |
1514 | * For the range (1). We have already instantiated the ordered extents |
1515 | * for this region. They are cleaned up by | |
1516 | * btrfs_cleanup_ordered_extents() in e.g, | |
1517 | * btrfs_run_delalloc_range(). EXTENT_LOCKED | EXTENT_DELALLOC are | |
1518 | * already cleared in the above loop. And, EXTENT_DELALLOC_NEW | | |
1519 | * EXTENT_DEFRAG | EXTENT_CLEAR_META_RESV are handled by the cleanup | |
1520 | * function. | |
1521 | * | |
ba9145ad | 1522 | * However, in case of @keep_locked, we still need to unlock the pages |
9ce7466f NA |
1523 | * (except @locked_page) to ensure all the pages are unlocked. |
1524 | */ | |
ba9145ad | 1525 | if (keep_locked && orig_start < start) { |
71aa147b NA |
1526 | if (!locked_page) |
1527 | mapping_set_error(inode->vfs_inode.i_mapping, ret); | |
9ce7466f NA |
1528 | extent_clear_unlock_delalloc(inode, orig_start, start - 1, |
1529 | locked_page, 0, page_ops); | |
71aa147b | 1530 | } |
9ce7466f | 1531 | |
a315e68f | 1532 | /* |
9ce7466f NA |
1533 | * For the range (2). If we reserved an extent for our delalloc range |
1534 | * (or a subrange) and failed to create the respective ordered extent, | |
1535 | * then it means that when we reserved the extent we decremented the | |
1536 | * extent's size from the data space_info's bytes_may_use counter and | |
1537 | * incremented the space_info's bytes_reserved counter by the same | |
1538 | * amount. We must make sure extent_clear_unlock_delalloc() does not try | |
1539 | * to decrement again the data space_info's bytes_may_use counter, | |
1540 | * therefore we do not pass it the flag EXTENT_CLEAR_DATA_RESV. | |
a315e68f FM |
1541 | */ |
1542 | if (extent_reserved) { | |
6e26c442 | 1543 | extent_clear_unlock_delalloc(inode, start, |
e2c8e92d | 1544 | start + cur_alloc_size - 1, |
a315e68f FM |
1545 | locked_page, |
1546 | clear_bits, | |
1547 | page_ops); | |
1548 | start += cur_alloc_size; | |
a315e68f | 1549 | } |
9ce7466f NA |
1550 | |
1551 | /* | |
1552 | * For the range (3). We never touched the region. In addition to the | |
1553 | * clear_bits above, we add EXTENT_CLEAR_DATA_RESV to release the data | |
1554 | * space_info's bytes_may_use counter, reserved in | |
1555 | * btrfs_check_data_free_space(). | |
1556 | */ | |
12b2d64e CH |
1557 | if (start < end) { |
1558 | clear_bits |= EXTENT_CLEAR_DATA_RESV; | |
1559 | extent_clear_unlock_delalloc(inode, start, end, locked_page, | |
1560 | clear_bits, page_ops); | |
1561 | } | |
aaafa1eb | 1562 | return ret; |
771ed689 | 1563 | } |
c8b97818 | 1564 | |
771ed689 | 1565 | /* |
c15d8cf2 CH |
1566 | * Phase two of compressed writeback. This is the ordered portion of the code, |
1567 | * which only gets called in the order the work was queued. We walk all the | |
1568 | * async extents created by compress_file_range and send them down to the disk. | |
078b8b90 DS |
1569 | * |
1570 | * If called with @do_free == true then it'll try to finish the work and free | |
1571 | * the work struct eventually. | |
771ed689 | 1572 | */ |
078b8b90 | 1573 | static noinline void submit_compressed_extents(struct btrfs_work *work, bool do_free) |
771ed689 | 1574 | { |
c5a68aec NB |
1575 | struct async_chunk *async_chunk = container_of(work, struct async_chunk, |
1576 | work); | |
1577 | struct btrfs_fs_info *fs_info = btrfs_work_owner(work); | |
00d31d17 | 1578 | struct async_extent *async_extent; |
771ed689 | 1579 | unsigned long nr_pages; |
00d31d17 | 1580 | u64 alloc_hint = 0; |
771ed689 | 1581 | |
078b8b90 DS |
1582 | if (do_free) { |
1583 | struct async_chunk *async_chunk; | |
1584 | struct async_cow *async_cow; | |
1585 | ||
1586 | async_chunk = container_of(work, struct async_chunk, work); | |
1587 | btrfs_add_delayed_iput(async_chunk->inode); | |
1588 | if (async_chunk->blkcg_css) | |
1589 | css_put(async_chunk->blkcg_css); | |
1590 | ||
1591 | async_cow = async_chunk->async_cow; | |
1592 | if (atomic_dec_and_test(&async_cow->num_chunks)) | |
1593 | kvfree(async_cow); | |
1594 | return; | |
1595 | } | |
1596 | ||
b5326271 | 1597 | nr_pages = (async_chunk->end - async_chunk->start + PAGE_SIZE) >> |
09cbfeaf | 1598 | PAGE_SHIFT; |
771ed689 | 1599 | |
00d31d17 CH |
1600 | while (!list_empty(&async_chunk->extents)) { |
1601 | async_extent = list_entry(async_chunk->extents.next, | |
1602 | struct async_extent, list); | |
1603 | list_del(&async_extent->list); | |
1604 | submit_one_async_extent(async_chunk, async_extent, &alloc_hint); | |
1605 | } | |
ac98141d JB |
1606 | |
1607 | /* atomic_sub_return implies a barrier */ | |
1608 | if (atomic_sub_return(nr_pages, &fs_info->async_delalloc_pages) < | |
1609 | 5 * SZ_1M) | |
1610 | cond_wake_up_nomb(&fs_info->async_submit_wait); | |
771ed689 | 1611 | } |
c8b97818 | 1612 | |
bb7b05fe | 1613 | static bool run_delalloc_compressed(struct btrfs_inode *inode, |
c56cbe90 CH |
1614 | struct page *locked_page, u64 start, |
1615 | u64 end, struct writeback_control *wbc) | |
771ed689 | 1616 | { |
751b6431 | 1617 | struct btrfs_fs_info *fs_info = inode->root->fs_info; |
ec39f769 | 1618 | struct cgroup_subsys_state *blkcg_css = wbc_blkcg_css(wbc); |
97db1204 NB |
1619 | struct async_cow *ctx; |
1620 | struct async_chunk *async_chunk; | |
771ed689 | 1621 | unsigned long nr_pages; |
97db1204 NB |
1622 | u64 num_chunks = DIV_ROUND_UP(end - start, SZ_512K); |
1623 | int i; | |
b1c16ac9 | 1624 | unsigned nofs_flag; |
bf9486d6 | 1625 | const blk_opf_t write_flags = wbc_to_write_flags(wbc); |
771ed689 | 1626 | |
b1c16ac9 NB |
1627 | nofs_flag = memalloc_nofs_save(); |
1628 | ctx = kvmalloc(struct_size(ctx, chunks, num_chunks), GFP_KERNEL); | |
1629 | memalloc_nofs_restore(nofs_flag); | |
973fb26e CH |
1630 | if (!ctx) |
1631 | return false; | |
b1c16ac9 | 1632 | |
973fb26e CH |
1633 | unlock_extent(&inode->io_tree, start, end, NULL); |
1634 | set_bit(BTRFS_INODE_HAS_ASYNC_EXTENT, &inode->runtime_flags); | |
97db1204 NB |
1635 | |
1636 | async_chunk = ctx->chunks; | |
1637 | atomic_set(&ctx->num_chunks, num_chunks); | |
1638 | ||
1639 | for (i = 0; i < num_chunks; i++) { | |
973fb26e | 1640 | u64 cur_end = min(end, start + SZ_512K - 1); |
771ed689 | 1641 | |
bd4691a0 NB |
1642 | /* |
1643 | * igrab is called higher up in the call chain, take only the | |
1644 | * lightweight reference for the callback lifetime | |
1645 | */ | |
751b6431 | 1646 | ihold(&inode->vfs_inode); |
9e895a8f | 1647 | async_chunk[i].async_cow = ctx; |
99a81a44 | 1648 | async_chunk[i].inode = inode; |
97db1204 NB |
1649 | async_chunk[i].start = start; |
1650 | async_chunk[i].end = cur_end; | |
97db1204 NB |
1651 | async_chunk[i].write_flags = write_flags; |
1652 | INIT_LIST_HEAD(&async_chunk[i].extents); | |
1653 | ||
1d53c9e6 CM |
1654 | /* |
1655 | * The locked_page comes all the way from writepage and its | |
1656 | * the original page we were actually given. As we spread | |
1657 | * this large delalloc region across multiple async_chunk | |
1658 | * structs, only the first struct needs a pointer to locked_page | |
1659 | * | |
1660 | * This way we don't need racey decisions about who is supposed | |
1661 | * to unlock it. | |
1662 | */ | |
1663 | if (locked_page) { | |
ec39f769 CM |
1664 | /* |
1665 | * Depending on the compressibility, the pages might or | |
1666 | * might not go through async. We want all of them to | |
1667 | * be accounted against wbc once. Let's do it here | |
1668 | * before the paths diverge. wbc accounting is used | |
1669 | * only for foreign writeback detection and doesn't | |
1670 | * need full accuracy. Just account the whole thing | |
1671 | * against the first page. | |
1672 | */ | |
1673 | wbc_account_cgroup_owner(wbc, locked_page, | |
1674 | cur_end - start); | |
1d53c9e6 CM |
1675 | async_chunk[i].locked_page = locked_page; |
1676 | locked_page = NULL; | |
1677 | } else { | |
1678 | async_chunk[i].locked_page = NULL; | |
1679 | } | |
1680 | ||
ec39f769 CM |
1681 | if (blkcg_css != blkcg_root_css) { |
1682 | css_get(blkcg_css); | |
1683 | async_chunk[i].blkcg_css = blkcg_css; | |
3480373e | 1684 | async_chunk[i].write_flags |= REQ_BTRFS_CGROUP_PUNT; |
ec39f769 CM |
1685 | } else { |
1686 | async_chunk[i].blkcg_css = NULL; | |
1687 | } | |
1688 | ||
c15d8cf2 | 1689 | btrfs_init_work(&async_chunk[i].work, compress_file_range, |
078b8b90 | 1690 | submit_compressed_extents); |
771ed689 | 1691 | |
97db1204 | 1692 | nr_pages = DIV_ROUND_UP(cur_end - start, PAGE_SIZE); |
0b246afa | 1693 | atomic_add(nr_pages, &fs_info->async_delalloc_pages); |
771ed689 | 1694 | |
97db1204 | 1695 | btrfs_queue_work(fs_info->delalloc_workers, &async_chunk[i].work); |
771ed689 | 1696 | |
771ed689 CM |
1697 | start = cur_end + 1; |
1698 | } | |
973fb26e | 1699 | return true; |
be20aa9d CM |
1700 | } |
1701 | ||
256b0cf9 CH |
1702 | /* |
1703 | * Run the delalloc range from start to end, and write back any dirty pages | |
1704 | * covered by the range. | |
1705 | */ | |
1706 | static noinline int run_delalloc_cow(struct btrfs_inode *inode, | |
1707 | struct page *locked_page, u64 start, | |
1708 | u64 end, struct writeback_control *wbc, | |
1709 | bool pages_dirty) | |
42c01100 | 1710 | { |
898793d9 | 1711 | u64 done_offset = end; |
42c01100 NA |
1712 | int ret; |
1713 | ||
898793d9 | 1714 | while (start <= end) { |
c56cbe90 CH |
1715 | ret = cow_file_range(inode, locked_page, start, end, &done_offset, |
1716 | true, false); | |
6e144bf1 | 1717 | if (ret) |
898793d9 | 1718 | return ret; |
778b8785 | 1719 | extent_write_locked_range(&inode->vfs_inode, locked_page, start, |
256b0cf9 | 1720 | done_offset, wbc, pages_dirty); |
898793d9 NA |
1721 | start = done_offset + 1; |
1722 | } | |
42c01100 | 1723 | |
c56cbe90 | 1724 | return 1; |
42c01100 NA |
1725 | } |
1726 | ||
2ff7e61e | 1727 | static noinline int csum_exist_in_range(struct btrfs_fs_info *fs_info, |
26ce9114 | 1728 | u64 bytenr, u64 num_bytes, bool nowait) |
17d217fe | 1729 | { |
fc28b25e | 1730 | struct btrfs_root *csum_root = btrfs_csum_root(fs_info, bytenr); |
17d217fe | 1731 | struct btrfs_ordered_sum *sums; |
fc28b25e | 1732 | int ret; |
17d217fe YZ |
1733 | LIST_HEAD(list); |
1734 | ||
97e38239 QW |
1735 | ret = btrfs_lookup_csums_list(csum_root, bytenr, bytenr + num_bytes - 1, |
1736 | &list, 0, nowait); | |
17d217fe YZ |
1737 | if (ret == 0 && list_empty(&list)) |
1738 | return 0; | |
1739 | ||
1740 | while (!list_empty(&list)) { | |
1741 | sums = list_entry(list.next, struct btrfs_ordered_sum, list); | |
1742 | list_del(&sums->list); | |
1743 | kfree(sums); | |
1744 | } | |
58113753 LB |
1745 | if (ret < 0) |
1746 | return ret; | |
17d217fe YZ |
1747 | return 1; |
1748 | } | |
1749 | ||
8ba96f3d | 1750 | static int fallback_to_cow(struct btrfs_inode *inode, struct page *locked_page, |
53ffb30a | 1751 | const u64 start, const u64 end) |
467dc47e | 1752 | { |
8ba96f3d | 1753 | const bool is_space_ino = btrfs_is_free_space_inode(inode); |
37f00a6d | 1754 | const bool is_reloc_ino = btrfs_is_data_reloc_root(inode->root); |
2166e5ed | 1755 | const u64 range_bytes = end + 1 - start; |
8ba96f3d | 1756 | struct extent_io_tree *io_tree = &inode->io_tree; |
467dc47e FM |
1757 | u64 range_start = start; |
1758 | u64 count; | |
53ffb30a | 1759 | int ret; |
467dc47e FM |
1760 | |
1761 | /* | |
1762 | * If EXTENT_NORESERVE is set it means that when the buffered write was | |
1763 | * made we had not enough available data space and therefore we did not | |
1764 | * reserve data space for it, since we though we could do NOCOW for the | |
1765 | * respective file range (either there is prealloc extent or the inode | |
1766 | * has the NOCOW bit set). | |
1767 | * | |
1768 | * However when we need to fallback to COW mode (because for example the | |
1769 | * block group for the corresponding extent was turned to RO mode by a | |
1770 | * scrub or relocation) we need to do the following: | |
1771 | * | |
1772 | * 1) We increment the bytes_may_use counter of the data space info. | |
1773 | * If COW succeeds, it allocates a new data extent and after doing | |
1774 | * that it decrements the space info's bytes_may_use counter and | |
1775 | * increments its bytes_reserved counter by the same amount (we do | |
1776 | * this at btrfs_add_reserved_bytes()). So we need to increment the | |
1777 | * bytes_may_use counter to compensate (when space is reserved at | |
1778 | * buffered write time, the bytes_may_use counter is incremented); | |
1779 | * | |
1780 | * 2) We clear the EXTENT_NORESERVE bit from the range. We do this so | |
1781 | * that if the COW path fails for any reason, it decrements (through | |
1782 | * extent_clear_unlock_delalloc()) the bytes_may_use counter of the | |
1783 | * data space info, which we incremented in the step above. | |
2166e5ed FM |
1784 | * |
1785 | * If we need to fallback to cow and the inode corresponds to a free | |
6bd335b4 FM |
1786 | * space cache inode or an inode of the data relocation tree, we must |
1787 | * also increment bytes_may_use of the data space_info for the same | |
1788 | * reason. Space caches and relocated data extents always get a prealloc | |
2166e5ed | 1789 | * extent for them, however scrub or balance may have set the block |
6bd335b4 FM |
1790 | * group that contains that extent to RO mode and therefore force COW |
1791 | * when starting writeback. | |
467dc47e | 1792 | */ |
2166e5ed | 1793 | count = count_range_bits(io_tree, &range_start, end, range_bytes, |
8c6e53a7 | 1794 | EXTENT_NORESERVE, 0, NULL); |
6bd335b4 FM |
1795 | if (count > 0 || is_space_ino || is_reloc_ino) { |
1796 | u64 bytes = count; | |
8ba96f3d | 1797 | struct btrfs_fs_info *fs_info = inode->root->fs_info; |
467dc47e FM |
1798 | struct btrfs_space_info *sinfo = fs_info->data_sinfo; |
1799 | ||
6bd335b4 FM |
1800 | if (is_space_ino || is_reloc_ino) |
1801 | bytes = range_bytes; | |
1802 | ||
467dc47e | 1803 | spin_lock(&sinfo->lock); |
2166e5ed | 1804 | btrfs_space_info_update_bytes_may_use(fs_info, sinfo, bytes); |
467dc47e FM |
1805 | spin_unlock(&sinfo->lock); |
1806 | ||
2166e5ed FM |
1807 | if (count > 0) |
1808 | clear_extent_bit(io_tree, start, end, EXTENT_NORESERVE, | |
bd015294 | 1809 | NULL); |
467dc47e FM |
1810 | } |
1811 | ||
53ffb30a CH |
1812 | /* |
1813 | * Don't try to create inline extents, as a mix of inline extent that | |
1814 | * is written out and unlocked directly and a normal NOCOW extent | |
1815 | * doesn't work. | |
1816 | */ | |
c56cbe90 CH |
1817 | ret = cow_file_range(inode, locked_page, start, end, NULL, false, true); |
1818 | ASSERT(ret != 1); | |
53ffb30a | 1819 | return ret; |
467dc47e FM |
1820 | } |
1821 | ||
619104ba FM |
1822 | struct can_nocow_file_extent_args { |
1823 | /* Input fields. */ | |
1824 | ||
1825 | /* Start file offset of the range we want to NOCOW. */ | |
1826 | u64 start; | |
1827 | /* End file offset (inclusive) of the range we want to NOCOW. */ | |
1828 | u64 end; | |
1829 | bool writeback_path; | |
1830 | bool strict; | |
1831 | /* | |
1832 | * Free the path passed to can_nocow_file_extent() once it's not needed | |
1833 | * anymore. | |
1834 | */ | |
1835 | bool free_path; | |
1836 | ||
1837 | /* Output fields. Only set when can_nocow_file_extent() returns 1. */ | |
1838 | ||
1839 | u64 disk_bytenr; | |
1840 | u64 disk_num_bytes; | |
1841 | u64 extent_offset; | |
1842 | /* Number of bytes that can be written to in NOCOW mode. */ | |
1843 | u64 num_bytes; | |
1844 | }; | |
1845 | ||
1846 | /* | |
1847 | * Check if we can NOCOW the file extent that the path points to. | |
1848 | * This function may return with the path released, so the caller should check | |
1849 | * if path->nodes[0] is NULL or not if it needs to use the path afterwards. | |
1850 | * | |
1851 | * Returns: < 0 on error | |
1852 | * 0 if we can not NOCOW | |
1853 | * 1 if we can NOCOW | |
1854 | */ | |
1855 | static int can_nocow_file_extent(struct btrfs_path *path, | |
1856 | struct btrfs_key *key, | |
1857 | struct btrfs_inode *inode, | |
1858 | struct can_nocow_file_extent_args *args) | |
1859 | { | |
1860 | const bool is_freespace_inode = btrfs_is_free_space_inode(inode); | |
1861 | struct extent_buffer *leaf = path->nodes[0]; | |
1862 | struct btrfs_root *root = inode->root; | |
1863 | struct btrfs_file_extent_item *fi; | |
1864 | u64 extent_end; | |
1865 | u8 extent_type; | |
1866 | int can_nocow = 0; | |
1867 | int ret = 0; | |
26ce9114 | 1868 | bool nowait = path->nowait; |
619104ba FM |
1869 | |
1870 | fi = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_file_extent_item); | |
1871 | extent_type = btrfs_file_extent_type(leaf, fi); | |
1872 | ||
1873 | if (extent_type == BTRFS_FILE_EXTENT_INLINE) | |
1874 | goto out; | |
1875 | ||
1876 | /* Can't access these fields unless we know it's not an inline extent. */ | |
1877 | args->disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); | |
1878 | args->disk_num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi); | |
1879 | args->extent_offset = btrfs_file_extent_offset(leaf, fi); | |
1880 | ||
1881 | if (!(inode->flags & BTRFS_INODE_NODATACOW) && | |
1882 | extent_type == BTRFS_FILE_EXTENT_REG) | |
1883 | goto out; | |
1884 | ||
1885 | /* | |
1886 | * If the extent was created before the generation where the last snapshot | |
1887 | * for its subvolume was created, then this implies the extent is shared, | |
1888 | * hence we must COW. | |
1889 | */ | |
a7bb6bd4 | 1890 | if (!args->strict && |
619104ba FM |
1891 | btrfs_file_extent_generation(leaf, fi) <= |
1892 | btrfs_root_last_snapshot(&root->root_item)) | |
1893 | goto out; | |
1894 | ||
1895 | /* An explicit hole, must COW. */ | |
1896 | if (args->disk_bytenr == 0) | |
1897 | goto out; | |
1898 | ||
1899 | /* Compressed/encrypted/encoded extents must be COWed. */ | |
1900 | if (btrfs_file_extent_compression(leaf, fi) || | |
1901 | btrfs_file_extent_encryption(leaf, fi) || | |
1902 | btrfs_file_extent_other_encoding(leaf, fi)) | |
1903 | goto out; | |
1904 | ||
1905 | extent_end = btrfs_file_extent_end(path); | |
1906 | ||
1907 | /* | |
1908 | * The following checks can be expensive, as they need to take other | |
1909 | * locks and do btree or rbtree searches, so release the path to avoid | |
1910 | * blocking other tasks for too long. | |
1911 | */ | |
1912 | btrfs_release_path(path); | |
1913 | ||
1914 | ret = btrfs_cross_ref_exist(root, btrfs_ino(inode), | |
1915 | key->offset - args->extent_offset, | |
deccae40 | 1916 | args->disk_bytenr, args->strict, path); |
619104ba FM |
1917 | WARN_ON_ONCE(ret > 0 && is_freespace_inode); |
1918 | if (ret != 0) | |
1919 | goto out; | |
1920 | ||
1921 | if (args->free_path) { | |
1922 | /* | |
1923 | * We don't need the path anymore, plus through the | |
1924 | * csum_exist_in_range() call below we will end up allocating | |
1925 | * another path. So free the path to avoid unnecessary extra | |
1926 | * memory usage. | |
1927 | */ | |
1928 | btrfs_free_path(path); | |
1929 | path = NULL; | |
1930 | } | |
1931 | ||
1932 | /* If there are pending snapshots for this root, we must COW. */ | |
1933 | if (args->writeback_path && !is_freespace_inode && | |
1934 | atomic_read(&root->snapshot_force_cow)) | |
1935 | goto out; | |
1936 | ||
1937 | args->disk_bytenr += args->extent_offset; | |
1938 | args->disk_bytenr += args->start - key->offset; | |
1939 | args->num_bytes = min(args->end + 1, extent_end) - args->start; | |
1940 | ||
1941 | /* | |
1942 | * Force COW if csums exist in the range. This ensures that csums for a | |
1943 | * given extent are either valid or do not exist. | |
1944 | */ | |
26ce9114 JB |
1945 | ret = csum_exist_in_range(root->fs_info, args->disk_bytenr, args->num_bytes, |
1946 | nowait); | |
619104ba FM |
1947 | WARN_ON_ONCE(ret > 0 && is_freespace_inode); |
1948 | if (ret != 0) | |
1949 | goto out; | |
1950 | ||
1951 | can_nocow = 1; | |
1952 | out: | |
1953 | if (args->free_path && path) | |
1954 | btrfs_free_path(path); | |
1955 | ||
1956 | return ret < 0 ? ret : can_nocow; | |
1957 | } | |
1958 | ||
d352ac68 CM |
1959 | /* |
1960 | * when nowcow writeback call back. This checks for snapshots or COW copies | |
1961 | * of the extents that exist in the file, and COWs the file as required. | |
1962 | * | |
1963 | * If no cow copies or snapshots exist, we write directly to the existing | |
1964 | * blocks on disk | |
1965 | */ | |
968322c8 | 1966 | static noinline int run_delalloc_nocow(struct btrfs_inode *inode, |
7f366cfe | 1967 | struct page *locked_page, |
53ffb30a | 1968 | const u64 start, const u64 end) |
be20aa9d | 1969 | { |
968322c8 NB |
1970 | struct btrfs_fs_info *fs_info = inode->root->fs_info; |
1971 | struct btrfs_root *root = inode->root; | |
be20aa9d | 1972 | struct btrfs_path *path; |
3e024846 NB |
1973 | u64 cow_start = (u64)-1; |
1974 | u64 cur_offset = start; | |
8ecebf4d | 1975 | int ret; |
3e024846 | 1976 | bool check_prev = true; |
968322c8 | 1977 | u64 ino = btrfs_ino(inode); |
619104ba | 1978 | struct can_nocow_file_extent_args nocow_args = { 0 }; |
be20aa9d | 1979 | |
76c5126e CH |
1980 | /* |
1981 | * Normally on a zoned device we're only doing COW writes, but in case | |
1982 | * of relocation on a zoned filesystem serializes I/O so that we're only | |
1983 | * writing sequentially and can end up here as well. | |
1984 | */ | |
1985 | ASSERT(!btrfs_is_zoned(fs_info) || btrfs_is_data_reloc_root(root)); | |
1986 | ||
be20aa9d | 1987 | path = btrfs_alloc_path(); |
17ca04af | 1988 | if (!path) { |
38dc8889 CH |
1989 | ret = -ENOMEM; |
1990 | goto error; | |
17ca04af | 1991 | } |
82d5902d | 1992 | |
619104ba FM |
1993 | nocow_args.end = end; |
1994 | nocow_args.writeback_path = true; | |
1995 | ||
80ff3856 | 1996 | while (1) { |
18f62b86 | 1997 | struct btrfs_block_group *nocow_bg = NULL; |
34bfaf15 | 1998 | struct btrfs_ordered_extent *ordered; |
3e024846 NB |
1999 | struct btrfs_key found_key; |
2000 | struct btrfs_file_extent_item *fi; | |
2001 | struct extent_buffer *leaf; | |
2002 | u64 extent_end; | |
3e024846 | 2003 | u64 ram_bytes; |
619104ba | 2004 | u64 nocow_end; |
3e024846 | 2005 | int extent_type; |
3daea5fd | 2006 | bool is_prealloc; |
762bf098 | 2007 | |
e4c3b2dc | 2008 | ret = btrfs_lookup_file_extent(NULL, root, path, ino, |
80ff3856 | 2009 | cur_offset, 0); |
d788a349 | 2010 | if (ret < 0) |
79787eaa | 2011 | goto error; |
a6bd9cd1 NB |
2012 | |
2013 | /* | |
2014 | * If there is no extent for our range when doing the initial | |
2015 | * search, then go back to the previous slot as it will be the | |
2016 | * one containing the search offset | |
2017 | */ | |
80ff3856 YZ |
2018 | if (ret > 0 && path->slots[0] > 0 && check_prev) { |
2019 | leaf = path->nodes[0]; | |
2020 | btrfs_item_key_to_cpu(leaf, &found_key, | |
2021 | path->slots[0] - 1); | |
33345d01 | 2022 | if (found_key.objectid == ino && |
80ff3856 YZ |
2023 | found_key.type == BTRFS_EXTENT_DATA_KEY) |
2024 | path->slots[0]--; | |
2025 | } | |
3e024846 | 2026 | check_prev = false; |
80ff3856 | 2027 | next_slot: |
a6bd9cd1 | 2028 | /* Go to next leaf if we have exhausted the current one */ |
80ff3856 YZ |
2029 | leaf = path->nodes[0]; |
2030 | if (path->slots[0] >= btrfs_header_nritems(leaf)) { | |
2031 | ret = btrfs_next_leaf(root, path); | |
953fa5ce | 2032 | if (ret < 0) |
79787eaa | 2033 | goto error; |
80ff3856 YZ |
2034 | if (ret > 0) |
2035 | break; | |
2036 | leaf = path->nodes[0]; | |
2037 | } | |
be20aa9d | 2038 | |
80ff3856 YZ |
2039 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); |
2040 | ||
a6bd9cd1 | 2041 | /* Didn't find anything for our INO */ |
1d512cb7 FM |
2042 | if (found_key.objectid > ino) |
2043 | break; | |
a6bd9cd1 NB |
2044 | /* |
2045 | * Keep searching until we find an EXTENT_ITEM or there are no | |
2046 | * more extents for this inode | |
2047 | */ | |
1d512cb7 FM |
2048 | if (WARN_ON_ONCE(found_key.objectid < ino) || |
2049 | found_key.type < BTRFS_EXTENT_DATA_KEY) { | |
2050 | path->slots[0]++; | |
2051 | goto next_slot; | |
2052 | } | |
a6bd9cd1 NB |
2053 | |
2054 | /* Found key is not EXTENT_DATA_KEY or starts after req range */ | |
1d512cb7 | 2055 | if (found_key.type > BTRFS_EXTENT_DATA_KEY || |
80ff3856 YZ |
2056 | found_key.offset > end) |
2057 | break; | |
2058 | ||
a6bd9cd1 NB |
2059 | /* |
2060 | * If the found extent starts after requested offset, then | |
2061 | * adjust extent_end to be right before this extent begins | |
2062 | */ | |
80ff3856 YZ |
2063 | if (found_key.offset > cur_offset) { |
2064 | extent_end = found_key.offset; | |
e9061e21 | 2065 | extent_type = 0; |
18f62b86 | 2066 | goto must_cow; |
80ff3856 YZ |
2067 | } |
2068 | ||
a6bd9cd1 NB |
2069 | /* |
2070 | * Found extent which begins before our range and potentially | |
2071 | * intersect it | |
2072 | */ | |
80ff3856 YZ |
2073 | fi = btrfs_item_ptr(leaf, path->slots[0], |
2074 | struct btrfs_file_extent_item); | |
2075 | extent_type = btrfs_file_extent_type(leaf, fi); | |
619104ba FM |
2076 | /* If this is triggered then we have a memory corruption. */ |
2077 | ASSERT(extent_type < BTRFS_NR_FILE_EXTENT_TYPES); | |
2078 | if (WARN_ON(extent_type >= BTRFS_NR_FILE_EXTENT_TYPES)) { | |
2079 | ret = -EUCLEAN; | |
2080 | goto error; | |
2081 | } | |
cc95bef6 | 2082 | ram_bytes = btrfs_file_extent_ram_bytes(leaf, fi); |
619104ba | 2083 | extent_end = btrfs_file_extent_end(path); |
c65ca98f | 2084 | |
619104ba FM |
2085 | /* |
2086 | * If the extent we got ends before our current offset, skip to | |
2087 | * the next extent. | |
2088 | */ | |
2089 | if (extent_end <= cur_offset) { | |
2090 | path->slots[0]++; | |
2091 | goto next_slot; | |
2092 | } | |
c65ca98f | 2093 | |
619104ba FM |
2094 | nocow_args.start = cur_offset; |
2095 | ret = can_nocow_file_extent(path, &found_key, inode, &nocow_args); | |
953fa5ce | 2096 | if (ret < 0) |
619104ba | 2097 | goto error; |
953fa5ce | 2098 | if (ret == 0) |
18f62b86 | 2099 | goto must_cow; |
58113753 | 2100 | |
619104ba | 2101 | ret = 0; |
18f62b86 CH |
2102 | nocow_bg = btrfs_inc_nocow_writers(fs_info, nocow_args.disk_bytenr); |
2103 | if (!nocow_bg) { | |
2104 | must_cow: | |
2105 | /* | |
2106 | * If we can't perform NOCOW writeback for the range, | |
2107 | * then record the beginning of the range that needs to | |
2108 | * be COWed. It will be written out before the next | |
2109 | * NOCOW range if we find one, or when exiting this | |
2110 | * loop. | |
2111 | */ | |
80ff3856 YZ |
2112 | if (cow_start == (u64)-1) |
2113 | cow_start = cur_offset; | |
2114 | cur_offset = extent_end; | |
2115 | if (cur_offset > end) | |
2116 | break; | |
c65ca98f FM |
2117 | if (!path->nodes[0]) |
2118 | continue; | |
80ff3856 YZ |
2119 | path->slots[0]++; |
2120 | goto next_slot; | |
7ea394f1 YZ |
2121 | } |
2122 | ||
a6bd9cd1 NB |
2123 | /* |
2124 | * COW range from cow_start to found_key.offset - 1. As the key | |
2125 | * will contain the beginning of the first extent that can be | |
2126 | * NOCOW, following one which needs to be COW'ed | |
2127 | */ | |
80ff3856 | 2128 | if (cow_start != (u64)-1) { |
968322c8 | 2129 | ret = fallback_to_cow(inode, locked_page, |
53ffb30a | 2130 | cow_start, found_key.offset - 1); |
80ff3856 | 2131 | cow_start = (u64)-1; |
18f62b86 CH |
2132 | if (ret) { |
2133 | btrfs_dec_nocow_writers(nocow_bg); | |
79787eaa | 2134 | goto error; |
18f62b86 | 2135 | } |
7ea394f1 | 2136 | } |
80ff3856 | 2137 | |
619104ba | 2138 | nocow_end = cur_offset + nocow_args.num_bytes - 1; |
3daea5fd CH |
2139 | is_prealloc = extent_type == BTRFS_FILE_EXTENT_PREALLOC; |
2140 | if (is_prealloc) { | |
619104ba | 2141 | u64 orig_start = found_key.offset - nocow_args.extent_offset; |
3e024846 | 2142 | struct extent_map *em; |
6f9994db | 2143 | |
619104ba | 2144 | em = create_io_em(inode, cur_offset, nocow_args.num_bytes, |
6f9994db | 2145 | orig_start, |
619104ba FM |
2146 | nocow_args.disk_bytenr, /* block_start */ |
2147 | nocow_args.num_bytes, /* block_len */ | |
2148 | nocow_args.disk_num_bytes, /* orig_block_len */ | |
6f9994db LB |
2149 | ram_bytes, BTRFS_COMPRESS_NONE, |
2150 | BTRFS_ORDERED_PREALLOC); | |
2151 | if (IS_ERR(em)) { | |
18f62b86 | 2152 | btrfs_dec_nocow_writers(nocow_bg); |
6f9994db LB |
2153 | ret = PTR_ERR(em); |
2154 | goto error; | |
d899e052 | 2155 | } |
6f9994db | 2156 | free_extent_map(em); |
3daea5fd CH |
2157 | } |
2158 | ||
34bfaf15 | 2159 | ordered = btrfs_alloc_ordered_extent(inode, cur_offset, |
3daea5fd CH |
2160 | nocow_args.num_bytes, nocow_args.num_bytes, |
2161 | nocow_args.disk_bytenr, nocow_args.num_bytes, 0, | |
2162 | is_prealloc | |
2163 | ? (1 << BTRFS_ORDERED_PREALLOC) | |
2164 | : (1 << BTRFS_ORDERED_NOCOW), | |
2165 | BTRFS_COMPRESS_NONE); | |
18f62b86 | 2166 | btrfs_dec_nocow_writers(nocow_bg); |
34bfaf15 | 2167 | if (IS_ERR(ordered)) { |
3daea5fd | 2168 | if (is_prealloc) { |
4c0c8cfc FM |
2169 | btrfs_drop_extent_map_range(inode, cur_offset, |
2170 | nocow_end, false); | |
762bf098 | 2171 | } |
34bfaf15 | 2172 | ret = PTR_ERR(ordered); |
3daea5fd | 2173 | goto error; |
d899e052 | 2174 | } |
80ff3856 | 2175 | |
37f00a6d | 2176 | if (btrfs_is_data_reloc_root(root)) |
4dbd80fb QW |
2177 | /* |
2178 | * Error handled later, as we must prevent | |
2179 | * extent_clear_unlock_delalloc() in error handler | |
2180 | * from freeing metadata of created ordered extent. | |
2181 | */ | |
34bfaf15 CH |
2182 | ret = btrfs_reloc_clone_csums(ordered); |
2183 | btrfs_put_ordered_extent(ordered); | |
efa56464 | 2184 | |
619104ba | 2185 | extent_clear_unlock_delalloc(inode, cur_offset, nocow_end, |
c2790a2e | 2186 | locked_page, EXTENT_LOCKED | |
18513091 WX |
2187 | EXTENT_DELALLOC | |
2188 | EXTENT_CLEAR_DATA_RESV, | |
f57ad937 | 2189 | PAGE_UNLOCK | PAGE_SET_ORDERED); |
18513091 | 2190 | |
80ff3856 | 2191 | cur_offset = extent_end; |
4dbd80fb QW |
2192 | |
2193 | /* | |
2194 | * btrfs_reloc_clone_csums() error, now we're OK to call error | |
2195 | * handler, as metadata for created ordered extent will only | |
2196 | * be freed by btrfs_finish_ordered_io(). | |
2197 | */ | |
2198 | if (ret) | |
2199 | goto error; | |
80ff3856 YZ |
2200 | if (cur_offset > end) |
2201 | break; | |
be20aa9d | 2202 | } |
b3b4aa74 | 2203 | btrfs_release_path(path); |
80ff3856 | 2204 | |
506481b2 | 2205 | if (cur_offset <= end && cow_start == (u64)-1) |
80ff3856 | 2206 | cow_start = cur_offset; |
17ca04af | 2207 | |
80ff3856 | 2208 | if (cow_start != (u64)-1) { |
506481b2 | 2209 | cur_offset = end; |
53ffb30a | 2210 | ret = fallback_to_cow(inode, locked_page, cow_start, end); |
953fa5ce | 2211 | cow_start = (u64)-1; |
d788a349 | 2212 | if (ret) |
79787eaa | 2213 | goto error; |
80ff3856 YZ |
2214 | } |
2215 | ||
18f62b86 CH |
2216 | btrfs_free_path(path); |
2217 | return 0; | |
762bf098 | 2218 | |
18f62b86 | 2219 | error: |
953fa5ce CH |
2220 | /* |
2221 | * If an error happened while a COW region is outstanding, cur_offset | |
2222 | * needs to be reset to cow_start to ensure the COW region is unlocked | |
2223 | * as well. | |
2224 | */ | |
2225 | if (cow_start != (u64)-1) | |
2226 | cur_offset = cow_start; | |
18f62b86 | 2227 | if (cur_offset < end) |
968322c8 | 2228 | extent_clear_unlock_delalloc(inode, cur_offset, end, |
c2790a2e | 2229 | locked_page, EXTENT_LOCKED | |
151a41bc JB |
2230 | EXTENT_DELALLOC | EXTENT_DEFRAG | |
2231 | EXTENT_DO_ACCOUNTING, PAGE_UNLOCK | | |
6869b0a8 | 2232 | PAGE_START_WRITEBACK | |
c2790a2e | 2233 | PAGE_END_WRITEBACK); |
7ea394f1 | 2234 | btrfs_free_path(path); |
79787eaa | 2235 | return ret; |
be20aa9d CM |
2236 | } |
2237 | ||
6e65ae76 | 2238 | static bool should_nocow(struct btrfs_inode *inode, u64 start, u64 end) |
47059d93 | 2239 | { |
6e65ae76 GR |
2240 | if (inode->flags & (BTRFS_INODE_NODATACOW | BTRFS_INODE_PREALLOC)) { |
2241 | if (inode->defrag_bytes && | |
99be1a66 | 2242 | test_range_bit_exists(&inode->io_tree, start, end, EXTENT_DEFRAG)) |
6e65ae76 GR |
2243 | return false; |
2244 | return true; | |
2245 | } | |
2246 | return false; | |
47059d93 WS |
2247 | } |
2248 | ||
d352ac68 | 2249 | /* |
5eaad97a NB |
2250 | * Function to process delayed allocation (create CoW) for ranges which are |
2251 | * being touched for the first time. | |
d352ac68 | 2252 | */ |
98456b9c | 2253 | int btrfs_run_delalloc_range(struct btrfs_inode *inode, struct page *locked_page, |
c56cbe90 | 2254 | u64 start, u64 end, struct writeback_control *wbc) |
be20aa9d | 2255 | { |
42c01100 | 2256 | const bool zoned = btrfs_is_zoned(inode->root->fs_info); |
c56cbe90 | 2257 | int ret; |
a2135011 | 2258 | |
2749f7ef | 2259 | /* |
c56cbe90 CH |
2260 | * The range must cover part of the @locked_page, or a return of 1 |
2261 | * can confuse the caller. | |
2749f7ef QW |
2262 | */ |
2263 | ASSERT(!(end <= page_offset(locked_page) || | |
2264 | start >= page_offset(locked_page) + PAGE_SIZE)); | |
2265 | ||
6e65ae76 | 2266 | if (should_nocow(inode, start, end)) { |
53ffb30a | 2267 | ret = run_delalloc_nocow(inode, locked_page, start, end); |
973fb26e | 2268 | goto out; |
7ddf5a42 | 2269 | } |
973fb26e CH |
2270 | |
2271 | if (btrfs_inode_can_compress(inode) && | |
2272 | inode_need_compress(inode, start, end) && | |
c56cbe90 CH |
2273 | run_delalloc_compressed(inode, locked_page, start, end, wbc)) |
2274 | return 1; | |
973fb26e CH |
2275 | |
2276 | if (zoned) | |
256b0cf9 CH |
2277 | ret = run_delalloc_cow(inode, locked_page, start, end, wbc, |
2278 | true); | |
973fb26e | 2279 | else |
c56cbe90 CH |
2280 | ret = cow_file_range(inode, locked_page, start, end, NULL, |
2281 | false, false); | |
973fb26e CH |
2282 | |
2283 | out: | |
c56cbe90 | 2284 | if (ret < 0) |
98456b9c | 2285 | btrfs_cleanup_ordered_extents(inode, locked_page, start, |
d1051d6e | 2286 | end - start + 1); |
b888db2b CM |
2287 | return ret; |
2288 | } | |
2289 | ||
62798a49 | 2290 | void btrfs_split_delalloc_extent(struct btrfs_inode *inode, |
abbb55f4 | 2291 | struct extent_state *orig, u64 split) |
9ed74f2d | 2292 | { |
62798a49 | 2293 | struct btrfs_fs_info *fs_info = inode->root->fs_info; |
dcab6a3b JB |
2294 | u64 size; |
2295 | ||
0ca1f7ce | 2296 | /* not delalloc, ignore it */ |
9ed74f2d | 2297 | if (!(orig->state & EXTENT_DELALLOC)) |
1bf85046 | 2298 | return; |
9ed74f2d | 2299 | |
dcab6a3b | 2300 | size = orig->end - orig->start + 1; |
f7b12a62 | 2301 | if (size > fs_info->max_extent_size) { |
823bb20a | 2302 | u32 num_extents; |
dcab6a3b JB |
2303 | u64 new_size; |
2304 | ||
2305 | /* | |
5c848198 | 2306 | * See the explanation in btrfs_merge_delalloc_extent, the same |
ba117213 | 2307 | * applies here, just in reverse. |
dcab6a3b JB |
2308 | */ |
2309 | new_size = orig->end - split + 1; | |
7d7672bc | 2310 | num_extents = count_max_extents(fs_info, new_size); |
ba117213 | 2311 | new_size = split - orig->start; |
7d7672bc NA |
2312 | num_extents += count_max_extents(fs_info, new_size); |
2313 | if (count_max_extents(fs_info, size) >= num_extents) | |
dcab6a3b JB |
2314 | return; |
2315 | } | |
2316 | ||
62798a49 DS |
2317 | spin_lock(&inode->lock); |
2318 | btrfs_mod_outstanding_extents(inode, 1); | |
2319 | spin_unlock(&inode->lock); | |
9ed74f2d JB |
2320 | } |
2321 | ||
2322 | /* | |
5c848198 NB |
2323 | * Handle merged delayed allocation extents so we can keep track of new extents |
2324 | * that are just merged onto old extents, such as when we are doing sequential | |
2325 | * writes, so we can properly account for the metadata space we'll need. | |
9ed74f2d | 2326 | */ |
2454151c | 2327 | void btrfs_merge_delalloc_extent(struct btrfs_inode *inode, struct extent_state *new, |
5c848198 | 2328 | struct extent_state *other) |
9ed74f2d | 2329 | { |
2454151c | 2330 | struct btrfs_fs_info *fs_info = inode->root->fs_info; |
dcab6a3b | 2331 | u64 new_size, old_size; |
823bb20a | 2332 | u32 num_extents; |
dcab6a3b | 2333 | |
9ed74f2d JB |
2334 | /* not delalloc, ignore it */ |
2335 | if (!(other->state & EXTENT_DELALLOC)) | |
1bf85046 | 2336 | return; |
9ed74f2d | 2337 | |
8461a3de JB |
2338 | if (new->start > other->start) |
2339 | new_size = new->end - other->start + 1; | |
2340 | else | |
2341 | new_size = other->end - new->start + 1; | |
dcab6a3b JB |
2342 | |
2343 | /* we're not bigger than the max, unreserve the space and go */ | |
f7b12a62 | 2344 | if (new_size <= fs_info->max_extent_size) { |
2454151c DS |
2345 | spin_lock(&inode->lock); |
2346 | btrfs_mod_outstanding_extents(inode, -1); | |
2347 | spin_unlock(&inode->lock); | |
dcab6a3b JB |
2348 | return; |
2349 | } | |
2350 | ||
2351 | /* | |
ba117213 JB |
2352 | * We have to add up either side to figure out how many extents were |
2353 | * accounted for before we merged into one big extent. If the number of | |
2354 | * extents we accounted for is <= the amount we need for the new range | |
2355 | * then we can return, otherwise drop. Think of it like this | |
2356 | * | |
2357 | * [ 4k][MAX_SIZE] | |
2358 | * | |
2359 | * So we've grown the extent by a MAX_SIZE extent, this would mean we | |
2360 | * need 2 outstanding extents, on one side we have 1 and the other side | |
2361 | * we have 1 so they are == and we can return. But in this case | |
2362 | * | |
2363 | * [MAX_SIZE+4k][MAX_SIZE+4k] | |
2364 | * | |
2365 | * Each range on their own accounts for 2 extents, but merged together | |
2366 | * they are only 3 extents worth of accounting, so we need to drop in | |
2367 | * this case. | |
dcab6a3b | 2368 | */ |
ba117213 | 2369 | old_size = other->end - other->start + 1; |
7d7672bc | 2370 | num_extents = count_max_extents(fs_info, old_size); |
ba117213 | 2371 | old_size = new->end - new->start + 1; |
7d7672bc NA |
2372 | num_extents += count_max_extents(fs_info, old_size); |
2373 | if (count_max_extents(fs_info, new_size) >= num_extents) | |
dcab6a3b JB |
2374 | return; |
2375 | ||
2454151c DS |
2376 | spin_lock(&inode->lock); |
2377 | btrfs_mod_outstanding_extents(inode, -1); | |
2378 | spin_unlock(&inode->lock); | |
9ed74f2d JB |
2379 | } |
2380 | ||
eb73c1b7 | 2381 | static void btrfs_add_delalloc_inodes(struct btrfs_root *root, |
82ca5a04 | 2382 | struct btrfs_inode *inode) |
eb73c1b7 | 2383 | { |
82ca5a04 | 2384 | struct btrfs_fs_info *fs_info = inode->root->fs_info; |
0b246afa | 2385 | |
eb73c1b7 | 2386 | spin_lock(&root->delalloc_lock); |
82ca5a04 DS |
2387 | if (list_empty(&inode->delalloc_inodes)) { |
2388 | list_add_tail(&inode->delalloc_inodes, &root->delalloc_inodes); | |
2389 | set_bit(BTRFS_INODE_IN_DELALLOC_LIST, &inode->runtime_flags); | |
eb73c1b7 MX |
2390 | root->nr_delalloc_inodes++; |
2391 | if (root->nr_delalloc_inodes == 1) { | |
0b246afa | 2392 | spin_lock(&fs_info->delalloc_root_lock); |
eb73c1b7 MX |
2393 | BUG_ON(!list_empty(&root->delalloc_root)); |
2394 | list_add_tail(&root->delalloc_root, | |
0b246afa JM |
2395 | &fs_info->delalloc_roots); |
2396 | spin_unlock(&fs_info->delalloc_root_lock); | |
eb73c1b7 MX |
2397 | } |
2398 | } | |
2399 | spin_unlock(&root->delalloc_lock); | |
2400 | } | |
2401 | ||
2b877331 NB |
2402 | void __btrfs_del_delalloc_inode(struct btrfs_root *root, |
2403 | struct btrfs_inode *inode) | |
eb73c1b7 | 2404 | { |
3ffbd68c | 2405 | struct btrfs_fs_info *fs_info = root->fs_info; |
0b246afa | 2406 | |
9e3e97f4 NB |
2407 | if (!list_empty(&inode->delalloc_inodes)) { |
2408 | list_del_init(&inode->delalloc_inodes); | |
eb73c1b7 | 2409 | clear_bit(BTRFS_INODE_IN_DELALLOC_LIST, |
9e3e97f4 | 2410 | &inode->runtime_flags); |
eb73c1b7 MX |
2411 | root->nr_delalloc_inodes--; |
2412 | if (!root->nr_delalloc_inodes) { | |
7c8a0d36 | 2413 | ASSERT(list_empty(&root->delalloc_inodes)); |
0b246afa | 2414 | spin_lock(&fs_info->delalloc_root_lock); |
eb73c1b7 MX |
2415 | BUG_ON(list_empty(&root->delalloc_root)); |
2416 | list_del_init(&root->delalloc_root); | |
0b246afa | 2417 | spin_unlock(&fs_info->delalloc_root_lock); |
eb73c1b7 MX |
2418 | } |
2419 | } | |
2b877331 NB |
2420 | } |
2421 | ||
2422 | static void btrfs_del_delalloc_inode(struct btrfs_root *root, | |
2423 | struct btrfs_inode *inode) | |
2424 | { | |
2425 | spin_lock(&root->delalloc_lock); | |
2426 | __btrfs_del_delalloc_inode(root, inode); | |
eb73c1b7 MX |
2427 | spin_unlock(&root->delalloc_lock); |
2428 | } | |
2429 | ||
d352ac68 | 2430 | /* |
e06a1fc9 NB |
2431 | * Properly track delayed allocation bytes in the inode and to maintain the |
2432 | * list of inodes that have pending delalloc work to be done. | |
d352ac68 | 2433 | */ |
4c5d166f | 2434 | void btrfs_set_delalloc_extent(struct btrfs_inode *inode, struct extent_state *state, |
6d92b304 | 2435 | u32 bits) |
291d673e | 2436 | { |
4c5d166f | 2437 | struct btrfs_fs_info *fs_info = inode->root->fs_info; |
0b246afa | 2438 | |
6d92b304 | 2439 | if ((bits & EXTENT_DEFRAG) && !(bits & EXTENT_DELALLOC)) |
47059d93 | 2440 | WARN_ON(1); |
75eff68e CM |
2441 | /* |
2442 | * set_bit and clear bit hooks normally require _irqsave/restore | |
27160b6b | 2443 | * but in this case, we are only testing for the DELALLOC |
75eff68e CM |
2444 | * bit, which is only set or cleared with irqs on |
2445 | */ | |
6d92b304 | 2446 | if (!(state->state & EXTENT_DELALLOC) && (bits & EXTENT_DELALLOC)) { |
4c5d166f | 2447 | struct btrfs_root *root = inode->root; |
0ca1f7ce | 2448 | u64 len = state->end + 1 - state->start; |
7d7672bc | 2449 | u32 num_extents = count_max_extents(fs_info, len); |
4c5d166f | 2450 | bool do_list = !btrfs_is_free_space_inode(inode); |
9ed74f2d | 2451 | |
4c5d166f DS |
2452 | spin_lock(&inode->lock); |
2453 | btrfs_mod_outstanding_extents(inode, num_extents); | |
2454 | spin_unlock(&inode->lock); | |
287a0ab9 | 2455 | |
6a3891c5 | 2456 | /* For sanity tests */ |
0b246afa | 2457 | if (btrfs_is_testing(fs_info)) |
6a3891c5 JB |
2458 | return; |
2459 | ||
104b4e51 NB |
2460 | percpu_counter_add_batch(&fs_info->delalloc_bytes, len, |
2461 | fs_info->delalloc_batch); | |
4c5d166f DS |
2462 | spin_lock(&inode->lock); |
2463 | inode->delalloc_bytes += len; | |
6d92b304 | 2464 | if (bits & EXTENT_DEFRAG) |
4c5d166f | 2465 | inode->defrag_bytes += len; |
df0af1a5 | 2466 | if (do_list && !test_bit(BTRFS_INODE_IN_DELALLOC_LIST, |
4c5d166f | 2467 | &inode->runtime_flags)) |
eb73c1b7 | 2468 | btrfs_add_delalloc_inodes(root, inode); |
4c5d166f | 2469 | spin_unlock(&inode->lock); |
291d673e | 2470 | } |
a7e3b975 FM |
2471 | |
2472 | if (!(state->state & EXTENT_DELALLOC_NEW) && | |
6d92b304 | 2473 | (bits & EXTENT_DELALLOC_NEW)) { |
4c5d166f DS |
2474 | spin_lock(&inode->lock); |
2475 | inode->new_delalloc_bytes += state->end + 1 - state->start; | |
2476 | spin_unlock(&inode->lock); | |
a7e3b975 | 2477 | } |
291d673e CM |
2478 | } |
2479 | ||
d352ac68 | 2480 | /* |
a36bb5f9 NB |
2481 | * Once a range is no longer delalloc this function ensures that proper |
2482 | * accounting happens. | |
d352ac68 | 2483 | */ |
bd54766e | 2484 | void btrfs_clear_delalloc_extent(struct btrfs_inode *inode, |
6d92b304 | 2485 | struct extent_state *state, u32 bits) |
291d673e | 2486 | { |
bd54766e | 2487 | struct btrfs_fs_info *fs_info = inode->root->fs_info; |
47059d93 | 2488 | u64 len = state->end + 1 - state->start; |
7d7672bc | 2489 | u32 num_extents = count_max_extents(fs_info, len); |
47059d93 | 2490 | |
6d92b304 | 2491 | if ((state->state & EXTENT_DEFRAG) && (bits & EXTENT_DEFRAG)) { |
4a4b964f | 2492 | spin_lock(&inode->lock); |
6fc0ef68 | 2493 | inode->defrag_bytes -= len; |
4a4b964f FM |
2494 | spin_unlock(&inode->lock); |
2495 | } | |
47059d93 | 2496 | |
75eff68e CM |
2497 | /* |
2498 | * set_bit and clear bit hooks normally require _irqsave/restore | |
27160b6b | 2499 | * but in this case, we are only testing for the DELALLOC |
75eff68e CM |
2500 | * bit, which is only set or cleared with irqs on |
2501 | */ | |
6d92b304 | 2502 | if ((state->state & EXTENT_DELALLOC) && (bits & EXTENT_DELALLOC)) { |
6fc0ef68 | 2503 | struct btrfs_root *root = inode->root; |
83eea1f1 | 2504 | bool do_list = !btrfs_is_free_space_inode(inode); |
bcbfce8a | 2505 | |
8b62f87b JB |
2506 | spin_lock(&inode->lock); |
2507 | btrfs_mod_outstanding_extents(inode, -num_extents); | |
2508 | spin_unlock(&inode->lock); | |
0ca1f7ce | 2509 | |
b6d08f06 JB |
2510 | /* |
2511 | * We don't reserve metadata space for space cache inodes so we | |
52042d8e | 2512 | * don't need to call delalloc_release_metadata if there is an |
b6d08f06 JB |
2513 | * error. |
2514 | */ | |
6d92b304 | 2515 | if (bits & EXTENT_CLEAR_META_RESV && |
0b246afa | 2516 | root != fs_info->tree_root) |
43b18595 | 2517 | btrfs_delalloc_release_metadata(inode, len, false); |
0ca1f7ce | 2518 | |
6a3891c5 | 2519 | /* For sanity tests. */ |
0b246afa | 2520 | if (btrfs_is_testing(fs_info)) |
6a3891c5 JB |
2521 | return; |
2522 | ||
37f00a6d | 2523 | if (!btrfs_is_data_reloc_root(root) && |
a315e68f | 2524 | do_list && !(state->state & EXTENT_NORESERVE) && |
6d92b304 | 2525 | (bits & EXTENT_CLEAR_DATA_RESV)) |
9db5d510 | 2526 | btrfs_free_reserved_data_space_noquota(fs_info, len); |
9ed74f2d | 2527 | |
104b4e51 NB |
2528 | percpu_counter_add_batch(&fs_info->delalloc_bytes, -len, |
2529 | fs_info->delalloc_batch); | |
6fc0ef68 NB |
2530 | spin_lock(&inode->lock); |
2531 | inode->delalloc_bytes -= len; | |
2532 | if (do_list && inode->delalloc_bytes == 0 && | |
df0af1a5 | 2533 | test_bit(BTRFS_INODE_IN_DELALLOC_LIST, |
9e3e97f4 | 2534 | &inode->runtime_flags)) |
eb73c1b7 | 2535 | btrfs_del_delalloc_inode(root, inode); |
6fc0ef68 | 2536 | spin_unlock(&inode->lock); |
291d673e | 2537 | } |
a7e3b975 FM |
2538 | |
2539 | if ((state->state & EXTENT_DELALLOC_NEW) && | |
6d92b304 | 2540 | (bits & EXTENT_DELALLOC_NEW)) { |
a7e3b975 FM |
2541 | spin_lock(&inode->lock); |
2542 | ASSERT(inode->new_delalloc_bytes >= len); | |
2543 | inode->new_delalloc_bytes -= len; | |
6d92b304 | 2544 | if (bits & EXTENT_ADD_INODE_BYTES) |
2766ff61 | 2545 | inode_add_bytes(&inode->vfs_inode, len); |
a7e3b975 FM |
2546 | spin_unlock(&inode->lock); |
2547 | } | |
291d673e CM |
2548 | } |
2549 | ||
71df088c CH |
2550 | static int btrfs_extract_ordered_extent(struct btrfs_bio *bbio, |
2551 | struct btrfs_ordered_extent *ordered) | |
d22002fd | 2552 | { |
69ccf3f4 CH |
2553 | u64 start = (u64)bbio->bio.bi_iter.bi_sector << SECTOR_SHIFT; |
2554 | u64 len = bbio->bio.bi_iter.bi_size; | |
b0307e28 | 2555 | struct btrfs_ordered_extent *new; |
ebdb44a0 | 2556 | int ret; |
d22002fd | 2557 | |
11d33ab6 | 2558 | /* Must always be called for the beginning of an ordered extent. */ |
7edd339c CH |
2559 | if (WARN_ON_ONCE(start != ordered->disk_bytenr)) |
2560 | return -EINVAL; | |
d22002fd | 2561 | |
11d33ab6 | 2562 | /* No need to split if the ordered extent covers the entire bio. */ |
ec63b84d CH |
2563 | if (ordered->disk_num_bytes == len) { |
2564 | refcount_inc(&ordered->refs); | |
2565 | bbio->ordered = ordered; | |
7edd339c | 2566 | return 0; |
ec63b84d | 2567 | } |
d22002fd | 2568 | |
f0f5329a BB |
2569 | /* |
2570 | * Don't split the extent_map for NOCOW extents, as we're writing into | |
2571 | * a pre-existing one. | |
2572 | */ | |
ebdb44a0 CH |
2573 | if (!test_bit(BTRFS_ORDERED_NOCOW, &ordered->flags)) { |
2574 | ret = split_extent_map(bbio->inode, bbio->file_offset, | |
f000bc6f CH |
2575 | ordered->num_bytes, len, |
2576 | ordered->disk_bytenr); | |
ebdb44a0 CH |
2577 | if (ret) |
2578 | return ret; | |
2579 | } | |
f0f5329a | 2580 | |
b0307e28 CH |
2581 | new = btrfs_split_ordered_extent(ordered, len); |
2582 | if (IS_ERR(new)) | |
2583 | return PTR_ERR(new); | |
ec63b84d | 2584 | bbio->ordered = new; |
b0307e28 | 2585 | return 0; |
d22002fd NA |
2586 | } |
2587 | ||
d352ac68 CM |
2588 | /* |
2589 | * given a list of ordered sums record them in the inode. This happens | |
2590 | * at IO completion time based on sums calculated at bio submission time. | |
2591 | */ | |
510f85ed NB |
2592 | static int add_pending_csums(struct btrfs_trans_handle *trans, |
2593 | struct list_head *list) | |
e6dcd2dc | 2594 | { |
e6dcd2dc | 2595 | struct btrfs_ordered_sum *sum; |
fc28b25e | 2596 | struct btrfs_root *csum_root = NULL; |
ac01f26a | 2597 | int ret; |
e6dcd2dc | 2598 | |
c6e30871 | 2599 | list_for_each_entry(sum, list, list) { |
7c2871a2 | 2600 | trans->adding_csums = true; |
fc28b25e JB |
2601 | if (!csum_root) |
2602 | csum_root = btrfs_csum_root(trans->fs_info, | |
5cfe76f8 | 2603 | sum->logical); |
fc28b25e | 2604 | ret = btrfs_csum_file_blocks(trans, csum_root, sum); |
7c2871a2 | 2605 | trans->adding_csums = false; |
ac01f26a NB |
2606 | if (ret) |
2607 | return ret; | |
e6dcd2dc CM |
2608 | } |
2609 | return 0; | |
2610 | } | |
2611 | ||
c3347309 FM |
2612 | static int btrfs_find_new_delalloc_bytes(struct btrfs_inode *inode, |
2613 | const u64 start, | |
2614 | const u64 len, | |
2615 | struct extent_state **cached_state) | |
2616 | { | |
2617 | u64 search_start = start; | |
2618 | const u64 end = start + len - 1; | |
2619 | ||
2620 | while (search_start < end) { | |
2621 | const u64 search_len = end - search_start + 1; | |
2622 | struct extent_map *em; | |
2623 | u64 em_len; | |
2624 | int ret = 0; | |
2625 | ||
2626 | em = btrfs_get_extent(inode, NULL, 0, search_start, search_len); | |
2627 | if (IS_ERR(em)) | |
2628 | return PTR_ERR(em); | |
2629 | ||
2630 | if (em->block_start != EXTENT_MAP_HOLE) | |
2631 | goto next; | |
2632 | ||
2633 | em_len = em->len; | |
2634 | if (em->start < search_start) | |
2635 | em_len -= search_start - em->start; | |
2636 | if (em_len > search_len) | |
2637 | em_len = search_len; | |
2638 | ||
2639 | ret = set_extent_bit(&inode->io_tree, search_start, | |
2640 | search_start + em_len - 1, | |
1d126800 | 2641 | EXTENT_DELALLOC_NEW, cached_state); |
c3347309 FM |
2642 | next: |
2643 | search_start = extent_map_end(em); | |
2644 | free_extent_map(em); | |
2645 | if (ret) | |
2646 | return ret; | |
2647 | } | |
2648 | return 0; | |
2649 | } | |
2650 | ||
c2566f22 | 2651 | int btrfs_set_extent_delalloc(struct btrfs_inode *inode, u64 start, u64 end, |
e3b8a485 | 2652 | unsigned int extra_bits, |
330a5827 | 2653 | struct extent_state **cached_state) |
ea8c2819 | 2654 | { |
fdb1e121 | 2655 | WARN_ON(PAGE_ALIGNED(end)); |
c3347309 FM |
2656 | |
2657 | if (start >= i_size_read(&inode->vfs_inode) && | |
2658 | !(inode->flags & BTRFS_INODE_PREALLOC)) { | |
2659 | /* | |
2660 | * There can't be any extents following eof in this case so just | |
2661 | * set the delalloc new bit for the range directly. | |
2662 | */ | |
2663 | extra_bits |= EXTENT_DELALLOC_NEW; | |
2664 | } else { | |
2665 | int ret; | |
2666 | ||
2667 | ret = btrfs_find_new_delalloc_bytes(inode, start, | |
2668 | end + 1 - start, | |
2669 | cached_state); | |
2670 | if (ret) | |
2671 | return ret; | |
2672 | } | |
2673 | ||
66240ab1 | 2674 | return set_extent_bit(&inode->io_tree, start, end, |
1d126800 | 2675 | EXTENT_DELALLOC | extra_bits, cached_state); |
ea8c2819 CM |
2676 | } |
2677 | ||
d352ac68 | 2678 | /* see btrfs_writepage_start_hook for details on why this is required */ |
247e743c CM |
2679 | struct btrfs_writepage_fixup { |
2680 | struct page *page; | |
36eeaef5 | 2681 | struct btrfs_inode *inode; |
247e743c CM |
2682 | struct btrfs_work work; |
2683 | }; | |
2684 | ||
b2950863 | 2685 | static void btrfs_writepage_fixup_worker(struct btrfs_work *work) |
247e743c | 2686 | { |
9783e4de CH |
2687 | struct btrfs_writepage_fixup *fixup = |
2688 | container_of(work, struct btrfs_writepage_fixup, work); | |
247e743c | 2689 | struct btrfs_ordered_extent *ordered; |
2ac55d41 | 2690 | struct extent_state *cached_state = NULL; |
364ecf36 | 2691 | struct extent_changeset *data_reserved = NULL; |
9783e4de CH |
2692 | struct page *page = fixup->page; |
2693 | struct btrfs_inode *inode = fixup->inode; | |
2694 | struct btrfs_fs_info *fs_info = inode->root->fs_info; | |
2695 | u64 page_start = page_offset(page); | |
2696 | u64 page_end = page_offset(page) + PAGE_SIZE - 1; | |
25f3c502 | 2697 | int ret = 0; |
f4b1363c | 2698 | bool free_delalloc_space = true; |
247e743c | 2699 | |
f4b1363c JB |
2700 | /* |
2701 | * This is similar to page_mkwrite, we need to reserve the space before | |
2702 | * we take the page lock. | |
2703 | */ | |
65d87f79 NB |
2704 | ret = btrfs_delalloc_reserve_space(inode, &data_reserved, page_start, |
2705 | PAGE_SIZE); | |
4a096752 | 2706 | again: |
247e743c | 2707 | lock_page(page); |
25f3c502 CM |
2708 | |
2709 | /* | |
2710 | * Before we queued this fixup, we took a reference on the page. | |
2711 | * page->mapping may go NULL, but it shouldn't be moved to a different | |
2712 | * address space. | |
2713 | */ | |
f4b1363c JB |
2714 | if (!page->mapping || !PageDirty(page) || !PageChecked(page)) { |
2715 | /* | |
2716 | * Unfortunately this is a little tricky, either | |
2717 | * | |
2718 | * 1) We got here and our page had already been dealt with and | |
2719 | * we reserved our space, thus ret == 0, so we need to just | |
2720 | * drop our space reservation and bail. This can happen the | |
2721 | * first time we come into the fixup worker, or could happen | |
2722 | * while waiting for the ordered extent. | |
2723 | * 2) Our page was already dealt with, but we happened to get an | |
2724 | * ENOSPC above from the btrfs_delalloc_reserve_space. In | |
2725 | * this case we obviously don't have anything to release, but | |
2726 | * because the page was already dealt with we don't want to | |
2727 | * mark the page with an error, so make sure we're resetting | |
2728 | * ret to 0. This is why we have this check _before_ the ret | |
2729 | * check, because we do not want to have a surprise ENOSPC | |
2730 | * when the page was already properly dealt with. | |
2731 | */ | |
2732 | if (!ret) { | |
65d87f79 NB |
2733 | btrfs_delalloc_release_extents(inode, PAGE_SIZE); |
2734 | btrfs_delalloc_release_space(inode, data_reserved, | |
f4b1363c JB |
2735 | page_start, PAGE_SIZE, |
2736 | true); | |
2737 | } | |
2738 | ret = 0; | |
247e743c | 2739 | goto out_page; |
f4b1363c | 2740 | } |
247e743c | 2741 | |
25f3c502 | 2742 | /* |
f4b1363c JB |
2743 | * We can't mess with the page state unless it is locked, so now that |
2744 | * it is locked bail if we failed to make our space reservation. | |
25f3c502 | 2745 | */ |
f4b1363c JB |
2746 | if (ret) |
2747 | goto out_page; | |
247e743c | 2748 | |
570eb97b | 2749 | lock_extent(&inode->io_tree, page_start, page_end, &cached_state); |
4a096752 CM |
2750 | |
2751 | /* already ordered? We're done */ | |
f57ad937 | 2752 | if (PageOrdered(page)) |
f4b1363c | 2753 | goto out_reserved; |
4a096752 | 2754 | |
65d87f79 | 2755 | ordered = btrfs_lookup_ordered_range(inode, page_start, PAGE_SIZE); |
4a096752 | 2756 | if (ordered) { |
570eb97b JB |
2757 | unlock_extent(&inode->io_tree, page_start, page_end, |
2758 | &cached_state); | |
4a096752 | 2759 | unlock_page(page); |
36d45567 | 2760 | btrfs_start_ordered_extent(ordered); |
87826df0 | 2761 | btrfs_put_ordered_extent(ordered); |
4a096752 CM |
2762 | goto again; |
2763 | } | |
247e743c | 2764 | |
65d87f79 | 2765 | ret = btrfs_set_extent_delalloc(inode, page_start, page_end, 0, |
330a5827 | 2766 | &cached_state); |
25f3c502 | 2767 | if (ret) |
53687007 | 2768 | goto out_reserved; |
f3038ee3 | 2769 | |
25f3c502 CM |
2770 | /* |
2771 | * Everything went as planned, we're now the owner of a dirty page with | |
2772 | * delayed allocation bits set and space reserved for our COW | |
2773 | * destination. | |
2774 | * | |
2775 | * The page was dirty when we started, nothing should have cleaned it. | |
2776 | */ | |
2777 | BUG_ON(!PageDirty(page)); | |
f4b1363c | 2778 | free_delalloc_space = false; |
53687007 | 2779 | out_reserved: |
65d87f79 | 2780 | btrfs_delalloc_release_extents(inode, PAGE_SIZE); |
f4b1363c | 2781 | if (free_delalloc_space) |
65d87f79 NB |
2782 | btrfs_delalloc_release_space(inode, data_reserved, page_start, |
2783 | PAGE_SIZE, true); | |
570eb97b | 2784 | unlock_extent(&inode->io_tree, page_start, page_end, &cached_state); |
247e743c | 2785 | out_page: |
25f3c502 CM |
2786 | if (ret) { |
2787 | /* | |
2788 | * We hit ENOSPC or other errors. Update the mapping and page | |
2789 | * to reflect the errors and clean the page. | |
2790 | */ | |
2791 | mapping_set_error(page->mapping, ret); | |
9783e4de CH |
2792 | btrfs_mark_ordered_io_finished(inode, page, page_start, |
2793 | PAGE_SIZE, !ret); | |
25f3c502 | 2794 | clear_page_dirty_for_io(page); |
25f3c502 | 2795 | } |
9783e4de | 2796 | btrfs_page_clear_checked(fs_info, page, page_start, PAGE_SIZE); |
247e743c | 2797 | unlock_page(page); |
09cbfeaf | 2798 | put_page(page); |
b897abec | 2799 | kfree(fixup); |
364ecf36 | 2800 | extent_changeset_free(data_reserved); |
f4b1363c JB |
2801 | /* |
2802 | * As a precaution, do a delayed iput in case it would be the last iput | |
2803 | * that could need flushing space. Recursing back to fixup worker would | |
2804 | * deadlock. | |
2805 | */ | |
e55cf7ca | 2806 | btrfs_add_delayed_iput(inode); |
247e743c CM |
2807 | } |
2808 | ||
2809 | /* | |
2810 | * There are a few paths in the higher layers of the kernel that directly | |
2811 | * set the page dirty bit without asking the filesystem if it is a | |
2812 | * good idea. This causes problems because we want to make sure COW | |
2813 | * properly happens and the data=ordered rules are followed. | |
2814 | * | |
c8b97818 | 2815 | * In our case any range that doesn't have the ORDERED bit set |
247e743c CM |
2816 | * hasn't been properly setup for IO. We kick off an async process |
2817 | * to fix it up. The async helper will wait for ordered extents, set | |
2818 | * the delalloc bit and make it safe to write the page. | |
2819 | */ | |
a129ffb8 | 2820 | int btrfs_writepage_cow_fixup(struct page *page) |
247e743c CM |
2821 | { |
2822 | struct inode *inode = page->mapping->host; | |
0b246afa | 2823 | struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); |
247e743c | 2824 | struct btrfs_writepage_fixup *fixup; |
247e743c | 2825 | |
f57ad937 QW |
2826 | /* This page has ordered extent covering it already */ |
2827 | if (PageOrdered(page)) | |
247e743c CM |
2828 | return 0; |
2829 | ||
25f3c502 CM |
2830 | /* |
2831 | * PageChecked is set below when we create a fixup worker for this page, | |
2832 | * don't try to create another one if we're already PageChecked() | |
2833 | * | |
2834 | * The extent_io writepage code will redirty the page if we send back | |
2835 | * EAGAIN. | |
2836 | */ | |
247e743c CM |
2837 | if (PageChecked(page)) |
2838 | return -EAGAIN; | |
2839 | ||
2840 | fixup = kzalloc(sizeof(*fixup), GFP_NOFS); | |
2841 | if (!fixup) | |
2842 | return -EAGAIN; | |
f421950f | 2843 | |
f4b1363c JB |
2844 | /* |
2845 | * We are already holding a reference to this inode from | |
2846 | * write_cache_pages. We need to hold it because the space reservation | |
2847 | * takes place outside of the page lock, and we can't trust | |
2848 | * page->mapping outside of the page lock. | |
2849 | */ | |
2850 | ihold(inode); | |
e4f94347 | 2851 | btrfs_page_set_checked(fs_info, page, page_offset(page), PAGE_SIZE); |
09cbfeaf | 2852 | get_page(page); |
078b8b90 | 2853 | btrfs_init_work(&fixup->work, btrfs_writepage_fixup_worker, NULL); |
247e743c | 2854 | fixup->page = page; |
36eeaef5 | 2855 | fixup->inode = BTRFS_I(inode); |
0b246afa | 2856 | btrfs_queue_work(fs_info->fixup_workers, &fixup->work); |
25f3c502 CM |
2857 | |
2858 | return -EAGAIN; | |
247e743c CM |
2859 | } |
2860 | ||
d899e052 | 2861 | static int insert_reserved_file_extent(struct btrfs_trans_handle *trans, |
c553f94d | 2862 | struct btrfs_inode *inode, u64 file_pos, |
9729f10a | 2863 | struct btrfs_file_extent_item *stack_fi, |
2766ff61 | 2864 | const bool update_inode_bytes, |
9729f10a | 2865 | u64 qgroup_reserved) |
d899e052 | 2866 | { |
c553f94d | 2867 | struct btrfs_root *root = inode->root; |
2766ff61 | 2868 | const u64 sectorsize = root->fs_info->sectorsize; |
d899e052 YZ |
2869 | struct btrfs_path *path; |
2870 | struct extent_buffer *leaf; | |
2871 | struct btrfs_key ins; | |
203f44c5 QW |
2872 | u64 disk_num_bytes = btrfs_stack_file_extent_disk_num_bytes(stack_fi); |
2873 | u64 disk_bytenr = btrfs_stack_file_extent_disk_bytenr(stack_fi); | |
cb36a9bb | 2874 | u64 offset = btrfs_stack_file_extent_offset(stack_fi); |
203f44c5 QW |
2875 | u64 num_bytes = btrfs_stack_file_extent_num_bytes(stack_fi); |
2876 | u64 ram_bytes = btrfs_stack_file_extent_ram_bytes(stack_fi); | |
5893dfb9 | 2877 | struct btrfs_drop_extents_args drop_args = { 0 }; |
d899e052 YZ |
2878 | int ret; |
2879 | ||
2880 | path = btrfs_alloc_path(); | |
d8926bb3 MF |
2881 | if (!path) |
2882 | return -ENOMEM; | |
d899e052 | 2883 | |
a1ed835e CM |
2884 | /* |
2885 | * we may be replacing one extent in the tree with another. | |
2886 | * The new extent is pinned in the extent map, and we don't want | |
2887 | * to drop it from the cache until it is completely in the btree. | |
2888 | * | |
2889 | * So, tell btrfs_drop_extents to leave this extent in the cache. | |
2890 | * the caller is expected to unpin it and allow it to be merged | |
2891 | * with the others. | |
2892 | */ | |
5893dfb9 FM |
2893 | drop_args.path = path; |
2894 | drop_args.start = file_pos; | |
2895 | drop_args.end = file_pos + num_bytes; | |
2896 | drop_args.replace_extent = true; | |
2897 | drop_args.extent_item_size = sizeof(*stack_fi); | |
2898 | ret = btrfs_drop_extents(trans, root, inode, &drop_args); | |
79787eaa JM |
2899 | if (ret) |
2900 | goto out; | |
d899e052 | 2901 | |
5893dfb9 | 2902 | if (!drop_args.extent_inserted) { |
c553f94d | 2903 | ins.objectid = btrfs_ino(inode); |
1acae57b FDBM |
2904 | ins.offset = file_pos; |
2905 | ins.type = BTRFS_EXTENT_DATA_KEY; | |
2906 | ||
1acae57b | 2907 | ret = btrfs_insert_empty_item(trans, root, path, &ins, |
203f44c5 | 2908 | sizeof(*stack_fi)); |
1acae57b FDBM |
2909 | if (ret) |
2910 | goto out; | |
2911 | } | |
d899e052 | 2912 | leaf = path->nodes[0]; |
203f44c5 QW |
2913 | btrfs_set_stack_file_extent_generation(stack_fi, trans->transid); |
2914 | write_extent_buffer(leaf, stack_fi, | |
2915 | btrfs_item_ptr_offset(leaf, path->slots[0]), | |
2916 | sizeof(struct btrfs_file_extent_item)); | |
b9473439 | 2917 | |
50564b65 | 2918 | btrfs_mark_buffer_dirty(trans, leaf); |
ce195332 | 2919 | btrfs_release_path(path); |
d899e052 | 2920 | |
2766ff61 FM |
2921 | /* |
2922 | * If we dropped an inline extent here, we know the range where it is | |
2923 | * was not marked with the EXTENT_DELALLOC_NEW bit, so we update the | |
1a9fd417 | 2924 | * number of bytes only for that range containing the inline extent. |
2766ff61 FM |
2925 | * The remaining of the range will be processed when clearning the |
2926 | * EXTENT_DELALLOC_BIT bit through the ordered extent completion. | |
2927 | */ | |
2928 | if (file_pos == 0 && !IS_ALIGNED(drop_args.bytes_found, sectorsize)) { | |
2929 | u64 inline_size = round_down(drop_args.bytes_found, sectorsize); | |
2930 | ||
2931 | inline_size = drop_args.bytes_found - inline_size; | |
2932 | btrfs_update_inode_bytes(inode, sectorsize, inline_size); | |
2933 | drop_args.bytes_found -= inline_size; | |
2934 | num_bytes -= sectorsize; | |
2935 | } | |
2936 | ||
2937 | if (update_inode_bytes) | |
2938 | btrfs_update_inode_bytes(inode, num_bytes, drop_args.bytes_found); | |
d899e052 YZ |
2939 | |
2940 | ins.objectid = disk_bytenr; | |
2941 | ins.offset = disk_num_bytes; | |
2942 | ins.type = BTRFS_EXTENT_ITEM_KEY; | |
a12b877b | 2943 | |
c553f94d | 2944 | ret = btrfs_inode_set_file_extent_range(inode, file_pos, ram_bytes); |
9ddc959e JB |
2945 | if (ret) |
2946 | goto out; | |
2947 | ||
c553f94d | 2948 | ret = btrfs_alloc_reserved_file_extent(trans, root, btrfs_ino(inode), |
cb36a9bb OS |
2949 | file_pos - offset, |
2950 | qgroup_reserved, &ins); | |
79787eaa | 2951 | out: |
d899e052 | 2952 | btrfs_free_path(path); |
b9473439 | 2953 | |
79787eaa | 2954 | return ret; |
d899e052 YZ |
2955 | } |
2956 | ||
2ff7e61e | 2957 | static void btrfs_release_delalloc_bytes(struct btrfs_fs_info *fs_info, |
e570fd27 MX |
2958 | u64 start, u64 len) |
2959 | { | |
32da5386 | 2960 | struct btrfs_block_group *cache; |
e570fd27 | 2961 | |
0b246afa | 2962 | cache = btrfs_lookup_block_group(fs_info, start); |
e570fd27 MX |
2963 | ASSERT(cache); |
2964 | ||
2965 | spin_lock(&cache->lock); | |
2966 | cache->delalloc_bytes -= len; | |
2967 | spin_unlock(&cache->lock); | |
2968 | ||
2969 | btrfs_put_block_group(cache); | |
2970 | } | |
2971 | ||
203f44c5 | 2972 | static int insert_ordered_extent_file_extent(struct btrfs_trans_handle *trans, |
203f44c5 QW |
2973 | struct btrfs_ordered_extent *oe) |
2974 | { | |
2975 | struct btrfs_file_extent_item stack_fi; | |
2766ff61 | 2976 | bool update_inode_bytes; |
cb36a9bb OS |
2977 | u64 num_bytes = oe->num_bytes; |
2978 | u64 ram_bytes = oe->ram_bytes; | |
203f44c5 QW |
2979 | |
2980 | memset(&stack_fi, 0, sizeof(stack_fi)); | |
2981 | btrfs_set_stack_file_extent_type(&stack_fi, BTRFS_FILE_EXTENT_REG); | |
2982 | btrfs_set_stack_file_extent_disk_bytenr(&stack_fi, oe->disk_bytenr); | |
2983 | btrfs_set_stack_file_extent_disk_num_bytes(&stack_fi, | |
2984 | oe->disk_num_bytes); | |
cb36a9bb | 2985 | btrfs_set_stack_file_extent_offset(&stack_fi, oe->offset); |
c1867eb3 DS |
2986 | if (test_bit(BTRFS_ORDERED_TRUNCATED, &oe->flags)) { |
2987 | num_bytes = oe->truncated_len; | |
2988 | ram_bytes = num_bytes; | |
2989 | } | |
cb36a9bb OS |
2990 | btrfs_set_stack_file_extent_num_bytes(&stack_fi, num_bytes); |
2991 | btrfs_set_stack_file_extent_ram_bytes(&stack_fi, ram_bytes); | |
203f44c5 QW |
2992 | btrfs_set_stack_file_extent_compression(&stack_fi, oe->compress_type); |
2993 | /* Encryption and other encoding is reserved and all 0 */ | |
2994 | ||
2766ff61 FM |
2995 | /* |
2996 | * For delalloc, when completing an ordered extent we update the inode's | |
2997 | * bytes when clearing the range in the inode's io tree, so pass false | |
2998 | * as the argument 'update_inode_bytes' to insert_reserved_file_extent(), | |
2999 | * except if the ordered extent was truncated. | |
3000 | */ | |
3001 | update_inode_bytes = test_bit(BTRFS_ORDERED_DIRECT, &oe->flags) || | |
7c0c7269 | 3002 | test_bit(BTRFS_ORDERED_ENCODED, &oe->flags) || |
2766ff61 FM |
3003 | test_bit(BTRFS_ORDERED_TRUNCATED, &oe->flags); |
3004 | ||
3c38c877 NB |
3005 | return insert_reserved_file_extent(trans, BTRFS_I(oe->inode), |
3006 | oe->file_offset, &stack_fi, | |
2766ff61 | 3007 | update_inode_bytes, oe->qgroup_rsv); |
203f44c5 QW |
3008 | } |
3009 | ||
3010 | /* | |
3011 | * As ordered data IO finishes, this gets called so we can finish | |
d352ac68 CM |
3012 | * an ordered extent if the range of bytes in the file it covers are |
3013 | * fully written. | |
3014 | */ | |
71df088c | 3015 | int btrfs_finish_one_ordered(struct btrfs_ordered_extent *ordered_extent) |
e6dcd2dc | 3016 | { |
72e7e6ed NB |
3017 | struct btrfs_inode *inode = BTRFS_I(ordered_extent->inode); |
3018 | struct btrfs_root *root = inode->root; | |
3019 | struct btrfs_fs_info *fs_info = root->fs_info; | |
0ca1f7ce | 3020 | struct btrfs_trans_handle *trans = NULL; |
72e7e6ed | 3021 | struct extent_io_tree *io_tree = &inode->io_tree; |
2ac55d41 | 3022 | struct extent_state *cached_state = NULL; |
bffe633e | 3023 | u64 start, end; |
261507a0 | 3024 | int compress_type = 0; |
77cef2ec | 3025 | int ret = 0; |
bffe633e | 3026 | u64 logical_len = ordered_extent->num_bytes; |
8d510121 | 3027 | bool freespace_inode; |
77cef2ec | 3028 | bool truncated = false; |
49940bdd | 3029 | bool clear_reserved_extent = true; |
2766ff61 | 3030 | unsigned int clear_bits = EXTENT_DEFRAG; |
a7e3b975 | 3031 | |
bffe633e OS |
3032 | start = ordered_extent->file_offset; |
3033 | end = start + ordered_extent->num_bytes - 1; | |
3034 | ||
a7e3b975 FM |
3035 | if (!test_bit(BTRFS_ORDERED_NOCOW, &ordered_extent->flags) && |
3036 | !test_bit(BTRFS_ORDERED_PREALLOC, &ordered_extent->flags) && | |
7c0c7269 OS |
3037 | !test_bit(BTRFS_ORDERED_DIRECT, &ordered_extent->flags) && |
3038 | !test_bit(BTRFS_ORDERED_ENCODED, &ordered_extent->flags)) | |
2766ff61 | 3039 | clear_bits |= EXTENT_DELALLOC_NEW; |
e6dcd2dc | 3040 | |
72e7e6ed | 3041 | freespace_inode = btrfs_is_free_space_inode(inode); |
5f4403e1 IA |
3042 | if (!freespace_inode) |
3043 | btrfs_lockdep_acquire(fs_info, btrfs_ordered_extent); | |
0cb59c99 | 3044 | |
5fd02043 JB |
3045 | if (test_bit(BTRFS_ORDERED_IOERR, &ordered_extent->flags)) { |
3046 | ret = -EIO; | |
3047 | goto out; | |
3048 | } | |
3049 | ||
71df088c | 3050 | if (btrfs_is_zoned(fs_info)) |
be1a1d7a NA |
3051 | btrfs_zone_finish_endio(fs_info, ordered_extent->disk_bytenr, |
3052 | ordered_extent->disk_num_bytes); | |
d8e3fb10 | 3053 | |
77cef2ec JB |
3054 | if (test_bit(BTRFS_ORDERED_TRUNCATED, &ordered_extent->flags)) { |
3055 | truncated = true; | |
3056 | logical_len = ordered_extent->truncated_len; | |
3057 | /* Truncated the entire extent, don't bother adding */ | |
3058 | if (!logical_len) | |
3059 | goto out; | |
3060 | } | |
3061 | ||
c2167754 | 3062 | if (test_bit(BTRFS_ORDERED_NOCOW, &ordered_extent->flags)) { |
79787eaa | 3063 | BUG_ON(!list_empty(&ordered_extent->list)); /* Logic error */ |
94ed938a | 3064 | |
72e7e6ed | 3065 | btrfs_inode_safe_disk_i_size_write(inode, 0); |
8d510121 NB |
3066 | if (freespace_inode) |
3067 | trans = btrfs_join_transaction_spacecache(root); | |
6c760c07 JB |
3068 | else |
3069 | trans = btrfs_join_transaction(root); | |
3070 | if (IS_ERR(trans)) { | |
3071 | ret = PTR_ERR(trans); | |
3072 | trans = NULL; | |
3073 | goto out; | |
c2167754 | 3074 | } |
72e7e6ed | 3075 | trans->block_rsv = &inode->block_rsv; |
0a5d0dc5 | 3076 | ret = btrfs_update_inode_fallback(trans, inode); |
6c760c07 | 3077 | if (ret) /* -ENOMEM or corruption */ |
66642832 | 3078 | btrfs_abort_transaction(trans, ret); |
c2167754 YZ |
3079 | goto out; |
3080 | } | |
e6dcd2dc | 3081 | |
2766ff61 | 3082 | clear_bits |= EXTENT_LOCKED; |
570eb97b | 3083 | lock_extent(io_tree, start, end, &cached_state); |
e6dcd2dc | 3084 | |
8d510121 NB |
3085 | if (freespace_inode) |
3086 | trans = btrfs_join_transaction_spacecache(root); | |
0cb59c99 | 3087 | else |
7a7eaa40 | 3088 | trans = btrfs_join_transaction(root); |
79787eaa JM |
3089 | if (IS_ERR(trans)) { |
3090 | ret = PTR_ERR(trans); | |
3091 | trans = NULL; | |
a7e3b975 | 3092 | goto out; |
79787eaa | 3093 | } |
a79b7d4b | 3094 | |
72e7e6ed | 3095 | trans->block_rsv = &inode->block_rsv; |
c2167754 | 3096 | |
02c372e1 JT |
3097 | ret = btrfs_insert_raid_extent(trans, ordered_extent); |
3098 | if (ret) | |
3099 | goto out; | |
3100 | ||
c8b97818 | 3101 | if (test_bit(BTRFS_ORDERED_COMPRESSED, &ordered_extent->flags)) |
261507a0 | 3102 | compress_type = ordered_extent->compress_type; |
d899e052 | 3103 | if (test_bit(BTRFS_ORDERED_PREALLOC, &ordered_extent->flags)) { |
261507a0 | 3104 | BUG_ON(compress_type); |
72e7e6ed | 3105 | ret = btrfs_mark_extent_written(trans, inode, |
d899e052 YZ |
3106 | ordered_extent->file_offset, |
3107 | ordered_extent->file_offset + | |
77cef2ec | 3108 | logical_len); |
343d8a30 NA |
3109 | btrfs_zoned_release_data_reloc_bg(fs_info, ordered_extent->disk_bytenr, |
3110 | ordered_extent->disk_num_bytes); | |
d899e052 | 3111 | } else { |
0b246afa | 3112 | BUG_ON(root == fs_info->tree_root); |
3c38c877 | 3113 | ret = insert_ordered_extent_file_extent(trans, ordered_extent); |
49940bdd JB |
3114 | if (!ret) { |
3115 | clear_reserved_extent = false; | |
2ff7e61e | 3116 | btrfs_release_delalloc_bytes(fs_info, |
bffe633e OS |
3117 | ordered_extent->disk_bytenr, |
3118 | ordered_extent->disk_num_bytes); | |
49940bdd | 3119 | } |
d899e052 | 3120 | } |
72e7e6ed | 3121 | unpin_extent_cache(&inode->extent_tree, ordered_extent->file_offset, |
bffe633e | 3122 | ordered_extent->num_bytes, trans->transid); |
79787eaa | 3123 | if (ret < 0) { |
66642832 | 3124 | btrfs_abort_transaction(trans, ret); |
a7e3b975 | 3125 | goto out; |
79787eaa | 3126 | } |
2ac55d41 | 3127 | |
510f85ed | 3128 | ret = add_pending_csums(trans, &ordered_extent->list); |
ac01f26a NB |
3129 | if (ret) { |
3130 | btrfs_abort_transaction(trans, ret); | |
3131 | goto out; | |
3132 | } | |
e6dcd2dc | 3133 | |
2766ff61 FM |
3134 | /* |
3135 | * If this is a new delalloc range, clear its new delalloc flag to | |
3136 | * update the inode's number of bytes. This needs to be done first | |
3137 | * before updating the inode item. | |
3138 | */ | |
3139 | if ((clear_bits & EXTENT_DELALLOC_NEW) && | |
3140 | !test_bit(BTRFS_ORDERED_TRUNCATED, &ordered_extent->flags)) | |
72e7e6ed | 3141 | clear_extent_bit(&inode->io_tree, start, end, |
2766ff61 | 3142 | EXTENT_DELALLOC_NEW | EXTENT_ADD_INODE_BYTES, |
bd015294 | 3143 | &cached_state); |
2766ff61 | 3144 | |
72e7e6ed | 3145 | btrfs_inode_safe_disk_i_size_write(inode, 0); |
0a5d0dc5 | 3146 | ret = btrfs_update_inode_fallback(trans, inode); |
6c760c07 | 3147 | if (ret) { /* -ENOMEM or corruption */ |
66642832 | 3148 | btrfs_abort_transaction(trans, ret); |
a7e3b975 | 3149 | goto out; |
1ef30be1 JB |
3150 | } |
3151 | ret = 0; | |
c2167754 | 3152 | out: |
bd015294 | 3153 | clear_extent_bit(&inode->io_tree, start, end, clear_bits, |
313facc5 | 3154 | &cached_state); |
a7e3b975 | 3155 | |
a698d075 | 3156 | if (trans) |
3a45bb20 | 3157 | btrfs_end_transaction(trans); |
0cb59c99 | 3158 | |
77cef2ec | 3159 | if (ret || truncated) { |
bffe633e | 3160 | u64 unwritten_start = start; |
77cef2ec | 3161 | |
d61bec08 JB |
3162 | /* |
3163 | * If we failed to finish this ordered extent for any reason we | |
3164 | * need to make sure BTRFS_ORDERED_IOERR is set on the ordered | |
3165 | * extent, and mark the inode with the error if it wasn't | |
3166 | * already set. Any error during writeback would have already | |
3167 | * set the mapping error, so we need to set it if we're the ones | |
3168 | * marking this ordered extent as failed. | |
3169 | */ | |
3170 | if (ret && !test_and_set_bit(BTRFS_ORDERED_IOERR, | |
3171 | &ordered_extent->flags)) | |
3172 | mapping_set_error(ordered_extent->inode->i_mapping, -EIO); | |
3173 | ||
77cef2ec | 3174 | if (truncated) |
bffe633e OS |
3175 | unwritten_start += logical_len; |
3176 | clear_extent_uptodate(io_tree, unwritten_start, end, NULL); | |
77cef2ec | 3177 | |
4c0c8cfc FM |
3178 | /* Drop extent maps for the part of the extent we didn't write. */ |
3179 | btrfs_drop_extent_map_range(inode, unwritten_start, end, false); | |
5fd02043 | 3180 | |
0bec9ef5 JB |
3181 | /* |
3182 | * If the ordered extent had an IOERR or something else went | |
3183 | * wrong we need to return the space for this ordered extent | |
77cef2ec JB |
3184 | * back to the allocator. We only free the extent in the |
3185 | * truncated case if we didn't write out the extent at all. | |
49940bdd JB |
3186 | * |
3187 | * If we made it past insert_reserved_file_extent before we | |
3188 | * errored out then we don't need to do this as the accounting | |
3189 | * has already been done. | |
0bec9ef5 | 3190 | */ |
77cef2ec | 3191 | if ((ret || !logical_len) && |
49940bdd | 3192 | clear_reserved_extent && |
77cef2ec | 3193 | !test_bit(BTRFS_ORDERED_NOCOW, &ordered_extent->flags) && |
4eaaec24 NB |
3194 | !test_bit(BTRFS_ORDERED_PREALLOC, &ordered_extent->flags)) { |
3195 | /* | |
3196 | * Discard the range before returning it back to the | |
3197 | * free space pool | |
3198 | */ | |
46b27f50 | 3199 | if (ret && btrfs_test_opt(fs_info, DISCARD_SYNC)) |
4eaaec24 | 3200 | btrfs_discard_extent(fs_info, |
bffe633e OS |
3201 | ordered_extent->disk_bytenr, |
3202 | ordered_extent->disk_num_bytes, | |
3203 | NULL); | |
2ff7e61e | 3204 | btrfs_free_reserved_extent(fs_info, |
bffe633e OS |
3205 | ordered_extent->disk_bytenr, |
3206 | ordered_extent->disk_num_bytes, 1); | |
e28b0211 BB |
3207 | /* |
3208 | * Actually free the qgroup rsv which was released when | |
3209 | * the ordered extent was created. | |
3210 | */ | |
3211 | btrfs_qgroup_free_refroot(fs_info, inode->root->root_key.objectid, | |
3212 | ordered_extent->qgroup_rsv, | |
3213 | BTRFS_QGROUP_RSV_DATA); | |
4eaaec24 | 3214 | } |
0bec9ef5 JB |
3215 | } |
3216 | ||
5fd02043 | 3217 | /* |
8bad3c02 LB |
3218 | * This needs to be done to make sure anybody waiting knows we are done |
3219 | * updating everything for this ordered extent. | |
5fd02043 | 3220 | */ |
72e7e6ed | 3221 | btrfs_remove_ordered_extent(inode, ordered_extent); |
5fd02043 | 3222 | |
e6dcd2dc CM |
3223 | /* once for us */ |
3224 | btrfs_put_ordered_extent(ordered_extent); | |
3225 | /* once for the tree */ | |
3226 | btrfs_put_ordered_extent(ordered_extent); | |
3227 | ||
5fd02043 JB |
3228 | return ret; |
3229 | } | |
3230 | ||
71df088c CH |
3231 | int btrfs_finish_ordered_io(struct btrfs_ordered_extent *ordered) |
3232 | { | |
3233 | if (btrfs_is_zoned(btrfs_sb(ordered->inode->i_sb)) && | |
02c372e1 JT |
3234 | !test_bit(BTRFS_ORDERED_IOERR, &ordered->flags) && |
3235 | list_empty(&ordered->bioc_list)) | |
71df088c CH |
3236 | btrfs_finish_ordered_zoned(ordered); |
3237 | return btrfs_finish_one_ordered(ordered); | |
3238 | } | |
3239 | ||
ae643a74 QW |
3240 | /* |
3241 | * Verify the checksum for a single sector without any extra action that depend | |
3242 | * on the type of I/O. | |
3243 | */ | |
3244 | int btrfs_check_sector_csum(struct btrfs_fs_info *fs_info, struct page *page, | |
3245 | u32 pgoff, u8 *csum, const u8 * const csum_expected) | |
3246 | { | |
3247 | SHASH_DESC_ON_STACK(shash, fs_info->csum_shash); | |
3248 | char *kaddr; | |
3249 | ||
3250 | ASSERT(pgoff + fs_info->sectorsize <= PAGE_SIZE); | |
3251 | ||
3252 | shash->tfm = fs_info->csum_shash; | |
3253 | ||
3254 | kaddr = kmap_local_page(page) + pgoff; | |
3255 | crypto_shash_digest(shash, kaddr, fs_info->sectorsize, csum); | |
3256 | kunmap_local(kaddr); | |
3257 | ||
3258 | if (memcmp(csum, csum_expected, fs_info->csum_size)) | |
3259 | return -EIO; | |
3260 | return 0; | |
211f90e6 CM |
3261 | } |
3262 | ||
265d4ac0 | 3263 | /* |
e5219044 CH |
3264 | * Verify the checksum of a single data sector. |
3265 | * | |
3266 | * @bbio: btrfs_io_bio which contains the csum | |
3267 | * @dev: device the sector is on | |
7ffd27e3 | 3268 | * @bio_offset: offset to the beginning of the bio (in bytes) |
e5219044 | 3269 | * @bv: bio_vec to check |
265d4ac0 | 3270 | * |
e5219044 CH |
3271 | * Check if the checksum on a data block is valid. When a checksum mismatch is |
3272 | * detected, report the error and fill the corrupted range with zero. | |
ae643a74 | 3273 | * |
e5219044 | 3274 | * Return %true if the sector is ok or had no checksum to start with, else %false. |
265d4ac0 | 3275 | */ |
e5219044 CH |
3276 | bool btrfs_data_csum_ok(struct btrfs_bio *bbio, struct btrfs_device *dev, |
3277 | u32 bio_offset, struct bio_vec *bv) | |
dc380aea | 3278 | { |
e5219044 | 3279 | struct btrfs_inode *inode = bbio->inode; |
621af94a | 3280 | struct btrfs_fs_info *fs_info = inode->root->fs_info; |
e5219044 CH |
3281 | u64 file_offset = bbio->file_offset + bio_offset; |
3282 | u64 end = file_offset + bv->bv_len - 1; | |
d5178578 JT |
3283 | u8 *csum_expected; |
3284 | u8 csum[BTRFS_CSUM_SIZE]; | |
dc380aea | 3285 | |
3d49d0d3 | 3286 | ASSERT(bv->bv_len == fs_info->sectorsize); |
265d4ac0 | 3287 | |
e5219044 CH |
3288 | if (!bbio->csum) |
3289 | return true; | |
d5178578 | 3290 | |
e5219044 CH |
3291 | if (btrfs_is_data_reloc_root(inode->root) && |
3292 | test_range_bit(&inode->io_tree, file_offset, end, EXTENT_NODATASUM, | |
893fe243 | 3293 | NULL)) { |
e5219044 CH |
3294 | /* Skip the range without csum for data reloc inode */ |
3295 | clear_extent_bits(&inode->io_tree, file_offset, end, | |
3296 | EXTENT_NODATASUM); | |
3297 | return true; | |
3298 | } | |
3299 | ||
fa13661c JT |
3300 | csum_expected = bbio->csum + (bio_offset >> fs_info->sectorsize_bits) * |
3301 | fs_info->csum_size; | |
3d49d0d3 CH |
3302 | if (btrfs_check_sector_csum(fs_info, bv->bv_page, bv->bv_offset, csum, |
3303 | csum_expected)) | |
dc380aea | 3304 | goto zeroit; |
e5219044 | 3305 | return true; |
ae643a74 | 3306 | |
dc380aea | 3307 | zeroit: |
3d49d0d3 CH |
3308 | btrfs_print_data_csum_error(inode, file_offset, csum, csum_expected, |
3309 | bbio->mirror_num); | |
3310 | if (dev) | |
3311 | btrfs_dev_stat_inc_and_print(dev, BTRFS_DEV_STAT_CORRUPTION_ERRS); | |
3312 | memzero_bvec(bv); | |
3313 | return false; | |
07157aac | 3314 | } |
b888db2b | 3315 | |
c1c3fac2 | 3316 | /* |
9580503b | 3317 | * Perform a delayed iput on @inode. |
c1c3fac2 NB |
3318 | * |
3319 | * @inode: The inode we want to perform iput on | |
3320 | * | |
3321 | * This function uses the generic vfs_inode::i_count to track whether we should | |
3322 | * just decrement it (in case it's > 1) or if this is the last iput then link | |
3323 | * the inode to the delayed iput machinery. Delayed iputs are processed at | |
3324 | * transaction commit time/superblock commit/cleaner kthread. | |
3325 | */ | |
e55cf7ca | 3326 | void btrfs_add_delayed_iput(struct btrfs_inode *inode) |
24bbcf04 | 3327 | { |
e55cf7ca | 3328 | struct btrfs_fs_info *fs_info = inode->root->fs_info; |
866e98a4 | 3329 | unsigned long flags; |
24bbcf04 | 3330 | |
e55cf7ca | 3331 | if (atomic_add_unless(&inode->vfs_inode.i_count, -1, 1)) |
24bbcf04 YZ |
3332 | return; |
3333 | ||
034f784d | 3334 | atomic_inc(&fs_info->nr_delayed_iputs); |
866e98a4 FM |
3335 | /* |
3336 | * Need to be irq safe here because we can be called from either an irq | |
3337 | * context (see bio.c and btrfs_put_ordered_extent()) or a non-irq | |
3338 | * context. | |
3339 | */ | |
3340 | spin_lock_irqsave(&fs_info->delayed_iput_lock, flags); | |
e55cf7ca DS |
3341 | ASSERT(list_empty(&inode->delayed_iput)); |
3342 | list_add_tail(&inode->delayed_iput, &fs_info->delayed_iputs); | |
866e98a4 | 3343 | spin_unlock_irqrestore(&fs_info->delayed_iput_lock, flags); |
fd340d0f JB |
3344 | if (!test_bit(BTRFS_FS_CLEANER_RUNNING, &fs_info->flags)) |
3345 | wake_up_process(fs_info->cleaner_kthread); | |
24bbcf04 YZ |
3346 | } |
3347 | ||
63611e73 JB |
3348 | static void run_delayed_iput_locked(struct btrfs_fs_info *fs_info, |
3349 | struct btrfs_inode *inode) | |
3350 | { | |
3351 | list_del_init(&inode->delayed_iput); | |
866e98a4 | 3352 | spin_unlock_irq(&fs_info->delayed_iput_lock); |
63611e73 JB |
3353 | iput(&inode->vfs_inode); |
3354 | if (atomic_dec_and_test(&fs_info->nr_delayed_iputs)) | |
3355 | wake_up(&fs_info->delayed_iputs_wait); | |
866e98a4 | 3356 | spin_lock_irq(&fs_info->delayed_iput_lock); |
63611e73 JB |
3357 | } |
3358 | ||
3359 | static void btrfs_run_delayed_iput(struct btrfs_fs_info *fs_info, | |
3360 | struct btrfs_inode *inode) | |
3361 | { | |
3362 | if (!list_empty(&inode->delayed_iput)) { | |
866e98a4 | 3363 | spin_lock_irq(&fs_info->delayed_iput_lock); |
63611e73 JB |
3364 | if (!list_empty(&inode->delayed_iput)) |
3365 | run_delayed_iput_locked(fs_info, inode); | |
866e98a4 | 3366 | spin_unlock_irq(&fs_info->delayed_iput_lock); |
63611e73 JB |
3367 | } |
3368 | } | |
3369 | ||
2ff7e61e | 3370 | void btrfs_run_delayed_iputs(struct btrfs_fs_info *fs_info) |
24bbcf04 | 3371 | { |
866e98a4 FM |
3372 | /* |
3373 | * btrfs_put_ordered_extent() can run in irq context (see bio.c), which | |
3374 | * calls btrfs_add_delayed_iput() and that needs to lock | |
3375 | * fs_info->delayed_iput_lock. So we need to disable irqs here to | |
3376 | * prevent a deadlock. | |
3377 | */ | |
3378 | spin_lock_irq(&fs_info->delayed_iput_lock); | |
8089fe62 DS |
3379 | while (!list_empty(&fs_info->delayed_iputs)) { |
3380 | struct btrfs_inode *inode; | |
3381 | ||
3382 | inode = list_first_entry(&fs_info->delayed_iputs, | |
3383 | struct btrfs_inode, delayed_iput); | |
63611e73 | 3384 | run_delayed_iput_locked(fs_info, inode); |
866e98a4 FM |
3385 | if (need_resched()) { |
3386 | spin_unlock_irq(&fs_info->delayed_iput_lock); | |
3387 | cond_resched(); | |
3388 | spin_lock_irq(&fs_info->delayed_iput_lock); | |
3389 | } | |
24bbcf04 | 3390 | } |
866e98a4 | 3391 | spin_unlock_irq(&fs_info->delayed_iput_lock); |
24bbcf04 YZ |
3392 | } |
3393 | ||
e43eec81 | 3394 | /* |
2639631d NB |
3395 | * Wait for flushing all delayed iputs |
3396 | * | |
3397 | * @fs_info: the filesystem | |
034f784d JB |
3398 | * |
3399 | * This will wait on any delayed iputs that are currently running with KILLABLE | |
3400 | * set. Once they are all done running we will return, unless we are killed in | |
3401 | * which case we return EINTR. This helps in user operations like fallocate etc | |
3402 | * that might get blocked on the iputs. | |
2639631d NB |
3403 | * |
3404 | * Return EINTR if we were killed, 0 if nothing's pending | |
034f784d JB |
3405 | */ |
3406 | int btrfs_wait_on_delayed_iputs(struct btrfs_fs_info *fs_info) | |
3407 | { | |
3408 | int ret = wait_event_killable(fs_info->delayed_iputs_wait, | |
3409 | atomic_read(&fs_info->nr_delayed_iputs) == 0); | |
3410 | if (ret) | |
3411 | return -EINTR; | |
3412 | return 0; | |
3413 | } | |
3414 | ||
7b128766 | 3415 | /* |
f7e9e8fc OS |
3416 | * This creates an orphan entry for the given inode in case something goes wrong |
3417 | * in the middle of an unlink. | |
7b128766 | 3418 | */ |
73f2e545 | 3419 | int btrfs_orphan_add(struct btrfs_trans_handle *trans, |
27919067 | 3420 | struct btrfs_inode *inode) |
7b128766 | 3421 | { |
d68fc57b | 3422 | int ret; |
7b128766 | 3423 | |
27919067 OS |
3424 | ret = btrfs_insert_orphan_item(trans, inode->root, btrfs_ino(inode)); |
3425 | if (ret && ret != -EEXIST) { | |
3426 | btrfs_abort_transaction(trans, ret); | |
3427 | return ret; | |
d68fc57b YZ |
3428 | } |
3429 | ||
d68fc57b | 3430 | return 0; |
7b128766 JB |
3431 | } |
3432 | ||
3433 | /* | |
f7e9e8fc OS |
3434 | * We have done the delete so we can go ahead and remove the orphan item for |
3435 | * this particular inode. | |
7b128766 | 3436 | */ |
48a3b636 | 3437 | static int btrfs_orphan_del(struct btrfs_trans_handle *trans, |
3d6ae7bb | 3438 | struct btrfs_inode *inode) |
7b128766 | 3439 | { |
27919067 | 3440 | return btrfs_del_orphan_item(trans, inode->root, btrfs_ino(inode)); |
7b128766 JB |
3441 | } |
3442 | ||
3443 | /* | |
3444 | * this cleans up any orphans that may be left on the list from the last use | |
3445 | * of this root. | |
3446 | */ | |
66b4ffd1 | 3447 | int btrfs_orphan_cleanup(struct btrfs_root *root) |
7b128766 | 3448 | { |
0b246afa | 3449 | struct btrfs_fs_info *fs_info = root->fs_info; |
7b128766 JB |
3450 | struct btrfs_path *path; |
3451 | struct extent_buffer *leaf; | |
7b128766 JB |
3452 | struct btrfs_key key, found_key; |
3453 | struct btrfs_trans_handle *trans; | |
3454 | struct inode *inode; | |
8f6d7f4f | 3455 | u64 last_objectid = 0; |
f7e9e8fc | 3456 | int ret = 0, nr_unlink = 0; |
7b128766 | 3457 | |
54230013 | 3458 | if (test_and_set_bit(BTRFS_ROOT_ORPHAN_CLEANUP, &root->state)) |
66b4ffd1 | 3459 | return 0; |
c71bf099 YZ |
3460 | |
3461 | path = btrfs_alloc_path(); | |
66b4ffd1 JB |
3462 | if (!path) { |
3463 | ret = -ENOMEM; | |
3464 | goto out; | |
3465 | } | |
e4058b54 | 3466 | path->reada = READA_BACK; |
7b128766 JB |
3467 | |
3468 | key.objectid = BTRFS_ORPHAN_OBJECTID; | |
962a298f | 3469 | key.type = BTRFS_ORPHAN_ITEM_KEY; |
7b128766 JB |
3470 | key.offset = (u64)-1; |
3471 | ||
7b128766 JB |
3472 | while (1) { |
3473 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); | |
66b4ffd1 JB |
3474 | if (ret < 0) |
3475 | goto out; | |
7b128766 JB |
3476 | |
3477 | /* | |
3478 | * if ret == 0 means we found what we were searching for, which | |
25985edc | 3479 | * is weird, but possible, so only screw with path if we didn't |
7b128766 JB |
3480 | * find the key and see if we have stuff that matches |
3481 | */ | |
3482 | if (ret > 0) { | |
66b4ffd1 | 3483 | ret = 0; |
7b128766 JB |
3484 | if (path->slots[0] == 0) |
3485 | break; | |
3486 | path->slots[0]--; | |
3487 | } | |
3488 | ||
3489 | /* pull out the item */ | |
3490 | leaf = path->nodes[0]; | |
7b128766 JB |
3491 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); |
3492 | ||
3493 | /* make sure the item matches what we want */ | |
3494 | if (found_key.objectid != BTRFS_ORPHAN_OBJECTID) | |
3495 | break; | |
962a298f | 3496 | if (found_key.type != BTRFS_ORPHAN_ITEM_KEY) |
7b128766 JB |
3497 | break; |
3498 | ||
3499 | /* release the path since we're done with it */ | |
b3b4aa74 | 3500 | btrfs_release_path(path); |
7b128766 JB |
3501 | |
3502 | /* | |
3503 | * this is where we are basically btrfs_lookup, without the | |
3504 | * crossing root thing. we store the inode number in the | |
3505 | * offset of the orphan item. | |
3506 | */ | |
8f6d7f4f JB |
3507 | |
3508 | if (found_key.offset == last_objectid) { | |
a7f8de50 FM |
3509 | /* |
3510 | * We found the same inode as before. This means we were | |
3511 | * not able to remove its items via eviction triggered | |
3512 | * by an iput(). A transaction abort may have happened, | |
3513 | * due to -ENOSPC for example, so try to grab the error | |
3514 | * that lead to a transaction abort, if any. | |
3515 | */ | |
0b246afa JM |
3516 | btrfs_err(fs_info, |
3517 | "Error removing orphan entry, stopping orphan cleanup"); | |
a7f8de50 | 3518 | ret = BTRFS_FS_ERROR(fs_info) ?: -EINVAL; |
8f6d7f4f JB |
3519 | goto out; |
3520 | } | |
3521 | ||
3522 | last_objectid = found_key.offset; | |
3523 | ||
5d4f98a2 YZ |
3524 | found_key.objectid = found_key.offset; |
3525 | found_key.type = BTRFS_INODE_ITEM_KEY; | |
3526 | found_key.offset = 0; | |
0202e83f | 3527 | inode = btrfs_iget(fs_info->sb, last_objectid, root); |
cbaee87f FM |
3528 | if (IS_ERR(inode)) { |
3529 | ret = PTR_ERR(inode); | |
3530 | inode = NULL; | |
3531 | if (ret != -ENOENT) | |
3532 | goto out; | |
3533 | } | |
7b128766 | 3534 | |
cbaee87f | 3535 | if (!inode && root == fs_info->tree_root) { |
f8e9e0b0 | 3536 | struct btrfs_root *dead_root; |
f8e9e0b0 AJ |
3537 | int is_dead_root = 0; |
3538 | ||
3539 | /* | |
0c0218e9 | 3540 | * This is an orphan in the tree root. Currently these |
f8e9e0b0 | 3541 | * could come from 2 sources: |
0c0218e9 | 3542 | * a) a root (snapshot/subvolume) deletion in progress |
f8e9e0b0 | 3543 | * b) a free space cache inode |
0c0218e9 FM |
3544 | * We need to distinguish those two, as the orphan item |
3545 | * for a root must not get deleted before the deletion | |
3546 | * of the snapshot/subvolume's tree completes. | |
3547 | * | |
3548 | * btrfs_find_orphan_roots() ran before us, which has | |
3549 | * found all deleted roots and loaded them into | |
fc7cbcd4 | 3550 | * fs_info->fs_roots_radix. So here we can find if an |
0c0218e9 | 3551 | * orphan item corresponds to a deleted root by looking |
fc7cbcd4 | 3552 | * up the root from that radix tree. |
f8e9e0b0 | 3553 | */ |
a619b3c7 | 3554 | |
fc7cbcd4 DS |
3555 | spin_lock(&fs_info->fs_roots_radix_lock); |
3556 | dead_root = radix_tree_lookup(&fs_info->fs_roots_radix, | |
3557 | (unsigned long)found_key.objectid); | |
a619b3c7 RK |
3558 | if (dead_root && btrfs_root_refs(&dead_root->root_item) == 0) |
3559 | is_dead_root = 1; | |
fc7cbcd4 | 3560 | spin_unlock(&fs_info->fs_roots_radix_lock); |
a619b3c7 | 3561 | |
f8e9e0b0 AJ |
3562 | if (is_dead_root) { |
3563 | /* prevent this orphan from being found again */ | |
3564 | key.offset = found_key.objectid - 1; | |
3565 | continue; | |
3566 | } | |
f7e9e8fc | 3567 | |
f8e9e0b0 | 3568 | } |
f7e9e8fc | 3569 | |
7b128766 | 3570 | /* |
f7e9e8fc | 3571 | * If we have an inode with links, there are a couple of |
70524253 BB |
3572 | * possibilities: |
3573 | * | |
3574 | * 1. We were halfway through creating fsverity metadata for the | |
3575 | * file. In that case, the orphan item represents incomplete | |
3576 | * fsverity metadata which must be cleaned up with | |
3577 | * btrfs_drop_verity_items and deleting the orphan item. | |
3578 | ||
3579 | * 2. Old kernels (before v3.12) used to create an | |
f7e9e8fc OS |
3580 | * orphan item for truncate indicating that there were possibly |
3581 | * extent items past i_size that needed to be deleted. In v3.12, | |
3582 | * truncate was changed to update i_size in sync with the extent | |
3583 | * items, but the (useless) orphan item was still created. Since | |
3584 | * v4.18, we don't create the orphan item for truncate at all. | |
3585 | * | |
3586 | * So, this item could mean that we need to do a truncate, but | |
3587 | * only if this filesystem was last used on a pre-v3.12 kernel | |
3588 | * and was not cleanly unmounted. The odds of that are quite | |
3589 | * slim, and it's a pain to do the truncate now, so just delete | |
3590 | * the orphan item. | |
3591 | * | |
3592 | * It's also possible that this orphan item was supposed to be | |
3593 | * deleted but wasn't. The inode number may have been reused, | |
3594 | * but either way, we can delete the orphan item. | |
7b128766 | 3595 | */ |
cbaee87f FM |
3596 | if (!inode || inode->i_nlink) { |
3597 | if (inode) { | |
70524253 | 3598 | ret = btrfs_drop_verity_items(BTRFS_I(inode)); |
f7e9e8fc | 3599 | iput(inode); |
b777d279 | 3600 | inode = NULL; |
70524253 BB |
3601 | if (ret) |
3602 | goto out; | |
3603 | } | |
a8c9e576 | 3604 | trans = btrfs_start_transaction(root, 1); |
66b4ffd1 JB |
3605 | if (IS_ERR(trans)) { |
3606 | ret = PTR_ERR(trans); | |
3607 | goto out; | |
3608 | } | |
0b246afa JM |
3609 | btrfs_debug(fs_info, "auto deleting %Lu", |
3610 | found_key.objectid); | |
a8c9e576 JB |
3611 | ret = btrfs_del_orphan_item(trans, root, |
3612 | found_key.objectid); | |
3a45bb20 | 3613 | btrfs_end_transaction(trans); |
cbaee87f | 3614 | if (ret) |
4ef31a45 | 3615 | goto out; |
7b128766 JB |
3616 | continue; |
3617 | } | |
3618 | ||
f7e9e8fc | 3619 | nr_unlink++; |
7b128766 JB |
3620 | |
3621 | /* this will do delete_inode and everything for us */ | |
3622 | iput(inode); | |
3623 | } | |
3254c876 MX |
3624 | /* release the path since we're done with it */ |
3625 | btrfs_release_path(path); | |
3626 | ||
a575ceeb | 3627 | if (test_bit(BTRFS_ROOT_ORPHAN_ITEM_INSERTED, &root->state)) { |
7a7eaa40 | 3628 | trans = btrfs_join_transaction(root); |
66b4ffd1 | 3629 | if (!IS_ERR(trans)) |
3a45bb20 | 3630 | btrfs_end_transaction(trans); |
d68fc57b | 3631 | } |
7b128766 JB |
3632 | |
3633 | if (nr_unlink) | |
0b246afa | 3634 | btrfs_debug(fs_info, "unlinked %d orphans", nr_unlink); |
66b4ffd1 JB |
3635 | |
3636 | out: | |
3637 | if (ret) | |
0b246afa | 3638 | btrfs_err(fs_info, "could not do orphan cleanup %d", ret); |
66b4ffd1 JB |
3639 | btrfs_free_path(path); |
3640 | return ret; | |
7b128766 JB |
3641 | } |
3642 | ||
46a53cca CM |
3643 | /* |
3644 | * very simple check to peek ahead in the leaf looking for xattrs. If we | |
3645 | * don't find any xattrs, we know there can't be any acls. | |
3646 | * | |
3647 | * slot is the slot the inode is in, objectid is the objectid of the inode | |
3648 | */ | |
3649 | static noinline int acls_after_inode_item(struct extent_buffer *leaf, | |
63541927 FDBM |
3650 | int slot, u64 objectid, |
3651 | int *first_xattr_slot) | |
46a53cca CM |
3652 | { |
3653 | u32 nritems = btrfs_header_nritems(leaf); | |
3654 | struct btrfs_key found_key; | |
f23b5a59 JB |
3655 | static u64 xattr_access = 0; |
3656 | static u64 xattr_default = 0; | |
46a53cca CM |
3657 | int scanned = 0; |
3658 | ||
f23b5a59 | 3659 | if (!xattr_access) { |
97d79299 AG |
3660 | xattr_access = btrfs_name_hash(XATTR_NAME_POSIX_ACL_ACCESS, |
3661 | strlen(XATTR_NAME_POSIX_ACL_ACCESS)); | |
3662 | xattr_default = btrfs_name_hash(XATTR_NAME_POSIX_ACL_DEFAULT, | |
3663 | strlen(XATTR_NAME_POSIX_ACL_DEFAULT)); | |
f23b5a59 JB |
3664 | } |
3665 | ||
46a53cca | 3666 | slot++; |
63541927 | 3667 | *first_xattr_slot = -1; |
46a53cca CM |
3668 | while (slot < nritems) { |
3669 | btrfs_item_key_to_cpu(leaf, &found_key, slot); | |
3670 | ||
3671 | /* we found a different objectid, there must not be acls */ | |
3672 | if (found_key.objectid != objectid) | |
3673 | return 0; | |
3674 | ||
3675 | /* we found an xattr, assume we've got an acl */ | |
f23b5a59 | 3676 | if (found_key.type == BTRFS_XATTR_ITEM_KEY) { |
63541927 FDBM |
3677 | if (*first_xattr_slot == -1) |
3678 | *first_xattr_slot = slot; | |
f23b5a59 JB |
3679 | if (found_key.offset == xattr_access || |
3680 | found_key.offset == xattr_default) | |
3681 | return 1; | |
3682 | } | |
46a53cca CM |
3683 | |
3684 | /* | |
3685 | * we found a key greater than an xattr key, there can't | |
3686 | * be any acls later on | |
3687 | */ | |
3688 | if (found_key.type > BTRFS_XATTR_ITEM_KEY) | |
3689 | return 0; | |
3690 | ||
3691 | slot++; | |
3692 | scanned++; | |
3693 | ||
3694 | /* | |
3695 | * it goes inode, inode backrefs, xattrs, extents, | |
3696 | * so if there are a ton of hard links to an inode there can | |
3697 | * be a lot of backrefs. Don't waste time searching too hard, | |
3698 | * this is just an optimization | |
3699 | */ | |
3700 | if (scanned >= 8) | |
3701 | break; | |
3702 | } | |
3703 | /* we hit the end of the leaf before we found an xattr or | |
3704 | * something larger than an xattr. We have to assume the inode | |
3705 | * has acls | |
3706 | */ | |
63541927 FDBM |
3707 | if (*first_xattr_slot == -1) |
3708 | *first_xattr_slot = slot; | |
46a53cca CM |
3709 | return 1; |
3710 | } | |
3711 | ||
d352ac68 CM |
3712 | /* |
3713 | * read an inode from the btree into the in-memory inode | |
3714 | */ | |
4222ea71 FM |
3715 | static int btrfs_read_locked_inode(struct inode *inode, |
3716 | struct btrfs_path *in_path) | |
39279cc3 | 3717 | { |
0b246afa | 3718 | struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); |
4222ea71 | 3719 | struct btrfs_path *path = in_path; |
5f39d397 | 3720 | struct extent_buffer *leaf; |
39279cc3 CM |
3721 | struct btrfs_inode_item *inode_item; |
3722 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
3723 | struct btrfs_key location; | |
67de1176 | 3724 | unsigned long ptr; |
46a53cca | 3725 | int maybe_acls; |
618e21d5 | 3726 | u32 rdev; |
39279cc3 | 3727 | int ret; |
2f7e33d4 | 3728 | bool filled = false; |
63541927 | 3729 | int first_xattr_slot; |
2f7e33d4 MX |
3730 | |
3731 | ret = btrfs_fill_inode(inode, &rdev); | |
3732 | if (!ret) | |
3733 | filled = true; | |
39279cc3 | 3734 | |
4222ea71 FM |
3735 | if (!path) { |
3736 | path = btrfs_alloc_path(); | |
3737 | if (!path) | |
3738 | return -ENOMEM; | |
3739 | } | |
1748f843 | 3740 | |
39279cc3 | 3741 | memcpy(&location, &BTRFS_I(inode)->location, sizeof(location)); |
dc17ff8f | 3742 | |
39279cc3 | 3743 | ret = btrfs_lookup_inode(NULL, root, path, &location, 0); |
67710892 | 3744 | if (ret) { |
4222ea71 FM |
3745 | if (path != in_path) |
3746 | btrfs_free_path(path); | |
f5b3a417 | 3747 | return ret; |
67710892 | 3748 | } |
39279cc3 | 3749 | |
5f39d397 | 3750 | leaf = path->nodes[0]; |
2f7e33d4 MX |
3751 | |
3752 | if (filled) | |
67de1176 | 3753 | goto cache_index; |
2f7e33d4 | 3754 | |
5f39d397 CM |
3755 | inode_item = btrfs_item_ptr(leaf, path->slots[0], |
3756 | struct btrfs_inode_item); | |
5f39d397 | 3757 | inode->i_mode = btrfs_inode_mode(leaf, inode_item); |
bfe86848 | 3758 | set_nlink(inode, btrfs_inode_nlink(leaf, inode_item)); |
2f2f43d3 EB |
3759 | i_uid_write(inode, btrfs_inode_uid(leaf, inode_item)); |
3760 | i_gid_write(inode, btrfs_inode_gid(leaf, inode_item)); | |
6ef06d27 | 3761 | btrfs_i_size_write(BTRFS_I(inode), btrfs_inode_size(leaf, inode_item)); |
41a2ee75 JB |
3762 | btrfs_inode_set_file_extent_range(BTRFS_I(inode), 0, |
3763 | round_up(i_size_read(inode), fs_info->sectorsize)); | |
5f39d397 | 3764 | |
a937b979 DS |
3765 | inode->i_atime.tv_sec = btrfs_timespec_sec(leaf, &inode_item->atime); |
3766 | inode->i_atime.tv_nsec = btrfs_timespec_nsec(leaf, &inode_item->atime); | |
5f39d397 | 3767 | |
a937b979 DS |
3768 | inode->i_mtime.tv_sec = btrfs_timespec_sec(leaf, &inode_item->mtime); |
3769 | inode->i_mtime.tv_nsec = btrfs_timespec_nsec(leaf, &inode_item->mtime); | |
5f39d397 | 3770 | |
2a9462de JL |
3771 | inode_set_ctime(inode, btrfs_timespec_sec(leaf, &inode_item->ctime), |
3772 | btrfs_timespec_nsec(leaf, &inode_item->ctime)); | |
5f39d397 | 3773 | |
9cc97d64 | 3774 | BTRFS_I(inode)->i_otime.tv_sec = |
3775 | btrfs_timespec_sec(leaf, &inode_item->otime); | |
3776 | BTRFS_I(inode)->i_otime.tv_nsec = | |
3777 | btrfs_timespec_nsec(leaf, &inode_item->otime); | |
5f39d397 | 3778 | |
a76a3cd4 | 3779 | inode_set_bytes(inode, btrfs_inode_nbytes(leaf, inode_item)); |
e02119d5 | 3780 | BTRFS_I(inode)->generation = btrfs_inode_generation(leaf, inode_item); |
5dc562c5 JB |
3781 | BTRFS_I(inode)->last_trans = btrfs_inode_transid(leaf, inode_item); |
3782 | ||
c7f88c4e JL |
3783 | inode_set_iversion_queried(inode, |
3784 | btrfs_inode_sequence(leaf, inode_item)); | |
6e17d30b YD |
3785 | inode->i_generation = BTRFS_I(inode)->generation; |
3786 | inode->i_rdev = 0; | |
3787 | rdev = btrfs_inode_rdev(leaf, inode_item); | |
3788 | ||
3789 | BTRFS_I(inode)->index_cnt = (u64)-1; | |
77eea05e BB |
3790 | btrfs_inode_split_flags(btrfs_inode_flags(leaf, inode_item), |
3791 | &BTRFS_I(inode)->flags, &BTRFS_I(inode)->ro_flags); | |
6e17d30b YD |
3792 | |
3793 | cache_index: | |
5dc562c5 JB |
3794 | /* |
3795 | * If we were modified in the current generation and evicted from memory | |
3796 | * and then re-read we need to do a full sync since we don't have any | |
3797 | * idea about which extents were modified before we were evicted from | |
3798 | * cache. | |
6e17d30b YD |
3799 | * |
3800 | * This is required for both inode re-read from disk and delayed inode | |
088aea3b | 3801 | * in delayed_nodes_tree. |
5dc562c5 | 3802 | */ |
4a4f8fe2 | 3803 | if (BTRFS_I(inode)->last_trans == btrfs_get_fs_generation(fs_info)) |
5dc562c5 JB |
3804 | set_bit(BTRFS_INODE_NEEDS_FULL_SYNC, |
3805 | &BTRFS_I(inode)->runtime_flags); | |
3806 | ||
bde6c242 FM |
3807 | /* |
3808 | * We don't persist the id of the transaction where an unlink operation | |
3809 | * against the inode was last made. So here we assume the inode might | |
3810 | * have been evicted, and therefore the exact value of last_unlink_trans | |
3811 | * lost, and set it to last_trans to avoid metadata inconsistencies | |
3812 | * between the inode and its parent if the inode is fsync'ed and the log | |
3813 | * replayed. For example, in the scenario: | |
3814 | * | |
3815 | * touch mydir/foo | |
3816 | * ln mydir/foo mydir/bar | |
3817 | * sync | |
3818 | * unlink mydir/bar | |
3819 | * echo 2 > /proc/sys/vm/drop_caches # evicts inode | |
3820 | * xfs_io -c fsync mydir/foo | |
3821 | * <power failure> | |
3822 | * mount fs, triggers fsync log replay | |
3823 | * | |
3824 | * We must make sure that when we fsync our inode foo we also log its | |
3825 | * parent inode, otherwise after log replay the parent still has the | |
3826 | * dentry with the "bar" name but our inode foo has a link count of 1 | |
3827 | * and doesn't have an inode ref with the name "bar" anymore. | |
3828 | * | |
3829 | * Setting last_unlink_trans to last_trans is a pessimistic approach, | |
01327610 | 3830 | * but it guarantees correctness at the expense of occasional full |
bde6c242 FM |
3831 | * transaction commits on fsync if our inode is a directory, or if our |
3832 | * inode is not a directory, logging its parent unnecessarily. | |
3833 | */ | |
3834 | BTRFS_I(inode)->last_unlink_trans = BTRFS_I(inode)->last_trans; | |
3835 | ||
3ebac17c FM |
3836 | /* |
3837 | * Same logic as for last_unlink_trans. We don't persist the generation | |
3838 | * of the last transaction where this inode was used for a reflink | |
3839 | * operation, so after eviction and reloading the inode we must be | |
3840 | * pessimistic and assume the last transaction that modified the inode. | |
3841 | */ | |
3842 | BTRFS_I(inode)->last_reflink_trans = BTRFS_I(inode)->last_trans; | |
3843 | ||
67de1176 MX |
3844 | path->slots[0]++; |
3845 | if (inode->i_nlink != 1 || | |
3846 | path->slots[0] >= btrfs_header_nritems(leaf)) | |
3847 | goto cache_acl; | |
3848 | ||
3849 | btrfs_item_key_to_cpu(leaf, &location, path->slots[0]); | |
4a0cc7ca | 3850 | if (location.objectid != btrfs_ino(BTRFS_I(inode))) |
67de1176 MX |
3851 | goto cache_acl; |
3852 | ||
3853 | ptr = btrfs_item_ptr_offset(leaf, path->slots[0]); | |
3854 | if (location.type == BTRFS_INODE_REF_KEY) { | |
3855 | struct btrfs_inode_ref *ref; | |
3856 | ||
3857 | ref = (struct btrfs_inode_ref *)ptr; | |
3858 | BTRFS_I(inode)->dir_index = btrfs_inode_ref_index(leaf, ref); | |
3859 | } else if (location.type == BTRFS_INODE_EXTREF_KEY) { | |
3860 | struct btrfs_inode_extref *extref; | |
3861 | ||
3862 | extref = (struct btrfs_inode_extref *)ptr; | |
3863 | BTRFS_I(inode)->dir_index = btrfs_inode_extref_index(leaf, | |
3864 | extref); | |
3865 | } | |
2f7e33d4 | 3866 | cache_acl: |
46a53cca CM |
3867 | /* |
3868 | * try to precache a NULL acl entry for files that don't have | |
3869 | * any xattrs or acls | |
3870 | */ | |
33345d01 | 3871 | maybe_acls = acls_after_inode_item(leaf, path->slots[0], |
f85b7379 | 3872 | btrfs_ino(BTRFS_I(inode)), &first_xattr_slot); |
63541927 FDBM |
3873 | if (first_xattr_slot != -1) { |
3874 | path->slots[0] = first_xattr_slot; | |
3875 | ret = btrfs_load_inode_props(inode, path); | |
3876 | if (ret) | |
0b246afa | 3877 | btrfs_err(fs_info, |
351fd353 | 3878 | "error loading props for ino %llu (root %llu): %d", |
4a0cc7ca | 3879 | btrfs_ino(BTRFS_I(inode)), |
63541927 FDBM |
3880 | root->root_key.objectid, ret); |
3881 | } | |
4222ea71 FM |
3882 | if (path != in_path) |
3883 | btrfs_free_path(path); | |
63541927 | 3884 | |
72c04902 AV |
3885 | if (!maybe_acls) |
3886 | cache_no_acl(inode); | |
46a53cca | 3887 | |
39279cc3 | 3888 | switch (inode->i_mode & S_IFMT) { |
39279cc3 CM |
3889 | case S_IFREG: |
3890 | inode->i_mapping->a_ops = &btrfs_aops; | |
3891 | inode->i_fop = &btrfs_file_operations; | |
3892 | inode->i_op = &btrfs_file_inode_operations; | |
3893 | break; | |
3894 | case S_IFDIR: | |
3895 | inode->i_fop = &btrfs_dir_file_operations; | |
67ade058 | 3896 | inode->i_op = &btrfs_dir_inode_operations; |
39279cc3 CM |
3897 | break; |
3898 | case S_IFLNK: | |
3899 | inode->i_op = &btrfs_symlink_inode_operations; | |
21fc61c7 | 3900 | inode_nohighmem(inode); |
4779cc04 | 3901 | inode->i_mapping->a_ops = &btrfs_aops; |
39279cc3 | 3902 | break; |
618e21d5 | 3903 | default: |
0279b4cd | 3904 | inode->i_op = &btrfs_special_inode_operations; |
618e21d5 JB |
3905 | init_special_inode(inode, inode->i_mode, rdev); |
3906 | break; | |
39279cc3 | 3907 | } |
6cbff00f | 3908 | |
7b6a221e | 3909 | btrfs_sync_inode_flags_to_i_flags(inode); |
67710892 | 3910 | return 0; |
39279cc3 CM |
3911 | } |
3912 | ||
d352ac68 CM |
3913 | /* |
3914 | * given a leaf and an inode, copy the inode fields into the leaf | |
3915 | */ | |
e02119d5 CM |
3916 | static void fill_inode_item(struct btrfs_trans_handle *trans, |
3917 | struct extent_buffer *leaf, | |
5f39d397 | 3918 | struct btrfs_inode_item *item, |
39279cc3 CM |
3919 | struct inode *inode) |
3920 | { | |
51fab693 | 3921 | struct btrfs_map_token token; |
77eea05e | 3922 | u64 flags; |
51fab693 | 3923 | |
c82f823c | 3924 | btrfs_init_map_token(&token, leaf); |
5f39d397 | 3925 | |
cc4c13d5 DS |
3926 | btrfs_set_token_inode_uid(&token, item, i_uid_read(inode)); |
3927 | btrfs_set_token_inode_gid(&token, item, i_gid_read(inode)); | |
3928 | btrfs_set_token_inode_size(&token, item, BTRFS_I(inode)->disk_i_size); | |
3929 | btrfs_set_token_inode_mode(&token, item, inode->i_mode); | |
3930 | btrfs_set_token_inode_nlink(&token, item, inode->i_nlink); | |
3931 | ||
3932 | btrfs_set_token_timespec_sec(&token, &item->atime, | |
3933 | inode->i_atime.tv_sec); | |
3934 | btrfs_set_token_timespec_nsec(&token, &item->atime, | |
3935 | inode->i_atime.tv_nsec); | |
3936 | ||
3937 | btrfs_set_token_timespec_sec(&token, &item->mtime, | |
3938 | inode->i_mtime.tv_sec); | |
3939 | btrfs_set_token_timespec_nsec(&token, &item->mtime, | |
3940 | inode->i_mtime.tv_nsec); | |
3941 | ||
3942 | btrfs_set_token_timespec_sec(&token, &item->ctime, | |
2a9462de | 3943 | inode_get_ctime(inode).tv_sec); |
cc4c13d5 | 3944 | btrfs_set_token_timespec_nsec(&token, &item->ctime, |
2a9462de | 3945 | inode_get_ctime(inode).tv_nsec); |
cc4c13d5 DS |
3946 | |
3947 | btrfs_set_token_timespec_sec(&token, &item->otime, | |
3948 | BTRFS_I(inode)->i_otime.tv_sec); | |
3949 | btrfs_set_token_timespec_nsec(&token, &item->otime, | |
3950 | BTRFS_I(inode)->i_otime.tv_nsec); | |
3951 | ||
3952 | btrfs_set_token_inode_nbytes(&token, item, inode_get_bytes(inode)); | |
3953 | btrfs_set_token_inode_generation(&token, item, | |
3954 | BTRFS_I(inode)->generation); | |
3955 | btrfs_set_token_inode_sequence(&token, item, inode_peek_iversion(inode)); | |
3956 | btrfs_set_token_inode_transid(&token, item, trans->transid); | |
3957 | btrfs_set_token_inode_rdev(&token, item, inode->i_rdev); | |
77eea05e BB |
3958 | flags = btrfs_inode_combine_flags(BTRFS_I(inode)->flags, |
3959 | BTRFS_I(inode)->ro_flags); | |
3960 | btrfs_set_token_inode_flags(&token, item, flags); | |
cc4c13d5 | 3961 | btrfs_set_token_inode_block_group(&token, item, 0); |
39279cc3 CM |
3962 | } |
3963 | ||
d352ac68 CM |
3964 | /* |
3965 | * copy everything in the in-memory inode into the btree. | |
3966 | */ | |
2115133f | 3967 | static noinline int btrfs_update_inode_item(struct btrfs_trans_handle *trans, |
07a274a8 | 3968 | struct btrfs_inode *inode) |
39279cc3 CM |
3969 | { |
3970 | struct btrfs_inode_item *inode_item; | |
3971 | struct btrfs_path *path; | |
5f39d397 | 3972 | struct extent_buffer *leaf; |
39279cc3 CM |
3973 | int ret; |
3974 | ||
3975 | path = btrfs_alloc_path(); | |
16cdcec7 MX |
3976 | if (!path) |
3977 | return -ENOMEM; | |
3978 | ||
07a274a8 | 3979 | ret = btrfs_lookup_inode(trans, inode->root, path, &inode->location, 1); |
39279cc3 CM |
3980 | if (ret) { |
3981 | if (ret > 0) | |
3982 | ret = -ENOENT; | |
3983 | goto failed; | |
3984 | } | |
3985 | ||
5f39d397 CM |
3986 | leaf = path->nodes[0]; |
3987 | inode_item = btrfs_item_ptr(leaf, path->slots[0], | |
16cdcec7 | 3988 | struct btrfs_inode_item); |
39279cc3 | 3989 | |
dfeb9e7c | 3990 | fill_inode_item(trans, leaf, inode_item, &inode->vfs_inode); |
50564b65 | 3991 | btrfs_mark_buffer_dirty(trans, leaf); |
dfeb9e7c | 3992 | btrfs_set_inode_last_trans(trans, inode); |
39279cc3 CM |
3993 | ret = 0; |
3994 | failed: | |
39279cc3 CM |
3995 | btrfs_free_path(path); |
3996 | return ret; | |
3997 | } | |
3998 | ||
2115133f CM |
3999 | /* |
4000 | * copy everything in the in-memory inode into the btree. | |
4001 | */ | |
cddaaacc | 4002 | int btrfs_update_inode(struct btrfs_trans_handle *trans, |
cddaaacc | 4003 | struct btrfs_inode *inode) |
2115133f | 4004 | { |
8b9d0322 | 4005 | struct btrfs_root *root = inode->root; |
0b246afa | 4006 | struct btrfs_fs_info *fs_info = root->fs_info; |
2115133f CM |
4007 | int ret; |
4008 | ||
4009 | /* | |
4010 | * If the inode is a free space inode, we can deadlock during commit | |
4011 | * if we put it into the delayed code. | |
4012 | * | |
4013 | * The data relocation inode should also be directly updated | |
4014 | * without delay | |
4015 | */ | |
9a56fcd1 | 4016 | if (!btrfs_is_free_space_inode(inode) |
37f00a6d | 4017 | && !btrfs_is_data_reloc_root(root) |
0b246afa | 4018 | && !test_bit(BTRFS_FS_LOG_RECOVERING, &fs_info->flags)) { |
8ea05e3a AB |
4019 | btrfs_update_root_times(trans, root); |
4020 | ||
04bd8e94 | 4021 | ret = btrfs_delayed_update_inode(trans, inode); |
2115133f | 4022 | if (!ret) |
9a56fcd1 | 4023 | btrfs_set_inode_last_trans(trans, inode); |
2115133f CM |
4024 | return ret; |
4025 | } | |
4026 | ||
07a274a8 | 4027 | return btrfs_update_inode_item(trans, inode); |
2115133f CM |
4028 | } |
4029 | ||
729f7961 | 4030 | int btrfs_update_inode_fallback(struct btrfs_trans_handle *trans, |
0a5d0dc5 | 4031 | struct btrfs_inode *inode) |
2115133f CM |
4032 | { |
4033 | int ret; | |
4034 | ||
8b9d0322 | 4035 | ret = btrfs_update_inode(trans, inode); |
2115133f | 4036 | if (ret == -ENOSPC) |
07a274a8 | 4037 | return btrfs_update_inode_item(trans, inode); |
2115133f CM |
4038 | return ret; |
4039 | } | |
4040 | ||
d352ac68 CM |
4041 | /* |
4042 | * unlink helper that gets used here in inode.c and in the tree logging | |
4043 | * recovery code. It remove a link in a directory with a given name, and | |
4044 | * also drops the back refs in the inode to the directory | |
4045 | */ | |
92986796 | 4046 | static int __btrfs_unlink_inode(struct btrfs_trans_handle *trans, |
4ec5934e NB |
4047 | struct btrfs_inode *dir, |
4048 | struct btrfs_inode *inode, | |
6db75318 | 4049 | const struct fscrypt_str *name, |
88d2beec | 4050 | struct btrfs_rename_ctx *rename_ctx) |
39279cc3 | 4051 | { |
4467af88 | 4052 | struct btrfs_root *root = dir->root; |
0b246afa | 4053 | struct btrfs_fs_info *fs_info = root->fs_info; |
39279cc3 | 4054 | struct btrfs_path *path; |
39279cc3 | 4055 | int ret = 0; |
39279cc3 | 4056 | struct btrfs_dir_item *di; |
aec7477b | 4057 | u64 index; |
33345d01 LZ |
4058 | u64 ino = btrfs_ino(inode); |
4059 | u64 dir_ino = btrfs_ino(dir); | |
39279cc3 CM |
4060 | |
4061 | path = btrfs_alloc_path(); | |
54aa1f4d CM |
4062 | if (!path) { |
4063 | ret = -ENOMEM; | |
554233a6 | 4064 | goto out; |
54aa1f4d CM |
4065 | } |
4066 | ||
e43eec81 | 4067 | di = btrfs_lookup_dir_item(trans, root, path, dir_ino, name, -1); |
3cf5068f LB |
4068 | if (IS_ERR_OR_NULL(di)) { |
4069 | ret = di ? PTR_ERR(di) : -ENOENT; | |
39279cc3 CM |
4070 | goto err; |
4071 | } | |
39279cc3 | 4072 | ret = btrfs_delete_one_dir_name(trans, root, path, di); |
54aa1f4d CM |
4073 | if (ret) |
4074 | goto err; | |
b3b4aa74 | 4075 | btrfs_release_path(path); |
39279cc3 | 4076 | |
67de1176 MX |
4077 | /* |
4078 | * If we don't have dir index, we have to get it by looking up | |
4079 | * the inode ref, since we get the inode ref, remove it directly, | |
4080 | * it is unnecessary to do delayed deletion. | |
4081 | * | |
4082 | * But if we have dir index, needn't search inode ref to get it. | |
4083 | * Since the inode ref is close to the inode item, it is better | |
4084 | * that we delay to delete it, and just do this deletion when | |
4085 | * we update the inode item. | |
4086 | */ | |
4ec5934e | 4087 | if (inode->dir_index) { |
67de1176 MX |
4088 | ret = btrfs_delayed_delete_inode_ref(inode); |
4089 | if (!ret) { | |
4ec5934e | 4090 | index = inode->dir_index; |
67de1176 MX |
4091 | goto skip_backref; |
4092 | } | |
4093 | } | |
4094 | ||
e43eec81 | 4095 | ret = btrfs_del_inode_ref(trans, root, name, ino, dir_ino, &index); |
aec7477b | 4096 | if (ret) { |
0b246afa | 4097 | btrfs_info(fs_info, |
c2cf52eb | 4098 | "failed to delete reference to %.*s, inode %llu parent %llu", |
e43eec81 | 4099 | name->len, name->name, ino, dir_ino); |
66642832 | 4100 | btrfs_abort_transaction(trans, ret); |
aec7477b JB |
4101 | goto err; |
4102 | } | |
67de1176 | 4103 | skip_backref: |
88d2beec FM |
4104 | if (rename_ctx) |
4105 | rename_ctx->index = index; | |
4106 | ||
9add2945 | 4107 | ret = btrfs_delete_delayed_dir_index(trans, dir, index); |
79787eaa | 4108 | if (ret) { |
66642832 | 4109 | btrfs_abort_transaction(trans, ret); |
39279cc3 | 4110 | goto err; |
79787eaa | 4111 | } |
39279cc3 | 4112 | |
259c4b96 FM |
4113 | /* |
4114 | * If we are in a rename context, we don't need to update anything in the | |
4115 | * log. That will be done later during the rename by btrfs_log_new_name(). | |
143823cf | 4116 | * Besides that, doing it here would only cause extra unnecessary btree |
259c4b96 FM |
4117 | * operations on the log tree, increasing latency for applications. |
4118 | */ | |
4119 | if (!rename_ctx) { | |
e43eec81 STD |
4120 | btrfs_del_inode_ref_in_log(trans, root, name, inode, dir_ino); |
4121 | btrfs_del_dir_entries_in_log(trans, root, name, dir, index); | |
259c4b96 | 4122 | } |
63611e73 JB |
4123 | |
4124 | /* | |
4125 | * If we have a pending delayed iput we could end up with the final iput | |
4126 | * being run in btrfs-cleaner context. If we have enough of these built | |
4127 | * up we can end up burning a lot of time in btrfs-cleaner without any | |
4128 | * way to throttle the unlinks. Since we're currently holding a ref on | |
4129 | * the inode we can run the delayed iput here without any issues as the | |
4130 | * final iput won't be done until after we drop the ref we're currently | |
4131 | * holding. | |
4132 | */ | |
4133 | btrfs_run_delayed_iput(fs_info, inode); | |
39279cc3 CM |
4134 | err: |
4135 | btrfs_free_path(path); | |
e02119d5 CM |
4136 | if (ret) |
4137 | goto out; | |
4138 | ||
e43eec81 | 4139 | btrfs_i_size_write(dir, dir->vfs_inode.i_size - name->len * 2); |
4ec5934e NB |
4140 | inode_inc_iversion(&inode->vfs_inode); |
4141 | inode_inc_iversion(&dir->vfs_inode); | |
2a9462de JL |
4142 | inode_set_ctime_current(&inode->vfs_inode); |
4143 | dir->vfs_inode.i_mtime = inode_set_ctime_current(&dir->vfs_inode); | |
8b9d0322 | 4144 | ret = btrfs_update_inode(trans, dir); |
e02119d5 | 4145 | out: |
39279cc3 CM |
4146 | return ret; |
4147 | } | |
4148 | ||
92986796 | 4149 | int btrfs_unlink_inode(struct btrfs_trans_handle *trans, |
4ec5934e | 4150 | struct btrfs_inode *dir, struct btrfs_inode *inode, |
6db75318 | 4151 | const struct fscrypt_str *name) |
92986796 AV |
4152 | { |
4153 | int ret; | |
e43eec81 STD |
4154 | |
4155 | ret = __btrfs_unlink_inode(trans, dir, inode, name, NULL); | |
92986796 | 4156 | if (!ret) { |
4ec5934e | 4157 | drop_nlink(&inode->vfs_inode); |
8b9d0322 | 4158 | ret = btrfs_update_inode(trans, inode); |
92986796 AV |
4159 | } |
4160 | return ret; | |
4161 | } | |
39279cc3 | 4162 | |
a22285a6 YZ |
4163 | /* |
4164 | * helper to start transaction for unlink and rmdir. | |
4165 | * | |
d52be818 JB |
4166 | * unlink and rmdir are special in btrfs, they do not always free space, so |
4167 | * if we cannot make our reservations the normal way try and see if there is | |
4168 | * plenty of slack room in the global reserve to migrate, otherwise we cannot | |
4169 | * allow the unlink to occur. | |
a22285a6 | 4170 | */ |
e569b1d5 | 4171 | static struct btrfs_trans_handle *__unlink_start_trans(struct btrfs_inode *dir) |
4df27c4d | 4172 | { |
e569b1d5 | 4173 | struct btrfs_root *root = dir->root; |
4df27c4d | 4174 | |
5630e2bc FM |
4175 | return btrfs_start_transaction_fallback_global_rsv(root, |
4176 | BTRFS_UNLINK_METADATA_UNITS); | |
a22285a6 YZ |
4177 | } |
4178 | ||
4179 | static int btrfs_unlink(struct inode *dir, struct dentry *dentry) | |
4180 | { | |
a22285a6 | 4181 | struct btrfs_trans_handle *trans; |
2b0143b5 | 4182 | struct inode *inode = d_inode(dentry); |
a22285a6 | 4183 | int ret; |
ab3c5c18 | 4184 | struct fscrypt_name fname; |
a22285a6 | 4185 | |
ab3c5c18 STD |
4186 | ret = fscrypt_setup_filename(dir, &dentry->d_name, 1, &fname); |
4187 | if (ret) | |
4188 | return ret; | |
ab3c5c18 STD |
4189 | |
4190 | /* This needs to handle no-key deletions later on */ | |
a22285a6 | 4191 | |
e569b1d5 | 4192 | trans = __unlink_start_trans(BTRFS_I(dir)); |
ab3c5c18 STD |
4193 | if (IS_ERR(trans)) { |
4194 | ret = PTR_ERR(trans); | |
4195 | goto fscrypt_free; | |
4196 | } | |
5f39d397 | 4197 | |
4ec5934e | 4198 | btrfs_record_unlink_dir(trans, BTRFS_I(dir), BTRFS_I(d_inode(dentry)), |
59fcf388 | 4199 | false); |
12fcfd22 | 4200 | |
e43eec81 | 4201 | ret = btrfs_unlink_inode(trans, BTRFS_I(dir), BTRFS_I(d_inode(dentry)), |
6db75318 | 4202 | &fname.disk_name); |
b532402e | 4203 | if (ret) |
ab3c5c18 | 4204 | goto end_trans; |
7b128766 | 4205 | |
a22285a6 | 4206 | if (inode->i_nlink == 0) { |
73f2e545 | 4207 | ret = btrfs_orphan_add(trans, BTRFS_I(inode)); |
b532402e | 4208 | if (ret) |
ab3c5c18 | 4209 | goto end_trans; |
a22285a6 | 4210 | } |
7b128766 | 4211 | |
ab3c5c18 | 4212 | end_trans: |
3a45bb20 | 4213 | btrfs_end_transaction(trans); |
4467af88 | 4214 | btrfs_btree_balance_dirty(BTRFS_I(dir)->root->fs_info); |
ab3c5c18 STD |
4215 | fscrypt_free: |
4216 | fscrypt_free_filename(&fname); | |
39279cc3 CM |
4217 | return ret; |
4218 | } | |
4219 | ||
f60a2364 | 4220 | static int btrfs_unlink_subvol(struct btrfs_trans_handle *trans, |
5b7544cb | 4221 | struct btrfs_inode *dir, struct dentry *dentry) |
4df27c4d | 4222 | { |
5b7544cb | 4223 | struct btrfs_root *root = dir->root; |
045d3967 | 4224 | struct btrfs_inode *inode = BTRFS_I(d_inode(dentry)); |
4df27c4d YZ |
4225 | struct btrfs_path *path; |
4226 | struct extent_buffer *leaf; | |
4227 | struct btrfs_dir_item *di; | |
4228 | struct btrfs_key key; | |
4229 | u64 index; | |
4230 | int ret; | |
045d3967 | 4231 | u64 objectid; |
5b7544cb | 4232 | u64 dir_ino = btrfs_ino(dir); |
ab3c5c18 STD |
4233 | struct fscrypt_name fname; |
4234 | ||
5b7544cb | 4235 | ret = fscrypt_setup_filename(&dir->vfs_inode, &dentry->d_name, 1, &fname); |
ab3c5c18 STD |
4236 | if (ret) |
4237 | return ret; | |
ab3c5c18 STD |
4238 | |
4239 | /* This needs to handle no-key deletions later on */ | |
4df27c4d | 4240 | |
045d3967 JB |
4241 | if (btrfs_ino(inode) == BTRFS_FIRST_FREE_OBJECTID) { |
4242 | objectid = inode->root->root_key.objectid; | |
4243 | } else if (btrfs_ino(inode) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID) { | |
4244 | objectid = inode->location.objectid; | |
4245 | } else { | |
4246 | WARN_ON(1); | |
ab3c5c18 | 4247 | fscrypt_free_filename(&fname); |
045d3967 JB |
4248 | return -EINVAL; |
4249 | } | |
4250 | ||
4df27c4d | 4251 | path = btrfs_alloc_path(); |
ab3c5c18 STD |
4252 | if (!path) { |
4253 | ret = -ENOMEM; | |
4254 | goto out; | |
4255 | } | |
4df27c4d | 4256 | |
33345d01 | 4257 | di = btrfs_lookup_dir_item(trans, root, path, dir_ino, |
6db75318 | 4258 | &fname.disk_name, -1); |
79787eaa | 4259 | if (IS_ERR_OR_NULL(di)) { |
3cf5068f | 4260 | ret = di ? PTR_ERR(di) : -ENOENT; |
79787eaa JM |
4261 | goto out; |
4262 | } | |
4df27c4d YZ |
4263 | |
4264 | leaf = path->nodes[0]; | |
4265 | btrfs_dir_item_key_to_cpu(leaf, di, &key); | |
4266 | WARN_ON(key.type != BTRFS_ROOT_ITEM_KEY || key.objectid != objectid); | |
4267 | ret = btrfs_delete_one_dir_name(trans, root, path, di); | |
79787eaa | 4268 | if (ret) { |
66642832 | 4269 | btrfs_abort_transaction(trans, ret); |
79787eaa JM |
4270 | goto out; |
4271 | } | |
b3b4aa74 | 4272 | btrfs_release_path(path); |
4df27c4d | 4273 | |
d49d3287 JB |
4274 | /* |
4275 | * This is a placeholder inode for a subvolume we didn't have a | |
4276 | * reference to at the time of the snapshot creation. In the meantime | |
4277 | * we could have renamed the real subvol link into our snapshot, so | |
1a9fd417 | 4278 | * depending on btrfs_del_root_ref to return -ENOENT here is incorrect. |
d49d3287 JB |
4279 | * Instead simply lookup the dir_index_item for this entry so we can |
4280 | * remove it. Otherwise we know we have a ref to the root and we can | |
4281 | * call btrfs_del_root_ref, and it _shouldn't_ fail. | |
4282 | */ | |
4283 | if (btrfs_ino(inode) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID) { | |
6db75318 | 4284 | di = btrfs_search_dir_index_item(root, path, dir_ino, &fname.disk_name); |
79787eaa JM |
4285 | if (IS_ERR_OR_NULL(di)) { |
4286 | if (!di) | |
4287 | ret = -ENOENT; | |
4288 | else | |
4289 | ret = PTR_ERR(di); | |
66642832 | 4290 | btrfs_abort_transaction(trans, ret); |
79787eaa JM |
4291 | goto out; |
4292 | } | |
4df27c4d YZ |
4293 | |
4294 | leaf = path->nodes[0]; | |
4295 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
4df27c4d | 4296 | index = key.offset; |
d49d3287 JB |
4297 | btrfs_release_path(path); |
4298 | } else { | |
4299 | ret = btrfs_del_root_ref(trans, objectid, | |
4300 | root->root_key.objectid, dir_ino, | |
6db75318 | 4301 | &index, &fname.disk_name); |
d49d3287 JB |
4302 | if (ret) { |
4303 | btrfs_abort_transaction(trans, ret); | |
4304 | goto out; | |
4305 | } | |
4df27c4d YZ |
4306 | } |
4307 | ||
5b7544cb | 4308 | ret = btrfs_delete_delayed_dir_index(trans, dir, index); |
79787eaa | 4309 | if (ret) { |
66642832 | 4310 | btrfs_abort_transaction(trans, ret); |
79787eaa JM |
4311 | goto out; |
4312 | } | |
4df27c4d | 4313 | |
5b7544cb DS |
4314 | btrfs_i_size_write(dir, dir->vfs_inode.i_size - fname.disk_name.len * 2); |
4315 | inode_inc_iversion(&dir->vfs_inode); | |
2a9462de | 4316 | dir->vfs_inode.i_mtime = inode_set_ctime_current(&dir->vfs_inode); |
0a5d0dc5 | 4317 | ret = btrfs_update_inode_fallback(trans, dir); |
79787eaa | 4318 | if (ret) |
66642832 | 4319 | btrfs_abort_transaction(trans, ret); |
79787eaa | 4320 | out: |
71d7aed0 | 4321 | btrfs_free_path(path); |
ab3c5c18 | 4322 | fscrypt_free_filename(&fname); |
79787eaa | 4323 | return ret; |
4df27c4d YZ |
4324 | } |
4325 | ||
ec42f167 MT |
4326 | /* |
4327 | * Helper to check if the subvolume references other subvolumes or if it's | |
4328 | * default. | |
4329 | */ | |
f60a2364 | 4330 | static noinline int may_destroy_subvol(struct btrfs_root *root) |
ec42f167 MT |
4331 | { |
4332 | struct btrfs_fs_info *fs_info = root->fs_info; | |
4333 | struct btrfs_path *path; | |
4334 | struct btrfs_dir_item *di; | |
4335 | struct btrfs_key key; | |
6db75318 | 4336 | struct fscrypt_str name = FSTR_INIT("default", 7); |
ec42f167 MT |
4337 | u64 dir_id; |
4338 | int ret; | |
4339 | ||
4340 | path = btrfs_alloc_path(); | |
4341 | if (!path) | |
4342 | return -ENOMEM; | |
4343 | ||
4344 | /* Make sure this root isn't set as the default subvol */ | |
4345 | dir_id = btrfs_super_root_dir(fs_info->super_copy); | |
4346 | di = btrfs_lookup_dir_item(NULL, fs_info->tree_root, path, | |
e43eec81 | 4347 | dir_id, &name, 0); |
ec42f167 MT |
4348 | if (di && !IS_ERR(di)) { |
4349 | btrfs_dir_item_key_to_cpu(path->nodes[0], di, &key); | |
4350 | if (key.objectid == root->root_key.objectid) { | |
4351 | ret = -EPERM; | |
4352 | btrfs_err(fs_info, | |
4353 | "deleting default subvolume %llu is not allowed", | |
4354 | key.objectid); | |
4355 | goto out; | |
4356 | } | |
4357 | btrfs_release_path(path); | |
4358 | } | |
4359 | ||
4360 | key.objectid = root->root_key.objectid; | |
4361 | key.type = BTRFS_ROOT_REF_KEY; | |
4362 | key.offset = (u64)-1; | |
4363 | ||
4364 | ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, path, 0, 0); | |
4365 | if (ret < 0) | |
4366 | goto out; | |
4367 | BUG_ON(ret == 0); | |
4368 | ||
4369 | ret = 0; | |
4370 | if (path->slots[0] > 0) { | |
4371 | path->slots[0]--; | |
4372 | btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); | |
4373 | if (key.objectid == root->root_key.objectid && | |
4374 | key.type == BTRFS_ROOT_REF_KEY) | |
4375 | ret = -ENOTEMPTY; | |
4376 | } | |
4377 | out: | |
4378 | btrfs_free_path(path); | |
4379 | return ret; | |
4380 | } | |
4381 | ||
20a68004 NB |
4382 | /* Delete all dentries for inodes belonging to the root */ |
4383 | static void btrfs_prune_dentries(struct btrfs_root *root) | |
4384 | { | |
4385 | struct btrfs_fs_info *fs_info = root->fs_info; | |
4386 | struct rb_node *node; | |
4387 | struct rb_node *prev; | |
4388 | struct btrfs_inode *entry; | |
4389 | struct inode *inode; | |
4390 | u64 objectid = 0; | |
4391 | ||
84961539 | 4392 | if (!BTRFS_FS_ERROR(fs_info)) |
20a68004 NB |
4393 | WARN_ON(btrfs_root_refs(&root->root_item) != 0); |
4394 | ||
4395 | spin_lock(&root->inode_lock); | |
4396 | again: | |
4397 | node = root->inode_tree.rb_node; | |
4398 | prev = NULL; | |
4399 | while (node) { | |
4400 | prev = node; | |
4401 | entry = rb_entry(node, struct btrfs_inode, rb_node); | |
4402 | ||
37508515 | 4403 | if (objectid < btrfs_ino(entry)) |
20a68004 | 4404 | node = node->rb_left; |
37508515 | 4405 | else if (objectid > btrfs_ino(entry)) |
20a68004 NB |
4406 | node = node->rb_right; |
4407 | else | |
4408 | break; | |
4409 | } | |
4410 | if (!node) { | |
4411 | while (prev) { | |
4412 | entry = rb_entry(prev, struct btrfs_inode, rb_node); | |
37508515 | 4413 | if (objectid <= btrfs_ino(entry)) { |
20a68004 NB |
4414 | node = prev; |
4415 | break; | |
4416 | } | |
4417 | prev = rb_next(prev); | |
4418 | } | |
4419 | } | |
4420 | while (node) { | |
4421 | entry = rb_entry(node, struct btrfs_inode, rb_node); | |
37508515 | 4422 | objectid = btrfs_ino(entry) + 1; |
20a68004 NB |
4423 | inode = igrab(&entry->vfs_inode); |
4424 | if (inode) { | |
4425 | spin_unlock(&root->inode_lock); | |
4426 | if (atomic_read(&inode->i_count) > 1) | |
4427 | d_prune_aliases(inode); | |
4428 | /* | |
4429 | * btrfs_drop_inode will have it removed from the inode | |
4430 | * cache when its usage count hits zero. | |
4431 | */ | |
4432 | iput(inode); | |
4433 | cond_resched(); | |
4434 | spin_lock(&root->inode_lock); | |
4435 | goto again; | |
4436 | } | |
4437 | ||
4438 | if (cond_resched_lock(&root->inode_lock)) | |
4439 | goto again; | |
4440 | ||
4441 | node = rb_next(node); | |
4442 | } | |
4443 | spin_unlock(&root->inode_lock); | |
4444 | } | |
4445 | ||
3c4f91e2 | 4446 | int btrfs_delete_subvolume(struct btrfs_inode *dir, struct dentry *dentry) |
f60a2364 MT |
4447 | { |
4448 | struct btrfs_fs_info *fs_info = btrfs_sb(dentry->d_sb); | |
3c4f91e2 | 4449 | struct btrfs_root *root = dir->root; |
f60a2364 MT |
4450 | struct inode *inode = d_inode(dentry); |
4451 | struct btrfs_root *dest = BTRFS_I(inode)->root; | |
4452 | struct btrfs_trans_handle *trans; | |
4453 | struct btrfs_block_rsv block_rsv; | |
4454 | u64 root_flags; | |
f60a2364 | 4455 | int ret; |
f60a2364 MT |
4456 | |
4457 | /* | |
4458 | * Don't allow to delete a subvolume with send in progress. This is | |
4459 | * inside the inode lock so the error handling that has to drop the bit | |
4460 | * again is not run concurrently. | |
4461 | */ | |
4462 | spin_lock(&dest->root_item_lock); | |
a7176f74 | 4463 | if (dest->send_in_progress) { |
f60a2364 MT |
4464 | spin_unlock(&dest->root_item_lock); |
4465 | btrfs_warn(fs_info, | |
4466 | "attempt to delete subvolume %llu during send", | |
4467 | dest->root_key.objectid); | |
4468 | return -EPERM; | |
4469 | } | |
60021bd7 KH |
4470 | if (atomic_read(&dest->nr_swapfiles)) { |
4471 | spin_unlock(&dest->root_item_lock); | |
4472 | btrfs_warn(fs_info, | |
4473 | "attempt to delete subvolume %llu with active swapfile", | |
4474 | root->root_key.objectid); | |
4475 | return -EPERM; | |
4476 | } | |
a7176f74 LF |
4477 | root_flags = btrfs_root_flags(&dest->root_item); |
4478 | btrfs_set_root_flags(&dest->root_item, | |
4479 | root_flags | BTRFS_ROOT_SUBVOL_DEAD); | |
4480 | spin_unlock(&dest->root_item_lock); | |
f60a2364 MT |
4481 | |
4482 | down_write(&fs_info->subvol_sem); | |
4483 | ||
ee0d904f NB |
4484 | ret = may_destroy_subvol(dest); |
4485 | if (ret) | |
f60a2364 MT |
4486 | goto out_up_write; |
4487 | ||
4488 | btrfs_init_block_rsv(&block_rsv, BTRFS_BLOCK_RSV_TEMP); | |
4489 | /* | |
4490 | * One for dir inode, | |
4491 | * two for dir entries, | |
4492 | * two for root ref/backref. | |
4493 | */ | |
ee0d904f NB |
4494 | ret = btrfs_subvolume_reserve_metadata(root, &block_rsv, 5, true); |
4495 | if (ret) | |
f60a2364 MT |
4496 | goto out_up_write; |
4497 | ||
4498 | trans = btrfs_start_transaction(root, 0); | |
4499 | if (IS_ERR(trans)) { | |
ee0d904f | 4500 | ret = PTR_ERR(trans); |
f60a2364 MT |
4501 | goto out_release; |
4502 | } | |
4503 | trans->block_rsv = &block_rsv; | |
4504 | trans->bytes_reserved = block_rsv.size; | |
4505 | ||
3c4f91e2 | 4506 | btrfs_record_snapshot_destroy(trans, dir); |
f60a2364 | 4507 | |
045d3967 | 4508 | ret = btrfs_unlink_subvol(trans, dir, dentry); |
f60a2364 | 4509 | if (ret) { |
f60a2364 MT |
4510 | btrfs_abort_transaction(trans, ret); |
4511 | goto out_end_trans; | |
4512 | } | |
4513 | ||
2731f518 JB |
4514 | ret = btrfs_record_root_in_trans(trans, dest); |
4515 | if (ret) { | |
4516 | btrfs_abort_transaction(trans, ret); | |
4517 | goto out_end_trans; | |
4518 | } | |
f60a2364 MT |
4519 | |
4520 | memset(&dest->root_item.drop_progress, 0, | |
4521 | sizeof(dest->root_item.drop_progress)); | |
c8422684 | 4522 | btrfs_set_root_drop_level(&dest->root_item, 0); |
f60a2364 MT |
4523 | btrfs_set_root_refs(&dest->root_item, 0); |
4524 | ||
4525 | if (!test_and_set_bit(BTRFS_ROOT_ORPHAN_ITEM_INSERTED, &dest->state)) { | |
4526 | ret = btrfs_insert_orphan_item(trans, | |
4527 | fs_info->tree_root, | |
4528 | dest->root_key.objectid); | |
4529 | if (ret) { | |
4530 | btrfs_abort_transaction(trans, ret); | |
f60a2364 MT |
4531 | goto out_end_trans; |
4532 | } | |
4533 | } | |
4534 | ||
d1957791 | 4535 | ret = btrfs_uuid_tree_remove(trans, dest->root_item.uuid, |
f60a2364 MT |
4536 | BTRFS_UUID_KEY_SUBVOL, |
4537 | dest->root_key.objectid); | |
4538 | if (ret && ret != -ENOENT) { | |
4539 | btrfs_abort_transaction(trans, ret); | |
f60a2364 MT |
4540 | goto out_end_trans; |
4541 | } | |
4542 | if (!btrfs_is_empty_uuid(dest->root_item.received_uuid)) { | |
d1957791 | 4543 | ret = btrfs_uuid_tree_remove(trans, |
f60a2364 MT |
4544 | dest->root_item.received_uuid, |
4545 | BTRFS_UUID_KEY_RECEIVED_SUBVOL, | |
4546 | dest->root_key.objectid); | |
4547 | if (ret && ret != -ENOENT) { | |
4548 | btrfs_abort_transaction(trans, ret); | |
f60a2364 MT |
4549 | goto out_end_trans; |
4550 | } | |
4551 | } | |
4552 | ||
082b6c97 QW |
4553 | free_anon_bdev(dest->anon_dev); |
4554 | dest->anon_dev = 0; | |
f60a2364 MT |
4555 | out_end_trans: |
4556 | trans->block_rsv = NULL; | |
4557 | trans->bytes_reserved = 0; | |
4558 | ret = btrfs_end_transaction(trans); | |
f60a2364 MT |
4559 | inode->i_flags |= S_DEAD; |
4560 | out_release: | |
e85fde51 | 4561 | btrfs_subvolume_release_metadata(root, &block_rsv); |
f60a2364 MT |
4562 | out_up_write: |
4563 | up_write(&fs_info->subvol_sem); | |
ee0d904f | 4564 | if (ret) { |
f60a2364 MT |
4565 | spin_lock(&dest->root_item_lock); |
4566 | root_flags = btrfs_root_flags(&dest->root_item); | |
4567 | btrfs_set_root_flags(&dest->root_item, | |
4568 | root_flags & ~BTRFS_ROOT_SUBVOL_DEAD); | |
4569 | spin_unlock(&dest->root_item_lock); | |
4570 | } else { | |
4571 | d_invalidate(dentry); | |
20a68004 | 4572 | btrfs_prune_dentries(dest); |
f60a2364 | 4573 | ASSERT(dest->send_in_progress == 0); |
f60a2364 MT |
4574 | } |
4575 | ||
ee0d904f | 4576 | return ret; |
f60a2364 MT |
4577 | } |
4578 | ||
39279cc3 CM |
4579 | static int btrfs_rmdir(struct inode *dir, struct dentry *dentry) |
4580 | { | |
2b0143b5 | 4581 | struct inode *inode = d_inode(dentry); |
813febdb | 4582 | struct btrfs_fs_info *fs_info = BTRFS_I(inode)->root->fs_info; |
1832a6d5 | 4583 | int err = 0; |
39279cc3 | 4584 | struct btrfs_trans_handle *trans; |
44f714da | 4585 | u64 last_unlink_trans; |
ab3c5c18 | 4586 | struct fscrypt_name fname; |
39279cc3 | 4587 | |
b3ae244e | 4588 | if (inode->i_size > BTRFS_EMPTY_DIR_SIZE) |
134d4512 | 4589 | return -ENOTEMPTY; |
813febdb JB |
4590 | if (btrfs_ino(BTRFS_I(inode)) == BTRFS_FIRST_FREE_OBJECTID) { |
4591 | if (unlikely(btrfs_fs_incompat(fs_info, EXTENT_TREE_V2))) { | |
4592 | btrfs_err(fs_info, | |
4593 | "extent tree v2 doesn't support snapshot deletion yet"); | |
4594 | return -EOPNOTSUPP; | |
4595 | } | |
3c4f91e2 | 4596 | return btrfs_delete_subvolume(BTRFS_I(dir), dentry); |
813febdb | 4597 | } |
134d4512 | 4598 | |
ab3c5c18 STD |
4599 | err = fscrypt_setup_filename(dir, &dentry->d_name, 1, &fname); |
4600 | if (err) | |
4601 | return err; | |
ab3c5c18 STD |
4602 | |
4603 | /* This needs to handle no-key deletions later on */ | |
4604 | ||
e569b1d5 | 4605 | trans = __unlink_start_trans(BTRFS_I(dir)); |
ab3c5c18 STD |
4606 | if (IS_ERR(trans)) { |
4607 | err = PTR_ERR(trans); | |
4608 | goto out_notrans; | |
4609 | } | |
5df6a9f6 | 4610 | |
4a0cc7ca | 4611 | if (unlikely(btrfs_ino(BTRFS_I(inode)) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)) { |
5b7544cb | 4612 | err = btrfs_unlink_subvol(trans, BTRFS_I(dir), dentry); |
4df27c4d YZ |
4613 | goto out; |
4614 | } | |
4615 | ||
73f2e545 | 4616 | err = btrfs_orphan_add(trans, BTRFS_I(inode)); |
7b128766 | 4617 | if (err) |
4df27c4d | 4618 | goto out; |
7b128766 | 4619 | |
44f714da FM |
4620 | last_unlink_trans = BTRFS_I(inode)->last_unlink_trans; |
4621 | ||
39279cc3 | 4622 | /* now the directory is empty */ |
e43eec81 | 4623 | err = btrfs_unlink_inode(trans, BTRFS_I(dir), BTRFS_I(d_inode(dentry)), |
6db75318 | 4624 | &fname.disk_name); |
44f714da | 4625 | if (!err) { |
6ef06d27 | 4626 | btrfs_i_size_write(BTRFS_I(inode), 0); |
44f714da FM |
4627 | /* |
4628 | * Propagate the last_unlink_trans value of the deleted dir to | |
4629 | * its parent directory. This is to prevent an unrecoverable | |
4630 | * log tree in the case we do something like this: | |
4631 | * 1) create dir foo | |
4632 | * 2) create snapshot under dir foo | |
4633 | * 3) delete the snapshot | |
4634 | * 4) rmdir foo | |
4635 | * 5) mkdir foo | |
4636 | * 6) fsync foo or some file inside foo | |
4637 | */ | |
4638 | if (last_unlink_trans >= trans->transid) | |
4639 | BTRFS_I(dir)->last_unlink_trans = last_unlink_trans; | |
4640 | } | |
4df27c4d | 4641 | out: |
3a45bb20 | 4642 | btrfs_end_transaction(trans); |
ab3c5c18 | 4643 | out_notrans: |
813febdb | 4644 | btrfs_btree_balance_dirty(fs_info); |
ab3c5c18 | 4645 | fscrypt_free_filename(&fname); |
3954401f | 4646 | |
39279cc3 CM |
4647 | return err; |
4648 | } | |
4649 | ||
39279cc3 | 4650 | /* |
9580503b DS |
4651 | * Read, zero a chunk and write a block. |
4652 | * | |
2aaa6655 JB |
4653 | * @inode - inode that we're zeroing |
4654 | * @from - the offset to start zeroing | |
4655 | * @len - the length to zero, 0 to zero the entire range respective to the | |
4656 | * offset | |
4657 | * @front - zero up to the offset instead of from the offset on | |
4658 | * | |
9703fefe | 4659 | * This will find the block for the "from" offset and cow the block and zero the |
2aaa6655 | 4660 | * part we want to zero. This is used with truncate and hole punching. |
39279cc3 | 4661 | */ |
217f42eb NB |
4662 | int btrfs_truncate_block(struct btrfs_inode *inode, loff_t from, loff_t len, |
4663 | int front) | |
39279cc3 | 4664 | { |
217f42eb NB |
4665 | struct btrfs_fs_info *fs_info = inode->root->fs_info; |
4666 | struct address_space *mapping = inode->vfs_inode.i_mapping; | |
4667 | struct extent_io_tree *io_tree = &inode->io_tree; | |
e6dcd2dc | 4668 | struct btrfs_ordered_extent *ordered; |
2ac55d41 | 4669 | struct extent_state *cached_state = NULL; |
364ecf36 | 4670 | struct extent_changeset *data_reserved = NULL; |
6d4572a9 | 4671 | bool only_release_metadata = false; |
0b246afa | 4672 | u32 blocksize = fs_info->sectorsize; |
09cbfeaf | 4673 | pgoff_t index = from >> PAGE_SHIFT; |
9703fefe | 4674 | unsigned offset = from & (blocksize - 1); |
39279cc3 | 4675 | struct page *page; |
3b16a4e3 | 4676 | gfp_t mask = btrfs_alloc_write_mask(mapping); |
6d4572a9 | 4677 | size_t write_bytes = blocksize; |
39279cc3 | 4678 | int ret = 0; |
9703fefe CR |
4679 | u64 block_start; |
4680 | u64 block_end; | |
39279cc3 | 4681 | |
b03ebd99 NB |
4682 | if (IS_ALIGNED(offset, blocksize) && |
4683 | (!len || IS_ALIGNED(len, blocksize))) | |
39279cc3 | 4684 | goto out; |
9703fefe | 4685 | |
8b62f87b JB |
4686 | block_start = round_down(from, blocksize); |
4687 | block_end = block_start + blocksize - 1; | |
4688 | ||
217f42eb | 4689 | ret = btrfs_check_data_free_space(inode, &data_reserved, block_start, |
1daedb1d | 4690 | blocksize, false); |
6d4572a9 | 4691 | if (ret < 0) { |
80f9d241 | 4692 | if (btrfs_check_nocow_lock(inode, block_start, &write_bytes, false) > 0) { |
6d4572a9 QW |
4693 | /* For nocow case, no need to reserve data space */ |
4694 | only_release_metadata = true; | |
4695 | } else { | |
4696 | goto out; | |
4697 | } | |
4698 | } | |
d4135134 | 4699 | ret = btrfs_delalloc_reserve_metadata(inode, blocksize, blocksize, false); |
6d4572a9 QW |
4700 | if (ret < 0) { |
4701 | if (!only_release_metadata) | |
217f42eb NB |
4702 | btrfs_free_reserved_data_space(inode, data_reserved, |
4703 | block_start, blocksize); | |
6d4572a9 QW |
4704 | goto out; |
4705 | } | |
211c17f5 | 4706 | again: |
3b16a4e3 | 4707 | page = find_or_create_page(mapping, index, mask); |
5d5e103a | 4708 | if (!page) { |
217f42eb NB |
4709 | btrfs_delalloc_release_space(inode, data_reserved, block_start, |
4710 | blocksize, true); | |
4711 | btrfs_delalloc_release_extents(inode, blocksize); | |
ac6a2b36 | 4712 | ret = -ENOMEM; |
39279cc3 | 4713 | goto out; |
5d5e103a | 4714 | } |
e6dcd2dc | 4715 | |
39279cc3 | 4716 | if (!PageUptodate(page)) { |
fb12489b | 4717 | ret = btrfs_read_folio(NULL, page_folio(page)); |
39279cc3 | 4718 | lock_page(page); |
211c17f5 CM |
4719 | if (page->mapping != mapping) { |
4720 | unlock_page(page); | |
09cbfeaf | 4721 | put_page(page); |
211c17f5 CM |
4722 | goto again; |
4723 | } | |
39279cc3 CM |
4724 | if (!PageUptodate(page)) { |
4725 | ret = -EIO; | |
89642229 | 4726 | goto out_unlock; |
39279cc3 CM |
4727 | } |
4728 | } | |
17b17fcd JB |
4729 | |
4730 | /* | |
4731 | * We unlock the page after the io is completed and then re-lock it | |
4732 | * above. release_folio() could have come in between that and cleared | |
4733 | * PagePrivate(), but left the page in the mapping. Set the page mapped | |
4734 | * here to make sure it's properly set for the subpage stuff. | |
4735 | */ | |
4736 | ret = set_page_extent_mapped(page); | |
4737 | if (ret < 0) | |
4738 | goto out_unlock; | |
4739 | ||
211c17f5 | 4740 | wait_on_page_writeback(page); |
e6dcd2dc | 4741 | |
570eb97b | 4742 | lock_extent(io_tree, block_start, block_end, &cached_state); |
e6dcd2dc | 4743 | |
217f42eb | 4744 | ordered = btrfs_lookup_ordered_extent(inode, block_start); |
e6dcd2dc | 4745 | if (ordered) { |
570eb97b | 4746 | unlock_extent(io_tree, block_start, block_end, &cached_state); |
e6dcd2dc | 4747 | unlock_page(page); |
09cbfeaf | 4748 | put_page(page); |
36d45567 | 4749 | btrfs_start_ordered_extent(ordered); |
e6dcd2dc CM |
4750 | btrfs_put_ordered_extent(ordered); |
4751 | goto again; | |
4752 | } | |
4753 | ||
217f42eb | 4754 | clear_extent_bit(&inode->io_tree, block_start, block_end, |
e182163d | 4755 | EXTENT_DELALLOC | EXTENT_DO_ACCOUNTING | EXTENT_DEFRAG, |
bd015294 | 4756 | &cached_state); |
5d5e103a | 4757 | |
217f42eb | 4758 | ret = btrfs_set_extent_delalloc(inode, block_start, block_end, 0, |
330a5827 | 4759 | &cached_state); |
9ed74f2d | 4760 | if (ret) { |
570eb97b | 4761 | unlock_extent(io_tree, block_start, block_end, &cached_state); |
9ed74f2d JB |
4762 | goto out_unlock; |
4763 | } | |
4764 | ||
9703fefe | 4765 | if (offset != blocksize) { |
2aaa6655 | 4766 | if (!len) |
9703fefe | 4767 | len = blocksize - offset; |
2aaa6655 | 4768 | if (front) |
d048b9c2 IW |
4769 | memzero_page(page, (block_start - page_offset(page)), |
4770 | offset); | |
2aaa6655 | 4771 | else |
d048b9c2 IW |
4772 | memzero_page(page, (block_start - page_offset(page)) + offset, |
4773 | len); | |
e6dcd2dc | 4774 | } |
e4f94347 QW |
4775 | btrfs_page_clear_checked(fs_info, page, block_start, |
4776 | block_end + 1 - block_start); | |
6c9ac8be | 4777 | btrfs_page_set_dirty(fs_info, page, block_start, block_end + 1 - block_start); |
570eb97b | 4778 | unlock_extent(io_tree, block_start, block_end, &cached_state); |
39279cc3 | 4779 | |
6d4572a9 | 4780 | if (only_release_metadata) |
217f42eb | 4781 | set_extent_bit(&inode->io_tree, block_start, block_end, |
1d126800 | 4782 | EXTENT_NORESERVE, NULL); |
6d4572a9 | 4783 | |
89642229 | 4784 | out_unlock: |
6d4572a9 QW |
4785 | if (ret) { |
4786 | if (only_release_metadata) | |
217f42eb | 4787 | btrfs_delalloc_release_metadata(inode, blocksize, true); |
6d4572a9 | 4788 | else |
217f42eb | 4789 | btrfs_delalloc_release_space(inode, data_reserved, |
6d4572a9 QW |
4790 | block_start, blocksize, true); |
4791 | } | |
217f42eb | 4792 | btrfs_delalloc_release_extents(inode, blocksize); |
39279cc3 | 4793 | unlock_page(page); |
09cbfeaf | 4794 | put_page(page); |
39279cc3 | 4795 | out: |
6d4572a9 | 4796 | if (only_release_metadata) |
217f42eb | 4797 | btrfs_check_nocow_unlock(inode); |
364ecf36 | 4798 | extent_changeset_free(data_reserved); |
39279cc3 CM |
4799 | return ret; |
4800 | } | |
4801 | ||
0a325e62 | 4802 | static int maybe_insert_hole(struct btrfs_inode *inode, u64 offset, u64 len) |
16e7549f | 4803 | { |
0a325e62 | 4804 | struct btrfs_root *root = inode->root; |
a4ba6cc0 | 4805 | struct btrfs_fs_info *fs_info = root->fs_info; |
16e7549f | 4806 | struct btrfs_trans_handle *trans; |
5893dfb9 | 4807 | struct btrfs_drop_extents_args drop_args = { 0 }; |
16e7549f JB |
4808 | int ret; |
4809 | ||
4810 | /* | |
cceaa89f FM |
4811 | * If NO_HOLES is enabled, we don't need to do anything. |
4812 | * Later, up in the call chain, either btrfs_set_inode_last_sub_trans() | |
4813 | * or btrfs_update_inode() will be called, which guarantee that the next | |
4814 | * fsync will know this inode was changed and needs to be logged. | |
16e7549f | 4815 | */ |
cceaa89f | 4816 | if (btrfs_fs_incompat(fs_info, NO_HOLES)) |
16e7549f | 4817 | return 0; |
16e7549f JB |
4818 | |
4819 | /* | |
4820 | * 1 - for the one we're dropping | |
4821 | * 1 - for the one we're adding | |
4822 | * 1 - for updating the inode. | |
4823 | */ | |
4824 | trans = btrfs_start_transaction(root, 3); | |
4825 | if (IS_ERR(trans)) | |
4826 | return PTR_ERR(trans); | |
4827 | ||
5893dfb9 FM |
4828 | drop_args.start = offset; |
4829 | drop_args.end = offset + len; | |
4830 | drop_args.drop_cache = true; | |
4831 | ||
a4ba6cc0 | 4832 | ret = btrfs_drop_extents(trans, root, inode, &drop_args); |
16e7549f | 4833 | if (ret) { |
66642832 | 4834 | btrfs_abort_transaction(trans, ret); |
3a45bb20 | 4835 | btrfs_end_transaction(trans); |
16e7549f JB |
4836 | return ret; |
4837 | } | |
4838 | ||
d1f68ba0 | 4839 | ret = btrfs_insert_hole_extent(trans, root, btrfs_ino(inode), offset, len); |
2766ff61 | 4840 | if (ret) { |
66642832 | 4841 | btrfs_abort_transaction(trans, ret); |
2766ff61 | 4842 | } else { |
a4ba6cc0 | 4843 | btrfs_update_inode_bytes(inode, 0, drop_args.bytes_found); |
8b9d0322 | 4844 | btrfs_update_inode(trans, inode); |
2766ff61 | 4845 | } |
3a45bb20 | 4846 | btrfs_end_transaction(trans); |
16e7549f JB |
4847 | return ret; |
4848 | } | |
4849 | ||
695a0d0d JB |
4850 | /* |
4851 | * This function puts in dummy file extents for the area we're creating a hole | |
4852 | * for. So if we are truncating this file to a larger size we need to insert | |
4853 | * these file extents so that btrfs_get_extent will return a EXTENT_MAP_HOLE for | |
4854 | * the range between oldsize and size | |
4855 | */ | |
b06359a3 | 4856 | int btrfs_cont_expand(struct btrfs_inode *inode, loff_t oldsize, loff_t size) |
39279cc3 | 4857 | { |
b06359a3 NB |
4858 | struct btrfs_root *root = inode->root; |
4859 | struct btrfs_fs_info *fs_info = root->fs_info; | |
4860 | struct extent_io_tree *io_tree = &inode->io_tree; | |
a22285a6 | 4861 | struct extent_map *em = NULL; |
2ac55d41 | 4862 | struct extent_state *cached_state = NULL; |
0b246afa JM |
4863 | u64 hole_start = ALIGN(oldsize, fs_info->sectorsize); |
4864 | u64 block_end = ALIGN(size, fs_info->sectorsize); | |
9036c102 YZ |
4865 | u64 last_byte; |
4866 | u64 cur_offset; | |
4867 | u64 hole_size; | |
9ed74f2d | 4868 | int err = 0; |
39279cc3 | 4869 | |
a71754fc | 4870 | /* |
9703fefe CR |
4871 | * If our size started in the middle of a block we need to zero out the |
4872 | * rest of the block before we expand the i_size, otherwise we could | |
a71754fc JB |
4873 | * expose stale data. |
4874 | */ | |
b06359a3 | 4875 | err = btrfs_truncate_block(inode, oldsize, 0, 0); |
a71754fc JB |
4876 | if (err) |
4877 | return err; | |
4878 | ||
9036c102 YZ |
4879 | if (size <= hole_start) |
4880 | return 0; | |
4881 | ||
b06359a3 NB |
4882 | btrfs_lock_and_flush_ordered_range(inode, hole_start, block_end - 1, |
4883 | &cached_state); | |
9036c102 YZ |
4884 | cur_offset = hole_start; |
4885 | while (1) { | |
b06359a3 | 4886 | em = btrfs_get_extent(inode, NULL, 0, cur_offset, |
39b07b5d | 4887 | block_end - cur_offset); |
79787eaa JM |
4888 | if (IS_ERR(em)) { |
4889 | err = PTR_ERR(em); | |
f2767956 | 4890 | em = NULL; |
79787eaa JM |
4891 | break; |
4892 | } | |
9036c102 | 4893 | last_byte = min(extent_map_end(em), block_end); |
0b246afa | 4894 | last_byte = ALIGN(last_byte, fs_info->sectorsize); |
9ddc959e JB |
4895 | hole_size = last_byte - cur_offset; |
4896 | ||
8082510e | 4897 | if (!test_bit(EXTENT_FLAG_PREALLOC, &em->flags)) { |
5dc562c5 | 4898 | struct extent_map *hole_em; |
9ed74f2d | 4899 | |
0a325e62 | 4900 | err = maybe_insert_hole(inode, cur_offset, hole_size); |
16e7549f | 4901 | if (err) |
3893e33b | 4902 | break; |
9ddc959e | 4903 | |
b06359a3 | 4904 | err = btrfs_inode_set_file_extent_range(inode, |
9ddc959e JB |
4905 | cur_offset, hole_size); |
4906 | if (err) | |
4907 | break; | |
4908 | ||
5dc562c5 JB |
4909 | hole_em = alloc_extent_map(); |
4910 | if (!hole_em) { | |
a1ba4c08 FM |
4911 | btrfs_drop_extent_map_range(inode, cur_offset, |
4912 | cur_offset + hole_size - 1, | |
4913 | false); | |
23e3337f | 4914 | btrfs_set_inode_full_sync(inode); |
5dc562c5 JB |
4915 | goto next; |
4916 | } | |
4917 | hole_em->start = cur_offset; | |
4918 | hole_em->len = hole_size; | |
4919 | hole_em->orig_start = cur_offset; | |
8082510e | 4920 | |
5dc562c5 JB |
4921 | hole_em->block_start = EXTENT_MAP_HOLE; |
4922 | hole_em->block_len = 0; | |
b4939680 | 4923 | hole_em->orig_block_len = 0; |
cc95bef6 | 4924 | hole_em->ram_bytes = hole_size; |
5dc562c5 | 4925 | hole_em->compress_type = BTRFS_COMPRESS_NONE; |
4a4f8fe2 | 4926 | hole_em->generation = btrfs_get_fs_generation(fs_info); |
8082510e | 4927 | |
a1ba4c08 | 4928 | err = btrfs_replace_extent_map_range(inode, hole_em, true); |
5dc562c5 | 4929 | free_extent_map(hole_em); |
9ddc959e | 4930 | } else { |
b06359a3 | 4931 | err = btrfs_inode_set_file_extent_range(inode, |
9ddc959e JB |
4932 | cur_offset, hole_size); |
4933 | if (err) | |
4934 | break; | |
9036c102 | 4935 | } |
16e7549f | 4936 | next: |
9036c102 | 4937 | free_extent_map(em); |
a22285a6 | 4938 | em = NULL; |
9036c102 | 4939 | cur_offset = last_byte; |
8082510e | 4940 | if (cur_offset >= block_end) |
9036c102 YZ |
4941 | break; |
4942 | } | |
a22285a6 | 4943 | free_extent_map(em); |
570eb97b | 4944 | unlock_extent(io_tree, hole_start, block_end - 1, &cached_state); |
9036c102 YZ |
4945 | return err; |
4946 | } | |
39279cc3 | 4947 | |
3972f260 | 4948 | static int btrfs_setsize(struct inode *inode, struct iattr *attr) |
8082510e | 4949 | { |
f4a2f4c5 MX |
4950 | struct btrfs_root *root = BTRFS_I(inode)->root; |
4951 | struct btrfs_trans_handle *trans; | |
a41ad394 | 4952 | loff_t oldsize = i_size_read(inode); |
3972f260 ES |
4953 | loff_t newsize = attr->ia_size; |
4954 | int mask = attr->ia_valid; | |
8082510e YZ |
4955 | int ret; |
4956 | ||
3972f260 ES |
4957 | /* |
4958 | * The regular truncate() case without ATTR_CTIME and ATTR_MTIME is a | |
4959 | * special case where we need to update the times despite not having | |
4960 | * these flags set. For all other operations the VFS set these flags | |
4961 | * explicitly if it wants a timestamp update. | |
4962 | */ | |
dff6efc3 CH |
4963 | if (newsize != oldsize) { |
4964 | inode_inc_iversion(inode); | |
c1867eb3 | 4965 | if (!(mask & (ATTR_CTIME | ATTR_MTIME))) { |
2a9462de | 4966 | inode->i_mtime = inode_set_ctime_current(inode); |
c1867eb3 | 4967 | } |
dff6efc3 | 4968 | } |
3972f260 | 4969 | |
a41ad394 | 4970 | if (newsize > oldsize) { |
9ea24bbe | 4971 | /* |
ea14b57f | 4972 | * Don't do an expanding truncate while snapshotting is ongoing. |
9ea24bbe FM |
4973 | * This is to ensure the snapshot captures a fully consistent |
4974 | * state of this file - if the snapshot captures this expanding | |
4975 | * truncation, it must capture all writes that happened before | |
4976 | * this truncation. | |
4977 | */ | |
dcc3eb96 | 4978 | btrfs_drew_write_lock(&root->snapshot_lock); |
b06359a3 | 4979 | ret = btrfs_cont_expand(BTRFS_I(inode), oldsize, newsize); |
9ea24bbe | 4980 | if (ret) { |
dcc3eb96 | 4981 | btrfs_drew_write_unlock(&root->snapshot_lock); |
8082510e | 4982 | return ret; |
9ea24bbe | 4983 | } |
8082510e | 4984 | |
f4a2f4c5 | 4985 | trans = btrfs_start_transaction(root, 1); |
9ea24bbe | 4986 | if (IS_ERR(trans)) { |
dcc3eb96 | 4987 | btrfs_drew_write_unlock(&root->snapshot_lock); |
f4a2f4c5 | 4988 | return PTR_ERR(trans); |
9ea24bbe | 4989 | } |
f4a2f4c5 MX |
4990 | |
4991 | i_size_write(inode, newsize); | |
76aea537 | 4992 | btrfs_inode_safe_disk_i_size_write(BTRFS_I(inode), 0); |
27772b68 | 4993 | pagecache_isize_extended(inode, oldsize, newsize); |
8b9d0322 | 4994 | ret = btrfs_update_inode(trans, BTRFS_I(inode)); |
dcc3eb96 | 4995 | btrfs_drew_write_unlock(&root->snapshot_lock); |
3a45bb20 | 4996 | btrfs_end_transaction(trans); |
a41ad394 | 4997 | } else { |
24c0a722 NA |
4998 | struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); |
4999 | ||
5000 | if (btrfs_is_zoned(fs_info)) { | |
5001 | ret = btrfs_wait_ordered_range(inode, | |
5002 | ALIGN(newsize, fs_info->sectorsize), | |
5003 | (u64)-1); | |
5004 | if (ret) | |
5005 | return ret; | |
5006 | } | |
8082510e | 5007 | |
a41ad394 JB |
5008 | /* |
5009 | * We're truncating a file that used to have good data down to | |
1fd4033d NB |
5010 | * zero. Make sure any new writes to the file get on disk |
5011 | * on close. | |
a41ad394 JB |
5012 | */ |
5013 | if (newsize == 0) | |
1fd4033d | 5014 | set_bit(BTRFS_INODE_FLUSH_ON_CLOSE, |
72ac3c0d | 5015 | &BTRFS_I(inode)->runtime_flags); |
8082510e | 5016 | |
a41ad394 | 5017 | truncate_setsize(inode, newsize); |
2e60a51e | 5018 | |
2e60a51e | 5019 | inode_dio_wait(inode); |
2e60a51e | 5020 | |
d9dcae67 | 5021 | ret = btrfs_truncate(BTRFS_I(inode), newsize == oldsize); |
7f4f6e0a JB |
5022 | if (ret && inode->i_nlink) { |
5023 | int err; | |
5024 | ||
5025 | /* | |
f7e9e8fc OS |
5026 | * Truncate failed, so fix up the in-memory size. We |
5027 | * adjusted disk_i_size down as we removed extents, so | |
5028 | * wait for disk_i_size to be stable and then update the | |
5029 | * in-memory size to match. | |
7f4f6e0a | 5030 | */ |
f7e9e8fc | 5031 | err = btrfs_wait_ordered_range(inode, 0, (u64)-1); |
7f4f6e0a | 5032 | if (err) |
f7e9e8fc OS |
5033 | return err; |
5034 | i_size_write(inode, BTRFS_I(inode)->disk_i_size); | |
7f4f6e0a | 5035 | } |
8082510e YZ |
5036 | } |
5037 | ||
a41ad394 | 5038 | return ret; |
8082510e YZ |
5039 | } |
5040 | ||
c1632a0f | 5041 | static int btrfs_setattr(struct mnt_idmap *idmap, struct dentry *dentry, |
549c7297 | 5042 | struct iattr *attr) |
9036c102 | 5043 | { |
2b0143b5 | 5044 | struct inode *inode = d_inode(dentry); |
b83cc969 | 5045 | struct btrfs_root *root = BTRFS_I(inode)->root; |
9036c102 | 5046 | int err; |
39279cc3 | 5047 | |
b83cc969 LZ |
5048 | if (btrfs_root_readonly(root)) |
5049 | return -EROFS; | |
5050 | ||
c1632a0f | 5051 | err = setattr_prepare(idmap, dentry, attr); |
9036c102 YZ |
5052 | if (err) |
5053 | return err; | |
2bf5a725 | 5054 | |
5a3f23d5 | 5055 | if (S_ISREG(inode->i_mode) && (attr->ia_valid & ATTR_SIZE)) { |
3972f260 | 5056 | err = btrfs_setsize(inode, attr); |
8082510e YZ |
5057 | if (err) |
5058 | return err; | |
39279cc3 | 5059 | } |
9036c102 | 5060 | |
1025774c | 5061 | if (attr->ia_valid) { |
c1632a0f | 5062 | setattr_copy(idmap, inode, attr); |
0c4d2d95 | 5063 | inode_inc_iversion(inode); |
7152b425 | 5064 | err = btrfs_dirty_inode(BTRFS_I(inode)); |
1025774c | 5065 | |
22c44fe6 | 5066 | if (!err && attr->ia_valid & ATTR_MODE) |
13e83a49 | 5067 | err = posix_acl_chmod(idmap, dentry, inode->i_mode); |
1025774c | 5068 | } |
33268eaf | 5069 | |
39279cc3 CM |
5070 | return err; |
5071 | } | |
61295eb8 | 5072 | |
131e404a | 5073 | /* |
895586eb MWO |
5074 | * While truncating the inode pages during eviction, we get the VFS |
5075 | * calling btrfs_invalidate_folio() against each folio of the inode. This | |
5076 | * is slow because the calls to btrfs_invalidate_folio() result in a | |
570eb97b | 5077 | * huge amount of calls to lock_extent() and clear_extent_bit(), |
895586eb MWO |
5078 | * which keep merging and splitting extent_state structures over and over, |
5079 | * wasting lots of time. | |
131e404a | 5080 | * |
895586eb MWO |
5081 | * Therefore if the inode is being evicted, let btrfs_invalidate_folio() |
5082 | * skip all those expensive operations on a per folio basis and do only | |
5083 | * the ordered io finishing, while we release here the extent_map and | |
5084 | * extent_state structures, without the excessive merging and splitting. | |
131e404a FDBM |
5085 | */ |
5086 | static void evict_inode_truncate_pages(struct inode *inode) | |
5087 | { | |
5088 | struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; | |
131e404a FDBM |
5089 | struct rb_node *node; |
5090 | ||
5091 | ASSERT(inode->i_state & I_FREEING); | |
91b0abe3 | 5092 | truncate_inode_pages_final(&inode->i_data); |
131e404a | 5093 | |
9c9d1b4f | 5094 | btrfs_drop_extent_map_range(BTRFS_I(inode), 0, (u64)-1, false); |
131e404a | 5095 | |
6ca07097 FM |
5096 | /* |
5097 | * Keep looping until we have no more ranges in the io tree. | |
ba206a02 MWO |
5098 | * We can have ongoing bios started by readahead that have |
5099 | * their endio callback (extent_io.c:end_bio_extent_readpage) | |
9c6429d9 FM |
5100 | * still in progress (unlocked the pages in the bio but did not yet |
5101 | * unlocked the ranges in the io tree). Therefore this means some | |
6ca07097 FM |
5102 | * ranges can still be locked and eviction started because before |
5103 | * submitting those bios, which are executed by a separate task (work | |
5104 | * queue kthread), inode references (inode->i_count) were not taken | |
5105 | * (which would be dropped in the end io callback of each bio). | |
5106 | * Therefore here we effectively end up waiting for those bios and | |
5107 | * anyone else holding locked ranges without having bumped the inode's | |
5108 | * reference count - if we don't do it, when they access the inode's | |
5109 | * io_tree to unlock a range it may be too late, leading to an | |
5110 | * use-after-free issue. | |
5111 | */ | |
131e404a FDBM |
5112 | spin_lock(&io_tree->lock); |
5113 | while (!RB_EMPTY_ROOT(&io_tree->state)) { | |
5114 | struct extent_state *state; | |
5115 | struct extent_state *cached_state = NULL; | |
6ca07097 FM |
5116 | u64 start; |
5117 | u64 end; | |
421f0922 | 5118 | unsigned state_flags; |
131e404a FDBM |
5119 | |
5120 | node = rb_first(&io_tree->state); | |
5121 | state = rb_entry(node, struct extent_state, rb_node); | |
6ca07097 FM |
5122 | start = state->start; |
5123 | end = state->end; | |
421f0922 | 5124 | state_flags = state->state; |
131e404a FDBM |
5125 | spin_unlock(&io_tree->lock); |
5126 | ||
570eb97b | 5127 | lock_extent(io_tree, start, end, &cached_state); |
b9d0b389 QW |
5128 | |
5129 | /* | |
5130 | * If still has DELALLOC flag, the extent didn't reach disk, | |
5131 | * and its reserved space won't be freed by delayed_ref. | |
5132 | * So we need to free its reserved space here. | |
895586eb | 5133 | * (Refer to comment in btrfs_invalidate_folio, case 2) |
b9d0b389 QW |
5134 | * |
5135 | * Note, end is the bytenr of last byte, so we need + 1 here. | |
5136 | */ | |
421f0922 | 5137 | if (state_flags & EXTENT_DELALLOC) |
8b8a979f NB |
5138 | btrfs_qgroup_free_data(BTRFS_I(inode), NULL, start, |
5139 | end - start + 1); | |
b9d0b389 | 5140 | |
6ca07097 | 5141 | clear_extent_bit(io_tree, start, end, |
bd015294 | 5142 | EXTENT_CLEAR_ALL_BITS | EXTENT_DO_ACCOUNTING, |
e182163d | 5143 | &cached_state); |
131e404a | 5144 | |
7064dd5c | 5145 | cond_resched(); |
131e404a FDBM |
5146 | spin_lock(&io_tree->lock); |
5147 | } | |
5148 | spin_unlock(&io_tree->lock); | |
5149 | } | |
5150 | ||
4b9d7b59 | 5151 | static struct btrfs_trans_handle *evict_refill_and_join(struct btrfs_root *root, |
ad80cf50 | 5152 | struct btrfs_block_rsv *rsv) |
4b9d7b59 OS |
5153 | { |
5154 | struct btrfs_fs_info *fs_info = root->fs_info; | |
d3984c90 | 5155 | struct btrfs_trans_handle *trans; |
b13d57db | 5156 | u64 delayed_refs_extra = btrfs_calc_delayed_ref_bytes(fs_info, 1); |
d3984c90 | 5157 | int ret; |
4b9d7b59 | 5158 | |
d3984c90 JB |
5159 | /* |
5160 | * Eviction should be taking place at some place safe because of our | |
5161 | * delayed iputs. However the normal flushing code will run delayed | |
5162 | * iputs, so we cannot use FLUSH_ALL otherwise we'll deadlock. | |
5163 | * | |
5164 | * We reserve the delayed_refs_extra here again because we can't use | |
5165 | * btrfs_start_transaction(root, 0) for the same deadlocky reason as | |
5166 | * above. We reserve our extra bit here because we generate a ton of | |
5167 | * delayed refs activity by truncating. | |
5168 | * | |
ee6adbfd JB |
5169 | * BTRFS_RESERVE_FLUSH_EVICT will steal from the global_rsv if it can, |
5170 | * if we fail to make this reservation we can re-try without the | |
5171 | * delayed_refs_extra so we can make some forward progress. | |
d3984c90 | 5172 | */ |
9270501c | 5173 | ret = btrfs_block_rsv_refill(fs_info, rsv, rsv->size + delayed_refs_extra, |
d3984c90 JB |
5174 | BTRFS_RESERVE_FLUSH_EVICT); |
5175 | if (ret) { | |
9270501c | 5176 | ret = btrfs_block_rsv_refill(fs_info, rsv, rsv->size, |
ee6adbfd JB |
5177 | BTRFS_RESERVE_FLUSH_EVICT); |
5178 | if (ret) { | |
d3984c90 JB |
5179 | btrfs_warn(fs_info, |
5180 | "could not allocate space for delete; will truncate on mount"); | |
5181 | return ERR_PTR(-ENOSPC); | |
5182 | } | |
5183 | delayed_refs_extra = 0; | |
5184 | } | |
4b9d7b59 | 5185 | |
d3984c90 JB |
5186 | trans = btrfs_join_transaction(root); |
5187 | if (IS_ERR(trans)) | |
5188 | return trans; | |
5189 | ||
5190 | if (delayed_refs_extra) { | |
5191 | trans->block_rsv = &fs_info->trans_block_rsv; | |
5192 | trans->bytes_reserved = delayed_refs_extra; | |
5193 | btrfs_block_rsv_migrate(rsv, trans->block_rsv, | |
4e0527de | 5194 | delayed_refs_extra, true); |
4b9d7b59 | 5195 | } |
d3984c90 | 5196 | return trans; |
4b9d7b59 OS |
5197 | } |
5198 | ||
bd555975 | 5199 | void btrfs_evict_inode(struct inode *inode) |
39279cc3 | 5200 | { |
0b246afa | 5201 | struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); |
39279cc3 CM |
5202 | struct btrfs_trans_handle *trans; |
5203 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
b7b1167c | 5204 | struct btrfs_block_rsv *rsv = NULL; |
39279cc3 CM |
5205 | int ret; |
5206 | ||
1abe9b8a | 5207 | trace_btrfs_inode_evict(inode); |
5208 | ||
3d48d981 | 5209 | if (!root) { |
14605409 | 5210 | fsverity_cleanup_inode(inode); |
e8f1bc14 | 5211 | clear_inode(inode); |
3d48d981 NB |
5212 | return; |
5213 | } | |
5214 | ||
131e404a FDBM |
5215 | evict_inode_truncate_pages(inode); |
5216 | ||
69e9c6c6 SB |
5217 | if (inode->i_nlink && |
5218 | ((btrfs_root_refs(&root->root_item) != 0 && | |
5219 | root->root_key.objectid != BTRFS_ROOT_TREE_OBJECTID) || | |
70ddc553 | 5220 | btrfs_is_free_space_inode(BTRFS_I(inode)))) |
b7b1167c | 5221 | goto out; |
bd555975 | 5222 | |
27919067 | 5223 | if (is_bad_inode(inode)) |
b7b1167c | 5224 | goto out; |
5f39d397 | 5225 | |
7b40b695 | 5226 | if (test_bit(BTRFS_FS_LOG_RECOVERING, &fs_info->flags)) |
b7b1167c | 5227 | goto out; |
c71bf099 | 5228 | |
76dda93c | 5229 | if (inode->i_nlink > 0) { |
69e9c6c6 SB |
5230 | BUG_ON(btrfs_root_refs(&root->root_item) != 0 && |
5231 | root->root_key.objectid != BTRFS_ROOT_TREE_OBJECTID); | |
b7b1167c | 5232 | goto out; |
76dda93c YZ |
5233 | } |
5234 | ||
2adc75d6 JB |
5235 | /* |
5236 | * This makes sure the inode item in tree is uptodate and the space for | |
5237 | * the inode update is released. | |
5238 | */ | |
aa79021f | 5239 | ret = btrfs_commit_inode_delayed_inode(BTRFS_I(inode)); |
27919067 | 5240 | if (ret) |
b7b1167c | 5241 | goto out; |
0e8c36a9 | 5242 | |
2adc75d6 JB |
5243 | /* |
5244 | * This drops any pending insert or delete operations we have for this | |
5245 | * inode. We could have a delayed dir index deletion queued up, but | |
5246 | * we're removing the inode completely so that'll be taken care of in | |
5247 | * the truncate. | |
5248 | */ | |
5249 | btrfs_kill_delayed_inode_items(BTRFS_I(inode)); | |
5250 | ||
2ff7e61e | 5251 | rsv = btrfs_alloc_block_rsv(fs_info, BTRFS_BLOCK_RSV_TEMP); |
27919067 | 5252 | if (!rsv) |
b7b1167c | 5253 | goto out; |
2bd36e7b | 5254 | rsv->size = btrfs_calc_metadata_size(fs_info, 1); |
710d5921 | 5255 | rsv->failfast = true; |
4289a667 | 5256 | |
6ef06d27 | 5257 | btrfs_i_size_write(BTRFS_I(inode), 0); |
5f39d397 | 5258 | |
8082510e | 5259 | while (1) { |
d9ac19c3 | 5260 | struct btrfs_truncate_control control = { |
71d18b53 | 5261 | .inode = BTRFS_I(inode), |
487e81d2 | 5262 | .ino = btrfs_ino(BTRFS_I(inode)), |
d9ac19c3 JB |
5263 | .new_size = 0, |
5264 | .min_type = 0, | |
5265 | }; | |
5266 | ||
ad80cf50 | 5267 | trans = evict_refill_and_join(root, rsv); |
27919067 | 5268 | if (IS_ERR(trans)) |
b7b1167c | 5269 | goto out; |
7b128766 | 5270 | |
4289a667 JB |
5271 | trans->block_rsv = rsv; |
5272 | ||
71d18b53 | 5273 | ret = btrfs_truncate_inode_items(trans, root, &control); |
27919067 OS |
5274 | trans->block_rsv = &fs_info->trans_block_rsv; |
5275 | btrfs_end_transaction(trans); | |
afa4b0af FM |
5276 | /* |
5277 | * We have not added new delayed items for our inode after we | |
5278 | * have flushed its delayed items, so no need to throttle on | |
5279 | * delayed items. However we have modified extent buffers. | |
5280 | */ | |
5281 | btrfs_btree_balance_dirty_nodelay(fs_info); | |
27919067 | 5282 | if (ret && ret != -ENOSPC && ret != -EAGAIN) |
b7b1167c | 5283 | goto out; |
27919067 | 5284 | else if (!ret) |
8082510e | 5285 | break; |
8082510e | 5286 | } |
5f39d397 | 5287 | |
4ef31a45 | 5288 | /* |
27919067 OS |
5289 | * Errors here aren't a big deal, it just means we leave orphan items in |
5290 | * the tree. They will be cleaned up on the next mount. If the inode | |
5291 | * number gets reused, cleanup deletes the orphan item without doing | |
5292 | * anything, and unlink reuses the existing orphan item. | |
5293 | * | |
5294 | * If it turns out that we are dropping too many of these, we might want | |
5295 | * to add a mechanism for retrying these after a commit. | |
4ef31a45 | 5296 | */ |
ad80cf50 | 5297 | trans = evict_refill_and_join(root, rsv); |
27919067 OS |
5298 | if (!IS_ERR(trans)) { |
5299 | trans->block_rsv = rsv; | |
5300 | btrfs_orphan_del(trans, BTRFS_I(inode)); | |
5301 | trans->block_rsv = &fs_info->trans_block_rsv; | |
5302 | btrfs_end_transaction(trans); | |
5303 | } | |
54aa1f4d | 5304 | |
b7b1167c | 5305 | out: |
27919067 | 5306 | btrfs_free_block_rsv(fs_info, rsv); |
27919067 OS |
5307 | /* |
5308 | * If we didn't successfully delete, the orphan item will still be in | |
5309 | * the tree and we'll retry on the next mount. Again, we might also want | |
5310 | * to retry these periodically in the future. | |
5311 | */ | |
f48d1cf5 | 5312 | btrfs_remove_delayed_node(BTRFS_I(inode)); |
14605409 | 5313 | fsverity_cleanup_inode(inode); |
dbd5768f | 5314 | clear_inode(inode); |
39279cc3 CM |
5315 | } |
5316 | ||
5317 | /* | |
6bf9e4bd QW |
5318 | * Return the key found in the dir entry in the location pointer, fill @type |
5319 | * with BTRFS_FT_*, and return 0. | |
5320 | * | |
005d6712 SY |
5321 | * If no dir entries were found, returns -ENOENT. |
5322 | * If found a corrupted location in dir entry, returns -EUCLEAN. | |
39279cc3 | 5323 | */ |
d1de429b | 5324 | static int btrfs_inode_by_name(struct btrfs_inode *dir, struct dentry *dentry, |
6bf9e4bd | 5325 | struct btrfs_key *location, u8 *type) |
39279cc3 | 5326 | { |
39279cc3 CM |
5327 | struct btrfs_dir_item *di; |
5328 | struct btrfs_path *path; | |
d1de429b | 5329 | struct btrfs_root *root = dir->root; |
0d9f7f3e | 5330 | int ret = 0; |
ab3c5c18 | 5331 | struct fscrypt_name fname; |
39279cc3 CM |
5332 | |
5333 | path = btrfs_alloc_path(); | |
d8926bb3 MF |
5334 | if (!path) |
5335 | return -ENOMEM; | |
3954401f | 5336 | |
d1de429b | 5337 | ret = fscrypt_setup_filename(&dir->vfs_inode, &dentry->d_name, 1, &fname); |
10a8857a | 5338 | if (ret < 0) |
ab3c5c18 | 5339 | goto out; |
10a8857a STD |
5340 | /* |
5341 | * fscrypt_setup_filename() should never return a positive value, but | |
5342 | * gcc on sparc/parisc thinks it can, so assert that doesn't happen. | |
5343 | */ | |
5344 | ASSERT(ret == 0); | |
ab3c5c18 | 5345 | |
ab3c5c18 STD |
5346 | /* This needs to handle no-key deletions later on */ |
5347 | ||
d1de429b | 5348 | di = btrfs_lookup_dir_item(NULL, root, path, btrfs_ino(dir), |
6db75318 | 5349 | &fname.disk_name, 0); |
3cf5068f LB |
5350 | if (IS_ERR_OR_NULL(di)) { |
5351 | ret = di ? PTR_ERR(di) : -ENOENT; | |
005d6712 SY |
5352 | goto out; |
5353 | } | |
d397712b | 5354 | |
5f39d397 | 5355 | btrfs_dir_item_key_to_cpu(path->nodes[0], di, location); |
56a0e706 LB |
5356 | if (location->type != BTRFS_INODE_ITEM_KEY && |
5357 | location->type != BTRFS_ROOT_ITEM_KEY) { | |
005d6712 | 5358 | ret = -EUCLEAN; |
56a0e706 LB |
5359 | btrfs_warn(root->fs_info, |
5360 | "%s gets something invalid in DIR_ITEM (name %s, directory ino %llu, location(%llu %u %llu))", | |
d1de429b | 5361 | __func__, fname.disk_name.name, btrfs_ino(dir), |
56a0e706 | 5362 | location->objectid, location->type, location->offset); |
56a0e706 | 5363 | } |
6bf9e4bd | 5364 | if (!ret) |
94a48aef | 5365 | *type = btrfs_dir_ftype(path->nodes[0], di); |
39279cc3 | 5366 | out: |
ab3c5c18 | 5367 | fscrypt_free_filename(&fname); |
39279cc3 CM |
5368 | btrfs_free_path(path); |
5369 | return ret; | |
5370 | } | |
5371 | ||
5372 | /* | |
5373 | * when we hit a tree root in a directory, the btrfs part of the inode | |
5374 | * needs to be changed to reflect the root directory of the tree root. This | |
5375 | * is kind of like crossing a mount point. | |
5376 | */ | |
2ff7e61e | 5377 | static int fixup_tree_root_location(struct btrfs_fs_info *fs_info, |
3c1b1c4c | 5378 | struct btrfs_inode *dir, |
4df27c4d YZ |
5379 | struct dentry *dentry, |
5380 | struct btrfs_key *location, | |
5381 | struct btrfs_root **sub_root) | |
39279cc3 | 5382 | { |
4df27c4d YZ |
5383 | struct btrfs_path *path; |
5384 | struct btrfs_root *new_root; | |
5385 | struct btrfs_root_ref *ref; | |
5386 | struct extent_buffer *leaf; | |
1d4c08e0 | 5387 | struct btrfs_key key; |
4df27c4d YZ |
5388 | int ret; |
5389 | int err = 0; | |
ab3c5c18 | 5390 | struct fscrypt_name fname; |
ab3c5c18 | 5391 | |
3c1b1c4c | 5392 | ret = fscrypt_setup_filename(&dir->vfs_inode, &dentry->d_name, 0, &fname); |
ab3c5c18 STD |
5393 | if (ret) |
5394 | return ret; | |
39279cc3 | 5395 | |
4df27c4d YZ |
5396 | path = btrfs_alloc_path(); |
5397 | if (!path) { | |
5398 | err = -ENOMEM; | |
5399 | goto out; | |
5400 | } | |
39279cc3 | 5401 | |
4df27c4d | 5402 | err = -ENOENT; |
3c1b1c4c | 5403 | key.objectid = dir->root->root_key.objectid; |
1d4c08e0 DS |
5404 | key.type = BTRFS_ROOT_REF_KEY; |
5405 | key.offset = location->objectid; | |
5406 | ||
0b246afa | 5407 | ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, path, 0, 0); |
4df27c4d YZ |
5408 | if (ret) { |
5409 | if (ret < 0) | |
5410 | err = ret; | |
5411 | goto out; | |
5412 | } | |
39279cc3 | 5413 | |
4df27c4d YZ |
5414 | leaf = path->nodes[0]; |
5415 | ref = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_root_ref); | |
3c1b1c4c | 5416 | if (btrfs_root_ref_dirid(leaf, ref) != btrfs_ino(dir) || |
6db75318 | 5417 | btrfs_root_ref_name_len(leaf, ref) != fname.disk_name.len) |
4df27c4d | 5418 | goto out; |
39279cc3 | 5419 | |
6db75318 STD |
5420 | ret = memcmp_extent_buffer(leaf, fname.disk_name.name, |
5421 | (unsigned long)(ref + 1), fname.disk_name.len); | |
4df27c4d YZ |
5422 | if (ret) |
5423 | goto out; | |
5424 | ||
b3b4aa74 | 5425 | btrfs_release_path(path); |
4df27c4d | 5426 | |
56e9357a | 5427 | new_root = btrfs_get_fs_root(fs_info, location->objectid, true); |
4df27c4d YZ |
5428 | if (IS_ERR(new_root)) { |
5429 | err = PTR_ERR(new_root); | |
5430 | goto out; | |
5431 | } | |
5432 | ||
4df27c4d YZ |
5433 | *sub_root = new_root; |
5434 | location->objectid = btrfs_root_dirid(&new_root->root_item); | |
5435 | location->type = BTRFS_INODE_ITEM_KEY; | |
5436 | location->offset = 0; | |
5437 | err = 0; | |
5438 | out: | |
5439 | btrfs_free_path(path); | |
ab3c5c18 | 5440 | fscrypt_free_filename(&fname); |
4df27c4d | 5441 | return err; |
39279cc3 CM |
5442 | } |
5443 | ||
4c45a4f4 | 5444 | static void inode_tree_add(struct btrfs_inode *inode) |
5d4f98a2 | 5445 | { |
4c45a4f4 | 5446 | struct btrfs_root *root = inode->root; |
5d4f98a2 | 5447 | struct btrfs_inode *entry; |
03e860bd NP |
5448 | struct rb_node **p; |
5449 | struct rb_node *parent; | |
4c45a4f4 DS |
5450 | struct rb_node *new = &inode->rb_node; |
5451 | u64 ino = btrfs_ino(inode); | |
5d4f98a2 | 5452 | |
4c45a4f4 | 5453 | if (inode_unhashed(&inode->vfs_inode)) |
76dda93c | 5454 | return; |
e1409cef | 5455 | parent = NULL; |
5d4f98a2 | 5456 | spin_lock(&root->inode_lock); |
e1409cef | 5457 | p = &root->inode_tree.rb_node; |
5d4f98a2 YZ |
5458 | while (*p) { |
5459 | parent = *p; | |
5460 | entry = rb_entry(parent, struct btrfs_inode, rb_node); | |
5461 | ||
37508515 | 5462 | if (ino < btrfs_ino(entry)) |
03e860bd | 5463 | p = &parent->rb_left; |
37508515 | 5464 | else if (ino > btrfs_ino(entry)) |
03e860bd | 5465 | p = &parent->rb_right; |
5d4f98a2 YZ |
5466 | else { |
5467 | WARN_ON(!(entry->vfs_inode.i_state & | |
a4ffdde6 | 5468 | (I_WILL_FREE | I_FREEING))); |
cef21937 | 5469 | rb_replace_node(parent, new, &root->inode_tree); |
03e860bd NP |
5470 | RB_CLEAR_NODE(parent); |
5471 | spin_unlock(&root->inode_lock); | |
cef21937 | 5472 | return; |
5d4f98a2 YZ |
5473 | } |
5474 | } | |
cef21937 FDBM |
5475 | rb_link_node(new, parent, p); |
5476 | rb_insert_color(new, &root->inode_tree); | |
5d4f98a2 YZ |
5477 | spin_unlock(&root->inode_lock); |
5478 | } | |
5479 | ||
b79b7249 | 5480 | static void inode_tree_del(struct btrfs_inode *inode) |
5d4f98a2 | 5481 | { |
b79b7249 | 5482 | struct btrfs_root *root = inode->root; |
76dda93c | 5483 | int empty = 0; |
5d4f98a2 | 5484 | |
03e860bd | 5485 | spin_lock(&root->inode_lock); |
b79b7249 NB |
5486 | if (!RB_EMPTY_NODE(&inode->rb_node)) { |
5487 | rb_erase(&inode->rb_node, &root->inode_tree); | |
5488 | RB_CLEAR_NODE(&inode->rb_node); | |
76dda93c | 5489 | empty = RB_EMPTY_ROOT(&root->inode_tree); |
5d4f98a2 | 5490 | } |
03e860bd | 5491 | spin_unlock(&root->inode_lock); |
76dda93c | 5492 | |
69e9c6c6 | 5493 | if (empty && btrfs_root_refs(&root->root_item) == 0) { |
76dda93c YZ |
5494 | spin_lock(&root->inode_lock); |
5495 | empty = RB_EMPTY_ROOT(&root->inode_tree); | |
5496 | spin_unlock(&root->inode_lock); | |
5497 | if (empty) | |
5498 | btrfs_add_dead_root(root); | |
5499 | } | |
5500 | } | |
5501 | ||
5d4f98a2 | 5502 | |
e02119d5 CM |
5503 | static int btrfs_init_locked_inode(struct inode *inode, void *p) |
5504 | { | |
5505 | struct btrfs_iget_args *args = p; | |
0202e83f DS |
5506 | |
5507 | inode->i_ino = args->ino; | |
5508 | BTRFS_I(inode)->location.objectid = args->ino; | |
5509 | BTRFS_I(inode)->location.type = BTRFS_INODE_ITEM_KEY; | |
5510 | BTRFS_I(inode)->location.offset = 0; | |
5c8fd99f JB |
5511 | BTRFS_I(inode)->root = btrfs_grab_root(args->root); |
5512 | BUG_ON(args->root && !BTRFS_I(inode)->root); | |
9b9b8854 JB |
5513 | |
5514 | if (args->root && args->root == args->root->fs_info->tree_root && | |
5515 | args->ino != BTRFS_BTREE_INODE_OBJECTID) | |
5516 | set_bit(BTRFS_INODE_FREE_SPACE_INODE, | |
5517 | &BTRFS_I(inode)->runtime_flags); | |
39279cc3 CM |
5518 | return 0; |
5519 | } | |
5520 | ||
5521 | static int btrfs_find_actor(struct inode *inode, void *opaque) | |
5522 | { | |
5523 | struct btrfs_iget_args *args = opaque; | |
0202e83f DS |
5524 | |
5525 | return args->ino == BTRFS_I(inode)->location.objectid && | |
d397712b | 5526 | args->root == BTRFS_I(inode)->root; |
39279cc3 CM |
5527 | } |
5528 | ||
0202e83f | 5529 | static struct inode *btrfs_iget_locked(struct super_block *s, u64 ino, |
5d4f98a2 | 5530 | struct btrfs_root *root) |
39279cc3 CM |
5531 | { |
5532 | struct inode *inode; | |
5533 | struct btrfs_iget_args args; | |
0202e83f | 5534 | unsigned long hashval = btrfs_inode_hash(ino, root); |
778ba82b | 5535 | |
0202e83f | 5536 | args.ino = ino; |
39279cc3 CM |
5537 | args.root = root; |
5538 | ||
778ba82b | 5539 | inode = iget5_locked(s, hashval, btrfs_find_actor, |
39279cc3 CM |
5540 | btrfs_init_locked_inode, |
5541 | (void *)&args); | |
5542 | return inode; | |
5543 | } | |
5544 | ||
4c66e0d4 | 5545 | /* |
0202e83f | 5546 | * Get an inode object given its inode number and corresponding root. |
4c66e0d4 DS |
5547 | * Path can be preallocated to prevent recursing back to iget through |
5548 | * allocator. NULL is also valid but may require an additional allocation | |
5549 | * later. | |
1a54ef8c | 5550 | */ |
0202e83f | 5551 | struct inode *btrfs_iget_path(struct super_block *s, u64 ino, |
4c66e0d4 | 5552 | struct btrfs_root *root, struct btrfs_path *path) |
1a54ef8c BR |
5553 | { |
5554 | struct inode *inode; | |
5555 | ||
0202e83f | 5556 | inode = btrfs_iget_locked(s, ino, root); |
1a54ef8c | 5557 | if (!inode) |
5d4f98a2 | 5558 | return ERR_PTR(-ENOMEM); |
1a54ef8c BR |
5559 | |
5560 | if (inode->i_state & I_NEW) { | |
67710892 FM |
5561 | int ret; |
5562 | ||
4222ea71 | 5563 | ret = btrfs_read_locked_inode(inode, path); |
9bc2ceff | 5564 | if (!ret) { |
4c45a4f4 | 5565 | inode_tree_add(BTRFS_I(inode)); |
1748f843 | 5566 | unlock_new_inode(inode); |
1748f843 | 5567 | } else { |
f5b3a417 AV |
5568 | iget_failed(inode); |
5569 | /* | |
5570 | * ret > 0 can come from btrfs_search_slot called by | |
5571 | * btrfs_read_locked_inode, this means the inode item | |
5572 | * was not found. | |
5573 | */ | |
5574 | if (ret > 0) | |
5575 | ret = -ENOENT; | |
5576 | inode = ERR_PTR(ret); | |
1748f843 MF |
5577 | } |
5578 | } | |
5579 | ||
1a54ef8c BR |
5580 | return inode; |
5581 | } | |
5582 | ||
0202e83f | 5583 | struct inode *btrfs_iget(struct super_block *s, u64 ino, struct btrfs_root *root) |
4222ea71 | 5584 | { |
0202e83f | 5585 | return btrfs_iget_path(s, ino, root, NULL); |
4222ea71 FM |
5586 | } |
5587 | ||
94628ad9 | 5588 | static struct inode *new_simple_dir(struct inode *dir, |
4df27c4d YZ |
5589 | struct btrfs_key *key, |
5590 | struct btrfs_root *root) | |
5591 | { | |
94628ad9 | 5592 | struct inode *inode = new_inode(dir->i_sb); |
4df27c4d YZ |
5593 | |
5594 | if (!inode) | |
5595 | return ERR_PTR(-ENOMEM); | |
5596 | ||
5c8fd99f | 5597 | BTRFS_I(inode)->root = btrfs_grab_root(root); |
4df27c4d | 5598 | memcpy(&BTRFS_I(inode)->location, key, sizeof(*key)); |
72ac3c0d | 5599 | set_bit(BTRFS_INODE_DUMMY, &BTRFS_I(inode)->runtime_flags); |
4df27c4d YZ |
5600 | |
5601 | inode->i_ino = BTRFS_EMPTY_SUBVOL_DIR_OBJECTID; | |
6bb6b514 OS |
5602 | /* |
5603 | * We only need lookup, the rest is read-only and there's no inode | |
5604 | * associated with the dentry | |
5605 | */ | |
5606 | inode->i_op = &simple_dir_inode_operations; | |
1fdf4194 | 5607 | inode->i_opflags &= ~IOP_XATTR; |
4df27c4d YZ |
5608 | inode->i_fop = &simple_dir_operations; |
5609 | inode->i_mode = S_IFDIR | S_IRUGO | S_IWUSR | S_IXUGO; | |
2a9462de | 5610 | inode->i_mtime = inode_set_ctime_current(inode); |
94628ad9 | 5611 | inode->i_atime = dir->i_atime; |
d3c6be6f | 5612 | BTRFS_I(inode)->i_otime = inode->i_mtime; |
94628ad9 LT |
5613 | inode->i_uid = dir->i_uid; |
5614 | inode->i_gid = dir->i_gid; | |
4df27c4d YZ |
5615 | |
5616 | return inode; | |
5617 | } | |
5618 | ||
a55e65b8 DS |
5619 | static_assert(BTRFS_FT_UNKNOWN == FT_UNKNOWN); |
5620 | static_assert(BTRFS_FT_REG_FILE == FT_REG_FILE); | |
5621 | static_assert(BTRFS_FT_DIR == FT_DIR); | |
5622 | static_assert(BTRFS_FT_CHRDEV == FT_CHRDEV); | |
5623 | static_assert(BTRFS_FT_BLKDEV == FT_BLKDEV); | |
5624 | static_assert(BTRFS_FT_FIFO == FT_FIFO); | |
5625 | static_assert(BTRFS_FT_SOCK == FT_SOCK); | |
5626 | static_assert(BTRFS_FT_SYMLINK == FT_SYMLINK); | |
5627 | ||
6bf9e4bd QW |
5628 | static inline u8 btrfs_inode_type(struct inode *inode) |
5629 | { | |
6bf9e4bd QW |
5630 | return fs_umode_to_ftype(inode->i_mode); |
5631 | } | |
5632 | ||
3de4586c | 5633 | struct inode *btrfs_lookup_dentry(struct inode *dir, struct dentry *dentry) |
39279cc3 | 5634 | { |
0b246afa | 5635 | struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb); |
d397712b | 5636 | struct inode *inode; |
4df27c4d | 5637 | struct btrfs_root *root = BTRFS_I(dir)->root; |
39279cc3 CM |
5638 | struct btrfs_root *sub_root = root; |
5639 | struct btrfs_key location; | |
6bf9e4bd | 5640 | u8 di_type = 0; |
b4aff1f8 | 5641 | int ret = 0; |
39279cc3 CM |
5642 | |
5643 | if (dentry->d_name.len > BTRFS_NAME_LEN) | |
5644 | return ERR_PTR(-ENAMETOOLONG); | |
5f39d397 | 5645 | |
d1de429b | 5646 | ret = btrfs_inode_by_name(BTRFS_I(dir), dentry, &location, &di_type); |
39279cc3 CM |
5647 | if (ret < 0) |
5648 | return ERR_PTR(ret); | |
5f39d397 | 5649 | |
4df27c4d | 5650 | if (location.type == BTRFS_INODE_ITEM_KEY) { |
0202e83f | 5651 | inode = btrfs_iget(dir->i_sb, location.objectid, root); |
6bf9e4bd QW |
5652 | if (IS_ERR(inode)) |
5653 | return inode; | |
5654 | ||
5655 | /* Do extra check against inode mode with di_type */ | |
5656 | if (btrfs_inode_type(inode) != di_type) { | |
5657 | btrfs_crit(fs_info, | |
5658 | "inode mode mismatch with dir: inode mode=0%o btrfs type=%u dir type=%u", | |
5659 | inode->i_mode, btrfs_inode_type(inode), | |
5660 | di_type); | |
5661 | iput(inode); | |
5662 | return ERR_PTR(-EUCLEAN); | |
5663 | } | |
4df27c4d YZ |
5664 | return inode; |
5665 | } | |
5666 | ||
3c1b1c4c | 5667 | ret = fixup_tree_root_location(fs_info, BTRFS_I(dir), dentry, |
4df27c4d YZ |
5668 | &location, &sub_root); |
5669 | if (ret < 0) { | |
5670 | if (ret != -ENOENT) | |
5671 | inode = ERR_PTR(ret); | |
5672 | else | |
94628ad9 | 5673 | inode = new_simple_dir(dir, &location, root); |
4df27c4d | 5674 | } else { |
0202e83f | 5675 | inode = btrfs_iget(dir->i_sb, location.objectid, sub_root); |
00246528 | 5676 | btrfs_put_root(sub_root); |
76dda93c | 5677 | |
fc8b235f NB |
5678 | if (IS_ERR(inode)) |
5679 | return inode; | |
5680 | ||
0b246afa | 5681 | down_read(&fs_info->cleanup_work_sem); |
bc98a42c | 5682 | if (!sb_rdonly(inode->i_sb)) |
66b4ffd1 | 5683 | ret = btrfs_orphan_cleanup(sub_root); |
0b246afa | 5684 | up_read(&fs_info->cleanup_work_sem); |
01cd3367 JB |
5685 | if (ret) { |
5686 | iput(inode); | |
66b4ffd1 | 5687 | inode = ERR_PTR(ret); |
01cd3367 | 5688 | } |
c71bf099 YZ |
5689 | } |
5690 | ||
3de4586c CM |
5691 | return inode; |
5692 | } | |
5693 | ||
fe15ce44 | 5694 | static int btrfs_dentry_delete(const struct dentry *dentry) |
76dda93c YZ |
5695 | { |
5696 | struct btrfs_root *root; | |
2b0143b5 | 5697 | struct inode *inode = d_inode(dentry); |
76dda93c | 5698 | |
848cce0d | 5699 | if (!inode && !IS_ROOT(dentry)) |
2b0143b5 | 5700 | inode = d_inode(dentry->d_parent); |
76dda93c | 5701 | |
848cce0d LZ |
5702 | if (inode) { |
5703 | root = BTRFS_I(inode)->root; | |
efefb143 YZ |
5704 | if (btrfs_root_refs(&root->root_item) == 0) |
5705 | return 1; | |
848cce0d | 5706 | |
4a0cc7ca | 5707 | if (btrfs_ino(BTRFS_I(inode)) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID) |
848cce0d | 5708 | return 1; |
efefb143 | 5709 | } |
76dda93c YZ |
5710 | return 0; |
5711 | } | |
5712 | ||
3de4586c | 5713 | static struct dentry *btrfs_lookup(struct inode *dir, struct dentry *dentry, |
00cd8dd3 | 5714 | unsigned int flags) |
3de4586c | 5715 | { |
3837d208 | 5716 | struct inode *inode = btrfs_lookup_dentry(dir, dentry); |
5662344b | 5717 | |
3837d208 AV |
5718 | if (inode == ERR_PTR(-ENOENT)) |
5719 | inode = NULL; | |
41d28bca | 5720 | return d_splice_alias(inode, dentry); |
39279cc3 CM |
5721 | } |
5722 | ||
9b378f6a FM |
5723 | /* |
5724 | * Find the highest existing sequence number in a directory and then set the | |
5725 | * in-memory index_cnt variable to the first free sequence number. | |
5726 | */ | |
5727 | static int btrfs_set_inode_index_count(struct btrfs_inode *inode) | |
5728 | { | |
5729 | struct btrfs_root *root = inode->root; | |
5730 | struct btrfs_key key, found_key; | |
5731 | struct btrfs_path *path; | |
5732 | struct extent_buffer *leaf; | |
5733 | int ret; | |
5734 | ||
5735 | key.objectid = btrfs_ino(inode); | |
5736 | key.type = BTRFS_DIR_INDEX_KEY; | |
5737 | key.offset = (u64)-1; | |
5738 | ||
5739 | path = btrfs_alloc_path(); | |
5740 | if (!path) | |
5741 | return -ENOMEM; | |
5742 | ||
5743 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); | |
5744 | if (ret < 0) | |
5745 | goto out; | |
5746 | /* FIXME: we should be able to handle this */ | |
5747 | if (ret == 0) | |
5748 | goto out; | |
5749 | ret = 0; | |
5750 | ||
5751 | if (path->slots[0] == 0) { | |
5752 | inode->index_cnt = BTRFS_DIR_START_INDEX; | |
5753 | goto out; | |
5754 | } | |
5755 | ||
5756 | path->slots[0]--; | |
5757 | ||
5758 | leaf = path->nodes[0]; | |
5759 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); | |
5760 | ||
5761 | if (found_key.objectid != btrfs_ino(inode) || | |
5762 | found_key.type != BTRFS_DIR_INDEX_KEY) { | |
5763 | inode->index_cnt = BTRFS_DIR_START_INDEX; | |
5764 | goto out; | |
5765 | } | |
5766 | ||
5767 | inode->index_cnt = found_key.offset + 1; | |
5768 | out: | |
5769 | btrfs_free_path(path); | |
5770 | return ret; | |
5771 | } | |
5772 | ||
5773 | static int btrfs_get_dir_last_index(struct btrfs_inode *dir, u64 *index) | |
5774 | { | |
8e7f82de | 5775 | int ret = 0; |
9b378f6a | 5776 | |
8e7f82de FM |
5777 | btrfs_inode_lock(dir, 0); |
5778 | if (dir->index_cnt == (u64)-1) { | |
9b378f6a FM |
5779 | ret = btrfs_inode_delayed_dir_index_count(dir); |
5780 | if (ret) { | |
5781 | ret = btrfs_set_inode_index_count(dir); | |
5782 | if (ret) | |
8e7f82de | 5783 | goto out; |
9b378f6a FM |
5784 | } |
5785 | } | |
5786 | ||
35795036 FM |
5787 | /* index_cnt is the index number of next new entry, so decrement it. */ |
5788 | *index = dir->index_cnt - 1; | |
8e7f82de FM |
5789 | out: |
5790 | btrfs_inode_unlock(dir, 0); | |
9b378f6a | 5791 | |
8e7f82de | 5792 | return ret; |
9b378f6a FM |
5793 | } |
5794 | ||
23b5ec74 JB |
5795 | /* |
5796 | * All this infrastructure exists because dir_emit can fault, and we are holding | |
5797 | * the tree lock when doing readdir. For now just allocate a buffer and copy | |
5798 | * our information into that, and then dir_emit from the buffer. This is | |
5799 | * similar to what NFS does, only we don't keep the buffer around in pagecache | |
5800 | * because I'm afraid I'll mess that up. Long term we need to make filldir do | |
5801 | * copy_to_user_inatomic so we don't have to worry about page faulting under the | |
5802 | * tree lock. | |
5803 | */ | |
5804 | static int btrfs_opendir(struct inode *inode, struct file *file) | |
5805 | { | |
5806 | struct btrfs_file_private *private; | |
9b378f6a FM |
5807 | u64 last_index; |
5808 | int ret; | |
5809 | ||
5810 | ret = btrfs_get_dir_last_index(BTRFS_I(inode), &last_index); | |
5811 | if (ret) | |
5812 | return ret; | |
23b5ec74 JB |
5813 | |
5814 | private = kzalloc(sizeof(struct btrfs_file_private), GFP_KERNEL); | |
5815 | if (!private) | |
5816 | return -ENOMEM; | |
9b378f6a | 5817 | private->last_index = last_index; |
23b5ec74 JB |
5818 | private->filldir_buf = kzalloc(PAGE_SIZE, GFP_KERNEL); |
5819 | if (!private->filldir_buf) { | |
5820 | kfree(private); | |
5821 | return -ENOMEM; | |
5822 | } | |
5823 | file->private_data = private; | |
5824 | return 0; | |
5825 | } | |
5826 | ||
e60aa5da FM |
5827 | static loff_t btrfs_dir_llseek(struct file *file, loff_t offset, int whence) |
5828 | { | |
5829 | struct btrfs_file_private *private = file->private_data; | |
5830 | int ret; | |
5831 | ||
5832 | ret = btrfs_get_dir_last_index(BTRFS_I(file_inode(file)), | |
5833 | &private->last_index); | |
5834 | if (ret) | |
5835 | return ret; | |
5836 | ||
5837 | return generic_file_llseek(file, offset, whence); | |
5838 | } | |
5839 | ||
23b5ec74 JB |
5840 | struct dir_entry { |
5841 | u64 ino; | |
5842 | u64 offset; | |
5843 | unsigned type; | |
5844 | int name_len; | |
5845 | }; | |
5846 | ||
5847 | static int btrfs_filldir(void *addr, int entries, struct dir_context *ctx) | |
5848 | { | |
5849 | while (entries--) { | |
5850 | struct dir_entry *entry = addr; | |
5851 | char *name = (char *)(entry + 1); | |
5852 | ||
92d32170 DS |
5853 | ctx->pos = get_unaligned(&entry->offset); |
5854 | if (!dir_emit(ctx, name, get_unaligned(&entry->name_len), | |
5855 | get_unaligned(&entry->ino), | |
5856 | get_unaligned(&entry->type))) | |
23b5ec74 | 5857 | return 1; |
92d32170 DS |
5858 | addr += sizeof(struct dir_entry) + |
5859 | get_unaligned(&entry->name_len); | |
23b5ec74 JB |
5860 | ctx->pos++; |
5861 | } | |
5862 | return 0; | |
5863 | } | |
5864 | ||
9cdda8d3 | 5865 | static int btrfs_real_readdir(struct file *file, struct dir_context *ctx) |
39279cc3 | 5866 | { |
9cdda8d3 | 5867 | struct inode *inode = file_inode(file); |
39279cc3 | 5868 | struct btrfs_root *root = BTRFS_I(inode)->root; |
23b5ec74 | 5869 | struct btrfs_file_private *private = file->private_data; |
39279cc3 CM |
5870 | struct btrfs_dir_item *di; |
5871 | struct btrfs_key key; | |
5f39d397 | 5872 | struct btrfs_key found_key; |
39279cc3 | 5873 | struct btrfs_path *path; |
23b5ec74 | 5874 | void *addr; |
84af994b RJ |
5875 | LIST_HEAD(ins_list); |
5876 | LIST_HEAD(del_list); | |
39279cc3 | 5877 | int ret; |
5f39d397 CM |
5878 | char *name_ptr; |
5879 | int name_len; | |
23b5ec74 JB |
5880 | int entries = 0; |
5881 | int total_len = 0; | |
02dbfc99 | 5882 | bool put = false; |
c2951f32 | 5883 | struct btrfs_key location; |
5f39d397 | 5884 | |
9cdda8d3 AV |
5885 | if (!dir_emit_dots(file, ctx)) |
5886 | return 0; | |
5887 | ||
49593bfa | 5888 | path = btrfs_alloc_path(); |
16cdcec7 MX |
5889 | if (!path) |
5890 | return -ENOMEM; | |
ff5714cc | 5891 | |
23b5ec74 | 5892 | addr = private->filldir_buf; |
e4058b54 | 5893 | path->reada = READA_FORWARD; |
49593bfa | 5894 | |
9b378f6a FM |
5895 | put = btrfs_readdir_get_delayed_items(inode, private->last_index, |
5896 | &ins_list, &del_list); | |
16cdcec7 | 5897 | |
23b5ec74 | 5898 | again: |
c2951f32 | 5899 | key.type = BTRFS_DIR_INDEX_KEY; |
9cdda8d3 | 5900 | key.offset = ctx->pos; |
4a0cc7ca | 5901 | key.objectid = btrfs_ino(BTRFS_I(inode)); |
5f39d397 | 5902 | |
a8ce68fd | 5903 | btrfs_for_each_slot(root, &key, &found_key, path, ret) { |
23b5ec74 | 5904 | struct dir_entry *entry; |
a8ce68fd | 5905 | struct extent_buffer *leaf = path->nodes[0]; |
94a48aef | 5906 | u8 ftype; |
5f39d397 CM |
5907 | |
5908 | if (found_key.objectid != key.objectid) | |
39279cc3 | 5909 | break; |
c2951f32 | 5910 | if (found_key.type != BTRFS_DIR_INDEX_KEY) |
39279cc3 | 5911 | break; |
9cdda8d3 | 5912 | if (found_key.offset < ctx->pos) |
a8ce68fd | 5913 | continue; |
9b378f6a FM |
5914 | if (found_key.offset > private->last_index) |
5915 | break; | |
c2951f32 | 5916 | if (btrfs_should_delete_dir_index(&del_list, found_key.offset)) |
a8ce68fd GN |
5917 | continue; |
5918 | di = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_dir_item); | |
c2951f32 | 5919 | name_len = btrfs_dir_name_len(leaf, di); |
23b5ec74 JB |
5920 | if ((total_len + sizeof(struct dir_entry) + name_len) >= |
5921 | PAGE_SIZE) { | |
5922 | btrfs_release_path(path); | |
5923 | ret = btrfs_filldir(private->filldir_buf, entries, ctx); | |
5924 | if (ret) | |
5925 | goto nopos; | |
5926 | addr = private->filldir_buf; | |
5927 | entries = 0; | |
5928 | total_len = 0; | |
5929 | goto again; | |
c2951f32 | 5930 | } |
23b5ec74 | 5931 | |
94a48aef | 5932 | ftype = btrfs_dir_flags_to_ftype(btrfs_dir_flags(leaf, di)); |
23b5ec74 | 5933 | entry = addr; |
23b5ec74 | 5934 | name_ptr = (char *)(entry + 1); |
94a48aef OS |
5935 | read_extent_buffer(leaf, name_ptr, |
5936 | (unsigned long)(di + 1), name_len); | |
5937 | put_unaligned(name_len, &entry->name_len); | |
5938 | put_unaligned(fs_ftype_to_dtype(ftype), &entry->type); | |
c2951f32 | 5939 | btrfs_dir_item_key_to_cpu(leaf, di, &location); |
92d32170 DS |
5940 | put_unaligned(location.objectid, &entry->ino); |
5941 | put_unaligned(found_key.offset, &entry->offset); | |
23b5ec74 JB |
5942 | entries++; |
5943 | addr += sizeof(struct dir_entry) + name_len; | |
5944 | total_len += sizeof(struct dir_entry) + name_len; | |
39279cc3 | 5945 | } |
a8ce68fd GN |
5946 | /* Catch error encountered during iteration */ |
5947 | if (ret < 0) | |
5948 | goto err; | |
5949 | ||
23b5ec74 JB |
5950 | btrfs_release_path(path); |
5951 | ||
5952 | ret = btrfs_filldir(private->filldir_buf, entries, ctx); | |
5953 | if (ret) | |
5954 | goto nopos; | |
49593bfa | 5955 | |
d2fbb2b5 | 5956 | ret = btrfs_readdir_delayed_dir_index(ctx, &ins_list); |
c2951f32 | 5957 | if (ret) |
bc4ef759 DS |
5958 | goto nopos; |
5959 | ||
db62efbb ZB |
5960 | /* |
5961 | * Stop new entries from being returned after we return the last | |
5962 | * entry. | |
5963 | * | |
5964 | * New directory entries are assigned a strictly increasing | |
5965 | * offset. This means that new entries created during readdir | |
5966 | * are *guaranteed* to be seen in the future by that readdir. | |
5967 | * This has broken buggy programs which operate on names as | |
5968 | * they're returned by readdir. Until we re-use freed offsets | |
5969 | * we have this hack to stop new entries from being returned | |
5970 | * under the assumption that they'll never reach this huge | |
5971 | * offset. | |
5972 | * | |
5973 | * This is being careful not to overflow 32bit loff_t unless the | |
5974 | * last entry requires it because doing so has broken 32bit apps | |
5975 | * in the past. | |
5976 | */ | |
c2951f32 JM |
5977 | if (ctx->pos >= INT_MAX) |
5978 | ctx->pos = LLONG_MAX; | |
5979 | else | |
5980 | ctx->pos = INT_MAX; | |
39279cc3 CM |
5981 | nopos: |
5982 | ret = 0; | |
5983 | err: | |
02dbfc99 OS |
5984 | if (put) |
5985 | btrfs_readdir_put_delayed_items(inode, &ins_list, &del_list); | |
39279cc3 | 5986 | btrfs_free_path(path); |
39279cc3 CM |
5987 | return ret; |
5988 | } | |
5989 | ||
39279cc3 | 5990 | /* |
54aa1f4d | 5991 | * This is somewhat expensive, updating the tree every time the |
39279cc3 CM |
5992 | * inode changes. But, it is most likely to find the inode in cache. |
5993 | * FIXME, needs more benchmarking...there are no reasons other than performance | |
5994 | * to keep or drop this code. | |
5995 | */ | |
7152b425 | 5996 | static int btrfs_dirty_inode(struct btrfs_inode *inode) |
39279cc3 | 5997 | { |
7152b425 DS |
5998 | struct btrfs_root *root = inode->root; |
5999 | struct btrfs_fs_info *fs_info = root->fs_info; | |
39279cc3 | 6000 | struct btrfs_trans_handle *trans; |
8929ecfa YZ |
6001 | int ret; |
6002 | ||
7152b425 | 6003 | if (test_bit(BTRFS_INODE_DUMMY, &inode->runtime_flags)) |
22c44fe6 | 6004 | return 0; |
39279cc3 | 6005 | |
7a7eaa40 | 6006 | trans = btrfs_join_transaction(root); |
22c44fe6 JB |
6007 | if (IS_ERR(trans)) |
6008 | return PTR_ERR(trans); | |
8929ecfa | 6009 | |
8b9d0322 | 6010 | ret = btrfs_update_inode(trans, inode); |
2199cb0f | 6011 | if (ret == -ENOSPC || ret == -EDQUOT) { |
94b60442 | 6012 | /* whoops, lets try again with the full transaction */ |
3a45bb20 | 6013 | btrfs_end_transaction(trans); |
94b60442 | 6014 | trans = btrfs_start_transaction(root, 1); |
22c44fe6 JB |
6015 | if (IS_ERR(trans)) |
6016 | return PTR_ERR(trans); | |
8929ecfa | 6017 | |
8b9d0322 | 6018 | ret = btrfs_update_inode(trans, inode); |
94b60442 | 6019 | } |
3a45bb20 | 6020 | btrfs_end_transaction(trans); |
7152b425 | 6021 | if (inode->delayed_node) |
2ff7e61e | 6022 | btrfs_balance_delayed_items(fs_info); |
22c44fe6 JB |
6023 | |
6024 | return ret; | |
6025 | } | |
6026 | ||
6027 | /* | |
6028 | * This is a copy of file_update_time. We need this so we can return error on | |
6029 | * ENOSPC for updating the inode in the case of file write and mmap writes. | |
6030 | */ | |
913e9928 | 6031 | static int btrfs_update_time(struct inode *inode, int flags) |
22c44fe6 | 6032 | { |
2bc55652 | 6033 | struct btrfs_root *root = BTRFS_I(inode)->root; |
3a8c7231 | 6034 | bool dirty = flags & ~S_VERSION; |
2bc55652 AB |
6035 | |
6036 | if (btrfs_root_readonly(root)) | |
6037 | return -EROFS; | |
6038 | ||
bb7cc0a6 | 6039 | dirty = inode_update_timestamps(inode, flags); |
7152b425 | 6040 | return dirty ? btrfs_dirty_inode(BTRFS_I(inode)) : 0; |
39279cc3 CM |
6041 | } |
6042 | ||
d352ac68 CM |
6043 | /* |
6044 | * helper to find a free sequence number in a given directory. This current | |
6045 | * code is very simple, later versions will do smarter things in the btree | |
6046 | */ | |
877574e2 | 6047 | int btrfs_set_inode_index(struct btrfs_inode *dir, u64 *index) |
aec7477b JB |
6048 | { |
6049 | int ret = 0; | |
6050 | ||
877574e2 NB |
6051 | if (dir->index_cnt == (u64)-1) { |
6052 | ret = btrfs_inode_delayed_dir_index_count(dir); | |
16cdcec7 MX |
6053 | if (ret) { |
6054 | ret = btrfs_set_inode_index_count(dir); | |
6055 | if (ret) | |
6056 | return ret; | |
6057 | } | |
aec7477b JB |
6058 | } |
6059 | ||
877574e2 NB |
6060 | *index = dir->index_cnt; |
6061 | dir->index_cnt++; | |
aec7477b JB |
6062 | |
6063 | return ret; | |
6064 | } | |
6065 | ||
b0d5d10f CM |
6066 | static int btrfs_insert_inode_locked(struct inode *inode) |
6067 | { | |
6068 | struct btrfs_iget_args args; | |
0202e83f DS |
6069 | |
6070 | args.ino = BTRFS_I(inode)->location.objectid; | |
b0d5d10f CM |
6071 | args.root = BTRFS_I(inode)->root; |
6072 | ||
6073 | return insert_inode_locked4(inode, | |
6074 | btrfs_inode_hash(inode->i_ino, BTRFS_I(inode)->root), | |
6075 | btrfs_find_actor, &args); | |
6076 | } | |
6077 | ||
3538d68d OS |
6078 | int btrfs_new_inode_prepare(struct btrfs_new_inode_args *args, |
6079 | unsigned int *trans_num_items) | |
6080 | { | |
6081 | struct inode *dir = args->dir; | |
6082 | struct inode *inode = args->inode; | |
6083 | int ret; | |
6084 | ||
ab3c5c18 STD |
6085 | if (!args->orphan) { |
6086 | ret = fscrypt_setup_filename(dir, &args->dentry->d_name, 0, | |
6087 | &args->fname); | |
6088 | if (ret) | |
6089 | return ret; | |
ab3c5c18 STD |
6090 | } |
6091 | ||
3538d68d | 6092 | ret = posix_acl_create(dir, &inode->i_mode, &args->default_acl, &args->acl); |
ab3c5c18 STD |
6093 | if (ret) { |
6094 | fscrypt_free_filename(&args->fname); | |
3538d68d | 6095 | return ret; |
ab3c5c18 | 6096 | } |
3538d68d OS |
6097 | |
6098 | /* 1 to add inode item */ | |
6099 | *trans_num_items = 1; | |
6100 | /* 1 to add compression property */ | |
6101 | if (BTRFS_I(dir)->prop_compress) | |
6102 | (*trans_num_items)++; | |
6103 | /* 1 to add default ACL xattr */ | |
6104 | if (args->default_acl) | |
6105 | (*trans_num_items)++; | |
6106 | /* 1 to add access ACL xattr */ | |
6107 | if (args->acl) | |
6108 | (*trans_num_items)++; | |
6109 | #ifdef CONFIG_SECURITY | |
6110 | /* 1 to add LSM xattr */ | |
6111 | if (dir->i_security) | |
6112 | (*trans_num_items)++; | |
6113 | #endif | |
6114 | if (args->orphan) { | |
6115 | /* 1 to add orphan item */ | |
6116 | (*trans_num_items)++; | |
6117 | } else { | |
6118 | /* | |
3538d68d OS |
6119 | * 1 to add dir item |
6120 | * 1 to add dir index | |
6121 | * 1 to update parent inode item | |
97bdf1a9 FM |
6122 | * |
6123 | * No need for 1 unit for the inode ref item because it is | |
6124 | * inserted in a batch together with the inode item at | |
6125 | * btrfs_create_new_inode(). | |
3538d68d | 6126 | */ |
97bdf1a9 | 6127 | *trans_num_items += 3; |
3538d68d OS |
6128 | } |
6129 | return 0; | |
6130 | } | |
6131 | ||
6132 | void btrfs_new_inode_args_destroy(struct btrfs_new_inode_args *args) | |
6133 | { | |
6134 | posix_acl_release(args->acl); | |
6135 | posix_acl_release(args->default_acl); | |
ab3c5c18 | 6136 | fscrypt_free_filename(&args->fname); |
3538d68d OS |
6137 | } |
6138 | ||
19aee8de AJ |
6139 | /* |
6140 | * Inherit flags from the parent inode. | |
6141 | * | |
6142 | * Currently only the compression flags and the cow flags are inherited. | |
6143 | */ | |
7a0443f0 | 6144 | static void btrfs_inherit_iflags(struct btrfs_inode *inode, struct btrfs_inode *dir) |
19aee8de AJ |
6145 | { |
6146 | unsigned int flags; | |
6147 | ||
7a0443f0 | 6148 | flags = dir->flags; |
19aee8de AJ |
6149 | |
6150 | if (flags & BTRFS_INODE_NOCOMPRESS) { | |
7a0443f0 DS |
6151 | inode->flags &= ~BTRFS_INODE_COMPRESS; |
6152 | inode->flags |= BTRFS_INODE_NOCOMPRESS; | |
19aee8de | 6153 | } else if (flags & BTRFS_INODE_COMPRESS) { |
7a0443f0 DS |
6154 | inode->flags &= ~BTRFS_INODE_NOCOMPRESS; |
6155 | inode->flags |= BTRFS_INODE_COMPRESS; | |
19aee8de AJ |
6156 | } |
6157 | ||
6158 | if (flags & BTRFS_INODE_NODATACOW) { | |
7a0443f0 DS |
6159 | inode->flags |= BTRFS_INODE_NODATACOW; |
6160 | if (S_ISREG(inode->vfs_inode.i_mode)) | |
6161 | inode->flags |= BTRFS_INODE_NODATASUM; | |
19aee8de AJ |
6162 | } |
6163 | ||
7a0443f0 | 6164 | btrfs_sync_inode_flags_to_i_flags(&inode->vfs_inode); |
19aee8de AJ |
6165 | } |
6166 | ||
3538d68d | 6167 | int btrfs_create_new_inode(struct btrfs_trans_handle *trans, |
caae78e0 | 6168 | struct btrfs_new_inode_args *args) |
39279cc3 | 6169 | { |
caae78e0 | 6170 | struct inode *dir = args->dir; |
3538d68d | 6171 | struct inode *inode = args->inode; |
6db75318 | 6172 | const struct fscrypt_str *name = args->orphan ? NULL : &args->fname.disk_name; |
caae78e0 | 6173 | struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb); |
3538d68d | 6174 | struct btrfs_root *root; |
5f39d397 | 6175 | struct btrfs_inode_item *inode_item; |
39279cc3 | 6176 | struct btrfs_key *location; |
5f39d397 | 6177 | struct btrfs_path *path; |
6437d458 | 6178 | u64 objectid; |
9c58309d CM |
6179 | struct btrfs_inode_ref *ref; |
6180 | struct btrfs_key key[2]; | |
6181 | u32 sizes[2]; | |
b7ef5f3a | 6182 | struct btrfs_item_batch batch; |
9c58309d | 6183 | unsigned long ptr; |
39279cc3 | 6184 | int ret; |
39279cc3 | 6185 | |
5f39d397 | 6186 | path = btrfs_alloc_path(); |
d8926bb3 | 6187 | if (!path) |
a1fd0c35 | 6188 | return -ENOMEM; |
39279cc3 | 6189 | |
3538d68d OS |
6190 | if (!args->subvol) |
6191 | BTRFS_I(inode)->root = btrfs_grab_root(BTRFS_I(dir)->root); | |
6192 | root = BTRFS_I(inode)->root; | |
6193 | ||
6437d458 | 6194 | ret = btrfs_get_free_objectid(root, &objectid); |
caae78e0 OS |
6195 | if (ret) |
6196 | goto out; | |
581bb050 LZ |
6197 | inode->i_ino = objectid; |
6198 | ||
caae78e0 OS |
6199 | if (args->orphan) { |
6200 | /* | |
6201 | * O_TMPFILE, set link count to 0, so that after this point, we | |
6202 | * fill in an inode item with the correct link count. | |
6203 | */ | |
6204 | set_nlink(inode, 0); | |
6205 | } else { | |
1abe9b8a | 6206 | trace_btrfs_inode_request(dir); |
6207 | ||
caae78e0 OS |
6208 | ret = btrfs_set_inode_index(BTRFS_I(dir), &BTRFS_I(inode)->dir_index); |
6209 | if (ret) | |
6210 | goto out; | |
aec7477b | 6211 | } |
49024388 FM |
6212 | /* index_cnt is ignored for everything but a dir. */ |
6213 | BTRFS_I(inode)->index_cnt = BTRFS_DIR_START_INDEX; | |
e02119d5 | 6214 | BTRFS_I(inode)->generation = trans->transid; |
76195853 | 6215 | inode->i_generation = BTRFS_I(inode)->generation; |
b888db2b | 6216 | |
caae78e0 OS |
6217 | /* |
6218 | * Subvolumes don't inherit flags from their parent directory. | |
6219 | * Originally this was probably by accident, but we probably can't | |
6220 | * change it now without compatibility issues. | |
6221 | */ | |
6222 | if (!args->subvol) | |
7a0443f0 | 6223 | btrfs_inherit_iflags(BTRFS_I(inode), BTRFS_I(dir)); |
305eaac0 | 6224 | |
a1fd0c35 | 6225 | if (S_ISREG(inode->i_mode)) { |
305eaac0 OS |
6226 | if (btrfs_test_opt(fs_info, NODATASUM)) |
6227 | BTRFS_I(inode)->flags |= BTRFS_INODE_NODATASUM; | |
6228 | if (btrfs_test_opt(fs_info, NODATACOW)) | |
6229 | BTRFS_I(inode)->flags |= BTRFS_INODE_NODATACOW | | |
6230 | BTRFS_INODE_NODATASUM; | |
6231 | } | |
6232 | ||
caae78e0 OS |
6233 | location = &BTRFS_I(inode)->location; |
6234 | location->objectid = objectid; | |
6235 | location->offset = 0; | |
6236 | location->type = BTRFS_INODE_ITEM_KEY; | |
6237 | ||
6238 | ret = btrfs_insert_inode_locked(inode); | |
6239 | if (ret < 0) { | |
6240 | if (!args->orphan) | |
6241 | BTRFS_I(dir)->index_cnt--; | |
6242 | goto out; | |
6243 | } | |
6244 | ||
5dc562c5 JB |
6245 | /* |
6246 | * We could have gotten an inode number from somebody who was fsynced | |
6247 | * and then removed in this same transaction, so let's just set full | |
6248 | * sync since it will be a full sync anyway and this will blow away the | |
6249 | * old info in the log. | |
6250 | */ | |
23e3337f | 6251 | btrfs_set_inode_full_sync(BTRFS_I(inode)); |
5dc562c5 | 6252 | |
9c58309d | 6253 | key[0].objectid = objectid; |
962a298f | 6254 | key[0].type = BTRFS_INODE_ITEM_KEY; |
9c58309d CM |
6255 | key[0].offset = 0; |
6256 | ||
9c58309d | 6257 | sizes[0] = sizeof(struct btrfs_inode_item); |
ef3b9af5 | 6258 | |
caae78e0 | 6259 | if (!args->orphan) { |
ef3b9af5 FM |
6260 | /* |
6261 | * Start new inodes with an inode_ref. This is slightly more | |
6262 | * efficient for small numbers of hard links since they will | |
6263 | * be packed into one item. Extended refs will kick in if we | |
6264 | * add more hard links than can fit in the ref item. | |
6265 | */ | |
6266 | key[1].objectid = objectid; | |
962a298f | 6267 | key[1].type = BTRFS_INODE_REF_KEY; |
caae78e0 | 6268 | if (args->subvol) { |
23c24ef8 | 6269 | key[1].offset = objectid; |
caae78e0 OS |
6270 | sizes[1] = 2 + sizeof(*ref); |
6271 | } else { | |
6272 | key[1].offset = btrfs_ino(BTRFS_I(dir)); | |
e43eec81 | 6273 | sizes[1] = name->len + sizeof(*ref); |
caae78e0 | 6274 | } |
ef3b9af5 | 6275 | } |
9c58309d | 6276 | |
b7ef5f3a FM |
6277 | batch.keys = &key[0]; |
6278 | batch.data_sizes = &sizes[0]; | |
caae78e0 OS |
6279 | batch.total_data_size = sizes[0] + (args->orphan ? 0 : sizes[1]); |
6280 | batch.nr = args->orphan ? 1 : 2; | |
b7ef5f3a | 6281 | ret = btrfs_insert_empty_items(trans, root, path, &batch); |
caae78e0 OS |
6282 | if (ret != 0) { |
6283 | btrfs_abort_transaction(trans, ret); | |
6284 | goto discard; | |
6285 | } | |
5f39d397 | 6286 | |
2a9462de | 6287 | inode->i_mtime = inode_set_ctime_current(inode); |
9cc97d64 | 6288 | inode->i_atime = inode->i_mtime; |
d3c6be6f | 6289 | BTRFS_I(inode)->i_otime = inode->i_mtime; |
9cc97d64 | 6290 | |
caae78e0 OS |
6291 | /* |
6292 | * We're going to fill the inode item now, so at this point the inode | |
6293 | * must be fully initialized. | |
6294 | */ | |
6295 | ||
5f39d397 CM |
6296 | inode_item = btrfs_item_ptr(path->nodes[0], path->slots[0], |
6297 | struct btrfs_inode_item); | |
b159fa28 | 6298 | memzero_extent_buffer(path->nodes[0], (unsigned long)inode_item, |
293f7e07 | 6299 | sizeof(*inode_item)); |
e02119d5 | 6300 | fill_inode_item(trans, path->nodes[0], inode_item, inode); |
9c58309d | 6301 | |
caae78e0 | 6302 | if (!args->orphan) { |
ef3b9af5 FM |
6303 | ref = btrfs_item_ptr(path->nodes[0], path->slots[0] + 1, |
6304 | struct btrfs_inode_ref); | |
ef3b9af5 | 6305 | ptr = (unsigned long)(ref + 1); |
caae78e0 OS |
6306 | if (args->subvol) { |
6307 | btrfs_set_inode_ref_name_len(path->nodes[0], ref, 2); | |
6308 | btrfs_set_inode_ref_index(path->nodes[0], ref, 0); | |
6309 | write_extent_buffer(path->nodes[0], "..", ptr, 2); | |
6310 | } else { | |
e43eec81 STD |
6311 | btrfs_set_inode_ref_name_len(path->nodes[0], ref, |
6312 | name->len); | |
caae78e0 OS |
6313 | btrfs_set_inode_ref_index(path->nodes[0], ref, |
6314 | BTRFS_I(inode)->dir_index); | |
e43eec81 STD |
6315 | write_extent_buffer(path->nodes[0], name->name, ptr, |
6316 | name->len); | |
caae78e0 | 6317 | } |
ef3b9af5 | 6318 | } |
9c58309d | 6319 | |
50564b65 | 6320 | btrfs_mark_buffer_dirty(trans, path->nodes[0]); |
814e7718 FM |
6321 | /* |
6322 | * We don't need the path anymore, plus inheriting properties, adding | |
6323 | * ACLs, security xattrs, orphan item or adding the link, will result in | |
6324 | * allocating yet another path. So just free our path. | |
6325 | */ | |
6326 | btrfs_free_path(path); | |
6327 | path = NULL; | |
5f39d397 | 6328 | |
6c3636eb STD |
6329 | if (args->subvol) { |
6330 | struct inode *parent; | |
6331 | ||
6332 | /* | |
6333 | * Subvolumes inherit properties from their parent subvolume, | |
6334 | * not the directory they were created in. | |
6335 | */ | |
6336 | parent = btrfs_iget(fs_info->sb, BTRFS_FIRST_FREE_OBJECTID, | |
6337 | BTRFS_I(dir)->root); | |
6338 | if (IS_ERR(parent)) { | |
6339 | ret = PTR_ERR(parent); | |
6340 | } else { | |
6341 | ret = btrfs_inode_inherit_props(trans, inode, parent); | |
6342 | iput(parent); | |
6343 | } | |
6344 | } else { | |
6345 | ret = btrfs_inode_inherit_props(trans, inode, dir); | |
6346 | } | |
6347 | if (ret) { | |
6348 | btrfs_err(fs_info, | |
6349 | "error inheriting props for ino %llu (root %llu): %d", | |
6350 | btrfs_ino(BTRFS_I(inode)), root->root_key.objectid, | |
6351 | ret); | |
6352 | } | |
6353 | ||
6354 | /* | |
6355 | * Subvolumes don't inherit ACLs or get passed to the LSM. This is | |
6356 | * probably a bug. | |
6357 | */ | |
6358 | if (!args->subvol) { | |
6359 | ret = btrfs_init_inode_security(trans, args); | |
6360 | if (ret) { | |
6361 | btrfs_abort_transaction(trans, ret); | |
6362 | goto discard; | |
6363 | } | |
6364 | } | |
6365 | ||
4c45a4f4 | 6366 | inode_tree_add(BTRFS_I(inode)); |
1abe9b8a | 6367 | |
6368 | trace_btrfs_inode_new(inode); | |
d9094414 | 6369 | btrfs_set_inode_last_trans(trans, BTRFS_I(inode)); |
1abe9b8a | 6370 | |
8ea05e3a AB |
6371 | btrfs_update_root_times(trans, root); |
6372 | ||
caae78e0 OS |
6373 | if (args->orphan) { |
6374 | ret = btrfs_orphan_add(trans, BTRFS_I(inode)); | |
6375 | } else { | |
6376 | ret = btrfs_add_link(trans, BTRFS_I(dir), BTRFS_I(inode), name, | |
e43eec81 | 6377 | 0, BTRFS_I(inode)->dir_index); |
caae78e0 OS |
6378 | } |
6379 | if (ret) { | |
6380 | btrfs_abort_transaction(trans, ret); | |
6381 | goto discard; | |
6382 | } | |
63541927 | 6383 | |
814e7718 | 6384 | return 0; |
b0d5d10f | 6385 | |
caae78e0 | 6386 | discard: |
a1fd0c35 OS |
6387 | /* |
6388 | * discard_new_inode() calls iput(), but the caller owns the reference | |
6389 | * to the inode. | |
6390 | */ | |
6391 | ihold(inode); | |
32955c54 | 6392 | discard_new_inode(inode); |
caae78e0 | 6393 | out: |
5f39d397 | 6394 | btrfs_free_path(path); |
a1fd0c35 | 6395 | return ret; |
39279cc3 CM |
6396 | } |
6397 | ||
d352ac68 CM |
6398 | /* |
6399 | * utility function to add 'inode' into 'parent_inode' with | |
6400 | * a give name and a given sequence number. | |
6401 | * if 'add_backref' is true, also insert a backref from the | |
6402 | * inode to the parent directory. | |
6403 | */ | |
e02119d5 | 6404 | int btrfs_add_link(struct btrfs_trans_handle *trans, |
db0a669f | 6405 | struct btrfs_inode *parent_inode, struct btrfs_inode *inode, |
6db75318 | 6406 | const struct fscrypt_str *name, int add_backref, u64 index) |
39279cc3 | 6407 | { |
4df27c4d | 6408 | int ret = 0; |
39279cc3 | 6409 | struct btrfs_key key; |
db0a669f NB |
6410 | struct btrfs_root *root = parent_inode->root; |
6411 | u64 ino = btrfs_ino(inode); | |
6412 | u64 parent_ino = btrfs_ino(parent_inode); | |
5f39d397 | 6413 | |
33345d01 | 6414 | if (unlikely(ino == BTRFS_FIRST_FREE_OBJECTID)) { |
db0a669f | 6415 | memcpy(&key, &inode->root->root_key, sizeof(key)); |
4df27c4d | 6416 | } else { |
33345d01 | 6417 | key.objectid = ino; |
962a298f | 6418 | key.type = BTRFS_INODE_ITEM_KEY; |
4df27c4d YZ |
6419 | key.offset = 0; |
6420 | } | |
6421 | ||
33345d01 | 6422 | if (unlikely(ino == BTRFS_FIRST_FREE_OBJECTID)) { |
6025c19f | 6423 | ret = btrfs_add_root_ref(trans, key.objectid, |
0b246afa | 6424 | root->root_key.objectid, parent_ino, |
e43eec81 | 6425 | index, name); |
4df27c4d | 6426 | } else if (add_backref) { |
e43eec81 STD |
6427 | ret = btrfs_insert_inode_ref(trans, root, name, |
6428 | ino, parent_ino, index); | |
4df27c4d | 6429 | } |
39279cc3 | 6430 | |
79787eaa JM |
6431 | /* Nothing to clean up yet */ |
6432 | if (ret) | |
6433 | return ret; | |
4df27c4d | 6434 | |
e43eec81 | 6435 | ret = btrfs_insert_dir_item(trans, name, parent_inode, &key, |
db0a669f | 6436 | btrfs_inode_type(&inode->vfs_inode), index); |
9c52057c | 6437 | if (ret == -EEXIST || ret == -EOVERFLOW) |
79787eaa JM |
6438 | goto fail_dir_item; |
6439 | else if (ret) { | |
66642832 | 6440 | btrfs_abort_transaction(trans, ret); |
79787eaa | 6441 | return ret; |
39279cc3 | 6442 | } |
79787eaa | 6443 | |
db0a669f | 6444 | btrfs_i_size_write(parent_inode, parent_inode->vfs_inode.i_size + |
e43eec81 | 6445 | name->len * 2); |
db0a669f | 6446 | inode_inc_iversion(&parent_inode->vfs_inode); |
5338e43a FM |
6447 | /* |
6448 | * If we are replaying a log tree, we do not want to update the mtime | |
6449 | * and ctime of the parent directory with the current time, since the | |
6450 | * log replay procedure is responsible for setting them to their correct | |
6451 | * values (the ones it had when the fsync was done). | |
6452 | */ | |
2a9462de JL |
6453 | if (!test_bit(BTRFS_FS_LOG_RECOVERING, &root->fs_info->flags)) |
6454 | parent_inode->vfs_inode.i_mtime = | |
6455 | inode_set_ctime_current(&parent_inode->vfs_inode); | |
5338e43a | 6456 | |
8b9d0322 | 6457 | ret = btrfs_update_inode(trans, parent_inode); |
79787eaa | 6458 | if (ret) |
66642832 | 6459 | btrfs_abort_transaction(trans, ret); |
39279cc3 | 6460 | return ret; |
fe66a05a CM |
6461 | |
6462 | fail_dir_item: | |
6463 | if (unlikely(ino == BTRFS_FIRST_FREE_OBJECTID)) { | |
6464 | u64 local_index; | |
6465 | int err; | |
3ee1c553 | 6466 | err = btrfs_del_root_ref(trans, key.objectid, |
0b246afa | 6467 | root->root_key.objectid, parent_ino, |
e43eec81 | 6468 | &local_index, name); |
1690dd41 JT |
6469 | if (err) |
6470 | btrfs_abort_transaction(trans, err); | |
fe66a05a CM |
6471 | } else if (add_backref) { |
6472 | u64 local_index; | |
6473 | int err; | |
6474 | ||
e43eec81 STD |
6475 | err = btrfs_del_inode_ref(trans, root, name, ino, parent_ino, |
6476 | &local_index); | |
1690dd41 JT |
6477 | if (err) |
6478 | btrfs_abort_transaction(trans, err); | |
fe66a05a | 6479 | } |
1690dd41 JT |
6480 | |
6481 | /* Return the original error code */ | |
fe66a05a | 6482 | return ret; |
39279cc3 CM |
6483 | } |
6484 | ||
5f465bf1 OS |
6485 | static int btrfs_create_common(struct inode *dir, struct dentry *dentry, |
6486 | struct inode *inode) | |
618e21d5 | 6487 | { |
2ff7e61e | 6488 | struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb); |
618e21d5 | 6489 | struct btrfs_root *root = BTRFS_I(dir)->root; |
3538d68d OS |
6490 | struct btrfs_new_inode_args new_inode_args = { |
6491 | .dir = dir, | |
6492 | .dentry = dentry, | |
6493 | .inode = inode, | |
6494 | }; | |
6495 | unsigned int trans_num_items; | |
5f465bf1 | 6496 | struct btrfs_trans_handle *trans; |
618e21d5 | 6497 | int err; |
618e21d5 | 6498 | |
3538d68d | 6499 | err = btrfs_new_inode_prepare(&new_inode_args, &trans_num_items); |
caae78e0 OS |
6500 | if (err) |
6501 | goto out_inode; | |
3538d68d OS |
6502 | |
6503 | trans = btrfs_start_transaction(root, trans_num_items); | |
a1fd0c35 | 6504 | if (IS_ERR(trans)) { |
3538d68d OS |
6505 | err = PTR_ERR(trans); |
6506 | goto out_new_inode_args; | |
a1fd0c35 | 6507 | } |
1832a6d5 | 6508 | |
caae78e0 OS |
6509 | err = btrfs_create_new_inode(trans, &new_inode_args); |
6510 | if (!err) | |
6511 | d_instantiate_new(dentry, inode); | |
b0d5d10f | 6512 | |
3a45bb20 | 6513 | btrfs_end_transaction(trans); |
5f465bf1 | 6514 | btrfs_btree_balance_dirty(fs_info); |
3538d68d OS |
6515 | out_new_inode_args: |
6516 | btrfs_new_inode_args_destroy(&new_inode_args); | |
caae78e0 OS |
6517 | out_inode: |
6518 | if (err) | |
6519 | iput(inode); | |
618e21d5 JB |
6520 | return err; |
6521 | } | |
6522 | ||
5ebb29be | 6523 | static int btrfs_mknod(struct mnt_idmap *idmap, struct inode *dir, |
5f465bf1 OS |
6524 | struct dentry *dentry, umode_t mode, dev_t rdev) |
6525 | { | |
6526 | struct inode *inode; | |
6527 | ||
6528 | inode = new_inode(dir->i_sb); | |
6529 | if (!inode) | |
6530 | return -ENOMEM; | |
f2d40141 | 6531 | inode_init_owner(idmap, inode, dir, mode); |
5f465bf1 OS |
6532 | inode->i_op = &btrfs_special_inode_operations; |
6533 | init_special_inode(inode, inode->i_mode, rdev); | |
6534 | return btrfs_create_common(dir, dentry, inode); | |
6535 | } | |
6536 | ||
6c960e68 | 6537 | static int btrfs_create(struct mnt_idmap *idmap, struct inode *dir, |
549c7297 | 6538 | struct dentry *dentry, umode_t mode, bool excl) |
39279cc3 | 6539 | { |
a1fd0c35 | 6540 | struct inode *inode; |
39279cc3 | 6541 | |
a1fd0c35 OS |
6542 | inode = new_inode(dir->i_sb); |
6543 | if (!inode) | |
6544 | return -ENOMEM; | |
f2d40141 | 6545 | inode_init_owner(idmap, inode, dir, mode); |
a1fd0c35 OS |
6546 | inode->i_fop = &btrfs_file_operations; |
6547 | inode->i_op = &btrfs_file_inode_operations; | |
6548 | inode->i_mapping->a_ops = &btrfs_aops; | |
5f465bf1 | 6549 | return btrfs_create_common(dir, dentry, inode); |
39279cc3 CM |
6550 | } |
6551 | ||
6552 | static int btrfs_link(struct dentry *old_dentry, struct inode *dir, | |
6553 | struct dentry *dentry) | |
6554 | { | |
271dba45 | 6555 | struct btrfs_trans_handle *trans = NULL; |
39279cc3 | 6556 | struct btrfs_root *root = BTRFS_I(dir)->root; |
2b0143b5 | 6557 | struct inode *inode = d_inode(old_dentry); |
2ff7e61e | 6558 | struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); |
ab3c5c18 | 6559 | struct fscrypt_name fname; |
00e4e6b3 | 6560 | u64 index; |
39279cc3 CM |
6561 | int err; |
6562 | int drop_inode = 0; | |
6563 | ||
4a8be425 | 6564 | /* do not allow sys_link's with other subvols of the same device */ |
4fd786e6 | 6565 | if (root->root_key.objectid != BTRFS_I(inode)->root->root_key.objectid) |
3ab3564f | 6566 | return -EXDEV; |
4a8be425 | 6567 | |
f186373f | 6568 | if (inode->i_nlink >= BTRFS_LINK_MAX) |
c055e99e | 6569 | return -EMLINK; |
4a8be425 | 6570 | |
ab3c5c18 STD |
6571 | err = fscrypt_setup_filename(dir, &dentry->d_name, 0, &fname); |
6572 | if (err) | |
6573 | goto fail; | |
6574 | ||
877574e2 | 6575 | err = btrfs_set_inode_index(BTRFS_I(dir), &index); |
aec7477b JB |
6576 | if (err) |
6577 | goto fail; | |
6578 | ||
a22285a6 | 6579 | /* |
7e6b6465 | 6580 | * 2 items for inode and inode ref |
a22285a6 | 6581 | * 2 items for dir items |
7e6b6465 | 6582 | * 1 item for parent inode |
399b0bbf | 6583 | * 1 item for orphan item deletion if O_TMPFILE |
a22285a6 | 6584 | */ |
399b0bbf | 6585 | trans = btrfs_start_transaction(root, inode->i_nlink ? 5 : 6); |
a22285a6 YZ |
6586 | if (IS_ERR(trans)) { |
6587 | err = PTR_ERR(trans); | |
271dba45 | 6588 | trans = NULL; |
a22285a6 YZ |
6589 | goto fail; |
6590 | } | |
5f39d397 | 6591 | |
67de1176 MX |
6592 | /* There are several dir indexes for this inode, clear the cache. */ |
6593 | BTRFS_I(inode)->dir_index = 0ULL; | |
8b558c5f | 6594 | inc_nlink(inode); |
0c4d2d95 | 6595 | inode_inc_iversion(inode); |
2a9462de | 6596 | inode_set_ctime_current(inode); |
7de9c6ee | 6597 | ihold(inode); |
e9976151 | 6598 | set_bit(BTRFS_INODE_COPY_EVERYTHING, &BTRFS_I(inode)->runtime_flags); |
aec7477b | 6599 | |
81512e89 | 6600 | err = btrfs_add_link(trans, BTRFS_I(dir), BTRFS_I(inode), |
6db75318 | 6601 | &fname.disk_name, 1, index); |
5f39d397 | 6602 | |
a5719521 | 6603 | if (err) { |
54aa1f4d | 6604 | drop_inode = 1; |
a5719521 | 6605 | } else { |
10d9f309 | 6606 | struct dentry *parent = dentry->d_parent; |
d4682ba0 | 6607 | |
8b9d0322 | 6608 | err = btrfs_update_inode(trans, BTRFS_I(inode)); |
79787eaa JM |
6609 | if (err) |
6610 | goto fail; | |
ef3b9af5 FM |
6611 | if (inode->i_nlink == 1) { |
6612 | /* | |
6613 | * If new hard link count is 1, it's a file created | |
6614 | * with open(2) O_TMPFILE flag. | |
6615 | */ | |
3d6ae7bb | 6616 | err = btrfs_orphan_del(trans, BTRFS_I(inode)); |
ef3b9af5 FM |
6617 | if (err) |
6618 | goto fail; | |
6619 | } | |
08c422c2 | 6620 | d_instantiate(dentry, inode); |
88d2beec | 6621 | btrfs_log_new_name(trans, old_dentry, NULL, 0, parent); |
a5719521 | 6622 | } |
39279cc3 | 6623 | |
1832a6d5 | 6624 | fail: |
ab3c5c18 | 6625 | fscrypt_free_filename(&fname); |
271dba45 | 6626 | if (trans) |
3a45bb20 | 6627 | btrfs_end_transaction(trans); |
39279cc3 CM |
6628 | if (drop_inode) { |
6629 | inode_dec_link_count(inode); | |
6630 | iput(inode); | |
6631 | } | |
2ff7e61e | 6632 | btrfs_btree_balance_dirty(fs_info); |
39279cc3 CM |
6633 | return err; |
6634 | } | |
6635 | ||
c54bd91e | 6636 | static int btrfs_mkdir(struct mnt_idmap *idmap, struct inode *dir, |
549c7297 | 6637 | struct dentry *dentry, umode_t mode) |
39279cc3 | 6638 | { |
a1fd0c35 | 6639 | struct inode *inode; |
39279cc3 | 6640 | |
a1fd0c35 OS |
6641 | inode = new_inode(dir->i_sb); |
6642 | if (!inode) | |
6643 | return -ENOMEM; | |
f2d40141 | 6644 | inode_init_owner(idmap, inode, dir, S_IFDIR | mode); |
a1fd0c35 OS |
6645 | inode->i_op = &btrfs_dir_inode_operations; |
6646 | inode->i_fop = &btrfs_dir_file_operations; | |
5f465bf1 | 6647 | return btrfs_create_common(dir, dentry, inode); |
39279cc3 CM |
6648 | } |
6649 | ||
c8b97818 | 6650 | static noinline int uncompress_inline(struct btrfs_path *path, |
e40da0e5 | 6651 | struct page *page, |
c8b97818 CM |
6652 | struct btrfs_file_extent_item *item) |
6653 | { | |
6654 | int ret; | |
6655 | struct extent_buffer *leaf = path->nodes[0]; | |
6656 | char *tmp; | |
6657 | size_t max_size; | |
6658 | unsigned long inline_size; | |
6659 | unsigned long ptr; | |
261507a0 | 6660 | int compress_type; |
c8b97818 | 6661 | |
261507a0 | 6662 | compress_type = btrfs_file_extent_compression(leaf, item); |
c8b97818 | 6663 | max_size = btrfs_file_extent_ram_bytes(leaf, item); |
437bd07e | 6664 | inline_size = btrfs_file_extent_inline_item_len(leaf, path->slots[0]); |
c8b97818 | 6665 | tmp = kmalloc(inline_size, GFP_NOFS); |
8d413713 TI |
6666 | if (!tmp) |
6667 | return -ENOMEM; | |
c8b97818 CM |
6668 | ptr = btrfs_file_extent_inline_start(item); |
6669 | ||
6670 | read_extent_buffer(leaf, tmp, ptr, inline_size); | |
6671 | ||
09cbfeaf | 6672 | max_size = min_t(unsigned long, PAGE_SIZE, max_size); |
a982fc82 | 6673 | ret = btrfs_decompress(compress_type, tmp, page, 0, inline_size, max_size); |
e1699d2d ZB |
6674 | |
6675 | /* | |
6676 | * decompression code contains a memset to fill in any space between the end | |
6677 | * of the uncompressed data and the end of max_size in case the decompressed | |
6678 | * data ends up shorter than ram_bytes. That doesn't cover the hole between | |
6679 | * the end of an inline extent and the beginning of the next block, so we | |
6680 | * cover that region here. | |
6681 | */ | |
6682 | ||
a982fc82 QW |
6683 | if (max_size < PAGE_SIZE) |
6684 | memzero_page(page, max_size, PAGE_SIZE - max_size); | |
c8b97818 | 6685 | kfree(tmp); |
166ae5a4 | 6686 | return ret; |
c8b97818 CM |
6687 | } |
6688 | ||
a982fc82 QW |
6689 | static int read_inline_extent(struct btrfs_inode *inode, struct btrfs_path *path, |
6690 | struct page *page) | |
6691 | { | |
6692 | struct btrfs_file_extent_item *fi; | |
6693 | void *kaddr; | |
6694 | size_t copy_size; | |
6695 | ||
6696 | if (!page || PageUptodate(page)) | |
6697 | return 0; | |
6698 | ||
6699 | ASSERT(page_offset(page) == 0); | |
6700 | ||
6701 | fi = btrfs_item_ptr(path->nodes[0], path->slots[0], | |
6702 | struct btrfs_file_extent_item); | |
6703 | if (btrfs_file_extent_compression(path->nodes[0], fi) != BTRFS_COMPRESS_NONE) | |
6704 | return uncompress_inline(path, page, fi); | |
6705 | ||
6706 | copy_size = min_t(u64, PAGE_SIZE, | |
6707 | btrfs_file_extent_ram_bytes(path->nodes[0], fi)); | |
6708 | kaddr = kmap_local_page(page); | |
6709 | read_extent_buffer(path->nodes[0], kaddr, | |
6710 | btrfs_file_extent_inline_start(fi), copy_size); | |
6711 | kunmap_local(kaddr); | |
6712 | if (copy_size < PAGE_SIZE) | |
6713 | memzero_page(page, copy_size, PAGE_SIZE - copy_size); | |
6714 | return 0; | |
6715 | } | |
6716 | ||
43dd529a DS |
6717 | /* |
6718 | * Lookup the first extent overlapping a range in a file. | |
6719 | * | |
39b07b5d OS |
6720 | * @inode: file to search in |
6721 | * @page: page to read extent data into if the extent is inline | |
6722 | * @pg_offset: offset into @page to copy to | |
6723 | * @start: file offset | |
6724 | * @len: length of range starting at @start | |
6725 | * | |
43dd529a DS |
6726 | * Return the first &struct extent_map which overlaps the given range, reading |
6727 | * it from the B-tree and caching it if necessary. Note that there may be more | |
6728 | * extents which overlap the given range after the returned extent_map. | |
d352ac68 | 6729 | * |
39b07b5d OS |
6730 | * If @page is not NULL and the extent is inline, this also reads the extent |
6731 | * data directly into the page and marks the extent up to date in the io_tree. | |
6732 | * | |
6733 | * Return: ERR_PTR on error, non-NULL extent_map on success. | |
d352ac68 | 6734 | */ |
fc4f21b1 | 6735 | struct extent_map *btrfs_get_extent(struct btrfs_inode *inode, |
39b07b5d OS |
6736 | struct page *page, size_t pg_offset, |
6737 | u64 start, u64 len) | |
a52d9a80 | 6738 | { |
3ffbd68c | 6739 | struct btrfs_fs_info *fs_info = inode->root->fs_info; |
1028d1c4 | 6740 | int ret = 0; |
a52d9a80 CM |
6741 | u64 extent_start = 0; |
6742 | u64 extent_end = 0; | |
fc4f21b1 | 6743 | u64 objectid = btrfs_ino(inode); |
7e74e235 | 6744 | int extent_type = -1; |
f421950f | 6745 | struct btrfs_path *path = NULL; |
fc4f21b1 | 6746 | struct btrfs_root *root = inode->root; |
a52d9a80 | 6747 | struct btrfs_file_extent_item *item; |
5f39d397 CM |
6748 | struct extent_buffer *leaf; |
6749 | struct btrfs_key found_key; | |
a52d9a80 | 6750 | struct extent_map *em = NULL; |
fc4f21b1 | 6751 | struct extent_map_tree *em_tree = &inode->extent_tree; |
a52d9a80 | 6752 | |
890871be | 6753 | read_lock(&em_tree->lock); |
d1310b2e | 6754 | em = lookup_extent_mapping(em_tree, start, len); |
890871be | 6755 | read_unlock(&em_tree->lock); |
d1310b2e | 6756 | |
a52d9a80 | 6757 | if (em) { |
e1c4b745 CM |
6758 | if (em->start > start || em->start + em->len <= start) |
6759 | free_extent_map(em); | |
6760 | else if (em->block_start == EXTENT_MAP_INLINE && page) | |
70dec807 CM |
6761 | free_extent_map(em); |
6762 | else | |
6763 | goto out; | |
a52d9a80 | 6764 | } |
172ddd60 | 6765 | em = alloc_extent_map(); |
a52d9a80 | 6766 | if (!em) { |
1028d1c4 | 6767 | ret = -ENOMEM; |
d1310b2e | 6768 | goto out; |
a52d9a80 | 6769 | } |
d1310b2e | 6770 | em->start = EXTENT_MAP_HOLE; |
445a6944 | 6771 | em->orig_start = EXTENT_MAP_HOLE; |
d1310b2e | 6772 | em->len = (u64)-1; |
c8b97818 | 6773 | em->block_len = (u64)-1; |
f421950f | 6774 | |
bee6ec82 | 6775 | path = btrfs_alloc_path(); |
f421950f | 6776 | if (!path) { |
1028d1c4 | 6777 | ret = -ENOMEM; |
bee6ec82 | 6778 | goto out; |
f421950f CM |
6779 | } |
6780 | ||
bee6ec82 LB |
6781 | /* Chances are we'll be called again, so go ahead and do readahead */ |
6782 | path->reada = READA_FORWARD; | |
4d7240f0 JB |
6783 | |
6784 | /* | |
6785 | * The same explanation in load_free_space_cache applies here as well, | |
6786 | * we only read when we're loading the free space cache, and at that | |
6787 | * point the commit_root has everything we need. | |
6788 | */ | |
6789 | if (btrfs_is_free_space_inode(inode)) { | |
6790 | path->search_commit_root = 1; | |
6791 | path->skip_locking = 1; | |
6792 | } | |
51899412 | 6793 | |
5c9a702e | 6794 | ret = btrfs_lookup_file_extent(NULL, root, path, objectid, start, 0); |
a52d9a80 | 6795 | if (ret < 0) { |
a52d9a80 | 6796 | goto out; |
b8eeab7f | 6797 | } else if (ret > 0) { |
a52d9a80 CM |
6798 | if (path->slots[0] == 0) |
6799 | goto not_found; | |
6800 | path->slots[0]--; | |
1028d1c4 | 6801 | ret = 0; |
a52d9a80 CM |
6802 | } |
6803 | ||
5f39d397 CM |
6804 | leaf = path->nodes[0]; |
6805 | item = btrfs_item_ptr(leaf, path->slots[0], | |
a52d9a80 | 6806 | struct btrfs_file_extent_item); |
5f39d397 | 6807 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); |
5f39d397 | 6808 | if (found_key.objectid != objectid || |
694c12ed | 6809 | found_key.type != BTRFS_EXTENT_DATA_KEY) { |
25a50341 JB |
6810 | /* |
6811 | * If we backup past the first extent we want to move forward | |
6812 | * and see if there is an extent in front of us, otherwise we'll | |
6813 | * say there is a hole for our whole search range which can | |
6814 | * cause problems. | |
6815 | */ | |
6816 | extent_end = start; | |
6817 | goto next; | |
a52d9a80 CM |
6818 | } |
6819 | ||
694c12ed | 6820 | extent_type = btrfs_file_extent_type(leaf, item); |
5f39d397 | 6821 | extent_start = found_key.offset; |
a5eeb3d1 | 6822 | extent_end = btrfs_file_extent_end(path); |
694c12ed NB |
6823 | if (extent_type == BTRFS_FILE_EXTENT_REG || |
6824 | extent_type == BTRFS_FILE_EXTENT_PREALLOC) { | |
6bf9e4bd QW |
6825 | /* Only regular file could have regular/prealloc extent */ |
6826 | if (!S_ISREG(inode->vfs_inode.i_mode)) { | |
1028d1c4 | 6827 | ret = -EUCLEAN; |
6bf9e4bd QW |
6828 | btrfs_crit(fs_info, |
6829 | "regular/prealloc extent found for non-regular inode %llu", | |
6830 | btrfs_ino(inode)); | |
6831 | goto out; | |
6832 | } | |
09ed2f16 LB |
6833 | trace_btrfs_get_extent_show_fi_regular(inode, leaf, item, |
6834 | extent_start); | |
694c12ed | 6835 | } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) { |
09ed2f16 LB |
6836 | trace_btrfs_get_extent_show_fi_inline(inode, leaf, item, |
6837 | path->slots[0], | |
6838 | extent_start); | |
9036c102 | 6839 | } |
25a50341 | 6840 | next: |
9036c102 YZ |
6841 | if (start >= extent_end) { |
6842 | path->slots[0]++; | |
6843 | if (path->slots[0] >= btrfs_header_nritems(leaf)) { | |
6844 | ret = btrfs_next_leaf(root, path); | |
1028d1c4 | 6845 | if (ret < 0) |
9036c102 | 6846 | goto out; |
1028d1c4 | 6847 | else if (ret > 0) |
9036c102 | 6848 | goto not_found; |
1028d1c4 | 6849 | |
9036c102 | 6850 | leaf = path->nodes[0]; |
a52d9a80 | 6851 | } |
9036c102 YZ |
6852 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); |
6853 | if (found_key.objectid != objectid || | |
6854 | found_key.type != BTRFS_EXTENT_DATA_KEY) | |
6855 | goto not_found; | |
6856 | if (start + len <= found_key.offset) | |
6857 | goto not_found; | |
e2eca69d WS |
6858 | if (start > found_key.offset) |
6859 | goto next; | |
02a033df NB |
6860 | |
6861 | /* New extent overlaps with existing one */ | |
9036c102 | 6862 | em->start = start; |
70c8a91c | 6863 | em->orig_start = start; |
9036c102 | 6864 | em->len = found_key.offset - start; |
02a033df NB |
6865 | em->block_start = EXTENT_MAP_HOLE; |
6866 | goto insert; | |
9036c102 YZ |
6867 | } |
6868 | ||
280f15cb | 6869 | btrfs_extent_item_to_extent_map(inode, path, item, em); |
7ffbb598 | 6870 | |
694c12ed NB |
6871 | if (extent_type == BTRFS_FILE_EXTENT_REG || |
6872 | extent_type == BTRFS_FILE_EXTENT_PREALLOC) { | |
a52d9a80 | 6873 | goto insert; |
694c12ed | 6874 | } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) { |
affc5424 QW |
6875 | /* |
6876 | * Inline extent can only exist at file offset 0. This is | |
6877 | * ensured by tree-checker and inline extent creation path. | |
6878 | * Thus all members representing file offsets should be zero. | |
6879 | */ | |
affc5424 QW |
6880 | ASSERT(pg_offset == 0); |
6881 | ASSERT(extent_start == 0); | |
6882 | ASSERT(em->start == 0); | |
5f39d397 | 6883 | |
a196a894 QW |
6884 | /* |
6885 | * btrfs_extent_item_to_extent_map() should have properly | |
6886 | * initialized em members already. | |
6887 | * | |
6888 | * Other members are not utilized for inline extents. | |
6889 | */ | |
6890 | ASSERT(em->block_start == EXTENT_MAP_INLINE); | |
946c2923 | 6891 | ASSERT(em->len == fs_info->sectorsize); |
e49aabd9 | 6892 | |
a982fc82 QW |
6893 | ret = read_inline_extent(inode, path, page); |
6894 | if (ret < 0) | |
6895 | goto out; | |
a52d9a80 | 6896 | goto insert; |
a52d9a80 CM |
6897 | } |
6898 | not_found: | |
6899 | em->start = start; | |
70c8a91c | 6900 | em->orig_start = start; |
d1310b2e | 6901 | em->len = len; |
5f39d397 | 6902 | em->block_start = EXTENT_MAP_HOLE; |
a52d9a80 | 6903 | insert: |
1028d1c4 | 6904 | ret = 0; |
b3b4aa74 | 6905 | btrfs_release_path(path); |
d1310b2e | 6906 | if (em->start > start || extent_map_end(em) <= start) { |
0b246afa | 6907 | btrfs_err(fs_info, |
5d163e0e JM |
6908 | "bad extent! em: [%llu %llu] passed [%llu %llu]", |
6909 | em->start, em->len, start, len); | |
1028d1c4 | 6910 | ret = -EIO; |
a52d9a80 CM |
6911 | goto out; |
6912 | } | |
d1310b2e | 6913 | |
890871be | 6914 | write_lock(&em_tree->lock); |
1028d1c4 | 6915 | ret = btrfs_add_extent_mapping(fs_info, em_tree, &em, start, len); |
890871be | 6916 | write_unlock(&em_tree->lock); |
a52d9a80 | 6917 | out: |
c6414280 | 6918 | btrfs_free_path(path); |
1abe9b8a | 6919 | |
fc4f21b1 | 6920 | trace_btrfs_get_extent(root, inode, em); |
1abe9b8a | 6921 | |
1028d1c4 | 6922 | if (ret) { |
a52d9a80 | 6923 | free_extent_map(em); |
1028d1c4 | 6924 | return ERR_PTR(ret); |
a52d9a80 CM |
6925 | } |
6926 | return em; | |
6927 | } | |
6928 | ||
64f54188 | 6929 | static struct extent_map *btrfs_create_dio_extent(struct btrfs_inode *inode, |
53f2c206 | 6930 | struct btrfs_dio_data *dio_data, |
5f9a8a51 FM |
6931 | const u64 start, |
6932 | const u64 len, | |
6933 | const u64 orig_start, | |
6934 | const u64 block_start, | |
6935 | const u64 block_len, | |
6936 | const u64 orig_block_len, | |
6937 | const u64 ram_bytes, | |
6938 | const int type) | |
6939 | { | |
6940 | struct extent_map *em = NULL; | |
53f2c206 | 6941 | struct btrfs_ordered_extent *ordered; |
5f9a8a51 | 6942 | |
5f9a8a51 | 6943 | if (type != BTRFS_ORDERED_NOCOW) { |
64f54188 NB |
6944 | em = create_io_em(inode, start, len, orig_start, block_start, |
6945 | block_len, orig_block_len, ram_bytes, | |
6f9994db LB |
6946 | BTRFS_COMPRESS_NONE, /* compress_type */ |
6947 | type); | |
5f9a8a51 FM |
6948 | if (IS_ERR(em)) |
6949 | goto out; | |
6950 | } | |
53f2c206 BB |
6951 | ordered = btrfs_alloc_ordered_extent(inode, start, len, len, |
6952 | block_start, block_len, 0, | |
6953 | (1 << type) | | |
6954 | (1 << BTRFS_ORDERED_DIRECT), | |
6955 | BTRFS_COMPRESS_NONE); | |
6956 | if (IS_ERR(ordered)) { | |
5f9a8a51 FM |
6957 | if (em) { |
6958 | free_extent_map(em); | |
4c0c8cfc FM |
6959 | btrfs_drop_extent_map_range(inode, start, |
6960 | start + len - 1, false); | |
5f9a8a51 | 6961 | } |
53f2c206 BB |
6962 | em = ERR_CAST(ordered); |
6963 | } else { | |
6964 | ASSERT(!dio_data->ordered); | |
6965 | dio_data->ordered = ordered; | |
5f9a8a51 FM |
6966 | } |
6967 | out: | |
5f9a8a51 FM |
6968 | |
6969 | return em; | |
6970 | } | |
6971 | ||
9fc6f911 | 6972 | static struct extent_map *btrfs_new_extent_direct(struct btrfs_inode *inode, |
53f2c206 | 6973 | struct btrfs_dio_data *dio_data, |
4b46fce2 JB |
6974 | u64 start, u64 len) |
6975 | { | |
9fc6f911 NB |
6976 | struct btrfs_root *root = inode->root; |
6977 | struct btrfs_fs_info *fs_info = root->fs_info; | |
70c8a91c | 6978 | struct extent_map *em; |
4b46fce2 JB |
6979 | struct btrfs_key ins; |
6980 | u64 alloc_hint; | |
6981 | int ret; | |
4b46fce2 | 6982 | |
9fc6f911 | 6983 | alloc_hint = get_extent_allocation_hint(inode, start, len); |
0b246afa | 6984 | ret = btrfs_reserve_extent(root, len, len, fs_info->sectorsize, |
da17066c | 6985 | 0, alloc_hint, &ins, 1, 1); |
00361589 JB |
6986 | if (ret) |
6987 | return ERR_PTR(ret); | |
4b46fce2 | 6988 | |
53f2c206 | 6989 | em = btrfs_create_dio_extent(inode, dio_data, start, ins.offset, start, |
5f9a8a51 | 6990 | ins.objectid, ins.offset, ins.offset, |
6288d6ea | 6991 | ins.offset, BTRFS_ORDERED_REGULAR); |
0b246afa | 6992 | btrfs_dec_block_group_reservations(fs_info, ins.objectid); |
5f9a8a51 | 6993 | if (IS_ERR(em)) |
9fc6f911 NB |
6994 | btrfs_free_reserved_extent(fs_info, ins.objectid, ins.offset, |
6995 | 1); | |
de0ee0ed | 6996 | |
4b46fce2 JB |
6997 | return em; |
6998 | } | |
6999 | ||
f4639636 | 7000 | static bool btrfs_extent_readonly(struct btrfs_fs_info *fs_info, u64 bytenr) |
05947ae1 AJ |
7001 | { |
7002 | struct btrfs_block_group *block_group; | |
f4639636 | 7003 | bool readonly = false; |
05947ae1 AJ |
7004 | |
7005 | block_group = btrfs_lookup_block_group(fs_info, bytenr); | |
7006 | if (!block_group || block_group->ro) | |
f4639636 | 7007 | readonly = true; |
05947ae1 AJ |
7008 | if (block_group) |
7009 | btrfs_put_block_group(block_group); | |
7010 | return readonly; | |
7011 | } | |
7012 | ||
46bfbb5c | 7013 | /* |
e4ecaf90 QW |
7014 | * Check if we can do nocow write into the range [@offset, @offset + @len) |
7015 | * | |
7016 | * @offset: File offset | |
7017 | * @len: The length to write, will be updated to the nocow writeable | |
7018 | * range | |
7019 | * @orig_start: (optional) Return the original file offset of the file extent | |
7020 | * @orig_len: (optional) Return the original on-disk length of the file extent | |
7021 | * @ram_bytes: (optional) Return the ram_bytes of the file extent | |
a84d5d42 BB |
7022 | * @strict: if true, omit optimizations that might force us into unnecessary |
7023 | * cow. e.g., don't trust generation number. | |
e4ecaf90 | 7024 | * |
e4ecaf90 QW |
7025 | * Return: |
7026 | * >0 and update @len if we can do nocow write | |
7027 | * 0 if we can't do nocow write | |
7028 | * <0 if error happened | |
7029 | * | |
7030 | * NOTE: This only checks the file extents, caller is responsible to wait for | |
7031 | * any ordered extents. | |
46bfbb5c | 7032 | */ |
00361589 | 7033 | noinline int can_nocow_extent(struct inode *inode, u64 offset, u64 *len, |
7ee9e440 | 7034 | u64 *orig_start, u64 *orig_block_len, |
26ce9114 | 7035 | u64 *ram_bytes, bool nowait, bool strict) |
46bfbb5c | 7036 | { |
2ff7e61e | 7037 | struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); |
619104ba | 7038 | struct can_nocow_file_extent_args nocow_args = { 0 }; |
46bfbb5c CM |
7039 | struct btrfs_path *path; |
7040 | int ret; | |
7041 | struct extent_buffer *leaf; | |
7042 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
7b2b7085 | 7043 | struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; |
46bfbb5c CM |
7044 | struct btrfs_file_extent_item *fi; |
7045 | struct btrfs_key key; | |
46bfbb5c | 7046 | int found_type; |
e77751aa | 7047 | |
46bfbb5c CM |
7048 | path = btrfs_alloc_path(); |
7049 | if (!path) | |
7050 | return -ENOMEM; | |
26ce9114 | 7051 | path->nowait = nowait; |
46bfbb5c | 7052 | |
f85b7379 DS |
7053 | ret = btrfs_lookup_file_extent(NULL, root, path, |
7054 | btrfs_ino(BTRFS_I(inode)), offset, 0); | |
46bfbb5c CM |
7055 | if (ret < 0) |
7056 | goto out; | |
7057 | ||
46bfbb5c | 7058 | if (ret == 1) { |
619104ba | 7059 | if (path->slots[0] == 0) { |
46bfbb5c CM |
7060 | /* can't find the item, must cow */ |
7061 | ret = 0; | |
7062 | goto out; | |
7063 | } | |
619104ba | 7064 | path->slots[0]--; |
46bfbb5c CM |
7065 | } |
7066 | ret = 0; | |
7067 | leaf = path->nodes[0]; | |
619104ba | 7068 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); |
4a0cc7ca | 7069 | if (key.objectid != btrfs_ino(BTRFS_I(inode)) || |
46bfbb5c CM |
7070 | key.type != BTRFS_EXTENT_DATA_KEY) { |
7071 | /* not our file or wrong item type, must cow */ | |
7072 | goto out; | |
7073 | } | |
7074 | ||
7075 | if (key.offset > offset) { | |
7076 | /* Wrong offset, must cow */ | |
7077 | goto out; | |
7078 | } | |
7079 | ||
619104ba | 7080 | if (btrfs_file_extent_end(path) <= offset) |
7ee9e440 JB |
7081 | goto out; |
7082 | ||
619104ba FM |
7083 | fi = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_file_extent_item); |
7084 | found_type = btrfs_file_extent_type(leaf, fi); | |
7085 | if (ram_bytes) | |
7086 | *ram_bytes = btrfs_file_extent_ram_bytes(leaf, fi); | |
e77751aa | 7087 | |
619104ba FM |
7088 | nocow_args.start = offset; |
7089 | nocow_args.end = offset + *len - 1; | |
7090 | nocow_args.strict = strict; | |
7091 | nocow_args.free_path = true; | |
7ee9e440 | 7092 | |
619104ba FM |
7093 | ret = can_nocow_file_extent(path, &key, BTRFS_I(inode), &nocow_args); |
7094 | /* can_nocow_file_extent() has freed the path. */ | |
7095 | path = NULL; | |
7ee9e440 | 7096 | |
619104ba FM |
7097 | if (ret != 1) { |
7098 | /* Treat errors as not being able to NOCOW. */ | |
7099 | ret = 0; | |
78d4295b | 7100 | goto out; |
7ee9e440 | 7101 | } |
eb384b55 | 7102 | |
619104ba FM |
7103 | ret = 0; |
7104 | if (btrfs_extent_readonly(fs_info, nocow_args.disk_bytenr)) | |
46bfbb5c | 7105 | goto out; |
7b2b7085 | 7106 | |
619104ba FM |
7107 | if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW) && |
7108 | found_type == BTRFS_FILE_EXTENT_PREALLOC) { | |
7b2b7085 MX |
7109 | u64 range_end; |
7110 | ||
619104ba | 7111 | range_end = round_up(offset + nocow_args.num_bytes, |
da17066c | 7112 | root->fs_info->sectorsize) - 1; |
99be1a66 | 7113 | ret = test_range_bit_exists(io_tree, offset, range_end, EXTENT_DELALLOC); |
7b2b7085 MX |
7114 | if (ret) { |
7115 | ret = -EAGAIN; | |
7116 | goto out; | |
7117 | } | |
7118 | } | |
7119 | ||
619104ba FM |
7120 | if (orig_start) |
7121 | *orig_start = key.offset - nocow_args.extent_offset; | |
7122 | if (orig_block_len) | |
7123 | *orig_block_len = nocow_args.disk_num_bytes; | |
00361589 | 7124 | |
619104ba | 7125 | *len = nocow_args.num_bytes; |
46bfbb5c CM |
7126 | ret = 1; |
7127 | out: | |
7128 | btrfs_free_path(path); | |
7129 | return ret; | |
7130 | } | |
7131 | ||
eb838e73 | 7132 | static int lock_extent_direct(struct inode *inode, u64 lockstart, u64 lockend, |
59094403 FM |
7133 | struct extent_state **cached_state, |
7134 | unsigned int iomap_flags) | |
eb838e73 | 7135 | { |
59094403 FM |
7136 | const bool writing = (iomap_flags & IOMAP_WRITE); |
7137 | const bool nowait = (iomap_flags & IOMAP_NOWAIT); | |
7138 | struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; | |
eb838e73 JB |
7139 | struct btrfs_ordered_extent *ordered; |
7140 | int ret = 0; | |
7141 | ||
7142 | while (1) { | |
59094403 | 7143 | if (nowait) { |
83ae4133 JB |
7144 | if (!try_lock_extent(io_tree, lockstart, lockend, |
7145 | cached_state)) | |
59094403 FM |
7146 | return -EAGAIN; |
7147 | } else { | |
570eb97b | 7148 | lock_extent(io_tree, lockstart, lockend, cached_state); |
59094403 | 7149 | } |
eb838e73 JB |
7150 | /* |
7151 | * We're concerned with the entire range that we're going to be | |
01327610 | 7152 | * doing DIO to, so we need to make sure there's no ordered |
eb838e73 JB |
7153 | * extents in this range. |
7154 | */ | |
a776c6fa | 7155 | ordered = btrfs_lookup_ordered_range(BTRFS_I(inode), lockstart, |
eb838e73 JB |
7156 | lockend - lockstart + 1); |
7157 | ||
7158 | /* | |
7159 | * We need to make sure there are no buffered pages in this | |
7160 | * range either, we could have raced between the invalidate in | |
7161 | * generic_file_direct_write and locking the extent. The | |
7162 | * invalidate needs to happen so that reads after a write do not | |
7163 | * get stale data. | |
7164 | */ | |
fc4adbff | 7165 | if (!ordered && |
051c98eb DS |
7166 | (!writing || !filemap_range_has_page(inode->i_mapping, |
7167 | lockstart, lockend))) | |
eb838e73 JB |
7168 | break; |
7169 | ||
570eb97b | 7170 | unlock_extent(io_tree, lockstart, lockend, cached_state); |
eb838e73 JB |
7171 | |
7172 | if (ordered) { | |
59094403 FM |
7173 | if (nowait) { |
7174 | btrfs_put_ordered_extent(ordered); | |
7175 | ret = -EAGAIN; | |
7176 | break; | |
7177 | } | |
ade77029 FM |
7178 | /* |
7179 | * If we are doing a DIO read and the ordered extent we | |
7180 | * found is for a buffered write, we can not wait for it | |
7181 | * to complete and retry, because if we do so we can | |
7182 | * deadlock with concurrent buffered writes on page | |
7183 | * locks. This happens only if our DIO read covers more | |
7184 | * than one extent map, if at this point has already | |
7185 | * created an ordered extent for a previous extent map | |
7186 | * and locked its range in the inode's io tree, and a | |
7187 | * concurrent write against that previous extent map's | |
7188 | * range and this range started (we unlock the ranges | |
7189 | * in the io tree only when the bios complete and | |
7190 | * buffered writes always lock pages before attempting | |
7191 | * to lock range in the io tree). | |
7192 | */ | |
7193 | if (writing || | |
7194 | test_bit(BTRFS_ORDERED_DIRECT, &ordered->flags)) | |
36d45567 | 7195 | btrfs_start_ordered_extent(ordered); |
ade77029 | 7196 | else |
59094403 | 7197 | ret = nowait ? -EAGAIN : -ENOTBLK; |
eb838e73 JB |
7198 | btrfs_put_ordered_extent(ordered); |
7199 | } else { | |
eb838e73 | 7200 | /* |
b850ae14 FM |
7201 | * We could trigger writeback for this range (and wait |
7202 | * for it to complete) and then invalidate the pages for | |
7203 | * this range (through invalidate_inode_pages2_range()), | |
7204 | * but that can lead us to a deadlock with a concurrent | |
ba206a02 | 7205 | * call to readahead (a buffered read or a defrag call |
b850ae14 FM |
7206 | * triggered a readahead) on a page lock due to an |
7207 | * ordered dio extent we created before but did not have | |
7208 | * yet a corresponding bio submitted (whence it can not | |
ba206a02 | 7209 | * complete), which makes readahead wait for that |
b850ae14 FM |
7210 | * ordered extent to complete while holding a lock on |
7211 | * that page. | |
eb838e73 | 7212 | */ |
59094403 | 7213 | ret = nowait ? -EAGAIN : -ENOTBLK; |
eb838e73 JB |
7214 | } |
7215 | ||
ade77029 FM |
7216 | if (ret) |
7217 | break; | |
7218 | ||
eb838e73 JB |
7219 | cond_resched(); |
7220 | } | |
7221 | ||
7222 | return ret; | |
7223 | } | |
7224 | ||
6f9994db | 7225 | /* The callers of this must take lock_extent() */ |
4b67c11d NB |
7226 | static struct extent_map *create_io_em(struct btrfs_inode *inode, u64 start, |
7227 | u64 len, u64 orig_start, u64 block_start, | |
6f9994db LB |
7228 | u64 block_len, u64 orig_block_len, |
7229 | u64 ram_bytes, int compress_type, | |
7230 | int type) | |
69ffb543 | 7231 | { |
69ffb543 | 7232 | struct extent_map *em; |
69ffb543 JB |
7233 | int ret; |
7234 | ||
6f9994db LB |
7235 | ASSERT(type == BTRFS_ORDERED_PREALLOC || |
7236 | type == BTRFS_ORDERED_COMPRESSED || | |
7237 | type == BTRFS_ORDERED_NOCOW || | |
1af4a0aa | 7238 | type == BTRFS_ORDERED_REGULAR); |
6f9994db | 7239 | |
69ffb543 JB |
7240 | em = alloc_extent_map(); |
7241 | if (!em) | |
7242 | return ERR_PTR(-ENOMEM); | |
7243 | ||
7244 | em->start = start; | |
7245 | em->orig_start = orig_start; | |
7246 | em->len = len; | |
7247 | em->block_len = block_len; | |
7248 | em->block_start = block_start; | |
b4939680 | 7249 | em->orig_block_len = orig_block_len; |
cc95bef6 | 7250 | em->ram_bytes = ram_bytes; |
70c8a91c | 7251 | em->generation = -1; |
69ffb543 | 7252 | set_bit(EXTENT_FLAG_PINNED, &em->flags); |
1af4a0aa | 7253 | if (type == BTRFS_ORDERED_PREALLOC) { |
b11e234d | 7254 | set_bit(EXTENT_FLAG_FILLING, &em->flags); |
1af4a0aa | 7255 | } else if (type == BTRFS_ORDERED_COMPRESSED) { |
6f9994db LB |
7256 | set_bit(EXTENT_FLAG_COMPRESSED, &em->flags); |
7257 | em->compress_type = compress_type; | |
7258 | } | |
69ffb543 | 7259 | |
a1ba4c08 | 7260 | ret = btrfs_replace_extent_map_range(inode, em, true); |
69ffb543 JB |
7261 | if (ret) { |
7262 | free_extent_map(em); | |
7263 | return ERR_PTR(ret); | |
7264 | } | |
7265 | ||
6f9994db | 7266 | /* em got 2 refs now, callers needs to do free_extent_map once. */ |
69ffb543 JB |
7267 | return em; |
7268 | } | |
7269 | ||
1c8d0175 | 7270 | |
c5794e51 | 7271 | static int btrfs_get_blocks_direct_write(struct extent_map **map, |
c5794e51 NB |
7272 | struct inode *inode, |
7273 | struct btrfs_dio_data *dio_data, | |
7833b865 | 7274 | u64 start, u64 *lenp, |
d7a8ab4e | 7275 | unsigned int iomap_flags) |
c5794e51 | 7276 | { |
d4135134 | 7277 | const bool nowait = (iomap_flags & IOMAP_NOWAIT); |
c5794e51 NB |
7278 | struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); |
7279 | struct extent_map *em = *map; | |
f0bfa76a FM |
7280 | int type; |
7281 | u64 block_start, orig_start, orig_block_len, ram_bytes; | |
2306e83e | 7282 | struct btrfs_block_group *bg; |
f0bfa76a FM |
7283 | bool can_nocow = false; |
7284 | bool space_reserved = false; | |
7833b865 | 7285 | u64 len = *lenp; |
6d82ad13 | 7286 | u64 prev_len; |
c5794e51 NB |
7287 | int ret = 0; |
7288 | ||
7289 | /* | |
7290 | * We don't allocate a new extent in the following cases | |
7291 | * | |
7292 | * 1) The inode is marked as NODATACOW. In this case we'll just use the | |
7293 | * existing extent. | |
7294 | * 2) The extent is marked as PREALLOC. We're good to go here and can | |
7295 | * just use the extent. | |
7296 | * | |
7297 | */ | |
7298 | if (test_bit(EXTENT_FLAG_PREALLOC, &em->flags) || | |
7299 | ((BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW) && | |
7300 | em->block_start != EXTENT_MAP_HOLE)) { | |
c5794e51 NB |
7301 | if (test_bit(EXTENT_FLAG_PREALLOC, &em->flags)) |
7302 | type = BTRFS_ORDERED_PREALLOC; | |
7303 | else | |
7304 | type = BTRFS_ORDERED_NOCOW; | |
7305 | len = min(len, em->len - (start - em->start)); | |
7306 | block_start = em->block_start + (start - em->start); | |
7307 | ||
7308 | if (can_nocow_extent(inode, start, &len, &orig_start, | |
26ce9114 | 7309 | &orig_block_len, &ram_bytes, false, false) == 1) { |
2306e83e FM |
7310 | bg = btrfs_inc_nocow_writers(fs_info, block_start); |
7311 | if (bg) | |
7312 | can_nocow = true; | |
7313 | } | |
f0bfa76a | 7314 | } |
c5794e51 | 7315 | |
6d82ad13 | 7316 | prev_len = len; |
f0bfa76a FM |
7317 | if (can_nocow) { |
7318 | struct extent_map *em2; | |
7319 | ||
7320 | /* We can NOCOW, so only need to reserve metadata space. */ | |
d4135134 FM |
7321 | ret = btrfs_delalloc_reserve_metadata(BTRFS_I(inode), len, len, |
7322 | nowait); | |
f0bfa76a FM |
7323 | if (ret < 0) { |
7324 | /* Our caller expects us to free the input extent map. */ | |
7325 | free_extent_map(em); | |
7326 | *map = NULL; | |
2306e83e | 7327 | btrfs_dec_nocow_writers(bg); |
d4135134 FM |
7328 | if (nowait && (ret == -ENOSPC || ret == -EDQUOT)) |
7329 | ret = -EAGAIN; | |
f0bfa76a FM |
7330 | goto out; |
7331 | } | |
7332 | space_reserved = true; | |
7333 | ||
53f2c206 | 7334 | em2 = btrfs_create_dio_extent(BTRFS_I(inode), dio_data, start, len, |
f0bfa76a FM |
7335 | orig_start, block_start, |
7336 | len, orig_block_len, | |
7337 | ram_bytes, type); | |
2306e83e | 7338 | btrfs_dec_nocow_writers(bg); |
f0bfa76a FM |
7339 | if (type == BTRFS_ORDERED_PREALLOC) { |
7340 | free_extent_map(em); | |
c1867eb3 DS |
7341 | *map = em2; |
7342 | em = em2; | |
f0bfa76a | 7343 | } |
c5794e51 | 7344 | |
f0bfa76a FM |
7345 | if (IS_ERR(em2)) { |
7346 | ret = PTR_ERR(em2); | |
7347 | goto out; | |
c5794e51 | 7348 | } |
f5585f4f FM |
7349 | |
7350 | dio_data->nocow_done = true; | |
f0bfa76a | 7351 | } else { |
f0bfa76a FM |
7352 | /* Our caller expects us to free the input extent map. */ |
7353 | free_extent_map(em); | |
7354 | *map = NULL; | |
7355 | ||
7833b865 CH |
7356 | if (nowait) { |
7357 | ret = -EAGAIN; | |
7358 | goto out; | |
7359 | } | |
d7a8ab4e | 7360 | |
f5585f4f FM |
7361 | /* |
7362 | * If we could not allocate data space before locking the file | |
7363 | * range and we can't do a NOCOW write, then we have to fail. | |
7364 | */ | |
7833b865 CH |
7365 | if (!dio_data->data_space_reserved) { |
7366 | ret = -ENOSPC; | |
7367 | goto out; | |
7368 | } | |
f5585f4f FM |
7369 | |
7370 | /* | |
7371 | * We have to COW and we have already reserved data space before, | |
7372 | * so now we reserve only metadata. | |
7373 | */ | |
7374 | ret = btrfs_delalloc_reserve_metadata(BTRFS_I(inode), len, len, | |
7375 | false); | |
f0bfa76a FM |
7376 | if (ret < 0) |
7377 | goto out; | |
7378 | space_reserved = true; | |
7379 | ||
53f2c206 | 7380 | em = btrfs_new_extent_direct(BTRFS_I(inode), dio_data, start, len); |
f0bfa76a FM |
7381 | if (IS_ERR(em)) { |
7382 | ret = PTR_ERR(em); | |
7383 | goto out; | |
7384 | } | |
7385 | *map = em; | |
7386 | len = min(len, em->len - (start - em->start)); | |
7387 | if (len < prev_len) | |
f5585f4f FM |
7388 | btrfs_delalloc_release_metadata(BTRFS_I(inode), |
7389 | prev_len - len, true); | |
c5794e51 NB |
7390 | } |
7391 | ||
f0bfa76a FM |
7392 | /* |
7393 | * We have created our ordered extent, so we can now release our reservation | |
7394 | * for an outstanding extent. | |
7395 | */ | |
6d82ad13 | 7396 | btrfs_delalloc_release_extents(BTRFS_I(inode), prev_len); |
c5794e51 | 7397 | |
c5794e51 NB |
7398 | /* |
7399 | * Need to update the i_size under the extent lock so buffered | |
7400 | * readers will get the updated i_size when we unlock. | |
7401 | */ | |
f85781fb | 7402 | if (start + len > i_size_read(inode)) |
c5794e51 | 7403 | i_size_write(inode, start + len); |
c5794e51 | 7404 | out: |
f0bfa76a FM |
7405 | if (ret && space_reserved) { |
7406 | btrfs_delalloc_release_extents(BTRFS_I(inode), len); | |
f5585f4f | 7407 | btrfs_delalloc_release_metadata(BTRFS_I(inode), len, true); |
f0bfa76a | 7408 | } |
7833b865 | 7409 | *lenp = len; |
c5794e51 NB |
7410 | return ret; |
7411 | } | |
7412 | ||
f85781fb GR |
7413 | static int btrfs_dio_iomap_begin(struct inode *inode, loff_t start, |
7414 | loff_t length, unsigned int flags, struct iomap *iomap, | |
7415 | struct iomap *srcmap) | |
4b46fce2 | 7416 | { |
491a6d01 | 7417 | struct iomap_iter *iter = container_of(iomap, struct iomap_iter, iomap); |
0b246afa | 7418 | struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); |
4b46fce2 | 7419 | struct extent_map *em; |
eb838e73 | 7420 | struct extent_state *cached_state = NULL; |
491a6d01 | 7421 | struct btrfs_dio_data *dio_data = iter->private; |
eb838e73 | 7422 | u64 lockstart, lockend; |
f85781fb | 7423 | const bool write = !!(flags & IOMAP_WRITE); |
0934856d | 7424 | int ret = 0; |
f85781fb | 7425 | u64 len = length; |
f5585f4f | 7426 | const u64 data_alloc_len = length; |
f85781fb | 7427 | bool unlock_extents = false; |
eb838e73 | 7428 | |
79d3d1d1 JB |
7429 | /* |
7430 | * We could potentially fault if we have a buffer > PAGE_SIZE, and if | |
7431 | * we're NOWAIT we may submit a bio for a partial range and return | |
7432 | * EIOCBQUEUED, which would result in an errant short read. | |
7433 | * | |
7434 | * The best way to handle this would be to allow for partial completions | |
7435 | * of iocb's, so we could submit the partial bio, return and fault in | |
7436 | * the rest of the pages, and then submit the io for the rest of the | |
7437 | * range. However we don't have that currently, so simply return | |
7438 | * -EAGAIN at this point so that the normal path is used. | |
7439 | */ | |
7440 | if (!write && (flags & IOMAP_NOWAIT) && length > PAGE_SIZE) | |
7441 | return -EAGAIN; | |
7442 | ||
ee5b46a3 CH |
7443 | /* |
7444 | * Cap the size of reads to that usually seen in buffered I/O as we need | |
7445 | * to allocate a contiguous array for the checksums. | |
7446 | */ | |
f85781fb | 7447 | if (!write) |
ee5b46a3 | 7448 | len = min_t(u64, len, fs_info->sectorsize * BTRFS_MAX_BIO_SECTORS); |
eb838e73 | 7449 | |
c329861d JB |
7450 | lockstart = start; |
7451 | lockend = start + len - 1; | |
7452 | ||
f85781fb | 7453 | /* |
b023e675 FM |
7454 | * iomap_dio_rw() only does filemap_write_and_wait_range(), which isn't |
7455 | * enough if we've written compressed pages to this area, so we need to | |
7456 | * flush the dirty pages again to make absolutely sure that any | |
7457 | * outstanding dirty pages are on disk - the first flush only starts | |
7458 | * compression on the data, while keeping the pages locked, so by the | |
7459 | * time the second flush returns we know bios for the compressed pages | |
7460 | * were submitted and finished, and the pages no longer under writeback. | |
7461 | * | |
7462 | * If we have a NOWAIT request and we have any pages in the range that | |
7463 | * are locked, likely due to compression still in progress, we don't want | |
7464 | * to block on page locks. We also don't want to block on pages marked as | |
7465 | * dirty or under writeback (same as for the non-compression case). | |
7466 | * iomap_dio_rw() did the same check, but after that and before we got | |
7467 | * here, mmap'ed writes may have happened or buffered reads started | |
7468 | * (readpage() and readahead(), which lock pages), as we haven't locked | |
7469 | * the file range yet. | |
f85781fb GR |
7470 | */ |
7471 | if (test_bit(BTRFS_INODE_HAS_ASYNC_EXTENT, | |
7472 | &BTRFS_I(inode)->runtime_flags)) { | |
b023e675 FM |
7473 | if (flags & IOMAP_NOWAIT) { |
7474 | if (filemap_range_needs_writeback(inode->i_mapping, | |
7475 | lockstart, lockend)) | |
7476 | return -EAGAIN; | |
7477 | } else { | |
7478 | ret = filemap_fdatawrite_range(inode->i_mapping, start, | |
7479 | start + length - 1); | |
7480 | if (ret) | |
7481 | return ret; | |
7482 | } | |
f85781fb GR |
7483 | } |
7484 | ||
491a6d01 | 7485 | memset(dio_data, 0, sizeof(*dio_data)); |
f85781fb | 7486 | |
f5585f4f FM |
7487 | /* |
7488 | * We always try to allocate data space and must do it before locking | |
7489 | * the file range, to avoid deadlocks with concurrent writes to the same | |
7490 | * range if the range has several extents and the writes don't expand the | |
7491 | * current i_size (the inode lock is taken in shared mode). If we fail to | |
7492 | * allocate data space here we continue and later, after locking the | |
7493 | * file range, we fail with ENOSPC only if we figure out we can not do a | |
7494 | * NOCOW write. | |
7495 | */ | |
7496 | if (write && !(flags & IOMAP_NOWAIT)) { | |
7497 | ret = btrfs_check_data_free_space(BTRFS_I(inode), | |
7498 | &dio_data->data_reserved, | |
1daedb1d | 7499 | start, data_alloc_len, false); |
f5585f4f FM |
7500 | if (!ret) |
7501 | dio_data->data_space_reserved = true; | |
7502 | else if (ret && !(BTRFS_I(inode)->flags & | |
7503 | (BTRFS_INODE_NODATACOW | BTRFS_INODE_PREALLOC))) | |
7504 | goto err; | |
7505 | } | |
e1cbbfa5 | 7506 | |
eb838e73 JB |
7507 | /* |
7508 | * If this errors out it's because we couldn't invalidate pagecache for | |
59094403 FM |
7509 | * this range and we need to fallback to buffered IO, or we are doing a |
7510 | * NOWAIT read/write and we need to block. | |
eb838e73 | 7511 | */ |
59094403 FM |
7512 | ret = lock_extent_direct(inode, lockstart, lockend, &cached_state, flags); |
7513 | if (ret < 0) | |
9c9464cc | 7514 | goto err; |
eb838e73 | 7515 | |
39b07b5d | 7516 | em = btrfs_get_extent(BTRFS_I(inode), NULL, 0, start, len); |
eb838e73 JB |
7517 | if (IS_ERR(em)) { |
7518 | ret = PTR_ERR(em); | |
7519 | goto unlock_err; | |
7520 | } | |
4b46fce2 JB |
7521 | |
7522 | /* | |
7523 | * Ok for INLINE and COMPRESSED extents we need to fallback on buffered | |
7524 | * io. INLINE is special, and we could probably kludge it in here, but | |
7525 | * it's still buffered so for safety lets just fall back to the generic | |
7526 | * buffered path. | |
7527 | * | |
7528 | * For COMPRESSED we _have_ to read the entire extent in so we can | |
7529 | * decompress it, so there will be buffering required no matter what we | |
7530 | * do, so go ahead and fallback to buffered. | |
7531 | * | |
01327610 | 7532 | * We return -ENOTBLK because that's what makes DIO go ahead and go back |
4b46fce2 JB |
7533 | * to buffered IO. Don't blame me, this is the price we pay for using |
7534 | * the generic code. | |
7535 | */ | |
7536 | if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags) || | |
7537 | em->block_start == EXTENT_MAP_INLINE) { | |
7538 | free_extent_map(em); | |
a4527e18 FM |
7539 | /* |
7540 | * If we are in a NOWAIT context, return -EAGAIN in order to | |
7541 | * fallback to buffered IO. This is not only because we can | |
7542 | * block with buffered IO (no support for NOWAIT semantics at | |
7543 | * the moment) but also to avoid returning short reads to user | |
7544 | * space - this happens if we were able to read some data from | |
7545 | * previous non-compressed extents and then when we fallback to | |
7546 | * buffered IO, at btrfs_file_read_iter() by calling | |
7547 | * filemap_read(), we fail to fault in pages for the read buffer, | |
7548 | * in which case filemap_read() returns a short read (the number | |
7549 | * of bytes previously read is > 0, so it does not return -EFAULT). | |
7550 | */ | |
7551 | ret = (flags & IOMAP_NOWAIT) ? -EAGAIN : -ENOTBLK; | |
eb838e73 | 7552 | goto unlock_err; |
4b46fce2 JB |
7553 | } |
7554 | ||
f85781fb | 7555 | len = min(len, em->len - (start - em->start)); |
ca93e44b FM |
7556 | |
7557 | /* | |
7558 | * If we have a NOWAIT request and the range contains multiple extents | |
7559 | * (or a mix of extents and holes), then we return -EAGAIN to make the | |
7560 | * caller fallback to a context where it can do a blocking (without | |
7561 | * NOWAIT) request. This way we avoid doing partial IO and returning | |
7562 | * success to the caller, which is not optimal for writes and for reads | |
7563 | * it can result in unexpected behaviour for an application. | |
7564 | * | |
7565 | * When doing a read, because we use IOMAP_DIO_PARTIAL when calling | |
7566 | * iomap_dio_rw(), we can end up returning less data then what the caller | |
7567 | * asked for, resulting in an unexpected, and incorrect, short read. | |
7568 | * That is, the caller asked to read N bytes and we return less than that, | |
7569 | * which is wrong unless we are crossing EOF. This happens if we get a | |
7570 | * page fault error when trying to fault in pages for the buffer that is | |
7571 | * associated to the struct iov_iter passed to iomap_dio_rw(), and we | |
7572 | * have previously submitted bios for other extents in the range, in | |
7573 | * which case iomap_dio_rw() may return us EIOCBQUEUED if not all of | |
7574 | * those bios have completed by the time we get the page fault error, | |
7575 | * which we return back to our caller - we should only return EIOCBQUEUED | |
7576 | * after we have submitted bios for all the extents in the range. | |
7577 | */ | |
7578 | if ((flags & IOMAP_NOWAIT) && len < length) { | |
7579 | free_extent_map(em); | |
7580 | ret = -EAGAIN; | |
7581 | goto unlock_err; | |
7582 | } | |
7583 | ||
f85781fb GR |
7584 | if (write) { |
7585 | ret = btrfs_get_blocks_direct_write(&em, inode, dio_data, | |
7833b865 | 7586 | start, &len, flags); |
c5794e51 NB |
7587 | if (ret < 0) |
7588 | goto unlock_err; | |
f85781fb GR |
7589 | unlock_extents = true; |
7590 | /* Recalc len in case the new em is smaller than requested */ | |
7591 | len = min(len, em->len - (start - em->start)); | |
f5585f4f FM |
7592 | if (dio_data->data_space_reserved) { |
7593 | u64 release_offset; | |
7594 | u64 release_len = 0; | |
7595 | ||
7596 | if (dio_data->nocow_done) { | |
7597 | release_offset = start; | |
7598 | release_len = data_alloc_len; | |
7599 | } else if (len < data_alloc_len) { | |
7600 | release_offset = start + len; | |
7601 | release_len = data_alloc_len - len; | |
7602 | } | |
7603 | ||
7604 | if (release_len > 0) | |
7605 | btrfs_free_reserved_data_space(BTRFS_I(inode), | |
7606 | dio_data->data_reserved, | |
7607 | release_offset, | |
7608 | release_len); | |
7609 | } | |
c5794e51 | 7610 | } else { |
1c8d0175 NB |
7611 | /* |
7612 | * We need to unlock only the end area that we aren't using. | |
7613 | * The rest is going to be unlocked by the endio routine. | |
7614 | */ | |
f85781fb GR |
7615 | lockstart = start + len; |
7616 | if (lockstart < lockend) | |
7617 | unlock_extents = true; | |
7618 | } | |
7619 | ||
7620 | if (unlock_extents) | |
570eb97b JB |
7621 | unlock_extent(&BTRFS_I(inode)->io_tree, lockstart, lockend, |
7622 | &cached_state); | |
f85781fb GR |
7623 | else |
7624 | free_extent_state(cached_state); | |
7625 | ||
7626 | /* | |
7627 | * Translate extent map information to iomap. | |
7628 | * We trim the extents (and move the addr) even though iomap code does | |
7629 | * that, since we have locked only the parts we are performing I/O in. | |
7630 | */ | |
7631 | if ((em->block_start == EXTENT_MAP_HOLE) || | |
7632 | (test_bit(EXTENT_FLAG_PREALLOC, &em->flags) && !write)) { | |
7633 | iomap->addr = IOMAP_NULL_ADDR; | |
7634 | iomap->type = IOMAP_HOLE; | |
7635 | } else { | |
7636 | iomap->addr = em->block_start + (start - em->start); | |
7637 | iomap->type = IOMAP_MAPPED; | |
a43a67a2 | 7638 | } |
f85781fb | 7639 | iomap->offset = start; |
d24fa5c1 | 7640 | iomap->bdev = fs_info->fs_devices->latest_dev->bdev; |
f85781fb | 7641 | iomap->length = len; |
4b46fce2 JB |
7642 | free_extent_map(em); |
7643 | ||
7644 | return 0; | |
eb838e73 JB |
7645 | |
7646 | unlock_err: | |
570eb97b JB |
7647 | unlock_extent(&BTRFS_I(inode)->io_tree, lockstart, lockend, |
7648 | &cached_state); | |
9c9464cc | 7649 | err: |
f5585f4f FM |
7650 | if (dio_data->data_space_reserved) { |
7651 | btrfs_free_reserved_data_space(BTRFS_I(inode), | |
7652 | dio_data->data_reserved, | |
7653 | start, data_alloc_len); | |
7654 | extent_changeset_free(dio_data->data_reserved); | |
7655 | } | |
7656 | ||
f85781fb GR |
7657 | return ret; |
7658 | } | |
7659 | ||
7660 | static int btrfs_dio_iomap_end(struct inode *inode, loff_t pos, loff_t length, | |
7661 | ssize_t written, unsigned int flags, struct iomap *iomap) | |
7662 | { | |
491a6d01 CH |
7663 | struct iomap_iter *iter = container_of(iomap, struct iomap_iter, iomap); |
7664 | struct btrfs_dio_data *dio_data = iter->private; | |
f85781fb GR |
7665 | size_t submitted = dio_data->submitted; |
7666 | const bool write = !!(flags & IOMAP_WRITE); | |
491a6d01 | 7667 | int ret = 0; |
f85781fb GR |
7668 | |
7669 | if (!write && (iomap->type == IOMAP_HOLE)) { | |
7670 | /* If reading from a hole, unlock and return */ | |
570eb97b JB |
7671 | unlock_extent(&BTRFS_I(inode)->io_tree, pos, pos + length - 1, |
7672 | NULL); | |
491a6d01 | 7673 | return 0; |
f85781fb GR |
7674 | } |
7675 | ||
7676 | if (submitted < length) { | |
7677 | pos += submitted; | |
7678 | length -= submitted; | |
7679 | if (write) | |
b41b6f69 CH |
7680 | btrfs_finish_ordered_extent(dio_data->ordered, NULL, |
7681 | pos, length, false); | |
f85781fb GR |
7682 | else |
7683 | unlock_extent(&BTRFS_I(inode)->io_tree, pos, | |
570eb97b | 7684 | pos + length - 1, NULL); |
f85781fb GR |
7685 | ret = -ENOTBLK; |
7686 | } | |
53f2c206 BB |
7687 | if (write) { |
7688 | btrfs_put_ordered_extent(dio_data->ordered); | |
7689 | dio_data->ordered = NULL; | |
7690 | } | |
f85781fb | 7691 | |
f0bfa76a | 7692 | if (write) |
f85781fb | 7693 | extent_changeset_free(dio_data->data_reserved); |
8b110e39 MX |
7694 | return ret; |
7695 | } | |
7696 | ||
67d66982 | 7697 | static void btrfs_dio_end_io(struct btrfs_bio *bbio) |
8b110e39 | 7698 | { |
67d66982 CH |
7699 | struct btrfs_dio_private *dip = |
7700 | container_of(bbio, struct btrfs_dio_private, bbio); | |
7701 | struct btrfs_inode *inode = bbio->inode; | |
917f32a2 | 7702 | struct bio *bio = &bbio->bio; |
e65e1535 | 7703 | |
67d66982 CH |
7704 | if (bio->bi_status) { |
7705 | btrfs_warn(inode->root->fs_info, | |
7706 | "direct IO failed ino %llu op 0x%0x offset %#llx len %u err no %d", | |
7707 | btrfs_ino(inode), bio->bi_opf, | |
7708 | dip->file_offset, dip->bytes, bio->bi_status); | |
7609afac | 7709 | } |
1ae39938 | 7710 | |
b41b6f69 CH |
7711 | if (btrfs_op(bio) == BTRFS_MAP_WRITE) { |
7712 | btrfs_finish_ordered_extent(bbio->ordered, NULL, | |
7713 | dip->file_offset, dip->bytes, | |
7714 | !bio->bi_status); | |
7715 | } else { | |
67d66982 CH |
7716 | unlock_extent(&inode->io_tree, dip->file_offset, |
7717 | dip->file_offset + dip->bytes - 1, NULL); | |
b41b6f69 | 7718 | } |
ea1f0ced | 7719 | |
67d66982 CH |
7720 | bbio->bio.bi_private = bbio->private; |
7721 | iomap_dio_bio_end_io(bio); | |
e65e1535 MX |
7722 | } |
7723 | ||
67d66982 CH |
7724 | static void btrfs_dio_submit_io(const struct iomap_iter *iter, struct bio *bio, |
7725 | loff_t file_offset) | |
c36cac28 | 7726 | { |
67d66982 | 7727 | struct btrfs_bio *bbio = btrfs_bio(bio); |
642c5d34 | 7728 | struct btrfs_dio_private *dip = |
67d66982 | 7729 | container_of(bbio, struct btrfs_dio_private, bbio); |
491a6d01 | 7730 | struct btrfs_dio_data *dio_data = iter->private; |
544d24f9 | 7731 | |
4317ff00 QW |
7732 | btrfs_bio_init(bbio, BTRFS_I(iter->inode)->root->fs_info, |
7733 | btrfs_dio_end_io, bio->bi_private); | |
7734 | bbio->inode = BTRFS_I(iter->inode); | |
67d66982 | 7735 | bbio->file_offset = file_offset; |
e65e1535 | 7736 | |
67d66982 CH |
7737 | dip->file_offset = file_offset; |
7738 | dip->bytes = bio->bi_iter.bi_size; | |
e65e1535 | 7739 | |
67d66982 | 7740 | dio_data->submitted += bio->bi_iter.bi_size; |
b73a6fd1 BB |
7741 | |
7742 | /* | |
7743 | * Check if we are doing a partial write. If we are, we need to split | |
7744 | * the ordered extent to match the submitted bio. Hang on to the | |
7745 | * remaining unfinishable ordered_extent in dio_data so that it can be | |
7746 | * cancelled in iomap_end to avoid a deadlock wherein faulting the | |
7747 | * remaining pages is blocked on the outstanding ordered extent. | |
7748 | */ | |
7749 | if (iter->flags & IOMAP_WRITE) { | |
7750 | int ret; | |
7751 | ||
7752 | ret = btrfs_extract_ordered_extent(bbio, dio_data->ordered); | |
7753 | if (ret) { | |
7cad645e CH |
7754 | btrfs_finish_ordered_extent(dio_data->ordered, NULL, |
7755 | file_offset, dip->bytes, | |
7756 | !ret); | |
7757 | bio->bi_status = errno_to_blk_status(ret); | |
7758 | iomap_dio_bio_end_io(bio); | |
b73a6fd1 BB |
7759 | return; |
7760 | } | |
7761 | } | |
7762 | ||
ae42a154 | 7763 | btrfs_submit_bio(bbio, 0); |
4b46fce2 JB |
7764 | } |
7765 | ||
36e8c622 | 7766 | static const struct iomap_ops btrfs_dio_iomap_ops = { |
f85781fb GR |
7767 | .iomap_begin = btrfs_dio_iomap_begin, |
7768 | .iomap_end = btrfs_dio_iomap_end, | |
7769 | }; | |
7770 | ||
36e8c622 | 7771 | static const struct iomap_dio_ops btrfs_dio_ops = { |
67d66982 | 7772 | .submit_io = btrfs_dio_submit_io, |
642c5d34 | 7773 | .bio_set = &btrfs_dio_bioset, |
f85781fb GR |
7774 | }; |
7775 | ||
8184620a | 7776 | ssize_t btrfs_dio_read(struct kiocb *iocb, struct iov_iter *iter, size_t done_before) |
36e8c622 | 7777 | { |
53f2c206 | 7778 | struct btrfs_dio_data data = { 0 }; |
491a6d01 | 7779 | |
36e8c622 | 7780 | return iomap_dio_rw(iocb, iter, &btrfs_dio_iomap_ops, &btrfs_dio_ops, |
8184620a FM |
7781 | IOMAP_DIO_PARTIAL, &data, done_before); |
7782 | } | |
7783 | ||
7784 | struct iomap_dio *btrfs_dio_write(struct kiocb *iocb, struct iov_iter *iter, | |
7785 | size_t done_before) | |
7786 | { | |
53f2c206 | 7787 | struct btrfs_dio_data data = { 0 }; |
8184620a FM |
7788 | |
7789 | return __iomap_dio_rw(iocb, iter, &btrfs_dio_iomap_ops, &btrfs_dio_ops, | |
7790 | IOMAP_DIO_PARTIAL, &data, done_before); | |
36e8c622 CH |
7791 | } |
7792 | ||
1506fcc8 | 7793 | static int btrfs_fiemap(struct inode *inode, struct fiemap_extent_info *fieinfo, |
bab16e21 | 7794 | u64 start, u64 len) |
1506fcc8 | 7795 | { |
05dadc09 TI |
7796 | int ret; |
7797 | ||
45dd052e | 7798 | ret = fiemap_prep(inode, fieinfo, start, &len, 0); |
05dadc09 TI |
7799 | if (ret) |
7800 | return ret; | |
7801 | ||
33a86cfa FM |
7802 | /* |
7803 | * fiemap_prep() called filemap_write_and_wait() for the whole possible | |
7804 | * file range (0 to LLONG_MAX), but that is not enough if we have | |
7805 | * compression enabled. The first filemap_fdatawrite_range() only kicks | |
7806 | * in the compression of data (in an async thread) and will return | |
7807 | * before the compression is done and writeback is started. A second | |
7808 | * filemap_fdatawrite_range() is needed to wait for the compression to | |
ac3c0d36 FM |
7809 | * complete and writeback to start. We also need to wait for ordered |
7810 | * extents to complete, because our fiemap implementation uses mainly | |
7811 | * file extent items to list the extents, searching for extent maps | |
7812 | * only for file ranges with holes or prealloc extents to figure out | |
7813 | * if we have delalloc in those ranges. | |
33a86cfa FM |
7814 | */ |
7815 | if (fieinfo->fi_flags & FIEMAP_FLAG_SYNC) { | |
ac3c0d36 | 7816 | ret = btrfs_wait_ordered_range(inode, 0, LLONG_MAX); |
33a86cfa FM |
7817 | if (ret) |
7818 | return ret; | |
7819 | } | |
7820 | ||
facee0a0 | 7821 | return extent_fiemap(BTRFS_I(inode), fieinfo, start, len); |
1506fcc8 YS |
7822 | } |
7823 | ||
48a3b636 ES |
7824 | static int btrfs_writepages(struct address_space *mapping, |
7825 | struct writeback_control *wbc) | |
b293f02e | 7826 | { |
8ae225a8 | 7827 | return extent_writepages(mapping, wbc); |
b293f02e CM |
7828 | } |
7829 | ||
ba206a02 | 7830 | static void btrfs_readahead(struct readahead_control *rac) |
3ab2fb5a | 7831 | { |
ba206a02 | 7832 | extent_readahead(rac); |
3ab2fb5a | 7833 | } |
2a3ff0ad | 7834 | |
7c11d0ae | 7835 | /* |
f913cff3 | 7836 | * For release_folio() and invalidate_folio() we have a race window where |
895586eb | 7837 | * folio_end_writeback() is called but the subpage spinlock is not yet released. |
7c11d0ae QW |
7838 | * If we continue to release/invalidate the page, we could cause use-after-free |
7839 | * for subpage spinlock. So this function is to spin and wait for subpage | |
7840 | * spinlock. | |
7841 | */ | |
7842 | static void wait_subpage_spinlock(struct page *page) | |
7843 | { | |
7844 | struct btrfs_fs_info *fs_info = btrfs_sb(page->mapping->host->i_sb); | |
7845 | struct btrfs_subpage *subpage; | |
7846 | ||
fbca46eb | 7847 | if (!btrfs_is_subpage(fs_info, page)) |
7c11d0ae QW |
7848 | return; |
7849 | ||
7850 | ASSERT(PagePrivate(page) && page->private); | |
7851 | subpage = (struct btrfs_subpage *)page->private; | |
7852 | ||
7853 | /* | |
7854 | * This may look insane as we just acquire the spinlock and release it, | |
7855 | * without doing anything. But we just want to make sure no one is | |
7856 | * still holding the subpage spinlock. | |
7857 | * And since the page is not dirty nor writeback, and we have page | |
7858 | * locked, the only possible way to hold a spinlock is from the endio | |
7859 | * function to clear page writeback. | |
7860 | * | |
7861 | * Here we just acquire the spinlock so that all existing callers | |
7862 | * should exit and we're safe to release/invalidate the page. | |
7863 | */ | |
7864 | spin_lock_irq(&subpage->lock); | |
7865 | spin_unlock_irq(&subpage->lock); | |
7866 | } | |
7867 | ||
f913cff3 | 7868 | static bool __btrfs_release_folio(struct folio *folio, gfp_t gfp_flags) |
9ebefb18 | 7869 | { |
f913cff3 | 7870 | int ret = try_release_extent_mapping(&folio->page, gfp_flags); |
7c11d0ae QW |
7871 | |
7872 | if (ret == 1) { | |
f913cff3 MWO |
7873 | wait_subpage_spinlock(&folio->page); |
7874 | clear_page_extent_mapped(&folio->page); | |
7c11d0ae | 7875 | } |
a52d9a80 | 7876 | return ret; |
39279cc3 CM |
7877 | } |
7878 | ||
f913cff3 | 7879 | static bool btrfs_release_folio(struct folio *folio, gfp_t gfp_flags) |
e6dcd2dc | 7880 | { |
f913cff3 MWO |
7881 | if (folio_test_writeback(folio) || folio_test_dirty(folio)) |
7882 | return false; | |
7883 | return __btrfs_release_folio(folio, gfp_flags); | |
e6dcd2dc CM |
7884 | } |
7885 | ||
f8e66081 | 7886 | #ifdef CONFIG_MIGRATION |
e7a60a17 MWO |
7887 | static int btrfs_migrate_folio(struct address_space *mapping, |
7888 | struct folio *dst, struct folio *src, | |
f8e66081 RG |
7889 | enum migrate_mode mode) |
7890 | { | |
e7a60a17 | 7891 | int ret = filemap_migrate_folio(mapping, dst, src, mode); |
f8e66081 | 7892 | |
f8e66081 RG |
7893 | if (ret != MIGRATEPAGE_SUCCESS) |
7894 | return ret; | |
7895 | ||
e7a60a17 MWO |
7896 | if (folio_test_ordered(src)) { |
7897 | folio_clear_ordered(src); | |
7898 | folio_set_ordered(dst); | |
f8e66081 RG |
7899 | } |
7900 | ||
f8e66081 RG |
7901 | return MIGRATEPAGE_SUCCESS; |
7902 | } | |
e7a60a17 MWO |
7903 | #else |
7904 | #define btrfs_migrate_folio NULL | |
f8e66081 RG |
7905 | #endif |
7906 | ||
895586eb MWO |
7907 | static void btrfs_invalidate_folio(struct folio *folio, size_t offset, |
7908 | size_t length) | |
39279cc3 | 7909 | { |
895586eb | 7910 | struct btrfs_inode *inode = BTRFS_I(folio->mapping->host); |
b945a463 | 7911 | struct btrfs_fs_info *fs_info = inode->root->fs_info; |
53ac7ead | 7912 | struct extent_io_tree *tree = &inode->io_tree; |
2ac55d41 | 7913 | struct extent_state *cached_state = NULL; |
895586eb MWO |
7914 | u64 page_start = folio_pos(folio); |
7915 | u64 page_end = page_start + folio_size(folio) - 1; | |
3b835840 | 7916 | u64 cur; |
53ac7ead | 7917 | int inode_evicting = inode->vfs_inode.i_state & I_FREEING; |
39279cc3 | 7918 | |
8b62b72b | 7919 | /* |
895586eb MWO |
7920 | * We have folio locked so no new ordered extent can be created on this |
7921 | * page, nor bio can be submitted for this folio. | |
8b62b72b | 7922 | * |
895586eb MWO |
7923 | * But already submitted bio can still be finished on this folio. |
7924 | * Furthermore, endio function won't skip folio which has Ordered | |
f57ad937 | 7925 | * (Private2) already cleared, so it's possible for endio and |
895586eb MWO |
7926 | * invalidate_folio to do the same ordered extent accounting twice |
7927 | * on one folio. | |
266a2586 QW |
7928 | * |
7929 | * So here we wait for any submitted bios to finish, so that we won't | |
895586eb | 7930 | * do double ordered extent accounting on the same folio. |
8b62b72b | 7931 | */ |
895586eb MWO |
7932 | folio_wait_writeback(folio); |
7933 | wait_subpage_spinlock(&folio->page); | |
8b62b72b | 7934 | |
bcd77455 QW |
7935 | /* |
7936 | * For subpage case, we have call sites like | |
7937 | * btrfs_punch_hole_lock_range() which passes range not aligned to | |
7938 | * sectorsize. | |
895586eb MWO |
7939 | * If the range doesn't cover the full folio, we don't need to and |
7940 | * shouldn't clear page extent mapped, as folio->private can still | |
bcd77455 QW |
7941 | * record subpage dirty bits for other part of the range. |
7942 | * | |
895586eb MWO |
7943 | * For cases that invalidate the full folio even the range doesn't |
7944 | * cover the full folio, like invalidating the last folio, we're | |
bcd77455 QW |
7945 | * still safe to wait for ordered extent to finish. |
7946 | */ | |
5a60542c | 7947 | if (!(offset == 0 && length == folio_size(folio))) { |
f913cff3 | 7948 | btrfs_release_folio(folio, GFP_NOFS); |
e6dcd2dc CM |
7949 | return; |
7950 | } | |
131e404a FDBM |
7951 | |
7952 | if (!inode_evicting) | |
570eb97b | 7953 | lock_extent(tree, page_start, page_end, &cached_state); |
951c80f8 | 7954 | |
3b835840 QW |
7955 | cur = page_start; |
7956 | while (cur < page_end) { | |
7957 | struct btrfs_ordered_extent *ordered; | |
3b835840 | 7958 | u64 range_end; |
b945a463 | 7959 | u32 range_len; |
bd015294 | 7960 | u32 extra_flags = 0; |
3b835840 QW |
7961 | |
7962 | ordered = btrfs_lookup_first_ordered_range(inode, cur, | |
7963 | page_end + 1 - cur); | |
7964 | if (!ordered) { | |
7965 | range_end = page_end; | |
7966 | /* | |
7967 | * No ordered extent covering this range, we are safe | |
7968 | * to delete all extent states in the range. | |
7969 | */ | |
bd015294 | 7970 | extra_flags = EXTENT_CLEAR_ALL_BITS; |
3b835840 QW |
7971 | goto next; |
7972 | } | |
7973 | if (ordered->file_offset > cur) { | |
7974 | /* | |
7975 | * There is a range between [cur, oe->file_offset) not | |
7976 | * covered by any ordered extent. | |
7977 | * We are safe to delete all extent states, and handle | |
7978 | * the ordered extent in the next iteration. | |
7979 | */ | |
7980 | range_end = ordered->file_offset - 1; | |
bd015294 | 7981 | extra_flags = EXTENT_CLEAR_ALL_BITS; |
3b835840 QW |
7982 | goto next; |
7983 | } | |
7984 | ||
7985 | range_end = min(ordered->file_offset + ordered->num_bytes - 1, | |
7986 | page_end); | |
b945a463 QW |
7987 | ASSERT(range_end + 1 - cur < U32_MAX); |
7988 | range_len = range_end + 1 - cur; | |
895586eb | 7989 | if (!btrfs_page_test_ordered(fs_info, &folio->page, cur, range_len)) { |
3b835840 | 7990 | /* |
f57ad937 QW |
7991 | * If Ordered (Private2) is cleared, it means endio has |
7992 | * already been executed for the range. | |
3b835840 QW |
7993 | * We can't delete the extent states as |
7994 | * btrfs_finish_ordered_io() may still use some of them. | |
7995 | */ | |
3b835840 QW |
7996 | goto next; |
7997 | } | |
895586eb | 7998 | btrfs_page_clear_ordered(fs_info, &folio->page, cur, range_len); |
3b835840 | 7999 | |
eb84ae03 | 8000 | /* |
2766ff61 FM |
8001 | * IO on this page will never be started, so we need to account |
8002 | * for any ordered extents now. Don't clear EXTENT_DELALLOC_NEW | |
8003 | * here, must leave that up for the ordered extent completion. | |
3b835840 QW |
8004 | * |
8005 | * This will also unlock the range for incoming | |
8006 | * btrfs_finish_ordered_io(). | |
eb84ae03 | 8007 | */ |
131e404a | 8008 | if (!inode_evicting) |
3b835840 | 8009 | clear_extent_bit(tree, cur, range_end, |
2766ff61 | 8010 | EXTENT_DELALLOC | |
131e404a | 8011 | EXTENT_LOCKED | EXTENT_DO_ACCOUNTING | |
bd015294 | 8012 | EXTENT_DEFRAG, &cached_state); |
3b835840 | 8013 | |
54c65371 | 8014 | spin_lock_irq(&inode->ordered_tree_lock); |
3b835840 QW |
8015 | set_bit(BTRFS_ORDERED_TRUNCATED, &ordered->flags); |
8016 | ordered->truncated_len = min(ordered->truncated_len, | |
8017 | cur - ordered->file_offset); | |
54c65371 | 8018 | spin_unlock_irq(&inode->ordered_tree_lock); |
3b835840 | 8019 | |
bd015294 JB |
8020 | /* |
8021 | * If the ordered extent has finished, we're safe to delete all | |
8022 | * the extent states of the range, otherwise | |
8023 | * btrfs_finish_ordered_io() will get executed by endio for | |
8024 | * other pages, so we can't delete extent states. | |
8025 | */ | |
3b835840 | 8026 | if (btrfs_dec_test_ordered_pending(inode, &ordered, |
f41b6ba9 | 8027 | cur, range_end + 1 - cur)) { |
3b835840 QW |
8028 | btrfs_finish_ordered_io(ordered); |
8029 | /* | |
8030 | * The ordered extent has finished, now we're again | |
8031 | * safe to delete all extent states of the range. | |
8032 | */ | |
bd015294 | 8033 | extra_flags = EXTENT_CLEAR_ALL_BITS; |
3b835840 QW |
8034 | } |
8035 | next: | |
8036 | if (ordered) | |
8037 | btrfs_put_ordered_extent(ordered); | |
8b62b72b | 8038 | /* |
3b835840 QW |
8039 | * Qgroup reserved space handler |
8040 | * Sector(s) here will be either: | |
266a2586 | 8041 | * |
3b835840 QW |
8042 | * 1) Already written to disk or bio already finished |
8043 | * Then its QGROUP_RESERVED bit in io_tree is already cleared. | |
8044 | * Qgroup will be handled by its qgroup_record then. | |
8045 | * btrfs_qgroup_free_data() call will do nothing here. | |
8046 | * | |
8047 | * 2) Not written to disk yet | |
8048 | * Then btrfs_qgroup_free_data() call will clear the | |
8049 | * QGROUP_RESERVED bit of its io_tree, and free the qgroup | |
8050 | * reserved data space. | |
8051 | * Since the IO will never happen for this page. | |
8b62b72b | 8052 | */ |
3b835840 | 8053 | btrfs_qgroup_free_data(inode, NULL, cur, range_end + 1 - cur); |
131e404a | 8054 | if (!inode_evicting) { |
3b835840 QW |
8055 | clear_extent_bit(tree, cur, range_end, EXTENT_LOCKED | |
8056 | EXTENT_DELALLOC | EXTENT_UPTODATE | | |
bd015294 JB |
8057 | EXTENT_DO_ACCOUNTING | EXTENT_DEFRAG | |
8058 | extra_flags, &cached_state); | |
131e404a | 8059 | } |
3b835840 | 8060 | cur = range_end + 1; |
131e404a | 8061 | } |
b9d0b389 | 8062 | /* |
3b835840 | 8063 | * We have iterated through all ordered extents of the page, the page |
f57ad937 QW |
8064 | * should not have Ordered (Private2) anymore, or the above iteration |
8065 | * did something wrong. | |
b9d0b389 | 8066 | */ |
895586eb MWO |
8067 | ASSERT(!folio_test_ordered(folio)); |
8068 | btrfs_page_clear_checked(fs_info, &folio->page, folio_pos(folio), folio_size(folio)); | |
3b835840 | 8069 | if (!inode_evicting) |
f913cff3 | 8070 | __btrfs_release_folio(folio, GFP_NOFS); |
895586eb | 8071 | clear_page_extent_mapped(&folio->page); |
39279cc3 CM |
8072 | } |
8073 | ||
9ebefb18 CM |
8074 | /* |
8075 | * btrfs_page_mkwrite() is not allowed to change the file size as it gets | |
8076 | * called from a page fault handler when a page is first dirtied. Hence we must | |
8077 | * be careful to check for EOF conditions here. We set the page up correctly | |
8078 | * for a written page which means we get ENOSPC checking when writing into | |
8079 | * holes and correct delalloc and unwritten extent mapping on filesystems that | |
8080 | * support these features. | |
8081 | * | |
8082 | * We are not allowed to take the i_mutex here so we have to play games to | |
8083 | * protect against truncate races as the page could now be beyond EOF. Because | |
d1342aad OS |
8084 | * truncate_setsize() writes the inode size before removing pages, once we have |
8085 | * the page lock we can determine safely if the page is beyond EOF. If it is not | |
9ebefb18 CM |
8086 | * beyond EOF, then the page is guaranteed safe against truncation until we |
8087 | * unlock the page. | |
8088 | */ | |
a528a241 | 8089 | vm_fault_t btrfs_page_mkwrite(struct vm_fault *vmf) |
9ebefb18 | 8090 | { |
c2ec175c | 8091 | struct page *page = vmf->page; |
11bac800 | 8092 | struct inode *inode = file_inode(vmf->vma->vm_file); |
0b246afa | 8093 | struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); |
e6dcd2dc CM |
8094 | struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; |
8095 | struct btrfs_ordered_extent *ordered; | |
2ac55d41 | 8096 | struct extent_state *cached_state = NULL; |
364ecf36 | 8097 | struct extent_changeset *data_reserved = NULL; |
e6dcd2dc | 8098 | unsigned long zero_start; |
9ebefb18 | 8099 | loff_t size; |
a528a241 SJ |
8100 | vm_fault_t ret; |
8101 | int ret2; | |
9998eb70 | 8102 | int reserved = 0; |
d0b7da88 | 8103 | u64 reserved_space; |
a52d9a80 | 8104 | u64 page_start; |
e6dcd2dc | 8105 | u64 page_end; |
d0b7da88 CR |
8106 | u64 end; |
8107 | ||
09cbfeaf | 8108 | reserved_space = PAGE_SIZE; |
9ebefb18 | 8109 | |
b2b5ef5c | 8110 | sb_start_pagefault(inode->i_sb); |
df480633 | 8111 | page_start = page_offset(page); |
09cbfeaf | 8112 | page_end = page_start + PAGE_SIZE - 1; |
d0b7da88 | 8113 | end = page_end; |
df480633 | 8114 | |
d0b7da88 CR |
8115 | /* |
8116 | * Reserving delalloc space after obtaining the page lock can lead to | |
8117 | * deadlock. For example, if a dirty page is locked by this function | |
8118 | * and the call to btrfs_delalloc_reserve_space() ends up triggering | |
f3e90c1c | 8119 | * dirty page write out, then the btrfs_writepages() function could |
d0b7da88 CR |
8120 | * end up waiting indefinitely to get a lock on the page currently |
8121 | * being processed by btrfs_page_mkwrite() function. | |
8122 | */ | |
e5b7231e NB |
8123 | ret2 = btrfs_delalloc_reserve_space(BTRFS_I(inode), &data_reserved, |
8124 | page_start, reserved_space); | |
a528a241 SJ |
8125 | if (!ret2) { |
8126 | ret2 = file_update_time(vmf->vma->vm_file); | |
9998eb70 CM |
8127 | reserved = 1; |
8128 | } | |
a528a241 SJ |
8129 | if (ret2) { |
8130 | ret = vmf_error(ret2); | |
9998eb70 CM |
8131 | if (reserved) |
8132 | goto out; | |
8133 | goto out_noreserve; | |
56a76f82 | 8134 | } |
1832a6d5 | 8135 | |
56a76f82 | 8136 | ret = VM_FAULT_NOPAGE; /* make the VM retry the fault */ |
e6dcd2dc | 8137 | again: |
8318ba79 | 8138 | down_read(&BTRFS_I(inode)->i_mmap_lock); |
9ebefb18 | 8139 | lock_page(page); |
9ebefb18 | 8140 | size = i_size_read(inode); |
a52d9a80 | 8141 | |
9ebefb18 | 8142 | if ((page->mapping != inode->i_mapping) || |
e6dcd2dc | 8143 | (page_start >= size)) { |
9ebefb18 CM |
8144 | /* page got truncated out from underneath us */ |
8145 | goto out_unlock; | |
8146 | } | |
e6dcd2dc CM |
8147 | wait_on_page_writeback(page); |
8148 | ||
570eb97b | 8149 | lock_extent(io_tree, page_start, page_end, &cached_state); |
32443de3 QW |
8150 | ret2 = set_page_extent_mapped(page); |
8151 | if (ret2 < 0) { | |
8152 | ret = vmf_error(ret2); | |
570eb97b | 8153 | unlock_extent(io_tree, page_start, page_end, &cached_state); |
32443de3 QW |
8154 | goto out_unlock; |
8155 | } | |
e6dcd2dc | 8156 | |
eb84ae03 CM |
8157 | /* |
8158 | * we can't set the delalloc bits if there are pending ordered | |
8159 | * extents. Drop our locks and wait for them to finish | |
8160 | */ | |
a776c6fa NB |
8161 | ordered = btrfs_lookup_ordered_range(BTRFS_I(inode), page_start, |
8162 | PAGE_SIZE); | |
e6dcd2dc | 8163 | if (ordered) { |
570eb97b | 8164 | unlock_extent(io_tree, page_start, page_end, &cached_state); |
e6dcd2dc | 8165 | unlock_page(page); |
8318ba79 | 8166 | up_read(&BTRFS_I(inode)->i_mmap_lock); |
36d45567 | 8167 | btrfs_start_ordered_extent(ordered); |
e6dcd2dc CM |
8168 | btrfs_put_ordered_extent(ordered); |
8169 | goto again; | |
8170 | } | |
8171 | ||
09cbfeaf | 8172 | if (page->index == ((size - 1) >> PAGE_SHIFT)) { |
da17066c | 8173 | reserved_space = round_up(size - page_start, |
0b246afa | 8174 | fs_info->sectorsize); |
09cbfeaf | 8175 | if (reserved_space < PAGE_SIZE) { |
d0b7da88 | 8176 | end = page_start + reserved_space - 1; |
86d52921 NB |
8177 | btrfs_delalloc_release_space(BTRFS_I(inode), |
8178 | data_reserved, page_start, | |
8179 | PAGE_SIZE - reserved_space, true); | |
d0b7da88 CR |
8180 | } |
8181 | } | |
8182 | ||
fbf19087 | 8183 | /* |
5416034f LB |
8184 | * page_mkwrite gets called when the page is firstly dirtied after it's |
8185 | * faulted in, but write(2) could also dirty a page and set delalloc | |
8186 | * bits, thus in this case for space account reason, we still need to | |
8187 | * clear any delalloc bits within this page range since we have to | |
8188 | * reserve data&meta space before lock_page() (see above comments). | |
fbf19087 | 8189 | */ |
d0b7da88 | 8190 | clear_extent_bit(&BTRFS_I(inode)->io_tree, page_start, end, |
e182163d | 8191 | EXTENT_DELALLOC | EXTENT_DO_ACCOUNTING | |
bd015294 | 8192 | EXTENT_DEFRAG, &cached_state); |
fbf19087 | 8193 | |
c2566f22 | 8194 | ret2 = btrfs_set_extent_delalloc(BTRFS_I(inode), page_start, end, 0, |
330a5827 | 8195 | &cached_state); |
a528a241 | 8196 | if (ret2) { |
570eb97b | 8197 | unlock_extent(io_tree, page_start, page_end, &cached_state); |
9ed74f2d JB |
8198 | ret = VM_FAULT_SIGBUS; |
8199 | goto out_unlock; | |
8200 | } | |
9ebefb18 CM |
8201 | |
8202 | /* page is wholly or partially inside EOF */ | |
09cbfeaf | 8203 | if (page_start + PAGE_SIZE > size) |
7073017a | 8204 | zero_start = offset_in_page(size); |
9ebefb18 | 8205 | else |
09cbfeaf | 8206 | zero_start = PAGE_SIZE; |
9ebefb18 | 8207 | |
21a8935e | 8208 | if (zero_start != PAGE_SIZE) |
d048b9c2 | 8209 | memzero_page(page, zero_start, PAGE_SIZE - zero_start); |
21a8935e | 8210 | |
e4f94347 | 8211 | btrfs_page_clear_checked(fs_info, page, page_start, PAGE_SIZE); |
2d8ec40e QW |
8212 | btrfs_page_set_dirty(fs_info, page, page_start, end + 1 - page_start); |
8213 | btrfs_page_set_uptodate(fs_info, page, page_start, end + 1 - page_start); | |
5a3f23d5 | 8214 | |
bc0939fc | 8215 | btrfs_set_inode_last_sub_trans(BTRFS_I(inode)); |
257c62e1 | 8216 | |
570eb97b | 8217 | unlock_extent(io_tree, page_start, page_end, &cached_state); |
8318ba79 | 8218 | up_read(&BTRFS_I(inode)->i_mmap_lock); |
9ebefb18 | 8219 | |
76de60ed YY |
8220 | btrfs_delalloc_release_extents(BTRFS_I(inode), PAGE_SIZE); |
8221 | sb_end_pagefault(inode->i_sb); | |
8222 | extent_changeset_free(data_reserved); | |
8223 | return VM_FAULT_LOCKED; | |
717beb96 CM |
8224 | |
8225 | out_unlock: | |
9ebefb18 | 8226 | unlock_page(page); |
8318ba79 | 8227 | up_read(&BTRFS_I(inode)->i_mmap_lock); |
1832a6d5 | 8228 | out: |
8702ba93 | 8229 | btrfs_delalloc_release_extents(BTRFS_I(inode), PAGE_SIZE); |
86d52921 | 8230 | btrfs_delalloc_release_space(BTRFS_I(inode), data_reserved, page_start, |
43b18595 | 8231 | reserved_space, (ret != 0)); |
9998eb70 | 8232 | out_noreserve: |
b2b5ef5c | 8233 | sb_end_pagefault(inode->i_sb); |
364ecf36 | 8234 | extent_changeset_free(data_reserved); |
9ebefb18 CM |
8235 | return ret; |
8236 | } | |
8237 | ||
d9dcae67 | 8238 | static int btrfs_truncate(struct btrfs_inode *inode, bool skip_writeback) |
39279cc3 | 8239 | { |
d9ac19c3 | 8240 | struct btrfs_truncate_control control = { |
d9dcae67 DS |
8241 | .inode = inode, |
8242 | .ino = btrfs_ino(inode), | |
d9ac19c3 | 8243 | .min_type = BTRFS_EXTENT_DATA_KEY, |
655807b8 | 8244 | .clear_extent_range = true, |
d9ac19c3 | 8245 | }; |
d9dcae67 DS |
8246 | struct btrfs_root *root = inode->root; |
8247 | struct btrfs_fs_info *fs_info = root->fs_info; | |
fcb80c2a | 8248 | struct btrfs_block_rsv *rsv; |
ad7e1a74 | 8249 | int ret; |
39279cc3 | 8250 | struct btrfs_trans_handle *trans; |
0b246afa | 8251 | u64 mask = fs_info->sectorsize - 1; |
6822b3f7 | 8252 | const u64 min_size = btrfs_calc_metadata_size(fs_info, 1); |
39279cc3 | 8253 | |
213e8c55 | 8254 | if (!skip_writeback) { |
d9dcae67 DS |
8255 | ret = btrfs_wait_ordered_range(&inode->vfs_inode, |
8256 | inode->vfs_inode.i_size & (~mask), | |
213e8c55 FM |
8257 | (u64)-1); |
8258 | if (ret) | |
8259 | return ret; | |
8260 | } | |
39279cc3 | 8261 | |
fcb80c2a | 8262 | /* |
f7e9e8fc OS |
8263 | * Yes ladies and gentlemen, this is indeed ugly. We have a couple of |
8264 | * things going on here: | |
fcb80c2a | 8265 | * |
f7e9e8fc | 8266 | * 1) We need to reserve space to update our inode. |
fcb80c2a | 8267 | * |
f7e9e8fc | 8268 | * 2) We need to have something to cache all the space that is going to |
fcb80c2a JB |
8269 | * be free'd up by the truncate operation, but also have some slack |
8270 | * space reserved in case it uses space during the truncate (thank you | |
8271 | * very much snapshotting). | |
8272 | * | |
f7e9e8fc | 8273 | * And we need these to be separate. The fact is we can use a lot of |
fcb80c2a | 8274 | * space doing the truncate, and we have no earthly idea how much space |
01327610 | 8275 | * we will use, so we need the truncate reservation to be separate so it |
f7e9e8fc OS |
8276 | * doesn't end up using space reserved for updating the inode. We also |
8277 | * need to be able to stop the transaction and start a new one, which | |
8278 | * means we need to be able to update the inode several times, and we | |
8279 | * have no idea of knowing how many times that will be, so we can't just | |
8280 | * reserve 1 item for the entirety of the operation, so that has to be | |
8281 | * done separately as well. | |
fcb80c2a JB |
8282 | * |
8283 | * So that leaves us with | |
8284 | * | |
f7e9e8fc | 8285 | * 1) rsv - for the truncate reservation, which we will steal from the |
fcb80c2a | 8286 | * transaction reservation. |
f7e9e8fc | 8287 | * 2) fs_info->trans_block_rsv - this will have 1 items worth left for |
fcb80c2a JB |
8288 | * updating the inode. |
8289 | */ | |
2ff7e61e | 8290 | rsv = btrfs_alloc_block_rsv(fs_info, BTRFS_BLOCK_RSV_TEMP); |
fcb80c2a JB |
8291 | if (!rsv) |
8292 | return -ENOMEM; | |
4a338542 | 8293 | rsv->size = min_size; |
710d5921 | 8294 | rsv->failfast = true; |
f0cd846e | 8295 | |
907cbceb | 8296 | /* |
07127184 | 8297 | * 1 for the truncate slack space |
907cbceb JB |
8298 | * 1 for updating the inode. |
8299 | */ | |
f3fe820c | 8300 | trans = btrfs_start_transaction(root, 2); |
fcb80c2a | 8301 | if (IS_ERR(trans)) { |
ad7e1a74 | 8302 | ret = PTR_ERR(trans); |
fcb80c2a JB |
8303 | goto out; |
8304 | } | |
f0cd846e | 8305 | |
907cbceb | 8306 | /* Migrate the slack space for the truncate to our reserve */ |
0b246afa | 8307 | ret = btrfs_block_rsv_migrate(&fs_info->trans_block_rsv, rsv, |
3a584174 | 8308 | min_size, false); |
6822b3f7 FM |
8309 | /* |
8310 | * We have reserved 2 metadata units when we started the transaction and | |
8311 | * min_size matches 1 unit, so this should never fail, but if it does, | |
8312 | * it's not critical we just fail truncation. | |
8313 | */ | |
8314 | if (WARN_ON(ret)) { | |
8315 | btrfs_end_transaction(trans); | |
8316 | goto out; | |
8317 | } | |
f0cd846e | 8318 | |
ca7e70f5 | 8319 | trans->block_rsv = rsv; |
907cbceb | 8320 | |
8082510e | 8321 | while (1) { |
9a4a1429 | 8322 | struct extent_state *cached_state = NULL; |
d9dcae67 | 8323 | const u64 new_size = inode->vfs_inode.i_size; |
9a4a1429 JB |
8324 | const u64 lock_start = ALIGN_DOWN(new_size, fs_info->sectorsize); |
8325 | ||
d9ac19c3 | 8326 | control.new_size = new_size; |
d9dcae67 | 8327 | lock_extent(&inode->io_tree, lock_start, (u64)-1, &cached_state); |
9a4a1429 JB |
8328 | /* |
8329 | * We want to drop from the next block forward in case this new | |
8330 | * size is not block aligned since we will be keeping the last | |
8331 | * block of the extent just the way it is. | |
8332 | */ | |
d9dcae67 | 8333 | btrfs_drop_extent_map_range(inode, |
4c0c8cfc FM |
8334 | ALIGN(new_size, fs_info->sectorsize), |
8335 | (u64)-1, false); | |
9a4a1429 | 8336 | |
71d18b53 | 8337 | ret = btrfs_truncate_inode_items(trans, root, &control); |
c2ddb612 | 8338 | |
d9dcae67 DS |
8339 | inode_sub_bytes(&inode->vfs_inode, control.sub_bytes); |
8340 | btrfs_inode_safe_disk_i_size_write(inode, control.last_size); | |
c2ddb612 | 8341 | |
d9dcae67 | 8342 | unlock_extent(&inode->io_tree, lock_start, (u64)-1, &cached_state); |
9a4a1429 | 8343 | |
ddfae63c | 8344 | trans->block_rsv = &fs_info->trans_block_rsv; |
ad7e1a74 | 8345 | if (ret != -ENOSPC && ret != -EAGAIN) |
8082510e | 8346 | break; |
39279cc3 | 8347 | |
8b9d0322 | 8348 | ret = btrfs_update_inode(trans, inode); |
ad7e1a74 | 8349 | if (ret) |
3893e33b | 8350 | break; |
ca7e70f5 | 8351 | |
3a45bb20 | 8352 | btrfs_end_transaction(trans); |
2ff7e61e | 8353 | btrfs_btree_balance_dirty(fs_info); |
ca7e70f5 JB |
8354 | |
8355 | trans = btrfs_start_transaction(root, 2); | |
8356 | if (IS_ERR(trans)) { | |
ad7e1a74 | 8357 | ret = PTR_ERR(trans); |
ca7e70f5 JB |
8358 | trans = NULL; |
8359 | break; | |
8360 | } | |
8361 | ||
63f018be | 8362 | btrfs_block_rsv_release(fs_info, rsv, -1, NULL); |
0b246afa | 8363 | ret = btrfs_block_rsv_migrate(&fs_info->trans_block_rsv, |
3a584174 | 8364 | rsv, min_size, false); |
6822b3f7 FM |
8365 | /* |
8366 | * We have reserved 2 metadata units when we started the | |
8367 | * transaction and min_size matches 1 unit, so this should never | |
8368 | * fail, but if it does, it's not critical we just fail truncation. | |
8369 | */ | |
8370 | if (WARN_ON(ret)) | |
8371 | break; | |
8372 | ||
ca7e70f5 | 8373 | trans->block_rsv = rsv; |
8082510e YZ |
8374 | } |
8375 | ||
ddfae63c JB |
8376 | /* |
8377 | * We can't call btrfs_truncate_block inside a trans handle as we could | |
54f03ab1 JB |
8378 | * deadlock with freeze, if we got BTRFS_NEED_TRUNCATE_BLOCK then we |
8379 | * know we've truncated everything except the last little bit, and can | |
8380 | * do btrfs_truncate_block and then update the disk_i_size. | |
ddfae63c | 8381 | */ |
54f03ab1 | 8382 | if (ret == BTRFS_NEED_TRUNCATE_BLOCK) { |
ddfae63c JB |
8383 | btrfs_end_transaction(trans); |
8384 | btrfs_btree_balance_dirty(fs_info); | |
8385 | ||
d9dcae67 | 8386 | ret = btrfs_truncate_block(inode, inode->vfs_inode.i_size, 0, 0); |
ddfae63c JB |
8387 | if (ret) |
8388 | goto out; | |
8389 | trans = btrfs_start_transaction(root, 1); | |
8390 | if (IS_ERR(trans)) { | |
8391 | ret = PTR_ERR(trans); | |
8392 | goto out; | |
8393 | } | |
d9dcae67 | 8394 | btrfs_inode_safe_disk_i_size_write(inode, 0); |
ddfae63c JB |
8395 | } |
8396 | ||
917c16b2 | 8397 | if (trans) { |
ad7e1a74 OS |
8398 | int ret2; |
8399 | ||
0b246afa | 8400 | trans->block_rsv = &fs_info->trans_block_rsv; |
8b9d0322 | 8401 | ret2 = btrfs_update_inode(trans, inode); |
ad7e1a74 OS |
8402 | if (ret2 && !ret) |
8403 | ret = ret2; | |
7b128766 | 8404 | |
ad7e1a74 OS |
8405 | ret2 = btrfs_end_transaction(trans); |
8406 | if (ret2 && !ret) | |
8407 | ret = ret2; | |
2ff7e61e | 8408 | btrfs_btree_balance_dirty(fs_info); |
917c16b2 | 8409 | } |
fcb80c2a | 8410 | out: |
2ff7e61e | 8411 | btrfs_free_block_rsv(fs_info, rsv); |
0d7d3165 FM |
8412 | /* |
8413 | * So if we truncate and then write and fsync we normally would just | |
8414 | * write the extents that changed, which is a problem if we need to | |
8415 | * first truncate that entire inode. So set this flag so we write out | |
8416 | * all of the extents in the inode to the sync log so we're completely | |
8417 | * safe. | |
8418 | * | |
8419 | * If no extents were dropped or trimmed we don't need to force the next | |
8420 | * fsync to truncate all the inode's items from the log and re-log them | |
8421 | * all. This means the truncate operation did not change the file size, | |
8422 | * or changed it to a smaller size but there was only an implicit hole | |
8423 | * between the old i_size and the new i_size, and there were no prealloc | |
8424 | * extents beyond i_size to drop. | |
8425 | */ | |
d9ac19c3 | 8426 | if (control.extents_found > 0) |
d9dcae67 | 8427 | btrfs_set_inode_full_sync(inode); |
fcb80c2a | 8428 | |
ad7e1a74 | 8429 | return ret; |
39279cc3 CM |
8430 | } |
8431 | ||
f2d40141 | 8432 | struct inode *btrfs_new_subvol_inode(struct mnt_idmap *idmap, |
a1fd0c35 OS |
8433 | struct inode *dir) |
8434 | { | |
8435 | struct inode *inode; | |
8436 | ||
8437 | inode = new_inode(dir->i_sb); | |
8438 | if (inode) { | |
8439 | /* | |
8440 | * Subvolumes don't inherit the sgid bit or the parent's gid if | |
8441 | * the parent's sgid bit is set. This is probably a bug. | |
8442 | */ | |
f2d40141 | 8443 | inode_init_owner(idmap, inode, NULL, |
a1fd0c35 OS |
8444 | S_IFDIR | (~current_umask() & S_IRWXUGO)); |
8445 | inode->i_op = &btrfs_dir_inode_operations; | |
8446 | inode->i_fop = &btrfs_dir_file_operations; | |
8447 | } | |
8448 | return inode; | |
8449 | } | |
8450 | ||
39279cc3 CM |
8451 | struct inode *btrfs_alloc_inode(struct super_block *sb) |
8452 | { | |
69fe2d75 | 8453 | struct btrfs_fs_info *fs_info = btrfs_sb(sb); |
39279cc3 | 8454 | struct btrfs_inode *ei; |
2ead6ae7 | 8455 | struct inode *inode; |
39279cc3 | 8456 | |
fd60b288 | 8457 | ei = alloc_inode_sb(sb, btrfs_inode_cachep, GFP_KERNEL); |
39279cc3 CM |
8458 | if (!ei) |
8459 | return NULL; | |
2ead6ae7 YZ |
8460 | |
8461 | ei->root = NULL; | |
2ead6ae7 | 8462 | ei->generation = 0; |
15ee9bc7 | 8463 | ei->last_trans = 0; |
257c62e1 | 8464 | ei->last_sub_trans = 0; |
e02119d5 | 8465 | ei->logged_trans = 0; |
2ead6ae7 | 8466 | ei->delalloc_bytes = 0; |
a7e3b975 | 8467 | ei->new_delalloc_bytes = 0; |
47059d93 | 8468 | ei->defrag_bytes = 0; |
2ead6ae7 YZ |
8469 | ei->disk_i_size = 0; |
8470 | ei->flags = 0; | |
77eea05e | 8471 | ei->ro_flags = 0; |
7709cde3 | 8472 | ei->csum_bytes = 0; |
2ead6ae7 | 8473 | ei->index_cnt = (u64)-1; |
67de1176 | 8474 | ei->dir_index = 0; |
2ead6ae7 | 8475 | ei->last_unlink_trans = 0; |
3ebac17c | 8476 | ei->last_reflink_trans = 0; |
46d8bc34 | 8477 | ei->last_log_commit = 0; |
2ead6ae7 | 8478 | |
9e0baf60 JB |
8479 | spin_lock_init(&ei->lock); |
8480 | ei->outstanding_extents = 0; | |
69fe2d75 JB |
8481 | if (sb->s_magic != BTRFS_TEST_MAGIC) |
8482 | btrfs_init_metadata_block_rsv(fs_info, &ei->block_rsv, | |
8483 | BTRFS_BLOCK_RSV_DELALLOC); | |
72ac3c0d | 8484 | ei->runtime_flags = 0; |
b52aa8c9 | 8485 | ei->prop_compress = BTRFS_COMPRESS_NONE; |
eec63c65 | 8486 | ei->defrag_compress = BTRFS_COMPRESS_NONE; |
2ead6ae7 | 8487 | |
16cdcec7 MX |
8488 | ei->delayed_node = NULL; |
8489 | ||
9cc97d64 | 8490 | ei->i_otime.tv_sec = 0; |
8491 | ei->i_otime.tv_nsec = 0; | |
8492 | ||
2ead6ae7 | 8493 | inode = &ei->vfs_inode; |
a8067e02 | 8494 | extent_map_tree_init(&ei->extent_tree); |
35da5a7e | 8495 | extent_io_tree_init(fs_info, &ei->io_tree, IO_TREE_INODE_IO); |
0988fc7b | 8496 | ei->io_tree.inode = ei; |
41a2ee75 | 8497 | extent_io_tree_init(fs_info, &ei->file_extent_tree, |
35da5a7e | 8498 | IO_TREE_INODE_FILE_EXTENT); |
2ead6ae7 | 8499 | mutex_init(&ei->log_mutex); |
54c65371 DS |
8500 | spin_lock_init(&ei->ordered_tree_lock); |
8501 | ei->ordered_tree = RB_ROOT; | |
8502 | ei->ordered_tree_last = NULL; | |
2ead6ae7 | 8503 | INIT_LIST_HEAD(&ei->delalloc_inodes); |
8089fe62 | 8504 | INIT_LIST_HEAD(&ei->delayed_iput); |
2ead6ae7 | 8505 | RB_CLEAR_NODE(&ei->rb_node); |
8318ba79 | 8506 | init_rwsem(&ei->i_mmap_lock); |
2ead6ae7 YZ |
8507 | |
8508 | return inode; | |
39279cc3 CM |
8509 | } |
8510 | ||
aaedb55b JB |
8511 | #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS |
8512 | void btrfs_test_destroy_inode(struct inode *inode) | |
8513 | { | |
4c0c8cfc | 8514 | btrfs_drop_extent_map_range(BTRFS_I(inode), 0, (u64)-1, false); |
aaedb55b JB |
8515 | kmem_cache_free(btrfs_inode_cachep, BTRFS_I(inode)); |
8516 | } | |
8517 | #endif | |
8518 | ||
26602cab | 8519 | void btrfs_free_inode(struct inode *inode) |
fa0d7e3d | 8520 | { |
fa0d7e3d NP |
8521 | kmem_cache_free(btrfs_inode_cachep, BTRFS_I(inode)); |
8522 | } | |
8523 | ||
633cc816 | 8524 | void btrfs_destroy_inode(struct inode *vfs_inode) |
39279cc3 | 8525 | { |
e6dcd2dc | 8526 | struct btrfs_ordered_extent *ordered; |
633cc816 NB |
8527 | struct btrfs_inode *inode = BTRFS_I(vfs_inode); |
8528 | struct btrfs_root *root = inode->root; | |
5f4403e1 | 8529 | bool freespace_inode; |
5a3f23d5 | 8530 | |
633cc816 NB |
8531 | WARN_ON(!hlist_empty(&vfs_inode->i_dentry)); |
8532 | WARN_ON(vfs_inode->i_data.nrpages); | |
8533 | WARN_ON(inode->block_rsv.reserved); | |
8534 | WARN_ON(inode->block_rsv.size); | |
8535 | WARN_ON(inode->outstanding_extents); | |
dc287224 FM |
8536 | if (!S_ISDIR(vfs_inode->i_mode)) { |
8537 | WARN_ON(inode->delalloc_bytes); | |
8538 | WARN_ON(inode->new_delalloc_bytes); | |
8539 | } | |
633cc816 NB |
8540 | WARN_ON(inode->csum_bytes); |
8541 | WARN_ON(inode->defrag_bytes); | |
39279cc3 | 8542 | |
a6dbd429 JB |
8543 | /* |
8544 | * This can happen where we create an inode, but somebody else also | |
8545 | * created the same inode and we need to destroy the one we already | |
8546 | * created. | |
8547 | */ | |
8548 | if (!root) | |
26602cab | 8549 | return; |
a6dbd429 | 8550 | |
5f4403e1 IA |
8551 | /* |
8552 | * If this is a free space inode do not take the ordered extents lockdep | |
8553 | * map. | |
8554 | */ | |
8555 | freespace_inode = btrfs_is_free_space_inode(inode); | |
8556 | ||
d397712b | 8557 | while (1) { |
633cc816 | 8558 | ordered = btrfs_lookup_first_ordered_extent(inode, (u64)-1); |
e6dcd2dc CM |
8559 | if (!ordered) |
8560 | break; | |
8561 | else { | |
633cc816 | 8562 | btrfs_err(root->fs_info, |
5d163e0e | 8563 | "found ordered extent %llu %llu on inode cleanup", |
bffe633e | 8564 | ordered->file_offset, ordered->num_bytes); |
5f4403e1 IA |
8565 | |
8566 | if (!freespace_inode) | |
8567 | btrfs_lockdep_acquire(root->fs_info, btrfs_ordered_extent); | |
8568 | ||
71fe0a55 | 8569 | btrfs_remove_ordered_extent(inode, ordered); |
e6dcd2dc CM |
8570 | btrfs_put_ordered_extent(ordered); |
8571 | btrfs_put_ordered_extent(ordered); | |
8572 | } | |
8573 | } | |
633cc816 NB |
8574 | btrfs_qgroup_check_reserved_leak(inode); |
8575 | inode_tree_del(inode); | |
4c0c8cfc | 8576 | btrfs_drop_extent_map_range(inode, 0, (u64)-1, false); |
633cc816 NB |
8577 | btrfs_inode_clear_file_extent_range(inode, 0, (u64)-1); |
8578 | btrfs_put_root(inode->root); | |
39279cc3 CM |
8579 | } |
8580 | ||
45321ac5 | 8581 | int btrfs_drop_inode(struct inode *inode) |
76dda93c YZ |
8582 | { |
8583 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
45321ac5 | 8584 | |
6379ef9f NA |
8585 | if (root == NULL) |
8586 | return 1; | |
8587 | ||
fa6ac876 | 8588 | /* the snap/subvol tree is on deleting */ |
69e9c6c6 | 8589 | if (btrfs_root_refs(&root->root_item) == 0) |
45321ac5 | 8590 | return 1; |
76dda93c | 8591 | else |
45321ac5 | 8592 | return generic_drop_inode(inode); |
76dda93c YZ |
8593 | } |
8594 | ||
0ee0fda0 | 8595 | static void init_once(void *foo) |
39279cc3 | 8596 | { |
0d031dc4 | 8597 | struct btrfs_inode *ei = foo; |
39279cc3 CM |
8598 | |
8599 | inode_init_once(&ei->vfs_inode); | |
8600 | } | |
8601 | ||
e67c718b | 8602 | void __cold btrfs_destroy_cachep(void) |
39279cc3 | 8603 | { |
8c0a8537 KS |
8604 | /* |
8605 | * Make sure all delayed rcu free inodes are flushed before we | |
8606 | * destroy cache. | |
8607 | */ | |
8608 | rcu_barrier(); | |
642c5d34 | 8609 | bioset_exit(&btrfs_dio_bioset); |
5598e900 | 8610 | kmem_cache_destroy(btrfs_inode_cachep); |
39279cc3 CM |
8611 | } |
8612 | ||
f5c29bd9 | 8613 | int __init btrfs_init_cachep(void) |
39279cc3 | 8614 | { |
837e1972 | 8615 | btrfs_inode_cachep = kmem_cache_create("btrfs_inode", |
9601e3f6 | 8616 | sizeof(struct btrfs_inode), 0, |
5d097056 VD |
8617 | SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD | SLAB_ACCOUNT, |
8618 | init_once); | |
39279cc3 CM |
8619 | if (!btrfs_inode_cachep) |
8620 | goto fail; | |
9601e3f6 | 8621 | |
642c5d34 | 8622 | if (bioset_init(&btrfs_dio_bioset, BIO_POOL_SIZE, |
67d66982 | 8623 | offsetof(struct btrfs_dio_private, bbio.bio), |
642c5d34 CH |
8624 | BIOSET_NEED_BVECS)) |
8625 | goto fail; | |
8626 | ||
39279cc3 CM |
8627 | return 0; |
8628 | fail: | |
8629 | btrfs_destroy_cachep(); | |
8630 | return -ENOMEM; | |
8631 | } | |
8632 | ||
b74d24f7 | 8633 | static int btrfs_getattr(struct mnt_idmap *idmap, |
549c7297 | 8634 | const struct path *path, struct kstat *stat, |
a528d35e | 8635 | u32 request_mask, unsigned int flags) |
39279cc3 | 8636 | { |
df0af1a5 | 8637 | u64 delalloc_bytes; |
2766ff61 | 8638 | u64 inode_bytes; |
a528d35e | 8639 | struct inode *inode = d_inode(path->dentry); |
fadc0d8b | 8640 | u32 blocksize = inode->i_sb->s_blocksize; |
04a87e34 | 8641 | u32 bi_flags = BTRFS_I(inode)->flags; |
14605409 | 8642 | u32 bi_ro_flags = BTRFS_I(inode)->ro_flags; |
04a87e34 YS |
8643 | |
8644 | stat->result_mask |= STATX_BTIME; | |
8645 | stat->btime.tv_sec = BTRFS_I(inode)->i_otime.tv_sec; | |
8646 | stat->btime.tv_nsec = BTRFS_I(inode)->i_otime.tv_nsec; | |
8647 | if (bi_flags & BTRFS_INODE_APPEND) | |
8648 | stat->attributes |= STATX_ATTR_APPEND; | |
8649 | if (bi_flags & BTRFS_INODE_COMPRESS) | |
8650 | stat->attributes |= STATX_ATTR_COMPRESSED; | |
8651 | if (bi_flags & BTRFS_INODE_IMMUTABLE) | |
8652 | stat->attributes |= STATX_ATTR_IMMUTABLE; | |
8653 | if (bi_flags & BTRFS_INODE_NODUMP) | |
8654 | stat->attributes |= STATX_ATTR_NODUMP; | |
14605409 BB |
8655 | if (bi_ro_flags & BTRFS_INODE_RO_VERITY) |
8656 | stat->attributes |= STATX_ATTR_VERITY; | |
04a87e34 YS |
8657 | |
8658 | stat->attributes_mask |= (STATX_ATTR_APPEND | | |
8659 | STATX_ATTR_COMPRESSED | | |
8660 | STATX_ATTR_IMMUTABLE | | |
8661 | STATX_ATTR_NODUMP); | |
fadc0d8b | 8662 | |
0d72b928 | 8663 | generic_fillattr(idmap, request_mask, inode, stat); |
0ee5dc67 | 8664 | stat->dev = BTRFS_I(inode)->root->anon_dev; |
df0af1a5 MX |
8665 | |
8666 | spin_lock(&BTRFS_I(inode)->lock); | |
a7e3b975 | 8667 | delalloc_bytes = BTRFS_I(inode)->new_delalloc_bytes; |
2766ff61 | 8668 | inode_bytes = inode_get_bytes(inode); |
df0af1a5 | 8669 | spin_unlock(&BTRFS_I(inode)->lock); |
2766ff61 | 8670 | stat->blocks = (ALIGN(inode_bytes, blocksize) + |
29e70be2 | 8671 | ALIGN(delalloc_bytes, blocksize)) >> SECTOR_SHIFT; |
39279cc3 CM |
8672 | return 0; |
8673 | } | |
8674 | ||
cdd1fedf DF |
8675 | static int btrfs_rename_exchange(struct inode *old_dir, |
8676 | struct dentry *old_dentry, | |
8677 | struct inode *new_dir, | |
8678 | struct dentry *new_dentry) | |
8679 | { | |
0b246afa | 8680 | struct btrfs_fs_info *fs_info = btrfs_sb(old_dir->i_sb); |
cdd1fedf | 8681 | struct btrfs_trans_handle *trans; |
c1621871 | 8682 | unsigned int trans_num_items; |
cdd1fedf DF |
8683 | struct btrfs_root *root = BTRFS_I(old_dir)->root; |
8684 | struct btrfs_root *dest = BTRFS_I(new_dir)->root; | |
8685 | struct inode *new_inode = new_dentry->d_inode; | |
8686 | struct inode *old_inode = old_dentry->d_inode; | |
88d2beec FM |
8687 | struct btrfs_rename_ctx old_rename_ctx; |
8688 | struct btrfs_rename_ctx new_rename_ctx; | |
4a0cc7ca NB |
8689 | u64 old_ino = btrfs_ino(BTRFS_I(old_inode)); |
8690 | u64 new_ino = btrfs_ino(BTRFS_I(new_inode)); | |
cdd1fedf DF |
8691 | u64 old_idx = 0; |
8692 | u64 new_idx = 0; | |
cdd1fedf | 8693 | int ret; |
75b463d2 | 8694 | int ret2; |
dc09ef35 | 8695 | bool need_abort = false; |
ab3c5c18 | 8696 | struct fscrypt_name old_fname, new_fname; |
6db75318 | 8697 | struct fscrypt_str *old_name, *new_name; |
cdd1fedf | 8698 | |
3f79f6f6 N |
8699 | /* |
8700 | * For non-subvolumes allow exchange only within one subvolume, in the | |
8701 | * same inode namespace. Two subvolumes (represented as directory) can | |
8702 | * be exchanged as they're a logical link and have a fixed inode number. | |
8703 | */ | |
8704 | if (root != dest && | |
8705 | (old_ino != BTRFS_FIRST_FREE_OBJECTID || | |
8706 | new_ino != BTRFS_FIRST_FREE_OBJECTID)) | |
cdd1fedf DF |
8707 | return -EXDEV; |
8708 | ||
ab3c5c18 STD |
8709 | ret = fscrypt_setup_filename(old_dir, &old_dentry->d_name, 0, &old_fname); |
8710 | if (ret) | |
8711 | return ret; | |
8712 | ||
8713 | ret = fscrypt_setup_filename(new_dir, &new_dentry->d_name, 0, &new_fname); | |
8714 | if (ret) { | |
8715 | fscrypt_free_filename(&old_fname); | |
8716 | return ret; | |
8717 | } | |
8718 | ||
6db75318 STD |
8719 | old_name = &old_fname.disk_name; |
8720 | new_name = &new_fname.disk_name; | |
ab3c5c18 | 8721 | |
cdd1fedf | 8722 | /* close the race window with snapshot create/destroy ioctl */ |
943eb3bf JB |
8723 | if (old_ino == BTRFS_FIRST_FREE_OBJECTID || |
8724 | new_ino == BTRFS_FIRST_FREE_OBJECTID) | |
0b246afa | 8725 | down_read(&fs_info->subvol_sem); |
cdd1fedf DF |
8726 | |
8727 | /* | |
c1621871 OS |
8728 | * For each inode: |
8729 | * 1 to remove old dir item | |
8730 | * 1 to remove old dir index | |
8731 | * 1 to add new dir item | |
8732 | * 1 to add new dir index | |
8733 | * 1 to update parent inode | |
8734 | * | |
8735 | * If the parents are the same, we only need to account for one | |
cdd1fedf | 8736 | */ |
c1621871 OS |
8737 | trans_num_items = (old_dir == new_dir ? 9 : 10); |
8738 | if (old_ino == BTRFS_FIRST_FREE_OBJECTID) { | |
8739 | /* | |
8740 | * 1 to remove old root ref | |
8741 | * 1 to remove old root backref | |
8742 | * 1 to add new root ref | |
8743 | * 1 to add new root backref | |
8744 | */ | |
8745 | trans_num_items += 4; | |
8746 | } else { | |
8747 | /* | |
8748 | * 1 to update inode item | |
8749 | * 1 to remove old inode ref | |
8750 | * 1 to add new inode ref | |
8751 | */ | |
8752 | trans_num_items += 3; | |
8753 | } | |
8754 | if (new_ino == BTRFS_FIRST_FREE_OBJECTID) | |
8755 | trans_num_items += 4; | |
8756 | else | |
8757 | trans_num_items += 3; | |
8758 | trans = btrfs_start_transaction(root, trans_num_items); | |
cdd1fedf DF |
8759 | if (IS_ERR(trans)) { |
8760 | ret = PTR_ERR(trans); | |
8761 | goto out_notrans; | |
8762 | } | |
8763 | ||
00aa8e87 JB |
8764 | if (dest != root) { |
8765 | ret = btrfs_record_root_in_trans(trans, dest); | |
8766 | if (ret) | |
8767 | goto out_fail; | |
8768 | } | |
3e174099 | 8769 | |
cdd1fedf DF |
8770 | /* |
8771 | * We need to find a free sequence number both in the source and | |
8772 | * in the destination directory for the exchange. | |
8773 | */ | |
877574e2 | 8774 | ret = btrfs_set_inode_index(BTRFS_I(new_dir), &old_idx); |
cdd1fedf DF |
8775 | if (ret) |
8776 | goto out_fail; | |
877574e2 | 8777 | ret = btrfs_set_inode_index(BTRFS_I(old_dir), &new_idx); |
cdd1fedf DF |
8778 | if (ret) |
8779 | goto out_fail; | |
8780 | ||
8781 | BTRFS_I(old_inode)->dir_index = 0ULL; | |
8782 | BTRFS_I(new_inode)->dir_index = 0ULL; | |
8783 | ||
8784 | /* Reference for the source. */ | |
8785 | if (old_ino == BTRFS_FIRST_FREE_OBJECTID) { | |
8786 | /* force full log commit if subvolume involved. */ | |
90787766 | 8787 | btrfs_set_log_full_commit(trans); |
cdd1fedf | 8788 | } else { |
6db75318 | 8789 | ret = btrfs_insert_inode_ref(trans, dest, new_name, old_ino, |
f85b7379 DS |
8790 | btrfs_ino(BTRFS_I(new_dir)), |
8791 | old_idx); | |
cdd1fedf DF |
8792 | if (ret) |
8793 | goto out_fail; | |
dc09ef35 | 8794 | need_abort = true; |
cdd1fedf DF |
8795 | } |
8796 | ||
8797 | /* And now for the dest. */ | |
8798 | if (new_ino == BTRFS_FIRST_FREE_OBJECTID) { | |
8799 | /* force full log commit if subvolume involved. */ | |
90787766 | 8800 | btrfs_set_log_full_commit(trans); |
cdd1fedf | 8801 | } else { |
6db75318 | 8802 | ret = btrfs_insert_inode_ref(trans, root, old_name, new_ino, |
f85b7379 DS |
8803 | btrfs_ino(BTRFS_I(old_dir)), |
8804 | new_idx); | |
dc09ef35 JB |
8805 | if (ret) { |
8806 | if (need_abort) | |
8807 | btrfs_abort_transaction(trans, ret); | |
cdd1fedf | 8808 | goto out_fail; |
dc09ef35 | 8809 | } |
cdd1fedf DF |
8810 | } |
8811 | ||
8812 | /* Update inode version and ctime/mtime. */ | |
8813 | inode_inc_iversion(old_dir); | |
8814 | inode_inc_iversion(new_dir); | |
8815 | inode_inc_iversion(old_inode); | |
8816 | inode_inc_iversion(new_inode); | |
130f1eca | 8817 | simple_rename_timestamp(old_dir, old_dentry, new_dir, new_dentry); |
cdd1fedf DF |
8818 | |
8819 | if (old_dentry->d_parent != new_dentry->d_parent) { | |
f85b7379 | 8820 | btrfs_record_unlink_dir(trans, BTRFS_I(old_dir), |
59fcf388 | 8821 | BTRFS_I(old_inode), true); |
f85b7379 | 8822 | btrfs_record_unlink_dir(trans, BTRFS_I(new_dir), |
59fcf388 | 8823 | BTRFS_I(new_inode), true); |
cdd1fedf DF |
8824 | } |
8825 | ||
8826 | /* src is a subvolume */ | |
8827 | if (old_ino == BTRFS_FIRST_FREE_OBJECTID) { | |
5b7544cb | 8828 | ret = btrfs_unlink_subvol(trans, BTRFS_I(old_dir), old_dentry); |
cdd1fedf | 8829 | } else { /* src is an inode */ |
4467af88 | 8830 | ret = __btrfs_unlink_inode(trans, BTRFS_I(old_dir), |
4ec5934e | 8831 | BTRFS_I(old_dentry->d_inode), |
6db75318 | 8832 | old_name, &old_rename_ctx); |
cdd1fedf | 8833 | if (!ret) |
8b9d0322 | 8834 | ret = btrfs_update_inode(trans, BTRFS_I(old_inode)); |
cdd1fedf DF |
8835 | } |
8836 | if (ret) { | |
66642832 | 8837 | btrfs_abort_transaction(trans, ret); |
cdd1fedf DF |
8838 | goto out_fail; |
8839 | } | |
8840 | ||
8841 | /* dest is a subvolume */ | |
8842 | if (new_ino == BTRFS_FIRST_FREE_OBJECTID) { | |
5b7544cb | 8843 | ret = btrfs_unlink_subvol(trans, BTRFS_I(new_dir), new_dentry); |
cdd1fedf | 8844 | } else { /* dest is an inode */ |
4467af88 | 8845 | ret = __btrfs_unlink_inode(trans, BTRFS_I(new_dir), |
4ec5934e | 8846 | BTRFS_I(new_dentry->d_inode), |
6db75318 | 8847 | new_name, &new_rename_ctx); |
cdd1fedf | 8848 | if (!ret) |
8b9d0322 | 8849 | ret = btrfs_update_inode(trans, BTRFS_I(new_inode)); |
cdd1fedf DF |
8850 | } |
8851 | if (ret) { | |
66642832 | 8852 | btrfs_abort_transaction(trans, ret); |
cdd1fedf DF |
8853 | goto out_fail; |
8854 | } | |
8855 | ||
db0a669f | 8856 | ret = btrfs_add_link(trans, BTRFS_I(new_dir), BTRFS_I(old_inode), |
6db75318 | 8857 | new_name, 0, old_idx); |
cdd1fedf | 8858 | if (ret) { |
66642832 | 8859 | btrfs_abort_transaction(trans, ret); |
cdd1fedf DF |
8860 | goto out_fail; |
8861 | } | |
8862 | ||
db0a669f | 8863 | ret = btrfs_add_link(trans, BTRFS_I(old_dir), BTRFS_I(new_inode), |
6db75318 | 8864 | old_name, 0, new_idx); |
cdd1fedf | 8865 | if (ret) { |
66642832 | 8866 | btrfs_abort_transaction(trans, ret); |
cdd1fedf DF |
8867 | goto out_fail; |
8868 | } | |
8869 | ||
8870 | if (old_inode->i_nlink == 1) | |
8871 | BTRFS_I(old_inode)->dir_index = old_idx; | |
8872 | if (new_inode->i_nlink == 1) | |
8873 | BTRFS_I(new_inode)->dir_index = new_idx; | |
8874 | ||
259c4b96 FM |
8875 | /* |
8876 | * Now pin the logs of the roots. We do it to ensure that no other task | |
8877 | * can sync the logs while we are in progress with the rename, because | |
8878 | * that could result in an inconsistency in case any of the inodes that | |
8879 | * are part of this rename operation were logged before. | |
8880 | */ | |
8881 | if (old_ino != BTRFS_FIRST_FREE_OBJECTID) | |
8882 | btrfs_pin_log_trans(root); | |
8883 | if (new_ino != BTRFS_FIRST_FREE_OBJECTID) | |
8884 | btrfs_pin_log_trans(dest); | |
8885 | ||
8886 | /* Do the log updates for all inodes. */ | |
8887 | if (old_ino != BTRFS_FIRST_FREE_OBJECTID) | |
d5f5bd54 | 8888 | btrfs_log_new_name(trans, old_dentry, BTRFS_I(old_dir), |
88d2beec | 8889 | old_rename_ctx.index, new_dentry->d_parent); |
259c4b96 | 8890 | if (new_ino != BTRFS_FIRST_FREE_OBJECTID) |
d5f5bd54 | 8891 | btrfs_log_new_name(trans, new_dentry, BTRFS_I(new_dir), |
88d2beec | 8892 | new_rename_ctx.index, old_dentry->d_parent); |
259c4b96 FM |
8893 | |
8894 | /* Now unpin the logs. */ | |
8895 | if (old_ino != BTRFS_FIRST_FREE_OBJECTID) | |
8896 | btrfs_end_log_trans(root); | |
8897 | if (new_ino != BTRFS_FIRST_FREE_OBJECTID) | |
cdd1fedf | 8898 | btrfs_end_log_trans(dest); |
cdd1fedf | 8899 | out_fail: |
75b463d2 FM |
8900 | ret2 = btrfs_end_transaction(trans); |
8901 | ret = ret ? ret : ret2; | |
cdd1fedf | 8902 | out_notrans: |
943eb3bf JB |
8903 | if (new_ino == BTRFS_FIRST_FREE_OBJECTID || |
8904 | old_ino == BTRFS_FIRST_FREE_OBJECTID) | |
0b246afa | 8905 | up_read(&fs_info->subvol_sem); |
cdd1fedf | 8906 | |
ab3c5c18 STD |
8907 | fscrypt_free_filename(&new_fname); |
8908 | fscrypt_free_filename(&old_fname); | |
cdd1fedf DF |
8909 | return ret; |
8910 | } | |
8911 | ||
f2d40141 | 8912 | static struct inode *new_whiteout_inode(struct mnt_idmap *idmap, |
a1fd0c35 OS |
8913 | struct inode *dir) |
8914 | { | |
8915 | struct inode *inode; | |
8916 | ||
8917 | inode = new_inode(dir->i_sb); | |
8918 | if (inode) { | |
f2d40141 | 8919 | inode_init_owner(idmap, inode, dir, |
a1fd0c35 OS |
8920 | S_IFCHR | WHITEOUT_MODE); |
8921 | inode->i_op = &btrfs_special_inode_operations; | |
8922 | init_special_inode(inode, inode->i_mode, WHITEOUT_DEV); | |
8923 | } | |
8924 | return inode; | |
8925 | } | |
8926 | ||
f2d40141 | 8927 | static int btrfs_rename(struct mnt_idmap *idmap, |
ca07274c CB |
8928 | struct inode *old_dir, struct dentry *old_dentry, |
8929 | struct inode *new_dir, struct dentry *new_dentry, | |
8930 | unsigned int flags) | |
39279cc3 | 8931 | { |
0b246afa | 8932 | struct btrfs_fs_info *fs_info = btrfs_sb(old_dir->i_sb); |
3538d68d OS |
8933 | struct btrfs_new_inode_args whiteout_args = { |
8934 | .dir = old_dir, | |
8935 | .dentry = old_dentry, | |
8936 | }; | |
39279cc3 | 8937 | struct btrfs_trans_handle *trans; |
5062af35 | 8938 | unsigned int trans_num_items; |
39279cc3 | 8939 | struct btrfs_root *root = BTRFS_I(old_dir)->root; |
4df27c4d | 8940 | struct btrfs_root *dest = BTRFS_I(new_dir)->root; |
2b0143b5 DH |
8941 | struct inode *new_inode = d_inode(new_dentry); |
8942 | struct inode *old_inode = d_inode(old_dentry); | |
88d2beec | 8943 | struct btrfs_rename_ctx rename_ctx; |
00e4e6b3 | 8944 | u64 index = 0; |
39279cc3 | 8945 | int ret; |
75b463d2 | 8946 | int ret2; |
4a0cc7ca | 8947 | u64 old_ino = btrfs_ino(BTRFS_I(old_inode)); |
ab3c5c18 | 8948 | struct fscrypt_name old_fname, new_fname; |
39279cc3 | 8949 | |
4a0cc7ca | 8950 | if (btrfs_ino(BTRFS_I(new_dir)) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID) |
f679a840 YZ |
8951 | return -EPERM; |
8952 | ||
4df27c4d | 8953 | /* we only allow rename subvolume link between subvolumes */ |
33345d01 | 8954 | if (old_ino != BTRFS_FIRST_FREE_OBJECTID && root != dest) |
3394e160 CM |
8955 | return -EXDEV; |
8956 | ||
33345d01 | 8957 | if (old_ino == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID || |
4a0cc7ca | 8958 | (new_inode && btrfs_ino(BTRFS_I(new_inode)) == BTRFS_FIRST_FREE_OBJECTID)) |
39279cc3 | 8959 | return -ENOTEMPTY; |
5f39d397 | 8960 | |
4df27c4d YZ |
8961 | if (S_ISDIR(old_inode->i_mode) && new_inode && |
8962 | new_inode->i_size > BTRFS_EMPTY_DIR_SIZE) | |
8963 | return -ENOTEMPTY; | |
9c52057c | 8964 | |
ab3c5c18 STD |
8965 | ret = fscrypt_setup_filename(old_dir, &old_dentry->d_name, 0, &old_fname); |
8966 | if (ret) | |
8967 | return ret; | |
9c52057c | 8968 | |
ab3c5c18 STD |
8969 | ret = fscrypt_setup_filename(new_dir, &new_dentry->d_name, 0, &new_fname); |
8970 | if (ret) { | |
8971 | fscrypt_free_filename(&old_fname); | |
8972 | return ret; | |
8973 | } | |
9c52057c | 8974 | |
9c52057c | 8975 | /* check for collisions, even if the name isn't there */ |
6db75318 | 8976 | ret = btrfs_check_dir_item_collision(dest, new_dir->i_ino, &new_fname.disk_name); |
9c52057c CM |
8977 | if (ret) { |
8978 | if (ret == -EEXIST) { | |
8979 | /* we shouldn't get | |
8980 | * eexist without a new_inode */ | |
fae7f21c | 8981 | if (WARN_ON(!new_inode)) { |
ab3c5c18 | 8982 | goto out_fscrypt_names; |
9c52057c CM |
8983 | } |
8984 | } else { | |
8985 | /* maybe -EOVERFLOW */ | |
ab3c5c18 | 8986 | goto out_fscrypt_names; |
9c52057c CM |
8987 | } |
8988 | } | |
8989 | ret = 0; | |
8990 | ||
5a3f23d5 | 8991 | /* |
8d875f95 CM |
8992 | * we're using rename to replace one file with another. Start IO on it |
8993 | * now so we don't add too much work to the end of the transaction | |
5a3f23d5 | 8994 | */ |
8d875f95 | 8995 | if (new_inode && S_ISREG(old_inode->i_mode) && new_inode->i_size) |
5a3f23d5 CM |
8996 | filemap_flush(old_inode->i_mapping); |
8997 | ||
a1fd0c35 | 8998 | if (flags & RENAME_WHITEOUT) { |
f2d40141 | 8999 | whiteout_args.inode = new_whiteout_inode(idmap, old_dir); |
abe3bf74 CJ |
9000 | if (!whiteout_args.inode) { |
9001 | ret = -ENOMEM; | |
9002 | goto out_fscrypt_names; | |
9003 | } | |
3538d68d OS |
9004 | ret = btrfs_new_inode_prepare(&whiteout_args, &trans_num_items); |
9005 | if (ret) | |
9006 | goto out_whiteout_inode; | |
9007 | } else { | |
9008 | /* 1 to update the old parent inode. */ | |
9009 | trans_num_items = 1; | |
a1fd0c35 OS |
9010 | } |
9011 | ||
c1621871 OS |
9012 | if (old_ino == BTRFS_FIRST_FREE_OBJECTID) { |
9013 | /* Close the race window with snapshot create/destroy ioctl */ | |
0b246afa | 9014 | down_read(&fs_info->subvol_sem); |
c1621871 OS |
9015 | /* |
9016 | * 1 to remove old root ref | |
9017 | * 1 to remove old root backref | |
9018 | * 1 to add new root ref | |
9019 | * 1 to add new root backref | |
9020 | */ | |
3538d68d | 9021 | trans_num_items += 4; |
c1621871 OS |
9022 | } else { |
9023 | /* | |
9024 | * 1 to update inode | |
9025 | * 1 to remove old inode ref | |
9026 | * 1 to add new inode ref | |
9027 | */ | |
3538d68d | 9028 | trans_num_items += 3; |
c1621871 | 9029 | } |
a22285a6 | 9030 | /* |
c1621871 OS |
9031 | * 1 to remove old dir item |
9032 | * 1 to remove old dir index | |
c1621871 OS |
9033 | * 1 to add new dir item |
9034 | * 1 to add new dir index | |
a22285a6 | 9035 | */ |
3538d68d OS |
9036 | trans_num_items += 4; |
9037 | /* 1 to update new parent inode if it's not the same as the old parent */ | |
c1621871 OS |
9038 | if (new_dir != old_dir) |
9039 | trans_num_items++; | |
9040 | if (new_inode) { | |
9041 | /* | |
9042 | * 1 to update inode | |
9043 | * 1 to remove inode ref | |
9044 | * 1 to remove dir item | |
9045 | * 1 to remove dir index | |
9046 | * 1 to possibly add orphan item | |
9047 | */ | |
9048 | trans_num_items += 5; | |
9049 | } | |
5062af35 | 9050 | trans = btrfs_start_transaction(root, trans_num_items); |
b44c59a8 | 9051 | if (IS_ERR(trans)) { |
cdd1fedf DF |
9052 | ret = PTR_ERR(trans); |
9053 | goto out_notrans; | |
9054 | } | |
76dda93c | 9055 | |
b0fec6fd JB |
9056 | if (dest != root) { |
9057 | ret = btrfs_record_root_in_trans(trans, dest); | |
9058 | if (ret) | |
9059 | goto out_fail; | |
9060 | } | |
5f39d397 | 9061 | |
877574e2 | 9062 | ret = btrfs_set_inode_index(BTRFS_I(new_dir), &index); |
a5719521 YZ |
9063 | if (ret) |
9064 | goto out_fail; | |
5a3f23d5 | 9065 | |
67de1176 | 9066 | BTRFS_I(old_inode)->dir_index = 0ULL; |
33345d01 | 9067 | if (unlikely(old_ino == BTRFS_FIRST_FREE_OBJECTID)) { |
4df27c4d | 9068 | /* force full log commit if subvolume involved. */ |
90787766 | 9069 | btrfs_set_log_full_commit(trans); |
4df27c4d | 9070 | } else { |
6db75318 STD |
9071 | ret = btrfs_insert_inode_ref(trans, dest, &new_fname.disk_name, |
9072 | old_ino, btrfs_ino(BTRFS_I(new_dir)), | |
9073 | index); | |
a5719521 YZ |
9074 | if (ret) |
9075 | goto out_fail; | |
4df27c4d | 9076 | } |
5a3f23d5 | 9077 | |
0c4d2d95 JB |
9078 | inode_inc_iversion(old_dir); |
9079 | inode_inc_iversion(new_dir); | |
9080 | inode_inc_iversion(old_inode); | |
130f1eca | 9081 | simple_rename_timestamp(old_dir, old_dentry, new_dir, new_dentry); |
5f39d397 | 9082 | |
12fcfd22 | 9083 | if (old_dentry->d_parent != new_dentry->d_parent) |
f85b7379 | 9084 | btrfs_record_unlink_dir(trans, BTRFS_I(old_dir), |
59fcf388 | 9085 | BTRFS_I(old_inode), true); |
12fcfd22 | 9086 | |
33345d01 | 9087 | if (unlikely(old_ino == BTRFS_FIRST_FREE_OBJECTID)) { |
5b7544cb | 9088 | ret = btrfs_unlink_subvol(trans, BTRFS_I(old_dir), old_dentry); |
4df27c4d | 9089 | } else { |
4467af88 | 9090 | ret = __btrfs_unlink_inode(trans, BTRFS_I(old_dir), |
e43eec81 | 9091 | BTRFS_I(d_inode(old_dentry)), |
6db75318 | 9092 | &old_fname.disk_name, &rename_ctx); |
92986796 | 9093 | if (!ret) |
8b9d0322 | 9094 | ret = btrfs_update_inode(trans, BTRFS_I(old_inode)); |
4df27c4d | 9095 | } |
79787eaa | 9096 | if (ret) { |
66642832 | 9097 | btrfs_abort_transaction(trans, ret); |
79787eaa JM |
9098 | goto out_fail; |
9099 | } | |
39279cc3 CM |
9100 | |
9101 | if (new_inode) { | |
0c4d2d95 | 9102 | inode_inc_iversion(new_inode); |
4a0cc7ca | 9103 | if (unlikely(btrfs_ino(BTRFS_I(new_inode)) == |
4df27c4d | 9104 | BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)) { |
5b7544cb | 9105 | ret = btrfs_unlink_subvol(trans, BTRFS_I(new_dir), new_dentry); |
4df27c4d YZ |
9106 | BUG_ON(new_inode->i_nlink == 0); |
9107 | } else { | |
4467af88 | 9108 | ret = btrfs_unlink_inode(trans, BTRFS_I(new_dir), |
4ec5934e | 9109 | BTRFS_I(d_inode(new_dentry)), |
6db75318 | 9110 | &new_fname.disk_name); |
4df27c4d | 9111 | } |
4ef31a45 | 9112 | if (!ret && new_inode->i_nlink == 0) |
73f2e545 NB |
9113 | ret = btrfs_orphan_add(trans, |
9114 | BTRFS_I(d_inode(new_dentry))); | |
79787eaa | 9115 | if (ret) { |
66642832 | 9116 | btrfs_abort_transaction(trans, ret); |
79787eaa JM |
9117 | goto out_fail; |
9118 | } | |
39279cc3 | 9119 | } |
aec7477b | 9120 | |
db0a669f | 9121 | ret = btrfs_add_link(trans, BTRFS_I(new_dir), BTRFS_I(old_inode), |
6db75318 | 9122 | &new_fname.disk_name, 0, index); |
79787eaa | 9123 | if (ret) { |
66642832 | 9124 | btrfs_abort_transaction(trans, ret); |
79787eaa JM |
9125 | goto out_fail; |
9126 | } | |
39279cc3 | 9127 | |
67de1176 MX |
9128 | if (old_inode->i_nlink == 1) |
9129 | BTRFS_I(old_inode)->dir_index = index; | |
9130 | ||
259c4b96 | 9131 | if (old_ino != BTRFS_FIRST_FREE_OBJECTID) |
d5f5bd54 | 9132 | btrfs_log_new_name(trans, old_dentry, BTRFS_I(old_dir), |
88d2beec | 9133 | rename_ctx.index, new_dentry->d_parent); |
cdd1fedf DF |
9134 | |
9135 | if (flags & RENAME_WHITEOUT) { | |
caae78e0 | 9136 | ret = btrfs_create_new_inode(trans, &whiteout_args); |
cdd1fedf | 9137 | if (ret) { |
66642832 | 9138 | btrfs_abort_transaction(trans, ret); |
cdd1fedf | 9139 | goto out_fail; |
caae78e0 OS |
9140 | } else { |
9141 | unlock_new_inode(whiteout_args.inode); | |
9142 | iput(whiteout_args.inode); | |
9143 | whiteout_args.inode = NULL; | |
cdd1fedf | 9144 | } |
4df27c4d | 9145 | } |
39279cc3 | 9146 | out_fail: |
75b463d2 FM |
9147 | ret2 = btrfs_end_transaction(trans); |
9148 | ret = ret ? ret : ret2; | |
b44c59a8 | 9149 | out_notrans: |
33345d01 | 9150 | if (old_ino == BTRFS_FIRST_FREE_OBJECTID) |
0b246afa | 9151 | up_read(&fs_info->subvol_sem); |
a1fd0c35 | 9152 | if (flags & RENAME_WHITEOUT) |
3538d68d OS |
9153 | btrfs_new_inode_args_destroy(&whiteout_args); |
9154 | out_whiteout_inode: | |
9155 | if (flags & RENAME_WHITEOUT) | |
9156 | iput(whiteout_args.inode); | |
ab3c5c18 STD |
9157 | out_fscrypt_names: |
9158 | fscrypt_free_filename(&old_fname); | |
9159 | fscrypt_free_filename(&new_fname); | |
39279cc3 CM |
9160 | return ret; |
9161 | } | |
9162 | ||
e18275ae | 9163 | static int btrfs_rename2(struct mnt_idmap *idmap, struct inode *old_dir, |
549c7297 CB |
9164 | struct dentry *old_dentry, struct inode *new_dir, |
9165 | struct dentry *new_dentry, unsigned int flags) | |
80ace85c | 9166 | { |
ca6dee6b FM |
9167 | int ret; |
9168 | ||
cdd1fedf | 9169 | if (flags & ~(RENAME_NOREPLACE | RENAME_EXCHANGE | RENAME_WHITEOUT)) |
80ace85c MS |
9170 | return -EINVAL; |
9171 | ||
cdd1fedf | 9172 | if (flags & RENAME_EXCHANGE) |
ca6dee6b FM |
9173 | ret = btrfs_rename_exchange(old_dir, old_dentry, new_dir, |
9174 | new_dentry); | |
9175 | else | |
f2d40141 | 9176 | ret = btrfs_rename(idmap, old_dir, old_dentry, new_dir, |
ca6dee6b | 9177 | new_dentry, flags); |
cdd1fedf | 9178 | |
ca6dee6b FM |
9179 | btrfs_btree_balance_dirty(BTRFS_I(new_dir)->root->fs_info); |
9180 | ||
9181 | return ret; | |
80ace85c MS |
9182 | } |
9183 | ||
3a2f8c07 NB |
9184 | struct btrfs_delalloc_work { |
9185 | struct inode *inode; | |
9186 | struct completion completion; | |
9187 | struct list_head list; | |
9188 | struct btrfs_work work; | |
9189 | }; | |
9190 | ||
8ccf6f19 MX |
9191 | static void btrfs_run_delalloc_work(struct btrfs_work *work) |
9192 | { | |
9193 | struct btrfs_delalloc_work *delalloc_work; | |
9f23e289 | 9194 | struct inode *inode; |
8ccf6f19 MX |
9195 | |
9196 | delalloc_work = container_of(work, struct btrfs_delalloc_work, | |
9197 | work); | |
9f23e289 | 9198 | inode = delalloc_work->inode; |
30424601 DS |
9199 | filemap_flush(inode->i_mapping); |
9200 | if (test_bit(BTRFS_INODE_HAS_ASYNC_EXTENT, | |
9201 | &BTRFS_I(inode)->runtime_flags)) | |
9f23e289 | 9202 | filemap_flush(inode->i_mapping); |
8ccf6f19 | 9203 | |
076da91c | 9204 | iput(inode); |
8ccf6f19 MX |
9205 | complete(&delalloc_work->completion); |
9206 | } | |
9207 | ||
3a2f8c07 | 9208 | static struct btrfs_delalloc_work *btrfs_alloc_delalloc_work(struct inode *inode) |
8ccf6f19 MX |
9209 | { |
9210 | struct btrfs_delalloc_work *work; | |
9211 | ||
100d5702 | 9212 | work = kmalloc(sizeof(*work), GFP_NOFS); |
8ccf6f19 MX |
9213 | if (!work) |
9214 | return NULL; | |
9215 | ||
9216 | init_completion(&work->completion); | |
9217 | INIT_LIST_HEAD(&work->list); | |
9218 | work->inode = inode; | |
078b8b90 | 9219 | btrfs_init_work(&work->work, btrfs_run_delalloc_work, NULL); |
8ccf6f19 MX |
9220 | |
9221 | return work; | |
9222 | } | |
9223 | ||
d352ac68 CM |
9224 | /* |
9225 | * some fairly slow code that needs optimization. This walks the list | |
9226 | * of all the inodes with pending delalloc and forces them to disk. | |
9227 | */ | |
e076ab2a JB |
9228 | static int start_delalloc_inodes(struct btrfs_root *root, |
9229 | struct writeback_control *wbc, bool snapshot, | |
3d45f221 | 9230 | bool in_reclaim_context) |
ea8c2819 | 9231 | { |
ea8c2819 | 9232 | struct btrfs_inode *binode; |
5b21f2ed | 9233 | struct inode *inode; |
8ccf6f19 | 9234 | struct btrfs_delalloc_work *work, *next; |
84af994b RJ |
9235 | LIST_HEAD(works); |
9236 | LIST_HEAD(splice); | |
8ccf6f19 | 9237 | int ret = 0; |
e076ab2a | 9238 | bool full_flush = wbc->nr_to_write == LONG_MAX; |
ea8c2819 | 9239 | |
573bfb72 | 9240 | mutex_lock(&root->delalloc_mutex); |
eb73c1b7 MX |
9241 | spin_lock(&root->delalloc_lock); |
9242 | list_splice_init(&root->delalloc_inodes, &splice); | |
1eafa6c7 MX |
9243 | while (!list_empty(&splice)) { |
9244 | binode = list_entry(splice.next, struct btrfs_inode, | |
ea8c2819 | 9245 | delalloc_inodes); |
1eafa6c7 | 9246 | |
eb73c1b7 MX |
9247 | list_move_tail(&binode->delalloc_inodes, |
9248 | &root->delalloc_inodes); | |
3d45f221 FM |
9249 | |
9250 | if (in_reclaim_context && | |
9251 | test_bit(BTRFS_INODE_NO_DELALLOC_FLUSH, &binode->runtime_flags)) | |
9252 | continue; | |
9253 | ||
5b21f2ed | 9254 | inode = igrab(&binode->vfs_inode); |
df0af1a5 | 9255 | if (!inode) { |
eb73c1b7 | 9256 | cond_resched_lock(&root->delalloc_lock); |
1eafa6c7 | 9257 | continue; |
df0af1a5 | 9258 | } |
eb73c1b7 | 9259 | spin_unlock(&root->delalloc_lock); |
1eafa6c7 | 9260 | |
3cd24c69 EL |
9261 | if (snapshot) |
9262 | set_bit(BTRFS_INODE_SNAPSHOT_FLUSH, | |
9263 | &binode->runtime_flags); | |
e076ab2a JB |
9264 | if (full_flush) { |
9265 | work = btrfs_alloc_delalloc_work(inode); | |
9266 | if (!work) { | |
9267 | iput(inode); | |
9268 | ret = -ENOMEM; | |
9269 | goto out; | |
9270 | } | |
9271 | list_add_tail(&work->list, &works); | |
9272 | btrfs_queue_work(root->fs_info->flush_workers, | |
9273 | &work->work); | |
9274 | } else { | |
b3776305 | 9275 | ret = filemap_fdatawrite_wbc(inode->i_mapping, wbc); |
e55cf7ca | 9276 | btrfs_add_delayed_iput(BTRFS_I(inode)); |
e076ab2a | 9277 | if (ret || wbc->nr_to_write <= 0) |
b4912139 JB |
9278 | goto out; |
9279 | } | |
5b21f2ed | 9280 | cond_resched(); |
eb73c1b7 | 9281 | spin_lock(&root->delalloc_lock); |
ea8c2819 | 9282 | } |
eb73c1b7 | 9283 | spin_unlock(&root->delalloc_lock); |
8c8bee1d | 9284 | |
a1ecaabb | 9285 | out: |
eb73c1b7 MX |
9286 | list_for_each_entry_safe(work, next, &works, list) { |
9287 | list_del_init(&work->list); | |
40012f96 NB |
9288 | wait_for_completion(&work->completion); |
9289 | kfree(work); | |
eb73c1b7 MX |
9290 | } |
9291 | ||
81f1d390 | 9292 | if (!list_empty(&splice)) { |
eb73c1b7 MX |
9293 | spin_lock(&root->delalloc_lock); |
9294 | list_splice_tail(&splice, &root->delalloc_inodes); | |
9295 | spin_unlock(&root->delalloc_lock); | |
9296 | } | |
573bfb72 | 9297 | mutex_unlock(&root->delalloc_mutex); |
eb73c1b7 MX |
9298 | return ret; |
9299 | } | |
1eafa6c7 | 9300 | |
f9baa501 | 9301 | int btrfs_start_delalloc_snapshot(struct btrfs_root *root, bool in_reclaim_context) |
eb73c1b7 | 9302 | { |
e076ab2a JB |
9303 | struct writeback_control wbc = { |
9304 | .nr_to_write = LONG_MAX, | |
9305 | .sync_mode = WB_SYNC_NONE, | |
9306 | .range_start = 0, | |
9307 | .range_end = LLONG_MAX, | |
9308 | }; | |
0b246afa | 9309 | struct btrfs_fs_info *fs_info = root->fs_info; |
1eafa6c7 | 9310 | |
84961539 | 9311 | if (BTRFS_FS_ERROR(fs_info)) |
eb73c1b7 MX |
9312 | return -EROFS; |
9313 | ||
f9baa501 | 9314 | return start_delalloc_inodes(root, &wbc, true, in_reclaim_context); |
eb73c1b7 MX |
9315 | } |
9316 | ||
9db4dc24 | 9317 | int btrfs_start_delalloc_roots(struct btrfs_fs_info *fs_info, long nr, |
3d45f221 | 9318 | bool in_reclaim_context) |
eb73c1b7 | 9319 | { |
e076ab2a | 9320 | struct writeback_control wbc = { |
9db4dc24 | 9321 | .nr_to_write = nr, |
e076ab2a JB |
9322 | .sync_mode = WB_SYNC_NONE, |
9323 | .range_start = 0, | |
9324 | .range_end = LLONG_MAX, | |
9325 | }; | |
eb73c1b7 | 9326 | struct btrfs_root *root; |
84af994b | 9327 | LIST_HEAD(splice); |
eb73c1b7 MX |
9328 | int ret; |
9329 | ||
84961539 | 9330 | if (BTRFS_FS_ERROR(fs_info)) |
eb73c1b7 MX |
9331 | return -EROFS; |
9332 | ||
573bfb72 | 9333 | mutex_lock(&fs_info->delalloc_root_mutex); |
eb73c1b7 MX |
9334 | spin_lock(&fs_info->delalloc_root_lock); |
9335 | list_splice_init(&fs_info->delalloc_roots, &splice); | |
d7830b71 | 9336 | while (!list_empty(&splice)) { |
e076ab2a JB |
9337 | /* |
9338 | * Reset nr_to_write here so we know that we're doing a full | |
9339 | * flush. | |
9340 | */ | |
9db4dc24 | 9341 | if (nr == LONG_MAX) |
e076ab2a JB |
9342 | wbc.nr_to_write = LONG_MAX; |
9343 | ||
eb73c1b7 MX |
9344 | root = list_first_entry(&splice, struct btrfs_root, |
9345 | delalloc_root); | |
00246528 | 9346 | root = btrfs_grab_root(root); |
eb73c1b7 MX |
9347 | BUG_ON(!root); |
9348 | list_move_tail(&root->delalloc_root, | |
9349 | &fs_info->delalloc_roots); | |
9350 | spin_unlock(&fs_info->delalloc_root_lock); | |
9351 | ||
e076ab2a | 9352 | ret = start_delalloc_inodes(root, &wbc, false, in_reclaim_context); |
00246528 | 9353 | btrfs_put_root(root); |
e076ab2a | 9354 | if (ret < 0 || wbc.nr_to_write <= 0) |
eb73c1b7 | 9355 | goto out; |
eb73c1b7 | 9356 | spin_lock(&fs_info->delalloc_root_lock); |
8ccf6f19 | 9357 | } |
eb73c1b7 | 9358 | spin_unlock(&fs_info->delalloc_root_lock); |
1eafa6c7 | 9359 | |
6c255e67 | 9360 | ret = 0; |
eb73c1b7 | 9361 | out: |
81f1d390 | 9362 | if (!list_empty(&splice)) { |
eb73c1b7 MX |
9363 | spin_lock(&fs_info->delalloc_root_lock); |
9364 | list_splice_tail(&splice, &fs_info->delalloc_roots); | |
9365 | spin_unlock(&fs_info->delalloc_root_lock); | |
1eafa6c7 | 9366 | } |
573bfb72 | 9367 | mutex_unlock(&fs_info->delalloc_root_mutex); |
8ccf6f19 | 9368 | return ret; |
ea8c2819 CM |
9369 | } |
9370 | ||
7a77db95 | 9371 | static int btrfs_symlink(struct mnt_idmap *idmap, struct inode *dir, |
549c7297 | 9372 | struct dentry *dentry, const char *symname) |
39279cc3 | 9373 | { |
0b246afa | 9374 | struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb); |
39279cc3 CM |
9375 | struct btrfs_trans_handle *trans; |
9376 | struct btrfs_root *root = BTRFS_I(dir)->root; | |
9377 | struct btrfs_path *path; | |
9378 | struct btrfs_key key; | |
a1fd0c35 | 9379 | struct inode *inode; |
3538d68d OS |
9380 | struct btrfs_new_inode_args new_inode_args = { |
9381 | .dir = dir, | |
9382 | .dentry = dentry, | |
9383 | }; | |
9384 | unsigned int trans_num_items; | |
39279cc3 | 9385 | int err; |
39279cc3 CM |
9386 | int name_len; |
9387 | int datasize; | |
5f39d397 | 9388 | unsigned long ptr; |
39279cc3 | 9389 | struct btrfs_file_extent_item *ei; |
5f39d397 | 9390 | struct extent_buffer *leaf; |
39279cc3 | 9391 | |
f06becc4 | 9392 | name_len = strlen(symname); |
0b246afa | 9393 | if (name_len > BTRFS_MAX_INLINE_DATA_SIZE(fs_info)) |
39279cc3 | 9394 | return -ENAMETOOLONG; |
1832a6d5 | 9395 | |
a1fd0c35 OS |
9396 | inode = new_inode(dir->i_sb); |
9397 | if (!inode) | |
9398 | return -ENOMEM; | |
f2d40141 | 9399 | inode_init_owner(idmap, inode, dir, S_IFLNK | S_IRWXUGO); |
a1fd0c35 OS |
9400 | inode->i_op = &btrfs_symlink_inode_operations; |
9401 | inode_nohighmem(inode); | |
9402 | inode->i_mapping->a_ops = &btrfs_aops; | |
caae78e0 OS |
9403 | btrfs_i_size_write(BTRFS_I(inode), name_len); |
9404 | inode_set_bytes(inode, name_len); | |
a1fd0c35 | 9405 | |
3538d68d OS |
9406 | new_inode_args.inode = inode; |
9407 | err = btrfs_new_inode_prepare(&new_inode_args, &trans_num_items); | |
caae78e0 OS |
9408 | if (err) |
9409 | goto out_inode; | |
3538d68d OS |
9410 | /* 1 additional item for the inline extent */ |
9411 | trans_num_items++; | |
9412 | ||
9413 | trans = btrfs_start_transaction(root, trans_num_items); | |
a1fd0c35 | 9414 | if (IS_ERR(trans)) { |
3538d68d OS |
9415 | err = PTR_ERR(trans); |
9416 | goto out_new_inode_args; | |
a1fd0c35 | 9417 | } |
1832a6d5 | 9418 | |
caae78e0 | 9419 | err = btrfs_create_new_inode(trans, &new_inode_args); |
b0d5d10f | 9420 | if (err) |
caae78e0 | 9421 | goto out; |
ad19db71 | 9422 | |
39279cc3 | 9423 | path = btrfs_alloc_path(); |
d8926bb3 MF |
9424 | if (!path) { |
9425 | err = -ENOMEM; | |
caae78e0 OS |
9426 | btrfs_abort_transaction(trans, err); |
9427 | discard_new_inode(inode); | |
9428 | inode = NULL; | |
9429 | goto out; | |
d8926bb3 | 9430 | } |
4a0cc7ca | 9431 | key.objectid = btrfs_ino(BTRFS_I(inode)); |
39279cc3 | 9432 | key.offset = 0; |
962a298f | 9433 | key.type = BTRFS_EXTENT_DATA_KEY; |
39279cc3 CM |
9434 | datasize = btrfs_file_extent_calc_inline_size(name_len); |
9435 | err = btrfs_insert_empty_item(trans, root, path, &key, | |
9436 | datasize); | |
54aa1f4d | 9437 | if (err) { |
caae78e0 | 9438 | btrfs_abort_transaction(trans, err); |
b0839166 | 9439 | btrfs_free_path(path); |
caae78e0 OS |
9440 | discard_new_inode(inode); |
9441 | inode = NULL; | |
9442 | goto out; | |
54aa1f4d | 9443 | } |
5f39d397 CM |
9444 | leaf = path->nodes[0]; |
9445 | ei = btrfs_item_ptr(leaf, path->slots[0], | |
9446 | struct btrfs_file_extent_item); | |
9447 | btrfs_set_file_extent_generation(leaf, ei, trans->transid); | |
9448 | btrfs_set_file_extent_type(leaf, ei, | |
39279cc3 | 9449 | BTRFS_FILE_EXTENT_INLINE); |
c8b97818 CM |
9450 | btrfs_set_file_extent_encryption(leaf, ei, 0); |
9451 | btrfs_set_file_extent_compression(leaf, ei, 0); | |
9452 | btrfs_set_file_extent_other_encoding(leaf, ei, 0); | |
9453 | btrfs_set_file_extent_ram_bytes(leaf, ei, name_len); | |
9454 | ||
39279cc3 | 9455 | ptr = btrfs_file_extent_inline_start(ei); |
5f39d397 | 9456 | write_extent_buffer(leaf, symname, ptr, name_len); |
50564b65 | 9457 | btrfs_mark_buffer_dirty(trans, leaf); |
39279cc3 | 9458 | btrfs_free_path(path); |
5f39d397 | 9459 | |
1e2e547a | 9460 | d_instantiate_new(dentry, inode); |
caae78e0 OS |
9461 | err = 0; |
9462 | out: | |
3a45bb20 | 9463 | btrfs_end_transaction(trans); |
2ff7e61e | 9464 | btrfs_btree_balance_dirty(fs_info); |
3538d68d OS |
9465 | out_new_inode_args: |
9466 | btrfs_new_inode_args_destroy(&new_inode_args); | |
caae78e0 OS |
9467 | out_inode: |
9468 | if (err) | |
9469 | iput(inode); | |
39279cc3 CM |
9470 | return err; |
9471 | } | |
16432985 | 9472 | |
8fccebfa FM |
9473 | static struct btrfs_trans_handle *insert_prealloc_file_extent( |
9474 | struct btrfs_trans_handle *trans_in, | |
90dffd0c NB |
9475 | struct btrfs_inode *inode, |
9476 | struct btrfs_key *ins, | |
203f44c5 QW |
9477 | u64 file_offset) |
9478 | { | |
9479 | struct btrfs_file_extent_item stack_fi; | |
bf385648 | 9480 | struct btrfs_replace_extent_info extent_info; |
8fccebfa FM |
9481 | struct btrfs_trans_handle *trans = trans_in; |
9482 | struct btrfs_path *path; | |
203f44c5 QW |
9483 | u64 start = ins->objectid; |
9484 | u64 len = ins->offset; | |
fbf48bb0 | 9485 | int qgroup_released; |
9729f10a | 9486 | int ret; |
203f44c5 QW |
9487 | |
9488 | memset(&stack_fi, 0, sizeof(stack_fi)); | |
9489 | ||
9490 | btrfs_set_stack_file_extent_type(&stack_fi, BTRFS_FILE_EXTENT_PREALLOC); | |
9491 | btrfs_set_stack_file_extent_disk_bytenr(&stack_fi, start); | |
9492 | btrfs_set_stack_file_extent_disk_num_bytes(&stack_fi, len); | |
9493 | btrfs_set_stack_file_extent_num_bytes(&stack_fi, len); | |
9494 | btrfs_set_stack_file_extent_ram_bytes(&stack_fi, len); | |
9495 | btrfs_set_stack_file_extent_compression(&stack_fi, BTRFS_COMPRESS_NONE); | |
9496 | /* Encryption and other encoding is reserved and all 0 */ | |
9497 | ||
fbf48bb0 QW |
9498 | qgroup_released = btrfs_qgroup_release_data(inode, file_offset, len); |
9499 | if (qgroup_released < 0) | |
9500 | return ERR_PTR(qgroup_released); | |
8fccebfa FM |
9501 | |
9502 | if (trans) { | |
90dffd0c | 9503 | ret = insert_reserved_file_extent(trans, inode, |
2766ff61 | 9504 | file_offset, &stack_fi, |
fbf48bb0 | 9505 | true, qgroup_released); |
8fccebfa | 9506 | if (ret) |
a3ee79bd | 9507 | goto free_qgroup; |
8fccebfa FM |
9508 | return trans; |
9509 | } | |
9510 | ||
9511 | extent_info.disk_offset = start; | |
9512 | extent_info.disk_len = len; | |
9513 | extent_info.data_offset = 0; | |
9514 | extent_info.data_len = len; | |
9515 | extent_info.file_offset = file_offset; | |
9516 | extent_info.extent_buf = (char *)&stack_fi; | |
8fccebfa | 9517 | extent_info.is_new_extent = true; |
983d8209 | 9518 | extent_info.update_times = true; |
fbf48bb0 | 9519 | extent_info.qgroup_reserved = qgroup_released; |
8fccebfa FM |
9520 | extent_info.insertions = 0; |
9521 | ||
9522 | path = btrfs_alloc_path(); | |
a3ee79bd QW |
9523 | if (!path) { |
9524 | ret = -ENOMEM; | |
9525 | goto free_qgroup; | |
9526 | } | |
8fccebfa | 9527 | |
bfc78479 | 9528 | ret = btrfs_replace_file_extents(inode, path, file_offset, |
8fccebfa FM |
9529 | file_offset + len - 1, &extent_info, |
9530 | &trans); | |
9531 | btrfs_free_path(path); | |
9532 | if (ret) | |
a3ee79bd | 9533 | goto free_qgroup; |
8fccebfa | 9534 | return trans; |
a3ee79bd QW |
9535 | |
9536 | free_qgroup: | |
9537 | /* | |
9538 | * We have released qgroup data range at the beginning of the function, | |
9539 | * and normally qgroup_released bytes will be freed when committing | |
9540 | * transaction. | |
9541 | * But if we error out early, we have to free what we have released | |
9542 | * or we leak qgroup data reservation. | |
9543 | */ | |
9544 | btrfs_qgroup_free_refroot(inode->root->fs_info, | |
9545 | inode->root->root_key.objectid, qgroup_released, | |
9546 | BTRFS_QGROUP_RSV_DATA); | |
9547 | return ERR_PTR(ret); | |
203f44c5 | 9548 | } |
8fccebfa | 9549 | |
0af3d00b JB |
9550 | static int __btrfs_prealloc_file_range(struct inode *inode, int mode, |
9551 | u64 start, u64 num_bytes, u64 min_size, | |
9552 | loff_t actual_len, u64 *alloc_hint, | |
9553 | struct btrfs_trans_handle *trans) | |
d899e052 | 9554 | { |
0b246afa | 9555 | struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); |
5dc562c5 | 9556 | struct extent_map *em; |
d899e052 YZ |
9557 | struct btrfs_root *root = BTRFS_I(inode)->root; |
9558 | struct btrfs_key ins; | |
d899e052 | 9559 | u64 cur_offset = start; |
b778cf96 | 9560 | u64 clear_offset = start; |
55a61d1d | 9561 | u64 i_size; |
154ea289 | 9562 | u64 cur_bytes; |
0b670dc4 | 9563 | u64 last_alloc = (u64)-1; |
d899e052 | 9564 | int ret = 0; |
0af3d00b | 9565 | bool own_trans = true; |
18513091 | 9566 | u64 end = start + num_bytes - 1; |
d899e052 | 9567 | |
0af3d00b JB |
9568 | if (trans) |
9569 | own_trans = false; | |
d899e052 | 9570 | while (num_bytes > 0) { |
ee22184b | 9571 | cur_bytes = min_t(u64, num_bytes, SZ_256M); |
154ea289 | 9572 | cur_bytes = max(cur_bytes, min_size); |
0b670dc4 JB |
9573 | /* |
9574 | * If we are severely fragmented we could end up with really | |
9575 | * small allocations, so if the allocator is returning small | |
9576 | * chunks lets make its job easier by only searching for those | |
9577 | * sized chunks. | |
9578 | */ | |
9579 | cur_bytes = min(cur_bytes, last_alloc); | |
18513091 WX |
9580 | ret = btrfs_reserve_extent(root, cur_bytes, cur_bytes, |
9581 | min_size, 0, *alloc_hint, &ins, 1, 0); | |
8fccebfa | 9582 | if (ret) |
a22285a6 | 9583 | break; |
b778cf96 JB |
9584 | |
9585 | /* | |
9586 | * We've reserved this space, and thus converted it from | |
9587 | * ->bytes_may_use to ->bytes_reserved. Any error that happens | |
9588 | * from here on out we will only need to clear our reservation | |
9589 | * for the remaining unreserved area, so advance our | |
9590 | * clear_offset by our extent size. | |
9591 | */ | |
9592 | clear_offset += ins.offset; | |
5a303d5d | 9593 | |
0b670dc4 | 9594 | last_alloc = ins.offset; |
90dffd0c NB |
9595 | trans = insert_prealloc_file_extent(trans, BTRFS_I(inode), |
9596 | &ins, cur_offset); | |
1afc708d FM |
9597 | /* |
9598 | * Now that we inserted the prealloc extent we can finally | |
9599 | * decrement the number of reservations in the block group. | |
9600 | * If we did it before, we could race with relocation and have | |
9601 | * relocation miss the reserved extent, making it fail later. | |
9602 | */ | |
9603 | btrfs_dec_block_group_reservations(fs_info, ins.objectid); | |
8fccebfa FM |
9604 | if (IS_ERR(trans)) { |
9605 | ret = PTR_ERR(trans); | |
2ff7e61e | 9606 | btrfs_free_reserved_extent(fs_info, ins.objectid, |
e570fd27 | 9607 | ins.offset, 0); |
79787eaa JM |
9608 | break; |
9609 | } | |
31193213 | 9610 | |
5dc562c5 JB |
9611 | em = alloc_extent_map(); |
9612 | if (!em) { | |
a1ba4c08 FM |
9613 | btrfs_drop_extent_map_range(BTRFS_I(inode), cur_offset, |
9614 | cur_offset + ins.offset - 1, false); | |
23e3337f | 9615 | btrfs_set_inode_full_sync(BTRFS_I(inode)); |
5dc562c5 JB |
9616 | goto next; |
9617 | } | |
9618 | ||
9619 | em->start = cur_offset; | |
9620 | em->orig_start = cur_offset; | |
9621 | em->len = ins.offset; | |
9622 | em->block_start = ins.objectid; | |
9623 | em->block_len = ins.offset; | |
b4939680 | 9624 | em->orig_block_len = ins.offset; |
cc95bef6 | 9625 | em->ram_bytes = ins.offset; |
5dc562c5 JB |
9626 | set_bit(EXTENT_FLAG_PREALLOC, &em->flags); |
9627 | em->generation = trans->transid; | |
9628 | ||
a1ba4c08 | 9629 | ret = btrfs_replace_extent_map_range(BTRFS_I(inode), em, true); |
5dc562c5 JB |
9630 | free_extent_map(em); |
9631 | next: | |
d899e052 YZ |
9632 | num_bytes -= ins.offset; |
9633 | cur_offset += ins.offset; | |
efa56464 | 9634 | *alloc_hint = ins.objectid + ins.offset; |
5a303d5d | 9635 | |
0c4d2d95 | 9636 | inode_inc_iversion(inode); |
2a9462de | 9637 | inode_set_ctime_current(inode); |
6cbff00f | 9638 | BTRFS_I(inode)->flags |= BTRFS_INODE_PREALLOC; |
d899e052 | 9639 | if (!(mode & FALLOC_FL_KEEP_SIZE) && |
efa56464 YZ |
9640 | (actual_len > inode->i_size) && |
9641 | (cur_offset > inode->i_size)) { | |
d1ea6a61 | 9642 | if (cur_offset > actual_len) |
55a61d1d | 9643 | i_size = actual_len; |
d1ea6a61 | 9644 | else |
55a61d1d JB |
9645 | i_size = cur_offset; |
9646 | i_size_write(inode, i_size); | |
76aea537 | 9647 | btrfs_inode_safe_disk_i_size_write(BTRFS_I(inode), 0); |
5a303d5d YZ |
9648 | } |
9649 | ||
8b9d0322 | 9650 | ret = btrfs_update_inode(trans, BTRFS_I(inode)); |
79787eaa JM |
9651 | |
9652 | if (ret) { | |
66642832 | 9653 | btrfs_abort_transaction(trans, ret); |
79787eaa | 9654 | if (own_trans) |
3a45bb20 | 9655 | btrfs_end_transaction(trans); |
79787eaa JM |
9656 | break; |
9657 | } | |
d899e052 | 9658 | |
8fccebfa | 9659 | if (own_trans) { |
3a45bb20 | 9660 | btrfs_end_transaction(trans); |
8fccebfa FM |
9661 | trans = NULL; |
9662 | } | |
5a303d5d | 9663 | } |
b778cf96 | 9664 | if (clear_offset < end) |
25ce28ca | 9665 | btrfs_free_reserved_data_space(BTRFS_I(inode), NULL, clear_offset, |
b778cf96 | 9666 | end - clear_offset + 1); |
d899e052 YZ |
9667 | return ret; |
9668 | } | |
9669 | ||
0af3d00b JB |
9670 | int btrfs_prealloc_file_range(struct inode *inode, int mode, |
9671 | u64 start, u64 num_bytes, u64 min_size, | |
9672 | loff_t actual_len, u64 *alloc_hint) | |
9673 | { | |
9674 | return __btrfs_prealloc_file_range(inode, mode, start, num_bytes, | |
9675 | min_size, actual_len, alloc_hint, | |
9676 | NULL); | |
9677 | } | |
9678 | ||
9679 | int btrfs_prealloc_file_range_trans(struct inode *inode, | |
9680 | struct btrfs_trans_handle *trans, int mode, | |
9681 | u64 start, u64 num_bytes, u64 min_size, | |
9682 | loff_t actual_len, u64 *alloc_hint) | |
9683 | { | |
9684 | return __btrfs_prealloc_file_range(inode, mode, start, num_bytes, | |
9685 | min_size, actual_len, alloc_hint, trans); | |
9686 | } | |
9687 | ||
4609e1f1 | 9688 | static int btrfs_permission(struct mnt_idmap *idmap, |
549c7297 | 9689 | struct inode *inode, int mask) |
fdebe2bd | 9690 | { |
b83cc969 | 9691 | struct btrfs_root *root = BTRFS_I(inode)->root; |
cb6db4e5 | 9692 | umode_t mode = inode->i_mode; |
b83cc969 | 9693 | |
cb6db4e5 JM |
9694 | if (mask & MAY_WRITE && |
9695 | (S_ISREG(mode) || S_ISDIR(mode) || S_ISLNK(mode))) { | |
9696 | if (btrfs_root_readonly(root)) | |
9697 | return -EROFS; | |
9698 | if (BTRFS_I(inode)->flags & BTRFS_INODE_READONLY) | |
9699 | return -EACCES; | |
9700 | } | |
4609e1f1 | 9701 | return generic_permission(idmap, inode, mask); |
fdebe2bd | 9702 | } |
39279cc3 | 9703 | |
011e2b71 | 9704 | static int btrfs_tmpfile(struct mnt_idmap *idmap, struct inode *dir, |
863f144f | 9705 | struct file *file, umode_t mode) |
ef3b9af5 | 9706 | { |
2ff7e61e | 9707 | struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb); |
ef3b9af5 FM |
9708 | struct btrfs_trans_handle *trans; |
9709 | struct btrfs_root *root = BTRFS_I(dir)->root; | |
a1fd0c35 | 9710 | struct inode *inode; |
3538d68d OS |
9711 | struct btrfs_new_inode_args new_inode_args = { |
9712 | .dir = dir, | |
863f144f | 9713 | .dentry = file->f_path.dentry, |
3538d68d OS |
9714 | .orphan = true, |
9715 | }; | |
9716 | unsigned int trans_num_items; | |
a1fd0c35 OS |
9717 | int ret; |
9718 | ||
9719 | inode = new_inode(dir->i_sb); | |
9720 | if (!inode) | |
9721 | return -ENOMEM; | |
f2d40141 | 9722 | inode_init_owner(idmap, inode, dir, mode); |
a1fd0c35 OS |
9723 | inode->i_fop = &btrfs_file_operations; |
9724 | inode->i_op = &btrfs_file_inode_operations; | |
9725 | inode->i_mapping->a_ops = &btrfs_aops; | |
ef3b9af5 | 9726 | |
3538d68d OS |
9727 | new_inode_args.inode = inode; |
9728 | ret = btrfs_new_inode_prepare(&new_inode_args, &trans_num_items); | |
caae78e0 OS |
9729 | if (ret) |
9730 | goto out_inode; | |
3538d68d OS |
9731 | |
9732 | trans = btrfs_start_transaction(root, trans_num_items); | |
a1fd0c35 | 9733 | if (IS_ERR(trans)) { |
3538d68d OS |
9734 | ret = PTR_ERR(trans); |
9735 | goto out_new_inode_args; | |
a1fd0c35 | 9736 | } |
ef3b9af5 | 9737 | |
caae78e0 | 9738 | ret = btrfs_create_new_inode(trans, &new_inode_args); |
ef3b9af5 | 9739 | |
5762b5c9 | 9740 | /* |
3538d68d OS |
9741 | * We set number of links to 0 in btrfs_create_new_inode(), and here we |
9742 | * set it to 1 because d_tmpfile() will issue a warning if the count is | |
9743 | * 0, through: | |
5762b5c9 FM |
9744 | * |
9745 | * d_tmpfile() -> inode_dec_link_count() -> drop_nlink() | |
9746 | */ | |
9747 | set_nlink(inode, 1); | |
caae78e0 OS |
9748 | |
9749 | if (!ret) { | |
863f144f | 9750 | d_tmpfile(file, inode); |
caae78e0 OS |
9751 | unlock_new_inode(inode); |
9752 | mark_inode_dirty(inode); | |
9753 | } | |
9754 | ||
3a45bb20 | 9755 | btrfs_end_transaction(trans); |
2ff7e61e | 9756 | btrfs_btree_balance_dirty(fs_info); |
3538d68d OS |
9757 | out_new_inode_args: |
9758 | btrfs_new_inode_args_destroy(&new_inode_args); | |
caae78e0 OS |
9759 | out_inode: |
9760 | if (ret) | |
9761 | iput(inode); | |
863f144f | 9762 | return finish_open_simple(file, ret); |
ef3b9af5 FM |
9763 | } |
9764 | ||
d2a91064 | 9765 | void btrfs_set_range_writeback(struct btrfs_inode *inode, u64 start, u64 end) |
c6100a4b | 9766 | { |
d2a91064 | 9767 | struct btrfs_fs_info *fs_info = inode->root->fs_info; |
c6100a4b JB |
9768 | unsigned long index = start >> PAGE_SHIFT; |
9769 | unsigned long end_index = end >> PAGE_SHIFT; | |
9770 | struct page *page; | |
d2a91064 | 9771 | u32 len; |
c6100a4b | 9772 | |
d2a91064 QW |
9773 | ASSERT(end + 1 - start <= U32_MAX); |
9774 | len = end + 1 - start; | |
c6100a4b | 9775 | while (index <= end_index) { |
d2a91064 | 9776 | page = find_get_page(inode->vfs_inode.i_mapping, index); |
c6100a4b | 9777 | ASSERT(page); /* Pages should be in the extent_io_tree */ |
d2a91064 QW |
9778 | |
9779 | btrfs_page_set_writeback(fs_info, page, start, len); | |
c6100a4b JB |
9780 | put_page(page); |
9781 | index++; | |
9782 | } | |
9783 | } | |
9784 | ||
3ea4dc5b OS |
9785 | int btrfs_encoded_io_compression_from_extent(struct btrfs_fs_info *fs_info, |
9786 | int compress_type) | |
1881fba8 OS |
9787 | { |
9788 | switch (compress_type) { | |
9789 | case BTRFS_COMPRESS_NONE: | |
9790 | return BTRFS_ENCODED_IO_COMPRESSION_NONE; | |
9791 | case BTRFS_COMPRESS_ZLIB: | |
9792 | return BTRFS_ENCODED_IO_COMPRESSION_ZLIB; | |
9793 | case BTRFS_COMPRESS_LZO: | |
9794 | /* | |
9795 | * The LZO format depends on the sector size. 64K is the maximum | |
9796 | * sector size that we support. | |
9797 | */ | |
9798 | if (fs_info->sectorsize < SZ_4K || fs_info->sectorsize > SZ_64K) | |
9799 | return -EINVAL; | |
9800 | return BTRFS_ENCODED_IO_COMPRESSION_LZO_4K + | |
9801 | (fs_info->sectorsize_bits - 12); | |
9802 | case BTRFS_COMPRESS_ZSTD: | |
9803 | return BTRFS_ENCODED_IO_COMPRESSION_ZSTD; | |
9804 | default: | |
9805 | return -EUCLEAN; | |
9806 | } | |
9807 | } | |
9808 | ||
9809 | static ssize_t btrfs_encoded_read_inline( | |
9810 | struct kiocb *iocb, | |
9811 | struct iov_iter *iter, u64 start, | |
9812 | u64 lockend, | |
9813 | struct extent_state **cached_state, | |
9814 | u64 extent_start, size_t count, | |
9815 | struct btrfs_ioctl_encoded_io_args *encoded, | |
9816 | bool *unlocked) | |
9817 | { | |
9818 | struct btrfs_inode *inode = BTRFS_I(file_inode(iocb->ki_filp)); | |
9819 | struct btrfs_root *root = inode->root; | |
9820 | struct btrfs_fs_info *fs_info = root->fs_info; | |
9821 | struct extent_io_tree *io_tree = &inode->io_tree; | |
9822 | struct btrfs_path *path; | |
9823 | struct extent_buffer *leaf; | |
9824 | struct btrfs_file_extent_item *item; | |
9825 | u64 ram_bytes; | |
9826 | unsigned long ptr; | |
9827 | void *tmp; | |
9828 | ssize_t ret; | |
9829 | ||
9830 | path = btrfs_alloc_path(); | |
9831 | if (!path) { | |
9832 | ret = -ENOMEM; | |
9833 | goto out; | |
9834 | } | |
9835 | ret = btrfs_lookup_file_extent(NULL, root, path, btrfs_ino(inode), | |
9836 | extent_start, 0); | |
9837 | if (ret) { | |
9838 | if (ret > 0) { | |
9839 | /* The extent item disappeared? */ | |
9840 | ret = -EIO; | |
9841 | } | |
9842 | goto out; | |
9843 | } | |
9844 | leaf = path->nodes[0]; | |
9845 | item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_file_extent_item); | |
9846 | ||
9847 | ram_bytes = btrfs_file_extent_ram_bytes(leaf, item); | |
9848 | ptr = btrfs_file_extent_inline_start(item); | |
9849 | ||
9850 | encoded->len = min_t(u64, extent_start + ram_bytes, | |
9851 | inode->vfs_inode.i_size) - iocb->ki_pos; | |
9852 | ret = btrfs_encoded_io_compression_from_extent(fs_info, | |
9853 | btrfs_file_extent_compression(leaf, item)); | |
9854 | if (ret < 0) | |
9855 | goto out; | |
9856 | encoded->compression = ret; | |
9857 | if (encoded->compression) { | |
9858 | size_t inline_size; | |
9859 | ||
9860 | inline_size = btrfs_file_extent_inline_item_len(leaf, | |
9861 | path->slots[0]); | |
9862 | if (inline_size > count) { | |
9863 | ret = -ENOBUFS; | |
9864 | goto out; | |
9865 | } | |
9866 | count = inline_size; | |
9867 | encoded->unencoded_len = ram_bytes; | |
9868 | encoded->unencoded_offset = iocb->ki_pos - extent_start; | |
9869 | } else { | |
9870 | count = min_t(u64, count, encoded->len); | |
9871 | encoded->len = count; | |
9872 | encoded->unencoded_len = count; | |
9873 | ptr += iocb->ki_pos - extent_start; | |
9874 | } | |
9875 | ||
9876 | tmp = kmalloc(count, GFP_NOFS); | |
9877 | if (!tmp) { | |
9878 | ret = -ENOMEM; | |
9879 | goto out; | |
9880 | } | |
9881 | read_extent_buffer(leaf, tmp, ptr, count); | |
9882 | btrfs_release_path(path); | |
570eb97b | 9883 | unlock_extent(io_tree, start, lockend, cached_state); |
e5d4d75b | 9884 | btrfs_inode_unlock(inode, BTRFS_ILOCK_SHARED); |
1881fba8 OS |
9885 | *unlocked = true; |
9886 | ||
9887 | ret = copy_to_iter(tmp, count, iter); | |
9888 | if (ret != count) | |
9889 | ret = -EFAULT; | |
9890 | kfree(tmp); | |
9891 | out: | |
9892 | btrfs_free_path(path); | |
9893 | return ret; | |
9894 | } | |
9895 | ||
9896 | struct btrfs_encoded_read_private { | |
1881fba8 OS |
9897 | wait_queue_head_t wait; |
9898 | atomic_t pending; | |
9899 | blk_status_t status; | |
1881fba8 OS |
9900 | }; |
9901 | ||
917f32a2 | 9902 | static void btrfs_encoded_read_endio(struct btrfs_bio *bbio) |
1881fba8 | 9903 | { |
917f32a2 | 9904 | struct btrfs_encoded_read_private *priv = bbio->private; |
1881fba8 | 9905 | |
7609afac | 9906 | if (bbio->bio.bi_status) { |
1881fba8 OS |
9907 | /* |
9908 | * The memory barrier implied by the atomic_dec_return() here | |
9909 | * pairs with the memory barrier implied by the | |
9910 | * atomic_dec_return() or io_wait_event() in | |
9911 | * btrfs_encoded_read_regular_fill_pages() to ensure that this | |
9912 | * write is observed before the load of status in | |
9913 | * btrfs_encoded_read_regular_fill_pages(). | |
9914 | */ | |
7609afac | 9915 | WRITE_ONCE(priv->status, bbio->bio.bi_status); |
1881fba8 OS |
9916 | } |
9917 | if (!atomic_dec_return(&priv->pending)) | |
9918 | wake_up(&priv->wait); | |
917f32a2 | 9919 | bio_put(&bbio->bio); |
1881fba8 OS |
9920 | } |
9921 | ||
3ea4dc5b OS |
9922 | int btrfs_encoded_read_regular_fill_pages(struct btrfs_inode *inode, |
9923 | u64 file_offset, u64 disk_bytenr, | |
9924 | u64 disk_io_size, struct page **pages) | |
1881fba8 | 9925 | { |
4317ff00 | 9926 | struct btrfs_fs_info *fs_info = inode->root->fs_info; |
1881fba8 | 9927 | struct btrfs_encoded_read_private priv = { |
1881fba8 | 9928 | .pending = ATOMIC_INIT(1), |
1881fba8 OS |
9929 | }; |
9930 | unsigned long i = 0; | |
b41bbd29 | 9931 | struct btrfs_bio *bbio; |
1881fba8 OS |
9932 | |
9933 | init_waitqueue_head(&priv.wait); | |
1881fba8 | 9934 | |
4317ff00 QW |
9935 | bbio = btrfs_bio_alloc(BIO_MAX_VECS, REQ_OP_READ, fs_info, |
9936 | btrfs_encoded_read_endio, &priv); | |
b41bbd29 | 9937 | bbio->bio.bi_iter.bi_sector = disk_bytenr >> SECTOR_SHIFT; |
4317ff00 | 9938 | bbio->inode = inode; |
1881fba8 | 9939 | |
34f888ce CH |
9940 | do { |
9941 | size_t bytes = min_t(u64, disk_io_size, PAGE_SIZE); | |
9942 | ||
b41bbd29 | 9943 | if (bio_add_page(&bbio->bio, pages[i], bytes, 0) < bytes) { |
34f888ce | 9944 | atomic_inc(&priv.pending); |
b41bbd29 | 9945 | btrfs_submit_bio(bbio, 0); |
34f888ce | 9946 | |
4317ff00 | 9947 | bbio = btrfs_bio_alloc(BIO_MAX_VECS, REQ_OP_READ, fs_info, |
b41bbd29 CH |
9948 | btrfs_encoded_read_endio, &priv); |
9949 | bbio->bio.bi_iter.bi_sector = disk_bytenr >> SECTOR_SHIFT; | |
4317ff00 | 9950 | bbio->inode = inode; |
34f888ce | 9951 | continue; |
1881fba8 | 9952 | } |
34f888ce CH |
9953 | |
9954 | i++; | |
9955 | disk_bytenr += bytes; | |
9956 | disk_io_size -= bytes; | |
9957 | } while (disk_io_size); | |
9958 | ||
9959 | atomic_inc(&priv.pending); | |
b41bbd29 | 9960 | btrfs_submit_bio(bbio, 0); |
1881fba8 | 9961 | |
1881fba8 OS |
9962 | if (atomic_dec_return(&priv.pending)) |
9963 | io_wait_event(priv.wait, !atomic_read(&priv.pending)); | |
9964 | /* See btrfs_encoded_read_endio() for ordering. */ | |
9965 | return blk_status_to_errno(READ_ONCE(priv.status)); | |
9966 | } | |
9967 | ||
9968 | static ssize_t btrfs_encoded_read_regular(struct kiocb *iocb, | |
9969 | struct iov_iter *iter, | |
9970 | u64 start, u64 lockend, | |
9971 | struct extent_state **cached_state, | |
9972 | u64 disk_bytenr, u64 disk_io_size, | |
9973 | size_t count, bool compressed, | |
9974 | bool *unlocked) | |
9975 | { | |
9976 | struct btrfs_inode *inode = BTRFS_I(file_inode(iocb->ki_filp)); | |
9977 | struct extent_io_tree *io_tree = &inode->io_tree; | |
9978 | struct page **pages; | |
9979 | unsigned long nr_pages, i; | |
9980 | u64 cur; | |
9981 | size_t page_offset; | |
9982 | ssize_t ret; | |
9983 | ||
9984 | nr_pages = DIV_ROUND_UP(disk_io_size, PAGE_SIZE); | |
9985 | pages = kcalloc(nr_pages, sizeof(struct page *), GFP_NOFS); | |
9986 | if (!pages) | |
9987 | return -ENOMEM; | |
dd137dd1 STD |
9988 | ret = btrfs_alloc_page_array(nr_pages, pages); |
9989 | if (ret) { | |
9990 | ret = -ENOMEM; | |
9991 | goto out; | |
1881fba8 | 9992 | } |
1881fba8 OS |
9993 | |
9994 | ret = btrfs_encoded_read_regular_fill_pages(inode, start, disk_bytenr, | |
9995 | disk_io_size, pages); | |
9996 | if (ret) | |
9997 | goto out; | |
9998 | ||
570eb97b | 9999 | unlock_extent(io_tree, start, lockend, cached_state); |
e5d4d75b | 10000 | btrfs_inode_unlock(inode, BTRFS_ILOCK_SHARED); |
1881fba8 OS |
10001 | *unlocked = true; |
10002 | ||
10003 | if (compressed) { | |
10004 | i = 0; | |
10005 | page_offset = 0; | |
10006 | } else { | |
10007 | i = (iocb->ki_pos - start) >> PAGE_SHIFT; | |
10008 | page_offset = (iocb->ki_pos - start) & (PAGE_SIZE - 1); | |
10009 | } | |
10010 | cur = 0; | |
10011 | while (cur < count) { | |
10012 | size_t bytes = min_t(size_t, count - cur, | |
10013 | PAGE_SIZE - page_offset); | |
10014 | ||
10015 | if (copy_page_to_iter(pages[i], page_offset, bytes, | |
10016 | iter) != bytes) { | |
10017 | ret = -EFAULT; | |
10018 | goto out; | |
10019 | } | |
10020 | i++; | |
10021 | cur += bytes; | |
10022 | page_offset = 0; | |
10023 | } | |
10024 | ret = count; | |
10025 | out: | |
10026 | for (i = 0; i < nr_pages; i++) { | |
10027 | if (pages[i]) | |
10028 | __free_page(pages[i]); | |
10029 | } | |
10030 | kfree(pages); | |
10031 | return ret; | |
10032 | } | |
10033 | ||
10034 | ssize_t btrfs_encoded_read(struct kiocb *iocb, struct iov_iter *iter, | |
10035 | struct btrfs_ioctl_encoded_io_args *encoded) | |
10036 | { | |
10037 | struct btrfs_inode *inode = BTRFS_I(file_inode(iocb->ki_filp)); | |
10038 | struct btrfs_fs_info *fs_info = inode->root->fs_info; | |
10039 | struct extent_io_tree *io_tree = &inode->io_tree; | |
10040 | ssize_t ret; | |
10041 | size_t count = iov_iter_count(iter); | |
10042 | u64 start, lockend, disk_bytenr, disk_io_size; | |
10043 | struct extent_state *cached_state = NULL; | |
10044 | struct extent_map *em; | |
10045 | bool unlocked = false; | |
10046 | ||
10047 | file_accessed(iocb->ki_filp); | |
10048 | ||
29b6352b | 10049 | btrfs_inode_lock(inode, BTRFS_ILOCK_SHARED); |
1881fba8 OS |
10050 | |
10051 | if (iocb->ki_pos >= inode->vfs_inode.i_size) { | |
e5d4d75b | 10052 | btrfs_inode_unlock(inode, BTRFS_ILOCK_SHARED); |
1881fba8 OS |
10053 | return 0; |
10054 | } | |
10055 | start = ALIGN_DOWN(iocb->ki_pos, fs_info->sectorsize); | |
10056 | /* | |
10057 | * We don't know how long the extent containing iocb->ki_pos is, but if | |
10058 | * it's compressed we know that it won't be longer than this. | |
10059 | */ | |
10060 | lockend = start + BTRFS_MAX_UNCOMPRESSED - 1; | |
10061 | ||
10062 | for (;;) { | |
10063 | struct btrfs_ordered_extent *ordered; | |
10064 | ||
10065 | ret = btrfs_wait_ordered_range(&inode->vfs_inode, start, | |
10066 | lockend - start + 1); | |
10067 | if (ret) | |
10068 | goto out_unlock_inode; | |
570eb97b | 10069 | lock_extent(io_tree, start, lockend, &cached_state); |
1881fba8 OS |
10070 | ordered = btrfs_lookup_ordered_range(inode, start, |
10071 | lockend - start + 1); | |
10072 | if (!ordered) | |
10073 | break; | |
10074 | btrfs_put_ordered_extent(ordered); | |
570eb97b | 10075 | unlock_extent(io_tree, start, lockend, &cached_state); |
1881fba8 OS |
10076 | cond_resched(); |
10077 | } | |
10078 | ||
10079 | em = btrfs_get_extent(inode, NULL, 0, start, lockend - start + 1); | |
10080 | if (IS_ERR(em)) { | |
10081 | ret = PTR_ERR(em); | |
10082 | goto out_unlock_extent; | |
10083 | } | |
10084 | ||
10085 | if (em->block_start == EXTENT_MAP_INLINE) { | |
10086 | u64 extent_start = em->start; | |
10087 | ||
10088 | /* | |
10089 | * For inline extents we get everything we need out of the | |
10090 | * extent item. | |
10091 | */ | |
10092 | free_extent_map(em); | |
10093 | em = NULL; | |
10094 | ret = btrfs_encoded_read_inline(iocb, iter, start, lockend, | |
10095 | &cached_state, extent_start, | |
10096 | count, encoded, &unlocked); | |
10097 | goto out; | |
10098 | } | |
10099 | ||
10100 | /* | |
10101 | * We only want to return up to EOF even if the extent extends beyond | |
10102 | * that. | |
10103 | */ | |
10104 | encoded->len = min_t(u64, extent_map_end(em), | |
10105 | inode->vfs_inode.i_size) - iocb->ki_pos; | |
10106 | if (em->block_start == EXTENT_MAP_HOLE || | |
10107 | test_bit(EXTENT_FLAG_PREALLOC, &em->flags)) { | |
10108 | disk_bytenr = EXTENT_MAP_HOLE; | |
10109 | count = min_t(u64, count, encoded->len); | |
10110 | encoded->len = count; | |
10111 | encoded->unencoded_len = count; | |
10112 | } else if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags)) { | |
10113 | disk_bytenr = em->block_start; | |
10114 | /* | |
10115 | * Bail if the buffer isn't large enough to return the whole | |
10116 | * compressed extent. | |
10117 | */ | |
10118 | if (em->block_len > count) { | |
10119 | ret = -ENOBUFS; | |
10120 | goto out_em; | |
10121 | } | |
c1867eb3 DS |
10122 | disk_io_size = em->block_len; |
10123 | count = em->block_len; | |
1881fba8 OS |
10124 | encoded->unencoded_len = em->ram_bytes; |
10125 | encoded->unencoded_offset = iocb->ki_pos - em->orig_start; | |
10126 | ret = btrfs_encoded_io_compression_from_extent(fs_info, | |
10127 | em->compress_type); | |
10128 | if (ret < 0) | |
10129 | goto out_em; | |
10130 | encoded->compression = ret; | |
10131 | } else { | |
10132 | disk_bytenr = em->block_start + (start - em->start); | |
10133 | if (encoded->len > count) | |
10134 | encoded->len = count; | |
10135 | /* | |
10136 | * Don't read beyond what we locked. This also limits the page | |
10137 | * allocations that we'll do. | |
10138 | */ | |
10139 | disk_io_size = min(lockend + 1, iocb->ki_pos + encoded->len) - start; | |
10140 | count = start + disk_io_size - iocb->ki_pos; | |
10141 | encoded->len = count; | |
10142 | encoded->unencoded_len = count; | |
10143 | disk_io_size = ALIGN(disk_io_size, fs_info->sectorsize); | |
10144 | } | |
10145 | free_extent_map(em); | |
10146 | em = NULL; | |
10147 | ||
10148 | if (disk_bytenr == EXTENT_MAP_HOLE) { | |
570eb97b | 10149 | unlock_extent(io_tree, start, lockend, &cached_state); |
e5d4d75b | 10150 | btrfs_inode_unlock(inode, BTRFS_ILOCK_SHARED); |
1881fba8 OS |
10151 | unlocked = true; |
10152 | ret = iov_iter_zero(count, iter); | |
10153 | if (ret != count) | |
10154 | ret = -EFAULT; | |
10155 | } else { | |
10156 | ret = btrfs_encoded_read_regular(iocb, iter, start, lockend, | |
10157 | &cached_state, disk_bytenr, | |
10158 | disk_io_size, count, | |
10159 | encoded->compression, | |
10160 | &unlocked); | |
10161 | } | |
10162 | ||
10163 | out: | |
10164 | if (ret >= 0) | |
10165 | iocb->ki_pos += encoded->len; | |
10166 | out_em: | |
10167 | free_extent_map(em); | |
10168 | out_unlock_extent: | |
10169 | if (!unlocked) | |
570eb97b | 10170 | unlock_extent(io_tree, start, lockend, &cached_state); |
1881fba8 OS |
10171 | out_unlock_inode: |
10172 | if (!unlocked) | |
e5d4d75b | 10173 | btrfs_inode_unlock(inode, BTRFS_ILOCK_SHARED); |
1881fba8 OS |
10174 | return ret; |
10175 | } | |
10176 | ||
7c0c7269 OS |
10177 | ssize_t btrfs_do_encoded_write(struct kiocb *iocb, struct iov_iter *from, |
10178 | const struct btrfs_ioctl_encoded_io_args *encoded) | |
10179 | { | |
10180 | struct btrfs_inode *inode = BTRFS_I(file_inode(iocb->ki_filp)); | |
10181 | struct btrfs_root *root = inode->root; | |
10182 | struct btrfs_fs_info *fs_info = root->fs_info; | |
10183 | struct extent_io_tree *io_tree = &inode->io_tree; | |
10184 | struct extent_changeset *data_reserved = NULL; | |
10185 | struct extent_state *cached_state = NULL; | |
d611935b | 10186 | struct btrfs_ordered_extent *ordered; |
7c0c7269 OS |
10187 | int compression; |
10188 | size_t orig_count; | |
10189 | u64 start, end; | |
10190 | u64 num_bytes, ram_bytes, disk_num_bytes; | |
10191 | unsigned long nr_pages, i; | |
10192 | struct page **pages; | |
10193 | struct btrfs_key ins; | |
10194 | bool extent_reserved = false; | |
10195 | struct extent_map *em; | |
10196 | ssize_t ret; | |
10197 | ||
10198 | switch (encoded->compression) { | |
10199 | case BTRFS_ENCODED_IO_COMPRESSION_ZLIB: | |
10200 | compression = BTRFS_COMPRESS_ZLIB; | |
10201 | break; | |
10202 | case BTRFS_ENCODED_IO_COMPRESSION_ZSTD: | |
10203 | compression = BTRFS_COMPRESS_ZSTD; | |
10204 | break; | |
10205 | case BTRFS_ENCODED_IO_COMPRESSION_LZO_4K: | |
10206 | case BTRFS_ENCODED_IO_COMPRESSION_LZO_8K: | |
10207 | case BTRFS_ENCODED_IO_COMPRESSION_LZO_16K: | |
10208 | case BTRFS_ENCODED_IO_COMPRESSION_LZO_32K: | |
10209 | case BTRFS_ENCODED_IO_COMPRESSION_LZO_64K: | |
10210 | /* The sector size must match for LZO. */ | |
10211 | if (encoded->compression - | |
10212 | BTRFS_ENCODED_IO_COMPRESSION_LZO_4K + 12 != | |
10213 | fs_info->sectorsize_bits) | |
10214 | return -EINVAL; | |
10215 | compression = BTRFS_COMPRESS_LZO; | |
10216 | break; | |
10217 | default: | |
10218 | return -EINVAL; | |
10219 | } | |
10220 | if (encoded->encryption != BTRFS_ENCODED_IO_ENCRYPTION_NONE) | |
10221 | return -EINVAL; | |
10222 | ||
10223 | orig_count = iov_iter_count(from); | |
10224 | ||
10225 | /* The extent size must be sane. */ | |
10226 | if (encoded->unencoded_len > BTRFS_MAX_UNCOMPRESSED || | |
10227 | orig_count > BTRFS_MAX_COMPRESSED || orig_count == 0) | |
10228 | return -EINVAL; | |
10229 | ||
10230 | /* | |
10231 | * The compressed data must be smaller than the decompressed data. | |
10232 | * | |
10233 | * It's of course possible for data to compress to larger or the same | |
10234 | * size, but the buffered I/O path falls back to no compression for such | |
10235 | * data, and we don't want to break any assumptions by creating these | |
10236 | * extents. | |
10237 | * | |
10238 | * Note that this is less strict than the current check we have that the | |
10239 | * compressed data must be at least one sector smaller than the | |
10240 | * decompressed data. We only want to enforce the weaker requirement | |
10241 | * from old kernels that it is at least one byte smaller. | |
10242 | */ | |
10243 | if (orig_count >= encoded->unencoded_len) | |
10244 | return -EINVAL; | |
10245 | ||
10246 | /* The extent must start on a sector boundary. */ | |
10247 | start = iocb->ki_pos; | |
10248 | if (!IS_ALIGNED(start, fs_info->sectorsize)) | |
10249 | return -EINVAL; | |
10250 | ||
10251 | /* | |
10252 | * The extent must end on a sector boundary. However, we allow a write | |
10253 | * which ends at or extends i_size to have an unaligned length; we round | |
10254 | * up the extent size and set i_size to the unaligned end. | |
10255 | */ | |
10256 | if (start + encoded->len < inode->vfs_inode.i_size && | |
10257 | !IS_ALIGNED(start + encoded->len, fs_info->sectorsize)) | |
10258 | return -EINVAL; | |
10259 | ||
10260 | /* Finally, the offset in the unencoded data must be sector-aligned. */ | |
10261 | if (!IS_ALIGNED(encoded->unencoded_offset, fs_info->sectorsize)) | |
10262 | return -EINVAL; | |
10263 | ||
10264 | num_bytes = ALIGN(encoded->len, fs_info->sectorsize); | |
10265 | ram_bytes = ALIGN(encoded->unencoded_len, fs_info->sectorsize); | |
10266 | end = start + num_bytes - 1; | |
10267 | ||
10268 | /* | |
10269 | * If the extent cannot be inline, the compressed data on disk must be | |
10270 | * sector-aligned. For convenience, we extend it with zeroes if it | |
10271 | * isn't. | |
10272 | */ | |
10273 | disk_num_bytes = ALIGN(orig_count, fs_info->sectorsize); | |
10274 | nr_pages = DIV_ROUND_UP(disk_num_bytes, PAGE_SIZE); | |
10275 | pages = kvcalloc(nr_pages, sizeof(struct page *), GFP_KERNEL_ACCOUNT); | |
10276 | if (!pages) | |
10277 | return -ENOMEM; | |
10278 | for (i = 0; i < nr_pages; i++) { | |
10279 | size_t bytes = min_t(size_t, PAGE_SIZE, iov_iter_count(from)); | |
10280 | char *kaddr; | |
10281 | ||
10282 | pages[i] = alloc_page(GFP_KERNEL_ACCOUNT); | |
10283 | if (!pages[i]) { | |
10284 | ret = -ENOMEM; | |
10285 | goto out_pages; | |
10286 | } | |
70826b6b | 10287 | kaddr = kmap_local_page(pages[i]); |
7c0c7269 | 10288 | if (copy_from_iter(kaddr, bytes, from) != bytes) { |
70826b6b | 10289 | kunmap_local(kaddr); |
7c0c7269 OS |
10290 | ret = -EFAULT; |
10291 | goto out_pages; | |
10292 | } | |
10293 | if (bytes < PAGE_SIZE) | |
10294 | memset(kaddr + bytes, 0, PAGE_SIZE - bytes); | |
70826b6b | 10295 | kunmap_local(kaddr); |
7c0c7269 OS |
10296 | } |
10297 | ||
10298 | for (;;) { | |
10299 | struct btrfs_ordered_extent *ordered; | |
10300 | ||
10301 | ret = btrfs_wait_ordered_range(&inode->vfs_inode, start, num_bytes); | |
10302 | if (ret) | |
10303 | goto out_pages; | |
10304 | ret = invalidate_inode_pages2_range(inode->vfs_inode.i_mapping, | |
10305 | start >> PAGE_SHIFT, | |
10306 | end >> PAGE_SHIFT); | |
10307 | if (ret) | |
10308 | goto out_pages; | |
570eb97b | 10309 | lock_extent(io_tree, start, end, &cached_state); |
7c0c7269 OS |
10310 | ordered = btrfs_lookup_ordered_range(inode, start, num_bytes); |
10311 | if (!ordered && | |
10312 | !filemap_range_has_page(inode->vfs_inode.i_mapping, start, end)) | |
10313 | break; | |
10314 | if (ordered) | |
10315 | btrfs_put_ordered_extent(ordered); | |
570eb97b | 10316 | unlock_extent(io_tree, start, end, &cached_state); |
7c0c7269 OS |
10317 | cond_resched(); |
10318 | } | |
10319 | ||
10320 | /* | |
10321 | * We don't use the higher-level delalloc space functions because our | |
10322 | * num_bytes and disk_num_bytes are different. | |
10323 | */ | |
10324 | ret = btrfs_alloc_data_chunk_ondemand(inode, disk_num_bytes); | |
10325 | if (ret) | |
10326 | goto out_unlock; | |
10327 | ret = btrfs_qgroup_reserve_data(inode, &data_reserved, start, num_bytes); | |
10328 | if (ret) | |
10329 | goto out_free_data_space; | |
d4135134 FM |
10330 | ret = btrfs_delalloc_reserve_metadata(inode, num_bytes, disk_num_bytes, |
10331 | false); | |
7c0c7269 OS |
10332 | if (ret) |
10333 | goto out_qgroup_free_data; | |
10334 | ||
10335 | /* Try an inline extent first. */ | |
10336 | if (start == 0 && encoded->unencoded_len == encoded->len && | |
10337 | encoded->unencoded_offset == 0) { | |
10338 | ret = cow_file_range_inline(inode, encoded->len, orig_count, | |
10339 | compression, pages, true); | |
10340 | if (ret <= 0) { | |
10341 | if (ret == 0) | |
10342 | ret = orig_count; | |
10343 | goto out_delalloc_release; | |
10344 | } | |
10345 | } | |
10346 | ||
10347 | ret = btrfs_reserve_extent(root, disk_num_bytes, disk_num_bytes, | |
10348 | disk_num_bytes, 0, 0, &ins, 1, 1); | |
10349 | if (ret) | |
10350 | goto out_delalloc_release; | |
10351 | extent_reserved = true; | |
10352 | ||
10353 | em = create_io_em(inode, start, num_bytes, | |
10354 | start - encoded->unencoded_offset, ins.objectid, | |
10355 | ins.offset, ins.offset, ram_bytes, compression, | |
10356 | BTRFS_ORDERED_COMPRESSED); | |
10357 | if (IS_ERR(em)) { | |
10358 | ret = PTR_ERR(em); | |
10359 | goto out_free_reserved; | |
10360 | } | |
10361 | free_extent_map(em); | |
10362 | ||
d611935b | 10363 | ordered = btrfs_alloc_ordered_extent(inode, start, num_bytes, ram_bytes, |
7c0c7269 OS |
10364 | ins.objectid, ins.offset, |
10365 | encoded->unencoded_offset, | |
10366 | (1 << BTRFS_ORDERED_ENCODED) | | |
10367 | (1 << BTRFS_ORDERED_COMPRESSED), | |
10368 | compression); | |
d611935b | 10369 | if (IS_ERR(ordered)) { |
4c0c8cfc | 10370 | btrfs_drop_extent_map_range(inode, start, end, false); |
d611935b | 10371 | ret = PTR_ERR(ordered); |
7c0c7269 OS |
10372 | goto out_free_reserved; |
10373 | } | |
10374 | btrfs_dec_block_group_reservations(fs_info, ins.objectid); | |
10375 | ||
10376 | if (start + encoded->len > inode->vfs_inode.i_size) | |
10377 | i_size_write(&inode->vfs_inode, start + encoded->len); | |
10378 | ||
570eb97b | 10379 | unlock_extent(io_tree, start, end, &cached_state); |
7c0c7269 OS |
10380 | |
10381 | btrfs_delalloc_release_extents(inode, num_bytes); | |
10382 | ||
d611935b | 10383 | btrfs_submit_compressed_write(ordered, pages, nr_pages, 0, false); |
7c0c7269 OS |
10384 | ret = orig_count; |
10385 | goto out; | |
10386 | ||
10387 | out_free_reserved: | |
10388 | btrfs_dec_block_group_reservations(fs_info, ins.objectid); | |
10389 | btrfs_free_reserved_extent(fs_info, ins.objectid, ins.offset, 1); | |
10390 | out_delalloc_release: | |
10391 | btrfs_delalloc_release_extents(inode, num_bytes); | |
10392 | btrfs_delalloc_release_metadata(inode, disk_num_bytes, ret < 0); | |
10393 | out_qgroup_free_data: | |
10394 | if (ret < 0) | |
10395 | btrfs_qgroup_free_data(inode, data_reserved, start, num_bytes); | |
10396 | out_free_data_space: | |
10397 | /* | |
10398 | * If btrfs_reserve_extent() succeeded, then we already decremented | |
10399 | * bytes_may_use. | |
10400 | */ | |
10401 | if (!extent_reserved) | |
10402 | btrfs_free_reserved_data_space_noquota(fs_info, disk_num_bytes); | |
10403 | out_unlock: | |
570eb97b | 10404 | unlock_extent(io_tree, start, end, &cached_state); |
7c0c7269 OS |
10405 | out_pages: |
10406 | for (i = 0; i < nr_pages; i++) { | |
10407 | if (pages[i]) | |
10408 | __free_page(pages[i]); | |
10409 | } | |
10410 | kvfree(pages); | |
10411 | out: | |
10412 | if (ret >= 0) | |
10413 | iocb->ki_pos += encoded->len; | |
10414 | return ret; | |
10415 | } | |
10416 | ||
ed46ff3d OS |
10417 | #ifdef CONFIG_SWAP |
10418 | /* | |
10419 | * Add an entry indicating a block group or device which is pinned by a | |
10420 | * swapfile. Returns 0 on success, 1 if there is already an entry for it, or a | |
10421 | * negative errno on failure. | |
10422 | */ | |
10423 | static int btrfs_add_swapfile_pin(struct inode *inode, void *ptr, | |
10424 | bool is_block_group) | |
10425 | { | |
10426 | struct btrfs_fs_info *fs_info = BTRFS_I(inode)->root->fs_info; | |
10427 | struct btrfs_swapfile_pin *sp, *entry; | |
10428 | struct rb_node **p; | |
10429 | struct rb_node *parent = NULL; | |
10430 | ||
10431 | sp = kmalloc(sizeof(*sp), GFP_NOFS); | |
10432 | if (!sp) | |
10433 | return -ENOMEM; | |
10434 | sp->ptr = ptr; | |
10435 | sp->inode = inode; | |
10436 | sp->is_block_group = is_block_group; | |
195a49ea | 10437 | sp->bg_extent_count = 1; |
ed46ff3d OS |
10438 | |
10439 | spin_lock(&fs_info->swapfile_pins_lock); | |
10440 | p = &fs_info->swapfile_pins.rb_node; | |
10441 | while (*p) { | |
10442 | parent = *p; | |
10443 | entry = rb_entry(parent, struct btrfs_swapfile_pin, node); | |
10444 | if (sp->ptr < entry->ptr || | |
10445 | (sp->ptr == entry->ptr && sp->inode < entry->inode)) { | |
10446 | p = &(*p)->rb_left; | |
10447 | } else if (sp->ptr > entry->ptr || | |
10448 | (sp->ptr == entry->ptr && sp->inode > entry->inode)) { | |
10449 | p = &(*p)->rb_right; | |
10450 | } else { | |
195a49ea FM |
10451 | if (is_block_group) |
10452 | entry->bg_extent_count++; | |
ed46ff3d OS |
10453 | spin_unlock(&fs_info->swapfile_pins_lock); |
10454 | kfree(sp); | |
10455 | return 1; | |
10456 | } | |
10457 | } | |
10458 | rb_link_node(&sp->node, parent, p); | |
10459 | rb_insert_color(&sp->node, &fs_info->swapfile_pins); | |
10460 | spin_unlock(&fs_info->swapfile_pins_lock); | |
10461 | return 0; | |
10462 | } | |
10463 | ||
10464 | /* Free all of the entries pinned by this swapfile. */ | |
10465 | static void btrfs_free_swapfile_pins(struct inode *inode) | |
10466 | { | |
10467 | struct btrfs_fs_info *fs_info = BTRFS_I(inode)->root->fs_info; | |
10468 | struct btrfs_swapfile_pin *sp; | |
10469 | struct rb_node *node, *next; | |
10470 | ||
10471 | spin_lock(&fs_info->swapfile_pins_lock); | |
10472 | node = rb_first(&fs_info->swapfile_pins); | |
10473 | while (node) { | |
10474 | next = rb_next(node); | |
10475 | sp = rb_entry(node, struct btrfs_swapfile_pin, node); | |
10476 | if (sp->inode == inode) { | |
10477 | rb_erase(&sp->node, &fs_info->swapfile_pins); | |
195a49ea FM |
10478 | if (sp->is_block_group) { |
10479 | btrfs_dec_block_group_swap_extents(sp->ptr, | |
10480 | sp->bg_extent_count); | |
ed46ff3d | 10481 | btrfs_put_block_group(sp->ptr); |
195a49ea | 10482 | } |
ed46ff3d OS |
10483 | kfree(sp); |
10484 | } | |
10485 | node = next; | |
10486 | } | |
10487 | spin_unlock(&fs_info->swapfile_pins_lock); | |
10488 | } | |
10489 | ||
10490 | struct btrfs_swap_info { | |
10491 | u64 start; | |
10492 | u64 block_start; | |
10493 | u64 block_len; | |
10494 | u64 lowest_ppage; | |
10495 | u64 highest_ppage; | |
10496 | unsigned long nr_pages; | |
10497 | int nr_extents; | |
10498 | }; | |
10499 | ||
10500 | static int btrfs_add_swap_extent(struct swap_info_struct *sis, | |
10501 | struct btrfs_swap_info *bsi) | |
10502 | { | |
10503 | unsigned long nr_pages; | |
c2f82263 | 10504 | unsigned long max_pages; |
ed46ff3d OS |
10505 | u64 first_ppage, first_ppage_reported, next_ppage; |
10506 | int ret; | |
10507 | ||
c2f82263 FM |
10508 | /* |
10509 | * Our swapfile may have had its size extended after the swap header was | |
10510 | * written. In that case activating the swapfile should not go beyond | |
10511 | * the max size set in the swap header. | |
10512 | */ | |
10513 | if (bsi->nr_pages >= sis->max) | |
10514 | return 0; | |
10515 | ||
10516 | max_pages = sis->max - bsi->nr_pages; | |
ce394a7f YZ |
10517 | first_ppage = PAGE_ALIGN(bsi->block_start) >> PAGE_SHIFT; |
10518 | next_ppage = PAGE_ALIGN_DOWN(bsi->block_start + bsi->block_len) >> PAGE_SHIFT; | |
ed46ff3d OS |
10519 | |
10520 | if (first_ppage >= next_ppage) | |
10521 | return 0; | |
10522 | nr_pages = next_ppage - first_ppage; | |
c2f82263 | 10523 | nr_pages = min(nr_pages, max_pages); |
ed46ff3d OS |
10524 | |
10525 | first_ppage_reported = first_ppage; | |
10526 | if (bsi->start == 0) | |
10527 | first_ppage_reported++; | |
10528 | if (bsi->lowest_ppage > first_ppage_reported) | |
10529 | bsi->lowest_ppage = first_ppage_reported; | |
10530 | if (bsi->highest_ppage < (next_ppage - 1)) | |
10531 | bsi->highest_ppage = next_ppage - 1; | |
10532 | ||
10533 | ret = add_swap_extent(sis, bsi->nr_pages, nr_pages, first_ppage); | |
10534 | if (ret < 0) | |
10535 | return ret; | |
10536 | bsi->nr_extents += ret; | |
10537 | bsi->nr_pages += nr_pages; | |
10538 | return 0; | |
10539 | } | |
10540 | ||
10541 | static void btrfs_swap_deactivate(struct file *file) | |
10542 | { | |
10543 | struct inode *inode = file_inode(file); | |
10544 | ||
10545 | btrfs_free_swapfile_pins(inode); | |
10546 | atomic_dec(&BTRFS_I(inode)->root->nr_swapfiles); | |
10547 | } | |
10548 | ||
10549 | static int btrfs_swap_activate(struct swap_info_struct *sis, struct file *file, | |
10550 | sector_t *span) | |
10551 | { | |
10552 | struct inode *inode = file_inode(file); | |
dd0734f2 FM |
10553 | struct btrfs_root *root = BTRFS_I(inode)->root; |
10554 | struct btrfs_fs_info *fs_info = root->fs_info; | |
ed46ff3d OS |
10555 | struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; |
10556 | struct extent_state *cached_state = NULL; | |
10557 | struct extent_map *em = NULL; | |
10558 | struct btrfs_device *device = NULL; | |
10559 | struct btrfs_swap_info bsi = { | |
10560 | .lowest_ppage = (sector_t)-1ULL, | |
10561 | }; | |
10562 | int ret = 0; | |
10563 | u64 isize; | |
10564 | u64 start; | |
10565 | ||
10566 | /* | |
10567 | * If the swap file was just created, make sure delalloc is done. If the | |
10568 | * file changes again after this, the user is doing something stupid and | |
10569 | * we don't really care. | |
10570 | */ | |
10571 | ret = btrfs_wait_ordered_range(inode, 0, (u64)-1); | |
10572 | if (ret) | |
10573 | return ret; | |
10574 | ||
10575 | /* | |
10576 | * The inode is locked, so these flags won't change after we check them. | |
10577 | */ | |
10578 | if (BTRFS_I(inode)->flags & BTRFS_INODE_COMPRESS) { | |
10579 | btrfs_warn(fs_info, "swapfile must not be compressed"); | |
10580 | return -EINVAL; | |
10581 | } | |
10582 | if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW)) { | |
10583 | btrfs_warn(fs_info, "swapfile must not be copy-on-write"); | |
10584 | return -EINVAL; | |
10585 | } | |
10586 | if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM)) { | |
10587 | btrfs_warn(fs_info, "swapfile must not be checksummed"); | |
10588 | return -EINVAL; | |
10589 | } | |
10590 | ||
10591 | /* | |
10592 | * Balance or device remove/replace/resize can move stuff around from | |
c3e1f96c GR |
10593 | * under us. The exclop protection makes sure they aren't running/won't |
10594 | * run concurrently while we are mapping the swap extents, and | |
10595 | * fs_info->swapfile_pins prevents them from running while the swap | |
10596 | * file is active and moving the extents. Note that this also prevents | |
10597 | * a concurrent device add which isn't actually necessary, but it's not | |
ed46ff3d OS |
10598 | * really worth the trouble to allow it. |
10599 | */ | |
c3e1f96c | 10600 | if (!btrfs_exclop_start(fs_info, BTRFS_EXCLOP_SWAP_ACTIVATE)) { |
ed46ff3d OS |
10601 | btrfs_warn(fs_info, |
10602 | "cannot activate swapfile while exclusive operation is running"); | |
10603 | return -EBUSY; | |
10604 | } | |
dd0734f2 FM |
10605 | |
10606 | /* | |
10607 | * Prevent snapshot creation while we are activating the swap file. | |
10608 | * We do not want to race with snapshot creation. If snapshot creation | |
10609 | * already started before we bumped nr_swapfiles from 0 to 1 and | |
10610 | * completes before the first write into the swap file after it is | |
10611 | * activated, than that write would fallback to COW. | |
10612 | */ | |
10613 | if (!btrfs_drew_try_write_lock(&root->snapshot_lock)) { | |
10614 | btrfs_exclop_finish(fs_info); | |
10615 | btrfs_warn(fs_info, | |
10616 | "cannot activate swapfile because snapshot creation is in progress"); | |
10617 | return -EINVAL; | |
10618 | } | |
ed46ff3d OS |
10619 | /* |
10620 | * Snapshots can create extents which require COW even if NODATACOW is | |
10621 | * set. We use this counter to prevent snapshots. We must increment it | |
10622 | * before walking the extents because we don't want a concurrent | |
10623 | * snapshot to run after we've already checked the extents. | |
60021bd7 KH |
10624 | * |
10625 | * It is possible that subvolume is marked for deletion but still not | |
10626 | * removed yet. To prevent this race, we check the root status before | |
10627 | * activating the swapfile. | |
ed46ff3d | 10628 | */ |
60021bd7 KH |
10629 | spin_lock(&root->root_item_lock); |
10630 | if (btrfs_root_dead(root)) { | |
10631 | spin_unlock(&root->root_item_lock); | |
10632 | ||
10633 | btrfs_exclop_finish(fs_info); | |
10634 | btrfs_warn(fs_info, | |
10635 | "cannot activate swapfile because subvolume %llu is being deleted", | |
10636 | root->root_key.objectid); | |
10637 | return -EPERM; | |
10638 | } | |
dd0734f2 | 10639 | atomic_inc(&root->nr_swapfiles); |
60021bd7 | 10640 | spin_unlock(&root->root_item_lock); |
ed46ff3d OS |
10641 | |
10642 | isize = ALIGN_DOWN(inode->i_size, fs_info->sectorsize); | |
10643 | ||
570eb97b | 10644 | lock_extent(io_tree, 0, isize - 1, &cached_state); |
ed46ff3d OS |
10645 | start = 0; |
10646 | while (start < isize) { | |
10647 | u64 logical_block_start, physical_block_start; | |
32da5386 | 10648 | struct btrfs_block_group *bg; |
ed46ff3d OS |
10649 | u64 len = isize - start; |
10650 | ||
39b07b5d | 10651 | em = btrfs_get_extent(BTRFS_I(inode), NULL, 0, start, len); |
ed46ff3d OS |
10652 | if (IS_ERR(em)) { |
10653 | ret = PTR_ERR(em); | |
10654 | goto out; | |
10655 | } | |
10656 | ||
10657 | if (em->block_start == EXTENT_MAP_HOLE) { | |
10658 | btrfs_warn(fs_info, "swapfile must not have holes"); | |
10659 | ret = -EINVAL; | |
10660 | goto out; | |
10661 | } | |
10662 | if (em->block_start == EXTENT_MAP_INLINE) { | |
10663 | /* | |
10664 | * It's unlikely we'll ever actually find ourselves | |
10665 | * here, as a file small enough to fit inline won't be | |
10666 | * big enough to store more than the swap header, but in | |
10667 | * case something changes in the future, let's catch it | |
10668 | * here rather than later. | |
10669 | */ | |
10670 | btrfs_warn(fs_info, "swapfile must not be inline"); | |
10671 | ret = -EINVAL; | |
10672 | goto out; | |
10673 | } | |
10674 | if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags)) { | |
10675 | btrfs_warn(fs_info, "swapfile must not be compressed"); | |
10676 | ret = -EINVAL; | |
10677 | goto out; | |
10678 | } | |
10679 | ||
10680 | logical_block_start = em->block_start + (start - em->start); | |
10681 | len = min(len, em->len - (start - em->start)); | |
10682 | free_extent_map(em); | |
10683 | em = NULL; | |
10684 | ||
26ce9114 | 10685 | ret = can_nocow_extent(inode, start, &len, NULL, NULL, NULL, false, true); |
ed46ff3d OS |
10686 | if (ret < 0) { |
10687 | goto out; | |
10688 | } else if (ret) { | |
10689 | ret = 0; | |
10690 | } else { | |
10691 | btrfs_warn(fs_info, | |
10692 | "swapfile must not be copy-on-write"); | |
10693 | ret = -EINVAL; | |
10694 | goto out; | |
10695 | } | |
10696 | ||
10697 | em = btrfs_get_chunk_map(fs_info, logical_block_start, len); | |
10698 | if (IS_ERR(em)) { | |
10699 | ret = PTR_ERR(em); | |
10700 | goto out; | |
10701 | } | |
10702 | ||
10703 | if (em->map_lookup->type & BTRFS_BLOCK_GROUP_PROFILE_MASK) { | |
10704 | btrfs_warn(fs_info, | |
10705 | "swapfile must have single data profile"); | |
10706 | ret = -EINVAL; | |
10707 | goto out; | |
10708 | } | |
10709 | ||
10710 | if (device == NULL) { | |
10711 | device = em->map_lookup->stripes[0].dev; | |
10712 | ret = btrfs_add_swapfile_pin(inode, device, false); | |
10713 | if (ret == 1) | |
10714 | ret = 0; | |
10715 | else if (ret) | |
10716 | goto out; | |
10717 | } else if (device != em->map_lookup->stripes[0].dev) { | |
10718 | btrfs_warn(fs_info, "swapfile must be on one device"); | |
10719 | ret = -EINVAL; | |
10720 | goto out; | |
10721 | } | |
10722 | ||
10723 | physical_block_start = (em->map_lookup->stripes[0].physical + | |
10724 | (logical_block_start - em->start)); | |
10725 | len = min(len, em->len - (logical_block_start - em->start)); | |
10726 | free_extent_map(em); | |
10727 | em = NULL; | |
10728 | ||
10729 | bg = btrfs_lookup_block_group(fs_info, logical_block_start); | |
10730 | if (!bg) { | |
10731 | btrfs_warn(fs_info, | |
10732 | "could not find block group containing swapfile"); | |
10733 | ret = -EINVAL; | |
10734 | goto out; | |
10735 | } | |
10736 | ||
195a49ea FM |
10737 | if (!btrfs_inc_block_group_swap_extents(bg)) { |
10738 | btrfs_warn(fs_info, | |
10739 | "block group for swapfile at %llu is read-only%s", | |
10740 | bg->start, | |
10741 | atomic_read(&fs_info->scrubs_running) ? | |
10742 | " (scrub running)" : ""); | |
10743 | btrfs_put_block_group(bg); | |
10744 | ret = -EINVAL; | |
10745 | goto out; | |
10746 | } | |
10747 | ||
ed46ff3d OS |
10748 | ret = btrfs_add_swapfile_pin(inode, bg, true); |
10749 | if (ret) { | |
10750 | btrfs_put_block_group(bg); | |
10751 | if (ret == 1) | |
10752 | ret = 0; | |
10753 | else | |
10754 | goto out; | |
10755 | } | |
10756 | ||
10757 | if (bsi.block_len && | |
10758 | bsi.block_start + bsi.block_len == physical_block_start) { | |
10759 | bsi.block_len += len; | |
10760 | } else { | |
10761 | if (bsi.block_len) { | |
10762 | ret = btrfs_add_swap_extent(sis, &bsi); | |
10763 | if (ret) | |
10764 | goto out; | |
10765 | } | |
10766 | bsi.start = start; | |
10767 | bsi.block_start = physical_block_start; | |
10768 | bsi.block_len = len; | |
10769 | } | |
10770 | ||
10771 | start += len; | |
10772 | } | |
10773 | ||
10774 | if (bsi.block_len) | |
10775 | ret = btrfs_add_swap_extent(sis, &bsi); | |
10776 | ||
10777 | out: | |
10778 | if (!IS_ERR_OR_NULL(em)) | |
10779 | free_extent_map(em); | |
10780 | ||
570eb97b | 10781 | unlock_extent(io_tree, 0, isize - 1, &cached_state); |
ed46ff3d OS |
10782 | |
10783 | if (ret) | |
10784 | btrfs_swap_deactivate(file); | |
10785 | ||
dd0734f2 FM |
10786 | btrfs_drew_write_unlock(&root->snapshot_lock); |
10787 | ||
c3e1f96c | 10788 | btrfs_exclop_finish(fs_info); |
ed46ff3d OS |
10789 | |
10790 | if (ret) | |
10791 | return ret; | |
10792 | ||
10793 | if (device) | |
10794 | sis->bdev = device->bdev; | |
10795 | *span = bsi.highest_ppage - bsi.lowest_ppage + 1; | |
10796 | sis->max = bsi.nr_pages; | |
10797 | sis->pages = bsi.nr_pages - 1; | |
10798 | sis->highest_bit = bsi.nr_pages - 1; | |
10799 | return bsi.nr_extents; | |
10800 | } | |
10801 | #else | |
10802 | static void btrfs_swap_deactivate(struct file *file) | |
10803 | { | |
10804 | } | |
10805 | ||
10806 | static int btrfs_swap_activate(struct swap_info_struct *sis, struct file *file, | |
10807 | sector_t *span) | |
10808 | { | |
10809 | return -EOPNOTSUPP; | |
10810 | } | |
10811 | #endif | |
10812 | ||
2766ff61 FM |
10813 | /* |
10814 | * Update the number of bytes used in the VFS' inode. When we replace extents in | |
10815 | * a range (clone, dedupe, fallocate's zero range), we must update the number of | |
10816 | * bytes used by the inode in an atomic manner, so that concurrent stat(2) calls | |
10817 | * always get a correct value. | |
10818 | */ | |
10819 | void btrfs_update_inode_bytes(struct btrfs_inode *inode, | |
10820 | const u64 add_bytes, | |
10821 | const u64 del_bytes) | |
10822 | { | |
10823 | if (add_bytes == del_bytes) | |
10824 | return; | |
10825 | ||
10826 | spin_lock(&inode->lock); | |
10827 | if (del_bytes > 0) | |
10828 | inode_sub_bytes(&inode->vfs_inode, del_bytes); | |
10829 | if (add_bytes > 0) | |
10830 | inode_add_bytes(&inode->vfs_inode, add_bytes); | |
10831 | spin_unlock(&inode->lock); | |
10832 | } | |
10833 | ||
43dd529a | 10834 | /* |
63c34cb4 FM |
10835 | * Verify that there are no ordered extents for a given file range. |
10836 | * | |
10837 | * @inode: The target inode. | |
10838 | * @start: Start offset of the file range, should be sector size aligned. | |
10839 | * @end: End offset (inclusive) of the file range, its value +1 should be | |
10840 | * sector size aligned. | |
10841 | * | |
10842 | * This should typically be used for cases where we locked an inode's VFS lock in | |
10843 | * exclusive mode, we have also locked the inode's i_mmap_lock in exclusive mode, | |
10844 | * we have flushed all delalloc in the range, we have waited for all ordered | |
10845 | * extents in the range to complete and finally we have locked the file range in | |
10846 | * the inode's io_tree. | |
10847 | */ | |
10848 | void btrfs_assert_inode_range_clean(struct btrfs_inode *inode, u64 start, u64 end) | |
10849 | { | |
10850 | struct btrfs_root *root = inode->root; | |
10851 | struct btrfs_ordered_extent *ordered; | |
10852 | ||
10853 | if (!IS_ENABLED(CONFIG_BTRFS_ASSERT)) | |
10854 | return; | |
10855 | ||
10856 | ordered = btrfs_lookup_first_ordered_range(inode, start, end + 1 - start); | |
10857 | if (ordered) { | |
10858 | btrfs_err(root->fs_info, | |
10859 | "found unexpected ordered extent in file range [%llu, %llu] for inode %llu root %llu (ordered range [%llu, %llu])", | |
10860 | start, end, btrfs_ino(inode), root->root_key.objectid, | |
10861 | ordered->file_offset, | |
10862 | ordered->file_offset + ordered->num_bytes - 1); | |
10863 | btrfs_put_ordered_extent(ordered); | |
10864 | } | |
10865 | ||
10866 | ASSERT(ordered == NULL); | |
10867 | } | |
10868 | ||
6e1d5dcc | 10869 | static const struct inode_operations btrfs_dir_inode_operations = { |
3394e160 | 10870 | .getattr = btrfs_getattr, |
39279cc3 CM |
10871 | .lookup = btrfs_lookup, |
10872 | .create = btrfs_create, | |
10873 | .unlink = btrfs_unlink, | |
10874 | .link = btrfs_link, | |
10875 | .mkdir = btrfs_mkdir, | |
10876 | .rmdir = btrfs_rmdir, | |
2773bf00 | 10877 | .rename = btrfs_rename2, |
39279cc3 CM |
10878 | .symlink = btrfs_symlink, |
10879 | .setattr = btrfs_setattr, | |
618e21d5 | 10880 | .mknod = btrfs_mknod, |
5103e947 | 10881 | .listxattr = btrfs_listxattr, |
fdebe2bd | 10882 | .permission = btrfs_permission, |
cac2f8b8 | 10883 | .get_inode_acl = btrfs_get_acl, |
996a710d | 10884 | .set_acl = btrfs_set_acl, |
93fd63c2 | 10885 | .update_time = btrfs_update_time, |
ef3b9af5 | 10886 | .tmpfile = btrfs_tmpfile, |
97fc2977 MS |
10887 | .fileattr_get = btrfs_fileattr_get, |
10888 | .fileattr_set = btrfs_fileattr_set, | |
39279cc3 | 10889 | }; |
76dda93c | 10890 | |
828c0950 | 10891 | static const struct file_operations btrfs_dir_file_operations = { |
e60aa5da | 10892 | .llseek = btrfs_dir_llseek, |
39279cc3 | 10893 | .read = generic_read_dir, |
02dbfc99 | 10894 | .iterate_shared = btrfs_real_readdir, |
23b5ec74 | 10895 | .open = btrfs_opendir, |
34287aa3 | 10896 | .unlocked_ioctl = btrfs_ioctl, |
39279cc3 | 10897 | #ifdef CONFIG_COMPAT |
4c63c245 | 10898 | .compat_ioctl = btrfs_compat_ioctl, |
39279cc3 | 10899 | #endif |
6bf13c0c | 10900 | .release = btrfs_release_file, |
e02119d5 | 10901 | .fsync = btrfs_sync_file, |
39279cc3 CM |
10902 | }; |
10903 | ||
35054394 CM |
10904 | /* |
10905 | * btrfs doesn't support the bmap operation because swapfiles | |
10906 | * use bmap to make a mapping of extents in the file. They assume | |
10907 | * these extents won't change over the life of the file and they | |
10908 | * use the bmap result to do IO directly to the drive. | |
10909 | * | |
10910 | * the btrfs bmap call would return logical addresses that aren't | |
10911 | * suitable for IO and they also will change frequently as COW | |
10912 | * operations happen. So, swapfile + btrfs == corruption. | |
10913 | * | |
10914 | * For now we're avoiding this by dropping bmap. | |
10915 | */ | |
7f09410b | 10916 | static const struct address_space_operations btrfs_aops = { |
fb12489b | 10917 | .read_folio = btrfs_read_folio, |
b293f02e | 10918 | .writepages = btrfs_writepages, |
ba206a02 | 10919 | .readahead = btrfs_readahead, |
895586eb | 10920 | .invalidate_folio = btrfs_invalidate_folio, |
f913cff3 | 10921 | .release_folio = btrfs_release_folio, |
e7a60a17 | 10922 | .migrate_folio = btrfs_migrate_folio, |
187c82cb | 10923 | .dirty_folio = filemap_dirty_folio, |
465fdd97 | 10924 | .error_remove_page = generic_error_remove_page, |
ed46ff3d OS |
10925 | .swap_activate = btrfs_swap_activate, |
10926 | .swap_deactivate = btrfs_swap_deactivate, | |
39279cc3 CM |
10927 | }; |
10928 | ||
6e1d5dcc | 10929 | static const struct inode_operations btrfs_file_inode_operations = { |
39279cc3 CM |
10930 | .getattr = btrfs_getattr, |
10931 | .setattr = btrfs_setattr, | |
5103e947 | 10932 | .listxattr = btrfs_listxattr, |
fdebe2bd | 10933 | .permission = btrfs_permission, |
1506fcc8 | 10934 | .fiemap = btrfs_fiemap, |
cac2f8b8 | 10935 | .get_inode_acl = btrfs_get_acl, |
996a710d | 10936 | .set_acl = btrfs_set_acl, |
e41f941a | 10937 | .update_time = btrfs_update_time, |
97fc2977 MS |
10938 | .fileattr_get = btrfs_fileattr_get, |
10939 | .fileattr_set = btrfs_fileattr_set, | |
39279cc3 | 10940 | }; |
6e1d5dcc | 10941 | static const struct inode_operations btrfs_special_inode_operations = { |
618e21d5 JB |
10942 | .getattr = btrfs_getattr, |
10943 | .setattr = btrfs_setattr, | |
fdebe2bd | 10944 | .permission = btrfs_permission, |
33268eaf | 10945 | .listxattr = btrfs_listxattr, |
cac2f8b8 | 10946 | .get_inode_acl = btrfs_get_acl, |
996a710d | 10947 | .set_acl = btrfs_set_acl, |
e41f941a | 10948 | .update_time = btrfs_update_time, |
618e21d5 | 10949 | }; |
6e1d5dcc | 10950 | static const struct inode_operations btrfs_symlink_inode_operations = { |
6b255391 | 10951 | .get_link = page_get_link, |
f209561a | 10952 | .getattr = btrfs_getattr, |
22c44fe6 | 10953 | .setattr = btrfs_setattr, |
fdebe2bd | 10954 | .permission = btrfs_permission, |
0279b4cd | 10955 | .listxattr = btrfs_listxattr, |
e41f941a | 10956 | .update_time = btrfs_update_time, |
39279cc3 | 10957 | }; |
76dda93c | 10958 | |
82d339d9 | 10959 | const struct dentry_operations btrfs_dentry_operations = { |
76dda93c YZ |
10960 | .d_delete = btrfs_dentry_delete, |
10961 | }; |