AuroraMiddleware/libtommath
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

convert tab indentation

Browse Source
This commit is contained in:
Francois Perrad 2017-08-30 05:52:16 +02:00
parent 0ff04a4f6f
commit 0135749e44
2 changed files with 81 additions and 81 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

92
bn_mp_export.c
View File

@ -20,65 +20,65 @@
*/ */
int mp_export(void* rop, size_t* countp, int order, size_t size, int mp_export(void* rop, size_t* countp, int order, size_t size,
int endian, size_t nails, mp_int* op) { int endian, size_t nails, mp_int* op) {
int result; int result;
size_t odd_nails, nail_bytes, i, j, bits, count; size_t odd_nails, nail_bytes, i, j, bits, count;
unsigned char odd_nail_mask; unsigned char odd_nail_mask;
mp_int t; mp_int t;
if ((result = mp_init_copy(&t, op)) != MP_OKAY) { if ((result = mp_init_copy(&t, op)) != MP_OKAY) {
return result; return result;
} }
if (endian == 0) { if (endian == 0) {
union { union {
unsigned int i; unsigned int i;
char c[4]; char c[4];
} lint; } lint;
lint.i = 0x01020304; lint.i = 0x01020304;
endian = (lint.c[0] == 4) ? -1 : 1; endian = (lint.c[0] == 4) ? -1 : 1;
} }
odd_nails = (nails % 8); odd_nails = (nails % 8);
odd_nail_mask = 0xff; odd_nail_mask = 0xff;
for (i = 0; i < odd_nails; ++i) { for (i = 0; i < odd_nails; ++i) {
odd_nail_mask ^= (1 << (7 - i)); odd_nail_mask ^= (1 << (7 - i));
} }
nail_bytes = nails / 8; nail_bytes = nails / 8;
bits = mp_count_bits(&t); bits = mp_count_bits(&t);
count = (bits / ((size * 8) - nails)) + (((bits % ((size * 8) - nails)) != 0) ? 1 : 0); count = (bits / ((size * 8) - nails)) + (((bits % ((size * 8) - nails)) != 0) ? 1 : 0);
for (i = 0; i < count; ++i) { for (i = 0; i < count; ++i) {
for (j = 0; j < size; ++j) { for (j = 0; j < size; ++j) {
unsigned char* byte = ( unsigned char* byte = (
(unsigned char*)rop + (unsigned char*)rop +
(((order == -1) ? i : ((count - 1) - i)) * size) + (((order == -1) ? i : ((count - 1) - i)) * size) +
((endian == -1) ? j : ((size - 1) - j)) ((endian == -1) ? j : ((size - 1) - j))
); );
if (j >= (size - nail_bytes)) { if (j >= (size - nail_bytes)) {
*byte = 0; *byte = 0;
continue; continue;
} }
*byte = (unsigned char)((j == ((size - nail_bytes) - 1)) ? (t.dp[0] & odd_nail_mask) : (t.dp[0] & 0xFF)); *byte = (unsigned char)((j == ((size - nail_bytes) - 1)) ? (t.dp[0] & odd_nail_mask) : (t.dp[0] & 0xFF));
if ((result = mp_div_2d(&t, ((j == ((size - nail_bytes) - 1)) ? (8 - odd_nails) : 8), &t, NULL)) != MP_OKAY) { if ((result = mp_div_2d(&t, ((j == ((size - nail_bytes) - 1)) ? (8 - odd_nails) : 8), &t, NULL)) != MP_OKAY) {
mp_clear(&t); mp_clear(&t);
return result; return result;
} }
} }
} }
mp_clear(&t); mp_clear(&t);
if (countp != NULL) { if (countp != NULL) {
*countp = count; *countp = count;
} }
return MP_OKAY; return MP_OKAY;
} }
#endif #endif

70
bn_mp_import.c
View File

@ -20,50 +20,50 @@
*/ */
int mp_import(mp_int* rop, size_t count, int order, size_t size, int mp_import(mp_int* rop, size_t count, int order, size_t size,
int endian, size_t nails, const void* op) { int endian, size_t nails, const void* op) {
int result; int result;
size_t odd_nails, nail_bytes, i, j; size_t odd_nails, nail_bytes, i, j;
unsigned char odd_nail_mask; unsigned char odd_nail_mask;
mp_zero(rop); mp_zero(rop);
if (endian == 0) { if (endian == 0) {
union { union {
unsigned int i; unsigned int i;
char c[4]; char c[4];
} lint; } lint;
lint.i = 0x01020304; lint.i = 0x01020304;
endian = (lint.c[0] == 4) ? -1 : 1; endian = (lint.c[0] == 4) ? -1 : 1;
} }
odd_nails = (nails % 8); odd_nails = (nails % 8);
odd_nail_mask = 0xff; odd_nail_mask = 0xff;
for (i = 0; i < odd_nails; ++i) { for (i = 0; i < odd_nails; ++i) {
odd_nail_mask ^= (1 << (7 - i)); odd_nail_mask ^= (1 << (7 - i));
} }
nail_bytes = nails / 8; nail_bytes = nails / 8;
for (i = 0; i < count; ++i) { for (i = 0; i < count; ++i) {
for (j = 0; j < (size - nail_bytes); ++j) { for (j = 0; j < (size - nail_bytes); ++j) {
unsigned char byte = *( unsigned char byte = *(
(unsigned char*)op + (unsigned char*)op +
(((order == 1) ? i : ((count - 1) - i)) * size) + (((order == 1) ? i : ((count - 1) - i)) * size) +
((endian == 1) ? (j + nail_bytes) : (((size - 1) - j) - nail_bytes)) ((endian == 1) ? (j + nail_bytes) : (((size - 1) - j) - nail_bytes))
); );
if ( if (
(result = mp_mul_2d(rop, ((j == 0) ? (8 - odd_nails) : 8), rop)) != MP_OKAY) { (result = mp_mul_2d(rop, ((j == 0) ? (8 - odd_nails) : 8), rop)) != MP_OKAY) {
return result; return result;
} }
rop->dp[0] |= (j == 0) ? (byte & odd_nail_mask) : byte; rop->dp[0] |= (j == 0) ? (byte & odd_nail_mask) : byte;
rop->used += 1; rop->used += 1;
} }
} }
mp_clamp(rop); mp_clamp(rop);
return MP_OKAY; return MP_OKAY;
} }
#endif #endif