btrfs: user proper type for btrfs_mask_flags flags
[sfrench/cifs-2.6.git] / fs / btrfs / ioctl.c
1 /*
2  * Copyright (C) 2007 Oracle.  All rights reserved.
3  *
4  * This program is free software; you can redistribute it and/or
5  * modify it under the terms of the GNU General Public
6  * License v2 as published by the Free Software Foundation.
7  *
8  * This program is distributed in the hope that it will be useful,
9  * but WITHOUT ANY WARRANTY; without even the implied warranty of
10  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
11  * General Public License for more details.
12  *
13  * You should have received a copy of the GNU General Public
14  * License along with this program; if not, write to the
15  * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
16  * Boston, MA 021110-1307, USA.
17  */
18
19 #include <linux/kernel.h>
20 #include <linux/bio.h>
21 #include <linux/buffer_head.h>
22 #include <linux/file.h>
23 #include <linux/fs.h>
24 #include <linux/fsnotify.h>
25 #include <linux/pagemap.h>
26 #include <linux/highmem.h>
27 #include <linux/time.h>
28 #include <linux/init.h>
29 #include <linux/string.h>
30 #include <linux/backing-dev.h>
31 #include <linux/mount.h>
32 #include <linux/mpage.h>
33 #include <linux/namei.h>
34 #include <linux/swap.h>
35 #include <linux/writeback.h>
36 #include <linux/compat.h>
37 #include <linux/bit_spinlock.h>
38 #include <linux/security.h>
39 #include <linux/xattr.h>
40 #include <linux/mm.h>
41 #include <linux/slab.h>
42 #include <linux/blkdev.h>
43 #include <linux/uuid.h>
44 #include <linux/btrfs.h>
45 #include <linux/uaccess.h>
46 #include <linux/iversion.h>
47 #include "ctree.h"
48 #include "disk-io.h"
49 #include "transaction.h"
50 #include "btrfs_inode.h"
51 #include "print-tree.h"
52 #include "volumes.h"
53 #include "locking.h"
54 #include "inode-map.h"
55 #include "backref.h"
56 #include "rcu-string.h"
57 #include "send.h"
58 #include "dev-replace.h"
59 #include "props.h"
60 #include "sysfs.h"
61 #include "qgroup.h"
62 #include "tree-log.h"
63 #include "compression.h"
64
65 #ifdef CONFIG_64BIT
66 /* If we have a 32-bit userspace and 64-bit kernel, then the UAPI
67  * structures are incorrect, as the timespec structure from userspace
68  * is 4 bytes too small. We define these alternatives here to teach
69  * the kernel about the 32-bit struct packing.
70  */
71 struct btrfs_ioctl_timespec_32 {
72         __u64 sec;
73         __u32 nsec;
74 } __attribute__ ((__packed__));
75
76 struct btrfs_ioctl_received_subvol_args_32 {
77         char    uuid[BTRFS_UUID_SIZE];  /* in */
78         __u64   stransid;               /* in */
79         __u64   rtransid;               /* out */
80         struct btrfs_ioctl_timespec_32 stime; /* in */
81         struct btrfs_ioctl_timespec_32 rtime; /* out */
82         __u64   flags;                  /* in */
83         __u64   reserved[16];           /* in */
84 } __attribute__ ((__packed__));
85
86 #define BTRFS_IOC_SET_RECEIVED_SUBVOL_32 _IOWR(BTRFS_IOCTL_MAGIC, 37, \
87                                 struct btrfs_ioctl_received_subvol_args_32)
88 #endif
89
90 #if defined(CONFIG_64BIT) && defined(CONFIG_COMPAT)
91 struct btrfs_ioctl_send_args_32 {
92         __s64 send_fd;                  /* in */
93         __u64 clone_sources_count;      /* in */
94         compat_uptr_t clone_sources;    /* in */
95         __u64 parent_root;              /* in */
96         __u64 flags;                    /* in */
97         __u64 reserved[4];              /* in */
98 } __attribute__ ((__packed__));
99
100 #define BTRFS_IOC_SEND_32 _IOW(BTRFS_IOCTL_MAGIC, 38, \
101                                struct btrfs_ioctl_send_args_32)
102 #endif
103
104 static int btrfs_clone(struct inode *src, struct inode *inode,
105                        u64 off, u64 olen, u64 olen_aligned, u64 destoff,
106                        int no_time_update);
107
108 /* Mask out flags that are inappropriate for the given type of inode. */
109 static unsigned int btrfs_mask_flags(umode_t mode, unsigned int flags)
110 {
111         if (S_ISDIR(mode))
112                 return flags;
113         else if (S_ISREG(mode))
114                 return flags & ~FS_DIRSYNC_FL;
115         else
116                 return flags & (FS_NODUMP_FL | FS_NOATIME_FL);
117 }
118
119 /*
120  * Export inode flags to the format expected by the FS_IOC_GETFLAGS ioctl.
121  */
122 static unsigned int btrfs_flags_to_ioctl(unsigned int flags)
123 {
124         unsigned int iflags = 0;
125
126         if (flags & BTRFS_INODE_SYNC)
127                 iflags |= FS_SYNC_FL;
128         if (flags & BTRFS_INODE_IMMUTABLE)
129                 iflags |= FS_IMMUTABLE_FL;
130         if (flags & BTRFS_INODE_APPEND)
131                 iflags |= FS_APPEND_FL;
132         if (flags & BTRFS_INODE_NODUMP)
133                 iflags |= FS_NODUMP_FL;
134         if (flags & BTRFS_INODE_NOATIME)
135                 iflags |= FS_NOATIME_FL;
136         if (flags & BTRFS_INODE_DIRSYNC)
137                 iflags |= FS_DIRSYNC_FL;
138         if (flags & BTRFS_INODE_NODATACOW)
139                 iflags |= FS_NOCOW_FL;
140
141         if (flags & BTRFS_INODE_NOCOMPRESS)
142                 iflags |= FS_NOCOMP_FL;
143         else if (flags & BTRFS_INODE_COMPRESS)
144                 iflags |= FS_COMPR_FL;
145
146         return iflags;
147 }
148
149 /*
150  * Update inode->i_flags based on the btrfs internal flags.
151  */
152 void btrfs_update_iflags(struct inode *inode)
153 {
154         struct btrfs_inode *ip = BTRFS_I(inode);
155         unsigned int new_fl = 0;
156
157         if (ip->flags & BTRFS_INODE_SYNC)
158                 new_fl |= S_SYNC;
159         if (ip->flags & BTRFS_INODE_IMMUTABLE)
160                 new_fl |= S_IMMUTABLE;
161         if (ip->flags & BTRFS_INODE_APPEND)
162                 new_fl |= S_APPEND;
163         if (ip->flags & BTRFS_INODE_NOATIME)
164                 new_fl |= S_NOATIME;
165         if (ip->flags & BTRFS_INODE_DIRSYNC)
166                 new_fl |= S_DIRSYNC;
167
168         set_mask_bits(&inode->i_flags,
169                       S_SYNC | S_APPEND | S_IMMUTABLE | S_NOATIME | S_DIRSYNC,
170                       new_fl);
171 }
172
173 static int btrfs_ioctl_getflags(struct file *file, void __user *arg)
174 {
175         struct btrfs_inode *ip = BTRFS_I(file_inode(file));
176         unsigned int flags = btrfs_flags_to_ioctl(ip->flags);
177
178         if (copy_to_user(arg, &flags, sizeof(flags)))
179                 return -EFAULT;
180         return 0;
181 }
182
183 static int check_flags(unsigned int flags)
184 {
185         if (flags & ~(FS_IMMUTABLE_FL | FS_APPEND_FL | \
186                       FS_NOATIME_FL | FS_NODUMP_FL | \
187                       FS_SYNC_FL | FS_DIRSYNC_FL | \
188                       FS_NOCOMP_FL | FS_COMPR_FL |
189                       FS_NOCOW_FL))
190                 return -EOPNOTSUPP;
191
192         if ((flags & FS_NOCOMP_FL) && (flags & FS_COMPR_FL))
193                 return -EINVAL;
194
195         return 0;
196 }
197
198 static int btrfs_ioctl_setflags(struct file *file, void __user *arg)
199 {
200         struct inode *inode = file_inode(file);
201         struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
202         struct btrfs_inode *ip = BTRFS_I(inode);
203         struct btrfs_root *root = ip->root;
204         struct btrfs_trans_handle *trans;
205         unsigned int flags, oldflags;
206         int ret;
207         u64 ip_oldflags;
208         unsigned int i_oldflags;
209         umode_t mode;
210
211         if (!inode_owner_or_capable(inode))
212                 return -EPERM;
213
214         if (btrfs_root_readonly(root))
215                 return -EROFS;
216
217         if (copy_from_user(&flags, arg, sizeof(flags)))
218                 return -EFAULT;
219
220         ret = check_flags(flags);
221         if (ret)
222                 return ret;
223
224         ret = mnt_want_write_file(file);
225         if (ret)
226                 return ret;
227
228         inode_lock(inode);
229
230         ip_oldflags = ip->flags;
231         i_oldflags = inode->i_flags;
232         mode = inode->i_mode;
233
234         flags = btrfs_mask_flags(inode->i_mode, flags);
235         oldflags = btrfs_flags_to_ioctl(ip->flags);
236         if ((flags ^ oldflags) & (FS_APPEND_FL | FS_IMMUTABLE_FL)) {
237                 if (!capable(CAP_LINUX_IMMUTABLE)) {
238                         ret = -EPERM;
239                         goto out_unlock;
240                 }
241         }
242
243         if (flags & FS_SYNC_FL)
244                 ip->flags |= BTRFS_INODE_SYNC;
245         else
246                 ip->flags &= ~BTRFS_INODE_SYNC;
247         if (flags & FS_IMMUTABLE_FL)
248                 ip->flags |= BTRFS_INODE_IMMUTABLE;
249         else
250                 ip->flags &= ~BTRFS_INODE_IMMUTABLE;
251         if (flags & FS_APPEND_FL)
252                 ip->flags |= BTRFS_INODE_APPEND;
253         else
254                 ip->flags &= ~BTRFS_INODE_APPEND;
255         if (flags & FS_NODUMP_FL)
256                 ip->flags |= BTRFS_INODE_NODUMP;
257         else
258                 ip->flags &= ~BTRFS_INODE_NODUMP;
259         if (flags & FS_NOATIME_FL)
260                 ip->flags |= BTRFS_INODE_NOATIME;
261         else
262                 ip->flags &= ~BTRFS_INODE_NOATIME;
263         if (flags & FS_DIRSYNC_FL)
264                 ip->flags |= BTRFS_INODE_DIRSYNC;
265         else
266                 ip->flags &= ~BTRFS_INODE_DIRSYNC;
267         if (flags & FS_NOCOW_FL) {
268                 if (S_ISREG(mode)) {
269                         /*
270                          * It's safe to turn csums off here, no extents exist.
271                          * Otherwise we want the flag to reflect the real COW
272                          * status of the file and will not set it.
273                          */
274                         if (inode->i_size == 0)
275                                 ip->flags |= BTRFS_INODE_NODATACOW
276                                            | BTRFS_INODE_NODATASUM;
277                 } else {
278                         ip->flags |= BTRFS_INODE_NODATACOW;
279                 }
280         } else {
281                 /*
282                  * Revert back under same assumptions as above
283                  */
284                 if (S_ISREG(mode)) {
285                         if (inode->i_size == 0)
286                                 ip->flags &= ~(BTRFS_INODE_NODATACOW
287                                              | BTRFS_INODE_NODATASUM);
288                 } else {
289                         ip->flags &= ~BTRFS_INODE_NODATACOW;
290                 }
291         }
292
293         /*
294          * The COMPRESS flag can only be changed by users, while the NOCOMPRESS
295          * flag may be changed automatically if compression code won't make
296          * things smaller.
297          */
298         if (flags & FS_NOCOMP_FL) {
299                 ip->flags &= ~BTRFS_INODE_COMPRESS;
300                 ip->flags |= BTRFS_INODE_NOCOMPRESS;
301
302                 ret = btrfs_set_prop(inode, "btrfs.compression", NULL, 0, 0);
303                 if (ret && ret != -ENODATA)
304                         goto out_drop;
305         } else if (flags & FS_COMPR_FL) {
306                 const char *comp;
307
308                 ip->flags |= BTRFS_INODE_COMPRESS;
309                 ip->flags &= ~BTRFS_INODE_NOCOMPRESS;
310
311                 comp = btrfs_compress_type2str(fs_info->compress_type);
312                 if (!comp || comp[0] == 0)
313                         comp = btrfs_compress_type2str(BTRFS_COMPRESS_ZLIB);
314
315                 ret = btrfs_set_prop(inode, "btrfs.compression",
316                                      comp, strlen(comp), 0);
317                 if (ret)
318                         goto out_drop;
319
320         } else {
321                 ret = btrfs_set_prop(inode, "btrfs.compression", NULL, 0, 0);
322                 if (ret && ret != -ENODATA)
323                         goto out_drop;
324                 ip->flags &= ~(BTRFS_INODE_COMPRESS | BTRFS_INODE_NOCOMPRESS);
325         }
326
327         trans = btrfs_start_transaction(root, 1);
328         if (IS_ERR(trans)) {
329                 ret = PTR_ERR(trans);
330                 goto out_drop;
331         }
332
333         btrfs_update_iflags(inode);
334         inode_inc_iversion(inode);
335         inode->i_ctime = current_time(inode);
336         ret = btrfs_update_inode(trans, root, inode);
337
338         btrfs_end_transaction(trans);
339  out_drop:
340         if (ret) {
341                 ip->flags = ip_oldflags;
342                 inode->i_flags = i_oldflags;
343         }
344
345  out_unlock:
346         inode_unlock(inode);
347         mnt_drop_write_file(file);
348         return ret;
349 }
350
351 static int btrfs_ioctl_getversion(struct file *file, int __user *arg)
352 {
353         struct inode *inode = file_inode(file);
354
355         return put_user(inode->i_generation, arg);
356 }
357
358 static noinline int btrfs_ioctl_fitrim(struct file *file, void __user *arg)
359 {
360         struct inode *inode = file_inode(file);
361         struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
362         struct btrfs_device *device;
363         struct request_queue *q;
364         struct fstrim_range range;
365         u64 minlen = ULLONG_MAX;
366         u64 num_devices = 0;
367         u64 total_bytes = btrfs_super_total_bytes(fs_info->super_copy);
368         int ret;
369
370         if (!capable(CAP_SYS_ADMIN))
371                 return -EPERM;
372
373         rcu_read_lock();
374         list_for_each_entry_rcu(device, &fs_info->fs_devices->devices,
375                                 dev_list) {
376                 if (!device->bdev)
377                         continue;
378                 q = bdev_get_queue(device->bdev);
379                 if (blk_queue_discard(q)) {
380                         num_devices++;
381                         minlen = min_t(u64, q->limits.discard_granularity,
382                                      minlen);
383                 }
384         }
385         rcu_read_unlock();
386
387         if (!num_devices)
388                 return -EOPNOTSUPP;
389         if (copy_from_user(&range, arg, sizeof(range)))
390                 return -EFAULT;
391         if (range.start > total_bytes ||
392             range.len < fs_info->sb->s_blocksize)
393                 return -EINVAL;
394
395         range.len = min(range.len, total_bytes - range.start);
396         range.minlen = max(range.minlen, minlen);
397         ret = btrfs_trim_fs(fs_info, &range);
398         if (ret < 0)
399                 return ret;
400
401         if (copy_to_user(arg, &range, sizeof(range)))
402                 return -EFAULT;
403
404         return 0;
405 }
406
407 int btrfs_is_empty_uuid(u8 *uuid)
408 {
409         int i;
410
411         for (i = 0; i < BTRFS_UUID_SIZE; i++) {
412                 if (uuid[i])
413                         return 0;
414         }
415         return 1;
416 }
417
418 static noinline int create_subvol(struct inode *dir,
419                                   struct dentry *dentry,
420                                   const char *name, int namelen,
421                                   u64 *async_transid,
422                                   struct btrfs_qgroup_inherit *inherit)
423 {
424         struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb);
425         struct btrfs_trans_handle *trans;
426         struct btrfs_key key;
427         struct btrfs_root_item *root_item;
428         struct btrfs_inode_item *inode_item;
429         struct extent_buffer *leaf;
430         struct btrfs_root *root = BTRFS_I(dir)->root;
431         struct btrfs_root *new_root;
432         struct btrfs_block_rsv block_rsv;
433         struct timespec cur_time = current_time(dir);
434         struct inode *inode;
435         int ret;
436         int err;
437         u64 objectid;
438         u64 new_dirid = BTRFS_FIRST_FREE_OBJECTID;
439         u64 index = 0;
440         u64 qgroup_reserved;
441         uuid_le new_uuid;
442
443         root_item = kzalloc(sizeof(*root_item), GFP_KERNEL);
444         if (!root_item)
445                 return -ENOMEM;
446
447         ret = btrfs_find_free_objectid(fs_info->tree_root, &objectid);
448         if (ret)
449                 goto fail_free;
450
451         /*
452          * Don't create subvolume whose level is not zero. Or qgroup will be
453          * screwed up since it assumes subvolume qgroup's level to be 0.
454          */
455         if (btrfs_qgroup_level(objectid)) {
456                 ret = -ENOSPC;
457                 goto fail_free;
458         }
459
460         btrfs_init_block_rsv(&block_rsv, BTRFS_BLOCK_RSV_TEMP);
461         /*
462          * The same as the snapshot creation, please see the comment
463          * of create_snapshot().
464          */
465         ret = btrfs_subvolume_reserve_metadata(root, &block_rsv,
466                                                8, &qgroup_reserved, false);
467         if (ret)
468                 goto fail_free;
469
470         trans = btrfs_start_transaction(root, 0);
471         if (IS_ERR(trans)) {
472                 ret = PTR_ERR(trans);
473                 btrfs_subvolume_release_metadata(fs_info, &block_rsv);
474                 goto fail_free;
475         }
476         trans->block_rsv = &block_rsv;
477         trans->bytes_reserved = block_rsv.size;
478
479         ret = btrfs_qgroup_inherit(trans, fs_info, 0, objectid, inherit);
480         if (ret)
481                 goto fail;
482
483         leaf = btrfs_alloc_tree_block(trans, root, 0, objectid, NULL, 0, 0, 0);
484         if (IS_ERR(leaf)) {
485                 ret = PTR_ERR(leaf);
486                 goto fail;
487         }
488
489         memzero_extent_buffer(leaf, 0, sizeof(struct btrfs_header));
490         btrfs_set_header_bytenr(leaf, leaf->start);
491         btrfs_set_header_generation(leaf, trans->transid);
492         btrfs_set_header_backref_rev(leaf, BTRFS_MIXED_BACKREF_REV);
493         btrfs_set_header_owner(leaf, objectid);
494
495         write_extent_buffer_fsid(leaf, fs_info->fsid);
496         write_extent_buffer_chunk_tree_uuid(leaf, fs_info->chunk_tree_uuid);
497         btrfs_mark_buffer_dirty(leaf);
498
499         inode_item = &root_item->inode;
500         btrfs_set_stack_inode_generation(inode_item, 1);
501         btrfs_set_stack_inode_size(inode_item, 3);
502         btrfs_set_stack_inode_nlink(inode_item, 1);
503         btrfs_set_stack_inode_nbytes(inode_item,
504                                      fs_info->nodesize);
505         btrfs_set_stack_inode_mode(inode_item, S_IFDIR | 0755);
506
507         btrfs_set_root_flags(root_item, 0);
508         btrfs_set_root_limit(root_item, 0);
509         btrfs_set_stack_inode_flags(inode_item, BTRFS_INODE_ROOT_ITEM_INIT);
510
511         btrfs_set_root_bytenr(root_item, leaf->start);
512         btrfs_set_root_generation(root_item, trans->transid);
513         btrfs_set_root_level(root_item, 0);
514         btrfs_set_root_refs(root_item, 1);
515         btrfs_set_root_used(root_item, leaf->len);
516         btrfs_set_root_last_snapshot(root_item, 0);
517
518         btrfs_set_root_generation_v2(root_item,
519                         btrfs_root_generation(root_item));
520         uuid_le_gen(&new_uuid);
521         memcpy(root_item->uuid, new_uuid.b, BTRFS_UUID_SIZE);
522         btrfs_set_stack_timespec_sec(&root_item->otime, cur_time.tv_sec);
523         btrfs_set_stack_timespec_nsec(&root_item->otime, cur_time.tv_nsec);
524         root_item->ctime = root_item->otime;
525         btrfs_set_root_ctransid(root_item, trans->transid);
526         btrfs_set_root_otransid(root_item, trans->transid);
527
528         btrfs_tree_unlock(leaf);
529         free_extent_buffer(leaf);
530         leaf = NULL;
531
532         btrfs_set_root_dirid(root_item, new_dirid);
533
534         key.objectid = objectid;
535         key.offset = 0;
536         key.type = BTRFS_ROOT_ITEM_KEY;
537         ret = btrfs_insert_root(trans, fs_info->tree_root, &key,
538                                 root_item);
539         if (ret)
540                 goto fail;
541
542         key.offset = (u64)-1;
543         new_root = btrfs_read_fs_root_no_name(fs_info, &key);
544         if (IS_ERR(new_root)) {
545                 ret = PTR_ERR(new_root);
546                 btrfs_abort_transaction(trans, ret);
547                 goto fail;
548         }
549
550         btrfs_record_root_in_trans(trans, new_root);
551
552         ret = btrfs_create_subvol_root(trans, new_root, root, new_dirid);
553         if (ret) {
554                 /* We potentially lose an unused inode item here */
555                 btrfs_abort_transaction(trans, ret);
556                 goto fail;
557         }
558
559         mutex_lock(&new_root->objectid_mutex);
560         new_root->highest_objectid = new_dirid;
561         mutex_unlock(&new_root->objectid_mutex);
562
563         /*
564          * insert the directory item
565          */
566         ret = btrfs_set_inode_index(BTRFS_I(dir), &index);
567         if (ret) {
568                 btrfs_abort_transaction(trans, ret);
569                 goto fail;
570         }
571
572         ret = btrfs_insert_dir_item(trans, root,
573                                     name, namelen, BTRFS_I(dir), &key,
574                                     BTRFS_FT_DIR, index);
575         if (ret) {
576                 btrfs_abort_transaction(trans, ret);
577                 goto fail;
578         }
579
580         btrfs_i_size_write(BTRFS_I(dir), dir->i_size + namelen * 2);
581         ret = btrfs_update_inode(trans, root, dir);
582         BUG_ON(ret);
583
584         ret = btrfs_add_root_ref(trans, fs_info,
585                                  objectid, root->root_key.objectid,
586                                  btrfs_ino(BTRFS_I(dir)), index, name, namelen);
587         BUG_ON(ret);
588
589         ret = btrfs_uuid_tree_add(trans, fs_info, root_item->uuid,
590                                   BTRFS_UUID_KEY_SUBVOL, objectid);
591         if (ret)
592                 btrfs_abort_transaction(trans, ret);
593
594 fail:
595         kfree(root_item);
596         trans->block_rsv = NULL;
597         trans->bytes_reserved = 0;
598         btrfs_subvolume_release_metadata(fs_info, &block_rsv);
599
600         if (async_transid) {
601                 *async_transid = trans->transid;
602                 err = btrfs_commit_transaction_async(trans, 1);
603                 if (err)
604                         err = btrfs_commit_transaction(trans);
605         } else {
606                 err = btrfs_commit_transaction(trans);
607         }
608         if (err && !ret)
609                 ret = err;
610
611         if (!ret) {
612                 inode = btrfs_lookup_dentry(dir, dentry);
613                 if (IS_ERR(inode))
614                         return PTR_ERR(inode);
615                 d_instantiate(dentry, inode);
616         }
617         return ret;
618
619 fail_free:
620         kfree(root_item);
621         return ret;
622 }
623
624 static int create_snapshot(struct btrfs_root *root, struct inode *dir,
625                            struct dentry *dentry,
626                            u64 *async_transid, bool readonly,
627                            struct btrfs_qgroup_inherit *inherit)
628 {
629         struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb);
630         struct inode *inode;
631         struct btrfs_pending_snapshot *pending_snapshot;
632         struct btrfs_trans_handle *trans;
633         int ret;
634
635         if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state))
636                 return -EINVAL;
637
638         pending_snapshot = kzalloc(sizeof(*pending_snapshot), GFP_KERNEL);
639         if (!pending_snapshot)
640                 return -ENOMEM;
641
642         pending_snapshot->root_item = kzalloc(sizeof(struct btrfs_root_item),
643                         GFP_KERNEL);
644         pending_snapshot->path = btrfs_alloc_path();
645         if (!pending_snapshot->root_item || !pending_snapshot->path) {
646                 ret = -ENOMEM;
647                 goto free_pending;
648         }
649
650         atomic_inc(&root->will_be_snapshotted);
651         smp_mb__after_atomic();
652         /* wait for no snapshot writes */
653         wait_event(root->subv_writers->wait,
654                    percpu_counter_sum(&root->subv_writers->counter) == 0);
655
656         ret = btrfs_start_delalloc_inodes(root, 0);
657         if (ret)
658                 goto dec_and_free;
659
660         btrfs_wait_ordered_extents(root, U64_MAX, 0, (u64)-1);
661
662         btrfs_init_block_rsv(&pending_snapshot->block_rsv,
663                              BTRFS_BLOCK_RSV_TEMP);
664         /*
665          * 1 - parent dir inode
666          * 2 - dir entries
667          * 1 - root item
668          * 2 - root ref/backref
669          * 1 - root of snapshot
670          * 1 - UUID item
671          */
672         ret = btrfs_subvolume_reserve_metadata(BTRFS_I(dir)->root,
673                                         &pending_snapshot->block_rsv, 8,
674                                         &pending_snapshot->qgroup_reserved,
675                                         false);
676         if (ret)
677                 goto dec_and_free;
678
679         pending_snapshot->dentry = dentry;
680         pending_snapshot->root = root;
681         pending_snapshot->readonly = readonly;
682         pending_snapshot->dir = dir;
683         pending_snapshot->inherit = inherit;
684
685         trans = btrfs_start_transaction(root, 0);
686         if (IS_ERR(trans)) {
687                 ret = PTR_ERR(trans);
688                 goto fail;
689         }
690
691         spin_lock(&fs_info->trans_lock);
692         list_add(&pending_snapshot->list,
693                  &trans->transaction->pending_snapshots);
694         spin_unlock(&fs_info->trans_lock);
695         if (async_transid) {
696                 *async_transid = trans->transid;
697                 ret = btrfs_commit_transaction_async(trans, 1);
698                 if (ret)
699                         ret = btrfs_commit_transaction(trans);
700         } else {
701                 ret = btrfs_commit_transaction(trans);
702         }
703         if (ret)
704                 goto fail;
705
706         ret = pending_snapshot->error;
707         if (ret)
708                 goto fail;
709
710         ret = btrfs_orphan_cleanup(pending_snapshot->snap);
711         if (ret)
712                 goto fail;
713
714         inode = btrfs_lookup_dentry(d_inode(dentry->d_parent), dentry);
715         if (IS_ERR(inode)) {
716                 ret = PTR_ERR(inode);
717                 goto fail;
718         }
719
720         d_instantiate(dentry, inode);
721         ret = 0;
722 fail:
723         btrfs_subvolume_release_metadata(fs_info, &pending_snapshot->block_rsv);
724 dec_and_free:
725         if (atomic_dec_and_test(&root->will_be_snapshotted))
726                 wake_up_atomic_t(&root->will_be_snapshotted);
727 free_pending:
728         kfree(pending_snapshot->root_item);
729         btrfs_free_path(pending_snapshot->path);
730         kfree(pending_snapshot);
731
732         return ret;
733 }
734
735 /*  copy of may_delete in fs/namei.c()
736  *      Check whether we can remove a link victim from directory dir, check
737  *  whether the type of victim is right.
738  *  1. We can't do it if dir is read-only (done in permission())
739  *  2. We should have write and exec permissions on dir
740  *  3. We can't remove anything from append-only dir
741  *  4. We can't do anything with immutable dir (done in permission())
742  *  5. If the sticky bit on dir is set we should either
743  *      a. be owner of dir, or
744  *      b. be owner of victim, or
745  *      c. have CAP_FOWNER capability
746  *  6. If the victim is append-only or immutable we can't do anything with
747  *     links pointing to it.
748  *  7. If we were asked to remove a directory and victim isn't one - ENOTDIR.
749  *  8. If we were asked to remove a non-directory and victim isn't one - EISDIR.
750  *  9. We can't remove a root or mountpoint.
751  * 10. We don't allow removal of NFS sillyrenamed files; it's handled by
752  *     nfs_async_unlink().
753  */
754
755 static int btrfs_may_delete(struct inode *dir, struct dentry *victim, int isdir)
756 {
757         int error;
758
759         if (d_really_is_negative(victim))
760                 return -ENOENT;
761
762         BUG_ON(d_inode(victim->d_parent) != dir);
763         audit_inode_child(dir, victim, AUDIT_TYPE_CHILD_DELETE);
764
765         error = inode_permission(dir, MAY_WRITE | MAY_EXEC);
766         if (error)
767                 return error;
768         if (IS_APPEND(dir))
769                 return -EPERM;
770         if (check_sticky(dir, d_inode(victim)) || IS_APPEND(d_inode(victim)) ||
771             IS_IMMUTABLE(d_inode(victim)) || IS_SWAPFILE(d_inode(victim)))
772                 return -EPERM;
773         if (isdir) {
774                 if (!d_is_dir(victim))
775                         return -ENOTDIR;
776                 if (IS_ROOT(victim))
777                         return -EBUSY;
778         } else if (d_is_dir(victim))
779                 return -EISDIR;
780         if (IS_DEADDIR(dir))
781                 return -ENOENT;
782         if (victim->d_flags & DCACHE_NFSFS_RENAMED)
783                 return -EBUSY;
784         return 0;
785 }
786
787 /* copy of may_create in fs/namei.c() */
788 static inline int btrfs_may_create(struct inode *dir, struct dentry *child)
789 {
790         if (d_really_is_positive(child))
791                 return -EEXIST;
792         if (IS_DEADDIR(dir))
793                 return -ENOENT;
794         return inode_permission(dir, MAY_WRITE | MAY_EXEC);
795 }
796
797 /*
798  * Create a new subvolume below @parent.  This is largely modeled after
799  * sys_mkdirat and vfs_mkdir, but we only do a single component lookup
800  * inside this filesystem so it's quite a bit simpler.
801  */
802 static noinline int btrfs_mksubvol(const struct path *parent,
803                                    const char *name, int namelen,
804                                    struct btrfs_root *snap_src,
805                                    u64 *async_transid, bool readonly,
806                                    struct btrfs_qgroup_inherit *inherit)
807 {
808         struct inode *dir = d_inode(parent->dentry);
809         struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb);
810         struct dentry *dentry;
811         int error;
812
813         error = down_write_killable_nested(&dir->i_rwsem, I_MUTEX_PARENT);
814         if (error == -EINTR)
815                 return error;
816
817         dentry = lookup_one_len(name, parent->dentry, namelen);
818         error = PTR_ERR(dentry);
819         if (IS_ERR(dentry))
820                 goto out_unlock;
821
822         error = btrfs_may_create(dir, dentry);
823         if (error)
824                 goto out_dput;
825
826         /*
827          * even if this name doesn't exist, we may get hash collisions.
828          * check for them now when we can safely fail
829          */
830         error = btrfs_check_dir_item_collision(BTRFS_I(dir)->root,
831                                                dir->i_ino, name,
832                                                namelen);
833         if (error)
834                 goto out_dput;
835
836         down_read(&fs_info->subvol_sem);
837
838         if (btrfs_root_refs(&BTRFS_I(dir)->root->root_item) == 0)
839                 goto out_up_read;
840
841         if (snap_src) {
842                 error = create_snapshot(snap_src, dir, dentry,
843                                         async_transid, readonly, inherit);
844         } else {
845                 error = create_subvol(dir, dentry, name, namelen,
846                                       async_transid, inherit);
847         }
848         if (!error)
849                 fsnotify_mkdir(dir, dentry);
850 out_up_read:
851         up_read(&fs_info->subvol_sem);
852 out_dput:
853         dput(dentry);
854 out_unlock:
855         inode_unlock(dir);
856         return error;
857 }
858
859 /*
860  * When we're defragging a range, we don't want to kick it off again
861  * if it is really just waiting for delalloc to send it down.
862  * If we find a nice big extent or delalloc range for the bytes in the
863  * file you want to defrag, we return 0 to let you know to skip this
864  * part of the file
865  */
866 static int check_defrag_in_cache(struct inode *inode, u64 offset, u32 thresh)
867 {
868         struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
869         struct extent_map *em = NULL;
870         struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
871         u64 end;
872
873         read_lock(&em_tree->lock);
874         em = lookup_extent_mapping(em_tree, offset, PAGE_SIZE);
875         read_unlock(&em_tree->lock);
876
877         if (em) {
878                 end = extent_map_end(em);
879                 free_extent_map(em);
880                 if (end - offset > thresh)
881                         return 0;
882         }
883         /* if we already have a nice delalloc here, just stop */
884         thresh /= 2;
885         end = count_range_bits(io_tree, &offset, offset + thresh,
886                                thresh, EXTENT_DELALLOC, 1);
887         if (end >= thresh)
888                 return 0;
889         return 1;
890 }
891
892 /*
893  * helper function to walk through a file and find extents
894  * newer than a specific transid, and smaller than thresh.
895  *
896  * This is used by the defragging code to find new and small
897  * extents
898  */
899 static int find_new_extents(struct btrfs_root *root,
900                             struct inode *inode, u64 newer_than,
901                             u64 *off, u32 thresh)
902 {
903         struct btrfs_path *path;
904         struct btrfs_key min_key;
905         struct extent_buffer *leaf;
906         struct btrfs_file_extent_item *extent;
907         int type;
908         int ret;
909         u64 ino = btrfs_ino(BTRFS_I(inode));
910
911         path = btrfs_alloc_path();
912         if (!path)
913                 return -ENOMEM;
914
915         min_key.objectid = ino;
916         min_key.type = BTRFS_EXTENT_DATA_KEY;
917         min_key.offset = *off;
918
919         while (1) {
920                 ret = btrfs_search_forward(root, &min_key, path, newer_than);
921                 if (ret != 0)
922                         goto none;
923 process_slot:
924                 if (min_key.objectid != ino)
925                         goto none;
926                 if (min_key.type != BTRFS_EXTENT_DATA_KEY)
927                         goto none;
928
929                 leaf = path->nodes[0];
930                 extent = btrfs_item_ptr(leaf, path->slots[0],
931                                         struct btrfs_file_extent_item);
932
933                 type = btrfs_file_extent_type(leaf, extent);
934                 if (type == BTRFS_FILE_EXTENT_REG &&
935                     btrfs_file_extent_num_bytes(leaf, extent) < thresh &&
936                     check_defrag_in_cache(inode, min_key.offset, thresh)) {
937                         *off = min_key.offset;
938                         btrfs_free_path(path);
939                         return 0;
940                 }
941
942                 path->slots[0]++;
943                 if (path->slots[0] < btrfs_header_nritems(leaf)) {
944                         btrfs_item_key_to_cpu(leaf, &min_key, path->slots[0]);
945                         goto process_slot;
946                 }
947
948                 if (min_key.offset == (u64)-1)
949                         goto none;
950
951                 min_key.offset++;
952                 btrfs_release_path(path);
953         }
954 none:
955         btrfs_free_path(path);
956         return -ENOENT;
957 }
958
959 static struct extent_map *defrag_lookup_extent(struct inode *inode, u64 start)
960 {
961         struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
962         struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
963         struct extent_map *em;
964         u64 len = PAGE_SIZE;
965
966         /*
967          * hopefully we have this extent in the tree already, try without
968          * the full extent lock
969          */
970         read_lock(&em_tree->lock);
971         em = lookup_extent_mapping(em_tree, start, len);
972         read_unlock(&em_tree->lock);
973
974         if (!em) {
975                 struct extent_state *cached = NULL;
976                 u64 end = start + len - 1;
977
978                 /* get the big lock and read metadata off disk */
979                 lock_extent_bits(io_tree, start, end, &cached);
980                 em = btrfs_get_extent(BTRFS_I(inode), NULL, 0, start, len, 0);
981                 unlock_extent_cached(io_tree, start, end, &cached);
982
983                 if (IS_ERR(em))
984                         return NULL;
985         }
986
987         return em;
988 }
989
990 static bool defrag_check_next_extent(struct inode *inode, struct extent_map *em)
991 {
992         struct extent_map *next;
993         bool ret = true;
994
995         /* this is the last extent */
996         if (em->start + em->len >= i_size_read(inode))
997                 return false;
998
999         next = defrag_lookup_extent(inode, em->start + em->len);
1000         if (!next || next->block_start >= EXTENT_MAP_LAST_BYTE)
1001                 ret = false;
1002         else if ((em->block_start + em->block_len == next->block_start) &&
1003                  (em->block_len > SZ_128K && next->block_len > SZ_128K))
1004                 ret = false;
1005
1006         free_extent_map(next);
1007         return ret;
1008 }
1009
1010 static int should_defrag_range(struct inode *inode, u64 start, u32 thresh,
1011                                u64 *last_len, u64 *skip, u64 *defrag_end,
1012                                int compress)
1013 {
1014         struct extent_map *em;
1015         int ret = 1;
1016         bool next_mergeable = true;
1017         bool prev_mergeable = true;
1018
1019         /*
1020          * make sure that once we start defragging an extent, we keep on
1021          * defragging it
1022          */
1023         if (start < *defrag_end)
1024                 return 1;
1025
1026         *skip = 0;
1027
1028         em = defrag_lookup_extent(inode, start);
1029         if (!em)
1030                 return 0;
1031
1032         /* this will cover holes, and inline extents */
1033         if (em->block_start >= EXTENT_MAP_LAST_BYTE) {
1034                 ret = 0;
1035                 goto out;
1036         }
1037
1038         if (!*defrag_end)
1039                 prev_mergeable = false;
1040
1041         next_mergeable = defrag_check_next_extent(inode, em);
1042         /*
1043          * we hit a real extent, if it is big or the next extent is not a
1044          * real extent, don't bother defragging it
1045          */
1046         if (!compress && (*last_len == 0 || *last_len >= thresh) &&
1047             (em->len >= thresh || (!next_mergeable && !prev_mergeable)))
1048                 ret = 0;
1049 out:
1050         /*
1051          * last_len ends up being a counter of how many bytes we've defragged.
1052          * every time we choose not to defrag an extent, we reset *last_len
1053          * so that the next tiny extent will force a defrag.
1054          *
1055          * The end result of this is that tiny extents before a single big
1056          * extent will force at least part of that big extent to be defragged.
1057          */
1058         if (ret) {
1059                 *defrag_end = extent_map_end(em);
1060         } else {
1061                 *last_len = 0;
1062                 *skip = extent_map_end(em);
1063                 *defrag_end = 0;
1064         }
1065
1066         free_extent_map(em);
1067         return ret;
1068 }
1069
1070 /*
1071  * it doesn't do much good to defrag one or two pages
1072  * at a time.  This pulls in a nice chunk of pages
1073  * to COW and defrag.
1074  *
1075  * It also makes sure the delalloc code has enough
1076  * dirty data to avoid making new small extents as part
1077  * of the defrag
1078  *
1079  * It's a good idea to start RA on this range
1080  * before calling this.
1081  */
1082 static int cluster_pages_for_defrag(struct inode *inode,
1083                                     struct page **pages,
1084                                     unsigned long start_index,
1085                                     unsigned long num_pages)
1086 {
1087         unsigned long file_end;
1088         u64 isize = i_size_read(inode);
1089         u64 page_start;
1090         u64 page_end;
1091         u64 page_cnt;
1092         int ret;
1093         int i;
1094         int i_done;
1095         struct btrfs_ordered_extent *ordered;
1096         struct extent_state *cached_state = NULL;
1097         struct extent_io_tree *tree;
1098         struct extent_changeset *data_reserved = NULL;
1099         gfp_t mask = btrfs_alloc_write_mask(inode->i_mapping);
1100
1101         file_end = (isize - 1) >> PAGE_SHIFT;
1102         if (!isize || start_index > file_end)
1103                 return 0;
1104
1105         page_cnt = min_t(u64, (u64)num_pages, (u64)file_end - start_index + 1);
1106
1107         ret = btrfs_delalloc_reserve_space(inode, &data_reserved,
1108                         start_index << PAGE_SHIFT,
1109                         page_cnt << PAGE_SHIFT);
1110         if (ret)
1111                 return ret;
1112         i_done = 0;
1113         tree = &BTRFS_I(inode)->io_tree;
1114
1115         /* step one, lock all the pages */
1116         for (i = 0; i < page_cnt; i++) {
1117                 struct page *page;
1118 again:
1119                 page = find_or_create_page(inode->i_mapping,
1120                                            start_index + i, mask);
1121                 if (!page)
1122                         break;
1123
1124                 page_start = page_offset(page);
1125                 page_end = page_start + PAGE_SIZE - 1;
1126                 while (1) {
1127                         lock_extent_bits(tree, page_start, page_end,
1128                                          &cached_state);
1129                         ordered = btrfs_lookup_ordered_extent(inode,
1130                                                               page_start);
1131                         unlock_extent_cached(tree, page_start, page_end,
1132                                              &cached_state);
1133                         if (!ordered)
1134                                 break;
1135
1136                         unlock_page(page);
1137                         btrfs_start_ordered_extent(inode, ordered, 1);
1138                         btrfs_put_ordered_extent(ordered);
1139                         lock_page(page);
1140                         /*
1141                          * we unlocked the page above, so we need check if
1142                          * it was released or not.
1143                          */
1144                         if (page->mapping != inode->i_mapping) {
1145                                 unlock_page(page);
1146                                 put_page(page);
1147                                 goto again;
1148                         }
1149                 }
1150
1151                 if (!PageUptodate(page)) {
1152                         btrfs_readpage(NULL, page);
1153                         lock_page(page);
1154                         if (!PageUptodate(page)) {
1155                                 unlock_page(page);
1156                                 put_page(page);
1157                                 ret = -EIO;
1158                                 break;
1159                         }
1160                 }
1161
1162                 if (page->mapping != inode->i_mapping) {
1163                         unlock_page(page);
1164                         put_page(page);
1165                         goto again;
1166                 }
1167
1168                 pages[i] = page;
1169                 i_done++;
1170         }
1171         if (!i_done || ret)
1172                 goto out;
1173
1174         if (!(inode->i_sb->s_flags & SB_ACTIVE))
1175                 goto out;
1176
1177         /*
1178          * so now we have a nice long stream of locked
1179          * and up to date pages, lets wait on them
1180          */
1181         for (i = 0; i < i_done; i++)
1182                 wait_on_page_writeback(pages[i]);
1183
1184         page_start = page_offset(pages[0]);
1185         page_end = page_offset(pages[i_done - 1]) + PAGE_SIZE;
1186
1187         lock_extent_bits(&BTRFS_I(inode)->io_tree,
1188                          page_start, page_end - 1, &cached_state);
1189         clear_extent_bit(&BTRFS_I(inode)->io_tree, page_start,
1190                           page_end - 1, EXTENT_DIRTY | EXTENT_DELALLOC |
1191                           EXTENT_DO_ACCOUNTING | EXTENT_DEFRAG, 0, 0,
1192                           &cached_state);
1193
1194         if (i_done != page_cnt) {
1195                 spin_lock(&BTRFS_I(inode)->lock);
1196                 BTRFS_I(inode)->outstanding_extents++;
1197                 spin_unlock(&BTRFS_I(inode)->lock);
1198                 btrfs_delalloc_release_space(inode, data_reserved,
1199                                 start_index << PAGE_SHIFT,
1200                                 (page_cnt - i_done) << PAGE_SHIFT, true);
1201         }
1202
1203
1204         set_extent_defrag(&BTRFS_I(inode)->io_tree, page_start, page_end - 1,
1205                           &cached_state);
1206
1207         unlock_extent_cached(&BTRFS_I(inode)->io_tree,
1208                              page_start, page_end - 1, &cached_state);
1209
1210         for (i = 0; i < i_done; i++) {
1211                 clear_page_dirty_for_io(pages[i]);
1212                 ClearPageChecked(pages[i]);
1213                 set_page_extent_mapped(pages[i]);
1214                 set_page_dirty(pages[i]);
1215                 unlock_page(pages[i]);
1216                 put_page(pages[i]);
1217         }
1218         btrfs_delalloc_release_extents(BTRFS_I(inode), page_cnt << PAGE_SHIFT,
1219                                        false);
1220         extent_changeset_free(data_reserved);
1221         return i_done;
1222 out:
1223         for (i = 0; i < i_done; i++) {
1224                 unlock_page(pages[i]);
1225                 put_page(pages[i]);
1226         }
1227         btrfs_delalloc_release_space(inode, data_reserved,
1228                         start_index << PAGE_SHIFT,
1229                         page_cnt << PAGE_SHIFT, true);
1230         btrfs_delalloc_release_extents(BTRFS_I(inode), page_cnt << PAGE_SHIFT,
1231                                        true);
1232         extent_changeset_free(data_reserved);
1233         return ret;
1234
1235 }
1236
1237 int btrfs_defrag_file(struct inode *inode, struct file *file,
1238                       struct btrfs_ioctl_defrag_range_args *range,
1239                       u64 newer_than, unsigned long max_to_defrag)
1240 {
1241         struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
1242         struct btrfs_root *root = BTRFS_I(inode)->root;
1243         struct file_ra_state *ra = NULL;
1244         unsigned long last_index;
1245         u64 isize = i_size_read(inode);
1246         u64 last_len = 0;
1247         u64 skip = 0;
1248         u64 defrag_end = 0;
1249         u64 newer_off = range->start;
1250         unsigned long i;
1251         unsigned long ra_index = 0;
1252         int ret;
1253         int defrag_count = 0;
1254         int compress_type = BTRFS_COMPRESS_ZLIB;
1255         u32 extent_thresh = range->extent_thresh;
1256         unsigned long max_cluster = SZ_256K >> PAGE_SHIFT;
1257         unsigned long cluster = max_cluster;
1258         u64 new_align = ~((u64)SZ_128K - 1);
1259         struct page **pages = NULL;
1260         bool do_compress = range->flags & BTRFS_DEFRAG_RANGE_COMPRESS;
1261
1262         if (isize == 0)
1263                 return 0;
1264
1265         if (range->start >= isize)
1266                 return -EINVAL;
1267
1268         if (do_compress) {
1269                 if (range->compress_type > BTRFS_COMPRESS_TYPES)
1270                         return -EINVAL;
1271                 if (range->compress_type)
1272                         compress_type = range->compress_type;
1273         }
1274
1275         if (extent_thresh == 0)
1276                 extent_thresh = SZ_256K;
1277
1278         /*
1279          * If we were not given a file, allocate a readahead context. As
1280          * readahead is just an optimization, defrag will work without it so
1281          * we don't error out.
1282          */
1283         if (!file) {
1284                 ra = kzalloc(sizeof(*ra), GFP_KERNEL);
1285                 if (ra)
1286                         file_ra_state_init(ra, inode->i_mapping);
1287         } else {
1288                 ra = &file->f_ra;
1289         }
1290
1291         pages = kmalloc_array(max_cluster, sizeof(struct page *), GFP_KERNEL);
1292         if (!pages) {
1293                 ret = -ENOMEM;
1294                 goto out_ra;
1295         }
1296
1297         /* find the last page to defrag */
1298         if (range->start + range->len > range->start) {
1299                 last_index = min_t(u64, isize - 1,
1300                          range->start + range->len - 1) >> PAGE_SHIFT;
1301         } else {
1302                 last_index = (isize - 1) >> PAGE_SHIFT;
1303         }
1304
1305         if (newer_than) {
1306                 ret = find_new_extents(root, inode, newer_than,
1307                                        &newer_off, SZ_64K);
1308                 if (!ret) {
1309                         range->start = newer_off;
1310                         /*
1311                          * we always align our defrag to help keep
1312                          * the extents in the file evenly spaced
1313                          */
1314                         i = (newer_off & new_align) >> PAGE_SHIFT;
1315                 } else
1316                         goto out_ra;
1317         } else {
1318                 i = range->start >> PAGE_SHIFT;
1319         }
1320         if (!max_to_defrag)
1321                 max_to_defrag = last_index - i + 1;
1322
1323         /*
1324          * make writeback starts from i, so the defrag range can be
1325          * written sequentially.
1326          */
1327         if (i < inode->i_mapping->writeback_index)
1328                 inode->i_mapping->writeback_index = i;
1329
1330         while (i <= last_index && defrag_count < max_to_defrag &&
1331                (i < DIV_ROUND_UP(i_size_read(inode), PAGE_SIZE))) {
1332                 /*
1333                  * make sure we stop running if someone unmounts
1334                  * the FS
1335                  */
1336                 if (!(inode->i_sb->s_flags & SB_ACTIVE))
1337                         break;
1338
1339                 if (btrfs_defrag_cancelled(fs_info)) {
1340                         btrfs_debug(fs_info, "defrag_file cancelled");
1341                         ret = -EAGAIN;
1342                         break;
1343                 }
1344
1345                 if (!should_defrag_range(inode, (u64)i << PAGE_SHIFT,
1346                                          extent_thresh, &last_len, &skip,
1347                                          &defrag_end, do_compress)){
1348                         unsigned long next;
1349                         /*
1350                          * the should_defrag function tells us how much to skip
1351                          * bump our counter by the suggested amount
1352                          */
1353                         next = DIV_ROUND_UP(skip, PAGE_SIZE);
1354                         i = max(i + 1, next);
1355                         continue;
1356                 }
1357
1358                 if (!newer_than) {
1359                         cluster = (PAGE_ALIGN(defrag_end) >>
1360                                    PAGE_SHIFT) - i;
1361                         cluster = min(cluster, max_cluster);
1362                 } else {
1363                         cluster = max_cluster;
1364                 }
1365
1366                 if (i + cluster > ra_index) {
1367                         ra_index = max(i, ra_index);
1368                         if (ra)
1369                                 page_cache_sync_readahead(inode->i_mapping, ra,
1370                                                 file, ra_index, cluster);
1371                         ra_index += cluster;
1372                 }
1373
1374                 inode_lock(inode);
1375                 if (do_compress)
1376                         BTRFS_I(inode)->defrag_compress = compress_type;
1377                 ret = cluster_pages_for_defrag(inode, pages, i, cluster);
1378                 if (ret < 0) {
1379                         inode_unlock(inode);
1380                         goto out_ra;
1381                 }
1382
1383                 defrag_count += ret;
1384                 balance_dirty_pages_ratelimited(inode->i_mapping);
1385                 inode_unlock(inode);
1386
1387                 if (newer_than) {
1388                         if (newer_off == (u64)-1)
1389                                 break;
1390
1391                         if (ret > 0)
1392                                 i += ret;
1393
1394                         newer_off = max(newer_off + 1,
1395                                         (u64)i << PAGE_SHIFT);
1396
1397                         ret = find_new_extents(root, inode, newer_than,
1398                                                &newer_off, SZ_64K);
1399                         if (!ret) {
1400                                 range->start = newer_off;
1401                                 i = (newer_off & new_align) >> PAGE_SHIFT;
1402                         } else {
1403                                 break;
1404                         }
1405                 } else {
1406                         if (ret > 0) {
1407                                 i += ret;
1408                                 last_len += ret << PAGE_SHIFT;
1409                         } else {
1410                                 i++;
1411                                 last_len = 0;
1412                         }
1413                 }
1414         }
1415
1416         if ((range->flags & BTRFS_DEFRAG_RANGE_START_IO)) {
1417                 filemap_flush(inode->i_mapping);
1418                 if (test_bit(BTRFS_INODE_HAS_ASYNC_EXTENT,
1419                              &BTRFS_I(inode)->runtime_flags))
1420                         filemap_flush(inode->i_mapping);
1421         }
1422
1423         if (range->compress_type == BTRFS_COMPRESS_LZO) {
1424                 btrfs_set_fs_incompat(fs_info, COMPRESS_LZO);
1425         } else if (range->compress_type == BTRFS_COMPRESS_ZSTD) {
1426                 btrfs_set_fs_incompat(fs_info, COMPRESS_ZSTD);
1427         }
1428
1429         ret = defrag_count;
1430
1431 out_ra:
1432         if (do_compress) {
1433                 inode_lock(inode);
1434                 BTRFS_I(inode)->defrag_compress = BTRFS_COMPRESS_NONE;
1435                 inode_unlock(inode);
1436         }
1437         if (!file)
1438                 kfree(ra);
1439         kfree(pages);
1440         return ret;
1441 }
1442
1443 static noinline int btrfs_ioctl_resize(struct file *file,
1444                                         void __user *arg)
1445 {
1446         struct inode *inode = file_inode(file);
1447         struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
1448         u64 new_size;
1449         u64 old_size;
1450         u64 devid = 1;
1451         struct btrfs_root *root = BTRFS_I(inode)->root;
1452         struct btrfs_ioctl_vol_args *vol_args;
1453         struct btrfs_trans_handle *trans;
1454         struct btrfs_device *device = NULL;
1455         char *sizestr;
1456         char *retptr;
1457         char *devstr = NULL;
1458         int ret = 0;
1459         int mod = 0;
1460
1461         if (!capable(CAP_SYS_ADMIN))
1462                 return -EPERM;
1463
1464         ret = mnt_want_write_file(file);
1465         if (ret)
1466                 return ret;
1467
1468         if (test_and_set_bit(BTRFS_FS_EXCL_OP, &fs_info->flags)) {
1469                 mnt_drop_write_file(file);
1470                 return BTRFS_ERROR_DEV_EXCL_RUN_IN_PROGRESS;
1471         }
1472
1473         mutex_lock(&fs_info->volume_mutex);
1474         vol_args = memdup_user(arg, sizeof(*vol_args));
1475         if (IS_ERR(vol_args)) {
1476                 ret = PTR_ERR(vol_args);
1477                 goto out;
1478         }
1479
1480         vol_args->name[BTRFS_PATH_NAME_MAX] = '\0';
1481
1482         sizestr = vol_args->name;
1483         devstr = strchr(sizestr, ':');
1484         if (devstr) {
1485                 sizestr = devstr + 1;
1486                 *devstr = '\0';
1487                 devstr = vol_args->name;
1488                 ret = kstrtoull(devstr, 10, &devid);
1489                 if (ret)
1490                         goto out_free;
1491                 if (!devid) {
1492                         ret = -EINVAL;
1493                         goto out_free;
1494                 }
1495                 btrfs_info(fs_info, "resizing devid %llu", devid);
1496         }
1497
1498         device = btrfs_find_device(fs_info, devid, NULL, NULL);
1499         if (!device) {
1500                 btrfs_info(fs_info, "resizer unable to find device %llu",
1501                            devid);
1502                 ret = -ENODEV;
1503                 goto out_free;
1504         }
1505
1506         if (!test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state)) {
1507                 btrfs_info(fs_info,
1508                            "resizer unable to apply on readonly device %llu",
1509                        devid);
1510                 ret = -EPERM;
1511                 goto out_free;
1512         }
1513
1514         if (!strcmp(sizestr, "max"))
1515                 new_size = device->bdev->bd_inode->i_size;
1516         else {
1517                 if (sizestr[0] == '-') {
1518                         mod = -1;
1519                         sizestr++;
1520                 } else if (sizestr[0] == '+') {
1521                         mod = 1;
1522                         sizestr++;
1523                 }
1524                 new_size = memparse(sizestr, &retptr);
1525                 if (*retptr != '\0' || new_size == 0) {
1526                         ret = -EINVAL;
1527                         goto out_free;
1528                 }
1529         }
1530
1531         if (test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state)) {
1532                 ret = -EPERM;
1533                 goto out_free;
1534         }
1535
1536         old_size = btrfs_device_get_total_bytes(device);
1537
1538         if (mod < 0) {
1539                 if (new_size > old_size) {
1540                         ret = -EINVAL;
1541                         goto out_free;
1542                 }
1543                 new_size = old_size - new_size;
1544         } else if (mod > 0) {
1545                 if (new_size > ULLONG_MAX - old_size) {
1546                         ret = -ERANGE;
1547                         goto out_free;
1548                 }
1549                 new_size = old_size + new_size;
1550         }
1551
1552         if (new_size < SZ_256M) {
1553                 ret = -EINVAL;
1554                 goto out_free;
1555         }
1556         if (new_size > device->bdev->bd_inode->i_size) {
1557                 ret = -EFBIG;
1558                 goto out_free;
1559         }
1560
1561         new_size = round_down(new_size, fs_info->sectorsize);
1562
1563         btrfs_info_in_rcu(fs_info, "new size for %s is %llu",
1564                           rcu_str_deref(device->name), new_size);
1565
1566         if (new_size > old_size) {
1567                 trans = btrfs_start_transaction(root, 0);
1568                 if (IS_ERR(trans)) {
1569                         ret = PTR_ERR(trans);
1570                         goto out_free;
1571                 }
1572                 ret = btrfs_grow_device(trans, device, new_size);
1573                 btrfs_commit_transaction(trans);
1574         } else if (new_size < old_size) {
1575                 ret = btrfs_shrink_device(device, new_size);
1576         } /* equal, nothing need to do */
1577
1578 out_free:
1579         kfree(vol_args);
1580 out:
1581         mutex_unlock(&fs_info->volume_mutex);
1582         clear_bit(BTRFS_FS_EXCL_OP, &fs_info->flags);
1583         mnt_drop_write_file(file);
1584         return ret;
1585 }
1586
1587 static noinline int btrfs_ioctl_snap_create_transid(struct file *file,
1588                                 const char *name, unsigned long fd, int subvol,
1589                                 u64 *transid, bool readonly,
1590                                 struct btrfs_qgroup_inherit *inherit)
1591 {
1592         int namelen;
1593         int ret = 0;
1594
1595         if (!S_ISDIR(file_inode(file)->i_mode))
1596                 return -ENOTDIR;
1597
1598         ret = mnt_want_write_file(file);
1599         if (ret)
1600                 goto out;
1601
1602         namelen = strlen(name);
1603         if (strchr(name, '/')) {
1604                 ret = -EINVAL;
1605                 goto out_drop_write;
1606         }
1607
1608         if (name[0] == '.' &&
1609            (namelen == 1 || (name[1] == '.' && namelen == 2))) {
1610                 ret = -EEXIST;
1611                 goto out_drop_write;
1612         }
1613
1614         if (subvol) {
1615                 ret = btrfs_mksubvol(&file->f_path, name, namelen,
1616                                      NULL, transid, readonly, inherit);
1617         } else {
1618                 struct fd src = fdget(fd);
1619                 struct inode *src_inode;
1620                 if (!src.file) {
1621                         ret = -EINVAL;
1622                         goto out_drop_write;
1623                 }
1624
1625                 src_inode = file_inode(src.file);
1626                 if (src_inode->i_sb != file_inode(file)->i_sb) {
1627                         btrfs_info(BTRFS_I(file_inode(file))->root->fs_info,
1628                                    "Snapshot src from another FS");
1629                         ret = -EXDEV;
1630                 } else if (!inode_owner_or_capable(src_inode)) {
1631                         /*
1632                          * Subvolume creation is not restricted, but snapshots
1633                          * are limited to own subvolumes only
1634                          */
1635                         ret = -EPERM;
1636                 } else {
1637                         ret = btrfs_mksubvol(&file->f_path, name, namelen,
1638                                              BTRFS_I(src_inode)->root,
1639                                              transid, readonly, inherit);
1640                 }
1641                 fdput(src);
1642         }
1643 out_drop_write:
1644         mnt_drop_write_file(file);
1645 out:
1646         return ret;
1647 }
1648
1649 static noinline int btrfs_ioctl_snap_create(struct file *file,
1650                                             void __user *arg, int subvol)
1651 {
1652         struct btrfs_ioctl_vol_args *vol_args;
1653         int ret;
1654
1655         if (!S_ISDIR(file_inode(file)->i_mode))
1656                 return -ENOTDIR;
1657
1658         vol_args = memdup_user(arg, sizeof(*vol_args));
1659         if (IS_ERR(vol_args))
1660                 return PTR_ERR(vol_args);
1661         vol_args->name[BTRFS_PATH_NAME_MAX] = '\0';
1662
1663         ret = btrfs_ioctl_snap_create_transid(file, vol_args->name,
1664                                               vol_args->fd, subvol,
1665                                               NULL, false, NULL);
1666
1667         kfree(vol_args);
1668         return ret;
1669 }
1670
1671 static noinline int btrfs_ioctl_snap_create_v2(struct file *file,
1672                                                void __user *arg, int subvol)
1673 {
1674         struct btrfs_ioctl_vol_args_v2 *vol_args;
1675         int ret;
1676         u64 transid = 0;
1677         u64 *ptr = NULL;
1678         bool readonly = false;
1679         struct btrfs_qgroup_inherit *inherit = NULL;
1680
1681         if (!S_ISDIR(file_inode(file)->i_mode))
1682                 return -ENOTDIR;
1683
1684         vol_args = memdup_user(arg, sizeof(*vol_args));
1685         if (IS_ERR(vol_args))
1686                 return PTR_ERR(vol_args);
1687         vol_args->name[BTRFS_SUBVOL_NAME_MAX] = '\0';
1688
1689         if (vol_args->flags &
1690             ~(BTRFS_SUBVOL_CREATE_ASYNC | BTRFS_SUBVOL_RDONLY |
1691               BTRFS_SUBVOL_QGROUP_INHERIT)) {
1692                 ret = -EOPNOTSUPP;
1693                 goto free_args;
1694         }
1695
1696         if (vol_args->flags & BTRFS_SUBVOL_CREATE_ASYNC)
1697                 ptr = &transid;
1698         if (vol_args->flags & BTRFS_SUBVOL_RDONLY)
1699                 readonly = true;
1700         if (vol_args->flags & BTRFS_SUBVOL_QGROUP_INHERIT) {
1701                 if (vol_args->size > PAGE_SIZE) {
1702                         ret = -EINVAL;
1703                         goto free_args;
1704                 }
1705                 inherit = memdup_user(vol_args->qgroup_inherit, vol_args->size);
1706                 if (IS_ERR(inherit)) {
1707                         ret = PTR_ERR(inherit);
1708                         goto free_args;
1709                 }
1710         }
1711
1712         ret = btrfs_ioctl_snap_create_transid(file, vol_args->name,
1713                                               vol_args->fd, subvol, ptr,
1714                                               readonly, inherit);
1715         if (ret)
1716                 goto free_inherit;
1717
1718         if (ptr && copy_to_user(arg +
1719                                 offsetof(struct btrfs_ioctl_vol_args_v2,
1720                                         transid),
1721                                 ptr, sizeof(*ptr)))
1722                 ret = -EFAULT;
1723
1724 free_inherit:
1725         kfree(inherit);
1726 free_args:
1727         kfree(vol_args);
1728         return ret;
1729 }
1730
1731 static noinline int btrfs_ioctl_subvol_getflags(struct file *file,
1732                                                 void __user *arg)
1733 {
1734         struct inode *inode = file_inode(file);
1735         struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
1736         struct btrfs_root *root = BTRFS_I(inode)->root;
1737         int ret = 0;
1738         u64 flags = 0;
1739
1740         if (btrfs_ino(BTRFS_I(inode)) != BTRFS_FIRST_FREE_OBJECTID)
1741                 return -EINVAL;
1742
1743         down_read(&fs_info->subvol_sem);
1744         if (btrfs_root_readonly(root))
1745                 flags |= BTRFS_SUBVOL_RDONLY;
1746         up_read(&fs_info->subvol_sem);
1747
1748         if (copy_to_user(arg, &flags, sizeof(flags)))
1749                 ret = -EFAULT;
1750
1751         return ret;
1752 }
1753
1754 static noinline int btrfs_ioctl_subvol_setflags(struct file *file,
1755                                               void __user *arg)
1756 {
1757         struct inode *inode = file_inode(file);
1758         struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
1759         struct btrfs_root *root = BTRFS_I(inode)->root;
1760         struct btrfs_trans_handle *trans;
1761         u64 root_flags;
1762         u64 flags;
1763         int ret = 0;
1764
1765         if (!inode_owner_or_capable(inode))
1766                 return -EPERM;
1767
1768         ret = mnt_want_write_file(file);
1769         if (ret)
1770                 goto out;
1771
1772         if (btrfs_ino(BTRFS_I(inode)) != BTRFS_FIRST_FREE_OBJECTID) {
1773                 ret = -EINVAL;
1774                 goto out_drop_write;
1775         }
1776
1777         if (copy_from_user(&flags, arg, sizeof(flags))) {
1778                 ret = -EFAULT;
1779                 goto out_drop_write;
1780         }
1781
1782         if (flags & BTRFS_SUBVOL_CREATE_ASYNC) {
1783                 ret = -EINVAL;
1784                 goto out_drop_write;
1785         }
1786
1787         if (flags & ~BTRFS_SUBVOL_RDONLY) {
1788                 ret = -EOPNOTSUPP;
1789                 goto out_drop_write;
1790         }
1791
1792         down_write(&fs_info->subvol_sem);
1793
1794         /* nothing to do */
1795         if (!!(flags & BTRFS_SUBVOL_RDONLY) == btrfs_root_readonly(root))
1796                 goto out_drop_sem;
1797
1798         root_flags = btrfs_root_flags(&root->root_item);
1799         if (flags & BTRFS_SUBVOL_RDONLY) {
1800                 btrfs_set_root_flags(&root->root_item,
1801                                      root_flags | BTRFS_ROOT_SUBVOL_RDONLY);
1802         } else {
1803                 /*
1804                  * Block RO -> RW transition if this subvolume is involved in
1805                  * send
1806                  */
1807                 spin_lock(&root->root_item_lock);
1808                 if (root->send_in_progress == 0) {
1809                         btrfs_set_root_flags(&root->root_item,
1810                                      root_flags & ~BTRFS_ROOT_SUBVOL_RDONLY);
1811                         spin_unlock(&root->root_item_lock);
1812                 } else {
1813                         spin_unlock(&root->root_item_lock);
1814                         btrfs_warn(fs_info,
1815                                    "Attempt to set subvolume %llu read-write during send",
1816                                    root->root_key.objectid);
1817                         ret = -EPERM;
1818                         goto out_drop_sem;
1819                 }
1820         }
1821
1822         trans = btrfs_start_transaction(root, 1);
1823         if (IS_ERR(trans)) {
1824                 ret = PTR_ERR(trans);
1825                 goto out_reset;
1826         }
1827
1828         ret = btrfs_update_root(trans, fs_info->tree_root,
1829                                 &root->root_key, &root->root_item);
1830         if (ret < 0) {
1831                 btrfs_end_transaction(trans);
1832                 goto out_reset;
1833         }
1834
1835         ret = btrfs_commit_transaction(trans);
1836
1837 out_reset:
1838         if (ret)
1839                 btrfs_set_root_flags(&root->root_item, root_flags);
1840 out_drop_sem:
1841         up_write(&fs_info->subvol_sem);
1842 out_drop_write:
1843         mnt_drop_write_file(file);
1844 out:
1845         return ret;
1846 }
1847
1848 /*
1849  * helper to check if the subvolume references other subvolumes
1850  */
1851 static noinline int may_destroy_subvol(struct btrfs_root *root)
1852 {
1853         struct btrfs_fs_info *fs_info = root->fs_info;
1854         struct btrfs_path *path;
1855         struct btrfs_dir_item *di;
1856         struct btrfs_key key;
1857         u64 dir_id;
1858         int ret;
1859
1860         path = btrfs_alloc_path();
1861         if (!path)
1862                 return -ENOMEM;
1863
1864         /* Make sure this root isn't set as the default subvol */
1865         dir_id = btrfs_super_root_dir(fs_info->super_copy);
1866         di = btrfs_lookup_dir_item(NULL, fs_info->tree_root, path,
1867                                    dir_id, "default", 7, 0);
1868         if (di && !IS_ERR(di)) {
1869                 btrfs_dir_item_key_to_cpu(path->nodes[0], di, &key);
1870                 if (key.objectid == root->root_key.objectid) {
1871                         ret = -EPERM;
1872                         btrfs_err(fs_info,
1873                                   "deleting default subvolume %llu is not allowed",
1874                                   key.objectid);
1875                         goto out;
1876                 }
1877                 btrfs_release_path(path);
1878         }
1879
1880         key.objectid = root->root_key.objectid;
1881         key.type = BTRFS_ROOT_REF_KEY;
1882         key.offset = (u64)-1;
1883
1884         ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, path, 0, 0);
1885         if (ret < 0)
1886                 goto out;
1887         BUG_ON(ret == 0);
1888
1889         ret = 0;
1890         if (path->slots[0] > 0) {
1891                 path->slots[0]--;
1892                 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
1893                 if (key.objectid == root->root_key.objectid &&
1894                     key.type == BTRFS_ROOT_REF_KEY)
1895                         ret = -ENOTEMPTY;
1896         }
1897 out:
1898         btrfs_free_path(path);
1899         return ret;
1900 }
1901
1902 static noinline int key_in_sk(struct btrfs_key *key,
1903                               struct btrfs_ioctl_search_key *sk)
1904 {
1905         struct btrfs_key test;
1906         int ret;
1907
1908         test.objectid = sk->min_objectid;
1909         test.type = sk->min_type;
1910         test.offset = sk->min_offset;
1911
1912         ret = btrfs_comp_cpu_keys(key, &test);
1913         if (ret < 0)
1914                 return 0;
1915
1916         test.objectid = sk->max_objectid;
1917         test.type = sk->max_type;
1918         test.offset = sk->max_offset;
1919
1920         ret = btrfs_comp_cpu_keys(key, &test);
1921         if (ret > 0)
1922                 return 0;
1923         return 1;
1924 }
1925
1926 static noinline int copy_to_sk(struct btrfs_path *path,
1927                                struct btrfs_key *key,
1928                                struct btrfs_ioctl_search_key *sk,
1929                                size_t *buf_size,
1930                                char __user *ubuf,
1931                                unsigned long *sk_offset,
1932                                int *num_found)
1933 {
1934         u64 found_transid;
1935         struct extent_buffer *leaf;
1936         struct btrfs_ioctl_search_header sh;
1937         struct btrfs_key test;
1938         unsigned long item_off;
1939         unsigned long item_len;
1940         int nritems;
1941         int i;
1942         int slot;
1943         int ret = 0;
1944
1945         leaf = path->nodes[0];
1946         slot = path->slots[0];
1947         nritems = btrfs_header_nritems(leaf);
1948
1949         if (btrfs_header_generation(leaf) > sk->max_transid) {
1950                 i = nritems;
1951                 goto advance_key;
1952         }
1953         found_transid = btrfs_header_generation(leaf);
1954
1955         for (i = slot; i < nritems; i++) {
1956                 item_off = btrfs_item_ptr_offset(leaf, i);
1957                 item_len = btrfs_item_size_nr(leaf, i);
1958
1959                 btrfs_item_key_to_cpu(leaf, key, i);
1960                 if (!key_in_sk(key, sk))
1961                         continue;
1962
1963                 if (sizeof(sh) + item_len > *buf_size) {
1964                         if (*num_found) {
1965                                 ret = 1;
1966                                 goto out;
1967                         }
1968
1969                         /*
1970                          * return one empty item back for v1, which does not
1971                          * handle -EOVERFLOW
1972                          */
1973
1974                         *buf_size = sizeof(sh) + item_len;
1975                         item_len = 0;
1976                         ret = -EOVERFLOW;
1977                 }
1978
1979                 if (sizeof(sh) + item_len + *sk_offset > *buf_size) {
1980                         ret = 1;
1981                         goto out;
1982                 }
1983
1984                 sh.objectid = key->objectid;
1985                 sh.offset = key->offset;
1986                 sh.type = key->type;
1987                 sh.len = item_len;
1988                 sh.transid = found_transid;
1989
1990                 /* copy search result header */
1991                 if (copy_to_user(ubuf + *sk_offset, &sh, sizeof(sh))) {
1992                         ret = -EFAULT;
1993                         goto out;
1994                 }
1995
1996                 *sk_offset += sizeof(sh);
1997
1998                 if (item_len) {
1999                         char __user *up = ubuf + *sk_offset;
2000                         /* copy the item */
2001                         if (read_extent_buffer_to_user(leaf, up,
2002                                                        item_off, item_len)) {
2003                                 ret = -EFAULT;
2004                                 goto out;
2005                         }
2006
2007                         *sk_offset += item_len;
2008                 }
2009                 (*num_found)++;
2010
2011                 if (ret) /* -EOVERFLOW from above */
2012                         goto out;
2013
2014                 if (*num_found >= sk->nr_items) {
2015                         ret = 1;
2016                         goto out;
2017                 }
2018         }
2019 advance_key:
2020         ret = 0;
2021         test.objectid = sk->max_objectid;
2022         test.type = sk->max_type;
2023         test.offset = sk->max_offset;
2024         if (btrfs_comp_cpu_keys(key, &test) >= 0)
2025                 ret = 1;
2026         else if (key->offset < (u64)-1)
2027                 key->offset++;
2028         else if (key->type < (u8)-1) {
2029                 key->offset = 0;
2030                 key->type++;
2031         } else if (key->objectid < (u64)-1) {
2032                 key->offset = 0;
2033                 key->type = 0;
2034                 key->objectid++;
2035         } else
2036                 ret = 1;
2037 out:
2038         /*
2039          *  0: all items from this leaf copied, continue with next
2040          *  1: * more items can be copied, but unused buffer is too small
2041          *     * all items were found
2042          *     Either way, it will stops the loop which iterates to the next
2043          *     leaf
2044          *  -EOVERFLOW: item was to large for buffer
2045          *  -EFAULT: could not copy extent buffer back to userspace
2046          */
2047         return ret;
2048 }
2049
2050 static noinline int search_ioctl(struct inode *inode,
2051                                  struct btrfs_ioctl_search_key *sk,
2052                                  size_t *buf_size,
2053                                  char __user *ubuf)
2054 {
2055         struct btrfs_fs_info *info = btrfs_sb(inode->i_sb);
2056         struct btrfs_root *root;
2057         struct btrfs_key key;
2058         struct btrfs_path *path;
2059         int ret;
2060         int num_found = 0;
2061         unsigned long sk_offset = 0;
2062
2063         if (*buf_size < sizeof(struct btrfs_ioctl_search_header)) {
2064                 *buf_size = sizeof(struct btrfs_ioctl_search_header);
2065                 return -EOVERFLOW;
2066         }
2067
2068         path = btrfs_alloc_path();
2069         if (!path)
2070                 return -ENOMEM;
2071
2072         if (sk->tree_id == 0) {
2073                 /* search the root of the inode that was passed */
2074                 root = BTRFS_I(inode)->root;
2075         } else {
2076                 key.objectid = sk->tree_id;
2077                 key.type = BTRFS_ROOT_ITEM_KEY;
2078                 key.offset = (u64)-1;
2079                 root = btrfs_read_fs_root_no_name(info, &key);
2080                 if (IS_ERR(root)) {
2081                         btrfs_free_path(path);
2082                         return -ENOENT;
2083                 }
2084         }
2085
2086         key.objectid = sk->min_objectid;
2087         key.type = sk->min_type;
2088         key.offset = sk->min_offset;
2089
2090         while (1) {
2091                 ret = btrfs_search_forward(root, &key, path, sk->min_transid);
2092                 if (ret != 0) {
2093                         if (ret > 0)
2094                                 ret = 0;
2095                         goto err;
2096                 }
2097                 ret = copy_to_sk(path, &key, sk, buf_size, ubuf,
2098                                  &sk_offset, &num_found);
2099                 btrfs_release_path(path);
2100                 if (ret)
2101                         break;
2102
2103         }
2104         if (ret > 0)
2105                 ret = 0;
2106 err:
2107         sk->nr_items = num_found;
2108         btrfs_free_path(path);
2109         return ret;
2110 }
2111
2112 static noinline int btrfs_ioctl_tree_search(struct file *file,
2113                                            void __user *argp)
2114 {
2115         struct btrfs_ioctl_search_args __user *uargs;
2116         struct btrfs_ioctl_search_key sk;
2117         struct inode *inode;
2118         int ret;
2119         size_t buf_size;
2120
2121         if (!capable(CAP_SYS_ADMIN))
2122                 return -EPERM;
2123
2124         uargs = (struct btrfs_ioctl_search_args __user *)argp;
2125
2126         if (copy_from_user(&sk, &uargs->key, sizeof(sk)))
2127                 return -EFAULT;
2128
2129         buf_size = sizeof(uargs->buf);
2130
2131         inode = file_inode(file);
2132         ret = search_ioctl(inode, &sk, &buf_size, uargs->buf);
2133
2134         /*
2135          * In the origin implementation an overflow is handled by returning a
2136          * search header with a len of zero, so reset ret.
2137          */
2138         if (ret == -EOVERFLOW)
2139                 ret = 0;
2140
2141         if (ret == 0 && copy_to_user(&uargs->key, &sk, sizeof(sk)))
2142                 ret = -EFAULT;
2143         return ret;
2144 }
2145
2146 static noinline int btrfs_ioctl_tree_search_v2(struct file *file,
2147                                                void __user *argp)
2148 {
2149         struct btrfs_ioctl_search_args_v2 __user *uarg;
2150         struct btrfs_ioctl_search_args_v2 args;
2151         struct inode *inode;
2152         int ret;
2153         size_t buf_size;
2154         const size_t buf_limit = SZ_16M;
2155
2156         if (!capable(CAP_SYS_ADMIN))
2157                 return -EPERM;
2158
2159         /* copy search header and buffer size */
2160         uarg = (struct btrfs_ioctl_search_args_v2 __user *)argp;
2161         if (copy_from_user(&args, uarg, sizeof(args)))
2162                 return -EFAULT;
2163
2164         buf_size = args.buf_size;
2165
2166         /* limit result size to 16MB */
2167         if (buf_size > buf_limit)
2168                 buf_size = buf_limit;
2169
2170         inode = file_inode(file);
2171         ret = search_ioctl(inode, &args.key, &buf_size,
2172                            (char __user *)(&uarg->buf[0]));
2173         if (ret == 0 && copy_to_user(&uarg->key, &args.key, sizeof(args.key)))
2174                 ret = -EFAULT;
2175         else if (ret == -EOVERFLOW &&
2176                 copy_to_user(&uarg->buf_size, &buf_size, sizeof(buf_size)))
2177                 ret = -EFAULT;
2178
2179         return ret;
2180 }
2181
2182 /*
2183  * Search INODE_REFs to identify path name of 'dirid' directory
2184  * in a 'tree_id' tree. and sets path name to 'name'.
2185  */
2186 static noinline int btrfs_search_path_in_tree(struct btrfs_fs_info *info,
2187                                 u64 tree_id, u64 dirid, char *name)
2188 {
2189         struct btrfs_root *root;
2190         struct btrfs_key key;
2191         char *ptr;
2192         int ret = -1;
2193         int slot;
2194         int len;
2195         int total_len = 0;
2196         struct btrfs_inode_ref *iref;
2197         struct extent_buffer *l;
2198         struct btrfs_path *path;
2199
2200         if (dirid == BTRFS_FIRST_FREE_OBJECTID) {
2201                 name[0]='\0';
2202                 return 0;
2203         }
2204
2205         path = btrfs_alloc_path();
2206         if (!path)
2207                 return -ENOMEM;
2208
2209         ptr = &name[BTRFS_INO_LOOKUP_PATH_MAX - 1];
2210
2211         key.objectid = tree_id;
2212         key.type = BTRFS_ROOT_ITEM_KEY;
2213         key.offset = (u64)-1;
2214         root = btrfs_read_fs_root_no_name(info, &key);
2215         if (IS_ERR(root)) {
2216                 btrfs_err(info, "could not find root %llu", tree_id);
2217                 ret = -ENOENT;
2218                 goto out;
2219         }
2220
2221         key.objectid = dirid;
2222         key.type = BTRFS_INODE_REF_KEY;
2223         key.offset = (u64)-1;
2224
2225         while (1) {
2226                 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
2227                 if (ret < 0)
2228                         goto out;
2229                 else if (ret > 0) {
2230                         ret = btrfs_previous_item(root, path, dirid,
2231                                                   BTRFS_INODE_REF_KEY);
2232                         if (ret < 0)
2233                                 goto out;
2234                         else if (ret > 0) {
2235                                 ret = -ENOENT;
2236                                 goto out;
2237                         }
2238                 }
2239
2240                 l = path->nodes[0];
2241                 slot = path->slots[0];
2242                 btrfs_item_key_to_cpu(l, &key, slot);
2243
2244                 iref = btrfs_item_ptr(l, slot, struct btrfs_inode_ref);
2245                 len = btrfs_inode_ref_name_len(l, iref);
2246                 ptr -= len + 1;
2247                 total_len += len + 1;
2248                 if (ptr < name) {
2249                         ret = -ENAMETOOLONG;
2250                         goto out;
2251                 }
2252
2253                 *(ptr + len) = '/';
2254                 read_extent_buffer(l, ptr, (unsigned long)(iref + 1), len);
2255
2256                 if (key.offset == BTRFS_FIRST_FREE_OBJECTID)
2257                         break;
2258
2259                 btrfs_release_path(path);
2260                 key.objectid = key.offset;
2261                 key.offset = (u64)-1;
2262                 dirid = key.objectid;
2263         }
2264         memmove(name, ptr, total_len);
2265         name[total_len] = '\0';
2266         ret = 0;
2267 out:
2268         btrfs_free_path(path);
2269         return ret;
2270 }
2271
2272 static noinline int btrfs_ioctl_ino_lookup(struct file *file,
2273                                            void __user *argp)
2274 {
2275          struct btrfs_ioctl_ino_lookup_args *args;
2276          struct inode *inode;
2277         int ret = 0;
2278
2279         args = memdup_user(argp, sizeof(*args));
2280         if (IS_ERR(args))
2281                 return PTR_ERR(args);
2282
2283         inode = file_inode(file);
2284
2285         /*
2286          * Unprivileged query to obtain the containing subvolume root id. The
2287          * path is reset so it's consistent with btrfs_search_path_in_tree.
2288          */
2289         if (args->treeid == 0)
2290                 args->treeid = BTRFS_I(inode)->root->root_key.objectid;
2291
2292         if (args->objectid == BTRFS_FIRST_FREE_OBJECTID) {
2293                 args->name[0] = 0;
2294                 goto out;
2295         }
2296
2297         if (!capable(CAP_SYS_ADMIN)) {
2298                 ret = -EPERM;
2299                 goto out;
2300         }
2301
2302         ret = btrfs_search_path_in_tree(BTRFS_I(inode)->root->fs_info,
2303                                         args->treeid, args->objectid,
2304                                         args->name);
2305
2306 out:
2307         if (ret == 0 && copy_to_user(argp, args, sizeof(*args)))
2308                 ret = -EFAULT;
2309
2310         kfree(args);
2311         return ret;
2312 }
2313
2314 static noinline int btrfs_ioctl_snap_destroy(struct file *file,
2315                                              void __user *arg)
2316 {
2317         struct dentry *parent = file->f_path.dentry;
2318         struct btrfs_fs_info *fs_info = btrfs_sb(parent->d_sb);
2319         struct dentry *dentry;
2320         struct inode *dir = d_inode(parent);
2321         struct inode *inode;
2322         struct btrfs_root *root = BTRFS_I(dir)->root;
2323         struct btrfs_root *dest = NULL;
2324         struct btrfs_ioctl_vol_args *vol_args;
2325         struct btrfs_trans_handle *trans;
2326         struct btrfs_block_rsv block_rsv;
2327         u64 root_flags;
2328         u64 qgroup_reserved;
2329         int namelen;
2330         int ret;
2331         int err = 0;
2332
2333         if (!S_ISDIR(dir->i_mode))
2334                 return -ENOTDIR;
2335
2336         vol_args = memdup_user(arg, sizeof(*vol_args));
2337         if (IS_ERR(vol_args))
2338                 return PTR_ERR(vol_args);
2339
2340         vol_args->name[BTRFS_PATH_NAME_MAX] = '\0';
2341         namelen = strlen(vol_args->name);
2342         if (strchr(vol_args->name, '/') ||
2343             strncmp(vol_args->name, "..", namelen) == 0) {
2344                 err = -EINVAL;
2345                 goto out;
2346         }
2347
2348         err = mnt_want_write_file(file);
2349         if (err)
2350                 goto out;
2351
2352
2353         err = down_write_killable_nested(&dir->i_rwsem, I_MUTEX_PARENT);
2354         if (err == -EINTR)
2355                 goto out_drop_write;
2356         dentry = lookup_one_len(vol_args->name, parent, namelen);
2357         if (IS_ERR(dentry)) {
2358                 err = PTR_ERR(dentry);
2359                 goto out_unlock_dir;
2360         }
2361
2362         if (d_really_is_negative(dentry)) {
2363                 err = -ENOENT;
2364                 goto out_dput;
2365         }
2366
2367         inode = d_inode(dentry);
2368         dest = BTRFS_I(inode)->root;
2369         if (!capable(CAP_SYS_ADMIN)) {
2370                 /*
2371                  * Regular user.  Only allow this with a special mount
2372                  * option, when the user has write+exec access to the
2373                  * subvol root, and when rmdir(2) would have been
2374                  * allowed.
2375                  *
2376                  * Note that this is _not_ check that the subvol is
2377                  * empty or doesn't contain data that we wouldn't
2378                  * otherwise be able to delete.
2379                  *
2380                  * Users who want to delete empty subvols should try
2381                  * rmdir(2).
2382                  */
2383                 err = -EPERM;
2384                 if (!btrfs_test_opt(fs_info, USER_SUBVOL_RM_ALLOWED))
2385                         goto out_dput;
2386
2387                 /*
2388                  * Do not allow deletion if the parent dir is the same
2389                  * as the dir to be deleted.  That means the ioctl
2390                  * must be called on the dentry referencing the root
2391                  * of the subvol, not a random directory contained
2392                  * within it.
2393                  */
2394                 err = -EINVAL;
2395                 if (root == dest)
2396                         goto out_dput;
2397
2398                 err = inode_permission(inode, MAY_WRITE | MAY_EXEC);
2399                 if (err)
2400                         goto out_dput;
2401         }
2402
2403         /* check if subvolume may be deleted by a user */
2404         err = btrfs_may_delete(dir, dentry, 1);
2405         if (err)
2406                 goto out_dput;
2407
2408         if (btrfs_ino(BTRFS_I(inode)) != BTRFS_FIRST_FREE_OBJECTID) {
2409                 err = -EINVAL;
2410                 goto out_dput;
2411         }
2412
2413         inode_lock(inode);
2414
2415         /*
2416          * Don't allow to delete a subvolume with send in progress. This is
2417          * inside the i_mutex so the error handling that has to drop the bit
2418          * again is not run concurrently.
2419          */
2420         spin_lock(&dest->root_item_lock);
2421         root_flags = btrfs_root_flags(&dest->root_item);
2422         if (dest->send_in_progress == 0) {
2423                 btrfs_set_root_flags(&dest->root_item,
2424                                 root_flags | BTRFS_ROOT_SUBVOL_DEAD);
2425                 spin_unlock(&dest->root_item_lock);
2426         } else {
2427                 spin_unlock(&dest->root_item_lock);
2428                 btrfs_warn(fs_info,
2429                            "Attempt to delete subvolume %llu during send",
2430                            dest->root_key.objectid);
2431                 err = -EPERM;
2432                 goto out_unlock_inode;
2433         }
2434
2435         down_write(&fs_info->subvol_sem);
2436
2437         err = may_destroy_subvol(dest);
2438         if (err)
2439                 goto out_up_write;
2440
2441         btrfs_init_block_rsv(&block_rsv, BTRFS_BLOCK_RSV_TEMP);
2442         /*
2443          * One for dir inode, two for dir entries, two for root
2444          * ref/backref.
2445          */
2446         err = btrfs_subvolume_reserve_metadata(root, &block_rsv,
2447                                                5, &qgroup_reserved, true);
2448         if (err)
2449                 goto out_up_write;
2450
2451         trans = btrfs_start_transaction(root, 0);
2452         if (IS_ERR(trans)) {
2453                 err = PTR_ERR(trans);
2454                 goto out_release;
2455         }
2456         trans->block_rsv = &block_rsv;
2457         trans->bytes_reserved = block_rsv.size;
2458
2459         btrfs_record_snapshot_destroy(trans, BTRFS_I(dir));
2460
2461         ret = btrfs_unlink_subvol(trans, root, dir,
2462                                 dest->root_key.objectid,
2463                                 dentry->d_name.name,
2464                                 dentry->d_name.len);
2465         if (ret) {
2466                 err = ret;
2467                 btrfs_abort_transaction(trans, ret);
2468                 goto out_end_trans;
2469         }
2470
2471         btrfs_record_root_in_trans(trans, dest);
2472
2473         memset(&dest->root_item.drop_progress, 0,
2474                 sizeof(dest->root_item.drop_progress));
2475         dest->root_item.drop_level = 0;
2476         btrfs_set_root_refs(&dest->root_item, 0);
2477
2478         if (!test_and_set_bit(BTRFS_ROOT_ORPHAN_ITEM_INSERTED, &dest->state)) {
2479                 ret = btrfs_insert_orphan_item(trans,
2480                                         fs_info->tree_root,
2481                                         dest->root_key.objectid);
2482                 if (ret) {
2483                         btrfs_abort_transaction(trans, ret);
2484                         err = ret;
2485                         goto out_end_trans;
2486                 }
2487         }
2488
2489         ret = btrfs_uuid_tree_rem(trans, fs_info, dest->root_item.uuid,
2490                                   BTRFS_UUID_KEY_SUBVOL,
2491                                   dest->root_key.objectid);
2492         if (ret && ret != -ENOENT) {
2493                 btrfs_abort_transaction(trans, ret);
2494                 err = ret;
2495                 goto out_end_trans;
2496         }
2497         if (!btrfs_is_empty_uuid(dest->root_item.received_uuid)) {
2498                 ret = btrfs_uuid_tree_rem(trans, fs_info,
2499                                           dest->root_item.received_uuid,
2500                                           BTRFS_UUID_KEY_RECEIVED_SUBVOL,
2501                                           dest->root_key.objectid);
2502                 if (ret && ret != -ENOENT) {
2503                         btrfs_abort_transaction(trans, ret);
2504                         err = ret;
2505                         goto out_end_trans;
2506                 }
2507         }
2508
2509 out_end_trans:
2510         trans->block_rsv = NULL;
2511         trans->bytes_reserved = 0;
2512         ret = btrfs_end_transaction(trans);
2513         if (ret && !err)
2514                 err = ret;
2515         inode->i_flags |= S_DEAD;
2516 out_release:
2517         btrfs_subvolume_release_metadata(fs_info, &block_rsv);
2518 out_up_write:
2519         up_write(&fs_info->subvol_sem);
2520         if (err) {
2521                 spin_lock(&dest->root_item_lock);
2522                 root_flags = btrfs_root_flags(&dest->root_item);
2523                 btrfs_set_root_flags(&dest->root_item,
2524                                 root_flags & ~BTRFS_ROOT_SUBVOL_DEAD);
2525                 spin_unlock(&dest->root_item_lock);
2526         }
2527 out_unlock_inode:
2528         inode_unlock(inode);
2529         if (!err) {
2530                 d_invalidate(dentry);
2531                 btrfs_invalidate_inodes(dest);
2532                 d_delete(dentry);
2533                 ASSERT(dest->send_in_progress == 0);
2534
2535                 /* the last ref */
2536                 if (dest->ino_cache_inode) {
2537                         iput(dest->ino_cache_inode);
2538                         dest->ino_cache_inode = NULL;
2539                 }
2540         }
2541 out_dput:
2542         dput(dentry);
2543 out_unlock_dir:
2544         inode_unlock(dir);
2545 out_drop_write:
2546         mnt_drop_write_file(file);
2547 out:
2548         kfree(vol_args);
2549         return err;
2550 }
2551
2552 static int btrfs_ioctl_defrag(struct file *file, void __user *argp)
2553 {
2554         struct inode *inode = file_inode(file);
2555         struct btrfs_root *root = BTRFS_I(inode)->root;
2556         struct btrfs_ioctl_defrag_range_args *range;
2557         int ret;
2558
2559         ret = mnt_want_write_file(file);
2560         if (ret)
2561                 return ret;
2562
2563         if (btrfs_root_readonly(root)) {
2564                 ret = -EROFS;
2565                 goto out;
2566         }
2567
2568         switch (inode->i_mode & S_IFMT) {
2569         case S_IFDIR:
2570                 if (!capable(CAP_SYS_ADMIN)) {
2571                         ret = -EPERM;
2572                         goto out;
2573                 }
2574                 ret = btrfs_defrag_root(root);
2575                 break;
2576         case S_IFREG:
2577                 if (!(file->f_mode & FMODE_WRITE)) {
2578                         ret = -EINVAL;
2579                         goto out;
2580                 }
2581
2582                 range = kzalloc(sizeof(*range), GFP_KERNEL);
2583                 if (!range) {
2584                         ret = -ENOMEM;
2585                         goto out;
2586                 }
2587
2588                 if (argp) {
2589                         if (copy_from_user(range, argp,
2590                                            sizeof(*range))) {
2591                                 ret = -EFAULT;
2592                                 kfree(range);
2593                                 goto out;
2594                         }
2595                         /* compression requires us to start the IO */
2596                         if ((range->flags & BTRFS_DEFRAG_RANGE_COMPRESS)) {
2597                                 range->flags |= BTRFS_DEFRAG_RANGE_START_IO;
2598                                 range->extent_thresh = (u32)-1;
2599                         }
2600                 } else {
2601                         /* the rest are all set to zero by kzalloc */
2602                         range->len = (u64)-1;
2603                 }
2604                 ret = btrfs_defrag_file(file_inode(file), file,
2605                                         range, BTRFS_OLDEST_GENERATION, 0);
2606                 if (ret > 0)
2607                         ret = 0;
2608                 kfree(range);
2609                 break;
2610         default:
2611                 ret = -EINVAL;
2612         }
2613 out:
2614         mnt_drop_write_file(file);
2615         return ret;
2616 }
2617
2618 static long btrfs_ioctl_add_dev(struct btrfs_fs_info *fs_info, void __user *arg)
2619 {
2620         struct btrfs_ioctl_vol_args *vol_args;
2621         int ret;
2622
2623         if (!capable(CAP_SYS_ADMIN))
2624                 return -EPERM;
2625
2626         if (test_and_set_bit(BTRFS_FS_EXCL_OP, &fs_info->flags))
2627                 return BTRFS_ERROR_DEV_EXCL_RUN_IN_PROGRESS;
2628
2629         mutex_lock(&fs_info->volume_mutex);
2630         vol_args = memdup_user(arg, sizeof(*vol_args));
2631         if (IS_ERR(vol_args)) {
2632                 ret = PTR_ERR(vol_args);
2633                 goto out;
2634         }
2635
2636         vol_args->name[BTRFS_PATH_NAME_MAX] = '\0';
2637         ret = btrfs_init_new_device(fs_info, vol_args->name);
2638
2639         if (!ret)
2640                 btrfs_info(fs_info, "disk added %s", vol_args->name);
2641
2642         kfree(vol_args);
2643 out:
2644         mutex_unlock(&fs_info->volume_mutex);
2645         clear_bit(BTRFS_FS_EXCL_OP, &fs_info->flags);
2646         return ret;
2647 }
2648
2649 static long btrfs_ioctl_rm_dev_v2(struct file *file, void __user *arg)
2650 {
2651         struct inode *inode = file_inode(file);
2652         struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
2653         struct btrfs_ioctl_vol_args_v2 *vol_args;
2654         int ret;
2655
2656         if (!capable(CAP_SYS_ADMIN))
2657                 return -EPERM;
2658
2659         ret = mnt_want_write_file(file);
2660         if (ret)
2661                 return ret;
2662
2663         vol_args = memdup_user(arg, sizeof(*vol_args));
2664         if (IS_ERR(vol_args)) {
2665                 ret = PTR_ERR(vol_args);
2666                 goto err_drop;
2667         }
2668
2669         /* Check for compatibility reject unknown flags */
2670         if (vol_args->flags & ~BTRFS_VOL_ARG_V2_FLAGS_SUPPORTED)
2671                 return -EOPNOTSUPP;
2672
2673         if (test_and_set_bit(BTRFS_FS_EXCL_OP, &fs_info->flags)) {
2674                 ret = BTRFS_ERROR_DEV_EXCL_RUN_IN_PROGRESS;
2675                 goto out;
2676         }
2677
2678         if (vol_args->flags & BTRFS_DEVICE_SPEC_BY_ID) {
2679                 ret = btrfs_rm_device(fs_info, NULL, vol_args->devid);
2680         } else {
2681                 vol_args->name[BTRFS_SUBVOL_NAME_MAX] = '\0';
2682                 ret = btrfs_rm_device(fs_info, vol_args->name, 0);
2683         }
2684         clear_bit(BTRFS_FS_EXCL_OP, &fs_info->flags);
2685
2686         if (!ret) {
2687                 if (vol_args->flags & BTRFS_DEVICE_SPEC_BY_ID)
2688                         btrfs_info(fs_info, "device deleted: id %llu",
2689                                         vol_args->devid);
2690                 else
2691                         btrfs_info(fs_info, "device deleted: %s",
2692                                         vol_args->name);
2693         }
2694 out:
2695         kfree(vol_args);
2696 err_drop:
2697         mnt_drop_write_file(file);
2698         return ret;
2699 }
2700
2701 static long btrfs_ioctl_rm_dev(struct file *file, void __user *arg)
2702 {
2703         struct inode *inode = file_inode(file);
2704         struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
2705         struct btrfs_ioctl_vol_args *vol_args;
2706         int ret;
2707
2708         if (!capable(CAP_SYS_ADMIN))
2709                 return -EPERM;
2710
2711         ret = mnt_want_write_file(file);
2712         if (ret)
2713                 return ret;
2714
2715         if (test_and_set_bit(BTRFS_FS_EXCL_OP, &fs_info->flags)) {
2716                 ret = BTRFS_ERROR_DEV_EXCL_RUN_IN_PROGRESS;
2717                 goto out_drop_write;
2718         }
2719
2720         vol_args = memdup_user(arg, sizeof(*vol_args));
2721         if (IS_ERR(vol_args)) {
2722                 ret = PTR_ERR(vol_args);
2723                 goto out;
2724         }
2725
2726         vol_args->name[BTRFS_PATH_NAME_MAX] = '\0';
2727         ret = btrfs_rm_device(fs_info, vol_args->name, 0);
2728
2729         if (!ret)
2730                 btrfs_info(fs_info, "disk deleted %s", vol_args->name);
2731         kfree(vol_args);
2732 out:
2733         clear_bit(BTRFS_FS_EXCL_OP, &fs_info->flags);
2734 out_drop_write:
2735         mnt_drop_write_file(file);
2736
2737         return ret;
2738 }
2739
2740 static long btrfs_ioctl_fs_info(struct btrfs_fs_info *fs_info,
2741                                 void __user *arg)
2742 {
2743         struct btrfs_ioctl_fs_info_args *fi_args;
2744         struct btrfs_device *device;
2745         struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
2746         int ret = 0;
2747
2748         fi_args = kzalloc(sizeof(*fi_args), GFP_KERNEL);
2749         if (!fi_args)
2750                 return -ENOMEM;
2751
2752         rcu_read_lock();
2753         fi_args->num_devices = fs_devices->num_devices;
2754
2755         list_for_each_entry_rcu(device, &fs_devices->devices, dev_list) {
2756                 if (device->devid > fi_args->max_id)
2757                         fi_args->max_id = device->devid;
2758         }
2759         rcu_read_unlock();
2760
2761         memcpy(&fi_args->fsid, fs_info->fsid, sizeof(fi_args->fsid));
2762         fi_args->nodesize = fs_info->nodesize;
2763         fi_args->sectorsize = fs_info->sectorsize;
2764         fi_args->clone_alignment = fs_info->sectorsize;
2765
2766         if (copy_to_user(arg, fi_args, sizeof(*fi_args)))
2767                 ret = -EFAULT;
2768
2769         kfree(fi_args);
2770         return ret;
2771 }
2772
2773 static long btrfs_ioctl_dev_info(struct btrfs_fs_info *fs_info,
2774                                  void __user *arg)
2775 {
2776         struct btrfs_ioctl_dev_info_args *di_args;
2777         struct btrfs_device *dev;
2778         int ret = 0;
2779         char *s_uuid = NULL;
2780
2781         di_args = memdup_user(arg, sizeof(*di_args));
2782         if (IS_ERR(di_args))
2783                 return PTR_ERR(di_args);
2784
2785         if (!btrfs_is_empty_uuid(di_args->uuid))
2786                 s_uuid = di_args->uuid;
2787
2788         rcu_read_lock();
2789         dev = btrfs_find_device(fs_info, di_args->devid, s_uuid, NULL);
2790
2791         if (!dev) {
2792                 ret = -ENODEV;
2793                 goto out;
2794         }
2795
2796         di_args->devid = dev->devid;
2797         di_args->bytes_used = btrfs_device_get_bytes_used(dev);
2798         di_args->total_bytes = btrfs_device_get_total_bytes(dev);
2799         memcpy(di_args->uuid, dev->uuid, sizeof(di_args->uuid));
2800         if (dev->name) {
2801                 struct rcu_string *name;
2802
2803                 name = rcu_dereference(dev->name);
2804                 strncpy(di_args->path, name->str, sizeof(di_args->path) - 1);
2805                 di_args->path[sizeof(di_args->path) - 1] = 0;
2806         } else {
2807                 di_args->path[0] = '\0';
2808         }
2809
2810 out:
2811         rcu_read_unlock();
2812         if (ret == 0 && copy_to_user(arg, di_args, sizeof(*di_args)))
2813                 ret = -EFAULT;
2814
2815         kfree(di_args);
2816         return ret;
2817 }
2818
2819 static struct page *extent_same_get_page(struct inode *inode, pgoff_t index)
2820 {
2821         struct page *page;
2822
2823         page = grab_cache_page(inode->i_mapping, index);
2824         if (!page)
2825                 return ERR_PTR(-ENOMEM);
2826
2827         if (!PageUptodate(page)) {
2828                 int ret;
2829
2830                 ret = btrfs_readpage(NULL, page);
2831                 if (ret)
2832                         return ERR_PTR(ret);
2833                 lock_page(page);
2834                 if (!PageUptodate(page)) {
2835                         unlock_page(page);
2836                         put_page(page);
2837                         return ERR_PTR(-EIO);
2838                 }
2839                 if (page->mapping != inode->i_mapping) {
2840                         unlock_page(page);
2841                         put_page(page);
2842                         return ERR_PTR(-EAGAIN);
2843                 }
2844         }
2845
2846         return page;
2847 }
2848
2849 static int gather_extent_pages(struct inode *inode, struct page **pages,
2850                                int num_pages, u64 off)
2851 {
2852         int i;
2853         pgoff_t index = off >> PAGE_SHIFT;
2854
2855         for (i = 0; i < num_pages; i++) {
2856 again:
2857                 pages[i] = extent_same_get_page(inode, index + i);
2858                 if (IS_ERR(pages[i])) {
2859                         int err = PTR_ERR(pages[i]);
2860
2861                         if (err == -EAGAIN)
2862                                 goto again;
2863                         pages[i] = NULL;
2864                         return err;
2865                 }
2866         }
2867         return 0;
2868 }
2869
2870 static int lock_extent_range(struct inode *inode, u64 off, u64 len,
2871                              bool retry_range_locking)
2872 {
2873         /*
2874          * Do any pending delalloc/csum calculations on inode, one way or
2875          * another, and lock file content.
2876          * The locking order is:
2877          *
2878          *   1) pages
2879          *   2) range in the inode's io tree
2880          */
2881         while (1) {
2882                 struct btrfs_ordered_extent *ordered;
2883                 lock_extent(&BTRFS_I(inode)->io_tree, off, off + len - 1);
2884                 ordered = btrfs_lookup_first_ordered_extent(inode,
2885                                                             off + len - 1);
2886                 if ((!ordered ||
2887                      ordered->file_offset + ordered->len <= off ||
2888                      ordered->file_offset >= off + len) &&
2889                     !test_range_bit(&BTRFS_I(inode)->io_tree, off,
2890                                     off + len - 1, EXTENT_DELALLOC, 0, NULL)) {
2891                         if (ordered)
2892                                 btrfs_put_ordered_extent(ordered);
2893                         break;
2894                 }
2895                 unlock_extent(&BTRFS_I(inode)->io_tree, off, off + len - 1);
2896                 if (ordered)
2897                         btrfs_put_ordered_extent(ordered);
2898                 if (!retry_range_locking)
2899                         return -EAGAIN;
2900                 btrfs_wait_ordered_range(inode, off, len);
2901         }
2902         return 0;
2903 }
2904
2905 static void btrfs_double_inode_unlock(struct inode *inode1, struct inode *inode2)
2906 {
2907         inode_unlock(inode1);
2908         inode_unlock(inode2);
2909 }
2910
2911 static void btrfs_double_inode_lock(struct inode *inode1, struct inode *inode2)
2912 {
2913         if (inode1 < inode2)
2914                 swap(inode1, inode2);
2915
2916         inode_lock_nested(inode1, I_MUTEX_PARENT);
2917         inode_lock_nested(inode2, I_MUTEX_CHILD);
2918 }
2919
2920 static void btrfs_double_extent_unlock(struct inode *inode1, u64 loff1,
2921                                       struct inode *inode2, u64 loff2, u64 len)
2922 {
2923         unlock_extent(&BTRFS_I(inode1)->io_tree, loff1, loff1 + len - 1);
2924         unlock_extent(&BTRFS_I(inode2)->io_tree, loff2, loff2 + len - 1);
2925 }
2926
2927 static int btrfs_double_extent_lock(struct inode *inode1, u64 loff1,
2928                                     struct inode *inode2, u64 loff2, u64 len,
2929                                     bool retry_range_locking)
2930 {
2931         int ret;
2932
2933         if (inode1 < inode2) {
2934                 swap(inode1, inode2);
2935                 swap(loff1, loff2);
2936         }
2937         ret = lock_extent_range(inode1, loff1, len, retry_range_locking);
2938         if (ret)
2939                 return ret;
2940         ret = lock_extent_range(inode2, loff2, len, retry_range_locking);
2941         if (ret)
2942                 unlock_extent(&BTRFS_I(inode1)->io_tree, loff1,
2943                               loff1 + len - 1);
2944         return ret;
2945 }
2946
2947 struct cmp_pages {
2948         int             num_pages;
2949         struct page     **src_pages;
2950         struct page     **dst_pages;
2951 };
2952
2953 static void btrfs_cmp_data_free(struct cmp_pages *cmp)
2954 {
2955         int i;
2956         struct page *pg;
2957
2958         for (i = 0; i < cmp->num_pages; i++) {
2959                 pg = cmp->src_pages[i];
2960                 if (pg) {
2961                         unlock_page(pg);
2962                         put_page(pg);
2963                 }
2964                 pg = cmp->dst_pages[i];
2965                 if (pg) {
2966                         unlock_page(pg);
2967                         put_page(pg);
2968                 }
2969         }
2970         kfree(cmp->src_pages);
2971         kfree(cmp->dst_pages);
2972 }
2973
2974 static int btrfs_cmp_data_prepare(struct inode *src, u64 loff,
2975                                   struct inode *dst, u64 dst_loff,
2976                                   u64 len, struct cmp_pages *cmp)
2977 {
2978         int ret;
2979         int num_pages = PAGE_ALIGN(len) >> PAGE_SHIFT;
2980         struct page **src_pgarr, **dst_pgarr;
2981
2982         /*
2983          * We must gather up all the pages before we initiate our
2984          * extent locking. We use an array for the page pointers. Size
2985          * of the array is bounded by len, which is in turn bounded by
2986          * BTRFS_MAX_DEDUPE_LEN.
2987          */
2988         src_pgarr = kcalloc(num_pages, sizeof(struct page *), GFP_KERNEL);
2989         dst_pgarr = kcalloc(num_pages, sizeof(struct page *), GFP_KERNEL);
2990         if (!src_pgarr || !dst_pgarr) {
2991                 kfree(src_pgarr);
2992                 kfree(dst_pgarr);
2993                 return -ENOMEM;
2994         }
2995         cmp->num_pages = num_pages;
2996         cmp->src_pages = src_pgarr;
2997         cmp->dst_pages = dst_pgarr;
2998
2999         /*
3000          * If deduping ranges in the same inode, locking rules make it mandatory
3001          * to always lock pages in ascending order to avoid deadlocks with
3002          * concurrent tasks (such as starting writeback/delalloc).
3003          */
3004         if (src == dst && dst_loff < loff) {
3005                 swap(src_pgarr, dst_pgarr);
3006                 swap(loff, dst_loff);
3007         }
3008
3009         ret = gather_extent_pages(src, src_pgarr, cmp->num_pages, loff);
3010         if (ret)
3011                 goto out;
3012
3013         ret = gather_extent_pages(dst, dst_pgarr, cmp->num_pages, dst_loff);
3014
3015 out:
3016         if (ret)
3017                 btrfs_cmp_data_free(cmp);
3018         return ret;
3019 }
3020
3021 static int btrfs_cmp_data(u64 len, struct cmp_pages *cmp)
3022 {
3023         int ret = 0;
3024         int i;
3025         struct page *src_page, *dst_page;
3026         unsigned int cmp_len = PAGE_SIZE;
3027         void *addr, *dst_addr;
3028
3029         i = 0;
3030         while (len) {
3031                 if (len < PAGE_SIZE)
3032                         cmp_len = len;
3033
3034                 BUG_ON(i >= cmp->num_pages);
3035
3036                 src_page = cmp->src_pages[i];
3037                 dst_page = cmp->dst_pages[i];
3038                 ASSERT(PageLocked(src_page));
3039                 ASSERT(PageLocked(dst_page));
3040
3041                 addr = kmap_atomic(src_page);
3042                 dst_addr = kmap_atomic(dst_page);
3043
3044                 flush_dcache_page(src_page);
3045                 flush_dcache_page(dst_page);
3046
3047                 if (memcmp(addr, dst_addr, cmp_len))
3048                         ret = -EBADE;
3049
3050                 kunmap_atomic(addr);
3051                 kunmap_atomic(dst_addr);
3052
3053                 if (ret)
3054                         break;
3055
3056                 len -= cmp_len;
3057                 i++;
3058         }
3059
3060         return ret;
3061 }
3062
3063 static int extent_same_check_offsets(struct inode *inode, u64 off, u64 *plen,
3064                                      u64 olen)
3065 {
3066         u64 len = *plen;
3067         u64 bs = BTRFS_I(inode)->root->fs_info->sb->s_blocksize;
3068
3069         if (off + olen > inode->i_size || off + olen < off)
3070                 return -EINVAL;
3071
3072         /* if we extend to eof, continue to block boundary */
3073         if (off + len == inode->i_size)
3074                 *plen = len = ALIGN(inode->i_size, bs) - off;
3075
3076         /* Check that we are block aligned - btrfs_clone() requires this */
3077         if (!IS_ALIGNED(off, bs) || !IS_ALIGNED(off + len, bs))
3078                 return -EINVAL;
3079
3080         return 0;
3081 }
3082
3083 static int btrfs_extent_same(struct inode *src, u64 loff, u64 olen,
3084                              struct inode *dst, u64 dst_loff)
3085 {
3086         int ret;
3087         u64 len = olen;
3088         struct cmp_pages cmp;
3089         bool same_inode = (src == dst);
3090         u64 same_lock_start = 0;
3091         u64 same_lock_len = 0;
3092
3093         if (len == 0)
3094                 return 0;
3095
3096         if (same_inode)
3097                 inode_lock(src);
3098         else
3099                 btrfs_double_inode_lock(src, dst);
3100
3101         ret = extent_same_check_offsets(src, loff, &len, olen);
3102         if (ret)
3103                 goto out_unlock;
3104
3105         ret = extent_same_check_offsets(dst, dst_loff, &len, olen);
3106         if (ret)
3107                 goto out_unlock;
3108
3109         if (same_inode) {
3110                 /*
3111                  * Single inode case wants the same checks, except we
3112                  * don't want our length pushed out past i_size as
3113                  * comparing that data range makes no sense.
3114                  *
3115                  * extent_same_check_offsets() will do this for an
3116                  * unaligned length at i_size, so catch it here and
3117                  * reject the request.
3118                  *
3119                  * This effectively means we require aligned extents
3120                  * for the single-inode case, whereas the other cases
3121                  * allow an unaligned length so long as it ends at
3122                  * i_size.
3123                  */
3124                 if (len != olen) {
3125                         ret = -EINVAL;
3126                         goto out_unlock;
3127                 }
3128
3129                 /* Check for overlapping ranges */
3130                 if (dst_loff + len > loff && dst_loff < loff + len) {
3131                         ret = -EINVAL;
3132                         goto out_unlock;
3133                 }
3134
3135                 same_lock_start = min_t(u64, loff, dst_loff);
3136                 same_lock_len = max_t(u64, loff, dst_loff) + len - same_lock_start;
3137         }
3138
3139         /* don't make the dst file partly checksummed */
3140         if ((BTRFS_I(src)->flags & BTRFS_INODE_NODATASUM) !=
3141             (BTRFS_I(dst)->flags & BTRFS_INODE_NODATASUM)) {
3142                 ret = -EINVAL;
3143                 goto out_unlock;
3144         }
3145
3146 again:
3147         ret = btrfs_cmp_data_prepare(src, loff, dst, dst_loff, olen, &cmp);
3148         if (ret)
3149                 goto out_unlock;
3150
3151         if (same_inode)
3152                 ret = lock_extent_range(src, same_lock_start, same_lock_len,
3153                                         false);
3154         else
3155                 ret = btrfs_double_extent_lock(src, loff, dst, dst_loff, len,
3156                                                false);
3157         /*
3158          * If one of the inodes has dirty pages in the respective range or
3159          * ordered extents, we need to flush dellaloc and wait for all ordered
3160          * extents in the range. We must unlock the pages and the ranges in the
3161          * io trees to avoid deadlocks when flushing delalloc (requires locking
3162          * pages) and when waiting for ordered extents to complete (they require
3163          * range locking).
3164          */
3165         if (ret == -EAGAIN) {
3166                 /*
3167                  * Ranges in the io trees already unlocked. Now unlock all
3168                  * pages before waiting for all IO to complete.
3169                  */
3170                 btrfs_cmp_data_free(&cmp);
3171                 if (same_inode) {
3172                         btrfs_wait_ordered_range(src, same_lock_start,
3173                                                  same_lock_len);
3174                 } else {
3175                         btrfs_wait_ordered_range(src, loff, len);
3176                         btrfs_wait_ordered_range(dst, dst_loff, len);
3177                 }
3178                 goto again;
3179         }
3180         ASSERT(ret == 0);
3181         if (WARN_ON(ret)) {
3182                 /* ranges in the io trees already unlocked */
3183                 btrfs_cmp_data_free(&cmp);
3184                 return ret;
3185         }
3186
3187         /* pass original length for comparison so we stay within i_size */
3188         ret = btrfs_cmp_data(olen, &cmp);
3189         if (ret == 0)
3190                 ret = btrfs_clone(src, dst, loff, olen, len, dst_loff, 1);
3191
3192         if (same_inode)
3193                 unlock_extent(&BTRFS_I(src)->io_tree, same_lock_start,
3194                               same_lock_start + same_lock_len - 1);
3195         else
3196                 btrfs_double_extent_unlock(src, loff, dst, dst_loff, len);
3197
3198         btrfs_cmp_data_free(&cmp);
3199 out_unlock:
3200         if (same_inode)
3201                 inode_unlock(src);
3202         else
3203                 btrfs_double_inode_unlock(src, dst);
3204
3205         return ret;
3206 }
3207
3208 #define BTRFS_MAX_DEDUPE_LEN    SZ_16M
3209
3210 ssize_t btrfs_dedupe_file_range(struct file *src_file, u64 loff, u64 olen,
3211                                 struct file *dst_file, u64 dst_loff)
3212 {
3213         struct inode *src = file_inode(src_file);
3214         struct inode *dst = file_inode(dst_file);
3215         u64 bs = BTRFS_I(src)->root->fs_info->sb->s_blocksize;
3216         ssize_t res;
3217
3218         if (olen > BTRFS_MAX_DEDUPE_LEN)
3219                 olen = BTRFS_MAX_DEDUPE_LEN;
3220
3221         if (WARN_ON_ONCE(bs < PAGE_SIZE)) {
3222                 /*
3223                  * Btrfs does not support blocksize < page_size. As a
3224                  * result, btrfs_cmp_data() won't correctly handle
3225                  * this situation without an update.
3226                  */
3227                 return -EINVAL;
3228         }
3229
3230         res = btrfs_extent_same(src, loff, olen, dst, dst_loff);
3231         if (res)
3232                 return res;
3233         return olen;
3234 }
3235
3236 static int clone_finish_inode_update(struct btrfs_trans_handle *trans,
3237                                      struct inode *inode,
3238                                      u64 endoff,
3239                                      const u64 destoff,
3240                                      const u64 olen,
3241                                      int no_time_update)
3242 {
3243         struct btrfs_root *root = BTRFS_I(inode)->root;
3244         int ret;
3245
3246         inode_inc_iversion(inode);
3247         if (!no_time_update)
3248                 inode->i_mtime = inode->i_ctime = current_time(inode);
3249         /*
3250          * We round up to the block size at eof when determining which
3251          * extents to clone above, but shouldn't round up the file size.
3252          */
3253         if (endoff > destoff + olen)
3254                 endoff = destoff + olen;
3255         if (endoff > inode->i_size)
3256                 btrfs_i_size_write(BTRFS_I(inode), endoff);
3257
3258         ret = btrfs_update_inode(trans, root, inode);
3259         if (ret) {
3260                 btrfs_abort_transaction(trans, ret);
3261                 btrfs_end_transaction(trans);