X-Git-Url: https://git.openssl.org/?p=openssl.git;a=blobdiff_plain;f=crypto%2Fec%2Fec_cvt.c;h=58d6b4caddb3388cf15ccee354395fdb9fa49620;hp=dffd70521a37164a3740ea828353ff3fee2df94e;hb=62f29eb1cf7957b4eb9ad60eccfe1e11bbac94ce;hpb=f8501464cc8fd8b7b4983462944a1894b157d735

diff --git a/crypto/ec/ec_cvt.c b/crypto/ec/ec_cvt.c
index dffd70521a..58d6b4cadd 100644
--- a/crypto/ec/ec_cvt.c
+++ b/crypto/ec/ec_cvt.c
@@ -80,7 +80,7 @@ EC_GROUP *EC_GROUP_new_curve_GFp(const BIGNUM *p, const BIGNUM *a, const BIGNUM
 	const EC_METHOD *meth;
 	EC_GROUP *ret;
 
-#if defined(OPENSSL_BN_ASM_MONT) && !defined(__sparc)
+#if defined(OPENSSL_BN_ASM_MONT)
 	/*
 	 * This might appear controversial, but the fact is that generic
 	 * prime method was observed to deliver better performance even
@@ -93,7 +93,7 @@ EC_GROUP *EC_GROUP_new_curve_GFp(const BIGNUM *p, const BIGNUM *a, const BIGNUM
 	 * arguable, because the dependency of improvement coefficient
 	 * from key length is not a "monotone" curve. For example while
 	 * 571-bit result is 23% on ARM, 384-bit one is -1%. But it's
-	 * generally faster, sometimes "respectfully" faster, or
+	 * generally faster, sometimes "respectfully" faster, sometimes
 	 * "tolerably" slower... What effectively happens is that loop
 	 * with bn_mul_add_words is put against bn_mul_mont, and the
 	 * latter "wins" on short vectors. Correct solution should be