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


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

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

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

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

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

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/bn_sqr.c:123:9: Call
    121.   			if (al == j)
    122.   				{
    123.   				if (bn_wexpand(a,k*2) == NULL) return(0);
                   ^
    124.   				if (bn_wexpand(tmp,k*2) == NULL) return(0);
    125.   				bn_sqr_recursive(rr->d,a->d,al,tmp->d);

crypto/bn/bn_lib.c:344:1: <Length trace>
342.   	}
343.   
344. > BIGNUM *bn_expand2(BIGNUM *b, int words)
345.   	{
346.   	BN_ULONG *A,*B,*a;

crypto/bn/bn_lib.c:344:1: Parameter `*b->d`
      342.   	}
      343.   
      344. > BIGNUM *bn_expand2(BIGNUM *b, int words)
      345.   	{
      346.   	BN_ULONG *A,*B,*a;

crypto/bn/bn_lib.c:367:3: Assignment
      365.   memset(A,0x5c,sizeof(BN_ULONG)*(words+1));
      366.   #if 1
      367.   		B=b->d;
               ^
      368.   		/* Check if the previous number needs to be copied */
      369.   		if (B != NULL)

crypto/bn/bn_lib.c:377:43: Array access: Offset: [7, +oo] (⇐ [0, +oo] + 7) Size: [0, +oo] by call to `BN_mod_mul` 
      375.   				{
      376.   				A[0]=B[0]; A[1]=B[1]; A[2]=B[2]; A[3]=B[3];
      377.   				A[4]=B[4]; A[5]=B[5]; A[6]=B[6]; A[7]=B[7];
                                                       ^
      378.   				A+=8;
      379.   				B+=8;
