crypto/bn/bntest.c:698: error: BUFFER_OVERRUN_L3
  Offset: 15 (⇐ 8 + 7) Size: [0, +oo] by call to `BN_mul`.
Showing all 18 steps of the trace


crypto/bn/bntest.c:664:2: Call
662.   	e=BN_new();
663.   
664.   	BN_rand(c,1024,0,0); /**/
        ^
665.   	for (i=0; i<10; i++)
666.   		{

crypto/bn/bn_rand.c:65:1: Parameter `*rnd->d`
  63.   #include <openssl/rand.h>
  64.   
  65. > int BN_rand(BIGNUM *rnd, int bits, int top, int bottom)
  66.   	{
  67.   	unsigned char *buf=NULL;

crypto/bn/bntest.c:667:3: Call
665.   	for (i=0; i<10; i++)
666.   		{
667.   		BN_rand(a,475+i*10,0,0); /**/
         ^
668.   		BN_rand(b,425+i*10,0,0); /**/
669.   		a->neg=rand_neg();

crypto/bn/bn_rand.c:65:1: Parameter `*rnd->d`
  63.   #include <openssl/rand.h>
  64.   
  65. > int BN_rand(BIGNUM *rnd, int bits, int top, int bottom)
  66.   	{
  67.   	unsigned char *buf=NULL;

crypto/bn/bntest.c:668:3: Call
666.   		{
667.   		BN_rand(a,475+i*10,0,0); /**/
668.   		BN_rand(b,425+i*10,0,0); /**/
         ^
669.   		a->neg=rand_neg();
670.   		b->neg=rand_neg();

crypto/bn/bn_rand.c:65:1: Parameter `*rnd->d`
  63.   #include <openssl/rand.h>
  64.   
  65. > int BN_rand(BIGNUM *rnd, int bits, int top, int bottom)
  66.   	{
  67.   	unsigned char *buf=NULL;

crypto/bn/bntest.c:675:8: Call
673.   				BN_mod_mul(d,a,b,c,ctx);*/ /**/
674.   
675.   		if (!BN_mod_mul(e,a,b,c,ctx))
              ^
676.   			{
677.   			unsigned long l;

crypto/bn/bn_exp.c:66:1: Parameter `*a->d`
  64.   
  65.   /* slow but works */
  66. > int BN_mod_mul(BIGNUM *ret, BIGNUM *a, BIGNUM *b, BIGNUM *m, BN_CTX *ctx)
  67.   	{
  68.   	BIGNUM *t;

crypto/bn/bn_exp.c:77:10: Call
  75.   	t= &(ctx->bn[ctx->tos++]);
  76.   	if (a == b)
  77.   		{ if (!BN_sqr(t,a,ctx)) goto err; }
                 ^
  78.   	else
  79.   		{ if (!BN_mul(t,a,b,ctx)) goto err; }

crypto/bn/bn_sqr.c:65:1: Parameter `*a->d`
    63.   /* r must not be a */
    64.   /* I've just gone over this and it is now %20 faster on x86 - eay - 27 Jun 96 */
    65. > int BN_sqr(BIGNUM *r, BIGNUM *a, BN_CTX *ctx)
    66.   	{
    67.   	int max,al;

crypto/bn/bntest.c:698:3: Call
696.   			BIO_puts(bp,"\n");
697.   			}
698.   		BN_mul(d,a,b,ctx);
         ^
699.   		BN_sub(d,d,e);
700.   		BN_div(a,b,d,c,ctx);

crypto/bn/bn_mul.c:560:1: Parameter `*b->d`
  558.   #endif
  559.   
  560. > int BN_mul(BIGNUM *r, BIGNUM *a, BIGNUM *b, BN_CTX *ctx)
  561.   	{
  562.   	int top,al,bl;

crypto/bn/bn_mul.c:674:4: Call
  672.   			bn_wexpand(t,k*2);
  673.   			bn_wexpand(rr,k*2);
  674.   			bn_mul_recursive(rr->d,a->d,b->d,al,t->d);
            ^
  675.   			}
  676.   		else

crypto/bn/bn_mul.c:74:1: Parameter `*b`
    72.    * a[1]*b[1]
    73.    */
    74. > void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
    75.   	     BN_ULONG *t)
    76.   	{

crypto/bn/bn_mul.c:158:3: Call
    156.   		
    157.   		bn_mul_comba8(r,a,b);
    158.   		bn_mul_comba8(&(r[n2]),&(a[n]),&(b[n]));
             ^
    159.   		}
    160.   	else

crypto/bn/bn_asm.c:489:1: <Length trace>
487.   #endif
488.   
489. > void bn_mul_comba8(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b)
490.   	{
491.   #ifdef BN_LLONG

crypto/bn/bn_asm.c:489:1: Parameter `*b`
      487.   #endif
      488.   
      489. > void bn_mul_comba8(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b)
      490.   	{
      491.   #ifdef BN_LLONG

crypto/bn/bn_asm.c:544:2: Array access: Offset: 15 (⇐ 8 + 7) Size: [0, +oo] by call to `BN_mul` 
      542.   	r[6]=c1;
      543.   	c1=0;
      544.   	mul_add_c(a[0],b[7],c2,c3,c1);
              ^
      545.   	mul_add_c(a[1],b[6],c2,c3,c1);
      546.   	mul_add_c(a[2],b[5],c2,c3,c1);
