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