Line data Source code
1 : // SPDX-License-Identifier: GPL-2.0-or-later
2 : /*
3 : * Copyright (C) 2017-2023 Oracle. All Rights Reserved.
4 : * Author: Darrick J. Wong <djwong@kernel.org>
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_ag.h"
13 : #include "xfs_btree.h"
14 : #include "xfs_rmap.h"
15 : #include "xfs_refcount.h"
16 : #include "scrub/scrub.h"
17 : #include "scrub/common.h"
18 : #include "scrub/btree.h"
19 : #include "scrub/trace.h"
20 :
21 : /*
22 : * Set us up to scrub reference count btrees.
23 : */
24 : int
25 512694 : xchk_setup_ag_refcountbt(
26 : struct xfs_scrub *sc)
27 : {
28 512694 : if (xchk_need_intent_drain(sc))
29 3356 : xchk_fsgates_enable(sc, XCHK_FSGATES_DRAIN);
30 512694 : return xchk_setup_ag_btree(sc, false);
31 : }
32 :
33 : /* Reference count btree scrubber. */
34 :
35 : /*
36 : * Confirming Reference Counts via Reverse Mappings
37 : *
38 : * We want to count the reverse mappings overlapping a refcount record
39 : * (bno, len, refcount), allowing for the possibility that some of the
40 : * overlap may come from smaller adjoining reverse mappings, while some
41 : * comes from single extents which overlap the range entirely. The
42 : * outer loop is as follows:
43 : *
44 : * 1. For all reverse mappings overlapping the refcount extent,
45 : * a. If a given rmap completely overlaps, mark it as seen.
46 : * b. Otherwise, record the fragment (in agbno order) for later
47 : * processing.
48 : *
49 : * Once we've seen all the rmaps, we know that for all blocks in the
50 : * refcount record we want to find $refcount owners and we've already
51 : * visited $seen extents that overlap all the blocks. Therefore, we
52 : * need to find ($refcount - $seen) owners for every block in the
53 : * extent; call that quantity $target_nr. Proceed as follows:
54 : *
55 : * 2. Pull the first $target_nr fragments from the list; all of them
56 : * should start at or before the start of the extent.
57 : * Call this subset of fragments the working set.
58 : * 3. Until there are no more unprocessed fragments,
59 : * a. Find the shortest fragments in the set and remove them.
60 : * b. Note the block number of the end of these fragments.
61 : * c. Pull the same number of fragments from the list. All of these
62 : * fragments should start at the block number recorded in the
63 : * previous step.
64 : * d. Put those fragments in the set.
65 : * 4. Check that there are $target_nr fragments remaining in the list,
66 : * and that they all end at or beyond the end of the refcount extent.
67 : *
68 : * If the refcount is correct, all the check conditions in the algorithm
69 : * should always hold true. If not, the refcount is incorrect.
70 : */
71 : struct xchk_refcnt_frag {
72 : struct list_head list;
73 : struct xfs_rmap_irec rm;
74 : };
75 :
76 : struct xchk_refcnt_check {
77 : struct xfs_scrub *sc;
78 : struct list_head fragments;
79 :
80 : /* refcount extent we're examining */
81 : xfs_agblock_t bno;
82 : xfs_extlen_t len;
83 : xfs_nlink_t refcount;
84 :
85 : /* number of owners seen */
86 : xfs_nlink_t seen;
87 : };
88 :
89 : /*
90 : * Decide if the given rmap is large enough that we can redeem it
91 : * towards refcount verification now, or if it's a fragment, in
92 : * which case we'll hang onto it in the hopes that we'll later
93 : * discover that we've collected exactly the correct number of
94 : * fragments as the refcountbt says we should have.
95 : */
96 : STATIC int
97 72775841 : xchk_refcountbt_rmap_check(
98 : struct xfs_btree_cur *cur,
99 : const struct xfs_rmap_irec *rec,
100 : void *priv)
101 : {
102 72775841 : struct xchk_refcnt_check *refchk = priv;
103 72775841 : struct xchk_refcnt_frag *frag;
104 72775841 : xfs_agblock_t rm_last;
105 72775841 : xfs_agblock_t rc_last;
106 72775841 : int error = 0;
107 :
108 72775841 : if (xchk_should_terminate(refchk->sc, &error))
109 0 : return error;
110 :
111 72775928 : rm_last = rec->rm_startblock + rec->rm_blockcount - 1;
112 72775928 : rc_last = refchk->bno + refchk->len - 1;
113 :
114 : /* Confirm that a single-owner refc extent is a CoW stage. */
115 72775928 : if (refchk->refcount == 1 && rec->rm_owner != XFS_RMAP_OWN_COW) {
116 0 : xchk_btree_xref_set_corrupt(refchk->sc, cur, 0);
117 0 : return 0;
118 : }
119 :
120 72775928 : if (rec->rm_startblock <= refchk->bno && rm_last >= rc_last) {
121 : /*
122 : * The rmap overlaps the refcount record, so we can confirm
123 : * one refcount owner seen.
124 : */
125 72556175 : refchk->seen++;
126 : } else {
127 : /*
128 : * This rmap covers only part of the refcount record, so
129 : * save the fragment for later processing. If the rmapbt
130 : * is healthy each rmap_irec we see will be in agbno order
131 : * so we don't need insertion sort here.
132 : */
133 219753 : frag = kmalloc(sizeof(struct xchk_refcnt_frag),
134 : XCHK_GFP_FLAGS);
135 219783 : if (!frag)
136 : return -ENOMEM;
137 439566 : memcpy(&frag->rm, rec, sizeof(frag->rm));
138 219783 : list_add_tail(&frag->list, &refchk->fragments);
139 : }
140 :
141 : return 0;
142 : }
143 :
144 : /*
145 : * Given a bunch of rmap fragments, iterate through them, keeping
146 : * a running tally of the refcount. If this ever deviates from
147 : * what we expect (which is the refcountbt's refcount minus the
148 : * number of extents that totally covered the refcountbt extent),
149 : * we have a refcountbt error.
150 : */
151 : STATIC void
152 9857088 : xchk_refcountbt_process_rmap_fragments(
153 : struct xchk_refcnt_check *refchk)
154 : {
155 9857088 : struct list_head worklist;
156 9857088 : struct xchk_refcnt_frag *frag;
157 9857088 : struct xchk_refcnt_frag *n;
158 9857088 : xfs_agblock_t bno;
159 9857088 : xfs_agblock_t rbno;
160 9857088 : xfs_agblock_t next_rbno;
161 9857088 : xfs_nlink_t nr;
162 9857088 : xfs_nlink_t target_nr;
163 :
164 9857088 : target_nr = refchk->refcount - refchk->seen;
165 9857088 : if (target_nr == 0)
166 9769933 : return;
167 :
168 : /*
169 : * There are (refchk->rc.rc_refcount - refchk->nr refcount)
170 : * references we haven't found yet. Pull that many off the
171 : * fragment list and figure out where the smallest rmap ends
172 : * (and therefore the next rmap should start). All the rmaps
173 : * we pull off should start at or before the beginning of the
174 : * refcount record's range.
175 : */
176 87155 : INIT_LIST_HEAD(&worklist);
177 87155 : rbno = NULLAGBLOCK;
178 :
179 : /* Make sure the fragments actually /are/ in agbno order. */
180 87155 : bno = 0;
181 306938 : list_for_each_entry(frag, &refchk->fragments, list) {
182 219783 : if (frag->rm.rm_startblock < bno)
183 0 : goto done;
184 219783 : bno = frag->rm.rm_startblock;
185 : }
186 :
187 : /*
188 : * Find all the rmaps that start at or before the refc extent,
189 : * and put them on the worklist.
190 : */
191 87155 : nr = 0;
192 194361 : list_for_each_entry_safe(frag, n, &refchk->fragments, list) {
193 194361 : if (frag->rm.rm_startblock > refchk->bno || nr > target_nr)
194 : break;
195 107206 : bno = frag->rm.rm_startblock + frag->rm.rm_blockcount;
196 107206 : if (bno < rbno)
197 : rbno = bno;
198 107206 : list_move_tail(&frag->list, &worklist);
199 107206 : nr++;
200 : }
201 :
202 : /*
203 : * We should have found exactly $target_nr rmap fragments starting
204 : * at or before the refcount extent.
205 : */
206 87155 : if (nr != target_nr)
207 0 : goto done;
208 :
209 174872 : while (!list_empty(&refchk->fragments)) {
210 : /* Discard any fragments ending at rbno from the worklist. */
211 87717 : nr = 0;
212 87717 : next_rbno = NULLAGBLOCK;
213 204210 : list_for_each_entry_safe(frag, n, &worklist, list) {
214 116493 : bno = frag->rm.rm_startblock + frag->rm.rm_blockcount;
215 116493 : if (bno != rbno) {
216 3916 : if (bno < next_rbno)
217 : next_rbno = bno;
218 3916 : continue;
219 : }
220 112577 : list_del(&frag->list);
221 112577 : kfree(frag);
222 112577 : nr++;
223 : }
224 :
225 : /* Try to add nr rmaps starting at rbno to the worklist. */
226 112577 : list_for_each_entry_safe(frag, n, &refchk->fragments, list) {
227 112577 : bno = frag->rm.rm_startblock + frag->rm.rm_blockcount;
228 112577 : if (frag->rm.rm_startblock != rbno)
229 0 : goto done;
230 112577 : list_move_tail(&frag->list, &worklist);
231 112577 : if (next_rbno > bno)
232 : next_rbno = bno;
233 112577 : nr--;
234 112577 : if (nr == 0)
235 : break;
236 : }
237 :
238 : /*
239 : * If we get here and nr > 0, this means that we added fewer
240 : * items to the worklist than we discarded because the fragment
241 : * list ran out of items. Therefore, we cannot maintain the
242 : * required refcount. Something is wrong, so we're done.
243 : */
244 87717 : if (nr)
245 0 : goto done;
246 :
247 : rbno = next_rbno;
248 : }
249 :
250 : /*
251 : * Make sure the last extent we processed ends at or beyond
252 : * the end of the refcount extent.
253 : */
254 87155 : if (rbno < refchk->bno + refchk->len)
255 0 : goto done;
256 :
257 : /* Actually record us having seen the remaining refcount. */
258 87155 : refchk->seen = refchk->refcount;
259 87155 : done:
260 : /* Delete fragments and work list. */
261 194361 : list_for_each_entry_safe(frag, n, &worklist, list) {
262 107206 : list_del(&frag->list);
263 107206 : kfree(frag);
264 : }
265 87155 : list_for_each_entry_safe(frag, n, &refchk->fragments, list) {
266 0 : list_del(&frag->list);
267 0 : kfree(frag);
268 : }
269 : }
270 :
271 : /* Use the rmap entries covering this extent to verify the refcount. */
272 : STATIC void
273 9856701 : xchk_refcountbt_xref_rmap(
274 : struct xfs_scrub *sc,
275 : const struct xfs_refcount_irec *irec)
276 : {
277 9856701 : struct xchk_refcnt_check refchk = {
278 : .sc = sc,
279 9856701 : .bno = irec->rc_startblock,
280 9856701 : .len = irec->rc_blockcount,
281 9856701 : .refcount = irec->rc_refcount,
282 : .seen = 0,
283 : };
284 9856701 : struct xfs_rmap_irec low;
285 9856701 : struct xfs_rmap_irec high;
286 9856701 : struct xchk_refcnt_frag *frag;
287 9856701 : struct xchk_refcnt_frag *n;
288 9856701 : int error;
289 :
290 9856701 : if (!sc->sa.rmap_cur || xchk_skip_xref(sc->sm))
291 0 : return;
292 :
293 : /* Cross-reference with the rmapbt to confirm the refcount. */
294 9856701 : memset(&low, 0, sizeof(low));
295 9856701 : low.rm_startblock = irec->rc_startblock;
296 9856701 : memset(&high, 0xFF, sizeof(high));
297 9856701 : high.rm_startblock = irec->rc_startblock + irec->rc_blockcount - 1;
298 :
299 9856701 : INIT_LIST_HEAD(&refchk.fragments);
300 9856701 : error = xfs_rmap_query_range(sc->sa.rmap_cur, &low, &high,
301 : &xchk_refcountbt_rmap_check, &refchk);
302 9857142 : if (!xchk_should_check_xref(sc, &error, &sc->sa.rmap_cur))
303 0 : goto out_free;
304 :
305 9857159 : xchk_refcountbt_process_rmap_fragments(&refchk);
306 9857173 : if (irec->rc_refcount != refchk.seen) {
307 0 : trace_xchk_refcount_incorrect(sc->sa.pag, irec, refchk.seen);
308 0 : xchk_btree_xref_set_corrupt(sc, sc->sa.rmap_cur, 0);
309 : }
310 :
311 9857173 : out_free:
312 9857133 : list_for_each_entry_safe(frag, n, &refchk.fragments, list) {
313 0 : list_del(&frag->list);
314 0 : kfree(frag);
315 : }
316 : }
317 :
318 : /* Cross-reference with the other btrees. */
319 : STATIC void
320 9856857 : xchk_refcountbt_xref(
321 : struct xfs_scrub *sc,
322 : const struct xfs_refcount_irec *irec)
323 : {
324 9856857 : if (sc->sm->sm_flags & XFS_SCRUB_OFLAG_CORRUPT)
325 : return;
326 :
327 9856845 : xchk_xref_is_used_space(sc, irec->rc_startblock, irec->rc_blockcount);
328 9857124 : xchk_xref_is_not_inode_chunk(sc, irec->rc_startblock,
329 9857124 : irec->rc_blockcount);
330 9857039 : xchk_refcountbt_xref_rmap(sc, irec);
331 : }
332 :
333 : struct xchk_refcbt_records {
334 : /* Previous refcount record. */
335 : struct xfs_refcount_irec prev_rec;
336 :
337 : /* The next AG block where we aren't expecting shared extents. */
338 : xfs_agblock_t next_unshared_agbno;
339 :
340 : /* Number of CoW blocks we expect. */
341 : xfs_agblock_t cow_blocks;
342 :
343 : /* Was the last record a shared or CoW staging extent? */
344 : enum xfs_refc_domain prev_domain;
345 : };
346 :
347 : STATIC int
348 1382319873 : xchk_refcountbt_rmap_check_gap(
349 : struct xfs_btree_cur *cur,
350 : const struct xfs_rmap_irec *rec,
351 : void *priv)
352 : {
353 1382319873 : xfs_agblock_t *next_bno = priv;
354 :
355 1382319873 : if (*next_bno != NULLAGBLOCK && rec->rm_startblock < *next_bno)
356 : return -ECANCELED;
357 :
358 1382319873 : *next_bno = rec->rm_startblock + rec->rm_blockcount;
359 1382319873 : return 0;
360 : }
361 :
362 : /*
363 : * Make sure that a gap in the reference count records does not correspond to
364 : * overlapping records (i.e. shared extents) in the reverse mappings.
365 : */
366 : static inline void
367 9939309 : xchk_refcountbt_xref_gaps(
368 : struct xfs_scrub *sc,
369 : struct xchk_refcbt_records *rrc,
370 : xfs_agblock_t bno)
371 : {
372 9939309 : struct xfs_rmap_irec low;
373 9939309 : struct xfs_rmap_irec high;
374 9939309 : xfs_agblock_t next_bno = NULLAGBLOCK;
375 9939309 : int error;
376 :
377 9939309 : if (bno <= rrc->next_unshared_agbno || !sc->sa.rmap_cur ||
378 9527446 : xchk_skip_xref(sc->sm))
379 411861 : return;
380 :
381 9527448 : memset(&low, 0, sizeof(low));
382 9527448 : low.rm_startblock = rrc->next_unshared_agbno;
383 9527448 : memset(&high, 0xFF, sizeof(high));
384 9527448 : high.rm_startblock = bno - 1;
385 :
386 9527448 : error = xfs_rmap_query_range(sc->sa.rmap_cur, &low, &high,
387 : xchk_refcountbt_rmap_check_gap, &next_bno);
388 9527048 : if (error == -ECANCELED)
389 0 : xchk_btree_xref_set_corrupt(sc, sc->sa.rmap_cur, 0);
390 : else
391 9527048 : xchk_should_check_xref(sc, &error, &sc->sa.rmap_cur);
392 : }
393 :
394 : static inline bool
395 9857061 : xchk_refcount_mergeable(
396 : struct xchk_refcbt_records *rrc,
397 : const struct xfs_refcount_irec *r2)
398 : {
399 9857061 : const struct xfs_refcount_irec *r1 = &rrc->prev_rec;
400 :
401 : /* Ignore if prev_rec is not yet initialized. */
402 9857061 : if (r1->rc_blockcount > 0)
403 : return false;
404 :
405 91368 : if (r1->rc_domain != r2->rc_domain)
406 : return false;
407 73643 : if (r1->rc_startblock + r1->rc_blockcount != r2->rc_startblock)
408 : return false;
409 0 : if (r1->rc_refcount != r2->rc_refcount)
410 0 : return false;
411 : if ((unsigned long long)r1->rc_blockcount + r2->rc_blockcount >
412 : MAXREFCEXTLEN)
413 : return false;
414 :
415 : return true;
416 : }
417 :
418 : /* Flag failures for records that could be merged. */
419 : STATIC void
420 9857005 : xchk_refcountbt_check_mergeable(
421 : struct xchk_btree *bs,
422 : struct xchk_refcbt_records *rrc,
423 : const struct xfs_refcount_irec *irec)
424 : {
425 9857005 : if (bs->sc->sm->sm_flags & XFS_SCRUB_OFLAG_CORRUPT)
426 : return;
427 :
428 9857005 : if (xchk_refcount_mergeable(rrc, irec))
429 0 : xchk_btree_set_corrupt(bs->sc, bs->cur, 0);
430 :
431 19714010 : memcpy(&rrc->prev_rec, irec, sizeof(struct xfs_refcount_irec));
432 : }
433 :
434 : /* Scrub a refcountbt record. */
435 : STATIC int
436 9857061 : xchk_refcountbt_rec(
437 : struct xchk_btree *bs,
438 : const union xfs_btree_rec *rec)
439 : {
440 9857061 : struct xfs_refcount_irec irec;
441 9857061 : struct xchk_refcbt_records *rrc = bs->private;
442 :
443 9857061 : xfs_refcount_btrec_to_irec(rec, &irec);
444 9857086 : if (xfs_refcount_check_irec(bs->cur, &irec) != NULL) {
445 0 : xchk_btree_set_corrupt(bs->sc, bs->cur, 0);
446 0 : return 0;
447 : }
448 :
449 9857119 : if (irec.rc_domain == XFS_REFC_DOMAIN_COW)
450 427204 : rrc->cow_blocks += irec.rc_blockcount;
451 :
452 : /* Shared records always come before CoW records. */
453 9857119 : if (irec.rc_domain == XFS_REFC_DOMAIN_SHARED &&
454 9429917 : rrc->prev_domain == XFS_REFC_DOMAIN_COW)
455 0 : xchk_btree_set_corrupt(bs->sc, bs->cur, 0);
456 9857119 : rrc->prev_domain = irec.rc_domain;
457 :
458 9857119 : xchk_refcountbt_check_mergeable(bs, rrc, &irec);
459 9856910 : xchk_refcountbt_xref(bs->sc, &irec);
460 :
461 : /*
462 : * If this is a record for a shared extent, check that all blocks
463 : * between the previous record and this one have at most one reverse
464 : * mapping.
465 : */
466 9857158 : if (irec.rc_domain == XFS_REFC_DOMAIN_SHARED) {
467 9429969 : xchk_refcountbt_xref_gaps(bs->sc, rrc, irec.rc_startblock);
468 9429607 : rrc->next_unshared_agbno = irec.rc_startblock +
469 9429607 : irec.rc_blockcount;
470 : }
471 :
472 : return 0;
473 : }
474 :
475 : /* Make sure we have as many refc blocks as the rmap says. */
476 : STATIC void
477 509337 : xchk_refcount_xref_rmap(
478 : struct xfs_scrub *sc,
479 : xfs_filblks_t cow_blocks)
480 : {
481 509337 : xfs_extlen_t refcbt_blocks = 0;
482 509337 : xfs_filblks_t blocks;
483 509337 : int error;
484 :
485 509337 : if (!sc->sa.rmap_cur || xchk_skip_xref(sc->sm))
486 1 : return;
487 :
488 : /* Check that we saw as many refcbt blocks as the rmap knows about. */
489 509336 : error = xfs_btree_count_blocks(sc->sa.refc_cur, &refcbt_blocks);
490 509339 : if (!xchk_btree_process_error(sc, sc->sa.refc_cur, 0, &error))
491 : return;
492 509341 : error = xchk_count_rmap_ownedby_ag(sc, sc->sa.rmap_cur,
493 : &XFS_RMAP_OINFO_REFC, &blocks);
494 509336 : if (!xchk_should_check_xref(sc, &error, &sc->sa.rmap_cur))
495 : return;
496 509341 : if (blocks != refcbt_blocks)
497 0 : xchk_btree_xref_set_corrupt(sc, sc->sa.rmap_cur, 0);
498 :
499 : /* Check that we saw as many cow blocks as the rmap knows about. */
500 509341 : error = xchk_count_rmap_ownedby_ag(sc, sc->sa.rmap_cur,
501 : &XFS_RMAP_OINFO_COW, &blocks);
502 509341 : if (!xchk_should_check_xref(sc, &error, &sc->sa.rmap_cur))
503 : return;
504 509337 : if (blocks != cow_blocks)
505 0 : xchk_btree_xref_set_corrupt(sc, sc->sa.rmap_cur, 0);
506 : }
507 :
508 : /* Scrub the refcount btree for some AG. */
509 : int
510 509333 : xchk_refcountbt(
511 : struct xfs_scrub *sc)
512 : {
513 509333 : struct xchk_refcbt_records rrc = {
514 : .cow_blocks = 0,
515 : .next_unshared_agbno = 0,
516 : .prev_domain = XFS_REFC_DOMAIN_SHARED,
517 : };
518 509333 : int error;
519 :
520 509333 : error = xchk_btree(sc, sc->sa.refc_cur, xchk_refcountbt_rec,
521 : &XFS_RMAP_OINFO_REFC, &rrc);
522 509339 : if (error)
523 : return error;
524 :
525 : /*
526 : * Check that all blocks between the last refcount > 1 record and the
527 : * end of the AG have at most one reverse mapping.
528 : */
529 509340 : xchk_refcountbt_xref_gaps(sc, &rrc, sc->mp->m_sb.sb_agblocks);
530 :
531 509338 : xchk_refcount_xref_rmap(sc, rrc.cow_blocks);
532 :
533 509338 : return 0;
534 : }
535 :
536 : /* xref check that a cow staging extent is marked in the refcountbt. */
537 : void
538 368942 : xchk_xref_is_cow_staging(
539 : struct xfs_scrub *sc,
540 : xfs_agblock_t agbno,
541 : xfs_extlen_t len)
542 : {
543 368942 : struct xfs_refcount_irec rc;
544 368942 : int has_refcount;
545 368942 : int error;
546 :
547 368942 : if (!sc->sa.refc_cur || xchk_skip_xref(sc->sm))
548 0 : return;
549 :
550 : /* Find the CoW staging extent. */
551 368943 : error = xfs_refcount_lookup_le(sc->sa.refc_cur, XFS_REFC_DOMAIN_COW,
552 : agbno, &has_refcount);
553 368968 : if (!xchk_should_check_xref(sc, &error, &sc->sa.refc_cur))
554 : return;
555 368969 : if (!has_refcount) {
556 0 : xchk_btree_xref_set_corrupt(sc, sc->sa.refc_cur, 0);
557 0 : return;
558 : }
559 :
560 368969 : error = xfs_refcount_get_rec(sc->sa.refc_cur, &rc, &has_refcount);
561 368967 : if (!xchk_should_check_xref(sc, &error, &sc->sa.refc_cur))
562 : return;
563 368970 : if (!has_refcount) {
564 0 : xchk_btree_xref_set_corrupt(sc, sc->sa.refc_cur, 0);
565 0 : return;
566 : }
567 :
568 : /* CoW lookup returned a shared extent record? */
569 368970 : if (rc.rc_domain != XFS_REFC_DOMAIN_COW)
570 0 : xchk_btree_xref_set_corrupt(sc, sc->sa.refc_cur, 0);
571 :
572 : /* Must be at least as long as what was passed in */
573 368970 : if (rc.rc_blockcount < len)
574 0 : xchk_btree_xref_set_corrupt(sc, sc->sa.refc_cur, 0);
575 : }
576 :
577 : /*
578 : * xref check that the extent is not shared. Only file data blocks
579 : * can have multiple owners.
580 : */
581 : void
582 894841937 : xchk_xref_is_not_shared(
583 : struct xfs_scrub *sc,
584 : xfs_agblock_t agbno,
585 : xfs_extlen_t len)
586 : {
587 894841937 : enum xbtree_recpacking outcome;
588 894841937 : int error;
589 :
590 894841937 : if (!sc->sa.refc_cur || xchk_skip_xref(sc->sm))
591 288045821 : return;
592 :
593 606796116 : error = xfs_refcount_has_records(sc->sa.refc_cur,
594 : XFS_REFC_DOMAIN_SHARED, agbno, len, &outcome);
595 606802402 : if (!xchk_should_check_xref(sc, &error, &sc->sa.refc_cur))
596 : return;
597 606806652 : if (outcome != XBTREE_RECPACKING_EMPTY)
598 0 : xchk_btree_xref_set_corrupt(sc, sc->sa.refc_cur, 0);
599 : }
600 :
601 : /* xref check that the extent is not being used for CoW staging. */
602 : void
603 947986883 : xchk_xref_is_not_cow_staging(
604 : struct xfs_scrub *sc,
605 : xfs_agblock_t agbno,
606 : xfs_extlen_t len)
607 : {
608 947986883 : enum xbtree_recpacking outcome;
609 947986883 : int error;
610 :
611 947986883 : if (!sc->sa.refc_cur || xchk_skip_xref(sc->sm))
612 288039365 : return;
613 :
614 659947518 : error = xfs_refcount_has_records(sc->sa.refc_cur, XFS_REFC_DOMAIN_COW,
615 : agbno, len, &outcome);
616 659939419 : if (!xchk_should_check_xref(sc, &error, &sc->sa.refc_cur))
617 : return;
618 659950746 : if (outcome != XBTREE_RECPACKING_EMPTY)
619 0 : xchk_btree_xref_set_corrupt(sc, sc->sa.refc_cur, 0);
620 : }
|
