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

/*
 * Copyright (c) 1980 Regents of the University of California.
 * All rights reserved.  The Berkeley software License Agreement
 * specifies the terms and conditions for redistribution.
 */

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

#include <sys/param.h>
#include <sys/inode.h>
#include <sys/fs.h>
#include "fsck.h"

pass5()
{
	int c, blk, frags, sumsize, mapsize;
	daddr_t dbase, dmax, d;
	register long i, j;
	struct csum *cs;
	time_t now;
	struct csum cstotal;
	struct inodesc idesc;
	char buf[MAXBSIZE];
	register struct cg *newcg = (struct cg *)buf;

	bzero((char *)newcg, sblock.fs_cgsize);
	newcg->cg_magic = CG_MAGIC;
	bzero((char *)&idesc, sizeof(struct inodesc));
	idesc.id_type = ADDR;
	bzero((char *)&cstotal, sizeof(struct csum));
	sumsize = cgrp.cg_iused - (char *)(&cgrp);
	mapsize = &cgrp.cg_free[howmany(sblock.fs_fpg, NBBY)] -
		(u_char *)cgrp.cg_iused;
	(void)time(&now);
	for (c = 0; c < sblock.fs_ncg; c++) {
		getblk(&cgblk, cgtod(&sblock, c), sblock.fs_cgsize);
		if (cgrp.cg_magic != CG_MAGIC)
			pfatal("CG %d: BAD MAGIC NUMBER\n", c);
		dbase = cgbase(&sblock, c);
		dmax = dbase + sblock.fs_fpg;
		if (dmax > sblock.fs_size)
			dmax = sblock.fs_size;
		if (now > cgrp.cg_time)
			newcg->cg_time = cgrp.cg_time;
		else
			newcg->cg_time = now;
		newcg->cg_cgx = c;
		if (c == sblock.fs_ncg - 1)
			newcg->cg_ncyl = sblock.fs_ncyl % sblock.fs_cpg;
		else
			newcg->cg_ncyl = sblock.fs_cpg;
		newcg->cg_niblk = sblock.fs_ipg;
		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 = sblock.fs_ipg;
		if (cgrp.cg_rotor < newcg->cg_ndblk)
			newcg->cg_rotor = cgrp.cg_rotor;
		else
			newcg->cg_rotor = 0;
		if (cgrp.cg_frotor < newcg->cg_ndblk)
			newcg->cg_frotor = cgrp.cg_frotor;
		else
			newcg->cg_frotor = 0;
		if (cgrp.cg_irotor < newcg->cg_niblk)
			newcg->cg_irotor = cgrp.cg_irotor;
		else
			newcg->cg_irotor = 0;
		bzero((char *)newcg->cg_frsum, sizeof newcg->cg_frsum);
		bzero((char *)newcg->cg_btot, sizeof newcg->cg_btot);
		bzero((char *)newcg->cg_b, sizeof newcg->cg_b);
		bzero((char *)newcg->cg_free, howmany(sblock.fs_fpg, NBBY));
		bzero((char *)newcg->cg_iused, howmany(sblock.fs_ipg, NBBY));
		j = sblock.fs_ipg * c;
		for (i = 0; i < sblock.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(newcg->cg_iused, 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(newcg->cg_iused, i);
				newcg->cg_cs.cs_nifree--;
			}
		for (i = 0, d = dbase;
		     d <= dmax - sblock.fs_frag;
		     d += sblock.fs_frag, i += sblock.fs_frag) {
			frags = 0;
			for (j = 0; j < sblock.fs_frag; j++) {
				if (getbmap(d + j))
					continue;
				setbit(newcg->cg_free, i + j);
				frags++;
			}
			if (frags == sblock.fs_frag) {
				newcg->cg_cs.cs_nbfree++;
				j = cbtocylno(&sblock, i);
				newcg->cg_btot[j]++;
				newcg->cg_b[j][cbtorpos(&sblock, i)]++;
			} else if (frags > 0) {
				newcg->cg_cs.cs_nffree += frags;
				blk = blkmap(&sblock, newcg->cg_free, i);
				fragacct(&sblock, blk, newcg->cg_frsum, 1);
			}
		}
		for (frags = d; d < dmax; d++) {
			if (getbmap(d))
				continue;
			setbit(newcg->cg_free, d - dbase);
			newcg->cg_cs.cs_nffree++;
		}
		if (frags != d) {
			blk = blkmap(&sblock, newcg->cg_free, (frags - dbase));
			fragacct(&sblock, 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;
		if (bcmp(newcg->cg_iused, cgrp.cg_iused, mapsize) != 0 &&
		    dofix(&idesc, "BLK(S) MISSING IN BIT MAPS")) {
			bcopy(newcg->cg_iused, cgrp.cg_iused, mapsize);
			cgdirty();
		}
		if (bcmp((char *)newcg, (char *)&cgrp, sumsize) != 0 &&
		    dofix(&idesc, "SUMMARY INFORMATION BAD")) {
			bcopy((char *)newcg, (char *)&cgrp, sumsize);
			cgdirty();
		}
		cs = &sblock.fs_cs(&sblock, c);
		if (bcmp((char *)&newcg->cg_cs, (char *)cs, sizeof *cs) != 0 &&
		    dofix(&idesc, "FREE BLK COUNT(S) WRONG IN SUPERBLK")) {
			bcopy((char *)&newcg->cg_cs, (char *)cs, sizeof *cs);
			sbdirty();
		}
	}
	if (bcmp((char *)&cstotal, (char *)&sblock.fs_cstotal, sizeof *cs) != 0
	    && dofix(&idesc, "FREE BLK COUNT(S) WRONG IN SUPERBLK")) {
		bcopy((char *)&cstotal, (char *)&sblock.fs_cstotal, sizeof *cs);
		sblock.fs_ronly = 0;
		sblock.fs_fmod = 0;
		sbdirty();
	}
}
Commit	Line	Data
76797561 DF	1	/*
	2	* Copyright (c) 1980 Regents of the University of California.
	3	* All rights reserved. The Berkeley software License Agreement
	4	* specifies the terms and conditions for redistribution.
	5	*/
	6
62ae4dc6	7	#ifndef lint
ea4448dc	8	static char sccsid[] = "@(#)pass5.c 5.2 (Berkeley) %G%";
76797561	9	#endif not lint
62ae4dc6 KM	10
	11	#include <sys/param.h>
	12	#include <sys/inode.h>
	13	#include <sys/fs.h>
	14	#include "fsck.h"
	15
	16	pass5()
	17	{
993a756c KM	18	int c, blk, frags, sumsize, mapsize;
	19	daddr_t dbase, dmax, d;
	20	register long i, j;
	21	struct csum *cs;
	22	time_t now;
	23	struct csum cstotal;
	24	struct inodesc idesc;
	25	char buf[MAXBSIZE];
	26	register struct cg newcg = (struct cg )buf;
62ae4dc6	27
993a756c KM	28	bzero((char *)newcg, sblock.fs_cgsize);
	29	newcg->cg_magic = CG_MAGIC;
	30	bzero((char *)&idesc, sizeof(struct inodesc));
	31	idesc.id_type = ADDR;
	32	bzero((char *)&cstotal, sizeof(struct csum));
	33	sumsize = cgrp.cg_iused - (char *)(&cgrp);
af484010 KM	34	mapsize = &cgrp.cg_free[howmany(sblock.fs_fpg, NBBY)] -
af484010 KM	35	(u_char *)cgrp.cg_iused;
993a756c	36	(void)time(&now);
62ae4dc6	37	for (c = 0; c < sblock.fs_ncg; c++) {
49505034	38	getblk(&cgblk, cgtod(&sblock, c), sblock.fs_cgsize);
993a756c	39	if (cgrp.cg_magic != CG_MAGIC)
62ae4dc6	40	pfatal("CG %d: BAD MAGIC NUMBER\n", c);
993a756c KM	41	dbase = cgbase(&sblock, c);
	42	dmax = dbase + sblock.fs_fpg;
	43	if (dmax > sblock.fs_size)
	44	dmax = sblock.fs_size;
	45	if (now > cgrp.cg_time)
	46	newcg->cg_time = cgrp.cg_time;
	47	else
	48	newcg->cg_time = now;
	49	newcg->cg_cgx = c;
	50	if (c == sblock.fs_ncg - 1)
	51	newcg->cg_ncyl = sblock.fs_ncyl % sblock.fs_cpg;
	52	else
	53	newcg->cg_ncyl = sblock.fs_cpg;
	54	newcg->cg_niblk = sblock.fs_ipg;
	55	newcg->cg_ndblk = dmax - dbase;
	56	newcg->cg_cs.cs_ndir = 0;
	57	newcg->cg_cs.cs_nffree = 0;
	58	newcg->cg_cs.cs_nbfree = 0;
	59	newcg->cg_cs.cs_nifree = sblock.fs_ipg;
	60	if (cgrp.cg_rotor < newcg->cg_ndblk)
	61	newcg->cg_rotor = cgrp.cg_rotor;
	62	else
	63	newcg->cg_rotor = 0;
	64	if (cgrp.cg_frotor < newcg->cg_ndblk)
	65	newcg->cg_frotor = cgrp.cg_frotor;
	66	else
	67	newcg->cg_frotor = 0;
	68	if (cgrp.cg_irotor < newcg->cg_niblk)
	69	newcg->cg_irotor = cgrp.cg_irotor;
	70	else
	71	newcg->cg_irotor = 0;
	72	bzero((char *)newcg->cg_frsum, sizeof newcg->cg_frsum);
	73	bzero((char *)newcg->cg_btot, sizeof newcg->cg_btot);
	74	bzero((char *)newcg->cg_b, sizeof newcg->cg_b);
	75	bzero((char *)newcg->cg_free, howmany(sblock.fs_fpg, NBBY));
	76	bzero((char *)newcg->cg_iused, howmany(sblock.fs_ipg, NBBY));
	77	j = sblock.fs_ipg * c;
	78	for (i = 0; i < sblock.fs_ipg; j++, i++) {
	79	switch (statemap[j]) {
	80
	81	case USTATE:
	82	break;
	83
	84	case DSTATE:
	85	case DCLEAR:
	86	case DFOUND:
	87	newcg->cg_cs.cs_ndir++;
	88	/* fall through */
	89
	90	case FSTATE:
	91	case FCLEAR:
	92	newcg->cg_cs.cs_nifree--;
	93	setbit(newcg->cg_iused, i);
	94	break;
ea4448dc KM	95
	96	default:
	97	if (j < ROOTINO)
	98	break;
	99	errexit("BAD STATE %d FOR INODE I=%d",
	100	statemap[j], j);
993a756c	101	}
62ae4dc6	102	}
993a756c KM	103	if (c == 0)
	104	for (i = 0; i < ROOTINO; i++) {
	105	setbit(newcg->cg_iused, i);
	106	newcg->cg_cs.cs_nifree--;
	107	}
	108	for (i = 0, d = dbase;
	109	d <= dmax - sblock.fs_frag;
	110	d += sblock.fs_frag, i += sblock.fs_frag) {
	111	frags = 0;
	112	for (j = 0; j < sblock.fs_frag; j++) {
	113	if (getbmap(d + j))
	114	continue;
	115	setbit(newcg->cg_free, i + j);
	116	frags++;
	117	}
	118	if (frags == sblock.fs_frag) {
	119	newcg->cg_cs.cs_nbfree++;
	120	j = cbtocylno(&sblock, i);
	121	newcg->cg_btot[j]++;
	122	newcg->cg_b[j][cbtorpos(&sblock, i)]++;
	123	} else if (frags > 0) {
	124	newcg->cg_cs.cs_nffree += frags;
	125	blk = blkmap(&sblock, newcg->cg_free, i);
	126	fragacct(&sblock, blk, newcg->cg_frsum, 1);
62ae4dc6	127	}
62ae4dc6	128	}
993a756c KM	129	for (frags = d; d < dmax; d++) {
	130	if (getbmap(d))
	131	continue;
	132	setbit(newcg->cg_free, d - dbase);
	133	newcg->cg_cs.cs_nffree++;
62ae4dc6	134	}
993a756c KM	135	if (frags != d) {
	136	blk = blkmap(&sblock, newcg->cg_free, (frags - dbase));
	137	fragacct(&sblock, blk, newcg->cg_frsum, 1);
62ae4dc6	138	}
993a756c KM	139	cstotal.cs_nffree += newcg->cg_cs.cs_nffree;
	140	cstotal.cs_nbfree += newcg->cg_cs.cs_nbfree;
	141	cstotal.cs_nifree += newcg->cg_cs.cs_nifree;
	142	cstotal.cs_ndir += newcg->cg_cs.cs_ndir;
	143	if (bcmp(newcg->cg_iused, cgrp.cg_iused, mapsize) != 0 &&
	144	dofix(&idesc, "BLK(S) MISSING IN BIT MAPS")) {
	145	bcopy(newcg->cg_iused, cgrp.cg_iused, mapsize);
	146	cgdirty();
62ae4dc6	147	}
993a756c KM	148	if (bcmp((char )newcg, (char )&cgrp, sumsize) != 0 &&
	149	dofix(&idesc, "SUMMARY INFORMATION BAD")) {
	150	bcopy((char )newcg, (char )&cgrp, sumsize);
	151	cgdirty();
62ae4dc6	152	}
993a756c KM	153	cs = &sblock.fs_cs(&sblock, c);
	154	if (bcmp((char )&newcg->cg_cs, (char )cs, sizeof *cs) != 0 &&
	155	dofix(&idesc, "FREE BLK COUNT(S) WRONG IN SUPERBLK")) {
	156	bcopy((char )&newcg->cg_cs, (char )cs, sizeof *cs);
	157	sbdirty();
62ae4dc6 KM	158	}
62ae4dc6 KM	159	}
993a756c KM	160	if (bcmp((char )&cstotal, (char )&sblock.fs_cstotal, sizeof *cs) != 0
	161	&& dofix(&idesc, "FREE BLK COUNT(S) WRONG IN SUPERBLK")) {
	162	bcopy((char )&cstotal, (char )&sblock.fs_cstotal, sizeof *cs);
	163	sblock.fs_ronly = 0;
	164	sblock.fs_fmod = 0;
	165	sbdirty();
	166	}
62ae4dc6	167	}