struct xchk_rtrmap { /* * The furthest-reaching of the rmapbt records that we've already * processed. This enables us to detect overlapping records for space * allocations that cannot be shared.
*/ struct xfs_rmap_irec overlap_rec;
/* * The previous rmapbt record, so that we can check for two records * that could be one.
*/ struct xfs_rmap_irec prev_rec;
};
staticinlinebool
xchk_rtrmapbt_is_shareable( struct xfs_scrub *sc, conststruct xfs_rmap_irec *irec)
{ if (!xfs_has_rtreflink(sc->mp)) returnfalse; if (irec->rm_flags & XFS_RMAP_UNWRITTEN) returnfalse; returntrue;
}
/* Flag failures for records that overlap but cannot. */ STATICvoid
xchk_rtrmapbt_check_overlapping( struct xchk_btree *bs, struct xchk_rtrmap *cr, conststruct xfs_rmap_irec *irec)
{
xfs_rtblock_t pnext, inext;
if (bs->sc->sm->sm_flags & XFS_SCRUB_OFLAG_CORRUPT) return;
/* No previous record? */ if (cr->overlap_rec.rm_blockcount == 0) goto set_prev;
/* Do overlap_rec and irec overlap? */
pnext = cr->overlap_rec.rm_startblock + cr->overlap_rec.rm_blockcount; if (pnext <= irec->rm_startblock) goto set_prev;
/* Overlap is only allowed if both records are data fork mappings. */ if (!xchk_rtrmapbt_is_shareable(bs->sc, &cr->overlap_rec) ||
!xchk_rtrmapbt_is_shareable(bs->sc, irec))
xchk_btree_set_corrupt(bs->sc, bs->cur, 0);
/* Save whichever rmap record extends furthest. */
inext = irec->rm_startblock + irec->rm_blockcount; if (pnext > inext) return;
/* Decide if two reverse-mapping records can be merged. */ staticinlinebool
xchk_rtrmap_mergeable( struct xchk_rtrmap *cr, conststruct xfs_rmap_irec *r2)
{ conststruct xfs_rmap_irec *r1 = &cr->prev_rec;
/* Ignore if prev_rec is not yet initialized. */ if (cr->prev_rec.rm_blockcount == 0) returnfalse;
if (r1->rm_owner != r2->rm_owner) returnfalse; if (r1->rm_startblock + r1->rm_blockcount != r2->rm_startblock) returnfalse; if ((unsignedlonglong)r1->rm_blockcount + r2->rm_blockcount >
XFS_RMAP_LEN_MAX) returnfalse; if (r1->rm_flags != r2->rm_flags) returnfalse; return r1->rm_offset + r1->rm_blockcount == r2->rm_offset;
}
/* Flag failures for records that could be merged. */ STATICvoid
xchk_rtrmapbt_check_mergeable( struct xchk_btree *bs, struct xchk_rtrmap *cr, conststruct xfs_rmap_irec *irec)
{ if (bs->sc->sm->sm_flags & XFS_SCRUB_OFLAG_CORRUPT) return;
if (xchk_rtrmap_mergeable(cr, irec))
xchk_btree_set_corrupt(bs->sc, bs->cur, 0);
/* If this is shared, must be a data fork extent. */
error = xfs_refcount_find_shared(sc->sr.refc_cur, irec->rm_startblock,
irec->rm_blockcount, &fbno, &flen, false); if (!xchk_should_check_xref(sc, &error, &sc->sr.refc_cur)) return; if (flen != 0 && (!is_inode || is_attr || is_bmbt || is_unwritten))
xchk_btree_xref_set_corrupt(sc, sc->sr.refc_cur, 0);
}
/* Cross-reference with other metadata. */ STATICvoid
xchk_rtrmapbt_xref( struct xfs_scrub *sc, struct xfs_rmap_irec *irec)
{ if (sc->sm->sm_flags & XFS_SCRUB_OFLAG_CORRUPT) return;
/* xref check that the extent has no realtime reverse mapping at all */ void
xchk_xref_has_no_rt_owner( struct xfs_scrub *sc,
xfs_rgblock_t bno,
xfs_extlen_t len)
{ enum xbtree_recpacking outcome; int error;
if (!sc->sr.rmap_cur || xchk_skip_xref(sc->sm)) return;
error = xfs_rmap_has_records(sc->sr.rmap_cur, bno, len, &outcome); if (!xchk_should_check_xref(sc, &error, &sc->sr.rmap_cur)) return; if (outcome != XBTREE_RECPACKING_EMPTY)
xchk_btree_xref_set_corrupt(sc, sc->sr.rmap_cur, 0);
}
/* xref check that the extent is completely mapped */ void
xchk_xref_has_rt_owner( struct xfs_scrub *sc,
xfs_rgblock_t bno,
xfs_extlen_t len)
{ enum xbtree_recpacking outcome; int error;
if (!sc->sr.rmap_cur || xchk_skip_xref(sc->sm)) return;
error = xfs_rmap_has_records(sc->sr.rmap_cur, bno, len, &outcome); if (!xchk_should_check_xref(sc, &error, &sc->sr.rmap_cur)) return; if (outcome != XBTREE_RECPACKING_FULL)
xchk_btree_xref_set_corrupt(sc, sc->sr.rmap_cur, 0);
}
/* xref check that the extent is only owned by a given owner */ void
xchk_xref_is_only_rt_owned_by( struct xfs_scrub *sc,
xfs_agblock_t bno,
xfs_extlen_t len, conststruct xfs_owner_info *oinfo)
{ struct xfs_rmap_matches res; int error;
if (!sc->sr.rmap_cur || xchk_skip_xref(sc->sm)) return;
error = xfs_rmap_count_owners(sc->sr.rmap_cur, bno, len, oinfo, &res); if (!xchk_should_check_xref(sc, &error, &sc->sr.rmap_cur)) return; if (res.matches != 1)
xchk_btree_xref_set_corrupt(sc, sc->sr.rmap_cur, 0); if (res.bad_non_owner_matches)
xchk_btree_xref_set_corrupt(sc, sc->sr.rmap_cur, 0); if (res.non_owner_matches)
xchk_btree_xref_set_corrupt(sc, sc->sr.rmap_cur, 0);
}
Messung V0.5
¤ Dauer der Verarbeitung: 0.10 Sekunden
(vorverarbeitet)
¤
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.