441 	for (i = 0; i < cur->bc_nlevels; i++) {  in xfs_btree_del_cursor()
495 	for (i = 0; i < new->bc_nlevels; i++) {  in xfs_btree_dup_cursor()
757 	    (level == cur->bc_nlevels - 1)) {  in xfs_btree_get_block()
1000 	    (lev == cur->bc_nlevels - 1))  in xfs_btree_readahead()
1614 	ASSERT(level < cur->bc_nlevels);  in xfs_btree_increment()
1643 	for (lev = level + 1; lev < cur->bc_nlevels; lev++) {  in xfs_btree_increment()
1663 	if (lev == cur->bc_nlevels) {  in xfs_btree_increment()
1670 	ASSERT(lev < cur->bc_nlevels);  in xfs_btree_increment()
1716 	ASSERT(level < cur->bc_nlevels);  in xfs_btree_decrement()
1745 	for (lev = level + 1; lev < cur->bc_nlevels; lev++) {  in xfs_btree_decrement()
1756 	if (lev == cur->bc_nlevels) {  in xfs_btree_decrement()
1763 	ASSERT(lev < cur->bc_nlevels);  in xfs_btree_decrement()
1805 	    (level == cur->bc_nlevels - 1)) {  in xfs_btree_lookup_get_block()
1898 	if (XFS_IS_CORRUPT(cur->bc_mp, cur->bc_nlevels == 0))  in xfs_btree_lookup()
1914 	for (level = cur->bc_nlevels - 1, diff = 1; level >= 0; level--) {  in xfs_btree_lookup()
1937 				if (level != 0 || cur->bc_nlevels != 1) {  in xfs_btree_lookup()
2166 	if (level + 1 >= cur->bc_nlevels)  in __xfs_btree_updkeys()
2174 	for (level++; level < cur->bc_nlevels; level++) {  in __xfs_btree_updkeys()
2194 		if (level + 1 >= cur->bc_nlevels)  in __xfs_btree_updkeys()
2242 	for (level++, ptr = 1; ptr == 1 && level < cur->bc_nlevels; level++) {  in xfs_btree_update_keys()
2340 	    level == cur->bc_nlevels - 1)  in xfs_btree_lshift()
2535 	    (level == cur->bc_nlevels - 1))  in xfs_btree_rshift()
2849 	if (level + 1 < cur->bc_nlevels) {  in __xfs_btree_split()
2983 	level = cur->bc_nlevels - 1;  in xfs_btree_new_iroot()
3017 	cur->bc_nlevels++;  in xfs_btree_new_iroot()
3018 	ASSERT(cur->bc_nlevels <= cur->bc_maxlevels);  in xfs_btree_new_iroot()
3110 	block = xfs_btree_get_block(cur, cur->bc_nlevels - 1, &bp);  in xfs_btree_new_root()
3113 	error = xfs_btree_check_block(cur, block, cur->bc_nlevels - 1, bp);  in xfs_btree_new_root()
3143 	xfs_btree_init_block_cur(cur, nbp, cur->bc_nlevels, 2);  in xfs_btree_new_root()
3179 	xfs_btree_setbuf(cur, cur->bc_nlevels, nbp);  in xfs_btree_new_root()
3180 	cur->bc_levels[cur->bc_nlevels].ptr = nptr;  in xfs_btree_new_root()
3181 	cur->bc_nlevels++;  in xfs_btree_new_root()
3182 	ASSERT(cur->bc_nlevels <= cur->bc_maxlevels);  in xfs_btree_new_root()
3207 	    level == cur->bc_nlevels - 1) {  in xfs_btree_make_block_unfull()
3293 	    (level >= cur->bc_nlevels)) {  in xfs_btree_insrec()
3532 			cur->bc_nlevels = pcur->bc_nlevels;  in xfs_btree_insert()
3580 	ASSERT(cur->bc_nlevels > 1);  in xfs_btree_kill_iroot()
3586 	level = cur->bc_nlevels - 1;  in xfs_btree_kill_iroot()
3650 	cur->bc_nlevels--;  in xfs_btree_kill_iroot()
3681 	cur->bc_nlevels--;  in xfs_btree_kill_root()
3815 	if (level == cur->bc_nlevels - 1) {  in xfs_btree_delrec()
3892 		    level == cur->bc_nlevels - 2) {  in xfs_btree_delrec()
4195 		   (level + 1 < cur->bc_nlevels)) {  in xfs_btree_delrec()
4270 		for (level = 1; level < cur->bc_nlevels; level++) {  in xfs_btree_delete()
4389 	for (level = cur->bc_nlevels - 1; level >= 0; level--) {  in xfs_btree_visit_blocks()
4483 		ASSERT(level == cur->bc_nlevels - 1);  in xfs_btree_block_change_owner()
4810 	level = cur->bc_nlevels - 1;  in xfs_btree_overlapped_query_range()
4824 	while (level < cur->bc_nlevels) {  in xfs_btree_overlapped_query_range()
4831 			if (level < cur->bc_nlevels - 1)  in xfs_btree_overlapped_query_range()
4912 		for (i = 0; i < cur->bc_nlevels; i++) {  in xfs_btree_overlapped_query_range()