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