crypto/bn/bn_exp.c:460: error: BUFFER_OVERRUN_L3
  Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, +oo] by call to `BN_mod_mul`.
Showing all 14 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: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:177:2: Call
      175.   	/* There will not be a carry */
      176.   
      177.   	bn_sqr_words(tmp,a,n);
              ^
      178.   
      179.   	bn_add_words(r,r,tmp,max);

crypto/bn/bn_asm.c:197:1: <Length trace>
195.   	} 
196.   
197. > void bn_sqr_words(BN_ULONG *r, BN_ULONG *a, int n)
198.           {
199.   	bn_check_num(n);

crypto/bn/bn_asm.c:197:1: Parameter `*a`
        195.   	} 
        196.   
        197. > void bn_sqr_words(BN_ULONG *r, BN_ULONG *a, int n)
        198.           {
        199.   	bn_check_num(n);

crypto/bn/bn_asm.c:212:3: Array access: Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, +oo] by call to `BN_mod_mul` 
        210.   		if (--n == 0) break;
        211.   
        212.   		sqr64(r[6],r[7],a[3]);
                 ^
        213.   		if (--n == 0) break;
        214.   
