ClearML/dropbear
1
0
Fork 0
mirror of https://github.com/clearml/dropbear synced 2025-06-26 18:17:32 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Update LibTomMath to 1.2.0 (#84)

Browse Source 
* update C files

* update other files

* update headers

* update makefiles

* remove mp_set/get_double()

* use ltm 1.2.0 API

* update ltm_desc

* use bundled tommath if system-tommath is too old

* XMALLOC etc. were changed to MP_MALLOC etc.
This commit is contained in:
Steffen Jaeckel
2020-05-26 17:36:47 +02:00
committed by GitHub
parent 724e61f8ae
commit b4bd23b4d2
229 changed files with 6095 additions and 31359 deletions
Download Patch File Download Diff File Expand all files Collapse all files

48
libtommath/bn_mp_radix_size.c
View File

@@ -1,22 +1,14 @@
#include "tommath_private.h"
#ifdef BN_MP_RADIX_SIZE_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
*/
/* LibTomMath, multiple-precision integer library -- Tom St Denis */
/* SPDX-License-Identifier: Unlicense */
/* returns size of ASCII reprensentation */
int mp_radix_size(const mp_int *a, int radix, int *size)
/* returns size of ASCII representation */
mp_err mp_radix_size(const mp_int *a, int radix, int *size)
{
int res, digs;
mp_int t;
mp_err err;
int digs;
mp_int t;
mp_digit d;
*size = 0;
@@ -26,14 +18,14 @@ int mp_radix_size(const mp_int *a, int radix, int *size)
return MP_VAL;
}
if (mp_iszero(a) == MP_YES) {
if (MP_IS_ZERO(a)) {
*size = 2;
return MP_OKAY;
}
/* special case for binary */
if (radix == 2) {
*size = mp_count_bits(a) + ((a->sign == MP_NEG) ? 1 : 0) + 1;
*size = (mp_count_bits(a) + ((a->sign == MP_NEG) ? 1 : 0) + 1);
return MP_OKAY;
}
@@ -46,30 +38,28 @@ int mp_radix_size(const mp_int *a, int radix, int *size)
}
/* init a copy of the input */
if ((res = mp_init_copy(&t, a)) != MP_OKAY) {
return res;
if ((err = mp_init_copy(&t, a)) != MP_OKAY) {
return err;
}
/* force temp to positive */
t.sign = MP_ZPOS;
/* fetch out all of the digits */
while (mp_iszero(&t) == MP_NO) {
if ((res = mp_div_d(&t, (mp_digit)radix, &t, &d)) != MP_OKAY) {
mp_clear(&t);
return res;
while (!MP_IS_ZERO(&t)) {
if ((err = mp_div_d(&t, (mp_digit)radix, &t, &d)) != MP_OKAY) {
goto LBL_ERR;
}
++digs;
}
mp_clear(&t);
/* return digs + 1, the 1 is for the NULL byte that would be required. */
*size = digs + 1;
return MP_OKAY;
err = MP_OKAY;
LBL_ERR:
mp_clear(&t);
return err;
}
#endif
/* ref: HEAD -> master, tag: v1.1.0 */
/* git commit: 08549ad6bc8b0cede0b357a9c341c5c6473a9c55 */
/* commit time: 2019-01-28 20:32:32 +0100 */