2 * Copyright (c) 1997 - 2006 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
40 decode_primitive (const char *typename
, const char *name
, const char *forwstr
)
44 "e = decode_%s(p, len, %s, &l);\n"
51 "e = der_get_%s(p, len, %s, &l);\n"
52 "if(e) %s;\np += l; len -= l; ret += l;\n",
60 is_primitive_type(int type
)
68 case TGeneralizedTime
:
73 case TPrintableString
:
76 case TUniversalString
:
86 find_tag (const Type
*t
,
87 Der_class
*cl
, Der_type
*ty
, unsigned *tag
)
101 errx(1, "Cannot have recursive CHOICE");
105 *tag
= UT_Enumerated
;
110 *tag
= UT_GeneralString
;
112 case TGeneralizedTime
:
115 *tag
= UT_GeneralizedTime
;
140 *tag
= UT_OctetString
;
142 case TPrintableString
:
145 *tag
= UT_PrintableString
;
160 *cl
= t
->tag
.tagclass
;
161 *ty
= is_primitive_type(t
->subtype
->type
) ? PRIM
: CONS
;
162 *tag
= t
->tag
.tagvalue
;
165 if ((t
->symbol
->stype
== Stype
&& t
->symbol
->type
== NULL
)
166 || t
->symbol
->stype
== SUndefined
) {
167 error_message("%s is imported or still undefined, "
168 " can't generate tag checking data in CHOICE "
169 "without this information",
173 find_tag(t
->symbol
->type
, cl
, ty
, tag
);
183 *tag
= UT_UTF8String
;
190 case TUniversalString
:
193 *tag
= UT_UniversalString
;
198 *tag
= UT_VisibleString
;
206 decode_type (const char *name
, const Type
*t
, int optional
,
207 const char *forwstr
, const char *tmpstr
)
213 "%s = calloc(1, sizeof(*%s));\n"
214 "if (%s == NULL) %s;\n",
215 name
, name
, name
, forwstr
);
217 "e = decode_%s(p, len, %s, &l);\n",
218 t
->symbol
->gen_name
, name
);
225 "p += l; len -= l; ret += l;\n"
233 "p += l; len -= l; ret += l;\n");
240 asprintf(&s
, "(int*)%s", name
);
242 errx (1, "out of memory");
243 decode_primitive ("integer", s
, forwstr
);
245 } else if (t
->range
== NULL
) {
246 decode_primitive ("heim_integer", name
, forwstr
);
247 } else if (t
->range
->min
== INT_MIN
&& t
->range
->max
== INT_MAX
) {
248 decode_primitive ("integer", name
, forwstr
);
249 } else if (t
->range
->min
== 0 && t
->range
->max
== UINT_MAX
) {
250 decode_primitive ("unsigned", name
, forwstr
);
251 } else if (t
->range
->min
== 0 && t
->range
->max
== INT_MAX
) {
252 decode_primitive ("unsigned", name
, forwstr
);
254 errx(1, "%s: unsupported range %d -> %d",
255 name
, t
->range
->min
, t
->range
->max
);
258 decode_primitive ("boolean", name
, forwstr
);
261 decode_primitive ("enumerated", name
, forwstr
);
264 decode_primitive ("octet_string", name
, forwstr
);
270 if (ASN1_TAILQ_EMPTY(t
->members
)) {
271 decode_primitive ("bit_string", name
, forwstr
);
275 "if (len < 1) return ASN1_OVERRUN;\n"
276 "p++; len--; ret++;\n");
279 "if (len < 1) break;\n");
280 ASN1_TAILQ_FOREACH(m
, t
->members
, members
) {
281 while (m
->val
/ 8 > pos
/ 8) {
283 "p++; len--; ret++;\n"
284 "if (len < 1) break;\n");
288 "(%s)->%s = (*p >> %d) & 1;\n",
289 name
, m
->gen_name
, 7 - m
->val
% 8);
294 "p += len; ret += len;\n");
300 if (t
->members
== NULL
)
303 ASN1_TAILQ_FOREACH(m
, t
->members
, members
) {
309 asprintf (&s
, "%s(%s)->%s", m
->optional
? "" : "&",
313 decode_type (s
, m
->type
, m
->optional
, forwstr
, m
->gen_name
);
323 if(t
->members
== NULL
)
326 fprintf(codefile
, "{\n");
327 fprintf(codefile
, "unsigned int members = 0;\n");
328 fprintf(codefile
, "while(len > 0) {\n");
333 "e = der_get_tag (p, len, &class, &type, &tag, NULL);\n"
334 "if(e) %s;\n", forwstr
);
335 fprintf(codefile
, "switch (MAKE_TAG(class, type, tag)) {\n");
337 ASN1_TAILQ_FOREACH(m
, t
->members
, members
) {
340 assert(m
->type
->type
== TTag
);
342 fprintf(codefile
, "case MAKE_TAG(%s, %s, %s):\n",
343 classname(m
->type
->tag
.tagclass
),
344 is_primitive_type(m
->type
->subtype
->type
) ? "PRIM" : "CONS",
345 valuename(m
->type
->tag
.tagclass
, m
->type
->tag
.tagvalue
));
347 asprintf (&s
, "%s(%s)->%s", m
->optional
? "" : "&", name
, m
->gen_name
);
352 "%s = calloc(1, sizeof(*%s));\n"
353 "if (%s == NULL) { e = ENOMEM; %s; }\n",
355 decode_type (s
, m
->type
, 0, forwstr
, m
->gen_name
);
358 fprintf(codefile
, "members |= (1 << %d);\n", memno
);
360 fprintf(codefile
, "break;\n");
364 "return ASN1_MISPLACED_FIELD;\n"
366 fprintf(codefile
, "}\n");
367 fprintf(codefile
, "}\n");
369 ASN1_TAILQ_FOREACH(m
, t
->members
, members
) {
372 asprintf (&s
, "%s->%s", name
, m
->gen_name
);
375 fprintf(codefile
, "if((members & (1 << %d)) == 0)\n", memno
);
377 fprintf(codefile
, "%s = NULL;\n", s
);
379 gen_assign_defval(s
, m
->defval
);
381 fprintf(codefile
, "return ASN1_MISSING_FIELD;\n");
385 fprintf(codefile
, "}\n");
395 "size_t %s_origlen = len;\n"
396 "size_t %s_oldret = ret;\n"
400 "(%s)->val = NULL;\n"
401 "while(ret < %s_origlen) {\n"
402 "%s_tmp = realloc((%s)->val, "
403 " sizeof(*((%s)->val)) * ((%s)->len + 1));\n"
404 "if (%s_tmp == NULL) { %s; }\n"
405 "(%s)->val = %s_tmp;\n",
406 tmpstr
, tmpstr
, tmpstr
,
413 asprintf (&n
, "&(%s)->val[(%s)->len]", name
, name
);
416 asprintf (&sname
, "%s_s_of", tmpstr
);
419 decode_type (n
, t
->subtype
, 0, forwstr
, sname
);
422 "len = %s_origlen - ret;\n"
424 "ret += %s_oldret;\n"
432 case TGeneralizedTime
:
433 decode_primitive ("generalized_time", name
, forwstr
);
436 decode_primitive ("general_string", name
, forwstr
);
443 "size_t %s_datalen, %s_oldlen;\n",
448 fprintf(codefile
, "e = der_match_tag_and_length(p, len, %s, %s, %s, "
449 "&%s_datalen, &l);\n",
450 classname(t
->tag
.tagclass
),
451 is_primitive_type(t
->subtype
->type
) ? "PRIM" : "CONS",
452 valuename(t
->tag
.tagclass
, t
->tag
.tagvalue
),
459 "%s = calloc(1, sizeof(*%s));\n"
460 "if (%s == NULL) { e = ENOMEM; %s; }\n",
461 name
, name
, name
, name
, forwstr
);
463 fprintf(codefile
, "if(e) %s;\n", forwstr
);
466 "p += l; len -= l; ret += l;\n"
467 "%s_oldlen = len;\n",
471 "if((dce_fix = _heim_fix_dce(%s_datalen, &len)) < 0)\n"
472 "{ e = ASN1_BAD_FORMAT; %s; }\n",
476 "if (%s_datalen > len) { e = ASN1_OVERRUN; %s; }\n"
477 "len = %s_datalen;\n", tmpstr
, forwstr
, tmpstr
);
478 asprintf (&tname
, "%s_Tag", tmpstr
);
481 decode_type (name
, t
->subtype
, 0, forwstr
, tname
);
485 "e = der_match_tag_and_length (p, len, "
486 "(Der_class)0,(Der_type)0, UT_EndOfContent, "
487 "&%s_datalen, &l);\n"
488 "if(e) %s;\np += l; len -= l; ret += l;\n"
489 "} else \n", tmpstr
, forwstr
);
491 "len = %s_oldlen - %s_datalen;\n",
502 Member
*m
, *have_ellipsis
= NULL
;
503 const char *els
= "";
505 if (t
->members
== NULL
)
508 ASN1_TAILQ_FOREACH(m
, t
->members
, members
) {
509 const Type
*tt
= m
->type
;
520 find_tag(tt
, &cl
, &ty
, &tag
);
523 "%sif (der_match_tag(p, len, %s, %s, %s, NULL) == 0) {\n",
526 ty
? "CONS" : "PRIM",
528 asprintf (&s
, "%s(%s)->u.%s", m
->optional
? "" : "&",
532 decode_type (s
, m
->type
, m
->optional
, forwstr
, m
->gen_name
);
534 "(%s)->element = %s;\n",
544 "(%s)->u.%s.data = calloc(1, len);\n"
545 "if ((%s)->u.%s.data == NULL) {\n"
548 "(%s)->u.%s.length = len;\n"
549 "memcpy((%s)->u.%s.data, p, len);\n"
550 "(%s)->element = %s;\n"
555 name
, have_ellipsis
->gen_name
,
556 name
, have_ellipsis
->gen_name
,
558 name
, have_ellipsis
->gen_name
,
559 name
, have_ellipsis
->gen_name
,
560 name
, have_ellipsis
->label
);
564 "e = ASN1_PARSE_ERROR;\n"
572 decode_primitive ("utctime", name
, forwstr
);
575 decode_primitive ("utf8string", name
, forwstr
);
577 case TPrintableString
:
578 decode_primitive ("printable_string", name
, forwstr
);
581 decode_primitive ("ia5_string", name
, forwstr
);
584 decode_primitive ("bmp_string", name
, forwstr
);
586 case TUniversalString
:
587 decode_primitive ("universal_string", name
, forwstr
);
590 decode_primitive ("visible_string", name
, forwstr
);
593 fprintf (codefile
, "/* NULL */\n");
596 decode_primitive ("oid", name
, forwstr
);
605 generate_type_decode (const Symbol
*s
)
607 int preserve
= preserve_type(s
->name
) ? TRUE
: FALSE
;
611 "decode_%s(const unsigned char *, size_t, %s *, size_t *);\n",
612 s
->gen_name
, s
->gen_name
);
614 fprintf (codefile
, "int\n"
615 "decode_%s(const unsigned char *p,"
616 " size_t len, %s *data, size_t *size)\n"
618 s
->gen_name
, s
->gen_name
);
620 switch (s
->type
->type
) {
625 case TGeneralizedTime
:
628 case TPrintableString
:
631 case TUniversalString
:
649 fprintf (codefile
, "const unsigned char *begin = p;\n");
651 fprintf (codefile
, "\n");
652 fprintf (codefile
, "memset(data, 0, sizeof(*data));\n"); /* hack to avoid `unused variable' */
654 decode_type ("data", s
->type
, 0, "goto fail", "Top");
657 "data->_save.data = calloc(1, ret);\n"
658 "if (data->_save.data == NULL) { \n"
659 "e = ENOMEM; goto fail; \n"
661 "data->_save.length = ret;\n"
662 "memcpy(data->_save.data, begin, ret);\n");
664 "if(size) *size = ret;\n"
675 fprintf (codefile
, "}\n\n");