libtommath/bn_mp_2expt.c

32 lines
744 B
C
Raw Normal View History

#include "tommath_private.h"
2004-10-29 22:07:18 +00:00
#ifdef BN_MP_2EXPT_C
2019-04-07 13:29:11 +00:00
/* LibTomMath, multiple-precision integer library -- Tom St Denis */
/* SPDX-License-Identifier: Unlicense */
2003-02-28 16:08:34 +00:00
2017-08-30 03:51:11 +00:00
/* computes a = 2**b
2003-02-28 16:09:08 +00:00
*
* Simple algorithm which zeroes the int, grows it then just sets one bit
* as required.
*/
2017-08-30 17:07:12 +00:00
int mp_2expt(mp_int *a, int b)
2003-02-28 16:08:34 +00:00
{
2017-08-29 20:23:48 +00:00
int res;
2003-02-28 16:08:34 +00:00
2017-08-29 20:23:48 +00:00
/* zero a as per default */
mp_zero(a);
2003-08-05 01:24:44 +00:00
2017-08-29 20:23:48 +00:00
/* grow a to accomodate the single bit */
2019-04-13 06:46:57 +00:00
if ((res = mp_grow(a, (b / MP_DIGIT_BIT) + 1)) != MP_OKAY) {
2017-08-29 20:23:48 +00:00
return res;
}
2003-08-05 01:24:44 +00:00
2017-08-29 20:23:48 +00:00
/* set the used count of where the bit will go */
2019-04-13 06:46:57 +00:00
a->used = (b / MP_DIGIT_BIT) + 1;
2003-08-05 01:24:44 +00:00
2017-08-29 20:23:48 +00:00
/* put the single bit in its place */
2019-04-13 06:46:57 +00:00
a->dp[b / MP_DIGIT_BIT] = (mp_digit)1 << (mp_digit)(b % MP_DIGIT_BIT);
2003-02-28 16:08:34 +00:00
2017-08-29 20:23:48 +00:00
return MP_OKAY;
2003-02-28 16:08:34 +00:00
}
2004-10-29 22:07:18 +00:00
#endif