diff options
| author | Miod Vallat <miod@cvs.openbsd.org> | 2014-04-23 19:17:49 +0000 |
|---|---|---|
| committer | Miod Vallat <miod@cvs.openbsd.org> | 2014-04-23 19:17:49 +0000 |
| commit | 2363c2ccfed2b7f5d651559871cdbc0b181e5e92 (patch) | |
| tree | 1cb5fcee51fe36aa9d398f5b24c893003f129b46 /lib/libcrypto | |
| parent | 1260a389b8c53e8e4133b75b1ba43696bf0293a3 (diff) | |
When I grow up, I want to write workaround for long long multiplications
under __TANDEM systems and compilers, using hardcoded octal numbers. NOT.
Diffstat (limited to 'lib/libcrypto')
| -rw-r--r-- | lib/libcrypto/bn/bn_mont.c | 15 |
1 files changed, 0 insertions, 15 deletions
diff --git a/lib/libcrypto/bn/bn_mont.c b/lib/libcrypto/bn/bn_mont.c index 456a80bde61..6274a934bb5 100644 --- a/lib/libcrypto/bn/bn_mont.c +++ b/lib/libcrypto/bn/bn_mont.c @@ -207,22 +207,7 @@ static int BN_from_montgomery_word(BIGNUM *ret, BIGNUM *r, BN_MONT_CTX *mont) #endif for (carry=0, i=0; i<nl; i++, rp++) { -#ifdef __TANDEM - { - long long t1; - long long t2; - long long t3; - t1 = rp[0] * (n0 & 0177777); - t2 = 037777600000l; - t2 = n0 & t2; - t3 = rp[0] & 0177777; - t2 = (t3 * t2) & BN_MASK2; - t1 = t1 + t2; - v=bn_mul_add_words(rp,np,nl,(BN_ULONG) t1); - } -#else v=bn_mul_add_words(rp,np,nl,(rp[0]*n0)&BN_MASK2); -#endif v = (v+carry+rp[nl])&BN_MASK2; carry |= (v != rp[nl]); carry &= (v <= rp[nl]); |