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 void sequence_copy(struct stream_pos
*dest
, const struct format
*fdest
,
35 struct stream_pos
*src
, const struct format
*fsrc
,
36 struct definition
*definition
)
38 struct definition_sequence
*sequence
=
39 container_of(definition
, struct definition_sequence
, p
);
40 struct declaration_sequence
*sequence_declaration
= sequence
->declaration
;
41 uint64_t len
, oldlen
, i
;
43 fsrc
->sequence_begin(src
, sequence_declaration
);
45 fdest
->sequence_begin(dest
, sequence_declaration
);
47 sequence
->len
->p
.declaration
->copy(dest
, fdest
, src
, fsrc
,
49 len
= sequence
->len
->value
._unsigned
;
50 g_array_set_size(sequence
->elems
, len
);
52 * Yes, large sequences could be _painfully slow_ to parse due
53 * to memory allocation for each event read. At least, never
54 * shrink the sequence. Note: the sequence GArray len should
55 * never be used as indicator of the current sequence length.
56 * One should always look at the sequence->len->value._unsigned
59 oldlen
= sequence
->elems
->len
;
61 g_array_set_size(sequence
->elems
, len
);
63 for (i
= oldlen
; i
< len
; i
++) {
68 str
= g_string_new("");
69 g_string_printf(str
, "[%" PRIu64
"]", i
);
70 (void) g_string_free(str
, TRUE
);
71 name
= g_quark_from_string(str
->str
);
73 field
= &g_array_index(sequence
->elems
, struct field
, i
);
75 field
->definition
= sequence_declaration
->elem
->definition_new(sequence_declaration
->elem
,
78 field
->definition
->declaration
->copy(dest
, fdest
, src
, fsrc
, field
->definition
);
80 fsrc
->sequence_end(src
, sequence_declaration
);
82 fdest
->sequence_end(dest
, sequence_declaration
);
86 void _sequence_declaration_free(struct declaration
*declaration
)
88 struct declaration_sequence
*sequence_declaration
=
89 container_of(declaration
, struct declaration_sequence
, p
);
91 free_declaration_scope(sequence_declaration
->scope
);
92 declaration_unref(&sequence_declaration
->len_declaration
->p
);
93 declaration_unref(sequence_declaration
->elem
);
94 g_free(sequence_declaration
);
97 struct declaration_sequence
*
98 sequence_declaration_new(struct declaration_integer
*len_declaration
,
99 struct declaration
*elem_declaration
,
100 struct declaration_scope
*parent_scope
)
102 struct declaration_sequence
*sequence_declaration
;
103 struct declaration
*declaration
;
105 sequence_declaration
= g_new(struct declaration_sequence
, 1);
106 declaration
= &sequence_declaration
->p
;
107 assert(!len_declaration
->signedness
);
108 declaration_ref(&len_declaration
->p
);
109 sequence_declaration
->len_declaration
= len_declaration
;
110 declaration_ref(elem_declaration
);
111 sequence_declaration
->elem
= elem_declaration
;
112 sequence_declaration
->scope
= new_declaration_scope(parent_scope
);
113 declaration
->id
= CTF_TYPE_SEQUENCE
;
114 declaration
->alignment
= max(len_declaration
->p
.alignment
, elem_declaration
->alignment
);
115 declaration
->copy
= sequence_copy
;
116 declaration
->declaration_free
= _sequence_declaration_free
;
117 declaration
->definition_new
= _sequence_definition_new
;
118 declaration
->definition_free
= _sequence_definition_free
;
119 declaration
->ref
= 1;
120 return sequence_declaration
;
124 struct definition
*_sequence_definition_new(struct declaration
*declaration
,
125 struct definition_scope
*parent_scope
,
126 GQuark field_name
, int index
)
128 struct declaration_sequence
*sequence_declaration
=
129 container_of(declaration
, struct declaration_sequence
, p
);
130 struct definition_sequence
*sequence
;
131 struct definition
*len_parent
;
133 sequence
= g_new(struct definition_sequence
, 1);
134 declaration_ref(&sequence_declaration
->p
);
135 sequence
->p
.declaration
= declaration
;
136 sequence
->declaration
= sequence_declaration
;
138 sequence
->p
.index
= index
;
139 sequence
->scope
= new_definition_scope(parent_scope
, field_name
);
140 len_parent
= sequence_declaration
->len_declaration
->p
.definition_new(&sequence_declaration
->len_declaration
->p
,
142 g_quark_from_static_string("length"), 0);
144 container_of(len_parent
, struct definition_integer
, p
);
145 sequence
->elems
= g_array_new(FALSE
, TRUE
, sizeof(struct field
));
150 void _sequence_definition_free(struct definition
*definition
)
152 struct definition_sequence
*sequence
=
153 container_of(definition
, struct definition_sequence
, p
);
154 struct definition
*len_definition
= &sequence
->len
->p
;
157 for (i
= 0; i
< sequence
->elems
->len
; i
++) {
160 field
= &g_array_index(sequence
->elems
, struct field
, i
);
161 field
->definition
->declaration
->definition_free(field
->definition
);
163 (void) g_array_free(sequence
->elems
, TRUE
);
164 len_definition
->declaration
->definition_free(len_definition
);
165 free_definition_scope(sequence
->scope
);
166 declaration_unref(sequence
->p
.declaration
);
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
;