apps/speed.c:800: error: BUFFER_OVERRUN_L3
  Offset: [-3, +oo] (⇐ [-2, +oo] + -1) Size: 8193 by call to `SHA1`.
Showing all 9 steps of the trace


apps/speed.c:375:28: Array declaration
373.   #endif
374.   
375.   	if ((buf=(unsigned char *)Malloc((int)BUFSIZE)) == NULL)
                                  ^
376.   		{
377.   		BIO_printf(bio_err,"out of memory\n");

apps/speed.c:375:7: Assignment
373.   #endif
374.   
375.   	if ((buf=(unsigned char *)Malloc((int)BUFSIZE)) == NULL)
             ^
376.   		{
377.   		BIO_printf(bio_err,"out of memory\n");

apps/speed.c:800:5: Call
798.   			Time_F(START);
799.   			for (count=0,run=1; COND(c[D_SHA1][j]); count++)
800.   				SHA1(buf,(unsigned long)lengths[j],&(sha[0]));
           ^
801.   			d=Time_F(STOP);
802.   			BIO_printf(bio_err,"%ld %s's in %.2fs\n",

crypto/sha/sha1_one.c:63:1: Parameter `*d`
  61.   #include "sha.h"
  62.   
  63. > unsigned char *SHA1(unsigned char *d, unsigned long n, unsigned char *md)
  64.   	{
  65.   	SHA_CTX c;

crypto/sha/sha1_one.c:70:2: Call
  68.   	if (md == NULL) md=m;
  69.   	SHA1_Init(&c);
  70.   	SHA1_Update(&c,d,n);
         ^
  71.   	SHA1_Final(md,&c);
  72.   	memset(&c,0,sizeof(c));

crypto/sha/sha1dgst.c:126:1: <Length trace>
124.   	}
125.   
126. > void SHA1_Update(SHA_CTX *c, register unsigned char *data,
127.   	     unsigned long len)
128.   	{

crypto/sha/sha1dgst.c:126:1: Parameter `*data`
    124.   	}
    125.   
    126. > void SHA1_Update(SHA_CTX *c, register unsigned char *data,
    127.   	     unsigned long len)
    128.   	{

crypto/sha/sha1dgst.c:253:2: Assignment
    251.   	for (sw=0; sw < ew; sw++)
    252.   		{ M_c2nl(data,l); p[sw]=l; }
    253.   	M_c2nl_p(data,l,ec);
            ^
    254.   	p[sw]=l;
    255.   	}

crypto/sha/sha1dgst.c:253:2: Array access: Offset: [-3, +oo] (⇐ [-2, +oo] + -1) Size: 8193 by call to `SHA1` 
    251.   	for (sw=0; sw < ew; sw++)
    252.   		{ M_c2nl(data,l); p[sw]=l; }
    253.   	M_c2nl_p(data,l,ec);
            ^
    254.   	p[sw]=l;
    255.   	}
