Lines Matching refs:bs
138 struct xchk_btree *bs) in xchk_btree_rec() argument
140 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_rec()
152 trace_xchk_btree_rec(bs->sc, cur, 0); in xchk_btree_rec()
155 if (bs->lastrec_valid && in xchk_btree_rec()
156 !cur->bc_ops->recs_inorder(cur, &bs->lastrec, rec)) in xchk_btree_rec()
157 xchk_btree_set_corrupt(bs->sc, cur, 0); in xchk_btree_rec()
158 memcpy(&bs->lastrec, rec, cur->bc_ops->rec_len); in xchk_btree_rec()
159 bs->lastrec_valid = true; in xchk_btree_rec()
169 xchk_btree_set_corrupt(bs->sc, cur, 1); in xchk_btree_rec()
178 xchk_btree_set_corrupt(bs->sc, cur, 1); in xchk_btree_rec()
187 struct xchk_btree *bs, in xchk_btree_key() argument
190 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_key()
200 trace_xchk_btree_key(bs->sc, cur, level); in xchk_btree_key()
203 if (bs->lastkey[level - 1].valid && in xchk_btree_key()
204 !cur->bc_ops->keys_inorder(cur, &bs->lastkey[level - 1].key, key)) in xchk_btree_key()
205 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_key()
206 memcpy(&bs->lastkey[level - 1].key, key, cur->bc_ops->key_len); in xchk_btree_key()
207 bs->lastkey[level - 1].valid = true; in xchk_btree_key()
216 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_key()
226 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_key()
235 struct xchk_btree *bs, in xchk_btree_ptr_ok() argument
242 if ((bs->cur->bc_flags & XFS_BTREE_ROOT_IN_INODE) && in xchk_btree_ptr_ok()
243 level == bs->cur->bc_nlevels) in xchk_btree_ptr_ok()
247 if (bs->cur->bc_flags & XFS_BTREE_LONG_PTRS) in xchk_btree_ptr_ok()
248 res = xfs_btree_check_lptr(bs->cur, be64_to_cpu(ptr->l), level); in xchk_btree_ptr_ok()
250 res = xfs_btree_check_sptr(bs->cur, be32_to_cpu(ptr->s), level); in xchk_btree_ptr_ok()
252 xchk_btree_set_corrupt(bs->sc, bs->cur, level); in xchk_btree_ptr_ok()
260 struct xchk_btree *bs, in xchk_btree_block_check_sibling() argument
265 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_block_check_sibling()
274 if (!xchk_btree_process_error(bs->sc, cur, level + 1, &error) || in xchk_btree_block_check_sibling()
288 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_block_check_sibling()
298 if (!xchk_btree_process_error(bs->sc, cur, level + 1, &error)) in xchk_btree_block_check_sibling()
301 xchk_btree_set_corrupt(bs->sc, cur, level + 1); in xchk_btree_block_check_sibling()
308 if (!xchk_btree_ptr_ok(bs, level + 1, pp)) in xchk_btree_block_check_sibling()
311 xchk_buffer_recheck(bs->sc, pbp); in xchk_btree_block_check_sibling()
314 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_block_check_sibling()
323 struct xchk_btree *bs, in xchk_btree_block_check_siblings() argument
326 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_block_check_siblings()
340 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_block_check_siblings()
349 error = xchk_btree_block_check_sibling(bs, level, -1, &leftsib); in xchk_btree_block_check_siblings()
352 error = xchk_btree_block_check_sibling(bs, level, 1, &rightsib); in xchk_btree_block_check_siblings()
371 struct xchk_btree *bs, in xchk_btree_check_block_owner() argument
381 if (!bs->cur) in xchk_btree_check_block_owner()
384 btnum = bs->cur->bc_btnum; in xchk_btree_check_block_owner()
385 agno = xfs_daddr_to_agno(bs->cur->bc_mp, daddr); in xchk_btree_check_block_owner()
386 agbno = xfs_daddr_to_agbno(bs->cur->bc_mp, daddr); in xchk_btree_check_block_owner()
393 init_sa = bs->cur->bc_flags & XFS_BTREE_ROOT_IN_INODE; in xchk_btree_check_block_owner()
395 error = xchk_ag_init_existing(bs->sc, agno, &bs->sc->sa); in xchk_btree_check_block_owner()
396 if (!xchk_btree_xref_process_error(bs->sc, bs->cur, in xchk_btree_check_block_owner()
401 xchk_xref_is_used_space(bs->sc, agbno, 1); in xchk_btree_check_block_owner()
407 if (!bs->sc->sa.bno_cur && btnum == XFS_BTNUM_BNO) in xchk_btree_check_block_owner()
408 bs->cur = NULL; in xchk_btree_check_block_owner()
410 xchk_xref_is_only_owned_by(bs->sc, agbno, 1, bs->oinfo); in xchk_btree_check_block_owner()
411 if (!bs->sc->sa.rmap_cur && btnum == XFS_BTNUM_RMAP) in xchk_btree_check_block_owner()
412 bs->cur = NULL; in xchk_btree_check_block_owner()
416 xchk_ag_free(bs->sc, &bs->sc->sa); in xchk_btree_check_block_owner()
424 struct xchk_btree *bs, in xchk_btree_check_owner() argument
428 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_check_owner()
438 xchk_btree_set_corrupt(bs->sc, bs->cur, level); in xchk_btree_check_owner()
460 list_add_tail(&co->list, &bs->to_check); in xchk_btree_check_owner()
464 return xchk_btree_check_block_owner(bs, level, xfs_buf_daddr(bp)); in xchk_btree_check_owner()
470 struct xchk_btree *bs) in xchk_btree_check_iroot_minrecs() argument
483 if (bs->cur->bc_btnum == XFS_BTNUM_BMAP && in xchk_btree_check_iroot_minrecs()
484 bs->cur->bc_ino.whichfork == XFS_DATA_FORK && in xchk_btree_check_iroot_minrecs()
485 xfs_inode_has_attr_fork(bs->sc->ip)) in xchk_btree_check_iroot_minrecs()
497 struct xchk_btree *bs, in xchk_btree_check_minrecs() argument
501 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_check_minrecs()
524 if (xchk_btree_check_iroot_minrecs(bs) && in xchk_btree_check_minrecs()
527 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_check_minrecs()
536 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_check_minrecs()
545 struct xchk_btree *bs, in xchk_btree_block_check_keys() argument
552 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_block_check_keys()
566 xchk_btree_set_corrupt(bs->sc, bs->cur, level); in xchk_btree_block_check_keys()
578 xchk_btree_set_corrupt(bs->sc, bs->cur, level); in xchk_btree_block_check_keys()
587 struct xchk_btree *bs, in xchk_btree_get_block() argument
599 error = xfs_btree_lookup_get_block(bs->cur, level, pp, pblock); in xchk_btree_get_block()
600 if (!xchk_btree_process_error(bs->sc, bs->cur, level, &error) || in xchk_btree_get_block()
604 xfs_btree_get_block(bs->cur, level, pbp); in xchk_btree_get_block()
605 if (bs->cur->bc_flags & XFS_BTREE_LONG_PTRS) in xchk_btree_get_block()
606 failed_at = __xfs_btree_check_lblock(bs->cur, *pblock, in xchk_btree_get_block()
609 failed_at = __xfs_btree_check_sblock(bs->cur, *pblock, in xchk_btree_get_block()
612 xchk_btree_set_corrupt(bs->sc, bs->cur, level); in xchk_btree_get_block()
616 xchk_buffer_recheck(bs->sc, *pbp); in xchk_btree_get_block()
618 xchk_btree_check_minrecs(bs, level, *pblock); in xchk_btree_get_block()
624 error = xchk_btree_check_owner(bs, level, *pbp); in xchk_btree_get_block()
632 error = xchk_btree_block_check_siblings(bs, *pblock); in xchk_btree_get_block()
636 xchk_btree_block_check_keys(bs, level, *pblock); in xchk_btree_get_block()
646 struct xchk_btree *bs, in xchk_btree_block_keys() argument
651 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_block_keys()
670 xchk_btree_set_corrupt(bs->sc, cur, 1); in xchk_btree_block_keys()
681 xchk_btree_set_corrupt(bs->sc, cur, 1); in xchk_btree_block_keys()
698 struct xchk_btree *bs; in xchk_btree() local
719 bs = kzalloc(cur_sz, XCHK_GFP_FLAGS); in xchk_btree()
720 if (!bs) in xchk_btree()
722 bs->cur = cur; in xchk_btree()
723 bs->scrub_rec = scrub_fn; in xchk_btree()
724 bs->oinfo = oinfo; in xchk_btree()
725 bs->private = private; in xchk_btree()
726 bs->sc = sc; in xchk_btree()
729 INIT_LIST_HEAD(&bs->to_check); in xchk_btree()
737 if (!xchk_btree_ptr_ok(bs, cur->bc_nlevels, &ptr)) in xchk_btree()
739 error = xchk_btree_get_block(bs, level, &ptr, &block, &bp); in xchk_btree()
752 xchk_btree_block_keys(bs, level, block); in xchk_btree()
760 xchk_btree_rec(bs); in xchk_btree()
765 error = bs->scrub_rec(bs, recp); in xchk_btree()
779 xchk_btree_block_keys(bs, level, block); in xchk_btree()
787 xchk_btree_key(bs, level); in xchk_btree()
791 if (!xchk_btree_ptr_ok(bs, level, pp)) { in xchk_btree()
796 error = xchk_btree_get_block(bs, level, pp, &block, &bp); in xchk_btree()
805 list_for_each_entry_safe(co, n, &bs->to_check, list) { in xchk_btree()
806 if (!error && bs->cur) in xchk_btree()
807 error = xchk_btree_check_block_owner(bs, co->level, in xchk_btree()
812 kfree(bs); in xchk_btree()