| // SPDX-License-Identifier: GPL-2.0 |
| /* |
| * Copyright (C) 2007 Oracle. All rights reserved. |
| */ |
| |
| #include <linux/kernel.h> |
| #include <linux/bio.h> |
| #include <linux/file.h> |
| #include <linux/fs.h> |
| #include <linux/fsnotify.h> |
| #include <linux/pagemap.h> |
| #include <linux/highmem.h> |
| #include <linux/time.h> |
| #include <linux/string.h> |
| #include <linux/backing-dev.h> |
| #include <linux/mount.h> |
| #include <linux/namei.h> |
| #include <linux/writeback.h> |
| #include <linux/compat.h> |
| #include <linux/security.h> |
| #include <linux/xattr.h> |
| #include <linux/mm.h> |
| #include <linux/slab.h> |
| #include <linux/blkdev.h> |
| #include <linux/uuid.h> |
| #include <linux/btrfs.h> |
| #include <linux/uaccess.h> |
| #include <linux/iversion.h> |
| #include "ctree.h" |
| #include "disk-io.h" |
| #include "transaction.h" |
| #include "btrfs_inode.h" |
| #include "print-tree.h" |
| #include "volumes.h" |
| #include "locking.h" |
| #include "inode-map.h" |
| #include "backref.h" |
| #include "rcu-string.h" |
| #include "send.h" |
| #include "dev-replace.h" |
| #include "props.h" |
| #include "sysfs.h" |
| #include "qgroup.h" |
| #include "tree-log.h" |
| #include "compression.h" |
| |
| #ifdef CONFIG_64BIT |
| /* If we have a 32-bit userspace and 64-bit kernel, then the UAPI |
| * structures are incorrect, as the timespec structure from userspace |
| * is 4 bytes too small. We define these alternatives here to teach |
| * the kernel about the 32-bit struct packing. |
| */ |
| struct btrfs_ioctl_timespec_32 { |
| __u64 sec; |
| __u32 nsec; |
| } __attribute__ ((__packed__)); |
| |
| struct btrfs_ioctl_received_subvol_args_32 { |
| char uuid[BTRFS_UUID_SIZE]; /* in */ |
| __u64 stransid; /* in */ |
| __u64 rtransid; /* out */ |
| struct btrfs_ioctl_timespec_32 stime; /* in */ |
| struct btrfs_ioctl_timespec_32 rtime; /* out */ |
| __u64 flags; /* in */ |
| __u64 reserved[16]; /* in */ |
| } __attribute__ ((__packed__)); |
| |
| #define BTRFS_IOC_SET_RECEIVED_SUBVOL_32 _IOWR(BTRFS_IOCTL_MAGIC, 37, \ |
| struct btrfs_ioctl_received_subvol_args_32) |
| #endif |
| |
| #if defined(CONFIG_64BIT) && defined(CONFIG_COMPAT) |
| struct btrfs_ioctl_send_args_32 { |
| __s64 send_fd; /* in */ |
| __u64 clone_sources_count; /* in */ |
| compat_uptr_t clone_sources; /* in */ |
| __u64 parent_root; /* in */ |
| __u64 flags; /* in */ |
| __u64 reserved[4]; /* in */ |
| } __attribute__ ((__packed__)); |
| |
| #define BTRFS_IOC_SEND_32 _IOW(BTRFS_IOCTL_MAGIC, 38, \ |
| struct btrfs_ioctl_send_args_32) |
| #endif |
| |
| static int btrfs_clone(struct inode *src, struct inode *inode, |
| u64 off, u64 olen, u64 olen_aligned, u64 destoff, |
| int no_time_update); |
| |
| /* Mask out flags that are inappropriate for the given type of inode. */ |
| static unsigned int btrfs_mask_fsflags_for_type(struct inode *inode, |
| unsigned int flags) |
| { |
| if (S_ISDIR(inode->i_mode)) |
| return flags; |
| else if (S_ISREG(inode->i_mode)) |
| return flags & ~FS_DIRSYNC_FL; |
| else |
| return flags & (FS_NODUMP_FL | FS_NOATIME_FL); |
| } |
| |
| /* |
| * Export internal inode flags to the format expected by the FS_IOC_GETFLAGS |
| * ioctl. |
| */ |
| static unsigned int btrfs_inode_flags_to_fsflags(unsigned int flags) |
| { |
| unsigned int iflags = 0; |
| |
| if (flags & BTRFS_INODE_SYNC) |
| iflags |= FS_SYNC_FL; |
| if (flags & BTRFS_INODE_IMMUTABLE) |
| iflags |= FS_IMMUTABLE_FL; |
| if (flags & BTRFS_INODE_APPEND) |
| iflags |= FS_APPEND_FL; |
| if (flags & BTRFS_INODE_NODUMP) |
| iflags |= FS_NODUMP_FL; |
| if (flags & BTRFS_INODE_NOATIME) |
| iflags |= FS_NOATIME_FL; |
| if (flags & BTRFS_INODE_DIRSYNC) |
| iflags |= FS_DIRSYNC_FL; |
| if (flags & BTRFS_INODE_NODATACOW) |
| iflags |= FS_NOCOW_FL; |
| |
| if (flags & BTRFS_INODE_NOCOMPRESS) |
| iflags |= FS_NOCOMP_FL; |
| else if (flags & BTRFS_INODE_COMPRESS) |
| iflags |= FS_COMPR_FL; |
| |
| return iflags; |
| } |
| |
| /* |
| * Update inode->i_flags based on the btrfs internal flags. |
| */ |
| void btrfs_sync_inode_flags_to_i_flags(struct inode *inode) |
| { |
| struct btrfs_inode *binode = BTRFS_I(inode); |
| unsigned int new_fl = 0; |
| |
| if (binode->flags & BTRFS_INODE_SYNC) |
| new_fl |= S_SYNC; |
| if (binode->flags & BTRFS_INODE_IMMUTABLE) |
| new_fl |= S_IMMUTABLE; |
| if (binode->flags & BTRFS_INODE_APPEND) |
| new_fl |= S_APPEND; |
| if (binode->flags & BTRFS_INODE_NOATIME) |
| new_fl |= S_NOATIME; |
| if (binode->flags & BTRFS_INODE_DIRSYNC) |
| new_fl |= S_DIRSYNC; |
| |
| set_mask_bits(&inode->i_flags, |
| S_SYNC | S_APPEND | S_IMMUTABLE | S_NOATIME | S_DIRSYNC, |
| new_fl); |
| } |
| |
| static int btrfs_ioctl_getflags(struct file *file, void __user *arg) |
| { |
| struct btrfs_inode *binode = BTRFS_I(file_inode(file)); |
| unsigned int flags = btrfs_inode_flags_to_fsflags(binode->flags); |
| |
| if (copy_to_user(arg, &flags, sizeof(flags))) |
| return -EFAULT; |
| return 0; |
| } |
| |
| /* Check if @flags are a supported and valid set of FS_*_FL flags */ |
| static int check_fsflags(unsigned int flags) |
| { |
| if (flags & ~(FS_IMMUTABLE_FL | FS_APPEND_FL | \ |
| FS_NOATIME_FL | FS_NODUMP_FL | \ |
| FS_SYNC_FL | FS_DIRSYNC_FL | \ |
| FS_NOCOMP_FL | FS_COMPR_FL | |
| FS_NOCOW_FL)) |
| return -EOPNOTSUPP; |
| |
| if ((flags & FS_NOCOMP_FL) && (flags & FS_COMPR_FL)) |
| return -EINVAL; |
| |
| return 0; |
| } |
| |
| static int btrfs_ioctl_setflags(struct file *file, void __user *arg) |
| { |
| struct inode *inode = file_inode(file); |
| struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); |
| struct btrfs_inode *binode = BTRFS_I(inode); |
| struct btrfs_root *root = binode->root; |
| struct btrfs_trans_handle *trans; |
| unsigned int fsflags, old_fsflags; |
| int ret; |
| u64 old_flags; |
| unsigned int old_i_flags; |
| umode_t mode; |
| |
| if (!inode_owner_or_capable(inode)) |
| return -EPERM; |
| |
| if (btrfs_root_readonly(root)) |
| return -EROFS; |
| |
| if (copy_from_user(&fsflags, arg, sizeof(fsflags))) |
| return -EFAULT; |
| |
| ret = check_fsflags(fsflags); |
| if (ret) |
| return ret; |
| |
| ret = mnt_want_write_file(file); |
| if (ret) |
| return ret; |
| |
| inode_lock(inode); |
| |
| old_flags = binode->flags; |
| old_i_flags = inode->i_flags; |
| mode = inode->i_mode; |
| |
| fsflags = btrfs_mask_fsflags_for_type(inode, fsflags); |
| old_fsflags = btrfs_inode_flags_to_fsflags(binode->flags); |
| if ((fsflags ^ old_fsflags) & (FS_APPEND_FL | FS_IMMUTABLE_FL)) { |
| if (!capable(CAP_LINUX_IMMUTABLE)) { |
| ret = -EPERM; |
| goto out_unlock; |
| } |
| } |
| |
| if (fsflags & FS_SYNC_FL) |
| binode->flags |= BTRFS_INODE_SYNC; |
| else |
| binode->flags &= ~BTRFS_INODE_SYNC; |
| if (fsflags & FS_IMMUTABLE_FL) |
| binode->flags |= BTRFS_INODE_IMMUTABLE; |
| else |
| binode->flags &= ~BTRFS_INODE_IMMUTABLE; |
| if (fsflags & FS_APPEND_FL) |
| binode->flags |= BTRFS_INODE_APPEND; |
| else |
| binode->flags &= ~BTRFS_INODE_APPEND; |
| if (fsflags & FS_NODUMP_FL) |
| binode->flags |= BTRFS_INODE_NODUMP; |
| else |
| binode->flags &= ~BTRFS_INODE_NODUMP; |
| if (fsflags & FS_NOATIME_FL) |
| binode->flags |= BTRFS_INODE_NOATIME; |
| else |
| binode->flags &= ~BTRFS_INODE_NOATIME; |
| if (fsflags & FS_DIRSYNC_FL) |
| binode->flags |= BTRFS_INODE_DIRSYNC; |
| else |
| binode->flags &= ~BTRFS_INODE_DIRSYNC; |
| if (fsflags & FS_NOCOW_FL) { |
| if (S_ISREG(mode)) { |
| /* |
| * It's safe to turn csums off here, no extents exist. |
| * Otherwise we want the flag to reflect the real COW |
| * status of the file and will not set it. |
| */ |
| if (inode->i_size == 0) |
| binode->flags |= BTRFS_INODE_NODATACOW |
| | BTRFS_INODE_NODATASUM; |
| } else { |
| binode->flags |= BTRFS_INODE_NODATACOW; |
| } |
| } else { |
| /* |
| * Revert back under same assumptions as above |
| */ |
| if (S_ISREG(mode)) { |
| if (inode->i_size == 0) |
| binode->flags &= ~(BTRFS_INODE_NODATACOW |
| | BTRFS_INODE_NODATASUM); |
| } else { |
| binode->flags &= ~BTRFS_INODE_NODATACOW; |
| } |
| } |
| |
| /* |
| * The COMPRESS flag can only be changed by users, while the NOCOMPRESS |
| * flag may be changed automatically if compression code won't make |
| * things smaller. |
| */ |
| if (fsflags & FS_NOCOMP_FL) { |
| binode->flags &= ~BTRFS_INODE_COMPRESS; |
| binode->flags |= BTRFS_INODE_NOCOMPRESS; |
| |
| ret = btrfs_set_prop(inode, "btrfs.compression", NULL, 0, 0); |
| if (ret && ret != -ENODATA) |
| goto out_drop; |
| } else if (fsflags & FS_COMPR_FL) { |
| const char *comp; |
| |
| binode->flags |= BTRFS_INODE_COMPRESS; |
| binode->flags &= ~BTRFS_INODE_NOCOMPRESS; |
| |
| comp = btrfs_compress_type2str(fs_info->compress_type); |
| if (!comp || comp[0] == 0) |
| comp = btrfs_compress_type2str(BTRFS_COMPRESS_ZLIB); |
| |
| ret = btrfs_set_prop(inode, "btrfs.compression", |
| comp, strlen(comp), 0); |
| if (ret) |
| goto out_drop; |
| |
| } else { |
| ret = btrfs_set_prop(inode, "btrfs.compression", NULL, 0, 0); |
| if (ret && ret != -ENODATA) |
| goto out_drop; |
| binode->flags &= ~(BTRFS_INODE_COMPRESS | BTRFS_INODE_NOCOMPRESS); |
| } |
| |
| trans = btrfs_start_transaction(root, 1); |
| if (IS_ERR(trans)) { |
| ret = PTR_ERR(trans); |
| goto out_drop; |
| } |
| |
| btrfs_sync_inode_flags_to_i_flags(inode); |
| inode_inc_iversion(inode); |
| inode->i_ctime = current_time(inode); |
| ret = btrfs_update_inode(trans, root, inode); |
| |
| btrfs_end_transaction(trans); |
| out_drop: |
| if (ret) { |
| binode->flags = old_flags; |
| inode->i_flags = old_i_flags; |
| } |
| |
| out_unlock: |
| inode_unlock(inode); |
| mnt_drop_write_file(file); |
| return ret; |
| } |
| |
| /* |
| * Translate btrfs internal inode flags to xflags as expected by the |
| * FS_IOC_FSGETXATT ioctl. Filter only the supported ones, unknown flags are |
| * silently dropped. |
| */ |
| static unsigned int btrfs_inode_flags_to_xflags(unsigned int flags) |
| { |
| unsigned int xflags = 0; |
| |
| if (flags & BTRFS_INODE_APPEND) |
| xflags |= FS_XFLAG_APPEND; |
| if (flags & BTRFS_INODE_IMMUTABLE) |
| xflags |= FS_XFLAG_IMMUTABLE; |
| if (flags & BTRFS_INODE_NOATIME) |
| xflags |= FS_XFLAG_NOATIME; |
| if (flags & BTRFS_INODE_NODUMP) |
| xflags |= FS_XFLAG_NODUMP; |
| if (flags & BTRFS_INODE_SYNC) |
| xflags |= FS_XFLAG_SYNC; |
| |
| return xflags; |
| } |
| |
| /* Check if @flags are a supported and valid set of FS_XFLAGS_* flags */ |
| static int check_xflags(unsigned int flags) |
| { |
| if (flags & ~(FS_XFLAG_APPEND | FS_XFLAG_IMMUTABLE | FS_XFLAG_NOATIME | |
| FS_XFLAG_NODUMP | FS_XFLAG_SYNC)) |
| return -EOPNOTSUPP; |
| return 0; |
| } |
| |
| /* |
| * Set the xflags from the internal inode flags. The remaining items of fsxattr |
| * are zeroed. |
| */ |
| static int btrfs_ioctl_fsgetxattr(struct file *file, void __user *arg) |
| { |
| struct btrfs_inode *binode = BTRFS_I(file_inode(file)); |
| struct fsxattr fa; |
| |
| memset(&fa, 0, sizeof(fa)); |
| fa.fsx_xflags = btrfs_inode_flags_to_xflags(binode->flags); |
| |
| if (copy_to_user(arg, &fa, sizeof(fa))) |
| return -EFAULT; |
| |
| return 0; |
| } |
| |
| static int btrfs_ioctl_fssetxattr(struct file *file, void __user *arg) |
| { |
| struct inode *inode = file_inode(file); |
| struct btrfs_inode *binode = BTRFS_I(inode); |
| struct btrfs_root *root = binode->root; |
| struct btrfs_trans_handle *trans; |
| struct fsxattr fa; |
| unsigned old_flags; |
| unsigned old_i_flags; |
| int ret = 0; |
| |
| if (!inode_owner_or_capable(inode)) |
| return -EPERM; |
| |
| if (btrfs_root_readonly(root)) |
| return -EROFS; |
| |
| memset(&fa, 0, sizeof(fa)); |
| if (copy_from_user(&fa, arg, sizeof(fa))) |
| return -EFAULT; |
| |
| ret = check_xflags(fa.fsx_xflags); |
| if (ret) |
| return ret; |
| |
| if (fa.fsx_extsize != 0 || fa.fsx_projid != 0 || fa.fsx_cowextsize != 0) |
| return -EOPNOTSUPP; |
| |
| ret = mnt_want_write_file(file); |
| if (ret) |
| return ret; |
| |
| inode_lock(inode); |
| |
| old_flags = binode->flags; |
| old_i_flags = inode->i_flags; |
| |
| /* We need the capabilities to change append-only or immutable inode */ |
| if (((old_flags & (BTRFS_INODE_APPEND | BTRFS_INODE_IMMUTABLE)) || |
| (fa.fsx_xflags & (FS_XFLAG_APPEND | FS_XFLAG_IMMUTABLE))) && |
| !capable(CAP_LINUX_IMMUTABLE)) { |
| ret = -EPERM; |
| goto out_unlock; |
| } |
| |
| if (fa.fsx_xflags & FS_XFLAG_SYNC) |
| binode->flags |= BTRFS_INODE_SYNC; |
| else |
| binode->flags &= ~BTRFS_INODE_SYNC; |
| if (fa.fsx_xflags & FS_XFLAG_IMMUTABLE) |
| binode->flags |= BTRFS_INODE_IMMUTABLE; |
| else |
| binode->flags &= ~BTRFS_INODE_IMMUTABLE; |
| if (fa.fsx_xflags & FS_XFLAG_APPEND) |
| binode->flags |= BTRFS_INODE_APPEND; |
| else |
| binode->flags &= ~BTRFS_INODE_APPEND; |
| if (fa.fsx_xflags & FS_XFLAG_NODUMP) |
| binode->flags |= BTRFS_INODE_NODUMP; |
| else |
| binode->flags &= ~BTRFS_INODE_NODUMP; |
| if (fa.fsx_xflags & FS_XFLAG_NOATIME) |
| binode->flags |= BTRFS_INODE_NOATIME; |
| else |
| binode->flags &= ~BTRFS_INODE_NOATIME; |
| |
| /* 1 item for the inode */ |
| trans = btrfs_start_transaction(root, 1); |
| if (IS_ERR(trans)) { |
| ret = PTR_ERR(trans); |
| goto out_unlock; |
| } |
| |
| btrfs_sync_inode_flags_to_i_flags(inode); |
| inode_inc_iversion(inode); |
| inode->i_ctime = current_time(inode); |
| ret = btrfs_update_inode(trans, root, inode); |
| |
| btrfs_end_transaction(trans); |
| |
| out_unlock: |
| if (ret) { |
| binode->flags = old_flags; |
| inode->i_flags = old_i_flags; |
| } |
| |
| inode_unlock(inode); |
| mnt_drop_write_file(file); |
| |
| return ret; |
| } |
| |
| static int btrfs_ioctl_getversion(struct file *file, int __user *arg) |
| { |
| struct inode *inode = file_inode(file); |
| |
| return put_user(inode->i_generation, arg); |
| } |
| |
| static noinline int btrfs_ioctl_fitrim(struct file *file, void __user *arg) |
| { |
| struct inode *inode = file_inode(file); |
| struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); |
| struct btrfs_device *device; |
| struct request_queue *q; |
| struct fstrim_range range; |
| u64 minlen = ULLONG_MAX; |
| u64 num_devices = 0; |
| int ret; |
| |
| if (!capable(CAP_SYS_ADMIN)) |
| return -EPERM; |
| |
| /* |
| * If the fs is mounted with nologreplay, which requires it to be |
| * mounted in RO mode as well, we can not allow discard on free space |
| * inside block groups, because log trees refer to extents that are not |
| * pinned in a block group's free space cache (pinning the extents is |
| * precisely the first phase of replaying a log tree). |
| */ |
| if (btrfs_test_opt(fs_info, NOLOGREPLAY)) |
| return -EROFS; |
| |
| rcu_read_lock(); |
| list_for_each_entry_rcu(device, &fs_info->fs_devices->devices, |
| dev_list) { |
| if (!device->bdev) |
| continue; |
| q = bdev_get_queue(device->bdev); |
| if (blk_queue_discard(q)) { |
| num_devices++; |
| minlen = min_t(u64, q->limits.discard_granularity, |
| minlen); |
| } |
| } |
| rcu_read_unlock(); |
| |
| if (!num_devices) |
| return -EOPNOTSUPP; |
| if (copy_from_user(&range, arg, sizeof(range))) |
| return -EFAULT; |
| |
| /* |
| * NOTE: Don't truncate the range using super->total_bytes. Bytenr of |
| * block group is in the logical address space, which can be any |
| * sectorsize aligned bytenr in the range [0, U64_MAX]. |
| */ |
| if (range.len < fs_info->sb->s_blocksize) |
| return -EINVAL; |
| |
| range.minlen = max(range.minlen, minlen); |
| ret = btrfs_trim_fs(fs_info, &range); |
| if (ret < 0) |
| return ret; |
| |
| if (copy_to_user(arg, &range, sizeof(range))) |
| return -EFAULT; |
| |
| return 0; |
| } |
| |
| int btrfs_is_empty_uuid(u8 *uuid) |
| { |
| int i; |
| |
| for (i = 0; i < BTRFS_UUID_SIZE; i++) { |
| if (uuid[i]) |
| return 0; |
| } |
| return 1; |
| } |
| |
| static noinline int create_subvol(struct inode *dir, |
| struct dentry *dentry, |
| const char *name, int namelen, |
| u64 *async_transid, |
| struct btrfs_qgroup_inherit *inherit) |
| { |
| struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb); |
| struct btrfs_trans_handle *trans; |
| struct btrfs_key key; |
| struct btrfs_root_item *root_item; |
| struct btrfs_inode_item *inode_item; |
| struct extent_buffer *leaf; |
| struct btrfs_root *root = BTRFS_I(dir)->root; |
| struct btrfs_root *new_root; |
| struct btrfs_block_rsv block_rsv; |
| struct timespec64 cur_time = current_time(dir); |
| struct inode *inode; |
| int ret; |
| int err; |
| u64 objectid; |
| u64 new_dirid = BTRFS_FIRST_FREE_OBJECTID; |
| u64 index = 0; |
| uuid_le new_uuid; |
| |
| root_item = kzalloc(sizeof(*root_item), GFP_KERNEL); |
| if (!root_item) |
| return -ENOMEM; |
| |
| ret = btrfs_find_free_objectid(fs_info->tree_root, &objectid); |
| if (ret) |
| goto fail_free; |
| |
| /* |
| * Don't create subvolume whose level is not zero. Or qgroup will be |
| * screwed up since it assumes subvolume qgroup's level to be 0. |
| */ |
| if (btrfs_qgroup_level(objectid)) { |
| ret = -ENOSPC; |
| goto fail_free; |
| } |
| |
| btrfs_init_block_rsv(&block_rsv, BTRFS_BLOCK_RSV_TEMP); |
| /* |
| * The same as the snapshot creation, please see the comment |
| * of create_snapshot(). |
| */ |
| ret = btrfs_subvolume_reserve_metadata(root, &block_rsv, 8, false); |
| if (ret) |
| goto fail_free; |
| |
| trans = btrfs_start_transaction(root, 0); |
| if (IS_ERR(trans)) { |
| ret = PTR_ERR(trans); |
| btrfs_subvolume_release_metadata(fs_info, &block_rsv); |
| goto fail_free; |
| } |
| trans->block_rsv = &block_rsv; |
| trans->bytes_reserved = block_rsv.size; |
| |
| ret = btrfs_qgroup_inherit(trans, 0, objectid, inherit); |
| if (ret) |
| goto fail; |
| |
| leaf = btrfs_alloc_tree_block(trans, root, 0, objectid, NULL, 0, 0, 0); |
| if (IS_ERR(leaf)) { |
| ret = PTR_ERR(leaf); |
| goto fail; |
| } |
| |
| btrfs_mark_buffer_dirty(leaf); |
| |
| inode_item = &root_item->inode; |
| btrfs_set_stack_inode_generation(inode_item, 1); |
| btrfs_set_stack_inode_size(inode_item, 3); |
| btrfs_set_stack_inode_nlink(inode_item, 1); |
| btrfs_set_stack_inode_nbytes(inode_item, |
| fs_info->nodesize); |
| btrfs_set_stack_inode_mode(inode_item, S_IFDIR | 0755); |
| |
| btrfs_set_root_flags(root_item, 0); |
| btrfs_set_root_limit(root_item, 0); |
| btrfs_set_stack_inode_flags(inode_item, BTRFS_INODE_ROOT_ITEM_INIT); |
| |
| btrfs_set_root_bytenr(root_item, leaf->start); |
| btrfs_set_root_generation(root_item, trans->transid); |
| btrfs_set_root_level(root_item, 0); |
| btrfs_set_root_refs(root_item, 1); |
| btrfs_set_root_used(root_item, leaf->len); |
| btrfs_set_root_last_snapshot(root_item, 0); |
| |
| btrfs_set_root_generation_v2(root_item, |
| btrfs_root_generation(root_item)); |
| uuid_le_gen(&new_uuid); |
| memcpy(root_item->uuid, new_uuid.b, BTRFS_UUID_SIZE); |
| btrfs_set_stack_timespec_sec(&root_item->otime, cur_time.tv_sec); |
| btrfs_set_stack_timespec_nsec(&root_item->otime, cur_time.tv_nsec); |
| root_item->ctime = root_item->otime; |
| btrfs_set_root_ctransid(root_item, trans->transid); |
| btrfs_set_root_otransid(root_item, trans->transid); |
| |
| btrfs_tree_unlock(leaf); |
| free_extent_buffer(leaf); |
| leaf = NULL; |
| |
| btrfs_set_root_dirid(root_item, new_dirid); |
| |
| key.objectid = objectid; |
| key.offset = 0; |
| key.type = BTRFS_ROOT_ITEM_KEY; |
| ret = btrfs_insert_root(trans, fs_info->tree_root, &key, |
| root_item); |
| if (ret) |
| goto fail; |
| |
| key.offset = (u64)-1; |
| new_root = btrfs_read_fs_root_no_name(fs_info, &key); |
| if (IS_ERR(new_root)) { |
| ret = PTR_ERR(new_root); |
| btrfs_abort_transaction(trans, ret); |
| goto fail; |
| } |
| |
| btrfs_record_root_in_trans(trans, new_root); |
| |
| ret = btrfs_create_subvol_root(trans, new_root, root, new_dirid); |
| if (ret) { |
| /* We potentially lose an unused inode item here */ |
| btrfs_abort_transaction(trans, ret); |
| goto fail; |
| } |
| |
| mutex_lock(&new_root->objectid_mutex); |
| new_root->highest_objectid = new_dirid; |
| mutex_unlock(&new_root->objectid_mutex); |
| |
| /* |
| * insert the directory item |
| */ |
| ret = btrfs_set_inode_index(BTRFS_I(dir), &index); |
| if (ret) { |
| btrfs_abort_transaction(trans, ret); |
| goto fail; |
| } |
| |
| ret = btrfs_insert_dir_item(trans, root, |
| name, namelen, BTRFS_I(dir), &key, |
| BTRFS_FT_DIR, index); |
| if (ret) { |
| btrfs_abort_transaction(trans, ret); |
| goto fail; |
| } |
| |
| btrfs_i_size_write(BTRFS_I(dir), dir->i_size + namelen * 2); |
| ret = btrfs_update_inode(trans, root, dir); |
| if (ret) { |
| btrfs_abort_transaction(trans, ret); |
| goto fail; |
| } |
| |
| ret = btrfs_add_root_ref(trans, objectid, root->root_key.objectid, |
| btrfs_ino(BTRFS_I(dir)), index, name, namelen); |
| if (ret) { |
| btrfs_abort_transaction(trans, ret); |
| goto fail; |
| } |
| |
| ret = btrfs_uuid_tree_add(trans, root_item->uuid, |
| BTRFS_UUID_KEY_SUBVOL, objectid); |
| if (ret) |
| btrfs_abort_transaction(trans, ret); |
| |
| fail: |
| kfree(root_item); |
| trans->block_rsv = NULL; |
| trans->bytes_reserved = 0; |
| btrfs_subvolume_release_metadata(fs_info, &block_rsv); |
| |
| if (async_transid) { |
| *async_transid = trans->transid; |
| err = btrfs_commit_transaction_async(trans, 1); |
| if (err) |
| err = btrfs_commit_transaction(trans); |
| } else { |
| err = btrfs_commit_transaction(trans); |
| } |
| if (err && !ret) |
| ret = err; |
| |
| if (!ret) { |
| inode = btrfs_lookup_dentry(dir, dentry); |
| if (IS_ERR(inode)) |
| return PTR_ERR(inode); |
| d_instantiate(dentry, inode); |
| } |
| return ret; |
| |
| fail_free: |
| kfree(root_item); |
| return ret; |
| } |
| |
| static int create_snapshot(struct btrfs_root *root, struct inode *dir, |
| struct dentry *dentry, |
| u64 *async_transid, bool readonly, |
| struct btrfs_qgroup_inherit *inherit) |
| { |
| struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb); |
| struct inode *inode; |
| struct btrfs_pending_snapshot *pending_snapshot; |
| struct btrfs_trans_handle *trans; |
| int ret; |
| bool snapshot_force_cow = false; |
| |
| if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) |
| return -EINVAL; |
| |
| pending_snapshot = kzalloc(sizeof(*pending_snapshot), GFP_KERNEL); |
| if (!pending_snapshot) |
| return -ENOMEM; |
| |
| pending_snapshot->root_item = kzalloc(sizeof(struct btrfs_root_item), |
| GFP_KERNEL); |
| pending_snapshot->path = btrfs_alloc_path(); |
| if (!pending_snapshot->root_item || !pending_snapshot->path) { |
| ret = -ENOMEM; |
| goto free_pending; |
| } |
| |
| /* |
| * Force new buffered writes to reserve space even when NOCOW is |
| * possible. This is to avoid later writeback (running dealloc) to |
| * fallback to COW mode and unexpectedly fail with ENOSPC. |
| */ |
| atomic_inc(&root->will_be_snapshotted); |
| smp_mb__after_atomic(); |
| /* wait for no snapshot writes */ |
| wait_event(root->subv_writers->wait, |
| percpu_counter_sum(&root->subv_writers->counter) == 0); |
| |
| ret = btrfs_start_delalloc_snapshot(root); |
| if (ret) |
| goto dec_and_free; |
| |
| /* |
| * All previous writes have started writeback in NOCOW mode, so now |
| * we force future writes to fallback to COW mode during snapshot |
| * creation. |
| */ |
| atomic_inc(&root->snapshot_force_cow); |
| snapshot_force_cow = true; |
| |
| btrfs_wait_ordered_extents(root, U64_MAX, 0, (u64)-1); |
| |
| btrfs_init_block_rsv(&pending_snapshot->block_rsv, |
| BTRFS_BLOCK_RSV_TEMP); |
| /* |
| * 1 - parent dir inode |
| * 2 - dir entries |
| * 1 - root item |
| * 2 - root ref/backref |
| * 1 - root of snapshot |
| * 1 - UUID item |
| */ |
| ret = btrfs_subvolume_reserve_metadata(BTRFS_I(dir)->root, |
| &pending_snapshot->block_rsv, 8, |
| false); |
| if (ret) |
| goto dec_and_free; |
| |
| pending_snapshot->dentry = dentry; |
| pending_snapshot->root = root; |
| pending_snapshot->readonly = readonly; |
| pending_snapshot->dir = dir; |
| pending_snapshot->inherit = inherit; |
| |
| trans = btrfs_start_transaction(root, 0); |
| if (IS_ERR(trans)) { |
| ret = PTR_ERR(trans); |
| goto fail; |
| } |
| |
| spin_lock(&fs_info->trans_lock); |
| list_add(&pending_snapshot->list, |
| &trans->transaction->pending_snapshots); |
| spin_unlock(&fs_info->trans_lock); |
| if (async_transid) { |
| *async_transid = trans->transid; |
| ret = btrfs_commit_transaction_async(trans, 1); |
| if (ret) |
| ret = btrfs_commit_transaction(trans); |
| } else { |
| ret = btrfs_commit_transaction(trans); |
| } |
| if (ret) |
| goto fail; |
| |
| ret = pending_snapshot->error; |
| if (ret) |
| goto fail; |
| |
| ret = btrfs_orphan_cleanup(pending_snapshot->snap); |
| if (ret) |
| goto fail; |
| |
| inode = btrfs_lookup_dentry(d_inode(dentry->d_parent), dentry); |
| if (IS_ERR(inode)) { |
| ret = PTR_ERR(inode); |
| goto fail; |
| } |
| |
| d_instantiate(dentry, inode); |
| ret = 0; |
| fail: |
| btrfs_subvolume_release_metadata(fs_info, &pending_snapshot->block_rsv); |
| dec_and_free: |
| if (snapshot_force_cow) |
| atomic_dec(&root->snapshot_force_cow); |
| if (atomic_dec_and_test(&root->will_be_snapshotted)) |
| wake_up_var(&root->will_be_snapshotted); |
| free_pending: |
| kfree(pending_snapshot->root_item); |
| btrfs_free_path(pending_snapshot->path); |
| kfree(pending_snapshot); |
| |
| return ret; |
| } |
| |
| /* copy of may_delete in fs/namei.c() |
| * Check whether we can remove a link victim from directory dir, check |
| * whether the type of victim is right. |
| * 1. We can't do it if dir is read-only (done in permission()) |
| * 2. We should have write and exec permissions on dir |
| * 3. We can't remove anything from append-only dir |
| * 4. We can't do anything with immutable dir (done in permission()) |
| * 5. If the sticky bit on dir is set we should either |
| * a. be owner of dir, or |
| * b. be owner of victim, or |
| * c. have CAP_FOWNER capability |
| * 6. If the victim is append-only or immutable we can't do anything with |
| * links pointing to it. |
| * 7. If we were asked to remove a directory and victim isn't one - ENOTDIR. |
| * 8. If we were asked to remove a non-directory and victim isn't one - EISDIR. |
| * 9. We can't remove a root or mountpoint. |
| * 10. We don't allow removal of NFS sillyrenamed files; it's handled by |
| * nfs_async_unlink(). |
| */ |
| |
| static int btrfs_may_delete(struct inode *dir, struct dentry *victim, int isdir) |
| { |
| int error; |
| |
| if (d_really_is_negative(victim)) |
| return -ENOENT; |
| |
| BUG_ON(d_inode(victim->d_parent) != dir); |
| audit_inode_child(dir, victim, AUDIT_TYPE_CHILD_DELETE); |
| |
| error = inode_permission(dir, MAY_WRITE | MAY_EXEC); |
| if (error) |
| return error; |
| if (IS_APPEND(dir)) |
| return -EPERM; |
| if (check_sticky(dir, d_inode(victim)) || IS_APPEND(d_inode(victim)) || |
| IS_IMMUTABLE(d_inode(victim)) || IS_SWAPFILE(d_inode(victim))) |
| return -EPERM; |
| if (isdir) { |
| if (!d_is_dir(victim)) |
| return -ENOTDIR; |
| if (IS_ROOT(victim)) |
| return -EBUSY; |
| } else if (d_is_dir(victim)) |
| return -EISDIR; |
| if (IS_DEADDIR(dir)) |
| return -ENOENT; |
| if (victim->d_flags & DCACHE_NFSFS_RENAMED) |
| return -EBUSY; |
| return 0; |
| } |
| |
| /* copy of may_create in fs/namei.c() */ |
| static inline int btrfs_may_create(struct inode *dir, struct dentry *child) |
| { |
| if (d_really_is_positive(child)) |
| return -EEXIST; |
| if (IS_DEADDIR(dir)) |
| return -ENOENT; |
| return inode_permission(dir, MAY_WRITE | MAY_EXEC); |
| } |
| |
| /* |
| * Create a new subvolume below @parent. This is largely modeled after |
| * sys_mkdirat and vfs_mkdir, but we only do a single component lookup |
| * inside this filesystem so it's quite a bit simpler. |
| */ |
| static noinline int btrfs_mksubvol(const struct path *parent, |
| const char *name, int namelen, |
| struct btrfs_root *snap_src, |
| u64 *async_transid, bool readonly, |
| struct btrfs_qgroup_inherit *inherit) |
| { |
| struct inode *dir = d_inode(parent->dentry); |
| struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb); |
| struct dentry *dentry; |
| int error; |
| |
| error = down_write_killable_nested(&dir->i_rwsem, I_MUTEX_PARENT); |
| if (error == -EINTR) |
| return error; |
| |
| dentry = lookup_one_len(name, parent->dentry, namelen); |
| error = PTR_ERR(dentry); |
| if (IS_ERR(dentry)) |
| goto out_unlock; |
| |
| error = btrfs_may_create(dir, dentry); |
| if (error) |
| goto out_dput; |
| |
| /* |
| * even if this name doesn't exist, we may get hash collisions. |
| * check for them now when we can safely fail |
| */ |
| error = btrfs_check_dir_item_collision(BTRFS_I(dir)->root, |
| dir->i_ino, name, |
| namelen); |
| if (error) |
| goto out_dput; |
| |
| down_read(&fs_info->subvol_sem); |
| |
| if (btrfs_root_refs(&BTRFS_I(dir)->root->root_item) == 0) |
| goto out_up_read; |
| |
| if (snap_src) { |
| error = create_snapshot(snap_src, dir, dentry, |
| async_transid, readonly, inherit); |
| } else { |
| error = create_subvol(dir, dentry, name, namelen, |
| async_transid, inherit); |
| } |
| if (!error) |
| fsnotify_mkdir(dir, dentry); |
| out_up_read: |
| up_read(&fs_info->subvol_sem); |
| out_dput: |
| dput(dentry); |
| out_unlock: |
| inode_unlock(dir); |
| return error; |
| } |
| |
| /* |
| * When we're defragging a range, we don't want to kick it off again |
| * if it is really just waiting for delalloc to send it down. |
| * If we find a nice big extent or delalloc range for the bytes in the |
| * file you want to defrag, we return 0 to let you know to skip this |
| * part of the file |
| */ |
| static int check_defrag_in_cache(struct inode *inode, u64 offset, u32 thresh) |
| { |
| struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; |
| struct extent_map *em = NULL; |
| struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; |
| u64 end; |
| |
| read_lock(&em_tree->lock); |
| em = lookup_extent_mapping(em_tree, offset, PAGE_SIZE); |
| read_unlock(&em_tree->lock); |
| |
| if (em) { |
| end = extent_map_end(em); |
| free_extent_map(em); |
| if (end - offset > thresh) |
| return 0; |
| } |
| /* if we already have a nice delalloc here, just stop */ |
| thresh /= 2; |
| end = count_range_bits(io_tree, &offset, offset + thresh, |
| thresh, EXTENT_DELALLOC, 1); |
| if (end >= thresh) |
| return 0; |
| return 1; |
| } |
| |
| /* |
| * helper function to walk through a file and find extents |
| * newer than a specific transid, and smaller than thresh. |
| * |
| * This is used by the defragging code to find new and small |
| * extents |
| */ |
| static int find_new_extents(struct btrfs_root *root, |
| struct inode *inode, u64 newer_than, |
| u64 *off, u32 thresh) |
| { |
| struct btrfs_path *path; |
| struct btrfs_key min_key; |
| struct extent_buffer *leaf; |
| struct btrfs_file_extent_item *extent; |
| int type; |
| int ret; |
| u64 ino = btrfs_ino(BTRFS_I(inode)); |
| |
| path = btrfs_alloc_path(); |
| if (!path) |
| return -ENOMEM; |
| |
| min_key.objectid = ino; |
| min_key.type = BTRFS_EXTENT_DATA_KEY; |
| min_key.offset = *off; |
| |
| while (1) { |
| ret = btrfs_search_forward(root, &min_key, path, newer_than); |
| if (ret != 0) |
| goto none; |
| process_slot: |
| if (min_key.objectid != ino) |
| goto none; |
| if (min_key.type != BTRFS_EXTENT_DATA_KEY) |
| goto none; |
| |
| leaf = path->nodes[0]; |
| extent = btrfs_item_ptr(leaf, path->slots[0], |
| struct btrfs_file_extent_item); |
| |
| type = btrfs_file_extent_type(leaf, extent); |
| if (type == BTRFS_FILE_EXTENT_REG && |
| btrfs_file_extent_num_bytes(leaf, extent) < thresh && |
| check_defrag_in_cache(inode, min_key.offset, thresh)) { |
| *off = min_key.offset; |
| btrfs_free_path(path); |
| return 0; |
| } |
| |
| path->slots[0]++; |
| if (path->slots[0] < btrfs_header_nritems(leaf)) { |
| btrfs_item_key_to_cpu(leaf, &min_key, path->slots[0]); |
| goto process_slot; |
| } |
| |
| if (min_key.offset == (u64)-1) |
| goto none; |
| |
| min_key.offset++; |
| btrfs_release_path(path); |
| } |
| none: |
| btrfs_free_path(path); |
| return -ENOENT; |
| } |
| |
| static struct extent_map *defrag_lookup_extent(struct inode *inode, u64 start) |
| { |
| struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; |
| struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; |
| struct extent_map *em; |
| u64 len = PAGE_SIZE; |
| |
| /* |
| * hopefully we have this extent in the tree already, try without |
| * the full extent lock |
| */ |
| read_lock(&em_tree->lock); |
| em = lookup_extent_mapping(em_tree, start, len); |
| read_unlock(&em_tree->lock); |
| |
| if (!em) { |
| struct extent_state *cached = NULL; |
| u64 end = start + len - 1; |
| |
| /* get the big lock and read metadata off disk */ |
| lock_extent_bits(io_tree, start, end, &cached); |
| em = btrfs_get_extent(BTRFS_I(inode), NULL, 0, start, len, 0); |
| unlock_extent_cached(io_tree, start, end, &cached); |
| |
| if (IS_ERR(em)) |
| return NULL; |
| } |
| |
| return em; |
| } |
| |
| static bool defrag_check_next_extent(struct inode *inode, struct extent_map *em) |
| { |
| struct extent_map *next; |
| bool ret = true; |
| |
| /* this is the last extent */ |
| if (em->start + em->len >= i_size_read(inode)) |
| return false; |
| |
| next = defrag_lookup_extent(inode, em->start + em->len); |
| if (!next || next->block_start >= EXTENT_MAP_LAST_BYTE) |
| ret = false; |
| else if ((em->block_start + em->block_len == next->block_start) && |
| (em->block_len > SZ_128K && next->block_len > SZ_128K)) |
| ret = false; |
| |
| free_extent_map(next); |
| return ret; |
| } |
| |
| static int should_defrag_range(struct inode *inode, u64 start, u32 thresh, |
| u64 *last_len, u64 *skip, u64 *defrag_end, |
| int compress) |
| { |
| struct extent_map *em; |
| int ret = 1; |
| bool next_mergeable = true; |
| bool prev_mergeable = true; |
| |
| /* |
| * make sure that once we start defragging an extent, we keep on |
| * defragging it |
| */ |
| if (start < *defrag_end) |
| return 1; |
| |
| *skip = 0; |
| |
| em = defrag_lookup_extent(inode, start); |
| if (!em) |
| return 0; |
| |
| /* this will cover holes, and inline extents */ |
| if (em->block_start >= EXTENT_MAP_LAST_BYTE) { |
| ret = 0; |
| goto out; |
| } |
| |
| if (!*defrag_end) |
| prev_mergeable = false; |
| |
| next_mergeable = defrag_check_next_extent(inode, em); |
| /* |
| * we hit a real extent, if it is big or the next extent is not a |
| * real extent, don't bother defragging it |
| */ |
| if (!compress && (*last_len == 0 || *last_len >= thresh) && |
| (em->len >= thresh || (!next_mergeable && !prev_mergeable))) |
| ret = 0; |
| out: |
| /* |
| * last_len ends up being a counter of how many bytes we've defragged. |
| * every time we choose not to defrag an extent, we reset *last_len |
| * so that the next tiny extent will force a defrag. |
| * |
| * The end result of this is that tiny extents before a single big |
| * extent will force at least part of that big extent to be defragged. |
| */ |
| if (ret) { |
| *defrag_end = extent_map_end(em); |
| } else { |
| *last_len = 0; |
| *skip = extent_map_end(em); |
| *defrag_end = 0; |
| } |
| |
| free_extent_map(em); |
| return ret; |
| } |
| |
| /* |
| * it doesn't do much good to defrag one or two pages |
| * at a time. This pulls in a nice chunk of pages |
| * to COW and defrag. |
| * |
| * It also makes sure the delalloc code has enough |
| * dirty data to avoid making new small extents as part |
| * of the defrag |
| * |
| * It's a good idea to start RA on this range |
| * before calling this. |
| */ |
| static int cluster_pages_for_defrag(struct inode *inode, |
| struct page **pages, |
| unsigned long start_index, |
| unsigned long num_pages) |
| { |
| unsigned long file_end; |
| u64 isize = i_size_read(inode); |
| u64 page_start; |
| u64 page_end; |
| u64 page_cnt; |
| int ret; |
| int i; |
| int i_done; |
| struct btrfs_ordered_extent *ordered; |
| struct extent_state *cached_state = NULL; |
| struct extent_io_tree *tree; |
| struct extent_changeset *data_reserved = NULL; |
| gfp_t mask = btrfs_alloc_write_mask(inode->i_mapping); |
| |
| file_end = (isize - 1) >> PAGE_SHIFT; |
| if (!isize || start_index > file_end) |
| return 0; |
| |
| page_cnt = min_t(u64, (u64)num_pages, (u64)file_end - start_index + 1); |
| |
| ret = btrfs_delalloc_reserve_space(inode, &data_reserved, |
| start_index << PAGE_SHIFT, |
| page_cnt << PAGE_SHIFT); |
| if (ret) |
| return ret; |
| i_done = 0; |
| tree = &BTRFS_I(inode)->io_tree; |
| |
| /* step one, lock all the pages */ |
| for (i = 0; i < page_cnt; i++) { |
| struct page *page; |
| again: |
| page = find_or_create_page(inode->i_mapping, |
| start_index + i, mask); |
| if (!page) |
| break; |
| |
| page_start = page_offset(page); |
| page_end = page_start + PAGE_SIZE - 1; |
| while (1) { |
| lock_extent_bits(tree, page_start, page_end, |
| &cached_state); |
| ordered = btrfs_lookup_ordered_extent(inode, |
| page_start); |
| unlock_extent_cached(tree, page_start, page_end, |
| &cached_state); |
| if (!ordered) |
| break; |
| |
| unlock_page(page); |
| btrfs_start_ordered_extent(inode, ordered, 1); |
| btrfs_put_ordered_extent(ordered); |
| lock_page(page); |
| /* |
| * we unlocked the page above, so we need check if |
| * it was released or not. |
| */ |
| if (page->mapping != inode->i_mapping) { |
| unlock_page(page); |
| put_page(page); |
| goto again; |
| } |
| } |
| |
| if (!PageUptodate(page)) { |
| btrfs_readpage(NULL, page); |
| lock_page(page); |
| if (!PageUptodate(page)) { |
| unlock_page(page); |
| put_page(page); |
| ret = -EIO; |
| break; |
| } |
| } |
| |
| if (page->mapping != inode->i_mapping) { |
| unlock_page(page); |
| put_page(page); |
| goto again; |
| } |
| |
| pages[i] = page; |
| i_done++; |
| } |
| if (!i_done || ret) |
| goto out; |
| |
| if (!(inode->i_sb->s_flags & SB_ACTIVE)) |
| goto out; |
| |
| /* |
| * so now we have a nice long stream of locked |
| * and up to date pages, lets wait on them |
| */ |
| for (i = 0; i < i_done; i++) |
| wait_on_page_writeback(pages[i]); |
| |
| page_start = page_offset(pages[0]); |
| page_end = page_offset(pages[i_done - 1]) + PAGE_SIZE; |
| |
| lock_extent_bits(&BTRFS_I(inode)->io_tree, |
| page_start, page_end - 1, &cached_state); |
| clear_extent_bit(&BTRFS_I(inode)->io_tree, page_start, |
| page_end - 1, EXTENT_DIRTY | EXTENT_DELALLOC | |
| EXTENT_DO_ACCOUNTING | EXTENT_DEFRAG, 0, 0, |
| &cached_state); |
| |
| if (i_done != page_cnt) { |
| spin_lock(&BTRFS_I(inode)->lock); |
| btrfs_mod_outstanding_extents(BTRFS_I(inode), 1); |
| spin_unlock(&BTRFS_I(inode)->lock); |
| btrfs_delalloc_release_space(inode, data_reserved, |
| start_index << PAGE_SHIFT, |
| (page_cnt - i_done) << PAGE_SHIFT, true); |
| } |
| |
| |
| set_extent_defrag(&BTRFS_I(inode)->io_tree, page_start, page_end - 1, |
| &cached_state); |
| |
| unlock_extent_cached(&BTRFS_I(inode)->io_tree, |
| page_start, page_end - 1, &cached_state); |
| |
| for (i = 0; i < i_done; i++) { |
| clear_page_dirty_for_io(pages[i]); |
| ClearPageChecked(pages[i]); |
| set_page_extent_mapped(pages[i]); |
| set_page_dirty(pages[i]); |
| unlock_page(pages[i]); |
| put_page(pages[i]); |
| } |
| btrfs_delalloc_release_extents(BTRFS_I(inode), page_cnt << PAGE_SHIFT); |
| extent_changeset_free(data_reserved); |
| return i_done; |
| out: |
| for (i = 0; i < i_done; i++) { |
| unlock_page(pages[i]); |
| put_page(pages[i]); |
| } |
| btrfs_delalloc_release_space(inode, data_reserved, |
| start_index << PAGE_SHIFT, |
| page_cnt << PAGE_SHIFT, true); |
| btrfs_delalloc_release_extents(BTRFS_I(inode), page_cnt << PAGE_SHIFT); |
| extent_changeset_free(data_reserved); |
| return ret; |
| |
| } |
| |
| int btrfs_defrag_file(struct inode *inode, struct file *file, |
| struct btrfs_ioctl_defrag_range_args *range, |
| u64 newer_than, unsigned long max_to_defrag) |
| { |
| struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); |
| struct btrfs_root *root = BTRFS_I(inode)->root; |
| struct file_ra_state *ra = NULL; |
| unsigned long last_index; |
| u64 isize = i_size_read(inode); |
| u64 last_len = 0; |
| u64 skip = 0; |
| u64 defrag_end = 0; |
| u64 newer_off = range->start; |
| unsigned long i; |
| unsigned long ra_index = 0; |
| int ret; |
| int defrag_count = 0; |
| int compress_type = BTRFS_COMPRESS_ZLIB; |
| u32 extent_thresh = range->extent_thresh; |
| unsigned long max_cluster = SZ_256K >> PAGE_SHIFT; |
| unsigned long cluster = max_cluster; |
| u64 new_align = ~((u64)SZ_128K - 1); |
| struct page **pages = NULL; |
| bool do_compress = range->flags & BTRFS_DEFRAG_RANGE_COMPRESS; |
| |
| if (isize == 0) |
| return 0; |
| |
| if (range->start >= isize) |
| return -EINVAL; |
| |
| if (do_compress) { |
| if (range->compress_type > BTRFS_COMPRESS_TYPES) |
| return -EINVAL; |
| if (range->compress_type) |
| compress_type = range->compress_type; |
| } |
| |
| if (extent_thresh == 0) |
| extent_thresh = SZ_256K; |
| |
| /* |
| * If we were not given a file, allocate a readahead context. As |
| * readahead is just an optimization, defrag will work without it so |
| * we don't error out. |
| */ |
| if (!file) { |
| ra = kzalloc(sizeof(*ra), GFP_KERNEL); |
| if (ra) |
| file_ra_state_init(ra, inode->i_mapping); |
| } else { |
| ra = &file->f_ra; |
| } |
| |
| pages = kmalloc_array(max_cluster, sizeof(struct page *), GFP_KERNEL); |
| if (!pages) { |
| ret = -ENOMEM; |
| goto out_ra; |
| } |
| |
| /* find the last page to defrag */ |
| if (range->start + range->len > range->start) { |
| last_index = min_t(u64, isize - 1, |
| range->start + range->len - 1) >> PAGE_SHIFT; |
| } else { |
| last_index = (isize - 1) >> PAGE_SHIFT; |
| } |
| |
| if (newer_than) { |
| ret = find_new_extents(root, inode, newer_than, |
| &newer_off, SZ_64K); |
| if (!ret) { |
| range->start = newer_off; |
| /* |
| * we always align our defrag to help keep |
| * the extents in the file evenly spaced |
| */ |
| i = (newer_off & new_align) >> PAGE_SHIFT; |
| } else |
| goto out_ra; |
| } else { |
| i = range->start >> PAGE_SHIFT; |
| } |
| if (!max_to_defrag) |
| max_to_defrag = last_index - i + 1; |
| |
| /* |
| * make writeback starts from i, so the defrag range can be |
| * written sequentially. |
| */ |
| if (i < inode->i_mapping->writeback_index) |
| inode->i_mapping->writeback_index = i; |
| |
| while (i <= last_index && defrag_count < max_to_defrag && |
| (i < DIV_ROUND_UP(i_size_read(inode), PAGE_SIZE))) { |
| /* |
| * make sure we stop running if someone unmounts |
| * the FS |
| */ |
| if (!(inode->i_sb->s_flags & SB_ACTIVE)) |
| break; |
| |
| if (btrfs_defrag_cancelled(fs_info)) { |
| btrfs_debug(fs_info, "defrag_file cancelled"); |
| ret = -EAGAIN; |
| break; |
| } |
| |
| if (!should_defrag_range(inode, (u64)i << PAGE_SHIFT, |
| extent_thresh, &last_len, &skip, |
| &defrag_end, do_compress)){ |
| unsigned long next; |
| /* |
| * the should_defrag function tells us how much to skip |
| * bump our counter by the suggested amount |
| */ |
| next = DIV_ROUND_UP(skip, PAGE_SIZE); |
| i = max(i + 1, next); |
| continue; |
| } |
| |
| if (!newer_than) { |
| cluster = (PAGE_ALIGN(defrag_end) >> |
| PAGE_SHIFT) - i; |
| cluster = min(cluster, max_cluster); |
| } else { |
| cluster = max_cluster; |
| } |
| |
| if (i + cluster > ra_index) { |
| ra_index = max(i, ra_index); |
| if (ra) |
| page_cache_sync_readahead(inode->i_mapping, ra, |
| file, ra_index, cluster); |
| ra_index += cluster; |
| } |
| |
| inode_lock(inode); |
| if (do_compress) |
| BTRFS_I(inode)->defrag_compress = compress_type; |
| ret = cluster_pages_for_defrag(inode, pages, i, cluster); |
| if (ret < 0) { |
| inode_unlock(inode); |
| goto out_ra; |
| } |
| |
| defrag_count += ret; |
| balance_dirty_pages_ratelimited(inode->i_mapping); |
| inode_unlock(inode); |
| |
| if (newer_than) { |
| if (newer_off == (u64)-1) |
| break; |
| |
| if (ret > 0) |
| i += ret; |
| |
| newer_off = max(newer_off + 1, |
| (u64)i << PAGE_SHIFT); |
| |
| ret = find_new_extents(root, inode, newer_than, |
| &newer_off, SZ_64K); |
| if (!ret) { |
| range->start = newer_off; |
| i = (newer_off & new_align) >> PAGE_SHIFT; |
| } else { |
| break; |
| } |
| } else { |
| if (ret > 0) { |
| i += ret; |
| last_len += ret << PAGE_SHIFT; |
| } else { |
| i++; |
| last_len = 0; |
| } |
| } |
| } |
| |
| if ((range->flags & BTRFS_DEFRAG_RANGE_START_IO)) { |
| filemap_flush(inode->i_mapping); |
| if (test_bit(BTRFS_INODE_HAS_ASYNC_EXTENT, |
| &BTRFS_I(inode)->runtime_flags)) |
| filemap_flush(inode->i_mapping); |
| } |
| |
| if (range->compress_type == BTRFS_COMPRESS_LZO) { |
| btrfs_set_fs_incompat(fs_info, COMPRESS_LZO); |
| } else if (range->compress_type == BTRFS_COMPRESS_ZSTD) { |
| btrfs_set_fs_incompat(fs_info, COMPRESS_ZSTD); |
| } |
| |
| ret = defrag_count; |
| |
| out_ra: |
| if (do_compress) { |
| inode_lock(inode); |
| BTRFS_I(inode)->defrag_compress = BTRFS_COMPRESS_NONE; |
| inode_unlock(inode); |
| } |
| if (!file) |
| kfree(ra); |
| kfree(pages); |
| return ret; |
| } |
| |
| static noinline int btrfs_ioctl_resize(struct file *file, |
| void __user *arg) |
| { |
| struct inode *inode = file_inode(file); |
| struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); |
| u64 new_size; |
| u64 old_size; |
| u64 devid = 1; |
| struct btrfs_root *root = BTRFS_I(inode)->root; |
| struct btrfs_ioctl_vol_args *vol_args; |
| struct btrfs_trans_handle *trans; |
| struct btrfs_device *device = NULL; |
| char *sizestr; |
| char *retptr; |
| char *devstr = NULL; |
| int ret = 0; |
| int mod = 0; |
| |
| if (!capable(CAP_SYS_ADMIN)) |
| return -EPERM; |
| |
| ret = mnt_want_write_file(file); |
| if (ret) |
| return ret; |
| |
| if (test_and_set_bit(BTRFS_FS_EXCL_OP, &fs_info->flags)) { |
| mnt_drop_write_file(file); |
| return BTRFS_ERROR_DEV_EXCL_RUN_IN_PROGRESS; |
| } |
| |
| vol_args = memdup_user(arg, sizeof(*vol_args)); |
| if (IS_ERR(vol_args)) { |
| ret = PTR_ERR(vol_args); |
| goto out; |
| } |
| |
| vol_args->name[BTRFS_PATH_NAME_MAX] = '\0'; |
| |
| sizestr = vol_args->name; |
| devstr = strchr(sizestr, ':'); |
| if (devstr) { |
| sizestr = devstr + 1; |
| *devstr = '\0'; |
| devstr = vol_args->name; |
| ret = kstrtoull(devstr, 10, &devid); |
| if (ret) |
| goto out_free; |
| if (!devid) { |
| ret = -EINVAL; |
| goto out_free; |
| } |
| btrfs_info(fs_info, "resizing devid %llu", devid); |
| } |
| |
| device = btrfs_find_device(fs_info, devid, NULL, NULL); |
| if (!device) { |
| btrfs_info(fs_info, "resizer unable to find device %llu", |
| devid); |
| ret = -ENODEV; |
| goto out_free; |
| } |
| |
| if (!test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state)) { |
| btrfs_info(fs_info, |
| "resizer unable to apply on readonly device %llu", |
| devid); |
| ret = -EPERM; |
| goto out_free; |
| } |
| |
| if (!strcmp(sizestr, "max")) |
| new_size = device->bdev->bd_inode->i_size; |
| else { |
| if (sizestr[0] == '-') { |
| mod = -1; |
| sizestr++; |
| } else if (sizestr[0] == '+') { |
| mod = 1; |
| sizestr++; |
| } |
| new_size = memparse(sizestr, &retptr); |
| if (*retptr != '\0' || new_size == 0) { |
| ret = -EINVAL; |
| goto out_free; |
| } |
| } |
| |
| if (test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state)) { |
| ret = -EPERM; |
| goto out_free; |
| } |
| |
| old_size = btrfs_device_get_total_bytes(device); |
| |
| if (mod < 0) { |
| if (new_size > old_size) { |
| ret = -EINVAL; |
| goto out_free; |
| } |
| new_size = old_size - new_size; |
| } else if (mod > 0) { |
| if (new_size > ULLONG_MAX - old_size) { |
| ret = -ERANGE; |
| goto out_free; |
| } |
| new_size = old_size + new_size; |
| } |
| |
| if (new_size < SZ_256M) { |
| ret = -EINVAL; |
| goto out_free; |
| } |
| if (new_size > device->bdev->bd_inode->i_size) { |
| ret = -EFBIG; |
| goto out_free; |
| } |
| |
| new_size = round_down(new_size, fs_info->sectorsize); |
| |
| btrfs_info_in_rcu(fs_info, "new size for %s is %llu", |
| rcu_str_deref(device->name), new_size); |
| |
| if (new_size > old_size) { |
| trans = btrfs_start_transaction(root, 0); |
| if (IS_ERR(trans)) { |
| ret = PTR_ERR(trans); |
| goto out_free; |
| } |
| ret = btrfs_grow_device(trans, device, new_size); |
| btrfs_commit_transaction(trans); |
| } else if (new_size < old_size) { |
| ret = btrfs_shrink_device(device, new_size); |
| } /* equal, nothing need to do */ |
| |
| out_free: |
| kfree(vol_args); |
| out: |
| clear_bit(BTRFS_FS_EXCL_OP, &fs_info->flags); |
| mnt_drop_write_file(file); |
| return ret; |
| } |
| |
| static noinline int btrfs_ioctl_snap_create_transid(struct file *file, |
| const char *name, unsigned long fd, int subvol, |
| u64 *transid, bool readonly, |
| struct btrfs_qgroup_inherit *inherit) |
| { |
| int namelen; |
| int ret = 0; |
| |
| if (!S_ISDIR(file_inode(file)->i_mode)) |
| return -ENOTDIR; |
| |
| ret = mnt_want_write_file(file); |
| if (ret) |
| goto out; |
| |
| namelen = strlen(name); |
| if (strchr(name, '/')) { |
| ret = -EINVAL; |
| goto out_drop_write; |
| } |
| |
| if (name[0] == '.' && |
| (namelen == 1 || (name[1] == '.' && namelen == 2))) { |
| ret = -EEXIST; |
| goto out_drop_write; |
| } |
| |
| if (subvol) { |
| ret = btrfs_mksubvol(&file->f_path, name, namelen, |
| NULL, transid, readonly, inherit); |
| } else { |
| struct fd src = fdget(fd); |
| struct inode *src_inode; |
| if (!src.file) { |
| ret = -EINVAL; |
| goto out_drop_write; |
| } |
| |
| src_inode = file_inode(src.file); |
| if (src_inode->i_sb != file_inode(file)->i_sb) { |
| btrfs_info(BTRFS_I(file_inode(file))->root->fs_info, |
| "Snapshot src from another FS"); |
| ret = -EXDEV; |
| } else if (!inode_owner_or_capable(src_inode)) { |
| /* |
| * Subvolume creation is not restricted, but snapshots |
| * are limited to own subvolumes only |
| */ |
| ret = -EPERM; |
| } else { |
| ret = btrfs_mksubvol(&file->f_path, name, namelen, |
| BTRFS_I(src_inode)->root, |
| transid, readonly, inherit); |
| } |
| fdput(src); |
| } |
| out_drop_write: |
| mnt_drop_write_file(file); |
| out: |
| return ret; |
| } |
| |
| static noinline int btrfs_ioctl_snap_create(struct file *file, |
| void __user *arg, int subvol) |
| { |
| struct btrfs_ioctl_vol_args *vol_args; |
| int ret; |
| |
| if (!S_ISDIR(file_inode(file)->i_mode)) |
| return -ENOTDIR; |
| |
| vol_args = memdup_user(arg, sizeof(*vol_args)); |
| if (IS_ERR(vol_args)) |
| return PTR_ERR(vol_args); |
| vol_args->name[BTRFS_PATH_NAME_MAX] = '\0'; |
| |
| ret = btrfs_ioctl_snap_create_transid(file, vol_args->name, |
| vol_args->fd, subvol, |
| NULL, false, NULL); |
| |
| kfree(vol_args); |
| return ret; |
| } |
| |
| static noinline int btrfs_ioctl_snap_create_v2(struct file *file, |
| void __user *arg, int subvol) |
| { |
| struct btrfs_ioctl_vol_args_v2 *vol_args; |
| int ret; |
| u64 transid = 0; |
| u64 *ptr = NULL; |
| bool readonly = false; |
| struct btrfs_qgroup_inherit *inherit = NULL; |
| |
| if (!S_ISDIR(file_inode(file)->i_mode)) |
| return -ENOTDIR; |
| |
| vol_args = memdup_user(arg, sizeof(*vol_args)); |
| if (IS_ERR(vol_args)) |
| return PTR_ERR(vol_args); |
| vol_args->name[BTRFS_SUBVOL_NAME_MAX] = '\0'; |
| |
| if (vol_args->flags & |
| ~(BTRFS_SUBVOL_CREATE_ASYNC | BTRFS_SUBVOL_RDONLY | |
| BTRFS_SUBVOL_QGROUP_INHERIT)) { |
| ret = -EOPNOTSUPP; |
| goto free_args; |
| } |
| |
| if (vol_args->flags & BTRFS_SUBVOL_CREATE_ASYNC) |
| ptr = &transid; |
| if (vol_args->flags & BTRFS_SUBVOL_RDONLY) |
| readonly = true; |
| if (vol_args->flags & BTRFS_SUBVOL_QGROUP_INHERIT) { |
| if (vol_args->size > PAGE_SIZE) { |
| ret = -EINVAL; |
| goto free_args; |
| } |
| inherit = memdup_user(vol_args->qgroup_inherit, vol_args->size); |
| if (IS_ERR(inherit)) { |
| ret = PTR_ERR(inherit); |
| goto free_args; |
| } |
| } |
| |
| ret = btrfs_ioctl_snap_create_transid(file, vol_args->name, |
| vol_args->fd, subvol, ptr, |
| readonly, inherit); |
| if (ret) |
| goto free_inherit; |
| |
| if (ptr && copy_to_user(arg + |
| offsetof(struct btrfs_ioctl_vol_args_v2, |
| transid), |
| ptr, sizeof(*ptr))) |
| ret = -EFAULT; |
| |
| free_inherit: |
| kfree(inherit); |
| free_args: |
| kfree(vol_args); |
| return ret; |
| } |
| |
| static noinline int btrfs_ioctl_subvol_getflags(struct file *file, |
| void __user *arg) |
| { |
| struct inode *inode = file_inode(file); |
| struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); |
| struct btrfs_root *root = BTRFS_I(inode)->root; |
| int ret = 0; |
| u64 flags = 0; |
| |
| if (btrfs_ino(BTRFS_I(inode)) != BTRFS_FIRST_FREE_OBJECTID) |
| return -EINVAL; |
| |
| down_read(&fs_info->subvol_sem); |
| if (btrfs_root_readonly(root)) |
| flags |= BTRFS_SUBVOL_RDONLY; |
| up_read(&fs_info->subvol_sem); |
| |
| if (copy_to_user(arg, &flags, sizeof(flags))) |
| ret = -EFAULT; |
| |
| return ret; |
| } |
| |
| static noinline int btrfs_ioctl_subvol_setflags(struct file *file, |
| void __user *arg) |
| { |
| struct inode *inode = file_inode(file); |
| struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); |
| struct btrfs_root *root = BTRFS_I(inode)->root; |
| struct btrfs_trans_handle *trans; |
| u64 root_flags; |
| u64 flags; |
| int ret = 0; |
| |
| if (!inode_owner_or_capable(inode)) |
| return -EPERM; |
| |
| ret = mnt_want_write_file(file); |
| if (ret) |
| goto out; |
| |
| if (btrfs_ino(BTRFS_I(inode)) != BTRFS_FIRST_FREE_OBJECTID) { |
| ret = -EINVAL; |
| goto out_drop_write; |
| } |
| |
| if (copy_from_user(&flags, arg, sizeof(flags))) { |
| ret = -EFAULT; |
| goto out_drop_write; |
| } |
| |
| if (flags & BTRFS_SUBVOL_CREATE_ASYNC) { |
| ret = -EINVAL; |
| goto out_drop_write; |
| } |
| |
| if (flags & ~BTRFS_SUBVOL_RDONLY) { |
| ret = -EOPNOTSUPP; |
| goto out_drop_write; |
| } |
| |
| down_write(&fs_info->subvol_sem); |
| |
| /* nothing to do */ |
| if (!!(flags & BTRFS_SUBVOL_RDONLY) == btrfs_root_readonly(root)) |
| goto out_drop_sem; |
| |
| root_flags = btrfs_root_flags(&root->root_item); |
| if (flags & BTRFS_SUBVOL_RDONLY) { |
| btrfs_set_root_flags(&root->root_item, |
| root_flags | BTRFS_ROOT_SUBVOL_RDONLY); |
| } else { |
| /* |
| * Block RO -> RW transition if this subvolume is involved in |
| * send |
| */ |
| spin_lock(&root->root_item_lock); |
| if (root->send_in_progress == 0) { |
| btrfs_set_root_flags(&root->root_item, |
| root_flags & ~BTRFS_ROOT_SUBVOL_RDONLY); |
| spin_unlock(&root->root_item_lock); |
| } else { |
| spin_unlock(&root->root_item_lock); |
| btrfs_warn(fs_info, |
| "Attempt to set subvolume %llu read-write during send", |
| root->root_key.objectid); |
| ret = -EPERM; |
| goto out_drop_sem; |
| } |
| } |
| |
| trans = btrfs_start_transaction(root, 1); |
| if (IS_ERR(trans)) { |
| ret = PTR_ERR(trans); |
| goto out_reset; |
| } |
| |
| ret = btrfs_update_root(trans, fs_info->tree_root, |
| &root->root_key, &root->root_item); |
| if (ret < 0) { |
| btrfs_end_transaction(trans); |
| goto out_reset; |
| } |
| |
| ret = btrfs_commit_transaction(trans); |
| |
| out_reset: |
| if (ret) |
| btrfs_set_root_flags(&root->root_item, root_flags); |
| out_drop_sem: |
| up_write(&fs_info->subvol_sem); |
| out_drop_write: |
| mnt_drop_write_file(file); |
| out: |
| return ret; |
| } |
| |
| static noinline int key_in_sk(struct btrfs_key *key, |
| struct btrfs_ioctl_search_key *sk) |
| { |
| struct btrfs_key test; |
| int ret; |
| |
| test.objectid = sk->min_objectid; |
| test.type = sk->min_type; |
| test.offset = sk->min_offset; |
| |
| ret = btrfs_comp_cpu_keys(key, &test); |
| if (ret < 0) |
| return 0; |
| |
| test.objectid = sk->max_objectid; |
| test.type = sk->max_type; |
| test.offset = sk->max_offset; |
| |
| ret = btrfs_comp_cpu_keys(key, &test); |
| if (ret > 0) |
| return 0; |
| return 1; |
| } |
| |
| static noinline int copy_to_sk(struct btrfs_path *path, |
| struct btrfs_key *key, |
| struct btrfs_ioctl_search_key *sk, |
| size_t *buf_size, |
| char __user *ubuf, |
| unsigned long *sk_offset, |
| int *num_found) |
| { |
| u64 found_transid; |
| struct extent_buffer *leaf; |
| struct btrfs_ioctl_search_header sh; |
| struct btrfs_key test; |
| unsigned long item_off; |
| unsigned long item_len; |
| int nritems; |
| int i; |
| int slot; |
| int ret = 0; |
| |
| leaf = path->nodes[0]; |
| slot = path->slots[0]; |
| nritems = btrfs_header_nritems(leaf); |
| |
| if (btrfs_header_generation(leaf) > sk->max_transid) { |
| i = nritems; |
| goto advance_key; |
| } |
| found_transid = btrfs_header_generation(leaf); |
| |
| for (i = slot; i < nritems; i++) { |
| item_off = btrfs_item_ptr_offset(leaf, i); |
| item_len = btrfs_item_size_nr(leaf, i); |
| |
| btrfs_item_key_to_cpu(leaf, key, i); |
| if (!key_in_sk(key, sk)) |
| continue; |
| |
| if (sizeof(sh) + item_len > *buf_size) { |
| if (*num_found) { |
| ret = 1; |
| goto out; |
| } |
| |
| /* |
| * return one empty item back for v1, which does not |
| * handle -EOVERFLOW |
| */ |
| |
| *buf_size = sizeof(sh) + item_len; |
| item_len = 0; |
| ret = -EOVERFLOW; |
| } |
| |
| if (sizeof(sh) + item_len + *sk_offset > *buf_size) { |
| ret = 1; |
| goto out; |
| } |
| |
| sh.objectid = key->objectid; |
| sh.offset = key->offset; |
| sh.type = key->type; |
| sh.len = item_len; |
| sh.transid = found_transid; |
| |
| /* copy search result header */ |
| if (copy_to_user(ubuf + *sk_offset, &sh, sizeof(sh))) { |
| ret = -EFAULT; |
| goto out; |
| } |
| |
| *sk_offset += sizeof(sh); |
| |
| if (item_len) { |
| char __user *up = ubuf + *sk_offset; |
| /* copy the item */ |
| if (read_extent_buffer_to_user(leaf, up, |
| item_off, item_len)) { |
| ret = -EFAULT; |
| goto out; |
| } |
| |
| *sk_offset += item_len; |
| } |
| (*num_found)++; |
| |
| if (ret) /* -EOVERFLOW from above */ |
| goto out; |
| |
| if (*num_found >= sk->nr_items) { |
| ret = 1; |
| goto out; |
| } |
| } |
| advance_key: |
| ret = 0; |
| test.objectid = sk->max_objectid; |
| test.type = sk->max_type; |
| test.offset = sk->max_offset; |
| if (btrfs_comp_cpu_keys(key, &test) >= 0) |
| ret = 1; |
| else if (key->offset < (u64)-1) |
| key->offset++; |
| else if (key->type < (u8)-1) { |
| key->offset = 0; |
| key->type++; |
| } else if (key->objectid < (u64)-1) { |
| key->offset = 0; |
| key->type = 0; |
| key->objectid++; |
| } else |
| ret = 1; |
| out: |
| /* |
| * 0: all items from this leaf copied, continue with next |
| * 1: * more items can be copied, but unused buffer is too small |
| * * all items were found |
| * Either way, it will stops the loop which iterates to the next |
| * leaf |
| * -EOVERFLOW: item was to large for buffer |
| * -EFAULT: could not copy extent buffer back to userspace |
| */ |
| return ret; |
| } |
| |
| static noinline int search_ioctl(struct inode *inode, |
| struct btrfs_ioctl_search_key *sk, |
| size_t *buf_size, |
| char __user *ubuf) |
| { |
| struct btrfs_fs_info *info = btrfs_sb(inode->i_sb); |
| struct btrfs_root *root; |
| struct btrfs_key key; |
| struct btrfs_path *path; |
| int ret; |
| int num_found = 0; |
| unsigned long sk_offset = 0; |
| |
| if (*buf_size < sizeof(struct btrfs_ioctl_search_header)) { |
| *buf_size = sizeof(struct btrfs_ioctl_search_header); |
| return -EOVERFLOW; |
| } |
| |
| path = btrfs_alloc_path(); |
| if (!path) |
| return -ENOMEM; |
| |
| if (sk->tree_id == 0) { |
| /* search the root of the inode that was passed */ |
| root = BTRFS_I(inode)->root; |
| } else { |
| key.objectid = sk->tree_id; |
| key.type = BTRFS_ROOT_ITEM_KEY; |
| key.offset = (u64)-1; |
| root = btrfs_read_fs_root_no_name(info, &key); |
| if (IS_ERR(root)) { |
| btrfs_free_path(path); |
| return PTR_ERR(root); |
| } |
| } |
| |
| key.objectid = sk->min_objectid; |
| key.type = sk->min_type; |
| key.offset = sk->min_offset; |
| |
| while (1) { |
| ret = btrfs_search_forward(root, &key, path, sk->min_transid); |
| if (ret != 0) { |
| if (ret > 0) |
| ret = 0; |
| goto err; |
| } |
| ret = copy_to_sk(path, &key, sk, buf_size, ubuf, |
| &sk_offset, &num_found); |
| btrfs_release_path(path); |
| if (ret) |
| break; |
| |
| } |
| if (ret > 0) |
| ret = 0; |
| err: |
| sk->nr_items = num_found; |
| btrfs_free_path(path); |
| return ret; |
| } |
| |
| static noinline int btrfs_ioctl_tree_search(struct file *file, |
| void __user *argp) |
| { |
| struct btrfs_ioctl_search_args __user *uargs; |
| struct btrfs_ioctl_search_key sk; |
| struct inode *inode; |
| int ret; |
| size_t buf_size; |
| |
| if (!capable(CAP_SYS_ADMIN)) |
| return -EPERM; |
| |
| uargs = (struct btrfs_ioctl_search_args __user *)argp; |
| |
| if (copy_from_user(&sk, &uargs->key, sizeof(sk))) |
| return -EFAULT; |
| |
| buf_size = sizeof(uargs->buf); |
| |
| inode = file_inode(file); |
| ret = search_ioctl(inode, &sk, &buf_size, uargs->buf); |
| |
| /* |
| * In the origin implementation an overflow is handled by returning a |
| * search header with a len of zero, so reset ret. |
| */ |
| if (ret == -EOVERFLOW) |
| ret = 0; |
| |
| if (ret == 0 && copy_to_user(&uargs->key, &sk, sizeof(sk))) |
| ret = -EFAULT; |
| return ret; |
| } |
| |
| static noinline int btrfs_ioctl_tree_search_v2(struct file *file, |
| void __user *argp) |
| { |
| struct btrfs_ioctl_search_args_v2 __user *uarg; |
| struct btrfs_ioctl_search_args_v2 args; |
| struct inode *inode; |
| int ret; |
| size_t buf_size; |
| const size_t buf_limit = SZ_16M; |
| |
| if (!capable(CAP_SYS_ADMIN)) |
| return -EPERM; |
| |
| /* copy search header and buffer size */ |
| uarg = (struct btrfs_ioctl_search_args_v2 __user *)argp; |
| if (copy_from_user(&args, uarg, sizeof(args))) |
| return -EFAULT; |
| |
| buf_size = args.buf_size; |
| |
| /* limit result size to 16MB */ |
| if (buf_size > buf_limit) |
| buf_size = buf_limit; |
| |
| inode = file_inode(file); |
| ret = search_ioctl(inode, &args.key, &buf_size, |
| (char __user *)(&uarg->buf[0])); |
| if (ret == 0 && copy_to_user(&uarg->key, &args.key, sizeof(args.key))) |
| ret = -EFAULT; |
| else if (ret == -EOVERFLOW && |
| copy_to_user(&uarg->buf_size, &buf_size, sizeof(buf_size))) |
| ret = -EFAULT; |
| |
| return ret; |
| } |
| |
| /* |
| * Search INODE_REFs to identify path name of 'dirid' directory |
| * in a 'tree_id' tree. and sets path name to 'name'. |
| */ |
| static noinline int btrfs_search_path_in_tree(struct btrfs_fs_info *info, |
| u64 tree_id, u64 dirid, char *name) |
| { |
| struct btrfs_root *root; |
| struct btrfs_key key; |
| char *ptr; |
| int ret = -1; |
| int slot; |
| int len; |
| int total_len = 0; |
| struct btrfs_inode_ref *iref; |
| struct extent_buffer *l; |
| struct btrfs_path *path; |
| |
| if (dirid == BTRFS_FIRST_FREE_OBJECTID) { |
| name[0]='\0'; |
| return 0; |
| } |
| |
| path = btrfs_alloc_path(); |
| if (!path) |
| return -ENOMEM; |
| |
| ptr = &name[BTRFS_INO_LOOKUP_PATH_MAX - 1]; |
| |
| key.objectid = tree_id; |
| key.type = BTRFS_ROOT_ITEM_KEY; |
| key.offset = (u64)-1; |
| root = btrfs_read_fs_root_no_name(info, &key); |
| if (IS_ERR(root)) { |
| ret = PTR_ERR(root); |
| goto out; |
| } |
| |
| key.objectid = dirid; |
| key.type = BTRFS_INODE_REF_KEY; |
| key.offset = (u64)-1; |
| |
| while (1) { |
| ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); |
| if (ret < 0) |
| goto out; |
| else if (ret > 0) { |
| ret = btrfs_previous_item(root, path, dirid, |
| BTRFS_INODE_REF_KEY); |
| if (ret < 0) |
| goto out; |
| else if (ret > 0) { |
| ret = -ENOENT; |
| goto out; |
| } |
| } |
| |
| l = path->nodes[0]; |
| slot = path->slots[0]; |
| btrfs_item_key_to_cpu(l, &key, slot); |
| |
| iref = btrfs_item_ptr(l, slot, struct btrfs_inode_ref); |
| len = btrfs_inode_ref_name_len(l, iref); |
| ptr -= len + 1; |
| total_len += len + 1; |
| if (ptr < name) { |
| ret = -ENAMETOOLONG; |
| goto out; |
| } |
| |
| *(ptr + len) = '/'; |
| read_extent_buffer(l, ptr, (unsigned long)(iref + 1), len); |
| |
| if (key.offset == BTRFS_FIRST_FREE_OBJECTID) |
| break; |
| |
| btrfs_release_path(path); |
| key.objectid = key.offset; |
| key.offset = (u64)-1; |
| dirid = key.objectid; |
| } |
| memmove(name, ptr, total_len); |
| name[total_len] = '\0'; |
| ret = 0; |
| out: |
| btrfs_free_path(path); |
| return ret; |
| } |
| |
| static int btrfs_search_path_in_tree_user(struct inode *inode, |
| struct btrfs_ioctl_ino_lookup_user_args *args) |
| { |
| struct btrfs_fs_info *fs_info = BTRFS_I(inode)->root->fs_info; |
| struct super_block *sb = inode->i_sb; |
| struct btrfs_key upper_limit = BTRFS_I(inode)->location; |
| u64 treeid = BTRFS_I(inode)->root->root_key.objectid; |
| u64 dirid = args->dirid; |
| unsigned long item_off; |
| unsigned long item_len; |
| struct btrfs_inode_ref *iref; |
| struct btrfs_root_ref *rref; |
| struct btrfs_root *root; |
| struct btrfs_path *path; |
| struct btrfs_key key, key2; |
| struct extent_buffer *leaf; |
| struct inode *temp_inode; |
| char *ptr; |
| int slot; |
| int len; |
| int total_len = 0; |
| int ret; |
| |
| path = btrfs_alloc_path(); |
| if (!path) |
| return -ENOMEM; |
| |
| /* |
| * If the bottom subvolume does not exist directly under upper_limit, |
| * construct the path in from the bottom up. |
| */ |
| if (dirid != upper_limit.objectid) { |
| ptr = &args->path[BTRFS_INO_LOOKUP_USER_PATH_MAX - 1]; |
| |
| key.objectid = treeid; |
| key.type = BTRFS_ROOT_ITEM_KEY; |
| key.offset = (u64)-1; |
| root = btrfs_read_fs_root_no_name(fs_info, &key); |
| if (IS_ERR(root)) { |
| ret = PTR_ERR(root); |
| goto out; |
| } |
| |
| key.objectid = dirid; |
| key.type = BTRFS_INODE_REF_KEY; |
| key.offset = (u64)-1; |
| while (1) { |
| ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); |
| if (ret < 0) { |
| goto out; |
| } else if (ret > 0) { |
| ret = btrfs_previous_item(root, path, dirid, |
| BTRFS_INODE_REF_KEY); |
| if (ret < 0) { |
| goto out; |
| } else if (ret > 0) { |
| ret = -ENOENT; |
| goto out; |
| } |
| } |
| |
| leaf = path->nodes[0]; |
| slot = path->slots[0]; |
| btrfs_item_key_to_cpu(leaf, &key, slot); |
| |
| iref = btrfs_item_ptr(leaf, slot, struct btrfs_inode_ref); |
| len = btrfs_inode_ref_name_len(leaf, iref); |
| ptr -= len + 1; |
| total_len += len + 1; |
| if (ptr < args->path) { |
| ret = -ENAMETOOLONG; |
| goto out; |
| } |
| |
| *(ptr + len) = '/'; |
| read_extent_buffer(leaf, ptr, |
| (unsigned long)(iref + 1), len); |
| |
| /* Check the read+exec permission of this directory */ |
| ret = btrfs_previous_item(root, path, dirid, |
| BTRFS_INODE_ITEM_KEY); |
| if (ret < 0) { |
| goto out; |
| } else if (ret > 0) { |
| ret = -ENOENT; |
| goto out; |
| } |
| |
| leaf = path->nodes[0]; |
| slot = path->slots[0]; |
| btrfs_item_key_to_cpu(leaf, &key2, slot); |
| if (key2.objectid != dirid) { |
| ret = -ENOENT; |
| goto out; |
| } |
| |
| temp_inode = btrfs_iget(sb, &key2, root, NULL); |
| if (IS_ERR(temp_inode)) { |
| ret = PTR_ERR(temp_inode); |
| goto out; |
| } |
| ret = inode_permission(temp_inode, MAY_READ | MAY_EXEC); |
| iput(temp_inode); |
| if (ret) { |
| ret = -EACCES; |
| goto out; |
| } |
| |
| if (key.offset == upper_limit.objectid) |
| break; |
| if (key.objectid == BTRFS_FIRST_FREE_OBJECTID) { |
| ret = -EACCES; |
| goto out; |
| } |
| |
| btrfs_release_path(path); |
| key.objectid = key.offset; |
| key.offset = (u64)-1; |
| dirid = key.objectid; |
| } |
| |
| memmove(args->path, ptr, total_len); |
| args->path[total_len] = '\0'; |
| btrfs_release_path(path); |
| } |
| |
| /* Get the bottom subvolume's name from ROOT_REF */ |
| root = fs_info->tree_root; |
| key.objectid = treeid; |
| key.type = BTRFS_ROOT_REF_KEY; |
| key.offset = args->treeid; |
| ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); |
| if (ret < 0) { |
| goto out; |
| } else if (ret > 0) { |
| ret = -ENOENT; |
| goto out; |
| } |
| |
| leaf = path->nodes[0]; |
| slot = path->slots[0]; |
| btrfs_item_key_to_cpu(leaf, &key, slot); |
| |
| item_off = btrfs_item_ptr_offset(leaf, slot); |
| item_len = btrfs_item_size_nr(leaf, slot); |
| /* Check if dirid in ROOT_REF corresponds to passed dirid */ |
| rref = btrfs_item_ptr(leaf, slot, struct btrfs_root_ref); |
| if (args->dirid != btrfs_root_ref_dirid(leaf, rref)) { |
| ret = -EINVAL; |
| goto out; |
| } |
| |
| /* Copy subvolume's name */ |
| item_off += sizeof(struct btrfs_root_ref); |
| item_len -= sizeof(struct btrfs_root_ref); |
| read_extent_buffer(leaf, args->name, item_off, item_len); |
| args->name[item_len] = 0; |
| |
| out: |
| btrfs_free_path(path); |
| return ret; |
| } |
| |
| static noinline int btrfs_ioctl_ino_lookup(struct file *file, |
| void __user *argp) |
| { |
| struct btrfs_ioctl_ino_lookup_args *args; |
| struct inode *inode; |
| int ret = 0; |
| |
| args = memdup_user(argp, sizeof(*args)); |
| if (IS_ERR(args)) |
| return PTR_ERR(args); |
| |
| inode = file_inode(file); |
| |
| /* |
| * Unprivileged query to obtain the containing subvolume root id. The |
| * path is reset so it's consistent with btrfs_search_path_in_tree. |
| */ |
| if (args->treeid == 0) |
| args->treeid = BTRFS_I(inode)->root->root_key.objectid; |
| |
| if (args->objectid == BTRFS_FIRST_FREE_OBJECTID) { |
| args->name[0] = 0; |
| goto out; |
| } |
| |
| if (!capable(CAP_SYS_ADMIN)) { |
| ret = -EPERM; |
| goto out; |
| } |
| |
| ret = btrfs_search_path_in_tree(BTRFS_I(inode)->root->fs_info, |
| args->treeid, args->objectid, |
| args->name); |
| |
| out: |
| if (ret == 0 && copy_to_user(argp, args, sizeof(*args))) |
| ret = -EFAULT; |
| |
| kfree(args); |
| return ret; |
| } |
| |
| /* |
| * Version of ino_lookup ioctl (unprivileged) |
| * |
| * The main differences from ino_lookup ioctl are: |
| * |
| * 1. Read + Exec permission will be checked using inode_permission() during |
| * path construction. -EACCES will be returned in case of failure. |
| * 2. Path construction will be stopped at the inode number which corresponds |
| * to the fd with which this ioctl is called. If constructed path does not |
| * exist under fd's inode, -EACCES will be returned. |
| * 3. The name of bottom subvolume is also searched and filled. |
| */ |
| static int btrfs_ioctl_ino_lookup_user(struct file *file, void __user *argp) |
| { |
| struct btrfs_ioctl_ino_lookup_user_args *args; |
| struct inode *inode; |
| int ret; |
| |
| args = memdup_user(argp, sizeof(*args)); |
| if (IS_ERR(args)) |
| return PTR_ERR(args); |
| |
| inode = file_inode(file); |
| |
| if (args->dirid == BTRFS_FIRST_FREE_OBJECTID && |
| BTRFS_I(inode)->location.objectid != BTRFS_FIRST_FREE_OBJECTID) { |
| /* |
| * The subvolume does not exist under fd with which this is |
| * called |
| */ |
| kfree(args); |
| return -EACCES; |
| } |
| |
| ret = btrfs_search_path_in_tree_user(inode, args); |
| |
| if (ret == 0 && copy_to_user(argp, args, sizeof(*args))) |
| ret = -EFAULT; |
| |
| kfree(args); |
| return ret; |
| } |
| |
| /* Get the subvolume information in BTRFS_ROOT_ITEM and BTRFS_ROOT_BACKREF */ |
| static int btrfs_ioctl_get_subvol_info(struct file *file, void __user *argp) |
| { |
| struct btrfs_ioctl_get_subvol_info_args *subvol_info; |
| struct btrfs_fs_info *fs_info; |
| struct btrfs_root *root; |
| struct btrfs_path *path; |
| struct btrfs_key key; |
| struct btrfs_root_item *root_item; |
| struct btrfs_root_ref *rref; |
| struct extent_buffer *leaf; |
| unsigned long item_off; |
| unsigned long item_len; |
| struct inode *inode; |
| int slot; |
| int ret = 0; |
| |
| path = btrfs_alloc_path(); |
| if (!path) |
| return -ENOMEM; |
| |
| subvol_info = kzalloc(sizeof(*subvol_info), GFP_KERNEL); |
| if (!subvol_info) { |
| btrfs_free_path(path); |
| return -ENOMEM; |
| } |
| |
| inode = file_inode(file); |
| fs_info = BTRFS_I(inode)->root->fs_info; |
| |
| /* Get root_item of inode's subvolume */ |
| key.objectid = BTRFS_I(inode)->root->root_key.objectid; |
| key.type = BTRFS_ROOT_ITEM_KEY; |
| key.offset = (u64)-1; |
| root = btrfs_read_fs_root_no_name(fs_info, &key); |
| if (IS_ERR(root)) { |
| ret = PTR_ERR(root); |
| goto out; |
| } |
| root_item = &root->root_item; |
| |
| subvol_info->treeid = key.objectid; |
| |
| subvol_info->generation = btrfs_root_generation(root_item); |
| subvol_info->flags = btrfs_root_flags(root_item); |
| |
| memcpy(subvol_info->uuid, root_item->uuid, BTRFS_UUID_SIZE); |
| memcpy(subvol_info->parent_uuid, root_item->parent_uuid, |
| BTRFS_UUID_SIZE); |
| memcpy(subvol_info->received_uuid, root_item->received_uuid, |
| BTRFS_UUID_SIZE); |
| |
| subvol_info->ctransid = btrfs_root_ctransid(root_item); |
| subvol_info->ctime.sec = btrfs_stack_timespec_sec(&root_item->ctime); |
| subvol_info->ctime.nsec = btrfs_stack_timespec_nsec(&root_item->ctime); |
| |
| subvol_info->otransid = btrfs_root_otransid(root_item); |
| subvol_info->otime.sec = btrfs_stack_timespec_sec(&root_item->otime); |
| subvol_info->otime.nsec = btrfs_stack_timespec_nsec(&root_item->otime); |
| |
| subvol_info->stransid = btrfs_root_stransid(root_item); |
| subvol_info->stime.sec = btrfs_stack_timespec_sec(&root_item->stime); |
| subvol_info->stime.nsec = btrfs_stack_timespec_nsec(&root_item->stime); |
| |
| subvol_info->rtransid = btrfs_root_rtransid(root_item); |
| subvol_info->rtime.sec = btrfs_stack_timespec_sec(&root_item->rtime); |
| subvol_info->rtime.nsec = btrfs_stack_timespec_nsec(&root_item->rtime); |
| |
| if (key.objectid != BTRFS_FS_TREE_OBJECTID) { |
| /* Search root tree for ROOT_BACKREF of this subvolume */ |
| root = fs_info->tree_root; |
| |
| key.type = BTRFS_ROOT_BACKREF_KEY; |
| key.offset = 0; |
| ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); |
| if (ret < 0) { |
| goto out; |
| } else if (path->slots[0] >= |
| btrfs_header_nritems(path->nodes[0])) { |
| ret = btrfs_next_leaf(root, path); |
| if (ret < 0) { |
| goto out; |
| } else if (ret > 0) { |
| ret = -EUCLEAN; |
| goto out; |
| } |
| } |
| |
| leaf = path->nodes[0]; |
| slot = path->slots[0]; |
| btrfs_item_key_to_cpu(leaf, &key, slot); |
| if (key.objectid == subvol_info->treeid && |
| key.type == BTRFS_ROOT_BACKREF_KEY) { |
| subvol_info->parent_id = key.offset; |
| |
| rref = btrfs_item_ptr(leaf, slot, struct btrfs_root_ref); |
| subvol_info->dirid = btrfs_root_ref_dirid(leaf, rref); |
| |
| item_off = btrfs_item_ptr_offset(leaf, slot) |
| + sizeof(struct btrfs_root_ref); |
| item_len = btrfs_item_size_nr(leaf, slot) |
| - sizeof(struct btrfs_root_ref); |
| read_extent_buffer(leaf, subvol_info->name, |
| item_off, item_len); |
| } else { |
| ret = -ENOENT; |
| goto out; |
| } |
| } |
| |
| if (copy_to_user(argp, subvol_info, sizeof(*subvol_info))) |
| ret = -EFAULT; |
| |
| out: |
| btrfs_free_path(path); |
| kzfree(subvol_info); |
| return ret; |
| } |
| |
| /* |
| * Return ROOT_REF information of the subvolume containing this inode |
| * except the subvolume name. |
| */ |
| static int btrfs_ioctl_get_subvol_rootref(struct file *file, void __user *argp) |
| { |
| struct btrfs_ioctl_get_subvol_rootref_args *rootrefs; |
| struct btrfs_root_ref *rref; |
| struct btrfs_root *root; |
| struct btrfs_path *path; |
| struct btrfs_key key; |
| struct extent_buffer *leaf; |
| struct inode *inode; |
| u64 objectid; |
| int slot; |
| int ret; |
| u8 found; |
| |
| path = btrfs_alloc_path(); |
| if (!path) |
| return -ENOMEM; |
| |
| rootrefs = memdup_user(argp, sizeof(*rootrefs)); |
| if (IS_ERR(rootrefs)) { |
| btrfs_free_path(path); |
| return PTR_ERR(rootrefs); |
| } |
| |
| inode = file_inode(file); |
| root = BTRFS_I(inode)->root->fs_info->tree_root; |
| objectid = BTRFS_I(inode)->root->root_key.objectid; |
| |
| key.objectid = objectid; |
| key.type = BTRFS_ROOT_REF_KEY; |
| key.offset = rootrefs->min_treeid; |
| found = 0; |
| |
| ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); |
| if (ret < 0) { |
| goto out; |
| } else if (path->slots[0] >= |
| btrfs_header_nritems(path->nodes[0])) { |
| ret = btrfs_next_leaf(root, path); |
| if (ret < 0) { |
| goto out; |
| } else if (ret > 0) { |
| ret = -EUCLEAN; |
| goto out; |
| } |
| } |
| while (1) { |
| leaf = path->nodes[0]; |
| slot = path->slots[0]; |
| |
| btrfs_item_key_to_cpu(leaf, &key, slot); |
| if (key.objectid != objectid || key.type != BTRFS_ROOT_REF_KEY) { |
| ret = 0; |
| goto out; |
| } |
| |
| if (found == BTRFS_MAX_ROOTREF_BUFFER_NUM) { |
| ret = -EOVERFLOW; |
| goto out; |
| } |
| |
| rref = btrfs_item_ptr(leaf, slot, struct btrfs_root_ref); |
| rootrefs->rootref[found].treeid = key.offset; |
| rootrefs->rootref[found].dirid = |
| btrfs_root_ref_dirid(leaf, rref); |
| found++; |
| |
| ret = btrfs_next_item(root, path); |
| if (ret < 0) { |
| goto out; |
| } else if (ret > 0) { |
| ret = -EUCLEAN; |
| goto out; |
| } |
| } |
| |
| out: |
| if (!ret || ret == -EOVERFLOW) { |
| rootrefs->num_items = found; |
| /* update min_treeid for next search */ |
| if (found) |
| rootrefs->min_treeid = |
| rootrefs->rootref[found - 1].treeid + 1; |
| if (copy_to_user(argp, rootrefs, sizeof(*rootrefs))) |
| ret = -EFAULT; |
| } |
| |
| kfree(rootrefs); |
| btrfs_free_path(path); |
| |
| return ret; |
| } |
| |
| static noinline int btrfs_ioctl_snap_destroy(struct file *file, |
| void __user *arg) |
| { |
| struct dentry *parent = file->f_path.dentry; |
| struct btrfs_fs_info *fs_info = btrfs_sb(parent->d_sb); |
| struct dentry *dentry; |
| struct inode *dir = d_inode(parent); |
| struct inode *inode; |
| struct btrfs_root *root = BTRFS_I(dir)->root; |
| struct btrfs_root *dest = NULL; |
| struct btrfs_ioctl_vol_args *vol_args; |
| int namelen; |
| int err = 0; |
| |
| if (!S_ISDIR(dir->i_mode)) |
| return -ENOTDIR; |
| |
| vol_args = memdup_user(arg, sizeof(*vol_args)); |
| if (IS_ERR(vol_args)) |
| return PTR_ERR(vol_args); |
| |
| vol_args->name[BTRFS_PATH_NAME_MAX] = '\0'; |
| namelen = strlen(vol_args->name); |
| if (strchr(vol_args->name, '/') || |
| strncmp(vol_args->name, "..", namelen) == 0) { |
| err = -EINVAL; |
| goto out; |
| } |
| |
| err = mnt_want_write_file(file); |
| if (err) |
| goto out; |
| |
| |
| err = down_write_killable_nested(&dir->i_rwsem, I_MUTEX_PARENT); |
| if (err == -EINTR) |
| goto out_drop_write; |
| dentry = lookup_one_len(vol_args->name, parent, namelen); |
| if (IS_ERR(dentry)) { |
| err = PTR_ERR(dentry); |
| goto out_unlock_dir; |
| } |
| |
| if (d_really_is_negative(dentry)) { |
| err = -ENOENT; |
| goto out_dput; |
| } |
| |
| inode = d_inode(dentry); |
| dest = BTRFS_I(inode)->root; |
| if (!capable(CAP_SYS_ADMIN)) { |
| /* |
| * Regular user. Only allow this with a special mount |
| * option, when the user has write+exec access to the |
| * subvol root, and when rmdir(2) would have been |
| * allowed. |
| * |
| * Note that this is _not_ check that the subvol is |
| * empty or doesn't contain data that we wouldn't |
| * otherwise be able to delete. |
| * |
| * Users who want to delete empty subvols should try |
| * rmdir(2). |
| */ |
| err = -EPERM; |
| if (!btrfs_test_opt(fs_info, USER_SUBVOL_RM_ALLOWED)) |
| goto out_dput; |
| |
| /* |
| * Do not allow deletion if the parent dir is the same |
| * as the dir to be deleted. That means the ioctl |
| * must be called on the dentry referencing the root |
| * of the subvol, not a random directory contained |
| * within it. |
| */ |
| err = -EINVAL; |
| if (root == dest) |
| goto out_dput; |
| |
| err = inode_permission(inode, MAY_WRITE | MAY_EXEC); |
| if (err) |
| goto out_dput; |
| } |
| |
| /* check if subvolume may be deleted by a user */ |
| err = btrfs_may_delete(dir, dentry, 1); |
| if (err) |
| goto out_dput; |
| |
| if (btrfs_ino(BTRFS_I(inode)) != BTRFS_FIRST_FREE_OBJECTID) { |
| err = -EINVAL; |
| goto out_dput; |
| } |
| |
| inode_lock(inode); |
| err = btrfs_delete_subvolume(dir, dentry); |
| inode_unlock(inode); |
| if (!err) |
| d_delete(dentry); |
| |
| out_dput: |
| dput(dentry); |
| out_unlock_dir: |
| inode_unlock(dir); |
| out_drop_write: |
| mnt_drop_write_file(file); |
| out: |
| kfree(vol_args); |
| return err; |
| } |
| |
| static int btrfs_ioctl_defrag(struct file *file, void __user *argp) |
| { |
| struct inode *inode = file_inode(file); |
| struct btrfs_root *root = BTRFS_I(inode)->root; |
| struct btrfs_ioctl_defrag_range_args *range; |
| int ret; |
| |
| ret = mnt_want_write_file(file); |
| if (ret) |
| return ret; |
| |
| if (btrfs_root_readonly(root)) { |
| ret = -EROFS; |
| goto out; |
| } |
| |
| switch (inode->i_mode & S_IFMT) { |
| case S_IFDIR: |
| if (!capable(CAP_SYS_ADMIN)) { |
| ret = -EPERM; |
| goto out; |
| } |
| ret = btrfs_defrag_root(root); |
| break; |
| case S_IFREG: |
| /* |
| * Note that this does not check the file descriptor for write |
| * access. This prevents defragmenting executables that are |
| * running and allows defrag on files open in read-only mode. |
| */ |
| if (!capable(CAP_SYS_ADMIN) && |
| inode_permission(inode, MAY_WRITE)) { |
| ret = -EPERM; |
| goto out; |
| } |
| |
| range = kzalloc(sizeof(*range), GFP_KERNEL); |
| if (!range) { |
| ret = -ENOMEM; |
| goto out; |
| } |
| |
| if (argp) { |
| if (copy_from_user(range, argp, |
| sizeof(*range))) { |
| ret = -EFAULT; |
| kfree(range); |
| goto out; |
| } |
| /* compression requires us to start the IO */ |
| if ((range->flags & BTRFS_DEFRAG_RANGE_COMPRESS)) { |
| range->flags |= BTRFS_DEFRAG_RANGE_START_IO; |
| range->extent_thresh = (u32)-1; |
| } |
| } else { |
| /* the rest are all set to zero by kzalloc */ |
| range->len = (u64)-1; |
| } |
| ret = btrfs_defrag_file(file_inode(file), file, |
| range, BTRFS_OLDEST_GENERATION, 0); |
| if (ret > 0) |
| ret = 0; |
| kfree(range); |
| break; |
| default: |
| ret = -EINVAL; |
| } |
| out: |
| mnt_drop_write_file(file); |
| return ret; |
| } |
| |
| static long btrfs_ioctl_add_dev(struct btrfs_fs_info *fs_info, void __user *arg) |
| { |
| struct btrfs_ioctl_vol_args *vol_args; |
| int ret; |
| |
| if (!capable(CAP_SYS_ADMIN)) |
| return -EPERM; |
| |
| if (test_and_set_bit(BTRFS_FS_EXCL_OP, &fs_info->flags)) |
| return BTRFS_ERROR_DEV_EXCL_RUN_IN_PROGRESS; |
| |
| vol_args = memdup_user(arg, sizeof(*vol_args)); |
| if (IS_ERR(vol_args)) { |
| ret = PTR_ERR(vol_args); |
| goto out; |
| } |
| |
| vol_args->name[BTRFS_PATH_NAME_MAX] = '\0'; |
| ret = btrfs_init_new_device(fs_info, vol_args->name); |
| |
| if (!ret) |
| btrfs_info(fs_info, "disk added %s", vol_args->name); |
| |
| kfree(vol_args); |
| out: |
| clear_bit(BTRFS_FS_EXCL_OP, &fs_info->flags); |
| return ret; |
| } |
| |
| static long btrfs_ioctl_rm_dev_v2(struct file *file, void __user *arg) |
| { |
| struct inode *inode = file_inode(file); |
| struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); |
| struct btrfs_ioctl_vol_args_v2 *vol_args; |
|