ldm.c 42 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498
  1. // SPDX-License-Identifier: GPL-2.0-or-later
  2. /**
  3. * ldm - Support for Windows Logical Disk Manager (Dynamic Disks)
  4. *
  5. * Copyright (C) 2001,2002 Richard Russon <ldm@flatcap.org>
  6. * Copyright (c) 2001-2012 Anton Altaparmakov
  7. * Copyright (C) 2001,2002 Jakob Kemi <jakob.kemi@telia.com>
  8. *
  9. * Documentation is available at http://www.linux-ntfs.org/doku.php?id=downloads
  10. */
  11. #include <linux/slab.h>
  12. #include <linux/pagemap.h>
  13. #include <linux/stringify.h>
  14. #include <linux/kernel.h>
  15. #include <linux/uuid.h>
  16. #include <linux/msdos_partition.h>
  17. #include "ldm.h"
  18. #include "check.h"
  19. /*
  20. * ldm_debug/info/error/crit - Output an error message
  21. * @f: A printf format string containing the message
  22. * @...: Variables to substitute into @f
  23. *
  24. * ldm_debug() writes a DEBUG level message to the syslog but only if the
  25. * driver was compiled with debug enabled. Otherwise, the call turns into a NOP.
  26. */
  27. #ifndef CONFIG_LDM_DEBUG
  28. #define ldm_debug(...) do {} while (0)
  29. #else
  30. #define ldm_debug(f, a...) _ldm_printk (KERN_DEBUG, __func__, f, ##a)
  31. #endif
  32. #define ldm_crit(f, a...) _ldm_printk (KERN_CRIT, __func__, f, ##a)
  33. #define ldm_error(f, a...) _ldm_printk (KERN_ERR, __func__, f, ##a)
  34. #define ldm_info(f, a...) _ldm_printk (KERN_INFO, __func__, f, ##a)
  35. static __printf(3, 4)
  36. void _ldm_printk(const char *level, const char *function, const char *fmt, ...)
  37. {
  38. struct va_format vaf;
  39. va_list args;
  40. va_start (args, fmt);
  41. vaf.fmt = fmt;
  42. vaf.va = &args;
  43. printk("%s%s(): %pV\n", level, function, &vaf);
  44. va_end(args);
  45. }
  46. /**
  47. * ldm_parse_privhead - Read the LDM Database PRIVHEAD structure
  48. * @data: Raw database PRIVHEAD structure loaded from the device
  49. * @ph: In-memory privhead structure in which to return parsed information
  50. *
  51. * This parses the LDM database PRIVHEAD structure supplied in @data and
  52. * sets up the in-memory privhead structure @ph with the obtained information.
  53. *
  54. * Return: 'true' @ph contains the PRIVHEAD data
  55. * 'false' @ph contents are undefined
  56. */
  57. static bool ldm_parse_privhead(const u8 *data, struct privhead *ph)
  58. {
  59. bool is_vista = false;
  60. BUG_ON(!data || !ph);
  61. if (MAGIC_PRIVHEAD != get_unaligned_be64(data)) {
  62. ldm_error("Cannot find PRIVHEAD structure. LDM database is"
  63. " corrupt. Aborting.");
  64. return false;
  65. }
  66. ph->ver_major = get_unaligned_be16(data + 0x000C);
  67. ph->ver_minor = get_unaligned_be16(data + 0x000E);
  68. ph->logical_disk_start = get_unaligned_be64(data + 0x011B);
  69. ph->logical_disk_size = get_unaligned_be64(data + 0x0123);
  70. ph->config_start = get_unaligned_be64(data + 0x012B);
  71. ph->config_size = get_unaligned_be64(data + 0x0133);
  72. /* Version 2.11 is Win2k/XP and version 2.12 is Vista. */
  73. if (ph->ver_major == 2 && ph->ver_minor == 12)
  74. is_vista = true;
  75. if (!is_vista && (ph->ver_major != 2 || ph->ver_minor != 11)) {
  76. ldm_error("Expected PRIVHEAD version 2.11 or 2.12, got %d.%d."
  77. " Aborting.", ph->ver_major, ph->ver_minor);
  78. return false;
  79. }
  80. ldm_debug("PRIVHEAD version %d.%d (Windows %s).", ph->ver_major,
  81. ph->ver_minor, is_vista ? "Vista" : "2000/XP");
  82. if (ph->config_size != LDM_DB_SIZE) { /* 1 MiB in sectors. */
  83. /* Warn the user and continue, carefully. */
  84. ldm_info("Database is normally %u bytes, it claims to "
  85. "be %llu bytes.", LDM_DB_SIZE,
  86. (unsigned long long)ph->config_size);
  87. }
  88. if ((ph->logical_disk_size == 0) || (ph->logical_disk_start +
  89. ph->logical_disk_size > ph->config_start)) {
  90. ldm_error("PRIVHEAD disk size doesn't match real disk size");
  91. return false;
  92. }
  93. if (uuid_parse(data + 0x0030, &ph->disk_id)) {
  94. ldm_error("PRIVHEAD contains an invalid GUID.");
  95. return false;
  96. }
  97. ldm_debug("Parsed PRIVHEAD successfully.");
  98. return true;
  99. }
  100. /**
  101. * ldm_parse_tocblock - Read the LDM Database TOCBLOCK structure
  102. * @data: Raw database TOCBLOCK structure loaded from the device
  103. * @toc: In-memory toc structure in which to return parsed information
  104. *
  105. * This parses the LDM Database TOCBLOCK (table of contents) structure supplied
  106. * in @data and sets up the in-memory tocblock structure @toc with the obtained
  107. * information.
  108. *
  109. * N.B. The *_start and *_size values returned in @toc are not range-checked.
  110. *
  111. * Return: 'true' @toc contains the TOCBLOCK data
  112. * 'false' @toc contents are undefined
  113. */
  114. static bool ldm_parse_tocblock (const u8 *data, struct tocblock *toc)
  115. {
  116. BUG_ON (!data || !toc);
  117. if (MAGIC_TOCBLOCK != get_unaligned_be64(data)) {
  118. ldm_crit ("Cannot find TOCBLOCK, database may be corrupt.");
  119. return false;
  120. }
  121. strncpy (toc->bitmap1_name, data + 0x24, sizeof (toc->bitmap1_name));
  122. toc->bitmap1_name[sizeof (toc->bitmap1_name) - 1] = 0;
  123. toc->bitmap1_start = get_unaligned_be64(data + 0x2E);
  124. toc->bitmap1_size = get_unaligned_be64(data + 0x36);
  125. if (strncmp (toc->bitmap1_name, TOC_BITMAP1,
  126. sizeof (toc->bitmap1_name)) != 0) {
  127. ldm_crit ("TOCBLOCK's first bitmap is '%s', should be '%s'.",
  128. TOC_BITMAP1, toc->bitmap1_name);
  129. return false;
  130. }
  131. strncpy (toc->bitmap2_name, data + 0x46, sizeof (toc->bitmap2_name));
  132. toc->bitmap2_name[sizeof (toc->bitmap2_name) - 1] = 0;
  133. toc->bitmap2_start = get_unaligned_be64(data + 0x50);
  134. toc->bitmap2_size = get_unaligned_be64(data + 0x58);
  135. if (strncmp (toc->bitmap2_name, TOC_BITMAP2,
  136. sizeof (toc->bitmap2_name)) != 0) {
  137. ldm_crit ("TOCBLOCK's second bitmap is '%s', should be '%s'.",
  138. TOC_BITMAP2, toc->bitmap2_name);
  139. return false;
  140. }
  141. ldm_debug ("Parsed TOCBLOCK successfully.");
  142. return true;
  143. }
  144. /**
  145. * ldm_parse_vmdb - Read the LDM Database VMDB structure
  146. * @data: Raw database VMDB structure loaded from the device
  147. * @vm: In-memory vmdb structure in which to return parsed information
  148. *
  149. * This parses the LDM Database VMDB structure supplied in @data and sets up
  150. * the in-memory vmdb structure @vm with the obtained information.
  151. *
  152. * N.B. The *_start, *_size and *_seq values will be range-checked later.
  153. *
  154. * Return: 'true' @vm contains VMDB info
  155. * 'false' @vm contents are undefined
  156. */
  157. static bool ldm_parse_vmdb (const u8 *data, struct vmdb *vm)
  158. {
  159. BUG_ON (!data || !vm);
  160. if (MAGIC_VMDB != get_unaligned_be32(data)) {
  161. ldm_crit ("Cannot find the VMDB, database may be corrupt.");
  162. return false;
  163. }
  164. vm->ver_major = get_unaligned_be16(data + 0x12);
  165. vm->ver_minor = get_unaligned_be16(data + 0x14);
  166. if ((vm->ver_major != 4) || (vm->ver_minor != 10)) {
  167. ldm_error ("Expected VMDB version %d.%d, got %d.%d. "
  168. "Aborting.", 4, 10, vm->ver_major, vm->ver_minor);
  169. return false;
  170. }
  171. vm->vblk_size = get_unaligned_be32(data + 0x08);
  172. if (vm->vblk_size == 0) {
  173. ldm_error ("Illegal VBLK size");
  174. return false;
  175. }
  176. vm->vblk_offset = get_unaligned_be32(data + 0x0C);
  177. vm->last_vblk_seq = get_unaligned_be32(data + 0x04);
  178. ldm_debug ("Parsed VMDB successfully.");
  179. return true;
  180. }
  181. /**
  182. * ldm_compare_privheads - Compare two privhead objects
  183. * @ph1: First privhead
  184. * @ph2: Second privhead
  185. *
  186. * This compares the two privhead structures @ph1 and @ph2.
  187. *
  188. * Return: 'true' Identical
  189. * 'false' Different
  190. */
  191. static bool ldm_compare_privheads (const struct privhead *ph1,
  192. const struct privhead *ph2)
  193. {
  194. BUG_ON (!ph1 || !ph2);
  195. return ((ph1->ver_major == ph2->ver_major) &&
  196. (ph1->ver_minor == ph2->ver_minor) &&
  197. (ph1->logical_disk_start == ph2->logical_disk_start) &&
  198. (ph1->logical_disk_size == ph2->logical_disk_size) &&
  199. (ph1->config_start == ph2->config_start) &&
  200. (ph1->config_size == ph2->config_size) &&
  201. uuid_equal(&ph1->disk_id, &ph2->disk_id));
  202. }
  203. /**
  204. * ldm_compare_tocblocks - Compare two tocblock objects
  205. * @toc1: First toc
  206. * @toc2: Second toc
  207. *
  208. * This compares the two tocblock structures @toc1 and @toc2.
  209. *
  210. * Return: 'true' Identical
  211. * 'false' Different
  212. */
  213. static bool ldm_compare_tocblocks (const struct tocblock *toc1,
  214. const struct tocblock *toc2)
  215. {
  216. BUG_ON (!toc1 || !toc2);
  217. return ((toc1->bitmap1_start == toc2->bitmap1_start) &&
  218. (toc1->bitmap1_size == toc2->bitmap1_size) &&
  219. (toc1->bitmap2_start == toc2->bitmap2_start) &&
  220. (toc1->bitmap2_size == toc2->bitmap2_size) &&
  221. !strncmp (toc1->bitmap1_name, toc2->bitmap1_name,
  222. sizeof (toc1->bitmap1_name)) &&
  223. !strncmp (toc1->bitmap2_name, toc2->bitmap2_name,
  224. sizeof (toc1->bitmap2_name)));
  225. }
  226. /**
  227. * ldm_validate_privheads - Compare the primary privhead with its backups
  228. * @state: Partition check state including device holding the LDM Database
  229. * @ph1: Memory struct to fill with ph contents
  230. *
  231. * Read and compare all three privheads from disk.
  232. *
  233. * The privheads on disk show the size and location of the main disk area and
  234. * the configuration area (the database). The values are range-checked against
  235. * @hd, which contains the real size of the disk.
  236. *
  237. * Return: 'true' Success
  238. * 'false' Error
  239. */
  240. static bool ldm_validate_privheads(struct parsed_partitions *state,
  241. struct privhead *ph1)
  242. {
  243. static const int off[3] = { OFF_PRIV1, OFF_PRIV2, OFF_PRIV3 };
  244. struct privhead *ph[3] = { ph1 };
  245. Sector sect;
  246. u8 *data;
  247. bool result = false;
  248. long num_sects;
  249. int i;
  250. BUG_ON (!state || !ph1);
  251. ph[1] = kmalloc (sizeof (*ph[1]), GFP_KERNEL);
  252. ph[2] = kmalloc (sizeof (*ph[2]), GFP_KERNEL);
  253. if (!ph[1] || !ph[2]) {
  254. ldm_crit ("Out of memory.");
  255. goto out;
  256. }
  257. /* off[1 & 2] are relative to ph[0]->config_start */
  258. ph[0]->config_start = 0;
  259. /* Read and parse privheads */
  260. for (i = 0; i < 3; i++) {
  261. data = read_part_sector(state, ph[0]->config_start + off[i],
  262. &sect);
  263. if (!data) {
  264. ldm_crit ("Disk read failed.");
  265. goto out;
  266. }
  267. result = ldm_parse_privhead (data, ph[i]);
  268. put_dev_sector (sect);
  269. if (!result) {
  270. ldm_error ("Cannot find PRIVHEAD %d.", i+1); /* Log again */
  271. if (i < 2)
  272. goto out; /* Already logged */
  273. else
  274. break; /* FIXME ignore for now, 3rd PH can fail on odd-sized disks */
  275. }
  276. }
  277. num_sects = state->bdev->bd_inode->i_size >> 9;
  278. if ((ph[0]->config_start > num_sects) ||
  279. ((ph[0]->config_start + ph[0]->config_size) > num_sects)) {
  280. ldm_crit ("Database extends beyond the end of the disk.");
  281. goto out;
  282. }
  283. if ((ph[0]->logical_disk_start > ph[0]->config_start) ||
  284. ((ph[0]->logical_disk_start + ph[0]->logical_disk_size)
  285. > ph[0]->config_start)) {
  286. ldm_crit ("Disk and database overlap.");
  287. goto out;
  288. }
  289. if (!ldm_compare_privheads (ph[0], ph[1])) {
  290. ldm_crit ("Primary and backup PRIVHEADs don't match.");
  291. goto out;
  292. }
  293. /* FIXME ignore this for now
  294. if (!ldm_compare_privheads (ph[0], ph[2])) {
  295. ldm_crit ("Primary and backup PRIVHEADs don't match.");
  296. goto out;
  297. }*/
  298. ldm_debug ("Validated PRIVHEADs successfully.");
  299. result = true;
  300. out:
  301. kfree (ph[1]);
  302. kfree (ph[2]);
  303. return result;
  304. }
  305. /**
  306. * ldm_validate_tocblocks - Validate the table of contents and its backups
  307. * @state: Partition check state including device holding the LDM Database
  308. * @base: Offset, into @state->bdev, of the database
  309. * @ldb: Cache of the database structures
  310. *
  311. * Find and compare the four tables of contents of the LDM Database stored on
  312. * @state->bdev and return the parsed information into @toc1.
  313. *
  314. * The offsets and sizes of the configs are range-checked against a privhead.
  315. *
  316. * Return: 'true' @toc1 contains validated TOCBLOCK info
  317. * 'false' @toc1 contents are undefined
  318. */
  319. static bool ldm_validate_tocblocks(struct parsed_partitions *state,
  320. unsigned long base, struct ldmdb *ldb)
  321. {
  322. static const int off[4] = { OFF_TOCB1, OFF_TOCB2, OFF_TOCB3, OFF_TOCB4};
  323. struct tocblock *tb[4];
  324. struct privhead *ph;
  325. Sector sect;
  326. u8 *data;
  327. int i, nr_tbs;
  328. bool result = false;
  329. BUG_ON(!state || !ldb);
  330. ph = &ldb->ph;
  331. tb[0] = &ldb->toc;
  332. tb[1] = kmalloc_array(3, sizeof(*tb[1]), GFP_KERNEL);
  333. if (!tb[1]) {
  334. ldm_crit("Out of memory.");
  335. goto err;
  336. }
  337. tb[2] = (struct tocblock*)((u8*)tb[1] + sizeof(*tb[1]));
  338. tb[3] = (struct tocblock*)((u8*)tb[2] + sizeof(*tb[2]));
  339. /*
  340. * Try to read and parse all four TOCBLOCKs.
  341. *
  342. * Windows Vista LDM v2.12 does not always have all four TOCBLOCKs so
  343. * skip any that fail as long as we get at least one valid TOCBLOCK.
  344. */
  345. for (nr_tbs = i = 0; i < 4; i++) {
  346. data = read_part_sector(state, base + off[i], &sect);
  347. if (!data) {
  348. ldm_error("Disk read failed for TOCBLOCK %d.", i);
  349. continue;
  350. }
  351. if (ldm_parse_tocblock(data, tb[nr_tbs]))
  352. nr_tbs++;
  353. put_dev_sector(sect);
  354. }
  355. if (!nr_tbs) {
  356. ldm_crit("Failed to find a valid TOCBLOCK.");
  357. goto err;
  358. }
  359. /* Range check the TOCBLOCK against a privhead. */
  360. if (((tb[0]->bitmap1_start + tb[0]->bitmap1_size) > ph->config_size) ||
  361. ((tb[0]->bitmap2_start + tb[0]->bitmap2_size) >
  362. ph->config_size)) {
  363. ldm_crit("The bitmaps are out of range. Giving up.");
  364. goto err;
  365. }
  366. /* Compare all loaded TOCBLOCKs. */
  367. for (i = 1; i < nr_tbs; i++) {
  368. if (!ldm_compare_tocblocks(tb[0], tb[i])) {
  369. ldm_crit("TOCBLOCKs 0 and %d do not match.", i);
  370. goto err;
  371. }
  372. }
  373. ldm_debug("Validated %d TOCBLOCKs successfully.", nr_tbs);
  374. result = true;
  375. err:
  376. kfree(tb[1]);
  377. return result;
  378. }
  379. /**
  380. * ldm_validate_vmdb - Read the VMDB and validate it
  381. * @state: Partition check state including device holding the LDM Database
  382. * @base: Offset, into @bdev, of the database
  383. * @ldb: Cache of the database structures
  384. *
  385. * Find the vmdb of the LDM Database stored on @bdev and return the parsed
  386. * information in @ldb.
  387. *
  388. * Return: 'true' @ldb contains validated VBDB info
  389. * 'false' @ldb contents are undefined
  390. */
  391. static bool ldm_validate_vmdb(struct parsed_partitions *state,
  392. unsigned long base, struct ldmdb *ldb)
  393. {
  394. Sector sect;
  395. u8 *data;
  396. bool result = false;
  397. struct vmdb *vm;
  398. struct tocblock *toc;
  399. BUG_ON (!state || !ldb);
  400. vm = &ldb->vm;
  401. toc = &ldb->toc;
  402. data = read_part_sector(state, base + OFF_VMDB, &sect);
  403. if (!data) {
  404. ldm_crit ("Disk read failed.");
  405. return false;
  406. }
  407. if (!ldm_parse_vmdb (data, vm))
  408. goto out; /* Already logged */
  409. /* Are there uncommitted transactions? */
  410. if (get_unaligned_be16(data + 0x10) != 0x01) {
  411. ldm_crit ("Database is not in a consistent state. Aborting.");
  412. goto out;
  413. }
  414. if (vm->vblk_offset != 512)
  415. ldm_info ("VBLKs start at offset 0x%04x.", vm->vblk_offset);
  416. /*
  417. * The last_vblkd_seq can be before the end of the vmdb, just make sure
  418. * it is not out of bounds.
  419. */
  420. if ((vm->vblk_size * vm->last_vblk_seq) > (toc->bitmap1_size << 9)) {
  421. ldm_crit ("VMDB exceeds allowed size specified by TOCBLOCK. "
  422. "Database is corrupt. Aborting.");
  423. goto out;
  424. }
  425. result = true;
  426. out:
  427. put_dev_sector (sect);
  428. return result;
  429. }
  430. /**
  431. * ldm_validate_partition_table - Determine whether bdev might be a dynamic disk
  432. * @state: Partition check state including device holding the LDM Database
  433. *
  434. * This function provides a weak test to decide whether the device is a dynamic
  435. * disk or not. It looks for an MS-DOS-style partition table containing at
  436. * least one partition of type 0x42 (formerly SFS, now used by Windows for
  437. * dynamic disks).
  438. *
  439. * N.B. The only possible error can come from the read_part_sector and that is
  440. * only likely to happen if the underlying device is strange. If that IS
  441. * the case we should return zero to let someone else try.
  442. *
  443. * Return: 'true' @state->bdev is a dynamic disk
  444. * 'false' @state->bdev is not a dynamic disk, or an error occurred
  445. */
  446. static bool ldm_validate_partition_table(struct parsed_partitions *state)
  447. {
  448. Sector sect;
  449. u8 *data;
  450. struct msdos_partition *p;
  451. int i;
  452. bool result = false;
  453. BUG_ON(!state);
  454. data = read_part_sector(state, 0, &sect);
  455. if (!data) {
  456. ldm_info ("Disk read failed.");
  457. return false;
  458. }
  459. if (*(__le16*) (data + 0x01FE) != cpu_to_le16 (MSDOS_LABEL_MAGIC))
  460. goto out;
  461. p = (struct msdos_partition *)(data + 0x01BE);
  462. for (i = 0; i < 4; i++, p++)
  463. if (p->sys_ind == LDM_PARTITION) {
  464. result = true;
  465. break;
  466. }
  467. if (result)
  468. ldm_debug ("Found W2K dynamic disk partition type.");
  469. out:
  470. put_dev_sector (sect);
  471. return result;
  472. }
  473. /**
  474. * ldm_get_disk_objid - Search a linked list of vblk's for a given Disk Id
  475. * @ldb: Cache of the database structures
  476. *
  477. * The LDM Database contains a list of all partitions on all dynamic disks.
  478. * The primary PRIVHEAD, at the beginning of the physical disk, tells us
  479. * the GUID of this disk. This function searches for the GUID in a linked
  480. * list of vblk's.
  481. *
  482. * Return: Pointer, A matching vblk was found
  483. * NULL, No match, or an error
  484. */
  485. static struct vblk * ldm_get_disk_objid (const struct ldmdb *ldb)
  486. {
  487. struct list_head *item;
  488. BUG_ON (!ldb);
  489. list_for_each (item, &ldb->v_disk) {
  490. struct vblk *v = list_entry (item, struct vblk, list);
  491. if (uuid_equal(&v->vblk.disk.disk_id, &ldb->ph.disk_id))
  492. return v;
  493. }
  494. return NULL;
  495. }
  496. /**
  497. * ldm_create_data_partitions - Create data partitions for this device
  498. * @pp: List of the partitions parsed so far
  499. * @ldb: Cache of the database structures
  500. *
  501. * The database contains ALL the partitions for ALL disk groups, so we need to
  502. * filter out this specific disk. Using the disk's object id, we can find all
  503. * the partitions in the database that belong to this disk.
  504. *
  505. * Add each partition in our database, to the parsed_partitions structure.
  506. *
  507. * N.B. This function creates the partitions in the order it finds partition
  508. * objects in the linked list.
  509. *
  510. * Return: 'true' Partition created
  511. * 'false' Error, probably a range checking problem
  512. */
  513. static bool ldm_create_data_partitions (struct parsed_partitions *pp,
  514. const struct ldmdb *ldb)
  515. {
  516. struct list_head *item;
  517. struct vblk *vb;
  518. struct vblk *disk;
  519. struct vblk_part *part;
  520. int part_num = 1;
  521. BUG_ON (!pp || !ldb);
  522. disk = ldm_get_disk_objid (ldb);
  523. if (!disk) {
  524. ldm_crit ("Can't find the ID of this disk in the database.");
  525. return false;
  526. }
  527. strlcat(pp->pp_buf, " [LDM]", PAGE_SIZE);
  528. /* Create the data partitions */
  529. list_for_each (item, &ldb->v_part) {
  530. vb = list_entry (item, struct vblk, list);
  531. part = &vb->vblk.part;
  532. if (part->disk_id != disk->obj_id)
  533. continue;
  534. put_partition (pp, part_num, ldb->ph.logical_disk_start +
  535. part->start, part->size);
  536. part_num++;
  537. }
  538. strlcat(pp->pp_buf, "\n", PAGE_SIZE);
  539. return true;
  540. }
  541. /**
  542. * ldm_relative - Calculate the next relative offset
  543. * @buffer: Block of data being worked on
  544. * @buflen: Size of the block of data
  545. * @base: Size of the previous fixed width fields
  546. * @offset: Cumulative size of the previous variable-width fields
  547. *
  548. * Because many of the VBLK fields are variable-width, it's necessary
  549. * to calculate each offset based on the previous one and the length
  550. * of the field it pointed to.
  551. *
  552. * Return: -1 Error, the calculated offset exceeded the size of the buffer
  553. * n OK, a range-checked offset into buffer
  554. */
  555. static int ldm_relative(const u8 *buffer, int buflen, int base, int offset)
  556. {
  557. base += offset;
  558. if (!buffer || offset < 0 || base > buflen) {
  559. if (!buffer)
  560. ldm_error("!buffer");
  561. if (offset < 0)
  562. ldm_error("offset (%d) < 0", offset);
  563. if (base > buflen)
  564. ldm_error("base (%d) > buflen (%d)", base, buflen);
  565. return -1;
  566. }
  567. if (base + buffer[base] >= buflen) {
  568. ldm_error("base (%d) + buffer[base] (%d) >= buflen (%d)", base,
  569. buffer[base], buflen);
  570. return -1;
  571. }
  572. return buffer[base] + offset + 1;
  573. }
  574. /**
  575. * ldm_get_vnum - Convert a variable-width, big endian number, into cpu order
  576. * @block: Pointer to the variable-width number to convert
  577. *
  578. * Large numbers in the LDM Database are often stored in a packed format. Each
  579. * number is prefixed by a one byte width marker. All numbers in the database
  580. * are stored in big-endian byte order. This function reads one of these
  581. * numbers and returns the result
  582. *
  583. * N.B. This function DOES NOT perform any range checking, though the most
  584. * it will read is eight bytes.
  585. *
  586. * Return: n A number
  587. * 0 Zero, or an error occurred
  588. */
  589. static u64 ldm_get_vnum (const u8 *block)
  590. {
  591. u64 tmp = 0;
  592. u8 length;
  593. BUG_ON (!block);
  594. length = *block++;
  595. if (length && length <= 8)
  596. while (length--)
  597. tmp = (tmp << 8) | *block++;
  598. else
  599. ldm_error ("Illegal length %d.", length);
  600. return tmp;
  601. }
  602. /**
  603. * ldm_get_vstr - Read a length-prefixed string into a buffer
  604. * @block: Pointer to the length marker
  605. * @buffer: Location to copy string to
  606. * @buflen: Size of the output buffer
  607. *
  608. * Many of the strings in the LDM Database are not NULL terminated. Instead
  609. * they are prefixed by a one byte length marker. This function copies one of
  610. * these strings into a buffer.
  611. *
  612. * N.B. This function DOES NOT perform any range checking on the input.
  613. * If the buffer is too small, the output will be truncated.
  614. *
  615. * Return: 0, Error and @buffer contents are undefined
  616. * n, String length in characters (excluding NULL)
  617. * buflen-1, String was truncated.
  618. */
  619. static int ldm_get_vstr (const u8 *block, u8 *buffer, int buflen)
  620. {
  621. int length;
  622. BUG_ON (!block || !buffer);
  623. length = block[0];
  624. if (length >= buflen) {
  625. ldm_error ("Truncating string %d -> %d.", length, buflen);
  626. length = buflen - 1;
  627. }
  628. memcpy (buffer, block + 1, length);
  629. buffer[length] = 0;
  630. return length;
  631. }
  632. /**
  633. * ldm_parse_cmp3 - Read a raw VBLK Component object into a vblk structure
  634. * @buffer: Block of data being worked on
  635. * @buflen: Size of the block of data
  636. * @vb: In-memory vblk in which to return information
  637. *
  638. * Read a raw VBLK Component object (version 3) into a vblk structure.
  639. *
  640. * Return: 'true' @vb contains a Component VBLK
  641. * 'false' @vb contents are not defined
  642. */
  643. static bool ldm_parse_cmp3 (const u8 *buffer, int buflen, struct vblk *vb)
  644. {
  645. int r_objid, r_name, r_vstate, r_child, r_parent, r_stripe, r_cols, len;
  646. struct vblk_comp *comp;
  647. BUG_ON (!buffer || !vb);
  648. r_objid = ldm_relative (buffer, buflen, 0x18, 0);
  649. r_name = ldm_relative (buffer, buflen, 0x18, r_objid);
  650. r_vstate = ldm_relative (buffer, buflen, 0x18, r_name);
  651. r_child = ldm_relative (buffer, buflen, 0x1D, r_vstate);
  652. r_parent = ldm_relative (buffer, buflen, 0x2D, r_child);
  653. if (buffer[0x12] & VBLK_FLAG_COMP_STRIPE) {
  654. r_stripe = ldm_relative (buffer, buflen, 0x2E, r_parent);
  655. r_cols = ldm_relative (buffer, buflen, 0x2E, r_stripe);
  656. len = r_cols;
  657. } else {
  658. r_stripe = 0;
  659. r_cols = 0;
  660. len = r_parent;
  661. }
  662. if (len < 0)
  663. return false;
  664. len += VBLK_SIZE_CMP3;
  665. if (len != get_unaligned_be32(buffer + 0x14))
  666. return false;
  667. comp = &vb->vblk.comp;
  668. ldm_get_vstr (buffer + 0x18 + r_name, comp->state,
  669. sizeof (comp->state));
  670. comp->type = buffer[0x18 + r_vstate];
  671. comp->children = ldm_get_vnum (buffer + 0x1D + r_vstate);
  672. comp->parent_id = ldm_get_vnum (buffer + 0x2D + r_child);
  673. comp->chunksize = r_stripe ? ldm_get_vnum (buffer+r_parent+0x2E) : 0;
  674. return true;
  675. }
  676. /**
  677. * ldm_parse_dgr3 - Read a raw VBLK Disk Group object into a vblk structure
  678. * @buffer: Block of data being worked on
  679. * @buflen: Size of the block of data
  680. * @vb: In-memory vblk in which to return information
  681. *
  682. * Read a raw VBLK Disk Group object (version 3) into a vblk structure.
  683. *
  684. * Return: 'true' @vb contains a Disk Group VBLK
  685. * 'false' @vb contents are not defined
  686. */
  687. static int ldm_parse_dgr3 (const u8 *buffer, int buflen, struct vblk *vb)
  688. {
  689. int r_objid, r_name, r_diskid, r_id1, r_id2, len;
  690. struct vblk_dgrp *dgrp;
  691. BUG_ON (!buffer || !vb);
  692. r_objid = ldm_relative (buffer, buflen, 0x18, 0);
  693. r_name = ldm_relative (buffer, buflen, 0x18, r_objid);
  694. r_diskid = ldm_relative (buffer, buflen, 0x18, r_name);
  695. if (buffer[0x12] & VBLK_FLAG_DGR3_IDS) {
  696. r_id1 = ldm_relative (buffer, buflen, 0x24, r_diskid);
  697. r_id2 = ldm_relative (buffer, buflen, 0x24, r_id1);
  698. len = r_id2;
  699. } else {
  700. r_id1 = 0;
  701. r_id2 = 0;
  702. len = r_diskid;
  703. }
  704. if (len < 0)
  705. return false;
  706. len += VBLK_SIZE_DGR3;
  707. if (len != get_unaligned_be32(buffer + 0x14))
  708. return false;
  709. dgrp = &vb->vblk.dgrp;
  710. ldm_get_vstr (buffer + 0x18 + r_name, dgrp->disk_id,
  711. sizeof (dgrp->disk_id));
  712. return true;
  713. }
  714. /**
  715. * ldm_parse_dgr4 - Read a raw VBLK Disk Group object into a vblk structure
  716. * @buffer: Block of data being worked on
  717. * @buflen: Size of the block of data
  718. * @vb: In-memory vblk in which to return information
  719. *
  720. * Read a raw VBLK Disk Group object (version 4) into a vblk structure.
  721. *
  722. * Return: 'true' @vb contains a Disk Group VBLK
  723. * 'false' @vb contents are not defined
  724. */
  725. static bool ldm_parse_dgr4 (const u8 *buffer, int buflen, struct vblk *vb)
  726. {
  727. char buf[64];
  728. int r_objid, r_name, r_id1, r_id2, len;
  729. BUG_ON (!buffer || !vb);
  730. r_objid = ldm_relative (buffer, buflen, 0x18, 0);
  731. r_name = ldm_relative (buffer, buflen, 0x18, r_objid);
  732. if (buffer[0x12] & VBLK_FLAG_DGR4_IDS) {
  733. r_id1 = ldm_relative (buffer, buflen, 0x44, r_name);
  734. r_id2 = ldm_relative (buffer, buflen, 0x44, r_id1);
  735. len = r_id2;
  736. } else {
  737. r_id1 = 0;
  738. r_id2 = 0;
  739. len = r_name;
  740. }
  741. if (len < 0)
  742. return false;
  743. len += VBLK_SIZE_DGR4;
  744. if (len != get_unaligned_be32(buffer + 0x14))
  745. return false;
  746. ldm_get_vstr (buffer + 0x18 + r_objid, buf, sizeof (buf));
  747. return true;
  748. }
  749. /**
  750. * ldm_parse_dsk3 - Read a raw VBLK Disk object into a vblk structure
  751. * @buffer: Block of data being worked on
  752. * @buflen: Size of the block of data
  753. * @vb: In-memory vblk in which to return information
  754. *
  755. * Read a raw VBLK Disk object (version 3) into a vblk structure.
  756. *
  757. * Return: 'true' @vb contains a Disk VBLK
  758. * 'false' @vb contents are not defined
  759. */
  760. static bool ldm_parse_dsk3 (const u8 *buffer, int buflen, struct vblk *vb)
  761. {
  762. int r_objid, r_name, r_diskid, r_altname, len;
  763. struct vblk_disk *disk;
  764. BUG_ON (!buffer || !vb);
  765. r_objid = ldm_relative (buffer, buflen, 0x18, 0);
  766. r_name = ldm_relative (buffer, buflen, 0x18, r_objid);
  767. r_diskid = ldm_relative (buffer, buflen, 0x18, r_name);
  768. r_altname = ldm_relative (buffer, buflen, 0x18, r_diskid);
  769. len = r_altname;
  770. if (len < 0)
  771. return false;
  772. len += VBLK_SIZE_DSK3;
  773. if (len != get_unaligned_be32(buffer + 0x14))
  774. return false;
  775. disk = &vb->vblk.disk;
  776. ldm_get_vstr (buffer + 0x18 + r_diskid, disk->alt_name,
  777. sizeof (disk->alt_name));
  778. if (uuid_parse(buffer + 0x19 + r_name, &disk->disk_id))
  779. return false;
  780. return true;
  781. }
  782. /**
  783. * ldm_parse_dsk4 - Read a raw VBLK Disk object into a vblk structure
  784. * @buffer: Block of data being worked on
  785. * @buflen: Size of the block of data
  786. * @vb: In-memory vblk in which to return information
  787. *
  788. * Read a raw VBLK Disk object (version 4) into a vblk structure.
  789. *
  790. * Return: 'true' @vb contains a Disk VBLK
  791. * 'false' @vb contents are not defined
  792. */
  793. static bool ldm_parse_dsk4 (const u8 *buffer, int buflen, struct vblk *vb)
  794. {
  795. int r_objid, r_name, len;
  796. struct vblk_disk *disk;
  797. BUG_ON (!buffer || !vb);
  798. r_objid = ldm_relative (buffer, buflen, 0x18, 0);
  799. r_name = ldm_relative (buffer, buflen, 0x18, r_objid);
  800. len = r_name;
  801. if (len < 0)
  802. return false;
  803. len += VBLK_SIZE_DSK4;
  804. if (len != get_unaligned_be32(buffer + 0x14))
  805. return false;
  806. disk = &vb->vblk.disk;
  807. import_uuid(&disk->disk_id, buffer + 0x18 + r_name);
  808. return true;
  809. }
  810. /**
  811. * ldm_parse_prt3 - Read a raw VBLK Partition object into a vblk structure
  812. * @buffer: Block of data being worked on
  813. * @buflen: Size of the block of data
  814. * @vb: In-memory vblk in which to return information
  815. *
  816. * Read a raw VBLK Partition object (version 3) into a vblk structure.
  817. *
  818. * Return: 'true' @vb contains a Partition VBLK
  819. * 'false' @vb contents are not defined
  820. */
  821. static bool ldm_parse_prt3(const u8 *buffer, int buflen, struct vblk *vb)
  822. {
  823. int r_objid, r_name, r_size, r_parent, r_diskid, r_index, len;
  824. struct vblk_part *part;
  825. BUG_ON(!buffer || !vb);
  826. r_objid = ldm_relative(buffer, buflen, 0x18, 0);
  827. if (r_objid < 0) {
  828. ldm_error("r_objid %d < 0", r_objid);
  829. return false;
  830. }
  831. r_name = ldm_relative(buffer, buflen, 0x18, r_objid);
  832. if (r_name < 0) {
  833. ldm_error("r_name %d < 0", r_name);
  834. return false;
  835. }
  836. r_size = ldm_relative(buffer, buflen, 0x34, r_name);
  837. if (r_size < 0) {
  838. ldm_error("r_size %d < 0", r_size);
  839. return false;
  840. }
  841. r_parent = ldm_relative(buffer, buflen, 0x34, r_size);
  842. if (r_parent < 0) {
  843. ldm_error("r_parent %d < 0", r_parent);
  844. return false;
  845. }
  846. r_diskid = ldm_relative(buffer, buflen, 0x34, r_parent);
  847. if (r_diskid < 0) {
  848. ldm_error("r_diskid %d < 0", r_diskid);
  849. return false;
  850. }
  851. if (buffer[0x12] & VBLK_FLAG_PART_INDEX) {
  852. r_index = ldm_relative(buffer, buflen, 0x34, r_diskid);
  853. if (r_index < 0) {
  854. ldm_error("r_index %d < 0", r_index);
  855. return false;
  856. }
  857. len = r_index;
  858. } else {
  859. r_index = 0;
  860. len = r_diskid;
  861. }
  862. if (len < 0) {
  863. ldm_error("len %d < 0", len);
  864. return false;
  865. }
  866. len += VBLK_SIZE_PRT3;
  867. if (len > get_unaligned_be32(buffer + 0x14)) {
  868. ldm_error("len %d > BE32(buffer + 0x14) %d", len,
  869. get_unaligned_be32(buffer + 0x14));
  870. return false;
  871. }
  872. part = &vb->vblk.part;
  873. part->start = get_unaligned_be64(buffer + 0x24 + r_name);
  874. part->volume_offset = get_unaligned_be64(buffer + 0x2C + r_name);
  875. part->size = ldm_get_vnum(buffer + 0x34 + r_name);
  876. part->parent_id = ldm_get_vnum(buffer + 0x34 + r_size);
  877. part->disk_id = ldm_get_vnum(buffer + 0x34 + r_parent);
  878. if (vb->flags & VBLK_FLAG_PART_INDEX)
  879. part->partnum = buffer[0x35 + r_diskid];
  880. else
  881. part->partnum = 0;
  882. return true;
  883. }
  884. /**
  885. * ldm_parse_vol5 - Read a raw VBLK Volume object into a vblk structure
  886. * @buffer: Block of data being worked on
  887. * @buflen: Size of the block of data
  888. * @vb: In-memory vblk in which to return information
  889. *
  890. * Read a raw VBLK Volume object (version 5) into a vblk structure.
  891. *
  892. * Return: 'true' @vb contains a Volume VBLK
  893. * 'false' @vb contents are not defined
  894. */
  895. static bool ldm_parse_vol5(const u8 *buffer, int buflen, struct vblk *vb)
  896. {
  897. int r_objid, r_name, r_vtype, r_disable_drive_letter, r_child, r_size;
  898. int r_id1, r_id2, r_size2, r_drive, len;
  899. struct vblk_volu *volu;
  900. BUG_ON(!buffer || !vb);
  901. r_objid = ldm_relative(buffer, buflen, 0x18, 0);
  902. if (r_objid < 0) {
  903. ldm_error("r_objid %d < 0", r_objid);
  904. return false;
  905. }
  906. r_name = ldm_relative(buffer, buflen, 0x18, r_objid);
  907. if (r_name < 0) {
  908. ldm_error("r_name %d < 0", r_name);
  909. return false;
  910. }
  911. r_vtype = ldm_relative(buffer, buflen, 0x18, r_name);
  912. if (r_vtype < 0) {
  913. ldm_error("r_vtype %d < 0", r_vtype);
  914. return false;
  915. }
  916. r_disable_drive_letter = ldm_relative(buffer, buflen, 0x18, r_vtype);
  917. if (r_disable_drive_letter < 0) {
  918. ldm_error("r_disable_drive_letter %d < 0",
  919. r_disable_drive_letter);
  920. return false;
  921. }
  922. r_child = ldm_relative(buffer, buflen, 0x2D, r_disable_drive_letter);
  923. if (r_child < 0) {
  924. ldm_error("r_child %d < 0", r_child);
  925. return false;
  926. }
  927. r_size = ldm_relative(buffer, buflen, 0x3D, r_child);
  928. if (r_size < 0) {
  929. ldm_error("r_size %d < 0", r_size);
  930. return false;
  931. }
  932. if (buffer[0x12] & VBLK_FLAG_VOLU_ID1) {
  933. r_id1 = ldm_relative(buffer, buflen, 0x52, r_size);
  934. if (r_id1 < 0) {
  935. ldm_error("r_id1 %d < 0", r_id1);
  936. return false;
  937. }
  938. } else
  939. r_id1 = r_size;
  940. if (buffer[0x12] & VBLK_FLAG_VOLU_ID2) {
  941. r_id2 = ldm_relative(buffer, buflen, 0x52, r_id1);
  942. if (r_id2 < 0) {
  943. ldm_error("r_id2 %d < 0", r_id2);
  944. return false;
  945. }
  946. } else
  947. r_id2 = r_id1;
  948. if (buffer[0x12] & VBLK_FLAG_VOLU_SIZE) {
  949. r_size2 = ldm_relative(buffer, buflen, 0x52, r_id2);
  950. if (r_size2 < 0) {
  951. ldm_error("r_size2 %d < 0", r_size2);
  952. return false;
  953. }
  954. } else
  955. r_size2 = r_id2;
  956. if (buffer[0x12] & VBLK_FLAG_VOLU_DRIVE) {
  957. r_drive = ldm_relative(buffer, buflen, 0x52, r_size2);
  958. if (r_drive < 0) {
  959. ldm_error("r_drive %d < 0", r_drive);
  960. return false;
  961. }
  962. } else
  963. r_drive = r_size2;
  964. len = r_drive;
  965. if (len < 0) {
  966. ldm_error("len %d < 0", len);
  967. return false;
  968. }
  969. len += VBLK_SIZE_VOL5;
  970. if (len > get_unaligned_be32(buffer + 0x14)) {
  971. ldm_error("len %d > BE32(buffer + 0x14) %d", len,
  972. get_unaligned_be32(buffer + 0x14));
  973. return false;
  974. }
  975. volu = &vb->vblk.volu;
  976. ldm_get_vstr(buffer + 0x18 + r_name, volu->volume_type,
  977. sizeof(volu->volume_type));
  978. memcpy(volu->volume_state, buffer + 0x18 + r_disable_drive_letter,
  979. sizeof(volu->volume_state));
  980. volu->size = ldm_get_vnum(buffer + 0x3D + r_child);
  981. volu->partition_type = buffer[0x41 + r_size];
  982. memcpy(volu->guid, buffer + 0x42 + r_size, sizeof(volu->guid));
  983. if (buffer[0x12] & VBLK_FLAG_VOLU_DRIVE) {
  984. ldm_get_vstr(buffer + 0x52 + r_size, volu->drive_hint,
  985. sizeof(volu->drive_hint));
  986. }
  987. return true;
  988. }
  989. /**
  990. * ldm_parse_vblk - Read a raw VBLK object into a vblk structure
  991. * @buf: Block of data being worked on
  992. * @len: Size of the block of data
  993. * @vb: In-memory vblk in which to return information
  994. *
  995. * Read a raw VBLK object into a vblk structure. This function just reads the
  996. * information common to all VBLK types, then delegates the rest of the work to
  997. * helper functions: ldm_parse_*.
  998. *
  999. * Return: 'true' @vb contains a VBLK
  1000. * 'false' @vb contents are not defined
  1001. */
  1002. static bool ldm_parse_vblk (const u8 *buf, int len, struct vblk *vb)
  1003. {
  1004. bool result = false;
  1005. int r_objid;
  1006. BUG_ON (!buf || !vb);
  1007. r_objid = ldm_relative (buf, len, 0x18, 0);
  1008. if (r_objid < 0) {
  1009. ldm_error ("VBLK header is corrupt.");
  1010. return false;
  1011. }
  1012. vb->flags = buf[0x12];
  1013. vb->type = buf[0x13];
  1014. vb->obj_id = ldm_get_vnum (buf + 0x18);
  1015. ldm_get_vstr (buf+0x18+r_objid, vb->name, sizeof (vb->name));
  1016. switch (vb->type) {
  1017. case VBLK_CMP3: result = ldm_parse_cmp3 (buf, len, vb); break;
  1018. case VBLK_DSK3: result = ldm_parse_dsk3 (buf, len, vb); break;
  1019. case VBLK_DSK4: result = ldm_parse_dsk4 (buf, len, vb); break;
  1020. case VBLK_DGR3: result = ldm_parse_dgr3 (buf, len, vb); break;
  1021. case VBLK_DGR4: result = ldm_parse_dgr4 (buf, len, vb); break;
  1022. case VBLK_PRT3: result = ldm_parse_prt3 (buf, len, vb); break;
  1023. case VBLK_VOL5: result = ldm_parse_vol5 (buf, len, vb); break;
  1024. }
  1025. if (result)
  1026. ldm_debug ("Parsed VBLK 0x%llx (type: 0x%02x) ok.",
  1027. (unsigned long long) vb->obj_id, vb->type);
  1028. else
  1029. ldm_error ("Failed to parse VBLK 0x%llx (type: 0x%02x).",
  1030. (unsigned long long) vb->obj_id, vb->type);
  1031. return result;
  1032. }
  1033. /**
  1034. * ldm_ldmdb_add - Adds a raw VBLK entry to the ldmdb database
  1035. * @data: Raw VBLK to add to the database
  1036. * @len: Size of the raw VBLK
  1037. * @ldb: Cache of the database structures
  1038. *
  1039. * The VBLKs are sorted into categories. Partitions are also sorted by offset.
  1040. *
  1041. * N.B. This function does not check the validity of the VBLKs.
  1042. *
  1043. * Return: 'true' The VBLK was added
  1044. * 'false' An error occurred
  1045. */
  1046. static bool ldm_ldmdb_add (u8 *data, int len, struct ldmdb *ldb)
  1047. {
  1048. struct vblk *vb;
  1049. struct list_head *item;
  1050. BUG_ON (!data || !ldb);
  1051. vb = kmalloc (sizeof (*vb), GFP_KERNEL);
  1052. if (!vb) {
  1053. ldm_crit ("Out of memory.");
  1054. return false;
  1055. }
  1056. if (!ldm_parse_vblk (data, len, vb)) {
  1057. kfree(vb);
  1058. return false; /* Already logged */
  1059. }
  1060. /* Put vblk into the correct list. */
  1061. switch (vb->type) {
  1062. case VBLK_DGR3:
  1063. case VBLK_DGR4:
  1064. list_add (&vb->list, &ldb->v_dgrp);
  1065. break;
  1066. case VBLK_DSK3:
  1067. case VBLK_DSK4:
  1068. list_add (&vb->list, &ldb->v_disk);
  1069. break;
  1070. case VBLK_VOL5:
  1071. list_add (&vb->list, &ldb->v_volu);
  1072. break;
  1073. case VBLK_CMP3:
  1074. list_add (&vb->list, &ldb->v_comp);
  1075. break;
  1076. case VBLK_PRT3:
  1077. /* Sort by the partition's start sector. */
  1078. list_for_each (item, &ldb->v_part) {
  1079. struct vblk *v = list_entry (item, struct vblk, list);
  1080. if ((v->vblk.part.disk_id == vb->vblk.part.disk_id) &&
  1081. (v->vblk.part.start > vb->vblk.part.start)) {
  1082. list_add_tail (&vb->list, &v->list);
  1083. return true;
  1084. }
  1085. }
  1086. list_add_tail (&vb->list, &ldb->v_part);
  1087. break;
  1088. }
  1089. return true;
  1090. }
  1091. /**
  1092. * ldm_frag_add - Add a VBLK fragment to a list
  1093. * @data: Raw fragment to be added to the list
  1094. * @size: Size of the raw fragment
  1095. * @frags: Linked list of VBLK fragments
  1096. *
  1097. * Fragmented VBLKs may not be consecutive in the database, so they are placed
  1098. * in a list so they can be pieced together later.
  1099. *
  1100. * Return: 'true' Success, the VBLK was added to the list
  1101. * 'false' Error, a problem occurred
  1102. */
  1103. static bool ldm_frag_add (const u8 *data, int size, struct list_head *frags)
  1104. {
  1105. struct frag *f;
  1106. struct list_head *item;
  1107. int rec, num, group;
  1108. BUG_ON (!data || !frags);
  1109. if (size < 2 * VBLK_SIZE_HEAD) {
  1110. ldm_error("Value of size is too small.");
  1111. return false;
  1112. }
  1113. group = get_unaligned_be32(data + 0x08);
  1114. rec = get_unaligned_be16(data + 0x0C);
  1115. num = get_unaligned_be16(data + 0x0E);
  1116. if ((num < 1) || (num > 4)) {
  1117. ldm_error ("A VBLK claims to have %d parts.", num);
  1118. return false;
  1119. }
  1120. if (rec >= num) {
  1121. ldm_error("REC value (%d) exceeds NUM value (%d)", rec, num);
  1122. return false;
  1123. }
  1124. list_for_each (item, frags) {
  1125. f = list_entry (item, struct frag, list);
  1126. if (f->group == group)
  1127. goto found;
  1128. }
  1129. f = kmalloc (sizeof (*f) + size*num, GFP_KERNEL);
  1130. if (!f) {
  1131. ldm_crit ("Out of memory.");
  1132. return false;
  1133. }
  1134. f->group = group;
  1135. f->num = num;
  1136. f->rec = rec;
  1137. f->map = 0xFF << num;
  1138. list_add_tail (&f->list, frags);
  1139. found:
  1140. if (rec >= f->num) {
  1141. ldm_error("REC value (%d) exceeds NUM value (%d)", rec, f->num);
  1142. return false;
  1143. }
  1144. if (f->map & (1 << rec)) {
  1145. ldm_error ("Duplicate VBLK, part %d.", rec);
  1146. f->map &= 0x7F; /* Mark the group as broken */
  1147. return false;
  1148. }
  1149. f->map |= (1 << rec);
  1150. if (!rec)
  1151. memcpy(f->data, data, VBLK_SIZE_HEAD);
  1152. data += VBLK_SIZE_HEAD;
  1153. size -= VBLK_SIZE_HEAD;
  1154. memcpy(f->data + VBLK_SIZE_HEAD + rec * size, data, size);
  1155. return true;
  1156. }
  1157. /**
  1158. * ldm_frag_free - Free a linked list of VBLK fragments
  1159. * @list: Linked list of fragments
  1160. *
  1161. * Free a linked list of VBLK fragments
  1162. *
  1163. * Return: none
  1164. */
  1165. static void ldm_frag_free (struct list_head *list)
  1166. {
  1167. struct list_head *item, *tmp;
  1168. BUG_ON (!list);
  1169. list_for_each_safe (item, tmp, list)
  1170. kfree (list_entry (item, struct frag, list));
  1171. }
  1172. /**
  1173. * ldm_frag_commit - Validate fragmented VBLKs and add them to the database
  1174. * @frags: Linked list of VBLK fragments
  1175. * @ldb: Cache of the database structures
  1176. *
  1177. * Now that all the fragmented VBLKs have been collected, they must be added to
  1178. * the database for later use.
  1179. *
  1180. * Return: 'true' All the fragments we added successfully
  1181. * 'false' One or more of the fragments we invalid
  1182. */
  1183. static bool ldm_frag_commit (struct list_head *frags, struct ldmdb *ldb)
  1184. {
  1185. struct frag *f;
  1186. struct list_head *item;
  1187. BUG_ON (!frags || !ldb);
  1188. list_for_each (item, frags) {
  1189. f = list_entry (item, struct frag, list);
  1190. if (f->map != 0xFF) {
  1191. ldm_error ("VBLK group %d is incomplete (0x%02x).",
  1192. f->group, f->map);
  1193. return false;
  1194. }
  1195. if (!ldm_ldmdb_add (f->data, f->num*ldb->vm.vblk_size, ldb))
  1196. return false; /* Already logged */
  1197. }
  1198. return true;
  1199. }
  1200. /**
  1201. * ldm_get_vblks - Read the on-disk database of VBLKs into memory
  1202. * @state: Partition check state including device holding the LDM Database
  1203. * @base: Offset, into @state->bdev, of the database
  1204. * @ldb: Cache of the database structures
  1205. *
  1206. * To use the information from the VBLKs, they need to be read from the disk,
  1207. * unpacked and validated. We cache them in @ldb according to their type.
  1208. *
  1209. * Return: 'true' All the VBLKs were read successfully
  1210. * 'false' An error occurred
  1211. */
  1212. static bool ldm_get_vblks(struct parsed_partitions *state, unsigned long base,
  1213. struct ldmdb *ldb)
  1214. {
  1215. int size, perbuf, skip, finish, s, v, recs;
  1216. u8 *data = NULL;
  1217. Sector sect;
  1218. bool result = false;
  1219. LIST_HEAD (frags);
  1220. BUG_ON(!state || !ldb);
  1221. size = ldb->vm.vblk_size;
  1222. perbuf = 512 / size;
  1223. skip = ldb->vm.vblk_offset >> 9; /* Bytes to sectors */
  1224. finish = (size * ldb->vm.last_vblk_seq) >> 9;
  1225. for (s = skip; s < finish; s++) { /* For each sector */
  1226. data = read_part_sector(state, base + OFF_VMDB + s, &sect);
  1227. if (!data) {
  1228. ldm_crit ("Disk read failed.");
  1229. goto out;
  1230. }
  1231. for (v = 0; v < perbuf; v++, data+=size) { /* For each vblk */
  1232. if (MAGIC_VBLK != get_unaligned_be32(data)) {
  1233. ldm_error ("Expected to find a VBLK.");
  1234. goto out;
  1235. }
  1236. recs = get_unaligned_be16(data + 0x0E); /* Number of records */
  1237. if (recs == 1) {
  1238. if (!ldm_ldmdb_add (data, size, ldb))
  1239. goto out; /* Already logged */
  1240. } else if (recs > 1) {
  1241. if (!ldm_frag_add (data, size, &frags))
  1242. goto out; /* Already logged */
  1243. }
  1244. /* else Record is not in use, ignore it. */
  1245. }
  1246. put_dev_sector (sect);
  1247. data = NULL;
  1248. }
  1249. result = ldm_frag_commit (&frags, ldb); /* Failures, already logged */
  1250. out:
  1251. if (data)
  1252. put_dev_sector (sect);
  1253. ldm_frag_free (&frags);
  1254. return result;
  1255. }
  1256. /**
  1257. * ldm_free_vblks - Free a linked list of vblk's
  1258. * @lh: Head of a linked list of struct vblk
  1259. *
  1260. * Free a list of vblk's and free the memory used to maintain the list.
  1261. *
  1262. * Return: none
  1263. */
  1264. static void ldm_free_vblks (struct list_head *lh)
  1265. {
  1266. struct list_head *item, *tmp;
  1267. BUG_ON (!lh);
  1268. list_for_each_safe (item, tmp, lh)
  1269. kfree (list_entry (item, struct vblk, list));
  1270. }
  1271. /**
  1272. * ldm_partition - Find out whether a device is a dynamic disk and handle it
  1273. * @state: Partition check state including device holding the LDM Database
  1274. *
  1275. * This determines whether the device @bdev is a dynamic disk and if so creates
  1276. * the partitions necessary in the gendisk structure pointed to by @hd.
  1277. *
  1278. * We create a dummy device 1, which contains the LDM database, and then create
  1279. * each partition described by the LDM database in sequence as devices 2+. For
  1280. * example, if the device is hda, we would have: hda1: LDM database, hda2, hda3,
  1281. * and so on: the actual data containing partitions.
  1282. *
  1283. * Return: 1 Success, @state->bdev is a dynamic disk and we handled it
  1284. * 0 Success, @state->bdev is not a dynamic disk
  1285. * -1 An error occurred before enough information had been read
  1286. * Or @state->bdev is a dynamic disk, but it may be corrupted
  1287. */
  1288. int ldm_partition(struct parsed_partitions *state)
  1289. {
  1290. struct ldmdb *ldb;
  1291. unsigned long base;
  1292. int result = -1;
  1293. BUG_ON(!state);
  1294. /* Look for signs of a Dynamic Disk */
  1295. if (!ldm_validate_partition_table(state))
  1296. return 0;
  1297. ldb = kmalloc (sizeof (*ldb), GFP_KERNEL);
  1298. if (!ldb) {
  1299. ldm_crit ("Out of memory.");
  1300. goto out;
  1301. }
  1302. /* Parse and check privheads. */
  1303. if (!ldm_validate_privheads(state, &ldb->ph))
  1304. goto out; /* Already logged */
  1305. /* All further references are relative to base (database start). */
  1306. base = ldb->ph.config_start;
  1307. /* Parse and check tocs and vmdb. */
  1308. if (!ldm_validate_tocblocks(state, base, ldb) ||
  1309. !ldm_validate_vmdb(state, base, ldb))
  1310. goto out; /* Already logged */
  1311. /* Initialize vblk lists in ldmdb struct */
  1312. INIT_LIST_HEAD (&ldb->v_dgrp);
  1313. INIT_LIST_HEAD (&ldb->v_disk);
  1314. INIT_LIST_HEAD (&ldb->v_volu);
  1315. INIT_LIST_HEAD (&ldb->v_comp);
  1316. INIT_LIST_HEAD (&ldb->v_part);
  1317. if (!ldm_get_vblks(state, base, ldb)) {
  1318. ldm_crit ("Failed to read the VBLKs from the database.");
  1319. goto cleanup;
  1320. }
  1321. /* Finally, create the data partition devices. */
  1322. if (ldm_create_data_partitions(state, ldb)) {
  1323. ldm_debug ("Parsed LDM database successfully.");
  1324. result = 1;
  1325. }
  1326. /* else Already logged */
  1327. cleanup:
  1328. ldm_free_vblks (&ldb->v_dgrp);
  1329. ldm_free_vblks (&ldb->v_disk);
  1330. ldm_free_vblks (&ldb->v_volu);
  1331. ldm_free_vblks (&ldb->v_comp);
  1332. ldm_free_vblks (&ldb->v_part);
  1333. out:
  1334. kfree (ldb);
  1335. return result;
  1336. }