2019-09-16 13:50:38 +00:00
|
|
|
#include "tommath_private.h"
|
2006-03-08 13:16:18 +00:00
|
|
|
#ifdef BN_MP_GET_INT_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.
|
|
|
|
*
|
2019-09-16 13:50:38 +00:00
|
|
|
* SPDX-License-Identifier: Unlicense
|
2006-03-08 13:16:18 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
/* get the lower 32-bits of an mp_int */
|
2019-09-16 13:50:38 +00:00
|
|
|
unsigned long mp_get_int(const mp_int *a)
|
2006-03-08 13:16:18 +00:00
|
|
|
{
|
2019-09-16 13:50:38 +00:00
|
|
|
int i;
|
|
|
|
mp_min_u32 res;
|
2006-03-08 13:16:18 +00:00
|
|
|
|
2019-09-16 13:50:38 +00:00
|
|
|
if (a->used == 0) {
|
|
|
|
return 0;
|
|
|
|
}
|
2006-03-08 13:16:18 +00:00
|
|
|
|
2019-09-16 13:50:38 +00:00
|
|
|
/* get number of digits of the lsb we have to read */
|
|
|
|
i = MIN(a->used, ((((int)sizeof(unsigned long) * CHAR_BIT) + DIGIT_BIT - 1) / DIGIT_BIT)) - 1;
|
2006-03-08 13:16:18 +00:00
|
|
|
|
2019-09-16 13:50:38 +00:00
|
|
|
/* get most significant digit of result */
|
|
|
|
res = DIGIT(a, i);
|
2017-06-24 14:37:14 +00:00
|
|
|
|
2019-09-16 13:50:38 +00:00
|
|
|
while (--i >= 0) {
|
|
|
|
res = (res << DIGIT_BIT) | DIGIT(a, i);
|
|
|
|
}
|
2006-03-08 13:16:18 +00:00
|
|
|
|
2019-09-16 13:50:38 +00:00
|
|
|
/* force result to 32-bits always so it is consistent on non 32-bit platforms */
|
|
|
|
return res & 0xFFFFFFFFUL;
|
2006-03-08 13:16:18 +00:00
|
|
|
}
|
|
|
|
#endif
|
2007-01-11 03:11:15 +00:00
|
|
|
|
2019-09-16 13:50:38 +00:00
|
|
|
/* ref: HEAD -> master, tag: v1.1.0 */
|
|
|
|
/* git commit: 08549ad6bc8b0cede0b357a9c341c5c6473a9c55 */
|
|
|
|
/* commit time: 2019-01-28 20:32:32 +0100 */
|