/* Set up to repair the realtime bitmap for this group. */ int
xrep_setup_rtbitmap( struct xfs_scrub *sc, struct xchk_rtbitmap *rtb)
{ struct xfs_mount *mp = sc->mp; char *descr; unsignedlonglong blocks = mp->m_sb.sb_rbmblocks; int error;
error = xrep_tempfile_create(sc, S_IFREG); if (error) return error;
/* Create an xfile to hold our reconstructed bitmap. */
descr = xchk_xfile_rtgroup_descr(sc, "bitmap file");
error = xfile_create(descr, blocks * mp->m_sb.sb_blocksize, &sc->xfile);
kfree(descr); if (error) return error;
/* * Reserve enough blocks to write out a completely new bitmap file, * plus twice as many blocks as we would need if we can only allocate * one block per data fork mapping. This should cover the * preallocation of the temporary file and exchanging the extent * mappings. * * We cannot use xfs_exchmaps_estimate because we have not yet * constructed the replacement bitmap and therefore do not know how * many extents it will use. By the time we do, we will have a dirty * transaction (which we cannot drop because we cannot drop the * rtbitmap ILOCK) and cannot ask for more reservation.
*/
blocks += xfs_bmbt_calc_size(mp, blocks) * 2; if (blocks > UINT_MAX) return -EOPNOTSUPP;
/* Perform a logical OR operation on an rtword in the incore bitmap. */ staticint
xrep_rtbitmap_or( struct xchk_rtbitmap *rtb,
xrep_wordoff_t wordoff,
xfs_rtword_t mask)
{
xfs_rtword_t word; int error;
error = xfbmp_load(rtb, wordoff, &word); if (error) return error;
/* * Mark as free every rt extent between the next rt block we expected to see * in the rtrmap records and the given rt block.
*/ STATICint
xrep_rtbitmap_mark_free( struct xchk_rtbitmap *rtb,
xfs_rgblock_t rgbno)
{ struct xfs_mount *mp = rtb->sc->mp; struct xchk_rt *sr = &rtb->sc->sr; struct xfs_rtgroup *rtg = sr->rtg;
xfs_rtxnum_t startrtx;
xfs_rtxnum_t nextrtx;
xrep_wordoff_t wordoff, nextwordoff; unsignedint bit; unsignedint bufwsize;
xfs_extlen_t mod;
xfs_rtword_t mask; enum xbtree_recpacking outcome; int error;
if (!xfs_verify_rgbext(rtg, rtb->next_rgbno, rgbno - rtb->next_rgbno)) return -EFSCORRUPTED;
/* * Convert rt blocks to rt extents The block range we find must be * aligned to an rtextent boundary on both ends.
*/
startrtx = xfs_rgbno_to_rtx(mp, rtb->next_rgbno);
mod = xfs_rgbno_to_rtxoff(mp, rtb->next_rgbno); if (mod) return -EFSCORRUPTED;
/* Must not be shared or CoW staging. */ if (sr->refc_cur) {
error = xfs_refcount_has_records(sr->refc_cur,
XFS_REFC_DOMAIN_SHARED, rtb->next_rgbno,
rgbno - rtb->next_rgbno, &outcome); if (error) return error; if (outcome != XBTREE_RECPACKING_EMPTY) return -EFSCORRUPTED;
error = xfs_refcount_has_records(sr->refc_cur,
XFS_REFC_DOMAIN_COW, rtb->next_rgbno,
rgbno - rtb->next_rgbno, &outcome); if (error) return error; if (outcome != XBTREE_RECPACKING_EMPTY) return -EFSCORRUPTED;
}
/* Set bits as needed to round startrtx up to the nearest word. */
bit = startrtx & XREP_RTBMP_WORDMASK; if (bit) {
xfs_rtblock_t len = nextrtx - startrtx; unsignedint lastbit;
/* Set bits as needed to round nextrtx down to the nearest word. */
bit = nextrtx & XREP_RTBMP_WORDMASK; if (bit) {
mask = ((xfs_rtword_t)1 << bit) - 1;
error = xrep_rtbitmap_or(rtb, rtx_to_wordoff(mp, nextrtx),
mask); if (error || startrtx + bit == nextrtx) return error;
nextrtx -= bit;
}
/* Set all the words in between, up to a whole fs block at once. */
wordoff = rtx_to_wordoff(mp, startrtx);
nextwordoff = rtx_to_wordoff(mp, nextrtx);
bufwsize = mp->m_sb.sb_blocksize >> XFS_WORDLOG;
while (wordoff < nextwordoff) {
xrep_wordoff_t rem;
xrep_wordcnt_t wordcnt;
/* * Try to keep us aligned to the rtwords buffer to reduce the * number of xfile writes.
*/
rem = wordoff & (bufwsize - 1); if (rem)
wordcnt = min_t(xrep_wordcnt_t, wordcnt,
bufwsize - rem);
error = xfbmp_copyin(rtb, wordoff, rtb->words, wordcnt); if (error) return error;
wordoff += wordcnt;
}
return 0;
}
/* Set free space in the rtbitmap based on rtrmapbt records. */ STATICint
xrep_rtbitmap_walk_rtrmap( struct xfs_btree_cur *cur, conststruct xfs_rmap_irec *rec, void *priv)
{ struct xchk_rtbitmap *rtb = priv; int error = 0;
if (xchk_should_terminate(rtb->sc, &error)) return error;
if (rtb->next_rgbno < rec->rm_startblock) {
error = xrep_rtbitmap_mark_free(rtb, rec->rm_startblock); if (error) return error;
}
/* * Walk the rtrmapbt to find all the gaps between records, and mark the gaps * in the realtime bitmap that we're computing.
*/ STATICint
xrep_rtbitmap_find_freespace( struct xchk_rtbitmap *rtb)
{ struct xfs_scrub *sc = rtb->sc; struct xfs_mount *mp = sc->mp; struct xfs_rtgroup *rtg = sc->sr.rtg;
uint64_t blockcount; int error;
/* Prepare a buffer of ones so that we can accelerate bulk setting. */
memset(rtb->words, 0xFF, mp->m_sb.sb_blocksize);
/* * Mark as free every possible rt extent from the last one we saw to * the end of the rt group.
*/
blockcount = rtg->rtg_extents * mp->m_sb.sb_rextsize; if (rtb->next_rgbno < blockcount) {
error = xrep_rtbitmap_mark_free(rtb, blockcount); if (error) goto out;
}
/* * Make sure that the given range of the data fork of the realtime file is * mapped to written blocks. The caller must ensure that the inode is joined * to the transaction.
*/ STATICint
xrep_rtbitmap_data_mappings( struct xfs_scrub *sc,
xfs_filblks_t len)
{ struct xfs_bmbt_irec map;
xfs_fileoff_t off = 0; int error;
ASSERT(sc->ip != NULL);
while (off < len) { int nmaps = 1;
/* * If we have a real extent mapping this block then we're * in ok shape.
*/
error = xfs_bmapi_read(sc->ip, off, len - off, &map, &nmaps,
XFS_DATA_FORK); if (error) return error; if (nmaps == 0) {
ASSERT(nmaps != 0); return -EFSCORRUPTED;
}
/* * Written extents are ok. Holes are not filled because we * do not know the freespace information.
*/ if (xfs_bmap_is_written_extent(&map) ||
map.br_startblock == HOLESTARTBLOCK) {
off = map.br_startoff + map.br_blockcount; continue;
}
/* * If we find a delalloc reservation then something is very * very wrong. Bail out.
*/ if (map.br_startblock == DELAYSTARTBLOCK) return -EFSCORRUPTED;
/* Make sure we're really converting an unwritten extent. */ if (map.br_state != XFS_EXT_UNWRITTEN) {
ASSERT(map.br_state == XFS_EXT_UNWRITTEN); return -EFSCORRUPTED;
}
/* Make sure this block has a real zeroed extent mapped. */
nmaps = 1;
error = xfs_bmapi_write(sc->tp, sc->ip, map.br_startoff,
map.br_blockcount,
XFS_BMAPI_CONVERT | XFS_BMAPI_ZERO,
0, &map, &nmaps); if (error) return error;
/* Commit new extent and all deferred work. */
error = xrep_defer_finish(sc); if (error) return error;
/* We require the realtime rmapbt to rebuild anything. */ if (!xfs_has_rtrmapbt(sc->mp)) return -EOPNOTSUPP; /* We require atomic file exchange range to rebuild anything. */ if (!xfs_has_exchange_range(sc->mp)) return -EOPNOTSUPP;
/* Impossibly large rtbitmap means we can't touch the filesystem. */ if (rtb->rbmblocks > U32_MAX) return 0;
/* * If the size of the rt bitmap file is larger than what we reserved, * figure out if we need to adjust the block reservation in the * transaction.
*/
blocks = xfs_bmbt_calc_size(mp, rtb->rbmblocks); if (blocks > UINT_MAX) return -EOPNOTSUPP; if (blocks > rtb->resblks) {
error = xfs_trans_reserve_more(sc->tp, blocks, 0); if (error) return error;
rtb->resblks += blocks;
}
/* Fix inode core and forks. */
error = xrep_metadata_inode_forks(sc); if (error) return error;
xfs_trans_ijoin(sc->tp, sc->ip, 0);
/* Ensure no unwritten extents. */
error = xrep_rtbitmap_data_mappings(sc, rtb->rbmblocks); if (error) return error;
/* * Fix inconsistent bitmap geometry. This function returns with a * clean scrub transaction.
*/
error = xrep_rtbitmap_geometry(sc, rtb); if (error) return error;
/* * Make sure the busy extent list is clear because we can't put extents * on there twice.
*/ if (!xfs_extent_busy_list_empty(xg, &busy_gen)) {
error = xfs_extent_busy_flush(sc->tp, xg, busy_gen, 0); if (error) return error;
}
/* * Generate the new rtbitmap data. We don't need the rtbmp information * once this call is finished.
*/
error = xrep_rtbitmap_find_freespace(rtb); if (error) return error;
/* * Try to take ILOCK_EXCL of the temporary file. We had better be the * only ones holding onto this inode, but we can't block while holding * the rtbitmap file's ILOCK_EXCL.
*/ while (!xrep_tempfile_ilock_nowait(sc)) { if (xchk_should_terminate(sc, &error)) return error;
delay(1);
}
/* * Make sure we have space allocated for the part of the bitmap * file that corresponds to this group. We already joined sc->ip.
*/
xfs_trans_ijoin(sc->tp, sc->tempip, 0);
error = xrep_tempfile_prealloc(sc, 0, rtb->rbmblocks); if (error) return error;
/* Last chance to abort before we start committing fixes. */ if (xchk_should_terminate(sc, &error)) return error;
/* Copy the bitmap file that we generated. */
error = xrep_tempfile_copyin(sc, 0, rtb->rbmblocks,
xrep_rtbitmap_prep_buf, rtb); if (error) return error;
error = xrep_tempfile_set_isize(sc,
XFS_FSB_TO_B(sc->mp, sc->mp->m_sb.sb_rbmblocks)); if (error) return error;
/* * Now exchange the data fork contents. We're done with the temporary * buffer, so we can reuse it for the tempfile exchmaps information.
*/
error = xrep_tempexch_trans_reserve(sc, XFS_DATA_FORK, 0,
rtb->rbmblocks, &rtb->tempexch); if (error) return error;
error = xrep_tempexch_contents(sc, &rtb->tempexch); if (error) return error;
/* Free the old rtbitmap blocks if they're not in use. */ return xrep_reap_ifork(sc, sc->tempip, XFS_DATA_FORK);
}
Messung V0.5
¤ Dauer der Verarbeitung: 0.1 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.