disklabel.c revision 1.2.2.2 1 1.2.2.2 brezak /*-
2 1.2.2.2 brezak * Copyright (c) 1993
3 1.2.2.2 brezak * The Regents of the University of California. All rights reserved.
4 1.2.2.2 brezak *
5 1.2.2.2 brezak * Redistribution and use in source and binary forms, with or without
6 1.2.2.2 brezak * modification, are permitted provided that the following conditions
7 1.2.2.2 brezak * are met:
8 1.2.2.2 brezak * 1. Redistributions of source code must retain the above copyright
9 1.2.2.2 brezak * notice, this list of conditions and the following disclaimer.
10 1.2.2.2 brezak * 2. Redistributions in binary form must reproduce the above copyright
11 1.2.2.2 brezak * notice, this list of conditions and the following disclaimer in the
12 1.2.2.2 brezak * documentation and/or other materials provided with the distribution.
13 1.2.2.2 brezak * 3. All advertising materials mentioning features or use of this software
14 1.2.2.2 brezak * must display the following acknowledgement:
15 1.2.2.2 brezak * This product includes software developed by the University of
16 1.2.2.2 brezak * California, Berkeley and its contributors.
17 1.2.2.2 brezak * 4. Neither the name of the University nor the names of its contributors
18 1.2.2.2 brezak * may be used to endorse or promote products derived from this software
19 1.2.2.2 brezak * without specific prior written permission.
20 1.2.2.2 brezak *
21 1.2.2.2 brezak * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 1.2.2.2 brezak * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 1.2.2.2 brezak * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 1.2.2.2 brezak * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 1.2.2.2 brezak * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 1.2.2.2 brezak * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 1.2.2.2 brezak * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 1.2.2.2 brezak * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 1.2.2.2 brezak * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 1.2.2.2 brezak * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 1.2.2.2 brezak * SUCH DAMAGE.
32 1.2.2.2 brezak *
33 1.2.2.2 brezak * from: @(#)disklabel.c 8.1 (Berkeley) 6/11/93
34 1.2.2.2 brezak * $Id: disklabel.c,v 1.2.2.2 1994/08/22 21:56:03 brezak Exp $
35 1.2.2.2 brezak */
36 1.2.2.2 brezak
37 1.2.2.2 brezak #include <sys/param.h>
38 1.2.2.2 brezak #include <sys/disklabel.h>
39 1.2.2.2 brezak
40 1.2.2.2 brezak int dkcksum __P((struct disklabel *));
41 1.2.2.2 brezak
42 1.2.2.2 brezak char *
43 1.2.2.2 brezak getdisklabel(buf, lp)
44 1.2.2.2 brezak const char *buf;
45 1.2.2.2 brezak struct disklabel *lp;
46 1.2.2.2 brezak {
47 1.2.2.2 brezak struct disklabel *dlp, *elp;
48 1.2.2.2 brezak char *msg = (char *)0;
49 1.2.2.2 brezak
50 1.2.2.2 brezak elp = (struct disklabel *)(buf + DEV_BSIZE - sizeof(*dlp));
51 1.2.2.2 brezak for (dlp = (struct disklabel *)buf; dlp <= elp;
52 1.2.2.2 brezak dlp = (struct disklabel *)((char *)dlp + sizeof(long))) {
53 1.2.2.2 brezak if (dlp->d_magic != DISKMAGIC || dlp->d_magic2 != DISKMAGIC) {
54 1.2.2.2 brezak if (msg == (char *)0)
55 1.2.2.2 brezak msg = "no disk label";
56 1.2.2.2 brezak } else if (dlp->d_npartitions > MAXPARTITIONS ||
57 1.2.2.2 brezak dkcksum(dlp) != 0)
58 1.2.2.2 brezak msg = "disk label corrupted";
59 1.2.2.2 brezak else {
60 1.2.2.2 brezak *lp = *dlp;
61 1.2.2.2 brezak msg = (char *)0;
62 1.2.2.2 brezak break;
63 1.2.2.2 brezak }
64 1.2.2.2 brezak }
65 1.2.2.2 brezak return (msg);
66 1.2.2.2 brezak }
67 1.2.2.2 brezak
68 1.2.2.2 brezak /*
69 1.2.2.2 brezak * Compute checksum for disk label.
70 1.2.2.2 brezak */
71 1.2.2.2 brezak int
72 1.2.2.2 brezak dkcksum(lp)
73 1.2.2.2 brezak register struct disklabel *lp;
74 1.2.2.2 brezak {
75 1.2.2.2 brezak register u_short *start, *end;
76 1.2.2.2 brezak register u_short sum = 0;
77 1.2.2.2 brezak
78 1.2.2.2 brezak start = (u_short *)lp;
79 1.2.2.2 brezak end = (u_short *)&lp->d_partitions[lp->d_npartitions];
80 1.2.2.2 brezak while (start < end)
81 1.2.2.2 brezak sum ^= *start++;
82 1.2.2.2 brezak return (sum);
83 1.2.2.2 brezak }
84