diff options
| author | Matt Johnston <matt@ucc.asn.au> | 2017-06-24 22:37:14 +0800 |
|---|---|---|
| committer | Matt Johnston <matt@ucc.asn.au> | 2017-06-24 22:37:14 +0800 |
| commit | 364fb6019c1931de3d181f21ea491ec112161577 (patch) | |
| tree | 1776e0451167b1b492db0e5bd30f5d0178e54afa /libtommath/bn_mp_mul.c | |
| parent | a79b61517bc7123250d0e2dc21dc18deccf0bb64 (diff) | |
Update to libtommath v1.0
Diffstat (limited to 'libtommath/bn_mp_mul.c')
| -rw-r--r-- | libtommath/bn_mp_mul.c | 17 |
1 files changed, 9 insertions, 8 deletions
diff --git a/libtommath/bn_mp_mul.c b/libtommath/bn_mp_mul.c index f941a1a..ea53d5e 100644 --- a/libtommath/bn_mp_mul.c +++ b/libtommath/bn_mp_mul.c @@ -1,4 +1,4 @@ -#include <tommath.h> +#include <tommath_private.h> #ifdef BN_MP_MUL_C /* LibTomMath, multiple-precision integer library -- Tom St Denis * @@ -12,7 +12,7 @@ * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com + * Tom St Denis, tstdenis82@gmail.com, http://libtom.org */ /* high level multiplication (handles sign) */ @@ -44,23 +44,24 @@ int mp_mul (mp_int * a, mp_int * b, mp_int * c) #ifdef BN_FAST_S_MP_MUL_DIGS_C if ((digs < MP_WARRAY) && - MIN(a->used, b->used) <= - (1 << ((CHAR_BIT * sizeof (mp_word)) - (2 * DIGIT_BIT)))) { + (MIN(a->used, b->used) <= + (1 << ((CHAR_BIT * sizeof(mp_word)) - (2 * DIGIT_BIT))))) { res = fast_s_mp_mul_digs (a, b, c, digs); } else #endif + { #ifdef BN_S_MP_MUL_DIGS_C res = s_mp_mul (a, b, c); /* uses s_mp_mul_digs */ #else res = MP_VAL; #endif - + } } c->sign = (c->used > 0) ? neg : MP_ZPOS; return res; } #endif -/* $Source: /cvs/libtom/libtommath/bn_mp_mul.c,v $ */ -/* $Revision: 1.3 $ */ -/* $Date: 2006/03/31 14:18:44 $ */ +/* $Source$ */ +/* $Revision$ */ +/* $Date$ */ |