/*
- * BabelTrace - Sequence Type Converter
+ * sequence.c
*
- * Copyright (c) 2010 Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
+ * BabelTrace - Sequence Type Converter
*
- * This library is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser General Public
- * License as published by the Free Software Foundation; either
- * version 2.1 of the License, or (at your option) any later version.
+ * Copyright 2010, 2011 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
*
- * This library is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
- * Lesser General Public License for more details.
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
*
- * You should have received a copy of the GNU Lesser General Public
- * License along with this library; if not, write to the Free Software
- * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
*/
#include <babeltrace/compiler.h>
-#include <babeltrace/types.h>
+#include <babeltrace/format.h>
+#include <inttypes.h>
+
+#ifndef max
+#define max(a, b) ((a) < (b) ? (b) : (a))
+#endif
+
+static
+struct definition *_sequence_definition_new(struct declaration *declaration,
+ struct definition_scope *parent_scope,
+ GQuark field_name, int index);
+static
+void _sequence_definition_free(struct definition *definition);
void sequence_copy(struct stream_pos *dest, const struct format *fdest,
struct stream_pos *src, const struct format *fsrc,
- const struct type_class *type_class)
+ struct definition *definition)
{
- struct type_class_sequence *sequence_class =
- container_of(type_class, struct type_class_sequence, p);
- unsigned int i;
- size_t len;
+ struct definition_sequence *sequence =
+ container_of(definition, struct definition_sequence, p);
+ struct declaration_sequence *sequence_declaration = sequence->declaration;
+ uint64_t len, oldlen, i;
+
+ fsrc->sequence_begin(src, sequence_declaration);
+ if (fdest)
+ fdest->sequence_begin(dest, sequence_declaration);
+
+ sequence->len->p.declaration->copy(dest, fdest, src, fsrc,
+ &sequence->len->p);
+ len = sequence->len->value._unsigned;
+ g_array_set_size(sequence->elems, len);
+ /*
+ * Yes, large sequences could be _painfully slow_ to parse due
+ * to memory allocation for each event read. At least, never
+ * shrink the sequence. Note: the sequence GArray len should
+ * never be used as indicator of the current sequence length.
+ * One should always look at the sequence->len->value._unsigned
+ * value for that.
+ */
+ oldlen = sequence->elems->len;
+ if (oldlen < len)
+ g_array_set_size(sequence->elems, len);
- fsrc->sequence_begin(src, sequence_class);
- fdest->sequence_begin(dest, sequence_class);
+ for (i = oldlen; i < len; i++) {
+ struct field *field;
+ GString *str;
+ GQuark name;
- len = fsrc->uint_read(src, sequence_class->len_class);
- fdest->uint_write(dest, sequence_class->len_class, len);
+ str = g_string_new("");
+ g_string_printf(str, "[%" PRIu64 "]", i);
+ (void) g_string_free(str, TRUE);
+ name = g_quark_from_string(str->str);
- for (i = 0; i < len; i++) {
- struct type_class *elem_class = sequence_class->elem;
- elem_class->copy(dest, fdest, src, fsrc, &elem_class->p);
+ field = &g_array_index(sequence->elems, struct field, i);
+ field->name = name;
+ field->definition = sequence_declaration->elem->definition_new(sequence_declaration->elem,
+ sequence->scope,
+ name, i);
+ field->definition->declaration->copy(dest, fdest, src, fsrc, field->definition);
}
- fsrc->sequence_end(src, sequence_class);
- fdest->sequence_end(dest, sequence_class);
+ fsrc->sequence_end(src, sequence_declaration);
+ if (fdest)
+ fdest->sequence_end(dest, sequence_declaration);
}
-void sequence_type_free(struct type_class_sequence *sequence_class)
+static
+void _sequence_declaration_free(struct declaration *declaration)
{
- sequence_class->elem->free(&sequence_class->elem->p);
- g_free(sequence_class);
+ struct declaration_sequence *sequence_declaration =
+ container_of(declaration, struct declaration_sequence, p);
+
+ free_declaration_scope(sequence_declaration->scope);
+ declaration_unref(&sequence_declaration->len_declaration->p);
+ declaration_unref(sequence_declaration->elem);
+ g_free(sequence_declaration);
}
-static void _sequence_type_free(struct type_class *type_class)
+struct declaration_sequence *
+ sequence_declaration_new(struct declaration_integer *len_declaration,
+ struct declaration *elem_declaration,
+ struct declaration_scope *parent_scope)
{
- struct type_class_struct *sequence_class =
- container_of(type_class, struct type_class_sequence, p);
- sequence_type_free(sequence_class);
+ struct declaration_sequence *sequence_declaration;
+ struct declaration *declaration;
+
+ sequence_declaration = g_new(struct declaration_sequence, 1);
+ declaration = &sequence_declaration->p;
+ assert(!len_declaration->signedness);
+ declaration_ref(&len_declaration->p);
+ sequence_declaration->len_declaration = len_declaration;
+ declaration_ref(elem_declaration);
+ sequence_declaration->elem = elem_declaration;
+ sequence_declaration->scope = new_declaration_scope(parent_scope);
+ declaration->id = CTF_TYPE_SEQUENCE;
+ declaration->alignment = max(len_declaration->p.alignment, elem_declaration->alignment);
+ declaration->copy = sequence_copy;
+ declaration->declaration_free = _sequence_declaration_free;
+ declaration->definition_new = _sequence_definition_new;
+ declaration->definition_free = _sequence_definition_free;
+ declaration->ref = 1;
+ return sequence_declaration;
}
-struct type_class_sequence *
-sequence_type_new(const char *name, struct type_class_integer *len_class,
- struct type_class *elem)
+static
+struct definition *_sequence_definition_new(struct declaration *declaration,
+ struct definition_scope *parent_scope,
+ GQuark field_name, int index)
{
- struct type_class_sequence *sequence_class;
- int ret;
+ struct declaration_sequence *sequence_declaration =
+ container_of(declaration, struct declaration_sequence, p);
+ struct definition_sequence *sequence;
+ struct definition *len_parent;
- sequence_class = g_new(struct type_class_sequence, 1);
- type_class = &float_class->p;
+ sequence = g_new(struct definition_sequence, 1);
+ declaration_ref(&sequence_declaration->p);
+ sequence->p.declaration = declaration;
+ sequence->declaration = sequence_declaration;
+ sequence->p.ref = 1;
+ sequence->p.index = index;
+ sequence->scope = new_definition_scope(parent_scope, field_name);
+ len_parent = sequence_declaration->len_declaration->p.definition_new(&sequence_declaration->len_declaration->p,
+ sequence->scope,
+ g_quark_from_static_string("length"), 0);
+ sequence->len =
+ container_of(len_parent, struct definition_integer, p);
+ sequence->elems = g_array_new(FALSE, TRUE, sizeof(struct field));
+ return &sequence->p;
+}
- assert(!len_class->signedness);
+static
+void _sequence_definition_free(struct definition *definition)
+{
+ struct definition_sequence *sequence =
+ container_of(definition, struct definition_sequence, p);
+ struct definition *len_definition = &sequence->len->p;
+ uint64_t i;
- sequence_class->len = len;
- type_class->name = g_quark_from_string(name);
- type_class->alignment = max(len_class->p.alignment,
- elem->p.alignment);
- type_class->copy = sequence_copy;
- type_class->free = _sequence_type_free;
+ for (i = 0; i < sequence->elems->len; i++) {
+ struct field *field;
- if (type_class->name) {
- ret = ctf_register_type(type_class);
- if (ret)
- goto error_register;
+ field = &g_array_index(sequence->elems, struct field, i);
+ field->definition->declaration->definition_free(field->definition);
}
- return sequence_class;
+ (void) g_array_free(sequence->elems, TRUE);
+ len_definition->declaration->definition_free(len_definition);
+ free_definition_scope(sequence->scope);
+ declaration_unref(sequence->p.declaration);
+ g_free(sequence);
+}
-error_register:
- len_class->p.free(&len_class->p);
- sequence_class->elem->free(&sequence_class->elem->p);
- g_free(sequence_class);
- return NULL;
+struct definition *sequence_index(struct definition_sequence *sequence, uint64_t i)
+{
+ if (i >= sequence->len->value._unsigned)
+ return NULL;
+ assert(i < sequence->elems->len);
+ return g_array_index(sequence->elems, struct field, i).definition;
}
projects / babeltrace.git / blobdiff