2 * Copyright (c) 1997, 1999, 2000, 2003 - 2005 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
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.
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.
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
39 generate_2int (const Type
*t
, const char *gen_name
)
44 "unsigned %s2int(%s);\n",
48 "unsigned %s2int(%s f)\n"
53 ASN1_TAILQ_FOREACH(m
, t
->members
, members
) {
54 fprintf (codefile
, "if(f.%s) r |= (1U << %d);\n",
57 fprintf (codefile
, "return r;\n"
62 generate_int2 (const Type
*t
, const char *gen_name
)
67 "%s int2%s(unsigned);\n",
71 "%s int2%s(unsigned n)\n"
74 gen_name
, gen_name
, gen_name
);
77 ASN1_TAILQ_FOREACH(m
, t
->members
, members
) {
78 fprintf (codefile
, "\tflags.%s = (n >> %d) & 1;\n",
82 fprintf (codefile
, "\treturn flags;\n"
87 * This depends on the bit string being declared in increasing order
91 generate_units (const Type
*t
, const char *gen_name
)
96 "const struct units * asn1_%s_units(void);",
100 "static struct units %s_units[] = {\n",
104 ASN1_TAILQ_FOREACH_REVERSE(m
, t
->members
, memhead
, members
) {
106 "\t{\"%s\",\t1U << %d},\n", m
->name
, m
->val
);
115 "const struct units * asn1_%s_units(void){\n"
124 generate_glue (const Type
*t
, const char *gen_name
)
128 generate_glue(t
->subtype
, gen_name
);
131 if (!ASN1_TAILQ_EMPTY(t
->members
)) {
132 generate_2int (t
, gen_name
);
133 generate_int2 (t
, gen_name
);
134 generate_units (t
, gen_name
);