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