libavutil/sha1.c:89: error: Buffer Overrun L2
  Offset: [64, 83] Size: 80.

libavutil/sha1.c:82:9: <Offset trace>
80.     }
81.     R0(a,b,c,d,e,15); R1(e,a,b,c,d,16); R1(d,e,a,b,c,17); R1(c,d,e,a,b,18); R1(b,c,d,e,a,19);
82.     for(i=20; i<40; i+=5){
            ^
83.         R2(a,b,c,d,e,0+i); R2(e,a,b,c,d,1+i); R2(d,e,a,b,c,2+i); R2(c,d,e,a,b,3+i); R2(b,c,d,e,a,4+i);
84.     }

libavutil/sha1.c:82:9: Assignment
80.     }
81.     R0(a,b,c,d,e,15); R1(e,a,b,c,d,16); R1(d,e,a,b,c,17); R1(c,d,e,a,b,18); R1(b,c,d,e,a,19);
82.     for(i=20; i<40; i+=5){
            ^
83.         R2(a,b,c,d,e,0+i); R2(e,a,b,c,d,1+i); R2(d,e,a,b,c,2+i); R2(c,d,e,a,b,3+i); R2(b,c,d,e,a,4+i);
84.     }

libavutil/sha1.c:48:1: <Length trace>
46. /* Hash a single 512-bit block. This is the core of the algorithm. */
47. 
48. static void transform(uint32_t state[5], const uint8_t buffer[64]){
    ^
49.     uint32_t block[80];
50.     unsigned int i, a, b, c, d, e;

libavutil/sha1.c:48:1: Array declaration
46. /* Hash a single 512-bit block. This is the core of the algorithm. */
47. 
48. static void transform(uint32_t state[5], const uint8_t buffer[64]){
    ^
49.     uint32_t block[80];
50.     unsigned int i, a, b, c, d, e;

libavutil/sha1.c:89:85: Array access: Offset: [64, 83] Size: 80
87.     }
88.     for(; i<80; i+=5){
89.         R4(a,b,c,d,e,0+i); R4(e,a,b,c,d,1+i); R4(d,e,a,b,c,2+i); R4(c,d,e,a,b,3+i); R4(b,c,d,e,a,4+i);
                                                                                        ^
90.     }
91. #endif
