| 1 | /* |
| 2 | * declarations.c |
| 3 | * |
| 4 | * BabelTrace - Converter |
| 5 | * |
| 6 | * Types registry. |
| 7 | * |
| 8 | * Copyright 2010, 2011 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com> |
| 9 | * |
| 10 | * Permission is hereby granted, free of charge, to any person obtaining a copy |
| 11 | * of this software and associated documentation files (the "Software"), to deal |
| 12 | * in the Software without restriction, including without limitation the rights |
| 13 | * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell |
| 14 | * copies of the Software, and to permit persons to whom the Software is |
| 15 | * furnished to do so, subject to the following conditions: |
| 16 | * |
| 17 | * The above copyright notice and this permission notice shall be included in |
| 18 | * all copies or substantial portions of the Software. |
| 19 | */ |
| 20 | |
| 21 | #include <babeltrace/format.h> |
| 22 | #include <limits.h> |
| 23 | #include <glib.h> |
| 24 | #include <errno.h> |
| 25 | |
| 26 | static |
| 27 | struct definition * |
| 28 | lookup_typedef_declaration_scope(GQuark declaration_name, |
| 29 | struct declaration_scope *scope) |
| 30 | { |
| 31 | return g_hash_table_lookup(scope->typedef_declarations, |
| 32 | (gconstpointer) (unsigned long) declaration_name); |
| 33 | } |
| 34 | |
| 35 | struct definition *lookup_typedef_declaration(GQuark declaration_name, |
| 36 | struct declaration_scope *scope) |
| 37 | { |
| 38 | struct definition *definition; |
| 39 | |
| 40 | while (scope) { |
| 41 | definition = lookup_typedef_declaration_scope(declaration_name, |
| 42 | scope); |
| 43 | if (definition) |
| 44 | return definition; |
| 45 | scope = scope->parent_scope; |
| 46 | } |
| 47 | return NULL; |
| 48 | } |
| 49 | |
| 50 | int register_typedef_declaration(GQuark name, struct declaration *declaration, |
| 51 | struct declaration_scope *scope) |
| 52 | { |
| 53 | if (!name) |
| 54 | return -EPERM; |
| 55 | |
| 56 | /* Only lookup in local scope */ |
| 57 | if (lookup_typedef_declaration_scope(name, scope)) |
| 58 | return -EEXIST; |
| 59 | |
| 60 | g_hash_table_insert(scope->typedef_declarations, |
| 61 | (gpointer) (unsigned long) name, |
| 62 | declaration); |
| 63 | declaration_ref(declaration); |
| 64 | return 0; |
| 65 | } |
| 66 | |
| 67 | static |
| 68 | struct definition * |
| 69 | lookup_field_definition_scope(GQuark field_name, |
| 70 | struct definition_scope *scope) |
| 71 | { |
| 72 | return g_hash_table_lookup(scope->definitions, |
| 73 | (gconstpointer) (unsigned long) field_name); |
| 74 | } |
| 75 | |
| 76 | /* |
| 77 | * Returns the index at which the paths differ. |
| 78 | * If the value returned equals len, it means the paths are identical |
| 79 | * from index 0 to len-1. |
| 80 | */ |
| 81 | static int compare_paths(GArray *a, GArray *b, int len) |
| 82 | { |
| 83 | int i; |
| 84 | |
| 85 | assert(len <= a->len); |
| 86 | assert(len <= b->len); |
| 87 | |
| 88 | for (i = 0; i < len; i++) { |
| 89 | GQuark qa, qb; |
| 90 | |
| 91 | qa = g_array_index(a, GQuark, i); |
| 92 | qb = g_array_index(b, GQuark, i); |
| 93 | if (qa != qb) |
| 94 | return i; |
| 95 | } |
| 96 | return i; |
| 97 | } |
| 98 | |
| 99 | static int is_path_child_of(GArray *path, GArray *maybe_parent) |
| 100 | { |
| 101 | if (path->len <= maybe_parent->len) |
| 102 | return 0; |
| 103 | if (compare_paths(path, maybe_parent, maybe_parent->len) |
| 104 | == maybe_parent->len) |
| 105 | return 1; |
| 106 | else |
| 107 | return 0; |
| 108 | } |
| 109 | |
| 110 | static struct definition_scope * |
| 111 | get_definition_scope(struct definition *definition) |
| 112 | { |
| 113 | switch (definition->declaration->id) { |
| 114 | case CTF_TYPE_STRUCT: |
| 115 | { |
| 116 | struct definition_struct *def = |
| 117 | container_of(definition, struct definition_struct, p); |
| 118 | return def->scope; |
| 119 | } |
| 120 | case CTF_TYPE_VARIANT: |
| 121 | { |
| 122 | struct definition_variant *def = |
| 123 | container_of(definition, struct definition_variant, p); |
| 124 | return def->scope; |
| 125 | } |
| 126 | case CTF_TYPE_ARRAY: |
| 127 | { |
| 128 | struct definition_array *def = |
| 129 | container_of(definition, struct definition_array, p); |
| 130 | return def->scope; |
| 131 | } |
| 132 | case CTF_TYPE_SEQUENCE: |
| 133 | { |
| 134 | struct definition_sequence *def = |
| 135 | container_of(definition, struct definition_sequence, p); |
| 136 | return def->scope; |
| 137 | } |
| 138 | |
| 139 | case CTF_TYPE_INTEGER: |
| 140 | case CTF_TYPE_FLOAT: |
| 141 | case CTF_TYPE_ENUM: |
| 142 | case CTF_TYPE_STRING: |
| 143 | case CTF_TYPE_UNKNOWN: |
| 144 | default: |
| 145 | return NULL; |
| 146 | } |
| 147 | } |
| 148 | |
| 149 | /* |
| 150 | * OK, here is the fun. We want to lookup a field that is: |
| 151 | * - either in the same dynamic scope: |
| 152 | * - either in the current scope, but prior to the current field. |
| 153 | * - or in a parent scope (or parent of parent ...) still in a field |
| 154 | * prior to the current field position within the parents. |
| 155 | * - or in a different dynamic scope: |
| 156 | * - either in a upper dynamic scope (walk down a targeted scope from |
| 157 | * the dynamic scope root) |
| 158 | * - or in a lower dynamic scope (failure) |
| 159 | * The dynamic scope roots are linked together, so we can access the |
| 160 | * parent dynamic scope from the child dynamic scope by walking up to |
| 161 | * the parent. |
| 162 | * If we cannot find such a field that is prior to our current path, we |
| 163 | * return NULL. |
| 164 | * |
| 165 | * cur_path: the path leading to the variant definition. |
| 166 | * lookup_path: the path leading to the enum we want to look for. |
| 167 | * scope: the definition scope containing the variant definition. |
| 168 | */ |
| 169 | struct definition * |
| 170 | lookup_definition(GArray *cur_path, |
| 171 | GArray *lookup_path, |
| 172 | struct definition_scope *scope) |
| 173 | { |
| 174 | struct definition *definition, *lookup_definition; |
| 175 | GQuark last; |
| 176 | int index; |
| 177 | |
| 178 | while (scope) { |
| 179 | /* going up in the hierarchy. Check where we come from. */ |
| 180 | assert(is_path_child_of(cur_path, scope->scope_path)); |
| 181 | assert(cur_path->len - scope->scope_path->len == 1); |
| 182 | last = g_array_index(cur_path, GQuark, cur_path->len - 1); |
| 183 | definition = lookup_field_definition_scope(last, scope); |
| 184 | assert(definition); |
| 185 | index = definition->index; |
| 186 | lookup: |
| 187 | if (is_path_child_of(lookup_path, scope->scope_path)) { |
| 188 | /* Means we can lookup the field in this scope */ |
| 189 | last = g_array_index(lookup_path, GQuark, |
| 190 | scope->scope_path->len); |
| 191 | lookup_definition = lookup_field_definition_scope(last, scope); |
| 192 | if (!lookup_definition || ((index != -1) && lookup_definition->index >= index)) |
| 193 | return NULL; |
| 194 | /* Found it! And it is prior to the current field. */ |
| 195 | if (lookup_path->len - scope->scope_path->len == 1) { |
| 196 | /* Direct child */ |
| 197 | return lookup_definition; |
| 198 | } else { |
| 199 | scope = get_definition_scope(lookup_definition); |
| 200 | /* Check if the definition has a sub-scope */ |
| 201 | if (!scope) |
| 202 | return NULL; |
| 203 | /* |
| 204 | * Don't compare index anymore, because we are |
| 205 | * going within a scope that has been validated |
| 206 | * to be entirely prior to the current scope. |
| 207 | */ |
| 208 | cur_path = NULL; |
| 209 | index = -1; |
| 210 | goto lookup; |
| 211 | } |
| 212 | } else { |
| 213 | assert(index != -1); |
| 214 | /* lookup_path is within an upper scope */ |
| 215 | cur_path = scope->scope_path; |
| 216 | scope = scope->parent_scope; |
| 217 | } |
| 218 | } |
| 219 | return NULL; |
| 220 | } |
| 221 | |
| 222 | int register_field_definition(GQuark field_name, struct definition *definition, |
| 223 | struct definition_scope *scope) |
| 224 | { |
| 225 | if (!field_name) |
| 226 | return -EPERM; |
| 227 | |
| 228 | /* Only lookup in local scope */ |
| 229 | if (lookup_field_definition_scope(field_name, scope)) |
| 230 | return -EEXIST; |
| 231 | |
| 232 | g_hash_table_insert(scope->definitions, |
| 233 | (gpointer) (unsigned long) field_name, |
| 234 | definition); |
| 235 | definition_ref(definition); |
| 236 | return 0; |
| 237 | } |
| 238 | |
| 239 | void declaration_ref(struct declaration *declaration) |
| 240 | { |
| 241 | declaration->ref++; |
| 242 | } |
| 243 | |
| 244 | void declaration_unref(struct declaration *declaration) |
| 245 | { |
| 246 | if (!--declaration->ref) |
| 247 | declaration->declaration_free(declaration); |
| 248 | } |
| 249 | |
| 250 | void definition_ref(struct definition *definition) |
| 251 | { |
| 252 | definition->ref++; |
| 253 | } |
| 254 | |
| 255 | void definition_unref(struct definition *definition) |
| 256 | { |
| 257 | if (!--definition->ref) |
| 258 | definition->declaration->definition_free(definition); |
| 259 | } |
| 260 | |
| 261 | struct declaration_scope * |
| 262 | new_declaration_scope(struct declaration_scope *parent_scope) |
| 263 | { |
| 264 | struct declaration_scope *scope = g_new(struct declaration_scope, 1); |
| 265 | |
| 266 | scope->typedef_declarations = g_hash_table_new_full(g_direct_hash, |
| 267 | g_direct_equal, NULL, |
| 268 | (GDestroyNotify) definition_unref); |
| 269 | scope->struct_declarations = g_hash_table_new_full(g_direct_hash, |
| 270 | g_direct_equal, NULL, |
| 271 | (GDestroyNotify) declaration_unref); |
| 272 | scope->variant_declarations = g_hash_table_new_full(g_direct_hash, |
| 273 | g_direct_equal, NULL, |
| 274 | (GDestroyNotify) declaration_unref); |
| 275 | scope->enum_declarations = g_hash_table_new_full(g_direct_hash, |
| 276 | g_direct_equal, NULL, |
| 277 | (GDestroyNotify) declaration_unref); |
| 278 | scope->parent_scope = parent_scope; |
| 279 | return scope; |
| 280 | } |
| 281 | |
| 282 | void free_declaration_scope(struct declaration_scope *scope) |
| 283 | { |
| 284 | g_hash_table_destroy(scope->enum_declarations); |
| 285 | g_hash_table_destroy(scope->variant_declarations); |
| 286 | g_hash_table_destroy(scope->struct_declarations); |
| 287 | g_hash_table_destroy(scope->typedef_declarations); |
| 288 | g_free(scope); |
| 289 | } |
| 290 | |
| 291 | static |
| 292 | struct declaration_struct *lookup_struct_declaration_scope(GQuark struct_name, |
| 293 | struct declaration_scope *scope) |
| 294 | { |
| 295 | return g_hash_table_lookup(scope->struct_declarations, |
| 296 | (gconstpointer) (unsigned long) struct_name); |
| 297 | } |
| 298 | |
| 299 | struct declaration_struct *lookup_struct_declaration(GQuark struct_name, |
| 300 | struct declaration_scope *scope) |
| 301 | { |
| 302 | struct declaration_struct *declaration; |
| 303 | |
| 304 | while (scope) { |
| 305 | declaration = lookup_struct_declaration_scope(struct_name, scope); |
| 306 | if (declaration) |
| 307 | return declaration; |
| 308 | scope = scope->parent_scope; |
| 309 | } |
| 310 | return NULL; |
| 311 | } |
| 312 | |
| 313 | int register_struct_declaration(GQuark struct_name, |
| 314 | struct declaration_struct *struct_declaration, |
| 315 | struct declaration_scope *scope) |
| 316 | { |
| 317 | if (!struct_name) |
| 318 | return -EPERM; |
| 319 | |
| 320 | /* Only lookup in local scope */ |
| 321 | if (lookup_struct_declaration_scope(struct_name, scope)) |
| 322 | return -EEXIST; |
| 323 | |
| 324 | g_hash_table_insert(scope->struct_declarations, |
| 325 | (gpointer) (unsigned long) struct_name, |
| 326 | struct_declaration); |
| 327 | declaration_ref(&struct_declaration->p); |
| 328 | return 0; |
| 329 | } |
| 330 | |
| 331 | static |
| 332 | struct declaration_untagged_variant * |
| 333 | lookup_variant_declaration_scope(GQuark variant_name, |
| 334 | struct declaration_scope *scope) |
| 335 | { |
| 336 | return g_hash_table_lookup(scope->variant_declarations, |
| 337 | (gconstpointer) (unsigned long) variant_name); |
| 338 | } |
| 339 | |
| 340 | struct declaration_untagged_variant * |
| 341 | lookup_variant_declaration(GQuark variant_name, |
| 342 | struct declaration_scope *scope) |
| 343 | { |
| 344 | struct declaration_untagged_variant *declaration; |
| 345 | |
| 346 | while (scope) { |
| 347 | declaration = lookup_variant_declaration_scope(variant_name, scope); |
| 348 | if (declaration) |
| 349 | return declaration; |
| 350 | scope = scope->parent_scope; |
| 351 | } |
| 352 | return NULL; |
| 353 | } |
| 354 | |
| 355 | int register_variant_declaration(GQuark variant_name, |
| 356 | struct declaration_untagged_variant *untagged_variant_declaration, |
| 357 | struct declaration_scope *scope) |
| 358 | { |
| 359 | if (!variant_name) |
| 360 | return -EPERM; |
| 361 | |
| 362 | /* Only lookup in local scope */ |
| 363 | if (lookup_variant_declaration_scope(variant_name, scope)) |
| 364 | return -EEXIST; |
| 365 | |
| 366 | g_hash_table_insert(scope->variant_declarations, |
| 367 | (gpointer) (unsigned long) variant_name, |
| 368 | untagged_variant_declaration); |
| 369 | declaration_ref(&untagged_variant_declaration->p); |
| 370 | return 0; |
| 371 | } |
| 372 | |
| 373 | static |
| 374 | struct declaration_enum * |
| 375 | lookup_enum_declaration_scope(GQuark enum_name, |
| 376 | struct declaration_scope *scope) |
| 377 | { |
| 378 | return g_hash_table_lookup(scope->enum_declarations, |
| 379 | (gconstpointer) (unsigned long) enum_name); |
| 380 | } |
| 381 | |
| 382 | struct declaration_enum * |
| 383 | lookup_enum_declaration(GQuark enum_name, |
| 384 | struct declaration_scope *scope) |
| 385 | { |
| 386 | struct declaration_enum *declaration; |
| 387 | |
| 388 | while (scope) { |
| 389 | declaration = lookup_enum_declaration_scope(enum_name, scope); |
| 390 | if (declaration) |
| 391 | return declaration; |
| 392 | scope = scope->parent_scope; |
| 393 | } |
| 394 | return NULL; |
| 395 | } |
| 396 | |
| 397 | int register_enum_declaration(GQuark enum_name, |
| 398 | struct declaration_enum *enum_declaration, |
| 399 | struct declaration_scope *scope) |
| 400 | { |
| 401 | if (!enum_name) |
| 402 | return -EPERM; |
| 403 | |
| 404 | /* Only lookup in local scope */ |
| 405 | if (lookup_enum_declaration_scope(enum_name, scope)) |
| 406 | return -EEXIST; |
| 407 | |
| 408 | g_hash_table_insert(scope->enum_declarations, |
| 409 | (gpointer) (unsigned long) enum_name, |
| 410 | enum_declaration); |
| 411 | declaration_ref(&enum_declaration->p); |
| 412 | return 0; |
| 413 | } |
| 414 | |
| 415 | static struct definition_scope * |
| 416 | _new_definition_scope(struct definition_scope *parent_scope, |
| 417 | int scope_path_len) |
| 418 | { |
| 419 | struct definition_scope *scope = g_new(struct definition_scope, 1); |
| 420 | |
| 421 | scope->definitions = g_hash_table_new_full(g_direct_hash, |
| 422 | g_direct_equal, NULL, |
| 423 | (GDestroyNotify) definition_unref); |
| 424 | scope->parent_scope = parent_scope; |
| 425 | scope->scope_path = g_array_sized_new(FALSE, TRUE, sizeof(GQuark), |
| 426 | scope_path_len); |
| 427 | g_array_set_size(scope->scope_path, scope_path_len); |
| 428 | return scope; |
| 429 | } |
| 430 | |
| 431 | struct definition_scope * |
| 432 | new_definition_scope(struct definition_scope *parent_scope, |
| 433 | GQuark field_name) |
| 434 | { |
| 435 | struct definition_scope *scope; |
| 436 | int scope_path_len = 1; |
| 437 | |
| 438 | if (parent_scope) |
| 439 | scope_path_len += parent_scope->scope_path->len; |
| 440 | scope = _new_definition_scope(parent_scope, scope_path_len); |
| 441 | if (parent_scope) |
| 442 | memcpy(scope->scope_path, parent_scope->scope_path, |
| 443 | sizeof(GQuark) * (scope_path_len - 1)); |
| 444 | g_array_index(scope->scope_path, GQuark, scope_path_len - 1) = |
| 445 | field_name; |
| 446 | return scope; |
| 447 | } |
| 448 | |
| 449 | /* |
| 450 | * in: path (dot separated), out: q (GArray of GQuark) |
| 451 | */ |
| 452 | void append_scope_path(const char *path, GArray *q) |
| 453 | { |
| 454 | const char *ptrbegin, *ptrend = path; |
| 455 | GQuark quark; |
| 456 | |
| 457 | for (;;) { |
| 458 | char *str; |
| 459 | size_t len; |
| 460 | |
| 461 | ptrbegin = ptrend; |
| 462 | ptrend = strchr(ptrbegin, '.'); |
| 463 | if (!ptrend) |
| 464 | break; |
| 465 | len = ptrend - ptrbegin; |
| 466 | /* Don't accept two consecutive dots */ |
| 467 | assert(len != 0); |
| 468 | str = g_new(char, len + 1); /* include \0 */ |
| 469 | memcpy(str, ptrbegin, len); |
| 470 | str[len] = '\0'; |
| 471 | quark = g_quark_from_string(str); |
| 472 | g_array_append_val(q, quark); |
| 473 | g_free(str); |
| 474 | } |
| 475 | /* last. Check for trailing dot (and discard). */ |
| 476 | if (ptrbegin[0] != '\0') { |
| 477 | quark = g_quark_from_string(ptrbegin); |
| 478 | g_array_append_val(q, quark); |
| 479 | } |
| 480 | } |
| 481 | |
| 482 | void set_dynamic_definition_scope(struct definition *definition, |
| 483 | struct definition_scope *scope, |
| 484 | const char *root_name) |
| 485 | { |
| 486 | g_array_set_size(scope->scope_path, 0); |
| 487 | append_scope_path(root_name, scope->scope_path); |
| 488 | /* |
| 489 | * Use INT_MAX order to ensure that all fields of the parent |
| 490 | * scope are seen as being prior to this scope. |
| 491 | */ |
| 492 | definition->index = INT_MAX; |
| 493 | } |
| 494 | |
| 495 | void free_definition_scope(struct definition_scope *scope) |
| 496 | { |
| 497 | g_array_free(scope->scope_path, TRUE); |
| 498 | g_hash_table_destroy(scope->definitions); |
| 499 | g_free(scope); |
| 500 | } |