summaryrefslogtreecommitdiffstats
path: root/libtommath/bn_mp_to_unsigned_bin.c
diff options
context:
space:
mode:
Diffstat (limited to 'libtommath/bn_mp_to_unsigned_bin.c')
-rw-r--r--libtommath/bn_mp_to_unsigned_bin.c44
1 files changed, 20 insertions, 24 deletions
diff --git a/libtommath/bn_mp_to_unsigned_bin.c b/libtommath/bn_mp_to_unsigned_bin.c
index 9339cce..9496398 100644
--- a/libtommath/bn_mp_to_unsigned_bin.c
+++ b/libtommath/bn_mp_to_unsigned_bin.c
@@ -1,4 +1,4 @@
-#include <tommath_private.h>
+#include <tommath.h>
#ifdef BN_MP_TO_UNSIGNED_BIN_C
/* LibTomMath, multiple-precision integer library -- Tom St Denis
*
@@ -12,37 +12,33 @@
* The library is free for all purposes without any express
* guarantee it works.
*
- * Tom St Denis, tstdenis82@gmail.com, http://libtom.org
+ * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com
*/
/* store in unsigned [big endian] format */
-int mp_to_unsigned_bin(const mp_int *a, unsigned char *b)
+int mp_to_unsigned_bin (mp_int * a, unsigned char *b)
{
- int x, res;
- mp_int t;
+ int x, res;
+ mp_int t;
- if ((res = mp_init_copy(&t, a)) != MP_OKAY) {
- return res;
- }
+ if ((res = mp_init_copy (&t, a)) != MP_OKAY) {
+ return res;
+ }
- x = 0;
- while (mp_iszero(&t) == MP_NO) {
+ x = 0;
+ while (mp_iszero (&t) == 0) {
#ifndef MP_8BIT
- b[x++] = (unsigned char)(t.dp[0] & 255);
+ b[x++] = (unsigned char) (t.dp[0] & 255);
#else
- b[x++] = (unsigned char)(t.dp[0] | ((t.dp[1] & 0x01) << 7));
+ b[x++] = (unsigned char) (t.dp[0] | ((t.dp[1] & 0x01) << 7));
#endif
- if ((res = mp_div_2d(&t, 8, &t, NULL)) != MP_OKAY) {
- mp_clear(&t);
- return res;
- }
- }
- bn_reverse(b, x);
- mp_clear(&t);
- return MP_OKAY;
+ if ((res = mp_div_2d (&t, 8, &t, NULL)) != MP_OKAY) {
+ mp_clear (&t);
+ return res;
+ }
+ }
+ bn_reverse (b, x);
+ mp_clear (&t);
+ return MP_OKAY;
}
#endif
-
-/* ref: $Format:%D$ */
-/* git commit: $Format:%H$ */
-/* commit time: $Format:%ai$ */