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