crypto/bn/bntest.c:685: error: BUFFER_OVERRUN_L3
  Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, +oo] by call to `BN_mod_mul`.
Showing all 16 steps of the trace


crypto/bn/bntest.c:674:2: Call
672.   	e=BN_new();
673.   
674.   	BN_rand(c,1024,0,0); /**/
        ^
675.   	for (i=0; i<10; i++)
676.   		{

crypto/bn/bn_rand.c:65:1: Parameter `*rnd->d`
  63.   #include <openssl/rand.h>
  64.   
  65. > int BN_rand(BIGNUM *rnd, int bits, int top, int bottom)
  66.   	{
  67.   	unsigned char *buf=NULL;

crypto/bn/bntest.c:677:3: Call
675.   	for (i=0; i<10; i++)
676.   		{
677.   		BN_rand(a,475+i*10,0,0); /**/
         ^
678.   		BN_rand(b,425+i*10,0,0); /**/
679.   		a->neg=rand_neg();

crypto/bn/bn_rand.c:65:1: Parameter `*rnd->d`
  63.   #include <openssl/rand.h>
  64.   
  65. > int BN_rand(BIGNUM *rnd, int bits, int top, int bottom)
  66.   	{
  67.   	unsigned char *buf=NULL;

crypto/bn/bntest.c:678:3: Call
676.   		{
677.   		BN_rand(a,475+i*10,0,0); /**/
678.   		BN_rand(b,425+i*10,0,0); /**/
         ^
679.   		a->neg=rand_neg();
680.   		b->neg=rand_neg();

crypto/bn/bn_rand.c:65:1: Parameter `*rnd->d`
  63.   #include <openssl/rand.h>
  64.   
  65. > int BN_rand(BIGNUM *rnd, int bits, int top, int bottom)
  66.   	{
  67.   	unsigned char *buf=NULL;

crypto/bn/bntest.c:685:8: Call
683.   				BN_mod_mul(d,a,b,c,ctx);*/ /**/
684.   
685.   		if (!BN_mod_mul(e,a,b,c,ctx))
              ^
686.   			{
687.   			unsigned long l;

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, const 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:198:1: <Length trace>
196.   	} 
197.   
198. > void bn_sqr_words(BN_ULONG *r, BN_ULONG *a, int n)
199.           {
200.   	bn_check_num(n);

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

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