Home
last modified time | relevance | path

Searched refs:bno_cur (Results 1 - 14 of 14) sorted by relevance

/kernel/linux/linux-5.10/fs/xfs/scrub/
H A Dalloc.c50 pcur = &sc->sa.bno_cur; in xchk_allocbt_xref_other()
122 cur = which == XFS_BTNUM_BNO ? sc->sa.bno_cur : sc->sa.cnt_cur; in xchk_allocbt()
150 if (!sc->sa.bno_cur || xchk_skip_xref(sc->sm)) in xchk_xref_is_used_space()
153 error = xfs_alloc_has_record(sc->sa.bno_cur, agbno, len, &is_freesp); in xchk_xref_is_used_space()
154 if (!xchk_should_check_xref(sc, &error, &sc->sa.bno_cur)) in xchk_xref_is_used_space()
157 xchk_btree_xref_set_corrupt(sc, sc->sa.bno_cur, 0); in xchk_xref_is_used_space()
H A Dcommon.c443 if (sa->bno_cur) in xchk_ag_btcur_free()
444 xfs_btree_del_cursor(sa->bno_cur, XFS_BTREE_ERROR); in xchk_ag_btcur_free()
450 sa->bno_cur = NULL; in xchk_ag_btcur_free()
467 sa->bno_cur = xfs_allocbt_init_cursor(mp, sc->tp, sa->agf_bp, in xchk_ag_btcur_init()
469 if (!sa->bno_cur) in xchk_ag_btcur_init()
H A Dagheader.c365 if (!sc->sa.bno_cur) in xchk_agf_xref_freeblks()
368 error = xfs_alloc_query_all(sc->sa.bno_cur, in xchk_agf_xref_freeblks()
370 if (!xchk_should_check_xref(sc, &error, &sc->sa.bno_cur)) in xchk_agf_xref_freeblks()
436 !sc->sa.bno_cur || !sc->sa.cnt_cur) in xchk_agf_xref_btreeblks()
440 error = xfs_btree_count_blocks(sc->sa.bno_cur, &blocks); in xchk_agf_xref_btreeblks()
441 if (!xchk_should_check_xref(sc, &error, &sc->sa.bno_cur)) in xchk_agf_xref_btreeblks()
H A Dscrub.h48 struct xfs_btree_cur *bno_cur; member
H A Dbtree.c384 * The bnobt scrubber aliases bs->cur to bs->sc->sa.bno_cur, so we in xchk_btree_check_block_owner()
388 if (!bs->sc->sa.bno_cur && btnum == XFS_BTNUM_BNO) in xchk_btree_check_block_owner()
/kernel/linux/linux-6.6/fs/xfs/scrub/
H A Dalloc.c59 pcur = &sc->sa.bno_cur; in xchk_allocbt_xref_other()
150 cur = which == XFS_BTNUM_BNO ? sc->sa.bno_cur : sc->sa.cnt_cur; in xchk_allocbt()
178 if (!sc->sa.bno_cur || xchk_skip_xref(sc->sm)) in xchk_xref_is_used_space()
181 error = xfs_alloc_has_records(sc->sa.bno_cur, agbno, len, &outcome); in xchk_xref_is_used_space()
182 if (!xchk_should_check_xref(sc, &error, &sc->sa.bno_cur)) in xchk_xref_is_used_space()
185 xchk_btree_xref_set_corrupt(sc, sc->sa.bno_cur, 0); in xchk_xref_is_used_space()
H A Dagheader.c387 if (!sc->sa.bno_cur) in xchk_agf_xref_freeblks()
390 error = xfs_alloc_query_all(sc->sa.bno_cur, in xchk_agf_xref_freeblks()
392 if (!xchk_should_check_xref(sc, &error, &sc->sa.bno_cur)) in xchk_agf_xref_freeblks()
462 !sc->sa.bno_cur || !sc->sa.cnt_cur) in xchk_agf_xref_btreeblks()
466 error = xfs_btree_count_blocks(sc->sa.bno_cur, &blocks); in xchk_agf_xref_btreeblks()
467 if (!xchk_should_check_xref(sc, &error, &sc->sa.bno_cur)) in xchk_agf_xref_btreeblks()
H A Dscrub.h54 struct xfs_btree_cur *bno_cur; member
H A Dcommon.c538 if (sa->bno_cur) in xchk_ag_btcur_free()
539 xfs_btree_del_cursor(sa->bno_cur, XFS_BTREE_ERROR); in xchk_ag_btcur_free()
545 sa->bno_cur = NULL; in xchk_ag_btcur_free()
560 sa->bno_cur = xfs_allocbt_init_cursor(mp, sc->tp, sa->agf_bp, in xchk_ag_btcur_init()
H A Drmap.c412 cur = sc->sa.bno_cur; in xchk_rmapbt_walk_ag_metadata()
417 if (cur != sc->sa.bno_cur) in xchk_rmapbt_walk_ag_metadata()
H A Dfscounters.c274 error = xfs_btree_count_blocks(sc->sa.bno_cur, &blocks); in xchk_fscount_btreeblks()
H A Dbtree.c398 * The bnobt scrubber aliases bs->cur to bs->sc->sa.bno_cur, so we in xchk_btree_check_block_owner()
402 if (!bs->sc->sa.bno_cur && btnum == XFS_BTNUM_BNO) in xchk_btree_check_block_owner()
/kernel/linux/linux-5.10/fs/xfs/libxfs/
H A Dxfs_alloc.c430 xfs_btree_cur_t *bno_cur, /* cursor for by-block btree */ in xfs_alloc_fixup_trees()
471 if ((error = xfs_alloc_get_rec(bno_cur, &nfbno1, &nflen1, &i))) in xfs_alloc_fixup_trees()
480 if ((error = xfs_alloc_lookup_eq(bno_cur, fbno, flen, &i))) in xfs_alloc_fixup_trees()
487 if (bno_cur->bc_nlevels == 1 && cnt_cur->bc_nlevels == 1) { in xfs_alloc_fixup_trees()
491 bnoblock = XFS_BUF_TO_BLOCK(bno_cur->bc_bufs[0]); in xfs_alloc_fixup_trees()
559 if ((error = xfs_btree_delete(bno_cur, &i))) in xfs_alloc_fixup_trees()
567 if ((error = xfs_alloc_update(bno_cur, nfbno1, nflen1))) in xfs_alloc_fixup_trees()
574 if ((error = xfs_alloc_lookup_eq(bno_cur, nfbno2, nflen2, &i))) in xfs_alloc_fixup_trees()
578 if ((error = xfs_btree_insert(bno_cur, &i))) in xfs_alloc_fixup_trees()
1204 xfs_btree_cur_t *bno_cur;/* b in xfs_alloc_ag_vextent_exact() local
428 xfs_alloc_fixup_trees( xfs_btree_cur_t *cnt_cur, xfs_btree_cur_t *bno_cur, xfs_agblock_t fbno, xfs_extlen_t flen, xfs_agblock_t rbno, xfs_extlen_t rlen, int flags) xfs_alloc_fixup_trees() argument
1662 xfs_btree_cur_t *bno_cur; /* cursor for bno btree */ xfs_alloc_ag_vextent_size() local
1888 struct xfs_btree_cur *bno_cur; xfs_free_ag_extent() local
[all...]
/kernel/linux/linux-6.6/fs/xfs/libxfs/
H A Dxfs_alloc.c475 struct xfs_btree_cur *bno_cur, /* cursor for by-block btree */ in xfs_alloc_fixup_trees()
516 if ((error = xfs_alloc_get_rec(bno_cur, &nfbno1, &nflen1, &i))) in xfs_alloc_fixup_trees()
525 if ((error = xfs_alloc_lookup_eq(bno_cur, fbno, flen, &i))) in xfs_alloc_fixup_trees()
532 if (bno_cur->bc_nlevels == 1 && cnt_cur->bc_nlevels == 1) { in xfs_alloc_fixup_trees()
536 bnoblock = XFS_BUF_TO_BLOCK(bno_cur->bc_levels[0].bp); in xfs_alloc_fixup_trees()
604 if ((error = xfs_btree_delete(bno_cur, &i))) in xfs_alloc_fixup_trees()
612 if ((error = xfs_alloc_update(bno_cur, nfbno1, nflen1))) in xfs_alloc_fixup_trees()
619 if ((error = xfs_alloc_lookup_eq(bno_cur, nfbno2, nflen2, &i))) in xfs_alloc_fixup_trees()
623 if ((error = xfs_btree_insert(bno_cur, &i))) in xfs_alloc_fixup_trees()
1186 struct xfs_btree_cur *bno_cur;/* b in xfs_alloc_ag_vextent_exact() local
473 xfs_alloc_fixup_trees( struct xfs_btree_cur *cnt_cur, struct xfs_btree_cur *bno_cur, xfs_agblock_t fbno, xfs_extlen_t flen, xfs_agblock_t rbno, xfs_extlen_t rlen, int flags) xfs_alloc_fixup_trees() argument
1658 struct xfs_btree_cur *bno_cur; xfs_alloc_ag_vextent_size() local
1903 struct xfs_btree_cur *bno_cur; xfs_free_ag_extent() local
[all...]

Completed in 14 milliseconds