dynamically allocate zero link count table

[unix-history] / usr / src / sbin / fsck / pass1.c

#ifndef lint
static char version[] = "@(#)pass1.c    3.7 (Berkeley) %G%";
#endif

#include <sys/param.h>
#include <sys/inode.h>
#include <sys/fs.h>
#include "fsck.h"

static daddr_t badblk;
static daddr_t dupblk;
int pass1check();

pass1()
{
       register int c, i, j;
       register DINODE *dp;
       struct zlncnt *zlnp;
       int ndb, partial, cgd;
       struct inodesc idesc;
       ino_t inumber;

       /*
        * Set file system reserved blocks in used block map.
        */
       for (c = 0; c < sblock.fs_ncg; c++) {
               cgd = cgdmin(&sblock, c);
               if (c == 0) {
                       i = cgbase(&sblock, c);
                       cgd += howmany(sblock.fs_cssize, sblock.fs_fsize);
               } else
                       i = cgsblock(&sblock, c);
               for (; i < cgd; i++)
                       setbmap(i);
       }
       /*
        * Find all allocated blocks.
        */
       bzero((char *)&idesc, sizeof(struct inodesc));
       idesc.id_type = ADDR;
       idesc.id_func = pass1check;
       inumber = 0;
       n_files = n_blks = 0;
       for (c = 0; c < sblock.fs_ncg; c++) {
               for (i = 0; i < sblock.fs_ipg; i++, inumber++) {
                       if (inumber < ROOTINO)
                               continue;
                       dp = ginode(inumber);
                       if (!ALLOC(dp)) {
                               if (bcmp((char *)dp->di_db, (char *)zino.di_db,
                                       NDADDR * sizeof(daddr_t)) ||
                                   bcmp((char *)dp->di_ib, (char *)zino.di_ib,
                                       NIADDR * sizeof(daddr_t)) ||
                                   dp->di_mode || dp->di_size) {
                                       pfatal("PARTIALLY ALLOCATED INODE I=%u",
                                               inumber);
                                       if (reply("CLEAR") == 1) {
                                               zapino(dp);
                                               inodirty();
                                       }
                               }
                               statemap[inumber] = USTATE;
                               continue;
                       }
                       lastino = inumber;
                       if (dp->di_size < 0) {
                               if (debug)
                                       printf("bad size %d:", dp->di_size);
                               goto unknown;
                       }
                       ndb = howmany(dp->di_size, sblock.fs_bsize);
                       if (SPECIAL(dp))
                               ndb++;
                       for (j = ndb; j < NDADDR; j++)
                               if (dp->di_db[j] != 0) {
                                       if (debug)
                                               printf("bad direct addr: %d\n",
                                                       dp->di_db[j]);
                                       goto unknown;
                               }
                       for (j = 0, ndb -= NDADDR; ndb > 0; j++)
                               ndb /= NINDIR(&sblock);
                       for (; j < NIADDR; j++)
                               if (dp->di_ib[j] != 0) {
                                       if (debug)
                                               printf("bad indirect addr: %d\n",
                                                       dp->di_ib[j]);
                                       goto unknown;
                               }
                       if (!preen && (dp->di_mode & IFMT) == IFMT &&
                           reply("HOLD BAD BLOCK") == 1) {
                               dp->di_size = sblock.fs_fsize;
                               dp->di_mode = IFREG|0600;
                               inodirty();
                       } else if (ftypeok(dp) == 0)
                               goto unknown;
                       n_files++;
                       lncntp[inumber] = dp->di_nlink;
                       if (dp->di_nlink <= 0) {
                               zlnp = (struct zlncnt *)malloc(sizeof *zlnp);
                               if (zlnp == NULL) {
                                       pfatal("LINK COUNT TABLE OVERFLOW");
                                       if (reply("CONTINUE") == 0)
                                               errexit("");
                               } else {
                                       zlnp->zlncnt = inumber;
                                       zlnp->next = zlnhead;
                                       zlnhead = zlnp;
                               }
                       }
                       statemap[inumber] = DIRCT(dp) ? DSTATE : FSTATE;
                       badblk = dupblk = 0; maxblk = 0;
                       idesc.id_number = inumber;
                       (void)ckinode(dp, &idesc);
                       idesc.id_entryno *= btodb(sblock.fs_fsize);
                       if (dp->di_blocks != idesc.id_entryno) {
                               pwarn("INCORRECT BLOCK COUNT I=%u (%ld should be %ld)",
                                   inumber, dp->di_blocks, idesc.id_entryno);
                               if (preen)
                                       printf(" (CORRECTED)\n");
                               else if (reply("CORRECT") == 0)
                                       continue;
                               dp->di_blocks = idesc.id_entryno;
                               inodirty();
                       }
                       continue;
       unknown:
                       pfatal("UNKNOWN FILE TYPE I=%u", inumber);
                       if (reply("CLEAR") == 1) {
                               zapino(dp);
                               inodirty();
                       }
               }
       }
}

pass1check(idesc)
       register struct inodesc *idesc;
{
       int res = KEEPON;
       int anyout, nfrags;
       daddr_t blkno = idesc->id_blkno;
       register struct dups *dlp;
       struct dups *new;

       if ((anyout = outrange(blkno, idesc->id_numfrags)) != 0) {
               blkerr(idesc->id_number, "BAD", blkno);
               if (++badblk >= MAXBAD) {
                       pwarn("EXCESSIVE BAD BLKS I=%u",
                               idesc->id_number);
                       if (preen)
                               printf(" (SKIPPING)\n");
                       else if (reply("CONTINUE") == 0)
                               errexit("");
                       return (STOP);
               }
       }
       for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
               if (anyout && outrange(blkno, 1)) {
                       res = SKIP;
               } else if (!getbmap(blkno)) {
                       n_blks++;
                       setbmap(blkno);
               } else {
                       blkerr(idesc->id_number, "DUP", blkno);
                       if (++dupblk >= MAXDUP) {
                               pwarn("EXCESSIVE DUP BLKS I=%u",
                                       idesc->id_number);
                               if (preen)
                                       printf(" (SKIPPING)\n");
                               else if (reply("CONTINUE") == 0)
                                       errexit("");
                               return (STOP);
                       }
                       new = (struct dups *)malloc(sizeof(struct dups));
                       if (new == NULL) {
                               pfatal("DUP TABLE OVERFLOW.");
                               if (reply("CONTINUE") == 0)
                                       errexit("");
                               return (STOP);
                       }
                       new->dup = blkno;
                       if (muldup == 0) {
                               duplist = muldup = new;
                               new->next = 0;
                       } else {
                               new->next = muldup->next;
                               muldup->next = new;
                       }
                       for (dlp = duplist; dlp != muldup; dlp = dlp->next)
                               if (dlp->dup == blkno)
                                       break;
                       if (dlp == muldup && dlp->dup != blkno)
                               muldup = new;
               }
               /*
                * count the number of blocks found in id_entryno
                */
               idesc->id_entryno++;
       }
       return (res);
}