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

libavutil/sha1.c:97:10: <Offset trace>
95.     R1(c, d, e, a, b, 18);
96.     R1(b, c, d, e, a, 19);
97.     for (i = 20; i < 40; i += 5) {
             ^
98.         R2(a, b, c, d, e, 0 + i);
99.         R2(e, a, b, c, d, 1 + i);

libavutil/sha1.c:97:10: Assignment
95.     R1(c, d, e, a, b, 18);
96.     R1(b, c, d, e, a, 19);
97.     for (i = 20; i < 40; i += 5) {
             ^
98.         R2(a, b, c, d, e, 0 + i);
99.         R2(e, a, b, c, d, 1 + i);

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. {
50.     uint32_t block[80];

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. {
50.     uint32_t block[80];

libavutil/sha1.c:116:9: Array access: Offset: [64, 83] Size: 80
114.         R4(d, e, a, b, c, 2 + i);
115.         R4(c, d, e, a, b, 3 + i);
116.         R4(b, c, d, e, a, 4 + i);
             ^
117.     }
118. #endif
