746 int mas_ce2_over_count(struct ma_state *mas_start, struct ma_state *mas_end,  in mas_ce2_over_count()  argument
759 	entry = mas_next(&tmp, mas_end->last);  in mas_ce2_over_count()
768 		entry = mas_next(&tmp, mas_end->last);  in mas_ce2_over_count()
773 		if (e_entry && (e_max > mas_end->last))  in mas_ce2_over_count()
780 		bool esplit = e_max > mas_end->last;  in mas_ce2_over_count()
996 		MA_STATE(mas_end, mt, set[i+2], set[i+2]);  in check_erase2_testset()
1004 		e_entry = mas_range_load(&mas_end, &e_min, &e_max);  in check_erase2_testset()
1013 			} else if ((mas_start.node != mas_end.node) ||  in check_erase2_testset()
1014 			   (mas_start.offset != mas_end.offset)) {  in check_erase2_testset()
1016 				   mas_ce2_over_count(&mas_start, &mas_end,  in check_erase2_testset()
1034 					if (e_max > mas_end.last)  in check_erase2_testset()
1045 				   mas_ce2_over_count(&mas_start, &mas_end,  in check_erase2_testset()