Sync usage with man page.
[netbsd-mini2440.git] / crypto / dist / heimdal / lib / asn1 / gen_glue.c
blobc002e6e2c7fbe73b82eeae5c7f8d39a830d0afe5
1 /*
2 * Copyright (c) 1997, 1999, 2000, 2003 - 2005 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
4 * All rights reserved.
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
8 * are met:
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
31 * SUCH DAMAGE.
34 #include "gen_locl.h"
36 __RCSID("$Heimdal: gen_glue.c 15617 2005-07-12 06:27:42Z lha $"
37 "$NetBSD$");
39 static void
40 generate_2int (const Type *t, const char *gen_name)
42 Member *m;
44 fprintf (headerfile,
45 "unsigned %s2int(%s);\n",
46 gen_name, gen_name);
48 fprintf (codefile,
49 "unsigned %s2int(%s f)\n"
50 "{\n"
51 "unsigned r = 0;\n",
52 gen_name, gen_name);
54 ASN1_TAILQ_FOREACH(m, t->members, members) {
55 fprintf (codefile, "if(f.%s) r |= (1U << %d);\n",
56 m->gen_name, m->val);
58 fprintf (codefile, "return r;\n"
59 "}\n\n");
62 static void
63 generate_int2 (const Type *t, const char *gen_name)
65 Member *m;
67 fprintf (headerfile,
68 "%s int2%s(unsigned);\n",
69 gen_name, gen_name);
71 fprintf (codefile,
72 "%s int2%s(unsigned n)\n"
73 "{\n"
74 "\t%s flags;\n\n",
75 gen_name, gen_name, gen_name);
77 if(t->members) {
78 ASN1_TAILQ_FOREACH(m, t->members, members) {
79 fprintf (codefile, "\tflags.%s = (n >> %d) & 1;\n",
80 m->gen_name, m->val);
83 fprintf (codefile, "\treturn flags;\n"
84 "}\n\n");
88 * This depends on the bit string being declared in increasing order
91 static void
92 generate_units (const Type *t, const char *gen_name)
94 Member *m;
96 fprintf (headerfile,
97 "const struct units * asn1_%s_units(void);",
98 gen_name);
100 fprintf (codefile,
101 "static struct units %s_units[] = {\n",
102 gen_name);
104 if(t->members) {
105 ASN1_TAILQ_FOREACH_REVERSE(m, t->members, memhead, members) {
106 fprintf (codefile,
107 "\t{\"%s\",\t1U << %d},\n", m->gen_name, m->val);
111 fprintf (codefile,
112 "\t{NULL,\t0}\n"
113 "};\n\n");
115 fprintf (codefile,
116 "const struct units * asn1_%s_units(void){\n"
117 "return %s_units;\n"
118 "}\n\n",
119 gen_name, gen_name);
124 void
125 generate_glue (const Type *t, const char *gen_name)
127 switch(t->type) {
128 case TTag:
129 generate_glue(t->subtype, gen_name);
130 break;
131 case TBitString :
132 if (!ASN1_TAILQ_EMPTY(t->members)) {
133 generate_2int (t, gen_name);
134 generate_int2 (t, gen_name);
135 generate_units (t, gen_name);
137 break;
138 default :
139 break;