2 * Copyright (c) 1980, 1986 The Regents of the University of California.
5 * Redistribution and use in source and binary forms are permitted
6 * provided that the above copyright notice and this paragraph are
7 * duplicated in all such forms and that any documentation,
8 * advertising materials, and other materials related to such
9 * distribution and use acknowledge that the software was developed
10 * by the University of California, Berkeley. The name of the
11 * University may not be used to endorse or promote products derived
12 * from this software without specific prior written permission.
13 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
14 * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
15 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
18 #include <afsconfig.h>
19 #include <afs/param.h>
26 #ifdef AFS_VFSINCL_ENV
27 #include <sys/vnode.h>
29 #include <sys/fs/ufs_inode.h>
30 #include <sys/fs/ufs_fs.h>
32 #include <sys/fs/ufs_fsdir.h>
34 #include <sys/fs/ufs_mount.h>
36 #include <ufs/inode.h>
39 #else /* AFS_VFSINCL_ENV */
40 #include <sys/inode.h>
44 #define LONGFILENAMES 1
45 #include <sys/sysmacros.h>
49 #endif /* AFS_VFSINCL_ENV */
51 #include <afs/osi_inode.h>
54 static daddr_t badblk;
55 static daddr_t dupblk;
57 static int oldreported;
69 * Set file system reserved blocks in used block map.
71 for (c = 0; c < sblock.fs_ncg; c++) {
72 cgd = cgdmin(&sblock, c);
74 i = cgbase(&sblock, c);
75 cgd += howmany(sblock.fs_cssize, sblock.fs_fsize);
77 i = cgsblock(&sblock, c);
82 * Find all allocated blocks.
84 memset(&idesc, 0, sizeof(struct inodesc));
86 idesc.id_func = pass1check;
92 for (c = 0; c < sblock.fs_ncg; c++) {
93 for (i = 0; i < sblock.fs_ipg; i++, inumber++) {
94 if (inumber < ROOTINO)
97 if ((dp->di_mode & IFMT) == 0) {
99 ((char *)dp->di_db, (char *)zino.di_db,
100 NDADDR * sizeof(daddr_t))
101 || memcmp((char *)dp->di_ib, (char *)zino.di_ib,
102 NIADDR * sizeof(daddr_t)) ||
103 #if defined(ACLS) && defined(AFS_HPUX_ENV)
104 dp->di_mode || dp->di_size || dp->di_contin) {
105 if (dp->di_contin != 0)
106 pwarn("UNALLOCATED INODE HAS BAD ic_contin VALUE %d",
110 dp->di_mode || dp->di_size) {
113 pfatal("PARTIALLY ALLOCATED INODE I=%u", inumber);
114 if (reply("CLEAR") == 1) {
123 statemap[inumber] = USTATE;
127 #if defined(ACLS) && defined(AFS_HPUX_ENV)
129 * Don't check blocks and sizes of
130 * continuation inodes
133 statemap[inumber] = CSTATE;
134 lncntp[inumber] = dp->di_nlink;
139 #if defined(AFS_SUN5_ENV)
140 if (dp->di_size < 0 || dp->di_size > (UOFF_T) UFS_MAXOFFSET_T) {
142 printf("bad size %llu:", dp->di_size);
146 if (dp->di_size < 0 || dp->di_size + sblock.fs_bsize - 1 < 0) {
148 printf("bad size %d:", dp->di_size);
152 #if defined(AFS_HPUX_ENV)
153 /* initialize all R/W activities of FIFO file */
154 /* make sure FIFO is empty (everything is 0) */
155 if ((dp->di_mode & IFMT) == IFIFO
156 && (dp->di_frcnt != 0 || dp->di_fwcnt != 0)) {
158 pwarn("NON-ZERO READER/WRITER COUNT(S) ON PIPE I=%u",
161 printf(" (CORRECTED)\n");
163 if (reply("CORRECT") == 0)
175 for (j = ndb; j < NDADDR; j++)
181 * Fast symlink -- verify that the size is valid and that the length
182 * of the path is correct.
185 if (dp->di_size >= MAX_FASTLINK_SIZE) {
187 printf("bad fastlink size %d:", dp->di_size);
190 dp->di_symlink[MAX_FASTLINK_SIZE - 1] = '\0';
191 if (strlen(dp->di_symlink) != dp->di_size) {
192 int len = strlen(dp->di_symlink);
193 pwarn("BAD SYMLINK SIZE, SHOULD BE %d: size = %d", len,
196 printf(" (CORRECTED)\n");
200 if (reply("CORRECT") == 0)
206 goto ignore_direct_block_check;
208 #endif /* IC_FASTLINK */
211 if (!preen && (dp->di_mode & IFMT) == IFMT
212 && reply("HOLD BAD BLOCK") == 1) {
213 dp->di_size = sblock.fs_fsize;
214 dp->di_mode = IFREG | 0600;
217 ndb = howmany(dp->di_size, (UOFF_T) sblock.fs_bsize);
219 if (dp->di_oeftflag == oEFT_MAGIC) {
220 dp->di_oeftflag = 0; /* XXX migration aid */
227 #if defined(AFS_SUN5_ENV)
228 printf("bad size %" AFS_INT64_FMT " ndb %d:",
230 printf("bad size %d ndb %d:",
235 if ((dp->di_mode & IFMT) == IFBLK
236 || (dp->di_mode & IFMT) == IFCHR)
238 for (j = ndb; j < NDADDR; j++) {
239 #if defined(AFS_HPUX_ENV) && (defined(DUX) || defined(CNODE_DEV))
241 * DUX uses db[2] on cnode-specific
242 * device files, so skip 'em
244 if (j == 2 && SPECIAL)
247 if (dp->di_db[j] != 0) {
249 printf("bad direct addr: %d\n", dp->di_db[j]);
253 for (j = 0, ndb -= NDADDR; ndb > 0; j++)
254 ndb /= NINDIR(&sblock);
255 for (; j < NIADDR; j++)
256 if (dp->di_ib[j] != 0) {
258 if ((dp->di_mode & IFMT) != IFIFO) {
261 printf("bad indirect addr: %d\n",
269 #if defined(AFS_HPUX_ENV)
270 ignore_direct_block_check:
272 if (ftypeok(dp) == 0)
275 lncntp[inumber] = dp->di_nlink;
276 if (dp->di_nlink <= 0) {
277 zlnp = malloc(sizeof *zlnp);
279 pfatal("LINK COUNT TABLE OVERFLOW");
280 if (reply("CONTINUE") == 0)
283 zlnp->zlncnt = inumber;
284 zlnp->next = zlnhead;
288 #if defined(AFS_SUN5_ENV)
293 ("This vicep partition seems to contain pre Sol2.6 AFS inodes\n");
295 ("You should run the AFS file conversion utility before installing Sol 2.6\n");
296 printf("Continuing anyway.\n");
300 /* This looks like a sol 2.5 AFS inode */
302 ("This vicep partition seems to contain pre Sol2.6 AFS inodes\n");
304 ("You should run the AFS file conversion utility before installing Sol 2.6\n");
305 exit(100); /* unique return code? */
311 (dp->di_mode & IFMT) ==
312 IFDIR ? DSTATE : (VICEINODE ? VSTATE : FSTATE);
314 (dp->di_mode & IFMT) == IFDIR ? DSTATE : FSTATE;
316 #if defined(ACLS) && defined(AFS_HPUX_ENV)
318 * keep track of associated contin inodes
320 if (dp->di_contin != 0)
321 statemap[inumber] |= HASCINODE;
324 idesc.id_number = inumber;
325 idesc.id_entryno = 0;
327 idesc.id_fix = DONTKNOW;
329 (void)ckinode(dp, &idesc);
331 idesc.id_entryno *= btodb(sblock.fs_fsize);
333 if (dp->di_blocks != idesc.id_entryno) {
334 pwarn("INCORRECT BLOCK COUNT I=%u (%ld should be %ld)",
335 inumber, dp->di_blocks, idesc.id_entryno);
337 printf(" (CORRECTED)\n");
338 else if (reply("CORRECT") == 0)
341 dp = ginode(inumber);
343 dp->di_blocks = idesc.id_entryno;
347 if ((dp->di_mode & IFMT) == IFDIR)
348 if (dp->di_blocks == 0)
349 statemap[inumber] = DCLEAR;
353 pfatal("UNKNOWN FILE TYPE I=%u", inumber);
355 if ((dp->di_mode & IFMT) == IFDIR) {
356 statemap[inumber] = DCLEAR;
358 cacheino(dp, inumber);
362 statemap[inumber] = FCLEAR;
363 if (reply("CLEAR") == 1) {
364 statemap[inumber] = USTATE;
377 struct inodesc *idesc;
381 daddr_t blkno = idesc->id_blkno;
385 if ((anyout = chkrange(blkno, idesc->id_numfrags)) != 0) {
386 blkerror(idesc->id_number, "BAD", blkno);
387 if (++badblk >= MAXBAD) {
388 pwarn("EXCESSIVE BAD BLKS I=%u", idesc->id_number);
390 printf(" (SKIPPING)\n");
391 else if (reply("CONTINUE") == 0)
399 for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
400 if (anyout && chkrange(blkno, 1)) {
402 } else if (!testbmap(blkno)) {
406 blkerror(idesc->id_number, "DUP", blkno);
407 if (++dupblk >= MAXDUP) {
408 pwarn("EXCESSIVE DUP BLKS I=%u", idesc->id_number);
410 printf(" (SKIPPING)\n");
411 else if (reply("CONTINUE") == 0)
418 new = malloc(sizeof(struct dups));
420 pfatal("DUP TABLE OVERFLOW.");
421 if (reply("CONTINUE") == 0)
427 duplist = muldup = new;
430 new->next = muldup->next;
433 for (dlp = duplist; dlp != muldup; dlp = dlp->next)
434 if (dlp->dup == blkno)
436 if (dlp == muldup && dlp->dup != blkno)
440 * count the number of blocks found in id_entryno