2 * Copyright (c) 1997 - 2007 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * 3. Neither the name of the Institute nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 * All decoding functions take a pointer `p' to first position in
38 * which to read, from the left, `len' which means the maximum number
39 * of characters we are able to read, `ret' were the value will be
40 * returned and `size' where the number of used bytes is stored.
41 * Either 0 or an error code is returned.
45 der_get_unsigned (const unsigned char *p, size_t len,
46 unsigned *ret, size_t *size)
51 if (len == sizeof(unsigned) + 1 && p[0] == 0)
53 else if (len > sizeof(unsigned))
57 val = val * 256 + *p++;
59 if(size) *size = oldlen;
64 der_get_integer (const unsigned char *p, size_t len,
65 int *ret, size_t *size)
70 if (len > sizeof(int))
74 val = (signed char)*p++;
76 val = val * 256 + *p++;
79 if(size) *size = oldlen;
84 der_get_length (const unsigned char *p, size_t len,
85 size_t *val, size_t *size)
102 *val = ASN1_INDEFINITE;
109 e = der_get_unsigned (p, v, &tmp, &l);
112 if(size) *size = l + 1;
118 der_get_boolean(const unsigned char *p, size_t len, int *data, size_t *size)
131 der_get_general_string (const unsigned char *p, size_t len,
132 heim_general_string *str, size_t *size)
134 const unsigned char *p1;
137 p1 = memchr(p, 0, len);
140 * Allow trailing NULs. We allow this since MIT Kerberos sends
141 * an strings in the NEED_PREAUTH case that includes a
144 while (p1 - p < len && *p1 == '\0')
147 return ASN1_BAD_CHARACTER;
150 return ASN1_BAD_LENGTH;
152 s = malloc (len + 1);
158 if(size) *size = len;
163 der_get_utf8string (const unsigned char *p, size_t len,
164 heim_utf8_string *str, size_t *size)
166 return der_get_general_string(p, len, str, size);
170 der_get_printable_string (const unsigned char *p, size_t len,
171 heim_printable_string *str, size_t *size)
173 return der_get_general_string(p, len, str, size);
177 der_get_ia5_string (const unsigned char *p, size_t len,
178 heim_ia5_string *str, size_t *size)
180 return der_get_general_string(p, len, str, size);
184 der_get_bmp_string (const unsigned char *p, size_t len,
185 heim_bmp_string *data, size_t *size)
190 return ASN1_BAD_FORMAT;
191 data->length = len / 2;
192 if (data->length > UINT_MAX/sizeof(data->data[0]))
194 data->data = malloc(data->length * sizeof(data->data[0]));
195 if (data->data == NULL && data->length != 0)
198 for (i = 0; i < data->length; i++) {
199 data->data[i] = (p[0] << 8) | p[1];
202 if (size) *size = len;
208 der_get_universal_string (const unsigned char *p, size_t len,
209 heim_universal_string *data, size_t *size)
214 return ASN1_BAD_FORMAT;
215 data->length = len / 4;
216 if (data->length > UINT_MAX/sizeof(data->data[0]))
218 data->data = malloc(data->length * sizeof(data->data[0]));
219 if (data->data == NULL && data->length != 0)
222 for (i = 0; i < data->length; i++) {
223 data->data[i] = (p[0] << 24) | (p[1] << 16) | (p[2] << 8) | p[3];
226 if (size) *size = len;
231 der_get_visible_string (const unsigned char *p, size_t len,
232 heim_visible_string *str, size_t *size)
234 return der_get_general_string(p, len, str, size);
238 der_get_octet_string (const unsigned char *p, size_t len,
239 heim_octet_string *data, size_t *size)
242 data->data = malloc(len);
243 if (data->data == NULL && data->length != 0)
245 memcpy (data->data, p, len);
246 if(size) *size = len;
251 der_get_octet_string_ber (const unsigned char *p, size_t len,
252 heim_octet_string *data, size_t *size)
257 unsigned int tag, depth = 0;
258 size_t l, datalen, oldlen = len;
264 e = der_get_tag (p, len, &class, &type, &tag, &l);
266 if (class != ASN1_C_UNIV) {
270 if (type == PRIM && tag == UT_EndOfContent) {
275 if (tag != UT_OctetString) {
282 e = der_get_length (p, len, &datalen, &l);
293 ptr = realloc(data->data, data->length + datalen);
299 memcpy(((unsigned char *)data->data) + data->length, p, datalen);
300 data->length += datalen;
308 return ASN1_INDEF_OVERRUN;
309 if(size) *size = oldlen - len;
320 der_get_heim_integer (const unsigned char *p, size_t len,
321 heim_integer *data, size_t *size)
343 data->data = malloc(data->length);
344 if (data->data == NULL) {
350 q = &((unsigned char*)data->data)[data->length - 1];
351 p += data->length - 1;
352 while (q >= (unsigned char*)data->data) {
367 data->data = malloc(data->length);
368 if (data->data == NULL && data->length != 0) {
374 memcpy(data->data, p, data->length);
382 generalizedtime2time (const char *s, time_t *t)
386 memset(&tm, 0, sizeof(tm));
387 if (sscanf (s, "%04d%02d%02d%02d%02d%02dZ",
388 &tm.tm_year, &tm.tm_mon, &tm.tm_mday, &tm.tm_hour,
389 &tm.tm_min, &tm.tm_sec) != 6) {
390 if (sscanf (s, "%02d%02d%02d%02d%02d%02dZ",
391 &tm.tm_year, &tm.tm_mon, &tm.tm_mday, &tm.tm_hour,
392 &tm.tm_min, &tm.tm_sec) != 6)
393 return ASN1_BAD_TIMEFORMAT;
401 *t = _der_timegm (&tm);
406 der_get_time (const unsigned char *p, size_t len,
407 time_t *data, size_t *size)
412 if (len > len + 1 || len == 0)
413 return ASN1_BAD_LENGTH;
415 times = malloc(len + 1);
418 memcpy(times, p, len);
420 e = generalizedtime2time(times, data);
422 if(size) *size = len;
427 der_get_generalized_time (const unsigned char *p, size_t len,
428 time_t *data, size_t *size)
430 return der_get_time(p, len, data, size);
434 der_get_utctime (const unsigned char *p, size_t len,
435 time_t *data, size_t *size)
437 return der_get_time(p, len, data, size);
441 der_get_oid (const unsigned char *p, size_t len,
442 heim_oid *data, size_t *size)
451 return ASN1_BAD_LENGTH;
453 if (len + 1 > UINT_MAX/sizeof(data->components[0]))
456 data->components = malloc((len + 1) * sizeof(data->components[0]));
457 if (data->components == NULL)
459 data->components[0] = (*p) / 40;
460 data->components[1] = (*p) % 40;
463 for (n = 2; len > 0; ++n) {
468 u1 = u * 128 + (*p++ % 128);
469 /* check that we don't overflow the element */
475 } while (len > 0 && p[-1] & 0x80);
476 data->components[n] = u;
478 if (n > 2 && p[-1] & 0x80) {
489 der_get_tag (const unsigned char *p, size_t len,
490 Der_class *class, Der_type *type,
491 unsigned int *tag, size_t *size)
496 *class = (Der_class)(((*p) >> 6) & 0x03);
497 *type = (Der_type)(((*p) >> 5) & 0x01);
501 unsigned int continuation;
507 continuation = *p & 128;
508 tag1 = *tag * 128 + (*p % 128);
509 /* check that we don't overflow the tag */
511 return ASN1_OVERFLOW;
514 } while(continuation);
516 if(size) *size = ret;
521 der_match_tag (const unsigned char *p, size_t len,
522 Der_class class, Der_type type,
523 unsigned int tag, size_t *size)
528 e = der_match_tag2(p, len, class, &thistype, tag, size);
530 if (thistype != type) return ASN1_BAD_ID;
535 der_match_tag2 (const unsigned char *p, size_t len,
536 Der_class class, Der_type *type,
537 unsigned int tag, size_t *size)
541 unsigned int thistag;
544 e = der_get_tag (p, len, &thisclass, type, &thistag, &l);
546 if (class != thisclass)
549 return ASN1_MISPLACED_FIELD;
551 return ASN1_MISSING_FIELD;
557 der_match_tag_and_length (const unsigned char *p, size_t len,
558 Der_class class, Der_type *type, unsigned int tag,
559 size_t *length_ret, size_t *size)
564 e = der_match_tag2 (p, len, class, type, tag, &l);
569 e = der_get_length (p, len, length_ret, &l);
571 if(size) *size = ret + l;
578 * Old versions of DCE was based on a very early beta of the MIT code,
579 * which used MAVROS for ASN.1 encoding. MAVROS had the interesting
580 * feature that it encoded data in the forward direction, which has
581 * it's problems, since you have no idea how long the data will be
582 * until after you're done. MAVROS solved this by reserving one byte
583 * for length, and later, if the actual length was longer, it reverted
584 * to indefinite, BER style, lengths. The version of MAVROS used by
585 * the DCE people could apparently generate correct X.509 DER encodings, and
586 * did this by making space for the length after encoding, but
587 * unfortunately this feature wasn't used with Kerberos.
591 _heim_fix_dce(size_t reallen, size_t *len)
593 if(reallen == ASN1_INDEFINITE)
602 der_get_bit_string (const unsigned char *p, size_t len,
603 heim_bit_string *data, size_t *size)
608 return ASN1_BAD_FORMAT;
609 if (len - 1 == 0 && p[0] != 0)
610 return ASN1_BAD_FORMAT;
611 /* check if any of the three upper bits are set
612 * any of them will cause a interger overrun */
613 if ((len - 1) >> (sizeof(len) * 8 - 3))
615 data->length = (len - 1) * 8;
616 data->data = malloc(len - 1);
617 if (data->data == NULL && (len - 1) != 0)
619 /* copy data is there is data to copy */
621 memcpy (data->data, p + 1, len - 1);
622 data->length -= p[0];
624 if(size) *size = len;