X-Git-Url: http://git.efficios.com/?p=babeltrace.git;a=blobdiff_plain;f=formats%2Fctf%2Fmetadata%2Fctf-visitor-generate-io-struct.c;h=bd0a845f8fd1327ea2c00062e2259a109b5510fe;hp=1a3fe585c7c1851c2d4b27f8f0e0b63ece073281;hb=ab4cf05887a402e53396db43b5958918d0d2d022;hpb=d60cb676b003e5eb83566f9a2707b4dfea005020 diff --git a/formats/ctf/metadata/ctf-visitor-generate-io-struct.c b/formats/ctf/metadata/ctf-visitor-generate-io-struct.c index 1a3fe585..bd0a845f 100644 --- a/formats/ctf/metadata/ctf-visitor-generate-io-struct.c +++ b/formats/ctf/metadata/ctf-visitor-generate-io-struct.c @@ -23,6 +23,7 @@ #include #include #include +#include #include #include #include @@ -36,153 +37,16 @@ cds_list_entry((ptr)->next, type, member) static -int ctf_visitor_print_type_specifier(FILE *fd, int depth, struct ctf_node *node) -{ - print_tabs(fd, depth); - fprintf(fd, "u.type_specifier.type) { - case TYPESPEC_VOID: - fprintf(fd, "void"); - break; - case TYPESPEC_CHAR: - fprintf(fd, "char"); - break; - case TYPESPEC_SHORT: - fprintf(fd, "short"); - break; - case TYPESPEC_INT: - fprintf(fd, "int"); - break; - case TYPESPEC_LONG: - fprintf(fd, "long"); - break; - case TYPESPEC_FLOAT: - fprintf(fd, "float"); - break; - case TYPESPEC_DOUBLE: - fprintf(fd, "double"); - break; - case TYPESPEC_SIGNED: - fprintf(fd, "signed"); - break; - case TYPESPEC_UNSIGNED: - fprintf(fd, "unsigned"); - break; - case TYPESPEC_BOOL: - fprintf(fd, "bool"); - break; - case TYPESPEC_COMPLEX: - fprintf(fd, "_Complex"); - break; - case TYPESPEC_IMAGINARY: - fprintf(fd, "_Imaginary"); - break; - case TYPESPEC_CONST: - fprintf(fd, "const"); - break; - case TYPESPEC_ID_TYPE: - fprintf(fd, "%s", node->u.type_specifier.id_type); - break; - - case TYPESPEC_UNKNOWN: - default: - fprintf(stderr, "[error] %s: unknown type specifier %d\n", __func__, - (int) node->u.type_specifier.type); - return -EINVAL; - } - fprintf(fd, "\"/>\n"); - return 0; -} - -static -int ctf_visitor_print_type_declarator(FILE *fd, int depth, struct ctf_node *node) -{ - int ret = 0; - struct ctf_node *iter; - - print_tabs(fd, depth); - fprintf(fd, "\n"); - depth++; - - if (!cds_list_empty(&node->u.type_declarator.pointers)) { - print_tabs(fd, depth); - fprintf(fd, "\n"); - cds_list_for_each_entry(iter, &node->u.type_declarator.pointers, - siblings) { - ret = ctf_visitor_print_xml(fd, depth + 1, iter); - if (ret) - return ret; - } - print_tabs(fd, depth); - fprintf(fd, "\n"); - } - - switch (node->u.type_declarator.type) { - case TYPEDEC_ID: - if (node->u.type_declarator.u.id) { - print_tabs(fd, depth); - fprintf(fd, "u.type_declarator.u.id); - fprintf(fd, "\" />\n"); - } - break; - case TYPEDEC_NESTED: - if (node->u.type_declarator.u.nested.type_declarator) { - print_tabs(fd, depth); - fprintf(fd, "\n"); - ret = ctf_visitor_print_xml(fd, depth + 1, - node->u.type_declarator.u.nested.type_declarator); - if (ret) - return ret; - print_tabs(fd, depth); - fprintf(fd, "\n"); - } - if (node->u.type_declarator.u.nested.length) { - print_tabs(fd, depth); - fprintf(fd, "\n"); - ret = ctf_visitor_print_xml(fd, depth + 1, - node->u.type_declarator.u.nested.length); - if (ret) - return ret; - print_tabs(fd, depth); - fprintf(fd, "\n"); - } - if (node->u.type_declarator.u.nested.abstract_array) { - print_tabs(fd, depth); - fprintf(fd, "\n"); - print_tabs(fd, depth); - fprintf(fd, "\n"); - } - if (node->u.type_declarator.bitfield_len) { - print_tabs(fd, depth); - fprintf(fd, "\n"); - ret = ctf_visitor_print_xml(fd, depth + 1, - node->u.type_declarator.bitfield_len); - if (ret) - return ret; - print_tabs(fd, depth); - fprintf(fd, "\n"); - } - break; - case TYPEDEC_UNKNOWN: - default: - fprintf(stderr, "[error] %s: unknown type declarator %d\n", __func__, - (int) node->u.type_declarator.type); - return -EINVAL; - } - - depth--; - print_tabs(fd, depth); - fprintf(fd, "\n"); - return 0; -} +struct declaration *ctf_declaration_specifier_visit(FILE *fd, + int depth, struct cds_list_head *head, + struct declaration_scope *declaration_scope, + struct ctf_trace *trace); /* * String returned must be freed by the caller using g_free. */ static -char *concatenate_unary_strings(struct list_head *head) +char *concatenate_unary_strings(struct cds_list_head *head) { struct ctf_node *node; GString *str; @@ -215,7 +79,7 @@ char *concatenate_unary_strings(struct list_head *head) } static -int get_unary_unsigned(struct list_head *head, uint64_t *value) +int get_unary_unsigned(struct cds_list_head *head, uint64_t *value) { struct ctf_node *node; int i = 0; @@ -232,7 +96,7 @@ int get_unary_unsigned(struct list_head *head, uint64_t *value) } static -int get_unary_uuid(struct list_head *head, uuid_t *uuid) +int get_unary_uuid(struct cds_list_head *head, uuid_t *uuid) { struct ctf_node *node; int i = 0; @@ -259,121 +123,909 @@ struct ctf_stream *trace_stream_lookup(struct ctf_trace *trace, uint64_t stream_ return g_ptr_array_index(trace->streams, stream_id); } -/* - * Also add named variant, struct or enum to the current declaration scope. - */ static -struct ctf_declaration *ctf_declaration_specifier_visit(FILE *fd, - int depth, struct list_head *head, - struct declaration_scope *declaration_scope) +void visit_declaration_specifier(struct cds_list_head *declaration_specifier, GString *str) { - struct ctf_declaration *declaration; - struct node *first; + struct ctf_node *iter; + int alias_item_nr = 0; + int err; - first = _cds_list_first_entry(head, struct node, siblings); + cds_list_for_each_entry(iter, declaration_specifier, siblings) { + if (alias_item_nr != 0) + g_string_append(str, " "); + alias_item_nr++; + + switch (iter->type) { + case NODE_TYPE_SPECIFIER: + switch (iter->u.type_specifier.type) { + case TYPESPEC_VOID: + g_string_append(str, "void"); + break; + case TYPESPEC_CHAR: + g_string_append(str, "char"); + break; + case TYPESPEC_SHORT: + g_string_append(str, "short"); + break; + case TYPESPEC_INT: + g_string_append(str, "int"); + break; + case TYPESPEC_LONG: + g_string_append(str, "long"); + break; + case TYPESPEC_FLOAT: + g_string_append(str, "float"); + break; + case TYPESPEC_DOUBLE: + g_string_append(str, "double"); + break; + case TYPESPEC_SIGNED: + g_string_append(str, "signed"); + break; + case TYPESPEC_UNSIGNED: + g_string_append(str, "unsigned"); + break; + case TYPESPEC_BOOL: + g_string_append(str, "bool"); + break; + case TYPESPEC_COMPLEX: + g_string_append(str, "_Complex"); + break; + case TYPESPEC_IMAGINARY: + g_string_append(str, "_Imaginary"); + break; + case TYPESPEC_CONST: + g_string_append(str, "const"); + break; + case TYPESPEC_ID_TYPE: + if (iter->u.type_specifier.id_type) + g_string_append(str, iter->u.type_specifier.id_type); + break; + default: + fprintf(stderr, "[error] %s: unknown specifier\n", __func__); + err = -EINVAL; + goto error; + } + break; + case NODE_ENUM: + if (!iter->u._enum.enum_id) { + fprintf(stderr, "[error] %s: unexpected empty enum ID\n", __func__); + err = -EINVAL; + goto error; + } + g_string_append(str, "enum "); + g_string_append(str, iter->u._enum.enum_id); + break; + case NODE_VARIANT: + if (!iter->u.variant.name) { + fprintf(stderr, "[error] %s: unexpected empty variant name\n", __func__); + err = -EINVAL; + goto error; + } + g_string_append(str, "variant "); + g_string_append(str, iter->u.variant.name); + break; + case NODE_STRUCT: + if (!iter->u._struct.name) { + fprintf(stderr, "[error] %s: unexpected empty variant name\n", __func__); + err = -EINVAL; + goto error; + } + g_string_append(str, "struct "); + g_string_append(str, iter->u._struct.name); + break; + default: + fprintf(stderr, "[error] %s: unexpected node type %d\n", __func__, (int) iter->type); + err = -EINVAL; + goto error; + } + } + return 0; +error: + return err; +} - switch (first->type) { - case NODE_STRUCT: - /* - * For named struct (without body), lookup in - * declaration scope and create declaration copy. - */ - /* For named struct (with body), create type and add to declaration scope */ - /* For unnamed struct, create type */ - break; - case NODE_VARIANT: - /* - * For named variant (without body), lookup in - * declaration scope and create declaration copy. - */ - /* For named variant (with body), create type and add to declaration scope */ - /* For unnamed variant, create type */ - /* If variant has a tag field specifier, assign tag name. */ - break; - case NODE_ENUM: - /* - * For named enum (without body), lookup in declaration - * scope and create declaration copy. - */ - /* For named enum (with body), create type and add to declaration scope */ - /* For unnamed enum, create type */ - /* Enumerations need to have their size/type specifier (< >). */ - break; - case NODE_INTEGER: - /* - * Create an integer declaration. - */ - break; - case NODE_FLOATING_POINT: - /* - * Create a floating point declaration. - */ - break; - case NODE_STRING: - /* - * Create a string declaration. - */ - break; - case NODE_TYPE_SPECIFIER: - /* - * Lookup named type in typedef declarations (in - * declaration scope). Create a copy of the declaration. - */ - break; +static +GQuark create_typealias_identifier(int fd, int depth, + struct cds_list_head *declaration_specifier, + struct ctf_node *node_type_declarator) +{ + GString *str; + const char *str_c; + GQuark alias_q; + int ret; + str = g_string_new(); + ret = visit_declaration_specifier(declaration_specifier, str); + if (ret) { + g_string_free(str, TRUE); + return 0; + } + cds_list_for_each_entry(iter, &node_type_declarator->u.type_declarator.pointers, siblings) { + g_string_append(str, " *"); + if (iter->u.pointer.const_qualifier) + g_string_append(str, " const"); } + str_c = g_string_free(str, FALSE); + alias_q = g_quark_from_string(str_c); + g_free(str_c); + return alias_q; } static -int ctf_typedef_declarator_visit(FILE *fd, int depth, - struct list_head *declaration_specifier, - struct node *type_declarator, - struct declaration_scope *declaration_scope) +struct declaration *ctf_type_declarator_visit(int fd, int depth, + struct cds_list_head *declaration_specifier, + GQuark *field_name, + struct ctf_node *node_type_declarator, + struct declaration_scope *declaration_scope, + struct declaration *nested_declaration) { /* - * Build the type using declaration specifier (creating - * declaration from type_specifier), then apply type declarator, - * add the resulting type to the current declaration scope. + * Visit type declarator by first taking care of sequence/array + * (recursively). Then, when we get to the identifier, take care + * of pointers. */ - cds_list_for_each_entry(iter, declaration_specifier, siblings) { + assert(node_type_declarator->u.type_declarator.type != TYPEDEC_UNKNOWN); + /* TODO: gcc bitfields not supported yet. */ + if (node_type_declarator->u.type_declarator.bitfield_len != NULL) { + fprintf(stderr, "[error] %s: gcc bitfields are not supported yet.\n", __func__); + return NULL; + } + + if (!nested_declaration) { + if (!cds_list_empty(&node_type_declarator->u.type_declarator.pointers)) { + GQuark alias_q; + + /* + * If we have a pointer declarator, it _has_ to be present in + * the typealiases (else fail). + */ + alias_q = create_typealias_identifier(fd, depth, + declaration_specifier, node_type_declarator); + nested_declaration = lookup_declaration(alias_q, declaration_scope); + if (!nested_declaration) { + fprintf(stderr, "[error] %s: cannot find typealias \"%s\".\n", __func__, g_quark_to_string(alias_q)); + return NULL; + } + } else { + nested_declaration = /* parse declaration_specifier */; + } + } + + if (node_type_declarator->u.type_declarator.type == TYPEDEC_ID) { + if (node_type_declarator->u.type_declarator.u.id) + *field_name = g_quark_from_string(node_type_declarator->u.type_declarator.u.id); + else + *field_name = 0; + return nested_declaration; + } else { + struct declaration *declaration; + struct node *length; + + /* TYPEDEC_NESTED */ + + /* create array/sequence, pass nested_declaration as child. */ + length = node_type_declarator->u.type_declarator.u.nested.length; + if (length) { + switch (length->type) { + case NODE_UNARY_EXPRESSION: + /* Array */ + /* TODO */ + ............. + declaration = /* create array */; + break; + case NODE_TYPE_SPECIFIER: + /* Sequence */ + declaration = /* create sequence */; + break; + default: + assert(0); + } + } + + /* Pass it as content of outer container */ + declaration = ctf_type_declarator_visit(fd, depth, + declaration_specifier, field_name, + node_type_declarator->u.type_declarator.u.nested.type_declarator, + declaration_scope, declaration); + return declaration; + } +} + +static +int ctf_struct_type_declarators_visit(int fd, int depth, + struct declaration_struct *struct_declaration, + struct cds_list_head *declaration_specifier, + struct cds_list_head *type_declarators, + struct declaration_scope *declaration_scope) +{ + struct ctf_node *iter; + GQuark field_name; + + cds_list_for_each_entry(iter, type_declarators, siblings) { + struct declaration *field_declaration; + + field_declaration = ctf_type_declarator_visit(fd, depth, + declaration_specifier, + &field_name, iter, + struct_declaration->scope, + NULL); + struct_declaration_add_field(struct_declaration, + g_quark_to_string(field_name), + field_declaration); } return 0; } static -int ctf_typedef_visit(FILE *fd, int depth, - struct list_head *declaration_specifier, - struct list_head *type_declarators, - struct declaration_scope *declaration_scope) +int ctf_variant_type_declarators_visit(int fd, int depth, + struct declaration_variant *variant_declaration, + struct cds_list_head *declaration_specifier, + struct cds_list_head *type_declarators, + struct declaration_scope *declaration_scope) { struct ctf_node *iter; + GQuark field_name; cds_list_for_each_entry(iter, type_declarators, siblings) { - ret = ctf_typedef_declarator_visit(fd, depth + 1, - &node->u._typedef.declaration_specifier, iter, - declaration_scope); + struct declaration *field_declaration; + + field_declaration = ctf_type_declarator_visit(fd, depth, + declaration_specifier, + &field_name, iter, + variant_declaration->scope, + NULL); + variant_declaration_add_field(variant_declaration, + g_quark_to_string(field_name), + field_declaration); + } + return 0; +} + +static +int ctf_typedef_visit(int fd, int depth, struct declaration_scope *scope, + struct cds_list_head *declaration_specifier, + struct cds_list_head *type_declarators) +{ + struct ctf_node *iter; + GQuark identifier; + + cds_list_for_each_entry(iter, type_declarators, siblings) { + struct declaration *type_declaration; + int ret; + + type_declaration = ctf_type_declarator_visit(fd, depth, + declaration_specifier, + &identifier, iter, + scope, NULL); + ret = register_declaration(identifier, type_declaration, scope); + if (ret) { + type_declaration->declaration_free(type_declaration); + return ret; + } + } + return 0; +} + +static +int ctf_typealias_visit(int fd, int depth, struct declaration_scope *scope, + struct ctf_node *target, struct ctf_node *alias) +{ + struct declaration *type_declaration; + struct ctf_node *iter, *node; + GQuark dummy_id; + GQuark alias_q; + + /* See ctf_visitor_type_declarator() in the semantic validator. */ + + /* + * Create target type declaration. + */ + + type_declaration = ctf_type_declarator_visit(fd, depth, + &target->u.typealias_target.declaration_specifier, + &dummy_id, &target->u.typealias_target.type_declarators, + scope, NULL); + if (!type_declaration) { + fprintf(stderr, "[error] %s: problem creating type declaration\n", __func__); + err = -EINVAL; + goto error; + } + /* + * The semantic validator does not check whether the target is + * abstract or not (if it has an identifier). Check it here. + */ + if (dummy_id != 0) { + fprintf(stderr, "[error] %s: expecting empty identifier\n", __func__); + err = -EINVAL; + goto error; + } + /* + * Create alias identifier. + */ + + node = _cds_list_first_entry(&alias->u.typealias_alias.type_declarators, + struct node, siblings); + alias_q = create_typealias_identifier(fd, depth, + &alias->u.typealias_alias.declaration_specifier, node); + ret = register_declaration(alias_q, type_declaration, scope); + if (ret) + goto error; + return 0; + +error: + type_declaration->declaration_free(type_declaration); + return ret; +} + +static +int ctf_struct_declaration_list_visit(int fd, int depth, + struct ctf_node *iter, struct declaration_struct *struct_declaration) +{ + struct declaration *declaration; + int ret; + + switch (iter->type) { + case NODE_TYPEDEF: + /* For each declarator, declare type and add type to struct declaration scope */ + ret = ctf_typedef_visit(fd, depth, + struct_declaration->scope, + &iter->u._typedef.declaration_specifier, + &iter->u._typedef.type_declarators); + if (ret) + return ret; + break; + case NODE_TYPEALIAS: + /* Declare type with declarator and add type to struct declaration scope */ + ret = ctf_typealias_visit(fd, depth, + struct_declaration->scope, + iter->u.typealias.target, + iter->u.typealias.alias); if (ret) return ret; + break; + case NODE_STRUCT_OR_VARIANT_DECLARATION: + /* Add field to structure declaration */ + ret = ctf_struct_type_declarators_visit(fd, depth, + struct_declaration, + &iter->u.struct_or_variant_declaration.declaration_specifier, + &iter->u.struct_or_variant_declaration.type_declarators); + if (ret) + return ret; + break; + default: + fprintf(stderr, "[error] %s: unexpected node type %d\n", __func__, (int) iter->type); + assert(0); } return 0; } static -int ctf_typealias_visit(FILE *fd, int depth, struct ctf_node *target, - struct ctf_node *alias, - struct declaration_scope *declaration_scope) +int ctf_variant_declaration_list_visit(int fd, int depth, + struct ctf_node *iter, struct declaration_variant *variant_declaration) +{ + struct declaration *declaration; + int ret; + + switch (iter->type) { + case NODE_TYPEDEF: + /* For each declarator, declare type and add type to variant declaration scope */ + ret = ctf_typedef_visit(fd, depth, + variant_declaration->scope, + &iter->u._typedef.declaration_specifier, + &iter->u._typedef.type_declarators); + if (ret) + return ret; + break; + case NODE_TYPEALIAS: + /* Declare type with declarator and add type to variant declaration scope */ + ret = ctf_typealias_visit(fd, depth, + variant_declaration->scope, + iter->u.typealias.target, + iter->u.typealias.alias); + if (ret) + return ret; + break; + case NODE_STRUCT_OR_VARIANT_DECLARATION: + /* Add field to structure declaration */ + ret = ctf_variant_type_declarators_visit(fd, depth, + variant_declaration, + &iter->u.struct_or_variant_declaration.declaration_specifier, + &iter->u.struct_or_variant_declaration.type_declarators); + if (ret) + return ret; + break; + default: + fprintf(stderr, "[error] %s: unexpected node type %d\n", __func__, (int) iter->type); + assert(0); + } + return 0; +} + +static +struct declaration_struct *ctf_declaration_struct_visit(FILE *fd, + int depth, const char *name, struct cds_list_head *declaration_list, + int has_body, struct declaration_scope *declaration_scope) +{ + struct declaration *declaration; + struct declaration_struct *struct_declaration; + struct ctf_node *iter; + + /* + * For named struct (without body), lookup in + * declaration scope. Don't take reference on struct + * declaration: ref is only taken upon definition. + */ + if (!has_body) { + assert(name); + struct_declaration = + lookup_struct_declaration(g_quark_from_string(name), + declaration_scope); + return struct_declaration; + } else { + /* For unnamed struct, create type */ + /* For named struct (with body), create type and add to declaration scope */ + if (name) { + if (lookup_struct_declaration(g_quark_from_string(name), + declaration_scope)) { + + fprintf(stderr, "[error] %s: struct %s already declared in scope\n", __func__, name); + return NULL; + } + } + struct_declaration = struct_declaration_new(name, declaration_scope); + cds_list_for_each_entry(iter, declaration_list, siblings) { + ret = ctf_struct_declaration_list_visit(fd, depth + 1, iter, struct_declaration); + if (ret) + goto error; + } + if (name) { + ret = register_struct_declaration(g_quark_from_string(name), + struct_declaration, + declaration_scope); + assert(!ret); + } + return struct_declaration; + } +error: + struct_declaration->p.declaration_free(&struct_declaration->p); + return NULL; +} + +static +struct declaration_variant *ctf_declaration_variant_visit(FILE *fd, + int depth, const char *name, struct cds_list_head *declaration_list, + int has_body, struct declaration_scope *declaration_scope) +{ + struct declaration *declaration; + struct declaration_variant *variant_declaration; + struct ctf_node *iter; + + /* + * For named variant (without body), lookup in + * declaration scope. Don't take reference on variant + * declaration: ref is only taken upon definition. + */ + if (!has_body) { + assert(name); + variant_declaration = + lookup_variant_declaration(g_quark_from_string(name), + declaration_scope); + return variant_declaration; + } else { + /* For unnamed variant, create type */ + /* For named variant (with body), create type and add to declaration scope */ + if (name) { + if (lookup_variant_declaration(g_quark_from_string(name), + declaration_scope)) { + + fprintf(stderr, "[error] %s: variant %s already declared in scope\n", __func__, name); + return NULL; + } + } + variant_declaration = variant_declaration_new(name, declaration_scope); + cds_list_for_each_entry(iter, declaration_list, siblings) { + ret = ctf_variant_declaration_list_visit(fd, depth + 1, iter, variant_declaration); + if (ret) + goto error; + } + if (name) { + ret = register_variant_declaration(g_quark_from_string(name), + variant_declaration, + declaration_scope); + assert(!ret); + } + return variant_declaration; + } +error: + variant_declaration->p.declaration_free(&variant_declaration->p); + return NULL; +} + +static +int ctf_enumerator_list_visit(int fd, int depth, + struct ctf_node *enumerator, + struct declaration_enum *enum_declaration) +{ + /* TODO */ +........ + return 0; +} + +static +struct declaration *ctf_declaration_enum_visit(int fd, int depth, + const char *name, + struct ctf_node *container_type, + struct cds_list_head *enumerator_list, + int has_body) { + struct declaration *declaration; + struct declaration_enum *enum_declaration; + struct declaration_integer *integer_declaration; + struct ctf_node *iter; + /* - * Build target type, check that it is reachable in current - * declaration scope. + * For named enum (without body), lookup in + * declaration scope. Don't take reference on enum + * declaration: ref is only taken upon definition. */ + if (!has_body) { + assert(name); + enum_declaration = + lookup_enum_declaration(g_quark_from_string(name), + declaration_scope); + return enum_declaration; + } else { + /* For unnamed enum, create type */ + /* For named enum (with body), create type and add to declaration scope */ + if (name) { + if (lookup_enum_declaration(g_quark_from_string(name), + declaration_scope)) { + + fprintf(stderr, "[error] %s: enum %s already declared in scope\n", __func__, name); + return NULL; + } + } + + /* TODO CHECK Enumerations need to have their size/type specifier (< >). */ + integer_declaration = integer_declaration_new(); /* TODO ... */ + ..... + enum_declaration = enum_declaration_new(name, integer_declaration); + declaration_unref(&integer_declaration->p); /* leave ref to enum */ + cds_list_for_each_entry(iter, enumerator_list, siblings) { + ret = ctf_enumerator_list_visit(fd, depth + 1, iter, enum_declaration); + if (ret) + goto error; + } + if (name) { + ret = register_enum_declaration(g_quark_from_string(name), + enum_declaration, + declaration_scope); + assert(!ret); + } + return enum_declaration; + } +error: + enum_declaration->p.declaration_free(&enum_declaration->p); + return NULL; +} + +static +struct declaration *ctf_declaration_type_specifier_visit(int fd, int depth, + struct cds_list_head *declaration_specifier, + struct declaration_scope *declaration_scope) +{ + GString *str; + struct declaration *declaration; + const char *str_c; + + str = g_string_new(); + ret = visit_declaration_specifier(declaration_specifier, str); + if (ret) + return NULL; + str_c = g_string_free(str, FALSE); + id_q = g_quark_from_string(str_c); + g_free(str_c); + declaration = lookup_declaration(id_q, declaration_scope); + return declaration; +} + +/* + * Returns 0/1 boolean, or < 0 on error. + */ +static +int get_boolean(int fd, int depth, struct node *unary_expression) +{ + if (unary_expression->type != NODE_UNARY_EXPRESSION) { + fprintf(stderr, "[error] %s: expecting unary expression\n", + __func__); + return -EINVAL; + } + switch (unary_expression->u.unary_expression.type) { + case UNARY_UNSIGNED_CONSTANT: + if (unary_expression->u.unary_expression.u.unsigned_constant == 0) + return 0; + else + return 1; + case UNARY_SIGNED_CONSTANT: + if (unary_expression->u.unary_expression.u.signed_constant == 0) + return 0; + else + return 1; + case UNARY_STRING: + if (!strcmp(unary_expression->u.unary_expression.u.string, "true")) + return 1; + else if (!strcmp(unary_expression->u.unary_expression.u.string, "TRUE")) + return 1; + else if (!strcmp(unary_expression->u.unary_expression.u.string, "false")) + return 0; + else if (!strcmp(unary_expression->u.unary_expression.u.string, "FALSE")) + return 0; + else { + fprintf(stderr, "[error] %s: unexpected string \"%s\"\n", + __func__, unary_expression->u.unary_expression.u.string); + return -EINVAL; + } + break; + default: + fprintf(stderr, "[error] %s: unexpected unary expression type\n", + __func__); + return -EINVAL; + } + +} + +static +int get_byte_order(int fd, int depth, struct node *unary_expression) +{ + int byte_order; - /* Only one type declarator is allowed */ + if (unary_expression->u.unary_expression.type != UNARY_STRING) { + fprintf(stderr, "[error] %s: byte_order: expecting string\n", + __func__); + return -EINVAL; + } + if (!strcmp(unary_expression->u.unary_expression.u.string, "native")) + byte_order = trace->byte_order; + else if (!strcmp(unary_expression->u.unary_expression.u.string, "network")) + byte_order = BIG_ENDIAN; + else if (!strcmp(unary_expression->u.unary_expression.u.string, "be")) + byte_order = BIG_ENDIAN; + else if (!strcmp(unary_expression->u.unary_expression.u.string, "le")) + byte_order = LITTLE_ENDIAN; + else { + fprintf(stderr, "[error] %s: unexpected string \"%s\". Should be \"native\", \"network\", \"be\" or \"le\".\n", + __func__, right->u.unary_expression.u.string); + return -EINVAL; + } + return byte_order; +} + +static +struct declaration *ctf_declaration_integer_visit(int fd, int depth, + struct cds_list_head *expressions, + struct ctf_trace *trace) +{ + struct node *expression; + uint64_t alignment, size; + int byte_order = trace->byte_order; + int signedness = 0; + int has_alignment = 0, has_size = 0; + struct declaration_integer *integer_declaration; + + cds_list_for_each_entry(expression, expressions, siblings) { + struct node *left, *right; + + left = expression->u.ctf_expression.left; + right = expression->u.ctf_expression.right; + assert(left->u.unary_expression.type == UNARY_STRING); + if (!strcmp(left->u.unary_expression.u.string, "signed")) { + signedness = get_boolean(fd, depth, right); + if (signedness < 0) + return NULL; + } else if (!strcmp(left->u.unary_expression.u.string, "byte_order")) { + byte_order = get_byte_order(fd, depth, right); + if (byte_order < 0) + return NULL; + } else if (!strcmp(left->u.unary_expression.u.string, "size")) { + if (right->u.unary_expression.type != UNARY_UNSIGNED_CONSTANT) { + fprintf(stderr, "[error] %s: size: expecting unsigned constant\n", + __func__); + return NULL; + } + size = right->u.unary_expression.u.unsigned_constant; + has_size = 1; + } else if (!strcmp(left->u.unary_expression.u.string, "align")) { + if (right->u.unary_expression.type != UNARY_UNSIGNED_CONSTANT) { + fprintf(stderr, "[error] %s: align: expecting unsigned constant\n", + __func__); + return NULL; + } + alignment = right->u.unary_expression.u.unsigned_constant; + has_alignment = 1; + } else { + fprintf(stderr, "[error] %s: unknown attribute name %s\n", + __func__, left->u.unary_expression.u.string); + return NULL; + } + } + if (!has_size) { + fprintf(stderr, "[error] %s: missing size attribute\n", __func__); + return NULL; + } + if (!has_alignment) { + if (size % CHAR_BIT) { + /* bit-packed alignment */ + alignment = 1; + } else { + /* byte-packed alignment */ + alignment = CHAR_BIT; + } + } + integer_declaration = integer_declaration_new(size, + byte_order, signedness, alignment); + return &integer_declaration->p; +} + +static +struct declaration *ctf_declaration_floating_point_visit(int fd, int depth, + struct cds_list_head *expressions, + struct ctf_trace *trace) +{ + struct node *expression; + uint64_t alignment, exp_dig, mant_dig, byte_order = trace->byte_order; + int has_alignment = 0, has_exp_dig = 0, has_mant_dig = 0; + struct declaration_float *float_declaration; + + cds_list_for_each_entry(expression, expressions, siblings) { + struct node *left, *right; + + left = expression->u.ctf_expression.left; + right = expression->u.ctf_expression.right; + assert(left->u.unary_expression.type == UNARY_STRING); + if (!strcmp(left->u.unary_expression.u.string, "byte_order")) { + byte_order = get_byte_order(fd, depth, right); + if (byte_order < 0) + return NULL; + } else if (!strcmp(left->u.unary_expression.u.string, "exp_dig")) { + if (right->u.unary_expression.type != UNARY_UNSIGNED_CONSTANT) { + fprintf(stderr, "[error] %s: exp_dig: expecting unsigned constant\n", + __func__); + return NULL; + } + exp_dig = right->u.unary_expression.u.unsigned_constant; + has_exp_dig = 1; + } else if (!strcmp(left->u.unary_expression.u.string, "mant_dig")) { + if (right->u.unary_expression.type != UNARY_UNSIGNED_CONSTANT) { + fprintf(stderr, "[error] %s: mant_dig: expecting unsigned constant\n", + __func__); + return NULL; + } + mant_dig = right->u.unary_expression.u.unsigned_constant; + has_mant_dig = 1; + } else if (!strcmp(left->u.unary_expression.u.string, "align")) { + if (right->u.unary_expression.type != UNARY_UNSIGNED_CONSTANT) { + fprintf(stderr, "[error] %s: align: expecting unsigned constant\n", + __func__); + return NULL; + } + alignment = right->u.unary_expression.u.unsigned_constant; + has_alignment = 1; + } else { + fprintf(stderr, "[error] %s: unknown attribute name %s\n", + __func__, left->u.unary_expression.u.string); + return NULL; + } + } + if (!has_mant_dig) { + fprintf(stderr, "[error] %s: missing mant_dig attribute\n", __func__); + return NULL; + } + if (!has_exp_dig) { + fprintf(stderr, "[error] %s: missing exp_dig attribute\n", __func__); + return NULL; + } + if (!has_alignment) { + if ((mant_dig + exp_dig) % CHAR_BIT) { + /* bit-packed alignment */ + alignment = 1; + } else { + /* byte-packed alignment */ + alignment = CHAR_BIT; + } + } + float_declaration = float_declaration_new(mant_dig, exp_dig, + byte_order, alignment); + return &float_declaration->p; +} - /* Build alias type, add to current declaration scope. */ - /* Only one type declarator is allowed */ +static +struct declaration *ctf_declaration_string_visit(int fd, int depth, + struct cds_list_head *expressions, + struct ctf_trace *trace) +{ + struct node *expression; + const char *encoding_c = NULL; + enum ctf_string_encoding encoding = CTF_STRING_UTF8; + struct declaration_string *string_declaration; + + cds_list_for_each_entry(expression, expressions, siblings) { + struct node *left, *right; + + left = expression->u.ctf_expression.left; + right = expression->u.ctf_expression.right; + assert(left->u.unary_expression.type == UNARY_STRING); + if (!strcmp(left->u.unary_expression.u.string, "encoding")) { + if (right->u.unary_expression.type != UNARY_UNSIGNED_STRING) { + fprintf(stderr, "[error] %s: encoding: expecting string\n", + __func__); + return NULL; + } + encoding_c = right->u.unary_expression.u.string; + } else { + fprintf(stderr, "[error] %s: unknown attribute name %s\n", + __func__, left->u.unary_expression.u.string); + return NULL; + } + } + if (encoding_c && !strcmp(encoding_c, "ASCII")) + encoding = CTF_STRING_ASCII; + string_declaration = string_declaration_new(encoding); + return &string_declaration->p; +} + + +/* + * Also add named variant, struct or enum to the current declaration scope. + */ +static +struct declaration *ctf_declaration_specifier_visit(FILE *fd, + int depth, struct cds_list_head *head, + struct declaration_scope *declaration_scope, + struct ctf_trace *trace) +{ + struct declaration *declaration; + struct node *first; + + first = _cds_list_first_entry(head, struct node, siblings); + + switch (first->type) { + case NODE_STRUCT: + return ctf_declaration_struct_visit(fd, depth, + first->u._struct.name, + &first->u._struct.declaration_list, + first->u._struct.has_body, + declaration_scope, + trace); + case NODE_VARIANT: + return ctf_declaration_variant_visit(fd, depth, + first->u.variant.name, + &first->u.variant.declaration_list, + first->u.variant.has_body, + declaration_scope, + trace); + case NODE_ENUM: + return ctf_declaration_enum_visit(fd, depth, + first->u._enum.enum_id, + first->u._enum.container_type, + &first->u._enum.enumerator_list, + first->u._enum.has_body, + trace); + case NODE_INTEGER: + return ctf_declaration_integer_visit(fd, depth, + &first->u.integer.expressions, trace); + case NODE_FLOATING_POINT: + return ctf_declaration_floating_point_visit(fd, depth, + &first->u.floating_point.expressions, trace); + case NODE_STRING: + return ctf_declaration_string_visit(fd, depth, + &first->u.string.expressions, trace); + case NODE_TYPE_SPECIFIER: + return ctf_declaration_type_specifier_visit(fd, depth, + head, declaration_scope, trace); + } } static @@ -445,7 +1097,7 @@ int ctf_event_declaration_visit(FILE *fd, int depth, struct ctf_node *node, stru return -EPERM; declaration = ctf_declaration_specifier_visit(fd, depth, &node->u.ctf_expression.right, - event->declaration_scope); + event->declaration_scope, trace); if (!declaration) return -EPERM; if (declaration->type->id != CTF_TYPE_STRUCT) @@ -458,7 +1110,7 @@ int ctf_event_declaration_visit(FILE *fd, int depth, struct ctf_node *node, stru return -EPERM; declaration = ctf_declaration_specifier_visit(fd, depth, &node->u.ctf_expression.right, - event->declaration_scope); + event->declaration_scope, trace); if (!declaration) return -EPERM; if (declaration->type->id != CTF_TYPE_STRUCT) @@ -583,7 +1235,7 @@ int ctf_stream_declaration_visit(FILE *fd, int depth, struct ctf_node *node, str declaration = ctf_declaration_specifier_visit(fd, depth, &node->u.ctf_expression.right, - stream->declaration_scope, stream->definition_scope); + stream->declaration_scope, stream->definition_scope, trace); if (!declaration) return -EPERM; if (declaration->type->id != CTF_TYPE_STRUCT) @@ -594,7 +1246,7 @@ int ctf_stream_declaration_visit(FILE *fd, int depth, struct ctf_node *node, str declaration = ctf_declaration_specifier_visit(fd, depth, &node->u.ctf_expression.right, - stream->declaration_scope); + stream->declaration_scope, trace); if (!declaration) return -EPERM; if (declaration->type->id != CTF_TYPE_STRUCT) @@ -605,7 +1257,7 @@ int ctf_stream_declaration_visit(FILE *fd, int depth, struct ctf_node *node, str declaration = ctf_declaration_specifier_visit(fd, depth, &node->u.ctf_expression.right, - stream->declaration_scope); + stream->declaration_scope, trace); if (!declaration) return -EPERM; if (declaration->type->id != CTF_TYPE_STRUCT) @@ -770,7 +1422,6 @@ int ctf_trace_declaration_visit(FILE *fd, int depth, struct ctf_node *node, stru return 0; } - static int ctf_trace_visit(FILE *fd, int depth, struct ctf_node *node, struct ctf_trace *trace) { @@ -812,11 +1463,14 @@ error: return ret; } -int _ctf_visitor(FILE *fd, int depth, struct ctf_node *node, struct ctf_trace *trace) +int ctf_visitor_construct_metadata(FILE *fd, int depth, struct ctf_node *node, + struct ctf_trace *trace, int byte_order) { int ret = 0; struct ctf_node *iter; + trace->byte_order = byte_order; + switch (node->type) { case NODE_ROOT: cds_list_for_each_entry(iter, &node->u.root._typedef, @@ -838,7 +1492,7 @@ int _ctf_visitor(FILE *fd, int depth, struct ctf_node *node, struct ctf_trace *t } cds_list_for_each_entry(iter, &node->u.root.declaration_specifier, siblings) { ret = ctf_declaration_specifier_visit(fd, depth, iter, - trace->root_declaration_scope); + trace->root_declaration_scope, trace); if (ret) return ret; } @@ -860,229 +1514,6 @@ int _ctf_visitor(FILE *fd, int depth, struct ctf_node *node, struct ctf_trace *t return ret; } break; - - case NODE_TYPEALIAS_TARGET: - print_tabs(fd, depth); - fprintf(fd, "\n"); - depth++; - - print_tabs(fd, depth); - fprintf(fd, "\n"); - cds_list_for_each_entry(iter, &node->u.typealias_target.declaration_specifier, siblings) { - ret = ctf_visitor_print_xml(fd, depth + 1, iter); - if (ret) - return ret; - } - print_tabs(fd, depth); - fprintf(fd, "\n"); - - print_tabs(fd, depth); - fprintf(fd, "\n"); - cds_list_for_each_entry(iter, &node->u.typealias_target.type_declarators, siblings) { - ret = ctf_visitor_print_xml(fd, depth + 1, iter); - if (ret) - return ret; - } - print_tabs(fd, depth); - fprintf(fd, "\n"); - - depth--; - print_tabs(fd, depth); - fprintf(fd, "\n"); - break; - case NODE_TYPEALIAS_ALIAS: - print_tabs(fd, depth); - fprintf(fd, "\n"); - depth++; - - print_tabs(fd, depth); - fprintf(fd, "\n"); - cds_list_for_each_entry(iter, &node->u.typealias_alias.declaration_specifier, siblings) { - ret = ctf_visitor_print_xml(fd, depth + 1, iter); - if (ret) - return ret; - } - print_tabs(fd, depth); - fprintf(fd, "\n"); - - print_tabs(fd, depth); - fprintf(fd, "\n"); - cds_list_for_each_entry(iter, &node->u.typealias_alias.type_declarators, siblings) { - ret = ctf_visitor_print_xml(fd, depth + 1, iter); - if (ret) - return ret; - } - print_tabs(fd, depth); - fprintf(fd, "\n"); - - depth--; - print_tabs(fd, depth); - fprintf(fd, "\n"); - break; - case NODE_TYPEALIAS: - print_tabs(fd, depth); - fprintf(fd, "\n"); - ret = ctf_visitor_print_xml(fd, depth + 1, node->u.typealias.target); - if (ret) - return ret; - ret = ctf_visitor_print_xml(fd, depth + 1, node->u.typealias.alias); - if (ret) - return ret; - print_tabs(fd, depth); - fprintf(fd, "\n"); - break; - - case NODE_TYPE_SPECIFIER: - ret = ctf_visitor_print_type_specifier(fd, depth, node); - if (ret) - return ret; - break; - case NODE_POINTER: - print_tabs(fd, depth); - if (node->u.pointer.const_qualifier) - fprintf(fd, "\n"); - else - fprintf(fd, "\n"); - break; - case NODE_TYPE_DECLARATOR: - ret = ctf_visitor_print_type_declarator(fd, depth, node); - if (ret) - return ret; - break; - - case NODE_FLOATING_POINT: - print_tabs(fd, depth); - fprintf(fd, "\n"); - cds_list_for_each_entry(iter, &node->u.floating_point.expressions, siblings) { - ret = ctf_visitor_print_xml(fd, depth + 1, iter); - if (ret) - return ret; - } - print_tabs(fd, depth); - fprintf(fd, "\n"); - break; - case NODE_INTEGER: - print_tabs(fd, depth); - fprintf(fd, "\n"); - cds_list_for_each_entry(iter, &node->u.integer.expressions, siblings) { - ret = ctf_visitor_print_xml(fd, depth + 1, iter); - if (ret) - return ret; - } - print_tabs(fd, depth); - fprintf(fd, "\n"); - break; - case NODE_STRING: - print_tabs(fd, depth); - fprintf(fd, "\n"); - cds_list_for_each_entry(iter, &node->u.string.expressions, siblings) { - ret = ctf_visitor_print_xml(fd, depth + 1, iter); - if (ret) - return ret; - } - print_tabs(fd, depth); - fprintf(fd, "\n"); - break; - case NODE_ENUMERATOR: - print_tabs(fd, depth); - fprintf(fd, "u.enumerator.id) - fprintf(fd, " id=\"%s\"", node->u.enumerator.id); - fprintf(fd, ">\n"); - cds_list_for_each_entry(iter, &node->u.enumerator.values, siblings) { - ret = ctf_visitor_print_xml(fd, depth + 1, iter); - if (ret) - return ret; - } - print_tabs(fd, depth); - fprintf(fd, "\n"); - break; - case NODE_ENUM: - print_tabs(fd, depth); - if (node->u._struct.name) - fprintf(fd, "\n", - node->u._enum.enum_id); - else - fprintf(fd, "\n"); - depth++; - - if (node->u._enum.container_type) { - print_tabs(fd, depth); - fprintf(fd, "\n"); - ret = ctf_visitor_print_xml(fd, depth + 1, node->u._enum.container_type); - if (ret) - return ret; - print_tabs(fd, depth); - fprintf(fd, "\n"); - } - - print_tabs(fd, depth); - fprintf(fd, "\n"); - cds_list_for_each_entry(iter, &node->u._enum.enumerator_list, siblings) { - ret = ctf_visitor_print_xml(fd, depth + 1, iter); - if (ret) - return ret; - } - print_tabs(fd, depth); - fprintf(fd, "\n"); - - depth--; - print_tabs(fd, depth); - fprintf(fd, "\n"); - break; - case NODE_STRUCT_OR_VARIANT_DECLARATION: - print_tabs(fd, depth); - fprintf(fd, "\n"); - cds_list_for_each_entry(iter, &node->u.struct_or_variant_declaration.declaration_specifier, siblings) { - ret = ctf_visitor_print_xml(fd, depth + 1, iter); - if (ret) - return ret; - } - print_tabs(fd, depth); - fprintf(fd, "\n"); - - print_tabs(fd, depth); - fprintf(fd, "\n"); - cds_list_for_each_entry(iter, &node->u.struct_or_variant_declaration.type_declarators, siblings) { - ret = ctf_visitor_print_xml(fd, depth + 1, iter); - if (ret) - return ret; - } - print_tabs(fd, depth); - fprintf(fd, "\n"); - break; - case NODE_VARIANT: - print_tabs(fd, depth); - fprintf(fd, "u.variant.name) - fprintf(fd, " name=\"%s\"", node->u.variant.name); - if (node->u.variant.choice) - fprintf(fd, " choice=\"%s\"", node->u.variant.choice); - fprintf(fd, ">\n"); - cds_list_for_each_entry(iter, &node->u.variant.declaration_list, siblings) { - ret = ctf_visitor_print_xml(fd, depth + 1, iter); - if (ret) - return ret; - } - print_tabs(fd, depth); - fprintf(fd, "\n"); - break; - case NODE_STRUCT: - print_tabs(fd, depth); - if (node->u._struct.name) - fprintf(fd, "\n", - node->u._struct.name); - else - fprintf(fd, "\n"); - cds_list_for_each_entry(iter, &node->u._struct.declaration_list, siblings) { - ret = ctf_visitor_print_xml(fd, depth + 1, iter); - if (ret) - return ret; - } - print_tabs(fd, depth); - fprintf(fd, "\n"); - break; - case NODE_UNKNOWN: default: fprintf(stderr, "[error] %s: unknown node type %d\n", __func__,