crypto/bn/bn_exp.c:463: error: BUFFER_OVERRUN_L3
  Offset: 7 Size: [0, +oo] by call to `BN_mod_mul`.
Showing all 12 steps of the trace


crypto/bn/bn_exp.c:462:7: Call
460.   	BN_init(&(val[0]));
461.   	ts=1;
462.   	if (!BN_mod(&(val[0]),a,m,ctx)) goto err;		/* 1 */
             ^
463.   	if (!BN_mod_mul(d,&(val[0]),&(val[0]),m,ctx))
464.   		goto err;				/* 2 */

crypto/bn/bn_div.c:287:1: Parameter `*rem->d`
  285.   
  286.   /* rem != m */
  287. > int BN_mod(BIGNUM *rem, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx)
  288.   	{
  289.   #if 0 /* The old slow way */

crypto/bn/bn_div.c:313:9: Call
  311.   	return(1);
  312.   #else
  313.   	return(BN_div(NULL,rem,m,d,ctx));
                 ^
  314.   #endif
  315.   	}

crypto/bn/bn_div.c:121:1: Parameter `*rm->d`
    119.   #else
    120.   
    121. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
    122.   	   BN_CTX *ctx)
    123.   	{

crypto/bn/bn_exp.c:463:7: Call
461.   	ts=1;
462.   	if (!BN_mod(&(val[0]),a,m,ctx)) goto err;		/* 1 */
463.   	if (!BN_mod_mul(d,&(val[0]),&(val[0]),m,ctx))
             ^
464.   		goto err;				/* 2 */
465.   

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, const 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/bn_sqr.c:103:3: Call
    101.   		bn_sqr_normal(rr->d,a->d,8,t);
    102.   #else
    103.   		bn_sqr_comba8(rr->d,a->d);
             ^
    104.   #endif
    105.   		}

crypto/bn/bn_asm.c:644:1: <Length trace>
642.   	}
643.   
644. > void bn_sqr_comba8(BN_ULONG *r, BN_ULONG *a)
645.   	{
646.   #ifdef BN_LLONG

crypto/bn/bn_asm.c:644:1: Parameter `*a`
      642.   	}
      643.   
      644. > void bn_sqr_comba8(BN_ULONG *r, BN_ULONG *a)
      645.   	{
      646.   #ifdef BN_LLONG

crypto/bn/bn_asm.c:687:2: Array access: Offset: 7 Size: [0, +oo] by call to `BN_mod_mul` 
      685.   	r[6]=c1;
      686.   	c1=0;
      687.   	sqr_add_c2(a,7,0,c2,c3,c1);
              ^
      688.   	sqr_add_c2(a,6,1,c2,c3,c1);
      689.   	sqr_add_c2(a,5,2,c2,c3,c1);
