usr/src/sbin/fsck/pass5.c

/*
 * Copyright (c) 1980, 1986 The Regents of the University of California.
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms are permitted
 * provided that the above copyright notice and this paragraph are
 * duplicated in all such forms and that any documentation,
 * advertising materials, and other materials related to such
 * distribution and use acknowledge that the software was developed
 * by the University of California, Berkeley.  The name of the
 * University may not be used to endorse or promote products derived
 * from this software without specific prior written permission.
 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
 */

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

#include <sys/param.h>
#include <ufs/dinode.h>
#include <ufs/fs.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;
	time_t now;
	struct csum cstotal;
	struct inodesc idesc[3];
	char buf[MAXBSIZE];
	register struct cg *newcg = (struct cg *)buf;
	struct ocg *ocg = (struct ocg *)buf;

	bzero((char *)newcg, (int)fs->fs_cgsize);
	newcg->cg_niblk = fs->fs_ipg;
	switch ((int)fs->fs_postblformat) {

	case FS_42POSTBLFMT:
		basesize = (char *)(&ocg->cg_btot[0]) - (char *)(&ocg->cg_link);
		sumsize = &ocg->cg_iused[0] - (char *)(&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_link);
		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);
		newcg->cg_nextfreeoff = newcg->cg_freeoff +
			howmany(fs->fs_cpg * fs->fs_spc / NSPF(fs),
				NBBY);
		newcg->cg_magic = CG_MAGIC;
		basesize = &newcg->cg_space[0] - (u_char *)(&newcg->cg_link);
		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;
	bzero((char *)&cstotal, sizeof(struct csum));
	(void)time(&now);
	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;
		if (now > cg->cg_time)
			newcg->cg_time = cg->cg_time;
		else
			newcg->cg_time = now;
		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;
		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], 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)]++;
			} else if (frags > 0) {
				newcg->cg_cs.cs_nffree += frags;
				blk = blkmap(fs, cg_blksfree(newcg), i);
				fragacct(fs, blk, newcg->cg_frsum, 1);
			}
		}
		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 (cvtflag) {
			bcopy((char *)newcg, (char *)cg, (int)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), 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, basesize);
			bcopy((char *)&cg_blktot(newcg)[0],
			      (char *)&cg_blktot(cg)[0], 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
	1	/*
	2	* Copyright (c) 1980, 1986 The Regents of the University of California.
	3	* All rights reserved.
	4	*
	5	* Redistribution and use in source and binary forms are permitted
	6	* provided that the above copyright notice and this paragraph are
	7	* duplicated in all such forms and that any documentation,
	8	* advertising materials, and other materials related to such
	9	* distribution and use acknowledge that the software was developed
	10	* by the University of California, Berkeley. The name of the
	11	* University may not be used to endorse or promote products derived
	12	* from this software without specific prior written permission.
	13	* THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
	14	* IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
	15	* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
	16	*/
	17
	18	#ifndef lint
	19	static char sccsid[] = "@(#)pass5.c 5.11 (Berkeley) %G%";
	20	#endif /* not lint */
	21
	22	#include <sys/param.h>
	23	#include <ufs/dinode.h>
	24	#include <ufs/fs.h>
	25	#include "fsck.h"
	26
	27	pass5()
	28	{
	29	int c, blk, frags, basesize, sumsize, mapsize, savednrpos;
	30	register struct fs *fs = &sblock;
	31	register struct cg *cg = &cgrp;
	32	daddr_t dbase, dmax;
	33	register daddr_t d;
	34	register long i, j;
	35	struct csum *cs;
	36	time_t now;
	37	struct csum cstotal;
	38	struct inodesc idesc[3];
	39	char buf[MAXBSIZE];
	40	register struct cg newcg = (struct cg )buf;
	41	struct ocg ocg = (struct ocg )buf;
	42
	43	bzero((char *)newcg, (int)fs->fs_cgsize);
	44	newcg->cg_niblk = fs->fs_ipg;
	45	switch ((int)fs->fs_postblformat) {
	46
	47	case FS_42POSTBLFMT:
	48	basesize = (char )(&ocg->cg_btot[0]) - (char )(&ocg->cg_link);
	49	sumsize = &ocg->cg_iused[0] - (char *)(&ocg->cg_btot[0]);
	50	mapsize = &ocg->cg_free[howmany(fs->fs_fpg, NBBY)] -
	51	(u_char *)&ocg->cg_iused[0];
	52	ocg->cg_magic = CG_MAGIC;
	53	savednrpos = fs->fs_nrpos;
	54	fs->fs_nrpos = 8;
	55	break;
	56
	57	case FS_DYNAMICPOSTBLFMT:
	58	newcg->cg_btotoff =
	59	&newcg->cg_space[0] - (u_char *)(&newcg->cg_link);
	60	newcg->cg_boff =
	61	newcg->cg_btotoff + fs->fs_cpg * sizeof(long);
	62	newcg->cg_iusedoff = newcg->cg_boff +
	63	fs->fs_cpg * fs->fs_nrpos * sizeof(short);
	64	newcg->cg_freeoff =
	65	newcg->cg_iusedoff + howmany(fs->fs_ipg, NBBY);
	66	newcg->cg_nextfreeoff = newcg->cg_freeoff +
	67	howmany(fs->fs_cpg * fs->fs_spc / NSPF(fs),
	68	NBBY);
	69	newcg->cg_magic = CG_MAGIC;
	70	basesize = &newcg->cg_space[0] - (u_char *)(&newcg->cg_link);
	71	sumsize = newcg->cg_iusedoff - newcg->cg_btotoff;
	72	mapsize = newcg->cg_nextfreeoff - newcg->cg_iusedoff;
	73	break;
	74
	75	default:
	76	errexit("UNKNOWN ROTATIONAL TABLE FORMAT %d\n",
	77	fs->fs_postblformat);
	78	}
	79	bzero((char *)&idesc[0], sizeof idesc);
	80	for (i = 0; i < 3; i++)
	81	idesc[i].id_type = ADDR;
	82	bzero((char *)&cstotal, sizeof(struct csum));
	83	(void)time(&now);
	84	j = blknum(fs, fs->fs_size + fs->fs_frag - 1);
	85	for (i = fs->fs_size; i < j; i++)
	86	setbmap(i);
	87	for (c = 0; c < fs->fs_ncg; c++) {
	88	getblk(&cgblk, cgtod(fs, c), fs->fs_cgsize);
	89	if (!cg_chkmagic(cg))
	90	pfatal("CG %d: BAD MAGIC NUMBER\n", c);
	91	dbase = cgbase(fs, c);
	92	dmax = dbase + fs->fs_fpg;
	93	if (dmax > fs->fs_size)
	94	dmax = fs->fs_size;
	95	if (now > cg->cg_time)
	96	newcg->cg_time = cg->cg_time;
	97	else
	98	newcg->cg_time = now;
	99	newcg->cg_cgx = c;
	100	if (c == fs->fs_ncg - 1)
	101	newcg->cg_ncyl = fs->fs_ncyl % fs->fs_cpg;
	102	else
	103	newcg->cg_ncyl = fs->fs_cpg;
	104	newcg->cg_ndblk = dmax - dbase;
	105	newcg->cg_cs.cs_ndir = 0;
	106	newcg->cg_cs.cs_nffree = 0;
	107	newcg->cg_cs.cs_nbfree = 0;
	108	newcg->cg_cs.cs_nifree = fs->fs_ipg;
	109	if (cg->cg_rotor < newcg->cg_ndblk)
	110	newcg->cg_rotor = cg->cg_rotor;
	111	else
	112	newcg->cg_rotor = 0;
	113	if (cg->cg_frotor < newcg->cg_ndblk)
	114	newcg->cg_frotor = cg->cg_frotor;
	115	else
	116	newcg->cg_frotor = 0;
	117	if (cg->cg_irotor < newcg->cg_niblk)
	118	newcg->cg_irotor = cg->cg_irotor;
	119	else
	120	newcg->cg_irotor = 0;
	121	bzero((char *)&newcg->cg_frsum[0], sizeof newcg->cg_frsum);
	122	bzero((char *)&cg_blktot(newcg)[0], sumsize + mapsize);
	123	if (fs->fs_postblformat == FS_42POSTBLFMT)
	124	ocg->cg_magic = CG_MAGIC;
	125	j = fs->fs_ipg * c;
	126	for (i = 0; i < fs->fs_ipg; j++, i++) {
	127	switch (statemap[j]) {
	128
	129	case USTATE:
	130	break;
	131
	132	case DSTATE:
	133	case DCLEAR:
	134	case DFOUND:
	135	newcg->cg_cs.cs_ndir++;
	136	/* fall through */
	137
	138	case FSTATE:
	139	case FCLEAR:
	140	newcg->cg_cs.cs_nifree--;
	141	setbit(cg_inosused(newcg), i);
	142	break;
	143
	144	default:
	145	if (j < ROOTINO)
	146	break;
	147	errexit("BAD STATE %d FOR INODE I=%d",
	148	statemap[j], j);
	149	}
	150	}
	151	if (c == 0)
	152	for (i = 0; i < ROOTINO; i++) {
	153	setbit(cg_inosused(newcg), i);
	154	newcg->cg_cs.cs_nifree--;
	155	}
	156	for (i = 0, d = dbase;
	157	d < dmax;
	158	d += fs->fs_frag, i += fs->fs_frag) {
	159	frags = 0;
	160	for (j = 0; j < fs->fs_frag; j++) {
	161	if (testbmap(d + j))
	162	continue;
	163	setbit(cg_blksfree(newcg), i + j);
	164	frags++;
	165	}
	166	if (frags == fs->fs_frag) {
	167	newcg->cg_cs.cs_nbfree++;
	168	j = cbtocylno(fs, i);
	169	cg_blktot(newcg)[j]++;
	170	cg_blks(fs, newcg, j)[cbtorpos(fs, i)]++;
	171	} else if (frags > 0) {
	172	newcg->cg_cs.cs_nffree += frags;
	173	blk = blkmap(fs, cg_blksfree(newcg), i);
	174	fragacct(fs, blk, newcg->cg_frsum, 1);
	175	}
	176	}
	177	cstotal.cs_nffree += newcg->cg_cs.cs_nffree;
	178	cstotal.cs_nbfree += newcg->cg_cs.cs_nbfree;
	179	cstotal.cs_nifree += newcg->cg_cs.cs_nifree;
	180	cstotal.cs_ndir += newcg->cg_cs.cs_ndir;
	181	cs = &fs->fs_cs(fs, c);
	182	if (bcmp((char )&newcg->cg_cs, (char )cs, sizeof *cs) != 0 &&
	183	dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) {
	184	bcopy((char )&newcg->cg_cs, (char )cs, sizeof *cs);
	185	sbdirty();
	186	}
	187	if (cvtflag) {
	188	bcopy((char )newcg, (char )cg, (int)fs->fs_cgsize);
	189	cgdirty();
	190	continue;
	191	}
	192	if (bcmp(cg_inosused(newcg),
	193	cg_inosused(cg), mapsize) != 0 &&
	194	dofix(&idesc[1], "BLK(S) MISSING IN BIT MAPS")) {
	195	bcopy(cg_inosused(newcg), cg_inosused(cg), mapsize);
	196	cgdirty();
	197	}
	198	if ((bcmp((char )newcg, (char )cg, basesize) != 0 \|\|
	199	bcmp((char *)&cg_blktot(newcg)[0],
	200	(char *)&cg_blktot(cg)[0], sumsize) != 0) &&
	201	dofix(&idesc[2], "SUMMARY INFORMATION BAD")) {
	202	bcopy((char )newcg, (char )cg, basesize);
	203	bcopy((char *)&cg_blktot(newcg)[0],
	204	(char *)&cg_blktot(cg)[0], sumsize);
	205	cgdirty();
	206	}
	207	}
	208	if (fs->fs_postblformat == FS_42POSTBLFMT)
	209	fs->fs_nrpos = savednrpos;
	210	if (bcmp((char )&cstotal, (char )&fs->fs_cstotal, sizeof *cs) != 0
	211	&& dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) {
	212	bcopy((char )&cstotal, (char )&fs->fs_cstotal, sizeof *cs);
	213	fs->fs_ronly = 0;
	214	fs->fs_fmod = 0;
	215	sbdirty();
	216	}
	217	}