28 	struct xfs_btree_cur	*cur,  in __xchk_btree_process_error()  argument
50 		if (cur->bc_flags & XFS_BTREE_ROOT_IN_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_flags & XFS_BTREE_ROOT_IN_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_flags & XFS_BTREE_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_flags & XFS_BTREE_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()
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()
265 	struct xfs_btree_cur	*cur = bs->cur;  in xchk_btree_block_check_sibling()  local
273 	error = xfs_btree_dup_cursor(cur, &ncur);  in xchk_btree_block_check_sibling()
274 	if (!xchk_btree_process_error(bs->sc, cur, level + 1, &error) ||  in xchk_btree_block_check_sibling()
282 	if (xfs_btree_ptr_is_null(cur, sibling)) {  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()
313 	if (xfs_btree_diff_two_ptrs(cur, pp, sibling))  in xchk_btree_block_check_sibling()
314 		xchk_btree_set_corrupt(bs->sc, cur, level);  in xchk_btree_block_check_sibling()
326 	struct xfs_btree_cur	*cur = bs->cur;  in xchk_btree_block_check_siblings()  local
332 	xfs_btree_get_sibling(cur, block, &leftsib, XFS_BB_LEFTSIB);  in xchk_btree_block_check_siblings()
333 	xfs_btree_get_sibling(cur, block, &rightsib, XFS_BB_RIGHTSIB);  in xchk_btree_block_check_siblings()
337 	if (level == cur->bc_nlevels - 1) {  in xchk_btree_block_check_siblings()
338 		if (!xfs_btree_ptr_is_null(cur, &leftsib) ||  in xchk_btree_block_check_siblings()
339 		    !xfs_btree_ptr_is_null(cur, &rightsib))  in xchk_btree_block_check_siblings()
340 			xchk_btree_set_corrupt(bs->sc, cur, level);  in xchk_btree_block_check_siblings()
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()
396 		if (!xchk_btree_xref_process_error(bs->sc, bs->cur,  in xchk_btree_check_block_owner()
408 		bs->cur = NULL;  in xchk_btree_check_block_owner()
412 		bs->cur = NULL;  in xchk_btree_check_block_owner()
428 	struct xfs_btree_cur	*cur = bs->cur;  in xchk_btree_check_owner()  local
437 		if (!(cur->bc_flags & XFS_BTREE_ROOT_IN_INODE))  in xchk_btree_check_owner()
438 			xchk_btree_set_corrupt(bs->sc, bs->cur, level);  in xchk_btree_check_owner()
450 	if (cur->bc_btnum == XFS_BTNUM_BNO || cur->bc_btnum == XFS_BTNUM_RMAP) {  in xchk_btree_check_owner()
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()
501 	struct xfs_btree_cur	*cur = bs->cur;  in xchk_btree_check_minrecs()  local
502 	unsigned int		root_level = cur->bc_nlevels - 1;  in xchk_btree_check_minrecs()
506 	if (numrecs >= cur->bc_ops->get_minrecs(cur, level))  in xchk_btree_check_minrecs()
516 	if ((cur->bc_flags & XFS_BTREE_ROOT_IN_INODE) &&  in xchk_btree_check_minrecs()
517 	    level == cur->bc_nlevels - 2) {  in xchk_btree_check_minrecs()
522 		root_block = xfs_btree_get_block(cur, root_level, &root_bp);  in xchk_btree_check_minrecs()
523 		root_maxrecs = cur->bc_ops->get_dmaxrecs(cur, root_level);  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()
552 	struct xfs_btree_cur	*cur = bs->cur;  in xchk_btree_block_check_keys()  local
556 	if (level == cur->bc_nlevels - 1)  in xchk_btree_block_check_keys()
559 	xfs_btree_get_keys(cur, block, &block_key);  in xchk_btree_block_check_keys()
562 	parent_block = xfs_btree_get_block(cur, level + 1, &bp);  in xchk_btree_block_check_keys()
563 	parent_low_key = xfs_btree_key_addr(cur, cur->bc_levels[level + 1].ptr,  in xchk_btree_block_check_keys()
565 	if (xfs_btree_keycmp_ne(cur, &block_key, parent_low_key)) {  in xchk_btree_block_check_keys()
566 		xchk_btree_set_corrupt(bs->sc, bs->cur, level);  in xchk_btree_block_check_keys()
570 	if (!(cur->bc_flags & XFS_BTREE_OVERLAPPING))  in xchk_btree_block_check_keys()
574 	parent_high_key = xfs_btree_high_key_addr(cur,  in xchk_btree_block_check_keys()
575 			cur->bc_levels[level + 1].ptr, parent_block);  in xchk_btree_block_check_keys()
576 	block_high_key = xfs_btree_high_key_from_key(cur, &block_key);  in xchk_btree_block_check_keys()
577 	if (xfs_btree_keycmp_ne(cur, block_high_key, parent_high_key))  in xchk_btree_block_check_keys()
578 		xchk_btree_set_corrupt(bs->sc, bs->cur, level);  in xchk_btree_block_check_keys()
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()
651 	struct xfs_btree_cur	*cur = bs->cur;  in xchk_btree_block_keys()  local
658 	if (level >= cur->bc_nlevels - 1)  in xchk_btree_block_keys()
662 	xfs_btree_get_keys(cur, block, &block_keys);  in xchk_btree_block_keys()
665 	parent_block = xfs_btree_get_block(cur, level + 1, &bp);  in xchk_btree_block_keys()
666 	parent_keys = xfs_btree_key_addr(cur, cur->bc_levels[level + 1].ptr,  in xchk_btree_block_keys()
669 	if (xfs_btree_keycmp_ne(cur, &block_keys, parent_keys))  in xchk_btree_block_keys()
670 		xchk_btree_set_corrupt(bs->sc, cur, 1);  in xchk_btree_block_keys()
672 	if (!(cur->bc_flags & XFS_BTREE_OVERLAPPING))  in xchk_btree_block_keys()
676 	high_bk = xfs_btree_high_key_from_key(cur, &block_keys);  in xchk_btree_block_keys()
677 	high_pk = xfs_btree_high_key_addr(cur, cur->bc_levels[level + 1].ptr,  in xchk_btree_block_keys()
680 	if (xfs_btree_keycmp_ne(cur, high_bk, high_pk))  in xchk_btree_block_keys()
681 		xchk_btree_set_corrupt(bs->sc, cur, 1);  in xchk_btree_block_keys()
692 	struct xfs_btree_cur		*cur,  in xchk_btree()  argument
714 	cur_sz = xchk_btree_sizeof(cur->bc_nlevels);  in xchk_btree()
716 		xchk_btree_set_corrupt(sc, cur, 0);  in xchk_btree()
722 	bs->cur = cur;  in xchk_btree()
735 	level = cur->bc_nlevels - 1;  in xchk_btree()
736 	cur->bc_ops->init_ptr_from_cur(cur, &ptr);  in xchk_btree()
737 	if (!xchk_btree_ptr_ok(bs, cur->bc_nlevels, &ptr))  in xchk_btree()
743 	cur->bc_levels[level].ptr = 1;  in xchk_btree()
745 	while (level < cur->bc_nlevels) {  in xchk_btree()
746 		block = xfs_btree_get_block(cur, level, &bp);  in xchk_btree()
750 			if (cur->bc_levels[level].ptr >  in xchk_btree()
753 				if (level < cur->bc_nlevels - 1)  in xchk_btree()
754 					cur->bc_levels[level + 1].ptr++;  in xchk_btree()
763 			recp = xfs_btree_rec_addr(cur, cur->bc_levels[0].ptr,  in xchk_btree()
772 			cur->bc_levels[level].ptr++;  in xchk_btree()
777 		if (cur->bc_levels[level].ptr >  in xchk_btree()
780 			if (level < cur->bc_nlevels - 1)  in xchk_btree()
781 				cur->bc_levels[level + 1].ptr++;  in xchk_btree()
790 		pp = xfs_btree_ptr_addr(cur, cur->bc_levels[level].ptr, block);  in xchk_btree()
792 			cur->bc_levels[level].ptr++;  in xchk_btree()
800 		cur->bc_levels[level].ptr = 1;  in xchk_btree()
806 		if (!error && bs->cur)  in xchk_btree()