dropbear/libtommath/bn_mp_get_long.c

43 lines
1.2 KiB
C
Raw Normal View History

#include "tommath_private.h"
2017-06-24 14:37:14 +00: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.
*
* SPDX-License-Identifier: Unlicense
2017-06-24 14:37:14 +00:00
*/
/* get the lower unsigned long of an mp_int, platform dependent */
unsigned long mp_get_long(const mp_int *a)
2017-06-24 14:37:14 +00:00
{
int i;
unsigned long res;
2017-06-24 14:37:14 +00:00
if (a->used == 0) {
return 0;
}
2017-06-24 14:37:14 +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;
2017-06-24 14:37:14 +00:00
/* get most significant digit of result */
res = DIGIT(a, i);
2017-06-24 14:37:14 +00:00
#if (ULONG_MAX != 0xffffffffuL) || (DIGIT_BIT < 32)
while (--i >= 0) {
res = (res << DIGIT_BIT) | DIGIT(a, i);
}
2017-06-24 14:37:14 +00:00
#endif
return res;
2017-06-24 14:37:14 +00:00
}
#endif
/* ref: HEAD -> master, tag: v1.1.0 */
/* git commit: 08549ad6bc8b0cede0b357a9c341c5c6473a9c55 */
/* commit time: 2019-01-28 20:32:32 +0100 */