/kern_oII/fs/partitions/ldm.c

http://omnia2droid.googlecode.com/ · C · 1551 lines · 936 code · 168 blank · 447 comment · 214 complexity · 85a9d94c9f2f5fdf5f1fcc62292b5798 MD5 · raw file

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