crypto/dsa/dsa_gen.c:224: error: BUFFER_OVERRUN_L3
  Offset: 15 (⇐ 8 + 7) Size: [0, +oo] by call to `BN_mod_exp_mont`.
Showing all 20 steps of the trace


crypto/dsa/dsa_gen.c:219:2: Call
217.   
218.   	BN_set_word(test,h);
219.   	BN_MONT_CTX_set(mont,p,ctx);
        ^
220.   
221.   	for (;;)

crypto/bn/bn_mont.c:301:1: Parameter `*mont->RR.d`
  299.   	}
  300.   
  301. > int BN_MONT_CTX_set(BN_MONT_CTX *mont, const BIGNUM *mod, BN_CTX *ctx)
  302.   	{
  303.   	BIGNUM Ri,*R;

crypto/bn/bn_mont.c:319:3: Call
  317.   
  318.   		mont->ri=(BN_num_bits(mod)+(BN_BITS2-1))/BN_BITS2*BN_BITS2;
  319.   		BN_zero(R);
           ^
  320.   		BN_set_bit(R,BN_BITS2);
  321.   		/* I was bad, this modification of a passed variable was

crypto/bn/bn_lib.c:567:1: Parameter `*a->d`
    565.   	}
    566.   
    567. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    568.   	{
    569.   	int i,n;

crypto/bn/bn_mont.c:320:3: Call
  318.   		mont->ri=(BN_num_bits(mod)+(BN_BITS2-1))/BN_BITS2*BN_BITS2;
  319.   		BN_zero(R);
  320.   		BN_set_bit(R,BN_BITS2);
           ^
  321.   		/* I was bad, this modification of a passed variable was
  322.   		 * breaking the multithreaded stuff :-(

crypto/bn/bn_lib.c:709:1: Parameter `*a->d`
    707.   	}
    708.   
    709. > int BN_set_bit(BIGNUM *a, int n)
    710.   	{
    711.   	int i,j,k;

crypto/dsa/dsa_gen.c:224:3: Call
222.   		{
223.   		/* g=test^r0%p */
224.   		BN_mod_exp_mont(g,test,r0,p,ctx,mont);
         ^
225.   		if (!BN_is_one(g)) break;
226.   		BN_add(test,test,BN_value_one());

crypto/bn/bn_exp.c:301:1: Parameter `*in_mont->RR.d`
  299.   
  300.   /* #ifdef MONT_MUL_MOD */
  301. > int BN_mod_exp_mont(BIGNUM *rr, BIGNUM *a, const BIGNUM *p,
  302.   		    const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
  303.   	{

crypto/bn/bn_exp.c:351:7: Call
  349.   	else
  350.   		aa=a;
  351.   	if (!BN_to_montgomery(&(val[0]),aa,mont,ctx)) goto err; /* 1 */
               ^
  352.   	if (!BN_mod_mul_montgomery(d,&(val[0]),&(val[0]),mont,ctx)) goto err; /* 2 */
  353.   

crypto/bn/bn_mont.c:71:1: Parameter `*b->d`
    69.   #define MONT_WORD
    70.   
    71. > int BN_mod_mul_montgomery(BIGNUM *r, BIGNUM *a, BIGNUM *b,
    72.   			  BN_MONT_CTX *mont, BN_CTX *ctx)
    73.   	{

crypto/bn/bn_exp.c:379:14: Call
  377.   	wend=0;		/* The bottom bit of the window */
  378.   
  379.           if (!BN_to_montgomery(r,BN_value_one(),mont,ctx)) goto err;
                      ^
  380.   	for (;;)
  381.   		{

crypto/bn/bn_mont.c:71:1: Parameter `*b->d`
    69.   #define MONT_WORD
    70.   
    71. > int BN_mod_mul_montgomery(BIGNUM *r, BIGNUM *a, BIGNUM *b,
    72.   			  BN_MONT_CTX *mont, BN_CTX *ctx)
    73.   	{

crypto/bn/bn_mont.c:98:8: Call
    96.   	else
    97.   		{
    98.   		if (!BN_mul(tmp,a,b,ctx)) goto err;
                  ^
    99.   		}
    100.   	/* reduce from aRR to aR */

crypto/bn/bn_mul.c:560:1: Parameter `*b->d`
      558.   #endif
      559.   
      560. > int BN_mul(BIGNUM *r, BIGNUM *a, BIGNUM *b, BN_CTX *ctx)
      561.   	{
      562.   	int top,al,bl;

crypto/bn/bn_mul.c:674:4: Call
      672.   			bn_wexpand(t,k*2);
      673.   			bn_wexpand(rr,k*2);
      674.   			bn_mul_recursive(rr->d,a->d,b->d,al,t->d);
                ^
      675.   			}
      676.   		else

crypto/bn/bn_mul.c:74:1: Parameter `*b`
        72.    * a[1]*b[1]
        73.    */
        74. > void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
        75.   	     BN_ULONG *t)
        76.   	{

crypto/bn/bn_mul.c:158:3: Call
        156.   		
        157.   		bn_mul_comba8(r,a,b);
        158.   		bn_mul_comba8(&(r[n2]),&(a[n]),&(b[n]));
                 ^
        159.   		}
        160.   	else

crypto/bn/bn_asm.c:490:1: <Length trace>
488.   #endif
489.   
490. > void bn_mul_comba8(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b)
491.   	{
492.   #ifdef BN_LLONG

crypto/bn/bn_asm.c:490:1: Parameter `*b`
          488.   #endif
          489.   
          490. > void bn_mul_comba8(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b)
          491.   	{
          492.   #ifdef BN_LLONG

crypto/bn/bn_asm.c:545:2: Array access: Offset: 15 (⇐ 8 + 7) Size: [0, +oo] by call to `BN_mod_exp_mont` 
          543.   	r[6]=c1;
          544.   	c1=0;
          545.   	mul_add_c(a[0],b[7],c2,c3,c1);
                  ^
          546.   	mul_add_c(a[1],b[6],c2,c3,c1);
          547.   	mul_add_c(a[2],b[5],c2,c3,c1);
