510 	for (i = 0; i < cur->bc_nlevels; i++) {  in xfs_btree_del_cursor()
601 	for (i = 0; i < new->bc_nlevels; i++) {  in xfs_btree_dup_cursor()
1670 	ASSERT(level < cur->bc_nlevels);  in xfs_btree_increment()
1699 	for (lev = level + 1; lev < cur->bc_nlevels; lev++) {  in xfs_btree_increment()
1719 	if (lev == cur->bc_nlevels) {  in xfs_btree_increment()
1727 	ASSERT(lev < cur->bc_nlevels);  in xfs_btree_increment()
1773 	ASSERT(level < cur->bc_nlevels);  in xfs_btree_decrement()
1802 	for (lev = level + 1; lev < cur->bc_nlevels; lev++) {  in xfs_btree_decrement()
1813 	if (lev == cur->bc_nlevels) {  in xfs_btree_decrement()
1821 	ASSERT(lev < cur->bc_nlevels);  in xfs_btree_decrement()
2000 	if (XFS_IS_CORRUPT(cur->bc_mp, cur->bc_nlevels == 0)) {  in xfs_btree_lookup()
2018 	for (level = cur->bc_nlevels - 1, diff = 1; level >= 0; level--) {  in xfs_btree_lookup()
2041 				if (level != 0 || cur->bc_nlevels != 1) {  in xfs_btree_lookup()
2272 	if (level + 1 >= cur->bc_nlevels)  in __xfs_btree_updkeys()
2280 	for (level++; level < cur->bc_nlevels; level++) {  in __xfs_btree_updkeys()
2300 		if (level + 1 >= cur->bc_nlevels)  in __xfs_btree_updkeys()
2348 	for (level++, ptr = 1; ptr == 1 && level < cur->bc_nlevels; level++) {  in xfs_btree_update_keys()
2972 	if (level + 1 < cur->bc_nlevels) {  in __xfs_btree_split()
3119 	level = cur->bc_nlevels - 1;  in xfs_btree_new_iroot()
3153 	cur->bc_nlevels++;  in xfs_btree_new_iroot()
3154 	ASSERT(cur->bc_nlevels <= cur->bc_maxlevels);  in xfs_btree_new_iroot()
3261 	block = xfs_btree_get_block(cur, cur->bc_nlevels - 1, &bp);  in xfs_btree_new_root()
3264 	error = xfs_btree_check_block(cur, block, cur->bc_nlevels - 1, bp);  in xfs_btree_new_root()
3294 	xfs_btree_init_block_cur(cur, nbp, cur->bc_nlevels, 2);  in xfs_btree_new_root()
3330 	xfs_btree_setbuf(cur, cur->bc_nlevels, nbp);  in xfs_btree_new_root()
3331 	cur->bc_levels[cur->bc_nlevels].ptr = nptr;  in xfs_btree_new_root()
3332 	cur->bc_nlevels++;  in xfs_btree_new_root()
3333 	ASSERT(cur->bc_nlevels <= cur->bc_maxlevels);  in xfs_btree_new_root()
3443 	    level >= cur->bc_nlevels) {  in xfs_btree_insrec()
3675 			cur->bc_nlevels = pcur->bc_nlevels;  in xfs_btree_insert()
3723 	ASSERT(cur->bc_nlevels > 1);  in xfs_btree_kill_iroot()
3729 	level = cur->bc_nlevels - 1;  in xfs_btree_kill_iroot()
3793 	cur->bc_nlevels--;  in xfs_btree_kill_iroot()
3824 	cur->bc_nlevels--;  in xfs_btree_kill_root()
3967 	if (level == cur->bc_nlevels - 1) {  in xfs_btree_delrec()
4024 		    level == cur->bc_nlevels - 2) {  in xfs_btree_delrec()
4334 		 level + 1 < cur->bc_nlevels) {  in xfs_btree_delrec()
4409 		for (level = 1; level < cur->bc_nlevels; level++) {  in xfs_btree_delete()
4525 	for (level = cur->bc_nlevels - 1; level >= 0; level--) {  in xfs_btree_visit_blocks()
4619 		ASSERT(level == cur->bc_nlevels - 1);  in xfs_btree_block_change_owner()
4977 	level = cur->bc_nlevels - 1;  in xfs_btree_overlapped_query_range()
4991 	while (level < cur->bc_nlevels) {  in xfs_btree_overlapped_query_range()
4998 			if (level < cur->bc_nlevels - 1)  in xfs_btree_overlapped_query_range()
5077 		for (i = 0; i < cur->bc_nlevels; i++) {  in xfs_btree_overlapped_query_range()