Debian Codegraph @

lib/asn1/gen_free.c

raw
1 /*
2 * Copyright (c) 1997 - 2005 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
4 * All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
8 * are met:
9 *
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 *
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.
16 *
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.
20 *
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.
32 */
33
34 #include "gen_locl.h"
35
36 RCSID("$Id$");
37
38 static void
39 free_primitive (const char *typename, const char *name)
40 {
41 fprintf (codefile, "der_free_%s(%s);\n", typename, name);
42 }
43
44 static void
45 free_type (const char *name, const Type *t, int preserve)
46 {
47 switch (t->type) {
48 case TType:
49 #if 0
50 free_type (name, t->symbol->type, preserve);
51 #endif
52 fprintf (codefile, "free_%s(%s);\n", t->symbol->gen_name, name);
53 break;
54 case TInteger:
55 if (t->range == NULL && t->members == NULL) {
56 free_primitive ("heim_integer", name);
57 break;
58 }
59 /* fallthrough */
60 case TBoolean:
61 case TEnumerated :
62 case TNull:
63 case TGeneralizedTime:
64 case TUTCTime:
65 /*
66 * This doesn't do much, but it leaves zeros where garbage might
67 * otherwise have been found. Gets us closer to having the equivalent
68 * of a memset()-to-zero data structure after calling the free
69 * functions.
70 */
71 fprintf(codefile, "*%s = 0;\n", name);
72 break;
73 case TBitString:
74 if (ASN1_TAILQ_EMPTY(t->members))
75 free_primitive("bit_string", name);
76 break;
77 case TOctetString:
78 free_primitive ("octet_string", name);
79 break;
80 case TChoice:
81 case TSet:
82 case TSequence: {
83 Member *m, *have_ellipsis = NULL;
84
85 if (t->members == NULL)
86 break;
87
88 if ((t->type == TSequence || t->type == TChoice) && preserve)
89 fprintf(codefile, "der_free_octet_string(&data->_save);\n");
90
91 if(t->type == TChoice)
92 fprintf(codefile, "switch((%s)->element) {\n", name);
93
94 ASN1_TAILQ_FOREACH(m, t->members, members) {
95 char *s;
96
97 if (m->ellipsis){
98 have_ellipsis = m;
99 continue;
100 }
101
102 if(t->type == TChoice)
103 fprintf(codefile, "case %s:\n", m->label);
104 if (asprintf (&s, "%s(%s)->%s%s",
105 m->optional ? "" : "&", name,
106 t->type == TChoice ? "u." : "", m->gen_name) < 0 || s == NULL)
107 errx(1, "malloc");
108 if(m->optional)
109 fprintf(codefile, "if(%s) {\n", s);
110 free_type (s, m->type, FALSE);
111 if(m->optional)
112 fprintf(codefile,
113 "free(%s);\n"
114 "%s = NULL;\n"
115 "}\n",s, s);
116 free (s);
117 if(t->type == TChoice)
118 fprintf(codefile, "break;\n");
119 }
120
121 if(t->type == TChoice) {
122 if (have_ellipsis)
123 fprintf(codefile,
124 "case %s:\n"
125 "der_free_octet_string(&(%s)->u.%s);\n"
126 "break;",
127 have_ellipsis->label,
128 name, have_ellipsis->gen_name);
129 fprintf(codefile, "}\n");
130 }
131 break;
132 }
133 case TSetOf:
134 case TSequenceOf: {
135 char *n;
136
137 fprintf (codefile, "while((%s)->len){\n", name);
138 if (asprintf (&n, "&(%s)->val[(%s)->len-1]", name, name) < 0 || n == NULL)
139 errx(1, "malloc");
140 free_type(n, t->subtype, FALSE);
141 fprintf(codefile,
142 "(%s)->len--;\n"
143 "}\n",
144 name);
145 fprintf(codefile,
146 "free((%s)->val);\n"
147 "(%s)->val = NULL;\n", name, name);
148 free(n);
149 break;
150 }
151 case TGeneralString:
152 free_primitive ("general_string", name);
153 break;
154 case TTeletexString:
155 free_primitive ("general_string", name);
156 break;
157 case TUTF8String:
158 free_primitive ("utf8string", name);
159 break;
160 case TPrintableString:
161 free_primitive ("printable_string", name);
162 break;
163 case TIA5String:
164 free_primitive ("ia5_string", name);
165 break;
166 case TBMPString:
167 free_primitive ("bmp_string", name);
168 break;
169 case TUniversalString:
170 free_primitive ("universal_string", name);
171 break;
172 case TVisibleString:
173 free_primitive ("visible_string", name);
174 break;
175 case TTag:
176 free_type (name, t->subtype, preserve);
177 break;
178 case TOID :
179 free_primitive ("oid", name);
180 break;
181 default :
182 abort ();
183 }
184 }
185
186 void
187 generate_type_free (const Symbol *s)
188 {
189 int preserve = preserve_type(s->name) ? TRUE : FALSE;
190
191 fprintf (codefile, "void ASN1CALL\n"
192 "free_%s(%s *data)\n"
193 "{\n",
194 s->gen_name, s->gen_name);
195
196 free_type ("data", s->type, preserve);
197 fprintf (codefile, "}\n\n");
198 }
199