crypto/bn/bn_mont.c:297: error: BUFFER_OVERRUN_L1
  Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: 2 by call to `BN_mod_inverse`.
Showing all 9 steps of the trace


crypto/bn/bn_mont.c:273:1: Array declaration
271.   	}
272.   
273. > int BN_MONT_CTX_set(BN_MONT_CTX *mont, const BIGNUM *mod, BN_CTX *ctx)
274.   	{
275.   	BIGNUM Ri,*R;

crypto/bn/bn_mont.c:292:3: Assignment
290.   		buf[0]=mod->d[0]; /* tmod = N mod word size */
291.   		buf[1]=0;
292.   		tmod.d=buf;
         ^
293.   		tmod.top=1;
294.   		tmod.dmax=2;

crypto/bn/bn_mont.c:297:8: Call
295.   		tmod.neg=mod->neg;
296.   							/* Ri = R^-1 mod N*/
297.   		if ((BN_mod_inverse(&Ri,R,&tmod,ctx)) == NULL)
              ^
298.   			goto err;
299.   		BN_lshift(&Ri,&Ri,BN_BITS2);		/* R*Ri */

crypto/bn/bn_gcd.c:147:1: Parameter `*n->d`
  145.   
  146.   /* solves ax == 1 (mod n) */
  147. > BIGNUM *BN_mod_inverse(BIGNUM *in,
  148.   	const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)
  149.   	{

crypto/bn/bn_gcd.c:175:6: Call
  173.   	BN_one(Y);
  174.   	if (BN_copy(A,a) == NULL) goto err;
  175.   	if (BN_copy(B,n) == NULL) goto err;
              ^
  176.   	sign=1;
  177.   

crypto/bn/bn_lib.c:525:1: <Length trace>
523.   	}
524.   
525. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
526.   	{
527.   	int i;

crypto/bn/bn_lib.c:525:1: Parameter `*b->d`
    523.   	}
    524.   
    525. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
    526.   	{
    527.   	int i;

crypto/bn/bn_lib.c:538:2: Assignment
    536.   #if 1
    537.   	A=a->d;
    538.   	B=b->d;
            ^
    539.   	for (i=b->top>>2; i>0; i--,A+=4,B+=4)
    540.   		{

crypto/bn/bn_lib.c:542:33: Array access: Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: 2 by call to `BN_mod_inverse` 
    540.   		{
    541.   		BN_ULONG a0,a1,a2,a3;
    542.   		a0=B[0]; a1=B[1]; a2=B[2]; a3=B[3];
                                           ^
    543.   		A[0]=a0; A[1]=a1; A[2]=a2; A[3]=a3;
    544.   		}
