cleanup
[babeltrace.git] / types / variant.c
CommitLineData
c054553d 1/*
ab4cf058 2 * variant.c
c054553d
MD
3 *
4 * BabelTrace - Variant Type Converter
5 *
6 * Copyright 2011 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
7 *
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:
14 *
15 * The above copyright notice and this permission notice shall be included in
16 * all copies or substantial portions of the Software.
17 */
18
19#include <babeltrace/compiler.h>
20#include <babeltrace/format.h>
6ee5115e 21#include <errno.h>
c054553d
MD
22
23static
f6625916 24struct definition *_variant_definition_new(struct declaration *declaration,
05c749e5
MD
25 struct definition_scope *parent_scope,
26 GQuark field_name, int index);
c054553d 27static
e1151715 28void _variant_definition_free(struct definition *definition);
c054553d 29
d11e9c49 30void variant_rw(struct stream_pos *ppos, struct definition *definition)
c054553d 31{
d11e9c49 32 struct definition_variant *variant_definition =
e1151715 33 container_of(definition, struct definition_variant, p);
c054553d 34 struct field *field;
c054553d 35
d11e9c49
MD
36 field = variant_get_current_field(variant_definition);
37 generic_rw(ppos, field->definition);
c054553d
MD
38}
39
40static
d60cb676 41void _untagged_variant_declaration_free(struct declaration *declaration)
c054553d 42{
d60cb676
MD
43 struct declaration_untagged_variant *untagged_variant_declaration =
44 container_of(declaration, struct declaration_untagged_variant, p);
c054553d
MD
45 unsigned long i;
46
d60cb676
MD
47 free_declaration_scope(untagged_variant_declaration->scope);
48 g_hash_table_destroy(untagged_variant_declaration->fields_by_tag);
c054553d 49
d60cb676 50 for (i = 0; i < untagged_variant_declaration->fields->len; i++) {
f6625916 51 struct declaration_field *declaration_field =
d60cb676 52 &g_array_index(untagged_variant_declaration->fields,
f6625916
MD
53 struct declaration_field, i);
54 declaration_unref(declaration_field->declaration);
c054553d 55 }
d60cb676
MD
56 g_array_free(untagged_variant_declaration->fields, true);
57 g_free(untagged_variant_declaration);
c054553d
MD
58}
59
ab4cf058 60struct declaration_untagged_variant *untagged_variant_declaration_new(
f6625916 61 struct declaration_scope *parent_scope)
c054553d 62{
d60cb676 63 struct declaration_untagged_variant *untagged_variant_declaration;
f6625916 64 struct declaration *declaration;
c054553d 65
d60cb676
MD
66 untagged_variant_declaration = g_new(struct declaration_untagged_variant, 1);
67 declaration = &untagged_variant_declaration->p;
68 untagged_variant_declaration->fields_by_tag = g_hash_table_new(g_direct_hash,
e19c3d69 69 g_direct_equal);
d60cb676 70 untagged_variant_declaration->fields = g_array_sized_new(FALSE, TRUE,
f6625916 71 sizeof(struct declaration_field),
e19c3d69 72 DEFAULT_NR_STRUCT_FIELDS);
d60cb676
MD
73 untagged_variant_declaration->scope = new_declaration_scope(parent_scope);
74 declaration->id = CTF_TYPE_UNTAGGED_VARIANT;
f6625916 75 declaration->alignment = 1;
d60cb676
MD
76 declaration->declaration_free = _untagged_variant_declaration_free;
77 declaration->definition_new = NULL;
78 declaration->definition_free = NULL;
79 declaration->ref = 1;
80 return untagged_variant_declaration;
81}
82
83static
84void _variant_declaration_free(struct declaration *declaration)
85{
86 struct declaration_variant *variant_declaration =
87 container_of(declaration, struct declaration_variant, p);
88
89 _untagged_variant_declaration_free(&variant_declaration->untagged_variant->p);
90 g_array_free(variant_declaration->tag_name, TRUE);
91}
92
93struct declaration_variant *
94 variant_declaration_new(struct declaration_untagged_variant *untagged_variant, const char *tag)
95{
96 struct declaration_variant *variant_declaration;
97 struct declaration *declaration;
98
99 variant_declaration = g_new(struct declaration_variant, 1);
100 declaration = &variant_declaration->p;
101 variant_declaration->untagged_variant = untagged_variant;
102 variant_declaration->tag_name = g_array_new(FALSE, TRUE, sizeof(GQuark));
103 append_scope_path(tag, variant_declaration->tag_name);
104 declaration->id = CTF_TYPE_VARIANT;
105 declaration->alignment = 1;
f6625916
MD
106 declaration->declaration_free = _variant_declaration_free;
107 declaration->definition_new = _variant_definition_new;
108 declaration->definition_free = _variant_definition_free;
109 declaration->ref = 1;
110 return variant_declaration;
c054553d
MD
111}
112
d60cb676
MD
113/*
114 * tag_instance is assumed to be an enumeration.
115 * Returns 0 if OK, < 0 if error.
116 */
117static
118int check_enum_tag(struct definition_variant *variant,
119 struct definition *enum_tag)
120{
121 struct definition_enum *_enum =
122 container_of(enum_tag, struct definition_enum, p);
123 struct declaration_enum *enum_declaration = _enum->declaration;
124 int missing_field = 0;
125 unsigned long i;
126
127 /*
128 * Strictly speaking, each enumerator must map to a field of the
129 * variant. However, we are even stricter here by requiring that each
130 * variant choice map to an enumerator too. We then validate that the
131 * number of enumerators equals the number of variant choices.
132 */
133 if (variant->declaration->untagged_variant->fields->len != enum_get_nr_enumerators(enum_declaration))
134 return -EPERM;
135
136 for (i = 0; i < variant->declaration->untagged_variant->fields->len; i++) {
137 struct declaration_field *field_declaration =
138 &g_array_index(variant->declaration->untagged_variant->fields,
139 struct declaration_field, i);
140 if (!enum_quark_to_range_set(enum_declaration, field_declaration->name)) {
141 missing_field = 1;
142 break;
143 }
144 }
145 if (missing_field)
146 return -EPERM;
147
148 /*
149 * Check the enumeration: it must map each value to one and only one
150 * enumerator tag.
151 * TODO: we should also check that each range map to one and only one
152 * tag. For the moment, we will simply check this dynamically in
153 * variant_declaration_get_current_field().
154 */
155 return 0;
156}
157
158
159
c054553d 160static
e1151715 161struct definition *
f6625916 162 _variant_definition_new(struct declaration *declaration,
05c749e5
MD
163 struct definition_scope *parent_scope,
164 GQuark field_name, int index)
c054553d 165{
f6625916
MD
166 struct declaration_variant *variant_declaration =
167 container_of(declaration, struct declaration_variant, p);
e1151715 168 struct definition_variant *variant;
ac88af75 169 unsigned long i;
c054553d 170
e1151715 171 variant = g_new(struct definition_variant, 1);
f6625916
MD
172 declaration_ref(&variant_declaration->p);
173 variant->p.declaration = declaration;
174 variant->declaration = variant_declaration;
c054553d 175 variant->p.ref = 1;
05c749e5
MD
176 variant->p.index = index;
177 variant->scope = new_definition_scope(parent_scope, field_name);
d60cb676
MD
178 variant->enum_tag = lookup_definition(variant->scope->scope_path,
179 variant_declaration->tag_name,
180 parent_scope);
181
182 if (!variant->enum_tag
183 || check_enum_tag(variant, variant->enum_tag) < 0)
184 goto error;
185 definition_ref(variant->enum_tag);
c054553d
MD
186 variant->fields = g_array_sized_new(FALSE, TRUE,
187 sizeof(struct field),
d60cb676
MD
188 variant_declaration->untagged_variant->fields->len);
189 g_array_set_size(variant->fields, variant_declaration->untagged_variant->fields->len);
190 for (i = 0; i < variant_declaration->untagged_variant->fields->len; i++) {
f6625916 191 struct declaration_field *declaration_field =
d60cb676 192 &g_array_index(variant_declaration->untagged_variant->fields,
f6625916 193 struct declaration_field, i);
ac88af75
MD
194 struct field *field = &g_array_index(variant->fields,
195 struct field, i);
196
f6625916 197 field->name = declaration_field->name;
05c749e5
MD
198 /*
199 * All child definition are at index 0, because they are
200 * various choices of the same field.
201 */
e1151715 202 field->definition =
f6625916 203 declaration_field->declaration->definition_new(declaration_field->declaration,
05c749e5
MD
204 variant->scope,
205 field->name, 0);
ac88af75 206 }
c054553d
MD
207 variant->current_field = NULL;
208 return &variant->p;
d60cb676
MD
209error:
210 free_definition_scope(variant->scope);
211 declaration_unref(&variant_declaration->p);
212 g_free(variant);
213 return NULL;
c054553d
MD
214}
215
216static
e1151715 217void _variant_definition_free(struct definition *definition)
c054553d 218{
e1151715
MD
219 struct definition_variant *variant =
220 container_of(definition, struct definition_variant, p);
c054553d
MD
221 unsigned long i;
222
d60cb676 223 assert(variant->fields->len == variant->declaration->untagged_variant->fields->len);
c054553d
MD
224 for (i = 0; i < variant->fields->len; i++) {
225 struct field *field = &g_array_index(variant->fields,
226 struct field, i);
e1151715 227 definition_unref(field->definition);
c054553d 228 }
d60cb676 229 definition_unref(variant->enum_tag);
e1151715 230 free_definition_scope(variant->scope);
f6625916 231 declaration_unref(variant->p.declaration);
c054553d
MD
232 g_free(variant);
233}
234
d60cb676
MD
235void untagged_variant_declaration_add_field(struct declaration_untagged_variant *untagged_variant_declaration,
236 const char *field_name,
237 struct declaration *field_declaration)
c054553d 238{
f6625916 239 struct declaration_field *field;
c054553d
MD
240 unsigned long index;
241
d60cb676
MD
242 g_array_set_size(untagged_variant_declaration->fields, untagged_variant_declaration->fields->len + 1);
243 index = untagged_variant_declaration->fields->len - 1; /* last field (new) */
244 field = &g_array_index(untagged_variant_declaration->fields, struct declaration_field, index);
245 field->name = g_quark_from_string(field_name);
246 declaration_ref(field_declaration);
247 field->declaration = field_declaration;
c054553d 248 /* Keep index in hash rather than pointer, because array can relocate */
d60cb676 249 g_hash_table_insert(untagged_variant_declaration->fields_by_tag,
c054553d
MD
250 (gpointer) (unsigned long) field->name,
251 (gpointer) index);
252 /*
253 * Alignment of variant is based on the alignment of its currently
254 * selected choice, so we leave variant alignment as-is (statically
255 * speaking).
256 */
257}
258
f6625916 259struct declaration_field *
d60cb676 260untagged_variant_declaration_get_field_from_tag(struct declaration_untagged_variant *untagged_variant_declaration, GQuark tag)
c054553d
MD
261{
262 unsigned long index;
263
d60cb676 264 index = (unsigned long) g_hash_table_lookup(untagged_variant_declaration->fields_by_tag,
c054553d 265 (gconstpointer) (unsigned long) tag);
d60cb676 266 return &g_array_index(untagged_variant_declaration->fields, struct declaration_field, index);
c054553d
MD
267}
268
269/*
270 * field returned only valid as long as the field structure is not appended to.
271 */
e1151715 272struct field *variant_get_current_field(struct definition_variant *variant)
c054553d 273{
e1151715
MD
274 struct definition_enum *_enum =
275 container_of(variant->enum_tag, struct definition_enum, p);
f6625916 276 struct declaration_variant *variant_declaration = variant->declaration;
c054553d
MD
277 unsigned long index;
278 GArray *tag_array;
279 GQuark tag;
280
281 tag_array = _enum->value;
282 /*
283 * The 1 to 1 mapping from enumeration to value should have been already
284 * checked. (see TODO above)
285 */
286 assert(tag_array->len == 1);
287 tag = g_array_index(tag_array, GQuark, 0);
d60cb676 288 index = (unsigned long) g_hash_table_lookup(variant_declaration->untagged_variant->fields_by_tag,
c054553d 289 (gconstpointer) (unsigned long) tag);
e19c3d69 290 variant->current_field = &g_array_index(variant->fields, struct field, index);
96354dac 291 return variant->current_field;
c054553d 292}
This page took 0.035722 seconds and 4 git commands to generate.