summaryrefslogtreecommitdiff
path: root/libtommath/bn_mp_mul_2.c
diff options
context:
space:
mode:
authorSteffen Jaeckel <s@jaeckel.eu>2020-05-26 17:36:47 +0200
committerSteffen Jaeckel <s@jaeckel.eu>2020-05-26 17:36:47 +0200
commit4f11c927dfb74496017fd1d2e2b18e3afb2a93fd (patch)
treeb448865b4989998f041b159bd913b79542f8623a /libtommath/bn_mp_mul_2.c
parent1de4c3c6588830f9c2c4c7236596f5e0c639e588 (diff)
downloaddropbear-4f11c927dfb74496017fd1d2e2b18e3afb2a93fd.tar.gz
Update LibTomMath to 1.2.0 (#84)
* update C files * update other files * update headers * update makefiles * remove mp_set/get_double() * use ltm 1.2.0 API * update ltm_desc * use bundled tommath if system-tommath is too old * XMALLOC etc. were changed to MP_MALLOC etc.
Diffstat (limited to 'libtommath/bn_mp_mul_2.c')
-rw-r--r--libtommath/bn_mp_mul_2.c33
1 files changed, 9 insertions, 24 deletions
diff --git a/libtommath/bn_mp_mul_2.c b/libtommath/bn_mp_mul_2.c
index 927ae99..bc0691a 100644
--- a/libtommath/bn_mp_mul_2.c
+++ b/libtommath/bn_mp_mul_2.c
@@ -1,26 +1,18 @@
#include "tommath_private.h"
#ifdef BN_MP_MUL_2_C
-/* LibTomMath, multiple-precision integer library -- Tom St Denis
- *
- * LibTomMath is a library that provides multiple-precision
- * integer arithmetic as well as number theoretic functionality.
- *
- * The library was designed directly after the MPI library by
- * Michael Fromberger but has been written from scratch with
- * additional optimizations in place.
- *
- * SPDX-License-Identifier: Unlicense
- */
+/* LibTomMath, multiple-precision integer library -- Tom St Denis */
+/* SPDX-License-Identifier: Unlicense */
/* b = a*2 */
-int mp_mul_2(const mp_int *a, mp_int *b)
+mp_err mp_mul_2(const mp_int *a, mp_int *b)
{
- int x, res, oldused;
+ int x, oldused;
+ mp_err err;
/* grow to accomodate result */
if (b->alloc < (a->used + 1)) {
- if ((res = mp_grow(b, a->used + 1)) != MP_OKAY) {
- return res;
+ if ((err = mp_grow(b, a->used + 1)) != MP_OKAY) {
+ return err;
}
}
@@ -43,7 +35,7 @@ int mp_mul_2(const mp_int *a, mp_int *b)
/* get what will be the *next* carry bit from the
* MSB of the current digit
*/
- rr = *tmpa >> (mp_digit)(DIGIT_BIT - 1);
+ rr = *tmpa >> (mp_digit)(MP_DIGIT_BIT - 1);
/* now shift up this digit, add in the carry [from the previous] */
*tmpb++ = ((*tmpa++ << 1uL) | r) & MP_MASK;
@@ -64,16 +56,9 @@ int mp_mul_2(const mp_int *a, mp_int *b)
/* now zero any excess digits on the destination
* that we didn't write to
*/
- tmpb = b->dp + b->used;
- for (x = b->used; x < oldused; x++) {
- *tmpb++ = 0;
- }
+ MP_ZERO_DIGITS(b->dp + b->used, oldused - b->used);
}
b->sign = a->sign;
return MP_OKAY;
}
#endif
-
-/* ref: HEAD -> master, tag: v1.1.0 */
-/* git commit: 08549ad6bc8b0cede0b357a9c341c5c6473a9c55 */
-/* commit time: 2019-01-28 20:32:32 +0100 */