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 struct definition
*_sequence_definition_new(struct declaration
*declaration
,
25 struct definition_scope
*parent_scope
,
26 GQuark field_name
, int index
,
27 const char *root_name
);
29 void _sequence_definition_free(struct definition
*definition
);
31 int sequence_rw(struct stream_pos
*pos
, struct definition
*definition
)
33 struct definition_sequence
*sequence_definition
=
34 container_of(definition
, struct definition_sequence
, p
);
35 const struct declaration_sequence
*sequence_declaration
=
36 sequence_definition
->declaration
;
37 uint64_t len
, oldlen
, i
;
40 len
= sequence_definition
->length
->value
._unsigned
;
42 * Yes, large sequences could be _painfully slow_ to parse due
43 * to memory allocation for each event read. At least, never
44 * shrink the sequence. Note: the sequence GArray len should
45 * never be used as indicator of the current sequence length.
46 * One should always look at the sequence->len->value._unsigned
49 oldlen
= sequence_definition
->elems
->len
;
51 g_ptr_array_set_size(sequence_definition
->elems
, len
);
53 for (i
= oldlen
; i
< len
; i
++) {
54 struct definition
**field
;
58 str
= g_string_new("");
59 g_string_printf(str
, "[%" PRIu64
"]", i
);
60 (void) g_string_free(str
, TRUE
);
61 name
= g_quark_from_string(str
->str
);
63 field
= (struct definition
**) &g_ptr_array_index(sequence_definition
->elems
, i
);
64 *field
= sequence_declaration
->elem
->definition_new(sequence_declaration
->elem
,
65 sequence_definition
->p
.scope
,
67 ret
= generic_rw(pos
, *field
);
75 void _sequence_declaration_free(struct declaration
*declaration
)
77 struct declaration_sequence
*sequence_declaration
=
78 container_of(declaration
, struct declaration_sequence
, p
);
80 free_declaration_scope(sequence_declaration
->scope
);
81 g_array_free(sequence_declaration
->length_name
, TRUE
);
82 declaration_unref(sequence_declaration
->elem
);
83 g_free(sequence_declaration
);
86 struct declaration_sequence
*
87 sequence_declaration_new(const char *length
,
88 struct declaration
*elem_declaration
,
89 struct declaration_scope
*parent_scope
)
91 struct declaration_sequence
*sequence_declaration
;
92 struct declaration
*declaration
;
94 sequence_declaration
= g_new(struct declaration_sequence
, 1);
95 declaration
= &sequence_declaration
->p
;
97 sequence_declaration
->length_name
= g_array_new(FALSE
, TRUE
, sizeof(GQuark
));
98 append_scope_path(length
, sequence_declaration
->length_name
);
100 declaration_ref(elem_declaration
);
101 sequence_declaration
->elem
= elem_declaration
;
102 sequence_declaration
->scope
= new_declaration_scope(parent_scope
);
103 declaration
->id
= CTF_TYPE_SEQUENCE
;
104 declaration
->alignment
= elem_declaration
->alignment
;
105 declaration
->declaration_free
= _sequence_declaration_free
;
106 declaration
->definition_new
= _sequence_definition_new
;
107 declaration
->definition_free
= _sequence_definition_free
;
108 declaration
->ref
= 1;
109 return sequence_declaration
;
113 struct definition
*_sequence_definition_new(struct declaration
*declaration
,
114 struct definition_scope
*parent_scope
,
115 GQuark field_name
, int index
,
116 const char *root_name
)
118 struct declaration_sequence
*sequence_declaration
=
119 container_of(declaration
, struct declaration_sequence
, p
);
120 struct definition_sequence
*sequence
;
121 struct definition
*len_parent
;
124 sequence
= g_new(struct definition_sequence
, 1);
125 declaration_ref(&sequence_declaration
->p
);
126 sequence
->p
.declaration
= declaration
;
127 sequence
->declaration
= sequence_declaration
;
130 * Use INT_MAX order to ensure that all fields of the parent
131 * scope are seen as being prior to this scope.
133 sequence
->p
.index
= root_name
? INT_MAX
: index
;
134 sequence
->p
.name
= field_name
;
135 sequence
->p
.path
= new_definition_path(parent_scope
, field_name
, root_name
);
136 sequence
->p
.scope
= new_definition_scope(parent_scope
, field_name
, root_name
);
137 ret
= register_field_definition(field_name
, &sequence
->p
,
140 len_parent
= lookup_path_definition(sequence
->p
.scope
->scope_path
,
141 sequence_declaration
->length_name
,
144 printf("[error] Lookup for sequence length field failed.\n");
148 container_of(len_parent
, struct definition_integer
, p
);
149 if (sequence
->length
->declaration
->signedness
) {
150 printf("[error] Sequence length field should be unsigned.\n");
153 definition_ref(len_parent
);
155 sequence
->string
= NULL
;
156 sequence
->elems
= NULL
;
158 if (sequence_declaration
->elem
->id
== CTF_TYPE_INTEGER
) {
159 struct declaration_integer
*integer_declaration
=
160 container_of(sequence_declaration
->elem
, struct declaration_integer
, p
);
162 if (integer_declaration
->encoding
== CTF_STRING_UTF8
163 || integer_declaration
->encoding
== CTF_STRING_ASCII
) {
165 sequence
->string
= g_string_new("");
167 if (integer_declaration
->len
== CHAR_BIT
168 && integer_declaration
->p
.alignment
== CHAR_BIT
) {
174 sequence
->elems
= g_ptr_array_new();
178 free_definition_scope(sequence
->p
.scope
);
179 declaration_unref(&sequence_declaration
->p
);
185 void _sequence_definition_free(struct definition
*definition
)
187 struct definition_sequence
*sequence
=
188 container_of(definition
, struct definition_sequence
, p
);
189 struct definition
*len_definition
= &sequence
->length
->p
;
192 if (sequence
->string
)
193 (void) g_string_free(sequence
->string
, TRUE
);
194 if (sequence
->elems
) {
195 for (i
= 0; i
< sequence
->elems
->len
; i
++) {
196 struct definition
*field
;
198 field
= g_ptr_array_index(sequence
->elems
, i
);
199 field
->declaration
->definition_free(field
);
202 (void) g_ptr_array_free(sequence
->elems
, TRUE
);
203 definition_unref(len_definition
);
204 free_definition_scope(sequence
->p
.scope
);
205 declaration_unref(sequence
->p
.declaration
);
209 uint64_t sequence_len(struct definition_sequence
*sequence
)
211 return sequence
->length
->value
._unsigned
;
214 struct definition
*sequence_index(struct definition_sequence
*sequence
, uint64_t i
)
216 if (!sequence
->elems
)
218 if (i
>= sequence
->length
->value
._unsigned
)
220 assert(i
< sequence
->elems
->len
);
221 return g_ptr_array_index(sequence
->elems
, i
);