*
* BabelTrace - Enumeration Type
*
- * Copyright 2010 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
+ * Copyright 2010-2011 EfficiOS Inc. and Linux Foundation
+ *
+ * Author: Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ * SOFTWARE.
*/
#include <babeltrace/compiler.h>
#include <babeltrace/format.h>
+#include <babeltrace/types.h>
#include <stdint.h>
#include <glib.h>
+#if (__LONG_MAX__ == 2147483647L)
+#define WORD_SIZE 32
+#elif (__LONG_MAX__ == 9223372036854775807L)
+#define WORD_SIZE 64
+#else
+#error "Unknown long size."
+#endif
+
+static
+struct bt_definition *_enum_definition_new(struct bt_declaration *declaration,
+ struct definition_scope *parent_scope,
+ GQuark field_name, int index,
+ const char *root_name);
+static
+void _enum_definition_free(struct bt_definition *definition);
+
static
void enum_range_set_free(void *ptr)
{
g_array_unref(ptr);
}
+#if (WORD_SIZE == 32)
+static inline
+gpointer get_uint_v(uint64_t *v)
+{
+ return v;
+}
+
+static inline
+gpointer get_int_v(int64_t *v)
+{
+ return v;
+}
+
+static
+guint enum_val_hash(gconstpointer key)
+{
+ int64_t ukey = *(const int64_t *)key;
+
+ return (guint)ukey ^ (guint)(ukey >> 32);
+}
+
+static
+gboolean enum_val_equal(gconstpointer a, gconstpointer b)
+{
+ int64_t ua = *(const int64_t *)a;
+ int64_t ub = *(const int64_t *)b;
+
+ return ua == ub;
+}
+
+static
+void enum_val_free(void *ptr)
+{
+ g_free(ptr);
+}
+#else /* WORD_SIZE != 32 */
+static inline
+gpointer get_uint_v(uint64_t *v)
+{
+ return (gpointer) *v;
+}
+
+static inline
+gpointer get_int_v(int64_t *v)
+{
+ return (gpointer) *v;
+}
+
+static
+guint enum_val_hash(gconstpointer key)
+{
+ return g_direct_hash(key);
+}
+
+static
+gboolean enum_val_equal(gconstpointer a, gconstpointer b)
+{
+ return g_direct_equal(a, b);
+}
+
+static
+void enum_val_free(void *ptr)
+{
+}
+#endif /* WORD_SIZE != 32 */
+
/*
* Returns a GArray or NULL.
* Caller must release the GArray with g_array_unref().
*/
-GArray *enum_uint_to_quark_set(const struct type_class_enum *enum_class,
+GArray *bt_enum_uint_to_quark_set(const struct declaration_enum *enum_declaration,
uint64_t v)
{
struct enum_range_to_quark *iter;
GArray *qs, *ranges = NULL;
/* Single values lookup */
- qs = g_hash_table_lookup(enum_class->table.value_to_quark_set, &v);
+ qs = g_hash_table_lookup(enum_declaration->table.value_to_quark_set,
+ get_uint_v(&v));
/* Range lookup */
- cds_list_for_each_entry(iter, &enum_class->table.range_to_quark, node) {
+ bt_list_for_each_entry(iter, &enum_declaration->table.range_to_quark, node) {
if (iter->range.start._unsigned > v || iter->range.end._unsigned < v)
continue;
if (!ranges) {
if (qs)
qs_len = qs->len;
ranges = g_array_sized_new(FALSE, TRUE,
- sizeof(struct enum_range),
+ sizeof(GQuark),
qs_len + 1);
g_array_set_size(ranges, qs_len + 1);
if (qs)
memcpy(ranges->data, qs->data,
- sizeof(struct enum_range) * qs_len);
- g_array_index(ranges, struct enum_range, qs_len) = iter->range;
+ sizeof(GQuark) * qs_len);
+ g_array_index(ranges, GQuark, qs_len) = iter->quark;
} else {
- g_array_set_size(ranges, ranges->len + 1);
- g_array_index(ranges, struct enum_range, ranges->len) = iter->range;
+ size_t qs_len = ranges->len;
+
+ g_array_set_size(ranges, qs_len + 1);
+ g_array_index(ranges, GQuark, qs_len) = iter->quark;
}
}
if (!ranges) {
+ if (!qs)
+ return NULL;
ranges = qs;
g_array_ref(ranges);
}
* Returns a GArray or NULL.
* Caller must release the GArray with g_array_unref().
*/
-GArray *enum_int_to_quark_set(const struct type_class_enum *enum_class, uint64_t v)
+GArray *bt_enum_int_to_quark_set(const struct declaration_enum *enum_declaration,
+ int64_t v)
{
struct enum_range_to_quark *iter;
GArray *qs, *ranges = NULL;
/* Single values lookup */
- qs = g_hash_table_lookup(enum_class->table.value_to_quark_set, &v);
+ qs = g_hash_table_lookup(enum_declaration->table.value_to_quark_set,
+ get_int_v(&v));
/* Range lookup */
- cds_list_for_each_entry(iter, &enum_class->table.range_to_quark, node) {
+ bt_list_for_each_entry(iter, &enum_declaration->table.range_to_quark, node) {
if (iter->range.start._signed > v || iter->range.end._signed < v)
continue;
if (!ranges) {
if (qs)
qs_len = qs->len;
ranges = g_array_sized_new(FALSE, TRUE,
- sizeof(struct enum_range),
+ sizeof(GQuark),
qs_len + 1);
g_array_set_size(ranges, qs_len + 1);
if (qs)
memcpy(ranges->data, qs->data,
- sizeof(struct enum_range) * qs_len);
- g_array_index(ranges, struct enum_range, qs_len) = iter->range;
+ sizeof(GQuark) * qs_len);
+ g_array_index(ranges, GQuark, qs_len) = iter->quark;
} else {
- g_array_set_size(ranges, ranges->len + 1);
- g_array_index(ranges, struct enum_range, ranges->len) = iter->range;
+ size_t qs_len = ranges->len;
+
+ g_array_set_size(ranges, qs_len + 1);
+ g_array_index(ranges, GQuark, qs_len) = iter->quark;
}
}
if (!ranges) {
+ if (!qs)
+ return NULL;
ranges = qs;
g_array_ref(ranges);
}
return ranges;
}
-#if (__WORDSIZE == 32)
-static
-guint enum_val_hash(gconstpointer key)
-{
- int64_t ukey = *(const int64_t *)key;
-
- return (guint)ukey ^ (guint)(ukey >> 32);
-}
-
-static
-gboolean enum_val_equal(gconstpointer a, gconstpointer b)
-{
- int64_t ua = *(const int64_t *)a;
- int64_t ub = *(const int64_t *)b;
-
- return ua == ub;
-}
-
-static
-void enum_val_free(void *ptr)
-{
- g_free(ptr);
-}
-
static
-void enum_signed_insert_value_to_quark_set(struct type_class_enum *enum_class,
- int64_t v, GQuark q)
-{
- int64_t *valuep;
- GArray *array;
-
- array = g_hash_table_lookup(enum_class->table.value_to_quark_set, &v);
- if (!array) {
- array = g_array_sized_new(FALSE, TRUE, sizeof(GQuark), 1);
- g_array_set_size(array, 1);
- g_array_index(array, GQuark, array->len - 1) = q;
- valuep = g_new(int64_t, 1);
- *valuep = v;
- g_hash_table_insert(enum_class->table.value_to_quark_set, valuep, array);
- } else {
- g_array_set_size(array, array->len + 1);
- g_array_index(array, GQuark, array->len - 1) = q;
- }
-}
-
-static
-void enum_unsigned_insert_value_to_quark_set(struct type_class_enum *enum_class,
+void bt_enum_unsigned_insert_value_to_quark_set(struct declaration_enum *enum_declaration,
uint64_t v, GQuark q)
{
uint64_t *valuep;
GArray *array;
- array = g_hash_table_lookup(enum_class->table.value_to_quark_set, &v);
+ array = g_hash_table_lookup(enum_declaration->table.value_to_quark_set,
+ get_uint_v(&v));
if (!array) {
array = g_array_sized_new(FALSE, TRUE, sizeof(GQuark), 1);
g_array_set_size(array, 1);
g_array_index(array, GQuark, array->len - 1) = q;
+#if (WORD_SIZE == 32)
valuep = g_new(uint64_t, 1);
*valuep = v;
- g_hash_table_insert(enum_class->table.value_to_quark_set, valuep, array);
+#else /* WORD_SIZE != 32 */
+ valuep = get_uint_v(&v);
+#endif /* WORD_SIZE != 32 */
+ g_hash_table_insert(enum_declaration->table.value_to_quark_set, valuep, array);
} else {
g_array_set_size(array, array->len + 1);
g_array_index(array, GQuark, array->len - 1) = q;
}
}
-#else /* __WORDSIZE != 32 */
-static
-guint enum_val_hash(gconstpointer key)
-{
- return g_direct_hash(key);
-}
-
-static
-gboolean enum_val_equal(gconstpointer a, gconstpointer b)
-{
- return g_direct_equal(a, b);
-}
-
-static
-void enum_val_free(void *ptr)
-{
-}
static
-void enum_signed_insert_value_to_quark_set(struct type_class_enum *enum_class,
+void bt_enum_signed_insert_value_to_quark_set(struct declaration_enum *enum_declaration,
int64_t v, GQuark q)
{
+ int64_t *valuep;
GArray *array;
- array = g_hash_table_lookup(enum_class->table.value_to_quark_set,
- (gconstpointer) v);
- if (!array) {
- array = g_array_sized_new(FALSE, TRUE, sizeof(GQuark), 1);
- g_array_set_size(array, 1);
- g_array_index(array, GQuark, array->len - 1) = q;
- g_hash_table_insert(enum_class->table.value_to_quark_set,
- (gpointer) v, array);
- } else {
- g_array_set_size(array, array->len + 1);
- g_array_index(array, GQuark, array->len - 1) = q;
- }
-}
-
-static
-void enum_unsigned_insert_value_to_quark_set(struct type_class_enum *enum_class,
- uint64_t v, GQuark q)
-{
- GArray *array;
-
- array = g_hash_table_lookup(enum_class->table.value_to_quark_set,
- (gconstpointer) v);
+ array = g_hash_table_lookup(enum_declaration->table.value_to_quark_set,
+ get_int_v(&v));
if (!array) {
array = g_array_sized_new(FALSE, TRUE, sizeof(GQuark), 1);
g_array_set_size(array, 1);
g_array_index(array, GQuark, array->len - 1) = q;
- g_hash_table_insert(enum_class->table.value_to_quark_set,
- (gpointer) v, array);
+#if (WORD_SIZE == 32)
+ valuep = g_new(int64_t, 1);
+ *valuep = v;
+#else /* WORD_SIZE != 32 */
+ valuep = get_int_v(&v);
+#endif /* WORD_SIZE != 32 */
+ g_hash_table_insert(enum_declaration->table.value_to_quark_set, valuep, array);
} else {
g_array_set_size(array, array->len + 1);
g_array_index(array, GQuark, array->len - 1) = q;
}
}
-#endif /* __WORDSIZE != 32 */
-GArray *enum_quark_to_range_set(const struct type_class_enum *enum_class,
+GArray *bt_enum_quark_to_range_set(const struct declaration_enum *enum_declaration,
GQuark q)
{
- return g_hash_table_lookup(enum_class->table.quark_to_range_set,
+ return g_hash_table_lookup(enum_declaration->table.quark_to_range_set,
(gconstpointer) (unsigned long) q);
}
static
-void enum_signed_insert_range_to_quark(struct type_class_enum *enum_class,
+void bt_enum_signed_insert_range_to_quark(struct declaration_enum *enum_declaration,
int64_t start, int64_t end, GQuark q)
{
struct enum_range_to_quark *rtoq;
rtoq = g_new(struct enum_range_to_quark, 1);
- cds_list_add(&rtoq->node, &enum_class->table.range_to_quark);
+ bt_list_add(&rtoq->node, &enum_declaration->table.range_to_quark);
rtoq->range.start._signed = start;
rtoq->range.end._signed = end;
rtoq->quark = q;
}
static
-void enum_unsigned_insert_range_to_quark(struct type_class_enum *enum_class,
+void bt_enum_unsigned_insert_range_to_quark(struct declaration_enum *enum_declaration,
uint64_t start, uint64_t end, GQuark q)
{
struct enum_range_to_quark *rtoq;
rtoq = g_new(struct enum_range_to_quark, 1);
- cds_list_add(&rtoq->node, &enum_class->table.range_to_quark);
+ bt_list_add(&rtoq->node, &enum_declaration->table.range_to_quark);
rtoq->range.start._unsigned = start;
rtoq->range.end._unsigned = end;
rtoq->quark = q;
}
-void enum_signed_insert(struct type_class_enum *enum_class,
+void bt_enum_signed_insert(struct declaration_enum *enum_declaration,
int64_t start, int64_t end, GQuark q)
{
GArray *array;
struct enum_range *range;
if (start == end) {
- enum_signed_insert_value_to_quark_set(enum_class, start, q);
+ bt_enum_signed_insert_value_to_quark_set(enum_declaration, start, q);
} else {
if (start > end) {
uint64_t tmp;
start = end;
end = tmp;
}
- enum_signed_insert_range_to_quark(enum_class, start, end, q);
+ bt_enum_signed_insert_range_to_quark(enum_declaration, start, end, q);
}
- array = g_hash_table_lookup(enum_class->table.quark_to_range_set,
+ array = g_hash_table_lookup(enum_declaration->table.quark_to_range_set,
(gconstpointer) (unsigned long) q);
if (!array) {
array = g_array_sized_new(FALSE, TRUE,
sizeof(struct enum_range), 1);
- g_hash_table_insert(enum_class->table.quark_to_range_set,
+ g_hash_table_insert(enum_declaration->table.quark_to_range_set,
(gpointer) (unsigned long) q,
array);
}
range->end._signed = end;
}
-void enum_unsigned_insert(struct type_class_enum *enum_class,
+void bt_enum_unsigned_insert(struct declaration_enum *enum_declaration,
uint64_t start, uint64_t end, GQuark q)
{
GArray *array;
if (start == end) {
- enum_unsigned_insert_value_to_quark_set(enum_class, start, q);
+ bt_enum_unsigned_insert_value_to_quark_set(enum_declaration, start, q);
} else {
if (start > end) {
uint64_t tmp;
start = end;
end = tmp;
}
- enum_unsigned_insert_range_to_quark(enum_class, start, end, q);
+ bt_enum_unsigned_insert_range_to_quark(enum_declaration, start, end, q);
}
- array = g_hash_table_lookup(enum_class->table.quark_to_range_set,
+ array = g_hash_table_lookup(enum_declaration->table.quark_to_range_set,
(gconstpointer) (unsigned long) q);
if (!array) {
array = g_array_sized_new(FALSE, TRUE,
sizeof(struct enum_range), 1);
- g_hash_table_insert(enum_class->table.quark_to_range_set,
+ g_hash_table_insert(enum_declaration->table.quark_to_range_set,
(gpointer) (unsigned long) q,
array);
}
range->end._unsigned = end;
}
-void enum_copy(struct stream_pos *dest, const struct format *fdest,
- struct stream_pos *src, const struct format *fsrc,
- const struct type_class *type_class)
+size_t bt_enum_get_nr_enumerators(struct declaration_enum *enum_declaration)
{
- struct type_class_enum *enum_class =
- container_of(type_class, struct type_class_enum, p.p);
- GArray *array;
- GQuark v;
-
- array = fsrc->enum_read(src, enum_class);
- assert(array);
- /*
- * Arbitrarily choose the first one.
- * TODO: use direct underlying type read/write intead. Not doing it for
- * now to test enum read and write code.
- */
- v = g_array_index(array, GQuark, 0);
- return fdest->enum_write(dest, enum_class, v);
+ return g_hash_table_size(enum_declaration->table.quark_to_range_set);
}
-void enum_type_free(struct type_class_enum *enum_class)
+static
+void _enum_declaration_free(struct bt_declaration *declaration)
{
+ struct declaration_enum *enum_declaration =
+ container_of(declaration, struct declaration_enum, p);
struct enum_range_to_quark *iter, *tmp;
- g_hash_table_destroy(enum_class->table.value_to_quark_set);
- cds_list_for_each_entry_safe(iter, tmp, &enum_class->table.range_to_quark, node) {
- cds_list_del(&iter->node);
+ g_hash_table_destroy(enum_declaration->table.value_to_quark_set);
+ bt_list_for_each_entry_safe(iter, tmp, &enum_declaration->table.range_to_quark, node) {
+ bt_list_del(&iter->node);
g_free(iter);
}
- g_hash_table_destroy(enum_class->table.quark_to_range_set);
- g_free(enum_class);
+ g_hash_table_destroy(enum_declaration->table.quark_to_range_set);
+ bt_declaration_unref(&enum_declaration->integer_declaration->p);
+ g_free(enum_declaration);
}
-static
-void _enum_type_free(struct type_class *type_class)
+struct declaration_enum *
+ bt_enum_declaration_new(struct declaration_integer *integer_declaration)
{
- struct type_class_enum *enum_class =
- container_of(type_class, struct type_class_enum, p.p);
- enum_type_free(enum_class);
-}
+ struct declaration_enum *enum_declaration;
-struct type_class_enum *enum_type_new(const char *name,
- size_t len, int byte_order,
- int signedness,
- size_t alignment)
-{
- struct type_class_enum *enum_class;
- struct type_class_integer *int_class;
- int ret;
+ enum_declaration = g_new(struct declaration_enum, 1);
- enum_class = g_new(struct type_class_enum, 1);
- enum_class->table.value_to_quark_set = g_hash_table_new_full(enum_val_hash,
+ enum_declaration->table.value_to_quark_set = g_hash_table_new_full(enum_val_hash,
enum_val_equal,
enum_val_free,
enum_range_set_free);
- CDS_INIT_LIST_HEAD(&enum_class->table.range_to_quark);
- enum_class->table.quark_to_range_set = g_hash_table_new_full(g_int_hash,
- g_int_equal,
+ BT_INIT_LIST_HEAD(&enum_declaration->table.range_to_quark);
+ enum_declaration->table.quark_to_range_set = g_hash_table_new_full(g_direct_hash,
+ g_direct_equal,
NULL, enum_range_set_free);
- int_class = &enum_class->p;
- int_class->p.name = g_quark_from_string(name);
- int_class->p.alignment = alignment;
- int_class->p.copy = enum_copy;
- int_class->p.free = _enum_type_free;
- int_class->p.ref = 1;
- int_class->len = len;
- int_class->byte_order = byte_order;
- int_class->signedness = signedness;
- if (int_class->p.name) {
- ret = register_type(&int_class->p);
- if (ret) {
- struct enum_range_to_quark *iter, *tmp;
-
- g_hash_table_destroy(enum_class->table.value_to_quark_set);
- cds_list_for_each_entry_safe(iter, tmp, &enum_class->table.range_to_quark, node) {
- cds_list_del(&iter->node);
- g_free(iter);
- }
- g_hash_table_destroy(enum_class->table.quark_to_range_set);
- g_free(enum_class);
- return NULL;
- }
- }
- return enum_class;
+ bt_declaration_ref(&integer_declaration->p);
+ enum_declaration->integer_declaration = integer_declaration;
+ enum_declaration->p.id = CTF_TYPE_ENUM;
+ enum_declaration->p.alignment = 1;
+ enum_declaration->p.declaration_free = _enum_declaration_free;
+ enum_declaration->p.definition_new = _enum_definition_new;
+ enum_declaration->p.definition_free = _enum_definition_free;
+ enum_declaration->p.ref = 1;
+ return enum_declaration;
+}
+
+static
+struct bt_definition *
+ _enum_definition_new(struct bt_declaration *declaration,
+ struct definition_scope *parent_scope,
+ GQuark field_name, int index,
+ const char *root_name)
+{
+ struct declaration_enum *enum_declaration =
+ container_of(declaration, struct declaration_enum, p);
+ struct definition_enum *_enum;
+ struct bt_definition *definition_integer_parent;
+ int ret;
+
+ _enum = g_new(struct definition_enum, 1);
+ bt_declaration_ref(&enum_declaration->p);
+ _enum->p.declaration = declaration;
+ _enum->declaration = enum_declaration;
+ _enum->p.ref = 1;
+ /*
+ * Use INT_MAX order to ensure that all fields of the parent
+ * scope are seen as being prior to this scope.
+ */
+ _enum->p.index = root_name ? INT_MAX : index;
+ _enum->p.name = field_name;
+ _enum->p.path = bt_new_definition_path(parent_scope, field_name, root_name);
+ _enum->p.scope = bt_new_definition_scope(parent_scope, field_name, root_name);
+ _enum->value = NULL;
+ ret = bt_register_field_definition(field_name, &_enum->p,
+ parent_scope);
+ assert(!ret);
+ definition_integer_parent =
+ enum_declaration->integer_declaration->p.definition_new(&enum_declaration->integer_declaration->p,
+ _enum->p.scope,
+ g_quark_from_static_string("container"), 0, NULL);
+ _enum->integer = container_of(definition_integer_parent,
+ struct definition_integer, p);
+ return &_enum->p;
+}
+
+static
+void _enum_definition_free(struct bt_definition *definition)
+{
+ struct definition_enum *_enum =
+ container_of(definition, struct definition_enum, p);
+
+ bt_definition_unref(&_enum->integer->p);
+ bt_free_definition_scope(_enum->p.scope);
+ bt_declaration_unref(_enum->p.declaration);
+ if (_enum->value)
+ g_array_unref(_enum->value);
+ g_free(_enum);
}
projects / babeltrace.git / blobdiff