libtommath/mp_read_radix.c

70 lines
1.7 KiB
C
Raw Normal View History

#include "tommath_private.h"
#ifdef MP_READ_RADIX_C
2019-04-07 13:29:11 +00:00
/* LibTomMath, multiple-precision integer library -- Tom St Denis */
/* SPDX-License-Identifier: Unlicense */
2003-08-05 01:24:44 +00:00
/* read a string [ASCII] in a given radix */
mp_err mp_read_radix(mp_int *a, const char *str, int radix)
2003-08-05 01:24:44 +00:00
{
2019-05-19 15:16:13 +00:00
mp_err err;
mp_sign sign = MP_ZPOS;
2005-11-18 05:16:19 +00:00
2017-08-30 18:23:46 +00:00
/* make sure the radix is ok */
if ((radix < 2) || (radix > 64)) {
return MP_VAL;
}
2003-08-05 01:24:44 +00:00
2017-08-30 18:23:46 +00:00
/* if the leading digit is a
* minus set the sign to negative.
*/
if (*str == '-') {
++str;
sign = MP_NEG;
2017-08-30 18:23:46 +00:00
}
2003-08-05 01:24:44 +00:00
2017-08-30 18:23:46 +00:00
/* set the integer to the default of zero */
mp_zero(a);
2017-08-30 03:51:11 +00:00
2017-08-30 18:23:46 +00:00
/* process each digit of the string */
while (*str != '\0') {
/* if the radix <= 36 the conversion is case insensitive
* this allows numbers like 1AB and 1ab to represent the same value
* [e.g. in hex]
*/
2019-10-29 17:41:25 +00:00
uint8_t y;
char ch = (radix <= 36) ? (char)MP_TOUPPER((int)*str) : *str;
unsigned pos = (unsigned)(ch - '+');
if (MP_RADIX_MAP_REVERSE_SIZE <= pos) {
2017-10-09 12:34:20 +00:00
break;
2003-08-05 01:24:44 +00:00
}
y = s_mp_radix_map_reverse[pos];
2003-08-05 01:24:44 +00:00
2017-08-30 18:23:46 +00:00
/* if the char was found in the map
* and is less than the given radix add it
* to the number, otherwise exit the loop.
*/
if (y >= radix) {
2017-08-30 18:23:46 +00:00
break;
2003-08-05 01:24:44 +00:00
}
2019-05-19 15:16:13 +00:00
if ((err = mp_mul_d(a, (mp_digit)radix, a)) != MP_OKAY) {
return err;
2017-10-09 12:34:20 +00:00
}
2019-10-29 17:41:25 +00:00
if ((err = mp_add_d(a, y, a)) != MP_OKAY) {
2019-05-19 15:16:13 +00:00
return err;
2017-10-09 12:34:20 +00:00
}
2017-08-30 18:23:46 +00:00
++str;
}
2005-05-10 17:20:39 +00:00
2017-08-30 18:23:46 +00:00
/* if an illegal character was found, fail. */
2019-10-29 17:41:25 +00:00
if ((*str != '\0') && (*str != '\r') && (*str != '\n')) {
2005-05-10 17:20:39 +00:00
return MP_VAL;
2017-08-30 18:23:46 +00:00
}
2005-05-10 17:20:39 +00:00
2017-08-30 18:23:46 +00:00
/* set the sign only if a != 0 */
2019-10-24 15:43:31 +00:00
if (!mp_iszero(a)) {
a->sign = sign;
2017-08-30 18:23:46 +00:00
}
return MP_OKAY;
2003-08-05 01:24:44 +00:00
}
2004-10-29 22:07:18 +00:00
#endif