}
#if 0
-int bn_mul_high(r,a,b,low,words)
-BIGNUM *r,*a,*b,*low;
-int words;
+int bn_mul_high(BIGNUM *r, BIGNUM *a, BIGNUM *b, BIGNUM *low, int words)
{
int i;
BIGNUM t1,t2,t3,h,ah,al,bh,bl,m,s0,s1;
t3.top=(t2.top > words)?words:t2.top;
t3.neg=t2.neg;
t3.max=t3.top;
-// BN_print_fp(stdout,&s1); printf(" s1\n");
-// BN_print_fp(stdout,&t2); printf(" middle value\n");
-// BN_print_fp(stdout,&t3); printf(" low middle value\n");
+/* BN_print_fp(stdout,&s1); printf(" s1\n"); */
+/* BN_print_fp(stdout,&t2); printf(" middle value\n"); */
+/* BN_print_fp(stdout,&t3); printf(" low middle value\n"); */
BN_sub(&t1,&s1,&t3);
if (t1.neg)
{
-//printf("neg fixup\n"); //BN_print_fp(stdout,&t1); printf(" before\n");
+/*printf("neg fixup\n"); BN_print_fp(stdout,&t1); printf(" before\n"); */
BN_lshift(&t2,BN_value_one(),words*32);
BN_add(&t1,&t2,&t1);
BN_mask_bits(&t1,words*32);
-// BN_print_fp(stdout,&t1); printf(" after\n");
+/* BN_print_fp(stdout,&t1); printf(" after\n"); */
}
/* al*bl == high(al*bl)<<words+s0 */
BN_lshift(&t1,&t1,words*32);
BN_free(&m); BN_free(&h);
}
-int BN_mod_mul_montgomery(r,a,b,mont,ctx)
-BIGNUM *r,*a,*b;
-BN_MONT_CTX *mont;
-BN_CTX *ctx;
+int BN_mod_mul_montgomery(BIGNUM *r, BIGNUM *a, BIGNUM *b, BN_MONT_CTX *mont,
+ BN_CTX *ctx)
{
BIGNUM *tmp;
return(0);
}
-int BN_from_montgomery(r,a,mont,ctx)
-BIGNUM *r;
-BIGNUM *a;
-BN_MONT_CTX *mont;
-BN_CTX *ctx;
+int BN_from_montgomery(BIGNUM *r, BIGNUM *a, BN_MONT_CTX *mont, BN_CTX *ctx)
{
BIGNUM z1;
BIGNUM *t1,*t2;
return(0);
}
-int BN_MONT_CTX_set(mont,mod,ctx)
-BN_MONT_CTX *mont;
-BIGNUM *mod;
-BN_CTX *ctx;
+int BN_MONT_CTX_set(BN_MONT_CTX *mont, BIGNUM *mod, BN_CTX *ctx)
{
BIGNUM *Ri=NULL,*R=NULL;