32 	int			level,  in xchk_da_process_error()  argument
55 					ds->state->path.blk[level].blkno),  in xchk_da_process_error()
69 	int			level)  in xchk_da_set_corrupt()  argument
77 				ds->state->path.blk[level].blkno),  in xchk_da_set_corrupt()
84 	int				level)  in xchk_da_btree_node_entry()  argument
86 	struct xfs_da_state_blk		*blk = &ds->state->path.blk[level];  in xchk_da_btree_node_entry()
99 	int				level,  in xchk_da_btree_hash()  argument
108 	if (hash < ds->hashes[level])  in xchk_da_btree_hash()
109 		xchk_da_set_corrupt(ds, level);  in xchk_da_btree_hash()
110 	ds->hashes[level] = hash;  in xchk_da_btree_hash()
112 	if (level == 0)  in xchk_da_btree_hash()
116 	entry = xchk_da_btree_node_entry(ds, level - 1);  in xchk_da_btree_hash()
119 		xchk_da_set_corrupt(ds, level);  in xchk_da_btree_hash()
131 	int			level,  in xchk_da_btree_ptr_ok()  argument
135 		xchk_da_set_corrupt(ds, level);  in xchk_da_btree_ptr_ok()
219 	int			level,  in xchk_da_btree_block_check_sibling()  argument
239 			xchk_da_set_corrupt(ds, level);  in xchk_da_btree_block_check_sibling()
247 	if (!xchk_da_process_error(ds, level, &error))  in xchk_da_btree_block_check_sibling()
250 		xchk_da_set_corrupt(ds, level);  in xchk_da_btree_block_check_sibling()
253 	if (altpath->blk[level].bp)  in xchk_da_btree_block_check_sibling()
254 		xchk_buffer_recheck(ds->sc, altpath->blk[level].bp);  in xchk_da_btree_block_check_sibling()
257 	if (altpath->blk[level].blkno != sibling)  in xchk_da_btree_block_check_sibling()
258 		xchk_da_set_corrupt(ds, level);  in xchk_da_btree_block_check_sibling()
279 	int			level,  in xchk_da_btree_block_check_siblings()  argument
290 	if (level == 0) {  in xchk_da_btree_block_check_siblings()
292 			xchk_da_set_corrupt(ds, level);  in xchk_da_btree_block_check_siblings()
300 	error = xchk_da_btree_block_check_sibling(ds, level, 0, back);  in xchk_da_btree_block_check_siblings()
303 	error = xchk_da_btree_block_check_sibling(ds, level, 1, forw);  in xchk_da_btree_block_check_siblings()
314 	int				level,  in xchk_da_btree_block()  argument
328 	blk = &ds->state->path.blk[level];  in xchk_da_btree_block()
329 	ds->state->path.active = level + 1;  in xchk_da_btree_block()
339 	if (!xchk_da_btree_ptr_ok(ds, level, blkno))  in xchk_da_btree_block()
346 	if (!xchk_da_process_error(ds, level, &error))  in xchk_da_btree_block()
356 	if (ds->dargs.whichfork == XFS_DATA_FORK && level == 0 &&  in xchk_da_btree_block()
362 		xchk_da_set_corrupt(ds, level);  in xchk_da_btree_block()
368 	pmaxrecs = &ds->maxrecs[level];  in xchk_da_btree_block()
372 		xchk_da_set_corrupt(ds, level);  in xchk_da_btree_block()
378 			xchk_da_set_corrupt(ds, level);  in xchk_da_btree_block()
382 	error = xchk_da_btree_block_check_siblings(ds, level, &hdr3->hdr);  in xchk_da_btree_block()
395 			xchk_da_set_corrupt(ds, level);  in xchk_da_btree_block()
404 			xchk_da_set_corrupt(ds, level);  in xchk_da_btree_block()
413 			xchk_da_set_corrupt(ds, level);  in xchk_da_btree_block()
425 		if (level == 0) {  in xchk_da_btree_block()
426 			if (nodehdr.level >= XFS_DA_NODE_MAXDEPTH) {  in xchk_da_btree_block()
427 				xchk_da_set_corrupt(ds, level);  in xchk_da_btree_block()
430 			ds->tree_level = nodehdr.level;  in xchk_da_btree_block()
432 			if (ds->tree_level != nodehdr.level) {  in xchk_da_btree_block()
433 				xchk_da_set_corrupt(ds, level);  in xchk_da_btree_block()
441 		xchk_da_set_corrupt(ds, level);  in xchk_da_btree_block()
449 	if (level > 0) {  in xchk_da_btree_block()
452 		key = xchk_da_btree_node_entry(ds, level - 1);  in xchk_da_btree_block()
454 			xchk_da_set_corrupt(ds, level);  in xchk_da_btree_block()
482 	int				level;  in xchk_da_btree()  local
510 	level = 0;  in xchk_da_btree()
514 	error = xchk_da_btree_block(ds, level, blkno);  in xchk_da_btree()
522 	if (blks[level].bp == NULL)  in xchk_da_btree()
525 	blks[level].index = 0;  in xchk_da_btree()
526 	while (level >= 0 && level < XFS_DA_NODE_MAXDEPTH) {  in xchk_da_btree()
528 		if (blks[level].magic != XFS_DA_NODE_MAGIC) {  in xchk_da_btree()
530 			if (blks[level].index >= ds->maxrecs[level]) {  in xchk_da_btree()
531 				if (level > 0)  in xchk_da_btree()
532 					blks[level - 1].index++;  in xchk_da_btree()
534 				level--;  in xchk_da_btree()
539 			error = scrub_fn(ds, level);  in xchk_da_btree()
546 			blks[level].index++;  in xchk_da_btree()
552 		if (blks[level].index >= ds->maxrecs[level]) {  in xchk_da_btree()
553 			if (level > 0)  in xchk_da_btree()
554 				blks[level - 1].index++;  in xchk_da_btree()
556 			level--;  in xchk_da_btree()
561 		key = xchk_da_btree_node_entry(ds, level);  in xchk_da_btree()
562 		error = xchk_da_btree_hash(ds, level, &key->hashval);  in xchk_da_btree()
568 		level++;  in xchk_da_btree()
569 		if (level >= XFS_DA_NODE_MAXDEPTH) {  in xchk_da_btree()
571 			xchk_da_set_corrupt(ds, level - 1);  in xchk_da_btree()
575 		error = xchk_da_btree_block(ds, level, blkno);  in xchk_da_btree()
578 		if (blks[level].bp == NULL)  in xchk_da_btree()
581 		blks[level].index = 0;  in xchk_da_btree()
586 	for (level = 0; level < XFS_DA_NODE_MAXDEPTH; level++) {  in xchk_da_btree()
587 		if (blks[level].bp == NULL)  in xchk_da_btree()
589 		xfs_trans_brelse(sc->tp, blks[level].bp);  in xchk_da_btree()
590 		blks[level].bp = NULL;  in xchk_da_btree()