ioctl.c 18 KB

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