diff options
author | Glenn Elliott <gelliott@cs.unc.edu> | 2012-03-04 19:47:13 -0500 |
---|---|---|
committer | Glenn Elliott <gelliott@cs.unc.edu> | 2012-03-04 19:47:13 -0500 |
commit | c71c03bda1e86c9d5198c5d83f712e695c4f2a1e (patch) | |
tree | ecb166cb3e2b7e2adb3b5e292245fefd23381ac8 /fs/btrfs/ioctl.c | |
parent | ea53c912f8a86a8567697115b6a0d8152beee5c8 (diff) | |
parent | 6a00f206debf8a5c8899055726ad127dbeeed098 (diff) |
Merge branch 'mpi-master' into wip-k-fmlpwip-k-fmlp
Conflicts:
litmus/sched_cedf.c
Diffstat (limited to 'fs/btrfs/ioctl.c')
-rw-r--r-- | fs/btrfs/ioctl.c | 1340 |
1 files changed, 1107 insertions, 233 deletions
diff --git a/fs/btrfs/ioctl.c b/fs/btrfs/ioctl.c index 9254b3d58dbe..a3c4751e07db 100644 --- a/fs/btrfs/ioctl.c +++ b/fs/btrfs/ioctl.c | |||
@@ -40,6 +40,7 @@ | |||
40 | #include <linux/xattr.h> | 40 | #include <linux/xattr.h> |
41 | #include <linux/vmalloc.h> | 41 | #include <linux/vmalloc.h> |
42 | #include <linux/slab.h> | 42 | #include <linux/slab.h> |
43 | #include <linux/blkdev.h> | ||
43 | #include "compat.h" | 44 | #include "compat.h" |
44 | #include "ctree.h" | 45 | #include "ctree.h" |
45 | #include "disk-io.h" | 46 | #include "disk-io.h" |
@@ -49,6 +50,7 @@ | |||
49 | #include "print-tree.h" | 50 | #include "print-tree.h" |
50 | #include "volumes.h" | 51 | #include "volumes.h" |
51 | #include "locking.h" | 52 | #include "locking.h" |
53 | #include "inode-map.h" | ||
52 | 54 | ||
53 | /* Mask out flags that are inappropriate for the given type of inode. */ | 55 | /* Mask out flags that are inappropriate for the given type of inode. */ |
54 | static inline __u32 btrfs_mask_flags(umode_t mode, __u32 flags) | 56 | static inline __u32 btrfs_mask_flags(umode_t mode, __u32 flags) |
@@ -80,6 +82,13 @@ static unsigned int btrfs_flags_to_ioctl(unsigned int flags) | |||
80 | iflags |= FS_NOATIME_FL; | 82 | iflags |= FS_NOATIME_FL; |
81 | if (flags & BTRFS_INODE_DIRSYNC) | 83 | if (flags & BTRFS_INODE_DIRSYNC) |
82 | iflags |= FS_DIRSYNC_FL; | 84 | iflags |= FS_DIRSYNC_FL; |
85 | if (flags & BTRFS_INODE_NODATACOW) | ||
86 | iflags |= FS_NOCOW_FL; | ||
87 | |||
88 | if ((flags & BTRFS_INODE_COMPRESS) && !(flags & BTRFS_INODE_NOCOMPRESS)) | ||
89 | iflags |= FS_COMPR_FL; | ||
90 | else if (flags & BTRFS_INODE_NOCOMPRESS) | ||
91 | iflags |= FS_NOCOMP_FL; | ||
83 | 92 | ||
84 | return iflags; | 93 | return iflags; |
85 | } | 94 | } |
@@ -138,6 +147,21 @@ static int btrfs_ioctl_getflags(struct file *file, void __user *arg) | |||
138 | return 0; | 147 | return 0; |
139 | } | 148 | } |
140 | 149 | ||
150 | static int check_flags(unsigned int flags) | ||
151 | { | ||
152 | if (flags & ~(FS_IMMUTABLE_FL | FS_APPEND_FL | \ | ||
153 | FS_NOATIME_FL | FS_NODUMP_FL | \ | ||
154 | FS_SYNC_FL | FS_DIRSYNC_FL | \ | ||
155 | FS_NOCOMP_FL | FS_COMPR_FL | | ||
156 | FS_NOCOW_FL)) | ||
157 | return -EOPNOTSUPP; | ||
158 | |||
159 | if ((flags & FS_NOCOMP_FL) && (flags & FS_COMPR_FL)) | ||
160 | return -EINVAL; | ||
161 | |||
162 | return 0; | ||
163 | } | ||
164 | |||
141 | static int btrfs_ioctl_setflags(struct file *file, void __user *arg) | 165 | static int btrfs_ioctl_setflags(struct file *file, void __user *arg) |
142 | { | 166 | { |
143 | struct inode *inode = file->f_path.dentry->d_inode; | 167 | struct inode *inode = file->f_path.dentry->d_inode; |
@@ -147,15 +171,17 @@ static int btrfs_ioctl_setflags(struct file *file, void __user *arg) | |||
147 | unsigned int flags, oldflags; | 171 | unsigned int flags, oldflags; |
148 | int ret; | 172 | int ret; |
149 | 173 | ||
174 | if (btrfs_root_readonly(root)) | ||
175 | return -EROFS; | ||
176 | |||
150 | if (copy_from_user(&flags, arg, sizeof(flags))) | 177 | if (copy_from_user(&flags, arg, sizeof(flags))) |
151 | return -EFAULT; | 178 | return -EFAULT; |
152 | 179 | ||
153 | if (flags & ~(FS_IMMUTABLE_FL | FS_APPEND_FL | \ | 180 | ret = check_flags(flags); |
154 | FS_NOATIME_FL | FS_NODUMP_FL | \ | 181 | if (ret) |
155 | FS_SYNC_FL | FS_DIRSYNC_FL)) | 182 | return ret; |
156 | return -EOPNOTSUPP; | ||
157 | 183 | ||
158 | if (!is_owner_or_cap(inode)) | 184 | if (!inode_owner_or_capable(inode)) |
159 | return -EACCES; | 185 | return -EACCES; |
160 | 186 | ||
161 | mutex_lock(&inode->i_mutex); | 187 | mutex_lock(&inode->i_mutex); |
@@ -197,10 +223,28 @@ static int btrfs_ioctl_setflags(struct file *file, void __user *arg) | |||
197 | ip->flags |= BTRFS_INODE_DIRSYNC; | 223 | ip->flags |= BTRFS_INODE_DIRSYNC; |
198 | else | 224 | else |
199 | ip->flags &= ~BTRFS_INODE_DIRSYNC; | 225 | ip->flags &= ~BTRFS_INODE_DIRSYNC; |
226 | if (flags & FS_NOCOW_FL) | ||
227 | ip->flags |= BTRFS_INODE_NODATACOW; | ||
228 | else | ||
229 | ip->flags &= ~BTRFS_INODE_NODATACOW; | ||
200 | 230 | ||
231 | /* | ||
232 | * The COMPRESS flag can only be changed by users, while the NOCOMPRESS | ||
233 | * flag may be changed automatically if compression code won't make | ||
234 | * things smaller. | ||
235 | */ | ||
236 | if (flags & FS_NOCOMP_FL) { | ||
237 | ip->flags &= ~BTRFS_INODE_COMPRESS; | ||
238 | ip->flags |= BTRFS_INODE_NOCOMPRESS; | ||
239 | } else if (flags & FS_COMPR_FL) { | ||
240 | ip->flags |= BTRFS_INODE_COMPRESS; | ||
241 | ip->flags &= ~BTRFS_INODE_NOCOMPRESS; | ||
242 | } else { | ||
243 | ip->flags &= ~(BTRFS_INODE_COMPRESS | BTRFS_INODE_NOCOMPRESS); | ||
244 | } | ||
201 | 245 | ||
202 | trans = btrfs_join_transaction(root, 1); | 246 | trans = btrfs_join_transaction(root); |
203 | BUG_ON(!trans); | 247 | BUG_ON(IS_ERR(trans)); |
204 | 248 | ||
205 | ret = btrfs_update_inode(trans, root, inode); | 249 | ret = btrfs_update_inode(trans, root, inode); |
206 | BUG_ON(ret); | 250 | BUG_ON(ret); |
@@ -210,9 +254,11 @@ static int btrfs_ioctl_setflags(struct file *file, void __user *arg) | |||
210 | btrfs_end_transaction(trans, root); | 254 | btrfs_end_transaction(trans, root); |
211 | 255 | ||
212 | mnt_drop_write(file->f_path.mnt); | 256 | mnt_drop_write(file->f_path.mnt); |
257 | |||
258 | ret = 0; | ||
213 | out_unlock: | 259 | out_unlock: |
214 | mutex_unlock(&inode->i_mutex); | 260 | mutex_unlock(&inode->i_mutex); |
215 | return 0; | 261 | return ret; |
216 | } | 262 | } |
217 | 263 | ||
218 | static int btrfs_ioctl_getversion(struct file *file, int __user *arg) | 264 | static int btrfs_ioctl_getversion(struct file *file, int __user *arg) |
@@ -222,9 +268,54 @@ static int btrfs_ioctl_getversion(struct file *file, int __user *arg) | |||
222 | return put_user(inode->i_generation, arg); | 268 | return put_user(inode->i_generation, arg); |
223 | } | 269 | } |
224 | 270 | ||
271 | static noinline int btrfs_ioctl_fitrim(struct file *file, void __user *arg) | ||
272 | { | ||
273 | struct btrfs_root *root = fdentry(file)->d_sb->s_fs_info; | ||
274 | struct btrfs_fs_info *fs_info = root->fs_info; | ||
275 | struct btrfs_device *device; | ||
276 | struct request_queue *q; | ||
277 | struct fstrim_range range; | ||
278 | u64 minlen = ULLONG_MAX; | ||
279 | u64 num_devices = 0; | ||
280 | int ret; | ||
281 | |||
282 | if (!capable(CAP_SYS_ADMIN)) | ||
283 | return -EPERM; | ||
284 | |||
285 | rcu_read_lock(); | ||
286 | list_for_each_entry_rcu(device, &fs_info->fs_devices->devices, | ||
287 | dev_list) { | ||
288 | if (!device->bdev) | ||
289 | continue; | ||
290 | q = bdev_get_queue(device->bdev); | ||
291 | if (blk_queue_discard(q)) { | ||
292 | num_devices++; | ||
293 | minlen = min((u64)q->limits.discard_granularity, | ||
294 | minlen); | ||
295 | } | ||
296 | } | ||
297 | rcu_read_unlock(); | ||
298 | if (!num_devices) | ||
299 | return -EOPNOTSUPP; | ||
300 | |||
301 | if (copy_from_user(&range, arg, sizeof(range))) | ||
302 | return -EFAULT; | ||
303 | |||
304 | range.minlen = max(range.minlen, minlen); | ||
305 | ret = btrfs_trim_fs(root, &range); | ||
306 | if (ret < 0) | ||
307 | return ret; | ||
308 | |||
309 | if (copy_to_user(arg, &range, sizeof(range))) | ||
310 | return -EFAULT; | ||
311 | |||
312 | return 0; | ||
313 | } | ||
314 | |||
225 | static noinline int create_subvol(struct btrfs_root *root, | 315 | static noinline int create_subvol(struct btrfs_root *root, |
226 | struct dentry *dentry, | 316 | struct dentry *dentry, |
227 | char *name, int namelen) | 317 | char *name, int namelen, |
318 | u64 *async_transid) | ||
228 | { | 319 | { |
229 | struct btrfs_trans_handle *trans; | 320 | struct btrfs_trans_handle *trans; |
230 | struct btrfs_key key; | 321 | struct btrfs_key key; |
@@ -232,17 +323,22 @@ static noinline int create_subvol(struct btrfs_root *root, | |||
232 | struct btrfs_inode_item *inode_item; | 323 | struct btrfs_inode_item *inode_item; |
233 | struct extent_buffer *leaf; | 324 | struct extent_buffer *leaf; |
234 | struct btrfs_root *new_root; | 325 | struct btrfs_root *new_root; |
235 | struct inode *dir = dentry->d_parent->d_inode; | 326 | struct dentry *parent = dget_parent(dentry); |
327 | struct inode *dir; | ||
236 | int ret; | 328 | int ret; |
237 | int err; | 329 | int err; |
238 | u64 objectid; | 330 | u64 objectid; |
239 | u64 new_dirid = BTRFS_FIRST_FREE_OBJECTID; | 331 | u64 new_dirid = BTRFS_FIRST_FREE_OBJECTID; |
240 | u64 index = 0; | 332 | u64 index = 0; |
241 | 333 | ||
242 | ret = btrfs_find_free_objectid(NULL, root->fs_info->tree_root, | 334 | ret = btrfs_find_free_objectid(root->fs_info->tree_root, &objectid); |
243 | 0, &objectid); | 335 | if (ret) { |
244 | if (ret) | 336 | dput(parent); |
245 | return ret; | 337 | return ret; |
338 | } | ||
339 | |||
340 | dir = parent->d_inode; | ||
341 | |||
246 | /* | 342 | /* |
247 | * 1 - inode item | 343 | * 1 - inode item |
248 | * 2 - refs | 344 | * 2 - refs |
@@ -250,8 +346,10 @@ static noinline int create_subvol(struct btrfs_root *root, | |||
250 | * 2 - dir items | 346 | * 2 - dir items |
251 | */ | 347 | */ |
252 | trans = btrfs_start_transaction(root, 6); | 348 | trans = btrfs_start_transaction(root, 6); |
253 | if (IS_ERR(trans)) | 349 | if (IS_ERR(trans)) { |
350 | dput(parent); | ||
254 | return PTR_ERR(trans); | 351 | return PTR_ERR(trans); |
352 | } | ||
255 | 353 | ||
256 | leaf = btrfs_alloc_free_block(trans, root, root->leafsize, | 354 | leaf = btrfs_alloc_free_block(trans, root, root->leafsize, |
257 | 0, objectid, NULL, 0, 0, 0); | 355 | 0, objectid, NULL, 0, 0, 0); |
@@ -282,6 +380,10 @@ static noinline int create_subvol(struct btrfs_root *root, | |||
282 | inode_item->nbytes = cpu_to_le64(root->leafsize); | 380 | inode_item->nbytes = cpu_to_le64(root->leafsize); |
283 | inode_item->mode = cpu_to_le32(S_IFDIR | 0755); | 381 | inode_item->mode = cpu_to_le32(S_IFDIR | 0755); |
284 | 382 | ||
383 | root_item.flags = 0; | ||
384 | root_item.byte_limit = 0; | ||
385 | inode_item->flags = cpu_to_le64(BTRFS_INODE_ROOT_ITEM_INIT); | ||
386 | |||
285 | btrfs_set_root_bytenr(&root_item, leaf->start); | 387 | btrfs_set_root_bytenr(&root_item, leaf->start); |
286 | btrfs_set_root_generation(&root_item, trans->transid); | 388 | btrfs_set_root_generation(&root_item, trans->transid); |
287 | btrfs_set_root_level(&root_item, 0); | 389 | btrfs_set_root_level(&root_item, 0); |
@@ -312,8 +414,7 @@ static noinline int create_subvol(struct btrfs_root *root, | |||
312 | 414 | ||
313 | btrfs_record_root_in_trans(trans, new_root); | 415 | btrfs_record_root_in_trans(trans, new_root); |
314 | 416 | ||
315 | ret = btrfs_create_subvol_root(trans, new_root, new_dirid, | 417 | ret = btrfs_create_subvol_root(trans, new_root, new_dirid); |
316 | BTRFS_I(dir)->block_group); | ||
317 | /* | 418 | /* |
318 | * insert the directory item | 419 | * insert the directory item |
319 | */ | 420 | */ |
@@ -321,7 +422,7 @@ static noinline int create_subvol(struct btrfs_root *root, | |||
321 | BUG_ON(ret); | 422 | BUG_ON(ret); |
322 | 423 | ||
323 | ret = btrfs_insert_dir_item(trans, root, | 424 | ret = btrfs_insert_dir_item(trans, root, |
324 | name, namelen, dir->i_ino, &key, | 425 | name, namelen, dir, &key, |
325 | BTRFS_FT_DIR, index); | 426 | BTRFS_FT_DIR, index); |
326 | if (ret) | 427 | if (ret) |
327 | goto fail; | 428 | goto fail; |
@@ -332,21 +433,30 @@ static noinline int create_subvol(struct btrfs_root *root, | |||
332 | 433 | ||
333 | ret = btrfs_add_root_ref(trans, root->fs_info->tree_root, | 434 | ret = btrfs_add_root_ref(trans, root->fs_info->tree_root, |
334 | objectid, root->root_key.objectid, | 435 | objectid, root->root_key.objectid, |
335 | dir->i_ino, index, name, namelen); | 436 | btrfs_ino(dir), index, name, namelen); |
336 | 437 | ||
337 | BUG_ON(ret); | 438 | BUG_ON(ret); |
338 | 439 | ||
339 | d_instantiate(dentry, btrfs_lookup_dentry(dir, dentry)); | 440 | d_instantiate(dentry, btrfs_lookup_dentry(dir, dentry)); |
340 | fail: | 441 | fail: |
341 | err = btrfs_commit_transaction(trans, root); | 442 | dput(parent); |
443 | if (async_transid) { | ||
444 | *async_transid = trans->transid; | ||
445 | err = btrfs_commit_transaction_async(trans, root, 1); | ||
446 | } else { | ||
447 | err = btrfs_commit_transaction(trans, root); | ||
448 | } | ||
342 | if (err && !ret) | 449 | if (err && !ret) |
343 | ret = err; | 450 | ret = err; |
344 | return ret; | 451 | return ret; |
345 | } | 452 | } |
346 | 453 | ||
347 | static int create_snapshot(struct btrfs_root *root, struct dentry *dentry) | 454 | static int create_snapshot(struct btrfs_root *root, struct dentry *dentry, |
455 | char *name, int namelen, u64 *async_transid, | ||
456 | bool readonly) | ||
348 | { | 457 | { |
349 | struct inode *inode; | 458 | struct inode *inode; |
459 | struct dentry *parent; | ||
350 | struct btrfs_pending_snapshot *pending_snapshot; | 460 | struct btrfs_pending_snapshot *pending_snapshot; |
351 | struct btrfs_trans_handle *trans; | 461 | struct btrfs_trans_handle *trans; |
352 | int ret; | 462 | int ret; |
@@ -361,6 +471,7 @@ static int create_snapshot(struct btrfs_root *root, struct dentry *dentry) | |||
361 | btrfs_init_block_rsv(&pending_snapshot->block_rsv); | 471 | btrfs_init_block_rsv(&pending_snapshot->block_rsv); |
362 | pending_snapshot->dentry = dentry; | 472 | pending_snapshot->dentry = dentry; |
363 | pending_snapshot->root = root; | 473 | pending_snapshot->root = root; |
474 | pending_snapshot->readonly = readonly; | ||
364 | 475 | ||
365 | trans = btrfs_start_transaction(root->fs_info->extent_root, 5); | 476 | trans = btrfs_start_transaction(root->fs_info->extent_root, 5); |
366 | if (IS_ERR(trans)) { | 477 | if (IS_ERR(trans)) { |
@@ -371,18 +482,31 @@ static int create_snapshot(struct btrfs_root *root, struct dentry *dentry) | |||
371 | ret = btrfs_snap_reserve_metadata(trans, pending_snapshot); | 482 | ret = btrfs_snap_reserve_metadata(trans, pending_snapshot); |
372 | BUG_ON(ret); | 483 | BUG_ON(ret); |
373 | 484 | ||
485 | spin_lock(&root->fs_info->trans_lock); | ||
374 | list_add(&pending_snapshot->list, | 486 | list_add(&pending_snapshot->list, |
375 | &trans->transaction->pending_snapshots); | 487 | &trans->transaction->pending_snapshots); |
376 | ret = btrfs_commit_transaction(trans, root->fs_info->extent_root); | 488 | spin_unlock(&root->fs_info->trans_lock); |
489 | if (async_transid) { | ||
490 | *async_transid = trans->transid; | ||
491 | ret = btrfs_commit_transaction_async(trans, | ||
492 | root->fs_info->extent_root, 1); | ||
493 | } else { | ||
494 | ret = btrfs_commit_transaction(trans, | ||
495 | root->fs_info->extent_root); | ||
496 | } | ||
377 | BUG_ON(ret); | 497 | BUG_ON(ret); |
378 | 498 | ||
379 | ret = pending_snapshot->error; | 499 | ret = pending_snapshot->error; |
380 | if (ret) | 500 | if (ret) |
381 | goto fail; | 501 | goto fail; |
382 | 502 | ||
383 | btrfs_orphan_cleanup(pending_snapshot->snap); | 503 | ret = btrfs_orphan_cleanup(pending_snapshot->snap); |
504 | if (ret) | ||
505 | goto fail; | ||
384 | 506 | ||
385 | inode = btrfs_lookup_dentry(dentry->d_parent->d_inode, dentry); | 507 | parent = dget_parent(dentry); |
508 | inode = btrfs_lookup_dentry(parent->d_inode, dentry); | ||
509 | dput(parent); | ||
386 | if (IS_ERR(inode)) { | 510 | if (IS_ERR(inode)) { |
387 | ret = PTR_ERR(inode); | 511 | ret = PTR_ERR(inode); |
388 | goto fail; | 512 | goto fail; |
@@ -395,6 +519,76 @@ fail: | |||
395 | return ret; | 519 | return ret; |
396 | } | 520 | } |
397 | 521 | ||
522 | /* copy of check_sticky in fs/namei.c() | ||
523 | * It's inline, so penalty for filesystems that don't use sticky bit is | ||
524 | * minimal. | ||
525 | */ | ||
526 | static inline int btrfs_check_sticky(struct inode *dir, struct inode *inode) | ||
527 | { | ||
528 | uid_t fsuid = current_fsuid(); | ||
529 | |||
530 | if (!(dir->i_mode & S_ISVTX)) | ||
531 | return 0; | ||
532 | if (inode->i_uid == fsuid) | ||
533 | return 0; | ||
534 | if (dir->i_uid == fsuid) | ||
535 | return 0; | ||
536 | return !capable(CAP_FOWNER); | ||
537 | } | ||
538 | |||
539 | /* copy of may_delete in fs/namei.c() | ||
540 | * Check whether we can remove a link victim from directory dir, check | ||
541 | * whether the type of victim is right. | ||
542 | * 1. We can't do it if dir is read-only (done in permission()) | ||
543 | * 2. We should have write and exec permissions on dir | ||
544 | * 3. We can't remove anything from append-only dir | ||
545 | * 4. We can't do anything with immutable dir (done in permission()) | ||
546 | * 5. If the sticky bit on dir is set we should either | ||
547 | * a. be owner of dir, or | ||
548 | * b. be owner of victim, or | ||
549 | * c. have CAP_FOWNER capability | ||
550 | * 6. If the victim is append-only or immutable we can't do antyhing with | ||
551 | * links pointing to it. | ||
552 | * 7. If we were asked to remove a directory and victim isn't one - ENOTDIR. | ||
553 | * 8. If we were asked to remove a non-directory and victim isn't one - EISDIR. | ||
554 | * 9. We can't remove a root or mountpoint. | ||
555 | * 10. We don't allow removal of NFS sillyrenamed files; it's handled by | ||
556 | * nfs_async_unlink(). | ||
557 | */ | ||
558 | |||
559 | static int btrfs_may_delete(struct inode *dir,struct dentry *victim,int isdir) | ||
560 | { | ||
561 | int error; | ||
562 | |||
563 | if (!victim->d_inode) | ||
564 | return -ENOENT; | ||
565 | |||
566 | BUG_ON(victim->d_parent->d_inode != dir); | ||
567 | audit_inode_child(victim, dir); | ||
568 | |||
569 | error = inode_permission(dir, MAY_WRITE | MAY_EXEC); | ||
570 | if (error) | ||
571 | return error; | ||
572 | if (IS_APPEND(dir)) | ||
573 | return -EPERM; | ||
574 | if (btrfs_check_sticky(dir, victim->d_inode)|| | ||
575 | IS_APPEND(victim->d_inode)|| | ||
576 | IS_IMMUTABLE(victim->d_inode) || IS_SWAPFILE(victim->d_inode)) | ||
577 | return -EPERM; | ||
578 | if (isdir) { | ||
579 | if (!S_ISDIR(victim->d_inode->i_mode)) | ||
580 | return -ENOTDIR; | ||
581 | if (IS_ROOT(victim)) | ||
582 | return -EBUSY; | ||
583 | } else if (S_ISDIR(victim->d_inode->i_mode)) | ||
584 | return -EISDIR; | ||
585 | if (IS_DEADDIR(dir)) | ||
586 | return -ENOENT; | ||
587 | if (victim->d_flags & DCACHE_NFSFS_RENAMED) | ||
588 | return -EBUSY; | ||
589 | return 0; | ||
590 | } | ||
591 | |||
398 | /* copy of may_create in fs/namei.c() */ | 592 | /* copy of may_create in fs/namei.c() */ |
399 | static inline int btrfs_may_create(struct inode *dir, struct dentry *child) | 593 | static inline int btrfs_may_create(struct inode *dir, struct dentry *child) |
400 | { | 594 | { |
@@ -412,7 +606,8 @@ static inline int btrfs_may_create(struct inode *dir, struct dentry *child) | |||
412 | */ | 606 | */ |
413 | static noinline int btrfs_mksubvol(struct path *parent, | 607 | static noinline int btrfs_mksubvol(struct path *parent, |
414 | char *name, int namelen, | 608 | char *name, int namelen, |
415 | struct btrfs_root *snap_src) | 609 | struct btrfs_root *snap_src, |
610 | u64 *async_transid, bool readonly) | ||
416 | { | 611 | { |
417 | struct inode *dir = parent->dentry->d_inode; | 612 | struct inode *dir = parent->dentry->d_inode; |
418 | struct dentry *dentry; | 613 | struct dentry *dentry; |
@@ -443,10 +638,11 @@ static noinline int btrfs_mksubvol(struct path *parent, | |||
443 | goto out_up_read; | 638 | goto out_up_read; |
444 | 639 | ||
445 | if (snap_src) { | 640 | if (snap_src) { |
446 | error = create_snapshot(snap_src, dentry); | 641 | error = create_snapshot(snap_src, dentry, |
642 | name, namelen, async_transid, readonly); | ||
447 | } else { | 643 | } else { |
448 | error = create_subvol(BTRFS_I(dir)->root, dentry, | 644 | error = create_subvol(BTRFS_I(dir)->root, dentry, |
449 | name, namelen); | 645 | name, namelen, async_transid); |
450 | } | 646 | } |
451 | if (!error) | 647 | if (!error) |
452 | fsnotify_mkdir(dir, dentry); | 648 | fsnotify_mkdir(dir, dentry); |
@@ -461,6 +657,107 @@ out_unlock: | |||
461 | return error; | 657 | return error; |
462 | } | 658 | } |
463 | 659 | ||
660 | /* | ||
661 | * When we're defragging a range, we don't want to kick it off again | ||
662 | * if it is really just waiting for delalloc to send it down. | ||
663 | * If we find a nice big extent or delalloc range for the bytes in the | ||
664 | * file you want to defrag, we return 0 to let you know to skip this | ||
665 | * part of the file | ||
666 | */ | ||
667 | static int check_defrag_in_cache(struct inode *inode, u64 offset, int thresh) | ||
668 | { | ||
669 | struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; | ||
670 | struct extent_map *em = NULL; | ||
671 | struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; | ||
672 | u64 end; | ||
673 | |||
674 | read_lock(&em_tree->lock); | ||
675 | em = lookup_extent_mapping(em_tree, offset, PAGE_CACHE_SIZE); | ||
676 | read_unlock(&em_tree->lock); | ||
677 | |||
678 | if (em) { | ||
679 | end = extent_map_end(em); | ||
680 | free_extent_map(em); | ||
681 | if (end - offset > thresh) | ||
682 | return 0; | ||
683 | } | ||
684 | /* if we already have a nice delalloc here, just stop */ | ||
685 | thresh /= 2; | ||
686 | end = count_range_bits(io_tree, &offset, offset + thresh, | ||
687 | thresh, EXTENT_DELALLOC, 1); | ||
688 | if (end >= thresh) | ||
689 | return 0; | ||
690 | return 1; | ||
691 | } | ||
692 | |||
693 | /* | ||
694 | * helper function to walk through a file and find extents | ||
695 | * newer than a specific transid, and smaller than thresh. | ||
696 | * | ||
697 | * This is used by the defragging code to find new and small | ||
698 | * extents | ||
699 | */ | ||
700 | static int find_new_extents(struct btrfs_root *root, | ||
701 | struct inode *inode, u64 newer_than, | ||
702 | u64 *off, int thresh) | ||
703 | { | ||
704 | struct btrfs_path *path; | ||
705 | struct btrfs_key min_key; | ||
706 | struct btrfs_key max_key; | ||
707 | struct extent_buffer *leaf; | ||
708 | struct btrfs_file_extent_item *extent; | ||
709 | int type; | ||
710 | int ret; | ||
711 | u64 ino = btrfs_ino(inode); | ||
712 | |||
713 | path = btrfs_alloc_path(); | ||
714 | if (!path) | ||
715 | return -ENOMEM; | ||
716 | |||
717 | min_key.objectid = ino; | ||
718 | min_key.type = BTRFS_EXTENT_DATA_KEY; | ||
719 | min_key.offset = *off; | ||
720 | |||
721 | max_key.objectid = ino; | ||
722 | max_key.type = (u8)-1; | ||
723 | max_key.offset = (u64)-1; | ||
724 | |||
725 | path->keep_locks = 1; | ||
726 | |||
727 | while(1) { | ||
728 | ret = btrfs_search_forward(root, &min_key, &max_key, | ||
729 | path, 0, newer_than); | ||
730 | if (ret != 0) | ||
731 | goto none; | ||
732 | if (min_key.objectid != ino) | ||
733 | goto none; | ||
734 | if (min_key.type != BTRFS_EXTENT_DATA_KEY) | ||
735 | goto none; | ||
736 | |||
737 | leaf = path->nodes[0]; | ||
738 | extent = btrfs_item_ptr(leaf, path->slots[0], | ||
739 | struct btrfs_file_extent_item); | ||
740 | |||
741 | type = btrfs_file_extent_type(leaf, extent); | ||
742 | if (type == BTRFS_FILE_EXTENT_REG && | ||
743 | btrfs_file_extent_num_bytes(leaf, extent) < thresh && | ||
744 | check_defrag_in_cache(inode, min_key.offset, thresh)) { | ||
745 | *off = min_key.offset; | ||
746 | btrfs_free_path(path); | ||
747 | return 0; | ||
748 | } | ||
749 | |||
750 | if (min_key.offset == (u64)-1) | ||
751 | goto none; | ||
752 | |||
753 | min_key.offset++; | ||
754 | btrfs_release_path(path); | ||
755 | } | ||
756 | none: | ||
757 | btrfs_free_path(path); | ||
758 | return -ENOENT; | ||
759 | } | ||
760 | |||
464 | static int should_defrag_range(struct inode *inode, u64 start, u64 len, | 761 | static int should_defrag_range(struct inode *inode, u64 start, u64 len, |
465 | int thresh, u64 *last_len, u64 *skip, | 762 | int thresh, u64 *last_len, u64 *skip, |
466 | u64 *defrag_end) | 763 | u64 *defrag_end) |
@@ -470,10 +767,6 @@ static int should_defrag_range(struct inode *inode, u64 start, u64 len, | |||
470 | struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; | 767 | struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; |
471 | int ret = 1; | 768 | int ret = 1; |
472 | 769 | ||
473 | |||
474 | if (thresh == 0) | ||
475 | thresh = 256 * 1024; | ||
476 | |||
477 | /* | 770 | /* |
478 | * make sure that once we start defragging and extent, we keep on | 771 | * make sure that once we start defragging and extent, we keep on |
479 | * defragging it | 772 | * defragging it |
@@ -532,28 +825,208 @@ static int should_defrag_range(struct inode *inode, u64 start, u64 len, | |||
532 | return ret; | 825 | return ret; |
533 | } | 826 | } |
534 | 827 | ||
535 | static int btrfs_defrag_file(struct file *file, | 828 | /* |
536 | struct btrfs_ioctl_defrag_range_args *range) | 829 | * it doesn't do much good to defrag one or two pages |
830 | * at a time. This pulls in a nice chunk of pages | ||
831 | * to COW and defrag. | ||
832 | * | ||
833 | * It also makes sure the delalloc code has enough | ||
834 | * dirty data to avoid making new small extents as part | ||
835 | * of the defrag | ||
836 | * | ||
837 | * It's a good idea to start RA on this range | ||
838 | * before calling this. | ||
839 | */ | ||
840 | static int cluster_pages_for_defrag(struct inode *inode, | ||
841 | struct page **pages, | ||
842 | unsigned long start_index, | ||
843 | int num_pages) | ||
537 | { | 844 | { |
538 | struct inode *inode = fdentry(file)->d_inode; | 845 | unsigned long file_end; |
539 | struct btrfs_root *root = BTRFS_I(inode)->root; | 846 | u64 isize = i_size_read(inode); |
540 | struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; | ||
541 | struct btrfs_ordered_extent *ordered; | ||
542 | struct page *page; | ||
543 | unsigned long last_index; | ||
544 | unsigned long ra_pages = root->fs_info->bdi.ra_pages; | ||
545 | unsigned long total_read = 0; | ||
546 | u64 page_start; | 847 | u64 page_start; |
547 | u64 page_end; | 848 | u64 page_end; |
849 | int ret; | ||
850 | int i; | ||
851 | int i_done; | ||
852 | struct btrfs_ordered_extent *ordered; | ||
853 | struct extent_state *cached_state = NULL; | ||
854 | |||
855 | if (isize == 0) | ||
856 | return 0; | ||
857 | file_end = (isize - 1) >> PAGE_CACHE_SHIFT; | ||
858 | |||
859 | ret = btrfs_delalloc_reserve_space(inode, | ||
860 | num_pages << PAGE_CACHE_SHIFT); | ||
861 | if (ret) | ||
862 | return ret; | ||
863 | again: | ||
864 | ret = 0; | ||
865 | i_done = 0; | ||
866 | |||
867 | /* step one, lock all the pages */ | ||
868 | for (i = 0; i < num_pages; i++) { | ||
869 | struct page *page; | ||
870 | page = grab_cache_page(inode->i_mapping, | ||
871 | start_index + i); | ||
872 | if (!page) | ||
873 | break; | ||
874 | |||
875 | if (!PageUptodate(page)) { | ||
876 | btrfs_readpage(NULL, page); | ||
877 | lock_page(page); | ||
878 | if (!PageUptodate(page)) { | ||
879 | unlock_page(page); | ||
880 | page_cache_release(page); | ||
881 | ret = -EIO; | ||
882 | break; | ||
883 | } | ||
884 | } | ||
885 | isize = i_size_read(inode); | ||
886 | file_end = (isize - 1) >> PAGE_CACHE_SHIFT; | ||
887 | if (!isize || page->index > file_end || | ||
888 | page->mapping != inode->i_mapping) { | ||
889 | /* whoops, we blew past eof, skip this page */ | ||
890 | unlock_page(page); | ||
891 | page_cache_release(page); | ||
892 | break; | ||
893 | } | ||
894 | pages[i] = page; | ||
895 | i_done++; | ||
896 | } | ||
897 | if (!i_done || ret) | ||
898 | goto out; | ||
899 | |||
900 | if (!(inode->i_sb->s_flags & MS_ACTIVE)) | ||
901 | goto out; | ||
902 | |||
903 | /* | ||
904 | * so now we have a nice long stream of locked | ||
905 | * and up to date pages, lets wait on them | ||
906 | */ | ||
907 | for (i = 0; i < i_done; i++) | ||
908 | wait_on_page_writeback(pages[i]); | ||
909 | |||
910 | page_start = page_offset(pages[0]); | ||
911 | page_end = page_offset(pages[i_done - 1]) + PAGE_CACHE_SIZE; | ||
912 | |||
913 | lock_extent_bits(&BTRFS_I(inode)->io_tree, | ||
914 | page_start, page_end - 1, 0, &cached_state, | ||
915 | GFP_NOFS); | ||
916 | ordered = btrfs_lookup_first_ordered_extent(inode, page_end - 1); | ||
917 | if (ordered && | ||
918 | ordered->file_offset + ordered->len > page_start && | ||
919 | ordered->file_offset < page_end) { | ||
920 | btrfs_put_ordered_extent(ordered); | ||
921 | unlock_extent_cached(&BTRFS_I(inode)->io_tree, | ||
922 | page_start, page_end - 1, | ||
923 | &cached_state, GFP_NOFS); | ||
924 | for (i = 0; i < i_done; i++) { | ||
925 | unlock_page(pages[i]); | ||
926 | page_cache_release(pages[i]); | ||
927 | } | ||
928 | btrfs_wait_ordered_range(inode, page_start, | ||
929 | page_end - page_start); | ||
930 | goto again; | ||
931 | } | ||
932 | if (ordered) | ||
933 | btrfs_put_ordered_extent(ordered); | ||
934 | |||
935 | clear_extent_bit(&BTRFS_I(inode)->io_tree, page_start, | ||
936 | page_end - 1, EXTENT_DIRTY | EXTENT_DELALLOC | | ||
937 | EXTENT_DO_ACCOUNTING, 0, 0, &cached_state, | ||
938 | GFP_NOFS); | ||
939 | |||
940 | if (i_done != num_pages) { | ||
941 | atomic_inc(&BTRFS_I(inode)->outstanding_extents); | ||
942 | btrfs_delalloc_release_space(inode, | ||
943 | (num_pages - i_done) << PAGE_CACHE_SHIFT); | ||
944 | } | ||
945 | |||
946 | |||
947 | btrfs_set_extent_delalloc(inode, page_start, page_end - 1, | ||
948 | &cached_state); | ||
949 | |||
950 | unlock_extent_cached(&BTRFS_I(inode)->io_tree, | ||
951 | page_start, page_end - 1, &cached_state, | ||
952 | GFP_NOFS); | ||
953 | |||
954 | for (i = 0; i < i_done; i++) { | ||
955 | clear_page_dirty_for_io(pages[i]); | ||
956 | ClearPageChecked(pages[i]); | ||
957 | set_page_extent_mapped(pages[i]); | ||
958 | set_page_dirty(pages[i]); | ||
959 | unlock_page(pages[i]); | ||
960 | page_cache_release(pages[i]); | ||
961 | } | ||
962 | return i_done; | ||
963 | out: | ||
964 | for (i = 0; i < i_done; i++) { | ||
965 | unlock_page(pages[i]); | ||
966 | page_cache_release(pages[i]); | ||
967 | } | ||
968 | btrfs_delalloc_release_space(inode, num_pages << PAGE_CACHE_SHIFT); | ||
969 | return ret; | ||
970 | |||
971 | } | ||
972 | |||
973 | int btrfs_defrag_file(struct inode *inode, struct file *file, | ||
974 | struct btrfs_ioctl_defrag_range_args *range, | ||
975 | u64 newer_than, unsigned long max_to_defrag) | ||
976 | { | ||
977 | struct btrfs_root *root = BTRFS_I(inode)->root; | ||
978 | struct btrfs_super_block *disk_super; | ||
979 | struct file_ra_state *ra = NULL; | ||
980 | unsigned long last_index; | ||
981 | u64 features; | ||
548 | u64 last_len = 0; | 982 | u64 last_len = 0; |
549 | u64 skip = 0; | 983 | u64 skip = 0; |
550 | u64 defrag_end = 0; | 984 | u64 defrag_end = 0; |
985 | u64 newer_off = range->start; | ||
986 | int newer_left = 0; | ||
551 | unsigned long i; | 987 | unsigned long i; |
552 | int ret; | 988 | int ret; |
989 | int defrag_count = 0; | ||
990 | int compress_type = BTRFS_COMPRESS_ZLIB; | ||
991 | int extent_thresh = range->extent_thresh; | ||
992 | int newer_cluster = (256 * 1024) >> PAGE_CACHE_SHIFT; | ||
993 | u64 new_align = ~((u64)128 * 1024 - 1); | ||
994 | struct page **pages = NULL; | ||
995 | |||
996 | if (extent_thresh == 0) | ||
997 | extent_thresh = 256 * 1024; | ||
998 | |||
999 | if (range->flags & BTRFS_DEFRAG_RANGE_COMPRESS) { | ||
1000 | if (range->compress_type > BTRFS_COMPRESS_TYPES) | ||
1001 | return -EINVAL; | ||
1002 | if (range->compress_type) | ||
1003 | compress_type = range->compress_type; | ||
1004 | } | ||
553 | 1005 | ||
554 | if (inode->i_size == 0) | 1006 | if (inode->i_size == 0) |
555 | return 0; | 1007 | return 0; |
556 | 1008 | ||
1009 | /* | ||
1010 | * if we were not given a file, allocate a readahead | ||
1011 | * context | ||
1012 | */ | ||
1013 | if (!file) { | ||
1014 | ra = kzalloc(sizeof(*ra), GFP_NOFS); | ||
1015 | if (!ra) | ||
1016 | return -ENOMEM; | ||
1017 | file_ra_state_init(ra, inode->i_mapping); | ||
1018 | } else { | ||
1019 | ra = &file->f_ra; | ||
1020 | } | ||
1021 | |||
1022 | pages = kmalloc(sizeof(struct page *) * newer_cluster, | ||
1023 | GFP_NOFS); | ||
1024 | if (!pages) { | ||
1025 | ret = -ENOMEM; | ||
1026 | goto out_ra; | ||
1027 | } | ||
1028 | |||
1029 | /* find the last page to defrag */ | ||
557 | if (range->start + range->len > range->start) { | 1030 | if (range->start + range->len > range->start) { |
558 | last_index = min_t(u64, inode->i_size - 1, | 1031 | last_index = min_t(u64, inode->i_size - 1, |
559 | range->start + range->len - 1) >> PAGE_CACHE_SHIFT; | 1032 | range->start + range->len - 1) >> PAGE_CACHE_SHIFT; |
@@ -561,11 +1034,37 @@ static int btrfs_defrag_file(struct file *file, | |||
561 | last_index = (inode->i_size - 1) >> PAGE_CACHE_SHIFT; | 1034 | last_index = (inode->i_size - 1) >> PAGE_CACHE_SHIFT; |
562 | } | 1035 | } |
563 | 1036 | ||
564 | i = range->start >> PAGE_CACHE_SHIFT; | 1037 | if (newer_than) { |
565 | while (i <= last_index) { | 1038 | ret = find_new_extents(root, inode, newer_than, |
566 | if (!should_defrag_range(inode, (u64)i << PAGE_CACHE_SHIFT, | 1039 | &newer_off, 64 * 1024); |
1040 | if (!ret) { | ||
1041 | range->start = newer_off; | ||
1042 | /* | ||
1043 | * we always align our defrag to help keep | ||
1044 | * the extents in the file evenly spaced | ||
1045 | */ | ||
1046 | i = (newer_off & new_align) >> PAGE_CACHE_SHIFT; | ||
1047 | newer_left = newer_cluster; | ||
1048 | } else | ||
1049 | goto out_ra; | ||
1050 | } else { | ||
1051 | i = range->start >> PAGE_CACHE_SHIFT; | ||
1052 | } | ||
1053 | if (!max_to_defrag) | ||
1054 | max_to_defrag = last_index - 1; | ||
1055 | |||
1056 | while (i <= last_index && defrag_count < max_to_defrag) { | ||
1057 | /* | ||
1058 | * make sure we stop running if someone unmounts | ||
1059 | * the FS | ||
1060 | */ | ||
1061 | if (!(inode->i_sb->s_flags & MS_ACTIVE)) | ||
1062 | break; | ||
1063 | |||
1064 | if (!newer_than && | ||
1065 | !should_defrag_range(inode, (u64)i << PAGE_CACHE_SHIFT, | ||
567 | PAGE_CACHE_SIZE, | 1066 | PAGE_CACHE_SIZE, |
568 | range->extent_thresh, | 1067 | extent_thresh, |
569 | &last_len, &skip, | 1068 | &last_len, &skip, |
570 | &defrag_end)) { | 1069 | &defrag_end)) { |
571 | unsigned long next; | 1070 | unsigned long next; |
@@ -577,92 +1076,39 @@ static int btrfs_defrag_file(struct file *file, | |||
577 | i = max(i + 1, next); | 1076 | i = max(i + 1, next); |
578 | continue; | 1077 | continue; |
579 | } | 1078 | } |
580 | |||
581 | if (total_read % ra_pages == 0) { | ||
582 | btrfs_force_ra(inode->i_mapping, &file->f_ra, file, i, | ||
583 | min(last_index, i + ra_pages - 1)); | ||
584 | } | ||
585 | total_read++; | ||
586 | mutex_lock(&inode->i_mutex); | ||
587 | if (range->flags & BTRFS_DEFRAG_RANGE_COMPRESS) | 1079 | if (range->flags & BTRFS_DEFRAG_RANGE_COMPRESS) |
588 | BTRFS_I(inode)->force_compress = 1; | 1080 | BTRFS_I(inode)->force_compress = compress_type; |
589 | 1081 | ||
590 | ret = btrfs_delalloc_reserve_space(inode, PAGE_CACHE_SIZE); | 1082 | btrfs_force_ra(inode->i_mapping, ra, file, i, newer_cluster); |
591 | if (ret) | ||
592 | goto err_unlock; | ||
593 | again: | ||
594 | if (inode->i_size == 0 || | ||
595 | i > ((inode->i_size - 1) >> PAGE_CACHE_SHIFT)) { | ||
596 | ret = 0; | ||
597 | goto err_reservations; | ||
598 | } | ||
599 | 1083 | ||
600 | page = grab_cache_page(inode->i_mapping, i); | 1084 | ret = cluster_pages_for_defrag(inode, pages, i, newer_cluster); |
601 | if (!page) { | 1085 | if (ret < 0) |
602 | ret = -ENOMEM; | 1086 | goto out_ra; |
603 | goto err_reservations; | ||
604 | } | ||
605 | |||
606 | if (!PageUptodate(page)) { | ||
607 | btrfs_readpage(NULL, page); | ||
608 | lock_page(page); | ||
609 | if (!PageUptodate(page)) { | ||
610 | unlock_page(page); | ||
611 | page_cache_release(page); | ||
612 | ret = -EIO; | ||
613 | goto err_reservations; | ||
614 | } | ||
615 | } | ||
616 | |||
617 | if (page->mapping != inode->i_mapping) { | ||
618 | unlock_page(page); | ||
619 | page_cache_release(page); | ||
620 | goto again; | ||
621 | } | ||
622 | |||
623 | wait_on_page_writeback(page); | ||
624 | 1087 | ||
625 | if (PageDirty(page)) { | 1088 | defrag_count += ret; |
626 | btrfs_delalloc_release_space(inode, PAGE_CACHE_SIZE); | 1089 | balance_dirty_pages_ratelimited_nr(inode->i_mapping, ret); |
627 | goto loop_unlock; | 1090 | i += ret; |
628 | } | ||
629 | 1091 | ||
630 | page_start = (u64)page->index << PAGE_CACHE_SHIFT; | 1092 | if (newer_than) { |
631 | page_end = page_start + PAGE_CACHE_SIZE - 1; | 1093 | if (newer_off == (u64)-1) |
632 | lock_extent(io_tree, page_start, page_end, GFP_NOFS); | 1094 | break; |
633 | 1095 | ||
634 | ordered = btrfs_lookup_ordered_extent(inode, page_start); | 1096 | newer_off = max(newer_off + 1, |
635 | if (ordered) { | 1097 | (u64)i << PAGE_CACHE_SHIFT); |
636 | unlock_extent(io_tree, page_start, page_end, GFP_NOFS); | 1098 | |
637 | unlock_page(page); | 1099 | ret = find_new_extents(root, inode, |
638 | page_cache_release(page); | 1100 | newer_than, &newer_off, |
639 | btrfs_start_ordered_extent(inode, ordered, 1); | 1101 | 64 * 1024); |
640 | btrfs_put_ordered_extent(ordered); | 1102 | if (!ret) { |
641 | goto again; | 1103 | range->start = newer_off; |
1104 | i = (newer_off & new_align) >> PAGE_CACHE_SHIFT; | ||
1105 | newer_left = newer_cluster; | ||
1106 | } else { | ||
1107 | break; | ||
1108 | } | ||
1109 | } else { | ||
1110 | i++; | ||
642 | } | 1111 | } |
643 | set_page_extent_mapped(page); | ||
644 | |||
645 | /* | ||
646 | * this makes sure page_mkwrite is called on the | ||
647 | * page if it is dirtied again later | ||
648 | */ | ||
649 | clear_page_dirty_for_io(page); | ||
650 | clear_extent_bits(&BTRFS_I(inode)->io_tree, page_start, | ||
651 | page_end, EXTENT_DIRTY | EXTENT_DELALLOC | | ||
652 | EXTENT_DO_ACCOUNTING, GFP_NOFS); | ||
653 | |||
654 | btrfs_set_extent_delalloc(inode, page_start, page_end, NULL); | ||
655 | ClearPageChecked(page); | ||
656 | set_page_dirty(page); | ||
657 | unlock_extent(io_tree, page_start, page_end, GFP_NOFS); | ||
658 | |||
659 | loop_unlock: | ||
660 | unlock_page(page); | ||
661 | page_cache_release(page); | ||
662 | mutex_unlock(&inode->i_mutex); | ||
663 | |||
664 | balance_dirty_pages_ratelimited_nr(inode->i_mapping, 1); | ||
665 | i++; | ||
666 | } | 1112 | } |
667 | 1113 | ||
668 | if ((range->flags & BTRFS_DEFRAG_RANGE_START_IO)) | 1114 | if ((range->flags & BTRFS_DEFRAG_RANGE_START_IO)) |
@@ -683,16 +1129,25 @@ loop_unlock: | |||
683 | atomic_dec(&root->fs_info->async_submit_draining); | 1129 | atomic_dec(&root->fs_info->async_submit_draining); |
684 | 1130 | ||
685 | mutex_lock(&inode->i_mutex); | 1131 | mutex_lock(&inode->i_mutex); |
686 | BTRFS_I(inode)->force_compress = 0; | 1132 | BTRFS_I(inode)->force_compress = BTRFS_COMPRESS_NONE; |
687 | mutex_unlock(&inode->i_mutex); | 1133 | mutex_unlock(&inode->i_mutex); |
688 | } | 1134 | } |
689 | 1135 | ||
690 | return 0; | 1136 | disk_super = &root->fs_info->super_copy; |
1137 | features = btrfs_super_incompat_flags(disk_super); | ||
1138 | if (range->compress_type == BTRFS_COMPRESS_LZO) { | ||
1139 | features |= BTRFS_FEATURE_INCOMPAT_COMPRESS_LZO; | ||
1140 | btrfs_set_super_incompat_flags(disk_super, features); | ||
1141 | } | ||
691 | 1142 | ||
692 | err_reservations: | 1143 | if (!file) |
693 | btrfs_delalloc_release_space(inode, PAGE_CACHE_SIZE); | 1144 | kfree(ra); |
694 | err_unlock: | 1145 | return defrag_count; |
695 | mutex_unlock(&inode->i_mutex); | 1146 | |
1147 | out_ra: | ||
1148 | if (!file) | ||
1149 | kfree(ra); | ||
1150 | kfree(pages); | ||
696 | return ret; | 1151 | return ret; |
697 | } | 1152 | } |
698 | 1153 | ||
@@ -708,7 +1163,6 @@ static noinline int btrfs_ioctl_resize(struct btrfs_root *root, | |||
708 | char *sizestr; | 1163 | char *sizestr; |
709 | char *devstr = NULL; | 1164 | char *devstr = NULL; |
710 | int ret = 0; | 1165 | int ret = 0; |
711 | int namelen; | ||
712 | int mod = 0; | 1166 | int mod = 0; |
713 | 1167 | ||
714 | if (root->fs_info->sb->s_flags & MS_RDONLY) | 1168 | if (root->fs_info->sb->s_flags & MS_RDONLY) |
@@ -722,7 +1176,6 @@ static noinline int btrfs_ioctl_resize(struct btrfs_root *root, | |||
722 | return PTR_ERR(vol_args); | 1176 | return PTR_ERR(vol_args); |
723 | 1177 | ||
724 | vol_args->name[BTRFS_PATH_NAME_MAX] = '\0'; | 1178 | vol_args->name[BTRFS_PATH_NAME_MAX] = '\0'; |
725 | namelen = strlen(vol_args->name); | ||
726 | 1179 | ||
727 | mutex_lock(&root->fs_info->volume_mutex); | 1180 | mutex_lock(&root->fs_info->volume_mutex); |
728 | sizestr = vol_args->name; | 1181 | sizestr = vol_args->name; |
@@ -789,6 +1242,10 @@ static noinline int btrfs_ioctl_resize(struct btrfs_root *root, | |||
789 | 1242 | ||
790 | if (new_size > old_size) { | 1243 | if (new_size > old_size) { |
791 | trans = btrfs_start_transaction(root, 0); | 1244 | trans = btrfs_start_transaction(root, 0); |
1245 | if (IS_ERR(trans)) { | ||
1246 | ret = PTR_ERR(trans); | ||
1247 | goto out_unlock; | ||
1248 | } | ||
792 | ret = btrfs_grow_device(trans, device, new_size); | 1249 | ret = btrfs_grow_device(trans, device, new_size); |
793 | btrfs_commit_transaction(trans, root); | 1250 | btrfs_commit_transaction(trans, root); |
794 | } else { | 1251 | } else { |
@@ -801,11 +1258,14 @@ out_unlock: | |||
801 | return ret; | 1258 | return ret; |
802 | } | 1259 | } |
803 | 1260 | ||
804 | static noinline int btrfs_ioctl_snap_create(struct file *file, | 1261 | static noinline int btrfs_ioctl_snap_create_transid(struct file *file, |
805 | void __user *arg, int subvol) | 1262 | char *name, |
1263 | unsigned long fd, | ||
1264 | int subvol, | ||
1265 | u64 *transid, | ||
1266 | bool readonly) | ||
806 | { | 1267 | { |
807 | struct btrfs_root *root = BTRFS_I(fdentry(file)->d_inode)->root; | 1268 | struct btrfs_root *root = BTRFS_I(fdentry(file)->d_inode)->root; |
808 | struct btrfs_ioctl_vol_args *vol_args; | ||
809 | struct file *src_file; | 1269 | struct file *src_file; |
810 | int namelen; | 1270 | int namelen; |
811 | int ret = 0; | 1271 | int ret = 0; |
@@ -813,23 +1273,18 @@ static noinline int btrfs_ioctl_snap_create(struct file *file, | |||
813 | if (root->fs_info->sb->s_flags & MS_RDONLY) | 1273 | if (root->fs_info->sb->s_flags & MS_RDONLY) |
814 | return -EROFS; | 1274 | return -EROFS; |
815 | 1275 | ||
816 | vol_args = memdup_user(arg, sizeof(*vol_args)); | 1276 | namelen = strlen(name); |
817 | if (IS_ERR(vol_args)) | 1277 | if (strchr(name, '/')) { |
818 | return PTR_ERR(vol_args); | ||
819 | |||
820 | vol_args->name[BTRFS_PATH_NAME_MAX] = '\0'; | ||
821 | namelen = strlen(vol_args->name); | ||
822 | if (strchr(vol_args->name, '/')) { | ||
823 | ret = -EINVAL; | 1278 | ret = -EINVAL; |
824 | goto out; | 1279 | goto out; |
825 | } | 1280 | } |
826 | 1281 | ||
827 | if (subvol) { | 1282 | if (subvol) { |
828 | ret = btrfs_mksubvol(&file->f_path, vol_args->name, namelen, | 1283 | ret = btrfs_mksubvol(&file->f_path, name, namelen, |
829 | NULL); | 1284 | NULL, transid, readonly); |
830 | } else { | 1285 | } else { |
831 | struct inode *src_inode; | 1286 | struct inode *src_inode; |
832 | src_file = fget(vol_args->fd); | 1287 | src_file = fget(fd); |
833 | if (!src_file) { | 1288 | if (!src_file) { |
834 | ret = -EINVAL; | 1289 | ret = -EINVAL; |
835 | goto out; | 1290 | goto out; |
@@ -843,15 +1298,155 @@ static noinline int btrfs_ioctl_snap_create(struct file *file, | |||
843 | fput(src_file); | 1298 | fput(src_file); |
844 | goto out; | 1299 | goto out; |
845 | } | 1300 | } |
846 | ret = btrfs_mksubvol(&file->f_path, vol_args->name, namelen, | 1301 | ret = btrfs_mksubvol(&file->f_path, name, namelen, |
847 | BTRFS_I(src_inode)->root); | 1302 | BTRFS_I(src_inode)->root, |
1303 | transid, readonly); | ||
848 | fput(src_file); | 1304 | fput(src_file); |
849 | } | 1305 | } |
850 | out: | 1306 | out: |
1307 | return ret; | ||
1308 | } | ||
1309 | |||
1310 | static noinline int btrfs_ioctl_snap_create(struct file *file, | ||
1311 | void __user *arg, int subvol) | ||
1312 | { | ||
1313 | struct btrfs_ioctl_vol_args *vol_args; | ||
1314 | int ret; | ||
1315 | |||
1316 | vol_args = memdup_user(arg, sizeof(*vol_args)); | ||
1317 | if (IS_ERR(vol_args)) | ||
1318 | return PTR_ERR(vol_args); | ||
1319 | vol_args->name[BTRFS_PATH_NAME_MAX] = '\0'; | ||
1320 | |||
1321 | ret = btrfs_ioctl_snap_create_transid(file, vol_args->name, | ||
1322 | vol_args->fd, subvol, | ||
1323 | NULL, false); | ||
1324 | |||
1325 | kfree(vol_args); | ||
1326 | return ret; | ||
1327 | } | ||
1328 | |||
1329 | static noinline int btrfs_ioctl_snap_create_v2(struct file *file, | ||
1330 | void __user *arg, int subvol) | ||
1331 | { | ||
1332 | struct btrfs_ioctl_vol_args_v2 *vol_args; | ||
1333 | int ret; | ||
1334 | u64 transid = 0; | ||
1335 | u64 *ptr = NULL; | ||
1336 | bool readonly = false; | ||
1337 | |||
1338 | vol_args = memdup_user(arg, sizeof(*vol_args)); | ||
1339 | if (IS_ERR(vol_args)) | ||
1340 | return PTR_ERR(vol_args); | ||
1341 | vol_args->name[BTRFS_SUBVOL_NAME_MAX] = '\0'; | ||
1342 | |||
1343 | if (vol_args->flags & | ||
1344 | ~(BTRFS_SUBVOL_CREATE_ASYNC | BTRFS_SUBVOL_RDONLY)) { | ||
1345 | ret = -EOPNOTSUPP; | ||
1346 | goto out; | ||
1347 | } | ||
1348 | |||
1349 | if (vol_args->flags & BTRFS_SUBVOL_CREATE_ASYNC) | ||
1350 | ptr = &transid; | ||
1351 | if (vol_args->flags & BTRFS_SUBVOL_RDONLY) | ||
1352 | readonly = true; | ||
1353 | |||
1354 | ret = btrfs_ioctl_snap_create_transid(file, vol_args->name, | ||
1355 | vol_args->fd, subvol, | ||
1356 | ptr, readonly); | ||
1357 | |||
1358 | if (ret == 0 && ptr && | ||
1359 | copy_to_user(arg + | ||
1360 | offsetof(struct btrfs_ioctl_vol_args_v2, | ||
1361 | transid), ptr, sizeof(*ptr))) | ||
1362 | ret = -EFAULT; | ||
1363 | out: | ||
851 | kfree(vol_args); | 1364 | kfree(vol_args); |
852 | return ret; | 1365 | return ret; |
853 | } | 1366 | } |
854 | 1367 | ||
1368 | static noinline int btrfs_ioctl_subvol_getflags(struct file *file, | ||
1369 | void __user *arg) | ||
1370 | { | ||
1371 | struct inode *inode = fdentry(file)->d_inode; | ||
1372 | struct btrfs_root *root = BTRFS_I(inode)->root; | ||
1373 | int ret = 0; | ||
1374 | u64 flags = 0; | ||
1375 | |||
1376 | if (btrfs_ino(inode) != BTRFS_FIRST_FREE_OBJECTID) | ||
1377 | return -EINVAL; | ||
1378 | |||
1379 | down_read(&root->fs_info->subvol_sem); | ||
1380 | if (btrfs_root_readonly(root)) | ||
1381 | flags |= BTRFS_SUBVOL_RDONLY; | ||
1382 | up_read(&root->fs_info->subvol_sem); | ||
1383 | |||
1384 | if (copy_to_user(arg, &flags, sizeof(flags))) | ||
1385 | ret = -EFAULT; | ||
1386 | |||
1387 | return ret; | ||
1388 | } | ||
1389 | |||
1390 | static noinline int btrfs_ioctl_subvol_setflags(struct file *file, | ||
1391 | void __user *arg) | ||
1392 | { | ||
1393 | struct inode *inode = fdentry(file)->d_inode; | ||
1394 | struct btrfs_root *root = BTRFS_I(inode)->root; | ||
1395 | struct btrfs_trans_handle *trans; | ||
1396 | u64 root_flags; | ||
1397 | u64 flags; | ||
1398 | int ret = 0; | ||
1399 | |||
1400 | if (root->fs_info->sb->s_flags & MS_RDONLY) | ||
1401 | return -EROFS; | ||
1402 | |||
1403 | if (btrfs_ino(inode) != BTRFS_FIRST_FREE_OBJECTID) | ||
1404 | return -EINVAL; | ||
1405 | |||
1406 | if (copy_from_user(&flags, arg, sizeof(flags))) | ||
1407 | return -EFAULT; | ||
1408 | |||
1409 | if (flags & BTRFS_SUBVOL_CREATE_ASYNC) | ||
1410 | return -EINVAL; | ||
1411 | |||
1412 | if (flags & ~BTRFS_SUBVOL_RDONLY) | ||
1413 | return -EOPNOTSUPP; | ||
1414 | |||
1415 | if (!inode_owner_or_capable(inode)) | ||
1416 | return -EACCES; | ||
1417 | |||
1418 | down_write(&root->fs_info->subvol_sem); | ||
1419 | |||
1420 | /* nothing to do */ | ||
1421 | if (!!(flags & BTRFS_SUBVOL_RDONLY) == btrfs_root_readonly(root)) | ||
1422 | goto out; | ||
1423 | |||
1424 | root_flags = btrfs_root_flags(&root->root_item); | ||
1425 | if (flags & BTRFS_SUBVOL_RDONLY) | ||
1426 | btrfs_set_root_flags(&root->root_item, | ||
1427 | root_flags | BTRFS_ROOT_SUBVOL_RDONLY); | ||
1428 | else | ||
1429 | btrfs_set_root_flags(&root->root_item, | ||
1430 | root_flags & ~BTRFS_ROOT_SUBVOL_RDONLY); | ||
1431 | |||
1432 | trans = btrfs_start_transaction(root, 1); | ||
1433 | if (IS_ERR(trans)) { | ||
1434 | ret = PTR_ERR(trans); | ||
1435 | goto out_reset; | ||
1436 | } | ||
1437 | |||
1438 | ret = btrfs_update_root(trans, root->fs_info->tree_root, | ||
1439 | &root->root_key, &root->root_item); | ||
1440 | |||
1441 | btrfs_commit_transaction(trans, root); | ||
1442 | out_reset: | ||
1443 | if (ret) | ||
1444 | btrfs_set_root_flags(&root->root_item, root_flags); | ||
1445 | out: | ||
1446 | up_write(&root->fs_info->subvol_sem); | ||
1447 | return ret; | ||
1448 | } | ||
1449 | |||
855 | /* | 1450 | /* |
856 | * helper to check if the subvolume references other subvolumes | 1451 | * helper to check if the subvolume references other subvolumes |
857 | */ | 1452 | */ |
@@ -928,7 +1523,6 @@ static noinline int copy_to_sk(struct btrfs_root *root, | |||
928 | int nritems; | 1523 | int nritems; |
929 | int i; | 1524 | int i; |
930 | int slot; | 1525 | int slot; |
931 | int found = 0; | ||
932 | int ret = 0; | 1526 | int ret = 0; |
933 | 1527 | ||
934 | leaf = path->nodes[0]; | 1528 | leaf = path->nodes[0]; |
@@ -975,7 +1569,7 @@ static noinline int copy_to_sk(struct btrfs_root *root, | |||
975 | item_off, item_len); | 1569 | item_off, item_len); |
976 | *sk_offset += item_len; | 1570 | *sk_offset += item_len; |
977 | } | 1571 | } |
978 | found++; | 1572 | (*num_found)++; |
979 | 1573 | ||
980 | if (*num_found >= sk->nr_items) | 1574 | if (*num_found >= sk->nr_items) |
981 | break; | 1575 | break; |
@@ -994,7 +1588,6 @@ advance_key: | |||
994 | } else | 1588 | } else |
995 | ret = 1; | 1589 | ret = 1; |
996 | overflow: | 1590 | overflow: |
997 | *num_found += found; | ||
998 | return ret; | 1591 | return ret; |
999 | } | 1592 | } |
1000 | 1593 | ||
@@ -1051,7 +1644,7 @@ static noinline int search_ioctl(struct inode *inode, | |||
1051 | } | 1644 | } |
1052 | ret = copy_to_sk(root, path, &key, sk, args->buf, | 1645 | ret = copy_to_sk(root, path, &key, sk, args->buf, |
1053 | &sk_offset, &num_found); | 1646 | &sk_offset, &num_found); |
1054 | btrfs_release_path(root, path); | 1647 | btrfs_release_path(path); |
1055 | if (ret || num_found >= sk->nr_items) | 1648 | if (ret || num_found >= sk->nr_items) |
1056 | break; | 1649 | break; |
1057 | 1650 | ||
@@ -1073,14 +1666,10 @@ static noinline int btrfs_ioctl_tree_search(struct file *file, | |||
1073 | if (!capable(CAP_SYS_ADMIN)) | 1666 | if (!capable(CAP_SYS_ADMIN)) |
1074 | return -EPERM; | 1667 | return -EPERM; |
1075 | 1668 | ||
1076 | args = kmalloc(sizeof(*args), GFP_KERNEL); | 1669 | args = memdup_user(argp, sizeof(*args)); |
1077 | if (!args) | 1670 | if (IS_ERR(args)) |
1078 | return -ENOMEM; | 1671 | return PTR_ERR(args); |
1079 | 1672 | ||
1080 | if (copy_from_user(args, argp, sizeof(*args))) { | ||
1081 | kfree(args); | ||
1082 | return -EFAULT; | ||
1083 | } | ||
1084 | inode = fdentry(file)->d_inode; | 1673 | inode = fdentry(file)->d_inode; |
1085 | ret = search_ioctl(inode, args); | 1674 | ret = search_ioctl(inode, args); |
1086 | if (ret == 0 && copy_to_user(argp, args, sizeof(*args))) | 1675 | if (ret == 0 && copy_to_user(argp, args, sizeof(*args))) |
@@ -1162,7 +1751,7 @@ static noinline int btrfs_search_path_in_tree(struct btrfs_fs_info *info, | |||
1162 | if (key.offset == BTRFS_FIRST_FREE_OBJECTID) | 1751 | if (key.offset == BTRFS_FIRST_FREE_OBJECTID) |
1163 | break; | 1752 | break; |
1164 | 1753 | ||
1165 | btrfs_release_path(root, path); | 1754 | btrfs_release_path(path); |
1166 | key.objectid = key.offset; | 1755 | key.objectid = key.offset; |
1167 | key.offset = (u64)-1; | 1756 | key.offset = (u64)-1; |
1168 | dirid = key.objectid; | 1757 | dirid = key.objectid; |
@@ -1188,14 +1777,10 @@ static noinline int btrfs_ioctl_ino_lookup(struct file *file, | |||
1188 | if (!capable(CAP_SYS_ADMIN)) | 1777 | if (!capable(CAP_SYS_ADMIN)) |
1189 | return -EPERM; | 1778 | return -EPERM; |
1190 | 1779 | ||
1191 | args = kmalloc(sizeof(*args), GFP_KERNEL); | 1780 | args = memdup_user(argp, sizeof(*args)); |
1192 | if (!args) | 1781 | if (IS_ERR(args)) |
1193 | return -ENOMEM; | 1782 | return PTR_ERR(args); |
1194 | 1783 | ||
1195 | if (copy_from_user(args, argp, sizeof(*args))) { | ||
1196 | kfree(args); | ||
1197 | return -EFAULT; | ||
1198 | } | ||
1199 | inode = fdentry(file)->d_inode; | 1784 | inode = fdentry(file)->d_inode; |
1200 | 1785 | ||
1201 | if (args->treeid == 0) | 1786 | if (args->treeid == 0) |
@@ -1227,9 +1812,6 @@ static noinline int btrfs_ioctl_snap_destroy(struct file *file, | |||
1227 | int ret; | 1812 | int ret; |
1228 | int err = 0; | 1813 | int err = 0; |
1229 | 1814 | ||
1230 | if (!capable(CAP_SYS_ADMIN)) | ||
1231 | return -EPERM; | ||
1232 | |||
1233 | vol_args = memdup_user(arg, sizeof(*vol_args)); | 1815 | vol_args = memdup_user(arg, sizeof(*vol_args)); |
1234 | if (IS_ERR(vol_args)) | 1816 | if (IS_ERR(vol_args)) |
1235 | return PTR_ERR(vol_args); | 1817 | return PTR_ERR(vol_args); |
@@ -1259,12 +1841,50 @@ static noinline int btrfs_ioctl_snap_destroy(struct file *file, | |||
1259 | } | 1841 | } |
1260 | 1842 | ||
1261 | inode = dentry->d_inode; | 1843 | inode = dentry->d_inode; |
1262 | if (inode->i_ino != BTRFS_FIRST_FREE_OBJECTID) { | 1844 | dest = BTRFS_I(inode)->root; |
1845 | if (!capable(CAP_SYS_ADMIN)){ | ||
1846 | /* | ||
1847 | * Regular user. Only allow this with a special mount | ||
1848 | * option, when the user has write+exec access to the | ||
1849 | * subvol root, and when rmdir(2) would have been | ||
1850 | * allowed. | ||
1851 | * | ||
1852 | * Note that this is _not_ check that the subvol is | ||
1853 | * empty or doesn't contain data that we wouldn't | ||
1854 | * otherwise be able to delete. | ||
1855 | * | ||
1856 | * Users who want to delete empty subvols should try | ||
1857 | * rmdir(2). | ||
1858 | */ | ||
1859 | err = -EPERM; | ||
1860 | if (!btrfs_test_opt(root, USER_SUBVOL_RM_ALLOWED)) | ||
1861 | goto out_dput; | ||
1862 | |||
1863 | /* | ||
1864 | * Do not allow deletion if the parent dir is the same | ||
1865 | * as the dir to be deleted. That means the ioctl | ||
1866 | * must be called on the dentry referencing the root | ||
1867 | * of the subvol, not a random directory contained | ||
1868 | * within it. | ||
1869 | */ | ||
1263 | err = -EINVAL; | 1870 | err = -EINVAL; |
1264 | goto out_dput; | 1871 | if (root == dest) |
1872 | goto out_dput; | ||
1873 | |||
1874 | err = inode_permission(inode, MAY_WRITE | MAY_EXEC); | ||
1875 | if (err) | ||
1876 | goto out_dput; | ||
1877 | |||
1878 | /* check if subvolume may be deleted by a non-root user */ | ||
1879 | err = btrfs_may_delete(dir, dentry, 1); | ||
1880 | if (err) | ||
1881 | goto out_dput; | ||
1265 | } | 1882 | } |
1266 | 1883 | ||
1267 | dest = BTRFS_I(inode)->root; | 1884 | if (btrfs_ino(inode) != BTRFS_FIRST_FREE_OBJECTID) { |
1885 | err = -EINVAL; | ||
1886 | goto out_dput; | ||
1887 | } | ||
1268 | 1888 | ||
1269 | mutex_lock(&inode->i_mutex); | 1889 | mutex_lock(&inode->i_mutex); |
1270 | err = d_invalidate(dentry); | 1890 | err = d_invalidate(dentry); |
@@ -1304,7 +1924,7 @@ static noinline int btrfs_ioctl_snap_destroy(struct file *file, | |||
1304 | BUG_ON(ret); | 1924 | BUG_ON(ret); |
1305 | } | 1925 | } |
1306 | 1926 | ||
1307 | ret = btrfs_commit_transaction(trans, root); | 1927 | ret = btrfs_end_transaction(trans, root); |
1308 | BUG_ON(ret); | 1928 | BUG_ON(ret); |
1309 | inode->i_flags |= S_DEAD; | 1929 | inode->i_flags |= S_DEAD; |
1310 | out_up_write: | 1930 | out_up_write: |
@@ -1333,6 +1953,9 @@ static int btrfs_ioctl_defrag(struct file *file, void __user *argp) | |||
1333 | struct btrfs_ioctl_defrag_range_args *range; | 1953 | struct btrfs_ioctl_defrag_range_args *range; |
1334 | int ret; | 1954 | int ret; |
1335 | 1955 | ||
1956 | if (btrfs_root_readonly(root)) | ||
1957 | return -EROFS; | ||
1958 | |||
1336 | ret = mnt_want_write(file->f_path.mnt); | 1959 | ret = mnt_want_write(file->f_path.mnt); |
1337 | if (ret) | 1960 | if (ret) |
1338 | return ret; | 1961 | return ret; |
@@ -1376,7 +1999,10 @@ static int btrfs_ioctl_defrag(struct file *file, void __user *argp) | |||
1376 | /* the rest are all set to zero by kzalloc */ | 1999 | /* the rest are all set to zero by kzalloc */ |
1377 | range->len = (u64)-1; | 2000 | range->len = (u64)-1; |
1378 | } | 2001 | } |
1379 | ret = btrfs_defrag_file(file, range); | 2002 | ret = btrfs_defrag_file(fdentry(file)->d_inode, file, |
2003 | range, 0, 0); | ||
2004 | if (ret > 0) | ||
2005 | ret = 0; | ||
1380 | kfree(range); | 2006 | kfree(range); |
1381 | break; | 2007 | break; |
1382 | default: | 2008 | default: |
@@ -1428,6 +2054,80 @@ static long btrfs_ioctl_rm_dev(struct btrfs_root *root, void __user *arg) | |||
1428 | return ret; | 2054 | return ret; |
1429 | } | 2055 | } |
1430 | 2056 | ||
2057 | static long btrfs_ioctl_fs_info(struct btrfs_root *root, void __user *arg) | ||
2058 | { | ||
2059 | struct btrfs_ioctl_fs_info_args *fi_args; | ||
2060 | struct btrfs_device *device; | ||
2061 | struct btrfs_device *next; | ||
2062 | struct btrfs_fs_devices *fs_devices = root->fs_info->fs_devices; | ||
2063 | int ret = 0; | ||
2064 | |||
2065 | if (!capable(CAP_SYS_ADMIN)) | ||
2066 | return -EPERM; | ||
2067 | |||
2068 | fi_args = kzalloc(sizeof(*fi_args), GFP_KERNEL); | ||
2069 | if (!fi_args) | ||
2070 | return -ENOMEM; | ||
2071 | |||
2072 | fi_args->num_devices = fs_devices->num_devices; | ||
2073 | memcpy(&fi_args->fsid, root->fs_info->fsid, sizeof(fi_args->fsid)); | ||
2074 | |||
2075 | mutex_lock(&fs_devices->device_list_mutex); | ||
2076 | list_for_each_entry_safe(device, next, &fs_devices->devices, dev_list) { | ||
2077 | if (device->devid > fi_args->max_id) | ||
2078 | fi_args->max_id = device->devid; | ||
2079 | } | ||
2080 | mutex_unlock(&fs_devices->device_list_mutex); | ||
2081 | |||
2082 | if (copy_to_user(arg, fi_args, sizeof(*fi_args))) | ||
2083 | ret = -EFAULT; | ||
2084 | |||
2085 | kfree(fi_args); | ||
2086 | return ret; | ||
2087 | } | ||
2088 | |||
2089 | static long btrfs_ioctl_dev_info(struct btrfs_root *root, void __user *arg) | ||
2090 | { | ||
2091 | struct btrfs_ioctl_dev_info_args *di_args; | ||
2092 | struct btrfs_device *dev; | ||
2093 | struct btrfs_fs_devices *fs_devices = root->fs_info->fs_devices; | ||
2094 | int ret = 0; | ||
2095 | char *s_uuid = NULL; | ||
2096 | char empty_uuid[BTRFS_UUID_SIZE] = {0}; | ||
2097 | |||
2098 | if (!capable(CAP_SYS_ADMIN)) | ||
2099 | return -EPERM; | ||
2100 | |||
2101 | di_args = memdup_user(arg, sizeof(*di_args)); | ||
2102 | if (IS_ERR(di_args)) | ||
2103 | return PTR_ERR(di_args); | ||
2104 | |||
2105 | if (memcmp(empty_uuid, di_args->uuid, BTRFS_UUID_SIZE) != 0) | ||
2106 | s_uuid = di_args->uuid; | ||
2107 | |||
2108 | mutex_lock(&fs_devices->device_list_mutex); | ||
2109 | dev = btrfs_find_device(root, di_args->devid, s_uuid, NULL); | ||
2110 | mutex_unlock(&fs_devices->device_list_mutex); | ||
2111 | |||
2112 | if (!dev) { | ||
2113 | ret = -ENODEV; | ||
2114 | goto out; | ||
2115 | } | ||
2116 | |||
2117 | di_args->devid = dev->devid; | ||
2118 | di_args->bytes_used = dev->bytes_used; | ||
2119 | di_args->total_bytes = dev->total_bytes; | ||
2120 | memcpy(di_args->uuid, dev->uuid, sizeof(di_args->uuid)); | ||
2121 | strncpy(di_args->path, dev->name, sizeof(di_args->path)); | ||
2122 | |||
2123 | out: | ||
2124 | if (ret == 0 && copy_to_user(arg, di_args, sizeof(*di_args))) | ||
2125 | ret = -EFAULT; | ||
2126 | |||
2127 | kfree(di_args); | ||
2128 | return ret; | ||
2129 | } | ||
2130 | |||
1431 | static noinline long btrfs_ioctl_clone(struct file *file, unsigned long srcfd, | 2131 | static noinline long btrfs_ioctl_clone(struct file *file, unsigned long srcfd, |
1432 | u64 off, u64 olen, u64 destoff) | 2132 | u64 off, u64 olen, u64 destoff) |
1433 | { | 2133 | { |
@@ -1461,6 +2161,9 @@ static noinline long btrfs_ioctl_clone(struct file *file, unsigned long srcfd, | |||
1461 | if (!(file->f_mode & FMODE_WRITE) || (file->f_flags & O_APPEND)) | 2161 | if (!(file->f_mode & FMODE_WRITE) || (file->f_flags & O_APPEND)) |
1462 | return -EINVAL; | 2162 | return -EINVAL; |
1463 | 2163 | ||
2164 | if (btrfs_root_readonly(root)) | ||
2165 | return -EROFS; | ||
2166 | |||
1464 | ret = mnt_want_write(file->f_path.mnt); | 2167 | ret = mnt_want_write(file->f_path.mnt); |
1465 | if (ret) | 2168 | if (ret) |
1466 | return ret; | 2169 | return ret; |
@@ -1502,11 +2205,11 @@ static noinline long btrfs_ioctl_clone(struct file *file, unsigned long srcfd, | |||
1502 | path->reada = 2; | 2205 | path->reada = 2; |
1503 | 2206 | ||
1504 | if (inode < src) { | 2207 | if (inode < src) { |
1505 | mutex_lock(&inode->i_mutex); | 2208 | mutex_lock_nested(&inode->i_mutex, I_MUTEX_PARENT); |
1506 | mutex_lock(&src->i_mutex); | 2209 | mutex_lock_nested(&src->i_mutex, I_MUTEX_CHILD); |
1507 | } else { | 2210 | } else { |
1508 | mutex_lock(&src->i_mutex); | 2211 | mutex_lock_nested(&src->i_mutex, I_MUTEX_PARENT); |
1509 | mutex_lock(&inode->i_mutex); | 2212 | mutex_lock_nested(&inode->i_mutex, I_MUTEX_CHILD); |
1510 | } | 2213 | } |
1511 | 2214 | ||
1512 | /* determine range to clone */ | 2215 | /* determine range to clone */ |
@@ -1517,12 +2220,11 @@ static noinline long btrfs_ioctl_clone(struct file *file, unsigned long srcfd, | |||
1517 | olen = len = src->i_size - off; | 2220 | olen = len = src->i_size - off; |
1518 | /* if we extend to eof, continue to block boundary */ | 2221 | /* if we extend to eof, continue to block boundary */ |
1519 | if (off + len == src->i_size) | 2222 | if (off + len == src->i_size) |
1520 | len = ((src->i_size + bs-1) & ~(bs-1)) | 2223 | len = ALIGN(src->i_size, bs) - off; |
1521 | - off; | ||
1522 | 2224 | ||
1523 | /* verify the end result is block aligned */ | 2225 | /* verify the end result is block aligned */ |
1524 | if ((off & (bs-1)) || | 2226 | if (!IS_ALIGNED(off, bs) || !IS_ALIGNED(off + len, bs) || |
1525 | ((off + len) & (bs-1))) | 2227 | !IS_ALIGNED(destoff, bs)) |
1526 | goto out_unlock; | 2228 | goto out_unlock; |
1527 | 2229 | ||
1528 | /* do any pending delalloc/csum calc on src, one way or | 2230 | /* do any pending delalloc/csum calc on src, one way or |
@@ -1530,17 +2232,19 @@ static noinline long btrfs_ioctl_clone(struct file *file, unsigned long srcfd, | |||
1530 | while (1) { | 2232 | while (1) { |
1531 | struct btrfs_ordered_extent *ordered; | 2233 | struct btrfs_ordered_extent *ordered; |
1532 | lock_extent(&BTRFS_I(src)->io_tree, off, off+len, GFP_NOFS); | 2234 | lock_extent(&BTRFS_I(src)->io_tree, off, off+len, GFP_NOFS); |
1533 | ordered = btrfs_lookup_first_ordered_extent(inode, off+len); | 2235 | ordered = btrfs_lookup_first_ordered_extent(src, off+len); |
1534 | if (BTRFS_I(src)->delalloc_bytes == 0 && !ordered) | 2236 | if (!ordered && |
2237 | !test_range_bit(&BTRFS_I(src)->io_tree, off, off+len, | ||
2238 | EXTENT_DELALLOC, 0, NULL)) | ||
1535 | break; | 2239 | break; |
1536 | unlock_extent(&BTRFS_I(src)->io_tree, off, off+len, GFP_NOFS); | 2240 | unlock_extent(&BTRFS_I(src)->io_tree, off, off+len, GFP_NOFS); |
1537 | if (ordered) | 2241 | if (ordered) |
1538 | btrfs_put_ordered_extent(ordered); | 2242 | btrfs_put_ordered_extent(ordered); |
1539 | btrfs_wait_ordered_range(src, off, off+len); | 2243 | btrfs_wait_ordered_range(src, off, len); |
1540 | } | 2244 | } |
1541 | 2245 | ||
1542 | /* clone data */ | 2246 | /* clone data */ |
1543 | key.objectid = src->i_ino; | 2247 | key.objectid = btrfs_ino(src); |
1544 | key.type = BTRFS_EXTENT_DATA_KEY; | 2248 | key.type = BTRFS_EXTENT_DATA_KEY; |
1545 | key.offset = 0; | 2249 | key.offset = 0; |
1546 | 2250 | ||
@@ -1567,7 +2271,7 @@ static noinline long btrfs_ioctl_clone(struct file *file, unsigned long srcfd, | |||
1567 | 2271 | ||
1568 | btrfs_item_key_to_cpu(leaf, &key, slot); | 2272 | btrfs_item_key_to_cpu(leaf, &key, slot); |
1569 | if (btrfs_key_type(&key) > BTRFS_EXTENT_DATA_KEY || | 2273 | if (btrfs_key_type(&key) > BTRFS_EXTENT_DATA_KEY || |
1570 | key.objectid != src->i_ino) | 2274 | key.objectid != btrfs_ino(src)) |
1571 | break; | 2275 | break; |
1572 | 2276 | ||
1573 | if (btrfs_key_type(&key) == BTRFS_EXTENT_DATA_KEY) { | 2277 | if (btrfs_key_type(&key) == BTRFS_EXTENT_DATA_KEY) { |
@@ -1603,15 +2307,18 @@ static noinline long btrfs_ioctl_clone(struct file *file, unsigned long srcfd, | |||
1603 | datal = btrfs_file_extent_ram_bytes(leaf, | 2307 | datal = btrfs_file_extent_ram_bytes(leaf, |
1604 | extent); | 2308 | extent); |
1605 | } | 2309 | } |
1606 | btrfs_release_path(root, path); | 2310 | btrfs_release_path(path); |
1607 | 2311 | ||
1608 | if (key.offset + datal < off || | 2312 | if (key.offset + datal <= off || |
1609 | key.offset >= off+len) | 2313 | key.offset >= off+len) |
1610 | goto next; | 2314 | goto next; |
1611 | 2315 | ||
1612 | memcpy(&new_key, &key, sizeof(new_key)); | 2316 | memcpy(&new_key, &key, sizeof(new_key)); |
1613 | new_key.objectid = inode->i_ino; | 2317 | new_key.objectid = btrfs_ino(inode); |
1614 | new_key.offset = key.offset + destoff - off; | 2318 | if (off <= key.offset) |
2319 | new_key.offset = key.offset + destoff - off; | ||
2320 | else | ||
2321 | new_key.offset = destoff; | ||
1615 | 2322 | ||
1616 | trans = btrfs_start_transaction(root, 1); | 2323 | trans = btrfs_start_transaction(root, 1); |
1617 | if (IS_ERR(trans)) { | 2324 | if (IS_ERR(trans)) { |
@@ -1661,7 +2368,7 @@ static noinline long btrfs_ioctl_clone(struct file *file, unsigned long srcfd, | |||
1661 | ret = btrfs_inc_extent_ref(trans, root, | 2368 | ret = btrfs_inc_extent_ref(trans, root, |
1662 | disko, diskl, 0, | 2369 | disko, diskl, 0, |
1663 | root->root_key.objectid, | 2370 | root->root_key.objectid, |
1664 | inode->i_ino, | 2371 | btrfs_ino(inode), |
1665 | new_key.offset - datao); | 2372 | new_key.offset - datao); |
1666 | BUG_ON(ret); | 2373 | BUG_ON(ret); |
1667 | } | 2374 | } |
@@ -1710,7 +2417,7 @@ static noinline long btrfs_ioctl_clone(struct file *file, unsigned long srcfd, | |||
1710 | } | 2417 | } |
1711 | 2418 | ||
1712 | btrfs_mark_buffer_dirty(leaf); | 2419 | btrfs_mark_buffer_dirty(leaf); |
1713 | btrfs_release_path(root, path); | 2420 | btrfs_release_path(path); |
1714 | 2421 | ||
1715 | inode->i_mtime = inode->i_ctime = CURRENT_TIME; | 2422 | inode->i_mtime = inode->i_ctime = CURRENT_TIME; |
1716 | 2423 | ||
@@ -1720,8 +2427,8 @@ static noinline long btrfs_ioctl_clone(struct file *file, unsigned long srcfd, | |||
1720 | * but shouldn't round up the file size | 2427 | * but shouldn't round up the file size |
1721 | */ | 2428 | */ |
1722 | endoff = new_key.offset + datal; | 2429 | endoff = new_key.offset + datal; |
1723 | if (endoff > off+olen) | 2430 | if (endoff > destoff+olen) |
1724 | endoff = off+olen; | 2431 | endoff = destoff+olen; |
1725 | if (endoff > inode->i_size) | 2432 | if (endoff > inode->i_size) |
1726 | btrfs_i_size_write(inode, endoff); | 2433 | btrfs_i_size_write(inode, endoff); |
1727 | 2434 | ||
@@ -1731,12 +2438,12 @@ static noinline long btrfs_ioctl_clone(struct file *file, unsigned long srcfd, | |||
1731 | btrfs_end_transaction(trans, root); | 2438 | btrfs_end_transaction(trans, root); |
1732 | } | 2439 | } |
1733 | next: | 2440 | next: |
1734 | btrfs_release_path(root, path); | 2441 | btrfs_release_path(path); |
1735 | key.offset++; | 2442 | key.offset++; |
1736 | } | 2443 | } |
1737 | ret = 0; | 2444 | ret = 0; |
1738 | out: | 2445 | out: |
1739 | btrfs_release_path(root, path); | 2446 | btrfs_release_path(path); |
1740 | unlock_extent(&BTRFS_I(src)->io_tree, off, off+len, GFP_NOFS); | 2447 | unlock_extent(&BTRFS_I(src)->io_tree, off, off+len, GFP_NOFS); |
1741 | out_unlock: | 2448 | out_unlock: |
1742 | mutex_unlock(&src->i_mutex); | 2449 | mutex_unlock(&src->i_mutex); |
@@ -1781,26 +2488,26 @@ static long btrfs_ioctl_trans_start(struct file *file) | |||
1781 | if (file->private_data) | 2488 | if (file->private_data) |
1782 | goto out; | 2489 | goto out; |
1783 | 2490 | ||
2491 | ret = -EROFS; | ||
2492 | if (btrfs_root_readonly(root)) | ||
2493 | goto out; | ||
2494 | |||
1784 | ret = mnt_want_write(file->f_path.mnt); | 2495 | ret = mnt_want_write(file->f_path.mnt); |
1785 | if (ret) | 2496 | if (ret) |
1786 | goto out; | 2497 | goto out; |
1787 | 2498 | ||
1788 | mutex_lock(&root->fs_info->trans_mutex); | 2499 | atomic_inc(&root->fs_info->open_ioctl_trans); |
1789 | root->fs_info->open_ioctl_trans++; | ||
1790 | mutex_unlock(&root->fs_info->trans_mutex); | ||
1791 | 2500 | ||
1792 | ret = -ENOMEM; | 2501 | ret = -ENOMEM; |
1793 | trans = btrfs_start_ioctl_transaction(root, 0); | 2502 | trans = btrfs_start_ioctl_transaction(root); |
1794 | if (!trans) | 2503 | if (IS_ERR(trans)) |
1795 | goto out_drop; | 2504 | goto out_drop; |
1796 | 2505 | ||
1797 | file->private_data = trans; | 2506 | file->private_data = trans; |
1798 | return 0; | 2507 | return 0; |
1799 | 2508 | ||
1800 | out_drop: | 2509 | out_drop: |
1801 | mutex_lock(&root->fs_info->trans_mutex); | 2510 | atomic_dec(&root->fs_info->open_ioctl_trans); |
1802 | root->fs_info->open_ioctl_trans--; | ||
1803 | mutex_unlock(&root->fs_info->trans_mutex); | ||
1804 | mnt_drop_write(file->f_path.mnt); | 2511 | mnt_drop_write(file->f_path.mnt); |
1805 | out: | 2512 | out: |
1806 | return ret; | 2513 | return ret; |
@@ -1847,9 +2554,9 @@ static long btrfs_ioctl_default_subvol(struct file *file, void __user *argp) | |||
1847 | path->leave_spinning = 1; | 2554 | path->leave_spinning = 1; |
1848 | 2555 | ||
1849 | trans = btrfs_start_transaction(root, 1); | 2556 | trans = btrfs_start_transaction(root, 1); |
1850 | if (!trans) { | 2557 | if (IS_ERR(trans)) { |
1851 | btrfs_free_path(path); | 2558 | btrfs_free_path(path); |
1852 | return -ENOMEM; | 2559 | return PTR_ERR(trans); |
1853 | } | 2560 | } |
1854 | 2561 | ||
1855 | dir_id = btrfs_super_root_dir(&root->fs_info->super_copy); | 2562 | dir_id = btrfs_super_root_dir(&root->fs_info->super_copy); |
@@ -1879,35 +2586,80 @@ static long btrfs_ioctl_default_subvol(struct file *file, void __user *argp) | |||
1879 | return 0; | 2586 | return 0; |
1880 | } | 2587 | } |
1881 | 2588 | ||
2589 | static void get_block_group_info(struct list_head *groups_list, | ||
2590 | struct btrfs_ioctl_space_info *space) | ||
2591 | { | ||
2592 | struct btrfs_block_group_cache *block_group; | ||
2593 | |||
2594 | space->total_bytes = 0; | ||
2595 | space->used_bytes = 0; | ||
2596 | space->flags = 0; | ||
2597 | list_for_each_entry(block_group, groups_list, list) { | ||
2598 | space->flags = block_group->flags; | ||
2599 | space->total_bytes += block_group->key.offset; | ||
2600 | space->used_bytes += | ||
2601 | btrfs_block_group_used(&block_group->item); | ||
2602 | } | ||
2603 | } | ||
2604 | |||
1882 | long btrfs_ioctl_space_info(struct btrfs_root *root, void __user *arg) | 2605 | long btrfs_ioctl_space_info(struct btrfs_root *root, void __user *arg) |
1883 | { | 2606 | { |
1884 | struct btrfs_ioctl_space_args space_args; | 2607 | struct btrfs_ioctl_space_args space_args; |
1885 | struct btrfs_ioctl_space_info space; | 2608 | struct btrfs_ioctl_space_info space; |
1886 | struct btrfs_ioctl_space_info *dest; | 2609 | struct btrfs_ioctl_space_info *dest; |
1887 | struct btrfs_ioctl_space_info *dest_orig; | 2610 | struct btrfs_ioctl_space_info *dest_orig; |
1888 | struct btrfs_ioctl_space_info *user_dest; | 2611 | struct btrfs_ioctl_space_info __user *user_dest; |
1889 | struct btrfs_space_info *info; | 2612 | struct btrfs_space_info *info; |
2613 | u64 types[] = {BTRFS_BLOCK_GROUP_DATA, | ||
2614 | BTRFS_BLOCK_GROUP_SYSTEM, | ||
2615 | BTRFS_BLOCK_GROUP_METADATA, | ||
2616 | BTRFS_BLOCK_GROUP_DATA | BTRFS_BLOCK_GROUP_METADATA}; | ||
2617 | int num_types = 4; | ||
1890 | int alloc_size; | 2618 | int alloc_size; |
1891 | int ret = 0; | 2619 | int ret = 0; |
1892 | int slot_count = 0; | 2620 | u64 slot_count = 0; |
2621 | int i, c; | ||
1893 | 2622 | ||
1894 | if (copy_from_user(&space_args, | 2623 | if (copy_from_user(&space_args, |
1895 | (struct btrfs_ioctl_space_args __user *)arg, | 2624 | (struct btrfs_ioctl_space_args __user *)arg, |
1896 | sizeof(space_args))) | 2625 | sizeof(space_args))) |
1897 | return -EFAULT; | 2626 | return -EFAULT; |
1898 | 2627 | ||
1899 | /* first we count slots */ | 2628 | for (i = 0; i < num_types; i++) { |
1900 | rcu_read_lock(); | 2629 | struct btrfs_space_info *tmp; |
1901 | list_for_each_entry_rcu(info, &root->fs_info->space_info, list) | 2630 | |
1902 | slot_count++; | 2631 | info = NULL; |
1903 | rcu_read_unlock(); | 2632 | rcu_read_lock(); |
2633 | list_for_each_entry_rcu(tmp, &root->fs_info->space_info, | ||
2634 | list) { | ||
2635 | if (tmp->flags == types[i]) { | ||
2636 | info = tmp; | ||
2637 | break; | ||
2638 | } | ||
2639 | } | ||
2640 | rcu_read_unlock(); | ||
2641 | |||
2642 | if (!info) | ||
2643 | continue; | ||
2644 | |||
2645 | down_read(&info->groups_sem); | ||
2646 | for (c = 0; c < BTRFS_NR_RAID_TYPES; c++) { | ||
2647 | if (!list_empty(&info->block_groups[c])) | ||
2648 | slot_count++; | ||
2649 | } | ||
2650 | up_read(&info->groups_sem); | ||
2651 | } | ||
1904 | 2652 | ||
1905 | /* space_slots == 0 means they are asking for a count */ | 2653 | /* space_slots == 0 means they are asking for a count */ |
1906 | if (space_args.space_slots == 0) { | 2654 | if (space_args.space_slots == 0) { |
1907 | space_args.total_spaces = slot_count; | 2655 | space_args.total_spaces = slot_count; |
1908 | goto out; | 2656 | goto out; |
1909 | } | 2657 | } |
2658 | |||
2659 | slot_count = min_t(u64, space_args.space_slots, slot_count); | ||
2660 | |||
1910 | alloc_size = sizeof(*dest) * slot_count; | 2661 | alloc_size = sizeof(*dest) * slot_count; |
2662 | |||
1911 | /* we generally have at most 6 or so space infos, one for each raid | 2663 | /* we generally have at most 6 or so space infos, one for each raid |
1912 | * level. So, a whole page should be more than enough for everyone | 2664 | * level. So, a whole page should be more than enough for everyone |
1913 | */ | 2665 | */ |
@@ -1921,27 +2673,40 @@ long btrfs_ioctl_space_info(struct btrfs_root *root, void __user *arg) | |||
1921 | dest_orig = dest; | 2673 | dest_orig = dest; |
1922 | 2674 | ||
1923 | /* now we have a buffer to copy into */ | 2675 | /* now we have a buffer to copy into */ |
1924 | rcu_read_lock(); | 2676 | for (i = 0; i < num_types; i++) { |
1925 | list_for_each_entry_rcu(info, &root->fs_info->space_info, list) { | 2677 | struct btrfs_space_info *tmp; |
1926 | /* make sure we don't copy more than we allocated | ||
1927 | * in our buffer | ||
1928 | */ | ||
1929 | if (slot_count == 0) | ||
1930 | break; | ||
1931 | slot_count--; | ||
1932 | 2678 | ||
1933 | /* make sure userland has enough room in their buffer */ | 2679 | if (!slot_count) |
1934 | if (space_args.total_spaces >= space_args.space_slots) | ||
1935 | break; | 2680 | break; |
1936 | 2681 | ||
1937 | space.flags = info->flags; | 2682 | info = NULL; |
1938 | space.total_bytes = info->total_bytes; | 2683 | rcu_read_lock(); |
1939 | space.used_bytes = info->bytes_used; | 2684 | list_for_each_entry_rcu(tmp, &root->fs_info->space_info, |
1940 | memcpy(dest, &space, sizeof(space)); | 2685 | list) { |
1941 | dest++; | 2686 | if (tmp->flags == types[i]) { |
1942 | space_args.total_spaces++; | 2687 | info = tmp; |
2688 | break; | ||
2689 | } | ||
2690 | } | ||
2691 | rcu_read_unlock(); | ||
2692 | |||
2693 | if (!info) | ||
2694 | continue; | ||
2695 | down_read(&info->groups_sem); | ||
2696 | for (c = 0; c < BTRFS_NR_RAID_TYPES; c++) { | ||
2697 | if (!list_empty(&info->block_groups[c])) { | ||
2698 | get_block_group_info(&info->block_groups[c], | ||
2699 | &space); | ||
2700 | memcpy(dest, &space, sizeof(space)); | ||
2701 | dest++; | ||
2702 | space_args.total_spaces++; | ||
2703 | slot_count--; | ||
2704 | } | ||
2705 | if (!slot_count) | ||
2706 | break; | ||
2707 | } | ||
2708 | up_read(&info->groups_sem); | ||
1943 | } | 2709 | } |
1944 | rcu_read_unlock(); | ||
1945 | 2710 | ||
1946 | user_dest = (struct btrfs_ioctl_space_info *) | 2711 | user_dest = (struct btrfs_ioctl_space_info *) |
1947 | (arg + sizeof(struct btrfs_ioctl_space_args)); | 2712 | (arg + sizeof(struct btrfs_ioctl_space_args)); |
@@ -1976,14 +2741,101 @@ long btrfs_ioctl_trans_end(struct file *file) | |||
1976 | 2741 | ||
1977 | btrfs_end_transaction(trans, root); | 2742 | btrfs_end_transaction(trans, root); |
1978 | 2743 | ||
1979 | mutex_lock(&root->fs_info->trans_mutex); | 2744 | atomic_dec(&root->fs_info->open_ioctl_trans); |
1980 | root->fs_info->open_ioctl_trans--; | ||
1981 | mutex_unlock(&root->fs_info->trans_mutex); | ||
1982 | 2745 | ||
1983 | mnt_drop_write(file->f_path.mnt); | 2746 | mnt_drop_write(file->f_path.mnt); |
1984 | return 0; | 2747 | return 0; |
1985 | } | 2748 | } |
1986 | 2749 | ||
2750 | static noinline long btrfs_ioctl_start_sync(struct file *file, void __user *argp) | ||
2751 | { | ||
2752 | struct btrfs_root *root = BTRFS_I(file->f_dentry->d_inode)->root; | ||
2753 | struct btrfs_trans_handle *trans; | ||
2754 | u64 transid; | ||
2755 | int ret; | ||
2756 | |||
2757 | trans = btrfs_start_transaction(root, 0); | ||
2758 | if (IS_ERR(trans)) | ||
2759 | return PTR_ERR(trans); | ||
2760 | transid = trans->transid; | ||
2761 | ret = btrfs_commit_transaction_async(trans, root, 0); | ||
2762 | if (ret) { | ||
2763 | btrfs_end_transaction(trans, root); | ||
2764 | return ret; | ||
2765 | } | ||
2766 | |||
2767 | if (argp) | ||
2768 | if (copy_to_user(argp, &transid, sizeof(transid))) | ||
2769 | return -EFAULT; | ||
2770 | return 0; | ||
2771 | } | ||
2772 | |||
2773 | static noinline long btrfs_ioctl_wait_sync(struct file *file, void __user *argp) | ||
2774 | { | ||
2775 | struct btrfs_root *root = BTRFS_I(file->f_dentry->d_inode)->root; | ||
2776 | u64 transid; | ||
2777 | |||
2778 | if (argp) { | ||
2779 | if (copy_from_user(&transid, argp, sizeof(transid))) | ||
2780 | return -EFAULT; | ||
2781 | } else { | ||
2782 | transid = 0; /* current trans */ | ||
2783 | } | ||
2784 | return btrfs_wait_for_commit(root, transid); | ||
2785 | } | ||
2786 | |||
2787 | static long btrfs_ioctl_scrub(struct btrfs_root *root, void __user *arg) | ||
2788 | { | ||
2789 | int ret; | ||
2790 | struct btrfs_ioctl_scrub_args *sa; | ||
2791 | |||
2792 | if (!capable(CAP_SYS_ADMIN)) | ||
2793 | return -EPERM; | ||
2794 | |||
2795 | sa = memdup_user(arg, sizeof(*sa)); | ||
2796 | if (IS_ERR(sa)) | ||
2797 | return PTR_ERR(sa); | ||
2798 | |||
2799 | ret = btrfs_scrub_dev(root, sa->devid, sa->start, sa->end, | ||
2800 | &sa->progress, sa->flags & BTRFS_SCRUB_READONLY); | ||
2801 | |||
2802 | if (copy_to_user(arg, sa, sizeof(*sa))) | ||
2803 | ret = -EFAULT; | ||
2804 | |||
2805 | kfree(sa); | ||
2806 | return ret; | ||
2807 | } | ||
2808 | |||
2809 | static long btrfs_ioctl_scrub_cancel(struct btrfs_root *root, void __user *arg) | ||
2810 | { | ||
2811 | if (!capable(CAP_SYS_ADMIN)) | ||
2812 | return -EPERM; | ||
2813 | |||
2814 | return btrfs_scrub_cancel(root); | ||
2815 | } | ||
2816 | |||
2817 | static long btrfs_ioctl_scrub_progress(struct btrfs_root *root, | ||
2818 | void __user *arg) | ||
2819 | { | ||
2820 | struct btrfs_ioctl_scrub_args *sa; | ||
2821 | int ret; | ||
2822 | |||
2823 | if (!capable(CAP_SYS_ADMIN)) | ||
2824 | return -EPERM; | ||
2825 | |||
2826 | sa = memdup_user(arg, sizeof(*sa)); | ||
2827 | if (IS_ERR(sa)) | ||
2828 | return PTR_ERR(sa); | ||
2829 | |||
2830 | ret = btrfs_scrub_progress(root, sa->devid, &sa->progress); | ||
2831 | |||
2832 | if (copy_to_user(arg, sa, sizeof(*sa))) | ||
2833 | ret = -EFAULT; | ||
2834 | |||
2835 | kfree(sa); | ||
2836 | return ret; | ||
2837 | } | ||
2838 | |||
1987 | long btrfs_ioctl(struct file *file, unsigned int | 2839 | long btrfs_ioctl(struct file *file, unsigned int |
1988 | cmd, unsigned long arg) | 2840 | cmd, unsigned long arg) |
1989 | { | 2841 | { |
@@ -1997,12 +2849,20 @@ long btrfs_ioctl(struct file *file, unsigned int | |||
1997 | return btrfs_ioctl_setflags(file, argp); | 2849 | return btrfs_ioctl_setflags(file, argp); |
1998 | case FS_IOC_GETVERSION: | 2850 | case FS_IOC_GETVERSION: |
1999 | return btrfs_ioctl_getversion(file, argp); | 2851 | return btrfs_ioctl_getversion(file, argp); |
2852 | case FITRIM: | ||
2853 | return btrfs_ioctl_fitrim(file, argp); | ||
2000 | case BTRFS_IOC_SNAP_CREATE: | 2854 | case BTRFS_IOC_SNAP_CREATE: |
2001 | return btrfs_ioctl_snap_create(file, argp, 0); | 2855 | return btrfs_ioctl_snap_create(file, argp, 0); |
2856 | case BTRFS_IOC_SNAP_CREATE_V2: | ||
2857 | return btrfs_ioctl_snap_create_v2(file, argp, 0); | ||
2002 | case BTRFS_IOC_SUBVOL_CREATE: | 2858 | case BTRFS_IOC_SUBVOL_CREATE: |
2003 | return btrfs_ioctl_snap_create(file, argp, 1); | 2859 | return btrfs_ioctl_snap_create(file, argp, 1); |
2004 | case BTRFS_IOC_SNAP_DESTROY: | 2860 | case BTRFS_IOC_SNAP_DESTROY: |
2005 | return btrfs_ioctl_snap_destroy(file, argp); | 2861 | return btrfs_ioctl_snap_destroy(file, argp); |
2862 | case BTRFS_IOC_SUBVOL_GETFLAGS: | ||
2863 | return btrfs_ioctl_subvol_getflags(file, argp); | ||
2864 | case BTRFS_IOC_SUBVOL_SETFLAGS: | ||
2865 | return btrfs_ioctl_subvol_setflags(file, argp); | ||
2006 | case BTRFS_IOC_DEFAULT_SUBVOL: | 2866 | case BTRFS_IOC_DEFAULT_SUBVOL: |
2007 | return btrfs_ioctl_default_subvol(file, argp); | 2867 | return btrfs_ioctl_default_subvol(file, argp); |
2008 | case BTRFS_IOC_DEFRAG: | 2868 | case BTRFS_IOC_DEFRAG: |
@@ -2015,6 +2875,10 @@ long btrfs_ioctl(struct file *file, unsigned int | |||
2015 | return btrfs_ioctl_add_dev(root, argp); | 2875 | return btrfs_ioctl_add_dev(root, argp); |
2016 | case BTRFS_IOC_RM_DEV: | 2876 | case BTRFS_IOC_RM_DEV: |
2017 | return btrfs_ioctl_rm_dev(root, argp); | 2877 | return btrfs_ioctl_rm_dev(root, argp); |
2878 | case BTRFS_IOC_FS_INFO: | ||
2879 | return btrfs_ioctl_fs_info(root, argp); | ||
2880 | case BTRFS_IOC_DEV_INFO: | ||
2881 | return btrfs_ioctl_dev_info(root, argp); | ||
2018 | case BTRFS_IOC_BALANCE: | 2882 | case BTRFS_IOC_BALANCE: |
2019 | return btrfs_balance(root->fs_info->dev_root); | 2883 | return btrfs_balance(root->fs_info->dev_root); |
2020 | case BTRFS_IOC_CLONE: | 2884 | case BTRFS_IOC_CLONE: |
@@ -2034,6 +2898,16 @@ long btrfs_ioctl(struct file *file, unsigned int | |||
2034 | case BTRFS_IOC_SYNC: | 2898 | case BTRFS_IOC_SYNC: |
2035 | btrfs_sync_fs(file->f_dentry->d_sb, 1); | 2899 | btrfs_sync_fs(file->f_dentry->d_sb, 1); |
2036 | return 0; | 2900 | return 0; |
2901 | case BTRFS_IOC_START_SYNC: | ||
2902 | return btrfs_ioctl_start_sync(file, argp); | ||
2903 | case BTRFS_IOC_WAIT_SYNC: | ||
2904 | return btrfs_ioctl_wait_sync(file, argp); | ||
2905 | case BTRFS_IOC_SCRUB: | ||
2906 | return btrfs_ioctl_scrub(root, argp); | ||
2907 | case BTRFS_IOC_SCRUB_CANCEL: | ||
2908 | return btrfs_ioctl_scrub_cancel(root, argp); | ||
2909 | case BTRFS_IOC_SCRUB_PROGRESS: | ||
2910 | return btrfs_ioctl_scrub_progress(root, argp); | ||
2037 | } | 2911 | } |
2038 | 2912 | ||
2039 | return -ENOTTY; | 2913 | return -ENOTTY; |