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> |
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; |
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); |
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 | } |
246 | ||
a187da1a | 247 | LTTNG_HIDDEN |
953192ba MD |
248 | int filter_parser_ctx_append_ast(struct filter_parser_ctx *parser_ctx) |
249 | { | |
9039edd4 | 250 | return yyparse(parser_ctx, parser_ctx->scanner); |
953192ba MD |
251 | } |
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 | ||
300 | free_strings(&parser_ctx->allocated_strings); | |
301 | filter_ast_free(parser_ctx->ast); | |
302 | ret = yylex_destroy(parser_ctx->scanner); | |
303 | if (ret) | |
304 | fprintf(stderr, "yylex_destroy error\n"); | |
305 | free(parser_ctx); | |
306 | } | |
307 | ||
308 | %} | |
309 | ||
310 | %define api.pure | |
311 | /* %locations */ | |
312 | %parse-param {struct filter_parser_ctx *parser_ctx} | |
9039edd4 ZT |
313 | %parse-param {yyscan_t scanner} |
314 | %lex-param {yyscan_t scanner} | |
953192ba MD |
315 | %start translation_unit |
316 | %token CHARACTER_CONSTANT_START SQUOTE STRING_LITERAL_START DQUOTE | |
317 | %token ESCSEQ CHAR_STRING_TOKEN | |
e90d8561 | 318 | %token DECIMAL_CONSTANT OCTAL_CONSTANT HEXADECIMAL_CONSTANT FLOAT_CONSTANT |
953192ba MD |
319 | %token LSBRAC RSBRAC LPAREN RPAREN LBRAC RBRAC RARROW |
320 | %token STAR PLUS MINUS | |
321 | %token MOD_OP DIV_OP RIGHT_OP LEFT_OP | |
322 | %token EQ_OP NE_OP LE_OP GE_OP LT_OP GT_OP AND_OP OR_OP NOT_OP | |
323 | %token ASSIGN COLON SEMICOLON DOTDOTDOT DOT EQUAL COMMA | |
324 | %token XOR_BIN AND_BIN OR_BIN NOT_BIN | |
325 | ||
586dc72f | 326 | %token <gs> IDENTIFIER GLOBAL_IDENTIFIER |
953192ba MD |
327 | %token ERROR |
328 | %union | |
329 | { | |
330 | long long ll; | |
331 | char c; | |
332 | struct gc_string *gs; | |
333 | struct filter_node *n; | |
334 | } | |
335 | ||
336 | %type <gs> s_char s_char_sequence c_char c_char_sequence | |
337 | ||
338 | %type <n> primary_expression | |
bff988fa MD |
339 | %type <n> prefix_expression |
340 | %type <n> prefix_expression_rec | |
953192ba MD |
341 | %type <n> postfix_expression |
342 | %type <n> unary_expression | |
343 | %type <n> unary_operator | |
344 | %type <n> multiplicative_expression | |
345 | %type <n> additive_expression | |
346 | %type <n> shift_expression | |
347 | %type <n> relational_expression | |
348 | %type <n> equality_expression | |
349 | %type <n> and_expression | |
350 | %type <n> exclusive_or_expression | |
351 | %type <n> inclusive_or_expression | |
352 | %type <n> logical_and_expression | |
353 | %type <n> logical_or_expression | |
354 | %type <n> expression | |
bff988fa | 355 | %type <n> identifiers |
953192ba MD |
356 | |
357 | %% | |
358 | ||
359 | ||
360 | /* 1.5 Constants */ | |
361 | ||
362 | c_char_sequence: | |
363 | c_char | |
364 | { $$ = $1; } | |
365 | | c_char_sequence c_char | |
366 | { $$ = gc_string_append(parser_ctx, $1, $2); } | |
367 | ; | |
368 | ||
369 | c_char: | |
370 | CHAR_STRING_TOKEN | |
371 | { $$ = yylval.gs; } | |
372 | | ESCSEQ | |
373 | { | |
374 | parse_error(parser_ctx, "escape sequences not supported yet"); | |
375 | } | |
376 | ; | |
377 | ||
378 | /* 1.6 String literals */ | |
379 | ||
380 | s_char_sequence: | |
381 | s_char | |
382 | { $$ = $1; } | |
383 | | s_char_sequence s_char | |
384 | { $$ = gc_string_append(parser_ctx, $1, $2); } | |
385 | ; | |
386 | ||
387 | s_char: | |
388 | CHAR_STRING_TOKEN | |
389 | { $$ = yylval.gs; } | |
390 | | ESCSEQ | |
391 | { | |
392 | parse_error(parser_ctx, "escape sequences not supported yet"); | |
393 | } | |
394 | ; | |
395 | ||
bff988fa MD |
396 | primary_expression: |
397 | DECIMAL_CONSTANT | |
953192ba MD |
398 | { |
399 | $$ = make_node(parser_ctx, NODE_EXPRESSION); | |
400 | $$->u.expression.type = AST_EXP_CONSTANT; | |
8ab7c0d9 MD |
401 | if (sscanf(yylval.gs->s, "%" WIDTH_u64_SCANF_IS_A_BROKEN_API SCNu64, |
402 | &$$->u.expression.u.constant) != 1) { | |
403 | parse_error(parser_ctx, "cannot scanf decimal constant"); | |
404 | } | |
953192ba MD |
405 | } |
406 | | OCTAL_CONSTANT | |
407 | { | |
408 | $$ = make_node(parser_ctx, NODE_EXPRESSION); | |
409 | $$->u.expression.type = AST_EXP_CONSTANT; | |
8ab7c0d9 MD |
410 | if (!strcmp(yylval.gs->s, "0")) { |
411 | $$->u.expression.u.constant = 0; | |
412 | } else if (sscanf(yylval.gs->s, "0%" WIDTH_o64_SCANF_IS_A_BROKEN_API SCNo64, | |
413 | &$$->u.expression.u.constant) != 1) { | |
414 | parse_error(parser_ctx, "cannot scanf octal constant"); | |
415 | } | |
953192ba MD |
416 | } |
417 | | HEXADECIMAL_CONSTANT | |
418 | { | |
419 | $$ = make_node(parser_ctx, NODE_EXPRESSION); | |
420 | $$->u.expression.type = AST_EXP_CONSTANT; | |
8ab7c0d9 MD |
421 | if (sscanf(yylval.gs->s, "0x%" WIDTH_x64_SCANF_IS_A_BROKEN_API SCNx64, |
422 | &$$->u.expression.u.constant) != 1) { | |
423 | parse_error(parser_ctx, "cannot scanf hexadecimal constant"); | |
424 | } | |
953192ba | 425 | } |
e90d8561 MD |
426 | | FLOAT_CONSTANT |
427 | { | |
428 | $$ = make_node(parser_ctx, NODE_EXPRESSION); | |
429 | $$->u.expression.type = AST_EXP_FLOAT_CONSTANT; | |
8ab7c0d9 MD |
430 | if (sscanf(yylval.gs->s, "%" WIDTH_lg_SCANF_IS_A_BROKEN_API "lg", |
431 | &$$->u.expression.u.float_constant) != 1) { | |
432 | parse_error(parser_ctx, "cannot scanf float constant"); | |
433 | } | |
e90d8561 | 434 | } |
953192ba MD |
435 | | STRING_LITERAL_START DQUOTE |
436 | { | |
437 | $$ = make_node(parser_ctx, NODE_EXPRESSION); | |
438 | $$->u.expression.type = AST_EXP_STRING; | |
439 | $$->u.expression.u.string = ""; | |
440 | } | |
441 | | STRING_LITERAL_START s_char_sequence DQUOTE | |
442 | { | |
443 | $$ = make_node(parser_ctx, NODE_EXPRESSION); | |
444 | $$->u.expression.type = AST_EXP_STRING; | |
445 | $$->u.expression.u.string = $2->s; | |
446 | } | |
447 | | CHARACTER_CONSTANT_START c_char_sequence SQUOTE | |
448 | { | |
449 | $$ = make_node(parser_ctx, NODE_EXPRESSION); | |
450 | $$->u.expression.type = AST_EXP_STRING; | |
451 | $$->u.expression.u.string = $2->s; | |
452 | } | |
453 | | LPAREN expression RPAREN | |
454 | { | |
455 | $$ = make_node(parser_ctx, NODE_EXPRESSION); | |
456 | $$->u.expression.type = AST_EXP_NESTED; | |
457 | $$->u.expression.u.child = $2; | |
458 | } | |
459 | ; | |
460 | ||
bff988fa MD |
461 | identifiers |
462 | : IDENTIFIER | |
463 | { | |
464 | $$ = make_node(parser_ctx, NODE_EXPRESSION); | |
465 | $$->u.expression.type = AST_EXP_IDENTIFIER; | |
466 | $$->u.expression.u.identifier = yylval.gs->s; | |
467 | } | |
468 | | GLOBAL_IDENTIFIER | |
469 | { | |
470 | $$ = make_node(parser_ctx, NODE_EXPRESSION); | |
471 | $$->u.expression.type = AST_EXP_GLOBAL_IDENTIFIER; | |
472 | $$->u.expression.u.identifier = yylval.gs->s; | |
473 | } | |
474 | ; | |
475 | ||
476 | prefix_expression_rec | |
477 | : LSBRAC unary_expression RSBRAC | |
478 | { | |
479 | $$ = $2; | |
480 | } | |
481 | | LSBRAC unary_expression RSBRAC prefix_expression_rec | |
482 | { | |
483 | $$ = $2; | |
484 | $$->u.expression.pre_op = AST_LINK_BRACKET; | |
485 | $$->u.expression.prev = $4; | |
486 | } | |
487 | ; | |
488 | ||
489 | prefix_expression | |
490 | : identifiers | |
491 | { | |
492 | $$ = $1; | |
493 | } | |
494 | | identifiers prefix_expression_rec | |
661dfdd1 MD |
495 | { |
496 | $$ = $1; | |
497 | $$->u.expression.pre_op = AST_LINK_BRACKET; | |
bff988fa | 498 | $$->u.expression.next_bracket = $2; |
661dfdd1 | 499 | } |
bff988fa MD |
500 | ; |
501 | ||
502 | postfix_expression | |
503 | : prefix_expression | |
953192ba | 504 | { |
bff988fa MD |
505 | $$ = $1; |
506 | } | |
507 | | postfix_expression DOT prefix_expression | |
508 | { | |
509 | $$ = $3; | |
953192ba | 510 | $$->u.expression.post_op = AST_LINK_DOT; |
953192ba MD |
511 | $$->u.expression.prev = $1; |
512 | } | |
bff988fa | 513 | | postfix_expression RARROW prefix_expression |
953192ba | 514 | { |
bff988fa | 515 | $$ = $3; |
953192ba | 516 | $$->u.expression.post_op = AST_LINK_RARROW; |
953192ba MD |
517 | $$->u.expression.prev = $1; |
518 | } | |
519 | ; | |
520 | ||
521 | unary_expression | |
522 | : postfix_expression | |
523 | { $$ = $1; } | |
bff988fa MD |
524 | | primary_expression |
525 | { $$ = $1; } | |
953192ba MD |
526 | | unary_operator unary_expression |
527 | { | |
528 | $$ = $1; | |
529 | $$->u.unary_op.child = $2; | |
530 | } | |
531 | ; | |
532 | ||
533 | unary_operator | |
534 | : PLUS | |
535 | { | |
536 | $$ = make_node(parser_ctx, NODE_UNARY_OP); | |
537 | $$->u.unary_op.type = AST_UNARY_PLUS; | |
538 | } | |
539 | | MINUS | |
540 | { | |
541 | $$ = make_node(parser_ctx, NODE_UNARY_OP); | |
542 | $$->u.unary_op.type = AST_UNARY_MINUS; | |
543 | } | |
544 | | NOT_OP | |
545 | { | |
546 | $$ = make_node(parser_ctx, NODE_UNARY_OP); | |
547 | $$->u.unary_op.type = AST_UNARY_NOT; | |
548 | } | |
ab78f161 CB |
549 | | NOT_BIN |
550 | { | |
551 | $$ = make_node(parser_ctx, NODE_UNARY_OP); | |
bff988fa | 552 | $$->u.unary_op.type = AST_UNARY_BIT_NOT; |
ab78f161 | 553 | } |
953192ba MD |
554 | ; |
555 | ||
556 | multiplicative_expression | |
557 | : unary_expression | |
558 | { $$ = $1; } | |
559 | | multiplicative_expression STAR unary_expression | |
560 | { | |
561 | $$ = make_op_node(parser_ctx, AST_OP_MUL, $1, $3); | |
562 | } | |
563 | | multiplicative_expression DIV_OP unary_expression | |
564 | { | |
565 | $$ = make_op_node(parser_ctx, AST_OP_DIV, $1, $3); | |
566 | } | |
567 | | multiplicative_expression MOD_OP unary_expression | |
568 | { | |
569 | $$ = make_op_node(parser_ctx, AST_OP_MOD, $1, $3); | |
570 | } | |
571 | ; | |
572 | ||
573 | additive_expression | |
574 | : multiplicative_expression | |
575 | { $$ = $1; } | |
576 | | additive_expression PLUS multiplicative_expression | |
577 | { | |
578 | $$ = make_op_node(parser_ctx, AST_OP_PLUS, $1, $3); | |
579 | } | |
580 | | additive_expression MINUS multiplicative_expression | |
581 | { | |
582 | $$ = make_op_node(parser_ctx, AST_OP_MINUS, $1, $3); | |
583 | } | |
584 | ; | |
585 | ||
586 | shift_expression | |
587 | : additive_expression | |
588 | { $$ = $1; } | |
589 | | shift_expression LEFT_OP additive_expression | |
590 | { | |
116d3c01 | 591 | $$ = make_op_node(parser_ctx, AST_OP_BIT_LSHIFT, $1, $3); |
953192ba MD |
592 | } |
593 | | shift_expression RIGHT_OP additive_expression | |
594 | { | |
116d3c01 | 595 | $$ = make_op_node(parser_ctx, AST_OP_BIT_RSHIFT, $1, $3); |
953192ba MD |
596 | } |
597 | ; | |
598 | ||
831b702b | 599 | and_expression |
953192ba MD |
600 | : shift_expression |
601 | { $$ = $1; } | |
831b702b MD |
602 | | and_expression AND_BIN shift_expression |
603 | { | |
604 | $$ = make_op_node(parser_ctx, AST_OP_BIT_AND, $1, $3); | |
605 | } | |
606 | ; | |
607 | ||
608 | exclusive_or_expression | |
609 | : and_expression | |
610 | { $$ = $1; } | |
611 | | exclusive_or_expression XOR_BIN and_expression | |
612 | { | |
613 | $$ = make_op_node(parser_ctx, AST_OP_BIT_XOR, $1, $3); | |
614 | } | |
615 | ; | |
616 | ||
617 | inclusive_or_expression | |
618 | : exclusive_or_expression | |
619 | { $$ = $1; } | |
620 | | inclusive_or_expression OR_BIN exclusive_or_expression | |
621 | { | |
622 | $$ = make_op_node(parser_ctx, AST_OP_BIT_OR, $1, $3); | |
623 | } | |
624 | ; | |
625 | ||
626 | relational_expression | |
627 | : inclusive_or_expression | |
628 | { $$ = $1; } | |
629 | | relational_expression LT_OP inclusive_or_expression | |
953192ba MD |
630 | { |
631 | $$ = make_op_node(parser_ctx, AST_OP_LT, $1, $3); | |
632 | } | |
831b702b | 633 | | relational_expression GT_OP inclusive_or_expression |
953192ba MD |
634 | { |
635 | $$ = make_op_node(parser_ctx, AST_OP_GT, $1, $3); | |
636 | } | |
831b702b | 637 | | relational_expression LE_OP inclusive_or_expression |
953192ba MD |
638 | { |
639 | $$ = make_op_node(parser_ctx, AST_OP_LE, $1, $3); | |
640 | } | |
831b702b | 641 | | relational_expression GE_OP inclusive_or_expression |
953192ba MD |
642 | { |
643 | $$ = make_op_node(parser_ctx, AST_OP_GE, $1, $3); | |
644 | } | |
645 | ; | |
646 | ||
647 | equality_expression | |
648 | : relational_expression | |
649 | { $$ = $1; } | |
650 | | equality_expression EQ_OP relational_expression | |
651 | { | |
652 | $$ = make_op_node(parser_ctx, AST_OP_EQ, $1, $3); | |
653 | } | |
654 | | equality_expression NE_OP relational_expression | |
655 | { | |
656 | $$ = make_op_node(parser_ctx, AST_OP_NE, $1, $3); | |
657 | } | |
658 | ; | |
659 | ||
953192ba | 660 | logical_and_expression |
831b702b | 661 | : equality_expression |
953192ba | 662 | { $$ = $1; } |
831b702b | 663 | | logical_and_expression AND_OP equality_expression |
953192ba MD |
664 | { |
665 | $$ = make_op_node(parser_ctx, AST_OP_AND, $1, $3); | |
666 | } | |
667 | ; | |
668 | ||
669 | logical_or_expression | |
670 | : logical_and_expression | |
671 | { $$ = $1; } | |
672 | | logical_or_expression OR_OP logical_and_expression | |
673 | { | |
674 | $$ = make_op_node(parser_ctx, AST_OP_OR, $1, $3); | |
675 | } | |
676 | ; | |
677 | ||
678 | expression | |
679 | : logical_or_expression | |
680 | { $$ = $1; } | |
681 | ; | |
682 | ||
683 | translation_unit | |
684 | : expression | |
685 | { | |
686 | parser_ctx->ast->root.u.root.child = $1; | |
687 | } | |
688 | ; |