summaryrefslogtreecommitdiff
path: root/src/lib/libcrypto/bn/bn_mul.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/lib/libcrypto/bn/bn_mul.c')
-rw-r--r--src/lib/libcrypto/bn/bn_mul.c12
1 files changed, 9 insertions, 3 deletions
diff --git a/src/lib/libcrypto/bn/bn_mul.c b/src/lib/libcrypto/bn/bn_mul.c
index 41ea925b8d..7bffc9c16a 100644
--- a/src/lib/libcrypto/bn/bn_mul.c
+++ b/src/lib/libcrypto/bn/bn_mul.c
@@ -408,16 +408,22 @@ void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
408 return; 408 return;
409 } 409 }
410# endif 410# endif
411 if (n2 == 8) 411 /* Only call bn_mul_comba 8 if n2 == 8 and the
412 * two arrays are complete [steve]
413 */
414 if (n2 == 8 && dna == 0 && dnb == 0)
412 { 415 {
413 bn_mul_comba8(r,a,b); 416 bn_mul_comba8(r,a,b);
414 return; 417 return;
415 } 418 }
416# endif /* BN_MUL_COMBA */ 419# endif /* BN_MUL_COMBA */
420 /* Else do normal multiply */
417 if (n2 < BN_MUL_RECURSIVE_SIZE_NORMAL) 421 if (n2 < BN_MUL_RECURSIVE_SIZE_NORMAL)
418 { 422 {
419 /* This should not happen */ 423 bn_mul_normal(r,a,n2+dna,b,n2+dnb);
420 bn_mul_normal(r,a,n2,b,n2); 424 if ((dna + dnb) < 0)
425 memset(&r[2*n2 + dna + dnb], 0,
426 sizeof(BN_ULONG) * -(dna + dnb));
421 return; 427 return;
422 } 428 }
423 /* r=(a[0]-a[1])*(b[1]-b[0]) */ 429 /* r=(a[0]-a[1])*(b[1]-b[0]) */