Lines Matching defs: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,
240 if (bs->cur->bc_ops->type == XFS_BTREE_TYPE_INODE &&
241 level == bs->cur->bc_nlevels)
245 if (__xfs_btree_check_ptr(bs->cur, ptr, 0, level)) {
246 xchk_btree_set_corrupt(bs->sc, bs->cur, level);
256 struct xchk_btree *bs,
261 struct xfs_btree_cur *cur = bs->cur;
270 if (!xchk_btree_process_error(bs->sc, cur, level + 1, &error) ||
284 xchk_btree_set_corrupt(bs->sc, cur, level);
294 if (!xchk_btree_process_error(bs->sc, cur, level + 1, &error))
297 xchk_btree_set_corrupt(bs->sc, cur, level + 1);
304 if (!xchk_btree_ptr_ok(bs, level + 1, pp))
307 xchk_buffer_recheck(bs->sc, pbp);
310 xchk_btree_set_corrupt(bs->sc, cur, level);
319 struct xchk_btree *bs,
322 struct xfs_btree_cur *cur = bs->cur;
336 xchk_btree_set_corrupt(bs->sc, cur, level);
345 error = xchk_btree_block_check_sibling(bs, level, -1, &leftsib);
348 error = xchk_btree_block_check_sibling(bs, level, 1, &rightsib);
367 struct xchk_btree *bs,
376 if (!bs->cur)
379 agno = xfs_daddr_to_agno(bs->cur->bc_mp, daddr);
380 agbno = xfs_daddr_to_agbno(bs->cur->bc_mp, daddr);
387 init_sa = bs->cur->bc_ops->type != XFS_BTREE_TYPE_AG;
389 error = xchk_ag_init_existing(bs->sc, agno, &bs->sc->sa);
390 if (!xchk_btree_xref_process_error(bs->sc, bs->cur,
395 xchk_xref_is_used_space(bs->sc, agbno, 1);
397 * The bnobt scrubber aliases bs->cur to bs->sc->sa.bno_cur, so we
401 if (!bs->sc->sa.bno_cur && xfs_btree_is_bno(bs->cur->bc_ops))
402 bs->cur = NULL;
404 xchk_xref_is_only_owned_by(bs->sc, agbno, 1, bs->oinfo);
405 if (!bs->sc->sa.rmap_cur && xfs_btree_is_rmap(bs->cur->bc_ops))
406 bs->cur = NULL;
410 xchk_ag_free(bs->sc, &bs->sc->sa);
418 struct xchk_btree *bs,
422 struct xfs_btree_cur *cur = bs->cur;
432 xchk_btree_set_corrupt(bs->sc, bs->cur, level);
454 list_add_tail(&co->list, &bs->to_check);
458 return xchk_btree_check_block_owner(bs, level, xfs_buf_daddr(bp));
464 struct xchk_btree *bs)
477 if (xfs_btree_is_bmap(bs->cur->bc_ops) &&
478 bs->cur->bc_ino.whichfork == XFS_DATA_FORK &&
479 xfs_inode_has_attr_fork(bs->sc->ip))
491 struct xchk_btree *bs,
495 struct xfs_btree_cur *cur = bs->cur;
518 if (xchk_btree_check_iroot_minrecs(bs) &&
521 xchk_btree_set_corrupt(bs->sc, cur, level);
530 xchk_btree_set_corrupt(bs->sc, cur, level);
539 struct xchk_btree *bs,
546 struct xfs_btree_cur *cur = bs->cur;
560 xchk_btree_set_corrupt(bs->sc, bs->cur, level);
572 xchk_btree_set_corrupt(bs->sc, bs->cur, level);
581 struct xchk_btree *bs,
592 error = xfs_btree_lookup_get_block(bs->cur, level, pp, pblock);
593 if (!xchk_btree_process_error(bs->sc, bs->cur, level, &error) ||
597 xfs_btree_get_block(bs->cur, level, pbp);
598 if (__xfs_btree_check_block(bs->cur, *pblock, level, *pbp)) {
599 xchk_btree_set_corrupt(bs->sc, bs->cur, level);
603 xchk_buffer_recheck(bs->sc, *pbp);
605 xchk_btree_check_minrecs(bs, level, *pblock);
611 error = xchk_btree_check_owner(bs, level, *pbp);
619 error = xchk_btree_block_check_siblings(bs, *pblock);
623 xchk_btree_block_check_keys(bs, level, *pblock);
633 struct xchk_btree *bs,
638 struct xfs_btree_cur *cur = bs->cur;
657 xchk_btree_set_corrupt(bs->sc, cur, 1);
668 xchk_btree_set_corrupt(bs->sc, cur, 1);
685 struct xchk_btree *bs;
706 bs = kzalloc(cur_sz, XCHK_GFP_FLAGS);
707 if (!bs)
709 bs->cur = cur;
710 bs->scrub_rec = scrub_fn;
711 bs->oinfo = oinfo;
712 bs->private = private;
713 bs->sc = sc;
716 INIT_LIST_HEAD(&bs->to_check);
724 if (!xchk_btree_ptr_ok(bs, cur->bc_nlevels, &ptr))
726 error = xchk_btree_get_block(bs, level, &ptr, &block, &bp);
739 xchk_btree_block_keys(bs, level, block);
747 xchk_btree_rec(bs);
752 error = bs->scrub_rec(bs, recp);
766 xchk_btree_block_keys(bs, level, block);
774 xchk_btree_key(bs, level);
778 if (!xchk_btree_ptr_ok(bs, level, pp)) {
783 error = xchk_btree_get_block(bs, level, pp, &block, &bp);
792 list_for_each_entry_safe(co, n, &bs->to_check, list) {
793 if (!error && bs->cur)
794 error = xchk_btree_check_block_owner(bs, co->level,
799 kfree(bs);