^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1) // SPDX-License-Identifier: GPL-2.0+
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3) * Copyright (C) 2017 Oracle. All Rights Reserved.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 4) * Author: Darrick J. Wong <darrick.wong@oracle.com>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 5) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 6) #include "xfs.h"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 7) #include "xfs_fs.h"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 8) #include "xfs_shared.h"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 9) #include "xfs_format.h"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 10) #include "xfs_trans_resv.h"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 11) #include "xfs_mount.h"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 12) #include "xfs_btree.h"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 13) #include "scrub/scrub.h"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 14) #include "scrub/common.h"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 15) #include "scrub/btree.h"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 16) #include "scrub/trace.h"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 17)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 18) /* btree scrubbing */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 19)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 20) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 21) * Check for btree operation errors. See the section about handling
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 22) * operational errors in common.c.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 23) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 24) static bool
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 25) __xchk_btree_process_error(
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 26) struct xfs_scrub *sc,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 27) struct xfs_btree_cur *cur,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 28) int level,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 29) int *error,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 30) __u32 errflag,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 31) void *ret_ip)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 32) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 33) if (*error == 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 34) return true;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 35)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 36) switch (*error) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 37) case -EDEADLOCK:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 38) /* Used to restart an op with deadlock avoidance. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 39) trace_xchk_deadlock_retry(sc->ip, sc->sm, *error);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 40) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 41) case -EFSBADCRC:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 42) case -EFSCORRUPTED:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 43) /* Note the badness but don't abort. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 44) sc->sm->sm_flags |= errflag;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 45) *error = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 46) /* fall through */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 47) default:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 48) if (cur->bc_flags & XFS_BTREE_ROOT_IN_INODE)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 49) trace_xchk_ifork_btree_op_error(sc, cur, level,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 50) *error, ret_ip);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 51) else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 52) trace_xchk_btree_op_error(sc, cur, level,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 53) *error, ret_ip);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 54) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 55) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 56) return false;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 57) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 58)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 59) bool
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 60) xchk_btree_process_error(
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 61) struct xfs_scrub *sc,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 62) struct xfs_btree_cur *cur,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 63) int level,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 64) int *error)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 65) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 66) return __xchk_btree_process_error(sc, cur, level, error,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 67) XFS_SCRUB_OFLAG_CORRUPT, __return_address);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 68) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 69)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 70) bool
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 71) xchk_btree_xref_process_error(
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 72) struct xfs_scrub *sc,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 73) struct xfs_btree_cur *cur,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 74) int level,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 75) int *error)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 76) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 77) return __xchk_btree_process_error(sc, cur, level, error,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 78) XFS_SCRUB_OFLAG_XFAIL, __return_address);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 79) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 80)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 81) /* Record btree block corruption. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 82) static void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 83) __xchk_btree_set_corrupt(
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 84) struct xfs_scrub *sc,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 85) struct xfs_btree_cur *cur,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 86) int level,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 87) __u32 errflag,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 88) void *ret_ip)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 89) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 90) sc->sm->sm_flags |= errflag;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 91)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 92) if (cur->bc_flags & XFS_BTREE_ROOT_IN_INODE)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 93) trace_xchk_ifork_btree_error(sc, cur, level,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 94) ret_ip);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 95) else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 96) trace_xchk_btree_error(sc, cur, level,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 97) ret_ip);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 98) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 99)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 100) void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 101) xchk_btree_set_corrupt(
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 102) struct xfs_scrub *sc,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 103) struct xfs_btree_cur *cur,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 104) int level)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 105) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 106) __xchk_btree_set_corrupt(sc, cur, level, XFS_SCRUB_OFLAG_CORRUPT,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 107) __return_address);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 108) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 109)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 110) void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 111) xchk_btree_xref_set_corrupt(
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 112) struct xfs_scrub *sc,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 113) struct xfs_btree_cur *cur,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 114) int level)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 115) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 116) __xchk_btree_set_corrupt(sc, cur, level, XFS_SCRUB_OFLAG_XCORRUPT,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 117) __return_address);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 118) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 119)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 120) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 121) * Make sure this record is in order and doesn't stray outside of the parent
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 122) * keys.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 123) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 124) STATIC void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 125) xchk_btree_rec(
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 126) struct xchk_btree *bs)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 127) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 128) struct xfs_btree_cur *cur = bs->cur;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 129) union xfs_btree_rec *rec;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 130) union xfs_btree_key key;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 131) union xfs_btree_key hkey;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 132) union xfs_btree_key *keyp;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 133) struct xfs_btree_block *block;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 134) struct xfs_btree_block *keyblock;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 135) struct xfs_buf *bp;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 136)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 137) block = xfs_btree_get_block(cur, 0, &bp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 138) rec = xfs_btree_rec_addr(cur, cur->bc_ptrs[0], block);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 139)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 140) trace_xchk_btree_rec(bs->sc, cur, 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 141)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 142) /* If this isn't the first record, are they in order? */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 143) if (!bs->firstrec && !cur->bc_ops->recs_inorder(cur, &bs->lastrec, rec))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 144) xchk_btree_set_corrupt(bs->sc, cur, 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 145) bs->firstrec = false;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 146) memcpy(&bs->lastrec, rec, cur->bc_ops->rec_len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 147)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 148) if (cur->bc_nlevels == 1)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 149) return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 150)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 151) /* Is this at least as large as the parent low key? */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 152) cur->bc_ops->init_key_from_rec(&key, rec);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 153) keyblock = xfs_btree_get_block(cur, 1, &bp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 154) keyp = xfs_btree_key_addr(cur, cur->bc_ptrs[1], keyblock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 155) if (cur->bc_ops->diff_two_keys(cur, &key, keyp) < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 156) xchk_btree_set_corrupt(bs->sc, cur, 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 157)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 158) if (!(cur->bc_flags & XFS_BTREE_OVERLAPPING))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 159) return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 160)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 161) /* Is this no larger than the parent high key? */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 162) cur->bc_ops->init_high_key_from_rec(&hkey, rec);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 163) keyp = xfs_btree_high_key_addr(cur, cur->bc_ptrs[1], keyblock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 164) if (cur->bc_ops->diff_two_keys(cur, keyp, &hkey) < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 165) xchk_btree_set_corrupt(bs->sc, cur, 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 166) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 167)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 168) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 169) * Make sure this key is in order and doesn't stray outside of the parent
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 170) * keys.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 171) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 172) STATIC void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 173) xchk_btree_key(
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 174) struct xchk_btree *bs,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 175) int level)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 176) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 177) struct xfs_btree_cur *cur = bs->cur;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 178) union xfs_btree_key *key;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 179) union xfs_btree_key *keyp;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 180) struct xfs_btree_block *block;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 181) struct xfs_btree_block *keyblock;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 182) struct xfs_buf *bp;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 183)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 184) block = xfs_btree_get_block(cur, level, &bp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 185) key = xfs_btree_key_addr(cur, cur->bc_ptrs[level], block);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 186)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 187) trace_xchk_btree_key(bs->sc, cur, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 188)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 189) /* If this isn't the first key, are they in order? */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 190) if (!bs->firstkey[level] &&
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 191) !cur->bc_ops->keys_inorder(cur, &bs->lastkey[level], key))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 192) xchk_btree_set_corrupt(bs->sc, cur, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 193) bs->firstkey[level] = false;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 194) memcpy(&bs->lastkey[level], key, cur->bc_ops->key_len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 195)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 196) if (level + 1 >= cur->bc_nlevels)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 197) return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 198)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 199) /* Is this at least as large as the parent low key? */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 200) keyblock = xfs_btree_get_block(cur, level + 1, &bp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 201) keyp = xfs_btree_key_addr(cur, cur->bc_ptrs[level + 1], keyblock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 202) if (cur->bc_ops->diff_two_keys(cur, key, keyp) < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 203) xchk_btree_set_corrupt(bs->sc, cur, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 204)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 205) if (!(cur->bc_flags & XFS_BTREE_OVERLAPPING))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 206) return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 207)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 208) /* Is this no larger than the parent high key? */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 209) key = xfs_btree_high_key_addr(cur, cur->bc_ptrs[level], block);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 210) keyp = xfs_btree_high_key_addr(cur, cur->bc_ptrs[level + 1], keyblock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 211) if (cur->bc_ops->diff_two_keys(cur, keyp, key) < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 212) xchk_btree_set_corrupt(bs->sc, cur, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 213) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 214)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 215) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 216) * Check a btree pointer. Returns true if it's ok to use this pointer.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 217) * Callers do not need to set the corrupt flag.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 218) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 219) static bool
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 220) xchk_btree_ptr_ok(
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 221) struct xchk_btree *bs,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 222) int level,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 223) union xfs_btree_ptr *ptr)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 224) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 225) bool res;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 226)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 227) /* A btree rooted in an inode has no block pointer to the root. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 228) if ((bs->cur->bc_flags & XFS_BTREE_ROOT_IN_INODE) &&
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 229) level == bs->cur->bc_nlevels)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 230) return true;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 231)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 232) /* Otherwise, check the pointers. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 233) if (bs->cur->bc_flags & XFS_BTREE_LONG_PTRS)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 234) res = xfs_btree_check_lptr(bs->cur, be64_to_cpu(ptr->l), level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 235) else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 236) res = xfs_btree_check_sptr(bs->cur, be32_to_cpu(ptr->s), level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 237) if (!res)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 238) xchk_btree_set_corrupt(bs->sc, bs->cur, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 239)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 240) return res;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 241) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 242)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 243) /* Check that a btree block's sibling matches what we expect it. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 244) STATIC int
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 245) xchk_btree_block_check_sibling(
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 246) struct xchk_btree *bs,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 247) int level,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 248) int direction,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 249) union xfs_btree_ptr *sibling)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 250) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 251) struct xfs_btree_cur *cur = bs->cur;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 252) struct xfs_btree_block *pblock;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 253) struct xfs_buf *pbp;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 254) struct xfs_btree_cur *ncur = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 255) union xfs_btree_ptr *pp;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 256) int success;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 257) int error;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 258)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 259) error = xfs_btree_dup_cursor(cur, &ncur);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 260) if (!xchk_btree_process_error(bs->sc, cur, level + 1, &error) ||
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 261) !ncur)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 262) return error;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 263)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 264) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 265) * If the pointer is null, we shouldn't be able to move the upper
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 266) * level pointer anywhere.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 267) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 268) if (xfs_btree_ptr_is_null(cur, sibling)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 269) if (direction > 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 270) error = xfs_btree_increment(ncur, level + 1, &success);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 271) else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 272) error = xfs_btree_decrement(ncur, level + 1, &success);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 273) if (error == 0 && success)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 274) xchk_btree_set_corrupt(bs->sc, cur, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 275) error = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 276) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 277) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 278)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 279) /* Increment upper level pointer. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 280) if (direction > 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 281) error = xfs_btree_increment(ncur, level + 1, &success);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 282) else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 283) error = xfs_btree_decrement(ncur, level + 1, &success);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 284) if (!xchk_btree_process_error(bs->sc, cur, level + 1, &error))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 285) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 286) if (!success) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 287) xchk_btree_set_corrupt(bs->sc, cur, level + 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 288) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 289) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 290)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 291) /* Compare upper level pointer to sibling pointer. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 292) pblock = xfs_btree_get_block(ncur, level + 1, &pbp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 293) pp = xfs_btree_ptr_addr(ncur, ncur->bc_ptrs[level + 1], pblock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 294) if (!xchk_btree_ptr_ok(bs, level + 1, pp))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 295) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 296) if (pbp)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 297) xchk_buffer_recheck(bs->sc, pbp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 298)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 299) if (xfs_btree_diff_two_ptrs(cur, pp, sibling))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 300) xchk_btree_set_corrupt(bs->sc, cur, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 301) out:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 302) xfs_btree_del_cursor(ncur, XFS_BTREE_ERROR);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 303) return error;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 304) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 305)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 306) /* Check the siblings of a btree block. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 307) STATIC int
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 308) xchk_btree_block_check_siblings(
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 309) struct xchk_btree *bs,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 310) struct xfs_btree_block *block)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 311) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 312) struct xfs_btree_cur *cur = bs->cur;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 313) union xfs_btree_ptr leftsib;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 314) union xfs_btree_ptr rightsib;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 315) int level;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 316) int error = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 317)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 318) xfs_btree_get_sibling(cur, block, &leftsib, XFS_BB_LEFTSIB);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 319) xfs_btree_get_sibling(cur, block, &rightsib, XFS_BB_RIGHTSIB);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 320) level = xfs_btree_get_level(block);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 321)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 322) /* Root block should never have siblings. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 323) if (level == cur->bc_nlevels - 1) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 324) if (!xfs_btree_ptr_is_null(cur, &leftsib) ||
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 325) !xfs_btree_ptr_is_null(cur, &rightsib))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 326) xchk_btree_set_corrupt(bs->sc, cur, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 327) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 328) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 329)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 330) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 331) * Does the left & right sibling pointers match the adjacent
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 332) * parent level pointers?
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 333) * (These function absorbs error codes for us.)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 334) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 335) error = xchk_btree_block_check_sibling(bs, level, -1, &leftsib);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 336) if (error)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 337) return error;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 338) error = xchk_btree_block_check_sibling(bs, level, 1, &rightsib);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 339) if (error)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 340) return error;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 341) out:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 342) return error;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 343) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 344)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 345) struct check_owner {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 346) struct list_head list;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 347) xfs_daddr_t daddr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 348) int level;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 349) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 350)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 351) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 352) * Make sure this btree block isn't in the free list and that there's
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 353) * an rmap record for it.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 354) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 355) STATIC int
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 356) xchk_btree_check_block_owner(
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 357) struct xchk_btree *bs,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 358) int level,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 359) xfs_daddr_t daddr)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 360) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 361) xfs_agnumber_t agno;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 362) xfs_agblock_t agbno;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 363) xfs_btnum_t btnum;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 364) bool init_sa;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 365) int error = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 366)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 367) if (!bs->cur)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 368) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 369)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 370) btnum = bs->cur->bc_btnum;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 371) agno = xfs_daddr_to_agno(bs->cur->bc_mp, daddr);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 372) agbno = xfs_daddr_to_agbno(bs->cur->bc_mp, daddr);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 373)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 374) init_sa = bs->cur->bc_flags & XFS_BTREE_LONG_PTRS;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 375) if (init_sa) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 376) error = xchk_ag_init(bs->sc, agno, &bs->sc->sa);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 377) if (!xchk_btree_xref_process_error(bs->sc, bs->cur,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 378) level, &error))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 379) return error;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 380) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 381)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 382) xchk_xref_is_used_space(bs->sc, agbno, 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 383) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 384) * The bnobt scrubber aliases bs->cur to bs->sc->sa.bno_cur, so we
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 385) * have to nullify it (to shut down further block owner checks) if
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 386) * self-xref encounters problems.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 387) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 388) if (!bs->sc->sa.bno_cur && btnum == XFS_BTNUM_BNO)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 389) bs->cur = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 390)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 391) xchk_xref_is_owned_by(bs->sc, agbno, 1, bs->oinfo);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 392) if (!bs->sc->sa.rmap_cur && btnum == XFS_BTNUM_RMAP)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 393) bs->cur = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 394)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 395) if (init_sa)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 396) xchk_ag_free(bs->sc, &bs->sc->sa);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 397)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 398) return error;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 399) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 400)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 401) /* Check the owner of a btree block. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 402) STATIC int
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 403) xchk_btree_check_owner(
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 404) struct xchk_btree *bs,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 405) int level,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 406) struct xfs_buf *bp)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 407) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 408) struct xfs_btree_cur *cur = bs->cur;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 409) struct check_owner *co;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 410)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 411) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 412) * In theory, xfs_btree_get_block should only give us a null buffer
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 413) * pointer for the root of a root-in-inode btree type, but we need
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 414) * to check defensively here in case the cursor state is also screwed
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 415) * up.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 416) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 417) if (bp == NULL) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 418) if (!(cur->bc_flags & XFS_BTREE_ROOT_IN_INODE))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 419) xchk_btree_set_corrupt(bs->sc, bs->cur, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 420) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 421) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 422)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 423) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 424) * We want to cross-reference each btree block with the bnobt
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 425) * and the rmapbt. We cannot cross-reference the bnobt or
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 426) * rmapbt while scanning the bnobt or rmapbt, respectively,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 427) * because we cannot alter the cursor and we'd prefer not to
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 428) * duplicate cursors. Therefore, save the buffer daddr for
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 429) * later scanning.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 430) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 431) if (cur->bc_btnum == XFS_BTNUM_BNO || cur->bc_btnum == XFS_BTNUM_RMAP) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 432) co = kmem_alloc(sizeof(struct check_owner),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 433) KM_MAYFAIL);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 434) if (!co)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 435) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 436) co->level = level;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 437) co->daddr = XFS_BUF_ADDR(bp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 438) list_add_tail(&co->list, &bs->to_check);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 439) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 440) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 441)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 442) return xchk_btree_check_block_owner(bs, level, XFS_BUF_ADDR(bp));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 443) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 444)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 445) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 446) * Check that this btree block has at least minrecs records or is one of the
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 447) * special blocks that don't require that.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 448) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 449) STATIC void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 450) xchk_btree_check_minrecs(
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 451) struct xchk_btree *bs,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 452) int level,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 453) struct xfs_btree_block *block)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 454) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 455) struct xfs_btree_cur *cur = bs->cur;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 456) unsigned int root_level = cur->bc_nlevels - 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 457) unsigned int numrecs = be16_to_cpu(block->bb_numrecs);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 458)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 459) /* More records than minrecs means the block is ok. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 460) if (numrecs >= cur->bc_ops->get_minrecs(cur, level))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 461) return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 462)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 463) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 464) * For btrees rooted in the inode, it's possible that the root block
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 465) * contents spilled into a regular ondisk block because there wasn't
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 466) * enough space in the inode root. The number of records in that
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 467) * child block might be less than the standard minrecs, but that's ok
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 468) * provided that there's only one direct child of the root.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 469) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 470) if ((cur->bc_flags & XFS_BTREE_ROOT_IN_INODE) &&
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 471) level == cur->bc_nlevels - 2) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 472) struct xfs_btree_block *root_block;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 473) struct xfs_buf *root_bp;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 474) int root_maxrecs;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 475)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 476) root_block = xfs_btree_get_block(cur, root_level, &root_bp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 477) root_maxrecs = cur->bc_ops->get_dmaxrecs(cur, root_level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 478) if (be16_to_cpu(root_block->bb_numrecs) != 1 ||
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 479) numrecs <= root_maxrecs)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 480) xchk_btree_set_corrupt(bs->sc, cur, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 481) return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 482) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 483)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 484) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 485) * Otherwise, only the root level is allowed to have fewer than minrecs
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 486) * records or keyptrs.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 487) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 488) if (level < root_level)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 489) xchk_btree_set_corrupt(bs->sc, cur, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 490) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 491)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 492) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 493) * Grab and scrub a btree block given a btree pointer. Returns block
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 494) * and buffer pointers (if applicable) if they're ok to use.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 495) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 496) STATIC int
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 497) xchk_btree_get_block(
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 498) struct xchk_btree *bs,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 499) int level,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 500) union xfs_btree_ptr *pp,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 501) struct xfs_btree_block **pblock,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 502) struct xfs_buf **pbp)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 503) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 504) xfs_failaddr_t failed_at;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 505) int error;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 506)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 507) *pblock = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 508) *pbp = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 509)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 510) error = xfs_btree_lookup_get_block(bs->cur, level, pp, pblock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 511) if (!xchk_btree_process_error(bs->sc, bs->cur, level, &error) ||
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 512) !*pblock)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 513) return error;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 514)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 515) xfs_btree_get_block(bs->cur, level, pbp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 516) if (bs->cur->bc_flags & XFS_BTREE_LONG_PTRS)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 517) failed_at = __xfs_btree_check_lblock(bs->cur, *pblock,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 518) level, *pbp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 519) else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 520) failed_at = __xfs_btree_check_sblock(bs->cur, *pblock,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 521) level, *pbp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 522) if (failed_at) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 523) xchk_btree_set_corrupt(bs->sc, bs->cur, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 524) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 525) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 526) if (*pbp)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 527) xchk_buffer_recheck(bs->sc, *pbp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 528)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 529) xchk_btree_check_minrecs(bs, level, *pblock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 530)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 531) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 532) * Check the block's owner; this function absorbs error codes
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 533) * for us.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 534) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 535) error = xchk_btree_check_owner(bs, level, *pbp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 536) if (error)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 537) return error;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 538)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 539) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 540) * Check the block's siblings; this function absorbs error codes
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 541) * for us.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 542) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 543) return xchk_btree_block_check_siblings(bs, *pblock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 544) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 545)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 546) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 547) * Check that the low and high keys of this block match the keys stored
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 548) * in the parent block.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 549) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 550) STATIC void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 551) xchk_btree_block_keys(
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 552) struct xchk_btree *bs,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 553) int level,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 554) struct xfs_btree_block *block)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 555) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 556) union xfs_btree_key block_keys;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 557) struct xfs_btree_cur *cur = bs->cur;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 558) union xfs_btree_key *high_bk;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 559) union xfs_btree_key *parent_keys;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 560) union xfs_btree_key *high_pk;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 561) struct xfs_btree_block *parent_block;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 562) struct xfs_buf *bp;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 563)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 564) if (level >= cur->bc_nlevels - 1)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 565) return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 566)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 567) /* Calculate the keys for this block. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 568) xfs_btree_get_keys(cur, block, &block_keys);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 569)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 570) /* Obtain the parent's copy of the keys for this block. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 571) parent_block = xfs_btree_get_block(cur, level + 1, &bp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 572) parent_keys = xfs_btree_key_addr(cur, cur->bc_ptrs[level + 1],
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 573) parent_block);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 574)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 575) if (cur->bc_ops->diff_two_keys(cur, &block_keys, parent_keys) != 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 576) xchk_btree_set_corrupt(bs->sc, cur, 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 577)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 578) if (!(cur->bc_flags & XFS_BTREE_OVERLAPPING))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 579) return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 580)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 581) /* Get high keys */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 582) high_bk = xfs_btree_high_key_from_key(cur, &block_keys);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 583) high_pk = xfs_btree_high_key_addr(cur, cur->bc_ptrs[level + 1],
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 584) parent_block);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 585)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 586) if (cur->bc_ops->diff_two_keys(cur, high_bk, high_pk) != 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 587) xchk_btree_set_corrupt(bs->sc, cur, 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 588) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 589)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 590) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 591) * Visit all nodes and leaves of a btree. Check that all pointers and
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 592) * records are in order, that the keys reflect the records, and use a callback
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 593) * so that the caller can verify individual records.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 594) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 595) int
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 596) xchk_btree(
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 597) struct xfs_scrub *sc,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 598) struct xfs_btree_cur *cur,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 599) xchk_btree_rec_fn scrub_fn,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 600) const struct xfs_owner_info *oinfo,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 601) void *private)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 602) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 603) struct xchk_btree bs = {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 604) .cur = cur,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 605) .scrub_rec = scrub_fn,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 606) .oinfo = oinfo,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 607) .firstrec = true,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 608) .private = private,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 609) .sc = sc,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 610) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 611) union xfs_btree_ptr ptr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 612) union xfs_btree_ptr *pp;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 613) union xfs_btree_rec *recp;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 614) struct xfs_btree_block *block;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 615) int level;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 616) struct xfs_buf *bp;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 617) struct check_owner *co;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 618) struct check_owner *n;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 619) int i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 620) int error = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 621)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 622) /* Initialize scrub state */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 623) for (i = 0; i < XFS_BTREE_MAXLEVELS; i++)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 624) bs.firstkey[i] = true;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 625) INIT_LIST_HEAD(&bs.to_check);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 626)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 627) /* Don't try to check a tree with a height we can't handle. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 628) if (cur->bc_nlevels > XFS_BTREE_MAXLEVELS) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 629) xchk_btree_set_corrupt(sc, cur, 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 630) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 631) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 632)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 633) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 634) * Load the root of the btree. The helper function absorbs
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 635) * error codes for us.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 636) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 637) level = cur->bc_nlevels - 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 638) cur->bc_ops->init_ptr_from_cur(cur, &ptr);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 639) if (!xchk_btree_ptr_ok(&bs, cur->bc_nlevels, &ptr))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 640) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 641) error = xchk_btree_get_block(&bs, level, &ptr, &block, &bp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 642) if (error || !block)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 643) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 644)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 645) cur->bc_ptrs[level] = 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 646)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 647) while (level < cur->bc_nlevels) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 648) block = xfs_btree_get_block(cur, level, &bp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 649)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 650) if (level == 0) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 651) /* End of leaf, pop back towards the root. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 652) if (cur->bc_ptrs[level] >
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 653) be16_to_cpu(block->bb_numrecs)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 654) xchk_btree_block_keys(&bs, level, block);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 655) if (level < cur->bc_nlevels - 1)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 656) cur->bc_ptrs[level + 1]++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 657) level++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 658) continue;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 659) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 660)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 661) /* Records in order for scrub? */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 662) xchk_btree_rec(&bs);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 663)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 664) /* Call out to the record checker. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 665) recp = xfs_btree_rec_addr(cur, cur->bc_ptrs[0], block);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 666) error = bs.scrub_rec(&bs, recp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 667) if (error)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 668) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 669) if (xchk_should_terminate(sc, &error) ||
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 670) (sc->sm->sm_flags & XFS_SCRUB_OFLAG_CORRUPT))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 671) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 672)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 673) cur->bc_ptrs[level]++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 674) continue;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 675) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 676)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 677) /* End of node, pop back towards the root. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 678) if (cur->bc_ptrs[level] > be16_to_cpu(block->bb_numrecs)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 679) xchk_btree_block_keys(&bs, level, block);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 680) if (level < cur->bc_nlevels - 1)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 681) cur->bc_ptrs[level + 1]++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 682) level++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 683) continue;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 684) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 685)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 686) /* Keys in order for scrub? */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 687) xchk_btree_key(&bs, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 688)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 689) /* Drill another level deeper. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 690) pp = xfs_btree_ptr_addr(cur, cur->bc_ptrs[level], block);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 691) if (!xchk_btree_ptr_ok(&bs, level, pp)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 692) cur->bc_ptrs[level]++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 693) continue;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 694) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 695) level--;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 696) error = xchk_btree_get_block(&bs, level, pp, &block, &bp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 697) if (error || !block)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 698) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 699)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 700) cur->bc_ptrs[level] = 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 701) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 702)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 703) out:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 704) /* Process deferred owner checks on btree blocks. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 705) list_for_each_entry_safe(co, n, &bs.to_check, list) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 706) if (!error && bs.cur)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 707) error = xchk_btree_check_block_owner(&bs,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 708) co->level, co->daddr);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 709) list_del(&co->list);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 710) kmem_free(co);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 711) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 712)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 713) return error;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 714) }
Orange Pi5 kernel
Deprecated Linux kernel 5.10.110 for OrangePi 5/5B/5+ boards
3 Commits
0 Branches
0 Tags