372 	for (i = 0; i < cur->bc_nlevels; i++) {  in xfs_btree_del_cursor()
422 	for (i = 0; i < new->bc_nlevels; i++) {  in xfs_btree_dup_cursor()
674 	    (level == cur->bc_nlevels - 1)) {  in xfs_btree_get_block()
972 	    (lev == cur->bc_nlevels - 1))  in xfs_btree_readahead()
1587 	ASSERT(level < cur->bc_nlevels);  in xfs_btree_increment()
1616 	for (lev = level + 1; lev < cur->bc_nlevels; lev++) {  in xfs_btree_increment()
1636 	if (lev == cur->bc_nlevels) {  in xfs_btree_increment()
1643 	ASSERT(lev < cur->bc_nlevels);  in xfs_btree_increment()
1689 	ASSERT(level < cur->bc_nlevels);  in xfs_btree_decrement()
1718 	for (lev = level + 1; lev < cur->bc_nlevels; lev++) {  in xfs_btree_decrement()
1729 	if (lev == cur->bc_nlevels) {  in xfs_btree_decrement()
1736 	ASSERT(lev < cur->bc_nlevels);  in xfs_btree_decrement()
1778 	    (level == cur->bc_nlevels - 1)) {  in xfs_btree_lookup_get_block()
1870 	if (cur->bc_nlevels == 0)  in xfs_btree_lookup()
1886 	for (level = cur->bc_nlevels - 1, diff = 1; level >= 0; level--) {  in xfs_btree_lookup()
1909 				if (level != 0 || cur->bc_nlevels != 1) {  in xfs_btree_lookup()
2137 	if (level + 1 >= cur->bc_nlevels)  in __xfs_btree_updkeys()
2145 	for (level++; level < cur->bc_nlevels; level++) {  in __xfs_btree_updkeys()
2165 		if (level + 1 >= cur->bc_nlevels)  in __xfs_btree_updkeys()
2213 	for (level++, ptr = 1; ptr == 1 && level < cur->bc_nlevels; level++) {  in xfs_btree_update_keys()
2311 	    level == cur->bc_nlevels - 1)  in xfs_btree_lshift()
2505 	    (level == cur->bc_nlevels - 1))  in xfs_btree_rshift()
2816 	if (level + 1 < cur->bc_nlevels) {  in __xfs_btree_split()
2938 	level = cur->bc_nlevels - 1;  in xfs_btree_new_iroot()
2971 	cur->bc_nlevels++;  in xfs_btree_new_iroot()
3063 	block = xfs_btree_get_block(cur, cur->bc_nlevels - 1, &bp);  in xfs_btree_new_root()
3066 	error = xfs_btree_check_block(cur, block, cur->bc_nlevels - 1, bp);  in xfs_btree_new_root()
3096 	xfs_btree_init_block_cur(cur, nbp, cur->bc_nlevels, 2);  in xfs_btree_new_root()
3132 	xfs_btree_setbuf(cur, cur->bc_nlevels, nbp);  in xfs_btree_new_root()
3133 	cur->bc_ptrs[cur->bc_nlevels] = nptr;  in xfs_btree_new_root()
3134 	cur->bc_nlevels++;  in xfs_btree_new_root()
3159 	    level == cur->bc_nlevels - 1) {  in xfs_btree_make_block_unfull()
3245 	    (level >= cur->bc_nlevels)) {  in xfs_btree_insrec()
3479 			cur->bc_nlevels = pcur->bc_nlevels;  in xfs_btree_insert()
3527 	ASSERT(cur->bc_nlevels > 1);  in xfs_btree_kill_iroot()
3533 	level = cur->bc_nlevels - 1;  in xfs_btree_kill_iroot()
3597 	cur->bc_nlevels--;  in xfs_btree_kill_iroot()
3628 	cur->bc_nlevels--;  in xfs_btree_kill_root()
3762 	if (level == cur->bc_nlevels - 1) {  in xfs_btree_delrec()
3839 		    level == cur->bc_nlevels - 2) {  in xfs_btree_delrec()
4121 		   (level + 1 < cur->bc_nlevels)) {  in xfs_btree_delrec()
4196 		for (level = 1; level < cur->bc_nlevels; level++) {  in xfs_btree_delete()
4299 	for (level = cur->bc_nlevels - 1; level >= 0; level--) {  in xfs_btree_visit_blocks()
4388 		ASSERT(level == cur->bc_nlevels - 1);  in xfs_btree_block_change_owner()
4658 	level = cur->bc_nlevels - 1;  in xfs_btree_overlapped_query_range()
4672 	while (level < cur->bc_nlevels) {  in xfs_btree_overlapped_query_range()
4678 			if (level < cur->bc_nlevels - 1)  in xfs_btree_overlapped_query_range()
4757 		for (i = 0; i < cur->bc_nlevels; i++) {  in xfs_btree_overlapped_query_range()