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