xref: /freebsd/sys/geom/part/g_part_ebr.c (revision 3c87aa1d3dc1d8dad3efad322852a8e1e76dee55)
1 /*-
2  * Copyright (c) 2007-2009 Marcel Moolenaar
3  * All rights reserved.
4  *
5  * Redistribution and use in source and binary forms, with or without
6  * modification, are permitted provided that the following conditions
7  * are met:
8  *
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.
14  *
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.
25  */
26 
27 #include "opt_geom.h"
28 
29 #include <sys/cdefs.h>
30 __FBSDID("$FreeBSD$");
31 
32 #include <sys/param.h>
33 #include <sys/bio.h>
34 #include <sys/diskmbr.h>
35 #include <sys/endian.h>
36 #include <sys/kernel.h>
37 #include <sys/kobj.h>
38 #include <sys/limits.h>
39 #include <sys/lock.h>
40 #include <sys/malloc.h>
41 #include <sys/mutex.h>
42 #include <sys/queue.h>
43 #include <sys/sbuf.h>
44 #include <sys/systm.h>
45 #include <sys/sysctl.h>
46 #include <geom/geom.h>
47 #include <geom/part/g_part.h>
48 
49 #include "g_part_if.h"
50 
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");
56 #endif
57 
58 #define	EBRSIZE		512
59 
60 struct g_part_ebr_table {
61 	struct g_part_table	base;
62 #ifndef GEOM_PART_EBR_COMPAT
63 	u_char		ebr[EBRSIZE];
64 #endif
65 };
66 
67 struct g_part_ebr_entry {
68 	struct g_part_entry	base;
69 	struct dos_partition	ent;
70 };
71 
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 *);
82 #endif
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 *,
86     char *, size_t);
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 *,
94     char *, size_t);
95 static int g_part_ebr_write(struct g_part_table *, struct g_consumer *);
96 
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),
105 #endif
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),
114 	{ 0, 0 }
115 };
116 
117 static struct g_part_scheme g_part_ebr_scheme = {
118 	"EBR",
119 	g_part_ebr_methods,
120 	sizeof(struct g_part_ebr_table),
121 	.gps_entrysz = sizeof(struct g_part_ebr_entry),
122 	.gps_minent = 1,
123 	.gps_maxent = INT_MAX,
124 };
125 G_PART_SCHEME_DECLARE(g_part_ebr);
126 
127 static struct g_part_ebr_alias {
128 	u_char		typ;
129 	int		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 },
138 };
139 
140 static void ebr_set_chs(struct g_part_table *, uint32_t, u_char *, u_char *,
141     u_char *);
142 
143 static void
144 ebr_entry_decode(const char *p, struct dos_partition *ent)
145 {
146 	ent->dp_flag = p[0];
147 	ent->dp_shd = p[1];
148 	ent->dp_ssect = p[2];
149 	ent->dp_scyl = p[3];
150 	ent->dp_typ = p[4];
151 	ent->dp_ehd = p[5];
152 	ent->dp_esect = p[6];
153 	ent->dp_ecyl = p[7];
154 	ent->dp_start = le32dec(p + 8);
155 	ent->dp_size = le32dec(p + 12);
156 }
157 
158 static void
159 ebr_entry_link(struct g_part_table *table, uint32_t start, uint32_t end,
160    u_char *buf)
161 {
162 
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);
171 }
172 
173 static int
174 ebr_parse_type(const char *type, u_char *dp_typ)
175 {
176 	const char *alias;
177 	char *endp;
178 	long lt;
179 	int i;
180 
181 	if (type[0] == '!') {
182 		lt = strtol(type + 1, &endp, 0);
183 		if (type[1] == '\0' || *endp != '\0' || lt <= 0 || lt >= 256)
184 			return (EINVAL);
185 		*dp_typ = (u_char)lt;
186 		return (0);
187 	}
188 	for (i = 0;
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;
193 			return (0);
194 		}
195 	}
196 	return (EINVAL);
197 }
198 
199 
200 static void
201 ebr_set_chs(struct g_part_table *table, uint32_t lba, u_char *cylp, u_char *hdp,
202     u_char *secp)
203 {
204 	uint32_t cyl, hd, sec;
205 
206 	sec = lba % table->gpt_sectors + 1;
207 	lba /= table->gpt_sectors;
208 	hd = lba % table->gpt_heads;
209 	lba /= table->gpt_heads;
210 	cyl = lba;
211 	if (cyl > 1023)
212 		sec = hd = cyl = ~0;
213 
214 	*cylp = cyl & 0xff;
215 	*hdp = hd & 0xff;
216 	*secp = (sec & 0x3f) | ((cyl >> 2) & 0xc0);
217 }
218 
219 static int
220 g_part_ebr_add(struct g_part_table *basetable, struct g_part_entry *baseentry,
221     struct g_part_parms *gpp)
222 {
223 	struct g_geom *gp;
224 	struct g_provider *pp;
225 	struct g_part_ebr_entry *entry;
226 	uint32_t start, size, sectors;
227 
228 	if (gpp->gpp_parms & G_PART_PARM_LABEL)
229 		return (EINVAL);
230 
231 	gp = basetable->gpt_gp;
232 	pp = LIST_FIRST(&gp->consumer)->provider;
233 	sectors = basetable->gpt_sectors;
234 
235 	entry = (struct g_part_ebr_entry *)baseentry;
236 
237 	start = gpp->gpp_start;
238 	size = gpp->gpp_size;
239 	if (size < 2 * sectors)
240 		return (EINVAL);
241 	if (start % sectors) {
242 		size = size - sectors + (start % sectors);
243 		start = start - (start % sectors) + sectors;
244 	}
245 	if (size % sectors)
246 		size = size - (size % sectors);
247 	if (size < 2 * sectors)
248 		return (EINVAL);
249 
250 	if (baseentry->gpe_deleted)
251 		bzero(&entry->ent, sizeof(entry->ent));
252 
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));
266 }
267 
268 static int
269 g_part_ebr_create(struct g_part_table *basetable, struct g_part_parms *gpp)
270 {
271 	char psn[8];
272 	struct g_consumer *cp;
273 	struct g_provider *pp;
274 	uint32_t msize;
275 	int error;
276 
277 	pp = gpp->gpp_provider;
278 
279 	if (pp->sectorsize < EBRSIZE)
280 		return (ENOSPC);
281 	if (pp->sectorsize > 4096)
282 		return (ENXIO);
283 
284 	/* Check that we have a parent and that it's a MBR. */
285 	if (basetable->gpt_depth == 0)
286 		return (ENXIO);
287 	cp = LIST_FIRST(&pp->consumers);
288 	error = g_getattr("PART::scheme", cp, &psn);
289 	if (error)
290 		return (error);
291 	if (strcmp(psn, "MBR"))
292 		return (ENXIO);
293 
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;
298 	return (0);
299 }
300 
301 static int
302 g_part_ebr_destroy(struct g_part_table *basetable, struct g_part_parms *gpp)
303 {
304 
305 	/* Wipe the first sector to clear the partitioning. */
306 	basetable->gpt_smhead |= 1;
307 	return (0);
308 }
309 
310 static void
311 g_part_ebr_dumpconf(struct g_part_table *table, struct g_part_entry *baseentry,
312     struct sbuf *sb, const char *indent)
313 {
314 	struct g_part_ebr_entry *entry;
315 
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,
323 		    entry->ent.dp_typ);
324 		if (entry->ent.dp_flag & 0x80)
325 			sbuf_printf(sb, "%s<attrib>active</attrib>\n", indent);
326 	} else {
327 		/* confxml: scheme information */
328 	}
329 }
330 
331 static int
332 g_part_ebr_dumpto(struct g_part_table *table, struct g_part_entry *baseentry)
333 {
334 	struct g_part_ebr_entry *entry;
335 
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);
339 }
340 
341 #if defined(GEOM_PART_EBR_COMPAT)
342 static void
343 g_part_ebr_fullname(struct g_part_table *table, struct g_part_entry *entry,
344     struct sbuf *sb, const char *pfx)
345 {
346 	struct g_part_entry *iter;
347 	u_int idx;
348 
349 	idx = 5;
350 	LIST_FOREACH(iter, &table->gpt_entry, gpe_entry) {
351 		if (iter == entry)
352 			break;
353 		idx++;
354 	}
355 	sbuf_printf(sb, "%.*s%u", (int)strlen(pfx) - 1, pfx, idx);
356 }
357 #endif
358 
359 static int
360 g_part_ebr_modify(struct g_part_table *basetable,
361     struct g_part_entry *baseentry, struct g_part_parms *gpp)
362 {
363 	struct g_part_ebr_entry *entry;
364 
365 	if (gpp->gpp_parms & G_PART_PARM_LABEL)
366 		return (EINVAL);
367 
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));
371 	return (0);
372 }
373 
374 static const char *
375 g_part_ebr_name(struct g_part_table *table, struct g_part_entry *entry,
376     char *buf, size_t bufsz)
377 {
378 
379 	snprintf(buf, bufsz, "+%08u", entry->gpe_index);
380 	return (buf);
381 }
382 
383 static int
384 g_part_ebr_precheck(struct g_part_table *table, enum g_part_ctl req,
385     struct g_part_parms *gpp)
386 {
387 #if defined(GEOM_PART_EBR_COMPAT)
388 	if (req == G_PART_CTL_DESTROY)
389 		return (0);
390 	return (ECANCELED);
391 #else
392 	/*
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.
397 	 */
398 	if (req == G_PART_CTL_ADD)
399 		gpp->gpp_index = (gpp->gpp_start / table->gpt_sectors) + 1;
400 	return (0);
401 #endif
402 }
403 
404 static int
405 g_part_ebr_probe(struct g_part_table *table, struct g_consumer *cp)
406 {
407 	char psn[8];
408 	struct g_provider *pp;
409 	u_char *buf, *p;
410 	int error, index, res;
411 	uint16_t magic;
412 
413 	pp = cp->provider;
414 
415 	/* Sanity-check the provider. */
416 	if (pp->sectorsize < EBRSIZE || pp->mediasize < pp->sectorsize)
417 		return (ENOSPC);
418 	if (pp->sectorsize > 4096)
419 		return (ENXIO);
420 
421 	/* Check that we have a parent and that it's a MBR. */
422 	if (table->gpt_depth == 0)
423 		return (ENXIO);
424 	error = g_getattr("PART::scheme", cp, &psn);
425 	if (error)
426 		return (error);
427 	if (strcmp(psn, "MBR"))
428 		return (ENXIO);
429 
430 	/* Check that there's a EBR. */
431 	buf = g_read_data(cp, 0L, pp->sectorsize, &error);
432 	if (buf == NULL)
433 		return (error);
434 
435 	/* We goto out on mismatch. */
436 	res = ENXIO;
437 
438 	magic = le16dec(buf + DOSMAGICOFFSET);
439 	if (magic != DOSMAGIC)
440 		goto out;
441 
442 	for (index = 0; index < 2; index++) {
443 		p = buf + DOSPARTOFF + index * DOSPARTSIZE;
444 		if (p[0] != 0 && p[0] != 0x80)
445 			goto out;
446 	}
447 	res = G_PART_PROBE_PRI_NORM;
448 
449  out:
450 	g_free(buf);
451 	return (res);
452 }
453 
454 static int
455 g_part_ebr_read(struct g_part_table *basetable, struct g_consumer *cp)
456 {
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;
462 	u_char *buf;
463 	off_t ofs, msize;
464 	u_int lba;
465 	int error, index;
466 
467 	pp = cp->provider;
468 	table = (struct g_part_ebr_table *)basetable;
469 	msize = MIN(pp->mediasize / pp->sectorsize, UINT32_MAX);
470 
471 	lba = 0;
472 	while (1) {
473 		ofs = (off_t)lba * pp->sectorsize;
474 		buf = g_read_data(cp, ofs, pp->sectorsize, &error);
475 		if (buf == NULL)
476 			return (error);
477 
478 		ebr_entry_decode(buf + DOSPARTOFF + 0 * DOSPARTSIZE, ent + 0);
479 		ebr_entry_decode(buf + DOSPARTOFF + 1 * DOSPARTSIZE, ent + 1);
480 
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",
486 			    pp->name);
487 		}
488 #ifndef GEOM_PART_EBR_COMPAT
489 		/* Save the first EBR, it can contain a boot code */
490 		if (lba == 0)
491 			bcopy(buf, table->ebr, sizeof(table->ebr));
492 #endif
493 		g_free(buf);
494 
495 		if (ent[0].dp_typ == 0)
496 			break;
497 
498 		if (ent[0].dp_typ == 5 && ent[1].dp_typ == 0) {
499 			lba = ent[0].dp_start;
500 			continue;
501 		}
502 
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) *
507 		    pp->sectorsize;
508 		entry = (struct g_part_ebr_entry *)baseentry;
509 		entry->ent = ent[0];
510 
511 		if (ent[1].dp_typ == 0)
512 			break;
513 
514 		lba = ent[1].dp_start;
515 	}
516 
517 	basetable->gpt_entries = msize / basetable->gpt_sectors;
518 	basetable->gpt_first = 0;
519 	basetable->gpt_last = msize - 1;
520 	return (0);
521 }
522 
523 static int
524 g_part_ebr_setunset(struct g_part_table *table, struct g_part_entry *baseentry,
525     const char *attrib, unsigned int set)
526 {
527 	struct g_part_entry *iter;
528 	struct g_part_ebr_entry *entry;
529 	int changed;
530 
531 	if (strcasecmp(attrib, "active") != 0)
532 		return (EINVAL);
533 
534 	/* Only one entry can have the active attribute. */
535 	LIST_FOREACH(iter, &table->gpt_entry, gpe_entry) {
536 		if (iter->gpe_deleted)
537 			continue;
538 		changed = 0;
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;
543 				changed = 1;
544 			} else if (!set && (entry->ent.dp_flag & 0x80)) {
545 				entry->ent.dp_flag &= ~0x80;
546 				changed = 1;
547 			}
548 		} else {
549 			if (set && (entry->ent.dp_flag & 0x80)) {
550 				entry->ent.dp_flag &= ~0x80;
551 				changed = 1;
552 			}
553 		}
554 		if (changed && !iter->gpe_created)
555 			iter->gpe_modified = 1;
556 	}
557 	return (0);
558 }
559 
560 static const char *
561 g_part_ebr_type(struct g_part_table *basetable, struct g_part_entry *baseentry,
562     char *buf, size_t bufsz)
563 {
564 	struct g_part_ebr_entry *entry;
565 	int i;
566 
567 	entry = (struct g_part_ebr_entry *)baseentry;
568 	for (i = 0;
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));
572 	}
573 	snprintf(buf, bufsz, "!%d", entry->ent.dp_typ);
574 	return (buf);
575 }
576 
577 static int
578 g_part_ebr_write(struct g_part_table *basetable, struct g_consumer *cp)
579 {
580 #ifndef GEOM_PART_EBR_COMPAT
581 	struct g_part_ebr_table *table;
582 #endif
583 	struct g_provider *pp;
584 	struct g_part_entry *baseentry, *next;
585 	struct g_part_ebr_entry *entry;
586 	u_char *buf;
587 	u_char *p;
588 	int error;
589 
590 	pp = cp->provider;
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);
595 #endif
596 	le16enc(buf + DOSMAGICOFFSET, DOSMAGIC);
597 
598 	baseentry = LIST_FIRST(&basetable->gpt_entry);
599 	while (baseentry != NULL && baseentry->gpe_deleted)
600 		baseentry = LIST_NEXT(baseentry, gpe_entry);
601 
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);
605 		goto out;
606 	}
607 
608 	/*
609 	 * If the first partition is not in LBA 0, we need to
610 	 * put a "link" EBR in LBA 0.
611 	 */
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);
616 		if (error)
617 			goto out;
618 	}
619 
620 	do {
621 		entry = (struct g_part_ebr_entry *)baseentry;
622 
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);
634 
635 		next = LIST_NEXT(baseentry, gpe_entry);
636 		while (next != NULL && next->gpe_deleted)
637 			next = LIST_NEXT(next, gpe_entry);
638 
639 		p += DOSPARTSIZE;
640 		if (next != NULL)
641 			ebr_entry_link(basetable, (uint32_t)next->gpe_start,
642 			    (uint32_t)next->gpe_end, p);
643 		else
644 			bzero(p, DOSPARTSIZE);
645 
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);
651 #endif
652 		baseentry = next;
653 	} while (!error && baseentry != NULL);
654 
655  out:
656 	g_free(buf);
657 	return (error);
658 }
659