projects / mirror_ubuntu-jammy-kernel.git / blame
| Commit | Line | Data |
|---|---|---|
| efa7a99c DW |
1 | /* |
| 2 | * Copyright (C) 2017 Oracle. All Rights Reserved. | |
| 3 | * | |
| 4 | * Author: Darrick J. Wong <darrick.wong@oracle.com> | |
| 5 | * | |
| 6 | * This program is free software; you can redistribute it and/or | |
| 7 | * modify it under the terms of the GNU General Public License | |
| 8 | * as published by the Free Software Foundation; either version 2 | |
| 9 | * of the License, or (at your option) any later version. | |
| 10 | * | |
| 11 | * This program is distributed in the hope that it would be useful, | |
| 12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
| 13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
| 14 | * GNU General Public License for more details. | |
| 15 | * | |
| 16 | * You should have received a copy of the GNU General Public License | |
| 17 | * along with this program; if not, write the Free Software Foundation, | |
| 18 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. | |
| 19 | */ | |
| 20 | #include "xfs.h" | |
| 21 | #include "xfs_fs.h" | |
| 22 | #include "xfs_shared.h" | |
| 23 | #include "xfs_format.h" | |
| 24 | #include "xfs_trans_resv.h" | |
| 25 | #include "xfs_mount.h" | |
| 26 | #include "xfs_defer.h" | |
| 27 | #include "xfs_btree.h" | |
| 28 | #include "xfs_bit.h" | |
| 29 | #include "xfs_log_format.h" | |
| 30 | #include "xfs_trans.h" | |
| 31 | #include "xfs_sb.h" | |
| 32 | #include "xfs_alloc.h" | |
| 33 | #include "xfs_rmap.h" | |
| 34 | #include "scrub/xfs_scrub.h" | |
| 35 | #include "scrub/scrub.h" | |
| 36 | #include "scrub/common.h" | |
| 37 | #include "scrub/btree.h" | |
| 38 | #include "scrub/trace.h" | |
| 39 | ||
| 40 | /* | |
| 41 | * Set us up to scrub free space btrees. | |
| 42 | */ | |
| 43 | int | |
| 44 | xfs_scrub_setup_ag_allocbt( | |
| 45 | struct xfs_scrub_context *sc, | |
| 46 | struct xfs_inode *ip) | |
| 47 | { | |
| 48 | return xfs_scrub_setup_ag_btree(sc, ip, false); | |
| 49 | } | |
| 50 | ||
| 51 | /* Free space btree scrubber. */ | |
| 52 | ||
| 53 | /* Scrub a bnobt/cntbt record. */ | |
| 54 | STATIC int | |
| 55 | xfs_scrub_allocbt_rec( | |
| 56 | struct xfs_scrub_btree *bs, | |
| 57 | union xfs_btree_rec *rec) | |
| 58 | { | |
| 59 | struct xfs_mount *mp = bs->cur->bc_mp; | |
| 60 | xfs_agnumber_t agno = bs->cur->bc_private.a.agno; | |
| 61 | xfs_agblock_t bno; | |
| 62 | xfs_extlen_t len; | |
| 63 | int error = 0; | |
| 64 | ||
| 65 | bno = be32_to_cpu(rec->alloc.ar_startblock); | |
| 66 | len = be32_to_cpu(rec->alloc.ar_blockcount); | |
| 67 | ||
| 68 | if (bno + len <= bno || | |
| 69 | !xfs_verify_agbno(mp, agno, bno) || | |
| 70 | !xfs_verify_agbno(mp, agno, bno + len - 1)) | |
| 71 | xfs_scrub_btree_set_corrupt(bs->sc, bs->cur, 0); | |
| 72 | ||
| 73 | return error; | |
| 74 | } | |
| 75 | ||
| 76 | /* Scrub the freespace btrees for some AG. */ | |
| 77 | STATIC int | |
| 78 | xfs_scrub_allocbt( | |
| 79 | struct xfs_scrub_context *sc, | |
| 80 | xfs_btnum_t which) | |
| 81 | { | |
| 82 | struct xfs_owner_info oinfo; | |
| 83 | struct xfs_btree_cur *cur; | |
| 84 | ||
| 85 | xfs_rmap_ag_owner(&oinfo, XFS_RMAP_OWN_AG); | |
| 86 | cur = which == XFS_BTNUM_BNO ? sc->sa.bno_cur : sc->sa.cnt_cur; | |
| 87 | return xfs_scrub_btree(sc, cur, xfs_scrub_allocbt_rec, &oinfo, NULL); | |
| 88 | } | |
| 89 | ||
| 90 | int | |
| 91 | xfs_scrub_bnobt( | |
| 92 | struct xfs_scrub_context *sc) | |
| 93 | { | |
| 94 | return xfs_scrub_allocbt(sc, XFS_BTNUM_BNO); | |
| 95 | } | |
| 96 | ||
| 97 | int | |
| 98 | xfs_scrub_cntbt( | |
| 99 | struct xfs_scrub_context *sc) | |
| 100 | { | |
| 101 | return xfs_scrub_allocbt(sc, XFS_BTNUM_CNT); | |
| 102 | } |