1 /* $NetBSD: bsdlabel.c,v 1.1 2002/03/22 21:27:59 leo Exp $ */ 2 3 /* 4 * Copyright (c) 1995 Waldi Ravens. 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 * 3. All advertising materials mentioning features or use of this software 16 * must display the following acknowledgement: 17 * This product includes software developed by Waldi Ravens. 18 * 4. The name of the author may not be used to endorse or promote products 19 * derived from this software without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 22 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 23 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 24 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 25 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 26 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 27 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 28 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 29 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 30 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 31 */ 32 33 #include <sys/types.h> 34 #include <stdlib.h> 35 #include <stdio.h> 36 #include <string.h> 37 #include "libtos.h" 38 #include "diskio.h" 39 #include "ahdilbl.h" 40 #include "disklbl.h" 41 42 static int dkcksum PROTO((struct disklabel *)); 43 44 int 45 bsd_getlabel(dd, dlp, offset) 46 disk_t *dd; 47 struct disklabel *dlp; 48 u_int offset; 49 { 50 u_char *bblk; 51 u_int nsec; 52 int rv; 53 54 nsec = (BBMINSIZE + (dd->bsize - 1)) / dd->bsize; 55 bblk = disk_read(dd, offset, nsec); 56 if (bblk) { 57 u_int *end, *p; 58 59 end = (u_int *)&bblk[BBMINSIZE - sizeof(struct disklabel)]; 60 rv = 1; 61 for (p = (u_int *)bblk; p < end; ++p) { 62 struct disklabel *dl = (struct disklabel *)&p[1]; 63 if ( ( (p[0] == NBDAMAGIC && offset == 0) 64 || (p[0] == AHDIMAGIC && offset != 0) 65 || (u_char *)dl - bblk == 7168 66 ) 67 && dl->d_npartitions <= MAXPARTITIONS 68 && dl->d_magic2 == DISKMAGIC 69 && dl->d_magic == DISKMAGIC 70 && dkcksum(dl) == 0 71 ) { 72 bcopy(dl, dlp, sizeof(*dlp)); 73 rv = 0; 74 break; 75 } 76 } 77 free(bblk); 78 } 79 else rv = -1; 80 81 return(rv); 82 } 83 84 static int 85 dkcksum(dl) 86 struct disklabel *dl; 87 { 88 u_short *start, *end, sum = 0; 89 90 start = (u_short *)dl; 91 end = (u_short *)&dl->d_partitions[dl->d_npartitions]; 92 while (start < end) 93 sum ^= *start++; 94 return(sum); 95 } 96