1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
|
/*
* Copyright (c) 1997, 1999 Kungliga Tekniska Högskolan
* (Royal Institute of Technology, Stockholm, Sweden).
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* 3. Neither the name of the Institute nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include "gen_locl.h"
RCSID("$Id: gen_glue.c,v 1.8 2005/04/25 18:07:07 lha Exp $");
static void
generate_2int (const Symbol *s)
{
Type *t = s->type;
Member *m;
int tag = -1;
fprintf (headerfile,
"unsigned %s2int(%s);\n",
s->gen_name, s->gen_name);
fprintf (codefile,
"unsigned %s2int(%s f)\n"
"{\n"
"unsigned r = 0;\n",
s->gen_name, s->gen_name);
for (m = t->members; m && m->val != tag; m = m->next) {
fprintf (codefile, "if(f.%s) r |= (1U << %d);\n",
m->gen_name, m->val);
if (tag == -1)
tag = m->val;
}
fprintf (codefile, "return r;\n"
"}\n\n");
}
static void
generate_int2 (const Symbol *s)
{
Type *t = s->type;
Member *m;
int tag = -1;
fprintf (headerfile,
"%s int2%s(unsigned);\n",
s->gen_name, s->gen_name);
fprintf (codefile,
"%s int2%s(unsigned n)\n"
"{\n"
"\t%s flags;\n\n",
s->gen_name, s->gen_name, s->gen_name);
for (m = t->members; m && m->val != tag; m = m->next) {
fprintf (codefile, "\tflags.%s = (n >> %d) & 1;\n",
m->gen_name, m->val);
if (tag == -1)
tag = m->val;
}
fprintf (codefile, "\treturn flags;\n"
"}\n\n");
}
/*
* This depends on the bit string being declared in increasing order
*/
static void
generate_units (const Symbol *s)
{
Type *t = s->type;
Member *m;
int tag = -1;
fprintf (headerfile,
"const struct units * asn1_%s_units(void);",
s->gen_name);
fprintf (codefile,
"static struct units %s_units[] = {\n",
s->gen_name);
if(t->members)
for (m = t->members->prev; m && m->val != tag; m = m->prev) {
fprintf (codefile,
"\t{\"%s\",\t1U << %d},\n", m->gen_name, m->val);
if (tag == -1)
tag = m->val;
}
fprintf (codefile,
"\t{NULL,\t0}\n"
"};\n\n");
fprintf (codefile,
"const struct units * asn1_%s_units(void){\n"
"return %s_units;\n"
"}\n\n",
s->gen_name, s->gen_name);
}
void
generate_glue (const Symbol *s)
{
switch(s->type->type) {
case TBitString :
generate_2int (s);
generate_int2 (s);
generate_units (s);
break;
default :
break;
}
}
|
