1 /* 2 * Copyright (c) 1980, 1986 The Regents of the University of California. 3 * All rights reserved. 4 * 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. 16 */ 17 18 #ifndef lint 19 static char sccsid[] = "@(#)pass1.c 5.12 (Berkeley) 03/13/90"; 20 #endif /* not lint */ 21 22 #include <sys/param.h> 23 #include <ufs/dinode.h> 24 #include <ufs/fs.h> 25 #include "fsck.h" 26 27 static daddr_t badblk; 28 static daddr_t dupblk; 29 int pass1check(); 30 struct dinode *getnextinode(); 31 32 pass1() 33 { 34 register int c, i, j; 35 register struct dinode *dp; 36 struct zlncnt *zlnp; 37 int ndb, cgd; 38 struct inodesc idesc; 39 ino_t inumber; 40 41 /* 42 * Set file system reserved blocks in used block map. 43 */ 44 for (c = 0; c < sblock.fs_ncg; c++) { 45 cgd = cgdmin(&sblock, c); 46 if (c == 0) { 47 i = cgbase(&sblock, c); 48 cgd += howmany(sblock.fs_cssize, sblock.fs_fsize); 49 } else 50 i = cgsblock(&sblock, c); 51 for (; i < cgd; i++) 52 setbmap(i); 53 } 54 /* 55 * Find all allocated blocks. 56 */ 57 bzero((char *)&idesc, sizeof(struct inodesc)); 58 idesc.id_type = ADDR; 59 idesc.id_func = pass1check; 60 inumber = 0; 61 n_files = n_blks = 0; 62 resetinodebuf(); 63 for (c = 0; c < sblock.fs_ncg; c++) { 64 for (i = 0; i < sblock.fs_ipg; i++, inumber++) { 65 if (inumber < ROOTINO) 66 continue; 67 dp = getnextinode(inumber); 68 if ((dp->di_mode & IFMT) == 0) { 69 if (bcmp((char *)dp->di_db, (char *)zino.di_db, 70 NDADDR * sizeof(daddr_t)) || 71 bcmp((char *)dp->di_ib, (char *)zino.di_ib, 72 NIADDR * sizeof(daddr_t)) || 73 dp->di_mode || dp->di_size) { 74 pfatal("PARTIALLY ALLOCATED INODE I=%u", 75 inumber); 76 if (reply("CLEAR") == 1) { 77 dp = ginode(inumber); 78 clearinode(dp); 79 inodirty(); 80 } 81 } 82 statemap[inumber] = USTATE; 83 continue; 84 } 85 lastino = inumber; 86 if (dp->di_size < 0 || 87 dp->di_size + sblock.fs_bsize - 1 < 0) { 88 if (debug) 89 printf("bad size %d:", dp->di_size); 90 goto unknown; 91 } 92 if (!preen && (dp->di_mode & IFMT) == IFMT && 93 reply("HOLD BAD BLOCK") == 1) { 94 dp = ginode(inumber); 95 dp->di_size = sblock.fs_fsize; 96 dp->di_mode = IFREG|0600; 97 inodirty(); 98 } 99 ndb = howmany(dp->di_size, sblock.fs_bsize); 100 if (ndb < 0) { 101 if (debug) 102 printf("bad size %d ndb %d:", 103 dp->di_size, ndb); 104 goto unknown; 105 } 106 if ((dp->di_mode & IFMT) == IFBLK || 107 (dp->di_mode & IFMT) == IFCHR) 108 ndb++; 109 for (j = ndb; j < NDADDR; j++) 110 if (dp->di_db[j] != 0) { 111 if (debug) 112 printf("bad direct addr: %d\n", 113 dp->di_db[j]); 114 goto unknown; 115 } 116 for (j = 0, ndb -= NDADDR; ndb > 0; j++) 117 ndb /= NINDIR(&sblock); 118 for (; j < NIADDR; j++) 119 if (dp->di_ib[j] != 0) { 120 if (debug) 121 printf("bad indirect addr: %d\n", 122 dp->di_ib[j]); 123 goto unknown; 124 } 125 if (ftypeok(dp) == 0) 126 goto unknown; 127 n_files++; 128 lncntp[inumber] = dp->di_nlink; 129 if (dp->di_nlink <= 0) { 130 zlnp = (struct zlncnt *)malloc(sizeof *zlnp); 131 if (zlnp == NULL) { 132 pfatal("LINK COUNT TABLE OVERFLOW"); 133 if (reply("CONTINUE") == 0) 134 errexit(""); 135 } else { 136 zlnp->zlncnt = inumber; 137 zlnp->next = zlnhead; 138 zlnhead = zlnp; 139 } 140 } 141 if ((dp->di_mode & IFMT) == IFDIR) { 142 statemap[inumber] = DSTATE; 143 cacheino(dp, inumber); 144 } else 145 statemap[inumber] = FSTATE; 146 badblk = dupblk = 0; 147 idesc.id_number = inumber; 148 (void)ckinode(dp, &idesc); 149 idesc.id_entryno *= btodb(sblock.fs_fsize); 150 if (dp->di_blocks != idesc.id_entryno) { 151 pwarn("INCORRECT BLOCK COUNT I=%u (%ld should be %ld)", 152 inumber, dp->di_blocks, idesc.id_entryno); 153 if (preen) 154 printf(" (CORRECTED)\n"); 155 else if (reply("CORRECT") == 0) 156 continue; 157 dp = ginode(inumber); 158 dp->di_blocks = idesc.id_entryno; 159 inodirty(); 160 } 161 continue; 162 unknown: 163 pfatal("UNKNOWN FILE TYPE I=%u", inumber); 164 statemap[inumber] = FCLEAR; 165 if (reply("CLEAR") == 1) { 166 statemap[inumber] = USTATE; 167 dp = ginode(inumber); 168 clearinode(dp); 169 inodirty(); 170 } 171 } 172 } 173 freeinodebuf(); 174 } 175 176 pass1check(idesc) 177 register struct inodesc *idesc; 178 { 179 int res = KEEPON; 180 int anyout, nfrags; 181 daddr_t blkno = idesc->id_blkno; 182 register struct dups *dlp; 183 struct dups *new; 184 185 if ((anyout = chkrange(blkno, idesc->id_numfrags)) != 0) { 186 blkerror(idesc->id_number, "BAD", blkno); 187 if (++badblk >= MAXBAD) { 188 pwarn("EXCESSIVE BAD BLKS I=%u", 189 idesc->id_number); 190 if (preen) 191 printf(" (SKIPPING)\n"); 192 else if (reply("CONTINUE") == 0) 193 errexit(""); 194 return (STOP); 195 } 196 } 197 for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) { 198 if (anyout && chkrange(blkno, 1)) { 199 res = SKIP; 200 } else if (!testbmap(blkno)) { 201 n_blks++; 202 setbmap(blkno); 203 } else { 204 blkerror(idesc->id_number, "DUP", blkno); 205 if (++dupblk >= MAXDUP) { 206 pwarn("EXCESSIVE DUP BLKS I=%u", 207 idesc->id_number); 208 if (preen) 209 printf(" (SKIPPING)\n"); 210 else if (reply("CONTINUE") == 0) 211 errexit(""); 212 return (STOP); 213 } 214 new = (struct dups *)malloc(sizeof(struct dups)); 215 if (new == NULL) { 216 pfatal("DUP TABLE OVERFLOW."); 217 if (reply("CONTINUE") == 0) 218 errexit(""); 219 return (STOP); 220 } 221 new->dup = blkno; 222 if (muldup == 0) { 223 duplist = muldup = new; 224 new->next = 0; 225 } else { 226 new->next = muldup->next; 227 muldup->next = new; 228 } 229 for (dlp = duplist; dlp != muldup; dlp = dlp->next) 230 if (dlp->dup == blkno) 231 break; 232 if (dlp == muldup && dlp->dup != blkno) 233 muldup = new; 234 } 235 /* 236 * count the number of blocks found in id_entryno 237 */ 238 idesc->id_entryno++; 239 } 240 return (res); 241 } 242