#include <babeltrace/compiler.h>
#include <babeltrace/format.h>
+#include <inttypes.h>
#ifndef max
#define max(a, b) ((a) < (b) ? (b) : (a))
static
struct definition *_sequence_definition_new(struct declaration *declaration,
- struct definition_scope *parent_scope);
+ 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,
- struct definition *definition)
+void sequence_rw(struct stream_pos *pos, struct definition *definition)
{
- struct definition_sequence *sequence =
+ struct definition_sequence *sequence_definition =
container_of(definition, struct definition_sequence, p);
- struct declaration_sequence *sequence_declaration = sequence->declaration;
- uint64_t i;
+ const struct declaration_sequence *sequence_declaration =
+ sequence_definition->declaration;
+ uint64_t len, oldlen, i;
+
+ generic_rw(pos, &sequence_definition->len->p);
+ len = sequence_definition->len->value._unsigned;
+ /*
+ * 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_definition->elems->len;
+ if (oldlen < len)
+ g_array_set_size(sequence_definition->elems, len);
- fsrc->sequence_begin(src, sequence_declaration);
- fdest->sequence_begin(dest, sequence_declaration);
+ for (i = oldlen; i < len; i++) {
+ struct field *field;
+ GString *str;
+ GQuark name;
- sequence->len->p.declaration->copy(dest, fdest, src, fsrc,
- &sequence->len->p);
+ 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 < sequence->len->value._unsigned; i++) {
- struct definition *elem =
- sequence->current_element.definition;
- elem->declaration->copy(dest, fdest, src, fsrc, elem);
+ field = &g_array_index(sequence_definition->elems, struct field, i);
+ field->name = name;
+ field->definition = sequence_declaration->elem->definition_new(sequence_declaration->elem,
+ sequence_definition->scope,
+ name, i);
+ generic_rw(pos, field->definition);
}
- fsrc->sequence_end(src, sequence_declaration);
- fdest->sequence_end(dest, sequence_declaration);
}
static
}
struct declaration_sequence *
- sequence_declaration_new(const char *name, struct declaration_integer *len_declaration,
+ sequence_declaration_new(struct declaration_integer *len_declaration,
struct declaration *elem_declaration,
struct declaration_scope *parent_scope)
{
sequence_declaration->elem = elem_declaration;
sequence_declaration->scope = new_declaration_scope(parent_scope);
declaration->id = CTF_TYPE_SEQUENCE;
- declaration->name = g_quark_from_string(name);
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;
static
struct definition *_sequence_definition_new(struct declaration *declaration,
- struct definition_scope *parent_scope)
+ struct definition_scope *parent_scope,
+ GQuark field_name, int index)
{
struct declaration_sequence *sequence_declaration =
container_of(declaration, struct declaration_sequence, p);
sequence->p.declaration = declaration;
sequence->declaration = sequence_declaration;
sequence->p.ref = 1;
- sequence->scope = new_definition_scope(parent_scope);
+ 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,
- parent_scope);
+ sequence->scope,
+ g_quark_from_static_string("length"), 0);
sequence->len =
container_of(len_parent, struct definition_integer, p);
- sequence->current_element.definition =
- sequence_declaration->elem->definition_new(sequence_declaration->elem,
- parent_scope);
+ sequence->elems = g_array_new(FALSE, TRUE, sizeof(struct field));
return &sequence->p;
}
struct definition_sequence *sequence =
container_of(definition, struct definition_sequence, p);
struct definition *len_definition = &sequence->len->p;
- struct definition *elem_definition =
- sequence->current_element.definition;
+ uint64_t i;
+
+ for (i = 0; i < sequence->elems->len; i++) {
+ struct field *field;
+ field = &g_array_index(sequence->elems, struct field, i);
+ field->definition->declaration->definition_free(field->definition);
+ }
+ (void) g_array_free(sequence->elems, TRUE);
len_definition->declaration->definition_free(len_definition);
- elem_definition->declaration->definition_free(elem_definition);
free_definition_scope(sequence->scope);
declaration_unref(sequence->p.declaration);
g_free(sequence);
}
+
+uint64_t sequence_len(struct definition_sequence *sequence)
+{
+ return sequence->len->value._unsigned;
+}
+
+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