ssl/s3_srvr.c:1376: error: BUFFER_OVERRUN_L3
  Offset: [4, +oo] (⇐ [1, +oo] + 3) Size: [0, +oo] by call to `DH_compute_key`.
Showing all 18 steps of the trace


ssl/s3_srvr.c:1369:7: Call
1367.   			}
1368.   
1369.   		pub=BN_bin2bn(p,i,NULL);
              ^
1370.   		if (pub == NULL)
1371.   			{

crypto/bn/bn_lib.c:574:1: Parameter `*ret->d`
  572.   
  573.   /* ignore negative */
  574. > BIGNUM *BN_bin2bn(const unsigned char *s, int len, BIGNUM *ret)
  575.   	{
  576.   	unsigned int i,m;

ssl/s3_srvr.c:1376:5: Call
1374.   			}
1375.   
1376.   		i=DH_compute_key(p,pub,dh_srvr);
            ^
1377.   
1378.   		if (i <= 0)

crypto/dh/dh_key.c:121:1: Parameter `*pub_key->d`
  119.   	}
  120.   
  121. > int DH_compute_key(unsigned char *key, BIGNUM *pub_key, DH *dh)
  122.   	{
  123.   	BN_CTX ctx;

crypto/dh/dh_key.c:144:7: Call
  142.   
  143.   	mont=(BN_MONT_CTX *)dh->method_mont_p;
  144.   	if (!BN_mod_exp_mont(tmp,pub_key,dh->priv_key,dh->p,&ctx,mont))
               ^
  145.   		{
  146.   		DHerr(DH_F_DH_COMPUTE_KEY,ERR_R_BN_LIB);

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

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

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

crypto/bn/bn_mont.c:93:8: Call
      91.   			tmp->top--;
      92.   #else
      93.   		if (!BN_sqr(tmp,a,ctx)) goto err;
                   ^
      94.   #endif
      95.   		}

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:112:4: Call
        110.   			{
        111.   			BN_ULONG t[BN_SQR_RECURSIVE_SIZE_NORMAL*2];
        112.   			bn_sqr_normal(rr->d,a->d,al,t);
                  ^
        113.   			}
        114.   		else

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:152:2: Assignment
          150.   
          151.   	max=n*2;
          152.   	ap=a;
                  ^
          153.   	rp=r;
          154.   	rp[0]=rp[max-1]=0;

crypto/bn/bn_sqr.c:168:3: Assignment
          166.   		{
          167.   		j--;
          168.   		ap++;
                   ^
          169.   		rp[j]=bn_mul_add_words(rp,ap,j,ap[-1]);
          170.   		rp+=2;

crypto/bn/bn_sqr.c:169:9: Call
          167.   		j--;
          168.   		ap++;
          169.   		rp[j]=bn_mul_add_words(rp,ap,j,ap[-1]);
                         ^
          170.   		rp+=2;
          171.   		}

crypto/bn/bn_asm.c:143:1: <Length trace>
141.   #else
142.   
143. > BN_ULONG bn_mul_add_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w)
144.   	{
145.   	BN_ULONG c=0;

crypto/bn/bn_asm.c:143:1: Parameter `*ap`
            141.   #else
            142.   
            143. > BN_ULONG bn_mul_add_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w)
            144.   	{
            145.   	BN_ULONG c=0;

crypto/bn/bn_asm.c:162:3: Array access: Offset: [4, +oo] (⇐ [1, +oo] + 3) Size: [0, +oo] by call to `DH_compute_key` 
            160.   		mul_add(rp[2],ap[2],bl,bh,c);
            161.   		if (--num == 0) break;
            162.   		mul_add(rp[3],ap[3],bl,bh,c);
                     ^
            163.   		if (--num == 0) break;
            164.   		ap+=4;
