[lttng-tools.git] / src / lib / lttng-ctl / filter-visitor-set-parent.c

/*
 * filter-visitor-set-parent.c
 *
 * LTTng filter set parent visitor
 *
 * Copyright 2012 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
 *
 * This library is free software; you can redistribute it and/or modify it
 * under the terms of the GNU Lesser General Public License, version 2.1 only,
 * as published by the Free Software Foundation.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public License
 * along with this library; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
 */

#include <stdio.h>
#include <unistd.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <errno.h>
#include <inttypes.h>
#include "filter-parser.h"
#include "filter-ast.h"

static
int update_child(struct filter_node *parent,
		struct filter_node *old_child,
		struct filter_node *new_child)
{
	switch (parent->type) {
	case NODE_UNKNOWN:
	default:
		fprintf(stderr, "[error] %s: unknown node type\n", __func__);
		return -EINVAL;
	case NODE_ROOT:
		assert(parent->u.root.child == old_child);
		parent->u.root.child = new_child;
		break;
	case NODE_EXPRESSION:
		assert(parent->u.expression.type == AST_EXP_NESTED);
		assert(parent->u.expression.u.child == old_child);
		parent->u.expression.u.child = new_child;
		break;
	case NODE_OP:
		assert(parent->u.op.lchild == old_child ||
			parent->u.op.rchild == old_child);
		if (parent->u.op.lchild == old_child)
			parent->u.op.lchild = new_child;
		else
			parent->u.op.rchild = new_child;
		break;
	case NODE_UNARY_OP:
		assert(parent->u.unary_op.child == old_child);
		parent->u.unary_op.child = new_child;
		break;
	}
	return 0;
}

static
int recursive_visit_set_parent(struct filter_node *node,
			struct filter_node *parent)
{
	int ret;

	if (!node) {
		fprintf(stderr, "[error] %s: NULL child\n", __func__);
		return -EINVAL;
	}
	node->parent = parent;
	switch (node->type) {
	case NODE_UNKNOWN:
	default:
		fprintf(stderr, "[error] %s: unknown node type\n", __func__);
		return -EINVAL;
	case NODE_ROOT:
		assert(parent == NULL);
		return recursive_visit_set_parent(node->u.root.child, node);
	case NODE_EXPRESSION:
		switch (node->u.expression.type) {
		case AST_EXP_UNKNOWN:
		default:
			fprintf(stderr, "[error] %s: unknown expression type\n", __func__);
			return -EINVAL;
		case AST_EXP_NESTED:
			return recursive_visit_set_parent(node->u.expression.u.child, node);
		case AST_EXP_IDENTIFIER:
			{
				struct filter_node *orig_node = node;

				while (node->u.expression.prev) {
					struct filter_node *prev;

					prev = node->u.expression.prev;
					if (prev->type != NODE_EXPRESSION ||
						prev->u.expression.type != AST_EXP_IDENTIFIER) {
						fprintf(stderr, "[error] %s: expecting identifier before link\n", __func__);
						return -EINVAL;
					}

					prev->u.expression.next = node;
					prev->u.expression.pre_op =
						node->u.expression.post_op;
					prev->parent = node->parent;
					node = prev;
				}
				/* Set first child as forward */
				ret = update_child(parent, orig_node, node);
				if (ret)
					return ret;
			}
		case AST_EXP_CONSTANT:
		case AST_EXP_FLOAT_CONSTANT:
		case AST_EXP_STRING:
			break;
		}
		break;
	case NODE_OP:
		ret = recursive_visit_set_parent(node->u.op.lchild, node);
		if (ret)
			return ret;
		return recursive_visit_set_parent(node->u.op.rchild, node);
	case NODE_UNARY_OP:
		return recursive_visit_set_parent(node->u.unary_op.child, node);
	}
	return 0;
}

int filter_visitor_set_parent(struct filter_parser_ctx *ctx)
{
	return recursive_visit_set_parent(&ctx->ast->root, NULL);
}
Commit	Line	Data
953192ba MD	1	/*
	2	* filter-visitor-set-parent.c
	3	*
	4	* LTTng filter set parent visitor
	5	*
	6	* Copyright 2012 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
	7	*
	8	* This library is free software; you can redistribute it and/or modify it
	9	* under the terms of the GNU Lesser General Public License, version 2.1 only,
	10	* as published by the Free Software Foundation.
	11	*
	12	* This library is distributed in the hope that it will be useful,
	13	* but WITHOUT ANY WARRANTY; without even the implied warranty of
	14	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
	15	* Lesser General Public License for more details.
	16	*
	17	* You should have received a copy of the GNU Lesser General Public License
	18	* along with this library; if not, write to the Free Software Foundation,
	19	* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
	20	*/
	21
	22	#include <stdio.h>
	23	#include <unistd.h>
	24	#include <string.h>
	25	#include <stdlib.h>
	26	#include <assert.h>
	27	#include <errno.h>
	28	#include <inttypes.h>
	29	#include "filter-parser.h"
	30	#include "filter-ast.h"
	31
	32	static
	33	int update_child(struct filter_node *parent,
	34	struct filter_node *old_child,
	35	struct filter_node *new_child)
	36	{
	37	switch (parent->type) {
	38	case NODE_UNKNOWN:
	39	default:
	40	fprintf(stderr, "[error] %s: unknown node type\n", __func__);
	41	return -EINVAL;
	42	case NODE_ROOT:
	43	assert(parent->u.root.child == old_child);
	44	parent->u.root.child = new_child;
	45	break;
	46	case NODE_EXPRESSION:
	47	assert(parent->u.expression.type == AST_EXP_NESTED);
	48	assert(parent->u.expression.u.child == old_child);
	49	parent->u.expression.u.child = new_child;
	50	break;
	51	case NODE_OP:
	52	assert(parent->u.op.lchild == old_child \|\|
	53	parent->u.op.rchild == old_child);
	54	if (parent->u.op.lchild == old_child)
	55	parent->u.op.lchild = new_child;
	56	else
	57	parent->u.op.rchild = new_child;
	58	break;
	59	case NODE_UNARY_OP:
	60	assert(parent->u.unary_op.child == old_child);
	61	parent->u.unary_op.child = new_child;
	62	break;
	63	}
	64	return 0;
65	}
66
67	static
68	int recursive_visit_set_parent(struct filter_node *node,
69	struct filter_node *parent)
70	{
71	int ret;
72
73	if (!node) {
74	fprintf(stderr, "[error] %s: NULL child\n", __func__);
75	return -EINVAL;
76	}
77	node->parent = parent;
78	switch (node->type) {
79	case NODE_UNKNOWN:
80	default:
81	fprintf(stderr, "[error] %s: unknown node type\n", __func__);
82	return -EINVAL;
83	case NODE_ROOT:
84	assert(parent == NULL);
85	return recursive_visit_set_parent(node->u.root.child, node);
86	case NODE_EXPRESSION:
87	switch (node->u.expression.type) {
88	case AST_EXP_UNKNOWN:
89	default:
90	fprintf(stderr, "[error] %s: unknown expression type\n", __func__);
91	return -EINVAL;
92	case AST_EXP_NESTED:
93	return recursive_visit_set_parent(node->u.expression.u.child, node);
94	case AST_EXP_IDENTIFIER:
95	{
96	struct filter_node *orig_node = node;
97
98	while (node->u.expression.prev) {
99	struct filter_node *prev;
100
101	prev = node->u.expression.prev;
102	if (prev->type != NODE_EXPRESSION \|\|
103	prev->u.expression.type != AST_EXP_IDENTIFIER) {
104	fprintf(stderr, "[error] %s: expecting identifier before link\n", __func__);
105	return -EINVAL;
106	}
107
108	prev->u.expression.next = node;
109	prev->u.expression.pre_op =
110	node->u.expression.post_op;
111	prev->parent = node->parent;
112	node = prev;
113	}
114	/* Set first child as forward */
115	ret = update_child(parent, orig_node, node);
116	if (ret)
117	return ret;
118	}
119	case AST_EXP_CONSTANT:
e90d8561	120	case AST_EXP_FLOAT_CONSTANT:
953192ba MD	121	case AST_EXP_STRING:
	122	break;
	123	}
	124	break;
	125	case NODE_OP:
	126	ret = recursive_visit_set_parent(node->u.op.lchild, node);
	127	if (ret)
	128	return ret;
	129	return recursive_visit_set_parent(node->u.op.rchild, node);
	130	case NODE_UNARY_OP:
	131	return recursive_visit_set_parent(node->u.unary_op.child, node);
	132	}
	133	return 0;
	134	}
	135
	136	int filter_visitor_set_parent(struct filter_parser_ctx *ctx)
	137	{
	138	return recursive_visit_set_parent(&ctx->ast->root, NULL);
	139	}