Line data Source code
1 : /*
2 : * Copyright (c) 1997, 1999, 2000, 2003 - 2005 Kungliga Tekniska Högskolan
3 : * (Royal Institute of Technology, Stockholm, Sweden).
4 : * All rights reserved.
5 : *
6 : * Portions Copyright (c) 2009 Apple Inc. All rights reserved.
7 : *
8 : * Redistribution and use in source and binary forms, with or without
9 : * modification, are permitted provided that the following conditions
10 : * are met:
11 : *
12 : * 1. Redistributions of source code must retain the above copyright
13 : * notice, this list of conditions and the following disclaimer.
14 : *
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.
18 : *
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.
22 : *
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
33 : * SUCH DAMAGE.
34 : */
35 :
36 : #include "gen_locl.h"
37 :
38 : RCSID("$Id$");
39 :
40 : static FILE *
41 8797 : get_code_file(void)
42 : {
43 8334 : if (!one_code_file && template_flag && templatefile)
44 0 : return templatefile;
45 8797 : return codefile;
46 : }
47 :
48 : static void
49 247 : generate_2int (const Type *t, const char *gen_name)
50 : {
51 13 : Member *m;
52 :
53 247 : fprintf (headerfile,
54 : "uint64_t %s2int(%s);\n",
55 : gen_name, gen_name);
56 :
57 260 : fprintf (get_code_file(),
58 : "uint64_t %s2int(%s f)\n"
59 : "{\n"
60 : "uint64_t r = 0;\n",
61 : gen_name, gen_name);
62 :
63 2603 : HEIM_TAILQ_FOREACH(m, t->members, members) {
64 2356 : fprintf (get_code_file(), "if(f.%s) r |= (1ULL << %d);\n",
65 2356 : m->gen_name, (int)m->val);
66 : }
67 260 : fprintf (get_code_file(), "return r;\n"
68 : "}\n\n");
69 247 : }
70 :
71 : static void
72 247 : generate_int2 (const Type *t, const char *gen_name)
73 : {
74 13 : Member *m;
75 :
76 247 : fprintf (headerfile,
77 : "%s int2%s(uint64_t);\n",
78 : gen_name, gen_name);
79 :
80 260 : fprintf (get_code_file(),
81 : "%s int2%s(uint64_t n)\n"
82 : "{\n"
83 : "\t%s flags;\n\n"
84 : "\tmemset(&flags, 0, sizeof(flags));\n\n",
85 : gen_name, gen_name, gen_name);
86 :
87 247 : if(t->members) {
88 2603 : HEIM_TAILQ_FOREACH(m, t->members, members) {
89 2356 : fprintf (get_code_file(), "\tflags.%s = (n >> %d) & 1;\n",
90 2356 : m->gen_name, (int)m->val);
91 : }
92 : }
93 260 : fprintf (get_code_file(), "\treturn flags;\n"
94 : "}\n\n");
95 247 : }
96 :
97 : /*
98 : * This depends on the bit string being declared in increasing order
99 : */
100 :
101 : static void
102 247 : generate_units (const Type *t, const char *gen_name)
103 : {
104 13 : Member *m;
105 :
106 247 : fprintf (headerfile,
107 : "const struct units * asn1_%s_units(void);\n",
108 : gen_name);
109 :
110 260 : fprintf (get_code_file(),
111 : "static struct units %s_units[] = {\n",
112 : gen_name);
113 :
114 247 : if(t->members) {
115 2603 : HEIM_TAILQ_FOREACH_REVERSE(m, t->members, memhead, members) {
116 2356 : fprintf (get_code_file(),
117 2356 : "\t{\"%s\",\t1ULL << %d},\n", m->name, (int)m->val);
118 : }
119 : }
120 :
121 260 : fprintf (get_code_file(),
122 : "\t{NULL,\t0}\n"
123 : "};\n\n");
124 :
125 260 : fprintf (get_code_file(),
126 : "const struct units * asn1_%s_units(void){\n"
127 : "return %s_units;\n"
128 : "}\n\n",
129 : gen_name, gen_name);
130 :
131 :
132 247 : }
133 :
134 : void
135 14485 : generate_glue (const Type *t, const char *gen_name)
136 : {
137 14858 : switch(t->type) {
138 7087 : case TTag:
139 7087 : generate_glue(t->subtype, gen_name);
140 7087 : break;
141 266 : case TBitString : {
142 14 : Member *m;
143 :
144 266 : if (HEIM_TAILQ_EMPTY(t->members))
145 18 : break;
146 2603 : HEIM_TAILQ_FOREACH(m, t->members, members) {
147 2356 : if (m->val > 63) {
148 0 : warnx("Not generating 2int, int2, or units for %s due to "
149 : "having a member valued more than 63", gen_name);
150 0 : return;
151 : }
152 : }
153 247 : generate_2int (t, gen_name);
154 247 : generate_int2 (t, gen_name);
155 247 : if (parse_units_flag)
156 247 : generate_units (t, gen_name);
157 234 : break;
158 : }
159 7110 : default :
160 7110 : break;
161 : }
162 : }
|