701 int mas_ce2_over_count(struct ma_state *mas_start, struct ma_state *mas_end,  in mas_ce2_over_count()  argument
713 	memcpy(&tmp, mas_start, sizeof(tmp));  in mas_ce2_over_count()
732 		if (s_entry && (s_min == mas_start->index))  in mas_ce2_over_count()
736 		bool ssplit = s_min != mas_start->index;  in mas_ce2_over_count()
885 	mas_start(mas);  in mas_tree_walk()
950 		MA_STATE(mas_start, mt, set[i+1], set[i+1]);  in check_erase2_testset()
958 		s_entry = mas_range_load(&mas_start, &s_min, &s_max);  in check_erase2_testset()
968 			} else if ((mas_start.node != mas_end.node) ||  in check_erase2_testset()
969 			   (mas_start.offset != mas_end.offset)) {  in check_erase2_testset()
971 				   mas_ce2_over_count(&mas_start, &mas_end,  in check_erase2_testset()
982 			if (mas_start.offset > mt_slot_count(mas_start.node)) {  in check_erase2_testset()
992 					if (s_min < mas_start.index)  in check_erase2_testset()
1000 				   mas_ce2_over_count(&mas_start, &mas_end,  in check_erase2_testset()
35226 		mas_start(mas);  in mas_dfs_preorder()