Home | History | Annotate | Line # | Download | only in sysinst
partitions.c revision 1.7
      1  1.7  martin /*	$NetBSD: partitions.c,v 1.7 2019/12/13 22:12:41 martin Exp $	*/
      2  1.1  martin 
      3  1.1  martin /*
      4  1.1  martin  * Copyright 2018 The NetBSD Foundation, Inc.
      5  1.1  martin  * All rights reserved.
      6  1.1  martin  *
      7  1.1  martin  * Redistribution and use in source and binary forms, with or without
      8  1.1  martin  * modification, are permitted provided that the following conditions
      9  1.1  martin  * are met:
     10  1.1  martin  * 1. Redistributions of source code must retain the above copyright
     11  1.1  martin  *    notice, this list of conditions and the following disclaimer.
     12  1.1  martin  * 2. Redistributions in binary form must reproduce the above copyright
     13  1.1  martin  *    notice, this list of conditions and the following disclaimer in the
     14  1.1  martin  *    documentation and/or other materials provided with the distribution.
     15  1.1  martin  *
     16  1.1  martin  * THIS SOFTWARE IS PROVIDED BY PIERMONT INFORMATION SYSTEMS INC. ``AS IS''
     17  1.1  martin  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     18  1.1  martin  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     19  1.1  martin  * ARE DISCLAIMED. IN NO EVENT SHALL PIERMONT INFORMATION SYSTEMS INC. BE
     20  1.1  martin  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
     21  1.1  martin  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
     22  1.1  martin  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
     23  1.1  martin  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
     24  1.1  martin  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
     25  1.1  martin  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
     26  1.1  martin  * THE POSSIBILITY OF SUCH DAMAGE.
     27  1.1  martin  *
     28  1.1  martin  */
     29  1.1  martin 
     30  1.1  martin #include "defs.h"
     31  1.1  martin #include "mbr.h"
     32  1.1  martin #include <assert.h>
     33  1.1  martin 
     34  1.1  martin /*
     35  1.1  martin  * A list of partitioning schemes, so we can iterate over everything
     36  1.1  martin  * supported (e.g. when partitioning a new disk). NULL terminated.
     37  1.1  martin  */
     38  1.1  martin const struct disk_partitioning_scheme **available_part_schemes;
     39  1.1  martin /*
     40  1.1  martin  * The number of valid entries on above list
     41  1.1  martin  */
     42  1.1  martin size_t num_available_part_schemes;
     43  1.1  martin 
     44  1.1  martin /*
     45  1.1  martin  * Generic reader - query a disk device and read all partitions from it
     46  1.1  martin  */
     47  1.1  martin struct disk_partitions *
     48  1.3  martin partitions_read_disk(const char *dev, daddr_t disk_size, bool no_mbr)
     49  1.1  martin {
     50  1.1  martin 	const struct disk_partitioning_scheme **ps;
     51  1.1  martin 
     52  1.1  martin 	if (!available_part_schemes)
     53  1.1  martin 		return NULL;
     54  1.1  martin 
     55  1.1  martin 	for (ps = available_part_schemes; *ps; ps++) {
     56  1.4  martin #ifdef HAVE_MBR
     57  1.3  martin 		if (no_mbr && (*ps)->name == MSG_parttype_mbr)
     58  1.3  martin 			continue;
     59  1.4  martin #endif
     60  1.1  martin 		struct disk_partitions *parts =
     61  1.2  martin 		    (*ps)->read_from_disk(dev, 0, disk_size, *ps);
     62  1.1  martin 		if (parts)
     63  1.1  martin 			return parts;
     64  1.1  martin 	}
     65  1.1  martin 	return NULL;
     66  1.1  martin }
     67  1.1  martin 
     68  1.5  martin bool
     69  1.5  martin generic_adapt_foreign_part_info(const struct disk_partitions *myself,
     70  1.5  martin     struct disk_part_info *dest,
     71  1.5  martin     const struct disk_partitioning_scheme *src_scheme,
     72  1.5  martin     const struct disk_part_info *src)
     73  1.5  martin {
     74  1.5  martin 	*dest = *src;
     75  1.5  martin 	if (myself->pscheme == src_scheme)
     76  1.5  martin 		return true;	/* no conversion needed */
     77  1.5  martin 
     78  1.5  martin 	if (src->nat_type == NULL)
     79  1.5  martin 		return false;
     80  1.5  martin 
     81  1.5  martin 	/* slightly simplistic, enhance when needed */
     82  1.7  martin 	dest->nat_type = myself->pscheme->get_fs_part_type(
     83  1.7  martin 	    dest->nat_type ? dest->nat_type->generic_ptype : PT_root,
     84  1.7  martin 	    dest->fs_type,
     85  1.5  martin 	    dest->fs_sub_type);
     86  1.5  martin 	if (dest->nat_type == NULL)
     87  1.5  martin 		dest->nat_type = myself->pscheme->get_generic_part_type(
     88  1.5  martin 		    src->nat_type->generic_ptype);
     89  1.5  martin 	if (dest->nat_type == NULL)
     90  1.5  martin 		dest->nat_type = myself->pscheme->create_unknown_part_type();
     91  1.5  martin 	if (dest->nat_type == NULL)
     92  1.5  martin 		dest->nat_type = myself->pscheme->get_generic_part_type(
     93  1.5  martin 		    PT_unknown);
     94  1.5  martin 
     95  1.5  martin 	return true;
     96  1.5  martin }
     97  1.5  martin 
     98  1.1  martin /*************** global init ****************************************/
     99  1.1  martin /*
    100  1.1  martin  * Helper structure to fill our global list of available partitioning
    101  1.1  martin  * schemes.
    102  1.1  martin  */
    103  1.1  martin struct part_scheme_desc {
    104  1.1  martin 	bool (*is_available)(void);
    105  1.1  martin 	const struct disk_partitioning_scheme *ps;
    106  1.1  martin };
    107  1.1  martin 
    108  1.1  martin #ifdef HAVE_GPT
    109  1.1  martin bool gpt_parts_check(void);
    110  1.1  martin extern const struct disk_partitioning_scheme gpt_parts;
    111  1.1  martin #endif
    112  1.1  martin #ifdef HAVE_MBR
    113  1.1  martin extern const struct disk_partitioning_scheme mbr_parts;
    114  1.1  martin #endif
    115  1.2  martin 
    116  1.2  martin extern const struct disk_partitioning_scheme disklabel_parts;
    117  1.2  martin #if RAW_PART != 2
    118  1.2  martin static struct disk_partitioning_scheme only_disklabel_parts;
    119  1.2  martin 
    120  1.2  martin /*
    121  1.2  martin  * If not overriden by MD code, we can not boot from plain
    122  1.2  martin  * disklabel disks (w/o MBR).
    123  1.2  martin  */
    124  1.2  martin static bool have_only_disklabel_boot_support(const char *disk)
    125  1.2  martin {
    126  1.2  martin #ifdef HAVE_PLAIN_DISKLABEL_BOOT
    127  1.2  martin 	return HAVE_PLAIN_DISKLABEL_BOOT(disk);
    128  1.2  martin #else
    129  1.2  martin 	return false;
    130  1.2  martin #endif
    131  1.2  martin }
    132  1.1  martin #endif
    133  1.1  martin 
    134  1.6  martin bool
    135  1.6  martin only_have_disklabel(void)
    136  1.6  martin {
    137  1.6  martin 
    138  1.6  martin 	if (num_available_part_schemes > 1)
    139  1.6  martin 		return false;
    140  1.6  martin 
    141  1.6  martin #if RAW_PART != 2
    142  1.6  martin 	if (available_part_schemes[0] == &only_disklabel_parts)
    143  1.6  martin 		return true;
    144  1.6  martin #endif
    145  1.6  martin 	return available_part_schemes[0] == &disklabel_parts;
    146  1.6  martin }
    147  1.6  martin 
    148  1.1  martin /*
    149  1.1  martin  * One time initialization
    150  1.1  martin  */
    151  1.1  martin void
    152  1.1  martin partitions_init(void)
    153  1.1  martin {
    154  1.1  martin 	/*
    155  1.1  martin 	 * List of partitioning schemes.
    156  1.1  martin 	 * Order is important, the selection menu is created from start
    157  1.1  martin 	 * to end. Keep good defaults early. Most architectures will
    158  1.1  martin 	 * only offer very few entries.
    159  1.1  martin 	 */
    160  1.1  martin static const struct part_scheme_desc all_descs[] = {
    161  1.1  martin #if RAW_PART == 2	/* only available as primary on some architectures */
    162  1.1  martin 		{ NULL, &disklabel_parts },
    163  1.1  martin #endif
    164  1.1  martin #ifdef HAVE_GPT
    165  1.1  martin 		{ gpt_parts_check, &gpt_parts },
    166  1.1  martin #endif
    167  1.1  martin #ifdef HAVE_MBR
    168  1.1  martin 		{ NULL, &mbr_parts },
    169  1.1  martin #endif
    170  1.2  martin #if RAW_PART != 2	/* "whole disk NetBSD" disklabel variant */
    171  1.2  martin 		{ NULL, &only_disklabel_parts },
    172  1.2  martin #endif
    173  1.1  martin 	};
    174  1.1  martin 
    175  1.1  martin 	size_t i, avail;
    176  1.1  martin 	const struct disk_partitioning_scheme **out;
    177  1.1  martin 	bool *is_available;
    178  1.1  martin 	static const size_t all_cnt = __arraycount(all_descs);
    179  1.1  martin 
    180  1.1  martin 	check_available_binaries();
    181  1.1  martin 
    182  1.2  martin #if RAW_PART != 2
    183  1.2  martin 	/* generate a variant of disklabel w/o parent scheme */
    184  1.2  martin 	only_disklabel_parts = disklabel_parts;
    185  1.2  martin 	only_disklabel_parts.name = MSG_parttype_only_disklabel;
    186  1.2  martin 	only_disklabel_parts.have_boot_support =
    187  1.2  martin 	    have_only_disklabel_boot_support;
    188  1.2  martin #endif
    189  1.2  martin 
    190  1.2  martin 
    191  1.1  martin 	is_available = malloc(all_cnt);
    192  1.1  martin 
    193  1.1  martin 	for (avail = i = 0; i < all_cnt; i++) {
    194  1.1  martin 		is_available[i] = all_descs[i].is_available == NULL
    195  1.1  martin 				|| all_descs[i].is_available();
    196  1.1  martin 		if (is_available[i])
    197  1.1  martin 			avail++;
    198  1.1  martin 	}
    199  1.1  martin 
    200  1.1  martin 	if (avail == 0)
    201  1.1  martin 		return;
    202  1.1  martin 
    203  1.1  martin 	num_available_part_schemes = avail;
    204  1.1  martin 	available_part_schemes = malloc(sizeof(*available_part_schemes)
    205  1.1  martin 	    * (avail+1));
    206  1.1  martin 	if (available_part_schemes == NULL)
    207  1.1  martin 		return;
    208  1.1  martin 
    209  1.1  martin 	for (out = available_part_schemes, i = 0; i < all_cnt; i++) {
    210  1.1  martin 		if (!is_available[i])
    211  1.1  martin 			continue;
    212  1.1  martin 		*out++ = all_descs[i].ps;
    213  1.1  martin 	}
    214  1.1  martin 	*out = NULL;
    215  1.1  martin 
    216  1.1  martin 	free(is_available);
    217  1.1  martin }
    218  1.5  martin 
    219  1.5  martin /*
    220  1.5  martin  * Final cleanup
    221  1.5  martin  */
    222  1.5  martin void
    223  1.5  martin partitions_cleanup(void)
    224  1.5  martin {
    225  1.5  martin 	for (size_t i = 0; i < num_available_part_schemes; i++)
    226  1.5  martin 		if (available_part_schemes[i]->cleanup != NULL)
    227  1.5  martin 			available_part_schemes[i]->cleanup();
    228  1.5  martin 	free(available_part_schemes);
    229  1.5  martin }
    230