tommath/bn_mp_read_unsigned_bin.c

56 lines
1.3 KiB
C
Raw Normal View History

#include <tommath_private.h>
2004-10-29 18:07:18 -04:00
#ifdef BN_MP_READ_UNSIGNED_BIN_C
2003-02-28 11:08:34 -05:00
/* LibTomMath, multiple-precision integer library -- Tom St Denis
*
2003-08-04 21:24:44 -04:00
* LibTomMath is a library that provides multiple-precision
2003-02-28 11:08:34 -05:00
* integer arithmetic as well as number theoretic functionality.
*
2003-08-04 21:24:44 -04:00
* The library was designed directly after the MPI library by
2003-02-28 11:08:34 -05:00
* Michael Fromberger but has been written from scratch with
* additional optimizations in place.
*
* The library is free for all purposes without any express
* guarantee it works.
*
* Tom St Denis, tstdenis82@gmail.com, http://libtom.org
2003-02-28 11:08:34 -05:00
*/
/* reads a unsigned char array, assumes the msb is stored first [big endian] */
2005-08-01 12:37:28 -04:00
int mp_read_unsigned_bin (mp_int * a, const unsigned char *b, int c)
2003-02-28 11:08:34 -05:00
{
2003-02-28 11:09:08 -05:00
int res;
2003-08-29 10:06:56 -04:00
/* make sure there are at least two digits */
if (a->alloc < 2) {
if ((res = mp_grow(a, 2)) != MP_OKAY) {
return res;
}
}
/* zero the int */
2003-02-28 11:08:34 -05:00
mp_zero (a);
2003-08-29 10:06:56 -04:00
/* read the bytes in */
2003-02-28 11:08:34 -05:00
while (c-- > 0) {
if ((res = mp_mul_2d (a, 8, a)) != MP_OKAY) {
return res;
}
2003-07-12 10:31:43 -04:00
#ifndef MP_8BIT
2015-10-25 11:09:26 -04:00
a->dp[0] |= *b++;
a->used += 1;
2003-07-12 10:31:43 -04:00
#else
2015-10-25 11:09:26 -04:00
a->dp[0] = (*b & MP_MASK);
a->dp[1] |= ((*b++ >> 7U) & 1);
a->used += 2;
2003-07-12 10:31:43 -04:00
#endif
2003-02-28 11:08:34 -05:00
}
mp_clamp (a);
return MP_OKAY;
}
2004-10-29 18:07:18 -04:00
#endif
2005-08-01 12:37:28 -04:00
2017-08-28 10:27:26 -04:00
/* ref: $Format:%D$ */
/* git commit: $Format:%H$ */
/* commit time: $Format:%ai$ */