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