[thirdparty/xfsprogs-dev.git] / repair / phase4.c

/*
 * Copyright (c) 2000-2002,2005 Silicon Graphics, Inc.
 * All Rights Reserved.
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License as
 * published by the Free Software Foundation.
 *
 * This program is distributed in the hope that it would be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write the Free Software Foundation,
 * Inc.,  51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
 */

#include <libxfs.h>
#include "avl.h"
#include "globals.h"
#include "agheader.h"
#include "incore.h"
#include "protos.h"
#include "err_protos.h"
#include "dinode.h"
#include "dir.h"
#include "bmap.h"
#include "versions.h"
#include "dir2.h"
#include "threads.h"
#include "progress.h"
#include "prefetch.h"


/*
 * null out quota inode fields in sb if they point to non-existent inodes.
 * this isn't as redundant as it looks since it's possible that the sb field
 * might be set but the imap and inode(s) agree that the inode is
 * free in which case they'd never be cleared so the fields wouldn't
 * be cleared by process_dinode().
 */
void
quotino_check(xfs_mount_t *mp)
{
	ino_tree_node_t *irec;

	if (mp->m_sb.sb_uquotino != NULLFSINO && mp->m_sb.sb_uquotino != 0)  {
		if (verify_inum(mp, mp->m_sb.sb_uquotino))
			irec = NULL;
		else
			irec = find_inode_rec(
				XFS_INO_TO_AGNO(mp, mp->m_sb.sb_uquotino),
				XFS_INO_TO_AGINO(mp, mp->m_sb.sb_uquotino));

		if (irec == NULL || is_inode_free(irec,
				mp->m_sb.sb_uquotino - irec->ino_startnum))  {
			mp->m_sb.sb_uquotino = NULLFSINO;
			lost_uquotino = 1;
		} else
			lost_uquotino = 0;
	}

	if (mp->m_sb.sb_gquotino != NULLFSINO && mp->m_sb.sb_gquotino != 0)  {
		if (verify_inum(mp, mp->m_sb.sb_gquotino))
			irec = NULL;
		else
			irec = find_inode_rec(
				XFS_INO_TO_AGNO(mp, mp->m_sb.sb_gquotino),
				XFS_INO_TO_AGINO(mp, mp->m_sb.sb_gquotino));

		if (irec == NULL || is_inode_free(irec,
				mp->m_sb.sb_gquotino - irec->ino_startnum))  {
			mp->m_sb.sb_gquotino = NULLFSINO;
			if (mp->m_sb.sb_qflags & XFS_GQUOTA_ACCT)
				lost_gquotino = 1;
			else
				lost_pquotino = 1;
		} else
			lost_gquotino = lost_pquotino = 0;
	}
}

void
quota_sb_check(xfs_mount_t *mp)
{
	/*
	 * if the sb says we have quotas and we lost both,
	 * signal a superblock downgrade.  that will cause
	 * the quota flags to get zeroed.  (if we only lost
	 * one quota inode, do nothing and complain later.)
	 *
	 * if the sb says we have quotas but we didn't start out
	 * with any quota inodes, signal a superblock downgrade.
	 *
	 * The sb downgrades are so that older systems can mount
	 * the filesystem.
	 *
	 * if the sb says we don't have quotas but it looks like
	 * we do have quota inodes, then signal a superblock upgrade.
	 *
	 * if the sb says we don't have quotas and we have no
	 * quota inodes, then leave will enough alone.
	 */

	if (fs_quotas &&
	    (mp->m_sb.sb_uquotino == NULLFSINO || mp->m_sb.sb_uquotino == 0) &&
	    (mp->m_sb.sb_gquotino == NULLFSINO || mp->m_sb.sb_gquotino == 0))  {
		lost_quotas = 1;
		fs_quotas = 0;
	} else if (!verify_inum(mp, mp->m_sb.sb_uquotino) &&
			!verify_inum(mp, mp->m_sb.sb_gquotino)) {
		fs_quotas = 1;
	}
}


static void
process_ag_func(
	work_queue_t		*wq,
	xfs_agnumber_t 		agno,
	void			*arg)
{
	wait_for_inode_prefetch(arg);
	do_log(_("        - agno = %d\n"), agno);
	process_aginodes(wq->mp, arg, agno, 0, 1, 0);
	cleanup_inode_prefetch(arg);

	/*
	 * now recycle the per-AG duplicate extent records
	 */
	release_dup_extent_tree(agno);
}

static void
process_ags(
	xfs_mount_t		*mp)
{
	int 			i, j;
	xfs_agnumber_t 		agno;
	work_queue_t		*queues;
	prefetch_args_t		*pf_args[2];

	queues = malloc(thread_count * sizeof(work_queue_t));

	if (!libxfs_bcache_overflowed()) {
		queues[0].mp = mp;
		create_work_queue(&queues[0], mp, libxfs_nproc());
		for (i = 0; i < mp->m_sb.sb_agcount; i++)
			queue_work(&queues[0], process_ag_func, i, NULL);
		destroy_work_queue(&queues[0]);
	} else {
		if (ag_stride) {
			/*
			 * create one worker thread for each segment of the volume
			 */
			for (i = 0, agno = 0; i < thread_count; i++) {
				create_work_queue(&queues[i], mp, 1);
				pf_args[0] = NULL;
				for (j = 0; j < ag_stride && agno < mp->m_sb.sb_agcount;
						j++, agno++) {
					pf_args[0] = start_inode_prefetch(agno, 0, pf_args[0]);
					queue_work(&queues[i], process_ag_func, agno, pf_args[0]);
				}
			}
			/*
			 * wait for workers to complete
			 */
			for (i = 0; i < thread_count; i++)
				destroy_work_queue(&queues[i]);
		} else {
			queues[0].mp = mp;
			pf_args[0] = start_inode_prefetch(0, 0, NULL);
			for (i = 0; i < mp->m_sb.sb_agcount; i++) {
				pf_args[(~i) & 1] = start_inode_prefetch(i + 1,
						0, pf_args[i & 1]);
				process_ag_func(&queues[0], i, pf_args[i & 1]);
			}
		}
	}
	free(queues);
}


void
phase4(xfs_mount_t *mp)
{
	ino_tree_node_t		*irec;
	xfs_drtbno_t		bno;
	xfs_drtbno_t		rt_start;
	xfs_extlen_t		rt_len;
	xfs_agnumber_t		i;
	xfs_agblock_t		j;
	xfs_agblock_t		ag_end;
	xfs_extlen_t		blen;
	int			ag_hdr_len = 4 * mp->m_sb.sb_sectsize;
	int			ag_hdr_block;
	int			bstate;
	int			count_bcnt_extents(xfs_agnumber_t agno);
	int			count_bno_extents(xfs_agnumber_t agno);

	ag_hdr_block = howmany(ag_hdr_len, mp->m_sb.sb_blocksize);

	do_log(_("Phase 4 - check for duplicate blocks...\n"));
	do_log(_("        - setting up duplicate extent list...\n"));

	set_progress_msg(PROG_FMT_DUP_EXTENT, (__uint64_t) glob_agcount);

	irec = find_inode_rec(XFS_INO_TO_AGNO(mp, mp->m_sb.sb_rootino),
				XFS_INO_TO_AGINO(mp, mp->m_sb.sb_rootino));

	/*
	 * we always have a root inode, even if it's free...
	 * if the root is free, forget it, lost+found is already gone
	 */
	if (is_inode_free(irec, 0) || !inode_isadir(irec, 0))  {
		need_root_inode = 1;
		if (no_modify)
			do_warn(_("root inode would be lost\n"));
		else
			do_warn(_("root inode lost\n"));
	}

	for (i = 0; i < mp->m_sb.sb_agcount; i++)  {
		ag_end = (i < mp->m_sb.sb_agcount - 1) ? mp->m_sb.sb_agblocks :
			mp->m_sb.sb_dblocks -
				(xfs_drfsbno_t) mp->m_sb.sb_agblocks * i;

		/*
		 * set up duplicate extent list for this ag
		 */
		for (j = ag_hdr_block; j < ag_end; j += blen)  {
			bstate = get_bmap_ext(i, j, ag_end, &blen);
			switch (bstate) {
			case XR_E_BAD_STATE:
			default:
				do_warn(
				_("unknown block state, ag %d, block %d\n"),
					i, j);
				/* fall through .. */
			case XR_E_UNKNOWN:
			case XR_E_FREE1:
			case XR_E_FREE:
			case XR_E_INUSE:
			case XR_E_INUSE_FS:
			case XR_E_INO:
			case XR_E_FS_MAP:
				break;
			case XR_E_MULT:
				add_dup_extent(i, j, blen);
				break;
			}
		}

		PROG_RPT_INC(prog_rpt_done[i], 1);
	}
	print_final_rpt();

	/*
	 * initialize realtime bitmap
	 */
	rt_start = 0;
	rt_len = 0;

	for (bno = 0; bno < mp->m_sb.sb_rextents; bno++)  {
		bstate = get_rtbmap(bno);
		switch (bstate)  {
		case XR_E_BAD_STATE:
		default:
			do_warn(_("unknown rt extent state, extent %llu\n"),
				bno);
			/* fall through .. */
		case XR_E_UNKNOWN:
		case XR_E_FREE1:
		case XR_E_FREE:
		case XR_E_INUSE:
		case XR_E_INUSE_FS:
		case XR_E_INO:
		case XR_E_FS_MAP:
			if (rt_start == 0)
				continue;
			else  {
				/*
				 * add extent and reset extent state
				 */
				add_rt_dup_extent(rt_start, rt_len);
				rt_start = 0;
				rt_len = 0;
			}
			break;
		case XR_E_MULT:
			if (rt_start == 0)  {
				rt_start = bno;
				rt_len = 1;
			} else if (rt_len == MAXEXTLEN)  {
				/*
				 * large extent case
				 */
				add_rt_dup_extent(rt_start, rt_len);
				rt_start = bno;
				rt_len = 1;
			} else
				rt_len++;
			break;
		}
	}

	/*
	 * catch tail-case, extent hitting the end of the ag
	 */
	if (rt_start != 0)
		add_rt_dup_extent(rt_start, rt_len);

	/*
	 * initialize bitmaps for all AGs
	 */
	reset_bmaps(mp);

	do_log(_("        - check for inodes claiming duplicate blocks...\n"));
	set_progress_msg(PROG_FMT_DUP_BLOCKS, (__uint64_t) mp->m_sb.sb_icount);

	/*
	 * ok, now process the inodes -- signal 2-pass check per inode.
	 * first pass checks if the inode conflicts with a known
	 * duplicate extent.  if so, the inode is cleared and second
	 * pass is skipped.  second pass sets the block bitmap
	 * for all blocks claimed by the inode.  directory
	 * and attribute processing is turned OFF since we did that
	 * already in phase 3.
	 */
	process_ags(mp);
	print_final_rpt();

	/*
	 * free up memory used to track trealtime duplicate extents
	 */
	if (rt_start != 0)
		free_rt_dup_extent_tree(mp);

	/*
	 * ensure consistency of quota inode pointers in superblock,
	 * make sure they point to real inodes
	 */
	quotino_check(mp);
	quota_sb_check(mp);
}
Commit	Line	Data
2bd0ea18	1	/*
da23017d NS	2	* Copyright (c) 2000-2002,2005 Silicon Graphics, Inc.
da23017d NS	3	* All Rights Reserved.
dfc130f3	4	*
da23017d NS	5	* This program is free software; you can redistribute it and/or
da23017d NS	6	* modify it under the terms of the GNU General Public License as
2bd0ea18	7	* published by the Free Software Foundation.
dfc130f3	8	*
da23017d NS	9	* This program is distributed in the hope that it would be useful,
	10	* but WITHOUT ANY WARRANTY; without even the implied warranty of
	11	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
	12	* GNU General Public License for more details.
dfc130f3	13	*
da23017d NS	14	* You should have received a copy of the GNU General Public License
	15	* along with this program; if not, write the Free Software Foundation,
	16	* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
2bd0ea18 NS	17	*/
	18
	19	#include <libxfs.h>
	20	#include "avl.h"
	21	#include "globals.h"
	22	#include "agheader.h"
	23	#include "incore.h"
	24	#include "protos.h"
	25	#include "err_protos.h"
	26	#include "dinode.h"
	27	#include "dir.h"
	28	#include "bmap.h"
	29	#include "versions.h"
	30	#include "dir2.h"
3b6ac903	31	#include "threads.h"
06fbdda9	32	#include "progress.h"
2556c98b	33	#include "prefetch.h"
2bd0ea18 NS	34
2bd0ea18 NS	35
2bd0ea18 NS	36	/*
	37	* null out quota inode fields in sb if they point to non-existent inodes.
	38	* this isn't as redundant as it looks since it's possible that the sb field
	39	* might be set but the imap and inode(s) agree that the inode is
	40	* free in which case they'd never be cleared so the fields wouldn't
	41	* be cleared by process_dinode().
	42	*/
	43	void
	44	quotino_check(xfs_mount_t *mp)
	45	{
	46	ino_tree_node_t *irec;
	47
	48	if (mp->m_sb.sb_uquotino != NULLFSINO && mp->m_sb.sb_uquotino != 0) {
6411f39c BN	49	if (verify_inum(mp, mp->m_sb.sb_uquotino))
	50	irec = NULL;
	51	else
	52	irec = find_inode_rec(
	53	XFS_INO_TO_AGNO(mp, mp->m_sb.sb_uquotino),
	54	XFS_INO_TO_AGINO(mp, mp->m_sb.sb_uquotino));
2bd0ea18 NS	55
	56	if (irec == NULL \|\| is_inode_free(irec,
	57	mp->m_sb.sb_uquotino - irec->ino_startnum)) {
	58	mp->m_sb.sb_uquotino = NULLFSINO;
	59	lost_uquotino = 1;
	60	} else
	61	lost_uquotino = 0;
	62	}
	63
b36eef04	64	if (mp->m_sb.sb_gquotino != NULLFSINO && mp->m_sb.sb_gquotino != 0) {
6411f39c BN	65	if (verify_inum(mp, mp->m_sb.sb_gquotino))
	66	irec = NULL;
	67	else
	68	irec = find_inode_rec(
	69	XFS_INO_TO_AGNO(mp, mp->m_sb.sb_gquotino),
	70	XFS_INO_TO_AGINO(mp, mp->m_sb.sb_gquotino));
2bd0ea18 NS	71
2bd0ea18 NS	72	if (irec == NULL \|\| is_inode_free(irec,
b36eef04 NS	73	mp->m_sb.sb_gquotino - irec->ino_startnum)) {
b36eef04 NS	74	mp->m_sb.sb_gquotino = NULLFSINO;
9b27bdbb NS	75	if (mp->m_sb.sb_qflags & XFS_GQUOTA_ACCT)
	76	lost_gquotino = 1;
	77	else
	78	lost_pquotino = 1;
2bd0ea18	79	} else
9b27bdbb	80	lost_gquotino = lost_pquotino = 0;
2bd0ea18 NS	81	}
	82	}
	83
	84	void
	85	quota_sb_check(xfs_mount_t *mp)
	86	{
	87	/*
	88	* if the sb says we have quotas and we lost both,
	89	* signal a superblock downgrade. that will cause
	90	* the quota flags to get zeroed. (if we only lost
	91	* one quota inode, do nothing and complain later.)
	92	*
	93	* if the sb says we have quotas but we didn't start out
	94	* with any quota inodes, signal a superblock downgrade.
	95	*
	96	* The sb downgrades are so that older systems can mount
	97	* the filesystem.
	98	*
	99	* if the sb says we don't have quotas but it looks like
	100	* we do have quota inodes, then signal a superblock upgrade.
	101	*
	102	* if the sb says we don't have quotas and we have no
	103	* quota inodes, then leave will enough alone.
	104	*/
	105
	106	if (fs_quotas &&
	107	(mp->m_sb.sb_uquotino == NULLFSINO \|\| mp->m_sb.sb_uquotino == 0) &&
b36eef04	108	(mp->m_sb.sb_gquotino == NULLFSINO \|\| mp->m_sb.sb_gquotino == 0)) {
2bd0ea18 NS	109	lost_quotas = 1;
	110	fs_quotas = 0;
	111	} else if (!verify_inum(mp, mp->m_sb.sb_uquotino) &&
b36eef04	112	!verify_inum(mp, mp->m_sb.sb_gquotino)) {
2bd0ea18 NS	113	fs_quotas = 1;
	114	}
	115	}
	116
	117
2556c98b BN	118	static void
	119	process_ag_func(
	120	work_queue_t *wq,
	121	xfs_agnumber_t agno,
	122	void *arg)
3b6ac903	123	{
2556c98b	124	wait_for_inode_prefetch(arg);
3b6ac903	125	do_log(_(" - agno = %d\n"), agno);
2556c98b BN	126	process_aginodes(wq->mp, arg, agno, 0, 1, 0);
2556c98b BN	127	cleanup_inode_prefetch(arg);
3b6ac903 MV	128
	129	/*
	130	* now recycle the per-AG duplicate extent records
	131	*/
	132	release_dup_extent_tree(agno);
	133	}
	134
2556c98b BN	135	static void
	136	process_ags(
	137	xfs_mount_t *mp)
	138	{
	139	int i, j;
af2984c9	140	xfs_agnumber_t agno;
2556c98b BN	141	work_queue_t *queues;
	142	prefetch_args_t *pf_args[2];
	143
	144	queues = malloc(thread_count * sizeof(work_queue_t));
	145
	146	if (!libxfs_bcache_overflowed()) {
	147	queues[0].mp = mp;
	148	create_work_queue(&queues[0], mp, libxfs_nproc());
	149	for (i = 0; i < mp->m_sb.sb_agcount; i++)
	150	queue_work(&queues[0], process_ag_func, i, NULL);
	151	destroy_work_queue(&queues[0]);
	152	} else {
	153	if (ag_stride) {
	154	/*
	155	* create one worker thread for each segment of the volume
	156	*/
af2984c9	157	for (i = 0, agno = 0; i < thread_count; i++) {
2556c98b BN	158	create_work_queue(&queues[i], mp, 1);
2556c98b BN	159	pf_args[0] = NULL;
af2984c9 BN	160	for (j = 0; j < ag_stride && agno < mp->m_sb.sb_agcount;
	161	j++, agno++) {
	162	pf_args[0] = start_inode_prefetch(agno, 0, pf_args[0]);
	163	queue_work(&queues[i], process_ag_func, agno, pf_args[0]);
2556c98b BN	164	}
	165	}
	166	/*
	167	* wait for workers to complete
	168	*/
	169	for (i = 0; i < thread_count; i++)
	170	destroy_work_queue(&queues[i]);
	171	} else {
	172	queues[0].mp = mp;
	173	pf_args[0] = start_inode_prefetch(0, 0, NULL);
	174	for (i = 0; i < mp->m_sb.sb_agcount; i++) {
	175	pf_args[(~i) & 1] = start_inode_prefetch(i + 1,
	176	0, pf_args[i & 1]);
	177	process_ag_func(&queues[0], i, pf_args[i & 1]);
	178	}
	179	}
	180	}
	181	free(queues);
	182	}
	183
	184
2bd0ea18 NS	185	void
	186	phase4(xfs_mount_t *mp)
	187	{
	188	ino_tree_node_t *irec;
	189	xfs_drtbno_t bno;
	190	xfs_drtbno_t rt_start;
	191	xfs_extlen_t rt_len;
	192	xfs_agnumber_t i;
	193	xfs_agblock_t j;
	194	xfs_agblock_t ag_end;
8961bfde	195	xfs_extlen_t blen;
2bd0ea18 NS	196	int ag_hdr_len = 4 * mp->m_sb.sb_sectsize;
	197	int ag_hdr_block;
	198	int bstate;
	199	int count_bcnt_extents(xfs_agnumber_t agno);
	200	int count_bno_extents(xfs_agnumber_t agno);
dfc130f3	201
2bd0ea18 NS	202	ag_hdr_block = howmany(ag_hdr_len, mp->m_sb.sb_blocksize);
2bd0ea18 NS	203
507f4e33 NS	204	do_log(_("Phase 4 - check for duplicate blocks...\n"));
507f4e33 NS	205	do_log(_(" - setting up duplicate extent list...\n"));
2bd0ea18	206
06fbdda9 MV	207	set_progress_msg(PROG_FMT_DUP_EXTENT, (__uint64_t) glob_agcount);
06fbdda9 MV	208
2bd0ea18 NS	209	irec = find_inode_rec(XFS_INO_TO_AGNO(mp, mp->m_sb.sb_rootino),
	210	XFS_INO_TO_AGINO(mp, mp->m_sb.sb_rootino));
	211
	212	/*
	213	* we always have a root inode, even if it's free...
	214	* if the root is free, forget it, lost+found is already gone
	215	*/
	216	if (is_inode_free(irec, 0) \|\| !inode_isadir(irec, 0)) {
	217	need_root_inode = 1;
	218	if (no_modify)
507f4e33	219	do_warn(_("root inode would be lost\n"));
2bd0ea18	220	else
507f4e33	221	do_warn(_("root inode lost\n"));
2bd0ea18 NS	222	}
2bd0ea18 NS	223
2bd0ea18 NS	224	for (i = 0; i < mp->m_sb.sb_agcount; i++) {
	225	ag_end = (i < mp->m_sb.sb_agcount - 1) ? mp->m_sb.sb_agblocks :
	226	mp->m_sb.sb_dblocks -
	227	(xfs_drfsbno_t) mp->m_sb.sb_agblocks * i;
8961bfde	228
2bd0ea18 NS	229	/*
	230	* set up duplicate extent list for this ag
	231	*/
8961bfde BN	232	for (j = ag_hdr_block; j < ag_end; j += blen) {
	233	bstate = get_bmap_ext(i, j, ag_end, &blen);
	234	switch (bstate) {
2bd0ea18 NS	235	case XR_E_BAD_STATE:
2bd0ea18 NS	236	default:
507f4e33 NS	237	do_warn(
507f4e33 NS	238	_("unknown block state, ag %d, block %d\n"),
2bd0ea18 NS	239	i, j);
	240	/* fall through .. */
	241	case XR_E_UNKNOWN:
	242	case XR_E_FREE1:
	243	case XR_E_FREE:
	244	case XR_E_INUSE:
	245	case XR_E_INUSE_FS:
	246	case XR_E_INO:
	247	case XR_E_FS_MAP:
2bd0ea18 NS	248	break;
2bd0ea18 NS	249	case XR_E_MULT:
8961bfde	250	add_dup_extent(i, j, blen);
2bd0ea18 NS	251	break;
	252	}
	253	}
8961bfde	254
06fbdda9	255	PROG_RPT_INC(prog_rpt_done[i], 1);
2bd0ea18	256	}
06fbdda9	257	print_final_rpt();
2bd0ea18 NS	258
	259	/*
	260	* initialize realtime bitmap
	261	*/
	262	rt_start = 0;
	263	rt_len = 0;
	264
	265	for (bno = 0; bno < mp->m_sb.sb_rextents; bno++) {
95650c4d	266	bstate = get_rtbmap(bno);
2bd0ea18 NS	267	switch (bstate) {
	268	case XR_E_BAD_STATE:
	269	default:
507f4e33 NS	270	do_warn(_("unknown rt extent state, extent %llu\n"),
507f4e33 NS	271	bno);
2bd0ea18 NS	272	/* fall through .. */
	273	case XR_E_UNKNOWN:
	274	case XR_E_FREE1:
	275	case XR_E_FREE:
	276	case XR_E_INUSE:
	277	case XR_E_INUSE_FS:
	278	case XR_E_INO:
	279	case XR_E_FS_MAP:
	280	if (rt_start == 0)
	281	continue;
	282	else {
	283	/*
	284	* add extent and reset extent state
	285	*/
	286	add_rt_dup_extent(rt_start, rt_len);
	287	rt_start = 0;
	288	rt_len = 0;
	289	}
	290	break;
	291	case XR_E_MULT:
	292	if (rt_start == 0) {
	293	rt_start = bno;
	294	rt_len = 1;
	295	} else if (rt_len == MAXEXTLEN) {
	296	/*
	297	* large extent case
	298	*/
	299	add_rt_dup_extent(rt_start, rt_len);
	300	rt_start = bno;
	301	rt_len = 1;
	302	} else
	303	rt_len++;
	304	break;
	305	}
	306	}
	307
	308	/*
	309	* catch tail-case, extent hitting the end of the ag
	310	*/
	311	if (rt_start != 0)
	312	add_rt_dup_extent(rt_start, rt_len);
	313
	314	/*
	315	* initialize bitmaps for all AGs
	316	*/
c1f7a46c	317	reset_bmaps(mp);
2bd0ea18	318
507f4e33	319	do_log(_(" - check for inodes claiming duplicate blocks...\n"));
06fbdda9	320	set_progress_msg(PROG_FMT_DUP_BLOCKS, (__uint64_t) mp->m_sb.sb_icount);
add3cb90 BN	321
	322	/*
	323	* ok, now process the inodes -- signal 2-pass check per inode.
	324	* first pass checks if the inode conflicts with a known
	325	* duplicate extent. if so, the inode is cleared and second
	326	* pass is skipped. second pass sets the block bitmap
	327	* for all blocks claimed by the inode. directory
	328	* and attribute processing is turned OFF since we did that
	329	* already in phase 3.
	330	*/
2556c98b	331	process_ags(mp);
06fbdda9	332	print_final_rpt();
2bd0ea18 NS	333
	334	/*
	335	* free up memory used to track trealtime duplicate extents
	336	*/
	337	if (rt_start != 0)
	338	free_rt_dup_extent_tree(mp);
	339
	340	/*
	341	* ensure consistency of quota inode pointers in superblock,
	342	* make sure they point to real inodes
	343	*/
	344	quotino_check(mp);
	345	quota_sb_check(mp);
	346	}