[babeltrace.git] / types / types.c

/*
 * declarations.c
 *
 * BabelTrace - Converter
 *
 * Types registry.
 *
 * Copyright 2010, 2011 - 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.
 */

#include <babeltrace/format.h>
#include <limits.h>
#include <glib.h>
#include <errno.h>

static
GQuark prefix_quark(const char *prefix, GQuark quark)
{
	GQuark nq;
	GString *str;

	str = g_string_new(prefix);
	g_string_append(str, g_quark_to_string(quark));
	nq = g_quark_from_string(g_string_free(str, FALSE));
	return nq;
}

static
struct declaration *
	lookup_declaration_scope(GQuark declaration_name,
		struct declaration_scope *scope)
{
	return g_hash_table_lookup(scope->typedef_declarations,
				   (gconstpointer) (unsigned long) declaration_name);
}

struct declaration *lookup_declaration(GQuark declaration_name,
		struct declaration_scope *scope)
{
	struct declaration *declaration;

	while (scope) {
		declaration = lookup_declaration_scope(declaration_name,
						       scope);
		if (declaration)
			return declaration;
		scope = scope->parent_scope;
	}
	return NULL;
}

int register_declaration(GQuark name, struct declaration *declaration,
		struct declaration_scope *scope)
{
	if (!name)
		return -EPERM;

	/* Only lookup in local scope */
	if (lookup_declaration_scope(name, scope))
		return -EEXIST;

	g_hash_table_insert(scope->typedef_declarations,
			    (gpointer) (unsigned long) name,
			    declaration);
	declaration_ref(declaration);
	return 0;
}

static
struct definition *
	lookup_field_definition_scope(GQuark field_name,
		struct definition_scope *scope)
{
	return g_hash_table_lookup(scope->definitions,
				   (gconstpointer) (unsigned long) field_name);
}

/*
 * Returns the index at which the paths differ.
 * If the value returned equals len, it means the paths are identical
 * from index 0 to len-1.
 */
static int compare_paths(GArray *a, GArray *b, int len)
{
	int i;

	assert(len <= a->len);
	assert(len <= b->len);

	for (i = 0; i < len; i++) {
		GQuark qa, qb;

		qa = g_array_index(a, GQuark, i);
		qb = g_array_index(b, GQuark, i);
		if (qa != qb)
			return i;
	}
	return i;
}

static int is_path_child_of(GArray *path, GArray *maybe_parent)
{
	if (path->len <= maybe_parent->len)
		return 0;
	if (compare_paths(path, maybe_parent, maybe_parent->len)
			== maybe_parent->len)
		return 1;
	else
		return 0;
}

static struct definition_scope *
	get_definition_scope(struct definition *definition)
{
	switch (definition->declaration->id) {
	case CTF_TYPE_STRUCT:
	{
		struct definition_struct *def =
			container_of(definition, struct definition_struct, p);
		return def->scope;
	}
	case CTF_TYPE_VARIANT:
	{
		struct definition_variant *def =
			container_of(definition, struct definition_variant, p);
		return def->scope;
	}
	case CTF_TYPE_ARRAY:
	{
		struct definition_array *def =
			container_of(definition, struct definition_array, p);
		return def->scope;
	}
	case CTF_TYPE_SEQUENCE:
	{
		struct definition_sequence *def =
			container_of(definition, struct definition_sequence, p);
		return def->scope;
	}

	case CTF_TYPE_INTEGER:
	case CTF_TYPE_FLOAT:
	case CTF_TYPE_ENUM:
	case CTF_TYPE_STRING:
	case CTF_TYPE_UNKNOWN:
	default:
		return NULL;
	}
}

/*
 * OK, here is the fun. We want to lookup a field that is:
 * - either in the same dynamic scope:
 *   - either in the current scope, but prior to the current field.
 *   - or in a parent scope (or parent of parent ...) still in a field
 *     prior to the current field position within the parents.
 * - or in a different dynamic scope:
 *   - either in a upper dynamic scope (walk down a targeted scope from
 *     the dynamic scope root)
 *   - or in a lower dynamic scope (failure)
 * The dynamic scope roots are linked together, so we can access the
 * parent dynamic scope from the child dynamic scope by walking up to
 * the parent.
 * If we cannot find such a field that is prior to our current path, we
 * return NULL.
 *
 * cur_path: the path leading to the variant definition.
 * lookup_path: the path leading to the enum we want to look for.
 * scope: the definition scope containing the variant definition.
 */
struct definition *
	lookup_definition(GArray *cur_path,
			  GArray *lookup_path,
			  struct definition_scope *scope)
{
	struct definition *definition, *lookup_definition;
	GQuark last;
	int index;

	while (scope) {
		/* going up in the hierarchy. Check where we come from. */
		assert(is_path_child_of(cur_path, scope->scope_path));
		assert(cur_path->len - scope->scope_path->len == 1);
		last = g_array_index(cur_path, GQuark, cur_path->len - 1);
		definition = lookup_field_definition_scope(last, scope);
		assert(definition);
		index = definition->index;
lookup:
		if (is_path_child_of(lookup_path, scope->scope_path)) {
			/* Means we can lookup the field in this scope */
			last = g_array_index(lookup_path, GQuark,
					     scope->scope_path->len);
			lookup_definition = lookup_field_definition_scope(last, scope);
			if (!lookup_definition || ((index != -1) && lookup_definition->index >= index))
				return NULL;
			/* Found it! And it is prior to the current field. */
			if (lookup_path->len - scope->scope_path->len == 1) {
				/* Direct child */
				return lookup_definition;
			} else {
				scope = get_definition_scope(lookup_definition);
				/* Check if the definition has a sub-scope */
				if (!scope)
					return NULL;
				/*
				 * Don't compare index anymore, because we are
				 * going within a scope that has been validated
				 * to be entirely prior to the current scope.
				 */
				cur_path = NULL;
				index = -1;
				goto lookup;
			}
		} else {
			assert(index != -1);
			/* lookup_path is within an upper scope */
			cur_path = scope->scope_path;
			scope = scope->parent_scope;
		}
	}
	return NULL;
}

int register_field_definition(GQuark field_name, struct definition *definition,
		struct definition_scope *scope)
{
	if (!field_name)
		return -EPERM;

	/* Only lookup in local scope */
	if (lookup_field_definition_scope(field_name, scope))
		return -EEXIST;

	g_hash_table_insert(scope->definitions,
			    (gpointer) (unsigned long) field_name,
			    definition);
	definition_ref(definition);
	return 0;
}

void declaration_ref(struct declaration *declaration)
{
	declaration->ref++;
}

void declaration_unref(struct declaration *declaration)
{
	if (!declaration)
		return;
	if (!--declaration->ref)
		declaration->declaration_free(declaration);
}

void definition_ref(struct definition *definition)
{
	definition->ref++;
}

void definition_unref(struct definition *definition)
{
	if (!definition)
		return;
	if (!--definition->ref)
		definition->declaration->definition_free(definition);
}

struct declaration_scope *
	new_declaration_scope(struct declaration_scope *parent_scope)
{
	struct declaration_scope *scope = g_new(struct declaration_scope, 1);

	scope->typedef_declarations = g_hash_table_new_full(g_direct_hash,
					g_direct_equal, NULL,
					(GDestroyNotify) definition_unref);
	scope->struct_declarations = g_hash_table_new_full(g_direct_hash,
					g_direct_equal, NULL,
					(GDestroyNotify) declaration_unref);
	scope->variant_declarations = g_hash_table_new_full(g_direct_hash,
					g_direct_equal, NULL,
					(GDestroyNotify) declaration_unref);
	scope->enum_declarations = g_hash_table_new_full(g_direct_hash,
					g_direct_equal, NULL,
					(GDestroyNotify) declaration_unref);
	scope->parent_scope = parent_scope;
	return scope;
}

void free_declaration_scope(struct declaration_scope *scope)
{
	g_hash_table_destroy(scope->enum_declarations);
	g_hash_table_destroy(scope->variant_declarations);
	g_hash_table_destroy(scope->struct_declarations);
	g_hash_table_destroy(scope->typedef_declarations);
	g_free(scope);
}

static
struct declaration_struct *lookup_struct_declaration_scope(GQuark struct_name,
					     struct declaration_scope *scope)
{
	return g_hash_table_lookup(scope->struct_declarations,
				   (gconstpointer) (unsigned long) struct_name);
}

struct declaration_struct *lookup_struct_declaration(GQuark struct_name,
				       struct declaration_scope *scope)
{
	struct declaration_struct *declaration;

	while (scope) {
		declaration = lookup_struct_declaration_scope(struct_name, scope);
		if (declaration)
			return declaration;
		scope = scope->parent_scope;
	}
	return NULL;
}

int register_struct_declaration(GQuark struct_name,
	struct declaration_struct *struct_declaration,
	struct declaration_scope *scope)
{
	GQuark prefix_name;
	int ret;

	if (!struct_name)
		return -EPERM;

	/* Only lookup in local scope */
	if (lookup_struct_declaration_scope(struct_name, scope))
		return -EEXIST;

	g_hash_table_insert(scope->struct_declarations,
			    (gpointer) (unsigned long) struct_name,
			    struct_declaration);
	declaration_ref(&struct_declaration->p);

	/* Also add in typedef/typealias scopes */
	prefix_name = prefix_quark("struct ", struct_name);
	ret = register_declaration(prefix_name, &struct_declaration->p, scope);
	assert(!ret);
	return 0;
}

static
struct declaration_untagged_variant *
	lookup_variant_declaration_scope(GQuark variant_name,
		struct declaration_scope *scope)
{
	return g_hash_table_lookup(scope->variant_declarations,
				   (gconstpointer) (unsigned long) variant_name);
}

struct declaration_untagged_variant *
	lookup_variant_declaration(GQuark variant_name,
		struct declaration_scope *scope)
{
	struct declaration_untagged_variant *declaration;

	while (scope) {
		declaration = lookup_variant_declaration_scope(variant_name, scope);
		if (declaration)
			return declaration;
		scope = scope->parent_scope;
	}
	return NULL;
}

int register_variant_declaration(GQuark variant_name,
		struct declaration_untagged_variant *untagged_variant_declaration,
		struct declaration_scope *scope)
{
	GQuark prefix_name;
	int ret;

	if (!variant_name)
		return -EPERM;

	/* Only lookup in local scope */
	if (lookup_variant_declaration_scope(variant_name, scope))
		return -EEXIST;

	g_hash_table_insert(scope->variant_declarations,
			    (gpointer) (unsigned long) variant_name,
			    untagged_variant_declaration);
	declaration_ref(&untagged_variant_declaration->p);

	/* Also add in typedef/typealias scopes */
	prefix_name = prefix_quark("variant ", variant_name);
	ret = register_declaration(prefix_name,
			&untagged_variant_declaration->p, scope);
	assert(!ret);
	return 0;
}

static
struct declaration_enum *
	lookup_enum_declaration_scope(GQuark enum_name,
		struct declaration_scope *scope)
{
	return g_hash_table_lookup(scope->enum_declarations,
				   (gconstpointer) (unsigned long) enum_name);
}

struct declaration_enum *
	lookup_enum_declaration(GQuark enum_name,
		struct declaration_scope *scope)
{
	struct declaration_enum *declaration;

	while (scope) {
		declaration = lookup_enum_declaration_scope(enum_name, scope);
		if (declaration)
			return declaration;
		scope = scope->parent_scope;
	}
	return NULL;
}

int register_enum_declaration(GQuark enum_name,
		struct declaration_enum *enum_declaration,
		struct declaration_scope *scope)
{
	GQuark prefix_name;
	int ret;

	if (!enum_name)
		return -EPERM;

	/* Only lookup in local scope */
	if (lookup_enum_declaration_scope(enum_name, scope))
		return -EEXIST;

	g_hash_table_insert(scope->enum_declarations,
			    (gpointer) (unsigned long) enum_name,
			    enum_declaration);
	declaration_ref(&enum_declaration->p);

	/* Also add in typedef/typealias scopes */
	prefix_name = prefix_quark("enum ", enum_name);
	ret = register_declaration(prefix_name, &enum_declaration->p, scope);
	assert(!ret);
	return 0;
}

static struct definition_scope *
	_new_definition_scope(struct definition_scope *parent_scope,
			      int scope_path_len)
{
	struct definition_scope *scope = g_new(struct definition_scope, 1);

	scope->definitions = g_hash_table_new_full(g_direct_hash,
					g_direct_equal, NULL,
					(GDestroyNotify) definition_unref);
	scope->parent_scope = parent_scope;
	scope->scope_path = g_array_sized_new(FALSE, TRUE, sizeof(GQuark),
					      scope_path_len);
	g_array_set_size(scope->scope_path, scope_path_len);
	return scope;
}

struct definition_scope *
	new_definition_scope(struct definition_scope *parent_scope,
			     GQuark field_name)
{
	struct definition_scope *scope;
	int scope_path_len = 1;

	if (parent_scope)
		scope_path_len += parent_scope->scope_path->len;
	scope = _new_definition_scope(parent_scope, scope_path_len);
	if (parent_scope)
		memcpy(scope->scope_path, parent_scope->scope_path,
		       sizeof(GQuark) * (scope_path_len - 1));
	g_array_index(scope->scope_path, GQuark, scope_path_len - 1) =
		field_name;
	return scope;
}

/*
 * in: path (dot separated), out: q (GArray of GQuark)
 */
void append_scope_path(const char *path, GArray *q)
{
	const char *ptrbegin, *ptrend = path;
	GQuark quark;

	for (;;) {
		char *str;
		size_t len;

		ptrbegin = ptrend;
		ptrend = strchr(ptrbegin, '.');
		if (!ptrend)
			break;
		len = ptrend - ptrbegin;
		/* Don't accept two consecutive dots */
		assert(len != 0);
		str = g_new(char, len + 1);	/* include \0 */
		memcpy(str, ptrbegin, len);
		str[len] = '\0';
		quark = g_quark_from_string(str);
		g_array_append_val(q, quark);
		g_free(str);
		ptrend++;	/* skip current dot */
	}
	/* last. Check for trailing dot (and discard). */
	if (ptrbegin[0] != '\0') {
		quark = g_quark_from_string(ptrbegin);
		g_array_append_val(q, quark);
	}
}

void set_dynamic_definition_scope(struct definition *definition,
				  struct definition_scope *scope,
				  const char *root_name)
{
	g_array_set_size(scope->scope_path, 0);
	append_scope_path(root_name, scope->scope_path);
	/*
	 * Use INT_MAX order to ensure that all fields of the parent
	 * scope are seen as being prior to this scope.
	 */
	definition->index = INT_MAX;
}

void free_definition_scope(struct definition_scope *scope)
{
	g_array_free(scope->scope_path, TRUE);
	g_hash_table_destroy(scope->definitions);
	g_free(scope);
}
Commit	Line	Data
	1	/*
	2	* declarations.c
	3	*
	4	* BabelTrace - Converter
	5	*
	6	* Types registry.
	7	*
	8	* Copyright 2010, 2011 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
	9	*
	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:
	16	*
	17	* The above copyright notice and this permission notice shall be included in
	18	* all copies or substantial portions of the Software.
	19	*/
	20
	21	#include <babeltrace/format.h>
	22	#include <limits.h>
	23	#include <glib.h>
	24	#include <errno.h>
	25
	26	static
	27	GQuark prefix_quark(const char *prefix, GQuark quark)
	28	{
	29	GQuark nq;
	30	GString *str;
	31
	32	str = g_string_new(prefix);
	33	g_string_append(str, g_quark_to_string(quark));
	34	nq = g_quark_from_string(g_string_free(str, FALSE));
	35	return nq;
	36	}
	37
	38	static
	39	struct declaration *
	40	lookup_declaration_scope(GQuark declaration_name,
	41	struct declaration_scope *scope)
	42	{
	43	return g_hash_table_lookup(scope->typedef_declarations,
	44	(gconstpointer) (unsigned long) declaration_name);
	45	}
	46
	47	struct declaration *lookup_declaration(GQuark declaration_name,
	48	struct declaration_scope *scope)
	49	{
	50	struct declaration *declaration;
	51
	52	while (scope) {
	53	declaration = lookup_declaration_scope(declaration_name,
	54	scope);
	55	if (declaration)
	56	return declaration;
	57	scope = scope->parent_scope;
	58	}
	59	return NULL;
	60	}
	61
	62	int register_declaration(GQuark name, struct declaration *declaration,
	63	struct declaration_scope *scope)
	64	{
	65	if (!name)
	66	return -EPERM;
	67
	68	/* Only lookup in local scope */
	69	if (lookup_declaration_scope(name, scope))
	70	return -EEXIST;
	71
	72	g_hash_table_insert(scope->typedef_declarations,
	73	(gpointer) (unsigned long) name,
	74	declaration);
	75	declaration_ref(declaration);
	76	return 0;
	77	}
	78
	79	static
	80	struct definition *
	81	lookup_field_definition_scope(GQuark field_name,
	82	struct definition_scope *scope)
	83	{
	84	return g_hash_table_lookup(scope->definitions,
	85	(gconstpointer) (unsigned long) field_name);
	86	}
	87
	88	/*
	89	* Returns the index at which the paths differ.
	90	* If the value returned equals len, it means the paths are identical
	91	* from index 0 to len-1.
	92	*/
	93	static int compare_paths(GArray a, GArray b, int len)
	94	{
	95	int i;
	96
	97	assert(len <= a->len);
	98	assert(len <= b->len);
	99
	100	for (i = 0; i < len; i++) {
	101	GQuark qa, qb;
	102
	103	qa = g_array_index(a, GQuark, i);
	104	qb = g_array_index(b, GQuark, i);
	105	if (qa != qb)
	106	return i;
	107	}
	108	return i;
	109	}
	110
	111	static int is_path_child_of(GArray path, GArray maybe_parent)
	112	{
	113	if (path->len <= maybe_parent->len)
	114	return 0;
	115	if (compare_paths(path, maybe_parent, maybe_parent->len)
	116	== maybe_parent->len)
	117	return 1;
	118	else
	119	return 0;
	120	}
	121
	122	static struct definition_scope *
	123	get_definition_scope(struct definition *definition)
	124	{
	125	switch (definition->declaration->id) {
	126	case CTF_TYPE_STRUCT:
	127	{
	128	struct definition_struct *def =
	129	container_of(definition, struct definition_struct, p);
	130	return def->scope;
	131	}
	132	case CTF_TYPE_VARIANT:
	133	{
	134	struct definition_variant *def =
	135	container_of(definition, struct definition_variant, p);
	136	return def->scope;
	137	}
	138	case CTF_TYPE_ARRAY:
	139	{
	140	struct definition_array *def =
	141	container_of(definition, struct definition_array, p);
	142	return def->scope;
	143	}
	144	case CTF_TYPE_SEQUENCE:
	145	{
	146	struct definition_sequence *def =
	147	container_of(definition, struct definition_sequence, p);
	148	return def->scope;
	149	}
	150
	151	case CTF_TYPE_INTEGER:
	152	case CTF_TYPE_FLOAT:
	153	case CTF_TYPE_ENUM:
	154	case CTF_TYPE_STRING:
	155	case CTF_TYPE_UNKNOWN:
	156	default:
	157	return NULL;
	158	}
	159	}
	160
	161	/*
	162	* OK, here is the fun. We want to lookup a field that is:
	163	* - either in the same dynamic scope:
	164	* - either in the current scope, but prior to the current field.
	165	* - or in a parent scope (or parent of parent ...) still in a field
	166	* prior to the current field position within the parents.
	167	* - or in a different dynamic scope:
	168	* - either in a upper dynamic scope (walk down a targeted scope from
	169	* the dynamic scope root)
	170	* - or in a lower dynamic scope (failure)
	171	* The dynamic scope roots are linked together, so we can access the
	172	* parent dynamic scope from the child dynamic scope by walking up to
	173	* the parent.
	174	* If we cannot find such a field that is prior to our current path, we
	175	* return NULL.
	176	*
	177	* cur_path: the path leading to the variant definition.
	178	* lookup_path: the path leading to the enum we want to look for.
	179	* scope: the definition scope containing the variant definition.
	180	*/
	181	struct definition *
	182	lookup_definition(GArray *cur_path,
	183	GArray *lookup_path,
	184	struct definition_scope *scope)
	185	{
	186	struct definition definition, lookup_definition;
	187	GQuark last;
	188	int index;
	189
	190	while (scope) {
	191	/* going up in the hierarchy. Check where we come from. */
	192	assert(is_path_child_of(cur_path, scope->scope_path));
	193	assert(cur_path->len - scope->scope_path->len == 1);
	194	last = g_array_index(cur_path, GQuark, cur_path->len - 1);
	195	definition = lookup_field_definition_scope(last, scope);
	196	assert(definition);
	197	index = definition->index;
	198	lookup:
	199	if (is_path_child_of(lookup_path, scope->scope_path)) {
	200	/* Means we can lookup the field in this scope */
	201	last = g_array_index(lookup_path, GQuark,
	202	scope->scope_path->len);
	203	lookup_definition = lookup_field_definition_scope(last, scope);
	204	if (!lookup_definition \|\| ((index != -1) && lookup_definition->index >= index))
	205	return NULL;
	206	/* Found it! And it is prior to the current field. */
	207	if (lookup_path->len - scope->scope_path->len == 1) {
	208	/* Direct child */
	209	return lookup_definition;
	210	} else {
	211	scope = get_definition_scope(lookup_definition);
	212	/* Check if the definition has a sub-scope */
	213	if (!scope)
	214	return NULL;
	215	/*
	216	* Don't compare index anymore, because we are
	217	* going within a scope that has been validated
	218	* to be entirely prior to the current scope.
	219	*/
	220	cur_path = NULL;
	221	index = -1;
	222	goto lookup;
	223	}
	224	} else {
	225	assert(index != -1);
	226	/* lookup_path is within an upper scope */
	227	cur_path = scope->scope_path;
	228	scope = scope->parent_scope;
	229	}
	230	}
	231	return NULL;
	232	}
	233
	234	int register_field_definition(GQuark field_name, struct definition *definition,
	235	struct definition_scope *scope)
	236	{
	237	if (!field_name)
	238	return -EPERM;
	239
	240	/* Only lookup in local scope */
	241	if (lookup_field_definition_scope(field_name, scope))
	242	return -EEXIST;
	243
	244	g_hash_table_insert(scope->definitions,
	245	(gpointer) (unsigned long) field_name,
	246	definition);
	247	definition_ref(definition);
	248	return 0;
	249	}
	250
	251	void declaration_ref(struct declaration *declaration)
	252	{
	253	declaration->ref++;
	254	}
	255
	256	void declaration_unref(struct declaration *declaration)
	257	{
	258	if (!declaration)
	259	return;
	260	if (!--declaration->ref)
	261	declaration->declaration_free(declaration);
	262	}
	263
	264	void definition_ref(struct definition *definition)
	265	{
	266	definition->ref++;
	267	}
	268
	269	void definition_unref(struct definition *definition)
	270	{
	271	if (!definition)
	272	return;
	273	if (!--definition->ref)
	274	definition->declaration->definition_free(definition);
	275	}
	276
	277	struct declaration_scope *
	278	new_declaration_scope(struct declaration_scope *parent_scope)
	279	{
	280	struct declaration_scope *scope = g_new(struct declaration_scope, 1);
	281
	282	scope->typedef_declarations = g_hash_table_new_full(g_direct_hash,
	283	g_direct_equal, NULL,
	284	(GDestroyNotify) definition_unref);
	285	scope->struct_declarations = g_hash_table_new_full(g_direct_hash,
	286	g_direct_equal, NULL,
	287	(GDestroyNotify) declaration_unref);
	288	scope->variant_declarations = g_hash_table_new_full(g_direct_hash,
	289	g_direct_equal, NULL,
	290	(GDestroyNotify) declaration_unref);
	291	scope->enum_declarations = g_hash_table_new_full(g_direct_hash,
	292	g_direct_equal, NULL,
	293	(GDestroyNotify) declaration_unref);
	294	scope->parent_scope = parent_scope;
	295	return scope;
	296	}
	297
	298	void free_declaration_scope(struct declaration_scope *scope)
	299	{
	300	g_hash_table_destroy(scope->enum_declarations);
	301	g_hash_table_destroy(scope->variant_declarations);
	302	g_hash_table_destroy(scope->struct_declarations);
	303	g_hash_table_destroy(scope->typedef_declarations);
	304	g_free(scope);
	305	}
	306
	307	static
	308	struct declaration_struct *lookup_struct_declaration_scope(GQuark struct_name,
	309	struct declaration_scope *scope)
	310	{
	311	return g_hash_table_lookup(scope->struct_declarations,
	312	(gconstpointer) (unsigned long) struct_name);
	313	}
	314
	315	struct declaration_struct *lookup_struct_declaration(GQuark struct_name,
	316	struct declaration_scope *scope)
	317	{
	318	struct declaration_struct *declaration;
	319
	320	while (scope) {
	321	declaration = lookup_struct_declaration_scope(struct_name, scope);
	322	if (declaration)
	323	return declaration;
	324	scope = scope->parent_scope;
	325	}
	326	return NULL;
	327	}
	328
	329	int register_struct_declaration(GQuark struct_name,
	330	struct declaration_struct *struct_declaration,
	331	struct declaration_scope *scope)
	332	{
	333	GQuark prefix_name;
	334	int ret;
	335
	336	if (!struct_name)
	337	return -EPERM;
	338
	339	/* Only lookup in local scope */
	340	if (lookup_struct_declaration_scope(struct_name, scope))
	341	return -EEXIST;
	342
	343	g_hash_table_insert(scope->struct_declarations,
	344	(gpointer) (unsigned long) struct_name,
	345	struct_declaration);
	346	declaration_ref(&struct_declaration->p);
	347
	348	/* Also add in typedef/typealias scopes */
	349	prefix_name = prefix_quark("struct ", struct_name);
	350	ret = register_declaration(prefix_name, &struct_declaration->p, scope);
	351	assert(!ret);
	352	return 0;
	353	}
	354
	355	static
	356	struct declaration_untagged_variant *
	357	lookup_variant_declaration_scope(GQuark variant_name,
	358	struct declaration_scope *scope)
	359	{
	360	return g_hash_table_lookup(scope->variant_declarations,
	361	(gconstpointer) (unsigned long) variant_name);
	362	}
	363
	364	struct declaration_untagged_variant *
	365	lookup_variant_declaration(GQuark variant_name,
	366	struct declaration_scope *scope)
	367	{
	368	struct declaration_untagged_variant *declaration;
	369
	370	while (scope) {
	371	declaration = lookup_variant_declaration_scope(variant_name, scope);
	372	if (declaration)
	373	return declaration;
	374	scope = scope->parent_scope;
	375	}
	376	return NULL;
	377	}
	378
	379	int register_variant_declaration(GQuark variant_name,
	380	struct declaration_untagged_variant *untagged_variant_declaration,
	381	struct declaration_scope *scope)
	382	{
	383	GQuark prefix_name;
	384	int ret;
	385
	386	if (!variant_name)
	387	return -EPERM;
	388
	389	/* Only lookup in local scope */
	390	if (lookup_variant_declaration_scope(variant_name, scope))
	391	return -EEXIST;
	392
	393	g_hash_table_insert(scope->variant_declarations,
	394	(gpointer) (unsigned long) variant_name,
	395	untagged_variant_declaration);
	396	declaration_ref(&untagged_variant_declaration->p);
	397
	398	/* Also add in typedef/typealias scopes */
	399	prefix_name = prefix_quark("variant ", variant_name);
	400	ret = register_declaration(prefix_name,
	401	&untagged_variant_declaration->p, scope);
	402	assert(!ret);
	403	return 0;
	404	}
	405
	406	static
	407	struct declaration_enum *
	408	lookup_enum_declaration_scope(GQuark enum_name,
	409	struct declaration_scope *scope)
	410	{
	411	return g_hash_table_lookup(scope->enum_declarations,
	412	(gconstpointer) (unsigned long) enum_name);
	413	}
	414
	415	struct declaration_enum *
	416	lookup_enum_declaration(GQuark enum_name,
	417	struct declaration_scope *scope)
	418	{
	419	struct declaration_enum *declaration;
	420
	421	while (scope) {
	422	declaration = lookup_enum_declaration_scope(enum_name, scope);
	423	if (declaration)
	424	return declaration;
	425	scope = scope->parent_scope;
	426	}
	427	return NULL;
	428	}
	429
	430	int register_enum_declaration(GQuark enum_name,
	431	struct declaration_enum *enum_declaration,
	432	struct declaration_scope *scope)
	433	{
	434	GQuark prefix_name;
	435	int ret;
	436
	437	if (!enum_name)
	438	return -EPERM;
	439
	440	/* Only lookup in local scope */
	441	if (lookup_enum_declaration_scope(enum_name, scope))
	442	return -EEXIST;
	443
	444	g_hash_table_insert(scope->enum_declarations,
	445	(gpointer) (unsigned long) enum_name,
	446	enum_declaration);
	447	declaration_ref(&enum_declaration->p);
	448
	449	/* Also add in typedef/typealias scopes */
	450	prefix_name = prefix_quark("enum ", enum_name);
	451	ret = register_declaration(prefix_name, &enum_declaration->p, scope);
	452	assert(!ret);
	453	return 0;
	454	}
	455
	456	static struct definition_scope *
	457	_new_definition_scope(struct definition_scope *parent_scope,
	458	int scope_path_len)
	459	{
	460	struct definition_scope *scope = g_new(struct definition_scope, 1);
	461
	462	scope->definitions = g_hash_table_new_full(g_direct_hash,
	463	g_direct_equal, NULL,
	464	(GDestroyNotify) definition_unref);
	465	scope->parent_scope = parent_scope;
	466	scope->scope_path = g_array_sized_new(FALSE, TRUE, sizeof(GQuark),
	467	scope_path_len);
	468	g_array_set_size(scope->scope_path, scope_path_len);
	469	return scope;
	470	}
	471
	472	struct definition_scope *
	473	new_definition_scope(struct definition_scope *parent_scope,
	474	GQuark field_name)
	475	{
	476	struct definition_scope *scope;
	477	int scope_path_len = 1;
	478
	479	if (parent_scope)
	480	scope_path_len += parent_scope->scope_path->len;
	481	scope = _new_definition_scope(parent_scope, scope_path_len);
	482	if (parent_scope)
	483	memcpy(scope->scope_path, parent_scope->scope_path,
	484	sizeof(GQuark) * (scope_path_len - 1));
	485	g_array_index(scope->scope_path, GQuark, scope_path_len - 1) =
	486	field_name;
	487	return scope;
	488	}
	489
	490	/*
	491	* in: path (dot separated), out: q (GArray of GQuark)
	492	*/
	493	void append_scope_path(const char path, GArray q)
	494	{
	495	const char ptrbegin, ptrend = path;
	496	GQuark quark;
	497
	498	for (;;) {
	499	char *str;
	500	size_t len;
	501
	502	ptrbegin = ptrend;
	503	ptrend = strchr(ptrbegin, '.');
	504	if (!ptrend)
	505	break;
	506	len = ptrend - ptrbegin;
	507	/* Don't accept two consecutive dots */
	508	assert(len != 0);
	509	str = g_new(char, len + 1); /* include \0 */
	510	memcpy(str, ptrbegin, len);
	511	str[len] = '\0';
	512	quark = g_quark_from_string(str);
	513	g_array_append_val(q, quark);
	514	g_free(str);
	515	ptrend++; /* skip current dot */
	516	}
	517	/* last. Check for trailing dot (and discard). */
	518	if (ptrbegin[0] != '\0') {
	519	quark = g_quark_from_string(ptrbegin);
	520	g_array_append_val(q, quark);
	521	}
	522	}
	523
	524	void set_dynamic_definition_scope(struct definition *definition,
	525	struct definition_scope *scope,
	526	const char *root_name)
	527	{
	528	g_array_set_size(scope->scope_path, 0);
	529	append_scope_path(root_name, scope->scope_path);
	530	/*
	531	* Use INT_MAX order to ensure that all fields of the parent
	532	* scope are seen as being prior to this scope.
	533	*/
	534	definition->index = INT_MAX;
	535	}
	536
	537	void free_definition_scope(struct definition_scope *scope)
	538	{
	539	g_array_free(scope->scope_path, TRUE);
	540	g_hash_table_destroy(scope->definitions);
	541	g_free(scope);
	542	}