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