2 * Copyright (C) 2007 Oracle. All rights reserved.
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.
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.
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.
19 #include <linux/kernel.h>
20 #include <linux/bio.h>
21 #include <linux/buffer_head.h>
22 #include <linux/file.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/smp_lock.h>
31 #include <linux/backing-dev.h>
32 #include <linux/mount.h>
33 #include <linux/mpage.h>
34 #include <linux/namei.h>
35 #include <linux/swap.h>
36 #include <linux/writeback.h>
37 #include <linux/statfs.h>
38 #include <linux/compat.h>
39 #include <linux/bit_spinlock.h>
40 #include <linux/security.h>
41 #include <linux/version.h>
42 #include <linux/xattr.h>
43 #include <linux/vmalloc.h>
46 #include "transaction.h"
47 #include "btrfs_inode.h"
49 #include "print-tree.h"
55 static noinline int create_subvol(struct btrfs_root *root,
56 struct dentry *dentry,
57 char *name, int namelen)
59 struct btrfs_trans_handle *trans;
61 struct btrfs_root_item root_item;
62 struct btrfs_inode_item *inode_item;
63 struct extent_buffer *leaf;
64 struct btrfs_root *new_root = root;
69 u64 new_dirid = BTRFS_FIRST_FREE_OBJECTID;
72 ret = btrfs_check_free_space(root, 1, 0);
76 trans = btrfs_start_transaction(root, 1);
79 ret = btrfs_find_free_objectid(trans, root->fs_info->tree_root,
84 leaf = btrfs_alloc_free_block(trans, root, root->leafsize, 0,
85 objectid, trans->transid, 0, 0, 0);
91 btrfs_set_header_nritems(leaf, 0);
92 btrfs_set_header_level(leaf, 0);
93 btrfs_set_header_bytenr(leaf, leaf->start);
94 btrfs_set_header_generation(leaf, trans->transid);
95 btrfs_set_header_owner(leaf, objectid);
97 write_extent_buffer(leaf, root->fs_info->fsid,
98 (unsigned long)btrfs_header_fsid(leaf),
100 btrfs_mark_buffer_dirty(leaf);
102 inode_item = &root_item.inode;
103 memset(inode_item, 0, sizeof(*inode_item));
104 inode_item->generation = cpu_to_le64(1);
105 inode_item->size = cpu_to_le64(3);
106 inode_item->nlink = cpu_to_le32(1);
107 inode_item->nbytes = cpu_to_le64(root->leafsize);
108 inode_item->mode = cpu_to_le32(S_IFDIR | 0755);
110 btrfs_set_root_bytenr(&root_item, leaf->start);
111 btrfs_set_root_generation(&root_item, trans->transid);
112 btrfs_set_root_level(&root_item, 0);
113 btrfs_set_root_refs(&root_item, 1);
114 btrfs_set_root_used(&root_item, 0);
115 btrfs_set_root_last_snapshot(&root_item, 0);
117 memset(&root_item.drop_progress, 0, sizeof(root_item.drop_progress));
118 root_item.drop_level = 0;
120 btrfs_tree_unlock(leaf);
121 free_extent_buffer(leaf);
124 btrfs_set_root_dirid(&root_item, new_dirid);
126 key.objectid = objectid;
128 btrfs_set_key_type(&key, BTRFS_ROOT_ITEM_KEY);
129 ret = btrfs_insert_root(trans, root->fs_info->tree_root, &key,
135 * insert the directory item
137 key.offset = (u64)-1;
138 dir = root->fs_info->sb->s_root->d_inode;
139 ret = btrfs_insert_dir_item(trans, root->fs_info->tree_root,
140 name, namelen, dir->i_ino, &key,
145 ret = btrfs_insert_inode_ref(trans, root->fs_info->tree_root,
146 name, namelen, objectid,
147 root->fs_info->sb->s_root->d_inode->i_ino, 0);
151 ret = btrfs_commit_transaction(trans, root);
155 new_root = btrfs_read_fs_root(root->fs_info, &key, name, namelen);
158 trans = btrfs_start_transaction(new_root, 1);
161 ret = btrfs_create_subvol_root(new_root, dentry, trans, new_dirid,
162 BTRFS_I(dir)->block_group);
167 nr = trans->blocks_used;
168 err = btrfs_commit_transaction(trans, new_root);
172 btrfs_btree_balance_dirty(root, nr);
176 static int create_snapshot(struct btrfs_root *root, char *name, int namelen)
178 struct btrfs_pending_snapshot *pending_snapshot;
179 struct btrfs_trans_handle *trans;
182 unsigned long nr = 0;
187 ret = btrfs_check_free_space(root, 1, 0);
191 pending_snapshot = kmalloc(sizeof(*pending_snapshot), GFP_NOFS);
192 if (!pending_snapshot) {
196 pending_snapshot->name = kmalloc(namelen + 1, GFP_NOFS);
197 if (!pending_snapshot->name) {
199 kfree(pending_snapshot);
202 memcpy(pending_snapshot->name, name, namelen);
203 pending_snapshot->name[namelen] = '\0';
204 trans = btrfs_start_transaction(root, 1);
206 pending_snapshot->root = root;
207 list_add(&pending_snapshot->list,
208 &trans->transaction->pending_snapshots);
209 ret = btrfs_update_inode(trans, root, root->inode);
210 err = btrfs_commit_transaction(trans, root);
213 btrfs_btree_balance_dirty(root, nr);
217 /* copy of may_create in fs/namei.c() */
218 static inline int btrfs_may_create(struct inode *dir, struct dentry *child)
224 return inode_permission(dir, MAY_WRITE | MAY_EXEC);
228 * Create a new subvolume below @parent. This is largely modeled after
229 * sys_mkdirat and vfs_mkdir, but we only do a single component lookup
230 * inside this filesystem so it's quite a bit simpler.
232 static noinline int btrfs_mksubvol(struct path *parent, char *name,
233 int mode, int namelen)
235 struct dentry *dentry;
238 mutex_lock_nested(&parent->dentry->d_inode->i_mutex, I_MUTEX_PARENT);
240 dentry = lookup_one_len(name, parent->dentry, namelen);
241 error = PTR_ERR(dentry);
249 if (!IS_POSIXACL(parent->dentry->d_inode))
250 mode &= ~current->fs->umask;
251 error = mnt_want_write(parent->mnt);
255 error = btrfs_may_create(parent->dentry->d_inode, dentry);
260 * Actually perform the low-level subvolume creation after all
263 * Eventually we want to pass in an inode under which we create this
264 * subvolume, but for now all are under the filesystem root.
266 * Also we should pass on the mode eventually to allow creating new
267 * subvolume with specific mode bits.
269 error = create_subvol(BTRFS_I(parent->dentry->d_inode)->root, dentry,
274 fsnotify_mkdir(parent->dentry->d_inode, dentry);
276 mnt_drop_write(parent->mnt);
280 mutex_unlock(&parent->dentry->d_inode->i_mutex);
285 int btrfs_defrag_file(struct file *file)
287 struct inode *inode = fdentry(file)->d_inode;
288 struct btrfs_root *root = BTRFS_I(inode)->root;
289 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
290 struct btrfs_ordered_extent *ordered;
292 unsigned long last_index;
293 unsigned long ra_pages = root->fs_info->bdi.ra_pages;
294 unsigned long total_read = 0;
300 ret = btrfs_check_free_space(root, inode->i_size, 0);
304 mutex_lock(&inode->i_mutex);
305 last_index = inode->i_size >> PAGE_CACHE_SHIFT;
306 for (i = 0; i <= last_index; i++) {
307 if (total_read % ra_pages == 0) {
308 btrfs_force_ra(inode->i_mapping, &file->f_ra, file, i,
309 min(last_index, i + ra_pages - 1));
313 page = grab_cache_page(inode->i_mapping, i);
316 if (!PageUptodate(page)) {
317 btrfs_readpage(NULL, page);
319 if (!PageUptodate(page)) {
321 page_cache_release(page);
326 wait_on_page_writeback(page);
328 page_start = (u64)page->index << PAGE_CACHE_SHIFT;
329 page_end = page_start + PAGE_CACHE_SIZE - 1;
330 lock_extent(io_tree, page_start, page_end, GFP_NOFS);
332 ordered = btrfs_lookup_ordered_extent(inode, page_start);
334 unlock_extent(io_tree, page_start, page_end, GFP_NOFS);
336 page_cache_release(page);
337 btrfs_start_ordered_extent(inode, ordered, 1);
338 btrfs_put_ordered_extent(ordered);
341 set_page_extent_mapped(page);
344 * this makes sure page_mkwrite is called on the
345 * page if it is dirtied again later
347 clear_page_dirty_for_io(page);
349 btrfs_set_extent_delalloc(inode, page_start, page_end);
351 unlock_extent(io_tree, page_start, page_end, GFP_NOFS);
352 set_page_dirty(page);
354 page_cache_release(page);
355 balance_dirty_pages_ratelimited_nr(inode->i_mapping, 1);
359 mutex_unlock(&inode->i_mutex);
364 * Called inside transaction, so use GFP_NOFS
367 static int btrfs_ioctl_resize(struct btrfs_root *root, void __user *arg)
372 struct btrfs_ioctl_vol_args *vol_args;
373 struct btrfs_trans_handle *trans;
374 struct btrfs_device *device = NULL;
381 if (root->fs_info->sb->s_flags & MS_RDONLY)
384 vol_args = kmalloc(sizeof(*vol_args), GFP_NOFS);
389 if (copy_from_user(vol_args, arg, sizeof(*vol_args))) {
394 vol_args->name[BTRFS_PATH_NAME_MAX] = '\0';
395 namelen = strlen(vol_args->name);
397 mutex_lock(&root->fs_info->volume_mutex);
398 sizestr = vol_args->name;
399 devstr = strchr(sizestr, ':');
402 sizestr = devstr + 1;
404 devstr = vol_args->name;
405 devid = simple_strtoull(devstr, &end, 10);
406 printk(KERN_INFO "resizing devid %llu\n", devid);
408 device = btrfs_find_device(root, devid, NULL);
410 printk(KERN_INFO "resizer unable to find device %llu\n", devid);
414 if (!strcmp(sizestr, "max"))
415 new_size = device->bdev->bd_inode->i_size;
417 if (sizestr[0] == '-') {
420 } else if (sizestr[0] == '+') {
424 new_size = btrfs_parse_size(sizestr);
431 old_size = device->total_bytes;
434 if (new_size > old_size) {
438 new_size = old_size - new_size;
439 } else if (mod > 0) {
440 new_size = old_size + new_size;
443 if (new_size < 256 * 1024 * 1024) {
447 if (new_size > device->bdev->bd_inode->i_size) {
452 do_div(new_size, root->sectorsize);
453 new_size *= root->sectorsize;
455 printk(KERN_INFO "new size for %s is %llu\n",
456 device->name, (unsigned long long)new_size);
458 if (new_size > old_size) {
459 trans = btrfs_start_transaction(root, 1);
460 ret = btrfs_grow_device(trans, device, new_size);
461 btrfs_commit_transaction(trans, root);
463 ret = btrfs_shrink_device(device, new_size);
467 mutex_unlock(&root->fs_info->volume_mutex);
473 static noinline int btrfs_ioctl_snap_create(struct file *file,
476 struct btrfs_root *root = BTRFS_I(fdentry(file)->d_inode)->root;
477 struct btrfs_ioctl_vol_args *vol_args;
478 struct btrfs_dir_item *di;
479 struct btrfs_path *path;
484 if (root->fs_info->sb->s_flags & MS_RDONLY)
487 vol_args = kmalloc(sizeof(*vol_args), GFP_NOFS);
492 if (copy_from_user(vol_args, arg, sizeof(*vol_args))) {
497 vol_args->name[BTRFS_PATH_NAME_MAX] = '\0';
498 namelen = strlen(vol_args->name);
499 if (strchr(vol_args->name, '/')) {
504 path = btrfs_alloc_path();
510 root_dirid = root->fs_info->sb->s_root->d_inode->i_ino,
511 di = btrfs_lookup_dir_item(NULL, root->fs_info->tree_root,
513 vol_args->name, namelen, 0);
514 btrfs_free_path(path);
516 if (di && !IS_ERR(di)) {
526 if (root == root->fs_info->tree_root) {
527 ret = btrfs_mksubvol(&file->f_path, vol_args->name,
528 file->f_path.dentry->d_inode->i_mode,
531 ret = create_snapshot(root, vol_args->name, namelen);
539 static int btrfs_ioctl_defrag(struct file *file)
541 struct inode *inode = fdentry(file)->d_inode;
542 struct btrfs_root *root = BTRFS_I(inode)->root;
545 ret = mnt_want_write(file->f_path.mnt);
549 switch (inode->i_mode & S_IFMT) {
551 btrfs_defrag_root(root, 0);
552 btrfs_defrag_root(root->fs_info->extent_root, 0);
555 btrfs_defrag_file(file);
562 long btrfs_ioctl_add_dev(struct btrfs_root *root, void __user *arg)
564 struct btrfs_ioctl_vol_args *vol_args;
567 vol_args = kmalloc(sizeof(*vol_args), GFP_NOFS);
572 if (copy_from_user(vol_args, arg, sizeof(*vol_args))) {
576 vol_args->name[BTRFS_PATH_NAME_MAX] = '\0';
577 ret = btrfs_init_new_device(root, vol_args->name);
584 long btrfs_ioctl_rm_dev(struct btrfs_root *root, void __user *arg)
586 struct btrfs_ioctl_vol_args *vol_args;
589 if (root->fs_info->sb->s_flags & MS_RDONLY)
592 vol_args = kmalloc(sizeof(*vol_args), GFP_NOFS);
597 if (copy_from_user(vol_args, arg, sizeof(*vol_args))) {
601 vol_args->name[BTRFS_PATH_NAME_MAX] = '\0';
602 ret = btrfs_rm_device(root, vol_args->name);
609 long btrfs_ioctl_clone(struct file *file, unsigned long srcfd, u64 off,
610 u64 olen, u64 destoff)
612 struct inode *inode = fdentry(file)->d_inode;
613 struct btrfs_root *root = BTRFS_I(inode)->root;
614 struct file *src_file;
616 struct btrfs_trans_handle *trans;
617 struct btrfs_path *path;
618 struct extent_buffer *leaf;
620 struct btrfs_key key;
625 u64 bs = root->fs_info->sb->s_blocksize;
630 * - split compressed inline extents. annoying: we need to
631 * decompress into destination's address_space (the file offset
632 * may change, so source mapping won't do), then recompress (or
633 * otherwise reinsert) a subrange.
634 * - allow ranges within the same file to be cloned (provided
635 * they don't overlap)?
638 ret = mnt_want_write(file->f_path.mnt);
642 src_file = fget(srcfd);
645 src = src_file->f_dentry->d_inode;
652 if (S_ISDIR(src->i_mode) || S_ISDIR(inode->i_mode))
656 if (src->i_sb != inode->i_sb || BTRFS_I(src)->root != root)
660 buf = vmalloc(btrfs_level_size(root, 0));
664 path = btrfs_alloc_path();
672 mutex_lock(&inode->i_mutex);
673 mutex_lock(&src->i_mutex);
675 mutex_lock(&src->i_mutex);
676 mutex_lock(&inode->i_mutex);
679 /* determine range to clone */
681 if (off >= src->i_size || off + len > src->i_size)
684 olen = len = src->i_size - off;
685 /* if we extend to eof, continue to block boundary */
686 if (off + len == src->i_size)
687 len = ((src->i_size + bs-1) & ~(bs-1))
690 /* verify the end result is block aligned */
691 if ((off & (bs-1)) ||
692 ((off + len) & (bs-1)))
695 printk("final src extent is %llu~%llu\n", off, len);
696 printk("final dst extent is %llu~%llu\n", destoff, len);
698 /* do any pending delalloc/csum calc on src, one way or
699 another, and lock file content */
701 struct btrfs_ordered_extent *ordered;
702 lock_extent(&BTRFS_I(src)->io_tree, off, off+len, GFP_NOFS);
703 ordered = btrfs_lookup_first_ordered_extent(inode, off+len);
704 if (BTRFS_I(src)->delalloc_bytes == 0 && !ordered)
706 unlock_extent(&BTRFS_I(src)->io_tree, off, off+len, GFP_NOFS);
708 btrfs_put_ordered_extent(ordered);
709 btrfs_wait_ordered_range(src, off, off+len);
712 trans = btrfs_start_transaction(root, 1);
715 /* punch hole in destination first */
716 btrfs_drop_extents(trans, root, inode, off, off+len, 0, &hint_byte);
719 key.objectid = src->i_ino;
720 key.type = BTRFS_EXTENT_DATA_KEY;
725 * note the key will change type as we walk through the
728 ret = btrfs_search_slot(trans, root, &key, path, 0, 0);
732 nritems = btrfs_header_nritems(path->nodes[0]);
733 if (path->slots[0] >= nritems) {
734 ret = btrfs_next_leaf(root, path);
739 nritems = btrfs_header_nritems(path->nodes[0]);
741 leaf = path->nodes[0];
742 slot = path->slots[0];
744 btrfs_item_key_to_cpu(leaf, &key, slot);
745 if (btrfs_key_type(&key) > BTRFS_CSUM_ITEM_KEY ||
746 key.objectid != src->i_ino)
749 if (btrfs_key_type(&key) == BTRFS_EXTENT_DATA_KEY) {
750 struct btrfs_file_extent_item *extent;
753 struct btrfs_key new_key;
754 u64 disko = 0, diskl = 0;
755 u64 datao = 0, datal = 0;
758 size = btrfs_item_size_nr(leaf, slot);
759 read_extent_buffer(leaf, buf,
760 btrfs_item_ptr_offset(leaf, slot),
763 extent = btrfs_item_ptr(leaf, slot,
764 struct btrfs_file_extent_item);
765 comp = btrfs_file_extent_compression(leaf, extent);
766 type = btrfs_file_extent_type(leaf, extent);
767 if (type == BTRFS_FILE_EXTENT_REG) {
768 disko = btrfs_file_extent_disk_bytenr(leaf, extent);
769 diskl = btrfs_file_extent_disk_num_bytes(leaf, extent);
770 datao = btrfs_file_extent_offset(leaf, extent);
771 datal = btrfs_file_extent_num_bytes(leaf, extent);
772 } else if (type == BTRFS_FILE_EXTENT_INLINE) {
773 /* take upper bound, may be compressed */
774 datal = btrfs_file_extent_ram_bytes(leaf,
777 btrfs_release_path(root, path);
779 if (key.offset + datal < off ||
780 key.offset >= off+len)
783 memcpy(&new_key, &key, sizeof(new_key));
784 new_key.objectid = inode->i_ino;
785 new_key.offset = key.offset + destoff - off;
787 if (type == BTRFS_FILE_EXTENT_REG) {
788 ret = btrfs_insert_empty_item(trans, root, path,
793 leaf = path->nodes[0];
794 slot = path->slots[0];
795 write_extent_buffer(leaf, buf,
796 btrfs_item_ptr_offset(leaf, slot),
799 extent = btrfs_item_ptr(leaf, slot,
800 struct btrfs_file_extent_item);
801 printk(" orig disk %llu~%llu data %llu~%llu\n",
802 disko, diskl, datao, datal);
804 if (off > key.offset) {
805 datao += off - key.offset;
806 datal -= off - key.offset;
808 if (key.offset + datao + datal + key.offset >
810 datal = off + len - key.offset - datao;
811 /* disko == 0 means it's a hole */
814 printk(" final disk %llu~%llu data %llu~%llu\n",
815 disko, diskl, datao, datal);
817 btrfs_set_file_extent_offset(leaf, extent,
819 btrfs_set_file_extent_num_bytes(leaf, extent,
822 inode_add_bytes(inode, datal);
823 ret = btrfs_inc_extent_ref(trans, root,
824 disko, diskl, leaf->start,
825 root->root_key.objectid,
830 } else if (type == BTRFS_FILE_EXTENT_INLINE) {
833 if (off > key.offset) {
834 skip = off - key.offset;
835 new_key.offset += skip;
837 if (key.offset + datal > off+len)
838 trim = key.offset + datal - (off+len);
839 printk("len %lld skip %lld trim %lld\n",
841 if (comp && (skip || trim)) {
842 printk("btrfs clone_range can't split compressed inline extents yet\n");
847 datal -= skip + trim;
848 ret = btrfs_insert_empty_item(trans, root, path,
854 u32 start = btrfs_file_extent_calc_inline_size(0);
855 memmove(buf+start, buf+start+skip,
859 leaf = path->nodes[0];
860 slot = path->slots[0];
861 write_extent_buffer(leaf, buf,
862 btrfs_item_ptr_offset(leaf, slot),
864 inode_add_bytes(inode, datal);
867 btrfs_mark_buffer_dirty(leaf);
870 if (btrfs_key_type(&key) == BTRFS_CSUM_ITEM_KEY) {
872 struct btrfs_key new_key;
876 size = btrfs_item_size_nr(leaf, slot);
877 coverslen = (size / BTRFS_CRC32_SIZE) <<
878 root->fs_info->sb->s_blocksize_bits;
879 printk("csums for %llu~%llu\n",
880 key.offset, coverslen);
881 if (key.offset + coverslen < off ||
882 key.offset >= off+len)
885 read_extent_buffer(leaf, buf,
886 btrfs_item_ptr_offset(leaf, slot),
888 btrfs_release_path(root, path);
891 if (off > key.offset)
892 coff = ((off - key.offset) >>
893 root->fs_info->sb->s_blocksize_bits) *
896 if (key.offset + coverslen > off+len)
897 clen -= ((key.offset+coverslen-off-len) >>
898 root->fs_info->sb->s_blocksize_bits) *
900 printk(" will dup %d~%d of %d\n",
903 memcpy(&new_key, &key, sizeof(new_key));
904 new_key.objectid = inode->i_ino;
905 new_key.offset = key.offset + destoff - off;
907 ret = btrfs_insert_empty_item(trans, root, path,
912 leaf = path->nodes[0];
913 slot = path->slots[0];
914 write_extent_buffer(leaf, buf + coff,
915 btrfs_item_ptr_offset(leaf, slot),
917 btrfs_mark_buffer_dirty(leaf);
921 btrfs_release_path(root, path);
926 btrfs_release_path(root, path);
928 inode->i_mtime = inode->i_ctime = CURRENT_TIME;
929 if (destoff + olen > inode->i_size)
930 btrfs_i_size_write(inode, destoff + olen);
931 BTRFS_I(inode)->flags = BTRFS_I(src)->flags;
932 ret = btrfs_update_inode(trans, root, inode);
934 btrfs_end_transaction(trans, root);
935 unlock_extent(&BTRFS_I(src)->io_tree, off, off+len, GFP_NOFS);
937 vmtruncate(inode, 0);
939 mutex_unlock(&src->i_mutex);
940 mutex_unlock(&inode->i_mutex);
942 btrfs_free_path(path);
948 long btrfs_ioctl_clone_range(struct file *file, unsigned long argptr)
950 struct btrfs_ioctl_clone_range_args args;
952 if (copy_from_user(&args, (void *)argptr, sizeof(args)))
954 return btrfs_ioctl_clone(file, args.src_fd, args.src_offset,
955 args.src_length, args.dest_offset);
959 * there are many ways the trans_start and trans_end ioctls can lead
960 * to deadlocks. They should only be used by applications that
961 * basically own the machine, and have a very in depth understanding
962 * of all the possible deadlocks and enospc problems.
964 long btrfs_ioctl_trans_start(struct file *file)
966 struct inode *inode = fdentry(file)->d_inode;
967 struct btrfs_root *root = BTRFS_I(inode)->root;
968 struct btrfs_trans_handle *trans;
971 if (!capable(CAP_SYS_ADMIN))
974 if (file->private_data) {
979 ret = mnt_want_write(file->f_path.mnt);
983 mutex_lock(&root->fs_info->trans_mutex);
984 root->fs_info->open_ioctl_trans++;
985 mutex_unlock(&root->fs_info->trans_mutex);
987 trans = btrfs_start_ioctl_transaction(root, 0);
989 file->private_data = trans;
992 /*printk(KERN_INFO "btrfs_ioctl_trans_start on %p\n", file);*/
998 * there are many ways the trans_start and trans_end ioctls can lead
999 * to deadlocks. They should only be used by applications that
1000 * basically own the machine, and have a very in depth understanding
1001 * of all the possible deadlocks and enospc problems.
1003 long btrfs_ioctl_trans_end(struct file *file)
1005 struct inode *inode = fdentry(file)->d_inode;
1006 struct btrfs_root *root = BTRFS_I(inode)->root;
1007 struct btrfs_trans_handle *trans;
1010 trans = file->private_data;
1015 btrfs_end_transaction(trans, root);
1016 file->private_data = NULL;
1018 mutex_lock(&root->fs_info->trans_mutex);
1019 root->fs_info->open_ioctl_trans--;
1020 mutex_unlock(&root->fs_info->trans_mutex);
1026 long btrfs_ioctl(struct file *file, unsigned int
1027 cmd, unsigned long arg)
1029 struct btrfs_root *root = BTRFS_I(fdentry(file)->d_inode)->root;
1032 case BTRFS_IOC_SNAP_CREATE:
1033 return btrfs_ioctl_snap_create(file, (void __user *)arg);
1034 case BTRFS_IOC_DEFRAG:
1035 return btrfs_ioctl_defrag(file);
1036 case BTRFS_IOC_RESIZE:
1037 return btrfs_ioctl_resize(root, (void __user *)arg);
1038 case BTRFS_IOC_ADD_DEV:
1039 return btrfs_ioctl_add_dev(root, (void __user *)arg);
1040 case BTRFS_IOC_RM_DEV:
1041 return btrfs_ioctl_rm_dev(root, (void __user *)arg);
1042 case BTRFS_IOC_BALANCE:
1043 return btrfs_balance(root->fs_info->dev_root);
1044 case BTRFS_IOC_CLONE:
1045 return btrfs_ioctl_clone(file, arg, 0, 0, 0);
1046 case BTRFS_IOC_CLONE_RANGE:
1047 return btrfs_ioctl_clone_range(file, arg);
1048 case BTRFS_IOC_TRANS_START:
1049 return btrfs_ioctl_trans_start(file);
1050 case BTRFS_IOC_TRANS_END:
1051 return btrfs_ioctl_trans_end(file);
1052 case BTRFS_IOC_SYNC:
1053 btrfs_start_delalloc_inodes(root);
1054 btrfs_sync_fs(file->f_dentry->d_sb, 1);