1 1.8 andvar /* $NetBSD: md.c,v 1.8 2023/03/26 19:10:34 andvar Exp $ */ 2 1.1 dholland 3 1.1 dholland /* 4 1.1 dholland * Copyright 1997 Piermont Information Systems Inc. 5 1.1 dholland * All rights reserved. 6 1.1 dholland * 7 1.1 dholland * Based on code written by Philip A. Nelson for Piermont Information 8 1.1 dholland * Systems Inc. 9 1.1 dholland * 10 1.1 dholland * Redistribution and use in source and binary forms, with or without 11 1.1 dholland * modification, are permitted provided that the following conditions 12 1.1 dholland * are met: 13 1.1 dholland * 1. Redistributions of source code must retain the above copyright 14 1.1 dholland * notice, this list of conditions and the following disclaimer. 15 1.1 dholland * 2. Redistributions in binary form must reproduce the above copyright 16 1.1 dholland * notice, this list of conditions and the following disclaimer in the 17 1.1 dholland * documentation and/or other materials provided with the distribution. 18 1.1 dholland * 3. The name of Piermont Information Systems Inc. may not be used to endorse 19 1.1 dholland * or promote products derived from this software without specific prior 20 1.1 dholland * written permission. 21 1.1 dholland * 22 1.1 dholland * THIS SOFTWARE IS PROVIDED BY PIERMONT INFORMATION SYSTEMS INC. ``AS IS'' 23 1.1 dholland * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 24 1.1 dholland * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 25 1.1 dholland * ARE DISCLAIMED. IN NO EVENT SHALL PIERMONT INFORMATION SYSTEMS INC. BE 26 1.1 dholland * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 27 1.1 dholland * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 28 1.1 dholland * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 29 1.1 dholland * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 30 1.1 dholland * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 31 1.1 dholland * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF 32 1.1 dholland * THE POSSIBILITY OF SUCH DAMAGE. 33 1.1 dholland * 34 1.1 dholland */ 35 1.1 dholland 36 1.1 dholland #include <sys/types.h> 37 1.1 dholland #include <sys/ioctl.h> 38 1.1 dholland #include <sys/param.h> 39 1.1 dholland #include <stdio.h> 40 1.1 dholland #include <curses.h> 41 1.1 dholland #include <unistd.h> 42 1.1 dholland #include <fcntl.h> 43 1.1 dholland #include <util.h> 44 1.1 dholland 45 1.1 dholland #include "defs.h" 46 1.1 dholland #include "md.h" 47 1.1 dholland #include "msg_defs.h" 48 1.1 dholland #include "menu_defs.h" 49 1.1 dholland 50 1.4 martin bool 51 1.4 martin md_get_info(struct install_partition_desc *install) 52 1.1 dholland { 53 1.1 dholland struct disklabel disklabel; 54 1.1 dholland int fd; 55 1.1 dholland char dev_name[100]; 56 1.1 dholland 57 1.2 martin snprintf(dev_name, 100, "/dev/r%s%c", pm->diskdev, 'a' + getrawpartition()); 58 1.1 dholland 59 1.1 dholland fd = open(dev_name, O_RDONLY, 0); 60 1.1 dholland if (fd < 0) { 61 1.1 dholland endwin(); 62 1.1 dholland fprintf (stderr, "Can't open %s\n", dev_name); 63 1.1 dholland exit(1); 64 1.1 dholland } 65 1.1 dholland if (ioctl(fd, DIOCGDINFO, &disklabel) == -1) { 66 1.1 dholland endwin(); 67 1.1 dholland fprintf (stderr, "Can't read disklabel on %s.\n", dev_name); 68 1.1 dholland close(fd); 69 1.1 dholland exit(1); 70 1.1 dholland } 71 1.1 dholland close(fd); 72 1.1 dholland 73 1.2 martin pm->dlcyl = disklabel.d_ncylinders; 74 1.2 martin pm->dlhead = disklabel.d_ntracks; 75 1.2 martin pm->dlsec = disklabel.d_nsectors; 76 1.2 martin pm->sectorsize = disklabel.d_secsize; 77 1.2 martin pm->dlcylsize = disklabel.d_secpercyl; 78 1.1 dholland 79 1.1 dholland /* 80 1.2 martin * Compute whole disk size. Take max of (pm->dlcyl*pm->dlhead*pm->dlsec) 81 1.1 dholland * and secperunit, just in case the disk is already labelled. 82 1.1 dholland * (If our new label's RAW_PART size ends up smaller than the 83 1.1 dholland * in-core RAW_PART size value, updating the label will fail.) 84 1.1 dholland */ 85 1.2 martin pm->dlsize = pm->dlcyl * pm->dlhead * pm->dlsec; 86 1.2 martin if (disklabel.d_secperunit > pm->dlsize) 87 1.2 martin pm->dlsize = disklabel.d_secperunit; 88 1.1 dholland 89 1.4 martin return true; 90 1.1 dholland } 91 1.1 dholland 92 1.1 dholland /* 93 1.1 dholland * hook called before writing new disklabel. 94 1.1 dholland */ 95 1.4 martin bool 96 1.4 martin md_pre_disklabel(struct install_partition_desc *install, 97 1.4 martin struct disk_partitions *parts) 98 1.1 dholland { 99 1.1 dholland 100 1.4 martin return true; 101 1.1 dholland } 102 1.1 dholland 103 1.1 dholland /* 104 1.1 dholland * hook called after writing disklabel to new target disk. 105 1.1 dholland */ 106 1.4 martin bool 107 1.4 martin md_post_disklabel(struct install_partition_desc *install, 108 1.4 martin struct disk_partitions *parts) 109 1.1 dholland { 110 1.4 martin return true; 111 1.1 dholland } 112 1.1 dholland 113 1.1 dholland /* 114 1.1 dholland * MD hook called after upgrade() or install() has finished setting 115 1.1 dholland * up the target disk but immediately before the user is given the 116 1.1 dholland * ``disks are now set up'' message, so that if power fails, they can 117 1.1 dholland * continue installation by booting the target disk and doing an 118 1.1 dholland * `upgrade'. 119 1.1 dholland */ 120 1.1 dholland int 121 1.4 martin md_post_newfs(struct install_partition_desc *install) 122 1.1 dholland { 123 1.1 dholland 124 1.1 dholland return 0; 125 1.1 dholland } 126 1.1 dholland 127 1.6 martin int 128 1.4 martin md_make_bsd_partitions(struct install_partition_desc *install) 129 1.1 dholland { 130 1.1 dholland 131 1.4 martin return make_bsd_partitions(install); 132 1.1 dholland } 133 1.1 dholland 134 1.1 dholland /* 135 1.8 andvar * any additional partition validation 136 1.1 dholland */ 137 1.4 martin bool 138 1.4 martin md_check_partitions(struct install_partition_desc *install) 139 1.1 dholland { 140 1.1 dholland 141 1.4 martin return true; 142 1.1 dholland } 143 1.1 dholland 144 1.1 dholland /* Upgrade support */ 145 1.1 dholland int 146 1.4 martin md_update(struct install_partition_desc *install) 147 1.1 dholland { 148 1.1 dholland 149 1.1 dholland endwin(); 150 1.4 martin md_post_newfs(install); 151 1.1 dholland wrefresh(curscr); 152 1.1 dholland wmove(stdscr, 0, 0); 153 1.1 dholland wclear(stdscr); 154 1.1 dholland wrefresh(stdscr); 155 1.1 dholland return 1; 156 1.1 dholland } 157 1.1 dholland 158 1.1 dholland void 159 1.4 martin md_cleanup_install(struct install_partition_desc *install) 160 1.1 dholland { 161 1.1 dholland 162 1.1 dholland enable_rc_conf(); 163 1.1 dholland } 164 1.1 dholland 165 1.1 dholland int 166 1.4 martin md_pre_update(struct install_partition_desc *install) 167 1.1 dholland { 168 1.1 dholland 169 1.1 dholland return 1; 170 1.1 dholland } 171 1.1 dholland 172 1.1 dholland void 173 1.1 dholland md_init(void) 174 1.1 dholland { 175 1.1 dholland } 176 1.1 dholland 177 1.1 dholland void 178 1.1 dholland md_init_set_status(int flags) 179 1.1 dholland { 180 1.1 dholland 181 1.1 dholland (void)flags; 182 1.1 dholland } 183 1.1 dholland 184 1.1 dholland int 185 1.7 martin md_post_extract(struct install_partition_desc *install, bool upgrade) 186 1.1 dholland { 187 1.1 dholland return 0; 188 1.1 dholland } 189 1.1 dholland 190 1.1 dholland int 191 1.5 martin md_pre_mount(struct install_partition_desc *install, size_t ndx) 192 1.1 dholland { 193 1.1 dholland return 0; 194 1.1 dholland } 195 1.4 martin 196 1.4 martin bool 197 1.4 martin md_parts_use_wholedisk(struct disk_partitions *parts) 198 1.4 martin { 199 1.4 martin 200 1.4 martin return parts_use_wholedisk(parts, 0, NULL); 201 1.4 martin } 202 1.4 martin 203 1.4 martin #ifdef HAVE_GPT 204 1.4 martin bool 205 1.4 martin md_gpt_post_write(struct disk_partitions *parts, part_id root_id, 206 1.4 martin bool root_is_new, part_id efi_id, bool efi_is_new) 207 1.4 martin { 208 1.4 martin /* no GPT boot support, nothing needs to be done here */ 209 1.4 martin return true; 210 1.4 martin } 211 1.4 martin #endif 212 1.4 martin 213