Mercurial > dropbear
comparison libtommath/bn_mp_get_long_long.c @ 1436:60fc6476e044
Update to libtommath v1.0
author | Matt Johnston <matt@ucc.asn.au> |
---|---|
date | Sat, 24 Jun 2017 22:37:14 +0800 |
parents | |
children | f52919ffd3b1 |
comparison
equal
deleted
inserted
replaced
1435:f849a5ca2efc | 1436:60fc6476e044 |
---|---|
1 #include <tommath_private.h> | |
2 #ifdef BN_MP_GET_LONG_LONG_C | |
3 /* LibTomMath, multiple-precision integer library -- Tom St Denis | |
4 * | |
5 * LibTomMath is a library that provides multiple-precision | |
6 * integer arithmetic as well as number theoretic functionality. | |
7 * | |
8 * The library was designed directly after the MPI library by | |
9 * Michael Fromberger but has been written from scratch with | |
10 * additional optimizations in place. | |
11 * | |
12 * The library is free for all purposes without any express | |
13 * guarantee it works. | |
14 * | |
15 * Tom St Denis, [email protected], http://libtom.org | |
16 */ | |
17 | |
18 /* get the lower unsigned long long of an mp_int, platform dependent */ | |
19 unsigned long long mp_get_long_long (mp_int * a) | |
20 { | |
21 int i; | |
22 unsigned long long res; | |
23 | |
24 if (a->used == 0) { | |
25 return 0; | |
26 } | |
27 | |
28 /* get number of digits of the lsb we have to read */ | |
29 i = MIN(a->used,(int)(((sizeof(unsigned long long) * CHAR_BIT) + DIGIT_BIT - 1) / DIGIT_BIT)) - 1; | |
30 | |
31 /* get most significant digit of result */ | |
32 res = DIGIT(a,i); | |
33 | |
34 #if DIGIT_BIT < 64 | |
35 while (--i >= 0) { | |
36 res = (res << DIGIT_BIT) | DIGIT(a,i); | |
37 } | |
38 #endif | |
39 return res; | |
40 } | |
41 #endif |