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