[lttng-tools.git] / src / lib / lttng-ctl / filter / filter-parser.y

%{
/*
 * filter-parser.y
 *
 * LTTng filter expression parser
 *
 * 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
 *
 * Grammar inspired from http://www.quut.com/c/ANSI-C-grammar-y.html
 */

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

#include <common/macros.h>

#define WIDTH_u64_SCANF_IS_A_BROKEN_API	"20"
#define WIDTH_o64_SCANF_IS_A_BROKEN_API	"22"
#define WIDTH_x64_SCANF_IS_A_BROKEN_API	"17"
#define WIDTH_lg_SCANF_IS_A_BROKEN_API	"4096"	/* Hugely optimistic approximation */

LTTNG_HIDDEN
int yydebug;
LTTNG_HIDDEN
int filter_parser_debug = 0;

LTTNG_HIDDEN
int yyparse(struct filter_parser_ctx *parser_ctx, yyscan_t scanner);
LTTNG_HIDDEN
int yylex(union YYSTYPE *yyval, yyscan_t scanner);
LTTNG_HIDDEN
int yylex_init_extra(struct filter_parser_ctx *parser_ctx, yyscan_t * ptr_yy_globals);
LTTNG_HIDDEN
int yylex_destroy(yyscan_t yyparser_ctx);
LTTNG_HIDDEN
void yyrestart(FILE * in_str, yyscan_t parser_ctx);

struct gc_string {
	struct cds_list_head gc;
	size_t alloclen;
	char s[];
};

static const char *node_type_to_str[] = {
	[ NODE_UNKNOWN ] = "NODE_UNKNOWN",
	[ NODE_ROOT ] = "NODE_ROOT",
	[ NODE_EXPRESSION ] = "NODE_EXPRESSION",
	[ NODE_OP ] = "NODE_OP",
	[ NODE_UNARY_OP ] = "NODE_UNARY_OP",
};

LTTNG_HIDDEN
const char *node_type(struct filter_node *node)
{
	if (node->type < NR_NODE_TYPES)
		return node_type_to_str[node->type];
	else
		return NULL;
}

static struct gc_string *gc_string_alloc(struct filter_parser_ctx *parser_ctx,
					 size_t len)
{
	struct gc_string *gstr;
	size_t alloclen;

	/* TODO: could be faster with find first bit or glib Gstring */
	/* sizeof long to account for malloc header (int or long ?) */
	for (alloclen = 8; alloclen < sizeof(long) + sizeof(*gstr) + len;
	     alloclen *= 2);

	gstr = zmalloc(alloclen);
	if (!gstr) {
		goto end;
	}
	cds_list_add(&gstr->gc, &parser_ctx->allocated_strings);
	gstr->alloclen = alloclen;
end:
	return gstr;
}

/*
 * note: never use gc_string_append on a string that has external references.
 * gsrc will be garbage collected immediately, and gstr might be.
 * Should only be used to append characters to a string literal or constant.
 */
LTTNG_HIDDEN
struct gc_string *gc_string_append(struct filter_parser_ctx *parser_ctx,
				   struct gc_string *gstr,
				   struct gc_string *gsrc)
{
	size_t newlen = strlen(gsrc->s) + strlen(gstr->s) + 1;
	size_t alloclen;

	/* TODO: could be faster with find first bit or glib Gstring */
	/* sizeof long to account for malloc header (int or long ?) */
	for (alloclen = 8; alloclen < sizeof(long) + sizeof(*gstr) + newlen;
	     alloclen *= 2);

	if (alloclen > gstr->alloclen) {
		struct gc_string *newgstr;

		newgstr = gc_string_alloc(parser_ctx, newlen);
		strcpy(newgstr->s, gstr->s);
		strcat(newgstr->s, gsrc->s);
		cds_list_del(&gstr->gc);
		free(gstr);
		gstr = newgstr;
	} else {
		strcat(gstr->s, gsrc->s);
	}
	cds_list_del(&gsrc->gc);
	free(gsrc);
	return gstr;
}

LTTNG_HIDDEN
void setstring(struct filter_parser_ctx *parser_ctx, YYSTYPE *lvalp, const char *src)
{
	lvalp->gs = gc_string_alloc(parser_ctx, strlen(src) + 1);
	strcpy(lvalp->gs->s, src);
}

static struct filter_node *make_node(struct filter_parser_ctx *scanner,
				  enum node_type type)
{
	struct filter_ast *ast = filter_parser_get_ast(scanner);
	struct filter_node *node;

	node = zmalloc(sizeof(*node));
	if (!node)
		return NULL;
	memset(node, 0, sizeof(*node));
	node->type = type;
	cds_list_add(&node->gc, &ast->allocated_nodes);

	switch (type) {
	case NODE_ROOT:
		fprintf(stderr, "[error] %s: trying to create root node\n", __func__);
		break;

	case NODE_EXPRESSION:
		break;
	case NODE_OP:
		break;
	case NODE_UNARY_OP:
		break;

	case NODE_UNKNOWN:
	default:
		fprintf(stderr, "[error] %s: unknown node type %d\n", __func__,
			(int) type);
		break;
	}

	return node;
}

static struct filter_node *make_op_node(struct filter_parser_ctx *scanner,
			enum op_type type,
			struct filter_node *lchild,
			struct filter_node *rchild)
{
	struct filter_ast *ast = filter_parser_get_ast(scanner);
	struct filter_node *node;

	node = zmalloc(sizeof(*node));
	if (!node)
		return NULL;
	memset(node, 0, sizeof(*node));
	node->type = NODE_OP;
	cds_list_add(&node->gc, &ast->allocated_nodes);
	node->u.op.type = type;
	node->u.op.lchild = lchild;
	node->u.op.rchild = rchild;
	return node;
}

LTTNG_HIDDEN
void yyerror(struct filter_parser_ctx *parser_ctx, yyscan_t scanner, const char *str)
{
	fprintf(stderr, "error %s\n", str);
}
 
LTTNG_HIDDEN
int yywrap(void)
{
	return 1;
} 

#define parse_error(parser_ctx, str)				\
do {								\
	yyerror(parser_ctx, parser_ctx->scanner, YY_("parse error: " str "\n"));	\
	YYERROR;						\
} while (0)

static void free_strings(struct cds_list_head *list)
{
	struct gc_string *gstr, *tmp;

	cds_list_for_each_entry_safe(gstr, tmp, list, gc)
		free(gstr);
}

static struct filter_ast *filter_ast_alloc(void)
{
	struct filter_ast *ast;

	ast = zmalloc(sizeof(*ast));
	if (!ast)
		return NULL;
	memset(ast, 0, sizeof(*ast));
	CDS_INIT_LIST_HEAD(&ast->allocated_nodes);
	ast->root.type = NODE_ROOT;
	return ast;
}

static void filter_ast_free(struct filter_ast *ast)
{
	struct filter_node *node, *tmp;

	cds_list_for_each_entry_safe(node, tmp, &ast->allocated_nodes, gc)
		free(node);
	free(ast);
}

LTTNG_HIDDEN
int filter_parser_ctx_append_ast(struct filter_parser_ctx *parser_ctx)
{
	return yyparse(parser_ctx, parser_ctx->scanner);
}

LTTNG_HIDDEN
struct filter_parser_ctx *filter_parser_ctx_alloc(FILE *input)
{
	struct filter_parser_ctx *parser_ctx;
	int ret;

	yydebug = filter_parser_debug;

	parser_ctx = zmalloc(sizeof(*parser_ctx));
	if (!parser_ctx)
		return NULL;
	memset(parser_ctx, 0, sizeof(*parser_ctx));

	ret = yylex_init_extra(parser_ctx, &parser_ctx->scanner);
	if (ret) {
		fprintf(stderr, "yylex_init error\n");
		goto cleanup_parser_ctx;
	}
	/* Start processing new stream */
	yyrestart(input, parser_ctx->scanner);

	parser_ctx->ast = filter_ast_alloc();
	if (!parser_ctx->ast)
		goto cleanup_lexer;
	CDS_INIT_LIST_HEAD(&parser_ctx->allocated_strings);

	if (yydebug)
		fprintf(stdout, "parser_ctx input is a%s.\n",
			isatty(fileno(input)) ? "n interactive tty" :
						" noninteractive file");

	return parser_ctx;

cleanup_lexer:
	ret = yylex_destroy(parser_ctx->scanner);
	if (!ret)
		fprintf(stderr, "yylex_destroy error\n");
cleanup_parser_ctx:
	free(parser_ctx);
	return NULL;
}

LTTNG_HIDDEN
void filter_parser_ctx_free(struct filter_parser_ctx *parser_ctx)
{
	int ret;

	ret = yylex_destroy(parser_ctx->scanner);
	if (ret)
		fprintf(stderr, "yylex_destroy error\n");

	filter_ast_free(parser_ctx->ast);
	free_strings(&parser_ctx->allocated_strings);
	filter_ir_free(parser_ctx);
	free(parser_ctx->bytecode);
	free(parser_ctx->bytecode_reloc);

	free(parser_ctx);
}

%}

%define api.pure
	/* %locations */
%parse-param {struct filter_parser_ctx *parser_ctx}
%parse-param {yyscan_t scanner}
%lex-param {yyscan_t scanner}
%start translation_unit
%token CHARACTER_CONSTANT_START SQUOTE STRING_LITERAL_START DQUOTE
%token ESCSEQ CHAR_STRING_TOKEN
%token DECIMAL_CONSTANT OCTAL_CONSTANT HEXADECIMAL_CONSTANT FLOAT_CONSTANT
%token LSBRAC RSBRAC LPAREN RPAREN LBRAC RBRAC RARROW
%token STAR PLUS MINUS
%token MOD_OP DIV_OP RIGHT_OP LEFT_OP
%token EQ_OP NE_OP LE_OP GE_OP LT_OP GT_OP AND_OP OR_OP NOT_OP
%token ASSIGN COLON SEMICOLON DOTDOTDOT DOT EQUAL COMMA
%token XOR_BIN AND_BIN OR_BIN NOT_BIN

%token <gs> IDENTIFIER GLOBAL_IDENTIFIER
%token ERROR
%union
{
	long long ll;
	char c;
	struct gc_string *gs;
	struct filter_node *n;
}

%type <gs> s_char s_char_sequence c_char c_char_sequence

%type <n> primary_expression
%type <n> prefix_expression
%type <n> prefix_expression_rec
%type <n> postfix_expression
%type <n> unary_expression
%type <n> unary_operator
%type <n> multiplicative_expression
%type <n> additive_expression
%type <n> shift_expression
%type <n> relational_expression
%type <n> equality_expression
%type <n> and_expression
%type <n> exclusive_or_expression
%type <n> inclusive_or_expression
%type <n> logical_and_expression
%type <n> logical_or_expression
%type <n> expression
%type <n> identifiers

%%


/* 1.5 Constants */

c_char_sequence:
		c_char
		{	$$ = $1;					}
	|	c_char_sequence c_char
		{	$$ = gc_string_append(parser_ctx, $1, $2);		}
	;

c_char:
		CHAR_STRING_TOKEN
		{	$$ = yylval.gs;					}
	|	ESCSEQ
		{
			parse_error(parser_ctx, "escape sequences not supported yet");
		}
	;

/* 1.6 String literals */

s_char_sequence:
		s_char
		{	$$ = $1;					}
	|	s_char_sequence s_char
		{	$$ = gc_string_append(parser_ctx, $1, $2);		}
	;

s_char:
		CHAR_STRING_TOKEN
		{	$$ = yylval.gs;					}
	|	ESCSEQ
		{
			parse_error(parser_ctx, "escape sequences not supported yet");
		}
	;

primary_expression:
		DECIMAL_CONSTANT
		{
			$$ = make_node(parser_ctx, NODE_EXPRESSION);
			$$->u.expression.type = AST_EXP_CONSTANT;
			if (sscanf(yylval.gs->s, "%" WIDTH_u64_SCANF_IS_A_BROKEN_API SCNu64,
					&$$->u.expression.u.constant) != 1) {
				parse_error(parser_ctx, "cannot scanf decimal constant");
			}
		}
	|	OCTAL_CONSTANT
		{
			$$ = make_node(parser_ctx, NODE_EXPRESSION);
			$$->u.expression.type = AST_EXP_CONSTANT;
			if (!strcmp(yylval.gs->s, "0")) {
				$$->u.expression.u.constant = 0;
			} else if (sscanf(yylval.gs->s, "0%" WIDTH_o64_SCANF_IS_A_BROKEN_API SCNo64,
					&$$->u.expression.u.constant) != 1) {
				parse_error(parser_ctx, "cannot scanf octal constant");
			}
		}
	|	HEXADECIMAL_CONSTANT
		{
			$$ = make_node(parser_ctx, NODE_EXPRESSION);
			$$->u.expression.type = AST_EXP_CONSTANT;
			if (sscanf(yylval.gs->s, "0x%" WIDTH_x64_SCANF_IS_A_BROKEN_API SCNx64,
					&$$->u.expression.u.constant) != 1) {
				parse_error(parser_ctx, "cannot scanf hexadecimal constant");
			}
		}
	|	FLOAT_CONSTANT
		{
			$$ = make_node(parser_ctx, NODE_EXPRESSION);
			$$->u.expression.type = AST_EXP_FLOAT_CONSTANT;
			if (sscanf(yylval.gs->s, "%" WIDTH_lg_SCANF_IS_A_BROKEN_API "lg",
					&$$->u.expression.u.float_constant) != 1) {
				parse_error(parser_ctx, "cannot scanf float constant");
			}
		}
	|	STRING_LITERAL_START DQUOTE
		{
			$$ = make_node(parser_ctx, NODE_EXPRESSION);
			$$->u.expression.type = AST_EXP_STRING;
			$$->u.expression.u.string = "";
		}
	|	STRING_LITERAL_START s_char_sequence DQUOTE
		{
			$$ = make_node(parser_ctx, NODE_EXPRESSION);
			$$->u.expression.type = AST_EXP_STRING;
			$$->u.expression.u.string = $2->s;
		}
	|	CHARACTER_CONSTANT_START c_char_sequence SQUOTE
		{
			$$ = make_node(parser_ctx, NODE_EXPRESSION);
			$$->u.expression.type = AST_EXP_STRING;
			$$->u.expression.u.string = $2->s;
		}
	|	LPAREN expression RPAREN
		{
			$$ = make_node(parser_ctx, NODE_EXPRESSION);
			$$->u.expression.type = AST_EXP_NESTED;
			$$->u.expression.u.child = $2;
		}
	;

identifiers
	:	IDENTIFIER
		{
			$$ = make_node(parser_ctx, NODE_EXPRESSION);
			$$->u.expression.type = AST_EXP_IDENTIFIER;
			$$->u.expression.u.identifier = yylval.gs->s;
		}
	|	GLOBAL_IDENTIFIER
		{
			$$ = make_node(parser_ctx, NODE_EXPRESSION);
			$$->u.expression.type = AST_EXP_GLOBAL_IDENTIFIER;
			$$->u.expression.u.identifier = yylval.gs->s;
		}
	;

prefix_expression_rec
	: LSBRAC unary_expression RSBRAC
		{
			$$ = $2;
		}
	| LSBRAC unary_expression RSBRAC prefix_expression_rec
		{
			$$ = $2;
			$$->u.expression.pre_op = AST_LINK_BRACKET;
			$$->u.expression.prev = $4;
		}
	;

prefix_expression
	: identifiers
		{
			$$ = $1;
		}
	| identifiers prefix_expression_rec
		{
			$$ = $1;
			$$->u.expression.pre_op = AST_LINK_BRACKET;
			$$->u.expression.next_bracket = $2;
		}
	;

postfix_expression
	: prefix_expression
		{
			$$ = $1;
		}
	| postfix_expression DOT prefix_expression
		{
			$$ = $3;
			$$->u.expression.post_op = AST_LINK_DOT;
			$$->u.expression.prev = $1;
		}
	| postfix_expression RARROW prefix_expression
		{
			$$ = $3;
			$$->u.expression.post_op = AST_LINK_RARROW;
			$$->u.expression.prev = $1;
		}
	;

unary_expression
	: postfix_expression
		{	$$ = $1;					}
	| primary_expression
		{	$$ = $1;					}
	| unary_operator unary_expression
		{
			$$ = $1;
			$$->u.unary_op.child = $2;
		}
	;

unary_operator
	: PLUS
		{
			$$ = make_node(parser_ctx, NODE_UNARY_OP);
			$$->u.unary_op.type = AST_UNARY_PLUS;
		}
	| MINUS
		{
			$$ = make_node(parser_ctx, NODE_UNARY_OP);
			$$->u.unary_op.type = AST_UNARY_MINUS;
		}
	| NOT_OP
		{
			$$ = make_node(parser_ctx, NODE_UNARY_OP);
			$$->u.unary_op.type = AST_UNARY_NOT;
		}
	| NOT_BIN
		{
			$$ = make_node(parser_ctx, NODE_UNARY_OP);
			$$->u.unary_op.type = AST_UNARY_BIT_NOT;
		}
	;

multiplicative_expression
	: unary_expression
		{	$$ = $1;					}
	| multiplicative_expression STAR unary_expression
		{
			$$ = make_op_node(parser_ctx, AST_OP_MUL, $1, $3);
		}
	| multiplicative_expression DIV_OP unary_expression
		{
			$$ = make_op_node(parser_ctx, AST_OP_DIV, $1, $3);
		}
	| multiplicative_expression MOD_OP unary_expression
		{
			$$ = make_op_node(parser_ctx, AST_OP_MOD, $1, $3);
		}
	;

additive_expression
	: multiplicative_expression
		{	$$ = $1;					}
	| additive_expression PLUS multiplicative_expression
		{
			$$ = make_op_node(parser_ctx, AST_OP_PLUS, $1, $3);
		}
	| additive_expression MINUS multiplicative_expression
		{
			$$ = make_op_node(parser_ctx, AST_OP_MINUS, $1, $3);
		}
	;

shift_expression
	: additive_expression
		{	$$ = $1;					}
	| shift_expression LEFT_OP additive_expression
		{
			$$ = make_op_node(parser_ctx, AST_OP_BIT_LSHIFT, $1, $3);
		}
	| shift_expression RIGHT_OP additive_expression
		{
			$$ = make_op_node(parser_ctx, AST_OP_BIT_RSHIFT, $1, $3);
		}
	;

and_expression
	: shift_expression
		{	$$ = $1;					}
	| and_expression AND_BIN shift_expression
		{
			$$ = make_op_node(parser_ctx, AST_OP_BIT_AND, $1, $3);
		}
	;

exclusive_or_expression
	: and_expression
		{	$$ = $1;					}
	| exclusive_or_expression XOR_BIN and_expression
		{
			$$ = make_op_node(parser_ctx, AST_OP_BIT_XOR, $1, $3);
		}
	;

inclusive_or_expression
	: exclusive_or_expression
		{	$$ = $1;					}
	| inclusive_or_expression OR_BIN exclusive_or_expression
		{
			$$ = make_op_node(parser_ctx, AST_OP_BIT_OR, $1, $3);
		}
	;

relational_expression
	: inclusive_or_expression
		{	$$ = $1;					}
	| relational_expression LT_OP inclusive_or_expression
		{
			$$ = make_op_node(parser_ctx, AST_OP_LT, $1, $3);
		}
	| relational_expression GT_OP inclusive_or_expression
		{
			$$ = make_op_node(parser_ctx, AST_OP_GT, $1, $3);
		}
	| relational_expression LE_OP inclusive_or_expression
		{
			$$ = make_op_node(parser_ctx, AST_OP_LE, $1, $3);
		}
	| relational_expression GE_OP inclusive_or_expression
		{
			$$ = make_op_node(parser_ctx, AST_OP_GE, $1, $3);
		}
	;

equality_expression
	: relational_expression
		{	$$ = $1;					}
	| equality_expression EQ_OP relational_expression
		{
			$$ = make_op_node(parser_ctx, AST_OP_EQ, $1, $3);
		}
	| equality_expression NE_OP relational_expression
		{
			$$ = make_op_node(parser_ctx, AST_OP_NE, $1, $3);
		}
	;

logical_and_expression
	: equality_expression
		{	$$ = $1;					}
	| logical_and_expression AND_OP equality_expression
		{
			$$ = make_op_node(parser_ctx, AST_OP_AND, $1, $3);
		}
	;

logical_or_expression
	: logical_and_expression
		{	$$ = $1;					}
	| logical_or_expression OR_OP logical_and_expression
		{
			$$ = make_op_node(parser_ctx, AST_OP_OR, $1, $3);
		}
	;

expression
	: logical_or_expression
		{	$$ = $1;					}
	;

translation_unit
	: expression
		{
			parser_ctx->ast->root.u.root.child = $1;
		}
	;
Commit	Line	Data
953192ba MD	1	%{
	2	/*
	3	* filter-parser.y
	4	*
	5	* LTTng filter expression parser
	6	*
	7	* Copyright 2012 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
	8	*
	9	* This library is free software; you can redistribute it and/or modify it
	10	* under the terms of the GNU Lesser General Public License, version 2.1 only,
	11	* as published by the Free Software Foundation.
	12	*
	13	* This library is distributed in the hope that it will be useful,
	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
	16	* Lesser General Public License for more details.
	17	*
	18	* You should have received a copy of the GNU Lesser General Public License
	19	* along with this library; if not, write to the Free Software Foundation,
	20	* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
	21	*
	22	* Grammar inspired from http://www.quut.com/c/ANSI-C-grammar-y.html
	23	*/
	24
	25	#include <stdio.h>
	26	#include <unistd.h>
	27	#include <string.h>
	28	#include <stdlib.h>
	29	#include <assert.h>
	30	#include <errno.h>
	31	#include <inttypes.h>
953192ba	32	#include "filter-ast.h"
95b9bd90	33	#include "filter-parser.h"
953192ba	34
a187da1a DG	35	#include <common/macros.h>
a187da1a DG	36
8ab7c0d9 MD	37	#define WIDTH_u64_SCANF_IS_A_BROKEN_API "20"
	38	#define WIDTH_o64_SCANF_IS_A_BROKEN_API "22"
	39	#define WIDTH_x64_SCANF_IS_A_BROKEN_API "17"
	40	#define WIDTH_lg_SCANF_IS_A_BROKEN_API "4096" /* Hugely optimistic approximation */
	41
a187da1a	42	LTTNG_HIDDEN
953192ba	43	int yydebug;
a187da1a	44	LTTNG_HIDDEN
953192ba MD	45	int filter_parser_debug = 0;
953192ba MD	46
a187da1a	47	LTTNG_HIDDEN
9039edd4	48	int yyparse(struct filter_parser_ctx *parser_ctx, yyscan_t scanner);
a187da1a	49	LTTNG_HIDDEN
9039edd4	50	int yylex(union YYSTYPE *yyval, yyscan_t scanner);
a187da1a	51	LTTNG_HIDDEN
953192ba	52	int yylex_init_extra(struct filter_parser_ctx parser_ctx, yyscan_t ptr_yy_globals);
a187da1a	53	LTTNG_HIDDEN
953192ba	54	int yylex_destroy(yyscan_t yyparser_ctx);
a187da1a	55	LTTNG_HIDDEN
953192ba MD	56	void yyrestart(FILE * in_str, yyscan_t parser_ctx);
	57
	58	struct gc_string {
	59	struct cds_list_head gc;
	60	size_t alloclen;
	61	char s[];
	62	};
	63
	64	static const char *node_type_to_str[] = {
	65	[ NODE_UNKNOWN ] = "NODE_UNKNOWN",
	66	[ NODE_ROOT ] = "NODE_ROOT",
	67	[ NODE_EXPRESSION ] = "NODE_EXPRESSION",
	68	[ NODE_OP ] = "NODE_OP",
	69	[ NODE_UNARY_OP ] = "NODE_UNARY_OP",
	70	};
	71
a187da1a	72	LTTNG_HIDDEN
953192ba MD	73	const char node_type(struct filter_node node)
	74	{
	75	if (node->type < NR_NODE_TYPES)
	76	return node_type_to_str[node->type];
	77	else
	78	return NULL;
	79	}
	80
	81	static struct gc_string gc_string_alloc(struct filter_parser_ctx parser_ctx,
	82	size_t len)
	83	{
	84	struct gc_string *gstr;
	85	size_t alloclen;
	86
	87	/* TODO: could be faster with find first bit or glib Gstring */
	88	/* sizeof long to account for malloc header (int or long ?) */
	89	for (alloclen = 8; alloclen < sizeof(long) + sizeof(*gstr) + len;
	90	alloclen *= 2);
	91
be61ee34 MD	92	gstr = zmalloc(alloclen);
	93	if (!gstr) {
	94	goto end;
	95	}
953192ba MD	96	cds_list_add(&gstr->gc, &parser_ctx->allocated_strings);
953192ba MD	97	gstr->alloclen = alloclen;
be61ee34	98	end:
953192ba MD	99	return gstr;
	100	}
	101
	102	/*
	103	* note: never use gc_string_append on a string that has external references.
	104	* gsrc will be garbage collected immediately, and gstr might be.
	105	* Should only be used to append characters to a string literal or constant.
	106	*/
a187da1a	107	LTTNG_HIDDEN
953192ba MD	108	struct gc_string gc_string_append(struct filter_parser_ctx parser_ctx,
	109	struct gc_string *gstr,
	110	struct gc_string *gsrc)
	111	{
	112	size_t newlen = strlen(gsrc->s) + strlen(gstr->s) + 1;
	113	size_t alloclen;
	114
	115	/* TODO: could be faster with find first bit or glib Gstring */
	116	/* sizeof long to account for malloc header (int or long ?) */
	117	for (alloclen = 8; alloclen < sizeof(long) + sizeof(*gstr) + newlen;
	118	alloclen *= 2);
	119
	120	if (alloclen > gstr->alloclen) {
	121	struct gc_string *newgstr;
	122
	123	newgstr = gc_string_alloc(parser_ctx, newlen);
	124	strcpy(newgstr->s, gstr->s);
	125	strcat(newgstr->s, gsrc->s);
	126	cds_list_del(&gstr->gc);
	127	free(gstr);
	128	gstr = newgstr;
	129	} else {
	130	strcat(gstr->s, gsrc->s);
	131	}
	132	cds_list_del(&gsrc->gc);
	133	free(gsrc);
	134	return gstr;
	135	}
	136
a187da1a	137	LTTNG_HIDDEN
953192ba MD	138	void setstring(struct filter_parser_ctx parser_ctx, YYSTYPE lvalp, const char *src)
	139	{
	140	lvalp->gs = gc_string_alloc(parser_ctx, strlen(src) + 1);
	141	strcpy(lvalp->gs->s, src);
	142	}
	143
	144	static struct filter_node make_node(struct filter_parser_ctx scanner,
	145	enum node_type type)
	146	{
	147	struct filter_ast *ast = filter_parser_get_ast(scanner);
	148	struct filter_node *node;
	149
be61ee34	150	node = zmalloc(sizeof(*node));
953192ba MD	151	if (!node)
	152	return NULL;
	153	memset(node, 0, sizeof(*node));
	154	node->type = type;
	155	cds_list_add(&node->gc, &ast->allocated_nodes);
	156
	157	switch (type) {
	158	case NODE_ROOT:
	159	fprintf(stderr, "[error] %s: trying to create root node\n", __func__);
	160	break;
	161
	162	case NODE_EXPRESSION:
	163	break;
	164	case NODE_OP:
	165	break;
	166	case NODE_UNARY_OP:
	167	break;
	168
	169	case NODE_UNKNOWN:
	170	default:
	171	fprintf(stderr, "[error] %s: unknown node type %d\n", __func__,
	172	(int) type);
	173	break;
	174	}
	175
	176	return node;
	177	}
	178
	179	static struct filter_node make_op_node(struct filter_parser_ctx scanner,
	180	enum op_type type,
	181	struct filter_node *lchild,
	182	struct filter_node *rchild)
	183	{
	184	struct filter_ast *ast = filter_parser_get_ast(scanner);
	185	struct filter_node *node;
	186
be61ee34	187	node = zmalloc(sizeof(*node));
953192ba MD	188	if (!node)
	189	return NULL;
	190	memset(node, 0, sizeof(*node));
	191	node->type = NODE_OP;
	192	cds_list_add(&node->gc, &ast->allocated_nodes);
	193	node->u.op.type = type;
	194	node->u.op.lchild = lchild;
	195	node->u.op.rchild = rchild;
	196	return node;
	197	}
	198
a187da1a	199	LTTNG_HIDDEN
9039edd4	200	void yyerror(struct filter_parser_ctx parser_ctx, yyscan_t scanner, const char str)
953192ba MD	201	{
	202	fprintf(stderr, "error %s\n", str);
	203	}
	204
a187da1a	205	LTTNG_HIDDEN
953192ba MD	206	int yywrap(void)
	207	{
	208	return 1;
	209	}
	210
	211	#define parse_error(parser_ctx, str) \
	212	do { \
9039edd4	213	yyerror(parser_ctx, parser_ctx->scanner, YY_("parse error: " str "\n")); \
953192ba MD	214	YYERROR; \
	215	} while (0)
	216
	217	static void free_strings(struct cds_list_head *list)
	218	{
	219	struct gc_string gstr, tmp;
	220
	221	cds_list_for_each_entry_safe(gstr, tmp, list, gc)
	222	free(gstr);
	223	}
	224
	225	static struct filter_ast *filter_ast_alloc(void)
	226	{
	227	struct filter_ast *ast;
	228
be61ee34	229	ast = zmalloc(sizeof(*ast));
953192ba MD	230	if (!ast)
	231	return NULL;
	232	memset(ast, 0, sizeof(*ast));
	233	CDS_INIT_LIST_HEAD(&ast->allocated_nodes);
	234	ast->root.type = NODE_ROOT;
	235	return ast;
	236	}
	237
	238	static void filter_ast_free(struct filter_ast *ast)
	239	{
	240	struct filter_node node, tmp;
	241
	242	cds_list_for_each_entry_safe(node, tmp, &ast->allocated_nodes, gc)
	243	free(node);
37600d79	244	free(ast);
953192ba MD	245	}
953192ba MD	246
a187da1a	247	LTTNG_HIDDEN
953192ba MD	248	int filter_parser_ctx_append_ast(struct filter_parser_ctx *parser_ctx)
953192ba MD	249	{
9039edd4	250	return yyparse(parser_ctx, parser_ctx->scanner);
953192ba MD	251	}
953192ba MD	252
a187da1a	253	LTTNG_HIDDEN
953192ba MD	254	struct filter_parser_ctx filter_parser_ctx_alloc(FILE input)
	255	{
	256	struct filter_parser_ctx *parser_ctx;
	257	int ret;
	258
	259	yydebug = filter_parser_debug;
	260
be61ee34	261	parser_ctx = zmalloc(sizeof(*parser_ctx));
953192ba MD	262	if (!parser_ctx)
	263	return NULL;
	264	memset(parser_ctx, 0, sizeof(*parser_ctx));
	265
	266	ret = yylex_init_extra(parser_ctx, &parser_ctx->scanner);
	267	if (ret) {
	268	fprintf(stderr, "yylex_init error\n");
	269	goto cleanup_parser_ctx;
	270	}
	271	/* Start processing new stream */
	272	yyrestart(input, parser_ctx->scanner);
	273
	274	parser_ctx->ast = filter_ast_alloc();
	275	if (!parser_ctx->ast)
	276	goto cleanup_lexer;
	277	CDS_INIT_LIST_HEAD(&parser_ctx->allocated_strings);
	278
	279	if (yydebug)
	280	fprintf(stdout, "parser_ctx input is a%s.\n",
	281	isatty(fileno(input)) ? "n interactive tty" :
	282	" noninteractive file");
	283
	284	return parser_ctx;
	285
	286	cleanup_lexer:
	287	ret = yylex_destroy(parser_ctx->scanner);
	288	if (!ret)
	289	fprintf(stderr, "yylex_destroy error\n");
	290	cleanup_parser_ctx:
	291	free(parser_ctx);
	292	return NULL;
	293	}
	294
a187da1a	295	LTTNG_HIDDEN
953192ba MD	296	void filter_parser_ctx_free(struct filter_parser_ctx *parser_ctx)
	297	{
	298	int ret;
	299
953192ba MD	300	ret = yylex_destroy(parser_ctx->scanner);
	301	if (ret)
	302	fprintf(stderr, "yylex_destroy error\n");
52b9921d SM	303
	304	filter_ast_free(parser_ctx->ast);
	305	free_strings(&parser_ctx->allocated_strings);
	306	filter_ir_free(parser_ctx);
	307	free(parser_ctx->bytecode);
	308	free(parser_ctx->bytecode_reloc);
	309
953192ba MD	310	free(parser_ctx);
	311	}
	312
	313	%}
	314
	315	%define api.pure
	316	/* %locations */
	317	%parse-param {struct filter_parser_ctx *parser_ctx}
9039edd4 ZT	318	%parse-param {yyscan_t scanner}
9039edd4 ZT	319	%lex-param {yyscan_t scanner}
953192ba MD	320	%start translation_unit
	321	%token CHARACTER_CONSTANT_START SQUOTE STRING_LITERAL_START DQUOTE
	322	%token ESCSEQ CHAR_STRING_TOKEN
e90d8561	323	%token DECIMAL_CONSTANT OCTAL_CONSTANT HEXADECIMAL_CONSTANT FLOAT_CONSTANT
953192ba MD	324	%token LSBRAC RSBRAC LPAREN RPAREN LBRAC RBRAC RARROW
	325	%token STAR PLUS MINUS
	326	%token MOD_OP DIV_OP RIGHT_OP LEFT_OP
	327	%token EQ_OP NE_OP LE_OP GE_OP LT_OP GT_OP AND_OP OR_OP NOT_OP
	328	%token ASSIGN COLON SEMICOLON DOTDOTDOT DOT EQUAL COMMA
	329	%token XOR_BIN AND_BIN OR_BIN NOT_BIN
	330
586dc72f	331	%token <gs> IDENTIFIER GLOBAL_IDENTIFIER
953192ba MD	332	%token ERROR
	333	%union
	334	{
	335	long long ll;
	336	char c;
	337	struct gc_string *gs;
	338	struct filter_node *n;
	339	}
	340
	341	%type <gs> s_char s_char_sequence c_char c_char_sequence
	342
	343	%type <n> primary_expression
bff988fa MD	344	%type <n> prefix_expression
bff988fa MD	345	%type <n> prefix_expression_rec
953192ba MD	346	%type <n> postfix_expression
	347	%type <n> unary_expression
	348	%type <n> unary_operator
	349	%type <n> multiplicative_expression
	350	%type <n> additive_expression
	351	%type <n> shift_expression
	352	%type <n> relational_expression
	353	%type <n> equality_expression
	354	%type <n> and_expression
	355	%type <n> exclusive_or_expression
	356	%type <n> inclusive_or_expression
	357	%type <n> logical_and_expression
	358	%type <n> logical_or_expression
	359	%type <n> expression
bff988fa	360	%type <n> identifiers
953192ba MD	361
	362	%%
	363
	364
	365	/* 1.5 Constants */
	366
	367	c_char_sequence:
	368	c_char
	369	{ $$ = $1; }
	370	\| c_char_sequence c_char
	371	{ $$ = gc_string_append(parser_ctx, $1, $2); }
	372	;
	373
	374	c_char:
	375	CHAR_STRING_TOKEN
	376	{ $$ = yylval.gs; }
	377	\| ESCSEQ
	378	{
	379	parse_error(parser_ctx, "escape sequences not supported yet");
	380	}
	381	;
	382
	383	/* 1.6 String literals */
	384
	385	s_char_sequence:
	386	s_char
	387	{ $$ = $1; }
	388	\| s_char_sequence s_char
	389	{ $$ = gc_string_append(parser_ctx, $1, $2); }
	390	;
	391
	392	s_char:
	393	CHAR_STRING_TOKEN
	394	{ $$ = yylval.gs; }
	395	\| ESCSEQ
	396	{
	397	parse_error(parser_ctx, "escape sequences not supported yet");
	398	}
	399	;
	400
bff988fa MD	401	primary_expression:
bff988fa MD	402	DECIMAL_CONSTANT
953192ba MD	403	{
	404	$$ = make_node(parser_ctx, NODE_EXPRESSION);
	405	$$->u.expression.type = AST_EXP_CONSTANT;
8ab7c0d9 MD	406	if (sscanf(yylval.gs->s, "%" WIDTH_u64_SCANF_IS_A_BROKEN_API SCNu64,
	407	&$$->u.expression.u.constant) != 1) {
	408	parse_error(parser_ctx, "cannot scanf decimal constant");
	409	}
953192ba MD	410	}
	411	\| OCTAL_CONSTANT
	412	{
	413	$$ = make_node(parser_ctx, NODE_EXPRESSION);
	414	$$->u.expression.type = AST_EXP_CONSTANT;
8ab7c0d9 MD	415	if (!strcmp(yylval.gs->s, "0")) {
	416	$$->u.expression.u.constant = 0;
	417	} else if (sscanf(yylval.gs->s, "0%" WIDTH_o64_SCANF_IS_A_BROKEN_API SCNo64,
	418	&$$->u.expression.u.constant) != 1) {
	419	parse_error(parser_ctx, "cannot scanf octal constant");
	420	}
953192ba MD	421	}
	422	\| HEXADECIMAL_CONSTANT
	423	{
	424	$$ = make_node(parser_ctx, NODE_EXPRESSION);
	425	$$->u.expression.type = AST_EXP_CONSTANT;
8ab7c0d9 MD	426	if (sscanf(yylval.gs->s, "0x%" WIDTH_x64_SCANF_IS_A_BROKEN_API SCNx64,
	427	&$$->u.expression.u.constant) != 1) {
	428	parse_error(parser_ctx, "cannot scanf hexadecimal constant");
	429	}
953192ba	430	}
e90d8561 MD	431	\| FLOAT_CONSTANT
	432	{
	433	$$ = make_node(parser_ctx, NODE_EXPRESSION);
	434	$$->u.expression.type = AST_EXP_FLOAT_CONSTANT;
8ab7c0d9 MD	435	if (sscanf(yylval.gs->s, "%" WIDTH_lg_SCANF_IS_A_BROKEN_API "lg",
	436	&$$->u.expression.u.float_constant) != 1) {
	437	parse_error(parser_ctx, "cannot scanf float constant");
	438	}
e90d8561	439	}
953192ba MD	440	\| STRING_LITERAL_START DQUOTE
	441	{
	442	$$ = make_node(parser_ctx, NODE_EXPRESSION);
	443	$$->u.expression.type = AST_EXP_STRING;
	444	$$->u.expression.u.string = "";
	445	}
	446	\| STRING_LITERAL_START s_char_sequence DQUOTE
	447	{
	448	$$ = make_node(parser_ctx, NODE_EXPRESSION);
	449	$$->u.expression.type = AST_EXP_STRING;
	450	$$->u.expression.u.string = $2->s;
	451	}
	452	\| CHARACTER_CONSTANT_START c_char_sequence SQUOTE
	453	{
	454	$$ = make_node(parser_ctx, NODE_EXPRESSION);
	455	$$->u.expression.type = AST_EXP_STRING;
	456	$$->u.expression.u.string = $2->s;
	457	}
	458	\| LPAREN expression RPAREN
	459	{
	460	$$ = make_node(parser_ctx, NODE_EXPRESSION);
	461	$$->u.expression.type = AST_EXP_NESTED;
	462	$$->u.expression.u.child = $2;
	463	}
	464	;
	465
bff988fa MD	466	identifiers
	467	: IDENTIFIER
	468	{
	469	$$ = make_node(parser_ctx, NODE_EXPRESSION);
	470	$$->u.expression.type = AST_EXP_IDENTIFIER;
	471	$$->u.expression.u.identifier = yylval.gs->s;
	472	}
	473	\| GLOBAL_IDENTIFIER
	474	{
	475	$$ = make_node(parser_ctx, NODE_EXPRESSION);
	476	$$->u.expression.type = AST_EXP_GLOBAL_IDENTIFIER;
	477	$$->u.expression.u.identifier = yylval.gs->s;
	478	}
	479	;
	480
	481	prefix_expression_rec
	482	: LSBRAC unary_expression RSBRAC
	483	{
	484	$$ = $2;
	485	}
	486	\| LSBRAC unary_expression RSBRAC prefix_expression_rec
	487	{
	488	$$ = $2;
	489	$$->u.expression.pre_op = AST_LINK_BRACKET;
	490	$$->u.expression.prev = $4;
	491	}
	492	;
	493
	494	prefix_expression
	495	: identifiers
	496	{
	497	$$ = $1;
	498	}
	499	\| identifiers prefix_expression_rec
661dfdd1 MD	500	{
	501	$$ = $1;
	502	$$->u.expression.pre_op = AST_LINK_BRACKET;
bff988fa	503	$$->u.expression.next_bracket = $2;
661dfdd1	504	}
bff988fa MD	505	;
	506
	507	postfix_expression
	508	: prefix_expression
953192ba	509	{
bff988fa MD	510	$$ = $1;
	511	}
	512	\| postfix_expression DOT prefix_expression
	513	{
	514	$$ = $3;
953192ba	515	$$->u.expression.post_op = AST_LINK_DOT;
953192ba MD	516	$$->u.expression.prev = $1;
953192ba MD	517	}
bff988fa	518	\| postfix_expression RARROW prefix_expression
953192ba	519	{
bff988fa	520	$$ = $3;
953192ba	521	$$->u.expression.post_op = AST_LINK_RARROW;
953192ba MD	522	$$->u.expression.prev = $1;
	523	}
	524	;
	525
	526	unary_expression
	527	: postfix_expression
	528	{ $$ = $1; }
bff988fa MD	529	\| primary_expression
bff988fa MD	530	{ $$ = $1; }
953192ba MD	531	\| unary_operator unary_expression
	532	{
	533	$$ = $1;
	534	$$->u.unary_op.child = $2;
	535	}
	536	;
	537
	538	unary_operator
	539	: PLUS
	540	{
	541	$$ = make_node(parser_ctx, NODE_UNARY_OP);
	542	$$->u.unary_op.type = AST_UNARY_PLUS;
	543	}
	544	\| MINUS
	545	{
	546	$$ = make_node(parser_ctx, NODE_UNARY_OP);
	547	$$->u.unary_op.type = AST_UNARY_MINUS;
	548	}
	549	\| NOT_OP
	550	{
	551	$$ = make_node(parser_ctx, NODE_UNARY_OP);
	552	$$->u.unary_op.type = AST_UNARY_NOT;
	553	}
ab78f161 CB	554	\| NOT_BIN
	555	{
	556	$$ = make_node(parser_ctx, NODE_UNARY_OP);
bff988fa	557	$$->u.unary_op.type = AST_UNARY_BIT_NOT;
ab78f161	558	}
953192ba MD	559	;
	560
	561	multiplicative_expression
	562	: unary_expression
	563	{ $$ = $1; }
	564	\| multiplicative_expression STAR unary_expression
	565	{
	566	$$ = make_op_node(parser_ctx, AST_OP_MUL, $1, $3);
	567	}
	568	\| multiplicative_expression DIV_OP unary_expression
	569	{
	570	$$ = make_op_node(parser_ctx, AST_OP_DIV, $1, $3);
	571	}
	572	\| multiplicative_expression MOD_OP unary_expression
	573	{
	574	$$ = make_op_node(parser_ctx, AST_OP_MOD, $1, $3);
	575	}
	576	;
	577
	578	additive_expression
	579	: multiplicative_expression
	580	{ $$ = $1; }
	581	\| additive_expression PLUS multiplicative_expression
	582	{
	583	$$ = make_op_node(parser_ctx, AST_OP_PLUS, $1, $3);
	584	}
	585	\| additive_expression MINUS multiplicative_expression
	586	{
	587	$$ = make_op_node(parser_ctx, AST_OP_MINUS, $1, $3);
	588	}
	589	;
	590
	591	shift_expression
	592	: additive_expression
	593	{ $$ = $1; }
	594	\| shift_expression LEFT_OP additive_expression
	595	{
116d3c01	596	$$ = make_op_node(parser_ctx, AST_OP_BIT_LSHIFT, $1, $3);
953192ba MD	597	}
	598	\| shift_expression RIGHT_OP additive_expression
	599	{
116d3c01	600	$$ = make_op_node(parser_ctx, AST_OP_BIT_RSHIFT, $1, $3);
953192ba MD	601	}
	602	;
	603
831b702b	604	and_expression
953192ba MD	605	: shift_expression
953192ba MD	606	{ $$ = $1; }
831b702b MD	607	\| and_expression AND_BIN shift_expression
	608	{
	609	$$ = make_op_node(parser_ctx, AST_OP_BIT_AND, $1, $3);
	610	}
	611	;
	612
	613	exclusive_or_expression
	614	: and_expression
	615	{ $$ = $1; }
	616	\| exclusive_or_expression XOR_BIN and_expression
	617	{
	618	$$ = make_op_node(parser_ctx, AST_OP_BIT_XOR, $1, $3);
	619	}
	620	;
	621
	622	inclusive_or_expression
	623	: exclusive_or_expression
	624	{ $$ = $1; }
	625	\| inclusive_or_expression OR_BIN exclusive_or_expression
	626	{
	627	$$ = make_op_node(parser_ctx, AST_OP_BIT_OR, $1, $3);
	628	}
	629	;
	630
	631	relational_expression
	632	: inclusive_or_expression
	633	{ $$ = $1; }
	634	\| relational_expression LT_OP inclusive_or_expression
953192ba MD	635	{
	636	$$ = make_op_node(parser_ctx, AST_OP_LT, $1, $3);
	637	}
831b702b	638	\| relational_expression GT_OP inclusive_or_expression
953192ba MD	639	{
	640	$$ = make_op_node(parser_ctx, AST_OP_GT, $1, $3);
	641	}
831b702b	642	\| relational_expression LE_OP inclusive_or_expression
953192ba MD	643	{
	644	$$ = make_op_node(parser_ctx, AST_OP_LE, $1, $3);
	645	}
831b702b	646	\| relational_expression GE_OP inclusive_or_expression
953192ba MD	647	{
	648	$$ = make_op_node(parser_ctx, AST_OP_GE, $1, $3);
	649	}
	650	;
	651
	652	equality_expression
	653	: relational_expression
	654	{ $$ = $1; }
	655	\| equality_expression EQ_OP relational_expression
	656	{
	657	$$ = make_op_node(parser_ctx, AST_OP_EQ, $1, $3);
	658	}
	659	\| equality_expression NE_OP relational_expression
	660	{
	661	$$ = make_op_node(parser_ctx, AST_OP_NE, $1, $3);
	662	}
	663	;
	664
953192ba	665	logical_and_expression
831b702b	666	: equality_expression
953192ba	667	{ $$ = $1; }
831b702b	668	\| logical_and_expression AND_OP equality_expression
953192ba MD	669	{
	670	$$ = make_op_node(parser_ctx, AST_OP_AND, $1, $3);
	671	}
	672	;
	673
	674	logical_or_expression
	675	: logical_and_expression
	676	{ $$ = $1; }
	677	\| logical_or_expression OR_OP logical_and_expression
	678	{
	679	$$ = make_op_node(parser_ctx, AST_OP_OR, $1, $3);
	680	}
	681	;
	682
	683	expression
	684	: logical_or_expression
	685	{ $$ = $1; }
	686	;
	687
	688	translation_unit
	689	: expression
	690	{
	691	parser_ctx->ast->root.u.root.child = $1;
	692	}
	693	;