1 // SPDX-License-Identifier: GPL-2.0-or-later
3  * Copyright (C) 2022-2023 Oracle.  All Rights Reserved.
42  * Disposal of Blocks from Old Metadata
45  * to dispose of the blocks that (we think) the old btree was using.
48  * blocks with the same rmap owner that are owned by another data structure
50  * remaining in bitmap are the old btree's blocks.
53  * blocks on disk.  The rmap data can tell us if there are multiple owners, so
60  * will be rebuilt (atop different blocks), thereby removing all the cross
122 	error = xfs_rmap_alloc(sc->tp, sc->sa.agf_bp, sc->sa.pag, agbno, 1,  in xreap_put_freelist()
128 	error = xfs_alloc_read_agfl(sc->sa.pag, sc->tp, &agfl_bp);  in xreap_put_freelist()
132 	error = xfs_alloc_put_freelist(sc->sa.pag, sc->tp, sc->sa.agf_bp,  in xreap_put_freelist()
136 	xfs_extent_busy_insert(sc->tp, sc->sa.pag, agbno, 1,  in xreap_put_freelist()
145 	if (rs->force_roll)  in xreap_dirty()
147 	if (rs->deferred)  in xreap_dirty()
149 	if (rs->invalidated)  in xreap_dirty()
151 	if (rs->total_deferred)  in xreap_dirty()
166 	if (rs->force_roll)  in xreap_want_roll()
168 	if (rs->deferred > XREP_MAX_ITRUNCATE_EFIS)  in xreap_want_roll()
170 	if (rs->invalidated > XREAP_MAX_BINVAL)  in xreap_want_roll()
177 	rs->total_deferred += rs->deferred;  in xreap_reset()
178 	rs->deferred = 0;  in xreap_reset()
179 	rs->invalidated = 0;  in xreap_reset()
180 	rs->force_roll = false;  in xreap_reset()
195 	if (rs->force_roll)  in xreap_want_defer_finish()
197 	if (rs->total_deferred > XREAP_MAX_DEFER_CHAIN)  in xreap_want_defer_finish()
204 	rs->total_deferred = 0;  in xreap_defer_finish_reset()
205 	rs->deferred = 0;  in xreap_defer_finish_reset()
206 	rs->invalidated = 0;  in xreap_defer_finish_reset()
207 	rs->force_roll = false;  in xreap_defer_finish_reset()
217 	struct xfs_scrub	*sc = rs->sc;  in xreap_agextent_binval()
218 	struct xfs_perag	*pag = sc->sa.pag;  in xreap_agextent_binval()
219 	struct xfs_mount	*mp = sc->mp;  in xreap_agextent_binval()
220 	xfs_agnumber_t		agno = sc->sa.pag->pag_agno;  in xreap_agextent_binval()
225 	 * Avoid invalidating AG headers and post-EOFS blocks because we never  in xreap_agextent_binval()
229 	    !xfs_verify_agbno(pag, agbno_next - 1))  in xreap_agextent_binval()
233 	 * If there are incore buffers for these blocks, invalidate them.  We  in xreap_agextent_binval()
247 		max_fsbs = min_t(xfs_agblock_t, agbno_next - bno,  in xreap_agextent_binval()
256 			error = xfs_buf_incore(mp->m_ddev_targp, daddr,  in xreap_agextent_binval()
262 			xfs_trans_bjoin(sc->tp, bp);  in xreap_agextent_binval()
263 			xfs_trans_binval(sc->tp, bp);  in xreap_agextent_binval()
264 			rs->invalidated++;  in xreap_agextent_binval()
271 			if (rs->invalidated > XREAP_MAX_BINVAL) {  in xreap_agextent_binval()
272 				*aglenp -= agbno_next - bno;  in xreap_agextent_binval()
281 	trace_xreap_agextent_binval(sc->sa.pag, agbno, *aglenp);  in xreap_agextent_binval()
285  * Figure out the longest run of blocks that we can dispose of with a single
286  * call.  Cross-linked blocks should have their reverse mappings removed, but
287  * single-owner extents can be freed.  AGFL blocks can only be put back one at
298 	struct xfs_scrub	*sc = rs->sc;  in xreap_agextent_select()
308 	cur = xfs_rmapbt_init_cursor(sc->mp, sc->tp, sc->sa.agf_bp,  in xreap_agextent_select()
309 			sc->sa.pag);  in xreap_agextent_select()
310 	error = xfs_rmap_has_other_keys(cur, agbno, 1, rs->oinfo,  in xreap_agextent_select()
315 	/* AGFL blocks can only be deal with one at a time. */  in xreap_agextent_select()
316 	if (rs->resv == XFS_AG_RESV_AGFL)  in xreap_agextent_select()
320 	 * Figure out how many of the subsequent blocks have the same crosslink  in xreap_agextent_select()
326 		error = xfs_rmap_has_other_keys(cur, bno, 1, rs->oinfo,  in xreap_agextent_select()
340 	trace_xreap_agextent_select(sc->sa.pag, agbno, len, *crosslinked);  in xreap_agextent_select()
348  * number of blocks disposed of will be returned in @aglenp.
357 	struct xfs_scrub	*sc = rs->sc;  in xreap_agextent_iter()
361 	fsbno = XFS_AGB_TO_FSB(sc->mp, sc->sa.pag->pag_agno, agbno);  in xreap_agextent_iter()
370 	 * metadata structure is crosslinked with a multi-block structure  in xreap_agextent_iter()
377 		trace_xreap_dispose_unmap_extent(sc->sa.pag, agbno, *aglenp);  in xreap_agextent_iter()
379 		rs->force_roll = true;  in xreap_agextent_iter()
380 		return xfs_rmap_free(sc->tp, sc->sa.agf_bp, sc->sa.pag, agbno,  in xreap_agextent_iter()
381 				*aglenp, rs->oinfo);  in xreap_agextent_iter()
384 	trace_xreap_dispose_free_extent(sc->sa.pag, agbno, *aglenp);  in xreap_agextent_iter()
398 	/* Put blocks back on the AGFL one at a time. */  in xreap_agextent_iter()
399 	if (rs->resv == XFS_AG_RESV_AGFL) {  in xreap_agextent_iter()
405 		rs->force_roll = true;  in xreap_agextent_iter()
410 	 * Use deferred frees to get rid of the old btree blocks to try to  in xreap_agextent_iter()
411 	 * minimize the window in which we could crash and lose the old blocks.  in xreap_agextent_iter()
413 	error = __xfs_free_extent_later(sc->tp, fsbno, *aglenp, rs->oinfo,  in xreap_agextent_iter()
414 			rs->resv, true);  in xreap_agextent_iter()
418 	rs->deferred++;  in xreap_agextent_iter()
423  * Break an AG metadata extent into sub-extents by fate (crosslinked, not
424  * crosslinked), and dispose of each sub-extent separately.
433 	struct xfs_scrub	*sc = rs->sc;  in xreap_agmeta_extent()
439 	ASSERT(sc->ip == NULL);  in xreap_agmeta_extent()
487 	ASSERT(xfs_has_rmapbt(sc->mp));  in xrep_reap_agblocks()
488 	ASSERT(sc->ip == NULL);  in xrep_reap_agblocks()