disk-io.c 66 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489
  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/scatterlist.h>
  21. #include <linux/swap.h>
  22. #include <linux/radix-tree.h>
  23. #include <linux/writeback.h>
  24. #include <linux/buffer_head.h>
  25. #include <linux/workqueue.h>
  26. #include <linux/kthread.h>
  27. #include <linux/freezer.h>
  28. #include <linux/crc32c.h>
  29. #include "compat.h"
  30. #include "ctree.h"
  31. #include "disk-io.h"
  32. #include "transaction.h"
  33. #include "btrfs_inode.h"
  34. #include "volumes.h"
  35. #include "print-tree.h"
  36. #include "async-thread.h"
  37. #include "locking.h"
  38. #include "tree-log.h"
  39. #include "free-space-cache.h"
  40. static struct extent_io_ops btree_extent_io_ops;
  41. static void end_workqueue_fn(struct btrfs_work *work);
  42. /*
  43. * end_io_wq structs are used to do processing in task context when an IO is
  44. * complete. This is used during reads to verify checksums, and it is used
  45. * by writes to insert metadata for new file extents after IO is complete.
  46. */
  47. struct end_io_wq {
  48. struct bio *bio;
  49. bio_end_io_t *end_io;
  50. void *private;
  51. struct btrfs_fs_info *info;
  52. int error;
  53. int metadata;
  54. struct list_head list;
  55. struct btrfs_work work;
  56. };
  57. /*
  58. * async submit bios are used to offload expensive checksumming
  59. * onto the worker threads. They checksum file and metadata bios
  60. * just before they are sent down the IO stack.
  61. */
  62. struct async_submit_bio {
  63. struct inode *inode;
  64. struct bio *bio;
  65. struct list_head list;
  66. extent_submit_bio_hook_t *submit_bio_start;
  67. extent_submit_bio_hook_t *submit_bio_done;
  68. int rw;
  69. int mirror_num;
  70. unsigned long bio_flags;
  71. struct btrfs_work work;
  72. };
  73. /* These are used to set the lockdep class on the extent buffer locks.
  74. * The class is set by the readpage_end_io_hook after the buffer has
  75. * passed csum validation but before the pages are unlocked.
  76. *
  77. * The lockdep class is also set by btrfs_init_new_buffer on freshly
  78. * allocated blocks.
  79. *
  80. * The class is based on the level in the tree block, which allows lockdep
  81. * to know that lower nodes nest inside the locks of higher nodes.
  82. *
  83. * We also add a check to make sure the highest level of the tree is
  84. * the same as our lockdep setup here. If BTRFS_MAX_LEVEL changes, this
  85. * code needs update as well.
  86. */
  87. #ifdef CONFIG_DEBUG_LOCK_ALLOC
  88. # if BTRFS_MAX_LEVEL != 8
  89. # error
  90. # endif
  91. static struct lock_class_key btrfs_eb_class[BTRFS_MAX_LEVEL + 1];
  92. static const char *btrfs_eb_name[BTRFS_MAX_LEVEL + 1] = {
  93. /* leaf */
  94. "btrfs-extent-00",
  95. "btrfs-extent-01",
  96. "btrfs-extent-02",
  97. "btrfs-extent-03",
  98. "btrfs-extent-04",
  99. "btrfs-extent-05",
  100. "btrfs-extent-06",
  101. "btrfs-extent-07",
  102. /* highest possible level */
  103. "btrfs-extent-08",
  104. };
  105. #endif
  106. /*
  107. * extents on the btree inode are pretty simple, there's one extent
  108. * that covers the entire device
  109. */
  110. static struct extent_map *btree_get_extent(struct inode *inode,
  111. struct page *page, size_t page_offset, u64 start, u64 len,
  112. int create)
  113. {
  114. struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
  115. struct extent_map *em;
  116. int ret;
  117. spin_lock(&em_tree->lock);
  118. em = lookup_extent_mapping(em_tree, start, len);
  119. if (em) {
  120. em->bdev =
  121. BTRFS_I(inode)->root->fs_info->fs_devices->latest_bdev;
  122. spin_unlock(&em_tree->lock);
  123. goto out;
  124. }
  125. spin_unlock(&em_tree->lock);
  126. em = alloc_extent_map(GFP_NOFS);
  127. if (!em) {
  128. em = ERR_PTR(-ENOMEM);
  129. goto out;
  130. }
  131. em->start = 0;
  132. em->len = (u64)-1;
  133. em->block_len = (u64)-1;
  134. em->block_start = 0;
  135. em->bdev = BTRFS_I(inode)->root->fs_info->fs_devices->latest_bdev;
  136. spin_lock(&em_tree->lock);
  137. ret = add_extent_mapping(em_tree, em);
  138. if (ret == -EEXIST) {
  139. u64 failed_start = em->start;
  140. u64 failed_len = em->len;
  141. free_extent_map(em);
  142. em = lookup_extent_mapping(em_tree, start, len);
  143. if (em) {
  144. ret = 0;
  145. } else {
  146. em = lookup_extent_mapping(em_tree, failed_start,
  147. failed_len);
  148. ret = -EIO;
  149. }
  150. } else if (ret) {
  151. free_extent_map(em);
  152. em = NULL;
  153. }
  154. spin_unlock(&em_tree->lock);
  155. if (ret)
  156. em = ERR_PTR(ret);
  157. out:
  158. return em;
  159. }
  160. u32 btrfs_csum_data(struct btrfs_root *root, char *data, u32 seed, size_t len)
  161. {
  162. return crc32c(seed, data, len);
  163. }
  164. void btrfs_csum_final(u32 crc, char *result)
  165. {
  166. *(__le32 *)result = ~cpu_to_le32(crc);
  167. }
  168. /*
  169. * compute the csum for a btree block, and either verify it or write it
  170. * into the csum field of the block.
  171. */
  172. static int csum_tree_block(struct btrfs_root *root, struct extent_buffer *buf,
  173. int verify)
  174. {
  175. u16 csum_size =
  176. btrfs_super_csum_size(&root->fs_info->super_copy);
  177. char *result = NULL;
  178. unsigned long len;
  179. unsigned long cur_len;
  180. unsigned long offset = BTRFS_CSUM_SIZE;
  181. char *map_token = NULL;
  182. char *kaddr;
  183. unsigned long map_start;
  184. unsigned long map_len;
  185. int err;
  186. u32 crc = ~(u32)0;
  187. unsigned long inline_result;
  188. len = buf->len - offset;
  189. while (len > 0) {
  190. err = map_private_extent_buffer(buf, offset, 32,
  191. &map_token, &kaddr,
  192. &map_start, &map_len, KM_USER0);
  193. if (err)
  194. return 1;
  195. cur_len = min(len, map_len - (offset - map_start));
  196. crc = btrfs_csum_data(root, kaddr + offset - map_start,
  197. crc, cur_len);
  198. len -= cur_len;
  199. offset += cur_len;
  200. unmap_extent_buffer(buf, map_token, KM_USER0);
  201. }
  202. if (csum_size > sizeof(inline_result)) {
  203. result = kzalloc(csum_size * sizeof(char), GFP_NOFS);
  204. if (!result)
  205. return 1;
  206. } else {
  207. result = (char *)&inline_result;
  208. }
  209. btrfs_csum_final(crc, result);
  210. if (verify) {
  211. if (memcmp_extent_buffer(buf, result, 0, csum_size)) {
  212. u32 val;
  213. u32 found = 0;
  214. memcpy(&found, result, csum_size);
  215. read_extent_buffer(buf, &val, 0, csum_size);
  216. if (printk_ratelimit()) {
  217. printk(KERN_INFO "btrfs: %s checksum verify "
  218. "failed on %llu wanted %X found %X "
  219. "level %d\n",
  220. root->fs_info->sb->s_id,
  221. (unsigned long long)buf->start, val, found,
  222. btrfs_header_level(buf));
  223. }
  224. if (result != (char *)&inline_result)
  225. kfree(result);
  226. return 1;
  227. }
  228. } else {
  229. write_extent_buffer(buf, result, 0, csum_size);
  230. }
  231. if (result != (char *)&inline_result)
  232. kfree(result);
  233. return 0;
  234. }
  235. /*
  236. * we can't consider a given block up to date unless the transid of the
  237. * block matches the transid in the parent node's pointer. This is how we
  238. * detect blocks that either didn't get written at all or got written
  239. * in the wrong place.
  240. */
  241. static int verify_parent_transid(struct extent_io_tree *io_tree,
  242. struct extent_buffer *eb, u64 parent_transid)
  243. {
  244. int ret;
  245. if (!parent_transid || btrfs_header_generation(eb) == parent_transid)
  246. return 0;
  247. lock_extent(io_tree, eb->start, eb->start + eb->len - 1, GFP_NOFS);
  248. if (extent_buffer_uptodate(io_tree, eb) &&
  249. btrfs_header_generation(eb) == parent_transid) {
  250. ret = 0;
  251. goto out;
  252. }
  253. if (printk_ratelimit()) {
  254. printk("parent transid verify failed on %llu wanted %llu "
  255. "found %llu\n",
  256. (unsigned long long)eb->start,
  257. (unsigned long long)parent_transid,
  258. (unsigned long long)btrfs_header_generation(eb));
  259. }
  260. ret = 1;
  261. clear_extent_buffer_uptodate(io_tree, eb);
  262. out:
  263. unlock_extent(io_tree, eb->start, eb->start + eb->len - 1,
  264. GFP_NOFS);
  265. return ret;
  266. }
  267. /*
  268. * helper to read a given tree block, doing retries as required when
  269. * the checksums don't match and we have alternate mirrors to try.
  270. */
  271. static int btree_read_extent_buffer_pages(struct btrfs_root *root,
  272. struct extent_buffer *eb,
  273. u64 start, u64 parent_transid)
  274. {
  275. struct extent_io_tree *io_tree;
  276. int ret;
  277. int num_copies = 0;
  278. int mirror_num = 0;
  279. io_tree = &BTRFS_I(root->fs_info->btree_inode)->io_tree;
  280. while (1) {
  281. ret = read_extent_buffer_pages(io_tree, eb, start, 1,
  282. btree_get_extent, mirror_num);
  283. if (!ret &&
  284. !verify_parent_transid(io_tree, eb, parent_transid))
  285. return ret;
  286. num_copies = btrfs_num_copies(&root->fs_info->mapping_tree,
  287. eb->start, eb->len);
  288. if (num_copies == 1)
  289. return ret;
  290. mirror_num++;
  291. if (mirror_num > num_copies)
  292. return ret;
  293. }
  294. return -EIO;
  295. }
  296. /*
  297. * checksum a dirty tree block before IO. This has extra checks to make sure
  298. * we only fill in the checksum field in the first page of a multi-page block
  299. */
  300. static int csum_dirty_buffer(struct btrfs_root *root, struct page *page)
  301. {
  302. struct extent_io_tree *tree;
  303. u64 start = (u64)page->index << PAGE_CACHE_SHIFT;
  304. u64 found_start;
  305. int found_level;
  306. unsigned long len;
  307. struct extent_buffer *eb;
  308. int ret;
  309. tree = &BTRFS_I(page->mapping->host)->io_tree;
  310. if (page->private == EXTENT_PAGE_PRIVATE)
  311. goto out;
  312. if (!page->private)
  313. goto out;
  314. len = page->private >> 2;
  315. WARN_ON(len == 0);
  316. eb = alloc_extent_buffer(tree, start, len, page, GFP_NOFS);
  317. ret = btree_read_extent_buffer_pages(root, eb, start + PAGE_CACHE_SIZE,
  318. btrfs_header_generation(eb));
  319. BUG_ON(ret);
  320. found_start = btrfs_header_bytenr(eb);
  321. if (found_start != start) {
  322. WARN_ON(1);
  323. goto err;
  324. }
  325. if (eb->first_page != page) {
  326. WARN_ON(1);
  327. goto err;
  328. }
  329. if (!PageUptodate(page)) {
  330. WARN_ON(1);
  331. goto err;
  332. }
  333. found_level = btrfs_header_level(eb);
  334. csum_tree_block(root, eb, 0);
  335. err:
  336. free_extent_buffer(eb);
  337. out:
  338. return 0;
  339. }
  340. static int check_tree_block_fsid(struct btrfs_root *root,
  341. struct extent_buffer *eb)
  342. {
  343. struct btrfs_fs_devices *fs_devices = root->fs_info->fs_devices;
  344. u8 fsid[BTRFS_UUID_SIZE];
  345. int ret = 1;
  346. read_extent_buffer(eb, fsid, (unsigned long)btrfs_header_fsid(eb),
  347. BTRFS_FSID_SIZE);
  348. while (fs_devices) {
  349. if (!memcmp(fsid, fs_devices->fsid, BTRFS_FSID_SIZE)) {
  350. ret = 0;
  351. break;
  352. }
  353. fs_devices = fs_devices->seed;
  354. }
  355. return ret;
  356. }
  357. #ifdef CONFIG_DEBUG_LOCK_ALLOC
  358. void btrfs_set_buffer_lockdep_class(struct extent_buffer *eb, int level)
  359. {
  360. lockdep_set_class_and_name(&eb->lock,
  361. &btrfs_eb_class[level],
  362. btrfs_eb_name[level]);
  363. }
  364. #endif
  365. static int btree_readpage_end_io_hook(struct page *page, u64 start, u64 end,
  366. struct extent_state *state)
  367. {
  368. struct extent_io_tree *tree;
  369. u64 found_start;
  370. int found_level;
  371. unsigned long len;
  372. struct extent_buffer *eb;
  373. struct btrfs_root *root = BTRFS_I(page->mapping->host)->root;
  374. int ret = 0;
  375. tree = &BTRFS_I(page->mapping->host)->io_tree;
  376. if (page->private == EXTENT_PAGE_PRIVATE)
  377. goto out;
  378. if (!page->private)
  379. goto out;
  380. len = page->private >> 2;
  381. WARN_ON(len == 0);
  382. eb = alloc_extent_buffer(tree, start, len, page, GFP_NOFS);
  383. found_start = btrfs_header_bytenr(eb);
  384. if (found_start != start) {
  385. if (printk_ratelimit()) {
  386. printk(KERN_INFO "btrfs bad tree block start "
  387. "%llu %llu\n",
  388. (unsigned long long)found_start,
  389. (unsigned long long)eb->start);
  390. }
  391. ret = -EIO;
  392. goto err;
  393. }
  394. if (eb->first_page != page) {
  395. printk(KERN_INFO "btrfs bad first page %lu %lu\n",
  396. eb->first_page->index, page->index);
  397. WARN_ON(1);
  398. ret = -EIO;
  399. goto err;
  400. }
  401. if (check_tree_block_fsid(root, eb)) {
  402. if (printk_ratelimit()) {
  403. printk(KERN_INFO "btrfs bad fsid on block %llu\n",
  404. (unsigned long long)eb->start);
  405. }
  406. ret = -EIO;
  407. goto err;
  408. }
  409. found_level = btrfs_header_level(eb);
  410. btrfs_set_buffer_lockdep_class(eb, found_level);
  411. ret = csum_tree_block(root, eb, 1);
  412. if (ret)
  413. ret = -EIO;
  414. end = min_t(u64, eb->len, PAGE_CACHE_SIZE);
  415. end = eb->start + end - 1;
  416. err:
  417. free_extent_buffer(eb);
  418. out:
  419. return ret;
  420. }
  421. static void end_workqueue_bio(struct bio *bio, int err)
  422. {
  423. struct end_io_wq *end_io_wq = bio->bi_private;
  424. struct btrfs_fs_info *fs_info;
  425. fs_info = end_io_wq->info;
  426. end_io_wq->error = err;
  427. end_io_wq->work.func = end_workqueue_fn;
  428. end_io_wq->work.flags = 0;
  429. if (bio->bi_rw & (1 << BIO_RW)) {
  430. if (end_io_wq->metadata)
  431. btrfs_queue_worker(&fs_info->endio_meta_write_workers,
  432. &end_io_wq->work);
  433. else
  434. btrfs_queue_worker(&fs_info->endio_write_workers,
  435. &end_io_wq->work);
  436. } else {
  437. if (end_io_wq->metadata)
  438. btrfs_queue_worker(&fs_info->endio_meta_workers,
  439. &end_io_wq->work);
  440. else
  441. btrfs_queue_worker(&fs_info->endio_workers,
  442. &end_io_wq->work);
  443. }
  444. }
  445. int btrfs_bio_wq_end_io(struct btrfs_fs_info *info, struct bio *bio,
  446. int metadata)
  447. {
  448. struct end_io_wq *end_io_wq;
  449. end_io_wq = kmalloc(sizeof(*end_io_wq), GFP_NOFS);
  450. if (!end_io_wq)
  451. return -ENOMEM;
  452. end_io_wq->private = bio->bi_private;
  453. end_io_wq->end_io = bio->bi_end_io;
  454. end_io_wq->info = info;
  455. end_io_wq->error = 0;
  456. end_io_wq->bio = bio;
  457. end_io_wq->metadata = metadata;
  458. bio->bi_private = end_io_wq;
  459. bio->bi_end_io = end_workqueue_bio;
  460. return 0;
  461. }
  462. unsigned long btrfs_async_submit_limit(struct btrfs_fs_info *info)
  463. {
  464. unsigned long limit = min_t(unsigned long,
  465. info->workers.max_workers,
  466. info->fs_devices->open_devices);
  467. return 256 * limit;
  468. }
  469. int btrfs_congested_async(struct btrfs_fs_info *info, int iodone)
  470. {
  471. return atomic_read(&info->nr_async_bios) >
  472. btrfs_async_submit_limit(info);
  473. }
  474. static void run_one_async_start(struct btrfs_work *work)
  475. {
  476. struct btrfs_fs_info *fs_info;
  477. struct async_submit_bio *async;
  478. async = container_of(work, struct async_submit_bio, work);
  479. fs_info = BTRFS_I(async->inode)->root->fs_info;
  480. async->submit_bio_start(async->inode, async->rw, async->bio,
  481. async->mirror_num, async->bio_flags);
  482. }
  483. static void run_one_async_done(struct btrfs_work *work)
  484. {
  485. struct btrfs_fs_info *fs_info;
  486. struct async_submit_bio *async;
  487. int limit;
  488. async = container_of(work, struct async_submit_bio, work);
  489. fs_info = BTRFS_I(async->inode)->root->fs_info;
  490. limit = btrfs_async_submit_limit(fs_info);
  491. limit = limit * 2 / 3;
  492. atomic_dec(&fs_info->nr_async_submits);
  493. if (atomic_read(&fs_info->nr_async_submits) < limit &&
  494. waitqueue_active(&fs_info->async_submit_wait))
  495. wake_up(&fs_info->async_submit_wait);
  496. async->submit_bio_done(async->inode, async->rw, async->bio,
  497. async->mirror_num, async->bio_flags);
  498. }
  499. static void run_one_async_free(struct btrfs_work *work)
  500. {
  501. struct async_submit_bio *async;
  502. async = container_of(work, struct async_submit_bio, work);
  503. kfree(async);
  504. }
  505. int btrfs_wq_submit_bio(struct btrfs_fs_info *fs_info, struct inode *inode,
  506. int rw, struct bio *bio, int mirror_num,
  507. unsigned long bio_flags,
  508. extent_submit_bio_hook_t *submit_bio_start,
  509. extent_submit_bio_hook_t *submit_bio_done)
  510. {
  511. struct async_submit_bio *async;
  512. async = kmalloc(sizeof(*async), GFP_NOFS);
  513. if (!async)
  514. return -ENOMEM;
  515. async->inode = inode;
  516. async->rw = rw;
  517. async->bio = bio;
  518. async->mirror_num = mirror_num;
  519. async->submit_bio_start = submit_bio_start;
  520. async->submit_bio_done = submit_bio_done;
  521. async->work.func = run_one_async_start;
  522. async->work.ordered_func = run_one_async_done;
  523. async->work.ordered_free = run_one_async_free;
  524. async->work.flags = 0;
  525. async->bio_flags = bio_flags;
  526. atomic_inc(&fs_info->nr_async_submits);
  527. if (rw & (1 << BIO_RW_SYNCIO))
  528. btrfs_set_work_high_prio(&async->work);
  529. btrfs_queue_worker(&fs_info->workers, &async->work);
  530. while (atomic_read(&fs_info->async_submit_draining) &&
  531. atomic_read(&fs_info->nr_async_submits)) {
  532. wait_event(fs_info->async_submit_wait,
  533. (atomic_read(&fs_info->nr_async_submits) == 0));
  534. }
  535. return 0;
  536. }
  537. static int btree_csum_one_bio(struct bio *bio)
  538. {
  539. struct bio_vec *bvec = bio->bi_io_vec;
  540. int bio_index = 0;
  541. struct btrfs_root *root;
  542. WARN_ON(bio->bi_vcnt <= 0);
  543. while (bio_index < bio->bi_vcnt) {
  544. root = BTRFS_I(bvec->bv_page->mapping->host)->root;
  545. csum_dirty_buffer(root, bvec->bv_page);
  546. bio_index++;
  547. bvec++;
  548. }
  549. return 0;
  550. }
  551. static int __btree_submit_bio_start(struct inode *inode, int rw,
  552. struct bio *bio, int mirror_num,
  553. unsigned long bio_flags)
  554. {
  555. /*
  556. * when we're called for a write, we're already in the async
  557. * submission context. Just jump into btrfs_map_bio
  558. */
  559. btree_csum_one_bio(bio);
  560. return 0;
  561. }
  562. static int __btree_submit_bio_done(struct inode *inode, int rw, struct bio *bio,
  563. int mirror_num, unsigned long bio_flags)
  564. {
  565. /*
  566. * when we're called for a write, we're already in the async
  567. * submission context. Just jump into btrfs_map_bio
  568. */
  569. return btrfs_map_bio(BTRFS_I(inode)->root, rw, bio, mirror_num, 1);
  570. }
  571. static int btree_submit_bio_hook(struct inode *inode, int rw, struct bio *bio,
  572. int mirror_num, unsigned long bio_flags)
  573. {
  574. int ret;
  575. ret = btrfs_bio_wq_end_io(BTRFS_I(inode)->root->fs_info,
  576. bio, 1);
  577. BUG_ON(ret);
  578. if (!(rw & (1 << BIO_RW))) {
  579. /*
  580. * called for a read, do the setup so that checksum validation
  581. * can happen in the async kernel threads
  582. */
  583. return btrfs_map_bio(BTRFS_I(inode)->root, rw, bio,
  584. mirror_num, 0);
  585. }
  586. /*
  587. * kthread helpers are used to submit writes so that checksumming
  588. * can happen in parallel across all CPUs
  589. */
  590. return btrfs_wq_submit_bio(BTRFS_I(inode)->root->fs_info,
  591. inode, rw, bio, mirror_num, 0,
  592. __btree_submit_bio_start,
  593. __btree_submit_bio_done);
  594. }
  595. static int btree_writepage(struct page *page, struct writeback_control *wbc)
  596. {
  597. struct extent_io_tree *tree;
  598. struct btrfs_root *root = BTRFS_I(page->mapping->host)->root;
  599. struct extent_buffer *eb;
  600. int was_dirty;
  601. tree = &BTRFS_I(page->mapping->host)->io_tree;
  602. if (!(current->flags & PF_MEMALLOC)) {
  603. return extent_write_full_page(tree, page,
  604. btree_get_extent, wbc);
  605. }
  606. redirty_page_for_writepage(wbc, page);
  607. eb = btrfs_find_tree_block(root, page_offset(page),
  608. PAGE_CACHE_SIZE);
  609. WARN_ON(!eb);
  610. was_dirty = test_and_set_bit(EXTENT_BUFFER_DIRTY, &eb->bflags);
  611. if (!was_dirty) {
  612. spin_lock(&root->fs_info->delalloc_lock);
  613. root->fs_info->dirty_metadata_bytes += PAGE_CACHE_SIZE;
  614. spin_unlock(&root->fs_info->delalloc_lock);
  615. }
  616. free_extent_buffer(eb);
  617. unlock_page(page);
  618. return 0;
  619. }
  620. static int btree_writepages(struct address_space *mapping,
  621. struct writeback_control *wbc)
  622. {
  623. struct extent_io_tree *tree;
  624. tree = &BTRFS_I(mapping->host)->io_tree;
  625. if (wbc->sync_mode == WB_SYNC_NONE) {
  626. struct btrfs_root *root = BTRFS_I(mapping->host)->root;
  627. u64 num_dirty;
  628. unsigned long thresh = 32 * 1024 * 1024;
  629. if (wbc->for_kupdate)
  630. return 0;
  631. /* this is a bit racy, but that's ok */
  632. num_dirty = root->fs_info->dirty_metadata_bytes;
  633. if (num_dirty < thresh)
  634. return 0;
  635. }
  636. return extent_writepages(tree, mapping, btree_get_extent, wbc);
  637. }
  638. static int btree_readpage(struct file *file, struct page *page)
  639. {
  640. struct extent_io_tree *tree;
  641. tree = &BTRFS_I(page->mapping->host)->io_tree;
  642. return extent_read_full_page(tree, page, btree_get_extent);
  643. }
  644. static int btree_releasepage(struct page *page, gfp_t gfp_flags)
  645. {
  646. struct extent_io_tree *tree;
  647. struct extent_map_tree *map;
  648. int ret;
  649. if (PageWriteback(page) || PageDirty(page))
  650. return 0;
  651. tree = &BTRFS_I(page->mapping->host)->io_tree;
  652. map = &BTRFS_I(page->mapping->host)->extent_tree;
  653. ret = try_release_extent_state(map, tree, page, gfp_flags);
  654. if (!ret)
  655. return 0;
  656. ret = try_release_extent_buffer(tree, page);
  657. if (ret == 1) {
  658. ClearPagePrivate(page);
  659. set_page_private(page, 0);
  660. page_cache_release(page);
  661. }
  662. return ret;
  663. }
  664. static void btree_invalidatepage(struct page *page, unsigned long offset)
  665. {
  666. struct extent_io_tree *tree;
  667. tree = &BTRFS_I(page->mapping->host)->io_tree;
  668. extent_invalidatepage(tree, page, offset);
  669. btree_releasepage(page, GFP_NOFS);
  670. if (PagePrivate(page)) {
  671. printk(KERN_WARNING "btrfs warning page private not zero "
  672. "on page %llu\n", (unsigned long long)page_offset(page));
  673. ClearPagePrivate(page);
  674. set_page_private(page, 0);
  675. page_cache_release(page);
  676. }
  677. }
  678. static struct address_space_operations btree_aops = {
  679. .readpage = btree_readpage,
  680. .writepage = btree_writepage,
  681. .writepages = btree_writepages,
  682. .releasepage = btree_releasepage,
  683. .invalidatepage = btree_invalidatepage,
  684. .sync_page = block_sync_page,
  685. };
  686. int readahead_tree_block(struct btrfs_root *root, u64 bytenr, u32 blocksize,
  687. u64 parent_transid)
  688. {
  689. struct extent_buffer *buf = NULL;
  690. struct inode *btree_inode = root->fs_info->btree_inode;
  691. int ret = 0;
  692. buf = btrfs_find_create_tree_block(root, bytenr, blocksize);
  693. if (!buf)
  694. return 0;
  695. read_extent_buffer_pages(&BTRFS_I(btree_inode)->io_tree,
  696. buf, 0, 0, btree_get_extent, 0);
  697. free_extent_buffer(buf);
  698. return ret;
  699. }
  700. struct extent_buffer *btrfs_find_tree_block(struct btrfs_root *root,
  701. u64 bytenr, u32 blocksize)
  702. {
  703. struct inode *btree_inode = root->fs_info->btree_inode;
  704. struct extent_buffer *eb;
  705. eb = find_extent_buffer(&BTRFS_I(btree_inode)->io_tree,
  706. bytenr, blocksize, GFP_NOFS);
  707. return eb;
  708. }
  709. struct extent_buffer *btrfs_find_create_tree_block(struct btrfs_root *root,
  710. u64 bytenr, u32 blocksize)
  711. {
  712. struct inode *btree_inode = root->fs_info->btree_inode;
  713. struct extent_buffer *eb;
  714. eb = alloc_extent_buffer(&BTRFS_I(btree_inode)->io_tree,
  715. bytenr, blocksize, NULL, GFP_NOFS);
  716. return eb;
  717. }
  718. int btrfs_write_tree_block(struct extent_buffer *buf)
  719. {
  720. return btrfs_fdatawrite_range(buf->first_page->mapping, buf->start,
  721. buf->start + buf->len - 1, WB_SYNC_ALL);
  722. }
  723. int btrfs_wait_tree_block_writeback(struct extent_buffer *buf)
  724. {
  725. return btrfs_wait_on_page_writeback_range(buf->first_page->mapping,
  726. buf->start, buf->start + buf->len - 1);
  727. }
  728. struct extent_buffer *read_tree_block(struct btrfs_root *root, u64 bytenr,
  729. u32 blocksize, u64 parent_transid)
  730. {
  731. struct extent_buffer *buf = NULL;
  732. struct inode *btree_inode = root->fs_info->btree_inode;
  733. struct extent_io_tree *io_tree;
  734. int ret;
  735. io_tree = &BTRFS_I(btree_inode)->io_tree;
  736. buf = btrfs_find_create_tree_block(root, bytenr, blocksize);
  737. if (!buf)
  738. return NULL;
  739. ret = btree_read_extent_buffer_pages(root, buf, 0, parent_transid);
  740. if (ret == 0)
  741. set_bit(EXTENT_BUFFER_UPTODATE, &buf->bflags);
  742. return buf;
  743. }
  744. int clean_tree_block(struct btrfs_trans_handle *trans, struct btrfs_root *root,
  745. struct extent_buffer *buf)
  746. {
  747. struct inode *btree_inode = root->fs_info->btree_inode;
  748. if (btrfs_header_generation(buf) ==
  749. root->fs_info->running_transaction->transid) {
  750. btrfs_assert_tree_locked(buf);
  751. if (test_and_clear_bit(EXTENT_BUFFER_DIRTY, &buf->bflags)) {
  752. spin_lock(&root->fs_info->delalloc_lock);
  753. if (root->fs_info->dirty_metadata_bytes >= buf->len)
  754. root->fs_info->dirty_metadata_bytes -= buf->len;
  755. else
  756. WARN_ON(1);
  757. spin_unlock(&root->fs_info->delalloc_lock);
  758. }
  759. /* ugh, clear_extent_buffer_dirty needs to lock the page */
  760. btrfs_set_lock_blocking(buf);
  761. clear_extent_buffer_dirty(&BTRFS_I(btree_inode)->io_tree,
  762. buf);
  763. }
  764. return 0;
  765. }
  766. static int __setup_root(u32 nodesize, u32 leafsize, u32 sectorsize,
  767. u32 stripesize, struct btrfs_root *root,
  768. struct btrfs_fs_info *fs_info,
  769. u64 objectid)
  770. {
  771. root->node = NULL;
  772. root->commit_root = NULL;
  773. root->sectorsize = sectorsize;
  774. root->nodesize = nodesize;
  775. root->leafsize = leafsize;
  776. root->stripesize = stripesize;
  777. root->ref_cows = 0;
  778. root->track_dirty = 0;
  779. root->fs_info = fs_info;
  780. root->objectid = objectid;
  781. root->last_trans = 0;
  782. root->highest_inode = 0;
  783. root->last_inode_alloc = 0;
  784. root->name = NULL;
  785. root->in_sysfs = 0;
  786. root->inode_tree.rb_node = NULL;
  787. INIT_LIST_HEAD(&root->dirty_list);
  788. INIT_LIST_HEAD(&root->orphan_list);
  789. INIT_LIST_HEAD(&root->root_list);
  790. spin_lock_init(&root->node_lock);
  791. spin_lock_init(&root->list_lock);
  792. spin_lock_init(&root->inode_lock);
  793. mutex_init(&root->objectid_mutex);
  794. mutex_init(&root->log_mutex);
  795. init_rwsem(&root->commit_root_sem);
  796. init_waitqueue_head(&root->log_writer_wait);
  797. init_waitqueue_head(&root->log_commit_wait[0]);
  798. init_waitqueue_head(&root->log_commit_wait[1]);
  799. atomic_set(&root->log_commit[0], 0);
  800. atomic_set(&root->log_commit[1], 0);
  801. atomic_set(&root->log_writers, 0);
  802. root->log_batch = 0;
  803. root->log_transid = 0;
  804. extent_io_tree_init(&root->dirty_log_pages,
  805. fs_info->btree_inode->i_mapping, GFP_NOFS);
  806. memset(&root->root_key, 0, sizeof(root->root_key));
  807. memset(&root->root_item, 0, sizeof(root->root_item));
  808. memset(&root->defrag_progress, 0, sizeof(root->defrag_progress));
  809. memset(&root->root_kobj, 0, sizeof(root->root_kobj));
  810. root->defrag_trans_start = fs_info->generation;
  811. init_completion(&root->kobj_unregister);
  812. root->defrag_running = 0;
  813. root->defrag_level = 0;
  814. root->root_key.objectid = objectid;
  815. root->anon_super.s_root = NULL;
  816. root->anon_super.s_dev = 0;
  817. INIT_LIST_HEAD(&root->anon_super.s_list);
  818. INIT_LIST_HEAD(&root->anon_super.s_instances);
  819. init_rwsem(&root->anon_super.s_umount);
  820. return 0;
  821. }
  822. static int find_and_setup_root(struct btrfs_root *tree_root,
  823. struct btrfs_fs_info *fs_info,
  824. u64 objectid,
  825. struct btrfs_root *root)
  826. {
  827. int ret;
  828. u32 blocksize;
  829. u64 generation;
  830. __setup_root(tree_root->nodesize, tree_root->leafsize,
  831. tree_root->sectorsize, tree_root->stripesize,
  832. root, fs_info, objectid);
  833. ret = btrfs_find_last_root(tree_root, objectid,
  834. &root->root_item, &root->root_key);
  835. BUG_ON(ret);
  836. generation = btrfs_root_generation(&root->root_item);
  837. blocksize = btrfs_level_size(root, btrfs_root_level(&root->root_item));
  838. root->node = read_tree_block(root, btrfs_root_bytenr(&root->root_item),
  839. blocksize, generation);
  840. root->commit_root = btrfs_root_node(root);
  841. BUG_ON(!root->node);
  842. return 0;
  843. }
  844. int btrfs_free_log_root_tree(struct btrfs_trans_handle *trans,
  845. struct btrfs_fs_info *fs_info)
  846. {
  847. struct extent_buffer *eb;
  848. struct btrfs_root *log_root_tree = fs_info->log_root_tree;
  849. u64 start = 0;
  850. u64 end = 0;
  851. int ret;
  852. if (!log_root_tree)
  853. return 0;
  854. while (1) {
  855. ret = find_first_extent_bit(&log_root_tree->dirty_log_pages,
  856. 0, &start, &end, EXTENT_DIRTY);
  857. if (ret)
  858. break;
  859. clear_extent_dirty(&log_root_tree->dirty_log_pages,
  860. start, end, GFP_NOFS);
  861. }
  862. eb = fs_info->log_root_tree->node;
  863. WARN_ON(btrfs_header_level(eb) != 0);
  864. WARN_ON(btrfs_header_nritems(eb) != 0);
  865. ret = btrfs_free_reserved_extent(fs_info->tree_root,
  866. eb->start, eb->len);
  867. BUG_ON(ret);
  868. free_extent_buffer(eb);
  869. kfree(fs_info->log_root_tree);
  870. fs_info->log_root_tree = NULL;
  871. return 0;
  872. }
  873. static struct btrfs_root *alloc_log_tree(struct btrfs_trans_handle *trans,
  874. struct btrfs_fs_info *fs_info)
  875. {
  876. struct btrfs_root *root;
  877. struct btrfs_root *tree_root = fs_info->tree_root;
  878. struct extent_buffer *leaf;
  879. root = kzalloc(sizeof(*root), GFP_NOFS);
  880. if (!root)
  881. return ERR_PTR(-ENOMEM);
  882. __setup_root(tree_root->nodesize, tree_root->leafsize,
  883. tree_root->sectorsize, tree_root->stripesize,
  884. root, fs_info, BTRFS_TREE_LOG_OBJECTID);
  885. root->root_key.objectid = BTRFS_TREE_LOG_OBJECTID;
  886. root->root_key.type = BTRFS_ROOT_ITEM_KEY;
  887. root->root_key.offset = BTRFS_TREE_LOG_OBJECTID;
  888. /*
  889. * log trees do not get reference counted because they go away
  890. * before a real commit is actually done. They do store pointers
  891. * to file data extents, and those reference counts still get
  892. * updated (along with back refs to the log tree).
  893. */
  894. root->ref_cows = 0;
  895. leaf = btrfs_alloc_free_block(trans, root, root->leafsize, 0,
  896. BTRFS_TREE_LOG_OBJECTID, NULL, 0, 0, 0);
  897. if (IS_ERR(leaf)) {
  898. kfree(root);
  899. return ERR_CAST(leaf);
  900. }
  901. memset_extent_buffer(leaf, 0, 0, sizeof(struct btrfs_header));
  902. btrfs_set_header_bytenr(leaf, leaf->start);
  903. btrfs_set_header_generation(leaf, trans->transid);
  904. btrfs_set_header_backref_rev(leaf, BTRFS_MIXED_BACKREF_REV);
  905. btrfs_set_header_owner(leaf, BTRFS_TREE_LOG_OBJECTID);
  906. root->node = leaf;
  907. write_extent_buffer(root->node, root->fs_info->fsid,
  908. (unsigned long)btrfs_header_fsid(root->node),
  909. BTRFS_FSID_SIZE);
  910. btrfs_mark_buffer_dirty(root->node);
  911. btrfs_tree_unlock(root->node);
  912. return root;
  913. }
  914. int btrfs_init_log_root_tree(struct btrfs_trans_handle *trans,
  915. struct btrfs_fs_info *fs_info)
  916. {
  917. struct btrfs_root *log_root;
  918. log_root = alloc_log_tree(trans, fs_info);
  919. if (IS_ERR(log_root))
  920. return PTR_ERR(log_root);
  921. WARN_ON(fs_info->log_root_tree);
  922. fs_info->log_root_tree = log_root;
  923. return 0;
  924. }
  925. int btrfs_add_log_tree(struct btrfs_trans_handle *trans,
  926. struct btrfs_root *root)
  927. {
  928. struct btrfs_root *log_root;
  929. struct btrfs_inode_item *inode_item;
  930. log_root = alloc_log_tree(trans, root->fs_info);
  931. if (IS_ERR(log_root))
  932. return PTR_ERR(log_root);
  933. log_root->last_trans = trans->transid;
  934. log_root->root_key.offset = root->root_key.objectid;
  935. inode_item = &log_root->root_item.inode;
  936. inode_item->generation = cpu_to_le64(1);
  937. inode_item->size = cpu_to_le64(3);
  938. inode_item->nlink = cpu_to_le32(1);
  939. inode_item->nbytes = cpu_to_le64(root->leafsize);
  940. inode_item->mode = cpu_to_le32(S_IFDIR | 0755);
  941. btrfs_set_root_node(&log_root->root_item, log_root->node);
  942. WARN_ON(root->log_root);
  943. root->log_root = log_root;
  944. root->log_transid = 0;
  945. return 0;
  946. }
  947. struct btrfs_root *btrfs_read_fs_root_no_radix(struct btrfs_root *tree_root,
  948. struct btrfs_key *location)
  949. {
  950. struct btrfs_root *root;
  951. struct btrfs_fs_info *fs_info = tree_root->fs_info;
  952. struct btrfs_path *path;
  953. struct extent_buffer *l;
  954. u64 highest_inode;
  955. u64 generation;
  956. u32 blocksize;
  957. int ret = 0;
  958. root = kzalloc(sizeof(*root), GFP_NOFS);
  959. if (!root)
  960. return ERR_PTR(-ENOMEM);
  961. if (location->offset == (u64)-1) {
  962. ret = find_and_setup_root(tree_root, fs_info,
  963. location->objectid, root);
  964. if (ret) {
  965. kfree(root);
  966. return ERR_PTR(ret);
  967. }
  968. goto insert;
  969. }
  970. __setup_root(tree_root->nodesize, tree_root->leafsize,
  971. tree_root->sectorsize, tree_root->stripesize,
  972. root, fs_info, location->objectid);
  973. path = btrfs_alloc_path();
  974. BUG_ON(!path);
  975. ret = btrfs_search_slot(NULL, tree_root, location, path, 0, 0);
  976. if (ret != 0) {
  977. if (ret > 0)
  978. ret = -ENOENT;
  979. goto out;
  980. }
  981. l = path->nodes[0];
  982. read_extent_buffer(l, &root->root_item,
  983. btrfs_item_ptr_offset(l, path->slots[0]),
  984. sizeof(root->root_item));
  985. memcpy(&root->root_key, location, sizeof(*location));
  986. ret = 0;
  987. out:
  988. btrfs_release_path(root, path);
  989. btrfs_free_path(path);
  990. if (ret) {
  991. kfree(root);
  992. return ERR_PTR(ret);
  993. }
  994. generation = btrfs_root_generation(&root->root_item);
  995. blocksize = btrfs_level_size(root, btrfs_root_level(&root->root_item));
  996. root->node = read_tree_block(root, btrfs_root_bytenr(&root->root_item),
  997. blocksize, generation);
  998. root->commit_root = btrfs_root_node(root);
  999. BUG_ON(!root->node);
  1000. insert:
  1001. if (location->objectid != BTRFS_TREE_LOG_OBJECTID) {
  1002. root->ref_cows = 1;
  1003. ret = btrfs_find_highest_inode(root, &highest_inode);
  1004. if (ret == 0) {
  1005. root->highest_inode = highest_inode;
  1006. root->last_inode_alloc = highest_inode;
  1007. }
  1008. }
  1009. return root;
  1010. }
  1011. struct btrfs_root *btrfs_lookup_fs_root(struct btrfs_fs_info *fs_info,
  1012. u64 root_objectid)
  1013. {
  1014. struct btrfs_root *root;
  1015. if (root_objectid == BTRFS_ROOT_TREE_OBJECTID)
  1016. return fs_info->tree_root;
  1017. if (root_objectid == BTRFS_EXTENT_TREE_OBJECTID)
  1018. return fs_info->extent_root;
  1019. root = radix_tree_lookup(&fs_info->fs_roots_radix,
  1020. (unsigned long)root_objectid);
  1021. return root;
  1022. }
  1023. struct btrfs_root *btrfs_read_fs_root_no_name(struct btrfs_fs_info *fs_info,
  1024. struct btrfs_key *location)
  1025. {
  1026. struct btrfs_root *root;
  1027. int ret;
  1028. if (location->objectid == BTRFS_ROOT_TREE_OBJECTID)
  1029. return fs_info->tree_root;
  1030. if (location->objectid == BTRFS_EXTENT_TREE_OBJECTID)
  1031. return fs_info->extent_root;
  1032. if (location->objectid == BTRFS_CHUNK_TREE_OBJECTID)
  1033. return fs_info->chunk_root;
  1034. if (location->objectid == BTRFS_DEV_TREE_OBJECTID)
  1035. return fs_info->dev_root;
  1036. if (location->objectid == BTRFS_CSUM_TREE_OBJECTID)
  1037. return fs_info->csum_root;
  1038. root = radix_tree_lookup(&fs_info->fs_roots_radix,
  1039. (unsigned long)location->objectid);
  1040. if (root)
  1041. return root;
  1042. root = btrfs_read_fs_root_no_radix(fs_info->tree_root, location);
  1043. if (IS_ERR(root))
  1044. return root;
  1045. set_anon_super(&root->anon_super, NULL);
  1046. ret = radix_tree_insert(&fs_info->fs_roots_radix,
  1047. (unsigned long)root->root_key.objectid,
  1048. root);
  1049. if (ret) {
  1050. free_extent_buffer(root->node);
  1051. kfree(root);
  1052. return ERR_PTR(ret);
  1053. }
  1054. if (!(fs_info->sb->s_flags & MS_RDONLY)) {
  1055. ret = btrfs_find_dead_roots(fs_info->tree_root,
  1056. root->root_key.objectid);
  1057. BUG_ON(ret);
  1058. btrfs_orphan_cleanup(root);
  1059. }
  1060. return root;
  1061. }
  1062. struct btrfs_root *btrfs_read_fs_root(struct btrfs_fs_info *fs_info,
  1063. struct btrfs_key *location,
  1064. const char *name, int namelen)
  1065. {
  1066. struct btrfs_root *root;
  1067. int ret;
  1068. root = btrfs_read_fs_root_no_name(fs_info, location);
  1069. if (!root)
  1070. return NULL;
  1071. if (root->in_sysfs)
  1072. return root;
  1073. ret = btrfs_set_root_name(root, name, namelen);
  1074. if (ret) {
  1075. free_extent_buffer(root->node);
  1076. kfree(root);
  1077. return ERR_PTR(ret);
  1078. }
  1079. #if 0
  1080. ret = btrfs_sysfs_add_root(root);
  1081. if (ret) {
  1082. free_extent_buffer(root->node);
  1083. kfree(root->name);
  1084. kfree(root);
  1085. return ERR_PTR(ret);
  1086. }
  1087. #endif
  1088. root->in_sysfs = 1;
  1089. return root;
  1090. }
  1091. static int btrfs_congested_fn(void *congested_data, int bdi_bits)
  1092. {
  1093. struct btrfs_fs_info *info = (struct btrfs_fs_info *)congested_data;
  1094. int ret = 0;
  1095. struct btrfs_device *device;
  1096. struct backing_dev_info *bdi;
  1097. list_for_each_entry(device, &info->fs_devices->devices, dev_list) {
  1098. if (!device->bdev)
  1099. continue;
  1100. bdi = blk_get_backing_dev_info(device->bdev);
  1101. if (bdi && bdi_congested(bdi, bdi_bits)) {
  1102. ret = 1;
  1103. break;
  1104. }
  1105. }
  1106. return ret;
  1107. }
  1108. /*
  1109. * this unplugs every device on the box, and it is only used when page
  1110. * is null
  1111. */
  1112. static void __unplug_io_fn(struct backing_dev_info *bdi, struct page *page)
  1113. {
  1114. struct btrfs_device *device;
  1115. struct btrfs_fs_info *info;
  1116. info = (struct btrfs_fs_info *)bdi->unplug_io_data;
  1117. list_for_each_entry(device, &info->fs_devices->devices, dev_list) {
  1118. if (!device->bdev)
  1119. continue;
  1120. bdi = blk_get_backing_dev_info(device->bdev);
  1121. if (bdi->unplug_io_fn)
  1122. bdi->unplug_io_fn(bdi, page);
  1123. }
  1124. }
  1125. static void btrfs_unplug_io_fn(struct backing_dev_info *bdi, struct page *page)
  1126. {
  1127. struct inode *inode;
  1128. struct extent_map_tree *em_tree;
  1129. struct extent_map *em;
  1130. struct address_space *mapping;
  1131. u64 offset;
  1132. /* the generic O_DIRECT read code does this */
  1133. if (1 || !page) {
  1134. __unplug_io_fn(bdi, page);
  1135. return;
  1136. }
  1137. /*
  1138. * page->mapping may change at any time. Get a consistent copy
  1139. * and use that for everything below
  1140. */
  1141. smp_mb();
  1142. mapping = page->mapping;
  1143. if (!mapping)
  1144. return;
  1145. inode = mapping->host;
  1146. /*
  1147. * don't do the expensive searching for a small number of
  1148. * devices
  1149. */
  1150. if (BTRFS_I(inode)->root->fs_info->fs_devices->open_devices <= 2) {
  1151. __unplug_io_fn(bdi, page);
  1152. return;
  1153. }
  1154. offset = page_offset(page);
  1155. em_tree = &BTRFS_I(inode)->extent_tree;
  1156. spin_lock(&em_tree->lock);
  1157. em = lookup_extent_mapping(em_tree, offset, PAGE_CACHE_SIZE);
  1158. spin_unlock(&em_tree->lock);
  1159. if (!em) {
  1160. __unplug_io_fn(bdi, page);
  1161. return;
  1162. }
  1163. if (em->block_start >= EXTENT_MAP_LAST_BYTE) {
  1164. free_extent_map(em);
  1165. __unplug_io_fn(bdi, page);
  1166. return;
  1167. }
  1168. offset = offset - em->start;
  1169. btrfs_unplug_page(&BTRFS_I(inode)->root->fs_info->mapping_tree,
  1170. em->block_start + offset, page);
  1171. free_extent_map(em);
  1172. }
  1173. static int setup_bdi(struct btrfs_fs_info *info, struct backing_dev_info *bdi)
  1174. {
  1175. bdi_init(bdi);
  1176. bdi->ra_pages = default_backing_dev_info.ra_pages;
  1177. bdi->state = 0;
  1178. bdi->capabilities = default_backing_dev_info.capabilities;
  1179. bdi->unplug_io_fn = btrfs_unplug_io_fn;
  1180. bdi->unplug_io_data = info;
  1181. bdi->congested_fn = btrfs_congested_fn;
  1182. bdi->congested_data = info;
  1183. return 0;
  1184. }
  1185. static int bio_ready_for_csum(struct bio *bio)
  1186. {
  1187. u64 length = 0;
  1188. u64 buf_len = 0;
  1189. u64 start = 0;
  1190. struct page *page;
  1191. struct extent_io_tree *io_tree = NULL;
  1192. struct btrfs_fs_info *info = NULL;
  1193. struct bio_vec *bvec;
  1194. int i;
  1195. int ret;
  1196. bio_for_each_segment(bvec, bio, i) {
  1197. page = bvec->bv_page;
  1198. if (page->private == EXTENT_PAGE_PRIVATE) {
  1199. length += bvec->bv_len;
  1200. continue;
  1201. }
  1202. if (!page->private) {
  1203. length += bvec->bv_len;
  1204. continue;
  1205. }
  1206. length = bvec->bv_len;
  1207. buf_len = page->private >> 2;
  1208. start = page_offset(page) + bvec->bv_offset;
  1209. io_tree = &BTRFS_I(page->mapping->host)->io_tree;
  1210. info = BTRFS_I(page->mapping->host)->root->fs_info;
  1211. }
  1212. /* are we fully contained in this bio? */
  1213. if (buf_len <= length)
  1214. return 1;
  1215. ret = extent_range_uptodate(io_tree, start + length,
  1216. start + buf_len - 1);
  1217. return ret;
  1218. }
  1219. /*
  1220. * called by the kthread helper functions to finally call the bio end_io
  1221. * functions. This is where read checksum verification actually happens
  1222. */
  1223. static void end_workqueue_fn(struct btrfs_work *work)
  1224. {
  1225. struct bio *bio;
  1226. struct end_io_wq *end_io_wq;
  1227. struct btrfs_fs_info *fs_info;
  1228. int error;
  1229. end_io_wq = container_of(work, struct end_io_wq, work);
  1230. bio = end_io_wq->bio;
  1231. fs_info = end_io_wq->info;
  1232. /* metadata bio reads are special because the whole tree block must
  1233. * be checksummed at once. This makes sure the entire block is in
  1234. * ram and up to date before trying to verify things. For
  1235. * blocksize <= pagesize, it is basically a noop
  1236. */
  1237. if (!(bio->bi_rw & (1 << BIO_RW)) && end_io_wq->metadata &&
  1238. !bio_ready_for_csum(bio)) {
  1239. btrfs_queue_worker(&fs_info->endio_meta_workers,
  1240. &end_io_wq->work);
  1241. return;
  1242. }
  1243. error = end_io_wq->error;
  1244. bio->bi_private = end_io_wq->private;
  1245. bio->bi_end_io = end_io_wq->end_io;
  1246. kfree(end_io_wq);
  1247. bio_endio(bio, error);
  1248. }
  1249. static int cleaner_kthread(void *arg)
  1250. {
  1251. struct btrfs_root *root = arg;
  1252. do {
  1253. smp_mb();
  1254. if (root->fs_info->closing)
  1255. break;
  1256. vfs_check_frozen(root->fs_info->sb, SB_FREEZE_WRITE);
  1257. mutex_lock(&root->fs_info->cleaner_mutex);
  1258. btrfs_clean_old_snapshots(root);
  1259. mutex_unlock(&root->fs_info->cleaner_mutex);
  1260. if (freezing(current)) {
  1261. refrigerator();
  1262. } else {
  1263. smp_mb();
  1264. if (root->fs_info->closing)
  1265. break;
  1266. set_current_state(TASK_INTERRUPTIBLE);
  1267. schedule();
  1268. __set_current_state(TASK_RUNNING);
  1269. }
  1270. } while (!kthread_should_stop());
  1271. return 0;
  1272. }
  1273. static int transaction_kthread(void *arg)
  1274. {
  1275. struct btrfs_root *root = arg;
  1276. struct btrfs_trans_handle *trans;
  1277. struct btrfs_transaction *cur;
  1278. unsigned long now;
  1279. unsigned long delay;
  1280. int ret;
  1281. do {
  1282. smp_mb();
  1283. if (root->fs_info->closing)
  1284. break;
  1285. delay = HZ * 30;
  1286. vfs_check_frozen(root->fs_info->sb, SB_FREEZE_WRITE);
  1287. mutex_lock(&root->fs_info->transaction_kthread_mutex);
  1288. mutex_lock(&root->fs_info->trans_mutex);
  1289. cur = root->fs_info->running_transaction;
  1290. if (!cur) {
  1291. mutex_unlock(&root->fs_info->trans_mutex);
  1292. goto sleep;
  1293. }
  1294. now = get_seconds();
  1295. if (now < cur->start_time || now - cur->start_time < 30) {
  1296. mutex_unlock(&root->fs_info->trans_mutex);
  1297. delay = HZ * 5;
  1298. goto sleep;
  1299. }
  1300. mutex_unlock(&root->fs_info->trans_mutex);
  1301. trans = btrfs_start_transaction(root, 1);
  1302. ret = btrfs_commit_transaction(trans, root);
  1303. sleep:
  1304. wake_up_process(root->fs_info->cleaner_kthread);
  1305. mutex_unlock(&root->fs_info->transaction_kthread_mutex);
  1306. if (freezing(current)) {
  1307. refrigerator();
  1308. } else {
  1309. if (root->fs_info->closing)
  1310. break;
  1311. set_current_state(TASK_INTERRUPTIBLE);
  1312. schedule_timeout(delay);
  1313. __set_current_state(TASK_RUNNING);
  1314. }
  1315. } while (!kthread_should_stop());
  1316. return 0;
  1317. }
  1318. struct btrfs_root *open_ctree(struct super_block *sb,
  1319. struct btrfs_fs_devices *fs_devices,
  1320. char *options)
  1321. {
  1322. u32 sectorsize;
  1323. u32 nodesize;
  1324. u32 leafsize;
  1325. u32 blocksize;
  1326. u32 stripesize;
  1327. u64 generation;
  1328. u64 features;
  1329. struct btrfs_key location;
  1330. struct buffer_head *bh;
  1331. struct btrfs_root *extent_root = kzalloc(sizeof(struct btrfs_root),
  1332. GFP_NOFS);
  1333. struct btrfs_root *csum_root = kzalloc(sizeof(struct btrfs_root),
  1334. GFP_NOFS);
  1335. struct btrfs_root *tree_root = kzalloc(sizeof(struct btrfs_root),
  1336. GFP_NOFS);
  1337. struct btrfs_fs_info *fs_info = kzalloc(sizeof(*fs_info),
  1338. GFP_NOFS);
  1339. struct btrfs_root *chunk_root = kzalloc(sizeof(struct btrfs_root),
  1340. GFP_NOFS);
  1341. struct btrfs_root *dev_root = kzalloc(sizeof(struct btrfs_root),
  1342. GFP_NOFS);
  1343. struct btrfs_root *log_tree_root;
  1344. int ret;
  1345. int err = -EINVAL;
  1346. struct btrfs_super_block *disk_super;
  1347. if (!extent_root || !tree_root || !fs_info ||
  1348. !chunk_root || !dev_root || !csum_root) {
  1349. err = -ENOMEM;
  1350. goto fail;
  1351. }
  1352. INIT_RADIX_TREE(&fs_info->fs_roots_radix, GFP_NOFS);
  1353. INIT_LIST_HEAD(&fs_info->trans_list);
  1354. INIT_LIST_HEAD(&fs_info->dead_roots);
  1355. INIT_LIST_HEAD(&fs_info->hashers);
  1356. INIT_LIST_HEAD(&fs_info->delalloc_inodes);
  1357. INIT_LIST_HEAD(&fs_info->ordered_operations);
  1358. spin_lock_init(&fs_info->delalloc_lock);
  1359. spin_lock_init(&fs_info->new_trans_lock);
  1360. spin_lock_init(&fs_info->ref_cache_lock);
  1361. init_completion(&fs_info->kobj_unregister);
  1362. fs_info->tree_root = tree_root;
  1363. fs_info->extent_root = extent_root;
  1364. fs_info->csum_root = csum_root;
  1365. fs_info->chunk_root = chunk_root;
  1366. fs_info->dev_root = dev_root;
  1367. fs_info->fs_devices = fs_devices;
  1368. INIT_LIST_HEAD(&fs_info->dirty_cowonly_roots);
  1369. INIT_LIST_HEAD(&fs_info->space_info);
  1370. btrfs_mapping_init(&fs_info->mapping_tree);
  1371. atomic_set(&fs_info->nr_async_submits, 0);
  1372. atomic_set(&fs_info->async_delalloc_pages, 0);
  1373. atomic_set(&fs_info->async_submit_draining, 0);
  1374. atomic_set(&fs_info->nr_async_bios, 0);
  1375. atomic_set(&fs_info->async_caching_threads, 0);
  1376. fs_info->sb = sb;
  1377. fs_info->max_extent = (u64)-1;
  1378. fs_info->max_inline = 8192 * 1024;
  1379. setup_bdi(fs_info, &fs_info->bdi);
  1380. fs_info->btree_inode = new_inode(sb);
  1381. fs_info->btree_inode->i_ino = 1;
  1382. fs_info->btree_inode->i_nlink = 1;
  1383. fs_info->metadata_ratio = 8;
  1384. fs_info->thread_pool_size = min_t(unsigned long,
  1385. num_online_cpus() + 2, 8);
  1386. INIT_LIST_HEAD(&fs_info->ordered_extents);
  1387. spin_lock_init(&fs_info->ordered_extent_lock);
  1388. sb->s_blocksize = 4096;
  1389. sb->s_blocksize_bits = blksize_bits(4096);
  1390. /*
  1391. * we set the i_size on the btree inode to the max possible int.
  1392. * the real end of the address space is determined by all of
  1393. * the devices in the system
  1394. */
  1395. fs_info->btree_inode->i_size = OFFSET_MAX;
  1396. fs_info->btree_inode->i_mapping->a_ops = &btree_aops;
  1397. fs_info->btree_inode->i_mapping->backing_dev_info = &fs_info->bdi;
  1398. RB_CLEAR_NODE(&BTRFS_I(fs_info->btree_inode)->rb_node);
  1399. extent_io_tree_init(&BTRFS_I(fs_info->btree_inode)->io_tree,
  1400. fs_info->btree_inode->i_mapping,
  1401. GFP_NOFS);
  1402. extent_map_tree_init(&BTRFS_I(fs_info->btree_inode)->extent_tree,
  1403. GFP_NOFS);
  1404. BTRFS_I(fs_info->btree_inode)->io_tree.ops = &btree_extent_io_ops;
  1405. spin_lock_init(&fs_info->block_group_cache_lock);
  1406. fs_info->block_group_cache_tree.rb_node = NULL;
  1407. extent_io_tree_init(&fs_info->pinned_extents,
  1408. fs_info->btree_inode->i_mapping, GFP_NOFS);
  1409. fs_info->do_barriers = 1;
  1410. BTRFS_I(fs_info->btree_inode)->root = tree_root;
  1411. memset(&BTRFS_I(fs_info->btree_inode)->location, 0,
  1412. sizeof(struct btrfs_key));
  1413. insert_inode_hash(fs_info->btree_inode);
  1414. mutex_init(&fs_info->trans_mutex);
  1415. mutex_init(&fs_info->ordered_operations_mutex);
  1416. mutex_init(&fs_info->tree_log_mutex);
  1417. mutex_init(&fs_info->drop_mutex);
  1418. mutex_init(&fs_info->chunk_mutex);
  1419. mutex_init(&fs_info->transaction_kthread_mutex);
  1420. mutex_init(&fs_info->cleaner_mutex);
  1421. mutex_init(&fs_info->volume_mutex);
  1422. mutex_init(&fs_info->tree_reloc_mutex);
  1423. btrfs_init_free_cluster(&fs_info->meta_alloc_cluster);
  1424. btrfs_init_free_cluster(&fs_info->data_alloc_cluster);
  1425. init_waitqueue_head(&fs_info->transaction_throttle);
  1426. init_waitqueue_head(&fs_info->transaction_wait);
  1427. init_waitqueue_head(&fs_info->async_submit_wait);
  1428. __setup_root(4096, 4096, 4096, 4096, tree_root,
  1429. fs_info, BTRFS_ROOT_TREE_OBJECTID);
  1430. bh = btrfs_read_dev_super(fs_devices->latest_bdev);
  1431. if (!bh)
  1432. goto fail_iput;
  1433. memcpy(&fs_info->super_copy, bh->b_data, sizeof(fs_info->super_copy));
  1434. memcpy(&fs_info->super_for_commit, &fs_info->super_copy,
  1435. sizeof(fs_info->super_for_commit));
  1436. brelse(bh);
  1437. memcpy(fs_info->fsid, fs_info->super_copy.fsid, BTRFS_FSID_SIZE);
  1438. disk_super = &fs_info->super_copy;
  1439. if (!btrfs_super_root(disk_super))
  1440. goto fail_iput;
  1441. ret = btrfs_parse_options(tree_root, options);
  1442. if (ret) {
  1443. err = ret;
  1444. goto fail_iput;
  1445. }
  1446. features = btrfs_super_incompat_flags(disk_super) &
  1447. ~BTRFS_FEATURE_INCOMPAT_SUPP;
  1448. if (features) {
  1449. printk(KERN_ERR "BTRFS: couldn't mount because of "
  1450. "unsupported optional features (%Lx).\n",
  1451. (unsigned long long)features);
  1452. err = -EINVAL;
  1453. goto fail_iput;
  1454. }
  1455. features = btrfs_super_incompat_flags(disk_super);
  1456. if (!(features & BTRFS_FEATURE_INCOMPAT_MIXED_BACKREF)) {
  1457. features |= BTRFS_FEATURE_INCOMPAT_MIXED_BACKREF;
  1458. btrfs_set_super_incompat_flags(disk_super, features);
  1459. }
  1460. features = btrfs_super_compat_ro_flags(disk_super) &
  1461. ~BTRFS_FEATURE_COMPAT_RO_SUPP;
  1462. if (!(sb->s_flags & MS_RDONLY) && features) {
  1463. printk(KERN_ERR "BTRFS: couldn't mount RDWR because of "
  1464. "unsupported option features (%Lx).\n",
  1465. (unsigned long long)features);
  1466. err = -EINVAL;
  1467. goto fail_iput;
  1468. }
  1469. /*
  1470. * we need to start all the end_io workers up front because the
  1471. * queue work function gets called at interrupt time, and so it
  1472. * cannot dynamically grow.
  1473. */
  1474. btrfs_init_workers(&fs_info->workers, "worker",
  1475. fs_info->thread_pool_size);
  1476. btrfs_init_workers(&fs_info->delalloc_workers, "delalloc",
  1477. fs_info->thread_pool_size);
  1478. btrfs_init_workers(&fs_info->submit_workers, "submit",
  1479. min_t(u64, fs_devices->num_devices,
  1480. fs_info->thread_pool_size));
  1481. /* a higher idle thresh on the submit workers makes it much more
  1482. * likely that bios will be send down in a sane order to the
  1483. * devices
  1484. */
  1485. fs_info->submit_workers.idle_thresh = 64;
  1486. fs_info->workers.idle_thresh = 16;
  1487. fs_info->workers.ordered = 1;
  1488. fs_info->delalloc_workers.idle_thresh = 2;
  1489. fs_info->delalloc_workers.ordered = 1;
  1490. btrfs_init_workers(&fs_info->fixup_workers, "fixup", 1);
  1491. btrfs_init_workers(&fs_info->endio_workers, "endio",
  1492. fs_info->thread_pool_size);
  1493. btrfs_init_workers(&fs_info->endio_meta_workers, "endio-meta",
  1494. fs_info->thread_pool_size);
  1495. btrfs_init_workers(&fs_info->endio_meta_write_workers,
  1496. "endio-meta-write", fs_info->thread_pool_size);
  1497. btrfs_init_workers(&fs_info->endio_write_workers, "endio-write",
  1498. fs_info->thread_pool_size);
  1499. /*
  1500. * endios are largely parallel and should have a very
  1501. * low idle thresh
  1502. */
  1503. fs_info->endio_workers.idle_thresh = 4;
  1504. fs_info->endio_meta_workers.idle_thresh = 4;
  1505. fs_info->endio_write_workers.idle_thresh = 64;
  1506. fs_info->endio_meta_write_workers.idle_thresh = 64;
  1507. btrfs_start_workers(&fs_info->workers, 1);
  1508. btrfs_start_workers(&fs_info->submit_workers, 1);
  1509. btrfs_start_workers(&fs_info->delalloc_workers, 1);
  1510. btrfs_start_workers(&fs_info->fixup_workers, 1);
  1511. btrfs_start_workers(&fs_info->endio_workers, fs_info->thread_pool_size);
  1512. btrfs_start_workers(&fs_info->endio_meta_workers,
  1513. fs_info->thread_pool_size);
  1514. btrfs_start_workers(&fs_info->endio_meta_write_workers,
  1515. fs_info->thread_pool_size);
  1516. btrfs_start_workers(&fs_info->endio_write_workers,
  1517. fs_info->thread_pool_size);
  1518. fs_info->bdi.ra_pages *= btrfs_super_num_devices(disk_super);
  1519. fs_info->bdi.ra_pages = max(fs_info->bdi.ra_pages,
  1520. 4 * 1024 * 1024 / PAGE_CACHE_SIZE);
  1521. nodesize = btrfs_super_nodesize(disk_super);
  1522. leafsize = btrfs_super_leafsize(disk_super);
  1523. sectorsize = btrfs_super_sectorsize(disk_super);
  1524. stripesize = btrfs_super_stripesize(disk_super);
  1525. tree_root->nodesize = nodesize;
  1526. tree_root->leafsize = leafsize;
  1527. tree_root->sectorsize = sectorsize;
  1528. tree_root->stripesize = stripesize;
  1529. sb->s_blocksize = sectorsize;
  1530. sb->s_blocksize_bits = blksize_bits(sectorsize);
  1531. if (strncmp((char *)(&disk_super->magic), BTRFS_MAGIC,
  1532. sizeof(disk_super->magic))) {
  1533. printk(KERN_INFO "btrfs: valid FS not found on %s\n", sb->s_id);
  1534. goto fail_sb_buffer;
  1535. }
  1536. mutex_lock(&fs_info->chunk_mutex);
  1537. ret = btrfs_read_sys_array(tree_root);
  1538. mutex_unlock(&fs_info->chunk_mutex);
  1539. if (ret) {
  1540. printk(KERN_WARNING "btrfs: failed to read the system "
  1541. "array on %s\n", sb->s_id);
  1542. goto fail_sb_buffer;
  1543. }
  1544. blocksize = btrfs_level_size(tree_root,
  1545. btrfs_super_chunk_root_level(disk_super));
  1546. generation = btrfs_super_chunk_root_generation(disk_super);
  1547. __setup_root(nodesize, leafsize, sectorsize, stripesize,
  1548. chunk_root, fs_info, BTRFS_CHUNK_TREE_OBJECTID);
  1549. chunk_root->node = read_tree_block(chunk_root,
  1550. btrfs_super_chunk_root(disk_super),
  1551. blocksize, generation);
  1552. BUG_ON(!chunk_root->node);
  1553. if (!test_bit(EXTENT_BUFFER_UPTODATE, &chunk_root->node->bflags)) {
  1554. printk(KERN_WARNING "btrfs: failed to read chunk root on %s\n",
  1555. sb->s_id);
  1556. goto fail_chunk_root;
  1557. }
  1558. btrfs_set_root_node(&chunk_root->root_item, chunk_root->node);
  1559. chunk_root->commit_root = btrfs_root_node(chunk_root);
  1560. read_extent_buffer(chunk_root->node, fs_info->chunk_tree_uuid,
  1561. (unsigned long)btrfs_header_chunk_tree_uuid(chunk_root->node),
  1562. BTRFS_UUID_SIZE);
  1563. mutex_lock(&fs_info->chunk_mutex);
  1564. ret = btrfs_read_chunk_tree(chunk_root);
  1565. mutex_unlock(&fs_info->chunk_mutex);
  1566. if (ret) {
  1567. printk(KERN_WARNING "btrfs: failed to read chunk tree on %s\n",
  1568. sb->s_id);
  1569. goto fail_chunk_root;
  1570. }
  1571. btrfs_close_extra_devices(fs_devices);
  1572. blocksize = btrfs_level_size(tree_root,
  1573. btrfs_super_root_level(disk_super));
  1574. generation = btrfs_super_generation(disk_super);
  1575. tree_root->node = read_tree_block(tree_root,
  1576. btrfs_super_root(disk_super),
  1577. blocksize, generation);
  1578. if (!tree_root->node)
  1579. goto fail_chunk_root;
  1580. if (!test_bit(EXTENT_BUFFER_UPTODATE, &tree_root->node->bflags)) {
  1581. printk(KERN_WARNING "btrfs: failed to read tree root on %s\n",
  1582. sb->s_id);
  1583. goto fail_tree_root;
  1584. }
  1585. btrfs_set_root_node(&tree_root->root_item, tree_root->node);
  1586. tree_root->commit_root = btrfs_root_node(tree_root);
  1587. ret = find_and_setup_root(tree_root, fs_info,
  1588. BTRFS_EXTENT_TREE_OBJECTID, extent_root);
  1589. if (ret)
  1590. goto fail_tree_root;
  1591. extent_root->track_dirty = 1;
  1592. ret = find_and_setup_root(tree_root, fs_info,
  1593. BTRFS_DEV_TREE_OBJECTID, dev_root);
  1594. if (ret)
  1595. goto fail_extent_root;
  1596. dev_root->track_dirty = 1;
  1597. ret = find_and_setup_root(tree_root, fs_info,
  1598. BTRFS_CSUM_TREE_OBJECTID, csum_root);
  1599. if (ret)
  1600. goto fail_dev_root;
  1601. csum_root->track_dirty = 1;
  1602. btrfs_read_block_groups(extent_root);
  1603. fs_info->generation = generation;
  1604. fs_info->last_trans_committed = generation;
  1605. fs_info->data_alloc_profile = (u64)-1;
  1606. fs_info->metadata_alloc_profile = (u64)-1;
  1607. fs_info->system_alloc_profile = fs_info->metadata_alloc_profile;
  1608. fs_info->cleaner_kthread = kthread_run(cleaner_kthread, tree_root,
  1609. "btrfs-cleaner");
  1610. if (IS_ERR(fs_info->cleaner_kthread))
  1611. goto fail_csum_root;
  1612. fs_info->transaction_kthread = kthread_run(transaction_kthread,
  1613. tree_root,
  1614. "btrfs-transaction");
  1615. if (IS_ERR(fs_info->transaction_kthread))
  1616. goto fail_cleaner;
  1617. if (!btrfs_test_opt(tree_root, SSD) &&
  1618. !btrfs_test_opt(tree_root, NOSSD) &&
  1619. !fs_info->fs_devices->rotating) {
  1620. printk(KERN_INFO "Btrfs detected SSD devices, enabling SSD "
  1621. "mode\n");
  1622. btrfs_set_opt(fs_info->mount_opt, SSD);
  1623. }
  1624. if (btrfs_super_log_root(disk_super) != 0) {
  1625. u64 bytenr = btrfs_super_log_root(disk_super);
  1626. if (fs_devices->rw_devices == 0) {
  1627. printk(KERN_WARNING "Btrfs log replay required "
  1628. "on RO media\n");
  1629. err = -EIO;
  1630. goto fail_trans_kthread;
  1631. }
  1632. blocksize =
  1633. btrfs_level_size(tree_root,
  1634. btrfs_super_log_root_level(disk_super));
  1635. log_tree_root = kzalloc(sizeof(struct btrfs_root),
  1636. GFP_NOFS);
  1637. __setup_root(nodesize, leafsize, sectorsize, stripesize,
  1638. log_tree_root, fs_info, BTRFS_TREE_LOG_OBJECTID);
  1639. log_tree_root->node = read_tree_block(tree_root, bytenr,
  1640. blocksize,
  1641. generation + 1);
  1642. ret = btrfs_recover_log_trees(log_tree_root);
  1643. BUG_ON(ret);
  1644. if (sb->s_flags & MS_RDONLY) {
  1645. ret = btrfs_commit_super(tree_root);
  1646. BUG_ON(ret);
  1647. }
  1648. }
  1649. if (!(sb->s_flags & MS_RDONLY)) {
  1650. ret = btrfs_recover_relocation(tree_root);
  1651. BUG_ON(ret);
  1652. }
  1653. location.objectid = BTRFS_FS_TREE_OBJECTID;
  1654. location.type = BTRFS_ROOT_ITEM_KEY;
  1655. location.offset = (u64)-1;
  1656. fs_info->fs_root = btrfs_read_fs_root_no_name(fs_info, &location);
  1657. if (!fs_info->fs_root)
  1658. goto fail_trans_kthread;
  1659. return tree_root;
  1660. fail_trans_kthread:
  1661. kthread_stop(fs_info->transaction_kthread);
  1662. fail_cleaner:
  1663. kthread_stop(fs_info->cleaner_kthread);
  1664. /*
  1665. * make sure we're done with the btree inode before we stop our
  1666. * kthreads
  1667. */
  1668. filemap_write_and_wait(fs_info->btree_inode->i_mapping);
  1669. invalidate_inode_pages2(fs_info->btree_inode->i_mapping);
  1670. fail_csum_root:
  1671. free_extent_buffer(csum_root->node);
  1672. free_extent_buffer(csum_root->commit_root);
  1673. fail_dev_root:
  1674. free_extent_buffer(dev_root->node);
  1675. free_extent_buffer(dev_root->commit_root);
  1676. fail_extent_root:
  1677. free_extent_buffer(extent_root->node);
  1678. free_extent_buffer(extent_root->commit_root);
  1679. fail_tree_root:
  1680. free_extent_buffer(tree_root->node);
  1681. free_extent_buffer(tree_root->commit_root);
  1682. fail_chunk_root:
  1683. free_extent_buffer(chunk_root->node);
  1684. free_extent_buffer(chunk_root->commit_root);
  1685. fail_sb_buffer:
  1686. btrfs_stop_workers(&fs_info->fixup_workers);
  1687. btrfs_stop_workers(&fs_info->delalloc_workers);
  1688. btrfs_stop_workers(&fs_info->workers);
  1689. btrfs_stop_workers(&fs_info->endio_workers);
  1690. btrfs_stop_workers(&fs_info->endio_meta_workers);
  1691. btrfs_stop_workers(&fs_info->endio_meta_write_workers);
  1692. btrfs_stop_workers(&fs_info->endio_write_workers);
  1693. btrfs_stop_workers(&fs_info->submit_workers);
  1694. fail_iput:
  1695. invalidate_inode_pages2(fs_info->btree_inode->i_mapping);
  1696. iput(fs_info->btree_inode);
  1697. btrfs_close_devices(fs_info->fs_devices);
  1698. btrfs_mapping_tree_free(&fs_info->mapping_tree);
  1699. bdi_destroy(&fs_info->bdi);
  1700. fail:
  1701. kfree(extent_root);
  1702. kfree(tree_root);
  1703. kfree(fs_info);
  1704. kfree(chunk_root);
  1705. kfree(dev_root);
  1706. kfree(csum_root);
  1707. return ERR_PTR(err);
  1708. }
  1709. static void btrfs_end_buffer_write_sync(struct buffer_head *bh, int uptodate)
  1710. {
  1711. char b[BDEVNAME_SIZE];
  1712. if (uptodate) {
  1713. set_buffer_uptodate(bh);
  1714. } else {
  1715. if (!buffer_eopnotsupp(bh) && printk_ratelimit()) {
  1716. printk(KERN_WARNING "lost page write due to "
  1717. "I/O error on %s\n",
  1718. bdevname(bh->b_bdev, b));
  1719. }
  1720. /* note, we dont' set_buffer_write_io_error because we have
  1721. * our own ways of dealing with the IO errors
  1722. */
  1723. clear_buffer_uptodate(bh);
  1724. }
  1725. unlock_buffer(bh);
  1726. put_bh(bh);
  1727. }
  1728. struct buffer_head *btrfs_read_dev_super(struct block_device *bdev)
  1729. {
  1730. struct buffer_head *bh;
  1731. struct buffer_head *latest = NULL;
  1732. struct btrfs_super_block *super;
  1733. int i;
  1734. u64 transid = 0;
  1735. u64 bytenr;
  1736. /* we would like to check all the supers, but that would make
  1737. * a btrfs mount succeed after a mkfs from a different FS.
  1738. * So, we need to add a special mount option to scan for
  1739. * later supers, using BTRFS_SUPER_MIRROR_MAX instead
  1740. */
  1741. for (i = 0; i < 1; i++) {
  1742. bytenr = btrfs_sb_offset(i);
  1743. if (bytenr + 4096 >= i_size_read(bdev->bd_inode))
  1744. break;
  1745. bh = __bread(bdev, bytenr / 4096, 4096);
  1746. if (!bh)
  1747. continue;
  1748. super = (struct btrfs_super_block *)bh->b_data;
  1749. if (btrfs_super_bytenr(super) != bytenr ||
  1750. strncmp((char *)(&super->magic), BTRFS_MAGIC,
  1751. sizeof(super->magic))) {
  1752. brelse(bh);
  1753. continue;
  1754. }
  1755. if (!latest || btrfs_super_generation(super) > transid) {
  1756. brelse(latest);
  1757. latest = bh;
  1758. transid = btrfs_super_generation(super);
  1759. } else {
  1760. brelse(bh);
  1761. }
  1762. }
  1763. return latest;
  1764. }
  1765. /*
  1766. * this should be called twice, once with wait == 0 and
  1767. * once with wait == 1. When wait == 0 is done, all the buffer heads
  1768. * we write are pinned.
  1769. *
  1770. * They are released when wait == 1 is done.
  1771. * max_mirrors must be the same for both runs, and it indicates how
  1772. * many supers on this one device should be written.
  1773. *
  1774. * max_mirrors == 0 means to write them all.
  1775. */
  1776. static int write_dev_supers(struct btrfs_device *device,
  1777. struct btrfs_super_block *sb,
  1778. int do_barriers, int wait, int max_mirrors)
  1779. {
  1780. struct buffer_head *bh;
  1781. int i;
  1782. int ret;
  1783. int errors = 0;
  1784. u32 crc;
  1785. u64 bytenr;
  1786. int last_barrier = 0;
  1787. if (max_mirrors == 0)
  1788. max_mirrors = BTRFS_SUPER_MIRROR_MAX;
  1789. /* make sure only the last submit_bh does a barrier */
  1790. if (do_barriers) {
  1791. for (i = 0; i < max_mirrors; i++) {
  1792. bytenr = btrfs_sb_offset(i);
  1793. if (bytenr + BTRFS_SUPER_INFO_SIZE >=
  1794. device->total_bytes)
  1795. break;
  1796. last_barrier = i;
  1797. }
  1798. }
  1799. for (i = 0; i < max_mirrors; i++) {
  1800. bytenr = btrfs_sb_offset(i);
  1801. if (bytenr + BTRFS_SUPER_INFO_SIZE >= device->total_bytes)
  1802. break;
  1803. if (wait) {
  1804. bh = __find_get_block(device->bdev, bytenr / 4096,
  1805. BTRFS_SUPER_INFO_SIZE);
  1806. BUG_ON(!bh);
  1807. wait_on_buffer(bh);
  1808. if (!buffer_uptodate(bh))
  1809. errors++;
  1810. /* drop our reference */
  1811. brelse(bh);
  1812. /* drop the reference from the wait == 0 run */
  1813. brelse(bh);
  1814. continue;
  1815. } else {
  1816. btrfs_set_super_bytenr(sb, bytenr);
  1817. crc = ~(u32)0;
  1818. crc = btrfs_csum_data(NULL, (char *)sb +
  1819. BTRFS_CSUM_SIZE, crc,
  1820. BTRFS_SUPER_INFO_SIZE -
  1821. BTRFS_CSUM_SIZE);
  1822. btrfs_csum_final(crc, sb->csum);
  1823. /*
  1824. * one reference for us, and we leave it for the
  1825. * caller
  1826. */
  1827. bh = __getblk(device->bdev, bytenr / 4096,
  1828. BTRFS_SUPER_INFO_SIZE);
  1829. memcpy(bh->b_data, sb, BTRFS_SUPER_INFO_SIZE);
  1830. /* one reference for submit_bh */
  1831. get_bh(bh);
  1832. set_buffer_uptodate(bh);
  1833. lock_buffer(bh);
  1834. bh->b_end_io = btrfs_end_buffer_write_sync;
  1835. }
  1836. if (i == last_barrier && do_barriers && device->barriers) {
  1837. ret = submit_bh(WRITE_BARRIER, bh);
  1838. if (ret == -EOPNOTSUPP) {
  1839. printk("btrfs: disabling barriers on dev %s\n",
  1840. device->name);
  1841. set_buffer_uptodate(bh);
  1842. device->barriers = 0;
  1843. /* one reference for submit_bh */
  1844. get_bh(bh);
  1845. lock_buffer(bh);
  1846. ret = submit_bh(WRITE_SYNC, bh);
  1847. }
  1848. } else {
  1849. ret = submit_bh(WRITE_SYNC, bh);
  1850. }
  1851. if (ret)
  1852. errors++;
  1853. }
  1854. return errors < i ? 0 : -1;
  1855. }
  1856. int write_all_supers(struct btrfs_root *root, int max_mirrors)
  1857. {
  1858. struct list_head *head;
  1859. struct btrfs_device *dev;
  1860. struct btrfs_super_block *sb;
  1861. struct btrfs_dev_item *dev_item;
  1862. int ret;
  1863. int do_barriers;
  1864. int max_errors;
  1865. int total_errors = 0;
  1866. u64 flags;
  1867. max_errors = btrfs_super_num_devices(&root->fs_info->super_copy) - 1;
  1868. do_barriers = !btrfs_test_opt(root, NOBARRIER);
  1869. sb = &root->fs_info->super_for_commit;
  1870. dev_item = &sb->dev_item;
  1871. mutex_lock(&root->fs_info->fs_devices->device_list_mutex);
  1872. head = &root->fs_info->fs_devices->devices;
  1873. list_for_each_entry(dev, head, dev_list) {
  1874. if (!dev->bdev) {
  1875. total_errors++;
  1876. continue;
  1877. }
  1878. if (!dev->in_fs_metadata || !dev->writeable)
  1879. continue;
  1880. btrfs_set_stack_device_generation(dev_item, 0);
  1881. btrfs_set_stack_device_type(dev_item, dev->type);
  1882. btrfs_set_stack_device_id(dev_item, dev->devid);
  1883. btrfs_set_stack_device_total_bytes(dev_item, dev->total_bytes);
  1884. btrfs_set_stack_device_bytes_used(dev_item, dev->bytes_used);
  1885. btrfs_set_stack_device_io_align(dev_item, dev->io_align);
  1886. btrfs_set_stack_device_io_width(dev_item, dev->io_width);
  1887. btrfs_set_stack_device_sector_size(dev_item, dev->sector_size);
  1888. memcpy(dev_item->uuid, dev->uuid, BTRFS_UUID_SIZE);
  1889. memcpy(dev_item->fsid, dev->fs_devices->fsid, BTRFS_UUID_SIZE);
  1890. flags = btrfs_super_flags(sb);
  1891. btrfs_set_super_flags(sb, flags | BTRFS_HEADER_FLAG_WRITTEN);
  1892. ret = write_dev_supers(dev, sb, do_barriers, 0, max_mirrors);
  1893. if (ret)
  1894. total_errors++;
  1895. }
  1896. if (total_errors > max_errors) {
  1897. printk(KERN_ERR "btrfs: %d errors while writing supers\n",
  1898. total_errors);
  1899. BUG();
  1900. }
  1901. total_errors = 0;
  1902. list_for_each_entry(dev, head, dev_list) {
  1903. if (!dev->bdev)
  1904. continue;
  1905. if (!dev->in_fs_metadata || !dev->writeable)
  1906. continue;
  1907. ret = write_dev_supers(dev, sb, do_barriers, 1, max_mirrors);
  1908. if (ret)
  1909. total_errors++;
  1910. }
  1911. mutex_unlock(&root->fs_info->fs_devices->device_list_mutex);
  1912. if (total_errors > max_errors) {
  1913. printk(KERN_ERR "btrfs: %d errors while writing supers\n",
  1914. total_errors);
  1915. BUG();
  1916. }
  1917. return 0;
  1918. }
  1919. int write_ctree_super(struct btrfs_trans_handle *trans,
  1920. struct btrfs_root *root, int max_mirrors)
  1921. {
  1922. int ret;
  1923. ret = write_all_supers(root, max_mirrors);
  1924. return ret;
  1925. }
  1926. int btrfs_free_fs_root(struct btrfs_fs_info *fs_info, struct btrfs_root *root)
  1927. {
  1928. WARN_ON(!RB_EMPTY_ROOT(&root->inode_tree));
  1929. radix_tree_delete(&fs_info->fs_roots_radix,
  1930. (unsigned long)root->root_key.objectid);
  1931. if (root->anon_super.s_dev) {
  1932. down_write(&root->anon_super.s_umount);
  1933. kill_anon_super(&root->anon_super);
  1934. }
  1935. if (root->node)
  1936. free_extent_buffer(root->node);
  1937. if (root->commit_root)
  1938. free_extent_buffer(root->commit_root);
  1939. kfree(root->name);
  1940. kfree(root);
  1941. return 0;
  1942. }
  1943. static int del_fs_roots(struct btrfs_fs_info *fs_info)
  1944. {
  1945. int ret;
  1946. struct btrfs_root *gang[8];
  1947. int i;
  1948. while (1) {
  1949. ret = radix_tree_gang_lookup(&fs_info->fs_roots_radix,
  1950. (void **)gang, 0,
  1951. ARRAY_SIZE(gang));
  1952. if (!ret)
  1953. break;
  1954. for (i = 0; i < ret; i++)
  1955. btrfs_free_fs_root(fs_info, gang[i]);
  1956. }
  1957. return 0;
  1958. }
  1959. int btrfs_cleanup_fs_roots(struct btrfs_fs_info *fs_info)
  1960. {
  1961. u64 root_objectid = 0;
  1962. struct btrfs_root *gang[8];
  1963. int i;
  1964. int ret;
  1965. while (1) {
  1966. ret = radix_tree_gang_lookup(&fs_info->fs_roots_radix,
  1967. (void **)gang, root_objectid,
  1968. ARRAY_SIZE(gang));
  1969. if (!ret)
  1970. break;
  1971. root_objectid = gang[ret - 1]->root_key.objectid + 1;
  1972. for (i = 0; i < ret; i++) {
  1973. root_objectid = gang[i]->root_key.objectid;
  1974. ret = btrfs_find_dead_roots(fs_info->tree_root,
  1975. root_objectid);
  1976. BUG_ON(ret);
  1977. btrfs_orphan_cleanup(gang[i]);
  1978. }
  1979. root_objectid++;
  1980. }
  1981. return 0;
  1982. }
  1983. int btrfs_commit_super(struct btrfs_root *root)
  1984. {
  1985. struct btrfs_trans_handle *trans;
  1986. int ret;
  1987. mutex_lock(&root->fs_info->cleaner_mutex);
  1988. btrfs_clean_old_snapshots(root);
  1989. mutex_unlock(&root->fs_info->cleaner_mutex);
  1990. trans = btrfs_start_transaction(root, 1);
  1991. ret = btrfs_commit_transaction(trans, root);
  1992. BUG_ON(ret);
  1993. /* run commit again to drop the original snapshot */
  1994. trans = btrfs_start_transaction(root, 1);
  1995. btrfs_commit_transaction(trans, root);
  1996. ret = btrfs_write_and_wait_transaction(NULL, root);
  1997. BUG_ON(ret);
  1998. ret = write_ctree_super(NULL, root, 0);
  1999. return ret;
  2000. }
  2001. int close_ctree(struct btrfs_root *root)
  2002. {
  2003. struct btrfs_fs_info *fs_info = root->fs_info;
  2004. int ret;
  2005. fs_info->closing = 1;
  2006. smp_mb();
  2007. kthread_stop(root->fs_info->transaction_kthread);
  2008. kthread_stop(root->fs_info->cleaner_kthread);
  2009. if (!(fs_info->sb->s_flags & MS_RDONLY)) {
  2010. ret = btrfs_commit_super(root);
  2011. if (ret)
  2012. printk(KERN_ERR "btrfs: commit super ret %d\n", ret);
  2013. }
  2014. if (fs_info->delalloc_bytes) {
  2015. printk(KERN_INFO "btrfs: at unmount delalloc count %llu\n",
  2016. (unsigned long long)fs_info->delalloc_bytes);
  2017. }
  2018. if (fs_info->total_ref_cache_size) {
  2019. printk(KERN_INFO "btrfs: at umount reference cache size %llu\n",
  2020. (unsigned long long)fs_info->total_ref_cache_size);
  2021. }
  2022. free_extent_buffer(fs_info->extent_root->node);
  2023. free_extent_buffer(fs_info->extent_root->commit_root);
  2024. free_extent_buffer(fs_info->tree_root->node);
  2025. free_extent_buffer(fs_info->tree_root->commit_root);
  2026. free_extent_buffer(root->fs_info->chunk_root->node);
  2027. free_extent_buffer(root->fs_info->chunk_root->commit_root);
  2028. free_extent_buffer(root->fs_info->dev_root->node);
  2029. free_extent_buffer(root->fs_info->dev_root->commit_root);
  2030. free_extent_buffer(root->fs_info->csum_root->node);
  2031. free_extent_buffer(root->fs_info->csum_root->commit_root);
  2032. btrfs_free_block_groups(root->fs_info);
  2033. btrfs_free_super_mirror_extents(root->fs_info);
  2034. del_fs_roots(fs_info);
  2035. iput(fs_info->btree_inode);
  2036. btrfs_stop_workers(&fs_info->fixup_workers);
  2037. btrfs_stop_workers(&fs_info->delalloc_workers);
  2038. btrfs_stop_workers(&fs_info->workers);
  2039. btrfs_stop_workers(&fs_info->endio_workers);
  2040. btrfs_stop_workers(&fs_info->endio_meta_workers);
  2041. btrfs_stop_workers(&fs_info->endio_meta_write_workers);
  2042. btrfs_stop_workers(&fs_info->endio_write_workers);
  2043. btrfs_stop_workers(&fs_info->submit_workers);
  2044. btrfs_close_devices(fs_info->fs_devices);
  2045. btrfs_mapping_tree_free(&fs_info->mapping_tree);
  2046. bdi_destroy(&fs_info->bdi);
  2047. kfree(fs_info->extent_root);
  2048. kfree(fs_info->tree_root);
  2049. kfree(fs_info->chunk_root);
  2050. kfree(fs_info->dev_root);
  2051. kfree(fs_info->csum_root);
  2052. return 0;
  2053. }
  2054. int btrfs_buffer_uptodate(struct extent_buffer *buf, u64 parent_transid)
  2055. {
  2056. int ret;
  2057. struct inode *btree_inode = buf->first_page->mapping->host;
  2058. ret = extent_buffer_uptodate(&BTRFS_I(btree_inode)->io_tree, buf);
  2059. if (!ret)
  2060. return ret;
  2061. ret = verify_parent_transid(&BTRFS_I(btree_inode)->io_tree, buf,
  2062. parent_transid);
  2063. return !ret;
  2064. }
  2065. int btrfs_set_buffer_uptodate(struct extent_buffer *buf)
  2066. {
  2067. struct inode *btree_inode = buf->first_page->mapping->host;
  2068. return set_extent_buffer_uptodate(&BTRFS_I(btree_inode)->io_tree,
  2069. buf);
  2070. }
  2071. void btrfs_mark_buffer_dirty(struct extent_buffer *buf)
  2072. {
  2073. struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
  2074. u64 transid = btrfs_header_generation(buf);
  2075. struct inode *btree_inode = root->fs_info->btree_inode;
  2076. int was_dirty;
  2077. btrfs_assert_tree_locked(buf);
  2078. if (transid != root->fs_info->generation) {
  2079. printk(KERN_CRIT "btrfs transid mismatch buffer %llu, "
  2080. "found %llu running %llu\n",
  2081. (unsigned long long)buf->start,
  2082. (unsigned long long)transid,
  2083. (unsigned long long)root->fs_info->generation);
  2084. WARN_ON(1);
  2085. }
  2086. was_dirty = set_extent_buffer_dirty(&BTRFS_I(btree_inode)->io_tree,
  2087. buf);
  2088. if (!was_dirty) {
  2089. spin_lock(&root->fs_info->delalloc_lock);
  2090. root->fs_info->dirty_metadata_bytes += buf->len;
  2091. spin_unlock(&root->fs_info->delalloc_lock);
  2092. }
  2093. }
  2094. void btrfs_btree_balance_dirty(struct btrfs_root *root, unsigned long nr)
  2095. {
  2096. /*
  2097. * looks as though older kernels can get into trouble with
  2098. * this code, they end up stuck in balance_dirty_pages forever
  2099. */
  2100. u64 num_dirty;
  2101. unsigned long thresh = 32 * 1024 * 1024;
  2102. if (current->flags & PF_MEMALLOC)
  2103. return;
  2104. num_dirty = root->fs_info->dirty_metadata_bytes;
  2105. if (num_dirty > thresh) {
  2106. balance_dirty_pages_ratelimited_nr(
  2107. root->fs_info->btree_inode->i_mapping, 1);
  2108. }
  2109. return;
  2110. }
  2111. int btrfs_read_buffer(struct extent_buffer *buf, u64 parent_transid)
  2112. {
  2113. struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
  2114. int ret;
  2115. ret = btree_read_extent_buffer_pages(root, buf, 0, parent_transid);
  2116. if (ret == 0)
  2117. set_bit(EXTENT_BUFFER_UPTODATE, &buf->bflags);
  2118. return ret;
  2119. }
  2120. int btree_lock_page_hook(struct page *page)
  2121. {
  2122. struct inode *inode = page->mapping->host;
  2123. struct btrfs_root *root = BTRFS_I(inode)->root;
  2124. struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
  2125. struct extent_buffer *eb;
  2126. unsigned long len;
  2127. u64 bytenr = page_offset(page);
  2128. if (page->private == EXTENT_PAGE_PRIVATE)
  2129. goto out;
  2130. len = page->private >> 2;
  2131. eb = find_extent_buffer(io_tree, bytenr, len, GFP_NOFS);
  2132. if (!eb)
  2133. goto out;
  2134. btrfs_tree_lock(eb);
  2135. btrfs_set_header_flag(eb, BTRFS_HEADER_FLAG_WRITTEN);
  2136. if (test_and_clear_bit(EXTENT_BUFFER_DIRTY, &eb->bflags)) {
  2137. spin_lock(&root->fs_info->delalloc_lock);
  2138. if (root->fs_info->dirty_metadata_bytes >= eb->len)
  2139. root->fs_info->dirty_metadata_bytes -= eb->len;
  2140. else
  2141. WARN_ON(1);
  2142. spin_unlock(&root->fs_info->delalloc_lock);
  2143. }
  2144. btrfs_tree_unlock(eb);
  2145. free_extent_buffer(eb);
  2146. out:
  2147. lock_page(page);
  2148. return 0;
  2149. }
  2150. static struct extent_io_ops btree_extent_io_ops = {
  2151. .write_cache_pages_lock_hook = btree_lock_page_hook,
  2152. .readpage_end_io_hook = btree_readpage_end_io_hook,
  2153. .submit_bio_hook = btree_submit_bio_hook,
  2154. /* note we're sharing with inode.c for the merge bio hook */
  2155. .merge_bio_hook = btrfs_merge_bio_hook,
  2156. };