utilities.c revision 1.41 1 1.41 agc /* $NetBSD: utilities.c,v 1.41 2003/08/07 10:04:21 agc 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.41 agc __RCSID("$NetBSD: utilities.c,v 1.41 2003/08/07 10:04:21 agc 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 getblk(bp, blkno, size);
190 1.1 cgd /* fall through */
191 1.1 cgd foundit:
192 1.1 cgd totalreads++;
193 1.1 cgd bp->b_prev->b_next = bp->b_next;
194 1.1 cgd bp->b_next->b_prev = bp->b_prev;
195 1.1 cgd bp->b_prev = &bufhead;
196 1.1 cgd bp->b_next = bufhead.b_next;
197 1.1 cgd bufhead.b_next->b_prev = bp;
198 1.1 cgd bufhead.b_next = bp;
199 1.1 cgd bp->b_flags |= B_INUSE;
200 1.1 cgd return (bp);
201 1.1 cgd }
202 1.1 cgd
203 1.1 cgd void
204 1.1 cgd getblk(bp, blk, size)
205 1.19 lukem struct bufarea *bp;
206 1.35 fvdl daddr_t blk;
207 1.1 cgd long size;
208 1.1 cgd {
209 1.35 fvdl daddr_t dblk;
210 1.1 cgd
211 1.23 bouyer dblk = fsbtodb(sblock, blk);
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.1 cgd !preen && reply("UPDATE STANDARD SUPERBLOCK")) {
280 1.39 fvdl if (!is_ufs2 && (sblock->fs_old_flags & FS_FLAGS_UPDATED) == 0)
281 1.39 fvdl sblk.b_bno = SBLOCK_UFS1 / dev_bsize;
282 1.39 fvdl else
283 1.39 fvdl sblk.b_bno = sblock->fs_sblockloc / dev_bsize;
284 1.1 cgd sbdirty();
285 1.1 cgd flush(fswritefd, &sblk);
286 1.1 cgd }
287 1.34 dbj flush(fswritefd, &appleufsblk);
288 1.34 dbj free(appleufsblk.b_un.b_buf);
289 1.1 cgd flush(fswritefd, &cgblk);
290 1.1 cgd free(cgblk.b_un.b_buf);
291 1.6 deraadt for (bp = bufhead.b_prev; bp && bp != &bufhead; bp = nbp) {
292 1.1 cgd cnt++;
293 1.1 cgd flush(fswritefd, bp);
294 1.1 cgd nbp = bp->b_prev;
295 1.1 cgd free(bp->b_un.b_buf);
296 1.1 cgd free((char *)bp);
297 1.1 cgd }
298 1.1 cgd if (bufhead.b_size != cnt)
299 1.20 lukem errx(EEXIT, "Panic: lost %d buffers", bufhead.b_size - cnt);
300 1.1 cgd pbp = pdirbp = (struct bufarea *)0;
301 1.23 bouyer if (markclean && (sblock->fs_clean & FS_ISCLEAN) == 0) {
302 1.14 mycroft /*
303 1.14 mycroft * Mark the file system as clean, and sync the superblock.
304 1.14 mycroft */
305 1.14 mycroft if (preen)
306 1.14 mycroft pwarn("MARKING FILE SYSTEM CLEAN\n");
307 1.14 mycroft else if (!reply("MARK FILE SYSTEM CLEAN"))
308 1.14 mycroft markclean = 0;
309 1.14 mycroft if (markclean) {
310 1.23 bouyer sblock->fs_clean = FS_ISCLEAN;
311 1.36 fvdl sblock->fs_pendingblocks = 0;
312 1.36 fvdl sblock->fs_pendinginodes = 0;
313 1.14 mycroft sbdirty();
314 1.20 lukem ofsmodified = fsmodified;
315 1.14 mycroft flush(fswritefd, &sblk);
316 1.22 lukem #if LITE2BORKEN
317 1.20 lukem fsmodified = ofsmodified;
318 1.22 lukem #endif
319 1.20 lukem if (!preen)
320 1.20 lukem printf(
321 1.20 lukem "\n***** FILE SYSTEM MARKED CLEAN *****\n");
322 1.14 mycroft }
323 1.14 mycroft }
324 1.1 cgd if (debug)
325 1.1 cgd printf("cache missed %ld of %ld (%d%%)\n", diskreads,
326 1.1 cgd totalreads, (int)(diskreads * 100 / totalreads));
327 1.1 cgd (void)close(fsreadfd);
328 1.1 cgd (void)close(fswritefd);
329 1.1 cgd }
330 1.1 cgd
331 1.11 cgd int
332 1.1 cgd bread(fd, buf, blk, size)
333 1.1 cgd int fd;
334 1.1 cgd char *buf;
335 1.35 fvdl daddr_t blk;
336 1.1 cgd long size;
337 1.1 cgd {
338 1.1 cgd char *cp;
339 1.1 cgd int i, errs;
340 1.9 mycroft off_t offset;
341 1.1 cgd
342 1.9 mycroft offset = blk;
343 1.9 mycroft offset *= dev_bsize;
344 1.9 mycroft if (lseek(fd, offset, 0) < 0)
345 1.1 cgd rwerror("SEEK", blk);
346 1.1 cgd else if (read(fd, buf, (int)size) == size)
347 1.1 cgd return (0);
348 1.1 cgd rwerror("READ", blk);
349 1.9 mycroft if (lseek(fd, offset, 0) < 0)
350 1.1 cgd rwerror("SEEK", blk);
351 1.1 cgd errs = 0;
352 1.10 mycroft memset(buf, 0, (size_t)size);
353 1.1 cgd printf("THE FOLLOWING DISK SECTORS COULD NOT BE READ:");
354 1.1 cgd for (cp = buf, i = 0; i < size; i += secsize, cp += secsize) {
355 1.1 cgd if (read(fd, cp, (int)secsize) != secsize) {
356 1.9 mycroft (void)lseek(fd, offset + i + secsize, 0);
357 1.1 cgd if (secsize != dev_bsize && dev_bsize != 1)
358 1.35 fvdl printf(" %lld (%lld),",
359 1.35 fvdl (long long)((blk*dev_bsize + i) / secsize),
360 1.35 fvdl (long long)(blk + i / dev_bsize));
361 1.1 cgd else
362 1.35 fvdl printf(" %lld,",
363 1.35 fvdl (long long)(blk + i / dev_bsize));
364 1.1 cgd errs++;
365 1.1 cgd }
366 1.1 cgd }
367 1.1 cgd printf("\n");
368 1.1 cgd return (errs);
369 1.1 cgd }
370 1.1 cgd
371 1.11 cgd void
372 1.1 cgd bwrite(fd, buf, blk, size)
373 1.1 cgd int fd;
374 1.1 cgd char *buf;
375 1.35 fvdl daddr_t blk;
376 1.1 cgd long size;
377 1.1 cgd {
378 1.1 cgd int i;
379 1.1 cgd char *cp;
380 1.9 mycroft off_t offset;
381 1.1 cgd
382 1.1 cgd if (fd < 0)
383 1.1 cgd return;
384 1.9 mycroft offset = blk;
385 1.9 mycroft offset *= dev_bsize;
386 1.9 mycroft if (lseek(fd, offset, 0) < 0)
387 1.1 cgd rwerror("SEEK", blk);
388 1.1 cgd else if (write(fd, buf, (int)size) == size) {
389 1.1 cgd fsmodified = 1;
390 1.1 cgd return;
391 1.1 cgd }
392 1.1 cgd rwerror("WRITE", blk);
393 1.9 mycroft if (lseek(fd, offset, 0) < 0)
394 1.1 cgd rwerror("SEEK", blk);
395 1.1 cgd printf("THE FOLLOWING SECTORS COULD NOT BE WRITTEN:");
396 1.1 cgd for (cp = buf, i = 0; i < size; i += dev_bsize, cp += dev_bsize)
397 1.1 cgd if (write(fd, cp, (int)dev_bsize) != dev_bsize) {
398 1.9 mycroft (void)lseek(fd, offset + i + dev_bsize, 0);
399 1.35 fvdl printf(" %lld,", (long long)(blk + i / dev_bsize));
400 1.1 cgd }
401 1.1 cgd printf("\n");
402 1.1 cgd return;
403 1.1 cgd }
404 1.1 cgd
405 1.1 cgd /*
406 1.1 cgd * allocate a data block with the specified number of fragments
407 1.1 cgd */
408 1.35 fvdl daddr_t
409 1.1 cgd allocblk(frags)
410 1.1 cgd long frags;
411 1.1 cgd {
412 1.26 fvdl int i, j, k, cg, baseblk;
413 1.26 fvdl struct cg *cgp = cgrp;
414 1.1 cgd
415 1.23 bouyer if (frags <= 0 || frags > sblock->fs_frag)
416 1.1 cgd return (0);
417 1.23 bouyer for (i = 0; i < maxfsblock - sblock->fs_frag; i += sblock->fs_frag) {
418 1.23 bouyer for (j = 0; j <= sblock->fs_frag - frags; j++) {
419 1.1 cgd if (testbmap(i + j))
420 1.1 cgd continue;
421 1.1 cgd for (k = 1; k < frags; k++)
422 1.1 cgd if (testbmap(i + j + k))
423 1.1 cgd break;
424 1.1 cgd if (k < frags) {
425 1.1 cgd j += k;
426 1.1 cgd continue;
427 1.1 cgd }
428 1.26 fvdl cg = dtog(sblock, i + j);
429 1.26 fvdl getblk(&cgblk, cgtod(sblock, cg), sblock->fs_cgsize);
430 1.26 fvdl memcpy(cgp, cgblk.b_un.b_cg, sblock->fs_cgsize);
431 1.26 fvdl if ((doswap && !needswap) || (!doswap && needswap))
432 1.36 fvdl ffs_cg_swap(cgblk.b_un.b_cg, cgp, sblock);
433 1.26 fvdl if (!cg_chkmagic(cgp, 0))
434 1.26 fvdl pfatal("CG %d: ALLOCBLK: BAD MAGIC NUMBER\n",
435 1.26 fvdl cg);
436 1.26 fvdl baseblk = dtogd(sblock, i + j);
437 1.26 fvdl for (k = 0; k < frags; k++) {
438 1.1 cgd setbmap(i + j + k);
439 1.26 fvdl clrbit(cg_blksfree(cgp, 0), baseblk + k);
440 1.26 fvdl }
441 1.1 cgd n_blks += frags;
442 1.26 fvdl if (frags == sblock->fs_frag)
443 1.26 fvdl cgp->cg_cs.cs_nbfree--;
444 1.26 fvdl else
445 1.26 fvdl cgp->cg_cs.cs_nffree -= frags;
446 1.26 fvdl cgdirty();
447 1.1 cgd return (i + j);
448 1.1 cgd }
449 1.1 cgd }
450 1.1 cgd return (0);
451 1.1 cgd }
452 1.1 cgd
453 1.1 cgd /*
454 1.1 cgd * Free a previously allocated block
455 1.1 cgd */
456 1.11 cgd void
457 1.1 cgd freeblk(blkno, frags)
458 1.35 fvdl daddr_t blkno;
459 1.1 cgd long frags;
460 1.1 cgd {
461 1.1 cgd struct inodesc idesc;
462 1.1 cgd
463 1.1 cgd idesc.id_blkno = blkno;
464 1.1 cgd idesc.id_numfrags = frags;
465 1.1 cgd (void)pass4check(&idesc);
466 1.1 cgd }
467 1.1 cgd
468 1.1 cgd /*
469 1.1 cgd * Find a pathname
470 1.1 cgd */
471 1.11 cgd void
472 1.40 itojun getpathname(namebuf, namebuflen, curdir, ino)
473 1.1 cgd char *namebuf;
474 1.40 itojun size_t namebuflen;
475 1.1 cgd ino_t curdir, ino;
476 1.1 cgd {
477 1.1 cgd int len;
478 1.19 lukem char *cp;
479 1.1 cgd struct inodesc idesc;
480 1.1 cgd static int busy = 0;
481 1.36 fvdl struct inostat *info;
482 1.1 cgd
483 1.9 mycroft if (curdir == ino && ino == ROOTINO) {
484 1.40 itojun (void)strlcpy(namebuf, "/", namebuflen);
485 1.9 mycroft return;
486 1.9 mycroft }
487 1.36 fvdl info = inoinfo(curdir);
488 1.36 fvdl if (busy || (info->ino_state != DSTATE && info->ino_state != DFOUND)) {
489 1.40 itojun (void)strlcpy(namebuf, "?", namebuflen);
490 1.1 cgd return;
491 1.1 cgd }
492 1.1 cgd busy = 1;
493 1.10 mycroft memset(&idesc, 0, sizeof(struct inodesc));
494 1.1 cgd idesc.id_type = DATA;
495 1.1 cgd idesc.id_fix = IGNORE;
496 1.1 cgd cp = &namebuf[MAXPATHLEN - 1];
497 1.1 cgd *cp = '\0';
498 1.1 cgd if (curdir != ino) {
499 1.1 cgd idesc.id_parent = curdir;
500 1.1 cgd goto namelookup;
501 1.1 cgd }
502 1.1 cgd while (ino != ROOTINO) {
503 1.1 cgd idesc.id_number = ino;
504 1.1 cgd idesc.id_func = findino;
505 1.1 cgd idesc.id_name = "..";
506 1.1 cgd if ((ckinode(ginode(ino), &idesc) & FOUND) == 0)
507 1.1 cgd break;
508 1.1 cgd namelookup:
509 1.1 cgd idesc.id_number = idesc.id_parent;
510 1.1 cgd idesc.id_parent = ino;
511 1.1 cgd idesc.id_func = findname;
512 1.1 cgd idesc.id_name = namebuf;
513 1.1 cgd if ((ckinode(ginode(idesc.id_number), &idesc)&FOUND) == 0)
514 1.1 cgd break;
515 1.1 cgd len = strlen(namebuf);
516 1.1 cgd cp -= len;
517 1.20 lukem memmove(cp, namebuf, (size_t)len);
518 1.1 cgd *--cp = '/';
519 1.1 cgd if (cp < &namebuf[MAXNAMLEN])
520 1.1 cgd break;
521 1.1 cgd ino = idesc.id_number;
522 1.1 cgd }
523 1.1 cgd busy = 0;
524 1.1 cgd if (ino != ROOTINO)
525 1.1 cgd *--cp = '?';
526 1.20 lukem memmove(namebuf, cp, (size_t)(&namebuf[MAXPATHLEN] - cp));
527 1.1 cgd }
528 1.1 cgd
529 1.1 cgd void
530 1.20 lukem catch(sig)
531 1.20 lukem int sig;
532 1.1 cgd {
533 1.23 bouyer if (!doinglevel2) {
534 1.23 bouyer markclean = 0;
535 1.23 bouyer ckfini();
536 1.23 bouyer }
537 1.1 cgd exit(12);
538 1.1 cgd }
539 1.1 cgd
540 1.1 cgd /*
541 1.1 cgd * When preening, allow a single quit to signal
542 1.1 cgd * a special exit after filesystem checks complete
543 1.1 cgd * so that reboot sequence may be interrupted.
544 1.1 cgd */
545 1.1 cgd void
546 1.20 lukem catchquit(sig)
547 1.20 lukem int sig;
548 1.1 cgd {
549 1.38 yamt int errsave = errno;
550 1.38 yamt
551 1.31 lukem printf("returning to single-user after file system check\n");
552 1.1 cgd returntosingle = 1;
553 1.1 cgd (void)signal(SIGQUIT, SIG_DFL);
554 1.38 yamt errno = errsave;
555 1.1 cgd }
556 1.1 cgd
557 1.1 cgd /*
558 1.1 cgd * Ignore a single quit signal; wait and flush just in case.
559 1.1 cgd * Used by child processes in preen.
560 1.1 cgd */
561 1.1 cgd void
562 1.20 lukem voidquit(sig)
563 1.20 lukem int sig;
564 1.1 cgd {
565 1.38 yamt int errsave = errno;
566 1.1 cgd
567 1.1 cgd sleep(1);
568 1.1 cgd (void)signal(SIGQUIT, SIG_IGN);
569 1.1 cgd (void)signal(SIGQUIT, SIG_DFL);
570 1.38 yamt errno = errsave;
571 1.1 cgd }
572 1.1 cgd
573 1.1 cgd /*
574 1.1 cgd * determine whether an inode should be fixed.
575 1.1 cgd */
576 1.11 cgd int
577 1.1 cgd dofix(idesc, msg)
578 1.19 lukem struct inodesc *idesc;
579 1.1 cgd char *msg;
580 1.1 cgd {
581 1.1 cgd
582 1.1 cgd switch (idesc->id_fix) {
583 1.1 cgd
584 1.1 cgd case DONTKNOW:
585 1.1 cgd if (idesc->id_type == DATA)
586 1.1 cgd direrror(idesc->id_number, msg);
587 1.1 cgd else
588 1.27 is pwarn("%s", msg);
589 1.1 cgd if (preen) {
590 1.1 cgd printf(" (SALVAGED)\n");
591 1.1 cgd idesc->id_fix = FIX;
592 1.1 cgd return (ALTERED);
593 1.1 cgd }
594 1.1 cgd if (reply("SALVAGE") == 0) {
595 1.1 cgd idesc->id_fix = NOFIX;
596 1.1 cgd return (0);
597 1.1 cgd }
598 1.1 cgd idesc->id_fix = FIX;
599 1.1 cgd return (ALTERED);
600 1.1 cgd
601 1.1 cgd case FIX:
602 1.1 cgd return (ALTERED);
603 1.1 cgd
604 1.1 cgd case NOFIX:
605 1.1 cgd case IGNORE:
606 1.1 cgd return (0);
607 1.1 cgd
608 1.1 cgd default:
609 1.20 lukem errx(EEXIT, "UNKNOWN INODESC FIX MODE %d", idesc->id_fix);
610 1.1 cgd }
611 1.1 cgd /* NOTREACHED */
612 1.20 lukem return (0);
613 1.23 bouyer }
614 1.23 bouyer
615 1.25 mycroft void
616 1.25 mycroft copyback_cg(blk)
617 1.23 bouyer struct bufarea *blk;
618 1.23 bouyer {
619 1.25 mycroft
620 1.25 mycroft memcpy(blk->b_un.b_cg, cgrp, sblock->fs_cgsize);
621 1.23 bouyer if (needswap)
622 1.36 fvdl ffs_cg_swap(cgrp, blk->b_un.b_cg, sblock);
623 1.23 bouyer }
624 1.23 bouyer
625 1.23 bouyer void
626 1.36 fvdl infohandler(int sig)
627 1.23 bouyer {
628 1.36 fvdl got_siginfo = 1;
629 1.1 cgd }
630 1.33 lukem
631 1.36 fvdl /*
632 1.36 fvdl * Look up state information for an inode.
633 1.36 fvdl */
634 1.36 fvdl struct inostat *
635 1.36 fvdl inoinfo(ino_t inum)
636 1.33 lukem {
637 1.36 fvdl static struct inostat unallocated = { USTATE, 0, 0 };
638 1.36 fvdl struct inostatlist *ilp;
639 1.36 fvdl int iloff;
640 1.36 fvdl
641 1.36 fvdl if (inum > maxino)
642 1.36 fvdl errx(EEXIT, "inoinfo: inumber %d out of range", inum);
643 1.36 fvdl ilp = &inostathead[inum / sblock->fs_ipg];
644 1.36 fvdl iloff = inum % sblock->fs_ipg;
645 1.36 fvdl if (iloff >= ilp->il_numalloced)
646 1.36 fvdl return (&unallocated);
647 1.36 fvdl return (&ilp->il_stat[iloff]);
648 1.37 fvdl }
649 1.37 fvdl
650 1.37 fvdl void
651 1.37 fvdl sb_oldfscompat_write(struct fs *fs)
652 1.37 fvdl {
653 1.37 fvdl if (fs->fs_magic != FS_UFS1_MAGIC)
654 1.37 fvdl return;
655 1.37 fvdl
656 1.37 fvdl fs->fs_old_time = fs->fs_time;
657 1.37 fvdl fs->fs_old_cstotal.cs_ndir = fs->fs_cstotal.cs_ndir;
658 1.37 fvdl fs->fs_old_cstotal.cs_nbfree = fs->fs_cstotal.cs_nbfree;
659 1.37 fvdl fs->fs_old_cstotal.cs_nifree = fs->fs_cstotal.cs_nifree;
660 1.37 fvdl fs->fs_old_cstotal.cs_nffree = fs->fs_cstotal.cs_nffree;
661 1.33 lukem }
662