crypto/rsa/rsa_eay.c:206: error: BUFFER_OVERRUN_L3
  Offset: [9, +oo] (⇐ [8, +oo] + 1) Size: [0, +oo] by call to `BN_BLINDING_convert`.
Showing all 14 steps of the trace


crypto/rsa/rsa_eay.c:201:6: Call
199.   	if (i <= 0) goto err;
200.   
201.   	if (BN_bin2bn(buf,num,&f) == NULL) goto err;
            ^
202.   
203.   	if ((rsa->flags & RSA_FLAG_BLINDING) && (rsa->blinding == NULL))

crypto/bn/bn_lib.c:595:1: Parameter `*ret->d`
  593.   
  594.   /* ignore negative */
  595. > BIGNUM *BN_bin2bn(const unsigned char *s, int len, BIGNUM *ret)
  596.   	{
  597.   	unsigned int i,m;

crypto/rsa/rsa_eay.c:206:8: Call
204.   		RSA_blinding_on(rsa,ctx);
205.   	if (rsa->flags & RSA_FLAG_BLINDING)
206.   		if (!BN_BLINDING_convert(&f,rsa->blinding,ctx)) goto err;
              ^
207.   
208.   	if (	(rsa->p != NULL) &&

crypto/bn/bn_blind.c:115:1: Parameter `*n->d`
  113.   	}
  114.   
  115. > int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx)
  116.   	{
  117.   	bn_check_top(n);

crypto/bn/bn_blind.c:124:9: Call
  122.   		return(0);
  123.   		}
  124.   	return(BN_mod_mul(n,n,b->A,b->mod,ctx));
                 ^
  125.   	}
  126.   

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:79:10: Call
    77.   		{ if (!BN_sqr(t,a,ctx)) goto err; }
    78.   	else
    79.   		{ if (!BN_mul(t,a,b,ctx)) goto err; }
                   ^
    80.   	if (!BN_mod(ret,t,m,ctx)) goto err;
    81.   	r=1;

crypto/bn/bn_mul.c:560:1: Parameter `*a->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:686:4: Call
      684.   			for (i=b->top; i<k; i++)
      685.   				b->d[i]=0;
      686.   			bn_mul_part_recursive(rr->d,a->d,b->d,al-j,j,t->d);
                ^
      687.   			}
      688.   		rr->top=top;

crypto/bn/bn_mul.c:218:1: Parameter `n`
        216.   /* n+tn is the word length
        217.    * t needs to be n*4 is size, as does r */
        218. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int tn,
        219.   	     int n, BN_ULONG *t)
        220.   	{

crypto/bn/bn_mul.c:236:2: Call
        234.   
        235.   	/* r=(a[0]-a[1])*(b[1]-b[0]) */
        236.   	bn_sub_words(t,      a,      &(a[n]),n); /* + */
                ^
        237.   	bn_sub_words(&(t[n]),b,      &(b[n]),n); /* - */
        238.   

crypto/bn/bn_asm.c:389:1: <Length trace>
387.   #endif
388.   
389. > BN_ULONG bn_sub_words(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n)
390.           {
391.   	BN_ULONG t1,t2;

crypto/bn/bn_asm.c:389:1: Parameter `*b`
          387.   #endif
          388.   
          389. > BN_ULONG bn_sub_words(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n)
          390.           {
          391.   	BN_ULONG t1,t2;

crypto/bn/bn_asm.c:404:15: Array access: Offset: [9, +oo] (⇐ [8, +oo] + 1) Size: [0, +oo] by call to `BN_BLINDING_convert` 
          402.   		if (--n <= 0) break;
          403.   
          404.   		t1=a[1]; t2=b[1];
                               ^
          405.   		r[1]=(t1-t2-c)&BN_MASK2;
          406.   		if (t1 != t2) c=(t1 < t2);
