1b528cefcSMark Murray /*
2*ae771770SStanislav Sedov * Copyright (c) 1997, 1999, 2000, 2003 - 2005 Kungliga Tekniska Högskolan
3b528cefcSMark Murray * (Royal Institute of Technology, Stockholm, Sweden).
4b528cefcSMark Murray * All rights reserved.
5b528cefcSMark Murray *
6*ae771770SStanislav Sedov * Portions Copyright (c) 2009 Apple Inc. All rights reserved.
7*ae771770SStanislav Sedov *
8b528cefcSMark Murray * Redistribution and use in source and binary forms, with or without
9b528cefcSMark Murray * modification, are permitted provided that the following conditions
10b528cefcSMark Murray * are met:
11b528cefcSMark Murray *
12b528cefcSMark Murray * 1. Redistributions of source code must retain the above copyright
13b528cefcSMark Murray * notice, this list of conditions and the following disclaimer.
14b528cefcSMark Murray *
15b528cefcSMark Murray * 2. Redistributions in binary form must reproduce the above copyright
16b528cefcSMark Murray * notice, this list of conditions and the following disclaimer in the
17b528cefcSMark Murray * documentation and/or other materials provided with the distribution.
18b528cefcSMark Murray *
19b528cefcSMark Murray * 3. Neither the name of the Institute nor the names of its contributors
20b528cefcSMark Murray * may be used to endorse or promote products derived from this software
21b528cefcSMark Murray * without specific prior written permission.
22b528cefcSMark Murray *
23b528cefcSMark Murray * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
24b528cefcSMark Murray * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25b528cefcSMark Murray * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26b528cefcSMark Murray * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
27b528cefcSMark Murray * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28b528cefcSMark Murray * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29b528cefcSMark Murray * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30b528cefcSMark Murray * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31b528cefcSMark Murray * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32b528cefcSMark Murray * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33b528cefcSMark Murray * SUCH DAMAGE.
34b528cefcSMark Murray */
35b528cefcSMark Murray
36b528cefcSMark Murray #include "gen_locl.h"
37b528cefcSMark Murray
38*ae771770SStanislav Sedov RCSID("$Id$");
39b528cefcSMark Murray
40b528cefcSMark Murray static void
generate_2int(const Type * t,const char * gen_name)41c19800e8SDoug Rabson generate_2int (const Type *t, const char *gen_name)
42b528cefcSMark Murray {
43b528cefcSMark Murray Member *m;
44b528cefcSMark Murray
45b528cefcSMark Murray fprintf (headerfile,
46b528cefcSMark Murray "unsigned %s2int(%s);\n",
47c19800e8SDoug Rabson gen_name, gen_name);
48b528cefcSMark Murray
49b528cefcSMark Murray fprintf (codefile,
50b528cefcSMark Murray "unsigned %s2int(%s f)\n"
51b528cefcSMark Murray "{\n"
52b528cefcSMark Murray "unsigned r = 0;\n",
53c19800e8SDoug Rabson gen_name, gen_name);
54b528cefcSMark Murray
55c19800e8SDoug Rabson ASN1_TAILQ_FOREACH(m, t->members, members) {
56b528cefcSMark Murray fprintf (codefile, "if(f.%s) r |= (1U << %d);\n",
57b528cefcSMark Murray m->gen_name, m->val);
58b528cefcSMark Murray }
59b528cefcSMark Murray fprintf (codefile, "return r;\n"
60b528cefcSMark Murray "}\n\n");
61b528cefcSMark Murray }
62b528cefcSMark Murray
63b528cefcSMark Murray static void
generate_int2(const Type * t,const char * gen_name)64c19800e8SDoug Rabson generate_int2 (const Type *t, const char *gen_name)
65b528cefcSMark Murray {
66b528cefcSMark Murray Member *m;
67b528cefcSMark Murray
68b528cefcSMark Murray fprintf (headerfile,
69b528cefcSMark Murray "%s int2%s(unsigned);\n",
70c19800e8SDoug Rabson gen_name, gen_name);
71b528cefcSMark Murray
72b528cefcSMark Murray fprintf (codefile,
73b528cefcSMark Murray "%s int2%s(unsigned n)\n"
74b528cefcSMark Murray "{\n"
75*ae771770SStanislav Sedov "\t%s flags;\n\n"
76*ae771770SStanislav Sedov "\tmemset(&flags, 0, sizeof(flags));\n\n",
77c19800e8SDoug Rabson gen_name, gen_name, gen_name);
78b528cefcSMark Murray
79c19800e8SDoug Rabson if(t->members) {
80c19800e8SDoug Rabson ASN1_TAILQ_FOREACH(m, t->members, members) {
81b528cefcSMark Murray fprintf (codefile, "\tflags.%s = (n >> %d) & 1;\n",
82b528cefcSMark Murray m->gen_name, m->val);
83c19800e8SDoug Rabson }
84b528cefcSMark Murray }
85b528cefcSMark Murray fprintf (codefile, "\treturn flags;\n"
86b528cefcSMark Murray "}\n\n");
87b528cefcSMark Murray }
88b528cefcSMark Murray
89b528cefcSMark Murray /*
90b528cefcSMark Murray * This depends on the bit string being declared in increasing order
91b528cefcSMark Murray */
92b528cefcSMark Murray
93b528cefcSMark Murray static void
generate_units(const Type * t,const char * gen_name)94c19800e8SDoug Rabson generate_units (const Type *t, const char *gen_name)
95b528cefcSMark Murray {
96b528cefcSMark Murray Member *m;
97b528cefcSMark Murray
98*ae771770SStanislav Sedov if (template_flag) {
99b528cefcSMark Murray fprintf (headerfile,
100*ae771770SStanislav Sedov "extern const struct units *asn1_%s_table_units;\n",
101c19800e8SDoug Rabson gen_name);
102*ae771770SStanislav Sedov fprintf (headerfile, "#define asn1_%s_units() (asn1_%s_table_units)\n",
103*ae771770SStanislav Sedov gen_name, gen_name);
104*ae771770SStanislav Sedov } else {
105*ae771770SStanislav Sedov fprintf (headerfile,
106*ae771770SStanislav Sedov "const struct units * asn1_%s_units(void);\n",
107*ae771770SStanislav Sedov gen_name);
108*ae771770SStanislav Sedov }
109b528cefcSMark Murray
110b528cefcSMark Murray fprintf (codefile,
111c19800e8SDoug Rabson "static struct units %s_units[] = {\n",
112c19800e8SDoug Rabson gen_name);
113b528cefcSMark Murray
114c19800e8SDoug Rabson if(t->members) {
115c19800e8SDoug Rabson ASN1_TAILQ_FOREACH_REVERSE(m, t->members, memhead, members) {
116b528cefcSMark Murray fprintf (codefile,
117*ae771770SStanislav Sedov "\t{\"%s\",\t1U << %d},\n", m->name, m->val);
118c19800e8SDoug Rabson }
119b528cefcSMark Murray }
120b528cefcSMark Murray
121b528cefcSMark Murray fprintf (codefile,
122b528cefcSMark Murray "\t{NULL,\t0}\n"
123b528cefcSMark Murray "};\n\n");
124c19800e8SDoug Rabson
125*ae771770SStanislav Sedov if (template_flag)
126*ae771770SStanislav Sedov fprintf (codefile,
127*ae771770SStanislav Sedov "const struct units * asn1_%s_table_units = %s_units;\n",
128*ae771770SStanislav Sedov gen_name, gen_name);
129*ae771770SStanislav Sedov else
130c19800e8SDoug Rabson fprintf (codefile,
131c19800e8SDoug Rabson "const struct units * asn1_%s_units(void){\n"
132c19800e8SDoug Rabson "return %s_units;\n"
133c19800e8SDoug Rabson "}\n\n",
134c19800e8SDoug Rabson gen_name, gen_name);
135c19800e8SDoug Rabson
136c19800e8SDoug Rabson
137b528cefcSMark Murray }
138b528cefcSMark Murray
139b528cefcSMark Murray void
generate_glue(const Type * t,const char * gen_name)140c19800e8SDoug Rabson generate_glue (const Type *t, const char *gen_name)
141b528cefcSMark Murray {
142c19800e8SDoug Rabson switch(t->type) {
143c19800e8SDoug Rabson case TTag:
144c19800e8SDoug Rabson generate_glue(t->subtype, gen_name);
145c19800e8SDoug Rabson break;
146b528cefcSMark Murray case TBitString :
147c19800e8SDoug Rabson if (!ASN1_TAILQ_EMPTY(t->members)) {
148c19800e8SDoug Rabson generate_2int (t, gen_name);
149c19800e8SDoug Rabson generate_int2 (t, gen_name);
150c19800e8SDoug Rabson generate_units (t, gen_name);
151c19800e8SDoug Rabson }
152b528cefcSMark Murray break;
153b528cefcSMark Murray default :
154b528cefcSMark Murray break;
155b528cefcSMark Murray }
156b528cefcSMark Murray }
157