ioctl.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777
  1. /*
  2. * Copyright (C) 2007 Oracle. All rights reserved.
  3. *
  4. * This program is free software; you can redistribute it and/or
  5. * modify it under the terms of the GNU General Public
  6. * License v2 as published by the Free Software Foundation.
  7. *
  8. * This program is distributed in the hope that it will be useful,
  9. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  10. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  11. * General Public License for more details.
  12. *
  13. * You should have received a copy of the GNU General Public
  14. * License along with this program; if not, write to the
  15. * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  16. * Boston, MA 021110-1307, USA.
  17. */
  18. #include <linux/kernel.h>
  19. #include <linux/bio.h>
  20. #include <linux/buffer_head.h>
  21. #include <linux/file.h>
  22. #include <linux/fs.h>
  23. #include <linux/pagemap.h>
  24. #include <linux/highmem.h>
  25. #include <linux/time.h>
  26. #include <linux/init.h>
  27. #include <linux/string.h>
  28. #include <linux/smp_lock.h>
  29. #include <linux/backing-dev.h>
  30. #include <linux/mpage.h>
  31. #include <linux/swap.h>
  32. #include <linux/writeback.h>
  33. #include <linux/statfs.h>
  34. #include <linux/compat.h>
  35. #include <linux/bit_spinlock.h>
  36. #include <linux/version.h>
  37. #include <linux/xattr.h>
  38. #include "ctree.h"
  39. #include "disk-io.h"
  40. #include "transaction.h"
  41. #include "btrfs_inode.h"
  42. #include "ioctl.h"
  43. #include "print-tree.h"
  44. #include "volumes.h"
  45. #include "locking.h"
  46. static noinline int create_subvol(struct btrfs_root *root, char *name,
  47. int namelen)
  48. {
  49. struct btrfs_trans_handle *trans;
  50. struct btrfs_key key;
  51. struct btrfs_root_item root_item;
  52. struct btrfs_inode_item *inode_item;
  53. struct extent_buffer *leaf;
  54. struct btrfs_root *new_root = root;
  55. struct inode *dir;
  56. int ret;
  57. int err;
  58. u64 objectid;
  59. u64 new_dirid = BTRFS_FIRST_FREE_OBJECTID;
  60. unsigned long nr = 1;
  61. ret = btrfs_check_free_space(root, 1, 0);
  62. if (ret)
  63. goto fail_commit;
  64. trans = btrfs_start_transaction(root, 1);
  65. BUG_ON(!trans);
  66. ret = btrfs_find_free_objectid(trans, root->fs_info->tree_root,
  67. 0, &objectid);
  68. if (ret)
  69. goto fail;
  70. leaf = btrfs_alloc_free_block(trans, root, root->leafsize,
  71. objectid, trans->transid, 0, 0,
  72. 0, 0);
  73. if (IS_ERR(leaf))
  74. return PTR_ERR(leaf);
  75. btrfs_set_header_nritems(leaf, 0);
  76. btrfs_set_header_level(leaf, 0);
  77. btrfs_set_header_bytenr(leaf, leaf->start);
  78. btrfs_set_header_generation(leaf, trans->transid);
  79. btrfs_set_header_owner(leaf, objectid);
  80. write_extent_buffer(leaf, root->fs_info->fsid,
  81. (unsigned long)btrfs_header_fsid(leaf),
  82. BTRFS_FSID_SIZE);
  83. btrfs_mark_buffer_dirty(leaf);
  84. inode_item = &root_item.inode;
  85. memset(inode_item, 0, sizeof(*inode_item));
  86. inode_item->generation = cpu_to_le64(1);
  87. inode_item->size = cpu_to_le64(3);
  88. inode_item->nlink = cpu_to_le32(1);
  89. inode_item->nblocks = cpu_to_le64(1);
  90. inode_item->mode = cpu_to_le32(S_IFDIR | 0755);
  91. btrfs_set_root_bytenr(&root_item, leaf->start);
  92. btrfs_set_root_level(&root_item, 0);
  93. btrfs_set_root_refs(&root_item, 1);
  94. btrfs_set_root_used(&root_item, 0);
  95. memset(&root_item.drop_progress, 0, sizeof(root_item.drop_progress));
  96. root_item.drop_level = 0;
  97. btrfs_tree_unlock(leaf);
  98. free_extent_buffer(leaf);
  99. leaf = NULL;
  100. btrfs_set_root_dirid(&root_item, new_dirid);
  101. key.objectid = objectid;
  102. key.offset = 1;
  103. btrfs_set_key_type(&key, BTRFS_ROOT_ITEM_KEY);
  104. ret = btrfs_insert_root(trans, root->fs_info->tree_root, &key,
  105. &root_item);
  106. if (ret)
  107. goto fail;
  108. /*
  109. * insert the directory item
  110. */
  111. key.offset = (u64)-1;
  112. dir = root->fs_info->sb->s_root->d_inode;
  113. ret = btrfs_insert_dir_item(trans, root->fs_info->tree_root,
  114. name, namelen, dir->i_ino, &key,
  115. BTRFS_FT_DIR);
  116. if (ret)
  117. goto fail;
  118. ret = btrfs_insert_inode_ref(trans, root->fs_info->tree_root,
  119. name, namelen, objectid,
  120. root->fs_info->sb->s_root->d_inode->i_ino);
  121. if (ret)
  122. goto fail;
  123. ret = btrfs_commit_transaction(trans, root);
  124. if (ret)
  125. goto fail_commit;
  126. new_root = btrfs_read_fs_root(root->fs_info, &key, name, namelen);
  127. BUG_ON(!new_root);
  128. trans = btrfs_start_transaction(new_root, 1);
  129. BUG_ON(!trans);
  130. ret = btrfs_create_subvol_root(new_root, trans, new_dirid,
  131. BTRFS_I(dir)->block_group);
  132. if (ret)
  133. goto fail;
  134. /* Invalidate existing dcache entry for new subvolume. */
  135. btrfs_invalidate_dcache_root(root, name, namelen);
  136. fail:
  137. nr = trans->blocks_used;
  138. err = btrfs_commit_transaction(trans, new_root);
  139. if (err && !ret)
  140. ret = err;
  141. fail_commit:
  142. btrfs_btree_balance_dirty(root, nr);
  143. return ret;
  144. }
  145. static int create_snapshot(struct btrfs_root *root, char *name, int namelen)
  146. {
  147. struct btrfs_pending_snapshot *pending_snapshot;
  148. struct btrfs_trans_handle *trans;
  149. int ret;
  150. int err;
  151. unsigned long nr = 0;
  152. if (!root->ref_cows)
  153. return -EINVAL;
  154. ret = btrfs_check_free_space(root, 1, 0);
  155. if (ret)
  156. goto fail_unlock;
  157. pending_snapshot = kmalloc(sizeof(*pending_snapshot), GFP_NOFS);
  158. if (!pending_snapshot) {
  159. ret = -ENOMEM;
  160. goto fail_unlock;
  161. }
  162. pending_snapshot->name = kmalloc(namelen + 1, GFP_NOFS);
  163. if (!pending_snapshot->name) {
  164. ret = -ENOMEM;
  165. kfree(pending_snapshot);
  166. goto fail_unlock;
  167. }
  168. memcpy(pending_snapshot->name, name, namelen);
  169. pending_snapshot->name[namelen] = '\0';
  170. trans = btrfs_start_transaction(root, 1);
  171. BUG_ON(!trans);
  172. pending_snapshot->root = root;
  173. list_add(&pending_snapshot->list,
  174. &trans->transaction->pending_snapshots);
  175. ret = btrfs_update_inode(trans, root, root->inode);
  176. err = btrfs_commit_transaction(trans, root);
  177. fail_unlock:
  178. btrfs_btree_balance_dirty(root, nr);
  179. return ret;
  180. }
  181. int btrfs_defrag_file(struct file *file)
  182. {
  183. struct inode *inode = fdentry(file)->d_inode;
  184. struct btrfs_root *root = BTRFS_I(inode)->root;
  185. struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
  186. struct btrfs_ordered_extent *ordered;
  187. struct page *page;
  188. unsigned long last_index;
  189. unsigned long ra_pages = root->fs_info->bdi.ra_pages;
  190. unsigned long total_read = 0;
  191. u64 page_start;
  192. u64 page_end;
  193. unsigned long i;
  194. int ret;
  195. ret = btrfs_check_free_space(root, inode->i_size, 0);
  196. if (ret)
  197. return -ENOSPC;
  198. mutex_lock(&inode->i_mutex);
  199. last_index = inode->i_size >> PAGE_CACHE_SHIFT;
  200. for (i = 0; i <= last_index; i++) {
  201. if (total_read % ra_pages == 0) {
  202. btrfs_force_ra(inode->i_mapping, &file->f_ra, file, i,
  203. min(last_index, i + ra_pages - 1));
  204. }
  205. total_read++;
  206. again:
  207. page = grab_cache_page(inode->i_mapping, i);
  208. if (!page)
  209. goto out_unlock;
  210. if (!PageUptodate(page)) {
  211. btrfs_readpage(NULL, page);
  212. lock_page(page);
  213. if (!PageUptodate(page)) {
  214. unlock_page(page);
  215. page_cache_release(page);
  216. goto out_unlock;
  217. }
  218. }
  219. wait_on_page_writeback(page);
  220. page_start = (u64)page->index << PAGE_CACHE_SHIFT;
  221. page_end = page_start + PAGE_CACHE_SIZE - 1;
  222. lock_extent(io_tree, page_start, page_end, GFP_NOFS);
  223. ordered = btrfs_lookup_ordered_extent(inode, page_start);
  224. if (ordered) {
  225. unlock_extent(io_tree, page_start, page_end, GFP_NOFS);
  226. unlock_page(page);
  227. page_cache_release(page);
  228. btrfs_start_ordered_extent(inode, ordered, 1);
  229. btrfs_put_ordered_extent(ordered);
  230. goto again;
  231. }
  232. set_page_extent_mapped(page);
  233. set_extent_delalloc(io_tree, page_start,
  234. page_end, GFP_NOFS);
  235. unlock_extent(io_tree, page_start, page_end, GFP_NOFS);
  236. set_page_dirty(page);
  237. unlock_page(page);
  238. page_cache_release(page);
  239. balance_dirty_pages_ratelimited_nr(inode->i_mapping, 1);
  240. }
  241. out_unlock:
  242. mutex_unlock(&inode->i_mutex);
  243. return 0;
  244. }
  245. /*
  246. * Called inside transaction, so use GFP_NOFS
  247. */
  248. static int btrfs_ioctl_resize(struct btrfs_root *root, void __user *arg)
  249. {
  250. u64 new_size;
  251. u64 old_size;
  252. u64 devid = 1;
  253. struct btrfs_ioctl_vol_args *vol_args;
  254. struct btrfs_trans_handle *trans;
  255. struct btrfs_device *device = NULL;
  256. char *sizestr;
  257. char *devstr = NULL;
  258. int ret = 0;
  259. int namelen;
  260. int mod = 0;
  261. vol_args = kmalloc(sizeof(*vol_args), GFP_NOFS);
  262. if (!vol_args)
  263. return -ENOMEM;
  264. if (copy_from_user(vol_args, arg, sizeof(*vol_args))) {
  265. ret = -EFAULT;
  266. goto out;
  267. }
  268. namelen = strlen(vol_args->name);
  269. if (namelen > BTRFS_VOL_NAME_MAX) {
  270. ret = -EINVAL;
  271. goto out;
  272. }
  273. mutex_lock(&root->fs_info->volume_mutex);
  274. sizestr = vol_args->name;
  275. devstr = strchr(sizestr, ':');
  276. if (devstr) {
  277. char *end;
  278. sizestr = devstr + 1;
  279. *devstr = '\0';
  280. devstr = vol_args->name;
  281. devid = simple_strtoull(devstr, &end, 10);
  282. printk(KERN_INFO "resizing devid %llu\n", devid);
  283. }
  284. device = btrfs_find_device(root, devid, NULL);
  285. if (!device) {
  286. printk(KERN_INFO "resizer unable to find device %llu\n", devid);
  287. ret = -EINVAL;
  288. goto out_unlock;
  289. }
  290. if (!strcmp(sizestr, "max"))
  291. new_size = device->bdev->bd_inode->i_size;
  292. else {
  293. if (sizestr[0] == '-') {
  294. mod = -1;
  295. sizestr++;
  296. } else if (sizestr[0] == '+') {
  297. mod = 1;
  298. sizestr++;
  299. }
  300. new_size = btrfs_parse_size(sizestr);
  301. if (new_size == 0) {
  302. ret = -EINVAL;
  303. goto out_unlock;
  304. }
  305. }
  306. old_size = device->total_bytes;
  307. if (mod < 0) {
  308. if (new_size > old_size) {
  309. ret = -EINVAL;
  310. goto out_unlock;
  311. }
  312. new_size = old_size - new_size;
  313. } else if (mod > 0) {
  314. new_size = old_size + new_size;
  315. }
  316. if (new_size < 256 * 1024 * 1024) {
  317. ret = -EINVAL;
  318. goto out_unlock;
  319. }
  320. if (new_size > device->bdev->bd_inode->i_size) {
  321. ret = -EFBIG;
  322. goto out_unlock;
  323. }
  324. do_div(new_size, root->sectorsize);
  325. new_size *= root->sectorsize;
  326. printk(KERN_INFO "new size for %s is %llu\n",
  327. device->name, (unsigned long long)new_size);
  328. if (new_size > old_size) {
  329. trans = btrfs_start_transaction(root, 1);
  330. ret = btrfs_grow_device(trans, device, new_size);
  331. btrfs_commit_transaction(trans, root);
  332. } else {
  333. ret = btrfs_shrink_device(device, new_size);
  334. }
  335. out_unlock:
  336. mutex_unlock(&root->fs_info->volume_mutex);
  337. out:
  338. kfree(vol_args);
  339. return ret;
  340. }
  341. static noinline int btrfs_ioctl_snap_create(struct btrfs_root *root,
  342. void __user *arg)
  343. {
  344. struct btrfs_ioctl_vol_args *vol_args;
  345. struct btrfs_dir_item *di;
  346. struct btrfs_path *path;
  347. u64 root_dirid;
  348. int namelen;
  349. int ret;
  350. vol_args = kmalloc(sizeof(*vol_args), GFP_NOFS);
  351. if (!vol_args)
  352. return -ENOMEM;
  353. if (copy_from_user(vol_args, arg, sizeof(*vol_args))) {
  354. ret = -EFAULT;
  355. goto out;
  356. }
  357. namelen = strlen(vol_args->name);
  358. if (namelen > BTRFS_VOL_NAME_MAX) {
  359. ret = -EINVAL;
  360. goto out;
  361. }
  362. if (strchr(vol_args->name, '/')) {
  363. ret = -EINVAL;
  364. goto out;
  365. }
  366. path = btrfs_alloc_path();
  367. if (!path) {
  368. ret = -ENOMEM;
  369. goto out;
  370. }
  371. root_dirid = root->fs_info->sb->s_root->d_inode->i_ino,
  372. di = btrfs_lookup_dir_item(NULL, root->fs_info->tree_root,
  373. path, root_dirid,
  374. vol_args->name, namelen, 0);
  375. btrfs_free_path(path);
  376. if (di && !IS_ERR(di)) {
  377. ret = -EEXIST;
  378. goto out;
  379. }
  380. if (IS_ERR(di)) {
  381. ret = PTR_ERR(di);
  382. goto out;
  383. }
  384. mutex_lock(&root->fs_info->drop_mutex);
  385. if (root == root->fs_info->tree_root)
  386. ret = create_subvol(root, vol_args->name, namelen);
  387. else
  388. ret = create_snapshot(root, vol_args->name, namelen);
  389. mutex_unlock(&root->fs_info->drop_mutex);
  390. out:
  391. kfree(vol_args);
  392. return ret;
  393. }
  394. static int btrfs_ioctl_defrag(struct file *file)
  395. {
  396. struct inode *inode = fdentry(file)->d_inode;
  397. struct btrfs_root *root = BTRFS_I(inode)->root;
  398. switch (inode->i_mode & S_IFMT) {
  399. case S_IFDIR:
  400. btrfs_defrag_root(root, 0);
  401. btrfs_defrag_root(root->fs_info->extent_root, 0);
  402. break;
  403. case S_IFREG:
  404. btrfs_defrag_file(file);
  405. break;
  406. }
  407. return 0;
  408. }
  409. long btrfs_ioctl_add_dev(struct btrfs_root *root, void __user *arg)
  410. {
  411. struct btrfs_ioctl_vol_args *vol_args;
  412. int ret;
  413. vol_args = kmalloc(sizeof(*vol_args), GFP_NOFS);
  414. if (!vol_args)
  415. return -ENOMEM;
  416. if (copy_from_user(vol_args, arg, sizeof(*vol_args))) {
  417. ret = -EFAULT;
  418. goto out;
  419. }
  420. ret = btrfs_init_new_device(root, vol_args->name);
  421. out:
  422. kfree(vol_args);
  423. return ret;
  424. }
  425. long btrfs_ioctl_rm_dev(struct btrfs_root *root, void __user *arg)
  426. {
  427. struct btrfs_ioctl_vol_args *vol_args;
  428. int ret;
  429. vol_args = kmalloc(sizeof(*vol_args), GFP_NOFS);
  430. if (!vol_args)
  431. return -ENOMEM;
  432. if (copy_from_user(vol_args, arg, sizeof(*vol_args))) {
  433. ret = -EFAULT;
  434. goto out;
  435. }
  436. ret = btrfs_rm_device(root, vol_args->name);
  437. out:
  438. kfree(vol_args);
  439. return ret;
  440. }
  441. int dup_item_to_inode(struct btrfs_trans_handle *trans,
  442. struct btrfs_root *root,
  443. struct btrfs_path *path,
  444. struct extent_buffer *leaf,
  445. int slot,
  446. struct btrfs_key *key,
  447. u64 destino)
  448. {
  449. char *dup;
  450. int len = btrfs_item_size_nr(leaf, slot);
  451. struct btrfs_key ckey = *key;
  452. int ret = 0;
  453. dup = kmalloc(len, GFP_NOFS);
  454. if (!dup)
  455. return -ENOMEM;
  456. read_extent_buffer(leaf, dup, btrfs_item_ptr_offset(leaf, slot), len);
  457. btrfs_release_path(root, path);
  458. ckey.objectid = destino;
  459. ret = btrfs_insert_item(trans, root, &ckey, dup, len);
  460. kfree(dup);
  461. return ret;
  462. }
  463. long btrfs_ioctl_clone(struct file *file, unsigned long src_fd)
  464. {
  465. struct inode *inode = fdentry(file)->d_inode;
  466. struct btrfs_root *root = BTRFS_I(inode)->root;
  467. struct file *src_file;
  468. struct inode *src;
  469. struct btrfs_trans_handle *trans;
  470. int ret;
  471. u64 pos;
  472. struct btrfs_path *path;
  473. struct btrfs_key key;
  474. struct extent_buffer *leaf;
  475. u32 nritems;
  476. int slot;
  477. src_file = fget(src_fd);
  478. if (!src_file)
  479. return -EBADF;
  480. src = src_file->f_dentry->d_inode;
  481. ret = -EXDEV;
  482. if (src->i_sb != inode->i_sb)
  483. goto out_fput;
  484. if (inode < src) {
  485. mutex_lock(&inode->i_mutex);
  486. mutex_lock(&src->i_mutex);
  487. } else {
  488. mutex_lock(&src->i_mutex);
  489. mutex_lock(&inode->i_mutex);
  490. }
  491. ret = -ENOTEMPTY;
  492. if (inode->i_size)
  493. goto out_unlock;
  494. /* do any pending delalloc/csum calc on src, one way or
  495. another, and lock file content */
  496. while (1) {
  497. filemap_write_and_wait(src->i_mapping);
  498. lock_extent(&BTRFS_I(src)->io_tree, 0, (u64)-1, GFP_NOFS);
  499. if (BTRFS_I(src)->delalloc_bytes == 0)
  500. break;
  501. unlock_extent(&BTRFS_I(src)->io_tree, 0, (u64)-1, GFP_NOFS);
  502. }
  503. trans = btrfs_start_transaction(root, 0);
  504. path = btrfs_alloc_path();
  505. if (!path) {
  506. ret = -ENOMEM;
  507. goto out;
  508. }
  509. key.offset = 0;
  510. key.type = BTRFS_EXTENT_DATA_KEY;
  511. key.objectid = src->i_ino;
  512. pos = 0;
  513. path->reada = 2;
  514. while (1) {
  515. /*
  516. * note the key will change type as we walk through the
  517. * tree.
  518. */
  519. ret = btrfs_search_slot(trans, root, &key, path, 0, 0);
  520. if (ret < 0)
  521. goto out;
  522. if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) {
  523. ret = btrfs_next_leaf(root, path);
  524. if (ret < 0)
  525. goto out;
  526. if (ret > 0)
  527. break;
  528. }
  529. leaf = path->nodes[0];
  530. slot = path->slots[0];
  531. btrfs_item_key_to_cpu(leaf, &key, slot);
  532. nritems = btrfs_header_nritems(leaf);
  533. if (btrfs_key_type(&key) > BTRFS_CSUM_ITEM_KEY ||
  534. key.objectid != src->i_ino)
  535. break;
  536. if (btrfs_key_type(&key) == BTRFS_EXTENT_DATA_KEY) {
  537. struct btrfs_file_extent_item *extent;
  538. int found_type;
  539. pos = key.offset;
  540. extent = btrfs_item_ptr(leaf, slot,
  541. struct btrfs_file_extent_item);
  542. found_type = btrfs_file_extent_type(leaf, extent);
  543. if (found_type == BTRFS_FILE_EXTENT_REG) {
  544. u64 len = btrfs_file_extent_num_bytes(leaf,
  545. extent);
  546. u64 ds = btrfs_file_extent_disk_bytenr(leaf,
  547. extent);
  548. u64 dl = btrfs_file_extent_disk_num_bytes(leaf,
  549. extent);
  550. u64 off = btrfs_file_extent_offset(leaf,
  551. extent);
  552. btrfs_insert_file_extent(trans, root,
  553. inode->i_ino, pos,
  554. ds, dl, len, off);
  555. /* ds == 0 means there's a hole */
  556. if (ds != 0) {
  557. btrfs_inc_extent_ref(trans, root,
  558. ds, dl,
  559. root->root_key.objectid,
  560. trans->transid,
  561. inode->i_ino, pos);
  562. }
  563. pos = key.offset + len;
  564. } else if (found_type == BTRFS_FILE_EXTENT_INLINE) {
  565. ret = dup_item_to_inode(trans, root, path,
  566. leaf, slot, &key,
  567. inode->i_ino);
  568. if (ret)
  569. goto out;
  570. pos = key.offset + btrfs_item_size_nr(leaf,
  571. slot);
  572. }
  573. } else if (btrfs_key_type(&key) == BTRFS_CSUM_ITEM_KEY) {
  574. ret = dup_item_to_inode(trans, root, path, leaf,
  575. slot, &key, inode->i_ino);
  576. if (ret)
  577. goto out;
  578. }
  579. key.offset++;
  580. btrfs_release_path(root, path);
  581. }
  582. ret = 0;
  583. out:
  584. btrfs_free_path(path);
  585. inode->i_blocks = src->i_blocks;
  586. i_size_write(inode, src->i_size);
  587. btrfs_update_inode(trans, root, inode);
  588. unlock_extent(&BTRFS_I(src)->io_tree, 0, (u64)-1, GFP_NOFS);
  589. btrfs_end_transaction(trans, root);
  590. out_unlock:
  591. mutex_unlock(&src->i_mutex);
  592. mutex_unlock(&inode->i_mutex);
  593. out_fput:
  594. fput(src_file);
  595. return ret;
  596. }
  597. /*
  598. * there are many ways the trans_start and trans_end ioctls can lead
  599. * to deadlocks. They should only be used by applications that
  600. * basically own the machine, and have a very in depth understanding
  601. * of all the possible deadlocks and enospc problems.
  602. */
  603. long btrfs_ioctl_trans_start(struct file *file)
  604. {
  605. struct inode *inode = fdentry(file)->d_inode;
  606. struct btrfs_root *root = BTRFS_I(inode)->root;
  607. struct btrfs_trans_handle *trans;
  608. int ret = 0;
  609. if (!capable(CAP_SYS_ADMIN))
  610. return -EPERM;
  611. if (file->private_data) {
  612. ret = -EINPROGRESS;
  613. goto out;
  614. }
  615. trans = btrfs_start_transaction(root, 0);
  616. if (trans)
  617. file->private_data = trans;
  618. else
  619. ret = -ENOMEM;
  620. /*printk(KERN_INFO "btrfs_ioctl_trans_start on %p\n", file);*/
  621. out:
  622. return ret;
  623. }
  624. /*
  625. * there are many ways the trans_start and trans_end ioctls can lead
  626. * to deadlocks. They should only be used by applications that
  627. * basically own the machine, and have a very in depth understanding
  628. * of all the possible deadlocks and enospc problems.
  629. */
  630. long btrfs_ioctl_trans_end(struct file *file)
  631. {
  632. struct inode *inode = fdentry(file)->d_inode;
  633. struct btrfs_root *root = BTRFS_I(inode)->root;
  634. struct btrfs_trans_handle *trans;
  635. int ret = 0;
  636. trans = file->private_data;
  637. if (!trans) {
  638. ret = -EINVAL;
  639. goto out;
  640. }
  641. btrfs_end_transaction(trans, root);
  642. file->private_data = 0;
  643. out:
  644. return ret;
  645. }
  646. long btrfs_ioctl(struct file *file, unsigned int
  647. cmd, unsigned long arg)
  648. {
  649. struct btrfs_root *root = BTRFS_I(fdentry(file)->d_inode)->root;
  650. switch (cmd) {
  651. case BTRFS_IOC_SNAP_CREATE:
  652. return btrfs_ioctl_snap_create(root, (void __user *)arg);
  653. case BTRFS_IOC_DEFRAG:
  654. return btrfs_ioctl_defrag(file);
  655. case BTRFS_IOC_RESIZE:
  656. return btrfs_ioctl_resize(root, (void __user *)arg);
  657. case BTRFS_IOC_ADD_DEV:
  658. return btrfs_ioctl_add_dev(root, (void __user *)arg);
  659. case BTRFS_IOC_RM_DEV:
  660. return btrfs_ioctl_rm_dev(root, (void __user *)arg);
  661. case BTRFS_IOC_BALANCE:
  662. return btrfs_balance(root->fs_info->dev_root);
  663. case BTRFS_IOC_CLONE:
  664. return btrfs_ioctl_clone(file, arg);
  665. case BTRFS_IOC_TRANS_START:
  666. return btrfs_ioctl_trans_start(file);
  667. case BTRFS_IOC_TRANS_END:
  668. return btrfs_ioctl_trans_end(file);
  669. case BTRFS_IOC_SYNC:
  670. btrfs_sync_fs(file->f_dentry->d_sb, 1);
  671. return 0;
  672. }
  673. return -ENOTTY;
  674. }