libtommath/bn_mp_get_long_long.c

43 lines
1.1 KiB
C
Raw Normal View History

#include "tommath_private.h"
#ifdef BN_MP_GET_LONG_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.
*
2018-12-29 16:56:20 +00:00
* SPDX-License-Identifier: Unlicense
*/
/* get the lower unsigned long long of an mp_int, platform dependent */
2017-09-20 14:59:43 +00:00
unsigned long long mp_get_long_long(const mp_int *a)
{
2017-08-29 20:23:48 +00:00
int i;
unsigned long long res;
2018-12-31 11:15:44 +00:00
if (IS_ZERO(a)) {
2017-08-29 20:23:48 +00:00
return 0;
}
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 long) * CHAR_BIT) + DIGIT_BIT - 1) / DIGIT_BIT)) - 1;
2017-08-29 20:23:48 +00:00
/* get most significant digit of result */
res = (unsigned long long)a->dp[i];
#if DIGIT_BIT < 64
2017-08-29 20:23:48 +00:00
while (--i >= 0) {
res = (res << DIGIT_BIT) | (unsigned long long)a->dp[i];
2017-08-29 20:23:48 +00:00
}
#endif
2017-08-29 20:23:48 +00:00
return res;
}
#endif
2018-12-02 12:10:09 +00:00
/* ref: $Format:%D$ */
/* git commit: $Format:%H$ */
/* commit time: $Format:%ai$ */