write.c revision 1.1 1 1.1 leo /* $NetBSD: write.c,v 1.1 2000/08/07 09:23:40 leo Exp $ */
2 1.1 leo
3 1.1 leo /*
4 1.1 leo * Copyright (c) 1999 The NetBSD Foundation, Inc.
5 1.1 leo * All rights reserved.
6 1.1 leo *
7 1.1 leo * This code is derived from software contributed to The NetBSD Foundation
8 1.1 leo * by Julian Coleman, Waldi Ravens and Leo Weppelman.
9 1.1 leo *
10 1.1 leo * Redistribution and use in source and binary forms, with or without
11 1.1 leo * modification, are permitted provided that the following conditions
12 1.1 leo * are met:
13 1.1 leo * 1. Redistributions of source code must retain the above copyright
14 1.1 leo * notice, this list of conditions and the following disclaimer.
15 1.1 leo * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 leo * notice, this list of conditions and the following disclaimer in the
17 1.1 leo * documentation and/or other materials provided with the distribution.
18 1.1 leo * 3. All advertising materials mentioning features or use of this software
19 1.1 leo * must display the following acknowledgement:
20 1.1 leo * This product includes software developed by the NetBSD
21 1.1 leo * Foundation, Inc. and its contributors.
22 1.1 leo * 4. Neither the name of The NetBSD Foundation nor the names of its
23 1.1 leo * contributors may be used to endorse or promote products derived
24 1.1 leo * from this software without specific prior written permission.
25 1.1 leo *
26 1.1 leo * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
27 1.1 leo * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
28 1.1 leo * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29 1.1 leo * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
30 1.1 leo * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
31 1.1 leo * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
32 1.1 leo * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
33 1.1 leo * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
34 1.1 leo * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
35 1.1 leo * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
36 1.1 leo * POSSIBILITY OF SUCH DAMAGE.
37 1.1 leo */
38 1.1 leo
39 1.1 leo #include "privahdi.h"
40 1.1 leo #include <fcntl.h>
41 1.1 leo #include <stdlib.h>
42 1.1 leo #include <strings.h>
43 1.1 leo #include <unistd.h>
44 1.1 leo #include <sys/dkio.h>
45 1.1 leo #include <sys/ioctl.h>
46 1.1 leo
47 1.1 leo #define BSL_MAGIC 0xa5
48 1.1 leo #define BSL_OFFSET 1
49 1.1 leo #define BSL_SIZE 1
50 1.1 leo
51 1.1 leo /*
52 1.1 leo * Write AHDI partitions to disk
53 1.1 leo */
54 1.1 leo
55 1.1 leo int
56 1.1 leo ahdi_writelabel (ptable, diskname, flags)
57 1.1 leo struct ahdi_ptable *ptable;
58 1.1 leo char *diskname;
59 1.1 leo int flags;
60 1.1 leo {
61 1.1 leo int fd, i, j, k, firstxgm, keep;
62 1.1 leo struct ahdi_root *root;
63 1.1 leo u_int rsec;
64 1.1 leo u_int32_t xgmsec, nbdsec;
65 1.1 leo
66 1.1 leo if (!(fd = openraw (diskname, O_RDWR)))
67 1.1 leo return (-1);
68 1.1 leo
69 1.1 leo if ((i = ahdi_checklabel (ptable)) < 0) {
70 1.1 leo close (fd);
71 1.1 leo return (i);
72 1.1 leo }
73 1.1 leo
74 1.1 leo if (flags & AHDI_KEEP_BOOT) {
75 1.1 leo if ((root = disk_read (fd, AHDI_BBLOCK, 1)) == NULL) {
76 1.1 leo return (-1);
77 1.1 leo }
78 1.1 leo bzero ((void *) root->ar_parts,
79 1.1 leo sizeof (struct ahdi_part) * AHDI_MAXRPD);
80 1.1 leo } else {
81 1.1 leo if ((root = malloc (sizeof (struct ahdi_root))) == NULL) {
82 1.1 leo close (fd);
83 1.1 leo return (-1);
84 1.1 leo }
85 1.1 leo bzero ((void *) root, sizeof (struct ahdi_root));
86 1.1 leo }
87 1.1 leo
88 1.1 leo nbdsec = 0;
89 1.1 leo #ifdef DEBUG
90 1.1 leo printf ("Writing root sector\n");
91 1.1 leo #endif
92 1.1 leo
93 1.1 leo /* All partitions in root sector (including first XGM) */
94 1.1 leo j = 0;
95 1.1 leo firstxgm = 0;
96 1.1 leo for (i = 0; i < ptable->nparts; i++) {
97 1.1 leo if (ptable->parts[i].root == 0) {
98 1.1 leo #ifdef DEBUG
99 1.1 leo printf (" Partition %d - ", j);
100 1.1 leo #endif
101 1.1 leo root->ar_parts[j].ap_flg = 0x01;
102 1.1 leo for (k = 0; k < 3; k++) {
103 1.1 leo root->ar_parts[j].ap_id[k] =
104 1.1 leo ptable->parts[i].id[k];
105 1.1 leo #ifdef DEBUG
106 1.1 leo printf ("%c", root->ar_parts[j].ap_id[k]);
107 1.1 leo #endif
108 1.1 leo }
109 1.1 leo root->ar_parts[j].ap_st = ptable->parts[i].start;
110 1.1 leo root->ar_parts[j].ap_size = ptable->parts[i].size;
111 1.1 leo #ifdef DEBUG
112 1.1 leo printf ("/%u/%u\n", root->ar_parts[j].ap_st,
113 1.1 leo root->ar_parts[j].ap_size);
114 1.1 leo #endif
115 1.1 leo
116 1.1 leo j++;
117 1.1 leo } else if (!firstxgm) {
118 1.1 leo root->ar_parts[j].ap_flg = 0x01;
119 1.1 leo root->ar_parts[j].ap_id[0] = 'X';
120 1.1 leo root->ar_parts[j].ap_id[1] = 'G';
121 1.1 leo root->ar_parts[j].ap_id[2] = 'M';
122 1.1 leo root->ar_parts[j].ap_st = ptable->parts[i].root;
123 1.1 leo root->ar_parts[j].ap_size = ptable->parts[i].size + 1;
124 1.1 leo firstxgm = i;
125 1.1 leo xgmsec = ptable->parts[i].root;
126 1.1 leo #ifdef DEBUG
127 1.1 leo printf (" Partition %d - XGM/%u/%u\n", j,
128 1.1 leo root->ar_parts[j].ap_st,
129 1.1 leo root->ar_parts[j].ap_size);
130 1.1 leo #endif
131 1.1 leo j++;
132 1.1 leo }
133 1.1 leo /*
134 1.1 leo * Note first netbsd partition for invalidate_netbsd_label().
135 1.1 leo */
136 1.1 leo if (!nbdsec && AHDI_MKPID (ptable->parts[i].id[0],
137 1.1 leo ptable->parts[i].id[1], ptable->parts[i].id[2])
138 1.1 leo == AHDI_PID_NBD) {
139 1.1 leo nbdsec = ptable->parts[i].start;
140 1.1 leo }
141 1.1 leo }
142 1.1 leo
143 1.1 leo root->ar_hdsize = ptable->secperunit;
144 1.1 leo if (!(flags & AHDI_KEEP_BSL)) {
145 1.1 leo root->ar_bslst = (u_int32_t) BSL_OFFSET;
146 1.1 leo root->ar_bslsize = (u_int32_t) BSL_SIZE;
147 1.1 leo }
148 1.1 leo root->ar_checksum = ahdi_cksum (root);
149 1.1 leo
150 1.1 leo if (!disk_write (fd, AHDI_BBLOCK, 1, root)) {
151 1.1 leo free (root);
152 1.1 leo close (fd);
153 1.1 leo return (-1);
154 1.1 leo }
155 1.1 leo
156 1.1 leo /* Auxiliary roots */
157 1.1 leo for (i = firstxgm; i < ptable->nparts; i++) {
158 1.1 leo j = 0;
159 1.1 leo if (ptable->parts[i].root == 0)
160 1.1 leo continue;
161 1.1 leo #ifdef DEBUG
162 1.1 leo printf ("Writing auxiliary root at sector %u\n",
163 1.1 leo ptable->parts[i].root);
164 1.1 leo #endif
165 1.1 leo bzero ((void *) root, sizeof (struct ahdi_root));
166 1.1 leo rsec = ptable->parts[i].root;
167 1.1 leo #ifdef DEBUG
168 1.1 leo printf (" Partition %d - ", j);
169 1.1 leo #endif
170 1.1 leo root->ar_parts[j].ap_flg = 0x01;
171 1.1 leo for (k = 0; k < 3; k++) {
172 1.1 leo root->ar_parts[j].ap_id[k] =
173 1.1 leo ptable->parts[i].id[k];
174 1.1 leo #ifdef DEBUG
175 1.1 leo printf ("%c", root->ar_parts[j].ap_id[k]);
176 1.1 leo #endif
177 1.1 leo }
178 1.1 leo root->ar_parts[j].ap_st = ptable->parts[i].start -
179 1.1 leo rsec;
180 1.1 leo root->ar_parts[j].ap_size = ptable->parts[i].size;
181 1.1 leo #ifdef DEBUG
182 1.1 leo printf ("/%u/%u\n", root->ar_parts[j].ap_st,
183 1.1 leo root->ar_parts[j].ap_size);
184 1.1 leo #endif
185 1.1 leo j++;
186 1.1 leo if (i < ptable->nparts - 1) {
187 1.1 leo /* Need an XGM? */
188 1.1 leo if (ptable->parts[i].root != ptable->parts[i+1].root &&
189 1.1 leo ptable->parts[i+1].root != 0) {
190 1.1 leo root->ar_parts[j].ap_flg = 0x01;
191 1.1 leo root->ar_parts[j].ap_id[0] = 'X';
192 1.1 leo root->ar_parts[j].ap_id[1] = 'G';
193 1.1 leo root->ar_parts[j].ap_id[2] = 'M';
194 1.1 leo root->ar_parts[j].ap_st =
195 1.1 leo ptable->parts[i+1].root - xgmsec;
196 1.1 leo root->ar_parts[j].ap_size =
197 1.1 leo ptable->parts[i+1].size + 1;
198 1.1 leo #ifdef DEBUG
199 1.1 leo printf (" Partition %d - XGM/%u/%u\n", j,
200 1.1 leo root->ar_parts[j].ap_st,
201 1.1 leo root->ar_parts[j].ap_size);
202 1.1 leo #endif
203 1.1 leo root->ar_parts[j].ap_size = 0;
204 1.1 leo }
205 1.1 leo if (ptable->parts[i].root == ptable->parts[i+1].root) {
206 1.1 leo /* Next partition has same auxiliary root */
207 1.1 leo #ifdef DEBUG
208 1.1 leo printf (" Partition %d - ", j);
209 1.1 leo #endif
210 1.1 leo root->ar_parts[j].ap_flg = 0x01;
211 1.1 leo for (k = 0; k < 3; k++) {
212 1.1 leo root->ar_parts[j].ap_id[k] =
213 1.1 leo ptable->parts[i+1].id[k];
214 1.1 leo #ifdef DEBUG
215 1.1 leo printf ("%c", root->ar_parts[j].ap_id[k]);
216 1.1 leo #endif
217 1.1 leo }
218 1.1 leo root->ar_parts[j].ap_st =
219 1.1 leo ptable->parts[i+1].start - rsec;
220 1.1 leo root->ar_parts[j].ap_size =
221 1.1 leo ptable->parts[i+1].size;
222 1.1 leo #ifdef DEBUG
223 1.1 leo printf ("/%u/%u\n", root->ar_parts[j].ap_st,
224 1.1 leo root->ar_parts[j].ap_size);
225 1.1 leo #endif
226 1.1 leo i++;
227 1.1 leo }
228 1.1 leo j++;
229 1.1 leo }
230 1.1 leo
231 1.1 leo if (!disk_write (fd, rsec, 1, root)) {
232 1.1 leo close (fd);
233 1.1 leo free (root);
234 1.1 leo return (-1);
235 1.1 leo }
236 1.1 leo
237 1.1 leo /*
238 1.1 leo * Note first netbsd partition for invalidate_netbsd_label().
239 1.1 leo */
240 1.1 leo if (!nbdsec && AHDI_MKPID (ptable->parts[i].id[0],
241 1.1 leo ptable->parts[i].id[1], ptable->parts[i].id[2])
242 1.1 leo == AHDI_PID_NBD) {
243 1.1 leo nbdsec = ptable->parts[i].start;
244 1.1 leo }
245 1.1 leo }
246 1.1 leo
247 1.1 leo free (root);
248 1.1 leo
249 1.1 leo if (!(flags & AHDI_KEEP_BSL) && !write_bsl (fd)) {
250 1.1 leo close (fd);
251 1.1 leo return (-1);
252 1.1 leo }
253 1.1 leo
254 1.1 leo if (!(flags & AHDI_KEEP_NBDA) && !invalidate_netbsd_label(fd, nbdsec)) {
255 1.1 leo close (fd);
256 1.1 leo return (-1);
257 1.1 leo }
258 1.1 leo
259 1.1 leo #ifdef DEBUG
260 1.1 leo printf ("Forcing disk label re-read\n");
261 1.1 leo #endif
262 1.1 leo keep = 0;
263 1.1 leo if (ioctl (fd, DIOCKLABEL, &keep) < 0) {
264 1.1 leo close (fd);
265 1.1 leo return (-1);
266 1.1 leo }
267 1.1 leo
268 1.1 leo close (fd);
269 1.1 leo return (1);
270 1.1 leo }
271 1.1 leo
272 1.1 leo /*
273 1.1 leo * Write a bad sector list (empty).
274 1.1 leo */
275 1.1 leo int
276 1.1 leo write_bsl (fd)
277 1.1 leo int fd;
278 1.1 leo {
279 1.1 leo u_int8_t *bsl;
280 1.1 leo
281 1.1 leo if ((bsl = malloc (sizeof (u_int8_t) * BSL_SIZE * DEV_BSIZE)) == NULL)
282 1.1 leo return (0);
283 1.1 leo bzero ((void *) bsl, sizeof (u_int8_t) * DEV_BSIZE);
284 1.1 leo
285 1.1 leo #ifdef DEBUG
286 1.1 leo printf ("Writing bad sector list\n");
287 1.1 leo #endif
288 1.1 leo bsl[3] = BSL_MAGIC;
289 1.1 leo if (!disk_write (fd, (u_int) BSL_OFFSET, (u_int) BSL_SIZE, bsl)) {
290 1.1 leo free (bsl);
291 1.1 leo return (0);
292 1.1 leo }
293 1.1 leo free (bsl);
294 1.1 leo return (1);
295 1.1 leo }
296 1.1 leo
297 1.1 leo /*
298 1.1 leo * Invalidate any previous AHDI/NBDA disklabel.
299 1.1 leo * Otherwise this make take precedence when we next open the disk.
300 1.1 leo */
301 1.1 leo int
302 1.1 leo invalidate_netbsd_label (fd, nbdsec)
303 1.1 leo int fd;
304 1.1 leo u_int32_t nbdsec;
305 1.1 leo {
306 1.1 leo struct bootblock *bb;
307 1.1 leo u_int nsec;
308 1.1 leo
309 1.1 leo nsec = (BBMINSIZE + (DEV_BSIZE - 1)) / DEV_BSIZE;
310 1.1 leo
311 1.1 leo if ((bb = disk_read (fd, nbdsec, nsec)) == NULL) {
312 1.1 leo return (0);
313 1.1 leo }
314 1.1 leo
315 1.1 leo if (bb->bb_magic == NBDAMAGIC || bb->bb_magic == AHDIMAGIC) {
316 1.1 leo bb->bb_magic = bb->bb_magic & 0xffffff00;
317 1.1 leo bb->bb_magic = bb->bb_magic | 0x5f;
318 1.1 leo
319 1.1 leo #ifdef DEBUG
320 1.1 leo printf ("Invalidating old NBDA/AHDI label (sector %u)\n",
321 1.1 leo nbdsec);
322 1.1 leo #endif
323 1.1 leo if (!disk_write (fd, nbdsec, nsec, bb)) {
324 1.1 leo free (bb);
325 1.1 leo return (0);
326 1.1 leo }
327 1.1 leo }
328 1.1 leo
329 1.1 leo free (bb);
330 1.1 leo return (1);
331 1.1 leo }
332 1.1 leo
333 1.1 leo int
334 1.1 leo disk_write (fd, start, count, buf)
335 1.1 leo int fd;
336 1.1 leo u_int start,
337 1.1 leo count;
338 1.1 leo void *buf;
339 1.1 leo {
340 1.1 leo off_t offset;
341 1.1 leo size_t size;
342 1.1 leo
343 1.1 leo size = count * DEV_BSIZE;
344 1.1 leo offset = start * DEV_BSIZE;
345 1.1 leo
346 1.1 leo if (lseek (fd, offset, SEEK_SET) != offset)
347 1.1 leo return (0);
348 1.1 leo if (write (fd, buf, size) != size)
349 1.1 leo return (0);
350 1.1 leo return (1);
351 1.1 leo }
352