1 1.6 dsl /* $NetBSD: disklbl.c,v 1.6 2009/03/14 21:04:07 dsl Exp $ */ 2 1.1 leo 3 1.1 leo /* 4 1.1 leo * Copyright (c) 1995 Waldi Ravens. 5 1.1 leo * All rights reserved. 6 1.1 leo * 7 1.1 leo * Redistribution and use in source and binary forms, with or without 8 1.1 leo * modification, are permitted provided that the following conditions 9 1.1 leo * are met: 10 1.1 leo * 1. Redistributions of source code must retain the above copyright 11 1.1 leo * notice, this list of conditions and the following disclaimer. 12 1.1 leo * 2. Redistributions in binary form must reproduce the above copyright 13 1.1 leo * notice, this list of conditions and the following disclaimer in the 14 1.1 leo * documentation and/or other materials provided with the distribution. 15 1.1 leo * 3. All advertising materials mentioning features or use of this software 16 1.1 leo * must display the following acknowledgement: 17 1.1 leo * This product includes software developed by Waldi Ravens. 18 1.1 leo * 4. The name of the author may not be used to endorse or promote products 19 1.1 leo * derived from this software without specific prior written permission. 20 1.1 leo * 21 1.1 leo * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 22 1.1 leo * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 23 1.1 leo * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 24 1.1 leo * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 25 1.1 leo * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 26 1.1 leo * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 27 1.1 leo * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 28 1.1 leo * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 29 1.1 leo * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 30 1.1 leo * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 31 1.1 leo */ 32 1.1 leo 33 1.1 leo #include <sys/types.h> 34 1.1 leo #include <stdlib.h> 35 1.1 leo #include <stdio.h> 36 1.1 leo #include "libtos.h" 37 1.1 leo #include "aptck.h" 38 1.1 leo #include "ahdilbl.h" 39 1.1 leo #include "disklbl.h" 40 1.1 leo 41 1.1 leo static int dkcksum PROTO((struct disklabel *)); 42 1.1 leo static int bsd_label PROTO((disk_t *, u_int)); 43 1.1 leo static int ahdi_label PROTO((disk_t *)); 44 1.1 leo static int ahdi_display PROTO((disk_t *)); 45 1.1 leo static u_int ahdi_getparts PROTO((disk_t *, u_int, u_int)); 46 1.1 leo 47 1.1 leo int 48 1.5 dsl readdisklabel(disk_t *dd) 49 1.1 leo { 50 1.1 leo int e; 51 1.1 leo 52 1.3 leo printf("Device : %s (%s) [%s]\n", dd->sname, dd->fname, 53 1.3 leo dd->product); 54 1.1 leo printf("Medium size: %lu sectors\n", (u_long)dd->msize); 55 1.1 leo printf("Sector size: %lu bytes\n\n", (u_long)dd->bsize); 56 1.1 leo 57 1.1 leo e = bsd_label(dd, LABELSECTOR); 58 1.1 leo if (e < 0) { 59 1.1 leo printf("Device I/O error (hardware problem?)\n\n"); 60 1.1 leo return(-1); 61 1.1 leo } 62 1.1 leo if (!e) { 63 1.1 leo printf("NetBSD/Atari format, boot block: " 64 1.1 leo "sector %u labeloffset %u\n\n", 65 1.1 leo dd->bblock, dd->lblofs); 66 1.1 leo return(0); 67 1.1 leo } 68 1.1 leo 69 1.1 leo e = ahdi_label(dd); 70 1.1 leo if (e < 0) { 71 1.1 leo printf("Device I/O error (hardware problem?)\n\n"); 72 1.1 leo return(-1); 73 1.1 leo } 74 1.1 leo if (!e) { 75 1.1 leo printf("AHDI format, NetBSD boot block: "); 76 1.1 leo if (dd->bblock != NO_BOOT_BLOCK) 77 1.1 leo printf("sector %u labeloffset %u\n\n", 78 1.1 leo dd->bblock, dd->lblofs); 79 1.1 leo else printf("none\n\n"); 80 1.1 leo return(0); 81 1.1 leo } 82 1.1 leo 83 1.1 leo printf("Unknown label format.\n\n"); 84 1.1 leo return(-1); 85 1.1 leo } 86 1.1 leo 87 1.1 leo static int 88 1.5 dsl bsd_label(disk_t *dd, u_int offset) 89 1.1 leo { 90 1.1 leo u_char *bblk; 91 1.1 leo u_int nsec; 92 1.1 leo int rv; 93 1.1 leo 94 1.2 leo nsec = (BBMINSIZE + (dd->bsize - 1)) / dd->bsize; 95 1.1 leo bblk = disk_read(dd, offset, nsec); 96 1.1 leo if (bblk) { 97 1.3 leo u_int *end, *p; 98 1.1 leo 99 1.3 leo end = (u_int *)&bblk[BBMINSIZE - sizeof(struct disklabel)]; 100 1.3 leo rv = 1; 101 1.3 leo for (p = (u_int *)bblk; p < end; ++p) { 102 1.3 leo struct disklabel *dl = (struct disklabel *)&p[1]; 103 1.3 leo if ( ( (p[0] == NBDAMAGIC && offset == 0) 104 1.3 leo || (p[0] == AHDIMAGIC && offset != 0) 105 1.3 leo || (u_char *)dl - bblk == 7168 106 1.3 leo ) 107 1.3 leo && dl->d_npartitions <= MAXPARTITIONS 108 1.3 leo && dl->d_magic2 == DISKMAGIC 109 1.3 leo && dl->d_magic == DISKMAGIC 110 1.3 leo && dkcksum(dl) == 0 111 1.3 leo ) { 112 1.3 leo dd->lblofs = (u_char *)dl - bblk; 113 1.1 leo dd->bblock = offset; 114 1.1 leo rv = 0; 115 1.1 leo break; 116 1.1 leo } 117 1.1 leo } 118 1.1 leo free(bblk); 119 1.1 leo } 120 1.1 leo else rv = -1; 121 1.1 leo 122 1.1 leo return(rv); 123 1.1 leo } 124 1.1 leo 125 1.1 leo static int 126 1.5 dsl dkcksum(struct disklabel *dl) 127 1.1 leo { 128 1.1 leo u_short *start, *end, sum = 0; 129 1.1 leo 130 1.1 leo start = (u_short *)dl; 131 1.1 leo end = (u_short *)&dl->d_partitions[dl->d_npartitions]; 132 1.1 leo while (start < end) 133 1.1 leo sum ^= *start++; 134 1.1 leo return(sum); 135 1.1 leo } 136 1.1 leo 137 1.1 leo int 138 1.5 dsl ahdi_label(disk_t *dd) 139 1.1 leo { 140 1.1 leo u_int i; 141 1.1 leo int e; 142 1.1 leo 143 1.1 leo /* 144 1.1 leo * The AHDI format requires a specific block size. 145 1.1 leo */ 146 1.1 leo if (dd->bsize != AHDI_BSIZE) 147 1.1 leo return(1); 148 1.1 leo 149 1.1 leo /* 150 1.1 leo * Fetch the AHDI partition descriptors. 151 1.1 leo */ 152 1.1 leo i = ahdi_getparts(dd, AHDI_BBLOCK, AHDI_BBLOCK); 153 1.1 leo if (i) { 154 1.1 leo if (i < dd->msize) 155 1.1 leo return(-1); /* disk read error */ 156 1.1 leo else return(1); /* reading past end of medium */ 157 1.1 leo } 158 1.1 leo 159 1.1 leo /* 160 1.1 leo * Display and perform sanity checks. 161 1.1 leo */ 162 1.1 leo i = ahdi_display(dd); 163 1.1 leo if (i) 164 1.1 leo return(i); 165 1.1 leo 166 1.1 leo /* 167 1.1 leo * Search for a NetBSD disk label 168 1.1 leo */ 169 1.1 leo dd->bblock = NO_BOOT_BLOCK; 170 1.1 leo for (i = 0; i < dd->nparts; ++i) { 171 1.1 leo part_t *pd = &dd->parts[i]; 172 1.1 leo u_int id = *((u_int32_t *)&pd->id) >> 8; 173 1.1 leo if (id == AHDI_PID_NBD || id == AHDI_PID_RAW) { 174 1.1 leo u_int offs = pd->start; 175 1.1 leo if ((e = bsd_label(dd, offs)) < 0) { 176 1.1 leo return(e); /* I/O error */ 177 1.1 leo } 178 1.1 leo if (!e) { 179 1.1 leo dd->bblock = offs; /* got it */ 180 1.1 leo return(0); 181 1.1 leo } 182 1.1 leo if (id == AHDI_PID_NBD && dd->bblock == NO_BOOT_BLOCK) 183 1.1 leo dd->bblock = offs; 184 1.1 leo } 185 1.1 leo } 186 1.1 leo return(0); 187 1.1 leo } 188 1.1 leo 189 1.1 leo static int 190 1.6 dsl root_cmp(const void *x1, const void *x2) 191 1.1 leo { 192 1.1 leo const u_int *r1 = x1, 193 1.1 leo *r2 = x2; 194 1.1 leo 195 1.1 leo if (*r1 < *r2) 196 1.1 leo return(-1); 197 1.1 leo if (*r1 > *r2) 198 1.1 leo return(1); 199 1.1 leo return(0); 200 1.1 leo } 201 1.1 leo 202 1.1 leo static int 203 1.6 dsl part_cmp(const void *x1, const void *x2) 204 1.1 leo { 205 1.1 leo const part_t *p1 = x1, 206 1.1 leo *p2 = x2; 207 1.1 leo 208 1.1 leo if (p1->start < p2->start) 209 1.1 leo return(-1); 210 1.1 leo if (p1->start > p2->start) 211 1.1 leo return(1); 212 1.1 leo if (p1->end < p2->end) 213 1.1 leo return(-1); 214 1.1 leo if (p1->end > p2->end) 215 1.1 leo return(1); 216 1.1 leo if (p1->rsec < p2->rsec) 217 1.1 leo return(-1); 218 1.1 leo if (p1->rsec > p2->rsec) 219 1.1 leo return(1); 220 1.1 leo if (p1->rent < p2->rent) 221 1.1 leo return(-1); 222 1.1 leo if (p1->rent > p2->rent) 223 1.1 leo return(1); 224 1.1 leo return(0); 225 1.1 leo } 226 1.1 leo 227 1.1 leo static int 228 1.5 dsl ahdi_display(disk_t *dd) 229 1.1 leo { 230 1.1 leo int i, j, rv = 0; 231 1.1 leo 232 1.1 leo printf("Start of bad sector list : %u\n", dd->bslst); 233 1.1 leo if (dd->bslst == 0) { 234 1.1 leo printf("* Illegal value (zero) *\n"); rv = 1; 235 1.1 leo } 236 1.1 leo printf("End of bad sector list : %u\n", dd->bslend); 237 1.1 leo if (dd->bslend == 0) { 238 1.1 leo printf("* Illegal value (zero) *\n"); rv = 1; 239 1.1 leo } 240 1.1 leo printf("Medium size (in root sec): %u\n", dd->hdsize); 241 1.1 leo if (dd->hdsize == 0) { 242 1.1 leo printf("* Illegal value (zero) *\n"); rv = 1; 243 1.1 leo } 244 1.1 leo 245 1.1 leo qsort(dd->roots, dd->nroots, sizeof *dd->roots, root_cmp); 246 1.1 leo qsort(dd->parts, dd->nparts, sizeof *dd->parts, part_cmp); 247 1.1 leo printf("\n root desc id start end MBs\n"); 248 1.1 leo 249 1.1 leo for (i = 0; i < dd->nparts; ++i) { 250 1.1 leo part_t *p1 = &dd->parts[i]; 251 1.1 leo u_int megs = p1->end - p1->start + 1, 252 1.1 leo blpm = (1024 * 1024) / dd->bsize; 253 1.1 leo megs = (megs + (blpm >> 1)) / blpm; 254 1.1 leo printf("%8u %4u %s %8u %8u (%3u)\n", 255 1.1 leo p1->rsec, p1->rent, p1->id, 256 1.1 leo p1->start, p1->end, megs); 257 1.1 leo for (j = 0; j < dd->nroots; ++j) { 258 1.1 leo u_int aux = dd->roots[j]; 259 1.1 leo if (aux >= p1->start && aux <= p1->end) { 260 1.4 wiz printf("FATAL: auxiliary root at %u\n", aux); 261 1.3 leo rv = 1; 262 1.1 leo } 263 1.1 leo } 264 1.1 leo for (j = i; j--;) { 265 1.3 leo part_t *p2 = &dd->parts[j]; 266 1.3 leo if (p1->start >= p2->start && p1->start <= p2->end) { 267 1.3 leo printf("FATAL: clash with %u/%u\n", p2->rsec, p2->rent); 268 1.3 leo rv = 1; 269 1.3 leo } 270 1.3 leo if (p2->start >= p1->start && p2->start <= p1->end) { 271 1.3 leo printf("FATAL: clash with %u/%u\n", p2->rsec, p2->rent); 272 1.3 leo rv = 1; 273 1.3 leo } 274 1.1 leo } 275 1.1 leo if (p1->start >= dd->bslst && p1->start <= dd->bslend) { 276 1.3 leo printf("FATAL: partition overlaps with bad sector list\n"); 277 1.3 leo rv = 1; 278 1.1 leo } 279 1.1 leo if (dd->bslst >= p1->start && dd->bslst <= p1->end) { 280 1.3 leo printf("FATAL: partition overlaps with bad sector list\n"); 281 1.3 leo rv = 1; 282 1.1 leo } 283 1.1 leo } 284 1.1 leo 285 1.4 wiz printf("\nTotal number of auxiliary roots: %u\n", dd->nroots); 286 1.1 leo printf("Total number of partitions : %u\n", dd->nparts); 287 1.1 leo if (dd->nparts == 0) { 288 1.1 leo printf("* Weird # of partitions (zero) *\n"); rv = 1; 289 1.1 leo } 290 1.1 leo if (dd->nparts > AHDI_MAXPARTS) { 291 1.1 leo printf("* Too many AHDI partitions for the default NetBSD " 292 1.1 leo "kernel *\n Increase MAXAUXROOTS in src/sys/arch/" 293 1.1 leo "atari/include/disklabel.h\n to at least %u, and " 294 1.1 leo "recompile the NetBSD kernel.\n", dd->nroots); 295 1.1 leo rv = -1; 296 1.1 leo } 297 1.1 leo return(rv); 298 1.1 leo } 299 1.1 leo 300 1.1 leo static u_int 301 1.1 leo ahdi_getparts(dd, rsec, esec) 302 1.1 leo disk_t *dd; 303 1.1 leo u_int rsec, 304 1.1 leo esec; 305 1.1 leo { 306 1.1 leo struct ahdi_part *part, *end; 307 1.1 leo struct ahdi_root *root; 308 1.1 leo u_int rv; 309 1.1 leo 310 1.1 leo root = disk_read(dd, rsec, 1); 311 1.1 leo if (!root) { 312 1.1 leo rv = rsec + (rsec == 0); 313 1.1 leo goto done; 314 1.1 leo } 315 1.1 leo 316 1.1 leo if (rsec == AHDI_BBLOCK) 317 1.1 leo end = &root->ar_parts[AHDI_MAXRPD]; 318 1.1 leo else end = &root->ar_parts[AHDI_MAXARPD]; 319 1.1 leo for (part = root->ar_parts; part < end; ++part) { 320 1.1 leo u_int id = *((u_int32_t *)&part->ap_flg); 321 1.1 leo if (!(id & 0x01000000)) 322 1.1 leo continue; 323 1.1 leo if ((id &= 0x00ffffff) == AHDI_PID_XGM) { 324 1.1 leo u_int offs = part->ap_offs + esec; 325 1.1 leo u_int i = ++dd->nroots; 326 1.1 leo dd->roots = xrealloc(dd->roots, i * sizeof *dd->roots); 327 1.1 leo dd->roots[--i] = offs; 328 1.3 leo rv = ahdi_getparts(dd, offs, 329 1.3 leo esec == AHDI_BBLOCK ? offs : esec); 330 1.1 leo if (rv) 331 1.1 leo goto done; 332 1.1 leo } else { 333 1.1 leo part_t *p; 334 1.1 leo u_int i = ++dd->nparts; 335 1.1 leo dd->parts = xrealloc(dd->parts, i * sizeof *dd->parts); 336 1.1 leo p = &dd->parts[--i]; 337 1.1 leo *((u_int32_t *)&p->id) = id << 8; 338 1.1 leo p->start = part->ap_offs + rsec; 339 1.1 leo p->end = p->start + part->ap_size - 1; 340 1.1 leo p->rsec = rsec; 341 1.1 leo p->rent = part - root->ar_parts; 342 1.1 leo } 343 1.1 leo } 344 1.1 leo dd->hdsize = root->ar_hdsize; 345 1.1 leo dd->bslst = root->ar_bslst; 346 1.1 leo dd->bslend = root->ar_bslst + root->ar_bslsize - 1; 347 1.1 leo rv = 0; 348 1.1 leo done: 349 1.1 leo free(root); 350 1.1 leo return(rv); 351 1.1 leo } 352