utilities.c revision 1.45 1 1.45 dbj /* $NetBSD: utilities.c,v 1.45 2004/01/15 14:52:04 dbj Exp $ */
2 1.15 cgd
3 1.1 cgd /*
4 1.9 mycroft * Copyright (c) 1980, 1986, 1993
5 1.9 mycroft * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.41 agc * 3. Neither the name of the University nor the names of its contributors
16 1.1 cgd * may be used to endorse or promote products derived from this software
17 1.1 cgd * without specific prior written permission.
18 1.1 cgd *
19 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.1 cgd * SUCH DAMAGE.
30 1.1 cgd */
31 1.1 cgd
32 1.19 lukem #include <sys/cdefs.h>
33 1.1 cgd #ifndef lint
34 1.13 cgd #if 0
35 1.20 lukem static char sccsid[] = "@(#)utilities.c 8.6 (Berkeley) 5/19/95";
36 1.13 cgd #else
37 1.45 dbj __RCSID("$NetBSD: utilities.c,v 1.45 2004/01/15 14:52:04 dbj Exp $");
38 1.13 cgd #endif
39 1.1 cgd #endif /* not lint */
40 1.1 cgd
41 1.1 cgd #include <sys/param.h>
42 1.7 cgd #include <sys/time.h>
43 1.20 lukem
44 1.9 mycroft #include <ufs/ufs/dinode.h>
45 1.9 mycroft #include <ufs/ufs/dir.h>
46 1.9 mycroft #include <ufs/ffs/fs.h>
47 1.23 bouyer #include <ufs/ffs/ffs_extern.h>
48 1.26 fvdl #include <ufs/ufs/ufs_bswap.h>
49 1.20 lukem
50 1.20 lukem #include <ctype.h>
51 1.20 lukem #include <err.h>
52 1.38 yamt #include <errno.h>
53 1.21 lukem #include <stdio.h>
54 1.21 lukem #include <stdlib.h>
55 1.1 cgd #include <string.h>
56 1.21 lukem #include <unistd.h>
57 1.11 cgd
58 1.18 christos #include "fsutil.h"
59 1.1 cgd #include "fsck.h"
60 1.11 cgd #include "extern.h"
61 1.1 cgd
62 1.1 cgd long diskreads, totalreads; /* Disk cache statistics */
63 1.1 cgd
64 1.35 fvdl static void rwerror __P((char *, daddr_t));
65 1.17 christos
66 1.30 christos extern int returntosingle;
67 1.30 christos
68 1.11 cgd int
69 1.1 cgd ftypeok(dp)
70 1.36 fvdl union dinode *dp;
71 1.1 cgd {
72 1.36 fvdl switch (iswap16(DIP(dp, mode)) & IFMT) {
73 1.1 cgd
74 1.1 cgd case IFDIR:
75 1.1 cgd case IFREG:
76 1.1 cgd case IFBLK:
77 1.1 cgd case IFCHR:
78 1.1 cgd case IFLNK:
79 1.1 cgd case IFSOCK:
80 1.1 cgd case IFIFO:
81 1.1 cgd return (1);
82 1.1 cgd
83 1.1 cgd default:
84 1.1 cgd if (debug)
85 1.36 fvdl printf("bad file type 0%o\n", iswap16(DIP(dp, mode)));
86 1.1 cgd return (0);
87 1.1 cgd }
88 1.1 cgd }
89 1.1 cgd
90 1.11 cgd int
91 1.1 cgd reply(question)
92 1.1 cgd char *question;
93 1.1 cgd {
94 1.1 cgd int persevere;
95 1.1 cgd char c;
96 1.1 cgd
97 1.1 cgd if (preen)
98 1.1 cgd pfatal("INTERNAL ERROR: GOT TO reply()");
99 1.1 cgd persevere = !strcmp(question, "CONTINUE");
100 1.1 cgd printf("\n");
101 1.1 cgd if (!persevere && (nflag || fswritefd < 0)) {
102 1.1 cgd printf("%s? no\n\n", question);
103 1.26 fvdl resolved = 0;
104 1.1 cgd return (0);
105 1.1 cgd }
106 1.1 cgd if (yflag || (persevere && nflag)) {
107 1.1 cgd printf("%s? yes\n\n", question);
108 1.1 cgd return (1);
109 1.1 cgd }
110 1.1 cgd do {
111 1.1 cgd printf("%s? [yn] ", question);
112 1.1 cgd (void) fflush(stdout);
113 1.1 cgd c = getc(stdin);
114 1.26 fvdl while (c != '\n' && getc(stdin) != '\n') {
115 1.26 fvdl if (feof(stdin)) {
116 1.26 fvdl resolved = 0;
117 1.1 cgd return (0);
118 1.26 fvdl }
119 1.26 fvdl }
120 1.1 cgd } while (c != 'y' && c != 'Y' && c != 'n' && c != 'N');
121 1.1 cgd printf("\n");
122 1.1 cgd if (c == 'y' || c == 'Y')
123 1.1 cgd return (1);
124 1.26 fvdl resolved = 0;
125 1.1 cgd return (0);
126 1.1 cgd }
127 1.1 cgd
128 1.1 cgd /*
129 1.1 cgd * Malloc buffers and set up cache.
130 1.1 cgd */
131 1.11 cgd void
132 1.1 cgd bufinit()
133 1.1 cgd {
134 1.19 lukem struct bufarea *bp;
135 1.1 cgd long bufcnt, i;
136 1.1 cgd char *bufp;
137 1.1 cgd
138 1.1 cgd pbp = pdirbp = (struct bufarea *)0;
139 1.23 bouyer bufp = malloc((unsigned int)sblock->fs_bsize);
140 1.1 cgd if (bufp == 0)
141 1.20 lukem errx(EEXIT, "cannot allocate buffer pool");
142 1.1 cgd cgblk.b_un.b_buf = bufp;
143 1.1 cgd initbarea(&cgblk);
144 1.34 dbj bufp = malloc((unsigned int)APPLEUFS_LABEL_SIZE);
145 1.34 dbj if (bufp == 0)
146 1.34 dbj errx(EEXIT, "cannot allocate buffer pool");
147 1.34 dbj appleufsblk.b_un.b_buf = bufp;
148 1.34 dbj initbarea(&appleufsblk);
149 1.1 cgd bufhead.b_next = bufhead.b_prev = &bufhead;
150 1.23 bouyer bufcnt = MAXBUFSPACE / sblock->fs_bsize;
151 1.1 cgd if (bufcnt < MINBUFS)
152 1.1 cgd bufcnt = MINBUFS;
153 1.1 cgd for (i = 0; i < bufcnt; i++) {
154 1.1 cgd bp = (struct bufarea *)malloc(sizeof(struct bufarea));
155 1.23 bouyer bufp = malloc((unsigned int)sblock->fs_bsize);
156 1.1 cgd if (bp == NULL || bufp == NULL) {
157 1.1 cgd if (i >= MINBUFS)
158 1.1 cgd break;
159 1.20 lukem errx(EEXIT, "cannot allocate buffer pool");
160 1.1 cgd }
161 1.1 cgd bp->b_un.b_buf = bufp;
162 1.1 cgd bp->b_prev = &bufhead;
163 1.1 cgd bp->b_next = bufhead.b_next;
164 1.1 cgd bufhead.b_next->b_prev = bp;
165 1.1 cgd bufhead.b_next = bp;
166 1.1 cgd initbarea(bp);
167 1.1 cgd }
168 1.1 cgd bufhead.b_size = i; /* save number of buffers */
169 1.1 cgd }
170 1.1 cgd
171 1.1 cgd /*
172 1.1 cgd * Manage a cache of directory blocks.
173 1.1 cgd */
174 1.1 cgd struct bufarea *
175 1.1 cgd getdatablk(blkno, size)
176 1.35 fvdl daddr_t blkno;
177 1.1 cgd long size;
178 1.1 cgd {
179 1.19 lukem struct bufarea *bp;
180 1.1 cgd
181 1.1 cgd for (bp = bufhead.b_next; bp != &bufhead; bp = bp->b_next)
182 1.23 bouyer if (bp->b_bno == fsbtodb(sblock, blkno))
183 1.1 cgd goto foundit;
184 1.1 cgd for (bp = bufhead.b_prev; bp != &bufhead; bp = bp->b_prev)
185 1.1 cgd if ((bp->b_flags & B_INUSE) == 0)
186 1.1 cgd break;
187 1.1 cgd if (bp == &bufhead)
188 1.20 lukem errx(EEXIT, "deadlocked buffer pool");
189 1.1 cgd /* fall through */
190 1.1 cgd foundit:
191 1.42 dbj getblk(bp, blkno, size);
192 1.1 cgd bp->b_prev->b_next = bp->b_next;
193 1.1 cgd bp->b_next->b_prev = bp->b_prev;
194 1.1 cgd bp->b_prev = &bufhead;
195 1.1 cgd bp->b_next = bufhead.b_next;
196 1.1 cgd bufhead.b_next->b_prev = bp;
197 1.1 cgd bufhead.b_next = bp;
198 1.1 cgd bp->b_flags |= B_INUSE;
199 1.1 cgd return (bp);
200 1.1 cgd }
201 1.1 cgd
202 1.1 cgd void
203 1.1 cgd getblk(bp, blk, size)
204 1.19 lukem struct bufarea *bp;
205 1.35 fvdl daddr_t blk;
206 1.1 cgd long size;
207 1.1 cgd {
208 1.35 fvdl daddr_t dblk;
209 1.1 cgd
210 1.23 bouyer dblk = fsbtodb(sblock, blk);
211 1.42 dbj totalreads++;
212 1.1 cgd if (bp->b_bno != dblk) {
213 1.1 cgd flush(fswritefd, bp);
214 1.1 cgd diskreads++;
215 1.1 cgd bp->b_errs = bread(fsreadfd, bp->b_un.b_buf, dblk, size);
216 1.1 cgd bp->b_bno = dblk;
217 1.1 cgd bp->b_size = size;
218 1.1 cgd }
219 1.1 cgd }
220 1.1 cgd
221 1.11 cgd void
222 1.1 cgd flush(fd, bp)
223 1.1 cgd int fd;
224 1.19 lukem struct bufarea *bp;
225 1.1 cgd {
226 1.19 lukem int i, j;
227 1.32 lukem struct csum *ccsp;
228 1.1 cgd
229 1.1 cgd if (!bp->b_dirty)
230 1.1 cgd return;
231 1.1 cgd if (bp->b_errs != 0)
232 1.35 fvdl pfatal("WRITING %sZERO'ED BLOCK %lld TO DISK\n",
233 1.1 cgd (bp->b_errs == bp->b_size / dev_bsize) ? "" : "PARTIALLY ",
234 1.35 fvdl (long long)bp->b_bno);
235 1.1 cgd bp->b_dirty = 0;
236 1.1 cgd bp->b_errs = 0;
237 1.1 cgd bwrite(fd, bp->b_un.b_buf, bp->b_bno, (long)bp->b_size);
238 1.1 cgd if (bp != &sblk)
239 1.1 cgd return;
240 1.23 bouyer for (i = 0, j = 0; i < sblock->fs_cssize; i += sblock->fs_bsize, j++) {
241 1.23 bouyer int size = sblock->fs_cssize - i < sblock->fs_bsize ?
242 1.23 bouyer sblock->fs_cssize - i : sblock->fs_bsize;
243 1.32 lukem ccsp = (struct csum *)((char *)sblock->fs_csp + i);
244 1.32 lukem if (needswap)
245 1.32 lukem ffs_csum_swap(ccsp, ccsp, size);
246 1.32 lukem bwrite(fswritefd, (char *)ccsp,
247 1.23 bouyer fsbtodb(sblock, sblock->fs_csaddr + j * sblock->fs_frag),
248 1.29 mycroft size);
249 1.32 lukem if (needswap)
250 1.32 lukem ffs_csum_swap(ccsp, ccsp, size);
251 1.1 cgd }
252 1.1 cgd }
253 1.1 cgd
254 1.17 christos static void
255 1.1 cgd rwerror(mesg, blk)
256 1.1 cgd char *mesg;
257 1.35 fvdl daddr_t blk;
258 1.1 cgd {
259 1.1 cgd
260 1.1 cgd if (preen == 0)
261 1.1 cgd printf("\n");
262 1.35 fvdl pfatal("CANNOT %s: BLK %lld", mesg, (long long)blk);
263 1.1 cgd if (reply("CONTINUE") == 0)
264 1.20 lukem exit(EEXIT);
265 1.1 cgd }
266 1.1 cgd
267 1.11 cgd void
268 1.23 bouyer ckfini()
269 1.1 cgd {
270 1.19 lukem struct bufarea *bp, *nbp;
271 1.20 lukem int ofsmodified, cnt = 0;
272 1.1 cgd
273 1.9 mycroft if (fswritefd < 0) {
274 1.9 mycroft (void)close(fsreadfd);
275 1.9 mycroft return;
276 1.9 mycroft }
277 1.1 cgd flush(fswritefd, &sblk);
278 1.39 fvdl if (havesb && bflag != 0 &&
279 1.44 dbj (preen || reply("UPDATE STANDARD SUPERBLOCK"))) {
280 1.44 dbj if (preen)
281 1.45 dbj pwarn("UPDATING STANDARD SUPERBLOCK\n");
282 1.39 fvdl if (!is_ufs2 && (sblock->fs_old_flags & FS_FLAGS_UPDATED) == 0)
283 1.39 fvdl sblk.b_bno = SBLOCK_UFS1 / dev_bsize;
284 1.39 fvdl else
285 1.39 fvdl sblk.b_bno = sblock->fs_sblockloc / dev_bsize;
286 1.1 cgd sbdirty();
287 1.1 cgd flush(fswritefd, &sblk);
288 1.1 cgd }
289 1.34 dbj flush(fswritefd, &appleufsblk);
290 1.34 dbj free(appleufsblk.b_un.b_buf);
291 1.1 cgd flush(fswritefd, &cgblk);
292 1.1 cgd free(cgblk.b_un.b_buf);
293 1.6 deraadt for (bp = bufhead.b_prev; bp && bp != &bufhead; bp = nbp) {
294 1.1 cgd cnt++;
295 1.1 cgd flush(fswritefd, bp);
296 1.1 cgd nbp = bp->b_prev;
297 1.1 cgd free(bp->b_un.b_buf);
298 1.1 cgd free((char *)bp);
299 1.1 cgd }
300 1.1 cgd if (bufhead.b_size != cnt)
301 1.20 lukem errx(EEXIT, "Panic: lost %d buffers", bufhead.b_size - cnt);
302 1.1 cgd pbp = pdirbp = (struct bufarea *)0;
303 1.23 bouyer if (markclean && (sblock->fs_clean & FS_ISCLEAN) == 0) {
304 1.14 mycroft /*
305 1.14 mycroft * Mark the file system as clean, and sync the superblock.
306 1.14 mycroft */
307 1.14 mycroft if (preen)
308 1.14 mycroft pwarn("MARKING FILE SYSTEM CLEAN\n");
309 1.14 mycroft else if (!reply("MARK FILE SYSTEM CLEAN"))
310 1.14 mycroft markclean = 0;
311 1.14 mycroft if (markclean) {
312 1.23 bouyer sblock->fs_clean = FS_ISCLEAN;
313 1.36 fvdl sblock->fs_pendingblocks = 0;
314 1.36 fvdl sblock->fs_pendinginodes = 0;
315 1.14 mycroft sbdirty();
316 1.20 lukem ofsmodified = fsmodified;
317 1.14 mycroft flush(fswritefd, &sblk);
318 1.22 lukem #if LITE2BORKEN
319 1.20 lukem fsmodified = ofsmodified;
320 1.22 lukem #endif
321 1.20 lukem if (!preen)
322 1.20 lukem printf(
323 1.20 lukem "\n***** FILE SYSTEM MARKED CLEAN *****\n");
324 1.14 mycroft }
325 1.14 mycroft }
326 1.1 cgd if (debug)
327 1.1 cgd printf("cache missed %ld of %ld (%d%%)\n", diskreads,
328 1.1 cgd totalreads, (int)(diskreads * 100 / totalreads));
329 1.1 cgd (void)close(fsreadfd);
330 1.1 cgd (void)close(fswritefd);
331 1.1 cgd }
332 1.1 cgd
333 1.11 cgd int
334 1.1 cgd bread(fd, buf, blk, size)
335 1.1 cgd int fd;
336 1.1 cgd char *buf;
337 1.35 fvdl daddr_t blk;
338 1.1 cgd long size;
339 1.1 cgd {
340 1.1 cgd char *cp;
341 1.1 cgd int i, errs;
342 1.9 mycroft off_t offset;
343 1.1 cgd
344 1.9 mycroft offset = blk;
345 1.9 mycroft offset *= dev_bsize;
346 1.9 mycroft if (lseek(fd, offset, 0) < 0)
347 1.1 cgd rwerror("SEEK", blk);
348 1.1 cgd else if (read(fd, buf, (int)size) == size)
349 1.1 cgd return (0);
350 1.1 cgd rwerror("READ", blk);
351 1.9 mycroft if (lseek(fd, offset, 0) < 0)
352 1.1 cgd rwerror("SEEK", blk);
353 1.1 cgd errs = 0;
354 1.10 mycroft memset(buf, 0, (size_t)size);
355 1.1 cgd printf("THE FOLLOWING DISK SECTORS COULD NOT BE READ:");
356 1.1 cgd for (cp = buf, i = 0; i < size; i += secsize, cp += secsize) {
357 1.1 cgd if (read(fd, cp, (int)secsize) != secsize) {
358 1.9 mycroft (void)lseek(fd, offset + i + secsize, 0);
359 1.1 cgd if (secsize != dev_bsize && dev_bsize != 1)
360 1.35 fvdl printf(" %lld (%lld),",
361 1.35 fvdl (long long)((blk*dev_bsize + i) / secsize),
362 1.35 fvdl (long long)(blk + i / dev_bsize));
363 1.1 cgd else
364 1.35 fvdl printf(" %lld,",
365 1.35 fvdl (long long)(blk + i / dev_bsize));
366 1.1 cgd errs++;
367 1.1 cgd }
368 1.1 cgd }
369 1.1 cgd printf("\n");
370 1.1 cgd return (errs);
371 1.1 cgd }
372 1.1 cgd
373 1.11 cgd void
374 1.1 cgd bwrite(fd, buf, blk, size)
375 1.1 cgd int fd;
376 1.1 cgd char *buf;
377 1.35 fvdl daddr_t blk;
378 1.1 cgd long size;
379 1.1 cgd {
380 1.1 cgd int i;
381 1.1 cgd char *cp;
382 1.9 mycroft off_t offset;
383 1.1 cgd
384 1.1 cgd if (fd < 0)
385 1.1 cgd return;
386 1.9 mycroft offset = blk;
387 1.9 mycroft offset *= dev_bsize;
388 1.9 mycroft if (lseek(fd, offset, 0) < 0)
389 1.1 cgd rwerror("SEEK", blk);
390 1.1 cgd else if (write(fd, buf, (int)size) == size) {
391 1.1 cgd fsmodified = 1;
392 1.1 cgd return;
393 1.1 cgd }
394 1.1 cgd rwerror("WRITE", blk);
395 1.9 mycroft if (lseek(fd, offset, 0) < 0)
396 1.1 cgd rwerror("SEEK", blk);
397 1.1 cgd printf("THE FOLLOWING SECTORS COULD NOT BE WRITTEN:");
398 1.1 cgd for (cp = buf, i = 0; i < size; i += dev_bsize, cp += dev_bsize)
399 1.1 cgd if (write(fd, cp, (int)dev_bsize) != dev_bsize) {
400 1.9 mycroft (void)lseek(fd, offset + i + dev_bsize, 0);
401 1.35 fvdl printf(" %lld,", (long long)(blk + i / dev_bsize));
402 1.1 cgd }
403 1.1 cgd printf("\n");
404 1.1 cgd return;
405 1.1 cgd }
406 1.1 cgd
407 1.1 cgd /*
408 1.1 cgd * allocate a data block with the specified number of fragments
409 1.1 cgd */
410 1.35 fvdl daddr_t
411 1.1 cgd allocblk(frags)
412 1.1 cgd long frags;
413 1.1 cgd {
414 1.26 fvdl int i, j, k, cg, baseblk;
415 1.26 fvdl struct cg *cgp = cgrp;
416 1.1 cgd
417 1.23 bouyer if (frags <= 0 || frags > sblock->fs_frag)
418 1.1 cgd return (0);
419 1.23 bouyer for (i = 0; i < maxfsblock - sblock->fs_frag; i += sblock->fs_frag) {
420 1.23 bouyer for (j = 0; j <= sblock->fs_frag - frags; j++) {
421 1.1 cgd if (testbmap(i + j))
422 1.1 cgd continue;
423 1.1 cgd for (k = 1; k < frags; k++)
424 1.1 cgd if (testbmap(i + j + k))
425 1.1 cgd break;
426 1.1 cgd if (k < frags) {
427 1.1 cgd j += k;
428 1.1 cgd continue;
429 1.1 cgd }
430 1.26 fvdl cg = dtog(sblock, i + j);
431 1.26 fvdl getblk(&cgblk, cgtod(sblock, cg), sblock->fs_cgsize);
432 1.26 fvdl memcpy(cgp, cgblk.b_un.b_cg, sblock->fs_cgsize);
433 1.26 fvdl if ((doswap && !needswap) || (!doswap && needswap))
434 1.36 fvdl ffs_cg_swap(cgblk.b_un.b_cg, cgp, sblock);
435 1.26 fvdl if (!cg_chkmagic(cgp, 0))
436 1.26 fvdl pfatal("CG %d: ALLOCBLK: BAD MAGIC NUMBER\n",
437 1.26 fvdl cg);
438 1.26 fvdl baseblk = dtogd(sblock, i + j);
439 1.26 fvdl for (k = 0; k < frags; k++) {
440 1.1 cgd setbmap(i + j + k);
441 1.26 fvdl clrbit(cg_blksfree(cgp, 0), baseblk + k);
442 1.26 fvdl }
443 1.1 cgd n_blks += frags;
444 1.26 fvdl if (frags == sblock->fs_frag)
445 1.26 fvdl cgp->cg_cs.cs_nbfree--;
446 1.26 fvdl else
447 1.26 fvdl cgp->cg_cs.cs_nffree -= frags;
448 1.26 fvdl cgdirty();
449 1.1 cgd return (i + j);
450 1.1 cgd }
451 1.1 cgd }
452 1.1 cgd return (0);
453 1.1 cgd }
454 1.1 cgd
455 1.1 cgd /*
456 1.1 cgd * Free a previously allocated block
457 1.1 cgd */
458 1.11 cgd void
459 1.1 cgd freeblk(blkno, frags)
460 1.35 fvdl daddr_t blkno;
461 1.1 cgd long frags;
462 1.1 cgd {
463 1.1 cgd struct inodesc idesc;
464 1.1 cgd
465 1.1 cgd idesc.id_blkno = blkno;
466 1.1 cgd idesc.id_numfrags = frags;
467 1.1 cgd (void)pass4check(&idesc);
468 1.1 cgd }
469 1.1 cgd
470 1.1 cgd /*
471 1.1 cgd * Find a pathname
472 1.1 cgd */
473 1.11 cgd void
474 1.40 itojun getpathname(namebuf, namebuflen, curdir, ino)
475 1.1 cgd char *namebuf;
476 1.40 itojun size_t namebuflen;
477 1.1 cgd ino_t curdir, ino;
478 1.1 cgd {
479 1.1 cgd int len;
480 1.19 lukem char *cp;
481 1.1 cgd struct inodesc idesc;
482 1.1 cgd static int busy = 0;
483 1.36 fvdl struct inostat *info;
484 1.1 cgd
485 1.9 mycroft if (curdir == ino && ino == ROOTINO) {
486 1.40 itojun (void)strlcpy(namebuf, "/", namebuflen);
487 1.9 mycroft return;
488 1.9 mycroft }
489 1.36 fvdl info = inoinfo(curdir);
490 1.36 fvdl if (busy || (info->ino_state != DSTATE && info->ino_state != DFOUND)) {
491 1.40 itojun (void)strlcpy(namebuf, "?", namebuflen);
492 1.1 cgd return;
493 1.1 cgd }
494 1.1 cgd busy = 1;
495 1.10 mycroft memset(&idesc, 0, sizeof(struct inodesc));
496 1.1 cgd idesc.id_type = DATA;
497 1.1 cgd idesc.id_fix = IGNORE;
498 1.1 cgd cp = &namebuf[MAXPATHLEN - 1];
499 1.1 cgd *cp = '\0';
500 1.1 cgd if (curdir != ino) {
501 1.1 cgd idesc.id_parent = curdir;
502 1.1 cgd goto namelookup;
503 1.1 cgd }
504 1.1 cgd while (ino != ROOTINO) {
505 1.1 cgd idesc.id_number = ino;
506 1.1 cgd idesc.id_func = findino;
507 1.1 cgd idesc.id_name = "..";
508 1.1 cgd if ((ckinode(ginode(ino), &idesc) & FOUND) == 0)
509 1.1 cgd break;
510 1.1 cgd namelookup:
511 1.1 cgd idesc.id_number = idesc.id_parent;
512 1.1 cgd idesc.id_parent = ino;
513 1.1 cgd idesc.id_func = findname;
514 1.1 cgd idesc.id_name = namebuf;
515 1.1 cgd if ((ckinode(ginode(idesc.id_number), &idesc)&FOUND) == 0)
516 1.1 cgd break;
517 1.1 cgd len = strlen(namebuf);
518 1.1 cgd cp -= len;
519 1.20 lukem memmove(cp, namebuf, (size_t)len);
520 1.1 cgd *--cp = '/';
521 1.1 cgd if (cp < &namebuf[MAXNAMLEN])
522 1.1 cgd break;
523 1.1 cgd ino = idesc.id_number;
524 1.1 cgd }
525 1.1 cgd busy = 0;
526 1.1 cgd if (ino != ROOTINO)
527 1.1 cgd *--cp = '?';
528 1.20 lukem memmove(namebuf, cp, (size_t)(&namebuf[MAXPATHLEN] - cp));
529 1.1 cgd }
530 1.1 cgd
531 1.1 cgd void
532 1.20 lukem catch(sig)
533 1.20 lukem int sig;
534 1.1 cgd {
535 1.23 bouyer if (!doinglevel2) {
536 1.23 bouyer markclean = 0;
537 1.23 bouyer ckfini();
538 1.23 bouyer }
539 1.1 cgd exit(12);
540 1.1 cgd }
541 1.1 cgd
542 1.1 cgd /*
543 1.1 cgd * When preening, allow a single quit to signal
544 1.1 cgd * a special exit after filesystem checks complete
545 1.1 cgd * so that reboot sequence may be interrupted.
546 1.1 cgd */
547 1.1 cgd void
548 1.20 lukem catchquit(sig)
549 1.20 lukem int sig;
550 1.1 cgd {
551 1.38 yamt int errsave = errno;
552 1.38 yamt
553 1.31 lukem printf("returning to single-user after file system check\n");
554 1.1 cgd returntosingle = 1;
555 1.1 cgd (void)signal(SIGQUIT, SIG_DFL);
556 1.38 yamt errno = errsave;
557 1.1 cgd }
558 1.1 cgd
559 1.1 cgd /*
560 1.1 cgd * Ignore a single quit signal; wait and flush just in case.
561 1.1 cgd * Used by child processes in preen.
562 1.1 cgd */
563 1.1 cgd void
564 1.20 lukem voidquit(sig)
565 1.20 lukem int sig;
566 1.1 cgd {
567 1.38 yamt int errsave = errno;
568 1.1 cgd
569 1.1 cgd sleep(1);
570 1.1 cgd (void)signal(SIGQUIT, SIG_IGN);
571 1.1 cgd (void)signal(SIGQUIT, SIG_DFL);
572 1.38 yamt errno = errsave;
573 1.1 cgd }
574 1.1 cgd
575 1.1 cgd /*
576 1.1 cgd * determine whether an inode should be fixed.
577 1.1 cgd */
578 1.11 cgd int
579 1.1 cgd dofix(idesc, msg)
580 1.19 lukem struct inodesc *idesc;
581 1.1 cgd char *msg;
582 1.1 cgd {
583 1.1 cgd
584 1.1 cgd switch (idesc->id_fix) {
585 1.1 cgd
586 1.1 cgd case DONTKNOW:
587 1.1 cgd if (idesc->id_type == DATA)
588 1.1 cgd direrror(idesc->id_number, msg);
589 1.1 cgd else
590 1.27 is pwarn("%s", msg);
591 1.1 cgd if (preen) {
592 1.1 cgd printf(" (SALVAGED)\n");
593 1.1 cgd idesc->id_fix = FIX;
594 1.1 cgd return (ALTERED);
595 1.1 cgd }
596 1.1 cgd if (reply("SALVAGE") == 0) {
597 1.1 cgd idesc->id_fix = NOFIX;
598 1.1 cgd return (0);
599 1.1 cgd }
600 1.1 cgd idesc->id_fix = FIX;
601 1.1 cgd return (ALTERED);
602 1.1 cgd
603 1.1 cgd case FIX:
604 1.1 cgd return (ALTERED);
605 1.1 cgd
606 1.1 cgd case NOFIX:
607 1.1 cgd case IGNORE:
608 1.1 cgd return (0);
609 1.1 cgd
610 1.1 cgd default:
611 1.20 lukem errx(EEXIT, "UNKNOWN INODESC FIX MODE %d", idesc->id_fix);
612 1.1 cgd }
613 1.1 cgd /* NOTREACHED */
614 1.20 lukem return (0);
615 1.23 bouyer }
616 1.23 bouyer
617 1.25 mycroft void
618 1.25 mycroft copyback_cg(blk)
619 1.23 bouyer struct bufarea *blk;
620 1.23 bouyer {
621 1.25 mycroft
622 1.25 mycroft memcpy(blk->b_un.b_cg, cgrp, sblock->fs_cgsize);
623 1.23 bouyer if (needswap)
624 1.36 fvdl ffs_cg_swap(cgrp, blk->b_un.b_cg, sblock);
625 1.23 bouyer }
626 1.23 bouyer
627 1.23 bouyer void
628 1.36 fvdl infohandler(int sig)
629 1.23 bouyer {
630 1.36 fvdl got_siginfo = 1;
631 1.1 cgd }
632 1.33 lukem
633 1.36 fvdl /*
634 1.36 fvdl * Look up state information for an inode.
635 1.36 fvdl */
636 1.36 fvdl struct inostat *
637 1.36 fvdl inoinfo(ino_t inum)
638 1.33 lukem {
639 1.36 fvdl static struct inostat unallocated = { USTATE, 0, 0 };
640 1.36 fvdl struct inostatlist *ilp;
641 1.36 fvdl int iloff;
642 1.36 fvdl
643 1.36 fvdl if (inum > maxino)
644 1.36 fvdl errx(EEXIT, "inoinfo: inumber %d out of range", inum);
645 1.36 fvdl ilp = &inostathead[inum / sblock->fs_ipg];
646 1.36 fvdl iloff = inum % sblock->fs_ipg;
647 1.36 fvdl if (iloff >= ilp->il_numalloced)
648 1.36 fvdl return (&unallocated);
649 1.36 fvdl return (&ilp->il_stat[iloff]);
650 1.37 fvdl }
651 1.37 fvdl
652 1.37 fvdl void
653 1.43 dbj sb_oldfscompat_read(struct fs *fs, struct fs **fssave)
654 1.37 fvdl {
655 1.43 dbj if ((fs->fs_magic != FS_UFS1_MAGIC) ||
656 1.43 dbj (fs->fs_old_flags & FS_FLAGS_UPDATED))
657 1.37 fvdl return;
658 1.37 fvdl
659 1.43 dbj /* Save a copy of fields that may be modified for compatibility */
660 1.43 dbj if (fssave) {
661 1.43 dbj if (!*fssave)
662 1.43 dbj *fssave = malloc(sizeof(struct fs));
663 1.43 dbj if (!*fssave)
664 1.43 dbj errx(EEXIT, "cannot allocate space for compat store");
665 1.43 dbj memmove(*fssave, fs, sizeof(struct fs));
666 1.43 dbj
667 1.43 dbj if (debug)
668 1.43 dbj printf("detected ufs1 superblock not yet updated for ufs2 kernels\n");
669 1.43 dbj
670 1.43 dbj if (doswap) {
671 1.43 dbj uint16_t postbl[256];
672 1.43 dbj int i, n;
673 1.43 dbj
674 1.43 dbj if (fs->fs_old_postblformat == FS_42POSTBLFMT)
675 1.43 dbj n = 256;
676 1.43 dbj else
677 1.43 dbj n = 128;
678 1.43 dbj
679 1.43 dbj /* extract the postbl from the unswapped superblock */
680 1.43 dbj if (!needswap)
681 1.43 dbj ffs_sb_swap(*fssave, *fssave);
682 1.43 dbj memmove(postbl, (&(*fssave)->fs_old_postbl_start), n);
683 1.43 dbj if (!needswap)
684 1.43 dbj ffs_sb_swap(*fssave, *fssave);
685 1.43 dbj
686 1.43 dbj /* Now swap it */
687 1.43 dbj for (i=0; i < n; i++)
688 1.43 dbj postbl[i] = bswap16(postbl[i]);
689 1.43 dbj
690 1.43 dbj /* And put it back such that it will get correctly
691 1.43 dbj * unscrambled if it is swapped again on the way out
692 1.43 dbj */
693 1.43 dbj if (needswap)
694 1.43 dbj ffs_sb_swap(*fssave, *fssave);
695 1.43 dbj memmove((&(*fssave)->fs_old_postbl_start), postbl, n);
696 1.43 dbj if (needswap)
697 1.43 dbj ffs_sb_swap(*fssave, *fssave);
698 1.43 dbj }
699 1.43 dbj
700 1.43 dbj }
701 1.43 dbj
702 1.43 dbj /* These fields will be overwritten by their
703 1.43 dbj * original values in fs_oldfscompat_write, so it is harmless
704 1.43 dbj * to modify them here.
705 1.43 dbj */
706 1.43 dbj fs->fs_cstotal.cs_ndir =
707 1.43 dbj fs->fs_old_cstotal.cs_ndir;
708 1.43 dbj fs->fs_cstotal.cs_nbfree =
709 1.43 dbj fs->fs_old_cstotal.cs_nbfree;
710 1.43 dbj fs->fs_cstotal.cs_nifree =
711 1.43 dbj fs->fs_old_cstotal.cs_nifree;
712 1.43 dbj fs->fs_cstotal.cs_nffree =
713 1.43 dbj fs->fs_old_cstotal.cs_nffree;
714 1.43 dbj
715 1.43 dbj fs->fs_maxbsize = fs->fs_bsize;
716 1.43 dbj fs->fs_time = fs->fs_old_time;
717 1.43 dbj fs->fs_size = fs->fs_old_size;
718 1.43 dbj fs->fs_dsize = fs->fs_old_dsize;
719 1.43 dbj fs->fs_csaddr = fs->fs_old_csaddr;
720 1.43 dbj fs->fs_sblockloc = SBLOCK_UFS1;
721 1.43 dbj
722 1.43 dbj fs->fs_flags = fs->fs_old_flags;
723 1.43 dbj
724 1.43 dbj if (fs->fs_old_postblformat == FS_42POSTBLFMT) {
725 1.43 dbj fs->fs_old_nrpos = 8;
726 1.43 dbj fs->fs_old_npsect = fs->fs_old_nsect;
727 1.43 dbj fs->fs_old_interleave = 1;
728 1.43 dbj fs->fs_old_trackskew = 0;
729 1.43 dbj }
730 1.43 dbj }
731 1.43 dbj
732 1.43 dbj void
733 1.43 dbj sb_oldfscompat_write(struct fs *fs, struct fs *fssave)
734 1.43 dbj {
735 1.43 dbj if ((fs->fs_magic != FS_UFS1_MAGIC) ||
736 1.43 dbj (fs->fs_old_flags & FS_FLAGS_UPDATED))
737 1.43 dbj return;
738 1.43 dbj
739 1.43 dbj fs->fs_old_flags = fs->fs_flags;
740 1.37 fvdl fs->fs_old_time = fs->fs_time;
741 1.37 fvdl fs->fs_old_cstotal.cs_ndir = fs->fs_cstotal.cs_ndir;
742 1.37 fvdl fs->fs_old_cstotal.cs_nbfree = fs->fs_cstotal.cs_nbfree;
743 1.37 fvdl fs->fs_old_cstotal.cs_nifree = fs->fs_cstotal.cs_nifree;
744 1.37 fvdl fs->fs_old_cstotal.cs_nffree = fs->fs_cstotal.cs_nffree;
745 1.43 dbj
746 1.43 dbj fs->fs_flags = fssave->fs_flags;
747 1.43 dbj
748 1.43 dbj if (fs->fs_old_postblformat == FS_42POSTBLFMT) {
749 1.43 dbj fs->fs_old_nrpos = fssave->fs_old_nrpos;
750 1.43 dbj fs->fs_old_npsect = fssave->fs_old_npsect;
751 1.43 dbj fs->fs_old_interleave = fssave->fs_old_interleave;
752 1.43 dbj fs->fs_old_trackskew = fssave->fs_old_trackskew;
753 1.43 dbj }
754 1.43 dbj
755 1.43 dbj memmove(&fs->fs_old_postbl_start, &fssave->fs_old_postbl_start,
756 1.43 dbj ((fs->fs_old_postblformat == FS_42POSTBLFMT) ?
757 1.43 dbj 512 : 256));
758 1.33 lukem }
759