Commit | Line | Data |
---|---|---|
2e7d72cf | 1 | /* |
ccd7e1c8 | 2 | * sequence.c |
2e7d72cf | 3 | * |
ccd7e1c8 | 4 | * BabelTrace - Sequence Type Converter |
2e7d72cf | 5 | * |
64fa3fec MD |
6 | * Copyright 2010-2011 EfficiOS Inc. and Linux Foundation |
7 | * | |
8 | * Author: Mathieu Desnoyers <mathieu.desnoyers@efficios.com> | |
2e7d72cf | 9 | * |
ccd7e1c8 MD |
10 | * Permission is hereby granted, free of charge, to any person obtaining a copy |
11 | * of this software and associated documentation files (the "Software"), to deal | |
12 | * in the Software without restriction, including without limitation the rights | |
13 | * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell | |
14 | * copies of the Software, and to permit persons to whom the Software is | |
15 | * furnished to do so, subject to the following conditions: | |
2e7d72cf | 16 | * |
ccd7e1c8 MD |
17 | * The above copyright notice and this permission notice shall be included in |
18 | * all copies or substantial portions of the Software. | |
2e7d72cf MD |
19 | */ |
20 | ||
21 | #include <babeltrace/compiler.h> | |
4c8bfb7e | 22 | #include <babeltrace/format.h> |
0f980a35 | 23 | #include <inttypes.h> |
2e7d72cf | 24 | |
c054553d | 25 | static |
f6625916 | 26 | struct definition *_sequence_definition_new(struct declaration *declaration, |
05c749e5 | 27 | struct definition_scope *parent_scope, |
98df1c9f MD |
28 | GQuark field_name, int index, |
29 | const char *root_name); | |
c054553d | 30 | static |
e1151715 | 31 | void _sequence_definition_free(struct definition *definition); |
c054553d | 32 | |
c5e74408 | 33 | int sequence_rw(struct stream_pos *pos, struct definition *definition) |
2e7d72cf | 34 | { |
d11e9c49 | 35 | struct definition_sequence *sequence_definition = |
e1151715 | 36 | container_of(definition, struct definition_sequence, p); |
d11e9c49 MD |
37 | const struct declaration_sequence *sequence_declaration = |
38 | sequence_definition->declaration; | |
0f980a35 | 39 | uint64_t len, oldlen, i; |
c5e74408 | 40 | int ret; |
2e7d72cf | 41 | |
98df1c9f | 42 | len = sequence_definition->length->value._unsigned; |
0f980a35 MD |
43 | /* |
44 | * Yes, large sequences could be _painfully slow_ to parse due | |
45 | * to memory allocation for each event read. At least, never | |
46 | * shrink the sequence. Note: the sequence GArray len should | |
47 | * never be used as indicator of the current sequence length. | |
48 | * One should always look at the sequence->len->value._unsigned | |
49 | * value for that. | |
50 | */ | |
d11e9c49 | 51 | oldlen = sequence_definition->elems->len; |
0f980a35 | 52 | if (oldlen < len) |
b1a2f580 | 53 | g_ptr_array_set_size(sequence_definition->elems, len); |
0f980a35 MD |
54 | |
55 | for (i = oldlen; i < len; i++) { | |
b1a2f580 | 56 | struct definition **field; |
0f980a35 MD |
57 | GString *str; |
58 | GQuark name; | |
59 | ||
60 | str = g_string_new(""); | |
61 | g_string_printf(str, "[%" PRIu64 "]", i); | |
0f980a35 | 62 | name = g_quark_from_string(str->str); |
518de31c | 63 | (void) g_string_free(str, TRUE); |
2e7d72cf | 64 | |
b1a2f580 MD |
65 | field = (struct definition **) &g_ptr_array_index(sequence_definition->elems, i); |
66 | *field = sequence_declaration->elem->definition_new(sequence_declaration->elem, | |
a35173fe | 67 | sequence_definition->p.scope, |
98df1c9f | 68 | name, i, NULL); |
1e36e6c2 MD |
69 | } |
70 | for (i = 0; i < len; i++) { | |
71 | struct definition **field; | |
72 | ||
73 | field = (struct definition **) &g_ptr_array_index(sequence_definition->elems, i); | |
b1a2f580 | 74 | ret = generic_rw(pos, *field); |
c5e74408 MD |
75 | if (ret) |
76 | return ret; | |
2e7d72cf | 77 | } |
c5e74408 | 78 | return 0; |
2e7d72cf MD |
79 | } |
80 | ||
c054553d | 81 | static |
f6625916 | 82 | void _sequence_declaration_free(struct declaration *declaration) |
2e7d72cf | 83 | { |
f6625916 MD |
84 | struct declaration_sequence *sequence_declaration = |
85 | container_of(declaration, struct declaration_sequence, p); | |
c054553d | 86 | |
f6625916 | 87 | free_declaration_scope(sequence_declaration->scope); |
98df1c9f | 88 | g_array_free(sequence_declaration->length_name, TRUE); |
f6625916 MD |
89 | declaration_unref(sequence_declaration->elem); |
90 | g_free(sequence_declaration); | |
2e7d72cf MD |
91 | } |
92 | ||
f6625916 | 93 | struct declaration_sequence * |
98df1c9f | 94 | sequence_declaration_new(const char *length, |
f6625916 MD |
95 | struct declaration *elem_declaration, |
96 | struct declaration_scope *parent_scope) | |
2e7d72cf | 97 | { |
f6625916 MD |
98 | struct declaration_sequence *sequence_declaration; |
99 | struct declaration *declaration; | |
2e7d72cf | 100 | |
f6625916 MD |
101 | sequence_declaration = g_new(struct declaration_sequence, 1); |
102 | declaration = &sequence_declaration->p; | |
98df1c9f MD |
103 | |
104 | sequence_declaration->length_name = g_array_new(FALSE, TRUE, sizeof(GQuark)); | |
105 | append_scope_path(length, sequence_declaration->length_name); | |
106 | ||
f6625916 MD |
107 | declaration_ref(elem_declaration); |
108 | sequence_declaration->elem = elem_declaration; | |
109 | sequence_declaration->scope = new_declaration_scope(parent_scope); | |
110 | declaration->id = CTF_TYPE_SEQUENCE; | |
98df1c9f | 111 | declaration->alignment = elem_declaration->alignment; |
f6625916 MD |
112 | declaration->declaration_free = _sequence_declaration_free; |
113 | declaration->definition_new = _sequence_definition_new; | |
114 | declaration->definition_free = _sequence_definition_free; | |
115 | declaration->ref = 1; | |
116 | return sequence_declaration; | |
2e7d72cf | 117 | } |
c054553d MD |
118 | |
119 | static | |
f6625916 | 120 | struct definition *_sequence_definition_new(struct declaration *declaration, |
05c749e5 | 121 | struct definition_scope *parent_scope, |
98df1c9f MD |
122 | GQuark field_name, int index, |
123 | const char *root_name) | |
c054553d | 124 | { |
f6625916 MD |
125 | struct declaration_sequence *sequence_declaration = |
126 | container_of(declaration, struct declaration_sequence, p); | |
e1151715 MD |
127 | struct definition_sequence *sequence; |
128 | struct definition *len_parent; | |
98df1c9f | 129 | int ret; |
c054553d | 130 | |
e1151715 | 131 | sequence = g_new(struct definition_sequence, 1); |
f6625916 MD |
132 | declaration_ref(&sequence_declaration->p); |
133 | sequence->p.declaration = declaration; | |
134 | sequence->declaration = sequence_declaration; | |
c054553d | 135 | sequence->p.ref = 1; |
98df1c9f MD |
136 | /* |
137 | * Use INT_MAX order to ensure that all fields of the parent | |
138 | * scope are seen as being prior to this scope. | |
139 | */ | |
140 | sequence->p.index = root_name ? INT_MAX : index; | |
b1a2f580 | 141 | sequence->p.name = field_name; |
98df1c9f | 142 | sequence->p.path = new_definition_path(parent_scope, field_name, root_name); |
a35173fe | 143 | sequence->p.scope = new_definition_scope(parent_scope, field_name, root_name); |
98df1c9f MD |
144 | ret = register_field_definition(field_name, &sequence->p, |
145 | parent_scope); | |
146 | assert(!ret); | |
a35173fe MD |
147 | len_parent = lookup_path_definition(sequence->p.scope->scope_path, |
148 | sequence_declaration->length_name, | |
149 | parent_scope); | |
98df1c9f MD |
150 | if (!len_parent) { |
151 | printf("[error] Lookup for sequence length field failed.\n"); | |
152 | goto error; | |
153 | } | |
154 | sequence->length = | |
e1151715 | 155 | container_of(len_parent, struct definition_integer, p); |
98df1c9f MD |
156 | if (sequence->length->declaration->signedness) { |
157 | printf("[error] Sequence length field should be unsigned.\n"); | |
158 | goto error; | |
159 | } | |
160 | definition_ref(len_parent); | |
81dee1bb MD |
161 | |
162 | sequence->string = NULL; | |
163 | sequence->elems = NULL; | |
164 | ||
165 | if (sequence_declaration->elem->id == CTF_TYPE_INTEGER) { | |
166 | struct declaration_integer *integer_declaration = | |
167 | container_of(sequence_declaration->elem, struct declaration_integer, p); | |
168 | ||
169 | if (integer_declaration->encoding == CTF_STRING_UTF8 | |
170 | || integer_declaration->encoding == CTF_STRING_ASCII) { | |
171 | ||
172 | sequence->string = g_string_new(""); | |
173 | ||
174 | if (integer_declaration->len == CHAR_BIT | |
175 | && integer_declaration->p.alignment == CHAR_BIT) { | |
176 | return &sequence->p; | |
177 | } | |
178 | } | |
179 | } | |
180 | ||
b1a2f580 | 181 | sequence->elems = g_ptr_array_new(); |
c054553d | 182 | return &sequence->p; |
98df1c9f MD |
183 | |
184 | error: | |
a35173fe | 185 | free_definition_scope(sequence->p.scope); |
98df1c9f MD |
186 | declaration_unref(&sequence_declaration->p); |
187 | g_free(sequence); | |
188 | return NULL; | |
c054553d MD |
189 | } |
190 | ||
191 | static | |
e1151715 | 192 | void _sequence_definition_free(struct definition *definition) |
c054553d | 193 | { |
e1151715 MD |
194 | struct definition_sequence *sequence = |
195 | container_of(definition, struct definition_sequence, p); | |
98df1c9f | 196 | struct definition *len_definition = &sequence->length->p; |
0f980a35 MD |
197 | uint64_t i; |
198 | ||
81dee1bb MD |
199 | if (sequence->string) |
200 | (void) g_string_free(sequence->string, TRUE); | |
201 | if (sequence->elems) { | |
202 | for (i = 0; i < sequence->elems->len; i++) { | |
203 | struct definition *field; | |
c054553d | 204 | |
81dee1bb MD |
205 | field = g_ptr_array_index(sequence->elems, i); |
206 | field->declaration->definition_free(field); | |
207 | } | |
0f980a35 | 208 | } |
b1a2f580 | 209 | (void) g_ptr_array_free(sequence->elems, TRUE); |
98df1c9f | 210 | definition_unref(len_definition); |
a35173fe | 211 | free_definition_scope(sequence->p.scope); |
f6625916 | 212 | declaration_unref(sequence->p.declaration); |
c054553d MD |
213 | g_free(sequence); |
214 | } | |
0f980a35 | 215 | |
3838df27 MD |
216 | uint64_t sequence_len(struct definition_sequence *sequence) |
217 | { | |
98df1c9f | 218 | return sequence->length->value._unsigned; |
3838df27 MD |
219 | } |
220 | ||
0f980a35 MD |
221 | struct definition *sequence_index(struct definition_sequence *sequence, uint64_t i) |
222 | { | |
81dee1bb MD |
223 | if (!sequence->elems) |
224 | return NULL; | |
98df1c9f | 225 | if (i >= sequence->length->value._unsigned) |
0f980a35 MD |
226 | return NULL; |
227 | assert(i < sequence->elems->len); | |
b1a2f580 | 228 | return g_ptr_array_index(sequence->elems, i); |
0f980a35 | 229 | } |