Lines Matching refs:bs
138 struct xchk_btree *bs)
140 struct xfs_btree_cur *cur = bs->cur;
152 trace_xchk_btree_rec(bs->sc, cur, 0);
155 if (bs->lastrec_valid &&
156 !cur->bc_ops->recs_inorder(cur, &bs->lastrec, rec))
157 xchk_btree_set_corrupt(bs->sc, cur, 0);
158 memcpy(&bs->lastrec, rec, cur->bc_ops->rec_len);
159 bs->lastrec_valid = true;
169 xchk_btree_set_corrupt(bs->sc, cur, 1);
178 xchk_btree_set_corrupt(bs->sc, cur, 1);
187 struct xchk_btree *bs,
190 struct xfs_btree_cur *cur = bs->cur;
200 trace_xchk_btree_key(bs->sc, cur, level);
203 if (bs->lastkey[level - 1].valid &&
204 !cur->bc_ops->keys_inorder(cur, &bs->lastkey[level - 1].key, key))
205 xchk_btree_set_corrupt(bs->sc, cur, level);
206 memcpy(&bs->lastkey[level - 1].key, key, cur->bc_ops->key_len);
207 bs->lastkey[level - 1].valid = true;
216 xchk_btree_set_corrupt(bs->sc, cur, level);
226 xchk_btree_set_corrupt(bs->sc, cur, level);
235 struct xchk_btree *bs,
242 if ((bs->cur->bc_flags & XFS_BTREE_ROOT_IN_INODE) &&
243 level == bs->cur->bc_nlevels)
247 if (bs->cur->bc_flags & XFS_BTREE_LONG_PTRS)
248 res = xfs_btree_check_lptr(bs->cur, be64_to_cpu(ptr->l), level);
250 res = xfs_btree_check_sptr(bs->cur, be32_to_cpu(ptr->s), level);
252 xchk_btree_set_corrupt(bs->sc, bs->cur, level);
260 struct xchk_btree *bs,
265 struct xfs_btree_cur *cur = bs->cur;
274 if (!xchk_btree_process_error(bs->sc, cur, level + 1, &error) ||
288 xchk_btree_set_corrupt(bs->sc, cur, level);
298 if (!xchk_btree_process_error(bs->sc, cur, level + 1, &error))
301 xchk_btree_set_corrupt(bs->sc, cur, level + 1);
308 if (!xchk_btree_ptr_ok(bs, level + 1, pp))
311 xchk_buffer_recheck(bs->sc, pbp);
314 xchk_btree_set_corrupt(bs->sc, cur, level);
323 struct xchk_btree *bs,
326 struct xfs_btree_cur *cur = bs->cur;
340 xchk_btree_set_corrupt(bs->sc, cur, level);
349 error = xchk_btree_block_check_sibling(bs, level, -1, &leftsib);
352 error = xchk_btree_block_check_sibling(bs, level, 1, &rightsib);
371 struct xchk_btree *bs,
381 if (!bs->cur)
384 btnum = bs->cur->bc_btnum;
385 agno = xfs_daddr_to_agno(bs->cur->bc_mp, daddr);
386 agbno = xfs_daddr_to_agbno(bs->cur->bc_mp, daddr);
388 init_sa = bs->cur->bc_flags & XFS_BTREE_LONG_PTRS;
390 error = xchk_ag_init_existing(bs->sc, agno, &bs->sc->sa);
391 if (!xchk_btree_xref_process_error(bs->sc, bs->cur,
396 xchk_xref_is_used_space(bs->sc, agbno, 1);
398 * The bnobt scrubber aliases bs->cur to bs->sc->sa.bno_cur, so we
402 if (!bs->sc->sa.bno_cur && btnum == XFS_BTNUM_BNO)
403 bs->cur = NULL;
405 xchk_xref_is_only_owned_by(bs->sc, agbno, 1, bs->oinfo);
406 if (!bs->sc->sa.rmap_cur && btnum == XFS_BTNUM_RMAP)
407 bs->cur = NULL;
411 xchk_ag_free(bs->sc, &bs->sc->sa);
419 struct xchk_btree *bs,
423 struct xfs_btree_cur *cur = bs->cur;
433 xchk_btree_set_corrupt(bs->sc, bs->cur, level);
455 list_add_tail(&co->list, &bs->to_check);
459 return xchk_btree_check_block_owner(bs, level, xfs_buf_daddr(bp));
465 struct xchk_btree *bs)
478 if (bs->cur->bc_btnum == XFS_BTNUM_BMAP &&
479 bs->cur->bc_ino.whichfork == XFS_DATA_FORK &&
480 xfs_inode_has_attr_fork(bs->sc->ip))
492 struct xchk_btree *bs,
496 struct xfs_btree_cur *cur = bs->cur;
519 if (xchk_btree_check_iroot_minrecs(bs) &&
522 xchk_btree_set_corrupt(bs->sc, cur, level);
531 xchk_btree_set_corrupt(bs->sc, cur, level);
540 struct xchk_btree *bs,
547 struct xfs_btree_cur *cur = bs->cur;
561 xchk_btree_set_corrupt(bs->sc, bs->cur, level);
573 xchk_btree_set_corrupt(bs->sc, bs->cur, level);
582 struct xchk_btree *bs,
594 error = xfs_btree_lookup_get_block(bs->cur, level, pp, pblock);
595 if (!xchk_btree_process_error(bs->sc, bs->cur, level, &error) ||
599 xfs_btree_get_block(bs->cur, level, pbp);
600 if (bs->cur->bc_flags & XFS_BTREE_LONG_PTRS)
601 failed_at = __xfs_btree_check_lblock(bs->cur, *pblock,
604 failed_at = __xfs_btree_check_sblock(bs->cur, *pblock,
607 xchk_btree_set_corrupt(bs->sc, bs->cur, level);
611 xchk_buffer_recheck(bs->sc, *pbp);
613 xchk_btree_check_minrecs(bs, level, *pblock);
619 error = xchk_btree_check_owner(bs, level, *pbp);
627 error = xchk_btree_block_check_siblings(bs, *pblock);
631 xchk_btree_block_check_keys(bs, level, *pblock);
641 struct xchk_btree *bs,
646 struct xfs_btree_cur *cur = bs->cur;
665 xchk_btree_set_corrupt(bs->sc, cur, 1);
676 xchk_btree_set_corrupt(bs->sc, cur, 1);
693 struct xchk_btree *bs;
714 bs = kzalloc(cur_sz, XCHK_GFP_FLAGS);
715 if (!bs)
717 bs->cur = cur;
718 bs->scrub_rec = scrub_fn;
719 bs->oinfo = oinfo;
720 bs->private = private;
721 bs->sc = sc;
724 INIT_LIST_HEAD(&bs->to_check);
732 if (!xchk_btree_ptr_ok(bs, cur->bc_nlevels, &ptr))
734 error = xchk_btree_get_block(bs, level, &ptr, &block, &bp);
747 xchk_btree_block_keys(bs, level, block);
755 xchk_btree_rec(bs);
760 error = bs->scrub_rec(bs, recp);
774 xchk_btree_block_keys(bs, level, block);
782 xchk_btree_key(bs, level);
786 if (!xchk_btree_ptr_ok(bs, level, pp)) {
791 error = xchk_btree_get_block(bs, level, pp, &block, &bp);
800 list_for_each_entry_safe(co, n, &bs->to_check, list) {
801 if (!error && bs->cur)
802 error = xchk_btree_check_block_owner(bs, co->level,
807 kfree(bs);