Home | History | Annotate | Line # | Download | only in fsck_ffs
pass5.c revision 1.55.2.1
      1  1.55.2.1    martin /*	$NetBSD: pass5.c,v 1.55.2.1 2023/05/13 11:51:14 martin Exp $	*/
      2      1.13       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.37       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.17     lukem #include <sys/cdefs.h>
     33       1.1       cgd #ifndef lint
     34      1.13       cgd #if 0
     35      1.18     lukem static char sccsid[] = "@(#)pass5.c	8.9 (Berkeley) 4/28/95";
     36      1.13       cgd #else
     37  1.55.2.1    martin __RCSID("$NetBSD: pass5.c,v 1.55.2.1 2023/05/13 11:51:14 martin Exp $");
     38      1.13       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.18     lukem 
     44       1.6   mycroft #include <ufs/ufs/dinode.h>
     45       1.6   mycroft #include <ufs/ffs/fs.h>
     46      1.19    bouyer #include <ufs/ffs/ffs_extern.h>
     47      1.19    bouyer #include <ufs/ufs/ufs_bswap.h>
     48      1.18     lukem 
     49      1.18     lukem #include <err.h>
     50       1.1       cgd #include <string.h>
     51      1.50  dholland #include <stdlib.h>
     52      1.15  christos 
     53      1.16  christos #include "fsutil.h"
     54       1.1       cgd #include "fsck.h"
     55      1.10       cgd #include "extern.h"
     56       1.1       cgd 
     57      1.45   xtraeme void print_bmap(u_char *,u_int32_t);
     58      1.19    bouyer 
     59      1.10       cgd void
     60      1.34      fvdl pass5(void)
     61       1.1       cgd {
     62  1.55.2.1    martin 	int blk, frags, basesize, sumsize, mapsize, cssize;
     63      1.21      fvdl 	int inomapsize, blkmapsize;
     64  1.55.2.1    martin 	uint32_t c;
     65      1.19    bouyer 	struct fs *fs = sblock;
     66      1.32      fvdl 	daddr_t dbase, dmax;
     67      1.32      fvdl 	daddr_t d;
     68      1.21      fvdl 	long i, j, k;
     69       1.1       cgd 	struct csum *cs;
     70      1.34      fvdl 	struct csum_total cstotal;
     71      1.26   thorpej 	struct inodesc idesc[4];
     72       1.1       cgd 	char buf[MAXBSIZE];
     73      1.17     lukem 	struct cg *newcg = (struct cg *)buf;
     74      1.39       dbj 	struct ocg *ocg = (struct ocg *)buf;
     75      1.38    itojun 	struct cg *cg = cgrp, *ncg;
     76      1.34      fvdl 	struct inostat *info;
     77      1.38    itojun 	u_int32_t ncgsize;
     78       1.1       cgd 
     79      1.51  dholland 	inoinfo(UFS_WINO)->ino_state = USTATE;
     80       1.7   mycroft 	memset(newcg, 0, (size_t)fs->fs_cgsize);
     81       1.1       cgd 	newcg->cg_niblk = fs->fs_ipg;
     82      1.12   mycroft 	if (cvtlevel >= 3) {
     83       1.6   mycroft 		if (fs->fs_maxcontig < 2 && fs->fs_contigsumsize > 0) {
     84       1.6   mycroft 			if (preen)
     85       1.6   mycroft 				pwarn("DELETING CLUSTERING MAPS\n");
     86       1.6   mycroft 			if (preen || reply("DELETE CLUSTERING MAPS")) {
     87       1.6   mycroft 				fs->fs_contigsumsize = 0;
     88       1.6   mycroft 				doinglevel1 = 1;
     89       1.6   mycroft 				sbdirty();
     90       1.6   mycroft 			}
     91       1.6   mycroft 		}
     92       1.6   mycroft 		if (fs->fs_maxcontig > 1) {
     93      1.46  christos 			const char *doit = NULL;
     94       1.6   mycroft 
     95       1.6   mycroft 			if (fs->fs_contigsumsize < 1) {
     96       1.6   mycroft 				doit = "CREAT";
     97       1.6   mycroft 			} else if (fs->fs_contigsumsize < fs->fs_maxcontig &&
     98       1.6   mycroft 				   fs->fs_contigsumsize < FS_MAXCONTIG) {
     99       1.6   mycroft 				doit = "EXPAND";
    100       1.6   mycroft 			}
    101       1.6   mycroft 			if (doit) {
    102       1.6   mycroft 				i = fs->fs_contigsumsize;
    103       1.6   mycroft 				fs->fs_contigsumsize =
    104       1.6   mycroft 				    MIN(fs->fs_maxcontig, FS_MAXCONTIG);
    105      1.49  christos 				if (CGSIZE(fs) > (uint32_t)fs->fs_bsize) {
    106       1.6   mycroft 					pwarn("CANNOT %s CLUSTER MAPS\n", doit);
    107       1.6   mycroft 					fs->fs_contigsumsize = i;
    108       1.6   mycroft 				} else if (preen ||
    109       1.6   mycroft 				    reply("CREATE CLUSTER MAPS")) {
    110       1.6   mycroft 					if (preen)
    111       1.6   mycroft 						pwarn("%sING CLUSTER MAPS\n",
    112       1.6   mycroft 						    doit);
    113      1.53  dholland 					ncgsize = ffs_fragroundup(fs, CGSIZE(fs));
    114      1.38    itojun 					ncg = realloc(cgrp, ncgsize);
    115      1.38    itojun 					if (ncg == NULL)
    116      1.48  christos 						errexit(
    117      1.21      fvdl 						"cannot reallocate cg space");
    118      1.38    itojun 					cg = cgrp = ncg;
    119      1.38    itojun 					fs->fs_cgsize = ncgsize;
    120       1.6   mycroft 					doinglevel1 = 1;
    121       1.6   mycroft 					sbdirty();
    122       1.6   mycroft 				}
    123       1.6   mycroft 			}
    124       1.6   mycroft 		}
    125       1.6   mycroft 	}
    126      1.34      fvdl 	basesize = &newcg->cg_space[0] - (u_char *)(&newcg->cg_firstfield);
    127      1.36      fvdl 	cssize = (u_char *)&cstotal.cs_spare[0] - (u_char *)&cstotal.cs_ndir;
    128      1.39       dbj 	sumsize = 0;
    129      1.34      fvdl 	if (is_ufs2) {
    130      1.34      fvdl 		newcg->cg_iusedoff = basesize;
    131      1.34      fvdl 	} else {
    132      1.34      fvdl 		/*
    133      1.34      fvdl 		 * We reserve the space for the old rotation summary
    134      1.34      fvdl 		 * tables for the benefit of old kernels, but do not
    135      1.34      fvdl 		 * maintain them in modern kernels. In time, they can
    136      1.34      fvdl 		 * go away.
    137      1.34      fvdl 		 */
    138      1.34      fvdl 		newcg->cg_old_btotoff = basesize;
    139      1.34      fvdl 		newcg->cg_old_boff = newcg->cg_old_btotoff +
    140      1.34      fvdl 		    fs->fs_old_cpg * sizeof(int32_t);
    141      1.34      fvdl 		newcg->cg_iusedoff = newcg->cg_old_boff +
    142      1.34      fvdl 		    fs->fs_old_cpg * fs->fs_old_nrpos * sizeof(u_int16_t);
    143      1.34      fvdl 		memset(&newcg->cg_space[0], 0, newcg->cg_iusedoff - basesize);
    144      1.34      fvdl 	}
    145      1.34      fvdl 	inomapsize = howmany(fs->fs_ipg, CHAR_BIT);
    146      1.34      fvdl 	newcg->cg_freeoff = newcg->cg_iusedoff + inomapsize;
    147      1.34      fvdl 	blkmapsize = howmany(fs->fs_fpg, CHAR_BIT);
    148      1.34      fvdl 	newcg->cg_nextfreeoff = newcg->cg_freeoff + blkmapsize;
    149      1.34      fvdl 	if (fs->fs_contigsumsize > 0) {
    150      1.34      fvdl 		newcg->cg_clustersumoff = newcg->cg_nextfreeoff -
    151      1.34      fvdl 		    sizeof(u_int32_t);
    152      1.39       dbj 		if (isappleufs) {
    153      1.39       dbj 			/* Apple PR2216969 gives rationale for this change.
    154      1.39       dbj 			 * I believe they were mistaken, but we need to
    155      1.39       dbj 			 * duplicate it for compatibility.  -- dbj (at) NetBSD.org
    156      1.39       dbj 			 */
    157      1.39       dbj 			newcg->cg_clustersumoff += sizeof(u_int32_t);
    158      1.39       dbj 		}
    159      1.34      fvdl 		newcg->cg_clustersumoff =
    160      1.34      fvdl 		    roundup(newcg->cg_clustersumoff, sizeof(u_int32_t));
    161      1.34      fvdl 		newcg->cg_clusteroff = newcg->cg_clustersumoff +
    162      1.34      fvdl 		    (fs->fs_contigsumsize + 1) * sizeof(u_int32_t);
    163      1.34      fvdl 		newcg->cg_nextfreeoff = newcg->cg_clusteroff +
    164      1.54  dholland 		    howmany(ffs_fragstoblks(fs, fs->fs_fpg), CHAR_BIT);
    165       1.1       cgd 	}
    166      1.34      fvdl 	newcg->cg_magic = CG_MAGIC;
    167      1.34      fvdl 	mapsize = newcg->cg_nextfreeoff - newcg->cg_iusedoff;
    168      1.39       dbj 	if (!is_ufs2 && ((fs->fs_old_flags & FS_FLAGS_UPDATED) == 0)) {
    169      1.39       dbj 		switch ((int)fs->fs_old_postblformat) {
    170      1.39       dbj 
    171      1.39       dbj 		case FS_42POSTBLFMT:
    172      1.39       dbj 			basesize = (char *)(&ocg->cg_btot[0]) -
    173      1.39       dbj 			    (char *)(&ocg->cg_firstfield);
    174      1.39       dbj 			sumsize = &ocg->cg_iused[0] - (u_int8_t *)(&ocg->cg_btot[0]);
    175      1.39       dbj 			mapsize = &ocg->cg_free[howmany(fs->fs_fpg, NBBY)] -
    176      1.39       dbj 			    (u_char *)&ocg->cg_iused[0];
    177      1.39       dbj 			blkmapsize = howmany(fs->fs_fpg, NBBY);
    178      1.39       dbj 			inomapsize = &ocg->cg_free[0] - (u_char *)&ocg->cg_iused[0];
    179      1.39       dbj 			ocg->cg_magic = CG_MAGIC;
    180      1.39       dbj 			newcg->cg_magic = 0;
    181      1.39       dbj 			break;
    182      1.39       dbj 
    183      1.39       dbj 		case FS_DYNAMICPOSTBLFMT:
    184      1.39       dbj 			sumsize = newcg->cg_iusedoff - newcg->cg_old_btotoff;
    185      1.39       dbj 			break;
    186      1.39       dbj 
    187      1.39       dbj 		default:
    188      1.48  christos 			errexit("UNKNOWN ROTATIONAL TABLE FORMAT %d",
    189      1.39       dbj 			    fs->fs_old_postblformat);
    190      1.39       dbj 		}
    191      1.39       dbj 	}
    192       1.7   mycroft 	memset(&idesc[0], 0, sizeof idesc);
    193      1.26   thorpej 	for (i = 0; i < 4; i++) {
    194       1.1       cgd 		idesc[i].id_type = ADDR;
    195      1.34      fvdl 		if (!is_ufs2 && doinglevel2)
    196       1.6   mycroft 			idesc[i].id_fix = FIX;
    197       1.6   mycroft 	}
    198      1.34      fvdl 	memset(&cstotal, 0, sizeof(struct csum_total));
    199      1.54  dholland 	dmax = ffs_blknum(fs, fs->fs_size + fs->fs_frag - 1);
    200      1.34      fvdl 	for (d = fs->fs_size; d < dmax; d++)
    201      1.34      fvdl 		setbmap(d);
    202       1.1       cgd 	for (c = 0; c < fs->fs_ncg; c++) {
    203      1.29     lukem 		if (got_siginfo) {
    204      1.29     lukem 			fprintf(stderr,
    205      1.29     lukem 			    "%s: phase 5: cyl group %d of %d (%d%%)\n",
    206      1.29     lukem 			    cdevname(), c, fs->fs_ncg,
    207      1.29     lukem 			    c * 100 / fs->fs_ncg);
    208      1.29     lukem 			got_siginfo = 0;
    209      1.29     lukem 		}
    210      1.43  christos #ifdef PROGRESS
    211      1.42  christos 		progress_bar(cdevname(), preen ? NULL : "phase 5",
    212      1.42  christos 			    c, fs->fs_ncg);
    213      1.43  christos #endif /* PROGRESS */
    214       1.1       cgd 		getblk(&cgblk, cgtod(fs, c), fs->fs_cgsize);
    215      1.19    bouyer 		memcpy(cg, cgblk.b_un.b_cg, fs->fs_cgsize);
    216      1.19    bouyer 		if((doswap && !needswap) || (!doswap && needswap))
    217      1.34      fvdl 			ffs_cg_swap(cgblk.b_un.b_cg, cg, sblock);
    218      1.39       dbj 		if (!doinglevel1 && !cg_chkmagic(cg, 0))
    219      1.21      fvdl 			pfatal("CG %d: PASS5: BAD MAGIC NUMBER\n", c);
    220      1.19    bouyer 		if(doswap)
    221      1.19    bouyer 			cgdirty();
    222      1.26   thorpej 		/*
    223      1.26   thorpej 		 * While we have the disk head where we want it,
    224      1.26   thorpej 		 * write back the superblock to the spare at this
    225      1.26   thorpej 		 * cylinder group.
    226      1.26   thorpej 		 */
    227      1.55       chs 		if ((cvtlevel && sblk.b_dirty) || doswap || doing2ea || doing2noea) {
    228      1.26   thorpej 			bwrite(fswritefd, sblk.b_un.b_buf,
    229      1.52  dholland 			    FFS_FSBTODB(sblock, cgsblock(sblock, c)),
    230      1.26   thorpej 			    sblock->fs_sbsize);
    231      1.26   thorpej 		} else {
    232      1.55       chs 			int alt_ufs2ea = 0;
    233      1.55       chs 
    234      1.26   thorpej 			/*
    235      1.26   thorpej 			 * Read in the current alternate superblock,
    236      1.26   thorpej 			 * and compare it to the master.  If it's
    237      1.26   thorpej 			 * wrong, fix it up.
    238      1.26   thorpej 			 */
    239      1.26   thorpej 			getblk(&asblk, cgsblock(sblock, c), sblock->fs_sbsize);
    240      1.26   thorpej 			if (asblk.b_errs)
    241      1.26   thorpej 				pfatal("CG %d: UNABLE TO READ ALTERNATE "
    242      1.26   thorpej 				    "SUPERBLK\n", c);
    243      1.26   thorpej 			else {
    244      1.26   thorpej 				memmove(altsblock, asblk.b_un.b_fs,
    245      1.26   thorpej 				    sblock->fs_sbsize);
    246      1.26   thorpej 				if (needswap)
    247      1.27     lukem 					ffs_sb_swap(asblk.b_un.b_fs, altsblock);
    248      1.55       chs 				if (altsblock->fs_magic == FS_UFS2EA_MAGIC) {
    249      1.55       chs 					altsblock->fs_magic = FS_UFS2_MAGIC;
    250      1.55       chs 					alt_ufs2ea = 1;
    251      1.55       chs 				}
    252      1.26   thorpej 			}
    253      1.39       dbj 			sb_oldfscompat_write(sblock, sblocksave);
    254      1.55       chs 			if ((asblk.b_errs || cmpsblks(sblock, altsblock) ||
    255      1.55       chs 			     is_ufs2ea != alt_ufs2ea) &&
    256      1.55       chs 			    dofix(&idesc[3],
    257      1.26   thorpej 				   "ALTERNATE SUPERBLK(S) ARE INCORRECT")) {
    258      1.26   thorpej 				bwrite(fswritefd, sblk.b_un.b_buf,
    259      1.52  dholland 				    FFS_FSBTODB(sblock, cgsblock(sblock, c)),
    260      1.26   thorpej 				    sblock->fs_sbsize);
    261      1.26   thorpej 			}
    262      1.39       dbj 			sb_oldfscompat_read(sblock, 0);
    263      1.26   thorpej 		}
    264       1.1       cgd 		dbase = cgbase(fs, c);
    265       1.1       cgd 		dmax = dbase + fs->fs_fpg;
    266       1.1       cgd 		if (dmax > fs->fs_size)
    267       1.1       cgd 			dmax = fs->fs_size;
    268      1.39       dbj 		if (is_ufs2 || (fs->fs_old_flags & FS_FLAGS_UPDATED))
    269      1.39       dbj 			newcg->cg_time = cg->cg_time;
    270      1.34      fvdl 		newcg->cg_old_time = cg->cg_old_time;
    271       1.1       cgd 		newcg->cg_cgx = c;
    272       1.1       cgd 		newcg->cg_ndblk = dmax - dbase;
    273      1.34      fvdl 		if (!is_ufs2) {
    274      1.39       dbj 			if (c == fs->fs_ncg - 1) {
    275      1.39       dbj 				/* Avoid fighting old fsck for this value.  Its never used
    276      1.39       dbj 				 * outside of this check anyway.
    277      1.39       dbj 				 */
    278      1.39       dbj 				if ((fs->fs_old_flags & FS_FLAGS_UPDATED) == 0)
    279      1.39       dbj 					newcg->cg_old_ncyl = fs->fs_old_ncyl % fs->fs_old_cpg;
    280      1.39       dbj 				else
    281      1.39       dbj 					newcg->cg_old_ncyl = howmany(newcg->cg_ndblk,
    282      1.39       dbj 					    fs->fs_fpg / fs->fs_old_cpg);
    283      1.39       dbj 			} else
    284      1.34      fvdl 				newcg->cg_old_ncyl = fs->fs_old_cpg;
    285      1.34      fvdl 			newcg->cg_old_niblk = fs->fs_ipg;
    286      1.34      fvdl 			newcg->cg_niblk = 0;
    287      1.34      fvdl 		}
    288       1.6   mycroft 		if (fs->fs_contigsumsize > 0)
    289       1.6   mycroft 			newcg->cg_nclusterblks = newcg->cg_ndblk / fs->fs_frag;
    290       1.1       cgd 		newcg->cg_cs.cs_ndir = 0;
    291       1.1       cgd 		newcg->cg_cs.cs_nffree = 0;
    292       1.1       cgd 		newcg->cg_cs.cs_nbfree = 0;
    293       1.1       cgd 		newcg->cg_cs.cs_nifree = fs->fs_ipg;
    294  1.55.2.1    martin 		if (cg->cg_rotor < newcg->cg_ndblk)
    295       1.1       cgd 			newcg->cg_rotor = cg->cg_rotor;
    296       1.1       cgd 		else
    297       1.1       cgd 			newcg->cg_rotor = 0;
    298  1.55.2.1    martin 		if (cg->cg_frotor < newcg->cg_ndblk)
    299       1.1       cgd 			newcg->cg_frotor = cg->cg_frotor;
    300       1.1       cgd 		else
    301       1.1       cgd 			newcg->cg_frotor = 0;
    302  1.55.2.1    martin 		if (cg->cg_irotor < fs->fs_ipg)
    303       1.1       cgd 			newcg->cg_irotor = cg->cg_irotor;
    304       1.1       cgd 		else
    305       1.1       cgd 			newcg->cg_irotor = 0;
    306      1.34      fvdl 		if (!is_ufs2) {
    307      1.34      fvdl 			newcg->cg_initediblk = 0;
    308      1.34      fvdl 		} else {
    309      1.49  christos 			if ((unsigned)cg->cg_initediblk > (unsigned)fs->fs_ipg)
    310      1.34      fvdl 				newcg->cg_initediblk = fs->fs_ipg;
    311      1.34      fvdl 			else
    312      1.34      fvdl 				newcg->cg_initediblk = cg->cg_initediblk;
    313      1.34      fvdl 		}
    314       1.7   mycroft 		memset(&newcg->cg_frsum[0], 0, sizeof newcg->cg_frsum);
    315      1.39       dbj 		memset(&old_cg_blktot(newcg, 0)[0], 0, (size_t)(sumsize));
    316      1.34      fvdl 		memset(cg_inosused(newcg, 0), 0, (size_t)(mapsize));
    317      1.39       dbj 		if (!is_ufs2 && ((fs->fs_old_flags & FS_FLAGS_UPDATED) == 0) &&
    318      1.39       dbj 		    fs->fs_old_postblformat == FS_42POSTBLFMT)
    319      1.39       dbj 			ocg->cg_magic = CG_MAGIC;
    320       1.1       cgd 		j = fs->fs_ipg * c;
    321       1.1       cgd 		for (i = 0; i < fs->fs_ipg; j++, i++) {
    322      1.34      fvdl 			info = inoinfo(j);
    323      1.34      fvdl 			switch (info->ino_state) {
    324       1.1       cgd 
    325       1.1       cgd 			case USTATE:
    326       1.1       cgd 				break;
    327       1.1       cgd 
    328       1.1       cgd 			case DSTATE:
    329       1.1       cgd 			case DCLEAR:
    330       1.1       cgd 			case DFOUND:
    331       1.1       cgd 				newcg->cg_cs.cs_ndir++;
    332       1.1       cgd 				/* fall through */
    333       1.1       cgd 
    334       1.1       cgd 			case FSTATE:
    335       1.1       cgd 			case FCLEAR:
    336       1.1       cgd 				newcg->cg_cs.cs_nifree--;
    337      1.19    bouyer 				setbit(cg_inosused(newcg, 0), i);
    338       1.1       cgd 				break;
    339       1.1       cgd 
    340       1.1       cgd 			default:
    341      1.51  dholland 				if ((ino_t)j < UFS_ROOTINO)
    342       1.1       cgd 					break;
    343      1.48  christos 				errexit("BAD STATE %d FOR INODE I=%ld",
    344      1.34      fvdl 				    info->ino_state, (long)j);
    345       1.1       cgd 			}
    346       1.1       cgd 		}
    347       1.1       cgd 		if (c == 0)
    348      1.51  dholland 			for (i = 0; i < (long)UFS_ROOTINO; i++) {
    349      1.19    bouyer 				setbit(cg_inosused(newcg, 0), i);
    350       1.1       cgd 				newcg->cg_cs.cs_nifree--;
    351       1.1       cgd 			}
    352       1.1       cgd 		for (i = 0, d = dbase;
    353       1.1       cgd 		     d < dmax;
    354       1.1       cgd 		     d += fs->fs_frag, i += fs->fs_frag) {
    355       1.1       cgd 			frags = 0;
    356       1.1       cgd 			for (j = 0; j < fs->fs_frag; j++) {
    357       1.1       cgd 				if (testbmap(d + j))
    358       1.1       cgd 					continue;
    359      1.19    bouyer 				setbit(cg_blksfree(newcg, 0), i + j);
    360       1.1       cgd 				frags++;
    361       1.1       cgd 			}
    362       1.1       cgd 			if (frags == fs->fs_frag) {
    363       1.1       cgd 				newcg->cg_cs.cs_nbfree++;
    364      1.39       dbj 				if (sumsize) {
    365      1.39       dbj 					j = old_cbtocylno(fs, i);
    366      1.39       dbj 					old_cg_blktot(newcg, 0)[j]++;
    367      1.39       dbj 					old_cg_blks(fs, newcg, j, 0)[old_cbtorpos(fs, i)]++;
    368      1.39       dbj 				}
    369       1.6   mycroft 				if (fs->fs_contigsumsize > 0)
    370      1.19    bouyer 					setbit(cg_clustersfree(newcg, 0),
    371      1.54  dholland 					    ffs_fragstoblks(fs, i));
    372       1.1       cgd 			} else if (frags > 0) {
    373       1.1       cgd 				newcg->cg_cs.cs_nffree += frags;
    374      1.19    bouyer 				blk = blkmap(fs, cg_blksfree(newcg, 0), i);
    375      1.19    bouyer 				ffs_fragacct(fs, blk, newcg->cg_frsum, 1, 0);
    376       1.6   mycroft 			}
    377       1.6   mycroft 		}
    378       1.6   mycroft 		if (fs->fs_contigsumsize > 0) {
    379      1.19    bouyer 			int32_t *sump = cg_clustersum(newcg, 0);
    380      1.19    bouyer 			u_char *mapp = cg_clustersfree(newcg, 0);
    381       1.6   mycroft 			int map = *mapp++;
    382       1.6   mycroft 			int bit = 1;
    383       1.6   mycroft 			int run = 0;
    384       1.6   mycroft 
    385       1.6   mycroft 			for (i = 0; i < newcg->cg_nclusterblks; i++) {
    386       1.6   mycroft 				if ((map & bit) != 0) {
    387       1.6   mycroft 					run++;
    388       1.6   mycroft 				} else if (run != 0) {
    389       1.6   mycroft 					if (run > fs->fs_contigsumsize)
    390       1.6   mycroft 						run = fs->fs_contigsumsize;
    391       1.6   mycroft 					sump[run]++;
    392       1.6   mycroft 					run = 0;
    393       1.6   mycroft 				}
    394       1.6   mycroft 				if ((i & (NBBY - 1)) != (NBBY - 1)) {
    395       1.6   mycroft 					bit <<= 1;
    396       1.6   mycroft 				} else {
    397       1.6   mycroft 					map = *mapp++;
    398       1.6   mycroft 					bit = 1;
    399       1.6   mycroft 				}
    400       1.6   mycroft 			}
    401       1.6   mycroft 			if (run != 0) {
    402       1.6   mycroft 				if (run > fs->fs_contigsumsize)
    403       1.6   mycroft 					run = fs->fs_contigsumsize;
    404       1.6   mycroft 				sump[run]++;
    405       1.1       cgd 			}
    406       1.1       cgd 		}
    407       1.1       cgd 		cstotal.cs_nffree += newcg->cg_cs.cs_nffree;
    408       1.1       cgd 		cstotal.cs_nbfree += newcg->cg_cs.cs_nbfree;
    409       1.1       cgd 		cstotal.cs_nifree += newcg->cg_cs.cs_nifree;
    410       1.1       cgd 		cstotal.cs_ndir += newcg->cg_cs.cs_ndir;
    411       1.1       cgd 		cs = &fs->fs_cs(fs, c);
    412      1.20      ross 		if (memcmp(&newcg->cg_cs, cs, sizeof *cs) != 0) {
    413      1.40       dbj 			if (debug) {
    414      1.40       dbj 				printf("cg %d: nffree: %d/%d nbfree %d/%d"
    415      1.40       dbj 					" nifree %d/%d ndir %d/%d\n",
    416      1.40       dbj 					c, cs->cs_nffree,newcg->cg_cs.cs_nffree,
    417      1.40       dbj 					cs->cs_nbfree,newcg->cg_cs.cs_nbfree,
    418      1.40       dbj 					cs->cs_nifree,newcg->cg_cs.cs_nifree,
    419      1.40       dbj 					cs->cs_ndir,newcg->cg_cs.cs_ndir);
    420      1.40       dbj 			}
    421      1.19    bouyer 			if (dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) {
    422      1.34      fvdl 				memmove(cs, &newcg->cg_cs, sizeof *cs);
    423      1.34      fvdl 				sbdirty();
    424      1.19    bouyer 			} else
    425      1.19    bouyer 				markclean = 0;
    426      1.20      ross 		}
    427       1.6   mycroft 		if (doinglevel1) {
    428      1.18     lukem 			memmove(cg, newcg, (size_t)fs->fs_cgsize);
    429       1.1       cgd 			cgdirty();
    430       1.1       cgd 			continue;
    431       1.1       cgd 		}
    432      1.39       dbj 		if ((memcmp(newcg, cg, basesize) != 0) ||
    433      1.39       dbj 		    (memcmp(&old_cg_blktot(newcg, 0)[0],
    434      1.39       dbj 		        &old_cg_blktot(cg, 0)[0], sumsize) != 0)) {
    435      1.34      fvdl 		 	if (dofix(&idesc[2], "SUMMARY INFORMATION BAD")) {
    436      1.34      fvdl 				memmove(cg, newcg, (size_t)basesize);
    437      1.39       dbj 				memmove(&old_cg_blktot(cg, 0)[0],
    438      1.39       dbj 			       &old_cg_blktot(newcg, 0)[0], (size_t)sumsize);
    439      1.34      fvdl 				cgdirty();
    440      1.21      fvdl 			} else
    441      1.21      fvdl 				markclean = 0;
    442      1.20      ross 		}
    443      1.21      fvdl 		if (usedsoftdep) {
    444      1.21      fvdl 			for (i = 0; i < inomapsize; i++) {
    445      1.21      fvdl 				j = cg_inosused(newcg, 0)[i];
    446      1.21      fvdl 				if ((cg_inosused(cg, 0)[i] & j) == j)
    447      1.21      fvdl 					continue;
    448      1.21      fvdl 				for (k = 0; k < NBBY; k++) {
    449      1.21      fvdl 					if ((j & (1 << k)) == 0)
    450      1.21      fvdl 						continue;
    451      1.21      fvdl 					if (cg_inosused(cg, 0)[i] & (1 << k))
    452      1.21      fvdl 						continue;
    453      1.23    bouyer 					pwarn("ALLOCATED INODE %ld "
    454      1.23    bouyer 					    "MARKED FREE\n",
    455      1.21      fvdl 					    c * fs->fs_ipg + i * 8 + k);
    456      1.21      fvdl 				}
    457      1.21      fvdl 			}
    458      1.21      fvdl 			for (i = 0; i < blkmapsize; i++) {
    459      1.21      fvdl 				j = cg_blksfree(cg, 0)[i];
    460      1.21      fvdl 				if ((cg_blksfree(newcg, 0)[i] & j) == j)
    461      1.21      fvdl 					continue;
    462      1.21      fvdl 				for (k = 0; k < NBBY; k++) {
    463      1.21      fvdl 					if ((j & (1 << k)) == 0)
    464      1.21      fvdl 						continue;
    465      1.21      fvdl 					if (cg_inosused(cg, 0)[i] & (1 << k))
    466      1.21      fvdl 						continue;
    467      1.24   mycroft 					pwarn("ALLOCATED FRAG %ld "
    468      1.24   mycroft 					    "MARKED FREE\n",
    469      1.21      fvdl 					    c * fs->fs_fpg + i * 8 + k);
    470      1.21      fvdl 				}
    471      1.21      fvdl 			}
    472      1.21      fvdl 		}
    473      1.21      fvdl 		if (memcmp(cg_inosused(newcg, 0), cg_inosused(cg, 0), mapsize)
    474      1.21      fvdl 		    != 0 && dofix(&idesc[1], "BLK(S) MISSING IN BIT MAPS")) {
    475      1.21      fvdl 			memmove(cg_inosused(cg, 0), cg_inosused(newcg, 0),
    476      1.21      fvdl 			    (size_t)mapsize);
    477      1.21      fvdl                         cgdirty();
    478      1.21      fvdl                 }
    479       1.1       cgd 	}
    480      1.36      fvdl 	if (memcmp(&cstotal, &fs->fs_cstotal, cssize) != 0) {
    481      1.40       dbj 		if (debug) {
    482      1.40       dbj 			printf("total: nffree: %lld/%lld nbfree %lld/%lld"
    483      1.40       dbj 				" nifree %lld/%lld ndir %lld/%lld\n",
    484      1.41     ragge 				(long long int)fs->fs_cstotal.cs_nffree,
    485      1.41     ragge 				(long long int)cstotal.cs_nffree,
    486      1.41     ragge 				(long long int)fs->fs_cstotal.cs_nbfree,
    487      1.41     ragge 				(long long int)cstotal.cs_nbfree,
    488      1.41     ragge 				(long long int)fs->fs_cstotal.cs_nifree,
    489      1.41     ragge 				(long long int)cstotal.cs_nifree,
    490      1.41     ragge 				(long long int)fs->fs_cstotal.cs_ndir,
    491      1.41     ragge 				(long long int)cstotal.cs_ndir);
    492      1.40       dbj 		}
    493      1.26   thorpej 		if (dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) {
    494      1.36      fvdl 			memmove(&fs->fs_cstotal, &cstotal, sizeof cstotal);
    495      1.26   thorpej 			fs->fs_ronly = 0;
    496      1.26   thorpej 			fs->fs_fmod = 0;
    497      1.26   thorpej 			sbdirty();
    498      1.19    bouyer 		} else
    499      1.19    bouyer 			markclean = 0;
    500      1.20      ross 	}
    501      1.43  christos #ifdef PROGRESS
    502      1.47       apb 	if (!preen)
    503      1.42  christos 		progress_done();
    504      1.43  christos #endif /* PROGRESS */
    505      1.19    bouyer }
    506      1.19    bouyer 
    507      1.19    bouyer void
    508      1.49  christos print_bmap(u_char *map, uint32_t size)
    509      1.19    bouyer {
    510      1.49  christos 	uint32_t i, j;
    511      1.19    bouyer 
    512      1.19    bouyer 	i = 0;
    513      1.19    bouyer 	while (i < size) {
    514      1.19    bouyer 		printf("%u: ",i);
    515      1.19    bouyer 		for (j = 0; j < 16; j++, i++)
    516      1.19    bouyer 			printf("%2x ", (u_int)map[i] & 0xff);
    517      1.19    bouyer 		printf("\n");
    518       1.1       cgd 	}
    519       1.1       cgd }
    520