5 * Common Trace Format Metadata Grammar.
7 * Copyright 2010 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
9 * Permission is hereby granted, free of charge, to any person obtaining a copy
10 * of this software and associated documentation files (the "Software"), to deal
11 * in the Software without restriction, including without limitation the rights
12 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
13 * copies of the Software, and to permit persons to whom the Software is
14 * furnished to do so, subject to the following conditions:
16 * The above copyright notice and this permission notice shall be included in
17 * all copies or substantial portions of the Software.
19 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
20 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
21 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
22 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
23 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
24 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
37 #include <babeltrace/list.h>
38 #include <babeltrace/babeltrace-internal.h>
39 #include "ctf-scanner.h"
40 #include "ctf-parser.h"
47 /* Join two lists, put "add" at the end of "head". */
49 _bt_list_splice_tail (struct bt_list_head *add, struct bt_list_head *head)
51 /* Do nothing if the list which gets added is empty. */
52 if (add != add->next) {
53 add->next->prev = head->prev;
54 add->prev->next = head;
55 head->prev->next = add->next;
56 head->prev = add->prev;
61 int yyparse(struct ctf_scanner *scanner);
63 int yylex(union YYSTYPE *yyval, struct ctf_scanner *scanner);
65 int yylex_init_extra(struct ctf_scanner *scanner, yyscan_t * ptr_yy_globals);
67 int yylex_destroy(yyscan_t yyscanner);
69 void yyrestart(FILE * in_str, yyscan_t scanner);
71 int yyget_lineno(yyscan_t yyscanner);
73 char *yyget_text(yyscan_t yyscanner);
75 static const char *node_type_to_str[] = {
76 #define ENTRY(S) [S] = #S,
77 FOREACH_CTF_NODES(ENTRY)
82 * Static node for out of memory errors. Only "type" is used. lineno is
83 * always left at 0. The rest of the node content can be overwritten,
86 static struct ctf_node error_node = {
91 const char *node_type(struct ctf_node *node)
93 if (node->type < NR_NODE_TYPES)
94 return node_type_to_str[node->type];
99 void setstring(struct ctf_scanner *scanner, YYSTYPE *lvalp, const char *src)
101 lvalp->s = objstack_alloc(scanner->objstack, strlen(src) + 1);
102 strcpy(lvalp->s, src);
106 int str_check(size_t str_len, size_t offset, size_t len)
109 if (offset + len < offset)
111 if (offset + len > str_len)
117 int bt_isodigit(int c)
135 int parse_base_sequence(const char *src, size_t len, size_t pos,
136 char *buffer, size_t *buf_len, int base)
138 const size_t max_char = 3;
141 while (!str_check(len, pos, 1) && nr_char < max_char) {
146 buffer[nr_char++] = c;
149 } else if (base == 16) {
151 buffer[nr_char++] = c;
156 /* Unsupported base */
161 buffer[nr_char] = '\0';
167 int import_basic_string(struct ctf_scanner *scanner, YYSTYPE *lvalp,
168 size_t len, const char *src, char delim)
170 size_t pos = 0, dpos = 0;
172 if (str_check(len, pos, 1))
174 if (src[pos++] != delim)
177 while (src[pos] != delim) {
180 if (str_check(len, pos, 1))
184 if (str_check(len, pos, 1))
234 if (parse_base_sequence(src, len, pos - 1,
235 oct_buffer, &oct_len, 8))
237 c = strtoul(&oct_buffer[0], NULL, 8);
246 if (parse_base_sequence(src, len, pos,
247 hex_buffer, &hex_len, 16))
249 c = strtoul(&hex_buffer[0], NULL, 16);
257 if (str_check(len, dpos, 1))
259 lvalp->s[dpos++] = c;
262 if (str_check(len, dpos, 1))
264 lvalp->s[dpos++] = '\0';
266 if (str_check(len, pos, 1))
268 if (src[pos++] != delim)
271 if (str_check(len, pos, 1))
273 if (src[pos] != '\0')
278 int import_string(struct ctf_scanner *scanner, YYSTYPE *lvalp,
279 const char *src, char delim)
283 len = strlen(src) + 1;
284 lvalp->s = objstack_alloc(scanner->objstack, len);
286 // TODO: import wide string
287 printfl_error(yyget_lineno(scanner),
288 "Wide string not supported yet.");
291 return import_basic_string(scanner, lvalp, len, src, delim);
295 static void init_scope(struct ctf_scanner_scope *scope,
296 struct ctf_scanner_scope *parent)
298 scope->parent = parent;
299 scope->types = g_hash_table_new_full(g_str_hash, g_str_equal,
303 static void finalize_scope(struct ctf_scanner_scope *scope)
305 g_hash_table_destroy(scope->types);
308 static void push_scope(struct ctf_scanner *scanner)
310 struct ctf_scanner_scope *ns;
312 printf_debug("push scope\n");
313 ns = malloc(sizeof(struct ctf_scanner_scope));
314 init_scope(ns, scanner->cs);
318 static void pop_scope(struct ctf_scanner *scanner)
320 struct ctf_scanner_scope *os;
322 printf_debug("pop scope\n");
324 scanner->cs = os->parent;
329 static int lookup_type(struct ctf_scanner_scope *s, const char *id)
333 ret = (int) (long) g_hash_table_lookup(s->types, id);
334 printf_debug("lookup %p %s %d\n", s, id, ret);
339 int is_type(struct ctf_scanner *scanner, const char *id)
341 struct ctf_scanner_scope *it;
344 for (it = scanner->cs; it != NULL; it = it->parent) {
345 if (lookup_type(it, id)) {
350 printf_debug("is type %s %d\n", id, ret);
354 static void add_type(struct ctf_scanner *scanner, char *id)
356 printf_debug("add type %s\n", id);
357 if (lookup_type(scanner->cs, id))
359 g_hash_table_insert(scanner->cs->types, id, id);
362 static struct ctf_node *make_node(struct ctf_scanner *scanner,
365 struct ctf_node *node;
367 node = objstack_alloc(scanner->objstack, sizeof(*node));
369 printfl_fatal(yyget_lineno(scanner->scanner), "out of memory");
373 node->lineno = yyget_lineno(scanner->scanner);
374 BT_INIT_LIST_HEAD(&node->tmp_head);
375 bt_list_add(&node->siblings, &node->tmp_head);
379 node->type = NODE_ERROR;
380 printfn_fatal(node, "trying to create root node");
384 BT_INIT_LIST_HEAD(&node->u.event.declaration_list);
387 BT_INIT_LIST_HEAD(&node->u.stream.declaration_list);
390 BT_INIT_LIST_HEAD(&node->u.env.declaration_list);
393 BT_INIT_LIST_HEAD(&node->u.trace.declaration_list);
396 BT_INIT_LIST_HEAD(&node->u.clock.declaration_list);
399 BT_INIT_LIST_HEAD(&node->u.callsite.declaration_list);
402 case NODE_CTF_EXPRESSION:
403 BT_INIT_LIST_HEAD(&node->u.ctf_expression.left);
404 BT_INIT_LIST_HEAD(&node->u.ctf_expression.right);
406 case NODE_UNARY_EXPRESSION:
410 BT_INIT_LIST_HEAD(&node->u._typedef.type_declarators);
412 case NODE_TYPEALIAS_TARGET:
413 BT_INIT_LIST_HEAD(&node->u.typealias_target.type_declarators);
415 case NODE_TYPEALIAS_ALIAS:
416 BT_INIT_LIST_HEAD(&node->u.typealias_alias.type_declarators);
421 case NODE_TYPE_SPECIFIER:
423 case NODE_TYPE_SPECIFIER_LIST:
424 BT_INIT_LIST_HEAD(&node->u.type_specifier_list.head);
428 case NODE_TYPE_DECLARATOR:
429 BT_INIT_LIST_HEAD(&node->u.type_declarator.pointers);
432 case NODE_FLOATING_POINT:
433 BT_INIT_LIST_HEAD(&node->u.floating_point.expressions);
436 BT_INIT_LIST_HEAD(&node->u.integer.expressions);
439 BT_INIT_LIST_HEAD(&node->u.string.expressions);
441 case NODE_ENUMERATOR:
442 BT_INIT_LIST_HEAD(&node->u.enumerator.values);
445 BT_INIT_LIST_HEAD(&node->u._enum.enumerator_list);
447 case NODE_STRUCT_OR_VARIANT_DECLARATION:
448 BT_INIT_LIST_HEAD(&node->u.struct_or_variant_declaration.type_declarators);
451 BT_INIT_LIST_HEAD(&node->u.variant.declaration_list);
454 BT_INIT_LIST_HEAD(&node->u._struct.declaration_list);
455 BT_INIT_LIST_HEAD(&node->u._struct.min_align);
460 node->type = NODE_ERROR;
461 printfn_fatal(node, "unknown node type '%d'", (int) type);
468 static int reparent_ctf_expression(struct ctf_node *node,
469 struct ctf_node *parent)
471 switch (parent->type) {
473 _bt_list_splice_tail(&node->tmp_head, &parent->u.event.declaration_list);
476 _bt_list_splice_tail(&node->tmp_head, &parent->u.stream.declaration_list);
479 _bt_list_splice_tail(&node->tmp_head, &parent->u.env.declaration_list);
482 _bt_list_splice_tail(&node->tmp_head, &parent->u.trace.declaration_list);
485 _bt_list_splice_tail(&node->tmp_head, &parent->u.clock.declaration_list);
488 _bt_list_splice_tail(&node->tmp_head, &parent->u.callsite.declaration_list);
490 case NODE_FLOATING_POINT:
491 _bt_list_splice_tail(&node->tmp_head, &parent->u.floating_point.expressions);
494 _bt_list_splice_tail(&node->tmp_head, &parent->u.integer.expressions);
497 _bt_list_splice_tail(&node->tmp_head, &parent->u.string.expressions);
501 case NODE_CTF_EXPRESSION:
503 case NODE_TYPEALIAS_TARGET:
504 case NODE_TYPEALIAS_ALIAS:
506 case NODE_TYPE_SPECIFIER:
507 case NODE_TYPE_SPECIFIER_LIST:
509 case NODE_TYPE_DECLARATOR:
510 case NODE_ENUMERATOR:
512 case NODE_STRUCT_OR_VARIANT_DECLARATION:
515 case NODE_UNARY_EXPRESSION:
520 printfn_fatal(node, "unknown node type '%d'", (int) parent->type);
526 static int reparent_typedef(struct ctf_node *node, struct ctf_node *parent)
528 switch (parent->type) {
530 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.declaration_list);
533 _bt_list_splice_tail(&node->tmp_head, &parent->u.event.declaration_list);
536 _bt_list_splice_tail(&node->tmp_head, &parent->u.stream.declaration_list);
539 _bt_list_splice_tail(&node->tmp_head, &parent->u.env.declaration_list);
542 _bt_list_splice_tail(&node->tmp_head, &parent->u.trace.declaration_list);
545 _bt_list_splice_tail(&node->tmp_head, &parent->u.clock.declaration_list);
548 _bt_list_splice_tail(&node->tmp_head, &parent->u.callsite.declaration_list);
551 _bt_list_splice_tail(&node->tmp_head, &parent->u.variant.declaration_list);
554 _bt_list_splice_tail(&node->tmp_head, &parent->u._struct.declaration_list);
557 case NODE_FLOATING_POINT:
560 case NODE_CTF_EXPRESSION:
562 case NODE_TYPEALIAS_TARGET:
563 case NODE_TYPEALIAS_ALIAS:
565 case NODE_TYPE_SPECIFIER:
566 case NODE_TYPE_SPECIFIER_LIST:
568 case NODE_TYPE_DECLARATOR:
569 case NODE_ENUMERATOR:
571 case NODE_STRUCT_OR_VARIANT_DECLARATION:
572 case NODE_UNARY_EXPRESSION:
577 printfn_fatal(node, "unknown node type %d", parent->type);
583 static int reparent_typealias(struct ctf_node *node, struct ctf_node *parent)
585 switch (parent->type) {
587 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.declaration_list);
590 _bt_list_splice_tail(&node->tmp_head, &parent->u.event.declaration_list);
593 _bt_list_splice_tail(&node->tmp_head, &parent->u.stream.declaration_list);
596 _bt_list_splice_tail(&node->tmp_head, &parent->u.env.declaration_list);
599 _bt_list_splice_tail(&node->tmp_head, &parent->u.trace.declaration_list);
602 _bt_list_splice_tail(&node->tmp_head, &parent->u.clock.declaration_list);
605 _bt_list_splice_tail(&node->tmp_head, &parent->u.callsite.declaration_list);
608 _bt_list_splice_tail(&node->tmp_head, &parent->u.variant.declaration_list);
611 _bt_list_splice_tail(&node->tmp_head, &parent->u._struct.declaration_list);
614 case NODE_FLOATING_POINT:
617 case NODE_CTF_EXPRESSION:
619 case NODE_TYPEALIAS_TARGET:
620 case NODE_TYPEALIAS_ALIAS:
622 case NODE_TYPE_SPECIFIER:
623 case NODE_TYPE_SPECIFIER_LIST:
625 case NODE_TYPE_DECLARATOR:
626 case NODE_ENUMERATOR:
628 case NODE_STRUCT_OR_VARIANT_DECLARATION:
629 case NODE_UNARY_EXPRESSION:
634 printfn_fatal(node, "unknown node type '%d'", (int) parent->type);
640 static int reparent_type_specifier(struct ctf_node *node,
641 struct ctf_node *parent)
643 switch (parent->type) {
644 case NODE_TYPE_SPECIFIER_LIST:
645 _bt_list_splice_tail(&node->tmp_head, &parent->u.type_specifier_list.head);
648 case NODE_TYPE_SPECIFIER:
658 case NODE_TYPEALIAS_TARGET:
659 case NODE_TYPEALIAS_ALIAS:
660 case NODE_TYPE_DECLARATOR:
662 case NODE_STRUCT_OR_VARIANT_DECLARATION:
664 case NODE_FLOATING_POINT:
667 case NODE_CTF_EXPRESSION:
669 case NODE_ENUMERATOR:
670 case NODE_UNARY_EXPRESSION:
675 printfn_fatal(node, "unknown node type '%d'", (int) parent->type);
681 static int reparent_type_specifier_list(struct ctf_node *node,
682 struct ctf_node *parent)
684 switch (parent->type) {
686 bt_list_add_tail(&node->siblings, &parent->u.root.declaration_list);
689 bt_list_add_tail(&node->siblings, &parent->u.event.declaration_list);
692 bt_list_add_tail(&node->siblings, &parent->u.stream.declaration_list);
695 bt_list_add_tail(&node->siblings, &parent->u.env.declaration_list);
698 bt_list_add_tail(&node->siblings, &parent->u.trace.declaration_list);
701 bt_list_add_tail(&node->siblings, &parent->u.clock.declaration_list);
704 bt_list_add_tail(&node->siblings, &parent->u.callsite.declaration_list);
707 bt_list_add_tail(&node->siblings, &parent->u.variant.declaration_list);
710 bt_list_add_tail(&node->siblings, &parent->u._struct.declaration_list);
713 parent->u._typedef.type_specifier_list = node;
715 case NODE_TYPEALIAS_TARGET:
716 parent->u.typealias_target.type_specifier_list = node;
718 case NODE_TYPEALIAS_ALIAS:
719 parent->u.typealias_alias.type_specifier_list = node;
722 parent->u._enum.container_type = node;
724 case NODE_STRUCT_OR_VARIANT_DECLARATION:
725 parent->u.struct_or_variant_declaration.type_specifier_list = node;
727 case NODE_TYPE_DECLARATOR:
728 case NODE_TYPE_SPECIFIER:
730 case NODE_FLOATING_POINT:
733 case NODE_CTF_EXPRESSION:
735 case NODE_ENUMERATOR:
736 case NODE_UNARY_EXPRESSION:
741 printfn_fatal(node, "unknown node type '%d'", (int) parent->type);
747 static int reparent_type_declarator(struct ctf_node *node,
748 struct ctf_node *parent)
750 switch (parent->type) {
751 case NODE_TYPE_DECLARATOR:
752 parent->u.type_declarator.type = TYPEDEC_NESTED;
753 parent->u.type_declarator.u.nested.type_declarator = node;
755 case NODE_STRUCT_OR_VARIANT_DECLARATION:
756 _bt_list_splice_tail(&node->tmp_head, &parent->u.struct_or_variant_declaration.type_declarators);
759 _bt_list_splice_tail(&node->tmp_head, &parent->u._typedef.type_declarators);
761 case NODE_TYPEALIAS_TARGET:
762 _bt_list_splice_tail(&node->tmp_head, &parent->u.typealias_target.type_declarators);
764 case NODE_TYPEALIAS_ALIAS:
765 _bt_list_splice_tail(&node->tmp_head, &parent->u.typealias_alias.type_declarators);
779 case NODE_FLOATING_POINT:
782 case NODE_CTF_EXPRESSION:
783 case NODE_TYPE_SPECIFIER:
784 case NODE_TYPE_SPECIFIER_LIST:
786 case NODE_ENUMERATOR:
787 case NODE_UNARY_EXPRESSION:
792 printfn_fatal(node, "unknown node type '%d'", (int) parent->type);
801 * Link node to parent. Returns 0 on success, -EPERM if it is not permitted to
802 * create the link declared by the input, -ENOENT if node or parent is NULL,
803 * -EINVAL if there is an internal structure problem.
805 static int set_parent_node(struct ctf_node *node,
806 struct ctf_node *parent)
808 if (!node || !parent)
811 /* Note: Linking to parent will be done only by an external visitor */
813 switch (node->type) {
815 printfn_fatal(node, "trying to reparent root node");
819 if (parent->type == NODE_ROOT) {
820 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.event);
826 if (parent->type == NODE_ROOT) {
827 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.stream);
833 if (parent->type == NODE_ROOT) {
834 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.env);
840 if (parent->type == NODE_ROOT) {
841 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.trace);
847 if (parent->type == NODE_ROOT) {
848 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.clock);
854 if (parent->type == NODE_ROOT) {
855 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.callsite);
861 case NODE_CTF_EXPRESSION:
862 return reparent_ctf_expression(node, parent);
863 case NODE_UNARY_EXPRESSION:
864 if (parent->type == NODE_TYPE_DECLARATOR)
865 parent->u.type_declarator.bitfield_len = node;
871 return reparent_typedef(node, parent);
872 case NODE_TYPEALIAS_TARGET:
873 if (parent->type == NODE_TYPEALIAS)
874 parent->u.typealias.target = node;
877 case NODE_TYPEALIAS_ALIAS:
878 if (parent->type == NODE_TYPEALIAS)
879 parent->u.typealias.alias = node;
883 return reparent_typealias(node, parent);
886 if (parent->type == NODE_TYPE_DECLARATOR) {
887 _bt_list_splice_tail(&node->tmp_head, &parent->u.type_declarator.pointers);
891 case NODE_TYPE_DECLARATOR:
892 return reparent_type_declarator(node, parent);
894 case NODE_TYPE_SPECIFIER_LIST:
895 return reparent_type_specifier_list(node, parent);
897 case NODE_TYPE_SPECIFIER:
898 return reparent_type_specifier(node, parent);
900 case NODE_FLOATING_POINT:
906 return -EINVAL; /* Dealt with internally within grammar */
908 case NODE_ENUMERATOR:
909 if (parent->type == NODE_ENUM) {
910 _bt_list_splice_tail(&node->tmp_head, &parent->u._enum.enumerator_list);
915 case NODE_STRUCT_OR_VARIANT_DECLARATION:
916 switch (parent->type) {
918 _bt_list_splice_tail(&node->tmp_head, &parent->u._struct.declaration_list);
921 _bt_list_splice_tail(&node->tmp_head, &parent->u.variant.declaration_list);
930 printfn_fatal(node, "unknown node type '%d'", (int) parent->type);
937 void yyerror(struct ctf_scanner *scanner, const char *str)
939 printfl_error(yyget_lineno(scanner->scanner),
940 "token \"%s\": %s\n",
941 yyget_text(scanner->scanner), str);
950 #define reparent_error(scanner, str) \
952 yyerror(scanner, YY_("reparent_error: " str)); \
956 static struct ctf_ast *ctf_ast_alloc(struct ctf_scanner *scanner)
960 ast = objstack_alloc(scanner->objstack, sizeof(*ast));
963 ast->root.type = NODE_ROOT;
964 BT_INIT_LIST_HEAD(&ast->root.tmp_head);
965 BT_INIT_LIST_HEAD(&ast->root.u.root.declaration_list);
966 BT_INIT_LIST_HEAD(&ast->root.u.root.trace);
967 BT_INIT_LIST_HEAD(&ast->root.u.root.env);
968 BT_INIT_LIST_HEAD(&ast->root.u.root.stream);
969 BT_INIT_LIST_HEAD(&ast->root.u.root.event);
970 BT_INIT_LIST_HEAD(&ast->root.u.root.clock);
971 BT_INIT_LIST_HEAD(&ast->root.u.root.callsite);
975 int ctf_scanner_append_ast(struct ctf_scanner *scanner)
977 return yyparse(scanner);
980 struct ctf_scanner *ctf_scanner_alloc(FILE *input)
982 struct ctf_scanner *scanner;
985 yydebug = babeltrace_debug;
987 scanner = malloc(sizeof(*scanner));
990 memset(scanner, 0, sizeof(*scanner));
992 ret = yylex_init_extra(scanner, &scanner->scanner);
994 printf_fatal("yylex_init error");
995 goto cleanup_scanner;
997 /* Start processing new stream */
998 yyrestart(input, scanner->scanner);
1000 scanner->objstack = objstack_create();
1001 if (!scanner->objstack)
1003 scanner->ast = ctf_ast_alloc(scanner);
1005 goto cleanup_objstack;
1006 init_scope(&scanner->root_scope, NULL);
1007 scanner->cs = &scanner->root_scope;
1010 fprintf(stdout, "Scanner input is a%s.\n",
1011 isatty(fileno(input)) ? "n interactive tty" :
1012 " noninteractive file");
1017 objstack_destroy(scanner->objstack);
1019 ret = yylex_destroy(scanner->scanner);
1021 printf_fatal("yylex_destroy error");
1027 void ctf_scanner_free(struct ctf_scanner *scanner)
1031 finalize_scope(&scanner->root_scope);
1032 objstack_destroy(scanner->objstack);
1033 ret = yylex_destroy(scanner->scanner);
1035 printf_error("yylex_destroy error");
1044 %parse-param {struct ctf_scanner *scanner}
1045 %lex-param {struct ctf_scanner *scanner}
1047 * Expect two shift-reduce conflicts. Caused by enum name-opt : type {}
1048 * vs struct { int :value; } (unnamed bit-field). The default is to
1049 * shift, so whenever we encounter an enumeration, we are doing the
1050 * proper thing (shift). It is illegal to declare an enumeration
1051 * "bit-field", so it is OK if this situation ends up in a parsing
1056 %token INTEGER_LITERAL STRING_LITERAL CHARACTER_LITERAL LSBRAC RSBRAC LPAREN RPAREN LBRAC RBRAC RARROW STAR PLUS MINUS LT GT TYPEASSIGN COLON SEMICOLON DOTDOTDOT DOT EQUAL COMMA CONST CHAR DOUBLE ENUM ENV EVENT FLOATING_POINT FLOAT INTEGER INT LONG SHORT SIGNED STREAM STRING STRUCT TRACE CALLSITE CLOCK TYPEALIAS TYPEDEF UNSIGNED VARIANT VOID _BOOL _COMPLEX _IMAGINARY TOK_ALIGN
1057 %token <s> IDENTIFIER ID_TYPE
1062 unsigned long long ull;
1068 %type <s> STRING_LITERAL CHARACTER_LITERAL
1072 %type <ull> INTEGER_LITERAL
1073 %type <n> postfix_expression unary_expression unary_expression_or_range
1075 %type <n> declaration
1076 %type <n> event_declaration
1077 %type <n> stream_declaration
1078 %type <n> env_declaration
1079 %type <n> trace_declaration
1080 %type <n> clock_declaration
1081 %type <n> callsite_declaration
1082 %type <n> integer_declaration_specifiers
1083 %type <n> declaration_specifiers
1084 %type <n> alias_declaration_specifiers
1086 %type <n> type_declarator_list
1087 %type <n> integer_type_specifier
1088 %type <n> type_specifier
1089 %type <n> struct_type_specifier
1090 %type <n> variant_type_specifier
1091 %type <n> enum_type_specifier
1092 %type <n> struct_or_variant_declaration_list
1093 %type <n> struct_or_variant_declaration
1094 %type <n> struct_or_variant_declarator_list
1095 %type <n> struct_or_variant_declarator
1096 %type <n> enumerator_list
1097 %type <n> enumerator
1098 %type <n> abstract_declarator_list
1099 %type <n> abstract_declarator
1100 %type <n> direct_abstract_declarator
1101 %type <n> alias_abstract_declarator_list
1102 %type <n> alias_abstract_declarator
1103 %type <n> direct_alias_abstract_declarator
1104 %type <n> declarator
1105 %type <n> direct_declarator
1106 %type <n> type_declarator
1107 %type <n> direct_type_declarator
1109 %type <n> ctf_assignment_expression_list
1110 %type <n> ctf_assignment_expression
1117 if (set_parent_node($1, &ctf_scanner_get_ast(scanner)->root))
1118 reparent_error(scanner, "error reparenting to root");
1122 if (set_parent_node($2, &ctf_scanner_get_ast(scanner)->root))
1123 reparent_error(scanner, "error reparenting to root");
1185 /* 2: Phrase structure grammar */
1190 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1191 $$->u.unary_expression.type = UNARY_STRING;
1192 $$->u.unary_expression.u.string = yylval.s;
1196 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1197 $$->u.unary_expression.type = UNARY_STRING;
1198 $$->u.unary_expression.u.string = yylval.s;
1202 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1203 $$->u.unary_expression.type = UNARY_STRING;
1204 $$->u.unary_expression.u.string = yylval.s;
1208 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1209 $$->u.unary_expression.type = UNARY_UNSIGNED_CONSTANT;
1210 $$->u.unary_expression.u.unsigned_constant = $1;
1214 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1215 $$->u.unary_expression.type = UNARY_STRING;
1216 $$->u.unary_expression.u.string = $1;
1220 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1221 $$->u.unary_expression.type = UNARY_STRING;
1222 $$->u.unary_expression.u.string = $1;
1224 | LPAREN unary_expression RPAREN
1228 | postfix_expression LSBRAC unary_expression RSBRAC
1230 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1231 $$->u.unary_expression.type = UNARY_SBRAC;
1232 $$->u.unary_expression.u.sbrac_exp = $3;
1233 bt_list_splice(&($1)->tmp_head, &($$)->tmp_head);
1234 bt_list_add_tail(&($$)->siblings, &($$)->tmp_head);
1236 | postfix_expression DOT IDENTIFIER
1238 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1239 $$->u.unary_expression.type = UNARY_STRING;
1240 $$->u.unary_expression.u.string = yylval.s;
1241 $$->u.unary_expression.link = UNARY_DOTLINK;
1242 bt_list_splice(&($1)->tmp_head, &($$)->tmp_head);
1243 bt_list_add_tail(&($$)->siblings, &($$)->tmp_head);
1245 | postfix_expression DOT ID_TYPE
1247 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1248 $$->u.unary_expression.type = UNARY_STRING;
1249 $$->u.unary_expression.u.string = yylval.s;
1250 $$->u.unary_expression.link = UNARY_DOTLINK;
1251 bt_list_splice(&($1)->tmp_head, &($$)->tmp_head);
1252 bt_list_add_tail(&($$)->siblings, &($$)->tmp_head);
1254 | postfix_expression RARROW IDENTIFIER
1256 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1257 $$->u.unary_expression.type = UNARY_STRING;
1258 $$->u.unary_expression.u.string = yylval.s;
1259 $$->u.unary_expression.link = UNARY_ARROWLINK;
1260 bt_list_splice(&($1)->tmp_head, &($$)->tmp_head);
1261 bt_list_add_tail(&($$)->siblings, &($$)->tmp_head);
1263 | postfix_expression RARROW ID_TYPE
1265 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1266 $$->u.unary_expression.type = UNARY_STRING;
1267 $$->u.unary_expression.u.string = yylval.s;
1268 $$->u.unary_expression.link = UNARY_ARROWLINK;
1269 bt_list_splice(&($1)->tmp_head, &($$)->tmp_head);
1270 bt_list_add_tail(&($$)->siblings, &($$)->tmp_head);
1277 | PLUS postfix_expression
1280 if ($$->u.unary_expression.type != UNARY_UNSIGNED_CONSTANT
1281 && $$->u.unary_expression.type != UNARY_SIGNED_CONSTANT) {
1282 reparent_error(scanner, "expecting numeric constant");
1285 | MINUS postfix_expression
1288 if ($$->u.unary_expression.type == UNARY_UNSIGNED_CONSTANT) {
1289 $$->u.unary_expression.type = UNARY_SIGNED_CONSTANT;
1290 $$->u.unary_expression.u.signed_constant =
1291 -($$->u.unary_expression.u.unsigned_constant);
1292 } else if ($$->u.unary_expression.type == UNARY_UNSIGNED_CONSTANT) {
1293 $$->u.unary_expression.u.signed_constant =
1294 -($$->u.unary_expression.u.signed_constant);
1296 reparent_error(scanner, "expecting numeric constant");
1301 unary_expression_or_range:
1302 unary_expression DOTDOTDOT unary_expression
1305 _bt_list_splice_tail(&($3)->tmp_head, &($$)->tmp_head);
1306 $3->u.unary_expression.link = UNARY_DOTDOTDOT;
1312 /* 2.2: Declarations */
1315 declaration_specifiers SEMICOLON
1319 | stream_declaration
1327 | callsite_declaration
1329 | declaration_specifiers TYPEDEF declaration_specifiers type_declarator_list SEMICOLON
1331 struct ctf_node *list;
1333 $$ = make_node(scanner, NODE_TYPEDEF);
1334 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1335 $$->u._typedef.type_specifier_list = list;
1336 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
1337 _bt_list_splice_tail(&($3)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
1338 _bt_list_splice_tail(&($4)->tmp_head, &($$)->u._typedef.type_declarators);
1340 | TYPEDEF declaration_specifiers type_declarator_list SEMICOLON
1342 struct ctf_node *list;
1344 $$ = make_node(scanner, NODE_TYPEDEF);
1345 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1346 $$->u._typedef.type_specifier_list = list;
1347 _bt_list_splice_tail(&($2)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
1348 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._typedef.type_declarators);
1350 | declaration_specifiers TYPEDEF type_declarator_list SEMICOLON
1352 struct ctf_node *list;
1354 $$ = make_node(scanner, NODE_TYPEDEF);
1355 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1356 $$->u._typedef.type_specifier_list = list;
1357 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
1358 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._typedef.type_declarators);
1360 | TYPEALIAS declaration_specifiers abstract_declarator_list TYPEASSIGN alias_declaration_specifiers alias_abstract_declarator_list SEMICOLON
1362 struct ctf_node *list;
1364 $$ = make_node(scanner, NODE_TYPEALIAS);
1365 $$->u.typealias.target = make_node(scanner, NODE_TYPEALIAS_TARGET);
1366 $$->u.typealias.alias = make_node(scanner, NODE_TYPEALIAS_ALIAS);
1368 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1369 $$->u.typealias.target->u.typealias_target.type_specifier_list = list;
1370 _bt_list_splice_tail(&($2)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
1371 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.typealias.target->u.typealias_target.type_declarators);
1373 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1374 $$->u.typealias.alias->u.typealias_alias.type_specifier_list = list;
1375 _bt_list_splice_tail(&($5)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
1376 _bt_list_splice_tail(&($6)->tmp_head, &($$)->u.typealias.alias->u.typealias_alias.type_declarators);
1381 event_declaration_begin event_declaration_end
1383 $$ = make_node(scanner, NODE_EVENT);
1385 | event_declaration_begin ctf_assignment_expression_list event_declaration_end
1387 $$ = make_node(scanner, NODE_EVENT);
1388 if (set_parent_node($2, $$))
1389 reparent_error(scanner, "event_declaration");
1393 event_declaration_begin:
1395 { push_scope(scanner); }
1398 event_declaration_end:
1400 { pop_scope(scanner); }
1405 stream_declaration_begin stream_declaration_end
1407 $$ = make_node(scanner, NODE_STREAM);
1409 | stream_declaration_begin ctf_assignment_expression_list stream_declaration_end
1411 $$ = make_node(scanner, NODE_STREAM);
1412 if (set_parent_node($2, $$))
1413 reparent_error(scanner, "stream_declaration");
1417 stream_declaration_begin:
1419 { push_scope(scanner); }
1422 stream_declaration_end:
1424 { pop_scope(scanner); }
1428 env_declaration_begin env_declaration_end
1430 $$ = make_node(scanner, NODE_ENV);
1432 | env_declaration_begin ctf_assignment_expression_list env_declaration_end
1434 $$ = make_node(scanner, NODE_ENV);
1435 if (set_parent_node($2, $$))
1436 reparent_error(scanner, "env declaration");
1440 env_declaration_begin:
1442 { push_scope(scanner); }
1445 env_declaration_end:
1447 { pop_scope(scanner); }
1451 trace_declaration_begin trace_declaration_end
1453 $$ = make_node(scanner, NODE_TRACE);
1455 | trace_declaration_begin ctf_assignment_expression_list trace_declaration_end
1457 $$ = make_node(scanner, NODE_TRACE);
1458 if (set_parent_node($2, $$))
1459 reparent_error(scanner, "trace_declaration");
1463 trace_declaration_begin:
1465 { push_scope(scanner); }
1468 trace_declaration_end:
1470 { pop_scope(scanner); }
1474 CLOCK clock_declaration_begin clock_declaration_end
1476 $$ = make_node(scanner, NODE_CLOCK);
1478 | CLOCK clock_declaration_begin ctf_assignment_expression_list clock_declaration_end
1480 $$ = make_node(scanner, NODE_CLOCK);
1481 if (set_parent_node($3, $$))
1482 reparent_error(scanner, "trace_declaration");
1486 clock_declaration_begin:
1488 { push_scope(scanner); }
1491 clock_declaration_end:
1493 { pop_scope(scanner); }
1496 callsite_declaration:
1497 CALLSITE callsite_declaration_begin callsite_declaration_end
1499 $$ = make_node(scanner, NODE_CALLSITE);
1501 | CALLSITE callsite_declaration_begin ctf_assignment_expression_list callsite_declaration_end
1503 $$ = make_node(scanner, NODE_CALLSITE);
1504 if (set_parent_node($3, $$))
1505 reparent_error(scanner, "trace_declaration");
1509 callsite_declaration_begin:
1511 { push_scope(scanner); }
1514 callsite_declaration_end:
1516 { pop_scope(scanner); }
1519 integer_declaration_specifiers:
1522 struct ctf_node *node;
1524 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1525 node = make_node(scanner, NODE_TYPE_SPECIFIER);
1526 node->u.type_specifier.type = TYPESPEC_CONST;
1527 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
1529 | integer_type_specifier
1531 struct ctf_node *node;
1533 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1535 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
1537 | integer_declaration_specifiers CONST
1539 struct ctf_node *node;
1542 node = make_node(scanner, NODE_TYPE_SPECIFIER);
1543 node->u.type_specifier.type = TYPESPEC_CONST;
1544 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
1546 | integer_declaration_specifiers integer_type_specifier
1549 bt_list_add_tail(&($2)->siblings, &($$)->u.type_specifier_list.head);
1553 declaration_specifiers:
1556 struct ctf_node *node;
1558 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1559 node = make_node(scanner, NODE_TYPE_SPECIFIER);
1560 node->u.type_specifier.type = TYPESPEC_CONST;
1561 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
1565 struct ctf_node *node;
1567 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1569 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
1571 | declaration_specifiers CONST
1573 struct ctf_node *node;
1576 node = make_node(scanner, NODE_TYPE_SPECIFIER);
1577 node->u.type_specifier.type = TYPESPEC_CONST;
1578 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
1580 | declaration_specifiers type_specifier
1583 bt_list_add_tail(&($2)->siblings, &($$)->u.type_specifier_list.head);
1587 type_declarator_list:
1590 | type_declarator_list COMMA type_declarator
1593 bt_list_add_tail(&($3)->siblings, &($$)->tmp_head);
1597 integer_type_specifier:
1600 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1601 $$->u.type_specifier.type = TYPESPEC_CHAR;
1605 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1606 $$->u.type_specifier.type = TYPESPEC_SHORT;
1610 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1611 $$->u.type_specifier.type = TYPESPEC_INT;
1615 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1616 $$->u.type_specifier.type = TYPESPEC_LONG;
1620 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1621 $$->u.type_specifier.type = TYPESPEC_SIGNED;
1625 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1626 $$->u.type_specifier.type = TYPESPEC_UNSIGNED;
1630 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1631 $$->u.type_specifier.type = TYPESPEC_BOOL;
1635 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1636 $$->u.type_specifier.type = TYPESPEC_ID_TYPE;
1637 $$->u.type_specifier.id_type = yylval.s;
1639 | INTEGER LBRAC RBRAC
1641 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1642 $$->u.type_specifier.type = TYPESPEC_INTEGER;
1643 $$->u.type_specifier.node = make_node(scanner, NODE_INTEGER);
1645 | INTEGER LBRAC ctf_assignment_expression_list RBRAC
1647 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1648 $$->u.type_specifier.type = TYPESPEC_INTEGER;
1649 $$->u.type_specifier.node = make_node(scanner, NODE_INTEGER);
1650 if (set_parent_node($3, $$->u.type_specifier.node))
1651 reparent_error(scanner, "integer reparent error");
1658 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1659 $$->u.type_specifier.type = TYPESPEC_VOID;
1663 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1664 $$->u.type_specifier.type = TYPESPEC_CHAR;
1668 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1669 $$->u.type_specifier.type = TYPESPEC_SHORT;
1673 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1674 $$->u.type_specifier.type = TYPESPEC_INT;
1678 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1679 $$->u.type_specifier.type = TYPESPEC_LONG;
1683 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1684 $$->u.type_specifier.type = TYPESPEC_FLOAT;
1688 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1689 $$->u.type_specifier.type = TYPESPEC_DOUBLE;
1693 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1694 $$->u.type_specifier.type = TYPESPEC_SIGNED;
1698 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1699 $$->u.type_specifier.type = TYPESPEC_UNSIGNED;
1703 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1704 $$->u.type_specifier.type = TYPESPEC_BOOL;
1708 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1709 $$->u.type_specifier.type = TYPESPEC_COMPLEX;
1713 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1714 $$->u.type_specifier.type = TYPESPEC_IMAGINARY;
1718 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1719 $$->u.type_specifier.type = TYPESPEC_ID_TYPE;
1720 $$->u.type_specifier.id_type = yylval.s;
1722 | FLOATING_POINT LBRAC RBRAC
1724 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1725 $$->u.type_specifier.type = TYPESPEC_FLOATING_POINT;
1726 $$->u.type_specifier.node = make_node(scanner, NODE_FLOATING_POINT);
1728 | FLOATING_POINT LBRAC ctf_assignment_expression_list RBRAC
1730 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1731 $$->u.type_specifier.type = TYPESPEC_FLOATING_POINT;
1732 $$->u.type_specifier.node = make_node(scanner, NODE_FLOATING_POINT);
1733 if (set_parent_node($3, $$->u.type_specifier.node))
1734 reparent_error(scanner, "floating point reparent error");
1736 | INTEGER LBRAC RBRAC
1738 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1739 $$->u.type_specifier.type = TYPESPEC_INTEGER;
1740 $$->u.type_specifier.node = make_node(scanner, NODE_INTEGER);
1742 | INTEGER LBRAC ctf_assignment_expression_list RBRAC
1744 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1745 $$->u.type_specifier.type = TYPESPEC_INTEGER;
1746 $$->u.type_specifier.node = make_node(scanner, NODE_INTEGER);
1747 if (set_parent_node($3, $$->u.type_specifier.node))
1748 reparent_error(scanner, "integer reparent error");
1752 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1753 $$->u.type_specifier.type = TYPESPEC_STRING;
1754 $$->u.type_specifier.node = make_node(scanner, NODE_STRING);
1756 | STRING LBRAC RBRAC
1758 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1759 $$->u.type_specifier.type = TYPESPEC_STRING;
1760 $$->u.type_specifier.node = make_node(scanner, NODE_STRING);
1762 | STRING LBRAC ctf_assignment_expression_list RBRAC
1764 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1765 $$->u.type_specifier.type = TYPESPEC_STRING;
1766 $$->u.type_specifier.node = make_node(scanner, NODE_STRING);
1767 if (set_parent_node($3, $$->u.type_specifier.node))
1768 reparent_error(scanner, "string reparent error");
1770 | ENUM enum_type_specifier
1772 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1773 $$->u.type_specifier.type = TYPESPEC_ENUM;
1774 $$->u.type_specifier.node = $2;
1776 | VARIANT variant_type_specifier
1778 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1779 $$->u.type_specifier.type = TYPESPEC_VARIANT;
1780 $$->u.type_specifier.node = $2;
1782 | STRUCT struct_type_specifier
1784 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1785 $$->u.type_specifier.type = TYPESPEC_STRUCT;
1786 $$->u.type_specifier.node = $2;
1790 struct_type_specifier:
1791 struct_declaration_begin struct_or_variant_declaration_list struct_declaration_end
1793 $$ = make_node(scanner, NODE_STRUCT);
1794 $$->u._struct.has_body = 1;
1795 if ($2 && set_parent_node($2, $$))
1796 reparent_error(scanner, "struct reparent error");
1798 | IDENTIFIER struct_declaration_begin struct_or_variant_declaration_list struct_declaration_end
1800 $$ = make_node(scanner, NODE_STRUCT);
1801 $$->u._struct.has_body = 1;
1802 $$->u._struct.name = $1;
1803 if ($3 && set_parent_node($3, $$))
1804 reparent_error(scanner, "struct reparent error");
1806 | ID_TYPE struct_declaration_begin struct_or_variant_declaration_list struct_declaration_end
1808 $$ = make_node(scanner, NODE_STRUCT);
1809 $$->u._struct.has_body = 1;
1810 $$->u._struct.name = $1;
1811 if ($3 && set_parent_node($3, $$))
1812 reparent_error(scanner, "struct reparent error");
1816 $$ = make_node(scanner, NODE_STRUCT);
1817 $$->u._struct.has_body = 0;
1818 $$->u._struct.name = $1;
1822 $$ = make_node(scanner, NODE_STRUCT);
1823 $$->u._struct.has_body = 0;
1824 $$->u._struct.name = $1;
1826 | struct_declaration_begin struct_or_variant_declaration_list struct_declaration_end TOK_ALIGN LPAREN unary_expression RPAREN
1828 $$ = make_node(scanner, NODE_STRUCT);
1829 $$->u._struct.has_body = 1;
1830 bt_list_add_tail(&($6)->siblings, &$$->u._struct.min_align);
1831 if ($2 && set_parent_node($2, $$))
1832 reparent_error(scanner, "struct reparent error");
1834 | IDENTIFIER struct_declaration_begin struct_or_variant_declaration_list struct_declaration_end TOK_ALIGN LPAREN unary_expression RPAREN
1836 $$ = make_node(scanner, NODE_STRUCT);
1837 $$->u._struct.has_body = 1;
1838 $$->u._struct.name = $1;
1839 bt_list_add_tail(&($7)->siblings, &$$->u._struct.min_align);
1840 if ($3 && set_parent_node($3, $$))
1841 reparent_error(scanner, "struct reparent error");
1843 | ID_TYPE struct_declaration_begin struct_or_variant_declaration_list struct_declaration_end TOK_ALIGN LPAREN unary_expression RPAREN
1845 $$ = make_node(scanner, NODE_STRUCT);
1846 $$->u._struct.has_body = 1;
1847 $$->u._struct.name = $1;
1848 bt_list_add_tail(&($7)->siblings, &$$->u._struct.min_align);
1849 if ($3 && set_parent_node($3, $$))
1850 reparent_error(scanner, "struct reparent error");
1854 struct_declaration_begin:
1856 { push_scope(scanner); }
1859 struct_declaration_end:
1861 { pop_scope(scanner); }
1864 variant_type_specifier:
1865 variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1867 $$ = make_node(scanner, NODE_VARIANT);
1868 $$->u.variant.has_body = 1;
1869 if ($2 && set_parent_node($2, $$))
1870 reparent_error(scanner, "variant reparent error");
1872 | LT IDENTIFIER GT variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1874 $$ = make_node(scanner, NODE_VARIANT);
1875 $$->u.variant.has_body = 1;
1876 $$->u.variant.choice = $2;
1877 if ($5 && set_parent_node($5, $$))
1878 reparent_error(scanner, "variant reparent error");
1880 | LT ID_TYPE GT variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1882 $$ = make_node(scanner, NODE_VARIANT);
1883 $$->u.variant.has_body = 1;
1884 $$->u.variant.choice = $2;
1885 if ($5 && set_parent_node($5, $$))
1886 reparent_error(scanner, "variant reparent error");
1888 | IDENTIFIER variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1890 $$ = make_node(scanner, NODE_VARIANT);
1891 $$->u.variant.has_body = 1;
1892 $$->u.variant.name = $1;
1893 if ($3 && set_parent_node($3, $$))
1894 reparent_error(scanner, "variant reparent error");
1896 | IDENTIFIER LT IDENTIFIER GT variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1898 $$ = make_node(scanner, NODE_VARIANT);
1899 $$->u.variant.has_body = 1;
1900 $$->u.variant.name = $1;
1901 $$->u.variant.choice = $3;
1902 if ($6 && set_parent_node($6, $$))
1903 reparent_error(scanner, "variant reparent error");
1905 | IDENTIFIER LT IDENTIFIER GT
1907 $$ = make_node(scanner, NODE_VARIANT);
1908 $$->u.variant.has_body = 0;
1909 $$->u.variant.name = $1;
1910 $$->u.variant.choice = $3;
1912 | IDENTIFIER LT ID_TYPE GT variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1914 $$ = make_node(scanner, NODE_VARIANT);
1915 $$->u.variant.has_body = 1;
1916 $$->u.variant.name = $1;
1917 $$->u.variant.choice = $3;
1918 if ($6 && set_parent_node($6, $$))
1919 reparent_error(scanner, "variant reparent error");
1921 | IDENTIFIER LT ID_TYPE GT
1923 $$ = make_node(scanner, NODE_VARIANT);
1924 $$->u.variant.has_body = 0;
1925 $$->u.variant.name = $1;
1926 $$->u.variant.choice = $3;
1928 | ID_TYPE variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1930 $$ = make_node(scanner, NODE_VARIANT);
1931 $$->u.variant.has_body = 1;
1932 $$->u.variant.name = $1;
1933 if ($3 && set_parent_node($3, $$))
1934 reparent_error(scanner, "variant reparent error");
1936 | ID_TYPE LT IDENTIFIER GT variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1938 $$ = make_node(scanner, NODE_VARIANT);
1939 $$->u.variant.has_body = 1;
1940 $$->u.variant.name = $1;
1941 $$->u.variant.choice = $3;
1942 if ($6 && set_parent_node($6, $$))
1943 reparent_error(scanner, "variant reparent error");
1945 | ID_TYPE LT IDENTIFIER GT
1947 $$ = make_node(scanner, NODE_VARIANT);
1948 $$->u.variant.has_body = 0;
1949 $$->u.variant.name = $1;
1950 $$->u.variant.choice = $3;
1952 | ID_TYPE LT ID_TYPE GT variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1954 $$ = make_node(scanner, NODE_VARIANT);
1955 $$->u.variant.has_body = 1;
1956 $$->u.variant.name = $1;
1957 $$->u.variant.choice = $3;
1958 if ($6 && set_parent_node($6, $$))
1959 reparent_error(scanner, "variant reparent error");
1961 | ID_TYPE LT ID_TYPE GT
1963 $$ = make_node(scanner, NODE_VARIANT);
1964 $$->u.variant.has_body = 0;
1965 $$->u.variant.name = $1;
1966 $$->u.variant.choice = $3;
1970 variant_declaration_begin:
1972 { push_scope(scanner); }
1975 variant_declaration_end:
1977 { pop_scope(scanner); }
1980 enum_type_specifier:
1981 LBRAC enumerator_list RBRAC
1983 $$ = make_node(scanner, NODE_ENUM);
1984 $$->u._enum.has_body = 1;
1985 _bt_list_splice_tail(&($2)->tmp_head, &($$)->u._enum.enumerator_list);
1987 | COLON integer_declaration_specifiers LBRAC enumerator_list RBRAC
1989 $$ = make_node(scanner, NODE_ENUM);
1990 $$->u._enum.has_body = 1;
1991 ($$)->u._enum.container_type = $2;
1992 _bt_list_splice_tail(&($4)->tmp_head, &($$)->u._enum.enumerator_list);
1994 | IDENTIFIER LBRAC enumerator_list RBRAC
1996 $$ = make_node(scanner, NODE_ENUM);
1997 $$->u._enum.has_body = 1;
1998 $$->u._enum.enum_id = $1;
1999 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._enum.enumerator_list);
2001 | IDENTIFIER COLON integer_declaration_specifiers LBRAC enumerator_list RBRAC
2003 $$ = make_node(scanner, NODE_ENUM);
2004 $$->u._enum.has_body = 1;
2005 $$->u._enum.enum_id = $1;
2006 ($$)->u._enum.container_type = $3;
2007 _bt_list_splice_tail(&($5)->tmp_head, &($$)->u._enum.enumerator_list);
2009 | ID_TYPE LBRAC enumerator_list RBRAC
2011 $$ = make_node(scanner, NODE_ENUM);
2012 $$->u._enum.has_body = 1;
2013 $$->u._enum.enum_id = $1;
2014 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._enum.enumerator_list);
2016 | ID_TYPE COLON integer_declaration_specifiers LBRAC enumerator_list RBRAC
2018 $$ = make_node(scanner, NODE_ENUM);
2019 $$->u._enum.has_body = 1;
2020 $$->u._enum.enum_id = $1;
2021 ($$)->u._enum.container_type = $3;
2022 _bt_list_splice_tail(&($5)->tmp_head, &($$)->u._enum.enumerator_list);
2024 | LBRAC enumerator_list COMMA RBRAC
2026 $$ = make_node(scanner, NODE_ENUM);
2027 $$->u._enum.has_body = 1;
2028 _bt_list_splice_tail(&($2)->tmp_head, &($$)->u._enum.enumerator_list);
2030 | COLON integer_declaration_specifiers LBRAC enumerator_list COMMA RBRAC
2032 $$ = make_node(scanner, NODE_ENUM);
2033 $$->u._enum.has_body = 1;
2034 ($$)->u._enum.container_type = $2;
2035 _bt_list_splice_tail(&($4)->tmp_head, &($$)->u._enum.enumerator_list);
2037 | IDENTIFIER LBRAC enumerator_list COMMA RBRAC
2039 $$ = make_node(scanner, NODE_ENUM);
2040 $$->u._enum.has_body = 1;
2041 $$->u._enum.enum_id = $1;
2042 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._enum.enumerator_list);
2044 | IDENTIFIER COLON integer_declaration_specifiers LBRAC enumerator_list COMMA RBRAC
2046 $$ = make_node(scanner, NODE_ENUM);
2047 $$->u._enum.has_body = 1;
2048 $$->u._enum.enum_id = $1;
2049 ($$)->u._enum.container_type = $3;
2050 _bt_list_splice_tail(&($5)->tmp_head, &($$)->u._enum.enumerator_list);
2054 $$ = make_node(scanner, NODE_ENUM);
2055 $$->u._enum.has_body = 0;
2056 $$->u._enum.enum_id = $1;
2058 | ID_TYPE LBRAC enumerator_list COMMA RBRAC
2060 $$ = make_node(scanner, NODE_ENUM);
2061 $$->u._enum.has_body = 1;
2062 $$->u._enum.enum_id = $1;
2063 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._enum.enumerator_list);
2065 | ID_TYPE COLON integer_declaration_specifiers LBRAC enumerator_list COMMA RBRAC
2067 $$ = make_node(scanner, NODE_ENUM);
2068 $$->u._enum.has_body = 1;
2069 $$->u._enum.enum_id = $1;
2070 ($$)->u._enum.container_type = $3;
2071 _bt_list_splice_tail(&($5)->tmp_head, &($$)->u._enum.enumerator_list);
2075 $$ = make_node(scanner, NODE_ENUM);
2076 $$->u._enum.has_body = 0;
2077 $$->u._enum.enum_id = $1;
2081 struct_or_variant_declaration_list:
2084 | struct_or_variant_declaration_list struct_or_variant_declaration
2088 bt_list_add_tail(&($2)->siblings, &($$)->tmp_head);
2091 bt_list_add_tail(&($$)->siblings, &($$)->tmp_head);
2096 struct_or_variant_declaration:
2097 declaration_specifiers struct_or_variant_declarator_list SEMICOLON
2099 struct ctf_node *list;
2101 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2102 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2103 $$ = make_node(scanner, NODE_STRUCT_OR_VARIANT_DECLARATION);
2104 ($$)->u.struct_or_variant_declaration.type_specifier_list = list;
2105 _bt_list_splice_tail(&($2)->tmp_head, &($$)->u.struct_or_variant_declaration.type_declarators);
2107 | declaration_specifiers TYPEDEF declaration_specifiers type_declarator_list SEMICOLON
2109 struct ctf_node *list;
2111 $$ = make_node(scanner, NODE_TYPEDEF);
2112 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2113 $$->u._typedef.type_specifier_list = list;
2114 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2115 _bt_list_splice_tail(&($3)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2116 _bt_list_splice_tail(&($4)->tmp_head, &($$)->u._typedef.type_declarators);
2118 | TYPEDEF declaration_specifiers type_declarator_list SEMICOLON
2120 struct ctf_node *list;
2122 $$ = make_node(scanner, NODE_TYPEDEF);
2123 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2124 $$->u._typedef.type_specifier_list = list;
2125 _bt_list_splice_tail(&($2)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2126 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._typedef.type_declarators);
2128 | declaration_specifiers TYPEDEF type_declarator_list SEMICOLON
2130 struct ctf_node *list;
2132 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2133 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2134 $$ = make_node(scanner, NODE_TYPEDEF);
2135 ($$)->u.struct_or_variant_declaration.type_specifier_list = list;
2136 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._typedef.type_declarators);
2138 | TYPEALIAS declaration_specifiers abstract_declarator_list TYPEASSIGN alias_declaration_specifiers alias_abstract_declarator_list SEMICOLON
2140 struct ctf_node *list;
2142 $$ = make_node(scanner, NODE_TYPEALIAS);
2143 $$->u.typealias.target = make_node(scanner, NODE_TYPEALIAS_TARGET);
2144 $$->u.typealias.alias = make_node(scanner, NODE_TYPEALIAS_ALIAS);
2146 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2147 $$->u.typealias.target->u.typealias_target.type_specifier_list = list;
2148 _bt_list_splice_tail(&($2)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2149 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.typealias.target->u.typealias_target.type_declarators);
2151 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2152 $$->u.typealias.alias->u.typealias_alias.type_specifier_list = list;
2153 _bt_list_splice_tail(&($5)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2154 _bt_list_splice_tail(&($6)->tmp_head, &($$)->u.typealias.alias->u.typealias_alias.type_declarators);
2158 alias_declaration_specifiers:
2161 struct ctf_node *node;
2163 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2164 node = make_node(scanner, NODE_TYPE_SPECIFIER);
2165 node->u.type_specifier.type = TYPESPEC_CONST;
2166 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
2170 struct ctf_node *node;
2172 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2174 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
2178 struct ctf_node *node;
2180 add_type(scanner, $1);
2181 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2182 node = make_node(scanner, NODE_TYPE_SPECIFIER);
2183 node->u.type_specifier.type = TYPESPEC_ID_TYPE;
2184 node->u.type_specifier.id_type = yylval.s;
2185 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
2187 | alias_declaration_specifiers CONST
2189 struct ctf_node *node;
2192 node = make_node(scanner, NODE_TYPE_SPECIFIER);
2193 node->u.type_specifier.type = TYPESPEC_CONST;
2194 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
2196 | alias_declaration_specifiers type_specifier
2199 bt_list_add_tail(&($2)->siblings, &($$)->u.type_specifier_list.head);
2201 | alias_declaration_specifiers IDENTIFIER
2203 struct ctf_node *node;
2205 add_type(scanner, $2);
2207 node = make_node(scanner, NODE_TYPE_SPECIFIER);
2208 node->u.type_specifier.type = TYPESPEC_ID_TYPE;
2209 node->u.type_specifier.id_type = yylval.s;
2210 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
2214 struct_or_variant_declarator_list:
2215 struct_or_variant_declarator
2217 | struct_or_variant_declarator_list COMMA struct_or_variant_declarator
2220 bt_list_add_tail(&($3)->siblings, &($$)->tmp_head);
2224 struct_or_variant_declarator:
2227 | COLON unary_expression
2229 | declarator COLON unary_expression
2232 if (set_parent_node($3, $1))
2233 reparent_error(scanner, "struct_or_variant_declarator");
2240 | enumerator_list COMMA enumerator
2243 bt_list_add_tail(&($3)->siblings, &($$)->tmp_head);
2250 $$ = make_node(scanner, NODE_ENUMERATOR);
2251 $$->u.enumerator.id = $1;
2255 $$ = make_node(scanner, NODE_ENUMERATOR);
2256 $$->u.enumerator.id = $1;
2260 $$ = make_node(scanner, NODE_ENUMERATOR);
2261 $$->u.enumerator.id = $1;
2265 $$ = make_node(scanner, NODE_ENUMERATOR);
2266 $$->u.enumerator.id = $1;
2268 | IDENTIFIER EQUAL unary_expression_or_range
2270 $$ = make_node(scanner, NODE_ENUMERATOR);
2271 $$->u.enumerator.id = $1;
2272 bt_list_splice(&($3)->tmp_head, &($$)->u.enumerator.values);
2274 | ID_TYPE EQUAL unary_expression_or_range
2276 $$ = make_node(scanner, NODE_ENUMERATOR);
2277 $$->u.enumerator.id = $1;
2278 bt_list_splice(&($3)->tmp_head, &($$)->u.enumerator.values);
2280 | keywords EQUAL unary_expression_or_range
2282 $$ = make_node(scanner, NODE_ENUMERATOR);
2283 $$->u.enumerator.id = $1;
2284 bt_list_splice(&($3)->tmp_head, &($$)->u.enumerator.values);
2286 | STRING_LITERAL EQUAL unary_expression_or_range
2288 $$ = make_node(scanner, NODE_ENUMERATOR);
2289 $$->u.enumerator.id = $1;
2290 bt_list_splice(&($3)->tmp_head, &($$)->u.enumerator.values);
2294 abstract_declarator_list:
2297 | abstract_declarator_list COMMA abstract_declarator
2300 bt_list_add_tail(&($3)->siblings, &($$)->tmp_head);
2304 abstract_declarator:
2305 direct_abstract_declarator
2307 | pointer direct_abstract_declarator
2310 bt_list_splice(&($1)->tmp_head, &($$)->u.type_declarator.pointers);
2314 direct_abstract_declarator:
2317 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2318 $$->u.type_declarator.type = TYPEDEC_ID;
2323 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2324 $$->u.type_declarator.type = TYPEDEC_ID;
2325 $$->u.type_declarator.u.id = $1;
2327 | LPAREN abstract_declarator RPAREN
2329 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2330 $$->u.type_declarator.type = TYPEDEC_NESTED;
2331 $$->u.type_declarator.u.nested.type_declarator = $2;
2333 | direct_abstract_declarator LSBRAC unary_expression RSBRAC
2335 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2336 $$->u.type_declarator.type = TYPEDEC_NESTED;
2337 $$->u.type_declarator.u.nested.type_declarator = $1;
2338 BT_INIT_LIST_HEAD(&($$)->u.type_declarator.u.nested.length);
2339 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.type_declarator.u.nested.length);
2341 | direct_abstract_declarator LSBRAC RSBRAC
2343 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2344 $$->u.type_declarator.type = TYPEDEC_NESTED;
2345 $$->u.type_declarator.u.nested.type_declarator = $1;
2346 $$->u.type_declarator.u.nested.abstract_array = 1;
2350 alias_abstract_declarator_list:
2351 alias_abstract_declarator
2353 | alias_abstract_declarator_list COMMA alias_abstract_declarator
2356 bt_list_add_tail(&($3)->siblings, &($$)->tmp_head);
2360 alias_abstract_declarator:
2361 direct_alias_abstract_declarator
2363 | pointer direct_alias_abstract_declarator
2366 bt_list_splice(&($1)->tmp_head, &($$)->u.type_declarator.pointers);
2370 direct_alias_abstract_declarator:
2373 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2374 $$->u.type_declarator.type = TYPEDEC_ID;
2377 | LPAREN alias_abstract_declarator RPAREN
2379 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2380 $$->u.type_declarator.type = TYPEDEC_NESTED;
2381 $$->u.type_declarator.u.nested.type_declarator = $2;
2383 | direct_alias_abstract_declarator LSBRAC unary_expression RSBRAC
2385 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2386 $$->u.type_declarator.type = TYPEDEC_NESTED;
2387 $$->u.type_declarator.u.nested.type_declarator = $1;
2388 BT_INIT_LIST_HEAD(&($$)->u.type_declarator.u.nested.length);
2389 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.type_declarator.u.nested.length);
2391 | direct_alias_abstract_declarator LSBRAC RSBRAC
2393 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2394 $$->u.type_declarator.type = TYPEDEC_NESTED;
2395 $$->u.type_declarator.u.nested.type_declarator = $1;
2396 $$->u.type_declarator.u.nested.abstract_array = 1;
2403 | pointer direct_declarator
2406 bt_list_splice(&($1)->tmp_head, &($$)->u.type_declarator.pointers);
2413 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2414 $$->u.type_declarator.type = TYPEDEC_ID;
2415 $$->u.type_declarator.u.id = $1;
2417 | LPAREN declarator RPAREN
2419 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2420 $$->u.type_declarator.type = TYPEDEC_NESTED;
2421 $$->u.type_declarator.u.nested.type_declarator = $2;
2423 | direct_declarator LSBRAC unary_expression RSBRAC
2425 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2426 $$->u.type_declarator.type = TYPEDEC_NESTED;
2427 $$->u.type_declarator.u.nested.type_declarator = $1;
2428 BT_INIT_LIST_HEAD(&($$)->u.type_declarator.u.nested.length);
2429 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.type_declarator.u.nested.length);
2434 direct_type_declarator
2436 | pointer direct_type_declarator
2439 bt_list_splice(&($1)->tmp_head, &($$)->u.type_declarator.pointers);
2443 direct_type_declarator:
2446 add_type(scanner, $1);
2447 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2448 $$->u.type_declarator.type = TYPEDEC_ID;
2449 $$->u.type_declarator.u.id = $1;
2451 | LPAREN type_declarator RPAREN
2453 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2454 $$->u.type_declarator.type = TYPEDEC_NESTED;
2455 $$->u.type_declarator.u.nested.type_declarator = $2;
2457 | direct_type_declarator LSBRAC unary_expression RSBRAC
2459 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2460 $$->u.type_declarator.type = TYPEDEC_NESTED;
2461 $$->u.type_declarator.u.nested.type_declarator = $1;
2462 BT_INIT_LIST_HEAD(&($$)->u.type_declarator.u.nested.length);
2463 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.type_declarator.u.nested.length);
2470 $$ = make_node(scanner, NODE_POINTER);
2474 $$ = make_node(scanner, NODE_POINTER);
2475 bt_list_splice(&($2)->tmp_head, &($$)->tmp_head);
2477 | STAR type_qualifier_list pointer
2479 $$ = make_node(scanner, NODE_POINTER);
2480 $$->u.pointer.const_qualifier = 1;
2481 bt_list_splice(&($3)->tmp_head, &($$)->tmp_head);
2485 type_qualifier_list:
2486 /* pointer assumes only const type qualifier */
2488 | type_qualifier_list CONST
2491 /* 2.3: CTF-specific declarations */
2493 ctf_assignment_expression_list:
2494 ctf_assignment_expression SEMICOLON
2496 | ctf_assignment_expression_list ctf_assignment_expression SEMICOLON
2499 bt_list_add_tail(&($2)->siblings, &($$)->tmp_head);
2503 ctf_assignment_expression:
2504 unary_expression EQUAL unary_expression
2507 * Because we have left and right, cannot use
2510 $$ = make_node(scanner, NODE_CTF_EXPRESSION);
2511 _bt_list_splice_tail(&($1)->tmp_head, &($$)->u.ctf_expression.left);
2512 if ($1->u.unary_expression.type != UNARY_STRING)
2513 reparent_error(scanner, "ctf_assignment_expression left expects string");
2514 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.ctf_expression.right);
2516 | unary_expression TYPEASSIGN declaration_specifiers /* Only allow struct */
2519 * Because we have left and right, cannot use
2522 $$ = make_node(scanner, NODE_CTF_EXPRESSION);
2523 _bt_list_splice_tail(&($1)->tmp_head, &($$)->u.ctf_expression.left);
2524 if ($1->u.unary_expression.type != UNARY_STRING)
2525 reparent_error(scanner, "ctf_assignment_expression left expects string");
2526 bt_list_add_tail(&($3)->siblings, &($$)->u.ctf_expression.right);
2528 | declaration_specifiers TYPEDEF declaration_specifiers type_declarator_list
2530 struct ctf_node *list;
2532 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2533 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2534 _bt_list_splice_tail(&($3)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2535 $$ = make_node(scanner, NODE_TYPEDEF);
2536 ($$)->u.struct_or_variant_declaration.type_specifier_list = list;
2537 _bt_list_splice_tail(&($4)->tmp_head, &($$)->u._typedef.type_declarators);
2539 | TYPEDEF declaration_specifiers type_declarator_list
2541 struct ctf_node *list;
2543 $$ = make_node(scanner, NODE_TYPEDEF);
2544 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2545 $$->u._typedef.type_specifier_list = list;
2546 _bt_list_splice_tail(&($2)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2547 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._typedef.type_declarators);
2549 | declaration_specifiers TYPEDEF type_declarator_list
2551 struct ctf_node *list;
2553 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2554 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2555 $$ = make_node(scanner, NODE_TYPEDEF);
2556 ($$)->u.struct_or_variant_declaration.type_specifier_list = list;
2557 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._typedef.type_declarators);
2559 | TYPEALIAS declaration_specifiers abstract_declarator_list TYPEASSIGN alias_declaration_specifiers alias_abstract_declarator_list
2561 struct ctf_node *list;
2563 $$ = make_node(scanner, NODE_TYPEALIAS);
2564 $$->u.typealias.target = make_node(scanner, NODE_TYPEALIAS_TARGET);
2565 $$->u.typealias.alias = make_node(scanner, NODE_TYPEALIAS_ALIAS);
2567 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2568 $$->u.typealias.target->u.typealias_target.type_specifier_list = list;
2569 _bt_list_splice_tail(&($2)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2570 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.typealias.target->u.typealias_target.type_declarators);
2572 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2573 $$->u.typealias.alias->u.typealias_alias.type_specifier_list = list;
2574 _bt_list_splice_tail(&($5)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2575 _bt_list_splice_tail(&($6)->tmp_head, &($$)->u.typealias.alias->u.typealias_alias.type_declarators);