crypto/bn/bn_exp.c:211: error: BUFFER_OVERRUN_L3
  Offset: [3, +oo] (⇐ [1, +oo] + 2) Size: [0, +oo] by call to `BN_mod_mul_reciprocal`.
Showing all 16 steps of the trace


crypto/bn/bn_exp.c:210:7: Call
208.   	ts=1;
209.   
210.   	if (!BN_mod(&(val[0]),a,m,ctx)) goto err;		/* 1 */
             ^
211.   	if (!BN_mod_mul_reciprocal(aa,&(val[0]),&(val[0]),&recp,ctx))
212.   		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:211:7: Call
209.   
210.   	if (!BN_mod(&(val[0]),a,m,ctx)) goto err;		/* 1 */
211.   	if (!BN_mod_mul_reciprocal(aa,&(val[0]),&(val[0]),&recp,ctx))
             ^
212.   		goto err;				/* 2 */
213.   

crypto/bn/bn_recp.c:103:1: Parameter `*x->d`
  101.   	}
  102.   
  103. > int BN_mod_mul_reciprocal(BIGNUM *r, BIGNUM *x, BIGNUM *y, BN_RECP_CTX *recp,
  104.   	     BN_CTX *ctx)
  105.   	{

crypto/bn/bn_recp.c:113:11: Call
  111.   		{
  112.   		if (x == y)
  113.   			{ if (!BN_sqr(a,x,ctx)) goto err; }
                   ^
  114.   		else
  115.   			{ if (!BN_mul(a,x,y,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:130:5: Call
    128.   				{
    129.   				if (bn_wexpand(tmp,max) == NULL) return(0);
    130.   				bn_sqr_normal(rr->d,a->d,al,tmp->d);
               ^
    131.   				}
    132.   			}

crypto/bn/bn_sqr.c:146:1: Parameter `*a`
      144.   
      145.   /* tmp must have 2*n words */
      146. > void bn_sqr_normal(BN_ULONG *r, BN_ULONG *a, int n, BN_ULONG *tmp)
      147.   	{
      148.   	int i,j,max;

crypto/bn/bn_sqr.c:152:2: Assignment
      150.   
      151.   	max=n*2;
      152.   	ap=a;
              ^
      153.   	rp=r;
      154.   	rp[0]=rp[max-1]=0;

crypto/bn/bn_sqr.c:168:3: Assignment
      166.   		{
      167.   		j--;
      168.   		ap++;
               ^
      169.   		rp[j]=bn_mul_add_words(rp,ap,j,ap[-1]);
      170.   		rp+=2;

crypto/bn/bn_sqr.c:169:9: Call
      167.   		j--;
      168.   		ap++;
      169.   		rp[j]=bn_mul_add_words(rp,ap,j,ap[-1]);
                     ^
      170.   		rp+=2;
      171.   		}

crypto/bn/bn_asm.c:144:1: <Length trace>
142.   #else
143.   
144. > BN_ULONG bn_mul_add_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w)
145.   	{
146.   	BN_ULONG c=0;

crypto/bn/bn_asm.c:144:1: Parameter `*ap`
        142.   #else
        143.   
        144. > BN_ULONG bn_mul_add_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w)
        145.   	{
        146.   	BN_ULONG c=0;

crypto/bn/bn_asm.c:161:3: Array access: Offset: [3, +oo] (⇐ [1, +oo] + 2) Size: [0, +oo] by call to `BN_mod_mul_reciprocal` 
        159.   		mul_add(rp[1],ap[1],bl,bh,c);
        160.   		if (--num == 0) break;
        161.   		mul_add(rp[2],ap[2],bl,bh,c);
                 ^
        162.   		if (--num == 0) break;
        163.   		mul_add(rp[3],ap[3],bl,bh,c);
