2 * Copyright (c) 1997, 1999, 2000, 2003 - 2005 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
6 * Portions Copyright (c) 2009 Apple Inc. All rights reserved.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
19 * 3. Neither the name of the Institute nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
23 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
43 if (!one_code_file && template_flag && templatefile)
49 generate_2int (const Type *t, const char *gen_name)
54 "uint64_t %s2int(%s);\n",
57 fprintf (get_code_file(),
58 "uint64_t %s2int(%s f)\n"
63 HEIM_TAILQ_FOREACH(m, t->members, members) {
64 fprintf (get_code_file(), "if(f.%s) r |= (1ULL << %d);\n",
67 fprintf (get_code_file(), "return r;\n"
72 generate_int2 (const Type *t, const char *gen_name)
77 "%s int2%s(uint64_t);\n",
80 fprintf (get_code_file(),
81 "%s int2%s(uint64_t n)\n"
84 "\tmemset(&flags, 0, sizeof(flags));\n\n",
85 gen_name, gen_name, gen_name);
88 HEIM_TAILQ_FOREACH(m, t->members, members) {
89 fprintf (get_code_file(), "\tflags.%s = (n >> %d) & 1;\n",
93 fprintf (get_code_file(), "\treturn flags;\n"
98 * This depends on the bit string being declared in increasing order
102 generate_units (const Type *t, const char *gen_name)
107 "const struct units * asn1_%s_units(void);\n",
110 fprintf (get_code_file(),
111 "static struct units %s_units[] = {\n",
115 HEIM_TAILQ_FOREACH_REVERSE(m, t->members, memhead, members) {
116 fprintf (get_code_file(),
117 "\t{\"%s\",\t1ULL << %d},\n", m->name, m->val);
121 fprintf (get_code_file(),
125 fprintf (get_code_file(),
126 "const struct units * asn1_%s_units(void){\n"
135 generate_glue (const Type *t, const char *gen_name)
139 generate_glue(t->subtype, gen_name);
144 if (HEIM_TAILQ_EMPTY(t->members))
146 HEIM_TAILQ_FOREACH(m, t->members, members) {
150 generate_2int (t, gen_name);
151 generate_int2 (t, gen_name);
152 if (parse_units_flag)
153 generate_units (t, gen_name);