partitions.h revision 1.26 1 1.26 andvar /* $NetBSD: partitions.h,v 1.26 2022/05/22 11:27:37 andvar Exp $ */
2 1.1 martin
3 1.1 martin /*
4 1.20 martin * Copyright (c) 2020 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.20 martin * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
17 1.20 martin * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
18 1.20 martin * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
19 1.20 martin * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
20 1.20 martin * BE 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.20 martin * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
26 1.20 martin * POSSIBILITY OF SUCH DAMAGE.
27 1.1 martin */
28 1.1 martin
29 1.1 martin /*
30 1.1 martin * Abstract interface to access arbitrary disk partitioning schemes and
31 1.1 martin * keep Sysinst proper independent of the implementation / on-disk
32 1.1 martin * details.
33 1.15 martin *
34 1.15 martin * NOTE:
35 1.24 andvar * - all sector numbers, alignment and sizes are in units of the
36 1.15 martin * disks physical sector size (not necessarily 512 bytes)!
37 1.15 martin * - some interfaces pass the disks sector size (when it is easily
38 1.15 martin * available at typical callers), but the backends can always
39 1.15 martin * assume it to be equal to the real physical sector size. If
40 1.15 martin * no value is passed, the backend can query the disk data
41 1.15 martin * via get_disk_geom().
42 1.15 martin * - single exception: disk_partitioning_scheme::size_limit is in 512
43 1.15 martin * byte sectors (as it is not associated with a concrete disk)
44 1.1 martin */
45 1.1 martin
46 1.1 martin #include <sys/types.h>
47 1.1 martin #include <stdbool.h>
48 1.1 martin #include "msg_defs.h"
49 1.1 martin
50 1.1 martin /*
51 1.1 martin * Import all the file system types, as enum fs_type.
52 1.1 martin */
53 1.1 martin #define FSTYPE_ENUMNAME fs_type
54 1.1 martin #define FSTYPENAMES
55 1.1 martin #include <sys/disklabel.h>
56 1.1 martin #undef FSTYPE_ENUMNAME
57 1.1 martin
58 1.1 martin #ifndef FS_TMPFS
59 1.1 martin #define FS_TMPFS 256 /* random value (outside uint8_t range) */
60 1.1 martin #endif
61 1.1 martin #ifndef FS_MFS
62 1.1 martin #define FS_MFS 257 /* another random (out of range) value */
63 1.1 martin #endif
64 1.1 martin
65 1.3 msaitoh #define MAX_LABEL_LEN 128 /* max. length of a partition label */
66 1.12 msaitoh #define MAX_SHORTCUT_LEN 8 /* max. length of a shortcut ("a:") */
67 1.1 martin
68 1.1 martin /*
69 1.1 martin * A partition index / handle, identifies a singlepartition within
70 1.1 martin * a struct disk_partitions. This is just an iterator/index - whenever
71 1.1 martin * changes to the set of partitions are done, partitions may get a new
72 1.1 martin * part_id.
73 1.1 martin * We assume that partitioning schemes keep partitions sorted (with
74 1.1 martin * key = start address, some schemes will have overlapping partitions,
75 1.1 martin * like MBR extended partitions).
76 1.1 martin */
77 1.1 martin typedef size_t part_id;
78 1.1 martin
79 1.1 martin /*
80 1.1 martin * An invalid value for a partition index / handle
81 1.1 martin */
82 1.1 martin #define NO_PART ((part_id)~0U)
83 1.1 martin
84 1.1 martin /*
85 1.1 martin * Intended usage for a partition
86 1.1 martin */
87 1.1 martin enum part_type {
88 1.1 martin PT_undef, /* invalid value */
89 1.1 martin PT_unknown, /* anything we can not map to one of these */
90 1.1 martin PT_root, /* the NetBSD / partition (bootable) */
91 1.1 martin PT_swap, /* the NetBSD swap partition */
92 1.1 martin PT_FAT, /* boot partition (e.g. for u-boot) */
93 1.16 martin PT_EXT2, /* boot partition (for Linux appliances) */
94 1.16 martin PT_SYSVBFS, /* boot partition (for some SYSV machines) */
95 1.1 martin PT_EFI_SYSTEM, /* (U)EFI boot partition */
96 1.1 martin };
97 1.1 martin
98 1.1 martin /*
99 1.1 martin * A generic structure describing partition types for menu/user interface
100 1.1 martin * purposes. The internal details may be richer and the *pointer* value
101 1.1 martin * is the unique token - that is: the partitioning scheme will hand out
102 1.1 martin * pointers to internal data and recognize the exact partition type details
103 1.21 wiz * by pointer comparison.
104 1.1 martin */
105 1.1 martin struct part_type_desc {
106 1.1 martin enum part_type generic_ptype; /* what this maps to in generic terms */
107 1.1 martin const char *short_desc; /* short type description */
108 1.1 martin const char *description; /* full description */
109 1.1 martin };
110 1.1 martin
111 1.1 martin /* Bits for disk_part_info.flags: */
112 1.1 martin #define PTI_SEC_CONTAINER 1 /* this covers our secondary
113 1.1 martin partitions */
114 1.1 martin #define PTI_WHOLE_DISK 2 /* all of the NetBSD disk */
115 1.1 martin #define PTI_BOOT 4 /* required for booting */
116 1.1 martin #define PTI_PSCHEME_INTERNAL 8 /* no user partition, e.g.
117 1.1 martin MBRs extend partition */
118 1.1 martin #define PTI_RAW_PART 16 /* total disk */
119 1.17 martin #define PTI_INSTALL_TARGET 32 /* marks the target partition
120 1.17 martin * assumed to become / after
121 1.17 martin * reboot; may not be
122 1.17 martin * persistent; may only be
123 1.17 martin * set for a single partition!
124 1.17 martin */
125 1.1 martin
126 1.1 martin /* A single partition */
127 1.1 martin struct disk_part_info {
128 1.1 martin daddr_t start, size; /* start and size on disk */
129 1.1 martin uint32_t flags; /* active PTI_ flags */
130 1.1 martin const struct part_type_desc *nat_type; /* native partition type */
131 1.1 martin /*
132 1.1 martin * The following will only be available
133 1.1 martin * a) for a small subset of file system types
134 1.1 martin * b) if the partition (in this state) has already been
135 1.1 martin * used before
136 1.1 martin * It is OK to leave all these zeroed / NULL when setting
137 1.1 martin * partition data - or leave them at the last values a get operation
138 1.1 martin * returned. Backends can not rely on them to be valid.
139 1.1 martin */
140 1.1 martin const char *last_mounted; /* last mount point or NULL */
141 1.19 martin unsigned int fs_type, fs_sub_type, /* FS_* type of filesystem
142 1.1 martin * and for some FS a sub
143 1.1 martin * type (e.g. FFSv1 vs. FFSv2)
144 1.1 martin */
145 1.19 martin fs_opt1, fs_opt2, fs_opt3; /* FS specific option, used
146 1.19 martin * for FFS block/fragsize
147 1.19 martin * and inodes
148 1.19 martin */
149 1.1 martin };
150 1.1 martin
151 1.1 martin /* An unused area that may be used for new partitions */
152 1.1 martin struct disk_part_free_space {
153 1.1 martin daddr_t start, size;
154 1.1 martin };
155 1.1 martin
156 1.1 martin /*
157 1.1 martin * Some partition schemes define additional data that needs to be edited.
158 1.1 martin * These attributes are described in this structure and referenced by
159 1.1 martin * their index into the fixed list of available attributes.
160 1.1 martin */
161 1.1 martin enum custom_attr_type { pet_bool, pet_cardinal, pet_str };
162 1.1 martin struct disk_part_custom_attribute {
163 1.1 martin msg label; /* Name, like "active partition" */
164 1.1 martin enum custom_attr_type type; /* bool, long, char* */
165 1.1 martin size_t strlen; /* maximum length if pet_str */
166 1.1 martin };
167 1.1 martin
168 1.1 martin /*
169 1.24 andvar * When displaying a partition editor, we have standard columns, but
170 1.1 martin * partitioning schemes add custom columns to the table as well.
171 1.1 martin * There is a fixed number of columns and they are described by this
172 1.1 martin * structure:
173 1.1 martin */
174 1.1 martin struct disk_part_edit_column_desc {
175 1.1 martin msg title;
176 1.1 martin unsigned int width;
177 1.1 martin };
178 1.1 martin
179 1.24 andvar struct disk_partitions; /* in-memory representation of a set of partitions */
180 1.1 martin
181 1.1 martin /*
182 1.1 martin * When querying partition "device" names, we may ask for:
183 1.1 martin */
184 1.1 martin enum dev_name_usage {
185 1.1 martin parent_device_only, /* wd0 instead of wd0i, no path */
186 1.1 martin logical_name, /* NAME=my-root instead of dk7 */
187 1.1 martin plain_name, /* e.g. /dev/wd0i or /dev/dk7 */
188 1.1 martin raw_dev_name, /* e.g. /dev/rwd0i or /dev/rdk7 */
189 1.1 martin };
190 1.1 martin
191 1.1 martin /*
192 1.1 martin * A scheme how to store partitions on-disk, and methods to read/write
193 1.1 martin * them to/from our abstract internal presentation.
194 1.1 martin */
195 1.1 martin struct disk_partitioning_scheme {
196 1.1 martin /* name of the on-disk scheme, retrieved via msg_string */
197 1.1 martin msg name, short_name;
198 1.1 martin
199 1.1 martin /* prompt shown when creating custom partition types */
200 1.1 martin msg new_type_prompt;
201 1.1 martin
202 1.1 martin /* description of scheme specific partition flags */
203 1.1 martin msg part_flag_desc;
204 1.1 martin
205 1.15 martin /*
206 1.15 martin * size restrictions for this partitioning scheme (number
207 1.15 martin * of 512 byte sectors max)
208 1.15 martin */
209 1.1 martin daddr_t size_limit; /* 0 if not limited */
210 1.1 martin
211 1.1 martin /*
212 1.1 martin * If this scheme allows sub-partitions (i.e. MBR -> disklabel),
213 1.1 martin * this is a pointer to the (potential/optional) secondary
214 1.1 martin * scheme. Depending on partitioning details it may not be
215 1.1 martin * used in the end.
216 1.1 martin * This link is only here for better help messages.
217 1.24 andvar * See *secondary_partitions further below for actually accessing
218 1.1 martin * secondary partitions.
219 1.1 martin */
220 1.1 martin const struct disk_partitioning_scheme *secondary_scheme;
221 1.1 martin
222 1.1 martin /*
223 1.1 martin * Partition editor colum descriptions for whatever the scheme
224 1.1 martin * needs to display (see format_partition_table_str below).
225 1.1 martin */
226 1.1 martin size_t edit_columns_count;
227 1.1 martin const struct disk_part_edit_column_desc *edit_columns;
228 1.1 martin
229 1.1 martin /*
230 1.1 martin * Custom attributes editable by the partitioning scheme (but of
231 1.1 martin * no particular meaning for sysinst)
232 1.1 martin */
233 1.1 martin size_t custom_attribute_count;
234 1.1 martin const struct disk_part_custom_attribute *custom_attributes;
235 1.1 martin
236 1.1 martin /*
237 1.1 martin * Partition types supported by this scheme,
238 1.1 martin * first function gets the number, second queries single elements
239 1.1 martin */
240 1.1 martin size_t (*get_part_types_count)(void);
241 1.1 martin const struct part_type_desc * (*get_part_type)(size_t ndx);
242 1.1 martin /*
243 1.25 andvar * Get the preferred native representation for a generic partition type
244 1.1 martin */
245 1.1 martin const struct part_type_desc * (*get_generic_part_type)(enum part_type);
246 1.1 martin /*
247 1.25 andvar * Get the preferred native partition type for a specific file system
248 1.1 martin * type (FS_*) and subtype (fs specific value)
249 1.1 martin */
250 1.10 martin const struct part_type_desc * (*get_fs_part_type)(
251 1.10 martin enum part_type, unsigned, unsigned);
252 1.1 martin /*
253 1.13 martin * Optional: inverse to above: given a part_type_desc, set default
254 1.13 martin * fstype and subtype.
255 1.13 martin */
256 1.13 martin bool (*get_default_fstype)(const struct part_type_desc *,
257 1.13 martin unsigned *fstype, unsigned *fs_sub_type);
258 1.13 martin /*
259 1.1 martin * Create a custom partition type. If the type already exists
260 1.1 martin * (or there is a collision), the old existing type will be
261 1.1 martin * returned and no new type created. This is not considered
262 1.1 martin * an error (to keep the user interface simple).
263 1.1 martin * On failure NULL is returned and (if passed != NULL)
264 1.1 martin * *err_msg is set to a message describing the error.
265 1.1 martin */
266 1.1 martin const struct part_type_desc * (*create_custom_part_type)
267 1.1 martin (const char *custom, const char **err_msg);
268 1.8 martin /*
269 1.8 martin * Return a usable internal partition type representation
270 1.8 martin * for types that are not otherwise mappable.
271 1.8 martin * This could be FS_OTHER for disklabel, or a randomly
272 1.8 martin * created type guid for GPT. This type may or may not be
273 1.8 martin * in the regular type list. If not, it needs to behave like a
274 1.8 martin * custom type.
275 1.8 martin */
276 1.8 martin const struct part_type_desc * (*create_unknown_part_type)(void);
277 1.1 martin
278 1.1 martin /*
279 1.1 martin * Global attributes
280 1.1 martin */
281 1.1 martin /*
282 1.1 martin * Get partition alignment suggestion. The schemen may enforce
283 1.1 martin * additional/different alignment for some partitions.
284 1.1 martin */
285 1.1 martin daddr_t (*get_part_alignment)(const struct disk_partitions*);
286 1.1 martin
287 1.1 martin /*
288 1.1 martin * Methods to manipulate the in-memory abstract representation
289 1.1 martin */
290 1.1 martin
291 1.1 martin /* Retrieve data about a single partition, identified by the part_id.
292 1.1 martin * Fill the disk_part_info structure
293 1.1 martin */
294 1.1 martin bool (*get_part_info)(const struct disk_partitions*, part_id,
295 1.1 martin struct disk_part_info*);
296 1.1 martin
297 1.26 andvar /* Optional: fill an attribute string describing the given partition */
298 1.1 martin bool (*get_part_attr_str)(const struct disk_partitions*, part_id,
299 1.1 martin char *str, size_t avail_space);
300 1.1 martin /* Format a partition editor element for the "col" column in
301 1.1 martin * edit_columns. Used e.g. with MBR to set "active" flags.
302 1.1 martin */
303 1.1 martin bool (*format_partition_table_str)(const struct disk_partitions*,
304 1.1 martin part_id, size_t col, char *outstr, size_t outspace);
305 1.1 martin
306 1.1 martin /* is the type of this partition changable? */
307 1.1 martin bool (*part_type_can_change)(const struct disk_partitions*,
308 1.1 martin part_id);
309 1.1 martin
310 1.1 martin /* can we add further partitions? */
311 1.1 martin bool (*can_add_partition)(const struct disk_partitions*);
312 1.1 martin
313 1.1 martin /* is the custom attribut changable? */
314 1.1 martin bool (*custom_attribute_writable)(const struct disk_partitions*,
315 1.1 martin part_id, size_t attr_no);
316 1.1 martin /*
317 1.1 martin * Output formatting for custom attributes.
318 1.1 martin * If "info" is != NULL, use (where it makes sense)
319 1.1 martin * values from that structure, as if a call to set_part_info
320 1.1 martin * would have been done before this call.
321 1.1 martin */
322 1.1 martin bool (*format_custom_attribute)(const struct disk_partitions*,
323 1.1 martin part_id, size_t attr_no, const struct disk_part_info *info,
324 1.1 martin char *out, size_t out_space);
325 1.1 martin /* value setter functions for custom attributes */
326 1.1 martin /* pet_bool: */
327 1.1 martin bool (*custom_attribute_toggle)(struct disk_partitions*,
328 1.1 martin part_id, size_t attr_no);
329 1.1 martin /* pet_cardinal: */
330 1.1 martin bool (*custom_attribute_set_card)(struct disk_partitions*,
331 1.1 martin part_id, size_t attr_no, long new_val);
332 1.1 martin /* pet_str or pet_cardinal: */
333 1.1 martin bool (*custom_attribute_set_str)(struct disk_partitions*,
334 1.1 martin part_id, size_t attr_no, const char *new_val);
335 1.1 martin
336 1.4 martin /*
337 1.4 martin * Optional: additional user information when showing the size
338 1.4 martin * editor (especially for existing unknown partitions)
339 1.4 martin */
340 1.4 martin const char * (*other_partition_identifier)(const struct
341 1.4 martin disk_partitions*, part_id);
342 1.4 martin
343 1.1 martin
344 1.1 martin /* Retrieve device and partition names, e.g. for checking
345 1.1 martin * against kern.root_device or invoking newfs.
346 1.1 martin * For disklabel partitions, "part" will be set to the partition
347 1.1 martin * index (a = 0, b = 1, ...), for others it will get set to -1.
348 1.1 martin * If dev_name_usage is parent_device_only, the device name will
349 1.1 martin * not include a partition letter - obviously this only makes a
350 1.1 martin * difference with disklabel partitions.
351 1.1 martin * If dev_name_usage is logical_name instead of a device name
352 1.1 martin * a given name may be returned in NAME= syntax.
353 1.1 martin * If with_path is true (and the returned value is a device
354 1.1 martin * node), include the /dev/ prefix in the result string
355 1.1 martin * (this is ignored when returning NAME= syntax for /etc/fstab).
356 1.13 martin * If life is true, the device must be made available under
357 1.13 martin * that name (only makes a difference for NAME=syntax if
358 1.13 martin * no wedge has been created yet,) - implied for all variants
359 1.13 martin * where dev_name_usage != logical_name.
360 1.1 martin */
361 1.1 martin bool (*get_part_device)(const struct disk_partitions*,
362 1.1 martin part_id, char *devname, size_t max_devname_len, int *part,
363 1.13 martin enum dev_name_usage, bool with_path, bool life);
364 1.1 martin
365 1.1 martin /*
366 1.1 martin * How big could we resize the given position (start of existing
367 1.1 martin * partition or free space)
368 1.1 martin */
369 1.1 martin daddr_t (*max_free_space_at)(const struct disk_partitions*, daddr_t);
370 1.1 martin
371 1.1 martin /*
372 1.1 martin * Provide a list of free spaces usable for further partitioning,
373 1.1 martin * assuming the given partition alignment.
374 1.1 martin * If start is > 0 no space with lower sector numbers will
375 1.1 martin * be found.
376 1.1 martin * If ignore is > 0, any partition starting at that sector will
377 1.1 martin * be considered "free", this is used e.g. when moving an existing
378 1.1 martin * partition around.
379 1.1 martin */
380 1.22 rillig size_t (*get_free_spaces)(const struct disk_partitions*,
381 1.1 martin struct disk_part_free_space *result, size_t max_num_result,
382 1.1 martin daddr_t min_space_size, daddr_t align, daddr_t start,
383 1.1 martin daddr_t ignore /* -1 */);
384 1.1 martin
385 1.1 martin /*
386 1.1 martin * Translate a partition description from a foreign partitioning
387 1.1 martin * scheme as close as possible to what we can handle in add_partition.
388 1.1 martin * This mostly adjusts flags and partition type pointers (using
389 1.1 martin * more lose matching than add_partition would do).
390 1.1 martin */
391 1.8 martin bool (*adapt_foreign_part_info)(
392 1.8 martin const struct disk_partitions *myself, struct disk_part_info *dest,
393 1.8 martin const struct disk_partitioning_scheme *src_scheme,
394 1.8 martin const struct disk_part_info *src);
395 1.1 martin
396 1.1 martin /*
397 1.1 martin * Update data for an existing partition
398 1.1 martin */
399 1.1 martin bool (*set_part_info)(struct disk_partitions*, part_id,
400 1.1 martin const struct disk_part_info*, const char **err_msg);
401 1.1 martin
402 1.1 martin /* Add a new partition and return its part_id. */
403 1.1 martin part_id (*add_partition)(struct disk_partitions*,
404 1.1 martin const struct disk_part_info*, const char **err_msg);
405 1.1 martin
406 1.1 martin /*
407 1.1 martin * Optional: add a partition from an outer scheme, accept all
408 1.1 martin * details w/o verification as best as possible.
409 1.1 martin */
410 1.1 martin part_id (*add_outer_partition)(struct disk_partitions*,
411 1.1 martin const struct disk_part_info*, const char **err_msg);
412 1.1 martin
413 1.1 martin /* Delete all partitions */
414 1.1 martin bool (*delete_all_partitions)(struct disk_partitions*);
415 1.1 martin
416 1.1 martin /* Optional: delete any partitions inside the given range */
417 1.1 martin bool (*delete_partitions_in_range)(struct disk_partitions*,
418 1.1 martin daddr_t start, daddr_t size);
419 1.1 martin
420 1.1 martin /* Delete the specified partition */
421 1.1 martin bool (*delete_partition)(struct disk_partitions*, part_id,
422 1.1 martin const char **err_msg);
423 1.1 martin
424 1.1 martin /*
425 1.1 martin * Methods for the whole set of partitions
426 1.1 martin */
427 1.1 martin /*
428 1.1 martin * If this scheme only creates a singly NetBSD partition, which
429 1.1 martin * then is sub-partitioned (usually by disklabel), this returns a
430 1.1 martin * pointer to the secondary partition set.
431 1.1 martin * Otherwise NULL is returned, e.g. when there is no
432 1.1 martin * NetBSD partition defined (so this might change over time).
433 1.1 martin * Schemes that NEVER use a secondary scheme set this
434 1.1 martin * function pointer to NULL.
435 1.1 martin *
436 1.2 martin * If force_empty = true, ignore all on-disk contents and just
437 1.24 andvar * create a new disk_partitions structure for the secondary scheme
438 1.2 martin * (this is used after deleting all partitions and setting up
439 1.2 martin * things for "use whole disk").
440 1.2 martin *
441 1.1 martin * The returned pointer is always owned by the primary partitions,
442 1.1 martin * caller MUST never free it, but otherwise can manipulate it
443 1.1 martin * arbitrarily.
444 1.1 martin */
445 1.1 martin struct disk_partitions *
446 1.2 martin (*secondary_partitions)(struct disk_partitions *, daddr_t start,
447 1.2 martin bool force_empty);
448 1.1 martin
449 1.1 martin /*
450 1.1 martin * Write the whole set (in new_state) back to disk.
451 1.1 martin */
452 1.1 martin bool (*write_to_disk)(struct disk_partitions *new_state);
453 1.1 martin
454 1.1 martin /*
455 1.1 martin * Try to read partitions from a disk, return NULL if this is not
456 1.1 martin * the partitioning scheme in use on that device.
457 1.1 martin * Usually start and len are 0 (and ignored).
458 1.1 martin * If this is about a part of a disk (like only the NetBSD
459 1.1 martin * MBR partition, start and len are the valid part of the
460 1.1 martin * disk.
461 1.1 martin */
462 1.1 martin struct disk_partitions * (*read_from_disk)(const char *,
463 1.15 martin daddr_t start, daddr_t len, size_t bytes_per_sec,
464 1.15 martin const struct disk_partitioning_scheme *);
465 1.1 martin
466 1.1 martin /*
467 1.15 martin * Set up all internal data for a new disk.
468 1.1 martin */
469 1.1 martin struct disk_partitions * (*create_new_for_disk)(const char *,
470 1.15 martin daddr_t start, daddr_t len, bool is_boot_drive,
471 1.15 martin struct disk_partitions *parent);
472 1.1 martin
473 1.1 martin /*
474 1.1 martin * Optional: this scheme may be used to boot from the given disk
475 1.1 martin */
476 1.1 martin bool (*have_boot_support)(const char *disk);
477 1.5 martin
478 1.1 martin /*
479 1.1 martin * Optional: try to guess disk geometry from the partition information
480 1.1 martin */
481 1.1 martin int (*guess_disk_geom)(struct disk_partitions *,
482 1.1 martin int *cyl, int *head, int *sec);
483 1.5 martin
484 1.1 martin /*
485 1.14 martin * Return a "cylinder size" (in number of blocks) - whatever that
486 1.14 martin * means to a particular partitioning scheme.
487 1.14 martin */
488 1.14 martin size_t (*get_cylinder_size)(const struct disk_partitions *);
489 1.14 martin
490 1.14 martin /*
491 1.1 martin * Optional: change used geometry info and update internal state
492 1.1 martin */
493 1.1 martin bool (*change_disk_geom)(struct disk_partitions *,
494 1.1 martin int cyl, int head, int sec);
495 1.5 martin
496 1.1 martin /*
497 1.1 martin * Optional:
498 1.1 martin * Get or set a name for the whole disk (most partitioning
499 1.1 martin * schemes do not provide this). Used for disklabel "pack names",
500 1.1 martin * which then may be used for aut-discovery of wedges, so it
501 1.1 martin * makes sense for the user to edit them.
502 1.1 martin */
503 1.1 martin bool (*get_disk_pack_name)(const struct disk_partitions *,
504 1.1 martin char *, size_t);
505 1.1 martin bool (*set_disk_pack_name)(struct disk_partitions *, const char *);
506 1.5 martin
507 1.5 martin /*
508 1.5 martin * Optional:
509 1.5 martin * Find a partition by name (as used in /etc/fstab NAME= entries)
510 1.5 martin */
511 1.5 martin part_id (*find_by_name)(struct disk_partitions *, const char *name);
512 1.5 martin
513 1.1 martin /*
514 1.1 martin * Optional:
515 1.1 martin * Try to guess install target partition from internal data,
516 1.1 martin * returns true if a safe match was found and sets start/size
517 1.1 martin * to the target partition.
518 1.1 martin */
519 1.1 martin bool (*guess_install_target)(const struct disk_partitions *,
520 1.1 martin daddr_t *start, daddr_t *size);
521 1.5 martin
522 1.1 martin /*
523 1.1 martin * Optional: verify that the whole set of partitions would be bootable,
524 1.1 martin * fix up any issues (with user interaction) where needed.
525 1.1 martin * If "quiet" is true, fix up everything silently if possible
526 1.1 martin * and never return 1.
527 1.1 martin * Returns:
528 1.1 martin * 0: abort install
529 1.1 martin * 1: re-edit partitions
530 1.1 martin * 2: use anyway (continue)
531 1.1 martin */
532 1.1 martin int (*post_edit_verify)(struct disk_partitions *, bool quiet);
533 1.5 martin
534 1.1 martin /*
535 1.1 martin * Optional: called during updates, before mounting the target disk(s),
536 1.1 martin * before md_pre_update() is called. Can be used to fixup
537 1.1 martin * partition info for historic errors (e.g. i386 changing MBR
538 1.1 martin * partition type from 165 to 169), similar to post_edit_verify.
539 1.1 martin * Returns:
540 1.1 martin * true if the partition info has changed (write back required)
541 1.1 martin * false if nothing further needs to be done.
542 1.1 martin */
543 1.1 martin bool (*pre_update_verify)(struct disk_partitions *);
544 1.1 martin
545 1.1 martin /* Free all the data */
546 1.1 martin void (*free)(struct disk_partitions*);
547 1.8 martin
548 1.18 martin /* Wipe all on-disk state, leave blank disk - and free data */
549 1.18 martin void (*destroy_part_scheme)(struct disk_partitions*);
550 1.18 martin
551 1.8 martin /* Scheme global cleanup */
552 1.8 martin void (*cleanup)(void);
553 1.1 martin };
554 1.1 martin
555 1.1 martin /*
556 1.1 martin * The in-memory representation of all partitions on a concrete disk,
557 1.1 martin * tied to the partitioning scheme in use.
558 1.1 martin *
559 1.1 martin * Concrete schemes will derive from the abstract disk_partitions
560 1.1 martin * structure (by aggregation), but consumers of the API will only
561 1.1 martin * ever see this public part.
562 1.1 martin */
563 1.1 martin struct disk_partitions {
564 1.1 martin /* which partitioning scheme is in use */
565 1.1 martin const struct disk_partitioning_scheme *pscheme;
566 1.1 martin
567 1.1 martin /* the disk device this came from (or should go to) */
568 1.1 martin const char *disk;
569 1.1 martin
570 1.1 martin /* global/public disk data */
571 1.1 martin
572 1.1 martin /*
573 1.15 martin * The basic unit of size used for this disk (all "start",
574 1.15 martin * "size" and "align" values are in this unit).
575 1.15 martin */
576 1.15 martin size_t bytes_per_sector; /* must be 2^n and >= 512 */
577 1.15 martin
578 1.15 martin /*
579 1.1 martin * Valid partitions may have IDs in the range 0 .. num_part (excl.)
580 1.1 martin */
581 1.1 martin part_id num_part;
582 1.1 martin
583 1.1 martin /*
584 1.1 martin * If this is a sub-partitioning, the start of the "disk" is
585 1.1 martin * some arbitrary partition in the parent. Sometimes we need
586 1.1 martin * to be able to calculate absoluted offsets.
587 1.1 martin */
588 1.1 martin daddr_t disk_start;
589 1.1 martin /*
590 1.1 martin * Total size of the disk (usable for partitioning)
591 1.1 martin */
592 1.1 martin daddr_t disk_size;
593 1.1 martin
594 1.1 martin /*
595 1.1 martin * Space not yet allocated
596 1.1 martin */
597 1.1 martin daddr_t free_space;
598 1.1 martin
599 1.1 martin /*
600 1.1 martin * If this is the secondary partitioning scheme, pointer to
601 1.1 martin * the outer one. Otherwise NULL.
602 1.1 martin */
603 1.1 martin struct disk_partitions *parent;
604 1.1 martin };
605 1.1 martin
606 1.1 martin /*
607 1.1 martin * A list of partitioning schemes, so we can iterate over everything
608 1.1 martin * supported (e.g. when partitioning a new disk). NULL terminated.
609 1.1 martin */
610 1.1 martin extern const struct disk_partitioning_scheme **available_part_schemes;
611 1.1 martin extern size_t num_available_part_schemes;
612 1.1 martin
613 1.1 martin /*
614 1.1 martin * Generic reader - query a disk device and read all partitions from it
615 1.1 martin */
616 1.1 martin struct disk_partitions *
617 1.15 martin partitions_read_disk(const char *, daddr_t disk_size,
618 1.15 martin size_t bytes_per_sector, bool no_mbr);
619 1.1 martin
620 1.1 martin /*
621 1.23 andvar * Generic part info adaption, may be overridden by individual partitioning
622 1.8 martin * schemes
623 1.8 martin */
624 1.8 martin bool generic_adapt_foreign_part_info(
625 1.8 martin const struct disk_partitions *myself, struct disk_part_info *dest,
626 1.8 martin const struct disk_partitioning_scheme *src_scheme,
627 1.8 martin const struct disk_part_info *src);
628 1.8 martin
629 1.8 martin /*
630 1.24 andvar * One time initialization and cleanup
631 1.1 martin */
632 1.1 martin void partitions_init(void);
633 1.8 martin void partitions_cleanup(void);
634 1.9 martin
635