28 	struct xfs_btree_cur	*cur,  in __xchk_btree_process_error()  argument
50 		if (cur->bc_ops->type == XFS_BTREE_TYPE_INODE)  in __xchk_btree_process_error()
51 			trace_xchk_ifork_btree_op_error(sc, cur, level,  in __xchk_btree_process_error()
54 			trace_xchk_btree_op_error(sc, cur, level,  in __xchk_btree_process_error()
64 	struct xfs_btree_cur	*cur,  in xchk_btree_process_error()  argument
68 	return __xchk_btree_process_error(sc, cur, level, error,  in xchk_btree_process_error()
75 	struct xfs_btree_cur	*cur,  in xchk_btree_xref_process_error()  argument
79 	return __xchk_btree_process_error(sc, cur, level, error,  in xchk_btree_xref_process_error()
87 	struct xfs_btree_cur	*cur,  in __xchk_btree_set_corrupt()  argument
94 	if (cur->bc_ops->type == XFS_BTREE_TYPE_INODE)  in __xchk_btree_set_corrupt()
95 		trace_xchk_ifork_btree_error(sc, cur, level,  in __xchk_btree_set_corrupt()
98 		trace_xchk_btree_error(sc, cur, level,  in __xchk_btree_set_corrupt()
105 	struct xfs_btree_cur	*cur,  in xchk_btree_set_corrupt()  argument
108 	__xchk_btree_set_corrupt(sc, cur, level, XFS_SCRUB_OFLAG_CORRUPT,  in xchk_btree_set_corrupt()
115 	struct xfs_btree_cur	*cur,  in xchk_btree_xref_set_corrupt()  argument
118 	__xchk_btree_set_corrupt(sc, cur, level, XFS_SCRUB_OFLAG_XCORRUPT,  in xchk_btree_xref_set_corrupt()
125 	struct xfs_btree_cur	*cur,  in xchk_btree_set_preen()  argument
128 	__xchk_btree_set_corrupt(sc, cur, level, XFS_SCRUB_OFLAG_PREEN,  in xchk_btree_set_preen()
140 	struct xfs_btree_cur	*cur = bs->cur;  in xchk_btree_rec()  local
149 	block = xfs_btree_get_block(cur, 0, &bp);  in xchk_btree_rec()
150 	rec = xfs_btree_rec_addr(cur, cur->bc_levels[0].ptr, block);  in xchk_btree_rec()
152 	trace_xchk_btree_rec(bs->sc, cur, 0);  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()
161 	if (cur->bc_nlevels == 1)  in xchk_btree_rec()
165 	cur->bc_ops->init_key_from_rec(&key, rec);  in xchk_btree_rec()
166 	keyblock = xfs_btree_get_block(cur, 1, &bp);  in xchk_btree_rec()
167 	keyp = xfs_btree_key_addr(cur, cur->bc_levels[1].ptr, keyblock);  in xchk_btree_rec()
168 	if (xfs_btree_keycmp_lt(cur, &key, keyp))  in xchk_btree_rec()
169 		xchk_btree_set_corrupt(bs->sc, cur, 1);  in xchk_btree_rec()
171 	if (!(cur->bc_ops->geom_flags & XFS_BTGEO_OVERLAPPING))  in xchk_btree_rec()
175 	cur->bc_ops->init_high_key_from_rec(&hkey, rec);  in xchk_btree_rec()
176 	keyp = xfs_btree_high_key_addr(cur, cur->bc_levels[1].ptr, keyblock);  in xchk_btree_rec()
177 	if (xfs_btree_keycmp_lt(cur, keyp, &hkey))  in xchk_btree_rec()
178 		xchk_btree_set_corrupt(bs->sc, cur, 1);  in xchk_btree_rec()
190 	struct xfs_btree_cur	*cur = bs->cur;  in xchk_btree_key()  local
197 	block = xfs_btree_get_block(cur, level, &bp);  in xchk_btree_key()
198 	key = xfs_btree_key_addr(cur, cur->bc_levels[level].ptr, block);  in xchk_btree_key()
200 	trace_xchk_btree_key(bs->sc, cur, level);  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()
209 	if (level + 1 >= cur->bc_nlevels)  in xchk_btree_key()
213 	keyblock = xfs_btree_get_block(cur, level + 1, &bp);  in xchk_btree_key()
214 	keyp = xfs_btree_key_addr(cur, cur->bc_levels[level + 1].ptr, keyblock);  in xchk_btree_key()
215 	if (xfs_btree_keycmp_lt(cur, key, keyp))  in xchk_btree_key()
216 		xchk_btree_set_corrupt(bs->sc, cur, level);  in xchk_btree_key()
218 	if (!(cur->bc_ops->geom_flags & XFS_BTGEO_OVERLAPPING))  in xchk_btree_key()
222 	key = xfs_btree_high_key_addr(cur, cur->bc_levels[level].ptr, block);  in xchk_btree_key()
223 	keyp = xfs_btree_high_key_addr(cur, cur->bc_levels[level + 1].ptr,  in xchk_btree_key()
225 	if (xfs_btree_keycmp_lt(cur, keyp, key))  in xchk_btree_key()
226 		xchk_btree_set_corrupt(bs->sc, cur, level);  in xchk_btree_key()
240 	if (bs->cur->bc_ops->type == XFS_BTREE_TYPE_INODE &&  in xchk_btree_ptr_ok()
241 	    level == bs->cur->bc_nlevels)  in xchk_btree_ptr_ok()
245 	if (__xfs_btree_check_ptr(bs->cur, ptr, 0, level)) {  in xchk_btree_ptr_ok()
246 		xchk_btree_set_corrupt(bs->sc, bs->cur, level);  in xchk_btree_ptr_ok()
261 	struct xfs_btree_cur	*cur = bs->cur;  in xchk_btree_block_check_sibling()  local
269 	error = xfs_btree_dup_cursor(cur, &ncur);  in xchk_btree_block_check_sibling()
270 	if (!xchk_btree_process_error(bs->sc, cur, level + 1, &error) ||  in xchk_btree_block_check_sibling()
278 	if (xfs_btree_ptr_is_null(cur, sibling)) {  in xchk_btree_block_check_sibling()
284 			xchk_btree_set_corrupt(bs->sc, cur, level);  in xchk_btree_block_check_sibling()
294 	if (!xchk_btree_process_error(bs->sc, cur, level + 1, &error))  in xchk_btree_block_check_sibling()
297 		xchk_btree_set_corrupt(bs->sc, cur, level + 1);  in xchk_btree_block_check_sibling()
309 	if (xfs_btree_diff_two_ptrs(cur, pp, sibling))  in xchk_btree_block_check_sibling()
310 		xchk_btree_set_corrupt(bs->sc, cur, level);  in xchk_btree_block_check_sibling()
322 	struct xfs_btree_cur	*cur = bs->cur;  in xchk_btree_block_check_siblings()  local
328 	xfs_btree_get_sibling(cur, block, &leftsib, XFS_BB_LEFTSIB);  in xchk_btree_block_check_siblings()
329 	xfs_btree_get_sibling(cur, block, &rightsib, XFS_BB_RIGHTSIB);  in xchk_btree_block_check_siblings()
333 	if (level == cur->bc_nlevels - 1) {  in xchk_btree_block_check_siblings()
334 		if (!xfs_btree_ptr_is_null(cur, &leftsib) ||  in xchk_btree_block_check_siblings()
335 		    !xfs_btree_ptr_is_null(cur, &rightsib))  in xchk_btree_block_check_siblings()
336 			xchk_btree_set_corrupt(bs->sc, cur, level);  in xchk_btree_block_check_siblings()
376 	if (!bs->cur)  in xchk_btree_check_block_owner()
379 	agno = xfs_daddr_to_agno(bs->cur->bc_mp, daddr);  in xchk_btree_check_block_owner()
380 	agbno = xfs_daddr_to_agbno(bs->cur->bc_mp, daddr);  in xchk_btree_check_block_owner()
387 	init_sa = bs->cur->bc_ops->type != XFS_BTREE_TYPE_AG;  in xchk_btree_check_block_owner()
390 		if (!xchk_btree_xref_process_error(bs->sc, bs->cur,  in xchk_btree_check_block_owner()
401 	if (!bs->sc->sa.bno_cur && xfs_btree_is_bno(bs->cur->bc_ops))  in xchk_btree_check_block_owner()
402 		bs->cur = NULL;  in xchk_btree_check_block_owner()
405 	if (!bs->sc->sa.rmap_cur && xfs_btree_is_rmap(bs->cur->bc_ops))  in xchk_btree_check_block_owner()
406 		bs->cur = NULL;  in xchk_btree_check_block_owner()
422 	struct xfs_btree_cur	*cur = bs->cur;  in xchk_btree_check_owner()  local
431 		if (cur->bc_ops->type != XFS_BTREE_TYPE_INODE)  in xchk_btree_check_owner()
432 			xchk_btree_set_corrupt(bs->sc, bs->cur, level);  in xchk_btree_check_owner()
444 	if (xfs_btree_is_bno(cur->bc_ops) || xfs_btree_is_rmap(cur->bc_ops)) {  in xchk_btree_check_owner()
477 	if (xfs_btree_is_bmap(bs->cur->bc_ops) &&  in xchk_btree_check_iroot_minrecs()
478 	    bs->cur->bc_ino.whichfork == XFS_DATA_FORK &&  in xchk_btree_check_iroot_minrecs()
495 	struct xfs_btree_cur	*cur = bs->cur;  in xchk_btree_check_minrecs()  local
496 	unsigned int		root_level = cur->bc_nlevels - 1;  in xchk_btree_check_minrecs()
500 	if (numrecs >= cur->bc_ops->get_minrecs(cur, level))  in xchk_btree_check_minrecs()
510 	if (cur->bc_ops->type == XFS_BTREE_TYPE_INODE &&  in xchk_btree_check_minrecs()
511 	    level == cur->bc_nlevels - 2) {  in xchk_btree_check_minrecs()
516 		root_block = xfs_btree_get_block(cur, root_level, &root_bp);  in xchk_btree_check_minrecs()
517 		root_maxrecs = cur->bc_ops->get_dmaxrecs(cur, root_level);  in xchk_btree_check_minrecs()
521 			xchk_btree_set_corrupt(bs->sc, cur, level);  in xchk_btree_check_minrecs()
530 		xchk_btree_set_corrupt(bs->sc, cur, level);  in xchk_btree_check_minrecs()
546 	struct xfs_btree_cur	*cur = bs->cur;  in xchk_btree_block_check_keys()  local
550 	if (level == cur->bc_nlevels - 1)  in xchk_btree_block_check_keys()
553 	xfs_btree_get_keys(cur, block, &block_key);  in xchk_btree_block_check_keys()
556 	parent_block = xfs_btree_get_block(cur, level + 1, &bp);  in xchk_btree_block_check_keys()
557 	parent_low_key = xfs_btree_key_addr(cur, cur->bc_levels[level + 1].ptr,  in xchk_btree_block_check_keys()
559 	if (xfs_btree_keycmp_ne(cur, &block_key, parent_low_key)) {  in xchk_btree_block_check_keys()
560 		xchk_btree_set_corrupt(bs->sc, bs->cur, level);  in xchk_btree_block_check_keys()
564 	if (!(cur->bc_ops->geom_flags & XFS_BTGEO_OVERLAPPING))  in xchk_btree_block_check_keys()
568 	parent_high_key = xfs_btree_high_key_addr(cur,  in xchk_btree_block_check_keys()
569 			cur->bc_levels[level + 1].ptr, parent_block);  in xchk_btree_block_check_keys()
570 	block_high_key = xfs_btree_high_key_from_key(cur, &block_key);  in xchk_btree_block_check_keys()
571 	if (xfs_btree_keycmp_ne(cur, block_high_key, parent_high_key))  in xchk_btree_block_check_keys()
572 		xchk_btree_set_corrupt(bs->sc, bs->cur, level);  in xchk_btree_block_check_keys()
592 	error = xfs_btree_lookup_get_block(bs->cur, level, pp, pblock);  in xchk_btree_get_block()
593 	if (!xchk_btree_process_error(bs->sc, bs->cur, level, &error) ||  in xchk_btree_get_block()
597 	xfs_btree_get_block(bs->cur, level, pbp);  in xchk_btree_get_block()
598 	if (__xfs_btree_check_block(bs->cur, *pblock, level, *pbp)) {  in xchk_btree_get_block()
599 		xchk_btree_set_corrupt(bs->sc, bs->cur, level);  in xchk_btree_get_block()
638 	struct xfs_btree_cur	*cur = bs->cur;  in xchk_btree_block_keys()  local
645 	if (level >= cur->bc_nlevels - 1)  in xchk_btree_block_keys()
649 	xfs_btree_get_keys(cur, block, &block_keys);  in xchk_btree_block_keys()
652 	parent_block = xfs_btree_get_block(cur, level + 1, &bp);  in xchk_btree_block_keys()
653 	parent_keys = xfs_btree_key_addr(cur, cur->bc_levels[level + 1].ptr,  in xchk_btree_block_keys()
656 	if (xfs_btree_keycmp_ne(cur, &block_keys, parent_keys))  in xchk_btree_block_keys()
657 		xchk_btree_set_corrupt(bs->sc, cur, 1);  in xchk_btree_block_keys()
659 	if (!(cur->bc_ops->geom_flags & XFS_BTGEO_OVERLAPPING))  in xchk_btree_block_keys()
663 	high_bk = xfs_btree_high_key_from_key(cur, &block_keys);  in xchk_btree_block_keys()
664 	high_pk = xfs_btree_high_key_addr(cur, cur->bc_levels[level + 1].ptr,  in xchk_btree_block_keys()
667 	if (xfs_btree_keycmp_ne(cur, high_bk, high_pk))  in xchk_btree_block_keys()
668 		xchk_btree_set_corrupt(bs->sc, cur, 1);  in xchk_btree_block_keys()
679 	struct xfs_btree_cur		*cur,  in xchk_btree()  argument
701 	cur_sz = xchk_btree_sizeof(cur->bc_nlevels);  in xchk_btree()
703 		xchk_btree_set_corrupt(sc, cur, 0);  in xchk_btree()
709 	bs->cur = cur;  in xchk_btree()
722 	level = cur->bc_nlevels - 1;  in xchk_btree()
723 	xfs_btree_init_ptr_from_cur(cur, &ptr);  in xchk_btree()
724 	if (!xchk_btree_ptr_ok(bs, cur->bc_nlevels, &ptr))  in xchk_btree()
730 	cur->bc_levels[level].ptr = 1;  in xchk_btree()
732 	while (level < cur->bc_nlevels) {  in xchk_btree()
733 		block = xfs_btree_get_block(cur, level, &bp);  in xchk_btree()
737 			if (cur->bc_levels[level].ptr >  in xchk_btree()
740 				if (level < cur->bc_nlevels - 1)  in xchk_btree()
741 					cur->bc_levels[level + 1].ptr++;  in xchk_btree()
750 			recp = xfs_btree_rec_addr(cur, cur->bc_levels[0].ptr,  in xchk_btree()
759 			cur->bc_levels[level].ptr++;  in xchk_btree()
764 		if (cur->bc_levels[level].ptr >  in xchk_btree()
767 			if (level < cur->bc_nlevels - 1)  in xchk_btree()
768 				cur->bc_levels[level + 1].ptr++;  in xchk_btree()
777 		pp = xfs_btree_ptr_addr(cur, cur->bc_levels[level].ptr, block);  in xchk_btree()
779 			cur->bc_levels[level].ptr++;  in xchk_btree()
787 		cur->bc_levels[level].ptr = 1;  in xchk_btree()
793 		if (!error && bs->cur)  in xchk_btree()