2018-05-02 19:43:17 +00:00
|
|
|
#include "tommath_private.h"
|
2014-10-14 12:36:38 +00:00
|
|
|
#ifdef BN_MP_GET_LONG_C
|
2011-11-13 18:17:46 +00:00
|
|
|
/* 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 14:59:43 +00:00
|
|
|
unsigned long mp_get_long(const mp_int *a)
|
2011-11-13 18:17:46 +00:00
|
|
|
{
|
2017-08-29 20:23:48 +00:00
|
|
|
int i;
|
|
|
|
unsigned long res;
|
2011-11-13 18:17:46 +00:00
|
|
|
|
2017-08-29 20:23:48 +00:00
|
|
|
if (a->used == 0) {
|
|
|
|
return 0;
|
|
|
|
}
|
2011-11-13 18:17:46 +00:00
|
|
|
|
2017-08-29 20:23:48 +00:00
|
|
|
/* get number of digits of the lsb we have to read */
|
2017-10-15 17:58:35 +00:00
|
|
|
i = MIN(a->used, ((((int)sizeof(unsigned long) * CHAR_BIT) + DIGIT_BIT - 1) / DIGIT_BIT)) - 1;
|
2011-11-13 18:17:46 +00:00
|
|
|
|
2017-08-29 20:23:48 +00:00
|
|
|
/* get most significant digit of result */
|
|
|
|
res = DIGIT(a, i);
|
2014-10-14 12:37:17 +00:00
|
|
|
|
2015-11-13 09:28:23 +00:00
|
|
|
#if (ULONG_MAX != 0xffffffffuL) || (DIGIT_BIT < 32)
|
2017-08-29 20:23:48 +00:00
|
|
|
while (--i >= 0) {
|
|
|
|
res = (res << DIGIT_BIT) | DIGIT(a, i);
|
|
|
|
}
|
2014-10-14 12:37:17 +00:00
|
|
|
#endif
|
2017-08-29 20:23:48 +00:00
|
|
|
return res;
|
2011-11-13 18:17:46 +00:00
|
|
|
}
|
|
|
|
#endif
|