302 	for (i = 0; i < cur->bc_nlevels; i++) {  in xfs_btree_del_cursor()
352 	for (i = 0; i < new->bc_nlevels; i++) {  in xfs_btree_dup_cursor()
535 	    (level == cur->bc_nlevels - 1)) {  in xfs_btree_get_block()
833 	    (lev == cur->bc_nlevels - 1))  in xfs_btree_readahead()
1446 	ASSERT(level < cur->bc_nlevels);  in xfs_btree_increment()
1475 	for (lev = level + 1; lev < cur->bc_nlevels; lev++) {  in xfs_btree_increment()
1495 	if (lev == cur->bc_nlevels) {  in xfs_btree_increment()
1502 	ASSERT(lev < cur->bc_nlevels);  in xfs_btree_increment()
1554 	ASSERT(level < cur->bc_nlevels);  in xfs_btree_decrement()
1583 	for (lev = level + 1; lev < cur->bc_nlevels; lev++) {  in xfs_btree_decrement()
1594 	if (lev == cur->bc_nlevels) {  in xfs_btree_decrement()
1601 	ASSERT(lev < cur->bc_nlevels);  in xfs_btree_decrement()
1645 	    (level == cur->bc_nlevels - 1)) {  in xfs_btree_lookup_get_block()
1728 	for (level = cur->bc_nlevels - 1, diff = 1; level >= 0; level--) {  in xfs_btree_lookup()
1751 				ASSERT(level == 0 && cur->bc_nlevels == 1);  in xfs_btree_lookup()
1877 	for (ptr = 1; ptr == 1 && level < cur->bc_nlevels; level++) {  in xfs_btree_updkey()
1988 	    level == cur->bc_nlevels - 1)  in xfs_btree_lshift()
2171 	    (level == cur->bc_nlevels - 1))  in xfs_btree_rshift()
2485 	if (level + 1 < cur->bc_nlevels) {  in __xfs_btree_split()
2613 	level = cur->bc_nlevels - 1;  in xfs_btree_new_iroot()
2647 	cur->bc_nlevels++;  in xfs_btree_new_iroot()
2744 	block = xfs_btree_get_block(cur, cur->bc_nlevels - 1, &bp);  in xfs_btree_new_root()
2747 	error = xfs_btree_check_block(cur, block, cur->bc_nlevels - 1, bp);  in xfs_btree_new_root()
2776 	xfs_btree_init_block_cur(cur, nbp, cur->bc_nlevels, 2);  in xfs_btree_new_root()
2807 	xfs_btree_setbuf(cur, cur->bc_nlevels, nbp);  in xfs_btree_new_root()
2808 	cur->bc_ptrs[cur->bc_nlevels] = nptr;  in xfs_btree_new_root()
2809 	cur->bc_nlevels++;  in xfs_btree_new_root()
2838 	    level == cur->bc_nlevels - 1) {  in xfs_btree_make_block_unfull()
2926 	    (level >= cur->bc_nlevels)) {  in xfs_btree_insrec()
3154 			cur->bc_nlevels = pcur->bc_nlevels;  in xfs_btree_insert()
3205 	ASSERT(cur->bc_nlevels > 1);  in xfs_btree_kill_iroot()
3211 	level = cur->bc_nlevels - 1;  in xfs_btree_kill_iroot()
3278 	cur->bc_nlevels--;  in xfs_btree_kill_iroot()
3315 	cur->bc_nlevels--;  in xfs_btree_kill_root()
3477 	if (level == cur->bc_nlevels - 1) {  in xfs_btree_delrec()
3554 		    level == cur->bc_nlevels - 2) {  in xfs_btree_delrec()
3837 		   (level + 1 < cur->bc_nlevels)) {  in xfs_btree_delrec()
3893 		for (level = 1; level < cur->bc_nlevels; level++) {  in xfs_btree_delete()
4013 		ASSERT(level == cur->bc_nlevels - 1);  in xfs_btree_block_change_owner()
4038 	for (level = cur->bc_nlevels - 1; level >= 0; level--) {  in xfs_btree_change_owner()