tommath/bn_mp_get_long.c

40 lines
1.0 KiB
C
Raw Normal View History

#include "tommath_private.h"
2014-10-14 08:36:38 -04:00
#ifdef BN_MP_GET_LONG_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.
*
* The library is free for all purposes without any express
* guarantee it works.
*/
/* get the lower unsigned long of an mp_int, platform dependent */
2017-09-20 10:59:43 -04:00
unsigned long mp_get_long(const mp_int *a)
{
2017-08-29 16:23:48 -04:00
int i;
unsigned long res;
2017-08-29 16:23:48 -04:00
if (a->used == 0) {
return 0;
}
2017-08-29 16:23:48 -04:00
/* get number of digits of the lsb we have to read */
2017-10-15 13:58:35 -04:00
i = MIN(a->used, ((((int)sizeof(unsigned long) * CHAR_BIT) + DIGIT_BIT - 1) / DIGIT_BIT)) - 1;
2017-08-29 16:23:48 -04:00
/* get most significant digit of result */
res = DIGIT(a, i);
#if (ULONG_MAX != 0xffffffffuL) || (DIGIT_BIT < 32)
2017-08-29 16:23:48 -04:00
while (--i >= 0) {
res = (res << DIGIT_BIT) | DIGIT(a, i);
}
#endif
2017-08-29 16:23:48 -04:00
return res;
}
#endif