
Status: - And it works! - We have an extensive test based on decoding a rich EK certficate. This test exercises all of: - decoding - encoding with and without decoded open types - copying of decoded values with decoded open types - freeing of decoded values with decoded open types Valgrind finds no memory errors. - Added a manual page for the compiler. - rfc2459.asn1 now has all three primary PKIX types that we care about defined as in RFC5912, with IOS constraints and parameterization: - `Extension` (embeds open type in an `OCTET STRING`) - `OtherName` (embeds open type in an `ANY`-like type) - `SingleAttribute` (embeds open type in an `ANY`-like type) - `AttributeSet` (embeds open type in a `SET OF ANY`-like type) All of these use OIDs as the open type type ID field, but integer open type type ID fields are also supported (and needed, for Kerberos). That will cover every typed hole pattern in all our ASN.1 modules. With this we'll be able to automatically and recursively decode through all subject DN attributes even when the subject DN is a directoryName SAN, and subjectDirectoryAttributes, and all extensions, and all SANs, and all authorization-data elements, and PA-data, and... We're not really using `SingleAttribute` and `AttributeSet` yet because various changes are needed in `lib/hx509` for that. - `asn1_compile` builds and recognizes the subset of X.681/682/683 that we need for, and now use in, rfc2459.asn1. It builds the necessary AST, generates the correct C types, and generates templating for object sets and open types! - See READMEs for details. - Codegen backend not tested; I won't make it implement automatic open type handling, but it should at least not crash by substituting `heim_any` for open types not embedded in `OCTET STRING`. - We're _really_ starting to have problems with the ITU-T ASN.1 grammar and our version of it... Type names have to start with upper-case, value names with lower-case, but it's not enough to disambiguate. The fact the we've allowed value and type names to violate their respective start-with case rules is causing us trouble now that we're adding grammar from X.681/682/683, and we're going to have to undo that. In preparation for that I'm capitalizing the `heim_any` and `heim_any_set` types, and doing some additional cleanup, which requires changes to other parts of Heimdal (all in this same commit for now). Problems we have because of this: - We cannot IMPORT values into modules because we have no idea if a symbol being imported refers to a value or a type because the only clue we would have is the symbol's name, so we assume IMPORTed symbols are for types. This means we can't import OIDs, for example, which is super annoying. One thing we might be able to do here is mark imported symbols as being of an undetermined-but-not-undefined type, then coerce the symbol's type the first time it's used in a context where its type is inferred as type, value, object, object set, or class. (Though since we don't generate C symbols for objects or classes, we won't be able to import them, especially since we need to know them at compile time and cannot defer their handling to link- or run-time.) - The `NULL` type name, and the `NULL` value name now cause two reduce/reduce conflicts via the `FieldSetting` production. - Various shift/reduce conflicts involving `NULL` values in non-top-level contexts (in constraints, for example). - Currently I have a bug where to disambiguate the grammar I have a CLASS_IDENTIFIER token that is all caps, while TYPE_IDENTIFIER must start with a capital but not be all caps, but this breaks Kerberos since all its types are all capitalized -- oof! To fix this I made it so class names have to be all caps and start with an underscore (ick). TBD: - Check all the XXX comments and address them - Apply this treatment to Kerberos! Automatic handling of authz-data sounds useful :) - Apply this treatment to PKCS#10 (CSRs) and other ASN.1 modules too. - Replace various bits of code in `lib/hx509/` with uses of this feature. - Add JER. - Enhance `hxtool` and `asn1_print`. Getting there!
842 lines
23 KiB
C
842 lines
23 KiB
C
/*
|
|
* Copyright (c) 1997 - 2006 Kungliga Tekniska Högskolan
|
|
* (Royal Institute of Technology, Stockholm, Sweden).
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
*
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* 3. Neither the name of the Institute nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*/
|
|
|
|
#include "gen_locl.h"
|
|
#include "lex.h"
|
|
|
|
RCSID("$Id$");
|
|
|
|
static void
|
|
decode_primitive (const char *typename, const char *name, const char *forwstr)
|
|
{
|
|
#if 0
|
|
fprintf (codefile,
|
|
"e = decode_%s(p, len, %s, &l);\n"
|
|
"%s;\n",
|
|
typename,
|
|
name,
|
|
forwstr);
|
|
#else
|
|
fprintf (codefile,
|
|
"e = der_get_%s(p, len, %s, &l);\n"
|
|
"if(e) %s;\np += l; len -= l; ret += l;\n",
|
|
typename,
|
|
name,
|
|
forwstr);
|
|
#endif
|
|
}
|
|
|
|
static void
|
|
find_tag (const Type *t,
|
|
Der_class *cl, Der_type *ty, unsigned *tag)
|
|
{
|
|
switch (t->type) {
|
|
case TBitString:
|
|
*cl = ASN1_C_UNIV;
|
|
*ty = PRIM;
|
|
*tag = UT_BitString;
|
|
break;
|
|
case TBoolean:
|
|
*cl = ASN1_C_UNIV;
|
|
*ty = PRIM;
|
|
*tag = UT_Boolean;
|
|
break;
|
|
case TChoice:
|
|
errx(1, "Cannot have recursive CHOICE");
|
|
case TEnumerated:
|
|
*cl = ASN1_C_UNIV;
|
|
*ty = PRIM;
|
|
*tag = UT_Enumerated;
|
|
break;
|
|
case TGeneralString:
|
|
*cl = ASN1_C_UNIV;
|
|
*ty = PRIM;
|
|
*tag = UT_GeneralString;
|
|
break;
|
|
case TTeletexString:
|
|
*cl = ASN1_C_UNIV;
|
|
*ty = PRIM;
|
|
*tag = UT_TeletexString;
|
|
break;
|
|
case TGeneralizedTime:
|
|
*cl = ASN1_C_UNIV;
|
|
*ty = PRIM;
|
|
*tag = UT_GeneralizedTime;
|
|
break;
|
|
case TIA5String:
|
|
*cl = ASN1_C_UNIV;
|
|
*ty = PRIM;
|
|
*tag = UT_IA5String;
|
|
break;
|
|
case TInteger:
|
|
*cl = ASN1_C_UNIV;
|
|
*ty = PRIM;
|
|
*tag = UT_Integer;
|
|
break;
|
|
case TNull:
|
|
*cl = ASN1_C_UNIV;
|
|
*ty = PRIM;
|
|
*tag = UT_Null;
|
|
break;
|
|
case TOID:
|
|
*cl = ASN1_C_UNIV;
|
|
*ty = PRIM;
|
|
*tag = UT_OID;
|
|
break;
|
|
case TOctetString:
|
|
*cl = ASN1_C_UNIV;
|
|
*ty = PRIM;
|
|
*tag = UT_OctetString;
|
|
break;
|
|
case TPrintableString:
|
|
*cl = ASN1_C_UNIV;
|
|
*ty = PRIM;
|
|
*tag = UT_PrintableString;
|
|
break;
|
|
case TSequence:
|
|
case TSequenceOf:
|
|
*cl = ASN1_C_UNIV;
|
|
*ty = CONS;
|
|
*tag = UT_Sequence;
|
|
break;
|
|
case TSet:
|
|
case TSetOf:
|
|
*cl = ASN1_C_UNIV;
|
|
*ty = CONS;
|
|
*tag = UT_Set;
|
|
break;
|
|
case TTag:
|
|
*cl = t->tag.tagclass;
|
|
*ty = !(t->tag.tagclass != ASN1_C_UNIV &&
|
|
t->tag.tagenv == TE_EXPLICIT) &&
|
|
is_primitive_type(t->subtype) ? PRIM : CONS;
|
|
*tag = t->tag.tagvalue; /* XXX is this correct? */
|
|
break;
|
|
case TType:
|
|
if ((t->symbol->stype == Stype && t->symbol->type == NULL)
|
|
|| t->symbol->stype == SUndefined) {
|
|
lex_error_message("%s is imported or still undefined, "
|
|
" can't generate tag checking data in CHOICE "
|
|
"without this information",
|
|
t->symbol->name);
|
|
exit(1);
|
|
}
|
|
find_tag(t->symbol->type, cl, ty, tag);
|
|
return;
|
|
case TUTCTime:
|
|
*cl = ASN1_C_UNIV;
|
|
*ty = PRIM;
|
|
*tag = UT_UTCTime;
|
|
break;
|
|
case TUTF8String:
|
|
*cl = ASN1_C_UNIV;
|
|
*ty = PRIM;
|
|
*tag = UT_UTF8String;
|
|
break;
|
|
case TBMPString:
|
|
*cl = ASN1_C_UNIV;
|
|
*ty = PRIM;
|
|
*tag = UT_BMPString;
|
|
break;
|
|
case TUniversalString:
|
|
*cl = ASN1_C_UNIV;
|
|
*ty = PRIM;
|
|
*tag = UT_UniversalString;
|
|
break;
|
|
case TVisibleString:
|
|
*cl = ASN1_C_UNIV;
|
|
*ty = PRIM;
|
|
*tag = UT_VisibleString;
|
|
break;
|
|
default:
|
|
abort();
|
|
}
|
|
}
|
|
|
|
static void
|
|
range_check(const char *name,
|
|
const char *length,
|
|
const char *forwstr,
|
|
struct range *r)
|
|
{
|
|
if (r->min == r->max + 2 || r->min < r->max)
|
|
fprintf (codefile,
|
|
"if ((%s)->%s > %lld) {\n"
|
|
"e = ASN1_MAX_CONSTRAINT; %s;\n"
|
|
"}\n",
|
|
name, length, (long long)r->max, forwstr);
|
|
if ((r->min - 1 == r->max || r->min < r->max) && r->min > 0)
|
|
fprintf (codefile,
|
|
"if ((%s)->%s < %lld) {\n"
|
|
"e = ASN1_MIN_CONSTRAINT; %s;\n"
|
|
"}\n",
|
|
name, length, (long long)r->min, forwstr);
|
|
if (r->max == r->min)
|
|
fprintf (codefile,
|
|
"if ((%s)->%s != %lld) {\n"
|
|
"e = ASN1_EXACT_CONSTRAINT; %s;\n"
|
|
"}\n",
|
|
name, length, (long long)r->min, forwstr);
|
|
}
|
|
|
|
static int
|
|
decode_type(const char *name, const Type *t, int optional, struct value *defval,
|
|
const char *forwstr, const char *tmpstr, const char *dertype,
|
|
unsigned int depth)
|
|
{
|
|
switch (t->type) {
|
|
case TType: {
|
|
if (optional)
|
|
fprintf(codefile,
|
|
"%s = calloc(1, sizeof(*%s));\n"
|
|
"if (%s == NULL) %s;\n",
|
|
name, name, name, forwstr);
|
|
fprintf (codefile,
|
|
"e = decode_%s(p, len, %s, &l);\n",
|
|
t->symbol->gen_name, name);
|
|
if (optional) {
|
|
fprintf (codefile,
|
|
"if(e == ASN1_MISSING_FIELD) {\n"
|
|
"free(%s);\n"
|
|
"%s = NULL;\n"
|
|
"} else if (e) { %s; \n"
|
|
"} else {\n"
|
|
"p += l; len -= l; ret += l;\n"
|
|
"}\n",
|
|
name, name, forwstr);
|
|
} else if (defval) {
|
|
fprintf(codefile,
|
|
"if (e == ASN1_MISSING_FIELD) {\n");
|
|
/*
|
|
* `name' starts with an ampersand here and is not an lvalue.
|
|
* We skip the ampersand and then it is an lvalue.
|
|
*/
|
|
gen_assign_defval(name + 1, defval);
|
|
fprintf(codefile,
|
|
"} else if (e) { %s;\n"
|
|
"} else { p += l; len -= l; ret += l; }\n",
|
|
forwstr);
|
|
} else {
|
|
fprintf (codefile,
|
|
"if(e) %s;\n",
|
|
forwstr);
|
|
fprintf (codefile,
|
|
"p += l; len -= l; ret += l;\n");
|
|
}
|
|
break;
|
|
}
|
|
case TInteger:
|
|
if(t->members) {
|
|
/*
|
|
* This will produce a worning, how its hard to fix since:
|
|
* if its enum to an NameType, we can add appriate
|
|
* type-cast. If its not though, we have to figure out if
|
|
* there is negative enum enum and use appropriate
|
|
* signness and size on the intertype we cast the result
|
|
* too.
|
|
*/
|
|
fprintf(codefile,
|
|
"{\n"
|
|
"int enumint;\n");
|
|
decode_primitive ("integer", "&enumint", forwstr);
|
|
fprintf(codefile,
|
|
"*%s = enumint;\n"
|
|
"}\n",
|
|
name);
|
|
} else if (t->range == NULL) {
|
|
decode_primitive ("heim_integer", name, forwstr);
|
|
} else if (t->range->min < INT_MIN && t->range->max <= INT64_MAX) {
|
|
decode_primitive ("integer64", name, forwstr);
|
|
} else if (t->range->min >= 0 && t->range->max > UINT_MAX) {
|
|
decode_primitive ("unsigned64", name, forwstr);
|
|
} else if (t->range->min >= INT_MIN && t->range->max <= INT_MAX) {
|
|
decode_primitive ("integer", name, forwstr);
|
|
} else if (t->range->min >= 0 && t->range->max <= UINT_MAX) {
|
|
decode_primitive ("unsigned", name, forwstr);
|
|
} else
|
|
errx(1, "%s: unsupported range %lld -> %lld",
|
|
name, (long long)t->range->min, (long long)t->range->max);
|
|
break;
|
|
case TBoolean:
|
|
decode_primitive ("boolean", name, forwstr);
|
|
break;
|
|
case TEnumerated:
|
|
decode_primitive ("enumerated", name, forwstr);
|
|
break;
|
|
case TOctetString:
|
|
if (dertype) {
|
|
fprintf(codefile,
|
|
"if (%s == CONS) {\n",
|
|
dertype);
|
|
decode_primitive("octet_string_ber", name, forwstr);
|
|
fprintf(codefile,
|
|
"} else {\n");
|
|
}
|
|
decode_primitive ("octet_string", name, forwstr);
|
|
if (dertype)
|
|
fprintf(codefile, "}\n");
|
|
if (t->range)
|
|
range_check(name, "length", forwstr, t->range);
|
|
break;
|
|
case TBitString: {
|
|
Member *m;
|
|
int pos = 0;
|
|
|
|
if (HEIM_TAILQ_EMPTY(t->members)) {
|
|
decode_primitive ("bit_string", name, forwstr);
|
|
break;
|
|
}
|
|
fprintf(codefile,
|
|
"if (len < 1) return ASN1_OVERRUN;\n"
|
|
"p++; len--; ret++;\n");
|
|
fprintf(codefile,
|
|
"do {\n"
|
|
"if (len < 1) break;\n");
|
|
HEIM_TAILQ_FOREACH(m, t->members, members) {
|
|
while (m->val / 8 > pos / 8) {
|
|
fprintf (codefile,
|
|
"p++; len--; ret++;\n"
|
|
"if (len < 1) break;\n");
|
|
pos += 8;
|
|
}
|
|
fprintf (codefile,
|
|
"(%s)->%s = (*p >> %d) & 1;\n",
|
|
name, m->gen_name, 7 - m->val % 8);
|
|
}
|
|
fprintf(codefile,
|
|
"} while(0);\n");
|
|
fprintf (codefile,
|
|
"p += len; ret += len;\n");
|
|
break;
|
|
}
|
|
case TSequence: {
|
|
Member *m;
|
|
|
|
if (t->members == NULL)
|
|
break;
|
|
|
|
HEIM_TAILQ_FOREACH(m, t->members, members) {
|
|
char *s = NULL;
|
|
|
|
if (m->ellipsis)
|
|
continue;
|
|
|
|
if (asprintf (&s, "%s(%s)->%s", m->optional ? "" : "&",
|
|
name, m->gen_name) < 0 || s == NULL)
|
|
errx(1, "malloc");
|
|
decode_type(s, m->type, m->optional, m->defval, forwstr,
|
|
m->gen_name, NULL, depth + 1);
|
|
free (s);
|
|
}
|
|
|
|
break;
|
|
}
|
|
case TSet: {
|
|
/*
|
|
* SET { ... } is the dumbest construct in ASN.1. It's semantically
|
|
* indistinguishable from SEQUENCE { ... } but in BER you can write the
|
|
* fields in any order you wish, and in DER you have to write them in
|
|
* lexicographic order. If you want a reason to hate ASN.1, this is
|
|
* certainly one, though the real reason to hate ASN.1 is BER/DER/CER,
|
|
* and, really, all tag-length-value (TLV) encodings ever invented,
|
|
* including Protocol Buffers. Fortunately not all ASN.1 encoding
|
|
* rules are TLV or otherwise self-describing. "Self-describing"
|
|
* encoding rules other than those meant to be [somewhat] readable by
|
|
* humans, such as XML and JSON, are simply dumb. But SET { ... } is a
|
|
* truly special sort of dumb. The only possible use of SET { ... }
|
|
* might well be for ASN.1 mappings of XML schemas(?).
|
|
*/
|
|
Member *m;
|
|
unsigned int memno;
|
|
|
|
if(t->members == NULL)
|
|
break;
|
|
|
|
fprintf(codefile, "{\n");
|
|
fprintf(codefile, "uint64_t members = 0;\n");
|
|
fprintf(codefile, "while(len > 0) {\n");
|
|
fprintf(codefile,
|
|
"Der_class class;\n"
|
|
"Der_type type;\n"
|
|
"unsigned int tag;\n"
|
|
"e = der_get_tag (p, len, &class, &type, &tag, NULL);\n"
|
|
"if(e) %s;\n", forwstr);
|
|
fprintf(codefile, "switch (MAKE_TAG(class, type, tag)) {\n");
|
|
memno = 0;
|
|
HEIM_TAILQ_FOREACH(m, t->members, members) {
|
|
Type *mst = m->type; /* Member sub-type */
|
|
char *s;
|
|
|
|
while (mst->type == TType) {
|
|
assert(mst->subtype || (mst->symbol && mst->symbol->type));
|
|
mst = mst->subtype ? mst->subtype : mst->symbol->type;
|
|
}
|
|
assert(mst->type == TTag);
|
|
|
|
fprintf(codefile, "case MAKE_TAG(%s, %s, %s):\n",
|
|
classname(mst->tag.tagclass),
|
|
(mst->tag.tagclass == ASN1_C_UNIV || mst->tag.tagenv == TE_IMPLICIT) &&
|
|
is_primitive_type(mst->subtype) ? "PRIM" : "CONS",
|
|
valuename(mst->tag.tagclass, mst->tag.tagvalue));
|
|
|
|
if (asprintf (&s, "%s(%s)->%s", m->optional ? "" : "&", name, m->gen_name) < 0 || s == NULL)
|
|
errx(1, "malloc");
|
|
if(m->optional)
|
|
fprintf(codefile,
|
|
"%s = calloc(1, sizeof(*%s));\n"
|
|
"if (%s == NULL) { e = ENOMEM; %s; }\n",
|
|
s, s, s, forwstr);
|
|
decode_type (s, mst, 0, NULL, forwstr, m->gen_name, NULL, depth + 1);
|
|
free (s);
|
|
|
|
fprintf(codefile, "members |= (1ULL << %u);\n", memno);
|
|
memno++;
|
|
fprintf(codefile, "break;\n");
|
|
}
|
|
fprintf(codefile,
|
|
"default:\n"
|
|
"return ASN1_MISPLACED_FIELD;\n"
|
|
"break;\n");
|
|
fprintf(codefile, "}\n");
|
|
fprintf(codefile, "}\n");
|
|
memno = 0;
|
|
HEIM_TAILQ_FOREACH(m, t->members, members) {
|
|
char *s;
|
|
|
|
if (asprintf (&s, "%s->%s", name, m->gen_name) < 0 || s == NULL)
|
|
errx(1, "malloc");
|
|
fprintf(codefile, "if((members & (1ULL << %u)) == 0)\n", memno);
|
|
if(m->optional)
|
|
fprintf(codefile, "%s = NULL;\n", s);
|
|
else if(m->defval)
|
|
gen_assign_defval(s, m->defval);
|
|
else
|
|
fprintf(codefile, "return ASN1_MISSING_FIELD;\n");
|
|
free(s);
|
|
memno++;
|
|
}
|
|
fprintf(codefile, "}\n");
|
|
break;
|
|
}
|
|
case TSetOf:
|
|
case TSequenceOf: {
|
|
char *n = NULL;
|
|
char *sname = NULL;
|
|
|
|
fprintf (codefile,
|
|
"{\n"
|
|
"size_t %s_origlen = len;\n"
|
|
"size_t %s_oldret = ret;\n"
|
|
"size_t %s_olen = 0;\n"
|
|
"void *%s_tmp;\n"
|
|
"ret = 0;\n"
|
|
"(%s)->len = 0;\n"
|
|
"(%s)->val = NULL;\n",
|
|
tmpstr,
|
|
tmpstr,
|
|
tmpstr,
|
|
tmpstr,
|
|
name,
|
|
name);
|
|
|
|
fprintf (codefile,
|
|
"while(ret < %s_origlen) {\n"
|
|
"size_t %s_nlen = %s_olen + sizeof(*((%s)->val));\n"
|
|
"if (%s_olen > %s_nlen) { e = ASN1_OVERFLOW; %s; }\n"
|
|
"%s_olen = %s_nlen;\n"
|
|
"%s_tmp = realloc((%s)->val, %s_olen);\n"
|
|
"if (%s_tmp == NULL) { e = ENOMEM; %s; }\n"
|
|
"(%s)->val = %s_tmp;\n",
|
|
tmpstr,
|
|
tmpstr, tmpstr, name,
|
|
tmpstr, tmpstr, forwstr,
|
|
tmpstr, tmpstr,
|
|
tmpstr, name, tmpstr,
|
|
tmpstr, forwstr,
|
|
name, tmpstr);
|
|
|
|
if (asprintf (&n, "&(%s)->val[(%s)->len]", name, name) < 0 || n == NULL)
|
|
errx(1, "malloc");
|
|
if (asprintf (&sname, "%s_s_of", tmpstr) < 0 || sname == NULL)
|
|
errx(1, "malloc");
|
|
decode_type(n, t->subtype, 0, NULL, forwstr, sname, NULL, depth + 1);
|
|
fprintf (codefile,
|
|
"(%s)->len++;\n"
|
|
"len = %s_origlen - ret;\n"
|
|
"}\n"
|
|
"ret += %s_oldret;\n"
|
|
"}\n",
|
|
name,
|
|
tmpstr, tmpstr);
|
|
if (t->range)
|
|
range_check(name, "len", forwstr, t->range);
|
|
free (n);
|
|
free (sname);
|
|
break;
|
|
}
|
|
case TGeneralizedTime:
|
|
decode_primitive ("generalized_time", name, forwstr);
|
|
break;
|
|
case TGeneralString:
|
|
decode_primitive ("general_string", name, forwstr);
|
|
break;
|
|
case TTeletexString:
|
|
decode_primitive ("general_string", name, forwstr);
|
|
break;
|
|
case TTag:{
|
|
char *tname = NULL, *typestring = NULL;
|
|
char *ide = NULL;
|
|
int replace_tag = 0;
|
|
int prim = !(t->tag.tagclass != ASN1_C_UNIV &&
|
|
t->tag.tagenv == TE_EXPLICIT) &&
|
|
is_primitive_type(t->subtype);
|
|
|
|
/*
|
|
* XXX See the comments in gen_encode() about this.
|
|
*/
|
|
if (t->tag.tagenv == TE_IMPLICIT && !prim &&
|
|
t->subtype->type != TSequenceOf && t->subtype->type != TSetOf &&
|
|
t->subtype->type != TChoice) {
|
|
if (t->subtype->symbol &&
|
|
(t->subtype->type == TSequence ||
|
|
t->subtype->type == TSet))
|
|
replace_tag = 1;
|
|
else if (t->subtype->symbol && strcmp(t->subtype->symbol->name, "HEIM_ANY"))
|
|
replace_tag = 1;
|
|
} else if (t->tag.tagenv == TE_IMPLICIT && prim && t->subtype->symbol)
|
|
replace_tag = 1;
|
|
|
|
if (asprintf(&typestring, "%s_type", tmpstr) < 0 || typestring == NULL)
|
|
errx(1, "malloc");
|
|
|
|
fprintf(codefile,
|
|
"{\n"
|
|
"size_t %s_datalen;\n"
|
|
"Der_type %s;\n",
|
|
tmpstr, typestring);
|
|
if (replace_tag)
|
|
fprintf(codefile,
|
|
"const unsigned char *psave%u = p;\n"
|
|
"unsigned char *pcopy%u;\n"
|
|
"size_t lensave%u, lsave%u;\n",
|
|
depth, depth, depth, depth);
|
|
else if (support_ber)
|
|
fprintf(codefile,
|
|
"int is_indefinite%u;\n", depth);
|
|
if (!replace_tag)
|
|
fprintf(codefile,
|
|
"size_t %s_oldlen;\n", tmpstr);
|
|
|
|
fprintf(codefile, "e = der_match_tag_and_length(p, len, %s, &%s, %s, "
|
|
"&%s_datalen, &l);\n",
|
|
classname(t->tag.tagclass),
|
|
typestring,
|
|
valuename(t->tag.tagclass, t->tag.tagvalue),
|
|
tmpstr);
|
|
|
|
/* XXX hardcode for now */
|
|
if (!replace_tag && support_ber && t->subtype->type == TOctetString) {
|
|
ide = typestring;
|
|
} else {
|
|
fprintf(codefile,
|
|
"if (e == 0 && %s != %s) { e = ASN1_BAD_ID; }\n",
|
|
typestring,
|
|
prim ? "PRIM" : "CONS");
|
|
}
|
|
|
|
if(optional) {
|
|
fprintf(codefile,
|
|
"if(e) {\n"
|
|
"%s = NULL;\n"
|
|
"} else {\n"
|
|
"%s = calloc(1, sizeof(*%s));\n"
|
|
"if (%s == NULL) { e = ENOMEM; %s; }\n",
|
|
name, name, name, name, forwstr);
|
|
} else if (defval) {
|
|
char *s;
|
|
|
|
if (asprintf(&s, "*(%s)", name) == -1 || s == NULL)
|
|
return ENOMEM;
|
|
fprintf(codefile, "if (e && e != ASN1_MISSING_FIELD) %s;\n", forwstr);
|
|
fprintf(codefile, "if (e == ASN1_MISSING_FIELD) {\n");
|
|
gen_assign_defval(s, defval);
|
|
free(s);
|
|
fprintf(codefile, "e = 0; l= 0;\n} else {\n");
|
|
} else {
|
|
fprintf(codefile, "if (e) %s;\n", forwstr);
|
|
}
|
|
|
|
if (replace_tag)
|
|
fprintf(codefile,
|
|
"lsave%u = %s_datalen + l;\n"
|
|
"lensave%u = len;\n"
|
|
"e = der_replace_tag(p, len, &pcopy%u, &len, asn1_tag_class_%s, %s, asn1_tag_tag_%s);\n"
|
|
"if (e) %s;\n"
|
|
"p = pcopy%u;\n",
|
|
depth, tmpstr, depth, depth, t->subtype->symbol->gen_name,
|
|
prim ? "PRIM" : "CONS",
|
|
t->subtype->symbol->gen_name,
|
|
forwstr, depth);
|
|
else
|
|
fprintf(codefile,
|
|
"p += l; len -= l; ret += l;\n");
|
|
if (!replace_tag)
|
|
fprintf(codefile,
|
|
"%s_oldlen = len;\n",
|
|
tmpstr);
|
|
if (support_ber && !replace_tag)
|
|
fprintf (codefile,
|
|
"if((is_indefinite%u = _heim_fix_dce(%s_datalen, &len)) < 0)\n"
|
|
"{ e = ASN1_BAD_FORMAT; %s; }\n"
|
|
"if (is_indefinite%u) { if (len < 2) { e = ASN1_OVERRUN; %s; } len -= 2; }",
|
|
depth, tmpstr, forwstr, depth, forwstr);
|
|
else if (!replace_tag)
|
|
fprintf(codefile,
|
|
"if (%s_datalen > len) { e = ASN1_OVERRUN; %s; }\n"
|
|
"len = %s_datalen;\n", tmpstr, forwstr, tmpstr);
|
|
if (asprintf (&tname, "%s_Tag", tmpstr) < 0 || tname == NULL)
|
|
errx(1, "malloc");
|
|
/*
|
|
* If `replace_tag' then here `p' and `len' will be the copy mutated by
|
|
* der_replace_tag().
|
|
*/
|
|
decode_type(name, t->subtype, 0, NULL, forwstr, tname, ide, depth + 1);
|
|
if (replace_tag)
|
|
fprintf(codefile,
|
|
"p = psave%u + lsave%u;\n"
|
|
"len = lensave%u - lsave%u;\n"
|
|
"ret += lsave%u - l;\n"
|
|
"free(pcopy%u);\n",
|
|
depth, depth, depth, depth, depth, depth);
|
|
else if(support_ber)
|
|
fprintf(codefile,
|
|
"if(is_indefinite%u){\n"
|
|
"len += 2;\n"
|
|
"e = der_match_tag_and_length(p, len, "
|
|
"(Der_class)0, &%s, UT_EndOfContent, "
|
|
"&%s_datalen, &l);\n"
|
|
"if(e) %s;\n"
|
|
"p += l; len -= l; ret += l;\n"
|
|
"if (%s != (Der_type)0) { e = ASN1_BAD_ID; %s; }\n"
|
|
"} else \n",
|
|
depth,
|
|
typestring,
|
|
tmpstr,
|
|
forwstr,
|
|
typestring, forwstr);
|
|
if (!replace_tag)
|
|
fprintf(codefile,
|
|
"len = %s_oldlen - %s_datalen;\n",
|
|
tmpstr, tmpstr);
|
|
if (optional)
|
|
fprintf(codefile, "}\n");
|
|
else if (defval)
|
|
fprintf(codefile, "}\n");
|
|
fprintf(codefile, "}\n");
|
|
free(tname);
|
|
free(typestring);
|
|
break;
|
|
}
|
|
case TChoice: {
|
|
Member *m, *have_ellipsis = NULL;
|
|
const char *els = "";
|
|
|
|
if (t->members == NULL)
|
|
break;
|
|
|
|
HEIM_TAILQ_FOREACH(m, t->members, members) {
|
|
const Type *tt = m->type;
|
|
char *s = NULL;
|
|
Der_class cl;
|
|
Der_type ty;
|
|
unsigned tag;
|
|
|
|
if (m->ellipsis) {
|
|
have_ellipsis = m;
|
|
continue;
|
|
}
|
|
|
|
find_tag(tt, &cl, &ty, &tag);
|
|
|
|
fprintf(codefile,
|
|
"%sif (der_match_tag(p, len, %s, %s, %s, NULL) == 0) {\n",
|
|
els,
|
|
classname(cl),
|
|
ty ? "CONS" : "PRIM",
|
|
valuename(cl, tag));
|
|
if (asprintf (&s, "%s(%s)->u.%s", m->optional ? "" : "&",
|
|
name, m->gen_name) < 0 || s == NULL)
|
|
errx(1, "malloc");
|
|
decode_type(s, m->type, m->optional, NULL, forwstr, m->gen_name,
|
|
NULL, depth + 1);
|
|
fprintf(codefile,
|
|
"(%s)->element = %s;\n",
|
|
name, m->label);
|
|
free(s);
|
|
fprintf(codefile,
|
|
"}\n");
|
|
els = "else ";
|
|
}
|
|
if (have_ellipsis) {
|
|
fprintf(codefile,
|
|
"else {\n"
|
|
"(%s)->u.%s.data = calloc(1, len);\n"
|
|
"if ((%s)->u.%s.data == NULL) {\n"
|
|
"e = ENOMEM; %s;\n"
|
|
"}\n"
|
|
"(%s)->u.%s.length = len;\n"
|
|
"memcpy((%s)->u.%s.data, p, len);\n"
|
|
"(%s)->element = %s;\n"
|
|
"p += len;\n"
|
|
"ret += len;\n"
|
|
"len = 0;\n"
|
|
"}\n",
|
|
name, have_ellipsis->gen_name,
|
|
name, have_ellipsis->gen_name,
|
|
forwstr,
|
|
name, have_ellipsis->gen_name,
|
|
name, have_ellipsis->gen_name,
|
|
name, have_ellipsis->label);
|
|
} else {
|
|
fprintf(codefile,
|
|
"else {\n"
|
|
"e = ASN1_PARSE_ERROR;\n"
|
|
"%s;\n"
|
|
"}\n",
|
|
forwstr);
|
|
}
|
|
break;
|
|
}
|
|
case TUTCTime:
|
|
decode_primitive ("utctime", name, forwstr);
|
|
break;
|
|
case TUTF8String:
|
|
decode_primitive ("utf8string", name, forwstr);
|
|
break;
|
|
case TPrintableString:
|
|
decode_primitive ("printable_string", name, forwstr);
|
|
break;
|
|
case TIA5String:
|
|
decode_primitive ("ia5_string", name, forwstr);
|
|
break;
|
|
case TBMPString:
|
|
decode_primitive ("bmp_string", name, forwstr);
|
|
break;
|
|
case TUniversalString:
|
|
decode_primitive ("universal_string", name, forwstr);
|
|
break;
|
|
case TVisibleString:
|
|
decode_primitive ("visible_string", name, forwstr);
|
|
break;
|
|
case TNull:
|
|
fprintf (codefile, "/* NULL */\n");
|
|
break;
|
|
case TOID:
|
|
decode_primitive ("oid", name, forwstr);
|
|
break;
|
|
default :
|
|
abort ();
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
void
|
|
generate_type_decode (const Symbol *s)
|
|
{
|
|
int preserve = preserve_type(s->name) ? TRUE : FALSE;
|
|
|
|
fprintf (codefile, "int ASN1CALL\n"
|
|
"decode_%s(const unsigned char *p HEIMDAL_UNUSED_ATTRIBUTE,"
|
|
" size_t len HEIMDAL_UNUSED_ATTRIBUTE, %s *data, size_t *size)\n"
|
|
"{\n",
|
|
s->gen_name, s->gen_name);
|
|
|
|
switch (s->type->type) {
|
|
case TInteger:
|
|
case TBoolean:
|
|
case TOctetString:
|
|
case TOID:
|
|
case TGeneralizedTime:
|
|
case TGeneralString:
|
|
case TTeletexString:
|
|
case TUTF8String:
|
|
case TPrintableString:
|
|
case TIA5String:
|
|
case TBMPString:
|
|
case TUniversalString:
|
|
case TVisibleString:
|
|
case TUTCTime:
|
|
case TNull:
|
|
case TEnumerated:
|
|
case TBitString:
|
|
case TSequence:
|
|
case TSequenceOf:
|
|
case TSet:
|
|
case TSetOf:
|
|
case TTag:
|
|
case TType:
|
|
case TChoice:
|
|
fprintf (codefile,
|
|
"size_t ret = 0;\n"
|
|
"size_t l HEIMDAL_UNUSED_ATTRIBUTE;\n"
|
|
"int e HEIMDAL_UNUSED_ATTRIBUTE;\n");
|
|
if (preserve)
|
|
fprintf (codefile, "const unsigned char *begin = p;\n");
|
|
|
|
fprintf (codefile, "\n");
|
|
fprintf (codefile, "memset(data, 0, sizeof(*data));\n"); /* hack to avoid `unused variable' */
|
|
|
|
decode_type("data", s->type, 0, NULL, "goto fail", "Top", NULL, 1);
|
|
if (preserve)
|
|
fprintf (codefile,
|
|
"data->_save.data = calloc(1, ret);\n"
|
|
"if (data->_save.data == NULL) { \n"
|
|
"e = ENOMEM; goto fail; \n"
|
|
"}\n"
|
|
"data->_save.length = ret;\n"
|
|
"memcpy(data->_save.data, begin, ret);\n");
|
|
fprintf (codefile,
|
|
"if(size) *size = ret;\n"
|
|
"return 0;\n");
|
|
fprintf (codefile,
|
|
"fail:\n"
|
|
"free_%s(data);\n"
|
|
"return e;\n",
|
|
s->gen_name);
|
|
break;
|
|
default:
|
|
abort ();
|
|
}
|
|
fprintf (codefile, "}\n\n");
|
|
}
|