4 * BabelTrace - Sequence Type Converter
6 * Copyright 2010, 2011 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
8 * Permission is hereby granted, free of charge, to any person obtaining a copy
9 * of this software and associated documentation files (the "Software"), to deal
10 * in the Software without restriction, including without limitation the rights
11 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
12 * copies of the Software, and to permit persons to whom the Software is
13 * furnished to do so, subject to the following conditions:
15 * The above copyright notice and this permission notice shall be included in
16 * all copies or substantial portions of the Software.
19 #include <babeltrace/compiler.h>
20 #include <babeltrace/format.h>
24 #define max(a, b) ((a) < (b) ? (b) : (a))
28 struct definition
*_sequence_definition_new(struct declaration
*declaration
,
29 struct definition_scope
*parent_scope
,
30 GQuark field_name
, int index
);
32 void _sequence_definition_free(struct definition
*definition
);
34 int sequence_rw(struct stream_pos
*pos
, struct definition
*definition
)
36 struct definition_sequence
*sequence_definition
=
37 container_of(definition
, struct definition_sequence
, p
);
38 const struct declaration_sequence
*sequence_declaration
=
39 sequence_definition
->declaration
;
40 uint64_t len
, oldlen
, i
;
43 ret
= generic_rw(pos
, &sequence_definition
->len
->p
);
46 len
= sequence_definition
->len
->value
._unsigned
;
48 * Yes, large sequences could be _painfully slow_ to parse due
49 * to memory allocation for each event read. At least, never
50 * shrink the sequence. Note: the sequence GArray len should
51 * never be used as indicator of the current sequence length.
52 * One should always look at the sequence->len->value._unsigned
55 oldlen
= sequence_definition
->elems
->len
;
57 g_array_set_size(sequence_definition
->elems
, len
);
59 for (i
= oldlen
; i
< len
; i
++) {
64 str
= g_string_new("");
65 g_string_printf(str
, "[%" PRIu64
"]", i
);
66 (void) g_string_free(str
, TRUE
);
67 name
= g_quark_from_string(str
->str
);
69 field
= &g_array_index(sequence_definition
->elems
, struct field
, i
);
71 field
->definition
= sequence_declaration
->elem
->definition_new(sequence_declaration
->elem
,
72 sequence_definition
->scope
,
74 ret
= generic_rw(pos
, field
->definition
);
82 void _sequence_declaration_free(struct declaration
*declaration
)
84 struct declaration_sequence
*sequence_declaration
=
85 container_of(declaration
, struct declaration_sequence
, p
);
87 free_declaration_scope(sequence_declaration
->scope
);
88 declaration_unref(&sequence_declaration
->len_declaration
->p
);
89 declaration_unref(sequence_declaration
->elem
);
90 g_free(sequence_declaration
);
93 struct declaration_sequence
*
94 sequence_declaration_new(struct declaration_integer
*len_declaration
,
95 struct declaration
*elem_declaration
,
96 struct declaration_scope
*parent_scope
)
98 struct declaration_sequence
*sequence_declaration
;
99 struct declaration
*declaration
;
101 sequence_declaration
= g_new(struct declaration_sequence
, 1);
102 declaration
= &sequence_declaration
->p
;
103 assert(!len_declaration
->signedness
);
104 declaration_ref(&len_declaration
->p
);
105 sequence_declaration
->len_declaration
= len_declaration
;
106 declaration_ref(elem_declaration
);
107 sequence_declaration
->elem
= elem_declaration
;
108 sequence_declaration
->scope
= new_declaration_scope(parent_scope
);
109 declaration
->id
= CTF_TYPE_SEQUENCE
;
110 declaration
->alignment
= max(len_declaration
->p
.alignment
, elem_declaration
->alignment
);
111 declaration
->declaration_free
= _sequence_declaration_free
;
112 declaration
->definition_new
= _sequence_definition_new
;
113 declaration
->definition_free
= _sequence_definition_free
;
114 declaration
->ref
= 1;
115 return sequence_declaration
;
119 struct definition
*_sequence_definition_new(struct declaration
*declaration
,
120 struct definition_scope
*parent_scope
,
121 GQuark field_name
, int index
)
123 struct declaration_sequence
*sequence_declaration
=
124 container_of(declaration
, struct declaration_sequence
, p
);
125 struct definition_sequence
*sequence
;
126 struct definition
*len_parent
;
128 sequence
= g_new(struct definition_sequence
, 1);
129 declaration_ref(&sequence_declaration
->p
);
130 sequence
->p
.declaration
= declaration
;
131 sequence
->declaration
= sequence_declaration
;
133 sequence
->p
.index
= index
;
134 sequence
->scope
= new_definition_scope(parent_scope
, field_name
);
135 len_parent
= sequence_declaration
->len_declaration
->p
.definition_new(&sequence_declaration
->len_declaration
->p
,
137 g_quark_from_static_string("length"), 0);
139 container_of(len_parent
, struct definition_integer
, p
);
140 sequence
->elems
= g_array_new(FALSE
, TRUE
, sizeof(struct field
));
145 void _sequence_definition_free(struct definition
*definition
)
147 struct definition_sequence
*sequence
=
148 container_of(definition
, struct definition_sequence
, p
);
149 struct definition
*len_definition
= &sequence
->len
->p
;
152 for (i
= 0; i
< sequence
->elems
->len
; i
++) {
155 field
= &g_array_index(sequence
->elems
, struct field
, i
);
156 field
->definition
->declaration
->definition_free(field
->definition
);
158 (void) g_array_free(sequence
->elems
, TRUE
);
159 len_definition
->declaration
->definition_free(len_definition
);
160 free_definition_scope(sequence
->scope
);
161 declaration_unref(sequence
->p
.declaration
);
165 uint64_t sequence_len(struct definition_sequence
*sequence
)
167 return sequence
->len
->value
._unsigned
;
170 struct definition
*sequence_index(struct definition_sequence
*sequence
, uint64_t i
)
172 if (i
>= sequence
->len
->value
._unsigned
)
174 assert(i
< sequence
->elems
->len
);
175 return g_array_index(sequence
->elems
, struct field
, i
).definition
;