提交 41b76195 编写于 作者: D Dr. Stephen Henson

Fix missing prototype warnings then fix different prototype warnings ;-)

上级 211655fc
#include "../bn_lcl.h"
#if !(defined(__GNUC__) && __GNUC__>=2) #if !(defined(__GNUC__) && __GNUC__>=2)
# include "../bn_asm.c" /* kind of dirty hack for Sun Studio */ # include "../bn_asm.c" /* kind of dirty hack for Sun Studio */
#else #else
...@@ -60,6 +61,9 @@ ...@@ -60,6 +61,9 @@
#define BN_ULONG unsigned long #define BN_ULONG unsigned long
#endif #endif
#undef mul
#undef mul_add
/* /*
* "m"(a), "+m"(r) is the way to favor DirectPath -code; * "m"(a), "+m"(r) is the way to favor DirectPath -code;
* "g"(0) let the compiler to decide where does it * "g"(0) let the compiler to decide where does it
...@@ -101,7 +105,7 @@ ...@@ -101,7 +105,7 @@
: "a"(a) \ : "a"(a) \
: "cc"); : "cc");
BN_ULONG bn_mul_add_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w) BN_ULONG bn_mul_add_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w)
{ {
BN_ULONG c1=0; BN_ULONG c1=0;
...@@ -125,7 +129,7 @@ BN_ULONG bn_mul_add_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w) ...@@ -125,7 +129,7 @@ BN_ULONG bn_mul_add_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w)
return(c1); return(c1);
} }
BN_ULONG bn_mul_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w) BN_ULONG bn_mul_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w)
{ {
BN_ULONG c1=0; BN_ULONG c1=0;
...@@ -148,7 +152,7 @@ BN_ULONG bn_mul_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w) ...@@ -148,7 +152,7 @@ BN_ULONG bn_mul_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w)
return(c1); return(c1);
} }
void bn_sqr_words(BN_ULONG *r, BN_ULONG *a, int n) void bn_sqr_words(BN_ULONG *r, const BN_ULONG *a, int n)
{ {
if (n <= 0) return; if (n <= 0) return;
...@@ -179,7 +183,7 @@ BN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d) ...@@ -179,7 +183,7 @@ BN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d)
return ret; return ret;
} }
BN_ULONG bn_add_words (BN_ULONG *rp, BN_ULONG *ap, BN_ULONG *bp,int n) BN_ULONG bn_add_words (BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,int n)
{ BN_ULONG ret=0,i=0; { BN_ULONG ret=0,i=0;
if (n <= 0) return 0; if (n <= 0) return 0;
...@@ -202,7 +206,7 @@ BN_ULONG bn_add_words (BN_ULONG *rp, BN_ULONG *ap, BN_ULONG *bp,int n) ...@@ -202,7 +206,7 @@ BN_ULONG bn_add_words (BN_ULONG *rp, BN_ULONG *ap, BN_ULONG *bp,int n)
} }
#ifndef SIMICS #ifndef SIMICS
BN_ULONG bn_sub_words (BN_ULONG *rp, BN_ULONG *ap, BN_ULONG *bp,int n) BN_ULONG bn_sub_words (BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,int n)
{ BN_ULONG ret=0,i=0; { BN_ULONG ret=0,i=0;
if (n <= 0) return 0; if (n <= 0) return 0;
...@@ -489,7 +493,7 @@ void bn_mul_comba4(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b) ...@@ -489,7 +493,7 @@ void bn_mul_comba4(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b)
r[7]=c2; r[7]=c2;
} }
void bn_sqr_comba8(BN_ULONG *r, BN_ULONG *a) void bn_sqr_comba8(BN_ULONG *r, const BN_ULONG *a)
{ {
BN_ULONG t1,t2; BN_ULONG t1,t2;
BN_ULONG c1,c2,c3; BN_ULONG c1,c2,c3;
...@@ -565,7 +569,7 @@ void bn_sqr_comba8(BN_ULONG *r, BN_ULONG *a) ...@@ -565,7 +569,7 @@ void bn_sqr_comba8(BN_ULONG *r, BN_ULONG *a)
r[15]=c1; r[15]=c1;
} }
void bn_sqr_comba4(BN_ULONG *r, BN_ULONG *a) void bn_sqr_comba4(BN_ULONG *r, const BN_ULONG *a)
{ {
BN_ULONG t1,t2; BN_ULONG t1,t2;
BN_ULONG c1,c2,c3; BN_ULONG c1,c2,c3;
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册