bsddisklabel.c revision 1.24 1 /* $NetBSD: bsddisklabel.c,v 1.24 2019/08/01 16:48:06 martin Exp $ */
2
3 /*
4 * Copyright 1997 Piermont Information Systems Inc.
5 * All rights reserved.
6 *
7 * Based on code written by Philip A. Nelson for Piermont Information
8 * Systems Inc.
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. The name of Piermont Information Systems Inc. may not be used to endorse
19 * or promote products derived from this software without specific prior
20 * written permission.
21 *
22 * THIS SOFTWARE IS PROVIDED BY PIERMONT INFORMATION SYSTEMS INC. ``AS IS''
23 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL PIERMONT INFORMATION SYSTEMS INC. BE
26 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
27 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
28 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
29 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
30 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
31 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
32 * THE POSSIBILITY OF SUCH DAMAGE.
33 */
34
35 /* bsddisklabel.c -- generate standard BSD disklabel */
36 /* Included by appropriate arch/XXXX/md.c */
37
38 #include <sys/param.h>
39 #include <sys/sysctl.h>
40 #include <sys/exec.h>
41 #include <sys/utsname.h>
42 #include <sys/types.h>
43 #include <sys/stat.h>
44 #include <machine/cpu.h>
45 #include <assert.h>
46 #include <stdio.h>
47 #include <stddef.h>
48 #include <util.h>
49 #include <dirent.h>
50 #include "defs.h"
51 #include "md.h"
52 #include "defsizes.h"
53 #include "endian.h"
54 #include "msg_defs.h"
55 #include "menu_defs.h"
56
57 static size_t fill_ptn_menu(struct partition_usage_set *pset);
58
59 /*
60 * The default partition layout.
61 */
62 static const struct part_usage_info
63 default_parts_init[] =
64 {
65 /*
66 * Pretty complex setup for boot partitions.
67 * This is copy&pasted below, please keep in sync!
68 */
69 #ifdef PART_BOOT
70 { .size = PART_BOOT/512, /* PART_BOOT is in BYTE, not MB! */
71 #ifdef PART_BOOT_MOUNT
72 .mount = PART_BOOT_MOUNT,
73 .instflags = PUIINST_MOUNT|PUIINST_BOOT,
74 #else
75 .instflags = PUIINST_BOOT,
76 #endif
77 #ifdef PART_BOOT_TYPE
78 .fs_type = PART_BOOT_TYPE,
79 #if PART_BOOT_TYPE == FS_MSDOS
80 .flags = PUIFLAG_ADD_OUTER,
81 #endif
82 #endif
83 #ifdef PART_BOOT_SUBT
84 .fs_version = PART_BOOT_SUBT,
85 #endif
86 },
87 #endif
88
89 /*
90 * Two more copies of above for _BOOT1 and _BOOT2, please
91 * keep in sync!
92 */
93 #ifdef PART_BOOT1
94 { .size = PART_BOOT1/512, /* PART_BOOT1 is in BYTE, not MB! */
95 #ifdef PART_BOOT1_MOUNT
96 .mount = PART_BOOT1_MOUNT,
97 .instflags = PUIINST_MOUNT|PUIINST_BOOT,
98 #else
99 .instflags = PUIINST_MOUNT|PUIINST_BOOT,
100 #endif
101 #ifdef PART_BOOT1_TYPE
102 .fs_type = PART_BOOT1_TYPE,
103 #if PART_BOOT1_TYPE == FS_MSDOS
104 .flags = PUIFLAG_ADD_OUTER,
105 #endif
106 #endif
107 #ifdef PART_BOOT1_SUBT
108 .fs_version = PART_BOOT1_SUBT,
109 #endif
110 },
111 #endif
112 #ifdef PART_BOOT2
113 { .size = PART_BOOT2/512, /* PART_BOOT2 is in BYTE, not MB! */
114 #ifdef PART_BOOT2_MOUNT
115 .mount = PART_BOOT2_MOUNT,
116 .instflags = PUIINST_MOUNT|PUIINST_BOOT,
117 #else
118 .instflags = PUIINST_MOUNT|PUIINST_BOOT,
119 #endif
120 #ifdef PART_BOOT2_TYPE
121 .fs_type = PART_BOOT2_TYPE,
122 #if PART_BOOT2_TYPE == FS_MSDOS
123 .flags = PUIFLAG_ADD_OUTER,
124 #endif
125 #endif
126 #ifdef PART_BOOT2_SUBT
127 .fs_version = PART_BOOT1_SUBT,
128 #endif
129 },
130 #endif
131
132 { .size = DEFROOTSIZE*(MEG/512), .mount = "/", .type = PT_root,
133 .flags = PUIFLAG_EXTEND },
134 {
135 #if DEFSWAPSIZE > 0
136 .size = DEFSWAPSIZE*(MEG/512),
137 #endif
138 .type = PT_swap, .fs_type = FS_SWAP },
139 #ifdef HAVE_TMPFS
140 { .type = PT_root, .mount = "/tmp", .fs_type = FS_TMPFS,
141 .flags = PUIFLG_JUST_MOUNTPOINT },
142 #else
143 { .type = PT_root, .mount = "/tmp", .fs_type = FS_MFS,
144 .flags = PUIFLG_JUST_MOUNTPOINT },
145 #endif
146 { .def_size = DEFUSRSIZE*(MEG/512), .mount = "/usr", .type = PT_root },
147 { .def_size = DEFVARSIZE*(MEG/512), .mount = "/var", .type = PT_root },
148 };
149
150 #if 0 // XXX
151 static int
152 save_ptn(int ptn, daddr_t start, daddr_t size, int fstype, const char *mountpt)
153 {
154 static int maxptn;
155 partinfo *p;
156 int pp;
157 char *buf;
158
159 if (maxptn == 0)
160 maxptn = getmaxpartitions();
161
162 if (ptn < 0 || PI_FSTYPE(&pm->bsdlabel[ptn]) != FS_UNUSED) {
163 ptn = getrawpartition() + 1;
164 #ifdef PART_FIRST_FREE
165 if (ptn < PART_FIRST_FREE)
166 ptn = PART_FIRST_FREE;
167 #endif
168 for (;; ptn++) {
169 if (ptn >= maxptn)
170 return -1;
171 // XXX if (ptn == PART_USR)
172 // continue;
173 if (PI_FSTYPE(&pm->bsdlabel[ptn]) == FS_UNUSED)
174 break;
175 }
176 }
177
178 if (fstype == FS_UNUSED)
179 return ptn;
180
181 p = pm->bsdlabel + ptn;
182 PI_SET_OFFSET(p, start);
183 PI_SET_SIZE(p, size);
184 set_ptype(p, fstype, mountpt ? PIF_NEWFS : 0);
185
186 /* Hack because we does not have something like FS_LVMPV */
187 p->lvmpv = 0;
188 if (mountpt != NULL && strcmp(mountpt, "lvm") == 0)
189 p->lvmpv = 1;
190 else if (mountpt != NULL) {
191 for (pp = 0; pp < maxptn; pp++) {
192 if (strcmp(pm->bsdlabel[pp].pi_mount, mountpt) == 0)
193 pm->bsdlabel[pp].pi_flags &= ~PIF_MOUNT;
194 }
195 if (mountpt[0] != '/')
196 asprintf(&buf, "/%s", mountpt);
197 else
198 asprintf(&buf, "%s", mountpt);
199 strlcpy(p->pi_mount, buf, sizeof p->pi_mount);
200 p->pi_flags |= PIF_MOUNT;
201 /* Default to UFS2. */
202 if (PI_FSTYPE(p) == FS_BSDFFS) {
203 #ifdef DEFAULT_UFS2
204 #ifndef HAVE_UFS2_BOOT
205 if (strcmp(mountpt, "/") != 0)
206 #endif
207 p->pi_flags |= PIF_FFSv2;
208 #endif
209 }
210 free(buf);
211 }
212 return ptn;
213 }
214 #endif
215
216
217 static const char size_separator[] =
218 "----------------------------------- - --------------------";
219 static char size_menu_title[STRSIZE];
220 static char size_menu_exit[MENUSTRSIZE];
221
222 static void
223 set_pset_exit_str(struct partition_usage_set *pset)
224 {
225 char *str, num[25];
226 const char *args[2];
227 bool overrun;
228 daddr_t free_space = pset->cur_free_space;
229
230 /* format exit string */
231 overrun = free_space < 0;
232 if (overrun)
233 free_space = -free_space;
234
235 snprintf(num, sizeof(num), "%" PRIu64, free_space / sizemult);
236 args[0] = num;
237 args[1] = multname;
238 str = str_arg_subst(
239 msg_string(overrun ? MSG_fssizesbad : MSG_fssizesok),
240 2, args);
241 strlcpy(size_menu_exit, str, sizeof(size_menu_exit));
242 free(str);
243 }
244
245 static void
246 draw_size_menu_header(menudesc *m, void *arg)
247 {
248 struct partition_usage_set *pset = arg;
249 size_t i;
250 char col1[70], desc[MENUSTRSIZE];
251 bool need_ext = false, need_existing = false;
252
253 msg_display(MSG_ptnsizes);
254
255 for (i = 0; i < pset->num; i++) {
256 if (pset->infos[i].flags & PUIFLG_IS_OUTER)
257 need_ext = true;
258 else if (pset->infos[i].cur_part_id != NO_PART)
259 need_existing = true;
260 }
261 if (need_ext && need_existing)
262 snprintf(desc, sizeof desc, "%s, %s",
263 msg_string(MSG_ptnsizes_mark_existing),
264 msg_string(MSG_ptnsizes_mark_external));
265 else if (need_existing)
266 strlcpy(desc, msg_string(MSG_ptnsizes_mark_existing),
267 sizeof desc);
268 else if (need_ext)
269 strlcpy(desc, msg_string(MSG_ptnsizes_mark_external),
270 sizeof desc);
271 if (need_ext || need_existing) {
272 msg_printf("\n");
273 msg_display_add_subst(msg_string(MSG_ptnsizes_markers),
274 1, &desc);
275 }
276 msg_printf("\n\n");
277
278 /* update menu title */
279 snprintf(col1, sizeof col1, "%s (%s)", msg_string(MSG_ptnheaders_size),
280 multname);
281 snprintf(size_menu_title, sizeof size_menu_title,
282 " %-37.37s %s\n %s", col1,
283 msg_string(MSG_ptnheaders_filesystem), size_separator);
284 }
285
286 static void
287 draw_size_menu_line(menudesc *m, int opt, void *arg)
288 {
289 struct partition_usage_set *pset = arg;
290 daddr_t size;
291 char psize[38], inc_free[16], flag, swap[40];
292 const char *mount;
293 bool free_mount = false;
294
295 if (opt < 0 || (size_t)opt >= pset->num)
296 return;
297
298 inc_free[0] = 0;
299 if ((pset->infos[opt].flags & PUIFLAG_EXTEND) &&
300 pset->cur_free_space > 0) {
301 size = pset->infos[opt].size + pset->cur_free_space;
302 snprintf(inc_free, sizeof inc_free, " (%" PRIu64 ")",
303 size / sizemult);
304 }
305 size = pset->infos[opt].size;
306 snprintf(psize, sizeof psize, "%" PRIu64 "%s",
307 size / sizemult, inc_free);
308
309 if (pset->infos[opt].type == PT_swap) {
310 snprintf(swap, sizeof swap, "<%s>",
311 msg_string(MSG_swap_display));
312 mount = swap;
313 } else if (pset->infos[opt].flags & PUIFLG_JUST_MOUNTPOINT) {
314 snprintf(swap, sizeof swap, "%s (%s)",
315 pset->infos[opt].mount,
316 getfslabelname(pset->infos[opt].fs_type,
317 pset->infos[opt].fs_version));
318 mount = swap;
319 } else if (pset->infos[opt].mount[0]) {
320 mount = pset->infos[opt].mount;
321 } else {
322 mount = NULL;
323 if (pset->infos[opt].parts->pscheme->other_partition_identifier
324 && pset->infos[opt].cur_part_id != NO_PART)
325 mount = pset->infos[opt].parts->pscheme->
326 other_partition_identifier(pset->infos[opt].parts,
327 pset->infos[opt].cur_part_id);
328 if (mount == NULL)
329 mount = getfslabelname(pset->infos[opt].fs_type,
330 pset->infos[opt].fs_version);
331 mount = str_arg_subst(msg_string(MSG_size_ptn_not_mounted),
332 1, &mount);
333 free_mount = true;
334 }
335 flag = ' ';
336 if (pset->infos[opt].flags & PUIFLAG_EXTEND)
337 flag = '+';
338 else if (pset->infos[opt].flags & PUIFLG_IS_OUTER)
339 flag = '@';
340 else if (pset->infos[opt].cur_part_id != NO_PART)
341 flag = '=';
342 wprintw(m->mw, "%-35.35s %c %s", psize, flag, mount);
343 if (free_mount)
344 free(__UNCONST(mount));
345
346 if (opt == 0)
347 set_pset_exit_str(pset);
348 }
349
350 static int
351 add_other_ptn_size(menudesc *menu, void *arg)
352 {
353 struct partition_usage_set *pset = arg;
354 struct part_usage_info *p;
355 struct menu_ent *m;
356 char new_mp[MOUNTLEN], *err;
357 const char *args;
358
359 for (;;) {
360 msg_prompt_win(partman_go?MSG_askfsmountadv:MSG_askfsmount,
361 -1, 18, 0, 0, NULL, new_mp, sizeof(new_mp));
362 if (new_mp[0] == 0)
363 return 0;
364 if (new_mp[0] != '/') {
365 /* we need absolute mount paths */
366 memmove(new_mp+1, new_mp, sizeof(new_mp)-1);
367 new_mp[0] = '/';
368 }
369
370 /* duplicates? */
371 bool duplicate = false;
372 for (size_t i = 0; i < pset->num; i++) {
373 if (strcmp(pset->infos[i].mount,
374 new_mp) == 0) {
375 args = new_mp;
376 err = str_arg_subst(
377 msg_string(MSG_mp_already_exists),
378 1, &args);
379 err_msg_win(err);
380 free(err);
381 duplicate = true;
382 break;
383 }
384 }
385 if (!duplicate)
386 break;
387 }
388
389 m = realloc(pset->menu_opts, (pset->num+4)*sizeof(*pset->menu_opts));
390 if (m == NULL)
391 return 0;
392 p = realloc(pset->infos, (pset->num+1)*sizeof(*pset->infos));
393 if (p == NULL)
394 return 0;
395
396 pset->infos = p;
397 pset->menu_opts = m;
398 menu->opts = m;
399 menu->numopts = pset->num+4;
400 m += pset->num;
401 p += pset->num;
402 memset(m, 0, sizeof(*m));
403 memset(p, 0, sizeof(*p));
404 p->cur_part_id = NO_PART;
405 p->type = PT_root;
406 strncpy(p->mount, new_mp, sizeof(p->mount));
407
408 menu->cursel = pset->num;
409 pset->num++;
410 fill_ptn_menu(pset);
411
412 return -1;
413 }
414
415 static size_t
416 fill_ptn_menu(struct partition_usage_set *pset)
417 {
418 struct part_usage_info *p;
419 struct disk_part_info info;
420 menu_ent *m;
421 size_t i;
422 daddr_t free_space;
423
424 memset(pset->menu_opts, 0, (pset->num+3)*sizeof(*pset->menu_opts));
425 for (m = pset->menu_opts, p = pset->infos, i = 0; i < pset->num;
426 m++, p++, i++) {
427 m->opt_action = set_ptn_size;
428 }
429
430 m->opt_name = size_separator;
431 m->opt_flags = OPT_IGNORE|OPT_NOSHORT;
432 m++;
433
434 m->opt_name = MSG_add_another_ptn;
435 m->opt_action = add_other_ptn_size;
436 m++;
437
438 m->opt_name = MSG_askunits;
439 m->opt_menu = MENU_sizechoice;
440 m->opt_flags = OPT_SUB;
441 m++;
442
443 /* calculate free space */
444 free_space = pset->parts->free_space;
445 for (i = 0; i < pset->parts->num_part; i++) {
446 if (!pset->parts->pscheme->get_part_info(pset->parts, i,
447 &info))
448 continue;
449 if (info.flags & (PTI_SEC_CONTAINER|PTI_WHOLE_DISK|
450 PTI_PSCHEME_INTERNAL|PTI_RAW_PART))
451 continue;
452 free_space += info.size;
453 }
454 for (i = 0; i < pset->num; i++) {
455 if (pset->infos[i].flags &
456 (PUIFLG_IS_OUTER|PUIFLG_JUST_MOUNTPOINT))
457 continue;
458 free_space -= pset->infos[i].size;
459 }
460 pset->cur_free_space = free_space;
461 set_pset_exit_str(pset);
462
463 if (pset->menu >= 0)
464 set_menu_numopts(pset->menu, m - pset->menu_opts);
465
466 return m - pset->menu_opts;
467 }
468
469 static part_id
470 find_part_at(struct disk_partitions *parts, daddr_t start)
471 {
472 size_t i;
473 struct disk_part_info info;
474
475 for (i = 0; i < parts->num_part; i++) {
476 if (!parts->pscheme->get_part_info(parts, i, &info))
477 continue;
478 if (info.start == start)
479 return i;
480 }
481
482 return NO_PART;
483 }
484
485 int
486 set_ptn_size(menudesc *m, void *arg)
487 {
488 struct partition_usage_set *pset = arg;
489 struct part_usage_info *p = &pset->infos[m->cursel];
490 char answer[16], dflt[16];
491 const char *err_msg;
492 size_t i, root = ~0U;
493 daddr_t size, old_size, new_size_val, mult;
494 int rv;
495 bool non_zero, extend;
496
497 if (pset->cur_free_space == 0 && p->size == 0 &&
498 !(p->flags & PUIFLG_JUST_MOUNTPOINT))
499 /* Don't allow 'free_parts' to go negative */
500 return 0;
501
502 if (p->cur_part_id != NO_PART) {
503 rv = 0;
504 process_menu(MENU_ptnsize_replace_existing_partition, &rv);
505 if (rv == 0)
506 return 0;
507 if (!pset->parts->pscheme->delete_partition(pset->parts,
508 p->cur_part_id, &err_msg)) {
509 if (err_msg)
510 err_msg_win(err_msg);
511 return 0;
512 }
513 p->cur_part_id = NO_PART;
514 /*
515 * All other part ids are invalid now too - update them!
516 */
517 for (i = 0; i < pset->num; i++) {
518 if (pset->infos[i].cur_part_id == NO_PART)
519 continue;
520 pset->infos[i].cur_part_id =
521 find_part_at(pset->parts, pset->infos[i].cur_start);
522 }
523 }
524
525 size = p->size;
526 old_size = size;
527 if (size == 0)
528 size = p->def_size;
529 size /= sizemult;
530 snprintf(dflt, sizeof dflt, "%" PRIu64 "%s",
531 size, p->flags & PUIFLAG_EXTEND ? "+" : "");
532
533 for (;;) {
534 msg_fmt_prompt_win(MSG_askfssize, -1, 18, 0, 0,
535 dflt, answer, sizeof answer, "%s%s", p->mount, multname);
536
537 /* cp will be checked below */
538 mult = sizemult;
539 new_size_val = parse_disk_pos(answer, &mult, pm->dlcylsize,
540 &extend);
541
542 if (strcmp(answer, dflt) == 0)
543 non_zero = p->def_size > 0;
544 else
545 non_zero = new_size_val > 0;
546
547 /* Some special cases when /usr is first given a size */
548 if (old_size == 0 && non_zero &&
549 strcmp(p->mount, "/usr") == 0) {
550 for (i = 0; i < pset->num; i++) {
551 if (strcmp(pset->infos[i].mount, "/") == 0) {
552 root = i;
553 break;
554 }
555 }
556 /* Remove space for /usr from / */
557 if (root < pset->num && pset->infos[i].cur_part_id ==
558 NO_PART) {
559 pset->infos[root].size -= p->def_size;
560 pset->cur_free_space += p->def_size;
561 }
562 /* hack to add free space to default sized /usr */
563 if (strcmp(answer, dflt) == 0) {
564 size = p->def_size;
565 pset->infos[root].flags &= ~PUIFLAG_EXTEND;
566 p->flags |= PUIFLAG_EXTEND;
567 goto adjust_free;
568 }
569 }
570 if (new_size_val < 0)
571 continue;
572 size = new_size_val;
573 break;
574 }
575
576 daddr_t align = pset->parts->pscheme->get_part_alignment(pset->parts);
577 size = NUMSEC(size, mult, align);
578 if (p->flags & PUIFLAG_EXTEND)
579 p->flags &= ~PUIFLAG_EXTEND;
580 if (extend && (p->limit == 0 || p->limit > p->size)) {
581 p->flags |= PUIFLAG_EXTEND;
582 if (size == 0)
583 size = align;
584 }
585 if (p->limit != 0 && size > p->limit)
586 size = p->limit;
587 adjust_free:
588 if ((p->flags & (PUIFLG_IS_OUTER|PUIFLG_JUST_MOUNTPOINT)) == 0)
589 pset->cur_free_space += p->size - size;
590 p->size = size;
591 set_pset_exit_str(pset);
592
593 return 0;
594 }
595
596 /*
597 * User interface to edit a "wanted" partition layout "pset" as first
598 * abstract phase (not concrete partitions).
599 * Make sure to have everything (at least theoretically) fit the
600 * available space.
601 * During editing we keep the part_usage_info and the menu_opts
602 * in pset in sync, that is: we always allocate just enough entries
603 * in pset->infos as we have usage infos in the list (pset->num),
604 * and two additional menu entries ("add a partition" and "select units").
605 * The menu exit string changes depending on content, and implies
606 * abort while the partition set is not valid (does not fit).
607 * Return true when the user wants to continue (by editing the concrete
608 * partitions), return false to abort.
609 */
610 bool
611 get_ptn_sizes(struct partition_usage_set *pset)
612 {
613 size_t num;
614
615 wclear(stdscr);
616 wrefresh(stdscr);
617
618 if (pset->menu_opts == NULL)
619 pset->menu_opts = calloc(pset->num+3, sizeof(*pset->menu_opts));
620
621 pset->menu = -1;
622 num = fill_ptn_menu(pset);
623
624 pset->menu = new_menu(size_menu_title, pset->menu_opts, num,
625 3, -1, 12, 70,
626 MC_ALWAYS_SCROLL|MC_NOBOX|MC_NOCLEAR|MC_CONTINUOUS,
627 draw_size_menu_header, draw_size_menu_line, NULL,
628 NULL, size_menu_exit);
629
630 if (pset->menu < 0) {
631 free(pset->menu_opts);
632 pset->menu_opts = NULL;
633 return false;
634 }
635
636 pset->ok = true;
637 process_menu(pset->menu, pset);
638
639 free_menu(pset->menu);
640 free(pset->menu_opts);
641 pset->menu = -1;
642 pset->menu_opts = NULL;
643
644 if (!pset->ok)
645 return false;
646
647 #if 0
648 if (cur_ptns.menu_no < 0) {
649 /* If there is a swap partition elsewhere, don't add one here.*/
650 if (no_swap || (swap_created && partman_go)) {
651 cur_ptns.ptn_sizes[PI_SWAP].size = 0;
652 } else {
653 #if DEFSWAPSIZE == -1
654 /* Dynamic swap size. */
655 cur_ptns.ptn_sizes[PI_SWAP].dflt_size = get_ramsize();
656 cur_ptns.ptn_sizes[PI_SWAP].size =
657 cur_ptns.ptn_sizes[PI_SWAP].dflt_size;
658 #endif
659 }
660
661 /* If installing X increase default size of /usr */
662 if (set_X11_selected())
663 cur_ptns.ptn_sizes[PI_USR].dflt_size += XNEEDMB;
664
665 /* Start of planning to give free space to / */
666 cur_ptns.pool_part = &cur_ptns.ptn_sizes[PI_ROOT];
667 /* Make size of root include default size of /usr */
668 cur_ptns.ptn_sizes[PI_ROOT].size += cur_ptns.ptn_sizes[PI_USR].dflt_size;
669
670 sm = MEG / pm->sectorsize;
671
672 if (root_limit != 0) {
673 /* Bah - bios can not read all the disk, limit root */
674 cur_ptns.ptn_sizes[PI_ROOT].limit = root_limit -
675 part_start;
676 /* Allocate a /usr partition if bios can't read
677 * everything except swap.
678 */
679 if (cur_ptns.ptn_sizes[PI_ROOT].limit
680 < sectors - cur_ptns.ptn_sizes[PI_SWAP].size * sm) {
681 /* Root won't be able to access all the space */
682 /* Claw back space for /usr */
683 cur_ptns.ptn_sizes[PI_USR].size =
684 cur_ptns.ptn_sizes[PI_USR].dflt_size;
685 cur_ptns.ptn_sizes[PI_ROOT].size -=
686 cur_ptns.ptn_sizes[PI_USR].dflt_size;
687 cur_ptns.ptn_sizes[PI_ROOT].changed = 1;
688 /* Give free space to /usr */
689 cur_ptns.pool_part = &cur_ptns.ptn_sizes[PI_USR];
690 }
691 }
692
693 /* Change preset sizes from MB to sectors */
694 cur_ptns.free_space = sectors;
695 for (p = cur_ptns.ptn_sizes; p->mount[0]; p++) {
696 p->size = NUMSEC(p->size, sm, pm->dlcylsize);
697 p->dflt_size = NUMSEC(p->dflt_size, sm, pm->dlcylsize);
698 cur_ptns.free_space -= p->size;
699 }
700
701 /* Steal space from swap to make things fit.. */
702 if (cur_ptns.free_space < 0) {
703 i = roundup(-cur_ptns.free_space, pm->dlcylsize);
704 if (i > cur_ptns.ptn_sizes[PI_SWAP].size)
705 i = cur_ptns.ptn_sizes[PI_SWAP].size;
706 cur_ptns.ptn_sizes[PI_SWAP].size -= i;
707 cur_ptns.free_space += i;
708 }
709
710 /* Add space for 2 system dumps to / (traditional) */
711 i = get_ramsize() * sm;
712 i = roundup(i, pm->dlcylsize);
713 if (cur_ptns.free_space > i * 2)
714 i *= 2;
715 if (cur_ptns.free_space > i) {
716 cur_ptns.ptn_sizes[PI_ROOT].size += i;
717 cur_ptns.free_space -= i;
718 }
719
720 if (root_created && partman_go) {
721 cur_ptns.ptn_sizes[PI_ROOT].size = 0;
722 cur_ptns.pool_part = 0;
723 }
724
725 /* Ensure all of / is readable by the system boot code */
726 i = cur_ptns.ptn_sizes[PI_ROOT].limit;
727 if (i != 0 && (i -= cur_ptns.ptn_sizes[PI_ROOT].size) < 0) {
728 cur_ptns.ptn_sizes[PI_ROOT].size += i;
729 cur_ptns.free_space -= i;
730 }
731
732 /* Count free partition slots */
733 cur_ptns.free_parts = 0;
734 #if 0 // XXX
735 for (i = 0; i < maxpart; i++) {
736 if (pm->bsdlabel[i].pi_size == 0)
737 cur_ptns.free_parts++;
738 }
739 #endif
740 for (i = 0; i < MAXPARTITIONS; i++) {
741 p = &cur_ptns.ptn_sizes[i];
742 if (i != 0 && p->use == 0)
743 p->use = PART_EXTRA;
744 if (p->size != 0)
745 cur_ptns.free_parts--;
746 }
747
748 cur_ptns.menu_no = new_menu(0, cur_ptns.ptn_menus,
749 __arraycount(cur_ptns.ptn_menus),
750 3, -1, 12, 70,
751 MC_ALWAYS_SCROLL | MC_NOBOX | MC_NOCLEAR,
752 NULL, set_ptn_titles, NULL,
753 "help", cur_ptns.exit_msg);
754
755 if (cur_ptns.menu_no < 0)
756 return;
757 }
758
759 do {
760 set_ptn_menu(&cur_ptns);
761 pm->current_cylsize = pm->dlcylsize;
762 process_menu(cur_ptns.menu_no, &cur_ptns);
763 } while (cur_ptns.free_space < 0 || cur_ptns.free_parts < 0);
764
765 /* Give any cylinder fragment to last partition */
766 if (cur_ptns.pool_part != NULL || cur_ptns.free_space < pm->dlcylsize) {
767 for (p = cur_ptns.ptn_sizes + __arraycount(cur_ptns.ptn_sizes) - 1; ;p--) {
768 if (p->size == 0) {
769 if (p == cur_ptns.ptn_sizes)
770 break;
771 continue;
772 }
773 if (p->use == PART_TMP_RAMDISK)
774 continue;
775 p->size += cur_ptns.free_space % pm->dlcylsize;
776 cur_ptns.free_space -= cur_ptns.free_space % pm->dlcylsize;
777 break;
778 }
779 }
780
781 for (p = cur_ptns.ptn_sizes; p->mount[0]; p++, part_start += size) {
782 size = p->size;
783 if (p == cur_ptns.pool_part) {
784 size += rounddown(cur_ptns.free_space, pm->dlcylsize);
785 if (p->limit != 0 && size > p->limit)
786 size = p->limit;
787 }
788 i = p->use;
789 if (i == PART_TMP_RAMDISK) {
790 tmp_ramdisk_size = size;
791 size = 0;
792 continue;
793 }
794 if (size == 0)
795 continue;
796 if (i == PART_ROOT && size > 0)
797 root_created = 1;
798 if (i == PART_SWAP) {
799 if (size > 0)
800 swap_created = 1;
801 save_ptn(i, part_start, size, FS_SWAP, NULL);
802 continue;
803 }
804 if (!strcmp(p->mount, "raid")) {
805 save_ptn(i, part_start, size, FS_RAID, NULL);
806 continue;
807 } else if (!strcmp(p->mount, "cgd")) {
808 save_ptn(i, part_start, size, FS_CGD, NULL);
809 continue;
810 }
811 save_ptn(i, part_start, size, FS_BSDFFS, p->mount);
812 }
813 #endif
814 return true;
815 }
816
817 static int
818 set_keep_existing(menudesc *m, void *arg)
819 {
820 ((arg_rep_int*)arg)->rv = LY_KEEPEXISTING;
821 return 0;
822 }
823
824 static int
825 set_edit_part_sizes(menudesc *m, void *arg)
826 {
827 ((arg_rep_int*)arg)->rv = LY_SETSIZES;
828 return 0;
829 }
830
831 static int
832 set_use_default_sizes(menudesc *m, void *arg)
833 {
834 ((arg_rep_int*)arg)->rv = LY_USEDEFAULT;
835 return 0;
836 }
837
838 /*
839 * Check if there is a reasonable pre-existing partition for
840 * NetBSD.
841 */
842 static bool
843 check_existing_netbsd(struct disk_partitions *parts)
844 {
845 size_t nbsd_parts;
846 struct disk_part_info info;
847
848 nbsd_parts = 0;
849 for (part_id p = 0; p < parts->num_part; p++) {
850 if (!parts->pscheme->get_part_info(parts, p, &info))
851 continue;
852 if (info.flags & (PTI_PSCHEME_INTERNAL|PTI_RAW_PART))
853 continue;
854 if (info.nat_type && info.nat_type->generic_ptype == PT_root)
855 nbsd_parts++;
856 }
857
858 return nbsd_parts > 0;
859 }
860
861 /*
862 * Query a partition layout type (with available options depending on
863 * pre-existing partitions).
864 */
865 static enum layout_type
866 ask_layout(struct disk_partitions *parts, bool have_existing)
867 {
868 arg_rep_int ai;
869 const char *args[2];
870 int menu;
871 size_t num_opts;
872 menu_ent options[3], *opt;
873
874 args[0] = msg_string(parts->pscheme->name);
875 args[1] = msg_string(parts->pscheme->short_name);
876 ai.args.argv = args;
877 ai.args.argc = 2;
878 ai.rv = LY_SETSIZES;
879
880 memset(options, 0, sizeof(options));
881 num_opts = 0;
882 opt = &options[0];
883
884 if (have_existing) {
885 opt->opt_name = MSG_Keep_existing_partitions;
886 opt->opt_flags = OPT_EXIT;
887 opt->opt_action = set_keep_existing;
888 opt++;
889 num_opts++;
890 }
891 opt->opt_name = MSG_Set_Sizes;
892 opt->opt_flags = OPT_EXIT;
893 opt->opt_action = set_edit_part_sizes;
894 opt++;
895 num_opts++;
896
897 opt->opt_name = MSG_Use_Default_Parts;
898 opt->opt_flags = OPT_EXIT;
899 opt->opt_action = set_use_default_sizes;
900 opt++;
901 num_opts++;
902
903 menu = new_menu(MSG_Select_your_choice, options, num_opts,
904 -1, -10, 0, 0, MC_NOEXITOPT, NULL, NULL, NULL, NULL, NULL);
905 if (menu != -1) {
906 get_menudesc(menu)->expand_act = expand_all_option_texts;
907 process_menu(menu, &ai);
908 free_menu(menu);
909 }
910
911 return ai.rv;
912 }
913
914 static void
915 merge_part_with_wanted(struct disk_partitions *parts, part_id pno,
916 const struct disk_part_info *info, struct partition_usage_set *wanted,
917 size_t wanted_num, bool is_outer)
918 {
919 struct part_usage_info *infos;
920
921 /*
922 * does this partition match something in the wanted set?
923 */
924 for (size_t i = 0; i < wanted_num; i++) {
925 if (wanted->infos[i].type != info->nat_type->generic_ptype)
926 continue;
927 if (wanted->infos[i].type == PT_root &&
928 info->last_mounted != NULL && info->last_mounted[0] != 0 &&
929 strcmp(info->last_mounted, wanted->infos[i].mount) != 0)
930 continue;
931 if (wanted->infos[i].cur_part_id != NO_PART)
932 continue;
933 wanted->infos[i].cur_part_id = pno;
934 wanted->infos[i].parts = parts;
935 wanted->infos[i].size = info->size;
936 wanted->infos[i].cur_start = info->start;
937 wanted->infos[i].flags &= ~PUIFLAG_EXTEND;
938 if (wanted->infos[i].fs_type != FS_UNUSED &&
939 wanted->infos[i].type != PT_swap)
940 wanted->infos[i].instflags |= PUIINST_MOUNT;
941 if (is_outer)
942 wanted->infos[i].flags |= PUIFLG_IS_OUTER;
943 else
944 wanted->infos[i].flags &= ~PUIFLG_IS_OUTER;
945 return;
946 }
947
948 /*
949 * no match - if this is fromt the outer scheme, we are done.
950 * otherwise it must be inserted into the wanted set.
951 */
952 if (is_outer)
953 return;
954
955 /*
956 * create a new entry for this
957 */
958 infos = realloc(wanted->infos, sizeof(*infos)*(wanted->num+1));
959 if (infos == NULL)
960 return;
961 wanted->infos = infos;
962 infos += wanted->num;
963 wanted->num++;
964 memset(infos, 0, sizeof(*infos));
965 if (info->last_mounted != NULL && info->last_mounted[0] != 0)
966 strlcpy(infos->mount, info->last_mounted,
967 sizeof(infos->mount));
968 infos->type = info->nat_type->generic_ptype;
969 infos->cur_part_id = pno;
970 infos->parts = parts;
971 infos->size = info->size;
972 infos->cur_start = info->start;
973 infos->fs_type = info->fs_type;
974 infos->fs_version = info->fs_sub_type;
975 if (is_outer)
976 infos->flags |= PUIFLG_IS_OUTER;
977 }
978
979 static bool
980 have_x11_by_default(void)
981 {
982 static const uint8_t def_sets[] = { MD_SETS_SELECTED };
983
984 for (size_t i = 0; i < __arraycount(def_sets); i++)
985 if (def_sets[i] >= SET_X11_FIRST &&
986 def_sets[i] <= SET_X11_LAST)
987 return true;
988
989 return false;
990 }
991
992 static void
993 fill_defaults(struct partition_usage_set *wanted, struct disk_partitions *parts,
994 daddr_t ptstart, daddr_t ptsize)
995 {
996 size_t i, root = ~0U, usr = ~0U, swap = ~0U, def_usr = ~0U;
997 daddr_t free_space, dump_space, required;
998 #if defined(DEFAULT_UFS2) && !defined(HAVE_UFS2_BOOT)
999 size_t boot = ~0U;
1000 #endif
1001
1002 memset(wanted, 0, sizeof(*wanted));
1003 wanted->parts = parts;
1004 wanted->num = __arraycount(default_parts_init);
1005 wanted->infos = calloc(wanted->num, sizeof(*wanted->infos));
1006 if (wanted->infos == NULL) {
1007 err_msg_win(err_outofmem);
1008 return;
1009 }
1010
1011 memcpy(wanted->infos, default_parts_init, sizeof(default_parts_init));
1012
1013 #ifdef MD_PART_DEFAULTS
1014 MD_PART_DEFAULTS(pm, wanted->infos, wanted->num);
1015 #endif
1016
1017 for (i = 0; i < wanted->num; i++) {
1018 wanted->infos[i].parts = parts;
1019 wanted->infos[i].cur_part_id = NO_PART;
1020
1021 #if DEFSWAPSIZE == -1
1022 if (wanted->infos[i].type == PT_swap)
1023 wanted->infos[i].size = get_ramsize() * (MEG / 512);
1024 #endif
1025 if (wanted->infos[i].type == PT_swap && swap > wanted->num)
1026 swap = i;
1027 #if defined(DEFAULT_UFS2) && !defined(HAVE_UFS2_BOOT)
1028 if (wanted->infos[i].instflags & PUIINST_BOOT)
1029 boot = i;
1030 #endif
1031 if (wanted->infos[i].type == PT_root) {
1032 if (strcmp(wanted->infos[i].mount, "/") == 0) {
1033 root = i;
1034 } else if (
1035 strcmp(wanted->infos[i].mount, "/usr") == 0) {
1036 if (wanted->infos[i].size > 0)
1037 usr = i;
1038 else
1039 def_usr = i;
1040 }
1041 if (wanted->infos[i].fs_type == FS_UNUSED)
1042 wanted->infos[i].fs_type = FS_BSDFFS;
1043 if (wanted->infos[i].fs_type == FS_BSDFFS) {
1044 #ifdef DEFAULT_UFS2
1045 #ifndef HAVE_UFS2_BOOT
1046 if (boot < wanted->num || i != root)
1047 #endif
1048 wanted->infos[i].fs_version = 2;
1049 #endif
1050 }
1051 }
1052 if ((wanted->infos[i].flags & PUIFLG_JUST_MOUNTPOINT) &&
1053 wanted->infos[i].size == 0)
1054 /* default tmpfs to 1/4 RAM */
1055 wanted->infos[i].def_size =
1056 get_ramsize() * (MEG/512/4);
1057 }
1058
1059 /*
1060 * Now we have the defaults as if we were installing to an
1061 * empty disk. Merge the partitions in target range that are already
1062 * there (match with wanted) or are there additionaly.
1063 * The only thing outside of target range that we care for
1064 * is a potential swap partition - we assume one is enough.
1065 */
1066 size_t num = wanted->num;
1067 if (parts->parent) {
1068 for (part_id pno = 0; pno < parts->parent->num_part; pno++) {
1069 struct disk_part_info info;
1070
1071 if (!parts->parent->pscheme->get_part_info(
1072 parts->parent, pno, &info))
1073 continue;
1074 if (info.nat_type->generic_ptype != PT_swap)
1075 continue;
1076 merge_part_with_wanted(parts->parent, pno, &info,
1077 wanted, num, true);
1078 break;
1079 }
1080 }
1081 for (part_id pno = 0; pno < parts->num_part; pno++) {
1082 struct disk_part_info info;
1083
1084 if (!parts->pscheme->get_part_info(parts, pno, &info))
1085 continue;
1086
1087 if (info.flags & PTI_PSCHEME_INTERNAL)
1088 continue;
1089
1090 if (info.nat_type->generic_ptype != PT_swap &&
1091 (info.start < ptstart ||
1092 (info.start + info.size) > (ptstart+ptsize)))
1093 continue;
1094
1095 merge_part_with_wanted(parts, pno, &info,
1096 wanted, num, false);
1097 }
1098
1099 daddr_t align = parts->pscheme->get_part_alignment(parts);
1100
1101 if (root < wanted->num && wanted->infos[root].cur_part_id == NO_PART) {
1102 daddr_t max_root_size = parts->disk_start + parts->disk_size;
1103 if (root_limit > 0) {
1104 /* Bah - bios can not read all the disk, limit root */
1105 max_root_size = root_limit - parts->disk_start;
1106 }
1107 wanted->infos[root].limit = max_root_size;
1108 }
1109
1110 if (have_x11_by_default()) {
1111 daddr_t xsize = XNEEDMB * (MEG / 512);
1112 if (usr < wanted->num) {
1113 if (wanted->infos[usr].cur_part_id == NO_PART) {
1114 wanted->infos[usr].size += xsize;
1115 wanted->infos[usr].def_size += xsize;
1116 }
1117 } else if (root < wanted->num &&
1118 wanted->infos[root].cur_part_id == NO_PART &&
1119 (wanted->infos[root].limit == 0 ||
1120 (wanted->infos[root].size + xsize) <=
1121 wanted->infos[root].limit)) {
1122 wanted->infos[root].size += xsize;
1123 }
1124 }
1125 if (wanted->infos[root].limit > 0 &&
1126 wanted->infos[root].size > wanted->infos[root].limit) {
1127 if (usr < wanted->num) {
1128 /* move space from root to usr */
1129 daddr_t spill = wanted->infos[root].size -
1130 wanted->infos[root].limit;
1131 spill = roundup(spill, align);
1132 wanted->infos[root].size =
1133 wanted->infos[root].limit;
1134 wanted->infos[usr].size = spill;
1135 } else {
1136 wanted->infos[root].size =
1137 wanted->infos[root].limit;
1138 }
1139 }
1140
1141 /*
1142 * Preliminary calc additional space to allocate and how much
1143 * we likely will have left over. Use that to do further
1144 * adjustments, so we don't present the user inherently
1145 * impossible defaults.
1146 */
1147 free_space = parts->free_space;
1148 required = 0;
1149 if (root < wanted->num)
1150 required += wanted->infos[root].size;
1151 if (usr < wanted->num)
1152 required += wanted->infos[usr].size;
1153 else if (def_usr < wanted->num)
1154 required += wanted->infos[def_usr].def_size;
1155 free_space -= required;
1156 for (i = 0; i < wanted->num; i++) {
1157 if (i == root || i == usr)
1158 continue; /* already accounted above */
1159 if (wanted->infos[i].cur_part_id != NO_PART)
1160 continue;
1161 if (wanted->infos[i].size == 0)
1162 continue;
1163 if (wanted->infos[i].flags
1164 & (PUIFLG_IS_OUTER|PUIFLG_JUST_MOUNTPOINT))
1165 continue;
1166 free_space -= wanted->infos[i].size;
1167 }
1168 if (free_space < 0 && swap < wanted->num) {
1169 /* steel from swap partition */
1170 daddr_t d = wanted->infos[swap].size;
1171 daddr_t inc = roundup(-free_space, align);
1172 if (inc > d)
1173 inc = d;
1174 free_space += inc;
1175 wanted->infos[swap].size -= inc;
1176 }
1177 if (root < wanted->num) {
1178 /* Add space for 2 system dumps to / (traditional) */
1179 dump_space = get_ramsize() * (MEG/512);
1180 dump_space = roundup(dump_space, align);
1181 if (free_space > dump_space*2)
1182 dump_space *= 2;
1183 if (free_space > dump_space)
1184 wanted->infos[root].size += dump_space;
1185 }
1186 }
1187
1188 /*
1189 * We sort pset->infos to sync with pset->parts and
1190 * the cur_part_id, to allow using the same index into both
1191 * "array" in later phases. This may include inserting
1192 * dummy entries (when we do not actually want the
1193 * partition, but it is forced upon us, like RAW_PART in
1194 * disklabel).
1195 */
1196 static void
1197 sort_and_sync_parts(struct partition_usage_set *pset)
1198 {
1199 struct part_usage_info *infos;
1200 size_t i, j, no;
1201 part_id pno;
1202
1203 pset->cur_free_space = pset->parts->free_space;
1204
1205 /* count non-empty entries that are not in pset->parts */
1206 no = pset->parts->num_part;
1207 for (i = 0; i < pset->num; i++) {
1208 if (pset->infos[i].size == 0)
1209 continue;
1210 if (pset->infos[i].cur_part_id != NO_PART)
1211 continue;
1212 no++;
1213 }
1214
1215 /* allocate new infos */
1216 infos = calloc(no, sizeof *infos);
1217 if (infos == NULL)
1218 return;
1219
1220 /* pre-initialize the first entires as dummy entries */
1221 for (i = 0; i < pset->parts->num_part; i++) {
1222 infos[i].cur_part_id = NO_PART;
1223 infos[i].cur_flags = PTI_PSCHEME_INTERNAL;
1224 }
1225 /*
1226 * Now copy over eveything from our old entries that points to
1227 * a real partition.
1228 */
1229 for (i = 0; i < pset->num; i++) {
1230 pno = pset->infos[i].cur_part_id;
1231 if (pno == NO_PART)
1232 continue;
1233 if (pset->parts != pset->infos[i].parts)
1234 continue;
1235 if (pset->infos[i].flags & PUIFLG_JUST_MOUNTPOINT)
1236 continue;
1237 if ((pset->infos[i].flags & (PUIFLG_IS_OUTER|PUIFLAG_ADD_INNER))
1238 == PUIFLG_IS_OUTER)
1239 continue;
1240 if (pno >= pset->parts->num_part)
1241 continue;
1242 memcpy(infos+pno, pset->infos+i, sizeof(*infos));
1243 }
1244 /* Fill in the infos for real partitions where we had no data */
1245 for (pno = 0; pno < pset->parts->num_part; pno++) {
1246 struct disk_part_info info;
1247
1248 if (infos[pno].cur_part_id != NO_PART)
1249 continue;
1250
1251 if (!pset->parts->pscheme->get_part_info(pset->parts, pno,
1252 &info))
1253 continue;
1254
1255 infos[pno].parts = pset->parts;
1256 infos[pno].cur_part_id = pno;
1257 infos[pno].cur_flags = info.flags;
1258 infos[pno].size = info.size;
1259 infos[pno].type = info.nat_type->generic_ptype;
1260 infos[pno].cur_start = info.start;
1261 infos[pno].fs_type = info.fs_type;
1262 infos[pno].fs_version = info.fs_sub_type;
1263 }
1264 /* Add the non-partition entires after that */
1265 j = pset->num;
1266 for (i = 0; i < pset->num; i++) {
1267 if (j >= no)
1268 break;
1269 if (pset->infos[i].size == 0)
1270 continue;
1271 if (pset->infos[i].cur_part_id != NO_PART)
1272 continue;
1273 memcpy(infos+j, pset->infos+i, sizeof(*infos));
1274 j++;
1275 }
1276
1277 /* done, replace infos */
1278 free(pset->infos);
1279 pset->num = no;
1280 pset->infos = infos;
1281 }
1282
1283 static void
1284 apply_settings_to_partitions(struct pm_devs *p, struct disk_partitions *parts,
1285 struct partition_usage_set *wanted, daddr_t start, daddr_t size)
1286 {
1287 size_t i, exp_ndx = ~0U;
1288 daddr_t planned_space = 0, nsp, from, align;
1289 struct disk_part_info *infos;
1290 struct disk_part_free_space space;
1291 struct disk_partitions *ps = NULL;
1292 part_id pno, new_part_id;
1293
1294 infos = calloc(wanted->num, sizeof(*infos));
1295 if (infos == NULL) {
1296 err_msg_win(err_outofmem);
1297 return;
1298 }
1299
1300 align = wanted->parts->pscheme->get_part_alignment(wanted->parts);
1301
1302 /*
1303 * Pass one: calculate space available for expanding
1304 * the marked partition.
1305 */
1306 for (i = 0; i < wanted->num; i++) {
1307 if ((wanted->infos[i].flags & PUIFLAG_EXTEND) &&
1308 exp_ndx == ~0U)
1309 exp_ndx = i;
1310 if (wanted->infos[i].flags &
1311 (PUIFLG_JUST_MOUNTPOINT|PUIFLG_IS_OUTER))
1312 continue;
1313 nsp = wanted->infos[i].size;
1314 if (wanted->infos[i].cur_part_id != NO_PART) {
1315 ps = wanted->infos[i].flags & PUIFLG_IS_OUTER ?
1316 parts->parent : parts;
1317
1318 if (ps->pscheme->get_part_info(ps,
1319 wanted->infos[i].cur_part_id, &infos[i]))
1320 nsp -= infos[i].size;
1321 }
1322 if (nsp > 0)
1323 planned_space += roundup(nsp, align);
1324 }
1325
1326 /*
1327 * Expand the pool partition (or shrink, if we overran),
1328 */
1329 if (exp_ndx < wanted->num)
1330 wanted->infos[exp_ndx].size +=
1331 parts->free_space - planned_space;
1332
1333 /*
1334 * Now it gets tricky: we want the wanted partitions in order
1335 * as defined, but any already existing partitions should not
1336 * be moved. We allow them to change size though.
1337 * To keep it simple, we just assign in order and skip blocked
1338 * spaces. This may shuffle the order of the resulting partitions
1339 * compared to the wanted list.
1340 */
1341
1342 /* Adjust sizes of existing partitions */
1343 for (i = 0; i < wanted->num; i++) {
1344 ps = wanted->infos[i].flags & PUIFLG_IS_OUTER ?
1345 parts->parent : parts;
1346 const struct part_usage_info *want = &wanted->infos[i];
1347
1348 if (want->cur_part_id == NO_PART)
1349 continue;
1350 if (i == exp_ndx) /* the exp. part. can not exist yet */
1351 continue;
1352 daddr_t free_size = ps->pscheme->max_free_space_at(ps,
1353 infos[i].start);
1354 if (free_size < wanted->infos[i].size)
1355 continue;
1356 infos[i].size = wanted->infos[i].size;
1357 ps->pscheme->set_part_info(ps, want->cur_part_id,
1358 &infos[i], NULL);
1359 }
1360
1361 from = -1;
1362 /*
1363 * First add all outer partitions - we need to align those exactly
1364 * with the inner counterpart later.
1365 */
1366 if (parts->parent) {
1367 ps = parts->parent;
1368 daddr_t outer_align = ps->pscheme->get_part_alignment(ps);
1369
1370 for (i = 0; i < wanted->num; i++) {
1371 struct part_usage_info *want = &wanted->infos[i];
1372
1373 if (want->cur_part_id != NO_PART)
1374 continue;
1375 if (!(want->flags & PUIFLAG_ADD_OUTER))
1376 continue;
1377 if (want->size <= 0)
1378 continue;
1379
1380 size_t cnt = ps->pscheme->get_free_spaces(ps,
1381 &space, 1, want->size-2*outer_align,
1382 outer_align, from, -1);
1383
1384 if (cnt == 0) /* no free space for this partition */
1385 continue;
1386
1387 infos[i].start = space.start;
1388 infos[i].size = min(want->size, space.size);
1389 infos[i].nat_type =
1390 ps->pscheme->get_fs_part_type(
1391 want->fs_type, want->fs_version);
1392 infos[i].last_mounted = want->mount;
1393 infos[i].fs_type = want->fs_type;
1394 infos[i].fs_sub_type = want->fs_version;
1395 new_part_id = ps->pscheme->add_partition(ps,
1396 &infos[i], NULL);
1397 if (new_part_id == NO_PART)
1398 continue; /* failed to add, skip */
1399
1400 ps->pscheme->get_part_info(ps,
1401 new_part_id, &infos[i]);
1402 want->cur_part_id = new_part_id;
1403
1404 want->flags |= PUIFLAG_ADD_INNER|PUIFLG_IS_OUTER;
1405 from = rounddown(infos[i].start +
1406 infos[i].size+outer_align, outer_align);
1407 }
1408 }
1409
1410 /*
1411 * Now add new inner partitions
1412 */
1413 for (i = 0; i < wanted->num && from < wanted->parts->disk_size; i++) {
1414 struct part_usage_info *want = &wanted->infos[i];
1415
1416 if (want->cur_part_id != NO_PART)
1417 continue;
1418 if (want->flags & (PUIFLG_JUST_MOUNTPOINT|PUIFLG_IS_OUTER))
1419 continue;
1420 if (want->size <= 0)
1421 continue;
1422
1423 size_t cnt = wanted->parts->pscheme->get_free_spaces(
1424 wanted->parts, &space, 1, want->size-2*align, align, from,
1425 -1);
1426
1427 if (cnt == 0)
1428 continue; /* no free space for this partition */
1429
1430 infos[i].start = space.start;
1431 infos[i].size = min(want->size, space.size);
1432 infos[i].nat_type =
1433 wanted->parts->pscheme->get_fs_part_type(want->fs_type,
1434 want->fs_version);
1435 infos[i].last_mounted = want->mount;
1436 infos[i].fs_type = want->fs_type;
1437 infos[i].fs_sub_type = want->fs_version;
1438 if (want->fs_type != FS_UNUSED && want->type != PT_swap) {
1439 want->instflags |= PUIINST_NEWFS;
1440 if (want->mount[0] != 0)
1441 want->instflags |= PUIINST_MOUNT;
1442 }
1443 new_part_id = wanted->parts->pscheme->add_partition(
1444 wanted->parts, &infos[i], NULL);
1445 if (new_part_id == NO_PART)
1446 continue; /* failed to add, skip */
1447
1448 wanted->parts->pscheme->get_part_info(
1449 wanted->parts, new_part_id, &infos[i]);
1450 from = rounddown(infos[i].start+infos[i].size+align, align);
1451 }
1452
1453
1454 /*
1455 * If there are any outer partitions that we need as inner ones
1456 * too, add them to the inner partitioning scheme.
1457 */
1458 for (i = 0; i < wanted->num; i++) {
1459 struct part_usage_info *want = &wanted->infos[i];
1460
1461 if (want->cur_part_id != NO_PART)
1462 continue;
1463 if (want->flags & PUIFLG_JUST_MOUNTPOINT)
1464 continue;
1465 if (want->size <= 0)
1466 continue;
1467
1468 if ((want->flags & (PUIFLAG_ADD_INNER|PUIFLG_IS_OUTER)) !=
1469 (PUIFLAG_ADD_INNER|PUIFLG_IS_OUTER))
1470 continue;
1471
1472 infos[i].start = want->cur_start;
1473 infos[i].size = want->size;
1474 infos[i].nat_type = wanted->parts->pscheme->get_fs_part_type(
1475 want->fs_type, want->fs_version);
1476 infos[i].last_mounted = want->mount;
1477 infos[i].fs_type = want->fs_type;
1478 infos[i].fs_sub_type = want->fs_version;
1479
1480 if (wanted->parts->pscheme->add_outer_partition
1481 != NULL)
1482 new_part_id = wanted->parts->pscheme->
1483 add_outer_partition(
1484 wanted->parts, &infos[i], NULL);
1485 else
1486 new_part_id = wanted->parts->pscheme->
1487 add_partition(
1488 wanted->parts, &infos[i], NULL);
1489
1490 if (new_part_id == NO_PART)
1491 continue; /* failed to add, skip */
1492
1493 wanted->parts->pscheme->get_part_info(
1494 wanted->parts, new_part_id, &infos[i]);
1495 }
1496
1497 /*
1498 * Note: all part_ids are invalid now, as we have added things!
1499 */
1500 for (i = 0; i < wanted->num; i++)
1501 wanted->infos[i].cur_part_id = NO_PART;
1502 for (pno = 0; pno < parts->num_part; pno++) {
1503 struct disk_part_info t;
1504
1505 if (!parts->pscheme->get_part_info(parts, pno, &t))
1506 continue;
1507
1508 for (i = 0; i < wanted->num; i++) {
1509 if (wanted->infos[i].cur_part_id != NO_PART)
1510 continue;
1511 if (t.start == infos[i].start) {
1512 wanted->infos[i].cur_part_id = pno;
1513 wanted->infos[i].cur_start = infos[i].start;
1514 wanted->infos[i].cur_flags = infos[i].flags;
1515 break;
1516 }
1517 }
1518 }
1519 free(infos);
1520
1521 /* sort, and sync part ids and wanted->infos[] indices */
1522 sort_and_sync_parts(wanted);
1523 }
1524
1525 static void
1526 replace_by_default(struct pm_devs *p, struct disk_partitions *parts,
1527 daddr_t start, daddr_t size, struct partition_usage_set *wanted)
1528 {
1529
1530 if (start == 0 && size == parts->disk_size)
1531 parts->pscheme->delete_all_partitions(parts);
1532 else if (parts->pscheme->delete_partitions_in_range != NULL)
1533 parts->pscheme->delete_partitions_in_range(parts, start, size);
1534 else
1535 assert(parts->num_part == 0);
1536
1537 fill_defaults(wanted, parts, start, size);
1538 apply_settings_to_partitions(p, parts, wanted, start, size);
1539 }
1540
1541 static bool
1542 edit_with_defaults(struct pm_devs *p, struct disk_partitions *parts,
1543 daddr_t start, daddr_t size, struct partition_usage_set *wanted)
1544 {
1545 bool ok;
1546
1547 fill_defaults(wanted, parts, start, size);
1548 ok = get_ptn_sizes(wanted);
1549 if (ok)
1550 apply_settings_to_partitions(p, parts, wanted, start, size);
1551 return ok;
1552 }
1553
1554 /*
1555 * md back-end code for menu-driven BSD disklabel editor.
1556 * returns 0 on failure, 1 on success.
1557 * fills the install target with a list for newfs/fstab.
1558 */
1559 bool
1560 make_bsd_partitions(struct install_partition_desc *install)
1561 {
1562 struct disk_partitions *parts = pm->parts;
1563 const struct disk_partitioning_scheme *pscheme;
1564 struct partition_usage_set wanted;
1565 enum layout_type layoutkind = LY_SETSIZES;
1566 bool have_existing;
1567
1568 if (pm && pm->no_part && parts == NULL)
1569 return true;
1570
1571 if (parts == NULL) {
1572 pscheme = select_part_scheme(pm, NULL, true, NULL);
1573 if (pscheme == NULL)
1574 return false;
1575 parts = pscheme->create_new_for_disk(pm->diskdev,
1576 0, pm->dlsize, pm->dlsize, true);
1577 if (parts == NULL)
1578 return false;
1579 pm->parts = parts;
1580 } else {
1581 pscheme = parts->pscheme;
1582 }
1583
1584 if (pscheme->secondary_partitions) {
1585 struct disk_partitions *p;
1586
1587 p = pscheme->secondary_partitions(parts, pm->ptstart, false);
1588 if (p) {
1589 parts = p;
1590 pscheme = parts->pscheme;
1591 }
1592 }
1593
1594 have_existing = check_existing_netbsd(parts);
1595
1596 /*
1597 * Initialize global variables that track space used on this disk.
1598 */
1599 if (pm->ptsize == 0)
1600 pm->ptsize = pm->dlsize - pm->ptstart;
1601 if (pm->dlsize == 0)
1602 pm->dlsize = pm->ptstart + pm->ptsize;
1603
1604 if (logfp) fprintf(logfp, "dlsize=%" PRId64 " ptsize=%" PRId64
1605 " ptstart=%" PRId64 "\n",
1606 pm->dlsize, pm->ptsize, pm->ptstart);
1607
1608 if (pm->current_cylsize == 0)
1609 pm->current_cylsize = pm->dlcylsize;
1610
1611 /* Ask for layout type -- standard or special */
1612 if (partman_go == 0) {
1613 char bsd_size[6], min_size[6], x_size[6];
1614
1615 humanize_number(bsd_size, sizeof(bsd_size),
1616 (uint64_t)pm->ptsize*pm->sectorsize,
1617 "", HN_AUTOSCALE, HN_B | HN_NOSPACE | HN_DECIMAL);
1618 humanize_number(min_size, sizeof(min_size),
1619 (uint64_t)(DEFROOTSIZE + DEFSWAPSIZE + DEFUSRSIZE)*MEG,
1620 "", HN_AUTOSCALE, HN_B | HN_NOSPACE | HN_DECIMAL);
1621 humanize_number(x_size, sizeof(x_size),
1622 (uint64_t)(DEFROOTSIZE + DEFSWAPSIZE + DEFUSRSIZE
1623 + XNEEDMB)*MEG,
1624 "", HN_AUTOSCALE, HN_B | HN_NOSPACE | HN_DECIMAL);
1625
1626 msg_display_subst(
1627 have_existing ? MSG_layout_prologue_existing
1628 : MSG_layout_prologue_none, 6, pm->diskdev,
1629 msg_string(parts->pscheme->name),
1630 msg_string(parts->pscheme->short_name),
1631 bsd_size, min_size, x_size);
1632 msg_display_add_subst(MSG_layout_main, 6,
1633 pm->diskdev,
1634 msg_string(parts->pscheme->name),
1635 msg_string(parts->pscheme->short_name),
1636 bsd_size, min_size, x_size);
1637 msg_display_add("\n\n");
1638 layoutkind = ask_layout(parts, have_existing);
1639 }
1640
1641 if (layoutkind == LY_USEDEFAULT) {
1642 replace_by_default(pm, parts, pm->ptstart, pm->ptsize,
1643 &wanted);
1644 } else if (layoutkind == LY_SETSIZES) {
1645 if (!edit_with_defaults(pm, parts, pm->ptstart, pm->ptsize,
1646 &wanted)) {
1647 free_usage_set(&wanted);
1648 return false;
1649 }
1650 } else {
1651 usage_set_from_parts(&wanted, parts);
1652 }
1653
1654 /*
1655 * OK, we have a partition table. Give the user the chance to
1656 * edit it and verify it's OK, or abort altogether.
1657 */
1658 for (;;) {
1659 int rv = edit_and_check_label(pm, &wanted);
1660 if (rv == 0) {
1661 msg_display(MSG_abort_part);
1662 free_usage_set(&wanted);
1663 return false;
1664 }
1665 /* update install infos */
1666 install->num = wanted.num;
1667 install->infos = wanted.infos;
1668 /* and check them */
1669 if (check_partitions(install))
1670 break;
1671 }
1672
1673 /* we moved infos from wanted to install target */
1674 wanted.infos = NULL;
1675 free_usage_set(&wanted);
1676
1677 /* Everything looks OK. */
1678 return true;
1679 }
1680
1681 #ifndef MD_NEED_BOOTBLOCK
1682 #define MD_NEED_BOOTBLOCK(A) true
1683 #endif
1684
1685 /*
1686 * check that there is at least a / somewhere.
1687 */
1688 bool
1689 check_partitions(struct install_partition_desc *install)
1690 {
1691 #ifdef HAVE_BOOTXX_xFS
1692 int rv = 1;
1693 char *bootxx;
1694 #endif
1695 #ifndef HAVE_UFS2_BOOT
1696 size_t i;
1697 #endif
1698
1699 #ifdef HAVE_BOOTXX_xFS
1700 if (MD_NEED_BOOTBLOCK(install)) {
1701 /* check if we have boot code for the root partition type */
1702 bootxx = bootxx_name(install);
1703 if (bootxx != NULL) {
1704 rv = access(bootxx, R_OK);
1705 free(bootxx);
1706 } else
1707 rv = -1;
1708 if (rv != 0) {
1709 hit_enter_to_continue(NULL, MSG_No_Bootcode);
1710 return false;
1711 }
1712 }
1713 #endif
1714 #ifndef HAVE_UFS2_BOOT
1715 if (MD_NEED_BOOTBLOCK(install)) {
1716 for (i = 0; i < install->num; i++) {
1717 if (install->infos[i].type != PT_root)
1718 continue;
1719 if (strcmp(install->infos[i].mount, "/") != 0)
1720 continue;
1721 if (install->infos[i].fs_type != FS_BSDFFS)
1722 continue;
1723 if (install->infos[i].fs_version != 2)
1724 continue;
1725 hit_enter_to_continue(NULL, MSG_cannot_ufs2_root);
1726 return false;
1727 }
1728 }
1729 #endif
1730
1731 return md_check_partitions(install);
1732 }
1733