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

/*
 * Copyright (c) 1980, 1986, 1993
 *	The Regents of the University of California.  All rights reserved.
 *
 * %sccs.include.redist.c%
 */

#ifndef lint
static char sccsid[] = "@(#)pass5.c	8.5 (Berkeley) %G%";
#endif /* not lint */

#include <sys/param.h>
#include <sys/time.h>
#include <ufs/ufs/dinode.h>
#include <ufs/ffs/fs.h>
#include <string.h>
#include "fsck.h"

pass5()
{
	int c, blk, frags, basesize, sumsize, mapsize, savednrpos;
	register struct fs *fs = &sblock;
	register struct cg *cg = &cgrp;
	daddr_t dbase, dmax;
	register daddr_t d;
	register long i, j;
	struct csum *cs;
	struct csum cstotal;
	struct inodesc idesc[3];
	char buf[MAXBSIZE];
	register struct cg *newcg = (struct cg *)buf;
	struct ocg *ocg = (struct ocg *)buf;

	statemap[WINO] = USTATE;
	bzero((char *)newcg, (size_t)fs->fs_cgsize);
	newcg->cg_niblk = fs->fs_ipg;
	if (cvtlevel >= 3) {
		if (fs->fs_maxcontig < 2 && fs->fs_contigsumsize > 0) {
			if (preen)
				pwarn("DELETING CLUSTERING MAPS\n");
			if (preen || reply("DELETE CLUSTERING MAPS")) {
				fs->fs_contigsumsize = 0;
				doinglevel1 = 1;
				sbdirty();
			}
		}
		if (fs->fs_maxcontig > 1) {
			char *doit = 0;

			if (fs->fs_contigsumsize < 1) {
				doit = "CREAT";
			} else if (fs->fs_contigsumsize < fs->fs_maxcontig &&
				   fs->fs_contigsumsize < FS_MAXCONTIG) {
				doit = "EXPAND";
			}
			if (doit) {
				i = fs->fs_contigsumsize;
				fs->fs_contigsumsize =
				    MIN(fs->fs_maxcontig, FS_MAXCONTIG);
				if (CGSIZE(fs) > fs->fs_bsize) {
					pwarn("CANNOT %s CLUSTER MAPS\n", doit);
					fs->fs_contigsumsize = i;
				} else if (preen ||
				    reply("CREATE CLUSTER MAPS")) {
					if (preen)
						pwarn("%sING CLUSTER MAPS\n",
						    doit);
					fs->fs_cgsize =
					    fragroundup(fs, CGSIZE(fs));
					doinglevel1 = 1;
					sbdirty();
				}
			}
		}
	}
	switch ((int)fs->fs_postblformat) {

	case FS_42POSTBLFMT:
		basesize = (char *)(&ocg->cg_btot[0]) -
		    (char *)(&ocg->cg_firstfield);
		sumsize = &ocg->cg_iused[0] - (u_int8_t *)(&ocg->cg_btot[0]);
		mapsize = &ocg->cg_free[howmany(fs->fs_fpg, NBBY)] -
			(u_char *)&ocg->cg_iused[0];
		ocg->cg_magic = CG_MAGIC;
		savednrpos = fs->fs_nrpos;
		fs->fs_nrpos = 8;
		break;

	case FS_DYNAMICPOSTBLFMT:
		newcg->cg_btotoff =
		     &newcg->cg_space[0] - (u_char *)(&newcg->cg_firstfield);
		newcg->cg_boff =
		    newcg->cg_btotoff + fs->fs_cpg * sizeof(long);
		newcg->cg_iusedoff = newcg->cg_boff + 
		    fs->fs_cpg * fs->fs_nrpos * sizeof(short);
		newcg->cg_freeoff =
		    newcg->cg_iusedoff + howmany(fs->fs_ipg, NBBY);
		if (fs->fs_contigsumsize <= 0) {
			newcg->cg_nextfreeoff = newcg->cg_freeoff +
			    howmany(fs->fs_cpg * fs->fs_spc / NSPF(fs), NBBY);
		} else {
			newcg->cg_clustersumoff = newcg->cg_freeoff +
			    howmany(fs->fs_cpg * fs->fs_spc / NSPF(fs), NBBY) -
			    sizeof(long);
			newcg->cg_clustersumoff =
			    roundup(newcg->cg_clustersumoff, sizeof(long));
			newcg->cg_clusteroff = newcg->cg_clustersumoff +
			    (fs->fs_contigsumsize + 1) * sizeof(long);
			newcg->cg_nextfreeoff = newcg->cg_clusteroff +
			    howmany(fs->fs_cpg * fs->fs_spc / NSPB(fs), NBBY);
		}
		newcg->cg_magic = CG_MAGIC;
		basesize = &newcg->cg_space[0] -
		    (u_char *)(&newcg->cg_firstfield);
		sumsize = newcg->cg_iusedoff - newcg->cg_btotoff;
		mapsize = newcg->cg_nextfreeoff - newcg->cg_iusedoff;
		break;

	default:
		errexit("UNKNOWN ROTATIONAL TABLE FORMAT %d\n",
			fs->fs_postblformat);
	}
	bzero((char *)&idesc[0], sizeof idesc);
	for (i = 0; i < 3; i++) {
		idesc[i].id_type = ADDR;
		if (doinglevel2)
			idesc[i].id_fix = FIX;
	}
	bzero((char *)&cstotal, sizeof(struct csum));
	j = blknum(fs, fs->fs_size + fs->fs_frag - 1);
	for (i = fs->fs_size; i < j; i++)
		setbmap(i);
	for (c = 0; c < fs->fs_ncg; c++) {
		getblk(&cgblk, cgtod(fs, c), fs->fs_cgsize);
		if (!cg_chkmagic(cg))
			pfatal("CG %d: BAD MAGIC NUMBER\n", c);
		dbase = cgbase(fs, c);
		dmax = dbase + fs->fs_fpg;
		if (dmax > fs->fs_size)
			dmax = fs->fs_size;
		newcg->cg_time = cg->cg_time;
		newcg->cg_cgx = c;
		if (c == fs->fs_ncg - 1)
			newcg->cg_ncyl = fs->fs_ncyl % fs->fs_cpg;
		else
			newcg->cg_ncyl = fs->fs_cpg;
		newcg->cg_ndblk = dmax - dbase;
		if (fs->fs_contigsumsize > 0)
			newcg->cg_nclusterblks = newcg->cg_ndblk / fs->fs_frag;
		newcg->cg_cs.cs_ndir = 0;
		newcg->cg_cs.cs_nffree = 0;
		newcg->cg_cs.cs_nbfree = 0;
		newcg->cg_cs.cs_nifree = fs->fs_ipg;
		if (cg->cg_rotor < newcg->cg_ndblk)
			newcg->cg_rotor = cg->cg_rotor;
		else
			newcg->cg_rotor = 0;
		if (cg->cg_frotor < newcg->cg_ndblk)
			newcg->cg_frotor = cg->cg_frotor;
		else
			newcg->cg_frotor = 0;
		if (cg->cg_irotor < newcg->cg_niblk)
			newcg->cg_irotor = cg->cg_irotor;
		else
			newcg->cg_irotor = 0;
		bzero((char *)&newcg->cg_frsum[0], sizeof newcg->cg_frsum);
		bzero((char *)&cg_blktot(newcg)[0],
		      (size_t)(sumsize + mapsize));
		if (fs->fs_postblformat == FS_42POSTBLFMT)
			ocg->cg_magic = CG_MAGIC;
		j = fs->fs_ipg * c;
		for (i = 0; i < fs->fs_ipg; j++, i++) {
			switch (statemap[j]) {

			case USTATE:
				break;

			case DSTATE:
			case DCLEAR:
			case DFOUND:
				newcg->cg_cs.cs_ndir++;
				/* fall through */

			case FSTATE:
			case FCLEAR:
				newcg->cg_cs.cs_nifree--;
				setbit(cg_inosused(newcg), i);
				break;

			default:
				if (j < ROOTINO)
					break;
				errexit("BAD STATE %d FOR INODE I=%d",
				    statemap[j], j);
			}
		}
		if (c == 0)
			for (i = 0; i < ROOTINO; i++) {
				setbit(cg_inosused(newcg), i);
				newcg->cg_cs.cs_nifree--;
			}
		for (i = 0, d = dbase;
		     d < dmax;
		     d += fs->fs_frag, i += fs->fs_frag) {
			frags = 0;
			for (j = 0; j < fs->fs_frag; j++) {
				if (testbmap(d + j))
					continue;
				setbit(cg_blksfree(newcg), i + j);
				frags++;
			}
			if (frags == fs->fs_frag) {
				newcg->cg_cs.cs_nbfree++;
				j = cbtocylno(fs, i);
				cg_blktot(newcg)[j]++;
				cg_blks(fs, newcg, j)[cbtorpos(fs, i)]++;
				if (fs->fs_contigsumsize > 0)
					setbit(cg_clustersfree(newcg),
					    i / fs->fs_frag);
			} else if (frags > 0) {
				newcg->cg_cs.cs_nffree += frags;
				blk = blkmap(fs, cg_blksfree(newcg), i);
				ffs_fragacct(fs, blk, newcg->cg_frsum, 1);
			}
		}
		if (fs->fs_contigsumsize > 0) {
			long *sump = cg_clustersum(newcg);
			u_char *mapp = cg_clustersfree(newcg);
			int map = *mapp++;
			int bit = 1;
			int run = 0;

			for (i = 0; i < newcg->cg_nclusterblks; i++) {
				if ((map & bit) != 0) {
					run++;
				} else if (run != 0) {
					if (run > fs->fs_contigsumsize)
						run = fs->fs_contigsumsize;
					sump[run]++;
					run = 0;
				}
				if ((i & (NBBY - 1)) != (NBBY - 1)) {
					bit <<= 1;
				} else {
					map = *mapp++;
					bit = 1;
				}
			}
			if (run != 0) {
				if (run > fs->fs_contigsumsize)
					run = fs->fs_contigsumsize;
				sump[run]++;
			}
		}
		cstotal.cs_nffree += newcg->cg_cs.cs_nffree;
		cstotal.cs_nbfree += newcg->cg_cs.cs_nbfree;
		cstotal.cs_nifree += newcg->cg_cs.cs_nifree;
		cstotal.cs_ndir += newcg->cg_cs.cs_ndir;
		cs = &fs->fs_cs(fs, c);
		if (bcmp((char *)&newcg->cg_cs, (char *)cs, sizeof *cs) != 0 &&
		    dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) {
			bcopy((char *)&newcg->cg_cs, (char *)cs, sizeof *cs);
			sbdirty();
		}
		if (doinglevel1) {
			bcopy((char *)newcg, (char *)cg, (size_t)fs->fs_cgsize);
			cgdirty();
			continue;
		}
		if (bcmp(cg_inosused(newcg),
			 cg_inosused(cg), mapsize) != 0 &&
		    dofix(&idesc[1], "BLK(S) MISSING IN BIT MAPS")) {
			bcopy(cg_inosused(newcg), cg_inosused(cg),
			      (size_t)mapsize);
			cgdirty();
		}
		if ((bcmp((char *)newcg, (char *)cg, basesize) != 0 ||
		     bcmp((char *)&cg_blktot(newcg)[0],
			  (char *)&cg_blktot(cg)[0], sumsize) != 0) &&
		    dofix(&idesc[2], "SUMMARY INFORMATION BAD")) {
			bcopy((char *)newcg, (char *)cg, (size_t)basesize);
			bcopy((char *)&cg_blktot(newcg)[0],
			      (char *)&cg_blktot(cg)[0], (size_t)sumsize);
			cgdirty();
		}
	}
	if (fs->fs_postblformat == FS_42POSTBLFMT)
		fs->fs_nrpos = savednrpos;
	if (bcmp((char *)&cstotal, (char *)&fs->fs_cstotal, sizeof *cs) != 0
	    && dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) {
		bcopy((char *)&cstotal, (char *)&fs->fs_cstotal, sizeof *cs);
		fs->fs_ronly = 0;
		fs->fs_fmod = 0;
		sbdirty();
	}
}
Commit	Line	Data
76797561	1	/*
21e5ab9a KB	2	* Copyright (c) 1980, 1986, 1993
21e5ab9a KB	3	* The Regents of the University of California. All rights reserved.
fe32782c	4	*
70ab3c27	5	* %sccs.include.redist.c%
76797561 DF	6	*/
76797561 DF	7
62ae4dc6	8	#ifndef lint
7143f41b	9	static char sccsid[] = "@(#)pass5.c 8.5 (Berkeley) %G%";
fe32782c	10	#endif /* not lint */
62ae4dc6 KM	11
62ae4dc6 KM	12	#include <sys/param.h>
b82067db	13	#include <sys/time.h>
558b3a30 KB	14	#include <ufs/ufs/dinode.h>
558b3a30 KB	15	#include <ufs/ffs/fs.h>
d72e970b	16	#include <string.h>
62ae4dc6 KM	17	#include "fsck.h"
	18
	19	pass5()
	20	{
af29c275	21	int c, blk, frags, basesize, sumsize, mapsize, savednrpos;
484ac932 KM	22	register struct fs *fs = &sblock;
484ac932 KM	23	register struct cg *cg = &cgrp;
af29c275 KM	24	daddr_t dbase, dmax;
af29c275 KM	25	register daddr_t d;
993a756c KM	26	register long i, j;
993a756c KM	27	struct csum *cs;
993a756c	28	struct csum cstotal;
45c75771	29	struct inodesc idesc[3];
993a756c KM	30	char buf[MAXBSIZE];
993a756c KM	31	register struct cg newcg = (struct cg )buf;
af29c275	32	struct ocg ocg = (struct ocg )buf;
62ae4dc6	33
af60dcb9	34	statemap[WINO] = USTATE;
d72e970b	35	bzero((char *)newcg, (size_t)fs->fs_cgsize);
484ac932	36	newcg->cg_niblk = fs->fs_ipg;
7143f41b	37	if (cvtlevel >= 3) {
3828882c KM	38	if (fs->fs_maxcontig < 2 && fs->fs_contigsumsize > 0) {
	39	if (preen)
	40	pwarn("DELETING CLUSTERING MAPS\n");
	41	if (preen \|\| reply("DELETE CLUSTERING MAPS")) {
	42	fs->fs_contigsumsize = 0;
	43	doinglevel1 = 1;
	44	sbdirty();
	45	}
	46	}
	47	if (fs->fs_maxcontig > 1) {
	48	char *doit = 0;
	49
	50	if (fs->fs_contigsumsize < 1) {
	51	doit = "CREAT";
	52	} else if (fs->fs_contigsumsize < fs->fs_maxcontig &&
	53	fs->fs_contigsumsize < FS_MAXCONTIG) {
	54	doit = "EXPAND";
	55	}
	56	if (doit) {
	57	i = fs->fs_contigsumsize;
	58	fs->fs_contigsumsize =
	59	MIN(fs->fs_maxcontig, FS_MAXCONTIG);
	60	if (CGSIZE(fs) > fs->fs_bsize) {
	61	pwarn("CANNOT %s CLUSTER MAPS\n", doit);
	62	fs->fs_contigsumsize = i;
	63	} else if (preen \|\|
	64	reply("CREATE CLUSTER MAPS")) {
	65	if (preen)
	66	pwarn("%sING CLUSTER MAPS\n",
	67	doit);
	68	fs->fs_cgsize =
	69	fragroundup(fs, CGSIZE(fs));
	70	doinglevel1 = 1;
	71	sbdirty();
	72	}
	73	}
	74	}
	75	}
569ec282	76	switch ((int)fs->fs_postblformat) {
af29c275 KM	77
af29c275 KM	78	case FS_42POSTBLFMT:
6c3d0366 KM	79	basesize = (char *)(&ocg->cg_btot[0]) -
	80	(char *)(&ocg->cg_firstfield);
	81	sumsize = &ocg->cg_iused[0] - (u_int8_t *)(&ocg->cg_btot[0]);
484ac932	82	mapsize = &ocg->cg_free[howmany(fs->fs_fpg, NBBY)] -
af29c275 KM	83	(u_char *)&ocg->cg_iused[0];
af29c275 KM	84	ocg->cg_magic = CG_MAGIC;
484ac932 KM	85	savednrpos = fs->fs_nrpos;
484ac932 KM	86	fs->fs_nrpos = 8;
af29c275 KM	87	break;
	88
	89	case FS_DYNAMICPOSTBLFMT:
	90	newcg->cg_btotoff =
6c3d0366	91	&newcg->cg_space[0] - (u_char *)(&newcg->cg_firstfield);
af29c275	92	newcg->cg_boff =
3828882c	93	newcg->cg_btotoff + fs->fs_cpg * sizeof(long);
af29c275	94	newcg->cg_iusedoff = newcg->cg_boff +
3828882c	95	fs->fs_cpg * fs->fs_nrpos * sizeof(short);
af29c275	96	newcg->cg_freeoff =
3828882c KM	97	newcg->cg_iusedoff + howmany(fs->fs_ipg, NBBY);
	98	if (fs->fs_contigsumsize <= 0) {
	99	newcg->cg_nextfreeoff = newcg->cg_freeoff +
	100	howmany(fs->fs_cpg * fs->fs_spc / NSPF(fs), NBBY);
	101	} else {
	102	newcg->cg_clustersumoff = newcg->cg_freeoff +
	103	howmany(fs->fs_cpg * fs->fs_spc / NSPF(fs), NBBY) -
	104	sizeof(long);
	105	newcg->cg_clustersumoff =
	106	roundup(newcg->cg_clustersumoff, sizeof(long));
	107	newcg->cg_clusteroff = newcg->cg_clustersumoff +
	108	(fs->fs_contigsumsize + 1) * sizeof(long);
	109	newcg->cg_nextfreeoff = newcg->cg_clusteroff +
	110	howmany(fs->fs_cpg * fs->fs_spc / NSPB(fs), NBBY);
	111	}
af29c275	112	newcg->cg_magic = CG_MAGIC;
6c3d0366 KM	113	basesize = &newcg->cg_space[0] -
6c3d0366 KM	114	(u_char *)(&newcg->cg_firstfield);
af29c275 KM	115	sumsize = newcg->cg_iusedoff - newcg->cg_btotoff;
	116	mapsize = newcg->cg_nextfreeoff - newcg->cg_iusedoff;
	117	break;
	118
	119	default:
	120	errexit("UNKNOWN ROTATIONAL TABLE FORMAT %d\n",
484ac932	121	fs->fs_postblformat);
af29c275	122	}
45c75771	123	bzero((char *)&idesc[0], sizeof idesc);
7e8c05bf	124	for (i = 0; i < 3; i++) {
45c75771	125	idesc[i].id_type = ADDR;
7e8c05bf KM	126	if (doinglevel2)
	127	idesc[i].id_fix = FIX;
	128	}
993a756c	129	bzero((char *)&cstotal, sizeof(struct csum));
c2c8f378 KM	130	j = blknum(fs, fs->fs_size + fs->fs_frag - 1);
c2c8f378 KM	131	for (i = fs->fs_size; i < j; i++)
af29c275	132	setbmap(i);
484ac932 KM	133	for (c = 0; c < fs->fs_ncg; c++) {
	134	getblk(&cgblk, cgtod(fs, c), fs->fs_cgsize);
	135	if (!cg_chkmagic(cg))
62ae4dc6	136	pfatal("CG %d: BAD MAGIC NUMBER\n", c);
484ac932 KM	137	dbase = cgbase(fs, c);
	138	dmax = dbase + fs->fs_fpg;
	139	if (dmax > fs->fs_size)
	140	dmax = fs->fs_size;
13e8e036	141	newcg->cg_time = cg->cg_time;
993a756c	142	newcg->cg_cgx = c;
484ac932 KM	143	if (c == fs->fs_ncg - 1)
484ac932 KM	144	newcg->cg_ncyl = fs->fs_ncyl % fs->fs_cpg;
993a756c	145	else
484ac932	146	newcg->cg_ncyl = fs->fs_cpg;
993a756c	147	newcg->cg_ndblk = dmax - dbase;
3828882c KM	148	if (fs->fs_contigsumsize > 0)
3828882c KM	149	newcg->cg_nclusterblks = newcg->cg_ndblk / fs->fs_frag;
993a756c KM	150	newcg->cg_cs.cs_ndir = 0;
	151	newcg->cg_cs.cs_nffree = 0;
	152	newcg->cg_cs.cs_nbfree = 0;
484ac932 KM	153	newcg->cg_cs.cs_nifree = fs->fs_ipg;
	154	if (cg->cg_rotor < newcg->cg_ndblk)
	155	newcg->cg_rotor = cg->cg_rotor;
993a756c KM	156	else
993a756c KM	157	newcg->cg_rotor = 0;
484ac932 KM	158	if (cg->cg_frotor < newcg->cg_ndblk)
484ac932 KM	159	newcg->cg_frotor = cg->cg_frotor;
993a756c KM	160	else
993a756c KM	161	newcg->cg_frotor = 0;
484ac932 KM	162	if (cg->cg_irotor < newcg->cg_niblk)
484ac932 KM	163	newcg->cg_irotor = cg->cg_irotor;
993a756c KM	164	else
993a756c KM	165	newcg->cg_irotor = 0;
af29c275	166	bzero((char *)&newcg->cg_frsum[0], sizeof newcg->cg_frsum);
d72e970b KM	167	bzero((char *)&cg_blktot(newcg)[0],
d72e970b KM	168	(size_t)(sumsize + mapsize));
484ac932	169	if (fs->fs_postblformat == FS_42POSTBLFMT)
af29c275	170	ocg->cg_magic = CG_MAGIC;
484ac932 KM	171	j = fs->fs_ipg * c;
484ac932 KM	172	for (i = 0; i < fs->fs_ipg; j++, i++) {
993a756c KM	173	switch (statemap[j]) {
	174
	175	case USTATE:
	176	break;
	177
	178	case DSTATE:
	179	case DCLEAR:
	180	case DFOUND:
	181	newcg->cg_cs.cs_ndir++;
	182	/* fall through */
	183
	184	case FSTATE:
	185	case FCLEAR:
	186	newcg->cg_cs.cs_nifree--;
af29c275	187	setbit(cg_inosused(newcg), i);
993a756c	188	break;
ea4448dc KM	189
	190	default:
	191	if (j < ROOTINO)
	192	break;
	193	errexit("BAD STATE %d FOR INODE I=%d",
	194	statemap[j], j);
993a756c	195	}
62ae4dc6	196	}
993a756c KM	197	if (c == 0)
993a756c KM	198	for (i = 0; i < ROOTINO; i++) {
af29c275	199	setbit(cg_inosused(newcg), i);
993a756c KM	200	newcg->cg_cs.cs_nifree--;
	201	}
	202	for (i = 0, d = dbase;
af29c275	203	d < dmax;
484ac932	204	d += fs->fs_frag, i += fs->fs_frag) {
993a756c	205	frags = 0;
484ac932	206	for (j = 0; j < fs->fs_frag; j++) {
569ec282	207	if (testbmap(d + j))
993a756c	208	continue;
af29c275	209	setbit(cg_blksfree(newcg), i + j);
993a756c KM	210	frags++;
993a756c KM	211	}
484ac932	212	if (frags == fs->fs_frag) {
993a756c	213	newcg->cg_cs.cs_nbfree++;
484ac932	214	j = cbtocylno(fs, i);
af29c275	215	cg_blktot(newcg)[j]++;
484ac932	216	cg_blks(fs, newcg, j)[cbtorpos(fs, i)]++;
3828882c KM	217	if (fs->fs_contigsumsize > 0)
	218	setbit(cg_clustersfree(newcg),
	219	i / fs->fs_frag);
993a756c KM	220	} else if (frags > 0) {
993a756c KM	221	newcg->cg_cs.cs_nffree += frags;
484ac932	222	blk = blkmap(fs, cg_blksfree(newcg), i);
67295402	223	ffs_fragacct(fs, blk, newcg->cg_frsum, 1);
62ae4dc6	224	}
62ae4dc6	225	}
3828882c KM	226	if (fs->fs_contigsumsize > 0) {
	227	long *sump = cg_clustersum(newcg);
	228	u_char *mapp = cg_clustersfree(newcg);
	229	int map = *mapp++;
	230	int bit = 1;
	231	int run = 0;
	232
	233	for (i = 0; i < newcg->cg_nclusterblks; i++) {
	234	if ((map & bit) != 0) {
	235	run++;
	236	} else if (run != 0) {
	237	if (run > fs->fs_contigsumsize)
	238	run = fs->fs_contigsumsize;
	239	sump[run]++;
	240	run = 0;
	241	}
	242	if ((i & (NBBY - 1)) != (NBBY - 1)) {
	243	bit <<= 1;
	244	} else {
	245	map = *mapp++;
	246	bit = 1;
	247	}
	248	}
	249	if (run != 0) {
	250	if (run > fs->fs_contigsumsize)
	251	run = fs->fs_contigsumsize;
	252	sump[run]++;
	253	}
	254	}
993a756c KM	255	cstotal.cs_nffree += newcg->cg_cs.cs_nffree;
	256	cstotal.cs_nbfree += newcg->cg_cs.cs_nbfree;
	257	cstotal.cs_nifree += newcg->cg_cs.cs_nifree;
	258	cstotal.cs_ndir += newcg->cg_cs.cs_ndir;
484ac932	259	cs = &fs->fs_cs(fs, c);
993a756c	260	if (bcmp((char )&newcg->cg_cs, (char )cs, sizeof *cs) != 0 &&
45c75771	261	dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) {
993a756c KM	262	bcopy((char )&newcg->cg_cs, (char )cs, sizeof *cs);
993a756c KM	263	sbdirty();
62ae4dc6	264	}
7e8c05bf	265	if (doinglevel1) {
d72e970b	266	bcopy((char )newcg, (char )cg, (size_t)fs->fs_cgsize);
af29c275 KM	267	cgdirty();
	268	continue;
	269	}
	270	if (bcmp(cg_inosused(newcg),
484ac932	271	cg_inosused(cg), mapsize) != 0 &&
45c75771	272	dofix(&idesc[1], "BLK(S) MISSING IN BIT MAPS")) {
d72e970b KM	273	bcopy(cg_inosused(newcg), cg_inosused(cg),
d72e970b KM	274	(size_t)mapsize);
af29c275 KM	275	cgdirty();
af29c275 KM	276	}
484ac932	277	if ((bcmp((char )newcg, (char )cg, basesize) != 0 \|\|
af29c275	278	bcmp((char *)&cg_blktot(newcg)[0],
484ac932	279	(char *)&cg_blktot(cg)[0], sumsize) != 0) &&
45c75771	280	dofix(&idesc[2], "SUMMARY INFORMATION BAD")) {
d72e970b	281	bcopy((char )newcg, (char )cg, (size_t)basesize);
af29c275	282	bcopy((char *)&cg_blktot(newcg)[0],
d72e970b	283	(char *)&cg_blktot(cg)[0], (size_t)sumsize);
af29c275 KM	284	cgdirty();
af29c275 KM	285	}
62ae4dc6	286	}
484ac932 KM	287	if (fs->fs_postblformat == FS_42POSTBLFMT)
	288	fs->fs_nrpos = savednrpos;
	289	if (bcmp((char )&cstotal, (char )&fs->fs_cstotal, sizeof *cs) != 0
45c75771	290	&& dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) {
484ac932 KM	291	bcopy((char )&cstotal, (char )&fs->fs_cstotal, sizeof *cs);
	292	fs->fs_ronly = 0;
	293	fs->fs_fmod = 0;
993a756c KM	294	sbdirty();
993a756c KM	295	}
62ae4dc6	296	}