bsdlabel.c revision 1.4 1 1.4 tsutsui /* $NetBSD: bsdlabel.c,v 1.4 2009/03/31 11:48:15 tsutsui 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 <string.h>
37 1.1 leo #include "libtos.h"
38 1.1 leo #include "diskio.h"
39 1.1 leo #include "ahdilbl.h"
40 1.1 leo #include "disklbl.h"
41 1.1 leo
42 1.1 leo static int dkcksum PROTO((struct disklabel *));
43 1.1 leo
44 1.1 leo int
45 1.2 dsl bsd_getlabel(disk_t *dd, struct disklabel *dlp, u_int offset)
46 1.1 leo {
47 1.1 leo u_char *bblk;
48 1.1 leo u_int nsec;
49 1.1 leo int rv;
50 1.1 leo
51 1.1 leo nsec = (BBMINSIZE + (dd->bsize - 1)) / dd->bsize;
52 1.1 leo bblk = disk_read(dd, offset, nsec);
53 1.1 leo if (bblk) {
54 1.1 leo u_int *end, *p;
55 1.1 leo
56 1.1 leo end = (u_int *)&bblk[BBMINSIZE - sizeof(struct disklabel)];
57 1.1 leo rv = 1;
58 1.1 leo for (p = (u_int *)bblk; p < end; ++p) {
59 1.1 leo struct disklabel *dl = (struct disklabel *)&p[1];
60 1.1 leo if ( ( (p[0] == NBDAMAGIC && offset == 0)
61 1.1 leo || (p[0] == AHDIMAGIC && offset != 0)
62 1.1 leo || (u_char *)dl - bblk == 7168
63 1.1 leo )
64 1.1 leo && dl->d_npartitions <= MAXPARTITIONS
65 1.1 leo && dl->d_magic2 == DISKMAGIC
66 1.1 leo && dl->d_magic == DISKMAGIC
67 1.1 leo && dkcksum(dl) == 0
68 1.1 leo ) {
69 1.4 tsutsui memcpy(dlp, dl, sizeof(*dlp));
70 1.1 leo rv = 0;
71 1.1 leo break;
72 1.1 leo }
73 1.1 leo }
74 1.1 leo free(bblk);
75 1.1 leo }
76 1.1 leo else rv = -1;
77 1.1 leo
78 1.1 leo return(rv);
79 1.1 leo }
80 1.1 leo
81 1.1 leo static int
82 1.2 dsl dkcksum(struct disklabel *dl)
83 1.1 leo {
84 1.1 leo u_short *start, *end, sum = 0;
85 1.1 leo
86 1.1 leo start = (u_short *)dl;
87 1.1 leo end = (u_short *)&dl->d_partitions[dl->d_npartitions];
88 1.1 leo while (start < end)
89 1.1 leo sum ^= *start++;
90 1.1 leo return(sum);
91 1.1 leo }
92