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 36RCSID("$Id$"); 37 38static void 39length_primitive (const char *typename, 40 const char *name, 41 const char *variable) 42{ 43 fprintf (codefile, "%s += der_length_%s(%s);\n", variable, typename, name); 44} 45 46/* XXX same as der_length_tag */ 47static size_t 48length_tag(unsigned int tag) 49{ 50 size_t len = 0; 51 52 if(tag <= 30) 53 return 1; 54 while(tag) { 55 tag /= 128; 56 len++; 57 } 58 return len + 1; 59} 60 61 62static int 63length_type (const char *name, const Type *t, 64 const char *variable, const char *tmpstr) 65{ 66 switch (t->type) { 67 case TType: 68#if 0 69 length_type (name, t->symbol->type); 70#endif 71 fprintf (codefile, "%s += length_%s(%s);\n", 72 variable, t->symbol->gen_name, name); 73 break; 74 case TInteger: 75 if(t->members) { 76 fprintf(codefile, 77 "{\n" 78 "int enumint = *%s;\n", name); 79 length_primitive ("integer", "&enumint", variable); 80 fprintf(codefile, "}\n"); 81 } else if (t->range == NULL) { 82 length_primitive ("heim_integer", name, variable); 83 } else if (t->range->min == INT_MIN && t->range->max == INT_MAX) { 84 length_primitive ("integer", name, variable); 85 } else if (t->range->min == 0 && t->range->max == UINT_MAX) { 86 length_primitive ("unsigned", name, variable); 87 } else if (t->range->min == 0 && t->range->max == INT_MAX) { 88 length_primitive ("unsigned", name, variable); 89 } else 90 errx(1, "%s: unsupported range %d -> %d", 91 name, t->range->min, t->range->max); 92 93 break; 94 case TBoolean: 95 fprintf (codefile, "%s += 1;\n", variable); 96 break; 97 case TEnumerated : 98 length_primitive ("enumerated", name, variable); 99 break; 100 case TOctetString: 101 length_primitive ("octet_string", name, variable); 102 break; 103 case TBitString: { 104 if (ASN1_TAILQ_EMPTY(t->members)) 105 length_primitive("bit_string", name, variable); 106 else { 107 if (!rfc1510_bitstring) { 108 Member *m; 109 int pos = ASN1_TAILQ_LAST(t->members, memhead)->val; 110 111 fprintf(codefile, 112 "do {\n"); 113 ASN1_TAILQ_FOREACH_REVERSE(m, t->members, memhead, members) { 114 while (m->val / 8 < pos / 8) { 115 pos -= 8; 116 } 117 fprintf (codefile, 118 "if((%s)->%s) { %s += %d; break; }\n", 119 name, m->gen_name, variable, (pos + 8) / 8); 120 } 121 fprintf(codefile, 122 "} while(0);\n"); 123 fprintf (codefile, "%s += 1;\n", variable); 124 } else { 125 fprintf (codefile, "%s += 5;\n", variable); 126 } 127 } 128 break; 129 } 130 case TSet: 131 case TSequence: 132 case TChoice: { 133 Member *m, *have_ellipsis = NULL; 134 135 if (t->members == NULL) 136 break; 137 138 if(t->type == TChoice) { 139 fprintf (codefile, "switch((%s)->element) {\n" 140 "case ASN1_CHOICE_INVALID: ret = ASN1_INVALID_CHOICE;\nbreak;\n", 141 name); 142 } 143 144 ASN1_TAILQ_FOREACH(m, t->members, members) { 145 char *s; 146 147 if (m->ellipsis) { 148 have_ellipsis = m; 149 continue; 150 } 151 152 if(t->type == TChoice) 153 fprintf(codefile, "case %s:\n", m->label); 154 155 if (asprintf (&s, "%s(%s)->%s%s", 156 m->optional ? "" : "&", name, 157 t->type == TChoice ? "u." : "", m->gen_name) < 0 || s == NULL) 158 errx(1, "malloc"); 159 if (m->optional) 160 fprintf (codefile, "if(%s)", s); 161 else if(m->defval) 162 gen_compare_defval(s + 1, m->defval); 163 fprintf (codefile, "{\n" 164 "size_t %s_oldret = %s;\n" 165 "%s = 0;\n", tmpstr, variable, variable); 166 length_type (s, m->type, "ret", m->gen_name); 167 fprintf (codefile, "ret += %s_oldret;\n", tmpstr); 168 fprintf (codefile, "}\n"); 169 free (s); 170 if(t->type == TChoice) 171 fprintf(codefile, "break;\n"); 172 } 173 if(t->type == TChoice) { 174 if (have_ellipsis) 175 fprintf(codefile, 176 "case %s:\n" 177 "ret += (%s)->u.%s.length;\n" 178 "break;\n", 179 have_ellipsis->label, 180 name, 181 have_ellipsis->gen_name); 182 fprintf (codefile, "}\n"); /* switch */ 183 } 184 break; 185 } 186 case TSetOf: 187 case TSequenceOf: { 188 char *n = NULL; 189 char *sname = NULL; 190 191 fprintf (codefile, 192 "{\n" 193 "size_t %s_oldret = %s;\n" 194 "unsigned int n_%s;\n" 195 "%s = 0;\n", 196 tmpstr, variable, tmpstr, variable); 197 198 fprintf (codefile, "for(n_%s = (%s)->len; n_%s > 0; --n_%s){\n", 199 tmpstr, name, tmpstr, tmpstr); 200 fprintf (codefile, "size_t %s_for_oldret = %s;\n" 201 "%s = 0;\n", tmpstr, variable, variable); 202 if (asprintf (&n, "&(%s)->val[n_%s - 1]", name, tmpstr) < 0 || n == NULL) 203 errx(1, "malloc"); 204 if (asprintf (&sname, "%s_S_Of", tmpstr) < 0 || sname == NULL) 205 errx(1, "malloc"); 206 length_type(n, t->subtype, variable, sname); 207 fprintf (codefile, "%s += %s_for_oldret;\n", 208 variable, tmpstr); 209 fprintf (codefile, "}\n"); 210 211 fprintf (codefile, 212 "%s += %s_oldret;\n" 213 "}\n", variable, tmpstr); 214 free(n); 215 free(sname); 216 break; 217 } 218 case TGeneralizedTime: 219 length_primitive ("generalized_time", name, variable); 220 break; 221 case TGeneralString: 222 length_primitive ("general_string", name, variable); 223 break; 224 case TTeletexString: 225 length_primitive ("general_string", name, variable); 226 break; 227 case TUTCTime: 228 length_primitive ("utctime", name, variable); 229 break; 230 case TUTF8String: 231 length_primitive ("utf8string", name, variable); 232 break; 233 case TPrintableString: 234 length_primitive ("printable_string", name, variable); 235 break; 236 case TIA5String: 237 length_primitive ("ia5_string", name, variable); 238 break; 239 case TBMPString: 240 length_primitive ("bmp_string", name, variable); 241 break; 242 case TUniversalString: 243 length_primitive ("universal_string", name, variable); 244 break; 245 case TVisibleString: 246 length_primitive ("visible_string", name, variable); 247 break; 248 case TNull: 249 fprintf (codefile, "/* NULL */\n"); 250 break; 251 case TTag:{ 252 char *tname = NULL; 253 if (asprintf(&tname, "%s_tag", tmpstr) < 0 || tname == NULL) 254 errx(1, "malloc"); 255 length_type (name, t->subtype, variable, tname); 256 fprintf (codefile, "ret += %lu + der_length_len (ret);\n", 257 (unsigned long)length_tag(t->tag.tagvalue)); 258 free(tname); 259 break; 260 } 261 case TOID: 262 length_primitive ("oid", name, variable); 263 break; 264 default : 265 abort (); 266 } 267 return 0; 268} 269 270void 271generate_type_length (const Symbol *s) 272{ 273 fprintf (codefile, 274 "size_t ASN1CALL\n" 275 "length_%s(const %s *data)\n" 276 "{\n" 277 "size_t ret = 0;\n", 278 s->gen_name, s->gen_name); 279 280 length_type ("data", s->type, "ret", "Top"); 281 fprintf (codefile, "return ret;\n}\n\n"); 282} 283 284