2 * Copyright (c) 2007-2009 Marcel Moolenaar
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
15 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
16 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
17 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
18 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
19 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
20 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
21 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
22 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
24 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29 #include <sys/cdefs.h>
30 __FBSDID("$FreeBSD$");
32 #include <sys/param.h>
34 #include <sys/diskmbr.h>
35 #include <sys/endian.h>
36 #include <sys/kernel.h>
38 #include <sys/limits.h>
40 #include <sys/malloc.h>
41 #include <sys/mutex.h>
42 #include <sys/queue.h>
44 #include <sys/systm.h>
45 #include <sys/sysctl.h>
46 #include <geom/geom.h>
47 #include <geom/part/g_part.h>
49 #include "g_part_if.h"
51 FEATURE(geom_part_ebr,
52 "GEOM partitioning class for extended boot records support");
53 #if defined(GEOM_PART_EBR_COMPAT)
54 FEATURE(geom_part_ebr_compat,
55 "GEOM EBR partitioning class: backward-compatible partition names");
60 struct g_part_ebr_table {
61 struct g_part_table base;
62 #ifndef GEOM_PART_EBR_COMPAT
67 struct g_part_ebr_entry {
68 struct g_part_entry base;
69 struct dos_partition ent;
72 static int g_part_ebr_add(struct g_part_table *, struct g_part_entry *,
73 struct g_part_parms *);
74 static int g_part_ebr_create(struct g_part_table *, struct g_part_parms *);
75 static int g_part_ebr_destroy(struct g_part_table *, struct g_part_parms *);
76 static void g_part_ebr_dumpconf(struct g_part_table *, struct g_part_entry *,
77 struct sbuf *, const char *);
78 static int g_part_ebr_dumpto(struct g_part_table *, struct g_part_entry *);
79 #if defined(GEOM_PART_EBR_COMPAT)
80 static void g_part_ebr_fullname(struct g_part_table *, struct g_part_entry *,
81 struct sbuf *, const char *);
83 static int g_part_ebr_modify(struct g_part_table *, struct g_part_entry *,
84 struct g_part_parms *);
85 static const char *g_part_ebr_name(struct g_part_table *, struct g_part_entry *,
87 static int g_part_ebr_precheck(struct g_part_table *, enum g_part_ctl,
88 struct g_part_parms *);
89 static int g_part_ebr_probe(struct g_part_table *, struct g_consumer *);
90 static int g_part_ebr_read(struct g_part_table *, struct g_consumer *);
91 static int g_part_ebr_setunset(struct g_part_table *, struct g_part_entry *,
92 const char *, unsigned int);
93 static const char *g_part_ebr_type(struct g_part_table *, struct g_part_entry *,
95 static int g_part_ebr_write(struct g_part_table *, struct g_consumer *);
97 static kobj_method_t g_part_ebr_methods[] = {
98 KOBJMETHOD(g_part_add, g_part_ebr_add),
99 KOBJMETHOD(g_part_create, g_part_ebr_create),
100 KOBJMETHOD(g_part_destroy, g_part_ebr_destroy),
101 KOBJMETHOD(g_part_dumpconf, g_part_ebr_dumpconf),
102 KOBJMETHOD(g_part_dumpto, g_part_ebr_dumpto),
103 #if defined(GEOM_PART_EBR_COMPAT)
104 KOBJMETHOD(g_part_fullname, g_part_ebr_fullname),
106 KOBJMETHOD(g_part_modify, g_part_ebr_modify),
107 KOBJMETHOD(g_part_name, g_part_ebr_name),
108 KOBJMETHOD(g_part_precheck, g_part_ebr_precheck),
109 KOBJMETHOD(g_part_probe, g_part_ebr_probe),
110 KOBJMETHOD(g_part_read, g_part_ebr_read),
111 KOBJMETHOD(g_part_setunset, g_part_ebr_setunset),
112 KOBJMETHOD(g_part_type, g_part_ebr_type),
113 KOBJMETHOD(g_part_write, g_part_ebr_write),
117 static struct g_part_scheme g_part_ebr_scheme = {
120 sizeof(struct g_part_ebr_table),
121 .gps_entrysz = sizeof(struct g_part_ebr_entry),
123 .gps_maxent = INT_MAX,
125 G_PART_SCHEME_DECLARE(g_part_ebr);
127 static struct g_part_ebr_alias {
130 } ebr_alias_match[] = {
131 { DOSPTYP_386BSD, G_PART_ALIAS_FREEBSD },
132 { DOSPTYP_NTFS, G_PART_ALIAS_MS_NTFS },
133 { DOSPTYP_FAT32, G_PART_ALIAS_MS_FAT32 },
134 { DOSPTYP_LINSWP, G_PART_ALIAS_LINUX_SWAP },
135 { DOSPTYP_LINUX, G_PART_ALIAS_LINUX_DATA },
136 { DOSPTYP_LINLVM, G_PART_ALIAS_LINUX_LVM },
137 { DOSPTYP_LINRAID, G_PART_ALIAS_LINUX_RAID },
140 static void ebr_set_chs(struct g_part_table *, uint32_t, u_char *, u_char *,
144 ebr_entry_decode(const char *p, struct dos_partition *ent)
148 ent->dp_ssect = p[2];
152 ent->dp_esect = p[6];
154 ent->dp_start = le32dec(p + 8);
155 ent->dp_size = le32dec(p + 12);
159 ebr_entry_link(struct g_part_table *table, uint32_t start, uint32_t end,
163 buf[0] = 0 /* dp_flag */;
164 ebr_set_chs(table, start, &buf[3] /* dp_scyl */, &buf[1] /* dp_shd */,
165 &buf[2] /* dp_ssect */);
166 buf[4] = 5 /* dp_typ */;
167 ebr_set_chs(table, end, &buf[7] /* dp_ecyl */, &buf[5] /* dp_ehd */,
168 &buf[6] /* dp_esect */);
169 le32enc(buf + 8, start);
170 le32enc(buf + 12, end - start + 1);
174 ebr_parse_type(const char *type, u_char *dp_typ)
181 if (type[0] == '!') {
182 lt = strtol(type + 1, &endp, 0);
183 if (type[1] == '\0' || *endp != '\0' || lt <= 0 || lt >= 256)
185 *dp_typ = (u_char)lt;
189 i < sizeof(ebr_alias_match) / sizeof(ebr_alias_match[0]); i++) {
190 alias = g_part_alias_name(ebr_alias_match[i].alias);
191 if (strcasecmp(type, alias) == 0) {
192 *dp_typ = ebr_alias_match[i].typ;
201 ebr_set_chs(struct g_part_table *table, uint32_t lba, u_char *cylp, u_char *hdp,
204 uint32_t cyl, hd, sec;
206 sec = lba % table->gpt_sectors + 1;
207 lba /= table->gpt_sectors;
208 hd = lba % table->gpt_heads;
209 lba /= table->gpt_heads;
216 *secp = (sec & 0x3f) | ((cyl >> 2) & 0xc0);
220 g_part_ebr_add(struct g_part_table *basetable, struct g_part_entry *baseentry,
221 struct g_part_parms *gpp)
224 struct g_provider *pp;
225 struct g_part_ebr_entry *entry;
226 uint32_t start, size, sectors;
228 if (gpp->gpp_parms & G_PART_PARM_LABEL)
231 gp = basetable->gpt_gp;
232 pp = LIST_FIRST(&gp->consumer)->provider;
233 sectors = basetable->gpt_sectors;
235 entry = (struct g_part_ebr_entry *)baseentry;
237 start = gpp->gpp_start;
238 size = gpp->gpp_size;
239 if (size < 2 * sectors)
241 if (start % sectors) {
242 size = size - sectors + (start % sectors);
243 start = start - (start % sectors) + sectors;
246 size = size - (size % sectors);
247 if (size < 2 * sectors)
250 if (baseentry->gpe_deleted)
251 bzero(&entry->ent, sizeof(entry->ent));
253 KASSERT(baseentry->gpe_start <= start, ("%s", __func__));
254 KASSERT(baseentry->gpe_end >= start + size - 1, ("%s", __func__));
255 baseentry->gpe_index = (start / sectors) + 1;
256 baseentry->gpe_offset = (off_t)(start + sectors) * pp->sectorsize;
257 baseentry->gpe_start = start;
258 baseentry->gpe_end = start + size - 1;
259 entry->ent.dp_start = sectors;
260 entry->ent.dp_size = size - sectors;
261 ebr_set_chs(basetable, entry->ent.dp_start, &entry->ent.dp_scyl,
262 &entry->ent.dp_shd, &entry->ent.dp_ssect);
263 ebr_set_chs(basetable, baseentry->gpe_end, &entry->ent.dp_ecyl,
264 &entry->ent.dp_ehd, &entry->ent.dp_esect);
265 return (ebr_parse_type(gpp->gpp_type, &entry->ent.dp_typ));
269 g_part_ebr_create(struct g_part_table *basetable, struct g_part_parms *gpp)
272 struct g_consumer *cp;
273 struct g_provider *pp;
277 pp = gpp->gpp_provider;
279 if (pp->sectorsize < EBRSIZE)
281 if (pp->sectorsize > 4096)
284 /* Check that we have a parent and that it's a MBR. */
285 if (basetable->gpt_depth == 0)
287 cp = LIST_FIRST(&pp->consumers);
288 error = g_getattr("PART::scheme", cp, &psn);
291 if (strcmp(psn, "MBR"))
294 msize = MIN(pp->mediasize / pp->sectorsize, UINT32_MAX);
295 basetable->gpt_first = 0;
296 basetable->gpt_last = msize - 1;
297 basetable->gpt_entries = msize / basetable->gpt_sectors;
302 g_part_ebr_destroy(struct g_part_table *basetable, struct g_part_parms *gpp)
305 /* Wipe the first sector to clear the partitioning. */
306 basetable->gpt_smhead |= 1;
311 g_part_ebr_dumpconf(struct g_part_table *table, struct g_part_entry *baseentry,
312 struct sbuf *sb, const char *indent)
314 struct g_part_ebr_entry *entry;
316 entry = (struct g_part_ebr_entry *)baseentry;
317 if (indent == NULL) {
318 /* conftxt: libdisk compatibility */
319 sbuf_printf(sb, " xs MBREXT xt %u", entry->ent.dp_typ);
320 } else if (entry != NULL) {
321 /* confxml: partition entry information */
322 sbuf_printf(sb, "%s<rawtype>%u</rawtype>\n", indent,
324 if (entry->ent.dp_flag & 0x80)
325 sbuf_printf(sb, "%s<attrib>active</attrib>\n", indent);
327 /* confxml: scheme information */
332 g_part_ebr_dumpto(struct g_part_table *table, struct g_part_entry *baseentry)
334 struct g_part_ebr_entry *entry;
336 /* Allow dumping to a FreeBSD partition only. */
337 entry = (struct g_part_ebr_entry *)baseentry;
338 return ((entry->ent.dp_typ == DOSPTYP_386BSD) ? 1 : 0);
341 #if defined(GEOM_PART_EBR_COMPAT)
343 g_part_ebr_fullname(struct g_part_table *table, struct g_part_entry *entry,
344 struct sbuf *sb, const char *pfx)
346 struct g_part_entry *iter;
350 LIST_FOREACH(iter, &table->gpt_entry, gpe_entry) {
355 sbuf_printf(sb, "%.*s%u", (int)strlen(pfx) - 1, pfx, idx);
360 g_part_ebr_modify(struct g_part_table *basetable,
361 struct g_part_entry *baseentry, struct g_part_parms *gpp)
363 struct g_part_ebr_entry *entry;
365 if (gpp->gpp_parms & G_PART_PARM_LABEL)
368 entry = (struct g_part_ebr_entry *)baseentry;
369 if (gpp->gpp_parms & G_PART_PARM_TYPE)
370 return (ebr_parse_type(gpp->gpp_type, &entry->ent.dp_typ));
375 g_part_ebr_name(struct g_part_table *table, struct g_part_entry *entry,
376 char *buf, size_t bufsz)
379 snprintf(buf, bufsz, "+%08u", entry->gpe_index);
384 g_part_ebr_precheck(struct g_part_table *table, enum g_part_ctl req,
385 struct g_part_parms *gpp)
387 #if defined(GEOM_PART_EBR_COMPAT)
388 if (req == G_PART_CTL_DESTROY)
393 * The index is a function of the start of the partition.
394 * This is not something the user can override, nor is it
395 * something the common code will do right. We can set the
396 * index now so that we get what we need.
398 if (req == G_PART_CTL_ADD)
399 gpp->gpp_index = (gpp->gpp_start / table->gpt_sectors) + 1;
405 g_part_ebr_probe(struct g_part_table *table, struct g_consumer *cp)
408 struct g_provider *pp;
410 int error, index, res;
415 /* Sanity-check the provider. */
416 if (pp->sectorsize < EBRSIZE || pp->mediasize < pp->sectorsize)
418 if (pp->sectorsize > 4096)
421 /* Check that we have a parent and that it's a MBR. */
422 if (table->gpt_depth == 0)
424 error = g_getattr("PART::scheme", cp, &psn);
427 if (strcmp(psn, "MBR"))
430 /* Check that there's a EBR. */
431 buf = g_read_data(cp, 0L, pp->sectorsize, &error);
435 /* We goto out on mismatch. */
438 magic = le16dec(buf + DOSMAGICOFFSET);
439 if (magic != DOSMAGIC)
442 for (index = 0; index < 2; index++) {
443 p = buf + DOSPARTOFF + index * DOSPARTSIZE;
444 if (p[0] != 0 && p[0] != 0x80)
447 res = G_PART_PROBE_PRI_NORM;
455 g_part_ebr_read(struct g_part_table *basetable, struct g_consumer *cp)
457 struct dos_partition ent[2];
458 struct g_provider *pp;
459 struct g_part_entry *baseentry;
460 struct g_part_ebr_table *table;
461 struct g_part_ebr_entry *entry;
468 table = (struct g_part_ebr_table *)basetable;
469 msize = MIN(pp->mediasize / pp->sectorsize, UINT32_MAX);
473 ofs = (off_t)lba * pp->sectorsize;
474 buf = g_read_data(cp, ofs, pp->sectorsize, &error);
478 ebr_entry_decode(buf + DOSPARTOFF + 0 * DOSPARTSIZE, ent + 0);
479 ebr_entry_decode(buf + DOSPARTOFF + 1 * DOSPARTSIZE, ent + 1);
481 /* The 3rd & 4th entries should be zeroes. */
482 if (le64dec(buf + DOSPARTOFF + 2 * DOSPARTSIZE) +
483 le64dec(buf + DOSPARTOFF + 3 * DOSPARTSIZE) != 0) {
484 basetable->gpt_corrupt = 1;
485 printf("GEOM: %s: invalid entries in the EBR ignored.\n",
488 #ifndef GEOM_PART_EBR_COMPAT
489 /* Save the first EBR, it can contain a boot code */
491 bcopy(buf, table->ebr, sizeof(table->ebr));
495 if (ent[0].dp_typ == 0)
498 if (ent[0].dp_typ == 5 && ent[1].dp_typ == 0) {
499 lba = ent[0].dp_start;
503 index = (lba / basetable->gpt_sectors) + 1;
504 baseentry = (struct g_part_entry *)g_part_new_entry(basetable,
505 index, lba, lba + ent[0].dp_start + ent[0].dp_size - 1);
506 baseentry->gpe_offset = (off_t)(lba + ent[0].dp_start) *
508 entry = (struct g_part_ebr_entry *)baseentry;
511 if (ent[1].dp_typ == 0)
514 lba = ent[1].dp_start;
517 basetable->gpt_entries = msize / basetable->gpt_sectors;
518 basetable->gpt_first = 0;
519 basetable->gpt_last = msize - 1;
524 g_part_ebr_setunset(struct g_part_table *table, struct g_part_entry *baseentry,
525 const char *attrib, unsigned int set)
527 struct g_part_entry *iter;
528 struct g_part_ebr_entry *entry;
531 if (strcasecmp(attrib, "active") != 0)
534 /* Only one entry can have the active attribute. */
535 LIST_FOREACH(iter, &table->gpt_entry, gpe_entry) {
536 if (iter->gpe_deleted)
539 entry = (struct g_part_ebr_entry *)iter;
540 if (iter == baseentry) {
541 if (set && (entry->ent.dp_flag & 0x80) == 0) {
542 entry->ent.dp_flag |= 0x80;
544 } else if (!set && (entry->ent.dp_flag & 0x80)) {
545 entry->ent.dp_flag &= ~0x80;
549 if (set && (entry->ent.dp_flag & 0x80)) {
550 entry->ent.dp_flag &= ~0x80;
554 if (changed && !iter->gpe_created)
555 iter->gpe_modified = 1;
561 g_part_ebr_type(struct g_part_table *basetable, struct g_part_entry *baseentry,
562 char *buf, size_t bufsz)
564 struct g_part_ebr_entry *entry;
567 entry = (struct g_part_ebr_entry *)baseentry;
569 i < sizeof(ebr_alias_match) / sizeof(ebr_alias_match[0]); i++) {
570 if (ebr_alias_match[i].typ == entry->ent.dp_typ)
571 return (g_part_alias_name(ebr_alias_match[i].alias));
573 snprintf(buf, bufsz, "!%d", entry->ent.dp_typ);
578 g_part_ebr_write(struct g_part_table *basetable, struct g_consumer *cp)
580 #ifndef GEOM_PART_EBR_COMPAT
581 struct g_part_ebr_table *table;
583 struct g_provider *pp;
584 struct g_part_entry *baseentry, *next;
585 struct g_part_ebr_entry *entry;
591 buf = g_malloc(pp->sectorsize, M_WAITOK | M_ZERO);
592 #ifndef GEOM_PART_EBR_COMPAT
593 table = (struct g_part_ebr_table *)basetable;
594 bcopy(table->ebr, buf, DOSPARTOFF);
596 le16enc(buf + DOSMAGICOFFSET, DOSMAGIC);
598 baseentry = LIST_FIRST(&basetable->gpt_entry);
599 while (baseentry != NULL && baseentry->gpe_deleted)
600 baseentry = LIST_NEXT(baseentry, gpe_entry);
602 /* Wipe-out the first EBR when there are no slices. */
603 if (baseentry == NULL) {
604 error = g_write_data(cp, 0, buf, pp->sectorsize);
609 * If the first partition is not in LBA 0, we need to
610 * put a "link" EBR in LBA 0.
612 if (baseentry->gpe_start != 0) {
613 ebr_entry_link(basetable, (uint32_t)baseentry->gpe_start,
614 (uint32_t)baseentry->gpe_end, buf + DOSPARTOFF);
615 error = g_write_data(cp, 0, buf, pp->sectorsize);
621 entry = (struct g_part_ebr_entry *)baseentry;
623 p = buf + DOSPARTOFF;
624 p[0] = entry->ent.dp_flag;
625 p[1] = entry->ent.dp_shd;
626 p[2] = entry->ent.dp_ssect;
627 p[3] = entry->ent.dp_scyl;
628 p[4] = entry->ent.dp_typ;
629 p[5] = entry->ent.dp_ehd;
630 p[6] = entry->ent.dp_esect;
631 p[7] = entry->ent.dp_ecyl;
632 le32enc(p + 8, entry->ent.dp_start);
633 le32enc(p + 12, entry->ent.dp_size);
635 next = LIST_NEXT(baseentry, gpe_entry);
636 while (next != NULL && next->gpe_deleted)
637 next = LIST_NEXT(next, gpe_entry);
641 ebr_entry_link(basetable, (uint32_t)next->gpe_start,
642 (uint32_t)next->gpe_end, p);
644 bzero(p, DOSPARTSIZE);
646 error = g_write_data(cp, baseentry->gpe_start * pp->sectorsize,
647 buf, pp->sectorsize);
648 #ifndef GEOM_PART_EBR_COMPAT
649 if (baseentry->gpe_start == 0)
650 bzero(buf, DOSPARTOFF);
653 } while (!error && baseentry != NULL);