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
39 * All decoding functions take a pointer `p' to first position in
40 * which to read, from the left, `len' which means the maximum number
41 * of characters we are able to read, `ret' were the value will be
42 * returned and `size' where the number of used bytes is stored.
43 * Either 0 or an error code is returned.
47 der_get_unsigned (const unsigned char *p, size_t len,
48 unsigned *ret, size_t *size)
53 if (len == sizeof(unsigned) + 1 && p[0] == 0)
55 else if (len > sizeof(unsigned))
59 val = val * 256 + *p++;
61 if(size) *size = oldlen;
66 der_get_integer (const unsigned char *p, size_t len,
67 int *ret, size_t *size)
72 if (len > sizeof(int))
76 val = (signed char)*p++;
78 val = val * 256 + *p++;
81 if(size) *size = oldlen;
86 der_get_length (const unsigned char *p, size_t len,
87 size_t *val, size_t *size)
104 *val = ASN1_INDEFINITE;
111 e = der_get_unsigned (p, v, &tmp, &l);
114 if(size) *size = l + 1;
120 der_get_boolean(const unsigned char *p, size_t len, int *data, size_t *size)
133 der_get_general_string (const unsigned char *p, size_t len,
134 heim_general_string *str, size_t *size)
136 const unsigned char *p1;
139 p1 = memchr(p, 0, len);
142 * Allow trailing NULs. We allow this since MIT Kerberos sends
143 * an strings in the NEED_PREAUTH case that includes a
146 while (p1 - p < len && *p1 == '\0')
149 return ASN1_BAD_CHARACTER;
152 return ASN1_BAD_LENGTH;
154 s = malloc (len + 1);
160 if(size) *size = len;
165 der_get_utf8string (const unsigned char *p, size_t len,
166 heim_utf8_string *str, size_t *size)
168 return der_get_general_string(p, len, str, size);
172 der_get_printable_string (const unsigned char *p, size_t len,
173 heim_printable_string *str, size_t *size)
175 return der_get_general_string(p, len, str, size);
179 der_get_ia5_string (const unsigned char *p, size_t len,
180 heim_ia5_string *str, size_t *size)
182 return der_get_general_string(p, len, str, size);
186 der_get_bmp_string (const unsigned char *p, size_t len,
187 heim_bmp_string *data, size_t *size)
192 return ASN1_BAD_FORMAT;
193 data->length = len / 2;
194 if (data->length > UINT_MAX/sizeof(data->data[0]))
196 data->data = malloc(data->length * sizeof(data->data[0]));
197 if (data->data == NULL && data->length != 0)
200 for (i = 0; i < data->length; i++) {
201 data->data[i] = (p[0] << 8) | p[1];
204 if (size) *size = len;
210 der_get_universal_string (const unsigned char *p, size_t len,
211 heim_universal_string *data, size_t *size)
216 return ASN1_BAD_FORMAT;
217 data->length = len / 4;
218 if (data->length > UINT_MAX/sizeof(data->data[0]))
220 data->data = malloc(data->length * sizeof(data->data[0]));
221 if (data->data == NULL && data->length != 0)
224 for (i = 0; i < data->length; i++) {
225 data->data[i] = (p[0] << 24) | (p[1] << 16) | (p[2] << 8) | p[3];
228 if (size) *size = len;
233 der_get_visible_string (const unsigned char *p, size_t len,
234 heim_visible_string *str, size_t *size)
236 return der_get_general_string(p, len, str, size);
240 der_get_octet_string (const unsigned char *p, size_t len,
241 heim_octet_string *data, size_t *size)
244 data->data = malloc(len);
245 if (data->data == NULL && data->length != 0)
247 memcpy (data->data, p, len);
248 if(size) *size = len;
253 der_get_octet_string_ber (const unsigned char *p, size_t len,
254 heim_octet_string *data, size_t *size)
259 unsigned int tag, depth = 0;
260 size_t l, datalen, oldlen = len;
266 e = der_get_tag (p, len, &class, &type, &tag, &l);
268 if (class != ASN1_C_UNIV) {
272 if (type == PRIM && tag == UT_EndOfContent) {
277 if (tag != UT_OctetString) {
284 e = der_get_length (p, len, &datalen, &l);
295 ptr = realloc(data->data, data->length + datalen);
301 memcpy(((unsigned char *)data->data) + data->length, p, datalen);
302 data->length += datalen;
310 return ASN1_INDEF_OVERRUN;
311 if(size) *size = oldlen - len;
322 der_get_heim_integer (const unsigned char *p, size_t len,
323 heim_integer *data, size_t *size)
345 data->data = malloc(data->length);
346 if (data->data == NULL) {
352 q = &((unsigned char*)data->data)[data->length - 1];
353 p += data->length - 1;
354 while (q >= (unsigned char*)data->data) {
369 data->data = malloc(data->length);
370 if (data->data == NULL && data->length != 0) {
376 memcpy(data->data, p, data->length);
384 generalizedtime2time (const char *s, time_t *t)
388 memset(&tm, 0, sizeof(tm));
389 if (sscanf (s, "%04d%02d%02d%02d%02d%02dZ",
390 &tm.tm_year, &tm.tm_mon, &tm.tm_mday, &tm.tm_hour,
391 &tm.tm_min, &tm.tm_sec) != 6) {
392 if (sscanf (s, "%02d%02d%02d%02d%02d%02dZ",
393 &tm.tm_year, &tm.tm_mon, &tm.tm_mday, &tm.tm_hour,
394 &tm.tm_min, &tm.tm_sec) != 6)
395 return ASN1_BAD_TIMEFORMAT;
403 *t = _der_timegm (&tm);
408 der_get_time (const unsigned char *p, size_t len,
409 time_t *data, size_t *size)
414 if (len > len + 1 || len == 0)
415 return ASN1_BAD_LENGTH;
417 times = malloc(len + 1);
420 memcpy(times, p, len);
422 e = generalizedtime2time(times, data);
424 if(size) *size = len;
429 der_get_generalized_time (const unsigned char *p, size_t len,
430 time_t *data, size_t *size)
432 return der_get_time(p, len, data, size);
436 der_get_utctime (const unsigned char *p, size_t len,
437 time_t *data, size_t *size)
439 return der_get_time(p, len, data, size);
443 der_get_oid (const unsigned char *p, size_t len,
444 heim_oid *data, size_t *size)
453 return ASN1_BAD_LENGTH;
455 if (len + 1 > UINT_MAX/sizeof(data->components[0]))
458 data->components = malloc((len + 1) * sizeof(data->components[0]));
459 if (data->components == NULL)
461 data->components[0] = (*p) / 40;
462 data->components[1] = (*p) % 40;
465 for (n = 2; len > 0; ++n) {
470 u1 = u * 128 + (*p++ % 128);
471 /* check that we don't overflow the element */
477 } while (len > 0 && p[-1] & 0x80);
478 data->components[n] = u;
480 if (n > 2 && p[-1] & 0x80) {
491 der_get_tag (const unsigned char *p, size_t len,
492 Der_class *class, Der_type *type,
493 unsigned int *tag, size_t *size)
498 *class = (Der_class)(((*p) >> 6) & 0x03);
499 *type = (Der_type)(((*p) >> 5) & 0x01);
503 unsigned int continuation;
509 continuation = *p & 128;
510 tag1 = *tag * 128 + (*p % 128);
511 /* check that we don't overflow the tag */
513 return ASN1_OVERFLOW;
516 } while(continuation);
518 if(size) *size = ret;
523 der_match_tag (const unsigned char *p, size_t len,
524 Der_class class, Der_type type,
525 unsigned int tag, size_t *size)
530 e = der_match_tag2(p, len, class, &thistype, tag, size);
532 if (thistype != type) return ASN1_BAD_ID;
537 der_match_tag2 (const unsigned char *p, size_t len,
538 Der_class class, Der_type *type,
539 unsigned int tag, size_t *size)
543 unsigned int thistag;
546 e = der_get_tag (p, len, &thisclass, type, &thistag, &l);
548 if (class != thisclass)
551 return ASN1_MISPLACED_FIELD;
553 return ASN1_MISSING_FIELD;
559 der_match_tag_and_length (const unsigned char *p, size_t len,
560 Der_class class, Der_type *type, unsigned int tag,
561 size_t *length_ret, size_t *size)
566 e = der_match_tag2 (p, len, class, type, tag, &l);
571 e = der_get_length (p, len, length_ret, &l);
576 if(size) *size = ret;
583 * Old versions of DCE was based on a very early beta of the MIT code,
584 * which used MAVROS for ASN.1 encoding. MAVROS had the interesting
585 * feature that it encoded data in the forward direction, which has
586 * it's problems, since you have no idea how long the data will be
587 * until after you're done. MAVROS solved this by reserving one byte
588 * for length, and later, if the actual length was longer, it reverted
589 * to indefinite, BER style, lengths. The version of MAVROS used by
590 * the DCE people could apparently generate correct X.509 DER encodings, and
591 * did this by making space for the length after encoding, but
592 * unfortunately this feature wasn't used with Kerberos.
596 _heim_fix_dce(size_t reallen, size_t *len)
598 if(reallen == ASN1_INDEFINITE)
607 der_get_bit_string (const unsigned char *p, size_t len,
608 heim_bit_string *data, size_t *size)
613 return ASN1_BAD_FORMAT;
614 if (len - 1 == 0 && p[0] != 0)
615 return ASN1_BAD_FORMAT;
616 /* check if any of the three upper bits are set
617 * any of them will cause a interger overrun */
618 if ((len - 1) >> (sizeof(len) * 8 - 3))
620 data->length = (len - 1) * 8;
621 data->data = malloc(len - 1);
622 if (data->data == NULL && (len - 1) != 0)
624 /* copy data is there is data to copy */
626 memcpy (data->data, p + 1, len - 1);
627 data->length -= p[0];
629 if(size) *size = len;