Lines Matching refs:bs
126 struct xchk_btree *bs) in xchk_btree_rec() argument
128 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_rec()
140 trace_xchk_btree_rec(bs->sc, cur, 0); in xchk_btree_rec()
143 if (!bs->firstrec && !cur->bc_ops->recs_inorder(cur, &bs->lastrec, rec)) in xchk_btree_rec()
144 xchk_btree_set_corrupt(bs->sc, cur, 0); in xchk_btree_rec()
145 bs->firstrec = false; in xchk_btree_rec()
146 memcpy(&bs->lastrec, rec, cur->bc_ops->rec_len); in xchk_btree_rec()
156 xchk_btree_set_corrupt(bs->sc, cur, 1); in xchk_btree_rec()
165 xchk_btree_set_corrupt(bs->sc, cur, 1); in xchk_btree_rec()
174 struct xchk_btree *bs, in xchk_btree_key() argument
177 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_key()
187 trace_xchk_btree_key(bs->sc, cur, level); in xchk_btree_key()
190 if (!bs->firstkey[level] && in xchk_btree_key()
191 !cur->bc_ops->keys_inorder(cur, &bs->lastkey[level], key)) in xchk_btree_key()
192 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_key()
193 bs->firstkey[level] = false; in xchk_btree_key()
194 memcpy(&bs->lastkey[level], key, cur->bc_ops->key_len); in xchk_btree_key()
203 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_key()
212 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_key()
221 struct xchk_btree *bs, in xchk_btree_ptr_ok() argument
228 if ((bs->cur->bc_flags & XFS_BTREE_ROOT_IN_INODE) && in xchk_btree_ptr_ok()
229 level == bs->cur->bc_nlevels) in xchk_btree_ptr_ok()
233 if (bs->cur->bc_flags & XFS_BTREE_LONG_PTRS) in xchk_btree_ptr_ok()
234 res = xfs_btree_check_lptr(bs->cur, be64_to_cpu(ptr->l), level); in xchk_btree_ptr_ok()
236 res = xfs_btree_check_sptr(bs->cur, be32_to_cpu(ptr->s), level); in xchk_btree_ptr_ok()
238 xchk_btree_set_corrupt(bs->sc, bs->cur, level); in xchk_btree_ptr_ok()
246 struct xchk_btree *bs, in xchk_btree_block_check_sibling() argument
251 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_block_check_sibling()
260 if (!xchk_btree_process_error(bs->sc, cur, level + 1, &error) || in xchk_btree_block_check_sibling()
274 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_block_check_sibling()
284 if (!xchk_btree_process_error(bs->sc, cur, level + 1, &error)) in xchk_btree_block_check_sibling()
287 xchk_btree_set_corrupt(bs->sc, cur, level + 1); in xchk_btree_block_check_sibling()
294 if (!xchk_btree_ptr_ok(bs, level + 1, pp)) in xchk_btree_block_check_sibling()
297 xchk_buffer_recheck(bs->sc, pbp); in xchk_btree_block_check_sibling()
300 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_block_check_sibling()
309 struct xchk_btree *bs, in xchk_btree_block_check_siblings() argument
312 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_block_check_siblings()
326 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_block_check_siblings()
335 error = xchk_btree_block_check_sibling(bs, level, -1, &leftsib); in xchk_btree_block_check_siblings()
338 error = xchk_btree_block_check_sibling(bs, level, 1, &rightsib); in xchk_btree_block_check_siblings()
357 struct xchk_btree *bs, in xchk_btree_check_block_owner() argument
367 if (!bs->cur) in xchk_btree_check_block_owner()
370 btnum = bs->cur->bc_btnum; in xchk_btree_check_block_owner()
371 agno = xfs_daddr_to_agno(bs->cur->bc_mp, daddr); in xchk_btree_check_block_owner()
372 agbno = xfs_daddr_to_agbno(bs->cur->bc_mp, daddr); in xchk_btree_check_block_owner()
374 init_sa = bs->cur->bc_flags & XFS_BTREE_LONG_PTRS; in xchk_btree_check_block_owner()
376 error = xchk_ag_init(bs->sc, agno, &bs->sc->sa); in xchk_btree_check_block_owner()
377 if (!xchk_btree_xref_process_error(bs->sc, bs->cur, in xchk_btree_check_block_owner()
382 xchk_xref_is_used_space(bs->sc, agbno, 1); in xchk_btree_check_block_owner()
388 if (!bs->sc->sa.bno_cur && btnum == XFS_BTNUM_BNO) in xchk_btree_check_block_owner()
389 bs->cur = NULL; in xchk_btree_check_block_owner()
391 xchk_xref_is_owned_by(bs->sc, agbno, 1, bs->oinfo); in xchk_btree_check_block_owner()
392 if (!bs->sc->sa.rmap_cur && btnum == XFS_BTNUM_RMAP) in xchk_btree_check_block_owner()
393 bs->cur = NULL; in xchk_btree_check_block_owner()
396 xchk_ag_free(bs->sc, &bs->sc->sa); in xchk_btree_check_block_owner()
404 struct xchk_btree *bs, in xchk_btree_check_owner() argument
408 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_check_owner()
419 xchk_btree_set_corrupt(bs->sc, bs->cur, level); in xchk_btree_check_owner()
438 list_add_tail(&co->list, &bs->to_check); in xchk_btree_check_owner()
442 return xchk_btree_check_block_owner(bs, level, XFS_BUF_ADDR(bp)); in xchk_btree_check_owner()
451 struct xchk_btree *bs, in xchk_btree_check_minrecs() argument
455 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_check_minrecs()
480 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_check_minrecs()
489 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_check_minrecs()
498 struct xchk_btree *bs, in xchk_btree_get_block() argument
510 error = xfs_btree_lookup_get_block(bs->cur, level, pp, pblock); in xchk_btree_get_block()
511 if (!xchk_btree_process_error(bs->sc, bs->cur, level, &error) || in xchk_btree_get_block()
515 xfs_btree_get_block(bs->cur, level, pbp); in xchk_btree_get_block()
516 if (bs->cur->bc_flags & XFS_BTREE_LONG_PTRS) in xchk_btree_get_block()
517 failed_at = __xfs_btree_check_lblock(bs->cur, *pblock, in xchk_btree_get_block()
520 failed_at = __xfs_btree_check_sblock(bs->cur, *pblock, in xchk_btree_get_block()
523 xchk_btree_set_corrupt(bs->sc, bs->cur, level); in xchk_btree_get_block()
527 xchk_buffer_recheck(bs->sc, *pbp); in xchk_btree_get_block()
529 xchk_btree_check_minrecs(bs, level, *pblock); in xchk_btree_get_block()
535 error = xchk_btree_check_owner(bs, level, *pbp); in xchk_btree_get_block()
543 return xchk_btree_block_check_siblings(bs, *pblock); in xchk_btree_get_block()
552 struct xchk_btree *bs, in xchk_btree_block_keys() argument
557 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_block_keys()
576 xchk_btree_set_corrupt(bs->sc, cur, 1); in xchk_btree_block_keys()
587 xchk_btree_set_corrupt(bs->sc, cur, 1); in xchk_btree_block_keys()
603 struct xchk_btree bs = { in xchk_btree() local
624 bs.firstkey[i] = true; in xchk_btree()
625 INIT_LIST_HEAD(&bs.to_check); in xchk_btree()
639 if (!xchk_btree_ptr_ok(&bs, cur->bc_nlevels, &ptr)) in xchk_btree()
641 error = xchk_btree_get_block(&bs, level, &ptr, &block, &bp); in xchk_btree()
654 xchk_btree_block_keys(&bs, level, block); in xchk_btree()
662 xchk_btree_rec(&bs); in xchk_btree()
666 error = bs.scrub_rec(&bs, recp); in xchk_btree()
679 xchk_btree_block_keys(&bs, level, block); in xchk_btree()
687 xchk_btree_key(&bs, level); in xchk_btree()
691 if (!xchk_btree_ptr_ok(&bs, level, pp)) { in xchk_btree()
696 error = xchk_btree_get_block(&bs, level, pp, &block, &bp); in xchk_btree()
705 list_for_each_entry_safe(co, n, &bs.to_check, list) { in xchk_btree()
706 if (!error && bs.cur) in xchk_btree()
707 error = xchk_btree_check_block_owner(&bs, in xchk_btree()