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.11 (Berkeley) 02/07/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 clearinode(dp); 78 inodirty(); 79 } 80 } 81 statemap[inumber] = USTATE; 82 continue; 83 } 84 lastino = inumber; 85 if (dp->di_size < 0 || 86 dp->di_size + sblock.fs_bsize - 1 < 0) { 87 if (debug) 88 printf("bad size %d:", dp->di_size); 89 goto unknown; 90 } 91 if (!preen && (dp->di_mode & IFMT) == IFMT && 92 reply("HOLD BAD BLOCK") == 1) { 93 dp->di_size = sblock.fs_fsize; 94 dp->di_mode = IFREG|0600; 95 inodirty(); 96 } 97 ndb = howmany(dp->di_size, sblock.fs_bsize); 98 if (ndb < 0) { 99 if (debug) 100 printf("bad size %d ndb %d:", 101 dp->di_size, ndb); 102 goto unknown; 103 } 104 if ((dp->di_mode & IFMT) == IFBLK || 105 (dp->di_mode & IFMT) == IFCHR) 106 ndb++; 107 for (j = ndb; j < NDADDR; j++) 108 if (dp->di_db[j] != 0) { 109 if (debug) 110 printf("bad direct addr: %d\n", 111 dp->di_db[j]); 112 goto unknown; 113 } 114 for (j = 0, ndb -= NDADDR; ndb > 0; j++) 115 ndb /= NINDIR(&sblock); 116 for (; j < NIADDR; j++) 117 if (dp->di_ib[j] != 0) { 118 if (debug) 119 printf("bad indirect addr: %d\n", 120 dp->di_ib[j]); 121 goto unknown; 122 } 123 if (ftypeok(dp) == 0) 124 goto unknown; 125 n_files++; 126 lncntp[inumber] = dp->di_nlink; 127 if (dp->di_nlink <= 0) { 128 zlnp = (struct zlncnt *)malloc(sizeof *zlnp); 129 if (zlnp == NULL) { 130 pfatal("LINK COUNT TABLE OVERFLOW"); 131 if (reply("CONTINUE") == 0) 132 errexit(""); 133 } else { 134 zlnp->zlncnt = inumber; 135 zlnp->next = zlnhead; 136 zlnhead = zlnp; 137 } 138 } 139 if ((dp->di_mode & IFMT) == IFDIR) { 140 statemap[inumber] = DSTATE; 141 cacheino(dp, inumber); 142 } else 143 statemap[inumber] = FSTATE; 144 badblk = dupblk = 0; 145 idesc.id_number = inumber; 146 (void)ckinode(dp, &idesc); 147 idesc.id_entryno *= btodb(sblock.fs_fsize); 148 if (dp->di_blocks != idesc.id_entryno) { 149 pwarn("INCORRECT BLOCK COUNT I=%u (%ld should be %ld)", 150 inumber, dp->di_blocks, idesc.id_entryno); 151 if (preen) 152 printf(" (CORRECTED)\n"); 153 else if (reply("CORRECT") == 0) 154 continue; 155 dp->di_blocks = idesc.id_entryno; 156 inodirty(); 157 } 158 continue; 159 unknown: 160 pfatal("UNKNOWN FILE TYPE I=%u", inumber); 161 statemap[inumber] = FCLEAR; 162 if (reply("CLEAR") == 1) { 163 statemap[inumber] = USTATE; 164 clearinode(dp); 165 inodirty(); 166 } 167 } 168 } 169 freeinodebuf(); 170 } 171 172 pass1check(idesc) 173 register struct inodesc *idesc; 174 { 175 int res = KEEPON; 176 int anyout, nfrags; 177 daddr_t blkno = idesc->id_blkno; 178 register struct dups *dlp; 179 struct dups *new; 180 181 if ((anyout = chkrange(blkno, idesc->id_numfrags)) != 0) { 182 blkerror(idesc->id_number, "BAD", blkno); 183 if (++badblk >= MAXBAD) { 184 pwarn("EXCESSIVE BAD BLKS I=%u", 185 idesc->id_number); 186 if (preen) 187 printf(" (SKIPPING)\n"); 188 else if (reply("CONTINUE") == 0) 189 errexit(""); 190 return (STOP); 191 } 192 } 193 for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) { 194 if (anyout && chkrange(blkno, 1)) { 195 res = SKIP; 196 } else if (!testbmap(blkno)) { 197 n_blks++; 198 setbmap(blkno); 199 } else { 200 blkerror(idesc->id_number, "DUP", blkno); 201 if (++dupblk >= MAXDUP) { 202 pwarn("EXCESSIVE DUP BLKS I=%u", 203 idesc->id_number); 204 if (preen) 205 printf(" (SKIPPING)\n"); 206 else if (reply("CONTINUE") == 0) 207 errexit(""); 208 return (STOP); 209 } 210 new = (struct dups *)malloc(sizeof(struct dups)); 211 if (new == NULL) { 212 pfatal("DUP TABLE OVERFLOW."); 213 if (reply("CONTINUE") == 0) 214 errexit(""); 215 return (STOP); 216 } 217 new->dup = blkno; 218 if (muldup == 0) { 219 duplist = muldup = new; 220 new->next = 0; 221 } else { 222 new->next = muldup->next; 223 muldup->next = new; 224 } 225 for (dlp = duplist; dlp != muldup; dlp = dlp->next) 226 if (dlp->dup == blkno) 227 break; 228 if (dlp == muldup && dlp->dup != blkno) 229 muldup = new; 230 } 231 /* 232 * count the number of blocks found in id_entryno 233 */ 234 idesc->id_entryno++; 235 } 236 return (res); 237 } 238