disk-io.c 27 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994
  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/fs.h>
  19. #include <linux/blkdev.h>
  20. #include <linux/crc32c.h>
  21. #include <linux/scatterlist.h>
  22. #include <linux/swap.h>
  23. #include <linux/radix-tree.h>
  24. #include <linux/writeback.h>
  25. #include <linux/buffer_head.h> // for block_sync_page
  26. #include "ctree.h"
  27. #include "disk-io.h"
  28. #include "transaction.h"
  29. #include "btrfs_inode.h"
  30. #include "print-tree.h"
  31. #if 0
  32. static int check_tree_block(struct btrfs_root *root, struct extent_buffer *buf)
  33. {
  34. if (extent_buffer_blocknr(buf) != btrfs_header_blocknr(buf)) {
  35. printk(KERN_CRIT "buf blocknr(buf) is %llu, header is %llu\n",
  36. (unsigned long long)extent_buffer_blocknr(buf),
  37. (unsigned long long)btrfs_header_blocknr(buf));
  38. return 1;
  39. }
  40. return 0;
  41. }
  42. #endif
  43. static struct extent_map_ops btree_extent_map_ops;
  44. struct extent_buffer *btrfs_find_tree_block(struct btrfs_root *root,
  45. u64 bytenr, u32 blocksize)
  46. {
  47. struct inode *btree_inode = root->fs_info->btree_inode;
  48. struct extent_buffer *eb;
  49. eb = find_extent_buffer(&BTRFS_I(btree_inode)->extent_tree,
  50. bytenr, blocksize, GFP_NOFS);
  51. return eb;
  52. }
  53. struct extent_buffer *btrfs_find_create_tree_block(struct btrfs_root *root,
  54. u64 bytenr, u32 blocksize)
  55. {
  56. struct inode *btree_inode = root->fs_info->btree_inode;
  57. struct extent_buffer *eb;
  58. eb = alloc_extent_buffer(&BTRFS_I(btree_inode)->extent_tree,
  59. bytenr, blocksize, NULL, GFP_NOFS);
  60. return eb;
  61. }
  62. struct extent_map *btree_get_extent(struct inode *inode, struct page *page,
  63. size_t page_offset, u64 start, u64 end,
  64. int create)
  65. {
  66. struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
  67. struct extent_map *em;
  68. int ret;
  69. again:
  70. em = lookup_extent_mapping(em_tree, start, end);
  71. if (em) {
  72. goto out;
  73. }
  74. em = alloc_extent_map(GFP_NOFS);
  75. if (!em) {
  76. em = ERR_PTR(-ENOMEM);
  77. goto out;
  78. }
  79. em->start = 0;
  80. em->end = (i_size_read(inode) & ~((u64)PAGE_CACHE_SIZE -1)) - 1;
  81. em->block_start = 0;
  82. em->block_end = em->end;
  83. em->bdev = inode->i_sb->s_bdev;
  84. ret = add_extent_mapping(em_tree, em);
  85. if (ret == -EEXIST) {
  86. free_extent_map(em);
  87. em = NULL;
  88. goto again;
  89. } else if (ret) {
  90. em = ERR_PTR(ret);
  91. }
  92. out:
  93. return em;
  94. }
  95. u32 btrfs_csum_data(struct btrfs_root *root, char *data, u32 seed, size_t len)
  96. {
  97. return crc32c(seed, data, len);
  98. }
  99. void btrfs_csum_final(u32 crc, char *result)
  100. {
  101. *(__le32 *)result = ~cpu_to_le32(crc);
  102. }
  103. static int csum_tree_block(struct btrfs_root *root, struct extent_buffer *buf,
  104. int verify)
  105. {
  106. char result[BTRFS_CRC32_SIZE];
  107. unsigned long len;
  108. unsigned long cur_len;
  109. unsigned long offset = BTRFS_CSUM_SIZE;
  110. char *map_token = NULL;
  111. char *kaddr;
  112. unsigned long map_start;
  113. unsigned long map_len;
  114. int err;
  115. u32 crc = ~(u32)0;
  116. len = buf->len - offset;
  117. while(len > 0) {
  118. err = map_private_extent_buffer(buf, offset, 32,
  119. &map_token, &kaddr,
  120. &map_start, &map_len, KM_USER0);
  121. if (err) {
  122. printk("failed to map extent buffer! %lu\n",
  123. offset);
  124. return 1;
  125. }
  126. cur_len = min(len, map_len - (offset - map_start));
  127. crc = btrfs_csum_data(root, kaddr + offset - map_start,
  128. crc, cur_len);
  129. len -= cur_len;
  130. offset += cur_len;
  131. unmap_extent_buffer(buf, map_token, KM_USER0);
  132. }
  133. btrfs_csum_final(crc, result);
  134. if (verify) {
  135. int from_this_trans = 0;
  136. if (root->fs_info->running_transaction &&
  137. btrfs_header_generation(buf) ==
  138. root->fs_info->running_transaction->transid)
  139. from_this_trans = 1;
  140. /* FIXME, this is not good */
  141. if (from_this_trans == 0 &&
  142. memcmp_extent_buffer(buf, result, 0, BTRFS_CRC32_SIZE)) {
  143. u32 val;
  144. u32 found = 0;
  145. memcpy(&found, result, BTRFS_CRC32_SIZE);
  146. read_extent_buffer(buf, &val, 0, BTRFS_CRC32_SIZE);
  147. printk("btrfs: %s checksum verify failed on %llu "
  148. "wanted %X found %X from_this_trans %d\n",
  149. root->fs_info->sb->s_id,
  150. buf->start, val, found, from_this_trans);
  151. return 1;
  152. }
  153. } else {
  154. write_extent_buffer(buf, result, 0, BTRFS_CRC32_SIZE);
  155. }
  156. return 0;
  157. }
  158. int csum_dirty_buffer(struct btrfs_root *root, struct page *page)
  159. {
  160. struct extent_map_tree *tree;
  161. u64 start = (u64)page->index << PAGE_CACHE_SHIFT;
  162. u64 found_start;
  163. int found_level;
  164. unsigned long len;
  165. struct extent_buffer *eb;
  166. tree = &BTRFS_I(page->mapping->host)->extent_tree;
  167. if (page->private == EXTENT_PAGE_PRIVATE)
  168. goto out;
  169. if (!page->private)
  170. goto out;
  171. len = page->private >> 2;
  172. if (len == 0) {
  173. WARN_ON(1);
  174. }
  175. eb = alloc_extent_buffer(tree, start, len, page, GFP_NOFS);
  176. read_extent_buffer_pages(tree, eb, start + PAGE_CACHE_SIZE, 1);
  177. found_start = btrfs_header_bytenr(eb);
  178. if (found_start != start) {
  179. printk("warning: eb start incorrect %Lu buffer %Lu len %lu\n",
  180. start, found_start, len);
  181. WARN_ON(1);
  182. goto err;
  183. }
  184. if (eb->first_page != page) {
  185. printk("bad first page %lu %lu\n", eb->first_page->index,
  186. page->index);
  187. WARN_ON(1);
  188. goto err;
  189. }
  190. if (!PageUptodate(page)) {
  191. printk("csum not up to date page %lu\n", page->index);
  192. WARN_ON(1);
  193. goto err;
  194. }
  195. found_level = btrfs_header_level(eb);
  196. csum_tree_block(root, eb, 0);
  197. err:
  198. free_extent_buffer(eb);
  199. out:
  200. return 0;
  201. }
  202. static int btree_writepage_io_hook(struct page *page, u64 start, u64 end)
  203. {
  204. struct btrfs_root *root = BTRFS_I(page->mapping->host)->root;
  205. csum_dirty_buffer(root, page);
  206. return 0;
  207. }
  208. static int btree_writepage(struct page *page, struct writeback_control *wbc)
  209. {
  210. struct extent_map_tree *tree;
  211. tree = &BTRFS_I(page->mapping->host)->extent_tree;
  212. return extent_write_full_page(tree, page, btree_get_extent, wbc);
  213. }
  214. static int btree_writepages(struct address_space *mapping,
  215. struct writeback_control *wbc)
  216. {
  217. struct extent_map_tree *tree;
  218. tree = &BTRFS_I(mapping->host)->extent_tree;
  219. if (wbc->sync_mode == WB_SYNC_NONE) {
  220. u64 num_dirty;
  221. u64 start = 0;
  222. unsigned long thresh = 96 * 1024 * 1024;
  223. if (wbc->for_kupdate)
  224. return 0;
  225. if (current_is_pdflush()) {
  226. thresh = 96 * 1024 * 1024;
  227. } else {
  228. thresh = 8 * 1024 * 1024;
  229. }
  230. num_dirty = count_range_bits(tree, &start, (u64)-1,
  231. thresh, EXTENT_DIRTY);
  232. if (num_dirty < thresh) {
  233. return 0;
  234. }
  235. }
  236. return extent_writepages(tree, mapping, btree_get_extent, wbc);
  237. }
  238. int btree_readpage(struct file *file, struct page *page)
  239. {
  240. struct extent_map_tree *tree;
  241. tree = &BTRFS_I(page->mapping->host)->extent_tree;
  242. return extent_read_full_page(tree, page, btree_get_extent);
  243. }
  244. static int btree_releasepage(struct page *page, gfp_t unused_gfp_flags)
  245. {
  246. struct extent_map_tree *tree;
  247. int ret;
  248. tree = &BTRFS_I(page->mapping->host)->extent_tree;
  249. ret = try_release_extent_mapping(tree, page);
  250. if (ret == 1) {
  251. ClearPagePrivate(page);
  252. set_page_private(page, 0);
  253. page_cache_release(page);
  254. }
  255. return ret;
  256. }
  257. static void btree_invalidatepage(struct page *page, unsigned long offset)
  258. {
  259. struct extent_map_tree *tree;
  260. tree = &BTRFS_I(page->mapping->host)->extent_tree;
  261. extent_invalidatepage(tree, page, offset);
  262. btree_releasepage(page, GFP_NOFS);
  263. }
  264. #if 0
  265. static int btree_writepage(struct page *page, struct writeback_control *wbc)
  266. {
  267. struct buffer_head *bh;
  268. struct btrfs_root *root = BTRFS_I(page->mapping->host)->root;
  269. struct buffer_head *head;
  270. if (!page_has_buffers(page)) {
  271. create_empty_buffers(page, root->fs_info->sb->s_blocksize,
  272. (1 << BH_Dirty)|(1 << BH_Uptodate));
  273. }
  274. head = page_buffers(page);
  275. bh = head;
  276. do {
  277. if (buffer_dirty(bh))
  278. csum_tree_block(root, bh, 0);
  279. bh = bh->b_this_page;
  280. } while (bh != head);
  281. return block_write_full_page(page, btree_get_block, wbc);
  282. }
  283. #endif
  284. static struct address_space_operations btree_aops = {
  285. .readpage = btree_readpage,
  286. .writepage = btree_writepage,
  287. .writepages = btree_writepages,
  288. .releasepage = btree_releasepage,
  289. .invalidatepage = btree_invalidatepage,
  290. .sync_page = block_sync_page,
  291. };
  292. int readahead_tree_block(struct btrfs_root *root, u64 bytenr, u32 blocksize)
  293. {
  294. struct extent_buffer *buf = NULL;
  295. struct inode *btree_inode = root->fs_info->btree_inode;
  296. int ret = 0;
  297. buf = btrfs_find_create_tree_block(root, bytenr, blocksize);
  298. if (!buf)
  299. return 0;
  300. read_extent_buffer_pages(&BTRFS_I(btree_inode)->extent_tree,
  301. buf, 0, 0);
  302. free_extent_buffer(buf);
  303. return ret;
  304. }
  305. struct extent_buffer *read_tree_block(struct btrfs_root *root, u64 bytenr,
  306. u32 blocksize)
  307. {
  308. struct extent_buffer *buf = NULL;
  309. struct inode *btree_inode = root->fs_info->btree_inode;
  310. struct extent_map_tree *extent_tree;
  311. u64 end;
  312. int ret;
  313. extent_tree = &BTRFS_I(btree_inode)->extent_tree;
  314. buf = btrfs_find_create_tree_block(root, bytenr, blocksize);
  315. if (!buf)
  316. return NULL;
  317. read_extent_buffer_pages(&BTRFS_I(btree_inode)->extent_tree,
  318. buf, 0, 1);
  319. if (buf->flags & EXTENT_CSUM)
  320. return buf;
  321. end = buf->start + PAGE_CACHE_SIZE - 1;
  322. if (test_range_bit(extent_tree, buf->start, end, EXTENT_CSUM, 1)) {
  323. buf->flags |= EXTENT_CSUM;
  324. return buf;
  325. }
  326. lock_extent(extent_tree, buf->start, end, GFP_NOFS);
  327. if (test_range_bit(extent_tree, buf->start, end, EXTENT_CSUM, 1)) {
  328. buf->flags |= EXTENT_CSUM;
  329. goto out_unlock;
  330. }
  331. ret = csum_tree_block(root, buf, 1);
  332. set_extent_bits(extent_tree, buf->start, end, EXTENT_CSUM, GFP_NOFS);
  333. buf->flags |= EXTENT_CSUM;
  334. out_unlock:
  335. unlock_extent(extent_tree, buf->start, end, GFP_NOFS);
  336. return buf;
  337. }
  338. int clean_tree_block(struct btrfs_trans_handle *trans, struct btrfs_root *root,
  339. struct extent_buffer *buf)
  340. {
  341. struct inode *btree_inode = root->fs_info->btree_inode;
  342. if (btrfs_header_generation(buf) ==
  343. root->fs_info->running_transaction->transid)
  344. clear_extent_buffer_dirty(&BTRFS_I(btree_inode)->extent_tree,
  345. buf);
  346. return 0;
  347. }
  348. int wait_on_tree_block_writeback(struct btrfs_root *root,
  349. struct extent_buffer *buf)
  350. {
  351. struct inode *btree_inode = root->fs_info->btree_inode;
  352. wait_on_extent_buffer_writeback(&BTRFS_I(btree_inode)->extent_tree,
  353. buf);
  354. return 0;
  355. }
  356. static int __setup_root(u32 nodesize, u32 leafsize, u32 sectorsize,
  357. u32 stripesize, struct btrfs_root *root,
  358. struct btrfs_fs_info *fs_info,
  359. u64 objectid)
  360. {
  361. root->node = NULL;
  362. root->inode = NULL;
  363. root->commit_root = NULL;
  364. root->sectorsize = sectorsize;
  365. root->nodesize = nodesize;
  366. root->leafsize = leafsize;
  367. root->stripesize = stripesize;
  368. root->ref_cows = 0;
  369. root->fs_info = fs_info;
  370. root->objectid = objectid;
  371. root->last_trans = 0;
  372. root->highest_inode = 0;
  373. root->last_inode_alloc = 0;
  374. root->name = NULL;
  375. root->in_sysfs = 0;
  376. memset(&root->root_key, 0, sizeof(root->root_key));
  377. memset(&root->root_item, 0, sizeof(root->root_item));
  378. memset(&root->defrag_progress, 0, sizeof(root->defrag_progress));
  379. memset(&root->root_kobj, 0, sizeof(root->root_kobj));
  380. init_completion(&root->kobj_unregister);
  381. root->defrag_running = 0;
  382. root->defrag_level = 0;
  383. root->root_key.objectid = objectid;
  384. return 0;
  385. }
  386. static int find_and_setup_root(struct btrfs_root *tree_root,
  387. struct btrfs_fs_info *fs_info,
  388. u64 objectid,
  389. struct btrfs_root *root)
  390. {
  391. int ret;
  392. u32 blocksize;
  393. __setup_root(tree_root->nodesize, tree_root->leafsize,
  394. tree_root->sectorsize, tree_root->stripesize,
  395. root, fs_info, objectid);
  396. ret = btrfs_find_last_root(tree_root, objectid,
  397. &root->root_item, &root->root_key);
  398. BUG_ON(ret);
  399. blocksize = btrfs_level_size(root, btrfs_root_level(&root->root_item));
  400. root->node = read_tree_block(root, btrfs_root_bytenr(&root->root_item),
  401. blocksize);
  402. BUG_ON(!root->node);
  403. return 0;
  404. }
  405. struct btrfs_root *btrfs_read_fs_root_no_radix(struct btrfs_fs_info *fs_info,
  406. struct btrfs_key *location)
  407. {
  408. struct btrfs_root *root;
  409. struct btrfs_root *tree_root = fs_info->tree_root;
  410. struct btrfs_path *path;
  411. struct extent_buffer *l;
  412. u64 highest_inode;
  413. u32 blocksize;
  414. int ret = 0;
  415. root = kzalloc(sizeof(*root), GFP_NOFS);
  416. if (!root)
  417. return ERR_PTR(-ENOMEM);
  418. if (location->offset == (u64)-1) {
  419. ret = find_and_setup_root(tree_root, fs_info,
  420. location->objectid, root);
  421. if (ret) {
  422. kfree(root);
  423. return ERR_PTR(ret);
  424. }
  425. goto insert;
  426. }
  427. __setup_root(tree_root->nodesize, tree_root->leafsize,
  428. tree_root->sectorsize, tree_root->stripesize,
  429. root, fs_info, location->objectid);
  430. path = btrfs_alloc_path();
  431. BUG_ON(!path);
  432. ret = btrfs_search_slot(NULL, tree_root, location, path, 0, 0);
  433. if (ret != 0) {
  434. if (ret > 0)
  435. ret = -ENOENT;
  436. goto out;
  437. }
  438. l = path->nodes[0];
  439. read_extent_buffer(l, &root->root_item,
  440. btrfs_item_ptr_offset(l, path->slots[0]),
  441. sizeof(root->root_item));
  442. memcpy(&root->root_key, location, sizeof(*location));
  443. ret = 0;
  444. out:
  445. btrfs_release_path(root, path);
  446. btrfs_free_path(path);
  447. if (ret) {
  448. kfree(root);
  449. return ERR_PTR(ret);
  450. }
  451. blocksize = btrfs_level_size(root, btrfs_root_level(&root->root_item));
  452. root->node = read_tree_block(root, btrfs_root_bytenr(&root->root_item),
  453. blocksize);
  454. BUG_ON(!root->node);
  455. insert:
  456. root->ref_cows = 1;
  457. ret = btrfs_find_highest_inode(root, &highest_inode);
  458. if (ret == 0) {
  459. root->highest_inode = highest_inode;
  460. root->last_inode_alloc = highest_inode;
  461. }
  462. return root;
  463. }
  464. struct btrfs_root *btrfs_lookup_fs_root(struct btrfs_fs_info *fs_info,
  465. u64 root_objectid)
  466. {
  467. struct btrfs_root *root;
  468. if (root_objectid == BTRFS_ROOT_TREE_OBJECTID)
  469. return fs_info->tree_root;
  470. if (root_objectid == BTRFS_EXTENT_TREE_OBJECTID)
  471. return fs_info->extent_root;
  472. root = radix_tree_lookup(&fs_info->fs_roots_radix,
  473. (unsigned long)root_objectid);
  474. return root;
  475. }
  476. struct btrfs_root *btrfs_read_fs_root_no_name(struct btrfs_fs_info *fs_info,
  477. struct btrfs_key *location)
  478. {
  479. struct btrfs_root *root;
  480. int ret;
  481. if (location->objectid == BTRFS_ROOT_TREE_OBJECTID)
  482. return fs_info->tree_root;
  483. if (location->objectid == BTRFS_EXTENT_TREE_OBJECTID)
  484. return fs_info->extent_root;
  485. root = radix_tree_lookup(&fs_info->fs_roots_radix,
  486. (unsigned long)location->objectid);
  487. if (root)
  488. return root;
  489. root = btrfs_read_fs_root_no_radix(fs_info, location);
  490. if (IS_ERR(root))
  491. return root;
  492. ret = radix_tree_insert(&fs_info->fs_roots_radix,
  493. (unsigned long)root->root_key.objectid,
  494. root);
  495. if (ret) {
  496. free_extent_buffer(root->node);
  497. kfree(root);
  498. return ERR_PTR(ret);
  499. }
  500. ret = btrfs_find_dead_roots(fs_info->tree_root,
  501. root->root_key.objectid, root);
  502. BUG_ON(ret);
  503. return root;
  504. }
  505. struct btrfs_root *btrfs_read_fs_root(struct btrfs_fs_info *fs_info,
  506. struct btrfs_key *location,
  507. const char *name, int namelen)
  508. {
  509. struct btrfs_root *root;
  510. int ret;
  511. root = btrfs_read_fs_root_no_name(fs_info, location);
  512. if (!root)
  513. return NULL;
  514. if (root->in_sysfs)
  515. return root;
  516. ret = btrfs_set_root_name(root, name, namelen);
  517. if (ret) {
  518. free_extent_buffer(root->node);
  519. kfree(root);
  520. return ERR_PTR(ret);
  521. }
  522. ret = btrfs_sysfs_add_root(root);
  523. if (ret) {
  524. free_extent_buffer(root->node);
  525. kfree(root->name);
  526. kfree(root);
  527. return ERR_PTR(ret);
  528. }
  529. root->in_sysfs = 1;
  530. return root;
  531. }
  532. #if 0
  533. static int add_hasher(struct btrfs_fs_info *info, char *type) {
  534. struct btrfs_hasher *hasher;
  535. hasher = kmalloc(sizeof(*hasher), GFP_NOFS);
  536. if (!hasher)
  537. return -ENOMEM;
  538. hasher->hash_tfm = crypto_alloc_hash(type, 0, CRYPTO_ALG_ASYNC);
  539. if (!hasher->hash_tfm) {
  540. kfree(hasher);
  541. return -EINVAL;
  542. }
  543. spin_lock(&info->hash_lock);
  544. list_add(&hasher->list, &info->hashers);
  545. spin_unlock(&info->hash_lock);
  546. return 0;
  547. }
  548. #endif
  549. struct btrfs_root *open_ctree(struct super_block *sb)
  550. {
  551. u32 sectorsize;
  552. u32 nodesize;
  553. u32 leafsize;
  554. u32 blocksize;
  555. u32 stripesize;
  556. struct btrfs_root *extent_root = kmalloc(sizeof(struct btrfs_root),
  557. GFP_NOFS);
  558. struct btrfs_root *tree_root = kmalloc(sizeof(struct btrfs_root),
  559. GFP_NOFS);
  560. struct btrfs_fs_info *fs_info = kmalloc(sizeof(*fs_info),
  561. GFP_NOFS);
  562. int ret;
  563. int err = -EIO;
  564. struct btrfs_super_block *disk_super;
  565. if (!extent_root || !tree_root || !fs_info) {
  566. err = -ENOMEM;
  567. goto fail;
  568. }
  569. INIT_RADIX_TREE(&fs_info->fs_roots_radix, GFP_NOFS);
  570. INIT_LIST_HEAD(&fs_info->trans_list);
  571. INIT_LIST_HEAD(&fs_info->dead_roots);
  572. INIT_LIST_HEAD(&fs_info->hashers);
  573. spin_lock_init(&fs_info->hash_lock);
  574. spin_lock_init(&fs_info->delalloc_lock);
  575. spin_lock_init(&fs_info->new_trans_lock);
  576. memset(&fs_info->super_kobj, 0, sizeof(fs_info->super_kobj));
  577. init_completion(&fs_info->kobj_unregister);
  578. sb_set_blocksize(sb, 4096);
  579. fs_info->running_transaction = NULL;
  580. fs_info->last_trans_committed = 0;
  581. fs_info->tree_root = tree_root;
  582. fs_info->extent_root = extent_root;
  583. fs_info->sb = sb;
  584. fs_info->throttles = 0;
  585. fs_info->mount_opt = 0;
  586. fs_info->max_extent = (u64)-1;
  587. fs_info->delalloc_bytes = 0;
  588. fs_info->btree_inode = new_inode(sb);
  589. fs_info->btree_inode->i_ino = 1;
  590. fs_info->btree_inode->i_nlink = 1;
  591. fs_info->btree_inode->i_size = sb->s_bdev->bd_inode->i_size;
  592. fs_info->btree_inode->i_mapping->a_ops = &btree_aops;
  593. extent_map_tree_init(&BTRFS_I(fs_info->btree_inode)->extent_tree,
  594. fs_info->btree_inode->i_mapping,
  595. GFP_NOFS);
  596. BTRFS_I(fs_info->btree_inode)->extent_tree.ops = &btree_extent_map_ops;
  597. extent_map_tree_init(&fs_info->free_space_cache,
  598. fs_info->btree_inode->i_mapping, GFP_NOFS);
  599. extent_map_tree_init(&fs_info->block_group_cache,
  600. fs_info->btree_inode->i_mapping, GFP_NOFS);
  601. extent_map_tree_init(&fs_info->pinned_extents,
  602. fs_info->btree_inode->i_mapping, GFP_NOFS);
  603. extent_map_tree_init(&fs_info->pending_del,
  604. fs_info->btree_inode->i_mapping, GFP_NOFS);
  605. extent_map_tree_init(&fs_info->extent_ins,
  606. fs_info->btree_inode->i_mapping, GFP_NOFS);
  607. fs_info->do_barriers = 1;
  608. fs_info->closing = 0;
  609. fs_info->total_pinned = 0;
  610. #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18)
  611. INIT_WORK(&fs_info->trans_work, btrfs_transaction_cleaner, fs_info);
  612. #else
  613. INIT_DELAYED_WORK(&fs_info->trans_work, btrfs_transaction_cleaner);
  614. #endif
  615. BTRFS_I(fs_info->btree_inode)->root = tree_root;
  616. memset(&BTRFS_I(fs_info->btree_inode)->location, 0,
  617. sizeof(struct btrfs_key));
  618. insert_inode_hash(fs_info->btree_inode);
  619. mapping_set_gfp_mask(fs_info->btree_inode->i_mapping, GFP_NOFS);
  620. mutex_init(&fs_info->trans_mutex);
  621. mutex_init(&fs_info->fs_mutex);
  622. #if 0
  623. ret = add_hasher(fs_info, "crc32c");
  624. if (ret) {
  625. printk("btrfs: failed hash setup, modprobe cryptomgr?\n");
  626. err = -ENOMEM;
  627. goto fail_iput;
  628. }
  629. #endif
  630. __setup_root(512, 512, 512, 512, tree_root,
  631. fs_info, BTRFS_ROOT_TREE_OBJECTID);
  632. fs_info->sb_buffer = read_tree_block(tree_root,
  633. BTRFS_SUPER_INFO_OFFSET,
  634. 512);
  635. if (!fs_info->sb_buffer)
  636. goto fail_iput;
  637. read_extent_buffer(fs_info->sb_buffer, &fs_info->super_copy, 0,
  638. sizeof(fs_info->super_copy));
  639. read_extent_buffer(fs_info->sb_buffer, fs_info->fsid,
  640. (unsigned long)btrfs_super_fsid(fs_info->sb_buffer),
  641. BTRFS_FSID_SIZE);
  642. disk_super = &fs_info->super_copy;
  643. if (!btrfs_super_root(disk_super))
  644. goto fail_sb_buffer;
  645. nodesize = btrfs_super_nodesize(disk_super);
  646. leafsize = btrfs_super_leafsize(disk_super);
  647. sectorsize = btrfs_super_sectorsize(disk_super);
  648. stripesize = btrfs_super_stripesize(disk_super);
  649. tree_root->nodesize = nodesize;
  650. tree_root->leafsize = leafsize;
  651. tree_root->sectorsize = sectorsize;
  652. tree_root->stripesize = stripesize;
  653. sb_set_blocksize(sb, sectorsize);
  654. i_size_write(fs_info->btree_inode,
  655. btrfs_super_total_bytes(disk_super));
  656. if (strncmp((char *)(&disk_super->magic), BTRFS_MAGIC,
  657. sizeof(disk_super->magic))) {
  658. printk("btrfs: valid FS not found on %s\n", sb->s_id);
  659. goto fail_sb_buffer;
  660. }
  661. blocksize = btrfs_level_size(tree_root,
  662. btrfs_super_root_level(disk_super));
  663. tree_root->node = read_tree_block(tree_root,
  664. btrfs_super_root(disk_super),
  665. blocksize);
  666. if (!tree_root->node)
  667. goto fail_sb_buffer;
  668. mutex_lock(&fs_info->fs_mutex);
  669. ret = find_and_setup_root(tree_root, fs_info,
  670. BTRFS_EXTENT_TREE_OBJECTID, extent_root);
  671. if (ret) {
  672. mutex_unlock(&fs_info->fs_mutex);
  673. goto fail_tree_root;
  674. }
  675. btrfs_read_block_groups(extent_root);
  676. fs_info->generation = btrfs_super_generation(disk_super) + 1;
  677. mutex_unlock(&fs_info->fs_mutex);
  678. return tree_root;
  679. fail_tree_root:
  680. free_extent_buffer(tree_root->node);
  681. fail_sb_buffer:
  682. free_extent_buffer(fs_info->sb_buffer);
  683. fail_iput:
  684. iput(fs_info->btree_inode);
  685. fail:
  686. kfree(extent_root);
  687. kfree(tree_root);
  688. kfree(fs_info);
  689. return ERR_PTR(err);
  690. }
  691. int write_ctree_super(struct btrfs_trans_handle *trans, struct btrfs_root
  692. *root)
  693. {
  694. int ret;
  695. struct extent_buffer *super = root->fs_info->sb_buffer;
  696. struct inode *btree_inode = root->fs_info->btree_inode;
  697. struct super_block *sb = root->fs_info->sb;
  698. if (!btrfs_test_opt(root, NOBARRIER))
  699. blkdev_issue_flush(sb->s_bdev, NULL);
  700. set_extent_buffer_dirty(&BTRFS_I(btree_inode)->extent_tree, super);
  701. ret = sync_page_range_nolock(btree_inode, btree_inode->i_mapping,
  702. super->start, super->len);
  703. if (!btrfs_test_opt(root, NOBARRIER))
  704. blkdev_issue_flush(sb->s_bdev, NULL);
  705. return ret;
  706. }
  707. int btrfs_free_fs_root(struct btrfs_fs_info *fs_info, struct btrfs_root *root)
  708. {
  709. radix_tree_delete(&fs_info->fs_roots_radix,
  710. (unsigned long)root->root_key.objectid);
  711. if (root->in_sysfs)
  712. btrfs_sysfs_del_root(root);
  713. if (root->inode)
  714. iput(root->inode);
  715. if (root->node)
  716. free_extent_buffer(root->node);
  717. if (root->commit_root)
  718. free_extent_buffer(root->commit_root);
  719. if (root->name)
  720. kfree(root->name);
  721. kfree(root);
  722. return 0;
  723. }
  724. static int del_fs_roots(struct btrfs_fs_info *fs_info)
  725. {
  726. int ret;
  727. struct btrfs_root *gang[8];
  728. int i;
  729. while(1) {
  730. ret = radix_tree_gang_lookup(&fs_info->fs_roots_radix,
  731. (void **)gang, 0,
  732. ARRAY_SIZE(gang));
  733. if (!ret)
  734. break;
  735. for (i = 0; i < ret; i++)
  736. btrfs_free_fs_root(fs_info, gang[i]);
  737. }
  738. return 0;
  739. }
  740. int close_ctree(struct btrfs_root *root)
  741. {
  742. int ret;
  743. struct btrfs_trans_handle *trans;
  744. struct btrfs_fs_info *fs_info = root->fs_info;
  745. fs_info->closing = 1;
  746. btrfs_transaction_flush_work(root);
  747. mutex_lock(&fs_info->fs_mutex);
  748. btrfs_defrag_dirty_roots(root->fs_info);
  749. trans = btrfs_start_transaction(root, 1);
  750. ret = btrfs_commit_transaction(trans, root);
  751. /* run commit again to drop the original snapshot */
  752. trans = btrfs_start_transaction(root, 1);
  753. btrfs_commit_transaction(trans, root);
  754. ret = btrfs_write_and_wait_transaction(NULL, root);
  755. BUG_ON(ret);
  756. write_ctree_super(NULL, root);
  757. mutex_unlock(&fs_info->fs_mutex);
  758. if (fs_info->extent_root->node)
  759. free_extent_buffer(fs_info->extent_root->node);
  760. if (fs_info->tree_root->node)
  761. free_extent_buffer(fs_info->tree_root->node);
  762. free_extent_buffer(fs_info->sb_buffer);
  763. btrfs_free_block_groups(root->fs_info);
  764. del_fs_roots(fs_info);
  765. filemap_write_and_wait(fs_info->btree_inode->i_mapping);
  766. extent_map_tree_empty_lru(&fs_info->free_space_cache);
  767. extent_map_tree_empty_lru(&fs_info->block_group_cache);
  768. extent_map_tree_empty_lru(&fs_info->pinned_extents);
  769. extent_map_tree_empty_lru(&fs_info->pending_del);
  770. extent_map_tree_empty_lru(&fs_info->extent_ins);
  771. extent_map_tree_empty_lru(&BTRFS_I(fs_info->btree_inode)->extent_tree);
  772. truncate_inode_pages(fs_info->btree_inode->i_mapping, 0);
  773. iput(fs_info->btree_inode);
  774. #if 0
  775. while(!list_empty(&fs_info->hashers)) {
  776. struct btrfs_hasher *hasher;
  777. hasher = list_entry(fs_info->hashers.next, struct btrfs_hasher,
  778. hashers);
  779. list_del(&hasher->hashers);
  780. crypto_free_hash(&fs_info->hash_tfm);
  781. kfree(hasher);
  782. }
  783. #endif
  784. kfree(fs_info->extent_root);
  785. kfree(fs_info->tree_root);
  786. return 0;
  787. }
  788. int btrfs_buffer_uptodate(struct extent_buffer *buf)
  789. {
  790. struct inode *btree_inode = buf->first_page->mapping->host;
  791. return extent_buffer_uptodate(&BTRFS_I(btree_inode)->extent_tree, buf);
  792. }
  793. int btrfs_set_buffer_uptodate(struct extent_buffer *buf)
  794. {
  795. struct inode *btree_inode = buf->first_page->mapping->host;
  796. return set_extent_buffer_uptodate(&BTRFS_I(btree_inode)->extent_tree,
  797. buf);
  798. }
  799. void btrfs_mark_buffer_dirty(struct extent_buffer *buf)
  800. {
  801. struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
  802. u64 transid = btrfs_header_generation(buf);
  803. struct inode *btree_inode = root->fs_info->btree_inode;
  804. if (transid != root->fs_info->generation) {
  805. printk(KERN_CRIT "transid mismatch buffer %llu, found %Lu running %Lu\n",
  806. (unsigned long long)buf->start,
  807. transid, root->fs_info->generation);
  808. WARN_ON(1);
  809. }
  810. set_extent_buffer_dirty(&BTRFS_I(btree_inode)->extent_tree, buf);
  811. }
  812. void btrfs_throttle(struct btrfs_root *root)
  813. {
  814. struct backing_dev_info *bdi;
  815. bdi = root->fs_info->sb->s_bdev->bd_inode->i_mapping->backing_dev_info;
  816. if (root->fs_info->throttles && bdi_write_congested(bdi))
  817. congestion_wait(WRITE, HZ/20);
  818. }
  819. void btrfs_btree_balance_dirty(struct btrfs_root *root, unsigned long nr)
  820. {
  821. balance_dirty_pages_ratelimited_nr(
  822. root->fs_info->btree_inode->i_mapping, 1);
  823. }
  824. void btrfs_set_buffer_defrag(struct extent_buffer *buf)
  825. {
  826. struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
  827. struct inode *btree_inode = root->fs_info->btree_inode;
  828. set_extent_bits(&BTRFS_I(btree_inode)->extent_tree, buf->start,
  829. buf->start + buf->len - 1, EXTENT_DEFRAG, GFP_NOFS);
  830. }
  831. void btrfs_set_buffer_defrag_done(struct extent_buffer *buf)
  832. {
  833. struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
  834. struct inode *btree_inode = root->fs_info->btree_inode;
  835. set_extent_bits(&BTRFS_I(btree_inode)->extent_tree, buf->start,
  836. buf->start + buf->len - 1, EXTENT_DEFRAG_DONE,
  837. GFP_NOFS);
  838. }
  839. int btrfs_buffer_defrag(struct extent_buffer *buf)
  840. {
  841. struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
  842. struct inode *btree_inode = root->fs_info->btree_inode;
  843. return test_range_bit(&BTRFS_I(btree_inode)->extent_tree,
  844. buf->start, buf->start + buf->len - 1, EXTENT_DEFRAG, 0);
  845. }
  846. int btrfs_buffer_defrag_done(struct extent_buffer *buf)
  847. {
  848. struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
  849. struct inode *btree_inode = root->fs_info->btree_inode;
  850. return test_range_bit(&BTRFS_I(btree_inode)->extent_tree,
  851. buf->start, buf->start + buf->len - 1,
  852. EXTENT_DEFRAG_DONE, 0);
  853. }
  854. int btrfs_clear_buffer_defrag_done(struct extent_buffer *buf)
  855. {
  856. struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
  857. struct inode *btree_inode = root->fs_info->btree_inode;
  858. return clear_extent_bits(&BTRFS_I(btree_inode)->extent_tree,
  859. buf->start, buf->start + buf->len - 1,
  860. EXTENT_DEFRAG_DONE, GFP_NOFS);
  861. }
  862. int btrfs_clear_buffer_defrag(struct extent_buffer *buf)
  863. {
  864. struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
  865. struct inode *btree_inode = root->fs_info->btree_inode;
  866. return clear_extent_bits(&BTRFS_I(btree_inode)->extent_tree,
  867. buf->start, buf->start + buf->len - 1,
  868. EXTENT_DEFRAG, GFP_NOFS);
  869. }
  870. int btrfs_read_buffer(struct extent_buffer *buf)
  871. {
  872. struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
  873. struct inode *btree_inode = root->fs_info->btree_inode;
  874. return read_extent_buffer_pages(&BTRFS_I(btree_inode)->extent_tree,
  875. buf, 0, 1);
  876. }
  877. static struct extent_map_ops btree_extent_map_ops = {
  878. .writepage_io_hook = btree_writepage_io_hook,
  879. };