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
36 #include <babeltrace/list.h>
37 #include <babeltrace/babeltrace-internal.h>
38 #include "ctf-scanner.h"
39 #include "ctf-parser.h"
45 /* Join two lists, put "add" at the end of "head". */
47 _bt_list_splice_tail (struct bt_list_head *add, struct bt_list_head *head)
49 /* Do nothing if the list which gets added is empty. */
50 if (add != add->next) {
51 add->next->prev = head->prev;
52 add->prev->next = head;
53 head->prev->next = add->next;
54 head->prev = add->prev;
59 int yyparse(struct ctf_scanner *scanner);
61 int yylex(union YYSTYPE *yyval, struct ctf_scanner *scanner);
63 int yylex_init_extra(struct ctf_scanner *scanner, yyscan_t * ptr_yy_globals);
65 int yylex_destroy(yyscan_t yyscanner);
67 void yyrestart(FILE * in_str, yyscan_t scanner);
69 int yyget_lineno(yyscan_t yyscanner);
71 char *yyget_text(yyscan_t yyscanner);
74 struct bt_list_head gc;
79 static const char *node_type_to_str[] = {
80 [ NODE_UNKNOWN ] = "NODE_UNKNOWN",
81 [ NODE_ROOT ] = "NODE_ROOT",
82 [ NODE_EVENT ] = "NODE_EVENT",
83 [ NODE_ENV ] = "NODE_ENV",
84 [ NODE_STREAM ] = "NODE_STREAM",
85 [ NODE_TRACE ] = "NODE_TRACE",
86 [ NODE_CLOCK ] = "NODE_CLOCK",
87 [ NODE_CALLSITE ] = "NODE_CALLSITE",
88 [ NODE_CTF_EXPRESSION ] = "NODE_CTF_EXPRESSION",
89 [ NODE_UNARY_EXPRESSION ] = "NODE_UNARY_EXPRESSION",
90 [ NODE_TYPEDEF ] = "NODE_TYPEDEF",
91 [ NODE_TYPEALIAS_TARGET ] = "NODE_TYPEALIAS_TARGET",
92 [ NODE_TYPEALIAS_ALIAS ] = "NODE_TYPEALIAS_ALIAS",
93 [ NODE_TYPEALIAS ] = "NODE_TYPEALIAS",
94 [ NODE_TYPE_SPECIFIER ] = "NODE_TYPE_SPECIFIER",
95 [ NODE_TYPE_SPECIFIER_LIST ] = "NODE_TYPE_SPECIFIER_LIST",
96 [ NODE_POINTER ] = "NODE_POINTER",
97 [ NODE_TYPE_DECLARATOR ] = "NODE_TYPE_DECLARATOR",
98 [ NODE_FLOATING_POINT ] = "NODE_FLOATING_POINT",
99 [ NODE_INTEGER ] = "NODE_INTEGER",
100 [ NODE_STRING ] = "NODE_STRING",
101 [ NODE_ENUMERATOR ] = "NODE_ENUMERATOR",
102 [ NODE_ENUM ] = "NODE_ENUM",
103 [ NODE_STRUCT_OR_VARIANT_DECLARATION ] = "NODE_STRUCT_OR_VARIANT_DECLARATION",
104 [ NODE_VARIANT ] = "NODE_VARIANT",
105 [ NODE_STRUCT ] = "NODE_STRUCT",
109 const char *node_type(struct ctf_node *node)
111 if (node->type < NR_NODE_TYPES)
112 return node_type_to_str[node->type];
117 static struct gc_string *gc_string_alloc(struct ctf_scanner *scanner,
120 struct gc_string *gstr;
123 /* TODO: could be faster with find first bit or glib Gstring */
124 /* sizeof long to account for malloc header (int or long ?) */
125 for (alloclen = 8; alloclen < sizeof(long) + sizeof(*gstr) + len;
128 gstr = malloc(alloclen);
129 bt_list_add(&gstr->gc, &scanner->allocated_strings);
130 gstr->alloclen = alloclen;
135 * note: never use gc_string_append on a string that has external references.
136 * gsrc will be garbage collected immediately, and gstr might be.
137 * Should only be used to append characters to a string literal or constant.
140 struct gc_string *gc_string_append(struct ctf_scanner *scanner,
141 struct gc_string *gstr,
142 struct gc_string *gsrc)
144 size_t newlen = strlen(gsrc->s) + strlen(gstr->s) + 1;
147 /* TODO: could be faster with find first bit or glib Gstring */
148 /* sizeof long to account for malloc header (int or long ?) */
149 for (alloclen = 8; alloclen < sizeof(long) + sizeof(*gstr) + newlen;
152 if (alloclen > gstr->alloclen) {
153 struct gc_string *newgstr;
155 newgstr = gc_string_alloc(scanner, newlen);
156 strcpy(newgstr->s, gstr->s);
157 strcat(newgstr->s, gsrc->s);
158 bt_list_del(&gstr->gc);
162 strcat(gstr->s, gsrc->s);
164 bt_list_del(&gsrc->gc);
169 void setstring(struct ctf_scanner *scanner, YYSTYPE *lvalp, const char *src)
171 lvalp->gs = gc_string_alloc(scanner, strlen(src) + 1);
172 strcpy(lvalp->gs->s, src);
175 static void init_scope(struct ctf_scanner_scope *scope,
176 struct ctf_scanner_scope *parent)
178 scope->parent = parent;
179 scope->types = g_hash_table_new_full(g_str_hash, g_str_equal,
183 static void finalize_scope(struct ctf_scanner_scope *scope)
185 g_hash_table_destroy(scope->types);
188 static void push_scope(struct ctf_scanner *scanner)
190 struct ctf_scanner_scope *ns;
192 printf_debug("push scope\n");
193 ns = malloc(sizeof(struct ctf_scanner_scope));
194 init_scope(ns, scanner->cs);
198 static void pop_scope(struct ctf_scanner *scanner)
200 struct ctf_scanner_scope *os;
202 printf_debug("pop scope\n");
204 scanner->cs = os->parent;
209 static int lookup_type(struct ctf_scanner_scope *s, const char *id)
213 ret = (int) (long) g_hash_table_lookup(s->types, id);
214 printf_debug("lookup %p %s %d\n", s, id, ret);
219 int is_type(struct ctf_scanner *scanner, const char *id)
221 struct ctf_scanner_scope *it;
224 for (it = scanner->cs; it != NULL; it = it->parent) {
225 if (lookup_type(it, id)) {
230 printf_debug("is type %s %d\n", id, ret);
234 static void add_type(struct ctf_scanner *scanner, struct gc_string *id)
236 printf_debug("add type %s\n", id->s);
237 if (lookup_type(scanner->cs, id->s))
239 g_hash_table_insert(scanner->cs->types, id->s, id->s);
242 static struct ctf_node *make_node(struct ctf_scanner *scanner,
245 struct ctf_ast *ast = ctf_scanner_get_ast(scanner);
246 struct ctf_node *node;
248 node = malloc(sizeof(*node));
251 memset(node, 0, sizeof(*node));
253 node->lineno = yyget_lineno(scanner->scanner);
254 BT_INIT_LIST_HEAD(&node->tmp_head);
255 bt_list_add(&node->gc, &ast->allocated_nodes);
256 bt_list_add(&node->siblings, &node->tmp_head);
260 printfn_fatal(node, "trying to create root node");
264 BT_INIT_LIST_HEAD(&node->u.event.declaration_list);
267 BT_INIT_LIST_HEAD(&node->u.stream.declaration_list);
270 BT_INIT_LIST_HEAD(&node->u.env.declaration_list);
273 BT_INIT_LIST_HEAD(&node->u.trace.declaration_list);
276 BT_INIT_LIST_HEAD(&node->u.clock.declaration_list);
279 BT_INIT_LIST_HEAD(&node->u.callsite.declaration_list);
282 case NODE_CTF_EXPRESSION:
283 BT_INIT_LIST_HEAD(&node->u.ctf_expression.left);
284 BT_INIT_LIST_HEAD(&node->u.ctf_expression.right);
286 case NODE_UNARY_EXPRESSION:
290 BT_INIT_LIST_HEAD(&node->u._typedef.type_declarators);
292 case NODE_TYPEALIAS_TARGET:
293 BT_INIT_LIST_HEAD(&node->u.typealias_target.type_declarators);
295 case NODE_TYPEALIAS_ALIAS:
296 BT_INIT_LIST_HEAD(&node->u.typealias_alias.type_declarators);
301 case NODE_TYPE_SPECIFIER:
303 case NODE_TYPE_SPECIFIER_LIST:
304 BT_INIT_LIST_HEAD(&node->u.type_specifier_list.head);
308 case NODE_TYPE_DECLARATOR:
309 BT_INIT_LIST_HEAD(&node->u.type_declarator.pointers);
312 case NODE_FLOATING_POINT:
313 BT_INIT_LIST_HEAD(&node->u.floating_point.expressions);
316 BT_INIT_LIST_HEAD(&node->u.integer.expressions);
319 BT_INIT_LIST_HEAD(&node->u.string.expressions);
321 case NODE_ENUMERATOR:
322 BT_INIT_LIST_HEAD(&node->u.enumerator.values);
325 BT_INIT_LIST_HEAD(&node->u._enum.enumerator_list);
327 case NODE_STRUCT_OR_VARIANT_DECLARATION:
328 BT_INIT_LIST_HEAD(&node->u.struct_or_variant_declaration.type_declarators);
331 BT_INIT_LIST_HEAD(&node->u.variant.declaration_list);
334 BT_INIT_LIST_HEAD(&node->u._struct.declaration_list);
335 BT_INIT_LIST_HEAD(&node->u._struct.min_align);
340 printfn_fatal(node, "unknown node type '%d'", (int) type);
347 static int reparent_ctf_expression(struct ctf_node *node,
348 struct ctf_node *parent)
350 switch (parent->type) {
352 _bt_list_splice_tail(&node->tmp_head, &parent->u.event.declaration_list);
355 _bt_list_splice_tail(&node->tmp_head, &parent->u.stream.declaration_list);
358 _bt_list_splice_tail(&node->tmp_head, &parent->u.env.declaration_list);
361 _bt_list_splice_tail(&node->tmp_head, &parent->u.trace.declaration_list);
364 _bt_list_splice_tail(&node->tmp_head, &parent->u.clock.declaration_list);
367 _bt_list_splice_tail(&node->tmp_head, &parent->u.callsite.declaration_list);
369 case NODE_FLOATING_POINT:
370 _bt_list_splice_tail(&node->tmp_head, &parent->u.floating_point.expressions);
373 _bt_list_splice_tail(&node->tmp_head, &parent->u.integer.expressions);
376 _bt_list_splice_tail(&node->tmp_head, &parent->u.string.expressions);
380 case NODE_CTF_EXPRESSION:
382 case NODE_TYPEALIAS_TARGET:
383 case NODE_TYPEALIAS_ALIAS:
385 case NODE_TYPE_SPECIFIER:
386 case NODE_TYPE_SPECIFIER_LIST:
388 case NODE_TYPE_DECLARATOR:
389 case NODE_ENUMERATOR:
391 case NODE_STRUCT_OR_VARIANT_DECLARATION:
394 case NODE_UNARY_EXPRESSION:
399 printfn_fatal(node, "unknown node type '%d'", (int) parent->type);
405 static int reparent_typedef(struct ctf_node *node, struct ctf_node *parent)
407 switch (parent->type) {
409 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.declaration_list);
412 _bt_list_splice_tail(&node->tmp_head, &parent->u.event.declaration_list);
415 _bt_list_splice_tail(&node->tmp_head, &parent->u.stream.declaration_list);
418 _bt_list_splice_tail(&node->tmp_head, &parent->u.env.declaration_list);
421 _bt_list_splice_tail(&node->tmp_head, &parent->u.trace.declaration_list);
424 _bt_list_splice_tail(&node->tmp_head, &parent->u.clock.declaration_list);
427 _bt_list_splice_tail(&node->tmp_head, &parent->u.callsite.declaration_list);
430 _bt_list_splice_tail(&node->tmp_head, &parent->u.variant.declaration_list);
433 _bt_list_splice_tail(&node->tmp_head, &parent->u._struct.declaration_list);
436 case NODE_FLOATING_POINT:
439 case NODE_CTF_EXPRESSION:
441 case NODE_TYPEALIAS_TARGET:
442 case NODE_TYPEALIAS_ALIAS:
444 case NODE_TYPE_SPECIFIER:
445 case NODE_TYPE_SPECIFIER_LIST:
447 case NODE_TYPE_DECLARATOR:
448 case NODE_ENUMERATOR:
450 case NODE_STRUCT_OR_VARIANT_DECLARATION:
451 case NODE_UNARY_EXPRESSION:
456 printfn_fatal(node, "unknown node type %d", parent->type);
462 static int reparent_typealias(struct ctf_node *node, struct ctf_node *parent)
464 switch (parent->type) {
466 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.declaration_list);
469 _bt_list_splice_tail(&node->tmp_head, &parent->u.event.declaration_list);
472 _bt_list_splice_tail(&node->tmp_head, &parent->u.stream.declaration_list);
475 _bt_list_splice_tail(&node->tmp_head, &parent->u.env.declaration_list);
478 _bt_list_splice_tail(&node->tmp_head, &parent->u.trace.declaration_list);
481 _bt_list_splice_tail(&node->tmp_head, &parent->u.clock.declaration_list);
484 _bt_list_splice_tail(&node->tmp_head, &parent->u.callsite.declaration_list);
487 _bt_list_splice_tail(&node->tmp_head, &parent->u.variant.declaration_list);
490 _bt_list_splice_tail(&node->tmp_head, &parent->u._struct.declaration_list);
493 case NODE_FLOATING_POINT:
496 case NODE_CTF_EXPRESSION:
498 case NODE_TYPEALIAS_TARGET:
499 case NODE_TYPEALIAS_ALIAS:
501 case NODE_TYPE_SPECIFIER:
502 case NODE_TYPE_SPECIFIER_LIST:
504 case NODE_TYPE_DECLARATOR:
505 case NODE_ENUMERATOR:
507 case NODE_STRUCT_OR_VARIANT_DECLARATION:
508 case NODE_UNARY_EXPRESSION:
513 printfn_fatal(node, "unknown node type '%d'", (int) parent->type);
519 static int reparent_type_specifier(struct ctf_node *node,
520 struct ctf_node *parent)
522 switch (parent->type) {
523 case NODE_TYPE_SPECIFIER_LIST:
524 _bt_list_splice_tail(&node->tmp_head, &parent->u.type_specifier_list.head);
527 case NODE_TYPE_SPECIFIER:
537 case NODE_TYPEALIAS_TARGET:
538 case NODE_TYPEALIAS_ALIAS:
539 case NODE_TYPE_DECLARATOR:
541 case NODE_STRUCT_OR_VARIANT_DECLARATION:
543 case NODE_FLOATING_POINT:
546 case NODE_CTF_EXPRESSION:
548 case NODE_ENUMERATOR:
549 case NODE_UNARY_EXPRESSION:
554 printfn_fatal(node, "unknown node type '%d'", (int) parent->type);
560 static int reparent_type_specifier_list(struct ctf_node *node,
561 struct ctf_node *parent)
563 switch (parent->type) {
565 bt_list_add_tail(&node->siblings, &parent->u.root.declaration_list);
568 bt_list_add_tail(&node->siblings, &parent->u.event.declaration_list);
571 bt_list_add_tail(&node->siblings, &parent->u.stream.declaration_list);
574 bt_list_add_tail(&node->siblings, &parent->u.env.declaration_list);
577 bt_list_add_tail(&node->siblings, &parent->u.trace.declaration_list);
580 bt_list_add_tail(&node->siblings, &parent->u.clock.declaration_list);
583 bt_list_add_tail(&node->siblings, &parent->u.callsite.declaration_list);
586 bt_list_add_tail(&node->siblings, &parent->u.variant.declaration_list);
589 bt_list_add_tail(&node->siblings, &parent->u._struct.declaration_list);
592 parent->u._typedef.type_specifier_list = node;
594 case NODE_TYPEALIAS_TARGET:
595 parent->u.typealias_target.type_specifier_list = node;
597 case NODE_TYPEALIAS_ALIAS:
598 parent->u.typealias_alias.type_specifier_list = node;
601 parent->u._enum.container_type = node;
603 case NODE_STRUCT_OR_VARIANT_DECLARATION:
604 parent->u.struct_or_variant_declaration.type_specifier_list = node;
606 case NODE_TYPE_DECLARATOR:
607 case NODE_TYPE_SPECIFIER:
609 case NODE_FLOATING_POINT:
612 case NODE_CTF_EXPRESSION:
614 case NODE_ENUMERATOR:
615 case NODE_UNARY_EXPRESSION:
620 printfn_fatal(node, "unknown node type '%d'", (int) parent->type);
626 static int reparent_type_declarator(struct ctf_node *node,
627 struct ctf_node *parent)
629 switch (parent->type) {
630 case NODE_TYPE_DECLARATOR:
631 parent->u.type_declarator.type = TYPEDEC_NESTED;
632 parent->u.type_declarator.u.nested.type_declarator = node;
634 case NODE_STRUCT_OR_VARIANT_DECLARATION:
635 _bt_list_splice_tail(&node->tmp_head, &parent->u.struct_or_variant_declaration.type_declarators);
638 _bt_list_splice_tail(&node->tmp_head, &parent->u._typedef.type_declarators);
640 case NODE_TYPEALIAS_TARGET:
641 _bt_list_splice_tail(&node->tmp_head, &parent->u.typealias_target.type_declarators);
643 case NODE_TYPEALIAS_ALIAS:
644 _bt_list_splice_tail(&node->tmp_head, &parent->u.typealias_alias.type_declarators);
658 case NODE_FLOATING_POINT:
661 case NODE_CTF_EXPRESSION:
662 case NODE_TYPE_SPECIFIER:
663 case NODE_TYPE_SPECIFIER_LIST:
665 case NODE_ENUMERATOR:
666 case NODE_UNARY_EXPRESSION:
671 printfn_fatal(node, "unknown node type '%d'", (int) parent->type);
680 * Link node to parent. Returns 0 on success, -EPERM if it is not permitted to
681 * create the link declared by the input, -ENOENT if node or parent is NULL,
682 * -EINVAL if there is an internal structure problem.
684 static int set_parent_node(struct ctf_node *node,
685 struct ctf_node *parent)
687 if (!node || !parent)
690 /* Note: Linking to parent will be done only by an external visitor */
692 switch (node->type) {
694 printfn_fatal(node, "trying to reparent root node");
698 if (parent->type == NODE_ROOT) {
699 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.event);
705 if (parent->type == NODE_ROOT) {
706 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.stream);
712 if (parent->type == NODE_ROOT) {
713 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.env);
719 if (parent->type == NODE_ROOT) {
720 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.trace);
726 if (parent->type == NODE_ROOT) {
727 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.clock);
733 if (parent->type == NODE_ROOT) {
734 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.callsite);
740 case NODE_CTF_EXPRESSION:
741 return reparent_ctf_expression(node, parent);
742 case NODE_UNARY_EXPRESSION:
743 if (parent->type == NODE_TYPE_DECLARATOR)
744 parent->u.type_declarator.bitfield_len = node;
750 return reparent_typedef(node, parent);
751 case NODE_TYPEALIAS_TARGET:
752 if (parent->type == NODE_TYPEALIAS)
753 parent->u.typealias.target = node;
756 case NODE_TYPEALIAS_ALIAS:
757 if (parent->type == NODE_TYPEALIAS)
758 parent->u.typealias.alias = node;
762 return reparent_typealias(node, parent);
765 if (parent->type == NODE_TYPE_DECLARATOR) {
766 _bt_list_splice_tail(&node->tmp_head, &parent->u.type_declarator.pointers);
770 case NODE_TYPE_DECLARATOR:
771 return reparent_type_declarator(node, parent);
773 case NODE_TYPE_SPECIFIER_LIST:
774 return reparent_type_specifier_list(node, parent);
776 case NODE_TYPE_SPECIFIER:
777 return reparent_type_specifier(node, parent);
779 case NODE_FLOATING_POINT:
785 return -EINVAL; /* Dealt with internally within grammar */
787 case NODE_ENUMERATOR:
788 if (parent->type == NODE_ENUM) {
789 _bt_list_splice_tail(&node->tmp_head, &parent->u._enum.enumerator_list);
794 case NODE_STRUCT_OR_VARIANT_DECLARATION:
795 switch (parent->type) {
797 _bt_list_splice_tail(&node->tmp_head, &parent->u._struct.declaration_list);
800 _bt_list_splice_tail(&node->tmp_head, &parent->u.variant.declaration_list);
809 printfn_fatal(node, "unknown node type '%d'", (int) parent->type);
816 void yyerror(struct ctf_scanner *scanner, const char *str)
818 printfl_error(yyget_lineno(scanner->scanner),
819 "token \"%s\": %s\n",
820 yyget_text(scanner->scanner), str);
829 #define reparent_error(scanner, str) \
831 yyerror(scanner, YY_("reparent_error: " str)); \
835 static void free_strings(struct bt_list_head *list)
837 struct gc_string *gstr, *tmp;
839 bt_list_for_each_entry_safe(gstr, tmp, list, gc)
843 static struct ctf_ast *ctf_ast_alloc(void)
847 ast = malloc(sizeof(*ast));
850 memset(ast, 0, sizeof(*ast));
851 BT_INIT_LIST_HEAD(&ast->allocated_nodes);
852 ast->root.type = NODE_ROOT;
853 BT_INIT_LIST_HEAD(&ast->root.tmp_head);
854 BT_INIT_LIST_HEAD(&ast->root.u.root.declaration_list);
855 BT_INIT_LIST_HEAD(&ast->root.u.root.trace);
856 BT_INIT_LIST_HEAD(&ast->root.u.root.env);
857 BT_INIT_LIST_HEAD(&ast->root.u.root.stream);
858 BT_INIT_LIST_HEAD(&ast->root.u.root.event);
859 BT_INIT_LIST_HEAD(&ast->root.u.root.clock);
860 BT_INIT_LIST_HEAD(&ast->root.u.root.callsite);
864 static void ctf_ast_free(struct ctf_ast *ast)
866 struct ctf_node *node, *tmp;
868 bt_list_for_each_entry_safe(node, tmp, &ast->allocated_nodes, gc)
873 int ctf_scanner_append_ast(struct ctf_scanner *scanner)
875 return yyparse(scanner);
878 struct ctf_scanner *ctf_scanner_alloc(FILE *input)
880 struct ctf_scanner *scanner;
883 yydebug = babeltrace_debug;
885 scanner = malloc(sizeof(*scanner));
888 memset(scanner, 0, sizeof(*scanner));
890 ret = yylex_init_extra(scanner, &scanner->scanner);
892 printf_fatal("yylex_init error");
893 goto cleanup_scanner;
895 /* Start processing new stream */
896 yyrestart(input, scanner->scanner);
898 scanner->ast = ctf_ast_alloc();
901 init_scope(&scanner->root_scope, NULL);
902 scanner->cs = &scanner->root_scope;
903 BT_INIT_LIST_HEAD(&scanner->allocated_strings);
906 fprintf(stdout, "Scanner input is a%s.\n",
907 isatty(fileno(input)) ? "n interactive tty" :
908 " noninteractive file");
913 ret = yylex_destroy(scanner->scanner);
915 printf_fatal("yylex_destroy error");
921 void ctf_scanner_free(struct ctf_scanner *scanner)
925 finalize_scope(&scanner->root_scope);
926 free_strings(&scanner->allocated_strings);
927 ctf_ast_free(scanner->ast);
928 ret = yylex_destroy(scanner->scanner);
930 printf_error("yylex_destroy error");
939 %parse-param {struct ctf_scanner *scanner}
940 %lex-param {struct ctf_scanner *scanner}
942 * Expect two shift-reduce conflicts. Caused by enum name-opt : type {}
943 * vs struct { int :value; } (unnamed bit-field). The default is to
944 * shift, so whenever we encounter an enumeration, we are doing the
945 * proper thing (shift). It is illegal to declare an enumeration
946 * "bit-field", so it is OK if this situation ends up in a parsing
951 %token CHARACTER_CONSTANT_START SQUOTE STRING_LITERAL_START DQUOTE ESCSEQ CHAR_STRING_TOKEN 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 DECIMAL_CONSTANT OCTAL_CONSTANT HEXADECIMAL_CONSTANT TOK_ALIGN
952 %token <gs> IDENTIFIER ID_TYPE
958 struct gc_string *gs;
963 %type <gs> s_char s_char_sequence c_char c_char_sequence
965 %type <n> postfix_expression unary_expression unary_expression_or_range
967 %type <n> declaration
968 %type <n> event_declaration
969 %type <n> stream_declaration
970 %type <n> env_declaration
971 %type <n> trace_declaration
972 %type <n> clock_declaration
973 %type <n> callsite_declaration
974 %type <n> integer_declaration_specifiers
975 %type <n> declaration_specifiers
976 %type <n> alias_declaration_specifiers
978 %type <n> type_declarator_list
979 %type <n> integer_type_specifier
980 %type <n> type_specifier
981 %type <n> struct_type_specifier
982 %type <n> variant_type_specifier
983 %type <n> enum_type_specifier
984 %type <n> struct_or_variant_declaration_list
985 %type <n> struct_or_variant_declaration
986 %type <n> struct_or_variant_declarator_list
987 %type <n> struct_or_variant_declarator
988 %type <n> enumerator_list
990 %type <n> abstract_declarator_list
991 %type <n> abstract_declarator
992 %type <n> direct_abstract_declarator
993 %type <n> alias_abstract_declarator_list
994 %type <n> alias_abstract_declarator
995 %type <n> direct_alias_abstract_declarator
997 %type <n> direct_declarator
998 %type <n> type_declarator
999 %type <n> direct_type_declarator
1001 %type <n> ctf_assignment_expression_list
1002 %type <n> ctf_assignment_expression
1009 if (set_parent_node($1, &ctf_scanner_get_ast(scanner)->root))
1010 reparent_error(scanner, "error reparenting to root");
1014 if (set_parent_node($2, &ctf_scanner_get_ast(scanner)->root))
1015 reparent_error(scanner, "error reparenting to root");
1081 | c_char_sequence c_char
1082 { $$ = gc_string_append(scanner, $1, $2); }
1090 reparent_error(scanner, "escape sequences not supported yet");
1094 /* 1.6 String literals */
1099 | s_char_sequence s_char
1100 { $$ = gc_string_append(scanner, $1, $2); }
1108 reparent_error(scanner, "escape sequences not supported yet");
1112 /* 2: Phrase structure grammar */
1117 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1118 $$->u.unary_expression.type = UNARY_STRING;
1119 $$->u.unary_expression.u.string = yylval.gs->s;
1123 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1124 $$->u.unary_expression.type = UNARY_STRING;
1125 $$->u.unary_expression.u.string = yylval.gs->s;
1129 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1130 $$->u.unary_expression.type = UNARY_STRING;
1131 $$->u.unary_expression.u.string = yylval.gs->s;
1135 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1136 $$->u.unary_expression.type = UNARY_UNSIGNED_CONSTANT;
1137 sscanf(yylval.gs->s, "%" PRIu64,
1138 &$$->u.unary_expression.u.unsigned_constant);
1142 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1143 $$->u.unary_expression.type = UNARY_UNSIGNED_CONSTANT;
1144 sscanf(yylval.gs->s, "0%" PRIo64,
1145 &$$->u.unary_expression.u.unsigned_constant);
1147 | HEXADECIMAL_CONSTANT
1149 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1150 $$->u.unary_expression.type = UNARY_UNSIGNED_CONSTANT;
1151 sscanf(yylval.gs->s, "0x%" PRIx64,
1152 &$$->u.unary_expression.u.unsigned_constant);
1154 | STRING_LITERAL_START DQUOTE
1156 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1157 $$->u.unary_expression.type = UNARY_STRING;
1158 $$->u.unary_expression.u.string = "";
1160 | STRING_LITERAL_START s_char_sequence DQUOTE
1162 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1163 $$->u.unary_expression.type = UNARY_STRING;
1164 $$->u.unary_expression.u.string = $2->s;
1166 | CHARACTER_CONSTANT_START c_char_sequence SQUOTE
1168 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1169 $$->u.unary_expression.type = UNARY_STRING;
1170 $$->u.unary_expression.u.string = $2->s;
1172 | LPAREN unary_expression RPAREN
1174 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1175 $$->u.unary_expression.type = UNARY_NESTED;
1176 $$->u.unary_expression.u.nested_exp = $2;
1178 | postfix_expression LSBRAC unary_expression RSBRAC
1180 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1181 $$->u.unary_expression.type = UNARY_SBRAC;
1182 $$->u.unary_expression.u.sbrac_exp = $3;
1183 bt_list_splice(&($1)->tmp_head, &($$)->tmp_head);
1184 bt_list_add_tail(&($$)->siblings, &($$)->tmp_head);
1186 | postfix_expression DOT IDENTIFIER
1188 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1189 $$->u.unary_expression.type = UNARY_STRING;
1190 $$->u.unary_expression.u.string = yylval.gs->s;
1191 $$->u.unary_expression.link = UNARY_DOTLINK;
1192 bt_list_splice(&($1)->tmp_head, &($$)->tmp_head);
1193 bt_list_add_tail(&($$)->siblings, &($$)->tmp_head);
1195 | postfix_expression DOT ID_TYPE
1197 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1198 $$->u.unary_expression.type = UNARY_STRING;
1199 $$->u.unary_expression.u.string = yylval.gs->s;
1200 $$->u.unary_expression.link = UNARY_DOTLINK;
1201 bt_list_splice(&($1)->tmp_head, &($$)->tmp_head);
1202 bt_list_add_tail(&($$)->siblings, &($$)->tmp_head);
1204 | postfix_expression RARROW IDENTIFIER
1206 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1207 $$->u.unary_expression.type = UNARY_STRING;
1208 $$->u.unary_expression.u.string = yylval.gs->s;
1209 $$->u.unary_expression.link = UNARY_ARROWLINK;
1210 bt_list_splice(&($1)->tmp_head, &($$)->tmp_head);
1211 bt_list_add_tail(&($$)->siblings, &($$)->tmp_head);
1213 | postfix_expression RARROW ID_TYPE
1215 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1216 $$->u.unary_expression.type = UNARY_STRING;
1217 $$->u.unary_expression.u.string = yylval.gs->s;
1218 $$->u.unary_expression.link = UNARY_ARROWLINK;
1219 bt_list_splice(&($1)->tmp_head, &($$)->tmp_head);
1220 bt_list_add_tail(&($$)->siblings, &($$)->tmp_head);
1227 | PLUS postfix_expression
1229 | MINUS postfix_expression
1232 if ($$->u.unary_expression.type == UNARY_UNSIGNED_CONSTANT) {
1233 $$->u.unary_expression.type = UNARY_SIGNED_CONSTANT;
1234 $$->u.unary_expression.u.signed_constant =
1235 -($$->u.unary_expression.u.unsigned_constant);
1236 } else if ($$->u.unary_expression.type == UNARY_UNSIGNED_CONSTANT) {
1237 $$->u.unary_expression.u.signed_constant =
1238 -($$->u.unary_expression.u.signed_constant);
1240 reparent_error(scanner, "expecting numeric constant");
1245 unary_expression_or_range:
1246 unary_expression DOTDOTDOT unary_expression
1249 _bt_list_splice_tail(&($3)->tmp_head, &($$)->tmp_head);
1250 $3->u.unary_expression.link = UNARY_DOTDOTDOT;
1256 /* 2.2: Declarations */
1259 declaration_specifiers SEMICOLON
1263 | stream_declaration
1271 | callsite_declaration
1273 | declaration_specifiers TYPEDEF declaration_specifiers type_declarator_list SEMICOLON
1275 struct ctf_node *list;
1277 $$ = make_node(scanner, NODE_TYPEDEF);
1278 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1279 $$->u._typedef.type_specifier_list = list;
1280 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
1281 _bt_list_splice_tail(&($3)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
1282 _bt_list_splice_tail(&($4)->tmp_head, &($$)->u._typedef.type_declarators);
1284 | TYPEDEF declaration_specifiers type_declarator_list SEMICOLON
1286 struct ctf_node *list;
1288 $$ = make_node(scanner, NODE_TYPEDEF);
1289 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1290 $$->u._typedef.type_specifier_list = list;
1291 _bt_list_splice_tail(&($2)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
1292 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._typedef.type_declarators);
1294 | declaration_specifiers TYPEDEF type_declarator_list SEMICOLON
1296 struct ctf_node *list;
1298 $$ = make_node(scanner, NODE_TYPEDEF);
1299 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1300 $$->u._typedef.type_specifier_list = list;
1301 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
1302 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._typedef.type_declarators);
1304 | TYPEALIAS declaration_specifiers abstract_declarator_list TYPEASSIGN alias_declaration_specifiers alias_abstract_declarator_list SEMICOLON
1306 struct ctf_node *list;
1308 $$ = make_node(scanner, NODE_TYPEALIAS);
1309 $$->u.typealias.target = make_node(scanner, NODE_TYPEALIAS_TARGET);
1310 $$->u.typealias.alias = make_node(scanner, NODE_TYPEALIAS_ALIAS);
1312 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1313 $$->u.typealias.target->u.typealias_target.type_specifier_list = list;
1314 _bt_list_splice_tail(&($2)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
1315 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.typealias.target->u.typealias_target.type_declarators);
1317 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1318 $$->u.typealias.alias->u.typealias_alias.type_specifier_list = list;
1319 _bt_list_splice_tail(&($5)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
1320 _bt_list_splice_tail(&($6)->tmp_head, &($$)->u.typealias.alias->u.typealias_alias.type_declarators);
1325 event_declaration_begin event_declaration_end
1327 $$ = make_node(scanner, NODE_EVENT);
1329 | event_declaration_begin ctf_assignment_expression_list event_declaration_end
1331 $$ = make_node(scanner, NODE_EVENT);
1332 if (set_parent_node($2, $$))
1333 reparent_error(scanner, "event_declaration");
1337 event_declaration_begin:
1339 { push_scope(scanner); }
1342 event_declaration_end:
1344 { pop_scope(scanner); }
1349 stream_declaration_begin stream_declaration_end
1351 $$ = make_node(scanner, NODE_STREAM);
1353 | stream_declaration_begin ctf_assignment_expression_list stream_declaration_end
1355 $$ = make_node(scanner, NODE_STREAM);
1356 if (set_parent_node($2, $$))
1357 reparent_error(scanner, "stream_declaration");
1361 stream_declaration_begin:
1363 { push_scope(scanner); }
1366 stream_declaration_end:
1368 { pop_scope(scanner); }
1372 env_declaration_begin env_declaration_end
1374 $$ = make_node(scanner, NODE_ENV);
1376 | env_declaration_begin ctf_assignment_expression_list env_declaration_end
1378 $$ = make_node(scanner, NODE_ENV);
1379 if (set_parent_node($2, $$))
1380 reparent_error(scanner, "env declaration");
1384 env_declaration_begin:
1386 { push_scope(scanner); }
1389 env_declaration_end:
1391 { pop_scope(scanner); }
1395 trace_declaration_begin trace_declaration_end
1397 $$ = make_node(scanner, NODE_TRACE);
1399 | trace_declaration_begin ctf_assignment_expression_list trace_declaration_end
1401 $$ = make_node(scanner, NODE_TRACE);
1402 if (set_parent_node($2, $$))
1403 reparent_error(scanner, "trace_declaration");
1407 trace_declaration_begin:
1409 { push_scope(scanner); }
1412 trace_declaration_end:
1414 { pop_scope(scanner); }
1418 CLOCK clock_declaration_begin clock_declaration_end
1420 $$ = make_node(scanner, NODE_CLOCK);
1422 | CLOCK clock_declaration_begin ctf_assignment_expression_list clock_declaration_end
1424 $$ = make_node(scanner, NODE_CLOCK);
1425 if (set_parent_node($3, $$))
1426 reparent_error(scanner, "trace_declaration");
1430 clock_declaration_begin:
1432 { push_scope(scanner); }
1435 clock_declaration_end:
1437 { pop_scope(scanner); }
1440 callsite_declaration:
1441 CALLSITE callsite_declaration_begin callsite_declaration_end
1443 $$ = make_node(scanner, NODE_CALLSITE);
1445 | CALLSITE callsite_declaration_begin ctf_assignment_expression_list callsite_declaration_end
1447 $$ = make_node(scanner, NODE_CALLSITE);
1448 if (set_parent_node($3, $$))
1449 reparent_error(scanner, "trace_declaration");
1453 callsite_declaration_begin:
1455 { push_scope(scanner); }
1458 callsite_declaration_end:
1460 { pop_scope(scanner); }
1463 integer_declaration_specifiers:
1466 struct ctf_node *node;
1468 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1469 node = make_node(scanner, NODE_TYPE_SPECIFIER);
1470 node->u.type_specifier.type = TYPESPEC_CONST;
1471 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
1473 | integer_type_specifier
1475 struct ctf_node *node;
1477 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1479 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
1481 | integer_declaration_specifiers CONST
1483 struct ctf_node *node;
1486 node = make_node(scanner, NODE_TYPE_SPECIFIER);
1487 node->u.type_specifier.type = TYPESPEC_CONST;
1488 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
1490 | integer_declaration_specifiers integer_type_specifier
1493 bt_list_add_tail(&($2)->siblings, &($$)->u.type_specifier_list.head);
1497 declaration_specifiers:
1500 struct ctf_node *node;
1502 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1503 node = make_node(scanner, NODE_TYPE_SPECIFIER);
1504 node->u.type_specifier.type = TYPESPEC_CONST;
1505 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
1509 struct ctf_node *node;
1511 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1513 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
1515 | declaration_specifiers CONST
1517 struct ctf_node *node;
1520 node = make_node(scanner, NODE_TYPE_SPECIFIER);
1521 node->u.type_specifier.type = TYPESPEC_CONST;
1522 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
1524 | declaration_specifiers type_specifier
1527 bt_list_add_tail(&($2)->siblings, &($$)->u.type_specifier_list.head);
1531 type_declarator_list:
1534 | type_declarator_list COMMA type_declarator
1537 bt_list_add_tail(&($3)->siblings, &($$)->tmp_head);
1541 integer_type_specifier:
1544 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1545 $$->u.type_specifier.type = TYPESPEC_CHAR;
1549 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1550 $$->u.type_specifier.type = TYPESPEC_SHORT;
1554 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1555 $$->u.type_specifier.type = TYPESPEC_INT;
1559 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1560 $$->u.type_specifier.type = TYPESPEC_LONG;
1564 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1565 $$->u.type_specifier.type = TYPESPEC_SIGNED;
1569 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1570 $$->u.type_specifier.type = TYPESPEC_UNSIGNED;
1574 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1575 $$->u.type_specifier.type = TYPESPEC_BOOL;
1579 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1580 $$->u.type_specifier.type = TYPESPEC_ID_TYPE;
1581 $$->u.type_specifier.id_type = yylval.gs->s;
1583 | INTEGER LBRAC RBRAC
1585 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1586 $$->u.type_specifier.type = TYPESPEC_INTEGER;
1587 $$->u.type_specifier.node = make_node(scanner, NODE_INTEGER);
1589 | INTEGER LBRAC ctf_assignment_expression_list RBRAC
1591 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1592 $$->u.type_specifier.type = TYPESPEC_INTEGER;
1593 $$->u.type_specifier.node = make_node(scanner, NODE_INTEGER);
1594 if (set_parent_node($3, $$->u.type_specifier.node))
1595 reparent_error(scanner, "integer reparent error");
1602 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1603 $$->u.type_specifier.type = TYPESPEC_VOID;
1607 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1608 $$->u.type_specifier.type = TYPESPEC_CHAR;
1612 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1613 $$->u.type_specifier.type = TYPESPEC_SHORT;
1617 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1618 $$->u.type_specifier.type = TYPESPEC_INT;
1622 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1623 $$->u.type_specifier.type = TYPESPEC_LONG;
1627 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1628 $$->u.type_specifier.type = TYPESPEC_FLOAT;
1632 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1633 $$->u.type_specifier.type = TYPESPEC_DOUBLE;
1637 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1638 $$->u.type_specifier.type = TYPESPEC_SIGNED;
1642 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1643 $$->u.type_specifier.type = TYPESPEC_UNSIGNED;
1647 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1648 $$->u.type_specifier.type = TYPESPEC_BOOL;
1652 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1653 $$->u.type_specifier.type = TYPESPEC_COMPLEX;
1657 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1658 $$->u.type_specifier.type = TYPESPEC_IMAGINARY;
1662 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1663 $$->u.type_specifier.type = TYPESPEC_ID_TYPE;
1664 $$->u.type_specifier.id_type = yylval.gs->s;
1666 | FLOATING_POINT LBRAC RBRAC
1668 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1669 $$->u.type_specifier.type = TYPESPEC_FLOATING_POINT;
1670 $$->u.type_specifier.node = make_node(scanner, NODE_FLOATING_POINT);
1672 | FLOATING_POINT LBRAC ctf_assignment_expression_list RBRAC
1674 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1675 $$->u.type_specifier.type = TYPESPEC_FLOATING_POINT;
1676 $$->u.type_specifier.node = make_node(scanner, NODE_FLOATING_POINT);
1677 if (set_parent_node($3, $$->u.type_specifier.node))
1678 reparent_error(scanner, "floating point reparent error");
1680 | INTEGER LBRAC RBRAC
1682 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1683 $$->u.type_specifier.type = TYPESPEC_INTEGER;
1684 $$->u.type_specifier.node = make_node(scanner, NODE_INTEGER);
1686 | INTEGER LBRAC ctf_assignment_expression_list RBRAC
1688 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1689 $$->u.type_specifier.type = TYPESPEC_INTEGER;
1690 $$->u.type_specifier.node = make_node(scanner, NODE_INTEGER);
1691 if (set_parent_node($3, $$->u.type_specifier.node))
1692 reparent_error(scanner, "integer reparent error");
1696 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1697 $$->u.type_specifier.type = TYPESPEC_STRING;
1698 $$->u.type_specifier.node = make_node(scanner, NODE_STRING);
1700 | STRING LBRAC RBRAC
1702 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1703 $$->u.type_specifier.type = TYPESPEC_STRING;
1704 $$->u.type_specifier.node = make_node(scanner, NODE_STRING);
1706 | STRING LBRAC ctf_assignment_expression_list RBRAC
1708 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1709 $$->u.type_specifier.type = TYPESPEC_STRING;
1710 $$->u.type_specifier.node = make_node(scanner, NODE_STRING);
1711 if (set_parent_node($3, $$->u.type_specifier.node))
1712 reparent_error(scanner, "string reparent error");
1714 | ENUM enum_type_specifier
1716 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1717 $$->u.type_specifier.type = TYPESPEC_ENUM;
1718 $$->u.type_specifier.node = $2;
1720 | VARIANT variant_type_specifier
1722 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1723 $$->u.type_specifier.type = TYPESPEC_VARIANT;
1724 $$->u.type_specifier.node = $2;
1726 | STRUCT struct_type_specifier
1728 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1729 $$->u.type_specifier.type = TYPESPEC_STRUCT;
1730 $$->u.type_specifier.node = $2;
1734 struct_type_specifier:
1735 struct_declaration_begin struct_or_variant_declaration_list struct_declaration_end
1737 $$ = make_node(scanner, NODE_STRUCT);
1738 $$->u._struct.has_body = 1;
1739 if ($2 && set_parent_node($2, $$))
1740 reparent_error(scanner, "struct reparent error");
1742 | IDENTIFIER struct_declaration_begin struct_or_variant_declaration_list struct_declaration_end
1744 $$ = make_node(scanner, NODE_STRUCT);
1745 $$->u._struct.has_body = 1;
1746 $$->u._struct.name = $1->s;
1747 if ($3 && set_parent_node($3, $$))
1748 reparent_error(scanner, "struct reparent error");
1750 | ID_TYPE struct_declaration_begin struct_or_variant_declaration_list struct_declaration_end
1752 $$ = make_node(scanner, NODE_STRUCT);
1753 $$->u._struct.has_body = 1;
1754 $$->u._struct.name = $1->s;
1755 if ($3 && set_parent_node($3, $$))
1756 reparent_error(scanner, "struct reparent error");
1760 $$ = make_node(scanner, NODE_STRUCT);
1761 $$->u._struct.has_body = 0;
1762 $$->u._struct.name = $1->s;
1766 $$ = make_node(scanner, NODE_STRUCT);
1767 $$->u._struct.has_body = 0;
1768 $$->u._struct.name = $1->s;
1770 | struct_declaration_begin struct_or_variant_declaration_list struct_declaration_end TOK_ALIGN LPAREN unary_expression RPAREN
1772 $$ = make_node(scanner, NODE_STRUCT);
1773 $$->u._struct.has_body = 1;
1774 bt_list_add_tail(&($6)->siblings, &$$->u._struct.min_align);
1775 if ($2 && set_parent_node($2, $$))
1776 reparent_error(scanner, "struct reparent error");
1778 | IDENTIFIER struct_declaration_begin struct_or_variant_declaration_list struct_declaration_end TOK_ALIGN LPAREN unary_expression RPAREN
1780 $$ = make_node(scanner, NODE_STRUCT);
1781 $$->u._struct.has_body = 1;
1782 $$->u._struct.name = $1->s;
1783 bt_list_add_tail(&($7)->siblings, &$$->u._struct.min_align);
1784 if ($3 && set_parent_node($3, $$))
1785 reparent_error(scanner, "struct reparent error");
1787 | ID_TYPE struct_declaration_begin struct_or_variant_declaration_list struct_declaration_end TOK_ALIGN LPAREN unary_expression RPAREN
1789 $$ = make_node(scanner, NODE_STRUCT);
1790 $$->u._struct.has_body = 1;
1791 $$->u._struct.name = $1->s;
1792 bt_list_add_tail(&($7)->siblings, &$$->u._struct.min_align);
1793 if ($3 && set_parent_node($3, $$))
1794 reparent_error(scanner, "struct reparent error");
1798 struct_declaration_begin:
1800 { push_scope(scanner); }
1803 struct_declaration_end:
1805 { pop_scope(scanner); }
1808 variant_type_specifier:
1809 variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1811 $$ = make_node(scanner, NODE_VARIANT);
1812 $$->u.variant.has_body = 1;
1813 if ($2 && set_parent_node($2, $$))
1814 reparent_error(scanner, "variant reparent error");
1816 | LT IDENTIFIER GT variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1818 $$ = make_node(scanner, NODE_VARIANT);
1819 $$->u.variant.has_body = 1;
1820 $$->u.variant.choice = $2->s;
1821 if ($5 && set_parent_node($5, $$))
1822 reparent_error(scanner, "variant reparent error");
1824 | LT ID_TYPE GT variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1826 $$ = make_node(scanner, NODE_VARIANT);
1827 $$->u.variant.has_body = 1;
1828 $$->u.variant.choice = $2->s;
1829 if ($5 && set_parent_node($5, $$))
1830 reparent_error(scanner, "variant reparent error");
1832 | IDENTIFIER variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1834 $$ = make_node(scanner, NODE_VARIANT);
1835 $$->u.variant.has_body = 1;
1836 $$->u.variant.name = $1->s;
1837 if ($3 && set_parent_node($3, $$))
1838 reparent_error(scanner, "variant reparent error");
1840 | IDENTIFIER LT IDENTIFIER GT variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1842 $$ = make_node(scanner, NODE_VARIANT);
1843 $$->u.variant.has_body = 1;
1844 $$->u.variant.name = $1->s;
1845 $$->u.variant.choice = $3->s;
1846 if ($6 && set_parent_node($6, $$))
1847 reparent_error(scanner, "variant reparent error");
1849 | IDENTIFIER LT IDENTIFIER GT
1851 $$ = make_node(scanner, NODE_VARIANT);
1852 $$->u.variant.has_body = 0;
1853 $$->u.variant.name = $1->s;
1854 $$->u.variant.choice = $3->s;
1856 | IDENTIFIER LT ID_TYPE GT variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1858 $$ = make_node(scanner, NODE_VARIANT);
1859 $$->u.variant.has_body = 1;
1860 $$->u.variant.name = $1->s;
1861 $$->u.variant.choice = $3->s;
1862 if ($6 && set_parent_node($6, $$))
1863 reparent_error(scanner, "variant reparent error");
1865 | IDENTIFIER LT ID_TYPE GT
1867 $$ = make_node(scanner, NODE_VARIANT);
1868 $$->u.variant.has_body = 0;
1869 $$->u.variant.name = $1->s;
1870 $$->u.variant.choice = $3->s;
1872 | ID_TYPE 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.name = $1->s;
1877 if ($3 && set_parent_node($3, $$))
1878 reparent_error(scanner, "variant reparent error");
1880 | ID_TYPE LT IDENTIFIER 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.name = $1->s;
1885 $$->u.variant.choice = $3->s;
1886 if ($6 && set_parent_node($6, $$))
1887 reparent_error(scanner, "variant reparent error");
1889 | ID_TYPE LT IDENTIFIER GT
1891 $$ = make_node(scanner, NODE_VARIANT);
1892 $$->u.variant.has_body = 0;
1893 $$->u.variant.name = $1->s;
1894 $$->u.variant.choice = $3->s;
1896 | ID_TYPE LT ID_TYPE 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->s;
1901 $$->u.variant.choice = $3->s;
1902 if ($6 && set_parent_node($6, $$))
1903 reparent_error(scanner, "variant reparent error");
1905 | ID_TYPE LT ID_TYPE GT
1907 $$ = make_node(scanner, NODE_VARIANT);
1908 $$->u.variant.has_body = 0;
1909 $$->u.variant.name = $1->s;
1910 $$->u.variant.choice = $3->s;
1914 variant_declaration_begin:
1916 { push_scope(scanner); }
1919 variant_declaration_end:
1921 { pop_scope(scanner); }
1924 enum_type_specifier:
1925 LBRAC enumerator_list RBRAC
1927 $$ = make_node(scanner, NODE_ENUM);
1928 $$->u._enum.has_body = 1;
1929 _bt_list_splice_tail(&($2)->tmp_head, &($$)->u._enum.enumerator_list);
1931 | COLON integer_declaration_specifiers LBRAC enumerator_list RBRAC
1933 $$ = make_node(scanner, NODE_ENUM);
1934 $$->u._enum.has_body = 1;
1935 ($$)->u._enum.container_type = $2;
1936 _bt_list_splice_tail(&($4)->tmp_head, &($$)->u._enum.enumerator_list);
1938 | IDENTIFIER LBRAC enumerator_list RBRAC
1940 $$ = make_node(scanner, NODE_ENUM);
1941 $$->u._enum.has_body = 1;
1942 $$->u._enum.enum_id = $1->s;
1943 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._enum.enumerator_list);
1945 | IDENTIFIER COLON integer_declaration_specifiers LBRAC enumerator_list RBRAC
1947 $$ = make_node(scanner, NODE_ENUM);
1948 $$->u._enum.has_body = 1;
1949 $$->u._enum.enum_id = $1->s;
1950 ($$)->u._enum.container_type = $3;
1951 _bt_list_splice_tail(&($5)->tmp_head, &($$)->u._enum.enumerator_list);
1953 | ID_TYPE LBRAC enumerator_list RBRAC
1955 $$ = make_node(scanner, NODE_ENUM);
1956 $$->u._enum.has_body = 1;
1957 $$->u._enum.enum_id = $1->s;
1958 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._enum.enumerator_list);
1960 | ID_TYPE COLON integer_declaration_specifiers LBRAC enumerator_list RBRAC
1962 $$ = make_node(scanner, NODE_ENUM);
1963 $$->u._enum.has_body = 1;
1964 $$->u._enum.enum_id = $1->s;
1965 ($$)->u._enum.container_type = $3;
1966 _bt_list_splice_tail(&($5)->tmp_head, &($$)->u._enum.enumerator_list);
1968 | LBRAC enumerator_list COMMA RBRAC
1970 $$ = make_node(scanner, NODE_ENUM);
1971 $$->u._enum.has_body = 1;
1972 _bt_list_splice_tail(&($2)->tmp_head, &($$)->u._enum.enumerator_list);
1974 | COLON integer_declaration_specifiers LBRAC enumerator_list COMMA RBRAC
1976 $$ = make_node(scanner, NODE_ENUM);
1977 $$->u._enum.has_body = 1;
1978 ($$)->u._enum.container_type = $2;
1979 _bt_list_splice_tail(&($4)->tmp_head, &($$)->u._enum.enumerator_list);
1981 | IDENTIFIER LBRAC enumerator_list COMMA RBRAC
1983 $$ = make_node(scanner, NODE_ENUM);
1984 $$->u._enum.has_body = 1;
1985 $$->u._enum.enum_id = $1->s;
1986 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._enum.enumerator_list);
1988 | IDENTIFIER COLON integer_declaration_specifiers LBRAC enumerator_list COMMA RBRAC
1990 $$ = make_node(scanner, NODE_ENUM);
1991 $$->u._enum.has_body = 1;
1992 $$->u._enum.enum_id = $1->s;
1993 ($$)->u._enum.container_type = $3;
1994 _bt_list_splice_tail(&($5)->tmp_head, &($$)->u._enum.enumerator_list);
1998 $$ = make_node(scanner, NODE_ENUM);
1999 $$->u._enum.has_body = 0;
2000 $$->u._enum.enum_id = $1->s;
2002 | ID_TYPE LBRAC enumerator_list COMMA RBRAC
2004 $$ = make_node(scanner, NODE_ENUM);
2005 $$->u._enum.has_body = 1;
2006 $$->u._enum.enum_id = $1->s;
2007 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._enum.enumerator_list);
2009 | ID_TYPE COLON integer_declaration_specifiers LBRAC enumerator_list COMMA RBRAC
2011 $$ = make_node(scanner, NODE_ENUM);
2012 $$->u._enum.has_body = 1;
2013 $$->u._enum.enum_id = $1->s;
2014 ($$)->u._enum.container_type = $3;
2015 _bt_list_splice_tail(&($5)->tmp_head, &($$)->u._enum.enumerator_list);
2019 $$ = make_node(scanner, NODE_ENUM);
2020 $$->u._enum.has_body = 0;
2021 $$->u._enum.enum_id = $1->s;
2025 struct_or_variant_declaration_list:
2028 | struct_or_variant_declaration_list struct_or_variant_declaration
2032 bt_list_add_tail(&($2)->siblings, &($$)->tmp_head);
2035 bt_list_add_tail(&($$)->siblings, &($$)->tmp_head);
2040 struct_or_variant_declaration:
2041 declaration_specifiers struct_or_variant_declarator_list SEMICOLON
2043 struct ctf_node *list;
2045 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2046 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2047 $$ = make_node(scanner, NODE_STRUCT_OR_VARIANT_DECLARATION);
2048 ($$)->u.struct_or_variant_declaration.type_specifier_list = list;
2049 _bt_list_splice_tail(&($2)->tmp_head, &($$)->u.struct_or_variant_declaration.type_declarators);
2051 | declaration_specifiers TYPEDEF declaration_specifiers type_declarator_list SEMICOLON
2053 struct ctf_node *list;
2055 $$ = make_node(scanner, NODE_TYPEDEF);
2056 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2057 $$->u._typedef.type_specifier_list = list;
2058 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2059 _bt_list_splice_tail(&($3)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2060 _bt_list_splice_tail(&($4)->tmp_head, &($$)->u._typedef.type_declarators);
2062 | TYPEDEF declaration_specifiers type_declarator_list SEMICOLON
2064 struct ctf_node *list;
2066 $$ = make_node(scanner, NODE_TYPEDEF);
2067 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2068 $$->u._typedef.type_specifier_list = list;
2069 _bt_list_splice_tail(&($2)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2070 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._typedef.type_declarators);
2072 | declaration_specifiers TYPEDEF type_declarator_list SEMICOLON
2074 struct ctf_node *list;
2076 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2077 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2078 $$ = make_node(scanner, NODE_TYPEDEF);
2079 ($$)->u.struct_or_variant_declaration.type_specifier_list = list;
2080 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._typedef.type_declarators);
2082 | TYPEALIAS declaration_specifiers abstract_declarator_list TYPEASSIGN alias_declaration_specifiers alias_abstract_declarator_list SEMICOLON
2084 struct ctf_node *list;
2086 $$ = make_node(scanner, NODE_TYPEALIAS);
2087 $$->u.typealias.target = make_node(scanner, NODE_TYPEALIAS_TARGET);
2088 $$->u.typealias.alias = make_node(scanner, NODE_TYPEALIAS_ALIAS);
2090 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2091 $$->u.typealias.target->u.typealias_target.type_specifier_list = list;
2092 _bt_list_splice_tail(&($2)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2093 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.typealias.target->u.typealias_target.type_declarators);
2095 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2096 $$->u.typealias.alias->u.typealias_alias.type_specifier_list = list;
2097 _bt_list_splice_tail(&($5)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2098 _bt_list_splice_tail(&($6)->tmp_head, &($$)->u.typealias.alias->u.typealias_alias.type_declarators);
2102 alias_declaration_specifiers:
2105 struct ctf_node *node;
2107 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2108 node = make_node(scanner, NODE_TYPE_SPECIFIER);
2109 node->u.type_specifier.type = TYPESPEC_CONST;
2110 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
2114 struct ctf_node *node;
2116 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2118 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
2122 struct ctf_node *node;
2124 add_type(scanner, $1);
2125 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2126 node = make_node(scanner, NODE_TYPE_SPECIFIER);
2127 node->u.type_specifier.type = TYPESPEC_ID_TYPE;
2128 node->u.type_specifier.id_type = yylval.gs->s;
2129 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
2131 | alias_declaration_specifiers CONST
2133 struct ctf_node *node;
2136 node = make_node(scanner, NODE_TYPE_SPECIFIER);
2137 node->u.type_specifier.type = TYPESPEC_CONST;
2138 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
2140 | alias_declaration_specifiers type_specifier
2143 bt_list_add_tail(&($2)->siblings, &($$)->u.type_specifier_list.head);
2145 | alias_declaration_specifiers IDENTIFIER
2147 struct ctf_node *node;
2149 add_type(scanner, $2);
2151 node = make_node(scanner, NODE_TYPE_SPECIFIER);
2152 node->u.type_specifier.type = TYPESPEC_ID_TYPE;
2153 node->u.type_specifier.id_type = yylval.gs->s;
2154 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
2158 struct_or_variant_declarator_list:
2159 struct_or_variant_declarator
2161 | struct_or_variant_declarator_list COMMA struct_or_variant_declarator
2164 bt_list_add_tail(&($3)->siblings, &($$)->tmp_head);
2168 struct_or_variant_declarator:
2171 | COLON unary_expression
2173 | declarator COLON unary_expression
2176 if (set_parent_node($3, $1))
2177 reparent_error(scanner, "struct_or_variant_declarator");
2184 | enumerator_list COMMA enumerator
2187 bt_list_add_tail(&($3)->siblings, &($$)->tmp_head);
2194 $$ = make_node(scanner, NODE_ENUMERATOR);
2195 $$->u.enumerator.id = $1->s;
2199 $$ = make_node(scanner, NODE_ENUMERATOR);
2200 $$->u.enumerator.id = $1->s;
2204 $$ = make_node(scanner, NODE_ENUMERATOR);
2205 $$->u.enumerator.id = $1->s;
2207 | STRING_LITERAL_START DQUOTE
2209 $$ = make_node(scanner, NODE_ENUMERATOR);
2210 $$->u.enumerator.id = "";
2212 | STRING_LITERAL_START s_char_sequence DQUOTE
2214 $$ = make_node(scanner, NODE_ENUMERATOR);
2215 $$->u.enumerator.id = $2->s;
2217 | IDENTIFIER EQUAL unary_expression_or_range
2219 $$ = make_node(scanner, NODE_ENUMERATOR);
2220 $$->u.enumerator.id = $1->s;
2221 bt_list_splice(&($3)->tmp_head, &($$)->u.enumerator.values);
2223 | ID_TYPE EQUAL unary_expression_or_range
2225 $$ = make_node(scanner, NODE_ENUMERATOR);
2226 $$->u.enumerator.id = $1->s;
2227 bt_list_splice(&($3)->tmp_head, &($$)->u.enumerator.values);
2229 | keywords EQUAL unary_expression_or_range
2231 $$ = make_node(scanner, NODE_ENUMERATOR);
2232 $$->u.enumerator.id = $1->s;
2233 bt_list_splice(&($3)->tmp_head, &($$)->u.enumerator.values);
2235 | STRING_LITERAL_START DQUOTE EQUAL unary_expression_or_range
2237 $$ = make_node(scanner, NODE_ENUMERATOR);
2238 $$->u.enumerator.id = "";
2239 bt_list_splice(&($4)->tmp_head, &($$)->u.enumerator.values);
2241 | STRING_LITERAL_START s_char_sequence DQUOTE EQUAL unary_expression_or_range
2243 $$ = make_node(scanner, NODE_ENUMERATOR);
2244 $$->u.enumerator.id = $2->s;
2245 bt_list_splice(&($5)->tmp_head, &($$)->u.enumerator.values);
2249 abstract_declarator_list:
2252 | abstract_declarator_list COMMA abstract_declarator
2255 bt_list_add_tail(&($3)->siblings, &($$)->tmp_head);
2259 abstract_declarator:
2260 direct_abstract_declarator
2262 | pointer direct_abstract_declarator
2265 bt_list_splice(&($1)->tmp_head, &($$)->u.type_declarator.pointers);
2269 direct_abstract_declarator:
2272 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2273 $$->u.type_declarator.type = TYPEDEC_ID;
2278 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2279 $$->u.type_declarator.type = TYPEDEC_ID;
2280 $$->u.type_declarator.u.id = $1->s;
2282 | LPAREN abstract_declarator RPAREN
2284 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2285 $$->u.type_declarator.type = TYPEDEC_NESTED;
2286 $$->u.type_declarator.u.nested.type_declarator = $2;
2288 | direct_abstract_declarator LSBRAC unary_expression RSBRAC
2290 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2291 $$->u.type_declarator.type = TYPEDEC_NESTED;
2292 $$->u.type_declarator.u.nested.type_declarator = $1;
2293 BT_INIT_LIST_HEAD(&($$)->u.type_declarator.u.nested.length);
2294 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.type_declarator.u.nested.length);
2296 | direct_abstract_declarator LSBRAC RSBRAC
2298 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2299 $$->u.type_declarator.type = TYPEDEC_NESTED;
2300 $$->u.type_declarator.u.nested.type_declarator = $1;
2301 $$->u.type_declarator.u.nested.abstract_array = 1;
2305 alias_abstract_declarator_list:
2306 alias_abstract_declarator
2308 | alias_abstract_declarator_list COMMA alias_abstract_declarator
2311 bt_list_add_tail(&($3)->siblings, &($$)->tmp_head);
2315 alias_abstract_declarator:
2316 direct_alias_abstract_declarator
2318 | pointer direct_alias_abstract_declarator
2321 bt_list_splice(&($1)->tmp_head, &($$)->u.type_declarator.pointers);
2325 direct_alias_abstract_declarator:
2328 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2329 $$->u.type_declarator.type = TYPEDEC_ID;
2332 | LPAREN alias_abstract_declarator RPAREN
2334 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2335 $$->u.type_declarator.type = TYPEDEC_NESTED;
2336 $$->u.type_declarator.u.nested.type_declarator = $2;
2338 | direct_alias_abstract_declarator LSBRAC unary_expression RSBRAC
2340 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2341 $$->u.type_declarator.type = TYPEDEC_NESTED;
2342 $$->u.type_declarator.u.nested.type_declarator = $1;
2343 BT_INIT_LIST_HEAD(&($$)->u.type_declarator.u.nested.length);
2344 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.type_declarator.u.nested.length);
2346 | direct_alias_abstract_declarator LSBRAC RSBRAC
2348 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2349 $$->u.type_declarator.type = TYPEDEC_NESTED;
2350 $$->u.type_declarator.u.nested.type_declarator = $1;
2351 $$->u.type_declarator.u.nested.abstract_array = 1;
2358 | pointer direct_declarator
2361 bt_list_splice(&($1)->tmp_head, &($$)->u.type_declarator.pointers);
2368 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2369 $$->u.type_declarator.type = TYPEDEC_ID;
2370 $$->u.type_declarator.u.id = $1->s;
2372 | LPAREN declarator RPAREN
2374 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2375 $$->u.type_declarator.type = TYPEDEC_NESTED;
2376 $$->u.type_declarator.u.nested.type_declarator = $2;
2378 | direct_declarator LSBRAC unary_expression RSBRAC
2380 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2381 $$->u.type_declarator.type = TYPEDEC_NESTED;
2382 $$->u.type_declarator.u.nested.type_declarator = $1;
2383 BT_INIT_LIST_HEAD(&($$)->u.type_declarator.u.nested.length);
2384 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.type_declarator.u.nested.length);
2389 direct_type_declarator
2391 | pointer direct_type_declarator
2394 bt_list_splice(&($1)->tmp_head, &($$)->u.type_declarator.pointers);
2398 direct_type_declarator:
2401 add_type(scanner, $1);
2402 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2403 $$->u.type_declarator.type = TYPEDEC_ID;
2404 $$->u.type_declarator.u.id = $1->s;
2406 | LPAREN type_declarator RPAREN
2408 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2409 $$->u.type_declarator.type = TYPEDEC_NESTED;
2410 $$->u.type_declarator.u.nested.type_declarator = $2;
2412 | direct_type_declarator LSBRAC unary_expression RSBRAC
2414 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2415 $$->u.type_declarator.type = TYPEDEC_NESTED;
2416 $$->u.type_declarator.u.nested.type_declarator = $1;
2417 BT_INIT_LIST_HEAD(&($$)->u.type_declarator.u.nested.length);
2418 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.type_declarator.u.nested.length);
2425 $$ = make_node(scanner, NODE_POINTER);
2429 $$ = make_node(scanner, NODE_POINTER);
2430 bt_list_splice(&($2)->tmp_head, &($$)->tmp_head);
2432 | STAR type_qualifier_list pointer
2434 $$ = make_node(scanner, NODE_POINTER);
2435 $$->u.pointer.const_qualifier = 1;
2436 bt_list_splice(&($3)->tmp_head, &($$)->tmp_head);
2440 type_qualifier_list:
2441 /* pointer assumes only const type qualifier */
2443 | type_qualifier_list CONST
2446 /* 2.3: CTF-specific declarations */
2448 ctf_assignment_expression_list:
2449 ctf_assignment_expression SEMICOLON
2451 | ctf_assignment_expression_list ctf_assignment_expression SEMICOLON
2454 bt_list_add_tail(&($2)->siblings, &($$)->tmp_head);
2458 ctf_assignment_expression:
2459 unary_expression EQUAL unary_expression
2462 * Because we have left and right, cannot use
2465 $$ = make_node(scanner, NODE_CTF_EXPRESSION);
2466 _bt_list_splice_tail(&($1)->tmp_head, &($$)->u.ctf_expression.left);
2467 if ($1->u.unary_expression.type != UNARY_STRING)
2468 reparent_error(scanner, "ctf_assignment_expression left expects string");
2469 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.ctf_expression.right);
2471 | unary_expression TYPEASSIGN declaration_specifiers /* Only allow struct */
2474 * Because we have left and right, cannot use
2477 $$ = make_node(scanner, NODE_CTF_EXPRESSION);
2478 _bt_list_splice_tail(&($1)->tmp_head, &($$)->u.ctf_expression.left);
2479 if ($1->u.unary_expression.type != UNARY_STRING)
2480 reparent_error(scanner, "ctf_assignment_expression left expects string");
2481 bt_list_add_tail(&($3)->siblings, &($$)->u.ctf_expression.right);
2483 | declaration_specifiers TYPEDEF declaration_specifiers type_declarator_list
2485 struct ctf_node *list;
2487 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2488 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2489 _bt_list_splice_tail(&($3)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2490 $$ = make_node(scanner, NODE_TYPEDEF);
2491 ($$)->u.struct_or_variant_declaration.type_specifier_list = list;
2492 _bt_list_splice_tail(&($4)->tmp_head, &($$)->u._typedef.type_declarators);
2494 | TYPEDEF declaration_specifiers type_declarator_list
2496 struct ctf_node *list;
2498 $$ = make_node(scanner, NODE_TYPEDEF);
2499 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2500 $$->u._typedef.type_specifier_list = list;
2501 _bt_list_splice_tail(&($2)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2502 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._typedef.type_declarators);
2504 | declaration_specifiers TYPEDEF type_declarator_list
2506 struct ctf_node *list;
2508 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2509 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2510 $$ = make_node(scanner, NODE_TYPEDEF);
2511 ($$)->u.struct_or_variant_declaration.type_specifier_list = list;
2512 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._typedef.type_declarators);
2514 | TYPEALIAS declaration_specifiers abstract_declarator_list TYPEASSIGN alias_declaration_specifiers alias_abstract_declarator_list
2516 struct ctf_node *list;
2518 $$ = make_node(scanner, NODE_TYPEALIAS);
2519 $$->u.typealias.target = make_node(scanner, NODE_TYPEALIAS_TARGET);
2520 $$->u.typealias.alias = make_node(scanner, NODE_TYPEALIAS_ALIAS);
2522 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2523 $$->u.typealias.target->u.typealias_target.type_specifier_list = list;
2524 _bt_list_splice_tail(&($2)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2525 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.typealias.target->u.typealias_target.type_declarators);
2527 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2528 $$->u.typealias.alias->u.typealias_alias.type_specifier_list = list;
2529 _bt_list_splice_tail(&($5)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2530 _bt_list_splice_tail(&($6)->tmp_head, &($$)->u.typealias.alias->u.typealias_alias.type_declarators);