crypto/bn/bntest.c:468: error: BUFFER_OVERRUN_L1
  Offset: [7, +oo] (⇐ [0, +oo] + 7) Size: 4 by call to `BN_div`.
Showing all 11 steps of the trace


crypto/bn/bntest.c:469:3: Call
467.   			}
468.   		BN_div(&d,&e,&c,&a,&ctx);
469.   		BN_sub(&d,&d,&b);
         ^
470.   		if(!BN_is_zero(&d) || !BN_is_zero(&e))
471.   		    {

crypto/bn/bn_add.c:258:1: Parameter `a->top`
  256.   	}
  257.   
  258. > int BN_sub(BIGNUM *r, BIGNUM *a, BIGNUM *b)
  259.   	{
  260.   	int max;

crypto/bn/bntest.c:468:3: Call
466.   			BIO_puts(bp,"\n");
467.   			}
468.   		BN_div(&d,&e,&c,&a,&ctx);
         ^
469.   		BN_sub(&d,&d,&b);
470.   		if(!BN_is_zero(&d) || !BN_is_zero(&e))

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

crypto/bn/bn_div.c:142:19: Call
  140.   		if (rm != NULL)
  141.   			{ if (BN_copy(rm,num) == NULL) return(0); }
  142.   		if (dv != NULL) BN_zero(dv);
                           ^
  143.   		return(1);
  144.   		}

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

crypto/bn/bn_lib.c:570:6: Call
    568.   	{
    569.   	int i,n;
    570.   	if (bn_expand(a,sizeof(BN_ULONG)*8) == NULL) return(0);
                ^
    571.   
    572.   	n=sizeof(BN_ULONG)/BN_BYTES;

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

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

crypto/bn/bn_lib.c:466:3: Assignment
      464.   		/* Now need to zero any data between b->top and b->max */
      465.   
      466.   		A= &(b->d[b->top]);
               ^
      467.   		for (i=(b->max - b->top)>>3; i>0; i--,A+=8)
      468.   			{

crypto/bn/bn_lib.c:470:28: Array access: Offset: [7, +oo] (⇐ [0, +oo] + 7) Size: 4 by call to `BN_div` 
      468.   			{
      469.   			A[0]=0; A[1]=0; A[2]=0; A[3]=0;
      470.   			A[4]=0; A[5]=0; A[6]=0; A[7]=0;
                                        ^
      471.   			}
      472.   		for (i=(b->max - b->top)&7; i>0; i--,A++)
