xref: /freebsd/sys/geom/geom_bsd_enc.c (revision 77b7cdf1999ee965ad494fddd184b18f532ac91a)
1 /*-
2  * Copyright (c) 2002 Poul-Henning Kamp
3  * Copyright (c) 2002 Networks Associates Technology, Inc.
4  * All rights reserved.
5  *
6  * This software was developed for the FreeBSD Project by Poul-Henning Kamp
7  * and NAI Labs, the Security Research Division of Network Associates, Inc.
8  * under DARPA/SPAWAR contract N66001-01-C-8035 ("CBOSS"), as part of the
9  * DARPA CHATS research program.
10  *
11  * Redistribution and use in source and binary forms, with or without
12  * modification, are permitted provided that the following conditions
13  * are met:
14  * 1. Redistributions of source code must retain the above copyright
15  *    notice, this list of conditions and the following disclaimer.
16  * 2. Redistributions in binary form must reproduce the above copyright
17  *    notice, this list of conditions and the following disclaimer in the
18  *    documentation and/or other materials provided with the distribution.
19  * 3. The names of the authors may not be used to endorse or promote
20  *    products derived from this software without specific prior written
21  *    permission.
22  *
23  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
24  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
27  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33  * SUCH DAMAGE.
34  *
35  * $FreeBSD$
36  *
37  * Functions to encode and decode struct disklabel and struct partition into
38  * a bytestream of little endianess and correct packing.
39  *
40  * NB!  This file must be usable both in kernel and userland.
41  *
42  */
43 
44 #include <sys/types.h>
45 #include <sys/endian.h>
46 #include <sys/disklabel.h>
47 #include <sys/errno.h>
48 #ifdef _KERNEL
49 #include <sys/systm.h>
50 #else
51 #include <string.h>
52 #include <stdio.h>
53 #endif
54 
55 void
56 bsd_partition_le_dec(u_char *ptr, struct partition *d)
57 {
58 	d->p_size = le32dec(ptr + 0);
59 	d->p_offset = le32dec(ptr + 4);
60 	d->p_fsize = le32dec(ptr + 8);
61 	d->p_fstype = ptr[12];
62 	d->p_frag = ptr[13];
63 	d->p_cpg = le16dec(ptr + 14);
64 }
65 
66 int
67 bsd_disklabel_le_dec(u_char *ptr, struct disklabel *d, int maxpart)
68 {
69 	int i;
70 	u_char *p, *pe;
71 	uint16_t sum;
72 
73 	d->d_magic = le32dec(ptr + 0);
74 	if (d->d_magic != DISKMAGIC)
75 		return(EINVAL);
76 
77 	d->d_magic2 = le32dec(ptr + 132);
78 	if (d->d_magic2 != DISKMAGIC) {
79 printf("HERE %s %d\n", __FILE__, __LINE__);
80 		return(EINVAL);
81 	}
82 
83 	d->d_npartitions = le16dec(ptr + 138);
84 	if (d->d_npartitions > maxpart) {
85 printf("HERE %s %d\n", __FILE__, __LINE__);
86 		return(EINVAL);
87 	}
88 
89 	pe = ptr + 148 + 16 * d->d_npartitions;
90 	sum = 0;
91 	for (p = ptr; p < pe; p += 2)
92 		sum ^= le16dec(p);
93 	if (sum != 0) {
94 printf("HERE %s %d\n", __FILE__, __LINE__);
95 		return(EINVAL);
96 	}
97 
98 	d->d_type = le16dec(ptr + 4);
99 	d->d_subtype = le16dec(ptr + 6);
100 	bcopy(ptr + 8, d->d_typename, 16);
101 	bcopy(ptr + 24, d->d_packname, 16);
102 	d->d_secsize = le32dec(ptr + 40);
103 	d->d_nsectors = le32dec(ptr + 44);
104 	d->d_ntracks = le32dec(ptr + 48);
105 	d->d_ncylinders = le32dec(ptr + 52);
106 	d->d_secpercyl = le32dec(ptr + 56);
107 	d->d_secperunit = le32dec(ptr + 60);
108 	d->d_sparespertrack = le16dec(ptr + 64);
109 	d->d_sparespercyl = le16dec(ptr + 66);
110 	d->d_acylinders = le32dec(ptr + 68);
111 	d->d_rpm = le16dec(ptr + 72);
112 	d->d_interleave = le16dec(ptr + 74);
113 	d->d_trackskew = le16dec(ptr + 76);
114 	d->d_cylskew = le16dec(ptr + 78);
115 	d->d_headswitch = le32dec(ptr + 80);
116 	d->d_trkseek = le32dec(ptr + 84);
117 	d->d_flags = le32dec(ptr + 88);
118 	d->d_drivedata[0] = le32dec(ptr + 92);
119 	d->d_drivedata[1] = le32dec(ptr + 96);
120 	d->d_drivedata[2] = le32dec(ptr + 100);
121 	d->d_drivedata[3] = le32dec(ptr + 104);
122 	d->d_drivedata[4] = le32dec(ptr + 108);
123 	d->d_spare[0] = le32dec(ptr + 112);
124 	d->d_spare[1] = le32dec(ptr + 116);
125 	d->d_spare[2] = le32dec(ptr + 120);
126 	d->d_spare[3] = le32dec(ptr + 124);
127 	d->d_spare[4] = le32dec(ptr + 128);
128 	d->d_checksum = le16dec(ptr + 136);
129 	d->d_npartitions = le16dec(ptr + 138);
130 	d->d_bbsize = le32dec(ptr + 140);
131 	d->d_sbsize = le32dec(ptr + 144);
132 	for (i = 0; i < MAXPARTITIONS; i++)
133 		bsd_partition_le_dec(ptr + 148 + 16 * i, &d->d_partitions[i]);
134 	return(0);
135 }
136 
137 void
138 bsd_partition_le_enc(u_char *ptr, struct partition *d)
139 {
140 	le32enc(ptr + 0, d->p_size);
141 	le32enc(ptr + 4, d->p_offset);
142 	le32enc(ptr + 8, d->p_fsize);
143 	ptr[12] = d->p_fstype;
144 	ptr[13] = d->p_frag;
145 	le16enc(ptr + 14, d->p_cpg);
146 }
147 
148 void
149 bsd_disklabel_le_enc(u_char *ptr, struct disklabel *d)
150 {
151 	int i;
152 	u_char *p, *pe;
153 	uint16_t sum;
154 
155 	le32enc(ptr + 0, d->d_magic);
156 	le16enc(ptr + 4, d->d_type);
157 	le16enc(ptr + 6, d->d_subtype);
158 	bcopy(d->d_typename, ptr + 8, 16);
159 	bcopy(d->d_packname, ptr + 24, 16);
160 	le32enc(ptr + 40, d->d_secsize);
161 	le32enc(ptr + 44, d->d_nsectors);
162 	le32enc(ptr + 48, d->d_ntracks);
163 	le32enc(ptr + 52, d->d_ncylinders);
164 	le32enc(ptr + 56, d->d_secpercyl);
165 	le32enc(ptr + 60, d->d_secperunit);
166 	le16enc(ptr + 64, d->d_sparespertrack);
167 	le16enc(ptr + 66, d->d_sparespercyl);
168 	le32enc(ptr + 68, d->d_acylinders);
169 	le16enc(ptr + 72, d->d_rpm);
170 	le16enc(ptr + 74, d->d_interleave);
171 	le16enc(ptr + 76, d->d_trackskew);
172 	le16enc(ptr + 78, d->d_cylskew);
173 	le32enc(ptr + 80, d->d_headswitch);
174 	le32enc(ptr + 84, d->d_trkseek);
175 	le32enc(ptr + 88, d->d_flags);
176 	le32enc(ptr + 92, d->d_drivedata[0]);
177 	le32enc(ptr + 96, d->d_drivedata[1]);
178 	le32enc(ptr + 100, d->d_drivedata[2]);
179 	le32enc(ptr + 104, d->d_drivedata[3]);
180 	le32enc(ptr + 108, d->d_drivedata[4]);
181 	le32enc(ptr + 112, d->d_spare[0]);
182 	le32enc(ptr + 116, d->d_spare[1]);
183 	le32enc(ptr + 120, d->d_spare[2]);
184 	le32enc(ptr + 124, d->d_spare[3]);
185 	le32enc(ptr + 128, d->d_spare[4]);
186 	le32enc(ptr + 132, d->d_magic2);
187 	le16enc(ptr + 136, 0);
188 	le16enc(ptr + 138, d->d_npartitions);
189 	le32enc(ptr + 140, d->d_bbsize);
190 	le32enc(ptr + 144, d->d_sbsize);
191 	for (i = 0; i < d->d_npartitions; i++)
192 		bsd_partition_le_enc(ptr + 148 + 16 * i, &d->d_partitions[i]);
193 	pe = ptr + 148 + 16 * d->d_npartitions;
194 	sum = 0;
195 	for (p = ptr; p < pe; p += 2)
196 		sum ^= le16dec(p);
197 	le16enc(ptr + 136, sum);
198 }
199