pass1.c revision 2605
162642Sn_hibma/* 262642Sn_hibma * Copyright (c) 1980, 1986, 1993 362642Sn_hibma * The Regents of the University of California. All rights reserved. 462642Sn_hibma * 562642Sn_hibma * Redistribution and use in source and binary forms, with or without 662642Sn_hibma * modification, are permitted provided that the following conditions 762642Sn_hibma * are met: 862642Sn_hibma * 1. Redistributions of source code must retain the above copyright 962642Sn_hibma * notice, this list of conditions and the following disclaimer. 1062642Sn_hibma * 2. Redistributions in binary form must reproduce the above copyright 1162642Sn_hibma * notice, this list of conditions and the following disclaimer in the 1262642Sn_hibma * documentation and/or other materials provided with the distribution. 1362642Sn_hibma * 3. All advertising materials mentioning features or use of this software 1462642Sn_hibma * must display the following acknowledgement: 1562642Sn_hibma * This product includes software developed by the University of 1662642Sn_hibma * California, Berkeley and its contributors. 1762642Sn_hibma * 4. Neither the name of the University nor the names of its contributors 1862642Sn_hibma * may be used to endorse or promote products derived from this software 1962642Sn_hibma * without specific prior written permission. 2062642Sn_hibma * 2162642Sn_hibma * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 2262642Sn_hibma * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 2362642Sn_hibma * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 2462642Sn_hibma * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 2562642Sn_hibma * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 2662642Sn_hibma * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 2762642Sn_hibma * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 2862642Sn_hibma * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 2962642Sn_hibma * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 3062642Sn_hibma * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31236596Seadler * SUCH DAMAGE. 3262642Sn_hibma */ 3362642Sn_hibma 3462642Sn_hibma#ifndef lint 3562642Sn_hibmastatic char sccsid[] = "@(#)pass1.c 8.1 (Berkeley) 6/5/93"; 3662642Sn_hibma#endif /* not lint */ 3762642Sn_hibma 3862642Sn_hibma#include <sys/param.h> 3962642Sn_hibma#include <sys/time.h> 40225839Smav#include <ufs/ufs/dinode.h> 41225839Smav#include <ufs/ufs/dir.h> 42225839Smav#include <ufs/ffs/fs.h> 43225839Smav#include <stdlib.h> 44225839Smav#include <string.h> 45225839Smav#include "fsck.h" 46225839Smav 4762642Sn_hibmastatic daddr_t badblk; 48225839Smavstatic daddr_t dupblk; 49225839Smavint pass1check(); 50235519Smavstruct dinode *getnextinode(); 51225839Smav 52225839Smavpass1() 53225839Smav{ 54225839Smav ino_t inumber; 55225839Smav int c, i, cgd; 5662642Sn_hibma struct inodesc idesc; 57225839Smav 58225839Smav /* 59235519Smav * Set file system reserved blocks in used block map. 60225839Smav */ 61225839Smav for (c = 0; c < sblock.fs_ncg; c++) { 62225839Smav cgd = cgdmin(&sblock, c); 6362642Sn_hibma if (c == 0) { 6462642Sn_hibma i = cgbase(&sblock, c); 65225839Smav cgd += howmany(sblock.fs_cssize, sblock.fs_fsize); 66225839Smav } else 67225839Smav i = cgsblock(&sblock, c); 6862642Sn_hibma for (; i < cgd; i++) 6995124Scharnier setbmap(i); 7062642Sn_hibma } 71225839Smav /* 72225839Smav * Find all allocated blocks. 7363641Ssheldonh */ 7463641Ssheldonh bzero((char *)&idesc, sizeof(struct inodesc)); 7563641Ssheldonh idesc.id_type = ADDR; 76225839Smav idesc.id_func = pass1check; 77225839Smav inumber = 0; 78225839Smav n_files = n_blks = 0; 79225839Smav resetinodebuf(); 80225839Smav for (c = 0; c < sblock.fs_ncg; c++) { 8162642Sn_hibma for (i = 0; i < sblock.fs_ipg; i++, inumber++) { 8262642Sn_hibma if (inumber < ROOTINO) 8362642Sn_hibma continue; 8462642Sn_hibma checkinode(inumber, &idesc); 85225839Smav } 8662642Sn_hibma } 8763641Ssheldonh freeinodebuf(); 8862642Sn_hibma} 8962642Sn_hibma 9062642Sn_hibmacheckinode(inumber, idesc) 9162642Sn_hibma ino_t inumber; 9262642Sn_hibma register struct inodesc *idesc; 9362642Sn_hibma{ 9462642Sn_hibma register struct dinode *dp; 9562642Sn_hibma struct zlncnt *zlnp; 9662642Sn_hibma int ndb, j; 9762642Sn_hibma mode_t mode; 98225839Smav char *symbuf; 99225839Smav 100225839Smav dp = getnextinode(inumber); 101164531Sgrog mode = dp->di_mode & IFMT; 102164531Sgrog if (mode == 0) { 103225839Smav if (bcmp((char *)dp->di_db, (char *)zino.di_db, 104235519Smav NDADDR * sizeof(daddr_t)) || 105235519Smav bcmp((char *)dp->di_ib, (char *)zino.di_ib, 10662642Sn_hibma NIADDR * sizeof(daddr_t)) || 107225839Smav dp->di_mode || dp->di_size) { 108225839Smav pfatal("PARTIALLY ALLOCATED INODE I=%lu", inumber); 109225839Smav if (reply("CLEAR") == 1) { 110225839Smav dp = ginode(inumber); 111225839Smav clearinode(dp); 112225839Smav inodirty(); 113225839Smav } 114225839Smav } 115225839Smav statemap[inumber] = USTATE; 116225839Smav return; 117225839Smav } 118225839Smav lastino = inumber; 119225839Smav if (/* dp->di_size < 0 || */ 120225839Smav dp->di_size + sblock.fs_bsize - 1 < dp->di_size) { 121225839Smav if (debug) 122225839Smav printf("bad size %qu:", dp->di_size); 123225839Smav goto unknown; 124225839Smav } 125225839Smav if (!preen && mode == IFMT && reply("HOLD BAD BLOCK") == 1) { 126225839Smav dp = ginode(inumber); 127225839Smav dp->di_size = sblock.fs_fsize; 128225839Smav dp->di_mode = IFREG|0600; 129225839Smav inodirty(); 130225839Smav } 131225839Smav ndb = howmany(dp->di_size, sblock.fs_bsize); 132225839Smav if (ndb < 0) { 133225839Smav if (debug) 134225839Smav printf("bad size %qu ndb %d:", 135225839Smav dp->di_size, ndb); 136225839Smav goto unknown; 137225839Smav } 13862642Sn_hibma if (mode == IFBLK || mode == IFCHR) 139250582Sjoel ndb++; 140250582Sjoel if (mode == IFLNK) { 14162642Sn_hibma if (doinglevel2 && 142250582Sjoel dp->di_size > 0 && dp->di_size < MAXSYMLINKLEN && 14362642Sn_hibma dp->di_blocks != 0) { 144124131Scharnier symbuf = alloca(secsize); 14563641Ssheldonh if (bread(fsreadfd, symbuf, 14663641Ssheldonh fsbtodb(&sblock, dp->di_db[0]), 14762642Sn_hibma (long)secsize) != 0) 14862642Sn_hibma errexit("cannot read symlink"); 14962642Sn_hibma if (debug) { 15062642Sn_hibma symbuf[dp->di_size] = 0; 15162642Sn_hibma printf("convert symlink %d(%s) of size %d\n", 152 inumber, symbuf, (long)dp->di_size); 153 } 154 dp = ginode(inumber); 155 bcopy(symbuf, (caddr_t)dp->di_shortlink, 156 (long)dp->di_size); 157 dp->di_blocks = 0; 158 inodirty(); 159 } 160 /* 161 * Fake ndb value so direct/indirect block checks below 162 * will detect any garbage after symlink string. 163 */ 164 if ((dp->di_size < sblock.fs_maxsymlinklen) || dp->di_blocks == 0) { 165 ndb = howmany(dp->di_size, sizeof(daddr_t)); 166 if (ndb > NDADDR) { 167 j = ndb - NDADDR; 168 for (ndb = 1; j > 1; j--) 169 ndb *= NINDIR(&sblock); 170 ndb += NDADDR; 171 } 172 } 173 } 174 for (j = ndb; j < NDADDR; j++) 175 if (dp->di_db[j] != 0) { 176 if (debug) 177 printf("bad direct addr: %ld\n", dp->di_db[j]); 178 goto unknown; 179 } 180 for (j = 0, ndb -= NDADDR; ndb > 0; j++) 181 ndb /= NINDIR(&sblock); 182 for (; j < NIADDR; j++) 183 if (dp->di_ib[j] != 0) { 184 if (debug) 185 printf("bad indirect addr: %ld\n", 186 dp->di_ib[j]); 187 goto unknown; 188 } 189 if (ftypeok(dp) == 0) 190 goto unknown; 191 n_files++; 192 lncntp[inumber] = dp->di_nlink; 193 if (dp->di_nlink <= 0) { 194 zlnp = (struct zlncnt *)malloc(sizeof *zlnp); 195 if (zlnp == NULL) { 196 pfatal("LINK COUNT TABLE OVERFLOW"); 197 if (reply("CONTINUE") == 0) 198 errexit(""); 199 } else { 200 zlnp->zlncnt = inumber; 201 zlnp->next = zlnhead; 202 zlnhead = zlnp; 203 } 204 } 205 if (mode == IFDIR) { 206 if (dp->di_size == 0) 207 statemap[inumber] = DCLEAR; 208 else 209 statemap[inumber] = DSTATE; 210 cacheino(dp, inumber); 211 } else 212 statemap[inumber] = FSTATE; 213 typemap[inumber] = IFTODT(mode); 214 if (doinglevel2 && 215 (dp->di_ouid != (u_short)-1 || dp->di_ogid != (u_short)-1)) { 216 dp = ginode(inumber); 217 dp->di_uid = dp->di_ouid; 218 dp->di_ouid = -1; 219 dp->di_gid = dp->di_ogid; 220 dp->di_ogid = -1; 221 inodirty(); 222 } 223 badblk = dupblk = 0; 224 idesc->id_number = inumber; 225 (void)ckinode(dp, idesc); 226 idesc->id_entryno *= btodb(sblock.fs_fsize); 227 if (dp->di_blocks != idesc->id_entryno) { 228 pwarn("INCORRECT BLOCK COUNT I=%lu (%ld should be %ld)", 229 inumber, dp->di_blocks, idesc->id_entryno); 230 if (preen) 231 printf(" (CORRECTED)\n"); 232 else if (reply("CORRECT") == 0) 233 return; 234 dp = ginode(inumber); 235 dp->di_blocks = idesc->id_entryno; 236 inodirty(); 237 } 238 return; 239unknown: 240 pfatal("UNKNOWN FILE TYPE I=%lu", inumber); 241 statemap[inumber] = FCLEAR; 242 if (reply("CLEAR") == 1) { 243 statemap[inumber] = USTATE; 244 dp = ginode(inumber); 245 clearinode(dp); 246 inodirty(); 247 } 248} 249 250pass1check(idesc) 251 register struct inodesc *idesc; 252{ 253 int res = KEEPON; 254 int anyout, nfrags; 255 daddr_t blkno = idesc->id_blkno; 256 register struct dups *dlp; 257 struct dups *new; 258 259 if ((anyout = chkrange(blkno, idesc->id_numfrags)) != 0) { 260 blkerror(idesc->id_number, "BAD", blkno); 261 if (badblk++ >= MAXBAD) { 262 pwarn("EXCESSIVE BAD BLKS I=%lu", 263 idesc->id_number); 264 if (preen) 265 printf(" (SKIPPING)\n"); 266 else if (reply("CONTINUE") == 0) 267 errexit(""); 268 return (STOP); 269 } 270 } 271 for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) { 272 if (anyout && chkrange(blkno, 1)) { 273 res = SKIP; 274 } else if (!testbmap(blkno)) { 275 n_blks++; 276 setbmap(blkno); 277 } else { 278 blkerror(idesc->id_number, "DUP", blkno); 279 if (dupblk++ >= MAXDUP) { 280 pwarn("EXCESSIVE DUP BLKS I=%lu", 281 idesc->id_number); 282 if (preen) 283 printf(" (SKIPPING)\n"); 284 else if (reply("CONTINUE") == 0) 285 errexit(""); 286 return (STOP); 287 } 288 new = (struct dups *)malloc(sizeof(struct dups)); 289 if (new == NULL) { 290 pfatal("DUP TABLE OVERFLOW."); 291 if (reply("CONTINUE") == 0) 292 errexit(""); 293 return (STOP); 294 } 295 new->dup = blkno; 296 if (muldup == 0) { 297 duplist = muldup = new; 298 new->next = 0; 299 } else { 300 new->next = muldup->next; 301 muldup->next = new; 302 } 303 for (dlp = duplist; dlp != muldup; dlp = dlp->next) 304 if (dlp->dup == blkno) 305 break; 306 if (dlp == muldup && dlp->dup != blkno) 307 muldup = new; 308 } 309 /* 310 * count the number of blocks found in id_entryno 311 */ 312 idesc->id_entryno++; 313 } 314 return (res); 315} 316