/*      $OpenBSD: pass4.c,v 1.10 2015/01/16 06:39:57 deraadt Exp $      */
/*      $NetBSD: pass4.c,v 1.2 1997/09/14 14:27:29 lukem Exp $  */

/*
 * Copyright (c) 1997 Manuel Bouyer.
 * Copyright (c) 1980, 1986, 1993
 *      The Regents of the University of California.  All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. Neither the name of the University nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 */

#include <sys/param.h>  /* isset clrbit */
#include <sys/time.h>
#include <ufs/ext2fs/ext2fs_dinode.h>
#include <ufs/ext2fs/ext2fs.h>
#include <stdlib.h>
#include <string.h>

#include "fsutil.h"
#include "fsck.h"
#include "extern.h"

void
pass4(void)
{
        ino_t inumber;
        struct zlncnt *zlnp;
        struct ext2fs_dinode *dp;
        struct inodesc idesc;
        int n;

        memset(&idesc, 0, sizeof(struct inodesc));
        idesc.id_type = ADDR;
        idesc.id_func = pass4check;
        for (inumber = EXT2_ROOTINO; inumber <= lastino; inumber++) {
                if (inumber < EXT2_FIRSTINO && inumber > EXT2_ROOTINO)
                        continue;
                idesc.id_number = inumber;
                switch (statemap[inumber]) {

                case FSTATE:
                case DFOUND:
                        n = lncntp[inumber];
                        if (n)
                                adjust(&idesc, (short)n);
                        else {
                                for (zlnp = zlnhead; zlnp; zlnp = zlnp->next)
                                        if (zlnp->zlncnt == inumber) {
                                                zlnp->zlncnt = zlnhead->zlncnt;
                                                zlnp = zlnhead;
                                                zlnhead = zlnhead->next;
                                                free((char *)zlnp);
                                                clri(&idesc, "UNREF", 1);
                                                break;
                                        }
                        }
                        break;

                case DSTATE:
                        clri(&idesc, "UNREF", 1);
                        break;

                case DCLEAR:
                        dp = ginode(inumber);
                        if (inosize(dp) == 0) {
                                clri(&idesc, "ZERO LENGTH", 1);
                                break;
                        }
                        /* fall through */
                case FCLEAR:
                        clri(&idesc, "BAD/DUP", 1);
                        break;

                case USTATE:
                        break;

                default:
                        errexit("BAD STATE %d FOR INODE I=%llu\n",
                            statemap[inumber], (unsigned long long)inumber);
                }
        }
}

int
pass4check(struct inodesc *idesc)
{
        struct dups *dlp;
        int nfrags, res = KEEPON;
        daddr32_t blkno = idesc->id_blkno;

        for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
                if (chkrange(blkno, 1)) {
                        res = SKIP;
                } else if (testbmap(blkno)) {
                        for (dlp = duplist; dlp; dlp = dlp->next) {
                                if (dlp->dup != blkno)
                                        continue;
                                dlp->dup = duplist->dup;
                                dlp = duplist;
                                duplist = duplist->next;
                                free((char *)dlp);
                                break;
                        }
                        if (dlp == 0) {
                                clrbmap(blkno);
                                n_blks--;
                        }
                }
        }
        return (res);
}