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