1 /* $NetBSD: gen_glue.c,v 1.1.1.2 2014/04/24 12:45:28 pettai Exp $ */
4 * Copyright (c) 1997, 1999, 2000, 2003 - 2005 Kungliga Tekniska Högskolan
5 * (Royal Institute of Technology, Stockholm, Sweden).
8 * Portions Copyright (c) 2009 Apple Inc. All rights reserved.
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
14 * 1. Redistributions of source code must retain the above copyright
15 * notice, this list of conditions and the following disclaimer.
17 * 2. Redistributions in binary form must reproduce the above copyright
18 * notice, this list of conditions and the following disclaimer in the
19 * documentation and/or other materials provided with the distribution.
21 * 3. Neither the name of the Institute nor the names of its contributors
22 * may be used to endorse or promote products derived from this software
23 * without specific prior written permission.
25 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
43 generate_2int (const Type
*t
, const char *gen_name
)
48 "unsigned %s2int(%s);\n",
52 "unsigned %s2int(%s f)\n"
57 ASN1_TAILQ_FOREACH(m
, t
->members
, members
) {
58 fprintf (codefile
, "if(f.%s) r |= (1U << %d);\n",
61 fprintf (codefile
, "return r;\n"
66 generate_int2 (const Type
*t
, const char *gen_name
)
71 "%s int2%s(unsigned);\n",
75 "%s int2%s(unsigned n)\n"
78 "\tmemset(&flags, 0, sizeof(flags));\n\n",
79 gen_name
, gen_name
, gen_name
);
82 ASN1_TAILQ_FOREACH(m
, t
->members
, members
) {
83 fprintf (codefile
, "\tflags.%s = (n >> %d) & 1;\n",
87 fprintf (codefile
, "\treturn flags;\n"
92 * This depends on the bit string being declared in increasing order
96 generate_units (const Type
*t
, const char *gen_name
)
102 "extern const struct units *asn1_%s_table_units;\n",
104 fprintf (headerfile
, "#define asn1_%s_units() (asn1_%s_table_units)\n",
108 "const struct units * asn1_%s_units(void);\n",
113 "static struct units %s_units[] = {\n",
117 ASN1_TAILQ_FOREACH_REVERSE(m
, t
->members
, memhead
, members
) {
119 "\t{\"%s\",\t1U << %d},\n", m
->name
, m
->val
);
129 "const struct units * asn1_%s_table_units = %s_units;\n",
133 "const struct units * asn1_%s_units(void){\n"
142 generate_glue (const Type
*t
, const char *gen_name
)
146 generate_glue(t
->subtype
, gen_name
);
149 if (!ASN1_TAILQ_EMPTY(t
->members
)) {
150 generate_2int (t
, gen_name
);
151 generate_int2 (t
, gen_name
);
152 generate_units (t
, gen_name
);