vlm | fa67ddc | 2004-06-03 03:38:44 +0000 | [diff] [blame] | 1 | #include "asn1fix_internal.h" |
vlm | d9cd3f9 | 2004-06-28 21:21:24 +0000 | [diff] [blame] | 2 | #include "asn1fix.h" |
vlm | fa67ddc | 2004-06-03 03:38:44 +0000 | [diff] [blame] | 3 | |
| 4 | char const * |
| 5 | asn1f_printable_reference(asn1p_ref_t *ref) { |
| 6 | if(ref) { |
| 7 | asn1p_value_t v; |
| 8 | |
| 9 | v.type = ATV_REFERENCED; |
| 10 | v.value.reference = ref; |
| 11 | |
| 12 | return asn1f_printable_value(&v); |
| 13 | } else { |
| 14 | return "<no ref>"; |
| 15 | } |
| 16 | } |
| 17 | |
| 18 | char const * |
| 19 | asn1f_printable_value(asn1p_value_t *v) { |
| 20 | static char buf[128]; |
| 21 | static char *managedptr; |
vlm | 8a09e0f | 2005-02-25 14:20:30 +0000 | [diff] [blame] | 22 | static size_t managedptr_len; |
vlm | fa67ddc | 2004-06-03 03:38:44 +0000 | [diff] [blame] | 23 | int ret; |
| 24 | |
| 25 | #define ENSURE(len) do { \ |
vlm | 8a09e0f | 2005-02-25 14:20:30 +0000 | [diff] [blame] | 26 | size_t __len = (len); \ |
vlm | 52864bb | 2004-09-15 11:46:28 +0000 | [diff] [blame] | 27 | if(__len >= managedptr_len) { \ |
vlm | fa67ddc | 2004-06-03 03:38:44 +0000 | [diff] [blame] | 28 | if(managedptr) \ |
| 29 | free(managedptr); \ |
vlm | 52864bb | 2004-09-15 11:46:28 +0000 | [diff] [blame] | 30 | managedptr = malloc(__len + 1); \ |
vlm | fa67ddc | 2004-06-03 03:38:44 +0000 | [diff] [blame] | 31 | if(managedptr) { \ |
vlm | 52864bb | 2004-09-15 11:46:28 +0000 | [diff] [blame] | 32 | managedptr_len = __len; \ |
vlm | fa67ddc | 2004-06-03 03:38:44 +0000 | [diff] [blame] | 33 | } else { \ |
| 34 | managedptr_len = 0; \ |
| 35 | return "<memory allocation error>"; \ |
| 36 | } \ |
| 37 | } \ |
| 38 | } while(0) |
| 39 | |
| 40 | if(v == NULL) |
| 41 | return "<no value>"; |
| 42 | |
| 43 | switch(v->type) { |
| 44 | case ATV_NOVALUE: |
| 45 | return "<NO VALUE>"; |
vlm | 52864bb | 2004-09-15 11:46:28 +0000 | [diff] [blame] | 46 | case ATV_NULL: |
| 47 | return "NULL"; |
vlm | fa67ddc | 2004-06-03 03:38:44 +0000 | [diff] [blame] | 48 | case ATV_REAL: |
| 49 | ret = snprintf(buf, sizeof(buf), "%f", v->value.v_double); |
vlm | b42843a | 2004-06-05 08:17:50 +0000 | [diff] [blame] | 50 | if(ret >= (ssize_t)sizeof(buf)) |
vlm | fa67ddc | 2004-06-03 03:38:44 +0000 | [diff] [blame] | 51 | memcpy(buf + sizeof(buf) - 4, "...", 4); |
| 52 | return buf; |
| 53 | case ATV_INTEGER: |
vlm | 47ae158 | 2004-09-24 21:01:43 +0000 | [diff] [blame] | 54 | ret = snprintf(buf, sizeof(buf), "%" PRIdASN, |
| 55 | v->value.v_integer); |
vlm | b42843a | 2004-06-05 08:17:50 +0000 | [diff] [blame] | 56 | if(ret >= (ssize_t)sizeof(buf)) |
vlm | fa67ddc | 2004-06-03 03:38:44 +0000 | [diff] [blame] | 57 | memcpy(buf + sizeof(buf) - 4, "...", 4); |
| 58 | return buf; |
| 59 | case ATV_MIN: return "MIN"; |
| 60 | case ATV_MAX: return "MAX"; |
| 61 | case ATV_FALSE: return "FALSE"; |
| 62 | case ATV_TRUE: return "TRUE"; |
vlm | 3fd792c | 2005-03-24 14:40:22 +0000 | [diff] [blame] | 63 | case ATV_TUPLE: |
| 64 | ret = snprintf(buf, sizeof(buf), "{%d, %d}", |
| 65 | (int)(v->value.v_integer >> 4), |
| 66 | (int)(v->value.v_integer & 0xff)); |
| 67 | if(ret >= (ssize_t)sizeof(buf)) |
| 68 | memcpy(buf + sizeof(buf) - 4, "...", 4); |
| 69 | return buf; |
| 70 | case ATV_QUADRUPLE: |
| 71 | ret = snprintf(buf, sizeof(buf), "{%d, %d, %d, %d}", |
| 72 | (int)((v->value.v_integer >> 24) & 0xff), |
| 73 | (int)((v->value.v_integer >> 16) & 0xff), |
| 74 | (int)((v->value.v_integer >> 8) & 0xff), |
| 75 | (int)(v->value.v_integer & 0xff)); |
| 76 | if(ret >= (ssize_t)sizeof(buf)) |
| 77 | memcpy(buf + sizeof(buf) - 4, "...", 4); |
| 78 | return buf; |
vlm | fa67ddc | 2004-06-03 03:38:44 +0000 | [diff] [blame] | 79 | case ATV_STRING: |
| 80 | case ATV_UNPARSED: |
| 81 | /* Buffer is guaranteed to be null-terminated */ |
| 82 | assert(v->value.string.buf[v->value.string.size] == '\0'); |
vlm | 55289c1 | 2005-06-15 18:41:50 +0000 | [diff] [blame] | 83 | return (char *)v->value.string.buf; |
vlm | fa67ddc | 2004-06-03 03:38:44 +0000 | [diff] [blame] | 84 | case ATV_BITVECTOR: |
| 85 | { |
| 86 | uint8_t *bitvector; |
| 87 | char *ptr; |
vlm | 8a09e0f | 2005-02-25 14:20:30 +0000 | [diff] [blame] | 88 | size_t len; |
vlm | fa67ddc | 2004-06-03 03:38:44 +0000 | [diff] [blame] | 89 | int i; |
| 90 | /* |
| 91 | * Compute number of bytes necessary |
| 92 | * to represend the binary value. |
| 93 | */ |
| 94 | int bits = v->value.binary_vector.size_in_bits; |
| 95 | len = ((bits%8)?bits:(bits >> 2)) + sizeof("''H"); |
| 96 | /* |
| 97 | * Reallocate managed buffer |
| 98 | */ |
| 99 | ENSURE(len); |
| 100 | |
| 101 | /* |
| 102 | * Fill the buffer. |
| 103 | */ |
| 104 | ptr = managedptr; |
| 105 | bitvector = v->value.binary_vector.bits; |
| 106 | *ptr++ = '\''; |
| 107 | if(bits%8) { |
| 108 | /* |
| 109 | * Dump bit by bit. |
| 110 | */ |
| 111 | for(i = 0; i < bits; i++) { |
| 112 | uint8_t uc; |
| 113 | uc = bitvector[i>>3]; |
| 114 | *ptr++ = ((uc >> (7-(i%8)))&1)?'1':'0'; |
| 115 | } |
| 116 | } else { |
vlm | b42843a | 2004-06-05 08:17:50 +0000 | [diff] [blame] | 117 | static const char *hextable="0123456789ABCDEF"; |
vlm | fa67ddc | 2004-06-03 03:38:44 +0000 | [diff] [blame] | 118 | /* |
| 119 | * Dump byte by byte. |
| 120 | */ |
| 121 | for(i = 0; i < (bits >> 3); i++) { |
| 122 | *ptr++ = hextable[bitvector[i] >> 4]; |
| 123 | *ptr++ = hextable[bitvector[i] & 0x0f]; |
| 124 | } |
| 125 | } |
| 126 | *ptr++ = '\''; |
| 127 | *ptr++ = (bits%8)?'B':'H'; |
| 128 | *ptr++ = 'H'; |
vlm | 8a09e0f | 2005-02-25 14:20:30 +0000 | [diff] [blame] | 129 | assert(len == (size_t)(ptr - managedptr)); |
vlm | fa67ddc | 2004-06-03 03:38:44 +0000 | [diff] [blame] | 130 | return managedptr; |
| 131 | } |
vlm | 52864bb | 2004-09-15 11:46:28 +0000 | [diff] [blame] | 132 | case ATV_REFERENCED: |
| 133 | { |
| 134 | asn1p_ref_t *ref; |
vlm | 8a09e0f | 2005-02-25 14:20:30 +0000 | [diff] [blame] | 135 | size_t reflen; |
vlm | 52864bb | 2004-09-15 11:46:28 +0000 | [diff] [blame] | 136 | char *ptr; |
| 137 | int i; |
| 138 | |
| 139 | assert(v->value.reference); |
| 140 | ref = v->value.reference; |
| 141 | reflen = ref->comp_count; /* Number of dots */ |
| 142 | for(i = 0; i < ref->comp_count; i++) |
| 143 | reflen += strlen(ref->components[i].name); |
| 144 | /* |
| 145 | * Make sure we have a buffer of this size. |
| 146 | */ |
| 147 | ENSURE(reflen); |
| 148 | |
| 149 | /* |
| 150 | * Fill-up the buffer. |
| 151 | */ |
| 152 | ptr = managedptr; |
| 153 | for(i = 0; i < ref->comp_count; i++) { |
| 154 | char *nc; |
| 155 | if(i) *ptr++ = '.'; |
| 156 | for(nc = ref->components[i].name; *nc; nc++) |
| 157 | *ptr++ = *nc; |
| 158 | } |
| 159 | *ptr++ = '\0'; |
vlm | 8a09e0f | 2005-02-25 14:20:30 +0000 | [diff] [blame] | 160 | assert(reflen == (size_t)(ptr - managedptr)); |
vlm | 52864bb | 2004-09-15 11:46:28 +0000 | [diff] [blame] | 161 | return managedptr; |
| 162 | } |
vlm | dfbff8c | 2006-03-21 09:41:28 +0000 | [diff] [blame] | 163 | case ATV_VALUESET: |
| 164 | return "<ValueSet>"; |
vlm | 52864bb | 2004-09-15 11:46:28 +0000 | [diff] [blame] | 165 | case ATV_CHOICE_IDENTIFIER: |
| 166 | { |
| 167 | char *cid = v->value.choice_identifier.identifier; |
| 168 | char const *vptr = asn1f_printable_value( |
| 169 | v->value.choice_identifier.value); |
| 170 | char *val; |
| 171 | |
| 172 | val = strdup(vptr); |
| 173 | if(!val) return "<memory allocation error>"; |
| 174 | |
| 175 | ENSURE(strlen(cid) + sizeof(": ") + strlen(val)); |
| 176 | |
| 177 | ret = snprintf(managedptr, managedptr_len + 1, |
| 178 | "%s: %s", cid, val); |
vlm | 8a09e0f | 2005-02-25 14:20:30 +0000 | [diff] [blame] | 179 | assert(ret >= 0 && (size_t)ret <= managedptr_len); |
vlm | 52864bb | 2004-09-15 11:46:28 +0000 | [diff] [blame] | 180 | free(val); |
| 181 | return managedptr; |
| 182 | } |
vlm | fa67ddc | 2004-06-03 03:38:44 +0000 | [diff] [blame] | 183 | } |
| 184 | |
| 185 | return "<some complex value>"; |
| 186 | } |
| 187 | |
| 188 | |
| 189 | /* |
| 190 | * Recursively invoke a given function over the given expr and all its |
| 191 | * children. |
| 192 | */ |
| 193 | int |
| 194 | asn1f_recurse_expr(arg_t *arg, int (*callback)(arg_t *arg)) { |
| 195 | asn1p_expr_t *expr = arg->expr; |
| 196 | int rvalue = 0; |
| 197 | int ret; |
| 198 | |
| 199 | assert(expr); |
| 200 | |
vlm | 0c6d381 | 2006-03-21 03:40:38 +0000 | [diff] [blame] | 201 | if(expr->lhs_params && expr->spec_index == -1) { |
| 202 | int i; |
| 203 | for(i = 0; i < expr->specializations.pspecs_count; i++) { |
| 204 | arg->expr = expr->specializations.pspec[i].my_clone; |
| 205 | ret = asn1f_recurse_expr(arg, callback); |
| 206 | RET2RVAL(ret, rvalue); |
| 207 | } |
| 208 | arg->expr = expr; /* revert */ |
| 209 | return rvalue; |
| 210 | } |
| 211 | |
vlm | fa67ddc | 2004-06-03 03:38:44 +0000 | [diff] [blame] | 212 | /* |
| 213 | * Invoke the callback at this very level. |
| 214 | */ |
| 215 | ret = callback(arg); |
| 216 | RET2RVAL(ret, rvalue); |
| 217 | |
| 218 | /* |
| 219 | * Recursively invoke myself |
| 220 | * to iterate over each element in the tree. |
| 221 | */ |
| 222 | TQ_FOR(arg->expr, &(expr->members), next) { |
| 223 | assert(arg->expr->expr_type != A1TC_INVALID); |
vlm | 6a02a8a | 2004-09-08 00:28:11 +0000 | [diff] [blame] | 224 | assert(arg->expr->parent_expr == expr); |
vlm | fa67ddc | 2004-06-03 03:38:44 +0000 | [diff] [blame] | 225 | ret = asn1f_recurse_expr(arg, callback); |
| 226 | RET2RVAL(ret, rvalue); |
| 227 | } |
| 228 | |
| 229 | arg->expr = expr; /* Restore original position */ |
| 230 | |
| 231 | return rvalue; |
| 232 | } |
| 233 | |
| 234 | |
| 235 | /* |
| 236 | * Check that every child of a given expr has unique name or does not have any. |
| 237 | */ |
| 238 | int |
| 239 | asn1f_check_unique_expr(arg_t *arg, |
| 240 | int (*opt_compare)(asn1p_expr_t *a, asn1p_expr_t *b)) { |
| 241 | asn1p_expr_t *expr; |
| 242 | int rvalue = 0; |
| 243 | |
| 244 | TQ_FOR(expr, &(arg->expr->members), next) { |
| 245 | if(expr->Identifier) { |
| 246 | int ret = asn1f_check_unique_expr_child(arg, expr, |
| 247 | opt_compare); |
| 248 | if(ret) rvalue = -1; |
| 249 | } else { |
| 250 | /* |
| 251 | * No point of comparing this child with any other: |
| 252 | * this one does not have a name. |
| 253 | */ |
| 254 | } |
| 255 | } |
| 256 | |
| 257 | return rvalue; |
| 258 | } |
| 259 | |
| 260 | /* |
| 261 | * Check that every preceeding child of the given expr is not |
| 262 | * having the name of the given one. |
| 263 | */ |
| 264 | int |
| 265 | asn1f_check_unique_expr_child(arg_t *arg, asn1p_expr_t *child, |
| 266 | int (*opt_compare)(asn1p_expr_t *a, asn1p_expr_t *b)) { |
| 267 | asn1p_expr_t *expr; |
| 268 | int rvalue = 0; |
| 269 | |
| 270 | assert(child); |
| 271 | assert(opt_compare || child->Identifier); |
| 272 | |
| 273 | TQ_FOR(expr, &(arg->expr->members), next) { |
| 274 | int ret; |
| 275 | |
| 276 | if(expr == child) |
| 277 | break; |
| 278 | |
| 279 | /* |
| 280 | * Compare according to the custom rule or default |
| 281 | * names comparisons. |
| 282 | */ |
| 283 | if(opt_compare) { |
| 284 | ret = opt_compare(expr, child); |
| 285 | } else { |
| 286 | if(expr->Identifier == NULL |
| 287 | || expr->expr_type == A1TC_EXTENSIBLE) |
| 288 | continue; |
| 289 | ret = strcasecmp(expr->Identifier, child->Identifier); |
| 290 | } |
| 291 | |
| 292 | if(ret == 0) { |
| 293 | char *msg; |
| 294 | msg = opt_compare |
| 295 | ?"Expressions clash" |
| 296 | :"Identifiers name clash"; |
| 297 | arg->eh(1, |
| 298 | "%s: " |
| 299 | "\"%s\" at line %d has similar %s with " |
| 300 | "\"%s\" at line %d", |
| 301 | msg, |
| 302 | expr->Identifier, |
| 303 | expr->_lineno, |
| 304 | opt_compare?"property":"name", |
| 305 | child->Identifier, |
| 306 | child->_lineno |
| 307 | ); |
| 308 | |
| 309 | rvalue = -1; |
| 310 | } |
| 311 | } |
| 312 | |
| 313 | return rvalue; |
| 314 | } |
| 315 | |
| 316 | int |
| 317 | asn1f_count_children(asn1p_expr_t *expr) { |
| 318 | asn1p_expr_t *child; |
| 319 | int count = 0; |
| 320 | |
| 321 | TQ_FOR(child, &(expr->members), next) { |
| 322 | count++; |
| 323 | } |
| 324 | |
| 325 | return count; |
| 326 | } |
| 327 | |
vlm | d9cd3f9 | 2004-06-28 21:21:24 +0000 | [diff] [blame] | 328 | |
| 329 | static char **known_types; |
| 330 | static int known_types_count; |
| 331 | static int known_types_size; |
| 332 | |
| 333 | static int _known_types_cmp(const void *ap, const void *bp) { |
| 334 | const char *a = *(const char * const *)ap; |
| 335 | const char *b = *(const char * const *)bp; |
| 336 | return strcmp(a, b); |
| 337 | } |
| 338 | |
| 339 | int |
| 340 | asn1f_make_known_external_type(const char *type_name) { |
| 341 | char *tname; |
| 342 | |
| 343 | /* Check for duplicates */ |
| 344 | if(asn1f_check_known_external_type(type_name) == 0) { |
| 345 | errno = EEXIST; |
| 346 | return -1; |
| 347 | } |
| 348 | |
| 349 | /* Ensure enough space */ |
| 350 | if(known_types_count <= known_types_size) { |
| 351 | int n = known_types_size ? known_types_size << 1 : 4; |
| 352 | void *p; |
| 353 | p = realloc(known_types, n * sizeof(known_types[0])); |
| 354 | if(!p) return -1; |
| 355 | known_types = p; |
| 356 | known_types_size = n; |
| 357 | } |
| 358 | |
| 359 | tname = strdup(type_name); |
| 360 | if(!tname) return -1; |
| 361 | |
| 362 | known_types[known_types_count++] = tname; |
| 363 | |
| 364 | #ifdef HAVE_MERGESORT |
| 365 | mergesort |
| 366 | #else |
| 367 | qsort |
| 368 | #endif |
| 369 | (known_types, known_types_count, sizeof(known_types[0]), |
| 370 | _known_types_cmp); |
| 371 | |
| 372 | return 0; |
| 373 | } |
| 374 | |
| 375 | int |
| 376 | asn1f_check_known_external_type(const char *type_name) { |
vlm | 6534a8d | 2004-10-20 15:40:04 +0000 | [diff] [blame] | 377 | if(known_types_count) { |
| 378 | void *p = bsearch(&type_name, known_types, known_types_count, |
| 379 | sizeof(known_types[0]), _known_types_cmp); |
| 380 | if(p) return 0; |
| 381 | } |
vlm | d9cd3f9 | 2004-06-28 21:21:24 +0000 | [diff] [blame] | 382 | errno = ESRCH; |
| 383 | return -1; |
| 384 | } |
| 385 | |