arduino/esp8266
1
0
Fork 0
mirror of https://github.com/esp8266/Arduino.git synced 2025-07-30 16:24:09 +03:00
Code Activity

fixed regular_square. Some scan-build tweaks. Made os_port.h "private".

Browse Source 
git-svn-id: svn://svn.code.sf.net/p/axtls/code/trunk@181 9a5d90b5-6617-0410-8a86-bb477d3ed2e3
This commit is contained in:
cameronrich
2010-12-29 11:49:30 +00:00
parent 7e570e3943
commit 0d2e75b9c7
16 changed files with 48 additions and 65 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
crypto/aes.c
View File

@ -168,7 +168,7 @@ static void AES_decrypt(const AES_CTX *ctx, uint32_t *data);
x^8+x^4+x^3+x+1 */
static unsigned char AES_xtime(uint32_t x)
{
return x = (x&0x80) ? (x<<1)^0x1b : x<<1;
return (x&0x80) ? (x<<1)^0x1b : x<<1;
}
/**

15
crypto/bigint.c
View File

@ -926,7 +926,7 @@ bigint *bi_multiply(BI_CTX *ctx, bigint *bia, bigint *bib)
/*
* Perform the actual square operion. It takes into account overflow.
*/
bigint *regular_square(BI_CTX *ctx, bigint *bi)
static bigint *regular_square(BI_CTX *ctx, bigint *bi)
{
int t = bi->size;
int i = 0, j;
@ -939,13 +939,13 @@ bigint *regular_square(BI_CTX *ctx, bigint *bi)
do
{
long_comp tmp = w[2*i] + (long_comp)x[i]*x[i];
uint8_t c = 0, q = 0;
uint8_t c = 0;
w[2*i] = (comp)tmp;
carry = (comp)(tmp >> COMP_BIT_SIZE);
for (j = i+1; j < t; j++)
{
c = q = 0;
c = 0;
long_comp xx = (long_comp)x[i]*x[j];
if (COMP_MAX-xx < xx)
c = 1;
@ -958,7 +958,7 @@ bigint *regular_square(BI_CTX *ctx, bigint *bi)
tmp += w[i+j];
if (COMP_MAX-tmp < carry)
c = q = 1;
c = 1;
tmp += carry;
w[i+j] = (comp)tmp;
@ -968,10 +968,9 @@ bigint *regular_square(BI_CTX *ctx, bigint *bi)
carry += COMP_RADIX;
}
w[i+t] += carry;
if (c && !q)
w[i+t+1] = 1; /* add carry */
tmp = carry + w[i+t];
w[i+t] = (comp)tmp;
w[i+t+1] = tmp >> COMP_BIT_SIZE;
} while (++i < t);
bi_free(ctx, bi);