[babeltrace.git] / types / enum.c

/*
 * enum.c
 *
 * BabelTrace - Enumeration Type
 *
 * 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
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * 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 definition *_enum_definition_new(struct declaration *declaration,
					struct definition_scope *parent_scope,
					GQuark field_name, int index,
					const char *root_name);
static
void _enum_definition_free(struct 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 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_declaration->table.value_to_quark_set,
				 get_uint_v(&v));

	/* Range lookup */
	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) {
			size_t qs_len = 0;

			if (qs)
				qs_len = qs->len;
			ranges = g_array_sized_new(FALSE, TRUE,
					sizeof(GQuark),
					qs_len + 1);
			g_array_set_size(ranges, qs_len + 1);
			if (qs)
				memcpy(ranges->data, qs->data,
				       sizeof(GQuark) * qs_len);
			g_array_index(ranges, GQuark, qs_len) = iter->quark;
		} else {
			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;
}

/*
 * Returns a GArray or NULL.
 * Caller must release the GArray with g_array_unref().
 */
GArray *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_declaration->table.value_to_quark_set,
				 get_int_v(&v));

	/* Range lookup */
	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) {
			size_t qs_len = 0;

			if (qs)
				qs_len = qs->len;
			ranges = g_array_sized_new(FALSE, TRUE,
					sizeof(GQuark),
					qs_len + 1);
			g_array_set_size(ranges, qs_len + 1);
			if (qs)
				memcpy(ranges->data, qs->data,
				       sizeof(GQuark) * qs_len);
			g_array_index(ranges, GQuark, qs_len) = iter->quark;
		} else {
			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;
}

static
void 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_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;
#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;
	}
}

static
void 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_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;
#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;
	}
}

GArray *enum_quark_to_range_set(const struct declaration_enum *enum_declaration,
				GQuark q)
{
	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 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);
	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 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);
	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 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_declaration, start, q);
	} else {
		if (start > end) {
			uint64_t tmp;

			tmp = start;
			start = end;
			end = tmp;
		}
		enum_signed_insert_range_to_quark(enum_declaration, start, end, q);
	}

	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_declaration->table.quark_to_range_set,
				    (gpointer) (unsigned long) q,
				    array);
	}
	g_array_set_size(array, array->len + 1);
	range = &g_array_index(array, struct enum_range, array->len - 1);
	range->start._signed = start;
	range->end._signed = end;
}

void enum_unsigned_insert(struct declaration_enum *enum_declaration,
			  uint64_t start, uint64_t end, GQuark q)
{
	GArray *array;
	struct enum_range *range;


	if (start == end) {
		enum_unsigned_insert_value_to_quark_set(enum_declaration, start, q);
	} else {
		if (start > end) {
			uint64_t tmp;

			tmp = start;
			start = end;
			end = tmp;
		}
		enum_unsigned_insert_range_to_quark(enum_declaration, start, end, q);
	}

	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_declaration->table.quark_to_range_set,
				    (gpointer) (unsigned long) q,
				    array);
	}
	g_array_set_size(array, array->len + 1);
	range = &g_array_index(array, struct enum_range, array->len - 1);
	range->start._unsigned = start;
	range->end._unsigned = end;
}

size_t enum_get_nr_enumerators(struct declaration_enum *enum_declaration)
{
	return g_hash_table_size(enum_declaration->table.quark_to_range_set);
}

static
void _enum_declaration_free(struct 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_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_declaration->table.quark_to_range_set);
	declaration_unref(&enum_declaration->integer_declaration->p);
	g_free(enum_declaration);
}

struct declaration_enum *
	enum_declaration_new(struct declaration_integer *integer_declaration)
{
	struct declaration_enum *enum_declaration;

	enum_declaration = g_new(struct declaration_enum, 1);

	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);
	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);
	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 definition *
	_enum_definition_new(struct 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 definition *definition_integer_parent;
	int ret;

	_enum = g_new(struct definition_enum, 1);
	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 = new_definition_path(parent_scope, field_name, root_name);
	_enum->p.scope = new_definition_scope(parent_scope, field_name, root_name);
	_enum->value = NULL;
	ret = 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 definition *definition)
{
	struct definition_enum *_enum =
		container_of(definition, struct definition_enum, p);

	definition_unref(&_enum->integer->p);
	free_definition_scope(_enum->p.scope);
	declaration_unref(_enum->p.declaration);
	if (_enum->value)
		g_array_unref(_enum->value);
	g_free(_enum);
}
Commit	Line	Data
448d3cc7	1	/*
ccd7e1c8	2	* enum.c
448d3cc7	3	*
ccd7e1c8	4	* BabelTrace - Enumeration Type
448d3cc7	5	*
64fa3fec MD	6	* Copyright 2010-2011 EfficiOS Inc. and Linux Foundation
	7	*
	8	* Author: Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
448d3cc7	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:
448d3cc7	16	*
ccd7e1c8 MD	17	* The above copyright notice and this permission notice shall be included in
ccd7e1c8 MD	18	* all copies or substantial portions of the Software.
c462e188 MD	19	*
	20	* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
	21	* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
	22	* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
	23	* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
	24	* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
	25	* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
	26	* SOFTWARE.
448d3cc7 MD	27	*/
	28
	29	#include <babeltrace/compiler.h>
4c8bfb7e	30	#include <babeltrace/format.h>
3122e6f0	31	#include <babeltrace/types.h>
448d3cc7 MD	32	#include <stdint.h>
	33	#include <glib.h>
	34
6148d997 MD	35	#if (__LONG_MAX__ == 2147483647L)
	36	#define WORD_SIZE 32
	37	#elif (__LONG_MAX__ == 9223372036854775807L)
	38	#define WORD_SIZE 64
	39	#else
	40	#error "Unknown long size."
	41	#endif
	42
c054553d	43	static
f6625916	44	struct definition _enum_definition_new(struct declaration declaration,
05c749e5	45	struct definition_scope *parent_scope,
98df1c9f MD	46	GQuark field_name, int index,
98df1c9f MD	47	const char *root_name);
c054553d	48	static
e1151715	49	void _enum_definition_free(struct definition *definition);
c054553d	50
d65d8abb MD	51	static
d65d8abb MD	52	void enum_range_set_free(void *ptr)
448d3cc7	53	{
d65d8abb	54	g_array_unref(ptr);
448d3cc7 MD	55	}
448d3cc7 MD	56
6148d997	57	#if (WORD_SIZE == 32)
bcdf4cf2 MD	58	static inline
	59	gpointer get_uint_v(uint64_t *v)
	60	{
	61	return v;
	62	}
	63
	64	static inline
	65	gpointer get_int_v(int64_t *v)
	66	{
	67	return v;
	68	}
	69
	70	static
	71	guint enum_val_hash(gconstpointer key)
	72	{
	73	int64_t ukey = (const int64_t )key;
	74
	75	return (guint)ukey ^ (guint)(ukey >> 32);
	76	}
	77
	78	static
	79	gboolean enum_val_equal(gconstpointer a, gconstpointer b)
	80	{
	81	int64_t ua = (const int64_t )a;
	82	int64_t ub = (const int64_t )b;
	83
	84	return ua == ub;
	85	}
	86
	87	static
	88	void enum_val_free(void *ptr)
	89	{
	90	g_free(ptr);
	91	}
6148d997	92	#else /* WORD_SIZE != 32 */
bcdf4cf2 MD	93	static inline
	94	gpointer get_uint_v(uint64_t *v)
	95	{
	96	return (gpointer) *v;
	97	}
	98
	99	static inline
	100	gpointer get_int_v(int64_t *v)
	101	{
	102	return (gpointer) *v;
	103	}
	104
	105	static
	106	guint enum_val_hash(gconstpointer key)
	107	{
	108	return g_direct_hash(key);
	109	}
	110
	111	static
	112	gboolean enum_val_equal(gconstpointer a, gconstpointer b)
	113	{
	114	return g_direct_equal(a, b);
	115	}
	116
	117	static
	118	void enum_val_free(void *ptr)
	119	{
	120	}
6148d997	121	#endif /* WORD_SIZE != 32 */
bcdf4cf2	122
d65d8abb MD	123	/*
	124	* Returns a GArray or NULL.
	125	* Caller must release the GArray with g_array_unref().
	126	*/
f6625916	127	GArray enum_uint_to_quark_set(const struct declaration_enum enum_declaration,
d65d8abb	128	uint64_t v)
448d3cc7	129	{
d65d8abb MD	130	struct enum_range_to_quark *iter;
d65d8abb MD	131	GArray qs, ranges = NULL;
448d3cc7	132
d65d8abb	133	/* Single values lookup */
bcdf4cf2 MD	134	qs = g_hash_table_lookup(enum_declaration->table.value_to_quark_set,
bcdf4cf2 MD	135	get_uint_v(&v));
d65d8abb MD	136
d65d8abb MD	137	/* Range lookup */
3122e6f0	138	bt_list_for_each_entry(iter, &enum_declaration->table.range_to_quark, node) {
d65d8abb MD	139	if (iter->range.start._unsigned > v \|\| iter->range.end._unsigned < v)
	140	continue;
	141	if (!ranges) {
	142	size_t qs_len = 0;
	143
	144	if (qs)
	145	qs_len = qs->len;
	146	ranges = g_array_sized_new(FALSE, TRUE,
ccdb988e	147	sizeof(GQuark),
d65d8abb MD	148	qs_len + 1);
	149	g_array_set_size(ranges, qs_len + 1);
	150	if (qs)
	151	memcpy(ranges->data, qs->data,
ccdb988e MD	152	sizeof(GQuark) * qs_len);
ccdb988e MD	153	g_array_index(ranges, GQuark, qs_len) = iter->quark;
d65d8abb	154	} else {
bcdf4cf2 MD	155	size_t qs_len = ranges->len;
	156
	157	g_array_set_size(ranges, qs_len + 1);
ccdb988e	158	g_array_index(ranges, GQuark, qs_len) = iter->quark;
d65d8abb MD	159	}
d65d8abb MD	160	}
fdacfb73	161	if (!ranges) {
bcdf4cf2 MD	162	if (!qs)
bcdf4cf2 MD	163	return NULL;
d65d8abb	164	ranges = qs;
fdacfb73 MD	165	g_array_ref(ranges);
fdacfb73 MD	166	}
d65d8abb	167	return ranges;
448d3cc7 MD	168	}
448d3cc7 MD	169
d65d8abb MD	170	/*
	171	* Returns a GArray or NULL.
	172	* Caller must release the GArray with g_array_unref().
	173	*/
f6625916	174	GArray enum_int_to_quark_set(const struct declaration_enum enum_declaration,
bcdf4cf2	175	int64_t v)
448d3cc7	176	{
d65d8abb MD	177	struct enum_range_to_quark *iter;
	178	GArray qs, ranges = NULL;
	179
	180	/* Single values lookup */
bcdf4cf2 MD	181	qs = g_hash_table_lookup(enum_declaration->table.value_to_quark_set,
bcdf4cf2 MD	182	get_int_v(&v));
d65d8abb MD	183
d65d8abb MD	184	/* Range lookup */
3122e6f0	185	bt_list_for_each_entry(iter, &enum_declaration->table.range_to_quark, node) {
d65d8abb MD	186	if (iter->range.start._signed > v \|\| iter->range.end._signed < v)
	187	continue;
	188	if (!ranges) {
	189	size_t qs_len = 0;
	190
	191	if (qs)
	192	qs_len = qs->len;
	193	ranges = g_array_sized_new(FALSE, TRUE,
ccdb988e	194	sizeof(GQuark),
d65d8abb MD	195	qs_len + 1);
	196	g_array_set_size(ranges, qs_len + 1);
	197	if (qs)
	198	memcpy(ranges->data, qs->data,
ccdb988e MD	199	sizeof(GQuark) * qs_len);
ccdb988e MD	200	g_array_index(ranges, GQuark, qs_len) = iter->quark;
d65d8abb	201	} else {
bcdf4cf2 MD	202	size_t qs_len = ranges->len;
	203
	204	g_array_set_size(ranges, qs_len + 1);
ccdb988e	205	g_array_index(ranges, GQuark, qs_len) = iter->quark;
d65d8abb MD	206	}
d65d8abb MD	207	}
fdacfb73	208	if (!ranges) {
bcdf4cf2 MD	209	if (!qs)
bcdf4cf2 MD	210	return NULL;
d65d8abb	211	ranges = qs;
fdacfb73 MD	212	g_array_ref(ranges);
fdacfb73 MD	213	}
d65d8abb	214	return ranges;
448d3cc7 MD	215	}
448d3cc7 MD	216
d65d8abb	217	static
f6625916	218	void enum_unsigned_insert_value_to_quark_set(struct declaration_enum *enum_declaration,
d65d8abb	219	uint64_t v, GQuark q)
448d3cc7	220	{
d65d8abb MD	221	uint64_t *valuep;
d65d8abb MD	222	GArray *array;
448d3cc7	223
bcdf4cf2 MD	224	array = g_hash_table_lookup(enum_declaration->table.value_to_quark_set,
bcdf4cf2 MD	225	get_uint_v(&v));
d65d8abb MD	226	if (!array) {
	227	array = g_array_sized_new(FALSE, TRUE, sizeof(GQuark), 1);
	228	g_array_set_size(array, 1);
	229	g_array_index(array, GQuark, array->len - 1) = q;
6148d997	230	#if (WORD_SIZE == 32)
d65d8abb MD	231	valuep = g_new(uint64_t, 1);
d65d8abb MD	232	*valuep = v;
6148d997	233	#else /* WORD_SIZE != 32 */
bcdf4cf2	234	valuep = get_uint_v(&v);
6148d997	235	#endif /* WORD_SIZE != 32 */
f6625916	236	g_hash_table_insert(enum_declaration->table.value_to_quark_set, valuep, array);
d65d8abb MD	237	} else {
	238	g_array_set_size(array, array->len + 1);
	239	g_array_index(array, GQuark, array->len - 1) = q;
	240	}
448d3cc7	241	}
448d3cc7	242
d65d8abb	243	static
f6625916	244	void enum_signed_insert_value_to_quark_set(struct declaration_enum *enum_declaration,
d65d8abb MD	245	int64_t v, GQuark q)
d65d8abb MD	246	{
bcdf4cf2	247	int64_t *valuep;
d65d8abb MD	248	GArray *array;
d65d8abb MD	249
f6625916	250	array = g_hash_table_lookup(enum_declaration->table.value_to_quark_set,
bcdf4cf2	251	get_int_v(&v));
d65d8abb MD	252	if (!array) {
	253	array = g_array_sized_new(FALSE, TRUE, sizeof(GQuark), 1);
	254	g_array_set_size(array, 1);
	255	g_array_index(array, GQuark, array->len - 1) = q;
6148d997	256	#if (WORD_SIZE == 32)
bcdf4cf2 MD	257	valuep = g_new(int64_t, 1);
bcdf4cf2 MD	258	*valuep = v;
6148d997	259	#else /* WORD_SIZE != 32 */
bcdf4cf2	260	valuep = get_int_v(&v);
6148d997	261	#endif /* WORD_SIZE != 32 */
bcdf4cf2	262	g_hash_table_insert(enum_declaration->table.value_to_quark_set, valuep, array);
d65d8abb MD	263	} else {
	264	g_array_set_size(array, array->len + 1);
	265	g_array_index(array, GQuark, array->len - 1) = q;
	266	}
448d3cc7 MD	267	}
448d3cc7 MD	268
f6625916	269	GArray enum_quark_to_range_set(const struct declaration_enum enum_declaration,
d65d8abb	270	GQuark q)
448d3cc7	271	{
f6625916	272	return g_hash_table_lookup(enum_declaration->table.quark_to_range_set,
47e0f2e2	273	(gconstpointer) (unsigned long) q);
448d3cc7 MD	274	}
448d3cc7 MD	275
d65d8abb	276	static
f6625916	277	void enum_signed_insert_range_to_quark(struct declaration_enum *enum_declaration,
d65d8abb	278	int64_t start, int64_t end, GQuark q)
448d3cc7	279	{
d65d8abb MD	280	struct enum_range_to_quark *rtoq;
	281
	282	rtoq = g_new(struct enum_range_to_quark, 1);
3122e6f0	283	bt_list_add(&rtoq->node, &enum_declaration->table.range_to_quark);
d65d8abb MD	284	rtoq->range.start._signed = start;
	285	rtoq->range.end._signed = end;
	286	rtoq->quark = q;
448d3cc7 MD	287	}
448d3cc7 MD	288
d65d8abb	289	static
f6625916	290	void enum_unsigned_insert_range_to_quark(struct declaration_enum *enum_declaration,
d65d8abb	291	uint64_t start, uint64_t end, GQuark q)
448d3cc7	292	{
d65d8abb MD	293	struct enum_range_to_quark *rtoq;
	294
	295	rtoq = g_new(struct enum_range_to_quark, 1);
3122e6f0	296	bt_list_add(&rtoq->node, &enum_declaration->table.range_to_quark);
d65d8abb MD	297	rtoq->range.start._unsigned = start;
	298	rtoq->range.end._unsigned = end;
	299	rtoq->quark = q;
448d3cc7 MD	300	}
448d3cc7 MD	301
f6625916	302	void enum_signed_insert(struct declaration_enum *enum_declaration,
d65d8abb	303	int64_t start, int64_t end, GQuark q)
448d3cc7	304	{
d65d8abb MD	305	GArray *array;
	306	struct enum_range *range;
	307
	308	if (start == end) {
f6625916	309	enum_signed_insert_value_to_quark_set(enum_declaration, start, q);
d65d8abb MD	310	} else {
	311	if (start > end) {
	312	uint64_t tmp;
	313
	314	tmp = start;
	315	start = end;
	316	end = tmp;
	317	}
f6625916	318	enum_signed_insert_range_to_quark(enum_declaration, start, end, q);
d65d8abb MD	319	}
d65d8abb MD	320
f6625916	321	array = g_hash_table_lookup(enum_declaration->table.quark_to_range_set,
d65d8abb MD	322	(gconstpointer) (unsigned long) q);
	323	if (!array) {
	324	array = g_array_sized_new(FALSE, TRUE,
	325	sizeof(struct enum_range), 1);
f6625916	326	g_hash_table_insert(enum_declaration->table.quark_to_range_set,
d65d8abb MD	327	(gpointer) (unsigned long) q,
	328	array);
	329	}
	330	g_array_set_size(array, array->len + 1);
	331	range = &g_array_index(array, struct enum_range, array->len - 1);
	332	range->start._signed = start;
	333	range->end._signed = end;
448d3cc7 MD	334	}
448d3cc7 MD	335
f6625916	336	void enum_unsigned_insert(struct declaration_enum *enum_declaration,
d65d8abb	337	uint64_t start, uint64_t end, GQuark q)
448d3cc7	338	{
d65d8abb MD	339	GArray *array;
	340	struct enum_range *range;
	341
	342
	343	if (start == end) {
f6625916	344	enum_unsigned_insert_value_to_quark_set(enum_declaration, start, q);
d65d8abb MD	345	} else {
	346	if (start > end) {
	347	uint64_t tmp;
	348
	349	tmp = start;
	350	start = end;
	351	end = tmp;
	352	}
f6625916	353	enum_unsigned_insert_range_to_quark(enum_declaration, start, end, q);
d65d8abb MD	354	}
d65d8abb MD	355
f6625916	356	array = g_hash_table_lookup(enum_declaration->table.quark_to_range_set,
d65d8abb MD	357	(gconstpointer) (unsigned long) q);
	358	if (!array) {
	359	array = g_array_sized_new(FALSE, TRUE,
	360	sizeof(struct enum_range), 1);
f6625916	361	g_hash_table_insert(enum_declaration->table.quark_to_range_set,
d65d8abb MD	362	(gpointer) (unsigned long) q,
	363	array);
	364	}
	365	g_array_set_size(array, array->len + 1);
	366	range = &g_array_index(array, struct enum_range, array->len - 1);
	367	range->start._unsigned = start;
	368	range->end._unsigned = end;
448d3cc7	369	}
448d3cc7	370
f6625916	371	size_t enum_get_nr_enumerators(struct declaration_enum *enum_declaration)
c054553d	372	{
f6625916	373	return g_hash_table_size(enum_declaration->table.quark_to_range_set);
c054553d MD	374	}
c054553d MD	375
c054553d	376	static
f6625916	377	void _enum_declaration_free(struct declaration *declaration)
90b676d7	378	{
f6625916 MD	379	struct declaration_enum *enum_declaration =
f6625916 MD	380	container_of(declaration, struct declaration_enum, p);
d65d8abb MD	381	struct enum_range_to_quark iter, tmp;
d65d8abb MD	382
f6625916	383	g_hash_table_destroy(enum_declaration->table.value_to_quark_set);
3122e6f0 JD	384	bt_list_for_each_entry_safe(iter, tmp, &enum_declaration->table.range_to_quark, node) {
3122e6f0 JD	385	bt_list_del(&iter->node);
d65d8abb MD	386	g_free(iter);
d65d8abb MD	387	}
f6625916 MD	388	g_hash_table_destroy(enum_declaration->table.quark_to_range_set);
	389	declaration_unref(&enum_declaration->integer_declaration->p);
	390	g_free(enum_declaration);
90b676d7 MD	391	}
90b676d7 MD	392
f6625916	393	struct declaration_enum *
78af2bcd	394	enum_declaration_new(struct declaration_integer *integer_declaration)
448d3cc7	395	{
f6625916	396	struct declaration_enum *enum_declaration;
448d3cc7	397
f6625916	398	enum_declaration = g_new(struct declaration_enum, 1);
e19c3d69	399
f6625916	400	enum_declaration->table.value_to_quark_set = g_hash_table_new_full(enum_val_hash,
d65d8abb MD	401	enum_val_equal,
	402	enum_val_free,
	403	enum_range_set_free);
3122e6f0	404	BT_INIT_LIST_HEAD(&enum_declaration->table.range_to_quark);
068665f5 MD	405	enum_declaration->table.quark_to_range_set = g_hash_table_new_full(g_direct_hash,
068665f5 MD	406	g_direct_equal,
d65d8abb	407	NULL, enum_range_set_free);
f6625916 MD	408	declaration_ref(&integer_declaration->p);
	409	enum_declaration->integer_declaration = integer_declaration;
	410	enum_declaration->p.id = CTF_TYPE_ENUM;
f6625916	411	enum_declaration->p.alignment = 1;
f6625916 MD	412	enum_declaration->p.declaration_free = _enum_declaration_free;
	413	enum_declaration->p.definition_new = _enum_definition_new;
	414	enum_declaration->p.definition_free = _enum_definition_free;
	415	enum_declaration->p.ref = 1;
	416	return enum_declaration;
c054553d MD	417	}
	418
	419	static
e1151715	420	struct definition *
f6625916	421	_enum_definition_new(struct declaration *declaration,
05c749e5	422	struct definition_scope *parent_scope,
98df1c9f MD	423	GQuark field_name, int index,
98df1c9f MD	424	const char *root_name)
c054553d	425	{
f6625916 MD	426	struct declaration_enum *enum_declaration =
f6625916 MD	427	container_of(declaration, struct declaration_enum, p);
e1151715 MD	428	struct definition_enum *_enum;
e1151715 MD	429	struct definition *definition_integer_parent;
98df1c9f	430	int ret;
e19c3d69	431
e1151715	432	_enum = g_new(struct definition_enum, 1);
f6625916 MD	433	declaration_ref(&enum_declaration->p);
	434	_enum->p.declaration = declaration;
	435	_enum->declaration = enum_declaration;
c054553d	436	_enum->p.ref = 1;
98df1c9f MD	437	/*
	438	* Use INT_MAX order to ensure that all fields of the parent
	439	* scope are seen as being prior to this scope.
	440	*/
	441	_enum->p.index = root_name ? INT_MAX : index;
b1a2f580	442	_enum->p.name = field_name;
98df1c9f	443	_enum->p.path = new_definition_path(parent_scope, field_name, root_name);
a35173fe	444	_enum->p.scope = new_definition_scope(parent_scope, field_name, root_name);
c054553d	445	_enum->value = NULL;
98df1c9f MD	446	ret = register_field_definition(field_name, &_enum->p,
	447	parent_scope);
	448	assert(!ret);
e1151715	449	definition_integer_parent =
f6625916	450	enum_declaration->integer_declaration->p.definition_new(&enum_declaration->integer_declaration->p,
a35173fe	451	_enum->p.scope,
98df1c9f	452	g_quark_from_static_string("container"), 0, NULL);
e1151715 MD	453	_enum->integer = container_of(definition_integer_parent,
e1151715 MD	454	struct definition_integer, p);
c054553d MD	455	return &_enum->p;
	456	}
	457
	458	static
e1151715	459	void _enum_definition_free(struct definition *definition)
c054553d	460	{
e1151715 MD	461	struct definition_enum *_enum =
e1151715 MD	462	container_of(definition, struct definition_enum, p);
c054553d	463
e1151715	464	definition_unref(&_enum->integer->p);
a35173fe	465	free_definition_scope(_enum->p.scope);
f6625916	466	declaration_unref(_enum->p.declaration);
c054553d	467	if (_enum->value)
6ee5115e	468	g_array_unref(_enum->value);
c054553d	469	g_free(_enum);
448d3cc7	470	}