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