Home | History | Annotate | Line # | Download | only in fsck_ffs
pass4.c revision 1.25.14.1
      1  1.25.14.1    bouyer /*	$NetBSD: pass4.c,v 1.25.14.1 2011/01/20 14:24:54 bouyer Exp $	*/
      2        1.9       cgd 
      3        1.1       cgd /*
      4        1.6   mycroft  * Copyright (c) 1980, 1986, 1993
      5        1.6   mycroft  *	The Regents of the University of California.  All rights reserved.
      6        1.1       cgd  *
      7        1.1       cgd  * Redistribution and use in source and binary forms, with or without
      8        1.1       cgd  * modification, are permitted provided that the following conditions
      9        1.1       cgd  * are met:
     10        1.1       cgd  * 1. Redistributions of source code must retain the above copyright
     11        1.1       cgd  *    notice, this list of conditions and the following disclaimer.
     12        1.1       cgd  * 2. Redistributions in binary form must reproduce the above copyright
     13        1.1       cgd  *    notice, this list of conditions and the following disclaimer in the
     14        1.1       cgd  *    documentation and/or other materials provided with the distribution.
     15       1.18       agc  * 3. Neither the name of the University nor the names of its contributors
     16        1.1       cgd  *    may be used to endorse or promote products derived from this software
     17        1.1       cgd  *    without specific prior written permission.
     18        1.1       cgd  *
     19        1.1       cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     20        1.1       cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     21        1.1       cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     22        1.1       cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     23        1.1       cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     24        1.1       cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     25        1.1       cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     26        1.1       cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     27        1.1       cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     28        1.1       cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     29        1.1       cgd  * SUCH DAMAGE.
     30        1.1       cgd  */
     31        1.1       cgd 
     32       1.12     lukem #include <sys/cdefs.h>
     33        1.1       cgd #ifndef lint
     34        1.9       cgd #if 0
     35       1.13     lukem static char sccsid[] = "@(#)pass4.c	8.4 (Berkeley) 4/28/95";
     36        1.9       cgd #else
     37  1.25.14.1    bouyer __RCSID("$NetBSD: pass4.c,v 1.25.14.1 2011/01/20 14:24:54 bouyer Exp $");
     38        1.9       cgd #endif
     39        1.1       cgd #endif /* not lint */
     40        1.1       cgd 
     41        1.1       cgd #include <sys/param.h>
     42        1.5       cgd #include <sys/time.h>
     43       1.13     lukem 
     44  1.25.14.1    bouyer #include <ufs/ufs/ufs_bswap.h>
     45        1.6   mycroft #include <ufs/ufs/dinode.h>
     46        1.6   mycroft #include <ufs/ffs/fs.h>
     47  1.25.14.1    bouyer #include <ufs/ffs/ffs_extern.h>
     48       1.13     lukem 
     49       1.13     lukem #include <err.h>
     50       1.14     lukem #include <stdlib.h>
     51        1.1       cgd #include <string.h>
     52       1.10  christos 
     53       1.11  christos #include "fsutil.h"
     54        1.1       cgd #include "fsck.h"
     55        1.8       cgd #include "extern.h"
     56        1.1       cgd 
     57        1.8       cgd void
     58       1.21   xtraeme pass4(void)
     59        1.1       cgd {
     60       1.12     lukem 	ino_t inumber;
     61       1.12     lukem 	struct zlncnt *zlnp;
     62       1.17      fvdl 	union dinode *dp;
     63        1.1       cgd 	struct inodesc idesc;
     64       1.17      fvdl 	int n, i, cg;
     65       1.17      fvdl 	struct inostat *info;
     66        1.1       cgd 
     67        1.7   mycroft 	memset(&idesc, 0, sizeof(struct inodesc));
     68        1.1       cgd 	idesc.id_type = ADDR;
     69        1.1       cgd 	idesc.id_func = pass4check;
     70       1.17      fvdl 
     71       1.17      fvdl 	for (cg = 0; cg < sblock->fs_ncg; cg++) {
     72       1.15     lukem 		if (got_siginfo) {
     73       1.15     lukem 			fprintf(stderr,
     74       1.15     lukem 			    "%s: phase 4: cyl group %d of %d (%d%%)\n",
     75       1.17      fvdl 			    cdevname(), cg, sblock->fs_ncg,
     76       1.17      fvdl 			    cg * 100 / sblock->fs_ncg);
     77       1.15     lukem 			got_siginfo = 0;
     78       1.15     lukem 		}
     79       1.20  christos #ifdef PROGRESS
     80       1.19  christos 		progress_bar(cdevname(), preen ? NULL : "phase 4",
     81       1.19  christos 			    cg, sblock->fs_ncg);
     82       1.20  christos #endif /* PROGRESS */
     83       1.17      fvdl 		inumber = cg * sblock->fs_ipg;
     84       1.17      fvdl 		for (i = 0; i < inostathead[cg].il_numalloced; i++, inumber++) {
     85       1.17      fvdl 			if (inumber < ROOTINO)
     86       1.17      fvdl 				continue;
     87  1.25.14.1    bouyer 			dp = ginode(inumber);
     88       1.17      fvdl 			info = inoinfo(inumber);
     89       1.17      fvdl 			idesc.id_number = inumber;
     90  1.25.14.1    bouyer 			idesc.id_uid = iswap32(DIP(dp, uid));
     91  1.25.14.1    bouyer 			idesc.id_gid = iswap32(DIP(dp, gid));
     92       1.17      fvdl 			switch (info->ino_state) {
     93       1.17      fvdl 			case FSTATE:
     94       1.17      fvdl 			case DFOUND:
     95       1.17      fvdl 				n = info->ino_linkcnt;
     96       1.17      fvdl 				if (n) {
     97       1.25    simonb 					if (is_journal_inode(inumber)) {
     98       1.25    simonb 						if (debug)
     99       1.25    simonb 							printf(
    100       1.25    simonb     "skipping unreferenced journal inode %" PRId64 "\n", inumber);
    101       1.25    simonb 						break;
    102  1.25.14.1    bouyer 					} else if (is_quota_inode(inumber)) {
    103  1.25.14.1    bouyer 						if (debug)
    104  1.25.14.1    bouyer 							printf(
    105  1.25.14.1    bouyer     "skipping unreferenced quota inode %" PRId64 "\n", inumber);
    106  1.25.14.1    bouyer 						break;
    107       1.25    simonb 					} else {
    108       1.25    simonb 						adjust(&idesc, (short)n);
    109       1.25    simonb 					}
    110       1.17      fvdl 					break;
    111       1.17      fvdl 				}
    112        1.1       cgd 				for (zlnp = zlnhead; zlnp; zlnp = zlnp->next)
    113        1.1       cgd 					if (zlnp->zlncnt == inumber) {
    114        1.1       cgd 						zlnp->zlncnt = zlnhead->zlncnt;
    115        1.1       cgd 						zlnp = zlnhead;
    116        1.1       cgd 						zlnhead = zlnhead->next;
    117        1.1       cgd 						free((char *)zlnp);
    118        1.1       cgd 						clri(&idesc, "UNREF", 1);
    119        1.1       cgd 						break;
    120        1.1       cgd 					}
    121       1.17      fvdl 				break;
    122       1.17      fvdl 
    123       1.17      fvdl 			case DSTATE:
    124       1.17      fvdl 				clri(&idesc, "UNREF", 1);
    125       1.17      fvdl 				break;
    126       1.17      fvdl 
    127       1.17      fvdl 			case DCLEAR:
    128       1.17      fvdl 				if (DIP(dp, size) == 0) {
    129       1.17      fvdl 					clri(&idesc, "ZERO LENGTH", 1);
    130       1.17      fvdl 					break;
    131       1.17      fvdl 				}
    132       1.17      fvdl 				/* fall through */
    133       1.17      fvdl 			case FCLEAR:
    134       1.17      fvdl 				clri(&idesc, "BAD/DUP", 1);
    135       1.17      fvdl 				break;
    136        1.1       cgd 
    137       1.17      fvdl 			case USTATE:
    138        1.1       cgd 				break;
    139       1.17      fvdl 
    140       1.17      fvdl 			default:
    141       1.24  christos 				errexit("BAD STATE %d FOR INODE I=%llu",
    142       1.22  christos 				    info->ino_state,
    143       1.22  christos 				    (unsigned long long)inumber);
    144        1.1       cgd 			}
    145        1.1       cgd 		}
    146        1.1       cgd 	}
    147       1.20  christos #ifdef PROGRESS
    148       1.23       apb 	if (!preen)
    149       1.19  christos 		progress_done();
    150       1.20  christos #endif /* PROGRESS */
    151        1.1       cgd }
    152        1.1       cgd 
    153        1.8       cgd int
    154       1.21   xtraeme pass4check(struct inodesc *idesc)
    155        1.1       cgd {
    156       1.12     lukem 	struct dups *dlp;
    157  1.25.14.1    bouyer 	int cg, nfrags, res = KEEPON;
    158       1.16      fvdl 	daddr_t blkno = idesc->id_blkno;
    159  1.25.14.1    bouyer 	struct cg *cgp = cgrp;
    160  1.25.14.1    bouyer 
    161  1.25.14.1    bouyer 	cg = dtog(sblock, blkno);
    162  1.25.14.1    bouyer 	getblk(&cgblk, cgtod(sblock, cg), sblock->fs_cgsize);
    163  1.25.14.1    bouyer 	memcpy(cgp, cgblk.b_un.b_cg, sblock->fs_cgsize);
    164  1.25.14.1    bouyer 	if ((doswap && !needswap) || (!doswap && needswap))
    165  1.25.14.1    bouyer 		ffs_cg_swap(cgblk.b_un.b_cg, cgp, sblock);
    166  1.25.14.1    bouyer 	if (!cg_chkmagic(cgp, 0)) {
    167  1.25.14.1    bouyer 		pwarn("CG %d: ALLOCBLK: BAD MAGIC NUMBER\n", cg);
    168  1.25.14.1    bouyer 		cgp = NULL;
    169  1.25.14.1    bouyer 	}
    170        1.1       cgd 
    171        1.1       cgd 	for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
    172        1.1       cgd 		if (chkrange(blkno, 1)) {
    173        1.1       cgd 			res = SKIP;
    174        1.1       cgd 		} else if (testbmap(blkno)) {
    175        1.1       cgd 			for (dlp = duplist; dlp; dlp = dlp->next) {
    176        1.1       cgd 				if (dlp->dup != blkno)
    177        1.1       cgd 					continue;
    178        1.1       cgd 				dlp->dup = duplist->dup;
    179        1.1       cgd 				dlp = duplist;
    180        1.1       cgd 				duplist = duplist->next;
    181        1.1       cgd 				free((char *)dlp);
    182        1.1       cgd 				break;
    183        1.1       cgd 			}
    184        1.1       cgd 			if (dlp == 0) {
    185        1.1       cgd 				clrbmap(blkno);
    186  1.25.14.1    bouyer 				if (cgp)
    187  1.25.14.1    bouyer 					setbit(cg_blksfree(cgp, 0),
    188  1.25.14.1    bouyer 					    dtogd(sblock, blkno));
    189  1.25.14.1    bouyer 
    190        1.1       cgd 				n_blks--;
    191  1.25.14.1    bouyer 				update_uquot(idesc->id_number, idesc->id_uid,
    192  1.25.14.1    bouyer 				    idesc->id_gid, -btodb(sblock->fs_fsize), 0);
    193  1.25.14.1    bouyer 				if (idesc->id_numfrags != sblock->fs_frag &&
    194  1.25.14.1    bouyer 				    cgp) {
    195  1.25.14.1    bouyer 					cgp->cg_cs.cs_nffree ++;
    196  1.25.14.1    bouyer 					sblock->fs_cstotal.cs_nffree ++;
    197  1.25.14.1    bouyer 					sblock->fs_cs(fs, cg).cs_nffree ++;
    198  1.25.14.1    bouyer 				}
    199        1.1       cgd 			}
    200        1.1       cgd 		}
    201        1.1       cgd 	}
    202  1.25.14.1    bouyer 	if (cgp && res != SKIP && idesc->id_numfrags == sblock->fs_frag) {
    203  1.25.14.1    bouyer 		cgp->cg_cs.cs_nbfree++;
    204  1.25.14.1    bouyer 		sblock->fs_cstotal.cs_nbfree++;
    205  1.25.14.1    bouyer 		sblock->fs_cs(fs, cg).cs_nbfree++;
    206  1.25.14.1    bouyer 		ffs_clusteracct(sblock, cgp,
    207  1.25.14.1    bouyer 		    fragstoblks(sblock, dtogd(sblock, idesc->id_blkno)), 1);
    208  1.25.14.1    bouyer 	}
    209  1.25.14.1    bouyer 	sbdirty();
    210  1.25.14.1    bouyer 	cgdirty();
    211        1.1       cgd 	return (res);
    212        1.1       cgd }
    213