generic-library/openssl
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Make sure to print the BN counting (BN_COUNT) to stderr instead of

Browse Source 
stdout.  bc gets so confused by bean counts.
This commit is contained in:
Richard Levitte 2000-11-16 22:42:39 +00:00
parent afb83c45e6
commit 67d93e6f49
1 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
crypto/bn/bn_mul.c
View File

@ -82,7 +82,7 @@ void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
BN_ULONG ln,lo,*p; BN_ULONG ln,lo,*p;
# ifdef BN_COUNT # ifdef BN_COUNT
printf(" bn_mul_recursive %d * %d\n",n2,n2); fprintf(stderr," bn_mul_recursive %d * %d\n",n2,n2);
# endif # endif
# ifdef BN_MUL_COMBA # ifdef BN_MUL_COMBA
# if 0 # if 0
@ -228,7 +228,7 @@ void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int tn,
BN_ULONG ln,lo,*p; BN_ULONG ln,lo,*p;
# ifdef BN_COUNT # ifdef BN_COUNT
printf(" bn_mul_part_recursive %d * %d\n",tn+n,tn+n); fprintf(stderr," bn_mul_part_recursive %d * %d\n",tn+n,tn+n);
# endif # endif
if (n < 8) if (n < 8)
{ {
@ -397,7 +397,7 @@ void bn_mul_low_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
int n=n2/2; int n=n2/2;
# ifdef BN_COUNT # ifdef BN_COUNT
printf(" bn_mul_low_recursive %d * %d\n",n2,n2); fprintf(stderr," bn_mul_low_recursive %d * %d\n",n2,n2);
# endif # endif
bn_mul_recursive(r,a,b,n,&(t[0])); bn_mul_recursive(r,a,b,n,&(t[0]));
@ -431,7 +431,7 @@ void bn_mul_high(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, BN_ULONG *l, int n2,
BN_ULONG ll,lc,*lp,*mp; BN_ULONG ll,lc,*lp,*mp;
# ifdef BN_COUNT # ifdef BN_COUNT
printf(" bn_mul_high %d * %d\n",n2,n2); fprintf(stderr," bn_mul_high %d * %d\n",n2,n2);
# endif # endif
n=n2/2; n=n2/2;
@ -623,7 +623,7 @@ int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
BIGNUM *free_a = NULL, *free_b = NULL; BIGNUM *free_a = NULL, *free_b = NULL;
#ifdef BN_COUNT #ifdef BN_COUNT
printf("BN_mul %d * %d\n",a->top,b->top); fprintf(stderr,"BN_mul %d * %d\n",a->top,b->top);
#endif #endif
bn_check_top(a); bn_check_top(a);
@ -750,7 +750,7 @@ void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
BN_ULONG *rr; BN_ULONG *rr;
#ifdef BN_COUNT #ifdef BN_COUNT
printf(" bn_mul_normal %d * %d\n",na,nb); fprintf(stderr," bn_mul_normal %d * %d\n",na,nb);
#endif #endif
if (na < nb) if (na < nb)
@ -784,7 +784,7 @@ void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
void bn_mul_low_normal(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n) void bn_mul_low_normal(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n)
{ {
#ifdef BN_COUNT #ifdef BN_COUNT
printf(" bn_mul_low_normal %d * %d\n",n,n); fprintf(stderr," bn_mul_low_normal %d * %d\n",n,n);
#endif #endif
bn_mul_words(r,a,n,b[0]); bn_mul_words(r,a,n,b[0]);