crypto/asn1/a_time.c:193: error: BUFFER_OVERRUN_L2
  Offset: [6, 9] Size: 9.
Showing all 7 steps of the trace


crypto/asn1/a_time.c:40:5: <Offset trace>
38.       static const int mdays[12] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
39.       char *a;
40.       int n, i, i2, l, o, min_l = 11, strict = 0, end = 6, btz = 5, md;
          ^
41.       struct tm tmp;
42.   

crypto/asn1/a_time.c:40:5: Assignment
38.       static const int mdays[12] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
39.       char *a;
40.       int n, i, i2, l, o, min_l = 11, strict = 0, end = 6, btz = 5, md;
          ^
41.       struct tm tmp;
42.   

crypto/asn1/a_time.c:192:18: Assignment
190.                   goto err;
191.               n = (n * 10) + a[o] - '0';
192.               i2 = (d->type == V_ASN1_UTCTIME) ? i + 1 : i;
                        ^
193.               if ((n < min[i2]) || (n > max[i2]))
194.                   goto err;

crypto/asn1/a_time.c:192:13: Assignment
190.                   goto err;
191.               n = (n * 10) + a[o] - '0';
192.               i2 = (d->type == V_ASN1_UTCTIME) ? i + 1 : i;
                   ^
193.               if ((n < min[i2]) || (n > max[i2]))
194.                   goto err;

crypto/asn1/a_time.c:36:5: <Length trace>
34.   int asn1_time_to_tm(struct tm *tm, const ASN1_TIME *d)
35.   {
36.       static const int min[9] = { 0, 0, 1, 1, 0, 0, 0, 0, 0 };
          ^
37.       static const int max[9] = { 99, 99, 12, 31, 23, 59, 59, 12, 59 };
38.       static const int mdays[12] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };

crypto/asn1/a_time.c:36:5: Array declaration
34.   int asn1_time_to_tm(struct tm *tm, const ASN1_TIME *d)
35.   {
36.       static const int min[9] = { 0, 0, 1, 1, 0, 0, 0, 0, 0 };
          ^
37.       static const int max[9] = { 99, 99, 12, 31, 23, 59, 59, 12, 59 };
38.       static const int mdays[12] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };

crypto/asn1/a_time.c:193:22: Array access: Offset: [6, 9] Size: 9
191.               n = (n * 10) + a[o] - '0';
192.               i2 = (d->type == V_ASN1_UTCTIME) ? i + 1 : i;
193.               if ((n < min[i2]) || (n > max[i2]))
                            ^
194.                   goto err;
195.               /* if tm is NULL, no need to adjust */
