xfs
[Top] [All Lists]

[PATCH 11/15] xfs_reflink: check the existing reflink btree

To: david@xxxxxxxxxxxxx, darrick.wong@xxxxxxxxxx
Subject: [PATCH 11/15] xfs_reflink: check the existing reflink btree
From: "Darrick J. Wong" <darrick.wong@xxxxxxxxxx>
Date: Mon, 29 Jun 2015 20:26:49 -0700
Cc: xfs@xxxxxxxxxxx
Delivered-to: xfs@xxxxxxxxxxx
In-reply-to: <20150630032538.572.20293.stgit@xxxxxxxxxxxxxxxx>
References: <20150630032538.572.20293.stgit@xxxxxxxxxxxxxxxx>
User-agent: StGit/0.17.1-dirty
Spot-check the reflink btree for obvious errors.

Signed-off-by: Darrick J. Wong <darrick.wong@xxxxxxxxxx>
---
 repair/scan.c |  181 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 181 insertions(+)


diff --git a/repair/scan.c b/repair/scan.c
index afb57f3..1661753 100644
--- a/repair/scan.c
+++ b/repair/scan.c
@@ -1018,6 +1018,174 @@ _("unknown block (%d,%d-%d) mismatch on %s tree, state 
- %d,%" PRIx64 "\n"),
        }
 }
 
+static void
+scan_rlbt(
+       struct xfs_btree_block  *block,
+       int                     level,
+       xfs_agblock_t           bno,
+       xfs_agnumber_t          agno,
+       int                     suspect,
+       int                     isroot,
+       __uint32_t              magic,
+       void                    *priv)
+{
+       struct aghdr_cnts       *agcnts = priv;
+       const char              *name = "rl";
+       int                     i;
+       xfs_reflink_ptr_t       *pp;
+       struct xfs_reflink_rec  *rp;
+       int                     hdr_errors = 0;
+       int                     numrecs;
+       int                     state;
+       xfs_agblock_t           lastblock = 0;
+
+       if (magic != XFS_RLBT_CRC_MAGIC) {
+               name = "(unknown)";
+               assert(0);
+       }
+
+       if (be32_to_cpu(block->bb_magic) != magic) {
+               do_warn(_("bad magic # %#x in bt%s block %d/%d\n"),
+                       be32_to_cpu(block->bb_magic), name, agno, bno);
+               hdr_errors++;
+               if (suspect)
+                       return;
+       }
+
+       /*
+        * All reflink btree blocks except the roots are freed for a
+        * fully empty filesystem, thus they are counted towards the
+        * free data block counter.
+        */
+       if (!isroot) {
+               agcnts->agfbtreeblks++;
+               agcnts->fdblocks++;
+       }
+
+       if (be16_to_cpu(block->bb_level) != level) {
+               do_warn(_("expected level %d got %d in bt%s block %d/%d\n"),
+                       level, be16_to_cpu(block->bb_level), name, agno, bno);
+               hdr_errors++;
+               if (suspect)
+                       return;
+       }
+
+       /* check for btree blocks multiply claimed */
+       state = get_bmap(agno, bno);
+       if (!(state == XR_E_UNKNOWN || state == XR_E_FS_MAP1))  {
+               set_bmap(agno, bno, XR_E_MULT);
+               do_warn(
+_("%s reflink btree block claimed (state %d), agno %d, bno %d, suspect %d\n"),
+                               name, state, agno, bno, suspect);
+               return;
+       }
+       set_bmap(agno, bno, XR_E_FS_MAP);
+
+       numrecs = be16_to_cpu(block->bb_numrecs);
+       if (level == 0) {
+               if (numrecs > mp->m_rlbt_mxr[0])  {
+                       numrecs = mp->m_rlbt_mxr[0];
+                       hdr_errors++;
+               }
+               if (isroot == 0 && numrecs < mp->m_rlbt_mnr[0])  {
+                       numrecs = mp->m_rlbt_mnr[0];
+                       hdr_errors++;
+               }
+
+               if (hdr_errors) {
+                       do_warn(
+       _("bad btree nrecs (%u, min=%u, max=%u) in bt%s block %u/%u\n"),
+                               be16_to_cpu(block->bb_numrecs),
+                               mp->m_rlbt_mnr[0], mp->m_rlbt_mxr[0],
+                               name, agno, bno);
+                       suspect++;
+               }
+
+               rp = XFS_REFLINK_REC_ADDR(block, 1);
+               for (i = 0; i < numrecs; i++) {
+                       xfs_agblock_t           b, end;
+                       xfs_extlen_t            len;
+                       xfs_nlink_t             nr;
+
+                       b = be32_to_cpu(rp[i].rr_startblock);
+                       len = be32_to_cpu(rp[i].rr_blockcount);
+                       nr = be32_to_cpu(rp[i].rr_nlinks);
+                       end = b + len;
+
+                       if (!verify_agbno(mp, agno, b)) {
+                               do_warn(
+       _("invalid start block %u in record %u of %s btree block %u/%u\n"),
+                                       b, i, name, agno, bno);
+                               continue;
+                       }
+                       if (len == 0 || !verify_agbno(mp, agno, end - 1)) {
+                               do_warn(
+       _("invalid length %u in record %u of %s btree block %u/%u\n"),
+                                       len, i, name, agno, bno);
+                               continue;
+                       }
+
+                       if (nr < 2 || nr > MAXRLCOUNT) {
+                               do_warn(
+       _("invalid reference count %u in record %u of %s btree block %u/%u\n"),
+                                       nr, i, name, agno, bno);
+                               continue;
+                       }
+
+                       if (b && b <= lastblock) {
+                               do_warn(_(
+       "out-of-order %s btree record %d (%u %u) block %u/%u\n"),
+                                       name, i, b, len, agno, bno);
+                       } else {
+                               lastblock = b;
+                       }
+
+                       /* XXX: probably want to mark the reflinked areas? */
+               }
+               return;
+       }
+
+       /*
+        * interior record
+        */
+       pp = XFS_REFLINK_PTR_ADDR(block, 1, mp->m_rmap_mxr[1]);
+
+       if (numrecs > mp->m_rlbt_mxr[1])  {
+               numrecs = mp->m_rlbt_mxr[1];
+               hdr_errors++;
+       }
+       if (isroot == 0 && numrecs < mp->m_rlbt_mnr[1])  {
+               numrecs = mp->m_rlbt_mnr[1];
+               hdr_errors++;
+       }
+
+       /*
+        * don't pass bogus tree flag down further if this block
+        * looked ok.  bail out if two levels in a row look bad.
+        */
+       if (hdr_errors)  {
+               do_warn(
+       _("bad btree nrecs (%u, min=%u, max=%u) in bt%s block %u/%u\n"),
+                       be16_to_cpu(block->bb_numrecs),
+                       mp->m_rlbt_mnr[1], mp->m_rlbt_mxr[1],
+                       name, agno, bno);
+               if (suspect)
+                       return;
+               suspect++;
+       } else if (suspect) {
+               suspect = 0;
+       }
+
+       for (i = 0; i < numrecs; i++)  {
+               xfs_agblock_t           bno = be32_to_cpu(pp[i]);
+
+               if (bno != 0 && verify_agbno(mp, agno, bno)) {
+                       scan_sbtree(bno, level, agno, suspect, scan_rlbt, 0,
+                                   magic, priv, &xfs_reflinkbt_buf_ops);
+               }
+       }
+}
+
 static int
 scan_single_ino_chunk(
        xfs_agnumber_t          agno,
@@ -1803,6 +1971,19 @@ validate_agf(
                }
        }
 
+       if (xfs_sb_version_hasreflink(&mp->m_sb)) {
+               bno = be32_to_cpu(agf->agf_reflink_root);
+               if (bno != 0 && verify_agbno(mp, agno, bno)) {
+                       scan_sbtree(bno,
+                                   be32_to_cpu(agf->agf_reflink_level),
+                                   agno, 0, scan_rlbt, 1, XFS_RLBT_CRC_MAGIC,
+                                   agcnts, &xfs_reflinkbt_buf_ops);
+               } else  {
+                       do_warn(_("bad agbno %u for rlbt root, agno %d\n"),
+                               bno, agno);
+               }
+       }
+
        if (be32_to_cpu(agf->agf_freeblks) != agcnts->agffreeblks) {
                do_warn(_("agf_freeblks %u, counted %u in ag %u\n"),
                        be32_to_cpu(agf->agf_freeblks), agcnts->agffreeblks, 
agno);

<Prev in Thread] Current Thread [Next in Thread>