dm-thin-metadata.c 45 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018
  1. /*
  2. * Copyright (C) 2011-2012 Red Hat, Inc.
  3. *
  4. * This file is released under the GPL.
  5. */
  6. #include "dm-thin-metadata.h"
  7. #include "persistent-data/dm-btree.h"
  8. #include "persistent-data/dm-space-map.h"
  9. #include "persistent-data/dm-space-map-disk.h"
  10. #include "persistent-data/dm-transaction-manager.h"
  11. #include <linux/list.h>
  12. #include <linux/device-mapper.h>
  13. #include <linux/workqueue.h>
  14. /*--------------------------------------------------------------------------
  15. * As far as the metadata goes, there is:
  16. *
  17. * - A superblock in block zero, taking up fewer than 512 bytes for
  18. * atomic writes.
  19. *
  20. * - A space map managing the metadata blocks.
  21. *
  22. * - A space map managing the data blocks.
  23. *
  24. * - A btree mapping our internal thin dev ids onto struct disk_device_details.
  25. *
  26. * - A hierarchical btree, with 2 levels which effectively maps (thin
  27. * dev id, virtual block) -> block_time. Block time is a 64-bit
  28. * field holding the time in the low 24 bits, and block in the top 48
  29. * bits.
  30. *
  31. * BTrees consist solely of btree_nodes, that fill a block. Some are
  32. * internal nodes, as such their values are a __le64 pointing to other
  33. * nodes. Leaf nodes can store data of any reasonable size (ie. much
  34. * smaller than the block size). The nodes consist of the header,
  35. * followed by an array of keys, followed by an array of values. We have
  36. * to binary search on the keys so they're all held together to help the
  37. * cpu cache.
  38. *
  39. * Space maps have 2 btrees:
  40. *
  41. * - One maps a uint64_t onto a struct index_entry. Which points to a
  42. * bitmap block, and has some details about how many free entries there
  43. * are etc.
  44. *
  45. * - The bitmap blocks have a header (for the checksum). Then the rest
  46. * of the block is pairs of bits. With the meaning being:
  47. *
  48. * 0 - ref count is 0
  49. * 1 - ref count is 1
  50. * 2 - ref count is 2
  51. * 3 - ref count is higher than 2
  52. *
  53. * - If the count is higher than 2 then the ref count is entered in a
  54. * second btree that directly maps the block_address to a uint32_t ref
  55. * count.
  56. *
  57. * The space map metadata variant doesn't have a bitmaps btree. Instead
  58. * it has one single blocks worth of index_entries. This avoids
  59. * recursive issues with the bitmap btree needing to allocate space in
  60. * order to insert. With a small data block size such as 64k the
  61. * metadata support data devices that are hundreds of terrabytes.
  62. *
  63. * The space maps allocate space linearly from front to back. Space that
  64. * is freed in a transaction is never recycled within that transaction.
  65. * To try and avoid fragmenting _free_ space the allocator always goes
  66. * back and fills in gaps.
  67. *
  68. * All metadata io is in THIN_METADATA_BLOCK_SIZE sized/aligned chunks
  69. * from the block manager.
  70. *--------------------------------------------------------------------------*/
  71. #define DM_MSG_PREFIX "thin metadata"
  72. #define THIN_SUPERBLOCK_MAGIC 27022010
  73. #define THIN_SUPERBLOCK_LOCATION 0
  74. #define THIN_VERSION 2
  75. #define THIN_METADATA_CACHE_SIZE 64
  76. #define SECTOR_TO_BLOCK_SHIFT 3
  77. /*
  78. * 3 for btree insert +
  79. * 2 for btree lookup used within space map
  80. */
  81. #define THIN_MAX_CONCURRENT_LOCKS 5
  82. /* This should be plenty */
  83. #define SPACE_MAP_ROOT_SIZE 128
  84. /*
  85. * Little endian on-disk superblock and device details.
  86. */
  87. struct thin_disk_superblock {
  88. __le32 csum; /* Checksum of superblock except for this field. */
  89. __le32 flags;
  90. __le64 blocknr; /* This block number, dm_block_t. */
  91. __u8 uuid[16];
  92. __le64 magic;
  93. __le32 version;
  94. __le32 time;
  95. __le64 trans_id;
  96. /*
  97. * Root held by userspace transactions.
  98. */
  99. __le64 held_root;
  100. __u8 data_space_map_root[SPACE_MAP_ROOT_SIZE];
  101. __u8 metadata_space_map_root[SPACE_MAP_ROOT_SIZE];
  102. /*
  103. * 2-level btree mapping (dev_id, (dev block, time)) -> data block
  104. */
  105. __le64 data_mapping_root;
  106. /*
  107. * Device detail root mapping dev_id -> device_details
  108. */
  109. __le64 device_details_root;
  110. __le32 data_block_size; /* In 512-byte sectors. */
  111. __le32 metadata_block_size; /* In 512-byte sectors. */
  112. __le64 metadata_nr_blocks;
  113. __le32 compat_flags;
  114. __le32 compat_ro_flags;
  115. __le32 incompat_flags;
  116. } __packed;
  117. struct disk_device_details {
  118. __le64 mapped_blocks;
  119. __le64 transaction_id; /* When created. */
  120. __le32 creation_time;
  121. __le32 snapshotted_time;
  122. } __packed;
  123. struct dm_pool_metadata {
  124. struct hlist_node hash;
  125. struct block_device *bdev;
  126. struct dm_block_manager *bm;
  127. struct dm_space_map *metadata_sm;
  128. struct dm_space_map *data_sm;
  129. struct dm_transaction_manager *tm;
  130. struct dm_transaction_manager *nb_tm;
  131. /*
  132. * Two-level btree.
  133. * First level holds thin_dev_t.
  134. * Second level holds mappings.
  135. */
  136. struct dm_btree_info info;
  137. /*
  138. * Non-blocking version of the above.
  139. */
  140. struct dm_btree_info nb_info;
  141. /*
  142. * Just the top level for deleting whole devices.
  143. */
  144. struct dm_btree_info tl_info;
  145. /*
  146. * Just the bottom level for creating new devices.
  147. */
  148. struct dm_btree_info bl_info;
  149. /*
  150. * Describes the device details btree.
  151. */
  152. struct dm_btree_info details_info;
  153. struct rw_semaphore root_lock;
  154. uint32_t time;
  155. dm_block_t root;
  156. dm_block_t details_root;
  157. struct list_head thin_devices;
  158. uint64_t trans_id;
  159. unsigned long flags;
  160. sector_t data_block_size;
  161. /*
  162. * Set if a transaction has to be aborted but the attempt to roll back
  163. * to the previous (good) transaction failed. The only pool metadata
  164. * operation possible in this state is the closing of the device.
  165. */
  166. bool fail_io:1;
  167. /*
  168. * Reading the space map roots can fail, so we read it into these
  169. * buffers before the superblock is locked and updated.
  170. */
  171. __u8 data_space_map_root[SPACE_MAP_ROOT_SIZE];
  172. __u8 metadata_space_map_root[SPACE_MAP_ROOT_SIZE];
  173. };
  174. struct dm_thin_device {
  175. struct list_head list;
  176. struct dm_pool_metadata *pmd;
  177. dm_thin_id id;
  178. int open_count;
  179. bool changed:1;
  180. bool aborted_with_changes:1;
  181. uint64_t mapped_blocks;
  182. uint64_t transaction_id;
  183. uint32_t creation_time;
  184. uint32_t snapshotted_time;
  185. };
  186. /*----------------------------------------------------------------
  187. * superblock validator
  188. *--------------------------------------------------------------*/
  189. #define SUPERBLOCK_CSUM_XOR 160774
  190. static void sb_prepare_for_write(struct dm_block_validator *v,
  191. struct dm_block *b,
  192. size_t block_size)
  193. {
  194. struct thin_disk_superblock *disk_super = dm_block_data(b);
  195. disk_super->blocknr = cpu_to_le64(dm_block_location(b));
  196. disk_super->csum = cpu_to_le32(dm_bm_checksum(&disk_super->flags,
  197. block_size - sizeof(__le32),
  198. SUPERBLOCK_CSUM_XOR));
  199. }
  200. static int sb_check(struct dm_block_validator *v,
  201. struct dm_block *b,
  202. size_t block_size)
  203. {
  204. struct thin_disk_superblock *disk_super = dm_block_data(b);
  205. __le32 csum_le;
  206. if (dm_block_location(b) != le64_to_cpu(disk_super->blocknr)) {
  207. DMERR("sb_check failed: blocknr %llu: "
  208. "wanted %llu", le64_to_cpu(disk_super->blocknr),
  209. (unsigned long long)dm_block_location(b));
  210. return -ENOTBLK;
  211. }
  212. if (le64_to_cpu(disk_super->magic) != THIN_SUPERBLOCK_MAGIC) {
  213. DMERR("sb_check failed: magic %llu: "
  214. "wanted %llu", le64_to_cpu(disk_super->magic),
  215. (unsigned long long)THIN_SUPERBLOCK_MAGIC);
  216. return -EILSEQ;
  217. }
  218. csum_le = cpu_to_le32(dm_bm_checksum(&disk_super->flags,
  219. block_size - sizeof(__le32),
  220. SUPERBLOCK_CSUM_XOR));
  221. if (csum_le != disk_super->csum) {
  222. DMERR("sb_check failed: csum %u: wanted %u",
  223. le32_to_cpu(csum_le), le32_to_cpu(disk_super->csum));
  224. return -EILSEQ;
  225. }
  226. return 0;
  227. }
  228. static struct dm_block_validator sb_validator = {
  229. .name = "superblock",
  230. .prepare_for_write = sb_prepare_for_write,
  231. .check = sb_check
  232. };
  233. /*----------------------------------------------------------------
  234. * Methods for the btree value types
  235. *--------------------------------------------------------------*/
  236. static uint64_t pack_block_time(dm_block_t b, uint32_t t)
  237. {
  238. return (b << 24) | t;
  239. }
  240. static void unpack_block_time(uint64_t v, dm_block_t *b, uint32_t *t)
  241. {
  242. *b = v >> 24;
  243. *t = v & ((1 << 24) - 1);
  244. }
  245. static void data_block_inc(void *context, const void *value_le)
  246. {
  247. struct dm_space_map *sm = context;
  248. __le64 v_le;
  249. uint64_t b;
  250. uint32_t t;
  251. memcpy(&v_le, value_le, sizeof(v_le));
  252. unpack_block_time(le64_to_cpu(v_le), &b, &t);
  253. dm_sm_inc_block(sm, b);
  254. }
  255. static void data_block_dec(void *context, const void *value_le)
  256. {
  257. struct dm_space_map *sm = context;
  258. __le64 v_le;
  259. uint64_t b;
  260. uint32_t t;
  261. memcpy(&v_le, value_le, sizeof(v_le));
  262. unpack_block_time(le64_to_cpu(v_le), &b, &t);
  263. dm_sm_dec_block(sm, b);
  264. }
  265. static int data_block_equal(void *context, const void *value1_le, const void *value2_le)
  266. {
  267. __le64 v1_le, v2_le;
  268. uint64_t b1, b2;
  269. uint32_t t;
  270. memcpy(&v1_le, value1_le, sizeof(v1_le));
  271. memcpy(&v2_le, value2_le, sizeof(v2_le));
  272. unpack_block_time(le64_to_cpu(v1_le), &b1, &t);
  273. unpack_block_time(le64_to_cpu(v2_le), &b2, &t);
  274. return b1 == b2;
  275. }
  276. static void subtree_inc(void *context, const void *value)
  277. {
  278. struct dm_btree_info *info = context;
  279. __le64 root_le;
  280. uint64_t root;
  281. memcpy(&root_le, value, sizeof(root_le));
  282. root = le64_to_cpu(root_le);
  283. dm_tm_inc(info->tm, root);
  284. }
  285. static void subtree_dec(void *context, const void *value)
  286. {
  287. struct dm_btree_info *info = context;
  288. __le64 root_le;
  289. uint64_t root;
  290. memcpy(&root_le, value, sizeof(root_le));
  291. root = le64_to_cpu(root_le);
  292. if (dm_btree_del(info, root))
  293. DMERR("btree delete failed");
  294. }
  295. static int subtree_equal(void *context, const void *value1_le, const void *value2_le)
  296. {
  297. __le64 v1_le, v2_le;
  298. memcpy(&v1_le, value1_le, sizeof(v1_le));
  299. memcpy(&v2_le, value2_le, sizeof(v2_le));
  300. return v1_le == v2_le;
  301. }
  302. /*----------------------------------------------------------------*/
  303. static int superblock_lock_zero(struct dm_pool_metadata *pmd,
  304. struct dm_block **sblock)
  305. {
  306. return dm_bm_write_lock_zero(pmd->bm, THIN_SUPERBLOCK_LOCATION,
  307. &sb_validator, sblock);
  308. }
  309. static int superblock_lock(struct dm_pool_metadata *pmd,
  310. struct dm_block **sblock)
  311. {
  312. return dm_bm_write_lock(pmd->bm, THIN_SUPERBLOCK_LOCATION,
  313. &sb_validator, sblock);
  314. }
  315. static int __superblock_all_zeroes(struct dm_block_manager *bm, int *result)
  316. {
  317. int r;
  318. unsigned i;
  319. struct dm_block *b;
  320. __le64 *data_le, zero = cpu_to_le64(0);
  321. unsigned block_size = dm_bm_block_size(bm) / sizeof(__le64);
  322. /*
  323. * We can't use a validator here - it may be all zeroes.
  324. */
  325. r = dm_bm_read_lock(bm, THIN_SUPERBLOCK_LOCATION, NULL, &b);
  326. if (r)
  327. return r;
  328. data_le = dm_block_data(b);
  329. *result = 1;
  330. for (i = 0; i < block_size; i++) {
  331. if (data_le[i] != zero) {
  332. *result = 0;
  333. break;
  334. }
  335. }
  336. dm_bm_unlock(b);
  337. return 0;
  338. }
  339. static void __setup_btree_details(struct dm_pool_metadata *pmd)
  340. {
  341. pmd->info.tm = pmd->tm;
  342. pmd->info.levels = 2;
  343. pmd->info.value_type.context = pmd->data_sm;
  344. pmd->info.value_type.size = sizeof(__le64);
  345. pmd->info.value_type.inc = data_block_inc;
  346. pmd->info.value_type.dec = data_block_dec;
  347. pmd->info.value_type.equal = data_block_equal;
  348. memcpy(&pmd->nb_info, &pmd->info, sizeof(pmd->nb_info));
  349. pmd->nb_info.tm = pmd->nb_tm;
  350. pmd->tl_info.tm = pmd->tm;
  351. pmd->tl_info.levels = 1;
  352. pmd->tl_info.value_type.context = &pmd->bl_info;
  353. pmd->tl_info.value_type.size = sizeof(__le64);
  354. pmd->tl_info.value_type.inc = subtree_inc;
  355. pmd->tl_info.value_type.dec = subtree_dec;
  356. pmd->tl_info.value_type.equal = subtree_equal;
  357. pmd->bl_info.tm = pmd->tm;
  358. pmd->bl_info.levels = 1;
  359. pmd->bl_info.value_type.context = pmd->data_sm;
  360. pmd->bl_info.value_type.size = sizeof(__le64);
  361. pmd->bl_info.value_type.inc = data_block_inc;
  362. pmd->bl_info.value_type.dec = data_block_dec;
  363. pmd->bl_info.value_type.equal = data_block_equal;
  364. pmd->details_info.tm = pmd->tm;
  365. pmd->details_info.levels = 1;
  366. pmd->details_info.value_type.context = NULL;
  367. pmd->details_info.value_type.size = sizeof(struct disk_device_details);
  368. pmd->details_info.value_type.inc = NULL;
  369. pmd->details_info.value_type.dec = NULL;
  370. pmd->details_info.value_type.equal = NULL;
  371. }
  372. static int save_sm_roots(struct dm_pool_metadata *pmd)
  373. {
  374. int r;
  375. size_t len;
  376. r = dm_sm_root_size(pmd->metadata_sm, &len);
  377. if (r < 0)
  378. return r;
  379. r = dm_sm_copy_root(pmd->metadata_sm, &pmd->metadata_space_map_root, len);
  380. if (r < 0)
  381. return r;
  382. r = dm_sm_root_size(pmd->data_sm, &len);
  383. if (r < 0)
  384. return r;
  385. return dm_sm_copy_root(pmd->data_sm, &pmd->data_space_map_root, len);
  386. }
  387. static void copy_sm_roots(struct dm_pool_metadata *pmd,
  388. struct thin_disk_superblock *disk)
  389. {
  390. memcpy(&disk->metadata_space_map_root,
  391. &pmd->metadata_space_map_root,
  392. sizeof(pmd->metadata_space_map_root));
  393. memcpy(&disk->data_space_map_root,
  394. &pmd->data_space_map_root,
  395. sizeof(pmd->data_space_map_root));
  396. }
  397. static int __write_initial_superblock(struct dm_pool_metadata *pmd)
  398. {
  399. int r;
  400. struct dm_block *sblock;
  401. struct thin_disk_superblock *disk_super;
  402. sector_t bdev_size = i_size_read(pmd->bdev->bd_inode) >> SECTOR_SHIFT;
  403. if (bdev_size > THIN_METADATA_MAX_SECTORS)
  404. bdev_size = THIN_METADATA_MAX_SECTORS;
  405. r = dm_sm_commit(pmd->data_sm);
  406. if (r < 0)
  407. return r;
  408. r = dm_tm_pre_commit(pmd->tm);
  409. if (r < 0)
  410. return r;
  411. r = save_sm_roots(pmd);
  412. if (r < 0)
  413. return r;
  414. r = superblock_lock_zero(pmd, &sblock);
  415. if (r)
  416. return r;
  417. disk_super = dm_block_data(sblock);
  418. disk_super->flags = 0;
  419. memset(disk_super->uuid, 0, sizeof(disk_super->uuid));
  420. disk_super->magic = cpu_to_le64(THIN_SUPERBLOCK_MAGIC);
  421. disk_super->version = cpu_to_le32(THIN_VERSION);
  422. disk_super->time = 0;
  423. disk_super->trans_id = 0;
  424. disk_super->held_root = 0;
  425. copy_sm_roots(pmd, disk_super);
  426. disk_super->data_mapping_root = cpu_to_le64(pmd->root);
  427. disk_super->device_details_root = cpu_to_le64(pmd->details_root);
  428. disk_super->metadata_block_size = cpu_to_le32(THIN_METADATA_BLOCK_SIZE);
  429. disk_super->metadata_nr_blocks = cpu_to_le64(bdev_size >> SECTOR_TO_BLOCK_SHIFT);
  430. disk_super->data_block_size = cpu_to_le32(pmd->data_block_size);
  431. return dm_tm_commit(pmd->tm, sblock);
  432. }
  433. static int __format_metadata(struct dm_pool_metadata *pmd)
  434. {
  435. int r;
  436. r = dm_tm_create_with_sm(pmd->bm, THIN_SUPERBLOCK_LOCATION,
  437. &pmd->tm, &pmd->metadata_sm);
  438. if (r < 0) {
  439. DMERR("tm_create_with_sm failed");
  440. return r;
  441. }
  442. pmd->data_sm = dm_sm_disk_create(pmd->tm, 0);
  443. if (IS_ERR(pmd->data_sm)) {
  444. DMERR("sm_disk_create failed");
  445. r = PTR_ERR(pmd->data_sm);
  446. goto bad_cleanup_tm;
  447. }
  448. pmd->nb_tm = dm_tm_create_non_blocking_clone(pmd->tm);
  449. if (!pmd->nb_tm) {
  450. DMERR("could not create non-blocking clone tm");
  451. r = -ENOMEM;
  452. goto bad_cleanup_data_sm;
  453. }
  454. __setup_btree_details(pmd);
  455. r = dm_btree_empty(&pmd->info, &pmd->root);
  456. if (r < 0)
  457. goto bad_cleanup_nb_tm;
  458. r = dm_btree_empty(&pmd->details_info, &pmd->details_root);
  459. if (r < 0) {
  460. DMERR("couldn't create devices root");
  461. goto bad_cleanup_nb_tm;
  462. }
  463. r = __write_initial_superblock(pmd);
  464. if (r)
  465. goto bad_cleanup_nb_tm;
  466. return 0;
  467. bad_cleanup_nb_tm:
  468. dm_tm_destroy(pmd->nb_tm);
  469. bad_cleanup_data_sm:
  470. dm_sm_destroy(pmd->data_sm);
  471. bad_cleanup_tm:
  472. dm_tm_destroy(pmd->tm);
  473. dm_sm_destroy(pmd->metadata_sm);
  474. return r;
  475. }
  476. static int __check_incompat_features(struct thin_disk_superblock *disk_super,
  477. struct dm_pool_metadata *pmd)
  478. {
  479. uint32_t features;
  480. features = le32_to_cpu(disk_super->incompat_flags) & ~THIN_FEATURE_INCOMPAT_SUPP;
  481. if (features) {
  482. DMERR("could not access metadata due to unsupported optional features (%lx).",
  483. (unsigned long)features);
  484. return -EINVAL;
  485. }
  486. /*
  487. * Check for read-only metadata to skip the following RDWR checks.
  488. */
  489. if (get_disk_ro(pmd->bdev->bd_disk))
  490. return 0;
  491. features = le32_to_cpu(disk_super->compat_ro_flags) & ~THIN_FEATURE_COMPAT_RO_SUPP;
  492. if (features) {
  493. DMERR("could not access metadata RDWR due to unsupported optional features (%lx).",
  494. (unsigned long)features);
  495. return -EINVAL;
  496. }
  497. return 0;
  498. }
  499. static int __open_metadata(struct dm_pool_metadata *pmd)
  500. {
  501. int r;
  502. struct dm_block *sblock;
  503. struct thin_disk_superblock *disk_super;
  504. r = dm_bm_read_lock(pmd->bm, THIN_SUPERBLOCK_LOCATION,
  505. &sb_validator, &sblock);
  506. if (r < 0) {
  507. DMERR("couldn't read superblock");
  508. return r;
  509. }
  510. disk_super = dm_block_data(sblock);
  511. /* Verify the data block size hasn't changed */
  512. if (le32_to_cpu(disk_super->data_block_size) != pmd->data_block_size) {
  513. DMERR("changing the data block size (from %u to %llu) is not supported",
  514. le32_to_cpu(disk_super->data_block_size),
  515. (unsigned long long)pmd->data_block_size);
  516. r = -EINVAL;
  517. goto bad_unlock_sblock;
  518. }
  519. r = __check_incompat_features(disk_super, pmd);
  520. if (r < 0)
  521. goto bad_unlock_sblock;
  522. r = dm_tm_open_with_sm(pmd->bm, THIN_SUPERBLOCK_LOCATION,
  523. disk_super->metadata_space_map_root,
  524. sizeof(disk_super->metadata_space_map_root),
  525. &pmd->tm, &pmd->metadata_sm);
  526. if (r < 0) {
  527. DMERR("tm_open_with_sm failed");
  528. goto bad_unlock_sblock;
  529. }
  530. pmd->data_sm = dm_sm_disk_open(pmd->tm, disk_super->data_space_map_root,
  531. sizeof(disk_super->data_space_map_root));
  532. if (IS_ERR(pmd->data_sm)) {
  533. DMERR("sm_disk_open failed");
  534. r = PTR_ERR(pmd->data_sm);
  535. goto bad_cleanup_tm;
  536. }
  537. pmd->nb_tm = dm_tm_create_non_blocking_clone(pmd->tm);
  538. if (!pmd->nb_tm) {
  539. DMERR("could not create non-blocking clone tm");
  540. r = -ENOMEM;
  541. goto bad_cleanup_data_sm;
  542. }
  543. __setup_btree_details(pmd);
  544. dm_bm_unlock(sblock);
  545. return 0;
  546. bad_cleanup_data_sm:
  547. dm_sm_destroy(pmd->data_sm);
  548. bad_cleanup_tm:
  549. dm_tm_destroy(pmd->tm);
  550. dm_sm_destroy(pmd->metadata_sm);
  551. bad_unlock_sblock:
  552. dm_bm_unlock(sblock);
  553. return r;
  554. }
  555. static int __open_or_format_metadata(struct dm_pool_metadata *pmd, bool format_device)
  556. {
  557. int r, unformatted;
  558. r = __superblock_all_zeroes(pmd->bm, &unformatted);
  559. if (r)
  560. return r;
  561. if (unformatted)
  562. return format_device ? __format_metadata(pmd) : -EPERM;
  563. return __open_metadata(pmd);
  564. }
  565. static int __create_persistent_data_objects(struct dm_pool_metadata *pmd, bool format_device)
  566. {
  567. int r;
  568. pmd->bm = dm_block_manager_create(pmd->bdev, THIN_METADATA_BLOCK_SIZE << SECTOR_SHIFT,
  569. THIN_METADATA_CACHE_SIZE,
  570. THIN_MAX_CONCURRENT_LOCKS);
  571. if (IS_ERR(pmd->bm)) {
  572. DMERR("could not create block manager");
  573. return PTR_ERR(pmd->bm);
  574. }
  575. r = __open_or_format_metadata(pmd, format_device);
  576. if (r)
  577. dm_block_manager_destroy(pmd->bm);
  578. return r;
  579. }
  580. static void __destroy_persistent_data_objects(struct dm_pool_metadata *pmd)
  581. {
  582. dm_sm_destroy(pmd->data_sm);
  583. dm_sm_destroy(pmd->metadata_sm);
  584. dm_tm_destroy(pmd->nb_tm);
  585. dm_tm_destroy(pmd->tm);
  586. dm_block_manager_destroy(pmd->bm);
  587. }
  588. static int __begin_transaction(struct dm_pool_metadata *pmd)
  589. {
  590. int r;
  591. struct thin_disk_superblock *disk_super;
  592. struct dm_block *sblock;
  593. /*
  594. * We re-read the superblock every time. Shouldn't need to do this
  595. * really.
  596. */
  597. r = dm_bm_read_lock(pmd->bm, THIN_SUPERBLOCK_LOCATION,
  598. &sb_validator, &sblock);
  599. if (r)
  600. return r;
  601. disk_super = dm_block_data(sblock);
  602. pmd->time = le32_to_cpu(disk_super->time);
  603. pmd->root = le64_to_cpu(disk_super->data_mapping_root);
  604. pmd->details_root = le64_to_cpu(disk_super->device_details_root);
  605. pmd->trans_id = le64_to_cpu(disk_super->trans_id);
  606. pmd->flags = le32_to_cpu(disk_super->flags);
  607. pmd->data_block_size = le32_to_cpu(disk_super->data_block_size);
  608. dm_bm_unlock(sblock);
  609. return 0;
  610. }
  611. static int __write_changed_details(struct dm_pool_metadata *pmd)
  612. {
  613. int r;
  614. struct dm_thin_device *td, *tmp;
  615. struct disk_device_details details;
  616. uint64_t key;
  617. list_for_each_entry_safe(td, tmp, &pmd->thin_devices, list) {
  618. if (!td->changed)
  619. continue;
  620. key = td->id;
  621. details.mapped_blocks = cpu_to_le64(td->mapped_blocks);
  622. details.transaction_id = cpu_to_le64(td->transaction_id);
  623. details.creation_time = cpu_to_le32(td->creation_time);
  624. details.snapshotted_time = cpu_to_le32(td->snapshotted_time);
  625. __dm_bless_for_disk(&details);
  626. r = dm_btree_insert(&pmd->details_info, pmd->details_root,
  627. &key, &details, &pmd->details_root);
  628. if (r)
  629. return r;
  630. if (td->open_count)
  631. td->changed = 0;
  632. else {
  633. list_del(&td->list);
  634. kfree(td);
  635. }
  636. }
  637. return 0;
  638. }
  639. static int __commit_transaction(struct dm_pool_metadata *pmd)
  640. {
  641. int r;
  642. size_t metadata_len, data_len;
  643. struct thin_disk_superblock *disk_super;
  644. struct dm_block *sblock;
  645. /*
  646. * We need to know if the thin_disk_superblock exceeds a 512-byte sector.
  647. */
  648. BUILD_BUG_ON(sizeof(struct thin_disk_superblock) > 512);
  649. r = __write_changed_details(pmd);
  650. if (r < 0)
  651. return r;
  652. r = dm_sm_commit(pmd->data_sm);
  653. if (r < 0)
  654. return r;
  655. r = dm_tm_pre_commit(pmd->tm);
  656. if (r < 0)
  657. return r;
  658. r = dm_sm_root_size(pmd->metadata_sm, &metadata_len);
  659. if (r < 0)
  660. return r;
  661. r = dm_sm_root_size(pmd->data_sm, &data_len);
  662. if (r < 0)
  663. return r;
  664. r = save_sm_roots(pmd);
  665. if (r < 0)
  666. return r;
  667. r = superblock_lock(pmd, &sblock);
  668. if (r)
  669. return r;
  670. disk_super = dm_block_data(sblock);
  671. disk_super->time = cpu_to_le32(pmd->time);
  672. disk_super->data_mapping_root = cpu_to_le64(pmd->root);
  673. disk_super->device_details_root = cpu_to_le64(pmd->details_root);
  674. disk_super->trans_id = cpu_to_le64(pmd->trans_id);
  675. disk_super->flags = cpu_to_le32(pmd->flags);
  676. copy_sm_roots(pmd, disk_super);
  677. return dm_tm_commit(pmd->tm, sblock);
  678. }
  679. struct dm_pool_metadata *dm_pool_metadata_open(struct block_device *bdev,
  680. sector_t data_block_size,
  681. bool format_device)
  682. {
  683. int r;
  684. struct dm_pool_metadata *pmd;
  685. pmd = kmalloc(sizeof(*pmd), GFP_KERNEL);
  686. if (!pmd) {
  687. DMERR("could not allocate metadata struct");
  688. return ERR_PTR(-ENOMEM);
  689. }
  690. init_rwsem(&pmd->root_lock);
  691. pmd->time = 0;
  692. INIT_LIST_HEAD(&pmd->thin_devices);
  693. pmd->fail_io = false;
  694. pmd->bdev = bdev;
  695. pmd->data_block_size = data_block_size;
  696. r = __create_persistent_data_objects(pmd, format_device);
  697. if (r) {
  698. kfree(pmd);
  699. return ERR_PTR(r);
  700. }
  701. r = __begin_transaction(pmd);
  702. if (r < 0) {
  703. if (dm_pool_metadata_close(pmd) < 0)
  704. DMWARN("%s: dm_pool_metadata_close() failed.", __func__);
  705. return ERR_PTR(r);
  706. }
  707. return pmd;
  708. }
  709. int dm_pool_metadata_close(struct dm_pool_metadata *pmd)
  710. {
  711. int r;
  712. unsigned open_devices = 0;
  713. struct dm_thin_device *td, *tmp;
  714. down_read(&pmd->root_lock);
  715. list_for_each_entry_safe(td, tmp, &pmd->thin_devices, list) {
  716. if (td->open_count)
  717. open_devices++;
  718. else {
  719. list_del(&td->list);
  720. kfree(td);
  721. }
  722. }
  723. up_read(&pmd->root_lock);
  724. if (open_devices) {
  725. DMERR("attempt to close pmd when %u device(s) are still open",
  726. open_devices);
  727. return -EBUSY;
  728. }
  729. if (!dm_bm_is_read_only(pmd->bm) && !pmd->fail_io) {
  730. r = __commit_transaction(pmd);
  731. if (r < 0)
  732. DMWARN("%s: __commit_transaction() failed, error = %d",
  733. __func__, r);
  734. }
  735. if (!pmd->fail_io)
  736. __destroy_persistent_data_objects(pmd);
  737. kfree(pmd);
  738. return 0;
  739. }
  740. /*
  741. * __open_device: Returns @td corresponding to device with id @dev,
  742. * creating it if @create is set and incrementing @td->open_count.
  743. * On failure, @td is undefined.
  744. */
  745. static int __open_device(struct dm_pool_metadata *pmd,
  746. dm_thin_id dev, int create,
  747. struct dm_thin_device **td)
  748. {
  749. int r, changed = 0;
  750. struct dm_thin_device *td2;
  751. uint64_t key = dev;
  752. struct disk_device_details details_le;
  753. /*
  754. * If the device is already open, return it.
  755. */
  756. list_for_each_entry(td2, &pmd->thin_devices, list)
  757. if (td2->id == dev) {
  758. /*
  759. * May not create an already-open device.
  760. */
  761. if (create)
  762. return -EEXIST;
  763. td2->open_count++;
  764. *td = td2;
  765. return 0;
  766. }
  767. /*
  768. * Check the device exists.
  769. */
  770. r = dm_btree_lookup(&pmd->details_info, pmd->details_root,
  771. &key, &details_le);
  772. if (r) {
  773. if (r != -ENODATA || !create)
  774. return r;
  775. /*
  776. * Create new device.
  777. */
  778. changed = 1;
  779. details_le.mapped_blocks = 0;
  780. details_le.transaction_id = cpu_to_le64(pmd->trans_id);
  781. details_le.creation_time = cpu_to_le32(pmd->time);
  782. details_le.snapshotted_time = cpu_to_le32(pmd->time);
  783. }
  784. *td = kmalloc(sizeof(**td), GFP_NOIO);
  785. if (!*td)
  786. return -ENOMEM;
  787. (*td)->pmd = pmd;
  788. (*td)->id = dev;
  789. (*td)->open_count = 1;
  790. (*td)->changed = changed;
  791. (*td)->aborted_with_changes = false;
  792. (*td)->mapped_blocks = le64_to_cpu(details_le.mapped_blocks);
  793. (*td)->transaction_id = le64_to_cpu(details_le.transaction_id);
  794. (*td)->creation_time = le32_to_cpu(details_le.creation_time);
  795. (*td)->snapshotted_time = le32_to_cpu(details_le.snapshotted_time);
  796. list_add(&(*td)->list, &pmd->thin_devices);
  797. return 0;
  798. }
  799. static void __close_device(struct dm_thin_device *td)
  800. {
  801. --td->open_count;
  802. }
  803. static int __create_thin(struct dm_pool_metadata *pmd,
  804. dm_thin_id dev)
  805. {
  806. int r;
  807. dm_block_t dev_root;
  808. uint64_t key = dev;
  809. struct disk_device_details details_le;
  810. struct dm_thin_device *td;
  811. __le64 value;
  812. r = dm_btree_lookup(&pmd->details_info, pmd->details_root,
  813. &key, &details_le);
  814. if (!r)
  815. return -EEXIST;
  816. /*
  817. * Create an empty btree for the mappings.
  818. */
  819. r = dm_btree_empty(&pmd->bl_info, &dev_root);
  820. if (r)
  821. return r;
  822. /*
  823. * Insert it into the main mapping tree.
  824. */
  825. value = cpu_to_le64(dev_root);
  826. __dm_bless_for_disk(&value);
  827. r = dm_btree_insert(&pmd->tl_info, pmd->root, &key, &value, &pmd->root);
  828. if (r) {
  829. dm_btree_del(&pmd->bl_info, dev_root);
  830. return r;
  831. }
  832. r = __open_device(pmd, dev, 1, &td);
  833. if (r) {
  834. dm_btree_remove(&pmd->tl_info, pmd->root, &key, &pmd->root);
  835. dm_btree_del(&pmd->bl_info, dev_root);
  836. return r;
  837. }
  838. __close_device(td);
  839. return r;
  840. }
  841. int dm_pool_create_thin(struct dm_pool_metadata *pmd, dm_thin_id dev)
  842. {
  843. int r = -EINVAL;
  844. down_write(&pmd->root_lock);
  845. if (!pmd->fail_io)
  846. r = __create_thin(pmd, dev);
  847. up_write(&pmd->root_lock);
  848. return r;
  849. }
  850. static int __set_snapshot_details(struct dm_pool_metadata *pmd,
  851. struct dm_thin_device *snap,
  852. dm_thin_id origin, uint32_t time)
  853. {
  854. int r;
  855. struct dm_thin_device *td;
  856. r = __open_device(pmd, origin, 0, &td);
  857. if (r)
  858. return r;
  859. td->changed = 1;
  860. td->snapshotted_time = time;
  861. snap->mapped_blocks = td->mapped_blocks;
  862. snap->snapshotted_time = time;
  863. __close_device(td);
  864. return 0;
  865. }
  866. static int __create_snap(struct dm_pool_metadata *pmd,
  867. dm_thin_id dev, dm_thin_id origin)
  868. {
  869. int r;
  870. dm_block_t origin_root;
  871. uint64_t key = origin, dev_key = dev;
  872. struct dm_thin_device *td;
  873. struct disk_device_details details_le;
  874. __le64 value;
  875. /* check this device is unused */
  876. r = dm_btree_lookup(&pmd->details_info, pmd->details_root,
  877. &dev_key, &details_le);
  878. if (!r)
  879. return -EEXIST;
  880. /* find the mapping tree for the origin */
  881. r = dm_btree_lookup(&pmd->tl_info, pmd->root, &key, &value);
  882. if (r)
  883. return r;
  884. origin_root = le64_to_cpu(value);
  885. /* clone the origin, an inc will do */
  886. dm_tm_inc(pmd->tm, origin_root);
  887. /* insert into the main mapping tree */
  888. value = cpu_to_le64(origin_root);
  889. __dm_bless_for_disk(&value);
  890. key = dev;
  891. r = dm_btree_insert(&pmd->tl_info, pmd->root, &key, &value, &pmd->root);
  892. if (r) {
  893. dm_tm_dec(pmd->tm, origin_root);
  894. return r;
  895. }
  896. pmd->time++;
  897. r = __open_device(pmd, dev, 1, &td);
  898. if (r)
  899. goto bad;
  900. r = __set_snapshot_details(pmd, td, origin, pmd->time);
  901. __close_device(td);
  902. if (r)
  903. goto bad;
  904. return 0;
  905. bad:
  906. dm_btree_remove(&pmd->tl_info, pmd->root, &key, &pmd->root);
  907. dm_btree_remove(&pmd->details_info, pmd->details_root,
  908. &key, &pmd->details_root);
  909. return r;
  910. }
  911. int dm_pool_create_snap(struct dm_pool_metadata *pmd,
  912. dm_thin_id dev,
  913. dm_thin_id origin)
  914. {
  915. int r = -EINVAL;
  916. down_write(&pmd->root_lock);
  917. if (!pmd->fail_io)
  918. r = __create_snap(pmd, dev, origin);
  919. up_write(&pmd->root_lock);
  920. return r;
  921. }
  922. static int __delete_device(struct dm_pool_metadata *pmd, dm_thin_id dev)
  923. {
  924. int r;
  925. uint64_t key = dev;
  926. struct dm_thin_device *td;
  927. /* TODO: failure should mark the transaction invalid */
  928. r = __open_device(pmd, dev, 0, &td);
  929. if (r)
  930. return r;
  931. if (td->open_count > 1) {
  932. __close_device(td);
  933. return -EBUSY;
  934. }
  935. list_del(&td->list);
  936. kfree(td);
  937. r = dm_btree_remove(&pmd->details_info, pmd->details_root,
  938. &key, &pmd->details_root);
  939. if (r)
  940. return r;
  941. r = dm_btree_remove(&pmd->tl_info, pmd->root, &key, &pmd->root);
  942. if (r)
  943. return r;
  944. return 0;
  945. }
  946. int dm_pool_delete_thin_device(struct dm_pool_metadata *pmd,
  947. dm_thin_id dev)
  948. {
  949. int r = -EINVAL;
  950. down_write(&pmd->root_lock);
  951. if (!pmd->fail_io)
  952. r = __delete_device(pmd, dev);
  953. up_write(&pmd->root_lock);
  954. return r;
  955. }
  956. int dm_pool_set_metadata_transaction_id(struct dm_pool_metadata *pmd,
  957. uint64_t current_id,
  958. uint64_t new_id)
  959. {
  960. int r = -EINVAL;
  961. down_write(&pmd->root_lock);
  962. if (pmd->fail_io)
  963. goto out;
  964. if (pmd->trans_id != current_id) {
  965. DMERR("mismatched transaction id");
  966. goto out;
  967. }
  968. pmd->trans_id = new_id;
  969. r = 0;
  970. out:
  971. up_write(&pmd->root_lock);
  972. return r;
  973. }
  974. int dm_pool_get_metadata_transaction_id(struct dm_pool_metadata *pmd,
  975. uint64_t *result)
  976. {
  977. int r = -EINVAL;
  978. down_read(&pmd->root_lock);
  979. if (!pmd->fail_io) {
  980. *result = pmd->trans_id;
  981. r = 0;
  982. }
  983. up_read(&pmd->root_lock);
  984. return r;
  985. }
  986. static int __reserve_metadata_snap(struct dm_pool_metadata *pmd)
  987. {
  988. int r, inc;
  989. struct thin_disk_superblock *disk_super;
  990. struct dm_block *copy, *sblock;
  991. dm_block_t held_root;
  992. /*
  993. * We commit to ensure the btree roots which we increment in a
  994. * moment are up to date.
  995. */
  996. __commit_transaction(pmd);
  997. /*
  998. * Copy the superblock.
  999. */
  1000. dm_sm_inc_block(pmd->metadata_sm, THIN_SUPERBLOCK_LOCATION);
  1001. r = dm_tm_shadow_block(pmd->tm, THIN_SUPERBLOCK_LOCATION,
  1002. &sb_validator, &copy, &inc);
  1003. if (r)
  1004. return r;
  1005. BUG_ON(!inc);
  1006. held_root = dm_block_location(copy);
  1007. disk_super = dm_block_data(copy);
  1008. if (le64_to_cpu(disk_super->held_root)) {
  1009. DMWARN("Pool metadata snapshot already exists: release this before taking another.");
  1010. dm_tm_dec(pmd->tm, held_root);
  1011. dm_tm_unlock(pmd->tm, copy);
  1012. return -EBUSY;
  1013. }
  1014. /*
  1015. * Wipe the spacemap since we're not publishing this.
  1016. */
  1017. memset(&disk_super->data_space_map_root, 0,
  1018. sizeof(disk_super->data_space_map_root));
  1019. memset(&disk_super->metadata_space_map_root, 0,
  1020. sizeof(disk_super->metadata_space_map_root));
  1021. /*
  1022. * Increment the data structures that need to be preserved.
  1023. */
  1024. dm_tm_inc(pmd->tm, le64_to_cpu(disk_super->data_mapping_root));
  1025. dm_tm_inc(pmd->tm, le64_to_cpu(disk_super->device_details_root));
  1026. dm_tm_unlock(pmd->tm, copy);
  1027. /*
  1028. * Write the held root into the superblock.
  1029. */
  1030. r = superblock_lock(pmd, &sblock);
  1031. if (r) {
  1032. dm_tm_dec(pmd->tm, held_root);
  1033. return r;
  1034. }
  1035. disk_super = dm_block_data(sblock);
  1036. disk_super->held_root = cpu_to_le64(held_root);
  1037. dm_bm_unlock(sblock);
  1038. return 0;
  1039. }
  1040. int dm_pool_reserve_metadata_snap(struct dm_pool_metadata *pmd)
  1041. {
  1042. int r = -EINVAL;
  1043. down_write(&pmd->root_lock);
  1044. if (!pmd->fail_io)
  1045. r = __reserve_metadata_snap(pmd);
  1046. up_write(&pmd->root_lock);
  1047. return r;
  1048. }
  1049. static int __release_metadata_snap(struct dm_pool_metadata *pmd)
  1050. {
  1051. int r;
  1052. struct thin_disk_superblock *disk_super;
  1053. struct dm_block *sblock, *copy;
  1054. dm_block_t held_root;
  1055. r = superblock_lock(pmd, &sblock);
  1056. if (r)
  1057. return r;
  1058. disk_super = dm_block_data(sblock);
  1059. held_root = le64_to_cpu(disk_super->held_root);
  1060. disk_super->held_root = cpu_to_le64(0);
  1061. dm_bm_unlock(sblock);
  1062. if (!held_root) {
  1063. DMWARN("No pool metadata snapshot found: nothing to release.");
  1064. return -EINVAL;
  1065. }
  1066. r = dm_tm_read_lock(pmd->tm, held_root, &sb_validator, &copy);
  1067. if (r)
  1068. return r;
  1069. disk_super = dm_block_data(copy);
  1070. dm_btree_del(&pmd->info, le64_to_cpu(disk_super->data_mapping_root));
  1071. dm_btree_del(&pmd->details_info, le64_to_cpu(disk_super->device_details_root));
  1072. dm_sm_dec_block(pmd->metadata_sm, held_root);
  1073. dm_tm_unlock(pmd->tm, copy);
  1074. return 0;
  1075. }
  1076. int dm_pool_release_metadata_snap(struct dm_pool_metadata *pmd)
  1077. {
  1078. int r = -EINVAL;
  1079. down_write(&pmd->root_lock);
  1080. if (!pmd->fail_io)
  1081. r = __release_metadata_snap(pmd);
  1082. up_write(&pmd->root_lock);
  1083. return r;
  1084. }
  1085. static int __get_metadata_snap(struct dm_pool_metadata *pmd,
  1086. dm_block_t *result)
  1087. {
  1088. int r;
  1089. struct thin_disk_superblock *disk_super;
  1090. struct dm_block *sblock;
  1091. r = dm_bm_read_lock(pmd->bm, THIN_SUPERBLOCK_LOCATION,
  1092. &sb_validator, &sblock);
  1093. if (r)
  1094. return r;
  1095. disk_super = dm_block_data(sblock);
  1096. *result = le64_to_cpu(disk_super->held_root);
  1097. dm_bm_unlock(sblock);
  1098. return 0;
  1099. }
  1100. int dm_pool_get_metadata_snap(struct dm_pool_metadata *pmd,
  1101. dm_block_t *result)
  1102. {
  1103. int r = -EINVAL;
  1104. down_read(&pmd->root_lock);
  1105. if (!pmd->fail_io)
  1106. r = __get_metadata_snap(pmd, result);
  1107. up_read(&pmd->root_lock);
  1108. return r;
  1109. }
  1110. int dm_pool_open_thin_device(struct dm_pool_metadata *pmd, dm_thin_id dev,
  1111. struct dm_thin_device **td)
  1112. {
  1113. int r = -EINVAL;
  1114. down_write(&pmd->root_lock);
  1115. if (!pmd->fail_io)
  1116. r = __open_device(pmd, dev, 0, td);
  1117. up_write(&pmd->root_lock);
  1118. return r;
  1119. }
  1120. int dm_pool_close_thin_device(struct dm_thin_device *td)
  1121. {
  1122. down_write(&td->pmd->root_lock);
  1123. __close_device(td);
  1124. up_write(&td->pmd->root_lock);
  1125. return 0;
  1126. }
  1127. dm_thin_id dm_thin_dev_id(struct dm_thin_device *td)
  1128. {
  1129. return td->id;
  1130. }
  1131. /*
  1132. * Check whether @time (of block creation) is older than @td's last snapshot.
  1133. * If so then the associated block is shared with the last snapshot device.
  1134. * Any block on a device created *after* the device last got snapshotted is
  1135. * necessarily not shared.
  1136. */
  1137. static bool __snapshotted_since(struct dm_thin_device *td, uint32_t time)
  1138. {
  1139. return td->snapshotted_time > time;
  1140. }
  1141. static void unpack_lookup_result(struct dm_thin_device *td, __le64 value,
  1142. struct dm_thin_lookup_result *result)
  1143. {
  1144. uint64_t block_time = 0;
  1145. dm_block_t exception_block;
  1146. uint32_t exception_time;
  1147. block_time = le64_to_cpu(value);
  1148. unpack_block_time(block_time, &exception_block, &exception_time);
  1149. result->block = exception_block;
  1150. result->shared = __snapshotted_since(td, exception_time);
  1151. }
  1152. static int __find_block(struct dm_thin_device *td, dm_block_t block,
  1153. int can_issue_io, struct dm_thin_lookup_result *result)
  1154. {
  1155. int r;
  1156. __le64 value;
  1157. struct dm_pool_metadata *pmd = td->pmd;
  1158. dm_block_t keys[2] = { td->id, block };
  1159. struct dm_btree_info *info;
  1160. if (can_issue_io) {
  1161. info = &pmd->info;
  1162. } else
  1163. info = &pmd->nb_info;
  1164. r = dm_btree_lookup(info, pmd->root, keys, &value);
  1165. if (!r)
  1166. unpack_lookup_result(td, value, result);
  1167. return r;
  1168. }
  1169. int dm_thin_find_block(struct dm_thin_device *td, dm_block_t block,
  1170. int can_issue_io, struct dm_thin_lookup_result *result)
  1171. {
  1172. int r;
  1173. struct dm_pool_metadata *pmd = td->pmd;
  1174. down_read(&pmd->root_lock);
  1175. if (pmd->fail_io) {
  1176. up_read(&pmd->root_lock);
  1177. return -EINVAL;
  1178. }
  1179. r = __find_block(td, block, can_issue_io, result);
  1180. up_read(&pmd->root_lock);
  1181. return r;
  1182. }
  1183. static int __find_next_mapped_block(struct dm_thin_device *td, dm_block_t block,
  1184. dm_block_t *vblock,
  1185. struct dm_thin_lookup_result *result)
  1186. {
  1187. int r;
  1188. __le64 value;
  1189. struct dm_pool_metadata *pmd = td->pmd;
  1190. dm_block_t keys[2] = { td->id, block };
  1191. r = dm_btree_lookup_next(&pmd->info, pmd->root, keys, vblock, &value);
  1192. if (!r)
  1193. unpack_lookup_result(td, value, result);
  1194. return r;
  1195. }
  1196. static int __find_mapped_range(struct dm_thin_device *td,
  1197. dm_block_t begin, dm_block_t end,
  1198. dm_block_t *thin_begin, dm_block_t *thin_end,
  1199. dm_block_t *pool_begin, bool *maybe_shared)
  1200. {
  1201. int r;
  1202. dm_block_t pool_end;
  1203. struct dm_thin_lookup_result lookup;
  1204. if (end < begin)
  1205. return -ENODATA;
  1206. r = __find_next_mapped_block(td, begin, &begin, &lookup);
  1207. if (r)
  1208. return r;
  1209. if (begin >= end)
  1210. return -ENODATA;
  1211. *thin_begin = begin;
  1212. *pool_begin = lookup.block;
  1213. *maybe_shared = lookup.shared;
  1214. begin++;
  1215. pool_end = *pool_begin + 1;
  1216. while (begin != end) {
  1217. r = __find_block(td, begin, true, &lookup);
  1218. if (r) {
  1219. if (r == -ENODATA)
  1220. break;
  1221. else
  1222. return r;
  1223. }
  1224. if ((lookup.block != pool_end) ||
  1225. (lookup.shared != *maybe_shared))
  1226. break;
  1227. pool_end++;
  1228. begin++;
  1229. }
  1230. *thin_end = begin;
  1231. return 0;
  1232. }
  1233. int dm_thin_find_mapped_range(struct dm_thin_device *td,
  1234. dm_block_t begin, dm_block_t end,
  1235. dm_block_t *thin_begin, dm_block_t *thin_end,
  1236. dm_block_t *pool_begin, bool *maybe_shared)
  1237. {
  1238. int r = -EINVAL;
  1239. struct dm_pool_metadata *pmd = td->pmd;
  1240. down_read(&pmd->root_lock);
  1241. if (!pmd->fail_io) {
  1242. r = __find_mapped_range(td, begin, end, thin_begin, thin_end,
  1243. pool_begin, maybe_shared);
  1244. }
  1245. up_read(&pmd->root_lock);
  1246. return r;
  1247. }
  1248. static int __insert(struct dm_thin_device *td, dm_block_t block,
  1249. dm_block_t data_block)
  1250. {
  1251. int r, inserted;
  1252. __le64 value;
  1253. struct dm_pool_metadata *pmd = td->pmd;
  1254. dm_block_t keys[2] = { td->id, block };
  1255. value = cpu_to_le64(pack_block_time(data_block, pmd->time));
  1256. __dm_bless_for_disk(&value);
  1257. r = dm_btree_insert_notify(&pmd->info, pmd->root, keys, &value,
  1258. &pmd->root, &inserted);
  1259. if (r)
  1260. return r;
  1261. td->changed = 1;
  1262. if (inserted)
  1263. td->mapped_blocks++;
  1264. return 0;
  1265. }
  1266. int dm_thin_insert_block(struct dm_thin_device *td, dm_block_t block,
  1267. dm_block_t data_block)
  1268. {
  1269. int r = -EINVAL;
  1270. down_write(&td->pmd->root_lock);
  1271. if (!td->pmd->fail_io)
  1272. r = __insert(td, block, data_block);
  1273. up_write(&td->pmd->root_lock);
  1274. return r;
  1275. }
  1276. static int __remove(struct dm_thin_device *td, dm_block_t block)
  1277. {
  1278. int r;
  1279. struct dm_pool_metadata *pmd = td->pmd;
  1280. dm_block_t keys[2] = { td->id, block };
  1281. r = dm_btree_remove(&pmd->info, pmd->root, keys, &pmd->root);
  1282. if (r)
  1283. return r;
  1284. td->mapped_blocks--;
  1285. td->changed = 1;
  1286. return 0;
  1287. }
  1288. static int __remove_range(struct dm_thin_device *td, dm_block_t begin, dm_block_t end)
  1289. {
  1290. int r;
  1291. unsigned count, total_count = 0;
  1292. struct dm_pool_metadata *pmd = td->pmd;
  1293. dm_block_t keys[1] = { td->id };
  1294. __le64 value;
  1295. dm_block_t mapping_root;
  1296. /*
  1297. * Find the mapping tree
  1298. */
  1299. r = dm_btree_lookup(&pmd->tl_info, pmd->root, keys, &value);
  1300. if (r)
  1301. return r;
  1302. /*
  1303. * Remove from the mapping tree, taking care to inc the
  1304. * ref count so it doesn't get deleted.
  1305. */
  1306. mapping_root = le64_to_cpu(value);
  1307. dm_tm_inc(pmd->tm, mapping_root);
  1308. r = dm_btree_remove(&pmd->tl_info, pmd->root, keys, &pmd->root);
  1309. if (r)
  1310. return r;
  1311. /*
  1312. * Remove leaves stops at the first unmapped entry, so we have to
  1313. * loop round finding mapped ranges.
  1314. */
  1315. while (begin < end) {
  1316. r = dm_btree_lookup_next(&pmd->bl_info, mapping_root, &begin, &begin, &value);
  1317. if (r == -ENODATA)
  1318. break;
  1319. if (r)
  1320. return r;
  1321. if (begin >= end)
  1322. break;
  1323. r = dm_btree_remove_leaves(&pmd->bl_info, mapping_root, &begin, end, &mapping_root, &count);
  1324. if (r)
  1325. return r;
  1326. total_count += count;
  1327. }
  1328. td->mapped_blocks -= total_count;
  1329. td->changed = 1;
  1330. /*
  1331. * Reinsert the mapping tree.
  1332. */
  1333. value = cpu_to_le64(mapping_root);
  1334. __dm_bless_for_disk(&value);
  1335. return dm_btree_insert(&pmd->tl_info, pmd->root, keys, &value, &pmd->root);
  1336. }
  1337. int dm_thin_remove_block(struct dm_thin_device *td, dm_block_t block)
  1338. {
  1339. int r = -EINVAL;
  1340. down_write(&td->pmd->root_lock);
  1341. if (!td->pmd->fail_io)
  1342. r = __remove(td, block);
  1343. up_write(&td->pmd->root_lock);
  1344. return r;
  1345. }
  1346. int dm_thin_remove_range(struct dm_thin_device *td,
  1347. dm_block_t begin, dm_block_t end)
  1348. {
  1349. int r = -EINVAL;
  1350. down_write(&td->pmd->root_lock);
  1351. if (!td->pmd->fail_io)
  1352. r = __remove_range(td, begin, end);
  1353. up_write(&td->pmd->root_lock);
  1354. return r;
  1355. }
  1356. int dm_pool_block_is_used(struct dm_pool_metadata *pmd, dm_block_t b, bool *result)
  1357. {
  1358. int r;
  1359. uint32_t ref_count;
  1360. down_read(&pmd->root_lock);
  1361. r = dm_sm_get_count(pmd->data_sm, b, &ref_count);
  1362. if (!r)
  1363. *result = (ref_count != 0);
  1364. up_read(&pmd->root_lock);
  1365. return r;
  1366. }
  1367. int dm_pool_inc_data_range(struct dm_pool_metadata *pmd, dm_block_t b, dm_block_t e)
  1368. {
  1369. int r = 0;
  1370. down_write(&pmd->root_lock);
  1371. for (; b != e; b++) {
  1372. r = dm_sm_inc_block(pmd->data_sm, b);
  1373. if (r)
  1374. break;
  1375. }
  1376. up_write(&pmd->root_lock);
  1377. return r;
  1378. }
  1379. int dm_pool_dec_data_range(struct dm_pool_metadata *pmd, dm_block_t b, dm_block_t e)
  1380. {
  1381. int r = 0;
  1382. down_write(&pmd->root_lock);
  1383. for (; b != e; b++) {
  1384. r = dm_sm_dec_block(pmd->data_sm, b);
  1385. if (r)
  1386. break;
  1387. }
  1388. up_write(&pmd->root_lock);
  1389. return r;
  1390. }
  1391. bool dm_thin_changed_this_transaction(struct dm_thin_device *td)
  1392. {
  1393. int r;
  1394. down_read(&td->pmd->root_lock);
  1395. r = td->changed;
  1396. up_read(&td->pmd->root_lock);
  1397. return r;
  1398. }
  1399. bool dm_pool_changed_this_transaction(struct dm_pool_metadata *pmd)
  1400. {
  1401. bool r = false;
  1402. struct dm_thin_device *td, *tmp;
  1403. down_read(&pmd->root_lock);
  1404. list_for_each_entry_safe(td, tmp, &pmd->thin_devices, list) {
  1405. if (td->changed) {
  1406. r = td->changed;
  1407. break;
  1408. }
  1409. }
  1410. up_read(&pmd->root_lock);
  1411. return r;
  1412. }
  1413. bool dm_thin_aborted_changes(struct dm_thin_device *td)
  1414. {
  1415. bool r;
  1416. down_read(&td->pmd->root_lock);
  1417. r = td->aborted_with_changes;
  1418. up_read(&td->pmd->root_lock);
  1419. return r;
  1420. }
  1421. int dm_pool_alloc_data_block(struct dm_pool_metadata *pmd, dm_block_t *result)
  1422. {
  1423. int r = -EINVAL;
  1424. down_write(&pmd->root_lock);
  1425. if (!pmd->fail_io)
  1426. r = dm_sm_new_block(pmd->data_sm, result);
  1427. up_write(&pmd->root_lock);
  1428. return r;
  1429. }
  1430. int dm_pool_commit_metadata(struct dm_pool_metadata *pmd)
  1431. {
  1432. int r = -EINVAL;
  1433. down_write(&pmd->root_lock);
  1434. if (pmd->fail_io)
  1435. goto out;
  1436. r = __commit_transaction(pmd);
  1437. if (r <= 0)
  1438. goto out;
  1439. /*
  1440. * Open the next transaction.
  1441. */
  1442. r = __begin_transaction(pmd);
  1443. out:
  1444. up_write(&pmd->root_lock);
  1445. return r;
  1446. }
  1447. static void __set_abort_with_changes_flags(struct dm_pool_metadata *pmd)
  1448. {
  1449. struct dm_thin_device *td;
  1450. list_for_each_entry(td, &pmd->thin_devices, list)
  1451. td->aborted_with_changes = td->changed;
  1452. }
  1453. int dm_pool_abort_metadata(struct dm_pool_metadata *pmd)
  1454. {
  1455. int r = -EINVAL;
  1456. down_write(&pmd->root_lock);
  1457. if (pmd->fail_io)
  1458. goto out;
  1459. __set_abort_with_changes_flags(pmd);
  1460. __destroy_persistent_data_objects(pmd);
  1461. r = __create_persistent_data_objects(pmd, false);
  1462. if (r)
  1463. pmd->fail_io = true;
  1464. out:
  1465. up_write(&pmd->root_lock);
  1466. return r;
  1467. }
  1468. int dm_pool_get_free_block_count(struct dm_pool_metadata *pmd, dm_block_t *result)
  1469. {
  1470. int r = -EINVAL;
  1471. down_read(&pmd->root_lock);
  1472. if (!pmd->fail_io)
  1473. r = dm_sm_get_nr_free(pmd->data_sm, result);
  1474. up_read(&pmd->root_lock);
  1475. return r;
  1476. }
  1477. int dm_pool_get_free_metadata_block_count(struct dm_pool_metadata *pmd,
  1478. dm_block_t *result)
  1479. {
  1480. int r = -EINVAL;
  1481. down_read(&pmd->root_lock);
  1482. if (!pmd->fail_io)
  1483. r = dm_sm_get_nr_free(pmd->metadata_sm, result);
  1484. up_read(&pmd->root_lock);
  1485. return r;
  1486. }
  1487. int dm_pool_get_metadata_dev_size(struct dm_pool_metadata *pmd,
  1488. dm_block_t *result)
  1489. {
  1490. int r = -EINVAL;
  1491. down_read(&pmd->root_lock);
  1492. if (!pmd->fail_io)
  1493. r = dm_sm_get_nr_blocks(pmd->metadata_sm, result);
  1494. up_read(&pmd->root_lock);
  1495. return r;
  1496. }
  1497. int dm_pool_get_data_dev_size(struct dm_pool_metadata *pmd, dm_block_t *result)
  1498. {
  1499. int r = -EINVAL;
  1500. down_read(&pmd->root_lock);
  1501. if (!pmd->fail_io)
  1502. r = dm_sm_get_nr_blocks(pmd->data_sm, result);
  1503. up_read(&pmd->root_lock);
  1504. return r;
  1505. }
  1506. int dm_thin_get_mapped_count(struct dm_thin_device *td, dm_block_t *result)
  1507. {
  1508. int r = -EINVAL;
  1509. struct dm_pool_metadata *pmd = td->pmd;
  1510. down_read(&pmd->root_lock);
  1511. if (!pmd->fail_io) {
  1512. *result = td->mapped_blocks;
  1513. r = 0;
  1514. }
  1515. up_read(&pmd->root_lock);
  1516. return r;
  1517. }
  1518. static int __highest_block(struct dm_thin_device *td, dm_block_t *result)
  1519. {
  1520. int r;
  1521. __le64 value_le;
  1522. dm_block_t thin_root;
  1523. struct dm_pool_metadata *pmd = td->pmd;
  1524. r = dm_btree_lookup(&pmd->tl_info, pmd->root, &td->id, &value_le);
  1525. if (r)
  1526. return r;
  1527. thin_root = le64_to_cpu(value_le);
  1528. return dm_btree_find_highest_key(&pmd->bl_info, thin_root, result);
  1529. }
  1530. int dm_thin_get_highest_mapped_block(struct dm_thin_device *td,
  1531. dm_block_t *result)
  1532. {
  1533. int r = -EINVAL;
  1534. struct dm_pool_metadata *pmd = td->pmd;
  1535. down_read(&pmd->root_lock);
  1536. if (!pmd->fail_io)
  1537. r = __highest_block(td, result);
  1538. up_read(&pmd->root_lock);
  1539. return r;
  1540. }
  1541. static int __resize_space_map(struct dm_space_map *sm, dm_block_t new_count)
  1542. {
  1543. int r;
  1544. dm_block_t old_count;
  1545. r = dm_sm_get_nr_blocks(sm, &old_count);
  1546. if (r)
  1547. return r;
  1548. if (new_count == old_count)
  1549. return 0;
  1550. if (new_count < old_count) {
  1551. DMERR("cannot reduce size of space map");
  1552. return -EINVAL;
  1553. }
  1554. return dm_sm_extend(sm, new_count - old_count);
  1555. }
  1556. int dm_pool_resize_data_dev(struct dm_pool_metadata *pmd, dm_block_t new_count)
  1557. {
  1558. int r = -EINVAL;
  1559. down_write(&pmd->root_lock);
  1560. if (!pmd->fail_io)
  1561. r = __resize_space_map(pmd->data_sm, new_count);
  1562. up_write(&pmd->root_lock);
  1563. return r;
  1564. }
  1565. int dm_pool_resize_metadata_dev(struct dm_pool_metadata *pmd, dm_block_t new_count)
  1566. {
  1567. int r = -EINVAL;
  1568. down_write(&pmd->root_lock);
  1569. if (!pmd->fail_io)
  1570. r = __resize_space_map(pmd->metadata_sm, new_count);
  1571. up_write(&pmd->root_lock);
  1572. return r;
  1573. }
  1574. void dm_pool_metadata_read_only(struct dm_pool_metadata *pmd)
  1575. {
  1576. down_write(&pmd->root_lock);
  1577. dm_bm_set_read_only(pmd->bm);
  1578. up_write(&pmd->root_lock);
  1579. }
  1580. void dm_pool_metadata_read_write(struct dm_pool_metadata *pmd)
  1581. {
  1582. down_write(&pmd->root_lock);
  1583. dm_bm_set_read_write(pmd->bm);
  1584. up_write(&pmd->root_lock);
  1585. }
  1586. int dm_pool_register_metadata_threshold(struct dm_pool_metadata *pmd,
  1587. dm_block_t threshold,
  1588. dm_sm_threshold_fn fn,
  1589. void *context)
  1590. {
  1591. int r;
  1592. down_write(&pmd->root_lock);
  1593. r = dm_sm_register_threshold_callback(pmd->metadata_sm, threshold, fn, context);
  1594. up_write(&pmd->root_lock);
  1595. return r;
  1596. }
  1597. int dm_pool_metadata_set_needs_check(struct dm_pool_metadata *pmd)
  1598. {
  1599. int r;
  1600. struct dm_block *sblock;
  1601. struct thin_disk_superblock *disk_super;
  1602. down_write(&pmd->root_lock);
  1603. pmd->flags |= THIN_METADATA_NEEDS_CHECK_FLAG;
  1604. r = superblock_lock(pmd, &sblock);
  1605. if (r) {
  1606. DMERR("couldn't read superblock");
  1607. goto out;
  1608. }
  1609. disk_super = dm_block_data(sblock);
  1610. disk_super->flags = cpu_to_le32(pmd->flags);
  1611. dm_bm_unlock(sblock);
  1612. out:
  1613. up_write(&pmd->root_lock);
  1614. return r;
  1615. }
  1616. bool dm_pool_metadata_needs_check(struct dm_pool_metadata *pmd)
  1617. {
  1618. bool needs_check;
  1619. down_read(&pmd->root_lock);
  1620. needs_check = pmd->flags & THIN_METADATA_NEEDS_CHECK_FLAG;
  1621. up_read(&pmd->root_lock);
  1622. return needs_check;
  1623. }
  1624. void dm_pool_issue_prefetches(struct dm_pool_metadata *pmd)
  1625. {
  1626. down_read(&pmd->root_lock);
  1627. if (!pmd->fail_io)
  1628. dm_tm_issue_prefetches(pmd->tm);
  1629. up_read(&pmd->root_lock);
  1630. }