1 // SPDX-License-Identifier: GPL-2.0+
2 /*
3  * Copyright (C) 2017 Oracle.  All Rights Reserved.
4  * Author: Darrick J. Wong <darrick.wong@oracle.com>
5  */
6 #include "xfs.h"
7 #include "xfs_fs.h"
8 #include "xfs_shared.h"
9 #include "xfs_format.h"
10 #include "xfs_trans_resv.h"
11 #include "xfs_mount.h"
12 #include "xfs_btree.h"
13 #include "xfs_alloc.h"
14 #include "xfs_rmap.h"
15 #include "scrub/scrub.h"
16 #include "scrub/common.h"
17 #include "scrub/btree.h"
18 #include "xfs_ag.h"
19 
20 /*
21  * Set us up to scrub free space btrees.
22  */
23 int
xchk_setup_ag_allocbt(struct xfs_scrub * sc)24 xchk_setup_ag_allocbt(
25 	struct xfs_scrub	*sc)
26 {
27 	return xchk_setup_ag_btree(sc, false);
28 }
29 
30 /* Free space btree scrubber. */
31 /*
32  * Ensure there's a corresponding cntbt/bnobt record matching this
33  * bnobt/cntbt record, respectively.
34  */
35 STATIC void
xchk_allocbt_xref_other(struct xfs_scrub * sc,xfs_agblock_t agbno,xfs_extlen_t len)36 xchk_allocbt_xref_other(
37 	struct xfs_scrub	*sc,
38 	xfs_agblock_t		agbno,
39 	xfs_extlen_t		len)
40 {
41 	struct xfs_btree_cur	**pcur;
42 	xfs_agblock_t		fbno;
43 	xfs_extlen_t		flen;
44 	int			has_otherrec;
45 	int			error;
46 
47 	if (sc->sm->sm_type == XFS_SCRUB_TYPE_BNOBT)
48 		pcur = &sc->sa.cnt_cur;
49 	else
50 		pcur = &sc->sa.bno_cur;
51 	if (!*pcur || xchk_skip_xref(sc->sm))
52 		return;
53 
54 	error = xfs_alloc_lookup_le(*pcur, agbno, len, &has_otherrec);
55 	if (!xchk_should_check_xref(sc, &error, pcur))
56 		return;
57 	if (!has_otherrec) {
58 		xchk_btree_xref_set_corrupt(sc, *pcur, 0);
59 		return;
60 	}
61 
62 	error = xfs_alloc_get_rec(*pcur, &fbno, &flen, &has_otherrec);
63 	if (!xchk_should_check_xref(sc, &error, pcur))
64 		return;
65 	if (!has_otherrec) {
66 		xchk_btree_xref_set_corrupt(sc, *pcur, 0);
67 		return;
68 	}
69 
70 	if (fbno != agbno || flen != len)
71 		xchk_btree_xref_set_corrupt(sc, *pcur, 0);
72 }
73 
74 /* Cross-reference with the other btrees. */
75 STATIC void
xchk_allocbt_xref(struct xfs_scrub * sc,xfs_agblock_t agbno,xfs_extlen_t len)76 xchk_allocbt_xref(
77 	struct xfs_scrub	*sc,
78 	xfs_agblock_t		agbno,
79 	xfs_extlen_t		len)
80 {
81 	if (sc->sm->sm_flags & XFS_SCRUB_OFLAG_CORRUPT)
82 		return;
83 
84 	xchk_allocbt_xref_other(sc, agbno, len);
85 	xchk_xref_is_not_inode_chunk(sc, agbno, len);
86 	xchk_xref_has_no_owner(sc, agbno, len);
87 	xchk_xref_is_not_shared(sc, agbno, len);
88 }
89 
90 /* Scrub a bnobt/cntbt record. */
91 STATIC int
xchk_allocbt_rec(struct xchk_btree * bs,const union xfs_btree_rec * rec)92 xchk_allocbt_rec(
93 	struct xchk_btree	*bs,
94 	const union xfs_btree_rec *rec)
95 {
96 	struct xfs_perag	*pag = bs->cur->bc_ag.pag;
97 	xfs_agblock_t		bno;
98 	xfs_extlen_t		len;
99 
100 	bno = be32_to_cpu(rec->alloc.ar_startblock);
101 	len = be32_to_cpu(rec->alloc.ar_blockcount);
102 
103 	if (!xfs_verify_agbext(pag, bno, len))
104 		xchk_btree_set_corrupt(bs->sc, bs->cur, 0);
105 
106 	xchk_allocbt_xref(bs->sc, bno, len);
107 
108 	return 0;
109 }
110 
111 /* Scrub the freespace btrees for some AG. */
112 STATIC int
xchk_allocbt(struct xfs_scrub * sc,xfs_btnum_t which)113 xchk_allocbt(
114 	struct xfs_scrub	*sc,
115 	xfs_btnum_t		which)
116 {
117 	struct xfs_btree_cur	*cur;
118 
119 	cur = which == XFS_BTNUM_BNO ? sc->sa.bno_cur : sc->sa.cnt_cur;
120 	return xchk_btree(sc, cur, xchk_allocbt_rec, &XFS_RMAP_OINFO_AG, NULL);
121 }
122 
123 int
xchk_bnobt(struct xfs_scrub * sc)124 xchk_bnobt(
125 	struct xfs_scrub	*sc)
126 {
127 	return xchk_allocbt(sc, XFS_BTNUM_BNO);
128 }
129 
130 int
xchk_cntbt(struct xfs_scrub * sc)131 xchk_cntbt(
132 	struct xfs_scrub	*sc)
133 {
134 	return xchk_allocbt(sc, XFS_BTNUM_CNT);
135 }
136 
137 /* xref check that the extent is not free */
138 void
xchk_xref_is_used_space(struct xfs_scrub * sc,xfs_agblock_t agbno,xfs_extlen_t len)139 xchk_xref_is_used_space(
140 	struct xfs_scrub	*sc,
141 	xfs_agblock_t		agbno,
142 	xfs_extlen_t		len)
143 {
144 	bool			is_freesp;
145 	int			error;
146 
147 	if (!sc->sa.bno_cur || xchk_skip_xref(sc->sm))
148 		return;
149 
150 	error = xfs_alloc_has_record(sc->sa.bno_cur, agbno, len, &is_freesp);
151 	if (!xchk_should_check_xref(sc, &error, &sc->sa.bno_cur))
152 		return;
153 	if (is_freesp)
154 		xchk_btree_xref_set_corrupt(sc, sc->sa.bno_cur, 0);
155 }
156