| 1 |
/* |
| 2 |
* Copyright (c) 1997 - 2006 Kungliga Tekniska Högskolan |
| 3 |
* (Royal Institute of Technology, Stockholm, Sweden). |
| 4 |
* All rights reserved. |
| 5 |
* |
| 6 |
* Redistribution and use in source and binary forms, with or without |
| 7 |
* modification, are permitted provided that the following conditions |
| 8 |
* are met: |
| 9 |
* |
| 10 |
* 1. Redistributions of source code must retain the above copyright |
| 11 |
* notice, this list of conditions and the following disclaimer. |
| 12 |
* |
| 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. |
| 16 |
* |
| 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. |
| 20 |
* |
| 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 |
| 31 |
* SUCH DAMAGE. |
| 32 |
*/ |
| 33 |
|
| 34 |
#include "gen_locl.h" |
| 35 |
#include "lex.h" |
| 36 |
|
| 37 |
RCSID("$Id$"); |
| 38 |
|
| 39 |
static void |
| 40 |
decode_primitive (const char *typename, const char *name, const char *forwstr) |
| 41 |
{ |
| 42 |
#if 0 |
| 43 |
fprintf (codefile, |
| 44 |
"e = decode_%s(p, len, %s, &l);\n" |
| 45 |
"%s;\n", |
| 46 |
typename, |
| 47 |
name, |
| 48 |
forwstr); |
| 49 |
#else |
| 50 |
fprintf (codefile, |
| 51 |
"e = der_get_%s(p, len, %s, &l);\n" |
| 52 |
"if(e) %s;\np += l; len -= l; ret += l;\n", |
| 53 |
typename, |
| 54 |
name, |
| 55 |
forwstr); |
| 56 |
#endif |
| 57 |
} |
| 58 |
|
| 59 |
static void |
| 60 |
find_tag (const Type *t, |
| 61 |
Der_class *cl, Der_type *ty, unsigned *tag) |
| 62 |
{ |
| 63 |
switch (t->type) { |
| 64 |
case TBitString: |
| 65 |
*cl = ASN1_C_UNIV; |
| 66 |
*ty = PRIM; |
| 67 |
*tag = UT_BitString; |
| 68 |
break; |
| 69 |
case TBoolean: |
| 70 |
*cl = ASN1_C_UNIV; |
| 71 |
*ty = PRIM; |
| 72 |
*tag = UT_Boolean; |
| 73 |
break; |
| 74 |
case TChoice: |
| 75 |
errx(1, "Cannot have recursive CHOICE"); |
| 76 |
case TEnumerated: |
| 77 |
*cl = ASN1_C_UNIV; |
| 78 |
*ty = PRIM; |
| 79 |
*tag = UT_Enumerated; |
| 80 |
break; |
| 81 |
case TGeneralString: |
| 82 |
*cl = ASN1_C_UNIV; |
| 83 |
*ty = PRIM; |
| 84 |
*tag = UT_GeneralString; |
| 85 |
break; |
| 86 |
case TTeletexString: |
| 87 |
*cl = ASN1_C_UNIV; |
| 88 |
*ty = PRIM; |
| 89 |
*tag = UT_TeletexString; |
| 90 |
break; |
| 91 |
case TGeneralizedTime: |
| 92 |
*cl = ASN1_C_UNIV; |
| 93 |
*ty = PRIM; |
| 94 |
*tag = UT_GeneralizedTime; |
| 95 |
break; |
| 96 |
case TIA5String: |
| 97 |
*cl = ASN1_C_UNIV; |
| 98 |
*ty = PRIM; |
| 99 |
*tag = UT_IA5String; |
| 100 |
break; |
| 101 |
case TInteger: |
| 102 |
*cl = ASN1_C_UNIV; |
| 103 |
*ty = PRIM; |
| 104 |
*tag = UT_Integer; |
| 105 |
break; |
| 106 |
case TNull: |
| 107 |
*cl = ASN1_C_UNIV; |
| 108 |
*ty = PRIM; |
| 109 |
*tag = UT_Null; |
| 110 |
break; |
| 111 |
case TOID: |
| 112 |
*cl = ASN1_C_UNIV; |
| 113 |
*ty = PRIM; |
| 114 |
*tag = UT_OID; |
| 115 |
break; |
| 116 |
case TOctetString: |
| 117 |
*cl = ASN1_C_UNIV; |
| 118 |
*ty = PRIM; |
| 119 |
*tag = UT_OctetString; |
| 120 |
break; |
| 121 |
case TPrintableString: |
| 122 |
*cl = ASN1_C_UNIV; |
| 123 |
*ty = PRIM; |
| 124 |
*tag = UT_PrintableString; |
| 125 |
break; |
| 126 |
case TSequence: |
| 127 |
case TSequenceOf: |
| 128 |
*cl = ASN1_C_UNIV; |
| 129 |
*ty = CONS; |
| 130 |
*tag = UT_Sequence; |
| 131 |
break; |
| 132 |
case TSet: |
| 133 |
case TSetOf: |
| 134 |
*cl = ASN1_C_UNIV; |
| 135 |
*ty = CONS; |
| 136 |
*tag = UT_Set; |
| 137 |
break; |
| 138 |
case TTag: |
| 139 |
*cl = t->tag.tagclass; |
| 140 |
*ty = is_primitive_type(t->subtype->type) ? PRIM : CONS; |
| 141 |
*tag = t->tag.tagvalue; |
| 142 |
break; |
| 143 |
case TType: |
| 144 |
if ((t->symbol->stype == Stype && t->symbol->type == NULL) |
| 145 |
|| t->symbol->stype == SUndefined) { |
| 146 |
lex_error_message("%s is imported or still undefined, " |
| 147 |
" can't generate tag checking data in CHOICE " |
| 148 |
"without this information", |
| 149 |
t->symbol->name); |
| 150 |
exit(1); |
| 151 |
} |
| 152 |
find_tag(t->symbol->type, cl, ty, tag); |
| 153 |
return; |
| 154 |
case TUTCTime: |
| 155 |
*cl = ASN1_C_UNIV; |
| 156 |
*ty = PRIM; |
| 157 |
*tag = UT_UTCTime; |
| 158 |
break; |
| 159 |
case TUTF8String: |
| 160 |
*cl = ASN1_C_UNIV; |
| 161 |
*ty = PRIM; |
| 162 |
*tag = UT_UTF8String; |
| 163 |
break; |
| 164 |
case TBMPString: |
| 165 |
*cl = ASN1_C_UNIV; |
| 166 |
*ty = PRIM; |
| 167 |
*tag = UT_BMPString; |
| 168 |
break; |
| 169 |
case TUniversalString: |
| 170 |
*cl = ASN1_C_UNIV; |
| 171 |
*ty = PRIM; |
| 172 |
*tag = UT_UniversalString; |
| 173 |
break; |
| 174 |
case TVisibleString: |
| 175 |
*cl = ASN1_C_UNIV; |
| 176 |
*ty = PRIM; |
| 177 |
*tag = UT_VisibleString; |
| 178 |
break; |
| 179 |
default: |
| 180 |
abort(); |
| 181 |
} |
| 182 |
} |
| 183 |
|
| 184 |
static void |
| 185 |
range_check(const char *name, |
| 186 |
const char *length, |
| 187 |
const char *forwstr, |
| 188 |
struct range *r) |
| 189 |
{ |
| 190 |
if (r->min == r->max + 2 || r->min < r->max) |
| 191 |
fprintf (codefile, |
| 192 |
"if ((%s)->%s > %lld) {\n" |
| 193 |
"e = ASN1_MAX_CONSTRAINT; %s;\n" |
| 194 |
"}\n", |
| 195 |
name, length, (long long)r->max, forwstr); |
| 196 |
if ((r->min - 1 == r->max || r->min < r->max) && r->min > 0) |
| 197 |
fprintf (codefile, |
| 198 |
"if ((%s)->%s < %lld) {\n" |
| 199 |
"e = ASN1_MIN_CONSTRAINT; %s;\n" |
| 200 |
"}\n", |
| 201 |
name, length, (long long)r->min, forwstr); |
| 202 |
if (r->max == r->min) |
| 203 |
fprintf (codefile, |
| 204 |
"if ((%s)->%s != %lld) {\n" |
| 205 |
"e = ASN1_EXACT_CONSTRAINT; %s;\n" |
| 206 |
"}\n", |
| 207 |
name, length, (long long)r->min, forwstr); |
| 208 |
} |
| 209 |
|
| 210 |
static int |
| 211 |
decode_type (const char *name, const Type *t, int optional, |
| 212 |
const char *forwstr, const char *tmpstr, const char *dertype, |
| 213 |
unsigned int depth) |
| 214 |
{ |
| 215 |
switch (t->type) { |
| 216 |
case TType: { |
| 217 |
if (optional) |
| 218 |
fprintf(codefile, |
| 219 |
"%s = calloc(1, sizeof(*%s));\n" |
| 220 |
"if (%s == NULL) %s;\n", |
| 221 |
name, name, name, forwstr); |
| 222 |
fprintf (codefile, |
| 223 |
"e = decode_%s(p, len, %s, &l);\n", |
| 224 |
t->symbol->gen_name, name); |
| 225 |
if (optional) { |
| 226 |
fprintf (codefile, |
| 227 |
"if(e) {\n" |
| 228 |
"free(%s);\n" |
| 229 |
"%s = NULL;\n" |
| 230 |
"} else {\n" |
| 231 |
"p += l; len -= l; ret += l;\n" |
| 232 |
"}\n", |
| 233 |
name, name); |
| 234 |
} else { |
| 235 |
fprintf (codefile, |
| 236 |
"if(e) %s;\n", |
| 237 |
forwstr); |
| 238 |
fprintf (codefile, |
| 239 |
"p += l; len -= l; ret += l;\n"); |
| 240 |
} |
| 241 |
break; |
| 242 |
} |
| 243 |
case TInteger: |
| 244 |
if(t->members) { |
| 245 |
/* |
| 246 |
* This will produce a worning, how its hard to fix since: |
| 247 |
* if its enum to an NameType, we can add appriate |
| 248 |
* type-cast. If its not though, we have to figure out if |
| 249 |
* there is negative enum enum and use appropriate |
| 250 |
* signness and size on the intertype we cast the result |
| 251 |
* too. |
| 252 |
*/ |
| 253 |
fprintf(codefile, |
| 254 |
"{\n" |
| 255 |
"int enumint;\n"); |
| 256 |
decode_primitive ("integer", "&enumint", forwstr); |
| 257 |
fprintf(codefile, |
| 258 |
"*%s = enumint;\n" |
| 259 |
"}\n", |
| 260 |
name); |
| 261 |
} else if (t->range == NULL) { |
| 262 |
decode_primitive ("heim_integer", name, forwstr); |
| 263 |
} else if (t->range->min < INT_MIN && t->range->max <= INT64_MAX) { |
| 264 |
decode_primitive ("integer64", name, forwstr); |
| 265 |
} else if (t->range->min >= 0 && t->range->max > UINT_MAX) { |
| 266 |
decode_primitive ("unsigned64", name, forwstr); |
| 267 |
} else if (t->range->min >= INT_MIN && t->range->max <= INT_MAX) { |
| 268 |
decode_primitive ("integer", name, forwstr); |
| 269 |
} else if (t->range->min >= 0 && t->range->max <= UINT_MAX) { |
| 270 |
decode_primitive ("unsigned", name, forwstr); |
| 271 |
} else |
| 272 |
errx(1, "%s: unsupported range %lld -> %lld", |
| 273 |
name, (long long)t->range->min, (long long)t->range->max); |
| 274 |
break; |
| 275 |
case TBoolean: |
| 276 |
decode_primitive ("boolean", name, forwstr); |
| 277 |
break; |
| 278 |
case TEnumerated: |
| 279 |
decode_primitive ("enumerated", name, forwstr); |
| 280 |
break; |
| 281 |
case TOctetString: |
| 282 |
if (dertype) { |
| 283 |
fprintf(codefile, |
| 284 |
"if (%s == CONS) {\n", |
| 285 |
dertype); |
| 286 |
decode_primitive("octet_string_ber", name, forwstr); |
| 287 |
fprintf(codefile, |
| 288 |
"} else {\n"); |
| 289 |
} |
| 290 |
decode_primitive ("octet_string", name, forwstr); |
| 291 |
if (dertype) |
| 292 |
fprintf(codefile, "}\n"); |
| 293 |
if (t->range) |
| 294 |
range_check(name, "length", forwstr, t->range); |
| 295 |
break; |
| 296 |
case TBitString: { |
| 297 |
Member *m; |
| 298 |
int pos = 0; |
| 299 |
|
| 300 |
if (ASN1_TAILQ_EMPTY(t->members)) { |
| 301 |
decode_primitive ("bit_string", name, forwstr); |
| 302 |
break; |
| 303 |
} |
| 304 |
fprintf(codefile, |
| 305 |
"if (len < 1) return ASN1_OVERRUN;\n" |
| 306 |
"p++; len--; ret++;\n"); |
| 307 |
fprintf(codefile, |
| 308 |
"do {\n" |
| 309 |
"if (len < 1) break;\n"); |
| 310 |
ASN1_TAILQ_FOREACH(m, t->members, members) { |
| 311 |
while (m->val / 8 > pos / 8) { |
| 312 |
fprintf (codefile, |
| 313 |
"p++; len--; ret++;\n" |
| 314 |
"if (len < 1) break;\n"); |
| 315 |
pos += 8; |
| 316 |
} |
| 317 |
fprintf (codefile, |
| 318 |
"(%s)->%s = (*p >> %d) & 1;\n", |
| 319 |
name, m->gen_name, 7 - m->val % 8); |
| 320 |
} |
| 321 |
fprintf(codefile, |
| 322 |
"} while(0);\n"); |
| 323 |
fprintf (codefile, |
| 324 |
"p += len; ret += len;\n"); |
| 325 |
break; |
| 326 |
} |
| 327 |
case TSequence: { |
| 328 |
Member *m; |
| 329 |
|
| 330 |
if (t->members == NULL) |
| 331 |
break; |
| 332 |
|
| 333 |
ASN1_TAILQ_FOREACH(m, t->members, members) { |
| 334 |
char *s = NULL; |
| 335 |
|
| 336 |
if (m->ellipsis) |
| 337 |
continue; |
| 338 |
|
| 339 |
if (asprintf (&s, "%s(%s)->%s", m->optional ? "" : "&", |
| 340 |
name, m->gen_name) < 0 || s == NULL) |
| 341 |
errx(1, "malloc"); |
| 342 |
decode_type (s, m->type, m->optional, forwstr, m->gen_name, NULL, |
| 343 |
depth + 1); |
| 344 |
free (s); |
| 345 |
} |
| 346 |
|
| 347 |
break; |
| 348 |
} |
| 349 |
case TSet: { |
| 350 |
Member *m; |
| 351 |
unsigned int memno; |
| 352 |
|
| 353 |
if(t->members == NULL) |
| 354 |
break; |
| 355 |
|
| 356 |
fprintf(codefile, "{\n"); |
| 357 |
fprintf(codefile, "unsigned int members = 0;\n"); |
| 358 |
fprintf(codefile, "while(len > 0) {\n"); |
| 359 |
fprintf(codefile, |
| 360 |
"Der_class class;\n" |
| 361 |
"Der_type type;\n" |
| 362 |
"int tag;\n" |
| 363 |
"e = der_get_tag (p, len, &class, &type, &tag, NULL);\n" |
| 364 |
"if(e) %s;\n", forwstr); |
| 365 |
fprintf(codefile, "switch (MAKE_TAG(class, type, tag)) {\n"); |
| 366 |
memno = 0; |
| 367 |
ASN1_TAILQ_FOREACH(m, t->members, members) { |
| 368 |
char *s; |
| 369 |
|
| 370 |
assert(m->type->type == TTag); |
| 371 |
|
| 372 |
fprintf(codefile, "case MAKE_TAG(%s, %s, %s):\n", |
| 373 |
classname(m->type->tag.tagclass), |
| 374 |
is_primitive_type(m->type->subtype->type) ? "PRIM" : "CONS", |
| 375 |
valuename(m->type->tag.tagclass, m->type->tag.tagvalue)); |
| 376 |
|
| 377 |
if (asprintf (&s, "%s(%s)->%s", m->optional ? "" : "&", name, m->gen_name) < 0 || s == NULL) |
| 378 |
errx(1, "malloc"); |
| 379 |
if(m->optional) |
| 380 |
fprintf(codefile, |
| 381 |
"%s = calloc(1, sizeof(*%s));\n" |
| 382 |
"if (%s == NULL) { e = ENOMEM; %s; }\n", |
| 383 |
s, s, s, forwstr); |
| 384 |
decode_type (s, m->type, 0, forwstr, m->gen_name, NULL, depth + 1); |
| 385 |
free (s); |
| 386 |
|
| 387 |
fprintf(codefile, "members |= (1 << %d);\n", memno); |
| 388 |
memno++; |
| 389 |
fprintf(codefile, "break;\n"); |
| 390 |
} |
| 391 |
fprintf(codefile, |
| 392 |
"default:\n" |
| 393 |
"return ASN1_MISPLACED_FIELD;\n" |
| 394 |
"break;\n"); |
| 395 |
fprintf(codefile, "}\n"); |
| 396 |
fprintf(codefile, "}\n"); |
| 397 |
memno = 0; |
| 398 |
ASN1_TAILQ_FOREACH(m, t->members, members) { |
| 399 |
char *s; |
| 400 |
|
| 401 |
if (asprintf (&s, "%s->%s", name, m->gen_name) < 0 || s == NULL) |
| 402 |
errx(1, "malloc"); |
| 403 |
fprintf(codefile, "if((members & (1 << %d)) == 0)\n", memno); |
| 404 |
if(m->optional) |
| 405 |
fprintf(codefile, "%s = NULL;\n", s); |
| 406 |
else if(m->defval) |
| 407 |
gen_assign_defval(s, m->defval); |
| 408 |
else |
| 409 |
fprintf(codefile, "return ASN1_MISSING_FIELD;\n"); |
| 410 |
free(s); |
| 411 |
memno++; |
| 412 |
} |
| 413 |
fprintf(codefile, "}\n"); |
| 414 |
break; |
| 415 |
} |
| 416 |
case TSetOf: |
| 417 |
case TSequenceOf: { |
| 418 |
char *n = NULL; |
| 419 |
char *sname = NULL; |
| 420 |
|
| 421 |
fprintf (codefile, |
| 422 |
"{\n" |
| 423 |
"size_t %s_origlen = len;\n" |
| 424 |
"size_t %s_oldret = ret;\n" |
| 425 |
"size_t %s_olen = 0;\n" |
| 426 |
"void *%s_tmp;\n" |
| 427 |
"ret = 0;\n" |
| 428 |
"(%s)->len = 0;\n" |
| 429 |
"(%s)->val = NULL;\n", |
| 430 |
tmpstr, |
| 431 |
tmpstr, |
| 432 |
tmpstr, |
| 433 |
tmpstr, |
| 434 |
name, |
| 435 |
name); |
| 436 |
|
| 437 |
fprintf (codefile, |
| 438 |
"while(ret < %s_origlen) {\n" |
| 439 |
"size_t %s_nlen = %s_olen + sizeof(*((%s)->val));\n" |
| 440 |
"if (%s_olen > %s_nlen) { e = ASN1_OVERFLOW; %s; }\n" |
| 441 |
"%s_olen = %s_nlen;\n" |
| 442 |
"%s_tmp = realloc((%s)->val, %s_olen);\n" |
| 443 |
"if (%s_tmp == NULL) { e = ENOMEM; %s; }\n" |
| 444 |
"(%s)->val = %s_tmp;\n", |
| 445 |
tmpstr, |
| 446 |
tmpstr, tmpstr, name, |
| 447 |
tmpstr, tmpstr, forwstr, |
| 448 |
tmpstr, tmpstr, |
| 449 |
tmpstr, name, tmpstr, |
| 450 |
tmpstr, forwstr, |
| 451 |
name, tmpstr); |
| 452 |
|
| 453 |
if (asprintf (&n, "&(%s)->val[(%s)->len]", name, name) < 0 || n == NULL) |
| 454 |
errx(1, "malloc"); |
| 455 |
if (asprintf (&sname, "%s_s_of", tmpstr) < 0 || sname == NULL) |
| 456 |
errx(1, "malloc"); |
| 457 |
decode_type (n, t->subtype, 0, forwstr, sname, NULL, depth + 1); |
| 458 |
fprintf (codefile, |
| 459 |
"(%s)->len++;\n" |
| 460 |
"len = %s_origlen - ret;\n" |
| 461 |
"}\n" |
| 462 |
"ret += %s_oldret;\n" |
| 463 |
"}\n", |
| 464 |
name, |
| 465 |
tmpstr, tmpstr); |
| 466 |
if (t->range) |
| 467 |
range_check(name, "len", forwstr, t->range); |
| 468 |
free (n); |
| 469 |
free (sname); |
| 470 |
break; |
| 471 |
} |
| 472 |
case TGeneralizedTime: |
| 473 |
decode_primitive ("generalized_time", name, forwstr); |
| 474 |
break; |
| 475 |
case TGeneralString: |
| 476 |
decode_primitive ("general_string", name, forwstr); |
| 477 |
break; |
| 478 |
case TTeletexString: |
| 479 |
decode_primitive ("general_string", name, forwstr); |
| 480 |
break; |
| 481 |
case TTag:{ |
| 482 |
char *tname = NULL, *typestring = NULL; |
| 483 |
char *ide = NULL; |
| 484 |
|
| 485 |
if (asprintf(&typestring, "%s_type", tmpstr) < 0 || typestring == NULL) |
| 486 |
errx(1, "malloc"); |
| 487 |
|
| 488 |
fprintf(codefile, |
| 489 |
"{\n" |
| 490 |
"size_t %s_datalen, %s_oldlen;\n" |
| 491 |
"Der_type %s;\n", |
| 492 |
tmpstr, tmpstr, typestring); |
| 493 |
if(support_ber) |
| 494 |
fprintf(codefile, |
| 495 |
"int is_indefinite%u;\n", depth); |
| 496 |
|
| 497 |
fprintf(codefile, "e = der_match_tag_and_length(p, len, %s, &%s, %s, " |
| 498 |
"&%s_datalen, &l);\n", |
| 499 |
classname(t->tag.tagclass), |
| 500 |
typestring, |
| 501 |
valuename(t->tag.tagclass, t->tag.tagvalue), |
| 502 |
tmpstr); |
| 503 |
|
| 504 |
/* XXX hardcode for now */ |
| 505 |
if (support_ber && t->subtype->type == TOctetString) { |
| 506 |
ide = typestring; |
| 507 |
} else { |
| 508 |
fprintf(codefile, |
| 509 |
"if (e == 0 && %s != %s) { e = ASN1_BAD_ID; }\n", |
| 510 |
typestring, |
| 511 |
is_primitive_type(t->subtype->type) ? "PRIM" : "CONS"); |
| 512 |
} |
| 513 |
|
| 514 |
if(optional) { |
| 515 |
fprintf(codefile, |
| 516 |
"if(e) {\n" |
| 517 |
"%s = NULL;\n" |
| 518 |
"} else {\n" |
| 519 |
"%s = calloc(1, sizeof(*%s));\n" |
| 520 |
"if (%s == NULL) { e = ENOMEM; %s; }\n", |
| 521 |
name, name, name, name, forwstr); |
| 522 |
} else { |
| 523 |
fprintf(codefile, "if(e) %s;\n", forwstr); |
| 524 |
} |
| 525 |
fprintf (codefile, |
| 526 |
"p += l; len -= l; ret += l;\n" |
| 527 |
"%s_oldlen = len;\n", |
| 528 |
tmpstr); |
| 529 |
if(support_ber) |
| 530 |
fprintf (codefile, |
| 531 |
"if((is_indefinite%u = _heim_fix_dce(%s_datalen, &len)) < 0)\n" |
| 532 |
"{ e = ASN1_BAD_FORMAT; %s; }\n" |
| 533 |
"if (is_indefinite%u) { if (len < 2) { e = ASN1_OVERRUN; %s; } len -= 2; }", |
| 534 |
depth, tmpstr, forwstr, depth, forwstr); |
| 535 |
else |
| 536 |
fprintf(codefile, |
| 537 |
"if (%s_datalen > len) { e = ASN1_OVERRUN; %s; }\n" |
| 538 |
"len = %s_datalen;\n", tmpstr, forwstr, tmpstr); |
| 539 |
if (asprintf (&tname, "%s_Tag", tmpstr) < 0 || tname == NULL) |
| 540 |
errx(1, "malloc"); |
| 541 |
decode_type (name, t->subtype, 0, forwstr, tname, ide, depth + 1); |
| 542 |
if(support_ber) |
| 543 |
fprintf(codefile, |
| 544 |
"if(is_indefinite%u){\n" |
| 545 |
"len += 2;\n" |
| 546 |
"e = der_match_tag_and_length(p, len, " |
| 547 |
"(Der_class)0, &%s, UT_EndOfContent, " |
| 548 |
"&%s_datalen, &l);\n" |
| 549 |
"if(e) %s;\n" |
| 550 |
"p += l; len -= l; ret += l;\n" |
| 551 |
"if (%s != (Der_type)0) { e = ASN1_BAD_ID; %s; }\n" |
| 552 |
"} else \n", |
| 553 |
depth, |
| 554 |
typestring, |
| 555 |
tmpstr, |
| 556 |
forwstr, |
| 557 |
typestring, forwstr); |
| 558 |
fprintf(codefile, |
| 559 |
"len = %s_oldlen - %s_datalen;\n", |
| 560 |
tmpstr, tmpstr); |
| 561 |
if(optional) |
| 562 |
fprintf(codefile, |
| 563 |
"}\n"); |
| 564 |
fprintf(codefile, |
| 565 |
"}\n"); |
| 566 |
free(tname); |
| 567 |
free(typestring); |
| 568 |
break; |
| 569 |
} |
| 570 |
case TChoice: { |
| 571 |
Member *m, *have_ellipsis = NULL; |
| 572 |
const char *els = ""; |
| 573 |
|
| 574 |
if (t->members == NULL) |
| 575 |
break; |
| 576 |
|
| 577 |
ASN1_TAILQ_FOREACH(m, t->members, members) { |
| 578 |
const Type *tt = m->type; |
| 579 |
char *s = NULL; |
| 580 |
Der_class cl; |
| 581 |
Der_type ty; |
| 582 |
unsigned tag; |
| 583 |
|
| 584 |
if (m->ellipsis) { |
| 585 |
have_ellipsis = m; |
| 586 |
continue; |
| 587 |
} |
| 588 |
|
| 589 |
find_tag(tt, &cl, &ty, &tag); |
| 590 |
|
| 591 |
fprintf(codefile, |
| 592 |
"%sif (der_match_tag(p, len, %s, %s, %s, NULL) == 0) {\n", |
| 593 |
els, |
| 594 |
classname(cl), |
| 595 |
ty ? "CONS" : "PRIM", |
| 596 |
valuename(cl, tag)); |
| 597 |
fprintf(codefile, |
| 598 |
"(%s)->element = %s;\n", |
| 599 |
name, m->label); |
| 600 |
if (asprintf (&s, "%s(%s)->u.%s", m->optional ? "" : "&", |
| 601 |
name, m->gen_name) < 0 || s == NULL) |
| 602 |
errx(1, "malloc"); |
| 603 |
decode_type (s, m->type, m->optional, forwstr, m->gen_name, NULL, |
| 604 |
depth + 1); |
| 605 |
free(s); |
| 606 |
fprintf(codefile, |
| 607 |
"}\n"); |
| 608 |
els = "else "; |
| 609 |
} |
| 610 |
if (have_ellipsis) { |
| 611 |
fprintf(codefile, |
| 612 |
"else {\n" |
| 613 |
"(%s)->element = %s;\n" |
| 614 |
"(%s)->u.%s.data = calloc(1, len);\n" |
| 615 |
"if ((%s)->u.%s.data == NULL) {\n" |
| 616 |
"e = ENOMEM; %s;\n" |
| 617 |
"}\n" |
| 618 |
"(%s)->u.%s.length = len;\n" |
| 619 |
"memcpy((%s)->u.%s.data, p, len);\n" |
| 620 |
"p += len;\n" |
| 621 |
"ret += len;\n" |
| 622 |
"len = 0;\n" |
| 623 |
"}\n", |
| 624 |
name, have_ellipsis->label, |
| 625 |
name, have_ellipsis->gen_name, |
| 626 |
name, have_ellipsis->gen_name, |
| 627 |
forwstr, |
| 628 |
name, have_ellipsis->gen_name, |
| 629 |
name, have_ellipsis->gen_name); |
| 630 |
} else { |
| 631 |
fprintf(codefile, |
| 632 |
"else {\n" |
| 633 |
"e = ASN1_PARSE_ERROR;\n" |
| 634 |
"%s;\n" |
| 635 |
"}\n", |
| 636 |
forwstr); |
| 637 |
} |
| 638 |
break; |
| 639 |
} |
| 640 |
case TUTCTime: |
| 641 |
decode_primitive ("utctime", name, forwstr); |
| 642 |
break; |
| 643 |
case TUTF8String: |
| 644 |
decode_primitive ("utf8string", name, forwstr); |
| 645 |
break; |
| 646 |
case TPrintableString: |
| 647 |
decode_primitive ("printable_string", name, forwstr); |
| 648 |
break; |
| 649 |
case TIA5String: |
| 650 |
decode_primitive ("ia5_string", name, forwstr); |
| 651 |
break; |
| 652 |
case TBMPString: |
| 653 |
decode_primitive ("bmp_string", name, forwstr); |
| 654 |
break; |
| 655 |
case TUniversalString: |
| 656 |
decode_primitive ("universal_string", name, forwstr); |
| 657 |
break; |
| 658 |
case TVisibleString: |
| 659 |
decode_primitive ("visible_string", name, forwstr); |
| 660 |
break; |
| 661 |
case TNull: |
| 662 |
fprintf (codefile, "/* NULL */\n"); |
| 663 |
break; |
| 664 |
case TOID: |
| 665 |
decode_primitive ("oid", name, forwstr); |
| 666 |
break; |
| 667 |
default : |
| 668 |
abort (); |
| 669 |
} |
| 670 |
return 0; |
| 671 |
} |
| 672 |
|
| 673 |
void |
| 674 |
generate_type_decode (const Symbol *s) |
| 675 |
{ |
| 676 |
int preserve = preserve_type(s->name) ? TRUE : FALSE; |
| 677 |
|
| 678 |
fprintf (codefile, "int ASN1CALL\n" |
| 679 |
"decode_%s(const unsigned char *p HEIMDAL_UNUSED_ATTRIBUTE," |
| 680 |
" size_t len HEIMDAL_UNUSED_ATTRIBUTE, %s *data, size_t *size)\n" |
| 681 |
"{\n", |
| 682 |
s->gen_name, s->gen_name); |
| 683 |
|
| 684 |
switch (s->type->type) { |
| 685 |
case TInteger: |
| 686 |
case TBoolean: |
| 687 |
case TOctetString: |
| 688 |
case TOID: |
| 689 |
case TGeneralizedTime: |
| 690 |
case TGeneralString: |
| 691 |
case TTeletexString: |
| 692 |
case TUTF8String: |
| 693 |
case TPrintableString: |
| 694 |
case TIA5String: |
| 695 |
case TBMPString: |
| 696 |
case TUniversalString: |
| 697 |
case TVisibleString: |
| 698 |
case TUTCTime: |
| 699 |
case TNull: |
| 700 |
case TEnumerated: |
| 701 |
case TBitString: |
| 702 |
case TSequence: |
| 703 |
case TSequenceOf: |
| 704 |
case TSet: |
| 705 |
case TSetOf: |
| 706 |
case TTag: |
| 707 |
case TType: |
| 708 |
case TChoice: |
| 709 |
fprintf (codefile, |
| 710 |
"size_t ret = 0;\n" |
| 711 |
"size_t l HEIMDAL_UNUSED_ATTRIBUTE;\n" |
| 712 |
"int e HEIMDAL_UNUSED_ATTRIBUTE;\n"); |
| 713 |
if (preserve) |
| 714 |
fprintf (codefile, "const unsigned char *begin = p;\n"); |
| 715 |
|
| 716 |
fprintf (codefile, "\n"); |
| 717 |
fprintf (codefile, "memset(data, 0, sizeof(*data));\n"); /* hack to avoid `unused variable' */ |
| 718 |
|
| 719 |
decode_type ("data", s->type, 0, "goto fail", "Top", NULL, 1); |
| 720 |
if (preserve) |
| 721 |
fprintf (codefile, |
| 722 |
"data->_save.data = calloc(1, ret);\n" |
| 723 |
"if (data->_save.data == NULL) { \n" |
| 724 |
"e = ENOMEM; goto fail; \n" |
| 725 |
"}\n" |
| 726 |
"data->_save.length = ret;\n" |
| 727 |
"memcpy(data->_save.data, begin, ret);\n"); |
| 728 |
fprintf (codefile, |
| 729 |
"if(size) *size = ret;\n" |
| 730 |
"return 0;\n"); |
| 731 |
fprintf (codefile, |
| 732 |
"fail:\n" |
| 733 |
"free_%s(data);\n" |
| 734 |
"return e;\n", |
| 735 |
s->gen_name); |
| 736 |
break; |
| 737 |
default: |
| 738 |
abort (); |
| 739 |
} |
| 740 |
fprintf (codefile, "}\n\n"); |
| 741 |
} |