Home | History | Annotate | Line # | Download | only in fsck_ext2fs
      1  1.10    bouyer /*	$NetBSD: pass4.c,v 1.10 2009/10/19 18:41:08 bouyer Exp $	*/
      2   1.1    bouyer 
      3   1.1    bouyer /*
      4   1.1    bouyer  * Copyright (c) 1980, 1986, 1993
      5   1.1    bouyer  *	The Regents of the University of California.  All rights reserved.
      6   1.1    bouyer  *
      7   1.1    bouyer  * Redistribution and use in source and binary forms, with or without
      8   1.1    bouyer  * modification, are permitted provided that the following conditions
      9   1.1    bouyer  * are met:
     10   1.1    bouyer  * 1. Redistributions of source code must retain the above copyright
     11   1.1    bouyer  *    notice, this list of conditions and the following disclaimer.
     12   1.1    bouyer  * 2. Redistributions in binary form must reproduce the above copyright
     13   1.1    bouyer  *    notice, this list of conditions and the following disclaimer in the
     14   1.1    bouyer  *    documentation and/or other materials provided with the distribution.
     15   1.3       agc  * 3. Neither the name of the University nor the names of its contributors
     16   1.3       agc  *    may be used to endorse or promote products derived from this software
     17   1.3       agc  *    without specific prior written permission.
     18   1.3       agc  *
     19   1.3       agc  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     20   1.3       agc  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     21   1.3       agc  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     22   1.3       agc  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     23   1.3       agc  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     24   1.3       agc  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     25   1.3       agc  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     26   1.3       agc  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     27   1.3       agc  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     28   1.3       agc  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     29   1.3       agc  * SUCH DAMAGE.
     30   1.3       agc  */
     31   1.3       agc 
     32   1.3       agc /*
     33   1.3       agc  * Copyright (c) 1997 Manuel Bouyer.
     34   1.3       agc  *
     35   1.3       agc  * Redistribution and use in source and binary forms, with or without
     36   1.3       agc  * modification, are permitted provided that the following conditions
     37   1.3       agc  * are met:
     38   1.3       agc  * 1. Redistributions of source code must retain the above copyright
     39   1.3       agc  *    notice, this list of conditions and the following disclaimer.
     40   1.3       agc  * 2. Redistributions in binary form must reproduce the above copyright
     41   1.3       agc  *    notice, this list of conditions and the following disclaimer in the
     42   1.3       agc  *    documentation and/or other materials provided with the distribution.
     43   1.1    bouyer  *
     44   1.5    bouyer  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
     45   1.5    bouyer  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
     46   1.5    bouyer  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
     47   1.5    bouyer  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
     48   1.5    bouyer  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
     49   1.5    bouyer  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
     50   1.5    bouyer  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
     51   1.5    bouyer  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
     52   1.5    bouyer  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
     53   1.5    bouyer  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
     54   1.1    bouyer  */
     55   1.1    bouyer 
     56   1.2     lukem #include <sys/cdefs.h>
     57   1.1    bouyer #ifndef lint
     58   1.1    bouyer #if 0
     59   1.1    bouyer static char sccsid[] = "@(#)pass4.c	8.1 (Berkeley) 6/5/93";
     60   1.1    bouyer #else
     61  1.10    bouyer __RCSID("$NetBSD: pass4.c,v 1.10 2009/10/19 18:41:08 bouyer Exp $");
     62   1.1    bouyer #endif
     63   1.1    bouyer #endif /* not lint */
     64   1.1    bouyer 
     65   1.1    bouyer #include <sys/param.h>
     66   1.1    bouyer #include <sys/time.h>
     67   1.1    bouyer #include <ufs/ext2fs/ext2fs_dinode.h>
     68   1.1    bouyer #include <ufs/ext2fs/ext2fs.h>
     69   1.1    bouyer #include <stdlib.h>
     70   1.1    bouyer #include <string.h>
     71   1.1    bouyer 
     72   1.1    bouyer #include "fsutil.h"
     73   1.1    bouyer #include "fsck.h"
     74   1.1    bouyer #include "extern.h"
     75   1.1    bouyer 
     76   1.1    bouyer void
     77   1.6   xtraeme pass4(void)
     78   1.1    bouyer {
     79   1.2     lukem 	ino_t inumber;
     80   1.2     lukem 	struct zlncnt *zlnp;
     81   1.1    bouyer 	struct ext2fs_dinode *dp;
     82   1.1    bouyer 	struct inodesc idesc;
     83   1.1    bouyer 	int n;
     84   1.1    bouyer 
     85   1.1    bouyer 	memset(&idesc, 0, sizeof(struct inodesc));
     86   1.1    bouyer 	idesc.id_type = ADDR;
     87   1.1    bouyer 	idesc.id_func = pass4check;
     88   1.1    bouyer 	for (inumber = EXT2_ROOTINO; inumber <= lastino; inumber++) {
     89   1.1    bouyer 		if (inumber < EXT2_FIRSTINO && inumber > EXT2_ROOTINO)
     90   1.1    bouyer 			continue;
     91   1.1    bouyer 		idesc.id_number = inumber;
     92   1.1    bouyer 		switch (statemap[inumber]) {
     93   1.1    bouyer 
     94   1.1    bouyer 		case FSTATE:
     95   1.1    bouyer 		case DFOUND:
     96   1.1    bouyer 			n = lncntp[inumber];
     97   1.1    bouyer 			if (n)
     98   1.1    bouyer 				adjust(&idesc, (short)n);
     99   1.1    bouyer 			else {
    100   1.1    bouyer 				for (zlnp = zlnhead; zlnp; zlnp = zlnp->next)
    101   1.1    bouyer 					if (zlnp->zlncnt == inumber) {
    102   1.1    bouyer 						zlnp->zlncnt = zlnhead->zlncnt;
    103   1.1    bouyer 						zlnp = zlnhead;
    104   1.1    bouyer 						zlnhead = zlnhead->next;
    105   1.1    bouyer 						free((char *)zlnp);
    106   1.1    bouyer 						clri(&idesc, "UNREF", 1);
    107   1.1    bouyer 						break;
    108   1.1    bouyer 					}
    109   1.1    bouyer 			}
    110   1.1    bouyer 			break;
    111   1.1    bouyer 
    112   1.1    bouyer 		case DSTATE:
    113   1.1    bouyer 			clri(&idesc, "UNREF", 1);
    114   1.1    bouyer 			break;
    115   1.1    bouyer 
    116   1.1    bouyer 		case DCLEAR:
    117   1.1    bouyer 			dp = ginode(inumber);
    118   1.7        ws 			if (inosize(dp) == 0) {
    119   1.1    bouyer 				clri(&idesc, "ZERO LENGTH", 1);
    120   1.1    bouyer 				break;
    121   1.1    bouyer 			}
    122   1.1    bouyer 			/* fall through */
    123   1.1    bouyer 		case FCLEAR:
    124   1.1    bouyer 			clri(&idesc, "BAD/DUP", 1);
    125   1.1    bouyer 			break;
    126   1.1    bouyer 
    127   1.1    bouyer 		case USTATE:
    128   1.1    bouyer 			break;
    129   1.1    bouyer 
    130   1.1    bouyer 		default:
    131   1.9     lukem 			errexit("BAD STATE %d FOR INODE I=%llu",
    132   1.8  christos 			    statemap[inumber], (unsigned long long)inumber);
    133   1.1    bouyer 		}
    134   1.1    bouyer 	}
    135   1.1    bouyer }
    136   1.1    bouyer 
    137   1.1    bouyer int
    138   1.6   xtraeme pass4check(struct inodesc *idesc)
    139   1.1    bouyer {
    140   1.2     lukem 	struct dups *dlp;
    141   1.1    bouyer 	int nfrags, res = KEEPON;
    142   1.1    bouyer 	daddr_t blkno = idesc->id_blkno;
    143   1.1    bouyer 
    144   1.1    bouyer 	for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
    145   1.1    bouyer 		if (chkrange(blkno, 1)) {
    146   1.1    bouyer 			res = SKIP;
    147   1.1    bouyer 		} else if (testbmap(blkno)) {
    148   1.1    bouyer 			for (dlp = duplist; dlp; dlp = dlp->next) {
    149   1.1    bouyer 				if (dlp->dup != blkno)
    150   1.1    bouyer 					continue;
    151   1.1    bouyer 				dlp->dup = duplist->dup;
    152   1.1    bouyer 				dlp = duplist;
    153   1.1    bouyer 				duplist = duplist->next;
    154   1.1    bouyer 				free((char *)dlp);
    155   1.1    bouyer 				break;
    156   1.1    bouyer 			}
    157   1.1    bouyer 			if (dlp == 0) {
    158   1.1    bouyer 				clrbmap(blkno);
    159   1.1    bouyer 				n_blks--;
    160   1.1    bouyer 			}
    161   1.1    bouyer 		}
    162   1.1    bouyer 	}
    163   1.1    bouyer 	return (res);
    164   1.1    bouyer }
    165