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