summaryrefslogtreecommitdiff
path: root/libtommath/bn_mp_2expt.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_2expt.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_2expt.c')
-rw-r--r--libtommath/bn_mp_2expt.c29
1 files changed, 8 insertions, 21 deletions
diff --git a/libtommath/bn_mp_2expt.c b/libtommath/bn_mp_2expt.c
index 54bd1d9..0ae3df1 100644
--- a/libtommath/bn_mp_2expt.c
+++ b/libtommath/bn_mp_2expt.c
@@ -1,44 +1,31 @@
#include "tommath_private.h"
#ifdef BN_MP_2EXPT_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 */
/* computes a = 2**b
*
* Simple algorithm which zeroes the int, grows it then just sets one bit
* as required.
*/
-int mp_2expt(mp_int *a, int b)
+mp_err mp_2expt(mp_int *a, int b)
{
- int res;
+ mp_err err;
/* zero a as per default */
mp_zero(a);
/* grow a to accomodate the single bit */
- if ((res = mp_grow(a, (b / DIGIT_BIT) + 1)) != MP_OKAY) {
- return res;
+ if ((err = mp_grow(a, (b / MP_DIGIT_BIT) + 1)) != MP_OKAY) {
+ return err;
}
/* set the used count of where the bit will go */
- a->used = (b / DIGIT_BIT) + 1;
+ a->used = (b / MP_DIGIT_BIT) + 1;
/* put the single bit in its place */
- a->dp[b / DIGIT_BIT] = (mp_digit)1 << (mp_digit)(b % DIGIT_BIT);
+ a->dp[b / MP_DIGIT_BIT] = (mp_digit)1 << (mp_digit)(b % MP_DIGIT_BIT);
return MP_OKAY;
}
#endif
-
-/* ref: HEAD -> master, tag: v1.1.0 */
-/* git commit: 08549ad6bc8b0cede0b357a9c341c5c6473a9c55 */
-/* commit time: 2019-01-28 20:32:32 +0100 */