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"
46 /* Join two lists, put "add" at the end of "head". */
48 _bt_list_splice_tail (struct bt_list_head *add, struct bt_list_head *head)
50 /* Do nothing if the list which gets added is empty. */
51 if (add != add->next) {
52 add->next->prev = head->prev;
53 add->prev->next = head;
54 head->prev->next = add->next;
55 head->prev = add->prev;
60 int yyparse(struct ctf_scanner *scanner);
62 int yylex(union YYSTYPE *yyval, struct ctf_scanner *scanner);
64 int yylex_init_extra(struct ctf_scanner *scanner, yyscan_t * ptr_yy_globals);
66 int yylex_destroy(yyscan_t yyscanner);
68 void yyrestart(FILE * in_str, yyscan_t scanner);
70 int yyget_lineno(yyscan_t yyscanner);
72 char *yyget_text(yyscan_t yyscanner);
75 struct bt_list_head gc;
80 static const char *node_type_to_str[] = {
81 #define ENTRY(S) [S] = #S,
82 FOREACH_CTF_NODES(ENTRY)
87 const char *node_type(struct ctf_node *node)
89 if (node->type < NR_NODE_TYPES)
90 return node_type_to_str[node->type];
95 static struct gc_string *gc_string_alloc(struct ctf_scanner *scanner,
98 struct gc_string *gstr;
101 /* TODO: could be faster with find first bit or glib Gstring */
102 /* sizeof long to account for malloc header (int or long ?) */
103 for (alloclen = 8; alloclen < sizeof(long) + sizeof(*gstr) + len;
106 gstr = malloc(alloclen);
107 bt_list_add(&gstr->gc, &scanner->allocated_strings);
108 gstr->alloclen = alloclen;
113 * note: never use gc_string_append on a string that has external references.
114 * gsrc will be garbage collected immediately, and gstr might be.
115 * Should only be used to append characters to a string literal or constant.
118 struct gc_string *gc_string_append(struct ctf_scanner *scanner,
119 struct gc_string *gstr,
120 struct gc_string *gsrc)
122 size_t newlen = strlen(gsrc->s) + strlen(gstr->s) + 1;
125 /* TODO: could be faster with find first bit or glib Gstring */
126 /* sizeof long to account for malloc header (int or long ?) */
127 for (alloclen = 8; alloclen < sizeof(long) + sizeof(*gstr) + newlen;
130 if (alloclen > gstr->alloclen) {
131 struct gc_string *newgstr;
133 newgstr = gc_string_alloc(scanner, newlen);
134 strcpy(newgstr->s, gstr->s);
135 strcat(newgstr->s, gsrc->s);
136 bt_list_del(&gstr->gc);
140 strcat(gstr->s, gsrc->s);
142 bt_list_del(&gsrc->gc);
147 void setstring(struct ctf_scanner *scanner, YYSTYPE *lvalp, const char *src)
149 lvalp->gs = gc_string_alloc(scanner, strlen(src) + 1);
150 strcpy(lvalp->gs->s, src);
154 int str_check(size_t str_len, size_t offset, size_t len)
157 if (offset + len < offset)
159 if (offset + len > str_len)
165 int import_basic_string(struct ctf_scanner *scanner, YYSTYPE *lvalp,
166 size_t len, const char *src, char delim)
168 size_t pos = 0, dpos = 0;
170 if (str_check(len, pos, 1))
172 if (src[pos++] != delim)
175 while (src[pos] != delim) {
178 if (str_check(len, pos, 1))
182 if (str_check(len, pos, 1))
227 if (str_check(len, pos, oct_len))
229 if (!isdigit((int) src[pos]) || !isdigit((int) src[pos+1]) || !isdigit((int) src[pos+2]))
231 char oct_buffer[4] = { src[pos], src[pos+1], src[pos+2], '\0' };
232 c = strtoul(&oct_buffer[0], NULL, 8);
240 if (str_check(len, pos, hex_len))
242 if (!isxdigit((int) src[pos]) || !isxdigit((int) src[pos+1]))
244 char hex_buffer[3] = { src[pos], src[pos+1], '\0' };
245 c = strtoul(&hex_buffer[0], NULL, 16);
253 if (str_check(len, dpos, 1))
255 lvalp->gs->s[dpos++] = c;
258 if (str_check(len, dpos, 1))
260 lvalp->gs->s[dpos++] = '\0';
262 if (str_check(len, pos, 1))
264 if (src[pos++] != delim)
267 if (str_check(len, pos, 1))
269 if (src[pos] != '\0')
274 int import_string(struct ctf_scanner *scanner, YYSTYPE *lvalp,
275 const char *src, char delim)
279 len = strlen(src) + 1;
280 lvalp->gs = gc_string_alloc(scanner, len);
282 // TODO: import wide string
283 printfl_error(yyget_lineno(scanner),
284 "Wide string not supported yet.");
287 return import_basic_string(scanner, lvalp, len, src, delim);
291 static void init_scope(struct ctf_scanner_scope *scope,
292 struct ctf_scanner_scope *parent)
294 scope->parent = parent;
295 scope->types = g_hash_table_new_full(g_str_hash, g_str_equal,
299 static void finalize_scope(struct ctf_scanner_scope *scope)
301 g_hash_table_destroy(scope->types);
304 static void push_scope(struct ctf_scanner *scanner)
306 struct ctf_scanner_scope *ns;
308 printf_debug("push scope\n");
309 ns = malloc(sizeof(struct ctf_scanner_scope));
310 init_scope(ns, scanner->cs);
314 static void pop_scope(struct ctf_scanner *scanner)
316 struct ctf_scanner_scope *os;
318 printf_debug("pop scope\n");
320 scanner->cs = os->parent;
325 static int lookup_type(struct ctf_scanner_scope *s, const char *id)
329 ret = (int) (long) g_hash_table_lookup(s->types, id);
330 printf_debug("lookup %p %s %d\n", s, id, ret);
335 int is_type(struct ctf_scanner *scanner, const char *id)
337 struct ctf_scanner_scope *it;
340 for (it = scanner->cs; it != NULL; it = it->parent) {
341 if (lookup_type(it, id)) {
346 printf_debug("is type %s %d\n", id, ret);
350 static void add_type(struct ctf_scanner *scanner, struct gc_string *id)
352 printf_debug("add type %s\n", id->s);
353 if (lookup_type(scanner->cs, id->s))
355 g_hash_table_insert(scanner->cs->types, id->s, id->s);
358 static struct ctf_node *make_node(struct ctf_scanner *scanner,
361 struct ctf_ast *ast = ctf_scanner_get_ast(scanner);
362 struct ctf_node *node;
364 node = malloc(sizeof(*node));
367 memset(node, 0, sizeof(*node));
369 node->lineno = yyget_lineno(scanner->scanner);
370 BT_INIT_LIST_HEAD(&node->tmp_head);
371 bt_list_add(&node->gc, &ast->allocated_nodes);
372 bt_list_add(&node->siblings, &node->tmp_head);
376 printfn_fatal(node, "trying to create root node");
380 BT_INIT_LIST_HEAD(&node->u.event.declaration_list);
383 BT_INIT_LIST_HEAD(&node->u.stream.declaration_list);
386 BT_INIT_LIST_HEAD(&node->u.env.declaration_list);
389 BT_INIT_LIST_HEAD(&node->u.trace.declaration_list);
392 BT_INIT_LIST_HEAD(&node->u.clock.declaration_list);
395 BT_INIT_LIST_HEAD(&node->u.callsite.declaration_list);
398 case NODE_CTF_EXPRESSION:
399 BT_INIT_LIST_HEAD(&node->u.ctf_expression.left);
400 BT_INIT_LIST_HEAD(&node->u.ctf_expression.right);
402 case NODE_UNARY_EXPRESSION:
406 BT_INIT_LIST_HEAD(&node->u._typedef.type_declarators);
408 case NODE_TYPEALIAS_TARGET:
409 BT_INIT_LIST_HEAD(&node->u.typealias_target.type_declarators);
411 case NODE_TYPEALIAS_ALIAS:
412 BT_INIT_LIST_HEAD(&node->u.typealias_alias.type_declarators);
417 case NODE_TYPE_SPECIFIER:
419 case NODE_TYPE_SPECIFIER_LIST:
420 BT_INIT_LIST_HEAD(&node->u.type_specifier_list.head);
424 case NODE_TYPE_DECLARATOR:
425 BT_INIT_LIST_HEAD(&node->u.type_declarator.pointers);
428 case NODE_FLOATING_POINT:
429 BT_INIT_LIST_HEAD(&node->u.floating_point.expressions);
432 BT_INIT_LIST_HEAD(&node->u.integer.expressions);
435 BT_INIT_LIST_HEAD(&node->u.string.expressions);
437 case NODE_ENUMERATOR:
438 BT_INIT_LIST_HEAD(&node->u.enumerator.values);
441 BT_INIT_LIST_HEAD(&node->u._enum.enumerator_list);
443 case NODE_STRUCT_OR_VARIANT_DECLARATION:
444 BT_INIT_LIST_HEAD(&node->u.struct_or_variant_declaration.type_declarators);
447 BT_INIT_LIST_HEAD(&node->u.variant.declaration_list);
450 BT_INIT_LIST_HEAD(&node->u._struct.declaration_list);
451 BT_INIT_LIST_HEAD(&node->u._struct.min_align);
456 printfn_fatal(node, "unknown node type '%d'", (int) type);
463 static int reparent_ctf_expression(struct ctf_node *node,
464 struct ctf_node *parent)
466 switch (parent->type) {
468 _bt_list_splice_tail(&node->tmp_head, &parent->u.event.declaration_list);
471 _bt_list_splice_tail(&node->tmp_head, &parent->u.stream.declaration_list);
474 _bt_list_splice_tail(&node->tmp_head, &parent->u.env.declaration_list);
477 _bt_list_splice_tail(&node->tmp_head, &parent->u.trace.declaration_list);
480 _bt_list_splice_tail(&node->tmp_head, &parent->u.clock.declaration_list);
483 _bt_list_splice_tail(&node->tmp_head, &parent->u.callsite.declaration_list);
485 case NODE_FLOATING_POINT:
486 _bt_list_splice_tail(&node->tmp_head, &parent->u.floating_point.expressions);
489 _bt_list_splice_tail(&node->tmp_head, &parent->u.integer.expressions);
492 _bt_list_splice_tail(&node->tmp_head, &parent->u.string.expressions);
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:
510 case NODE_UNARY_EXPRESSION:
515 printfn_fatal(node, "unknown node type '%d'", (int) parent->type);
521 static int reparent_typedef(struct ctf_node *node, struct ctf_node *parent)
523 switch (parent->type) {
525 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.declaration_list);
528 _bt_list_splice_tail(&node->tmp_head, &parent->u.event.declaration_list);
531 _bt_list_splice_tail(&node->tmp_head, &parent->u.stream.declaration_list);
534 _bt_list_splice_tail(&node->tmp_head, &parent->u.env.declaration_list);
537 _bt_list_splice_tail(&node->tmp_head, &parent->u.trace.declaration_list);
540 _bt_list_splice_tail(&node->tmp_head, &parent->u.clock.declaration_list);
543 _bt_list_splice_tail(&node->tmp_head, &parent->u.callsite.declaration_list);
546 _bt_list_splice_tail(&node->tmp_head, &parent->u.variant.declaration_list);
549 _bt_list_splice_tail(&node->tmp_head, &parent->u._struct.declaration_list);
552 case NODE_FLOATING_POINT:
555 case NODE_CTF_EXPRESSION:
557 case NODE_TYPEALIAS_TARGET:
558 case NODE_TYPEALIAS_ALIAS:
560 case NODE_TYPE_SPECIFIER:
561 case NODE_TYPE_SPECIFIER_LIST:
563 case NODE_TYPE_DECLARATOR:
564 case NODE_ENUMERATOR:
566 case NODE_STRUCT_OR_VARIANT_DECLARATION:
567 case NODE_UNARY_EXPRESSION:
572 printfn_fatal(node, "unknown node type %d", parent->type);
578 static int reparent_typealias(struct ctf_node *node, struct ctf_node *parent)
580 switch (parent->type) {
582 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.declaration_list);
585 _bt_list_splice_tail(&node->tmp_head, &parent->u.event.declaration_list);
588 _bt_list_splice_tail(&node->tmp_head, &parent->u.stream.declaration_list);
591 _bt_list_splice_tail(&node->tmp_head, &parent->u.env.declaration_list);
594 _bt_list_splice_tail(&node->tmp_head, &parent->u.trace.declaration_list);
597 _bt_list_splice_tail(&node->tmp_head, &parent->u.clock.declaration_list);
600 _bt_list_splice_tail(&node->tmp_head, &parent->u.callsite.declaration_list);
603 _bt_list_splice_tail(&node->tmp_head, &parent->u.variant.declaration_list);
606 _bt_list_splice_tail(&node->tmp_head, &parent->u._struct.declaration_list);
609 case NODE_FLOATING_POINT:
612 case NODE_CTF_EXPRESSION:
614 case NODE_TYPEALIAS_TARGET:
615 case NODE_TYPEALIAS_ALIAS:
617 case NODE_TYPE_SPECIFIER:
618 case NODE_TYPE_SPECIFIER_LIST:
620 case NODE_TYPE_DECLARATOR:
621 case NODE_ENUMERATOR:
623 case NODE_STRUCT_OR_VARIANT_DECLARATION:
624 case NODE_UNARY_EXPRESSION:
629 printfn_fatal(node, "unknown node type '%d'", (int) parent->type);
635 static int reparent_type_specifier(struct ctf_node *node,
636 struct ctf_node *parent)
638 switch (parent->type) {
639 case NODE_TYPE_SPECIFIER_LIST:
640 _bt_list_splice_tail(&node->tmp_head, &parent->u.type_specifier_list.head);
643 case NODE_TYPE_SPECIFIER:
653 case NODE_TYPEALIAS_TARGET:
654 case NODE_TYPEALIAS_ALIAS:
655 case NODE_TYPE_DECLARATOR:
657 case NODE_STRUCT_OR_VARIANT_DECLARATION:
659 case NODE_FLOATING_POINT:
662 case NODE_CTF_EXPRESSION:
664 case NODE_ENUMERATOR:
665 case NODE_UNARY_EXPRESSION:
670 printfn_fatal(node, "unknown node type '%d'", (int) parent->type);
676 static int reparent_type_specifier_list(struct ctf_node *node,
677 struct ctf_node *parent)
679 switch (parent->type) {
681 bt_list_add_tail(&node->siblings, &parent->u.root.declaration_list);
684 bt_list_add_tail(&node->siblings, &parent->u.event.declaration_list);
687 bt_list_add_tail(&node->siblings, &parent->u.stream.declaration_list);
690 bt_list_add_tail(&node->siblings, &parent->u.env.declaration_list);
693 bt_list_add_tail(&node->siblings, &parent->u.trace.declaration_list);
696 bt_list_add_tail(&node->siblings, &parent->u.clock.declaration_list);
699 bt_list_add_tail(&node->siblings, &parent->u.callsite.declaration_list);
702 bt_list_add_tail(&node->siblings, &parent->u.variant.declaration_list);
705 bt_list_add_tail(&node->siblings, &parent->u._struct.declaration_list);
708 parent->u._typedef.type_specifier_list = node;
710 case NODE_TYPEALIAS_TARGET:
711 parent->u.typealias_target.type_specifier_list = node;
713 case NODE_TYPEALIAS_ALIAS:
714 parent->u.typealias_alias.type_specifier_list = node;
717 parent->u._enum.container_type = node;
719 case NODE_STRUCT_OR_VARIANT_DECLARATION:
720 parent->u.struct_or_variant_declaration.type_specifier_list = node;
722 case NODE_TYPE_DECLARATOR:
723 case NODE_TYPE_SPECIFIER:
725 case NODE_FLOATING_POINT:
728 case NODE_CTF_EXPRESSION:
730 case NODE_ENUMERATOR:
731 case NODE_UNARY_EXPRESSION:
736 printfn_fatal(node, "unknown node type '%d'", (int) parent->type);
742 static int reparent_type_declarator(struct ctf_node *node,
743 struct ctf_node *parent)
745 switch (parent->type) {
746 case NODE_TYPE_DECLARATOR:
747 parent->u.type_declarator.type = TYPEDEC_NESTED;
748 parent->u.type_declarator.u.nested.type_declarator = node;
750 case NODE_STRUCT_OR_VARIANT_DECLARATION:
751 _bt_list_splice_tail(&node->tmp_head, &parent->u.struct_or_variant_declaration.type_declarators);
754 _bt_list_splice_tail(&node->tmp_head, &parent->u._typedef.type_declarators);
756 case NODE_TYPEALIAS_TARGET:
757 _bt_list_splice_tail(&node->tmp_head, &parent->u.typealias_target.type_declarators);
759 case NODE_TYPEALIAS_ALIAS:
760 _bt_list_splice_tail(&node->tmp_head, &parent->u.typealias_alias.type_declarators);
774 case NODE_FLOATING_POINT:
777 case NODE_CTF_EXPRESSION:
778 case NODE_TYPE_SPECIFIER:
779 case NODE_TYPE_SPECIFIER_LIST:
781 case NODE_ENUMERATOR:
782 case NODE_UNARY_EXPRESSION:
787 printfn_fatal(node, "unknown node type '%d'", (int) parent->type);
796 * Link node to parent. Returns 0 on success, -EPERM if it is not permitted to
797 * create the link declared by the input, -ENOENT if node or parent is NULL,
798 * -EINVAL if there is an internal structure problem.
800 static int set_parent_node(struct ctf_node *node,
801 struct ctf_node *parent)
803 if (!node || !parent)
806 /* Note: Linking to parent will be done only by an external visitor */
808 switch (node->type) {
810 printfn_fatal(node, "trying to reparent root node");
814 if (parent->type == NODE_ROOT) {
815 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.event);
821 if (parent->type == NODE_ROOT) {
822 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.stream);
828 if (parent->type == NODE_ROOT) {
829 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.env);
835 if (parent->type == NODE_ROOT) {
836 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.trace);
842 if (parent->type == NODE_ROOT) {
843 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.clock);
849 if (parent->type == NODE_ROOT) {
850 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.callsite);
856 case NODE_CTF_EXPRESSION:
857 return reparent_ctf_expression(node, parent);
858 case NODE_UNARY_EXPRESSION:
859 if (parent->type == NODE_TYPE_DECLARATOR)
860 parent->u.type_declarator.bitfield_len = node;
866 return reparent_typedef(node, parent);
867 case NODE_TYPEALIAS_TARGET:
868 if (parent->type == NODE_TYPEALIAS)
869 parent->u.typealias.target = node;
872 case NODE_TYPEALIAS_ALIAS:
873 if (parent->type == NODE_TYPEALIAS)
874 parent->u.typealias.alias = node;
878 return reparent_typealias(node, parent);
881 if (parent->type == NODE_TYPE_DECLARATOR) {
882 _bt_list_splice_tail(&node->tmp_head, &parent->u.type_declarator.pointers);
886 case NODE_TYPE_DECLARATOR:
887 return reparent_type_declarator(node, parent);
889 case NODE_TYPE_SPECIFIER_LIST:
890 return reparent_type_specifier_list(node, parent);
892 case NODE_TYPE_SPECIFIER:
893 return reparent_type_specifier(node, parent);
895 case NODE_FLOATING_POINT:
901 return -EINVAL; /* Dealt with internally within grammar */
903 case NODE_ENUMERATOR:
904 if (parent->type == NODE_ENUM) {
905 _bt_list_splice_tail(&node->tmp_head, &parent->u._enum.enumerator_list);
910 case NODE_STRUCT_OR_VARIANT_DECLARATION:
911 switch (parent->type) {
913 _bt_list_splice_tail(&node->tmp_head, &parent->u._struct.declaration_list);
916 _bt_list_splice_tail(&node->tmp_head, &parent->u.variant.declaration_list);
925 printfn_fatal(node, "unknown node type '%d'", (int) parent->type);
932 void yyerror(struct ctf_scanner *scanner, const char *str)
934 printfl_error(yyget_lineno(scanner->scanner),
935 "token \"%s\": %s\n",
936 yyget_text(scanner->scanner), str);
945 #define reparent_error(scanner, str) \
947 yyerror(scanner, YY_("reparent_error: " str)); \
951 static void free_strings(struct bt_list_head *list)
953 struct gc_string *gstr, *tmp;
955 bt_list_for_each_entry_safe(gstr, tmp, list, gc)
959 static struct ctf_ast *ctf_ast_alloc(void)
963 ast = malloc(sizeof(*ast));
966 memset(ast, 0, sizeof(*ast));
967 BT_INIT_LIST_HEAD(&ast->allocated_nodes);
968 ast->root.type = NODE_ROOT;
969 BT_INIT_LIST_HEAD(&ast->root.tmp_head);
970 BT_INIT_LIST_HEAD(&ast->root.u.root.declaration_list);
971 BT_INIT_LIST_HEAD(&ast->root.u.root.trace);
972 BT_INIT_LIST_HEAD(&ast->root.u.root.env);
973 BT_INIT_LIST_HEAD(&ast->root.u.root.stream);
974 BT_INIT_LIST_HEAD(&ast->root.u.root.event);
975 BT_INIT_LIST_HEAD(&ast->root.u.root.clock);
976 BT_INIT_LIST_HEAD(&ast->root.u.root.callsite);
980 static void ctf_ast_free(struct ctf_ast *ast)
982 struct ctf_node *node, *tmp;
984 bt_list_for_each_entry_safe(node, tmp, &ast->allocated_nodes, gc)
989 int ctf_scanner_append_ast(struct ctf_scanner *scanner)
991 return yyparse(scanner);
994 struct ctf_scanner *ctf_scanner_alloc(FILE *input)
996 struct ctf_scanner *scanner;
999 yydebug = babeltrace_debug;
1001 scanner = malloc(sizeof(*scanner));
1004 memset(scanner, 0, sizeof(*scanner));
1006 ret = yylex_init_extra(scanner, &scanner->scanner);
1008 printf_fatal("yylex_init error");
1009 goto cleanup_scanner;
1011 /* Start processing new stream */
1012 yyrestart(input, scanner->scanner);
1014 scanner->ast = ctf_ast_alloc();
1017 init_scope(&scanner->root_scope, NULL);
1018 scanner->cs = &scanner->root_scope;
1019 BT_INIT_LIST_HEAD(&scanner->allocated_strings);
1022 fprintf(stdout, "Scanner input is a%s.\n",
1023 isatty(fileno(input)) ? "n interactive tty" :
1024 " noninteractive file");
1029 ret = yylex_destroy(scanner->scanner);
1031 printf_fatal("yylex_destroy error");
1037 void ctf_scanner_free(struct ctf_scanner *scanner)
1041 finalize_scope(&scanner->root_scope);
1042 free_strings(&scanner->allocated_strings);
1043 ctf_ast_free(scanner->ast);
1044 ret = yylex_destroy(scanner->scanner);
1046 printf_error("yylex_destroy error");
1055 %parse-param {struct ctf_scanner *scanner}
1056 %lex-param {struct ctf_scanner *scanner}
1058 * Expect two shift-reduce conflicts. Caused by enum name-opt : type {}
1059 * vs struct { int :value; } (unnamed bit-field). The default is to
1060 * shift, so whenever we encounter an enumeration, we are doing the
1061 * proper thing (shift). It is illegal to declare an enumeration
1062 * "bit-field", so it is OK if this situation ends up in a parsing
1067 %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
1068 %token <gs> IDENTIFIER ID_TYPE
1073 unsigned long long ull;
1075 struct gc_string *gs;
1079 %type <gs> STRING_LITERAL CHARACTER_LITERAL
1083 %type <ull> INTEGER_LITERAL
1084 %type <n> postfix_expression unary_expression unary_expression_or_range
1086 %type <n> declaration
1087 %type <n> event_declaration
1088 %type <n> stream_declaration
1089 %type <n> env_declaration
1090 %type <n> trace_declaration
1091 %type <n> clock_declaration
1092 %type <n> callsite_declaration
1093 %type <n> integer_declaration_specifiers
1094 %type <n> declaration_specifiers
1095 %type <n> alias_declaration_specifiers
1097 %type <n> type_declarator_list
1098 %type <n> integer_type_specifier
1099 %type <n> type_specifier
1100 %type <n> struct_type_specifier
1101 %type <n> variant_type_specifier
1102 %type <n> enum_type_specifier
1103 %type <n> struct_or_variant_declaration_list
1104 %type <n> struct_or_variant_declaration
1105 %type <n> struct_or_variant_declarator_list
1106 %type <n> struct_or_variant_declarator
1107 %type <n> enumerator_list
1108 %type <n> enumerator
1109 %type <n> abstract_declarator_list
1110 %type <n> abstract_declarator
1111 %type <n> direct_abstract_declarator
1112 %type <n> alias_abstract_declarator_list
1113 %type <n> alias_abstract_declarator
1114 %type <n> direct_alias_abstract_declarator
1115 %type <n> declarator
1116 %type <n> direct_declarator
1117 %type <n> type_declarator
1118 %type <n> direct_type_declarator
1120 %type <n> ctf_assignment_expression_list
1121 %type <n> ctf_assignment_expression
1128 if (set_parent_node($1, &ctf_scanner_get_ast(scanner)->root))
1129 reparent_error(scanner, "error reparenting to root");
1133 if (set_parent_node($2, &ctf_scanner_get_ast(scanner)->root))
1134 reparent_error(scanner, "error reparenting to root");
1196 /* 2: Phrase structure grammar */
1201 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1202 $$->u.unary_expression.type = UNARY_STRING;
1203 $$->u.unary_expression.u.string = yylval.gs->s;
1207 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1208 $$->u.unary_expression.type = UNARY_STRING;
1209 $$->u.unary_expression.u.string = yylval.gs->s;
1213 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1214 $$->u.unary_expression.type = UNARY_STRING;
1215 $$->u.unary_expression.u.string = yylval.gs->s;
1219 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1220 $$->u.unary_expression.type = UNARY_UNSIGNED_CONSTANT;
1221 $$->u.unary_expression.u.unsigned_constant = $1;
1225 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1226 $$->u.unary_expression.type = UNARY_STRING;
1227 $$->u.unary_expression.u.string = $1->s;
1231 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1232 $$->u.unary_expression.type = UNARY_STRING;
1233 $$->u.unary_expression.u.string = $1->s;
1235 | LPAREN unary_expression RPAREN
1237 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1238 $$->u.unary_expression.type = UNARY_NESTED;
1239 $$->u.unary_expression.u.nested_exp = $2;
1241 | postfix_expression LSBRAC unary_expression RSBRAC
1243 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1244 $$->u.unary_expression.type = UNARY_SBRAC;
1245 $$->u.unary_expression.u.sbrac_exp = $3;
1246 bt_list_splice(&($1)->tmp_head, &($$)->tmp_head);
1247 bt_list_add_tail(&($$)->siblings, &($$)->tmp_head);
1249 | postfix_expression DOT IDENTIFIER
1251 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1252 $$->u.unary_expression.type = UNARY_STRING;
1253 $$->u.unary_expression.u.string = yylval.gs->s;
1254 $$->u.unary_expression.link = UNARY_DOTLINK;
1255 bt_list_splice(&($1)->tmp_head, &($$)->tmp_head);
1256 bt_list_add_tail(&($$)->siblings, &($$)->tmp_head);
1258 | postfix_expression DOT ID_TYPE
1260 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1261 $$->u.unary_expression.type = UNARY_STRING;
1262 $$->u.unary_expression.u.string = yylval.gs->s;
1263 $$->u.unary_expression.link = UNARY_DOTLINK;
1264 bt_list_splice(&($1)->tmp_head, &($$)->tmp_head);
1265 bt_list_add_tail(&($$)->siblings, &($$)->tmp_head);
1267 | postfix_expression RARROW IDENTIFIER
1269 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1270 $$->u.unary_expression.type = UNARY_STRING;
1271 $$->u.unary_expression.u.string = yylval.gs->s;
1272 $$->u.unary_expression.link = UNARY_ARROWLINK;
1273 bt_list_splice(&($1)->tmp_head, &($$)->tmp_head);
1274 bt_list_add_tail(&($$)->siblings, &($$)->tmp_head);
1276 | postfix_expression RARROW ID_TYPE
1278 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1279 $$->u.unary_expression.type = UNARY_STRING;
1280 $$->u.unary_expression.u.string = yylval.gs->s;
1281 $$->u.unary_expression.link = UNARY_ARROWLINK;
1282 bt_list_splice(&($1)->tmp_head, &($$)->tmp_head);
1283 bt_list_add_tail(&($$)->siblings, &($$)->tmp_head);
1290 | PLUS postfix_expression
1293 if ($$->u.unary_expression.type != UNARY_UNSIGNED_CONSTANT
1294 && $$->u.unary_expression.type != UNARY_SIGNED_CONSTANT) {
1295 reparent_error(scanner, "expecting numeric constant");
1298 | MINUS postfix_expression
1301 if ($$->u.unary_expression.type == UNARY_UNSIGNED_CONSTANT) {
1302 $$->u.unary_expression.type = UNARY_SIGNED_CONSTANT;
1303 $$->u.unary_expression.u.signed_constant =
1304 -($$->u.unary_expression.u.unsigned_constant);
1305 } else if ($$->u.unary_expression.type == UNARY_UNSIGNED_CONSTANT) {
1306 $$->u.unary_expression.u.signed_constant =
1307 -($$->u.unary_expression.u.signed_constant);
1309 reparent_error(scanner, "expecting numeric constant");
1314 unary_expression_or_range:
1315 unary_expression DOTDOTDOT unary_expression
1318 _bt_list_splice_tail(&($3)->tmp_head, &($$)->tmp_head);
1319 $3->u.unary_expression.link = UNARY_DOTDOTDOT;
1325 /* 2.2: Declarations */
1328 declaration_specifiers SEMICOLON
1332 | stream_declaration
1340 | callsite_declaration
1342 | declaration_specifiers TYPEDEF declaration_specifiers type_declarator_list SEMICOLON
1344 struct ctf_node *list;
1346 $$ = make_node(scanner, NODE_TYPEDEF);
1347 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1348 $$->u._typedef.type_specifier_list = list;
1349 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
1350 _bt_list_splice_tail(&($3)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
1351 _bt_list_splice_tail(&($4)->tmp_head, &($$)->u._typedef.type_declarators);
1353 | TYPEDEF declaration_specifiers type_declarator_list SEMICOLON
1355 struct ctf_node *list;
1357 $$ = make_node(scanner, NODE_TYPEDEF);
1358 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1359 $$->u._typedef.type_specifier_list = list;
1360 _bt_list_splice_tail(&($2)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
1361 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._typedef.type_declarators);
1363 | declaration_specifiers TYPEDEF type_declarator_list SEMICOLON
1365 struct ctf_node *list;
1367 $$ = make_node(scanner, NODE_TYPEDEF);
1368 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1369 $$->u._typedef.type_specifier_list = list;
1370 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
1371 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._typedef.type_declarators);
1373 | TYPEALIAS declaration_specifiers abstract_declarator_list TYPEASSIGN alias_declaration_specifiers alias_abstract_declarator_list SEMICOLON
1375 struct ctf_node *list;
1377 $$ = make_node(scanner, NODE_TYPEALIAS);
1378 $$->u.typealias.target = make_node(scanner, NODE_TYPEALIAS_TARGET);
1379 $$->u.typealias.alias = make_node(scanner, NODE_TYPEALIAS_ALIAS);
1381 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1382 $$->u.typealias.target->u.typealias_target.type_specifier_list = list;
1383 _bt_list_splice_tail(&($2)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
1384 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.typealias.target->u.typealias_target.type_declarators);
1386 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1387 $$->u.typealias.alias->u.typealias_alias.type_specifier_list = list;
1388 _bt_list_splice_tail(&($5)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
1389 _bt_list_splice_tail(&($6)->tmp_head, &($$)->u.typealias.alias->u.typealias_alias.type_declarators);
1394 event_declaration_begin event_declaration_end
1396 $$ = make_node(scanner, NODE_EVENT);
1398 | event_declaration_begin ctf_assignment_expression_list event_declaration_end
1400 $$ = make_node(scanner, NODE_EVENT);
1401 if (set_parent_node($2, $$))
1402 reparent_error(scanner, "event_declaration");
1406 event_declaration_begin:
1408 { push_scope(scanner); }
1411 event_declaration_end:
1413 { pop_scope(scanner); }
1418 stream_declaration_begin stream_declaration_end
1420 $$ = make_node(scanner, NODE_STREAM);
1422 | stream_declaration_begin ctf_assignment_expression_list stream_declaration_end
1424 $$ = make_node(scanner, NODE_STREAM);
1425 if (set_parent_node($2, $$))
1426 reparent_error(scanner, "stream_declaration");
1430 stream_declaration_begin:
1432 { push_scope(scanner); }
1435 stream_declaration_end:
1437 { pop_scope(scanner); }
1441 env_declaration_begin env_declaration_end
1443 $$ = make_node(scanner, NODE_ENV);
1445 | env_declaration_begin ctf_assignment_expression_list env_declaration_end
1447 $$ = make_node(scanner, NODE_ENV);
1448 if (set_parent_node($2, $$))
1449 reparent_error(scanner, "env declaration");
1453 env_declaration_begin:
1455 { push_scope(scanner); }
1458 env_declaration_end:
1460 { pop_scope(scanner); }
1464 trace_declaration_begin trace_declaration_end
1466 $$ = make_node(scanner, NODE_TRACE);
1468 | trace_declaration_begin ctf_assignment_expression_list trace_declaration_end
1470 $$ = make_node(scanner, NODE_TRACE);
1471 if (set_parent_node($2, $$))
1472 reparent_error(scanner, "trace_declaration");
1476 trace_declaration_begin:
1478 { push_scope(scanner); }
1481 trace_declaration_end:
1483 { pop_scope(scanner); }
1487 CLOCK clock_declaration_begin clock_declaration_end
1489 $$ = make_node(scanner, NODE_CLOCK);
1491 | CLOCK clock_declaration_begin ctf_assignment_expression_list clock_declaration_end
1493 $$ = make_node(scanner, NODE_CLOCK);
1494 if (set_parent_node($3, $$))
1495 reparent_error(scanner, "trace_declaration");
1499 clock_declaration_begin:
1501 { push_scope(scanner); }
1504 clock_declaration_end:
1506 { pop_scope(scanner); }
1509 callsite_declaration:
1510 CALLSITE callsite_declaration_begin callsite_declaration_end
1512 $$ = make_node(scanner, NODE_CALLSITE);
1514 | CALLSITE callsite_declaration_begin ctf_assignment_expression_list callsite_declaration_end
1516 $$ = make_node(scanner, NODE_CALLSITE);
1517 if (set_parent_node($3, $$))
1518 reparent_error(scanner, "trace_declaration");
1522 callsite_declaration_begin:
1524 { push_scope(scanner); }
1527 callsite_declaration_end:
1529 { pop_scope(scanner); }
1532 integer_declaration_specifiers:
1535 struct ctf_node *node;
1537 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1538 node = make_node(scanner, NODE_TYPE_SPECIFIER);
1539 node->u.type_specifier.type = TYPESPEC_CONST;
1540 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
1542 | integer_type_specifier
1544 struct ctf_node *node;
1546 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1548 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
1550 | integer_declaration_specifiers CONST
1552 struct ctf_node *node;
1555 node = make_node(scanner, NODE_TYPE_SPECIFIER);
1556 node->u.type_specifier.type = TYPESPEC_CONST;
1557 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
1559 | integer_declaration_specifiers integer_type_specifier
1562 bt_list_add_tail(&($2)->siblings, &($$)->u.type_specifier_list.head);
1566 declaration_specifiers:
1569 struct ctf_node *node;
1571 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1572 node = make_node(scanner, NODE_TYPE_SPECIFIER);
1573 node->u.type_specifier.type = TYPESPEC_CONST;
1574 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
1578 struct ctf_node *node;
1580 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1582 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
1584 | declaration_specifiers CONST
1586 struct ctf_node *node;
1589 node = make_node(scanner, NODE_TYPE_SPECIFIER);
1590 node->u.type_specifier.type = TYPESPEC_CONST;
1591 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
1593 | declaration_specifiers type_specifier
1596 bt_list_add_tail(&($2)->siblings, &($$)->u.type_specifier_list.head);
1600 type_declarator_list:
1603 | type_declarator_list COMMA type_declarator
1606 bt_list_add_tail(&($3)->siblings, &($$)->tmp_head);
1610 integer_type_specifier:
1613 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1614 $$->u.type_specifier.type = TYPESPEC_CHAR;
1618 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1619 $$->u.type_specifier.type = TYPESPEC_SHORT;
1623 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1624 $$->u.type_specifier.type = TYPESPEC_INT;
1628 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1629 $$->u.type_specifier.type = TYPESPEC_LONG;
1633 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1634 $$->u.type_specifier.type = TYPESPEC_SIGNED;
1638 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1639 $$->u.type_specifier.type = TYPESPEC_UNSIGNED;
1643 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1644 $$->u.type_specifier.type = TYPESPEC_BOOL;
1648 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1649 $$->u.type_specifier.type = TYPESPEC_ID_TYPE;
1650 $$->u.type_specifier.id_type = yylval.gs->s;
1652 | INTEGER LBRAC RBRAC
1654 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1655 $$->u.type_specifier.type = TYPESPEC_INTEGER;
1656 $$->u.type_specifier.node = make_node(scanner, NODE_INTEGER);
1658 | INTEGER LBRAC ctf_assignment_expression_list RBRAC
1660 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1661 $$->u.type_specifier.type = TYPESPEC_INTEGER;
1662 $$->u.type_specifier.node = make_node(scanner, NODE_INTEGER);
1663 if (set_parent_node($3, $$->u.type_specifier.node))
1664 reparent_error(scanner, "integer reparent error");
1671 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1672 $$->u.type_specifier.type = TYPESPEC_VOID;
1676 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1677 $$->u.type_specifier.type = TYPESPEC_CHAR;
1681 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1682 $$->u.type_specifier.type = TYPESPEC_SHORT;
1686 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1687 $$->u.type_specifier.type = TYPESPEC_INT;
1691 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1692 $$->u.type_specifier.type = TYPESPEC_LONG;
1696 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1697 $$->u.type_specifier.type = TYPESPEC_FLOAT;
1701 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1702 $$->u.type_specifier.type = TYPESPEC_DOUBLE;
1706 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1707 $$->u.type_specifier.type = TYPESPEC_SIGNED;
1711 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1712 $$->u.type_specifier.type = TYPESPEC_UNSIGNED;
1716 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1717 $$->u.type_specifier.type = TYPESPEC_BOOL;
1721 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1722 $$->u.type_specifier.type = TYPESPEC_COMPLEX;
1726 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1727 $$->u.type_specifier.type = TYPESPEC_IMAGINARY;
1731 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1732 $$->u.type_specifier.type = TYPESPEC_ID_TYPE;
1733 $$->u.type_specifier.id_type = yylval.gs->s;
1735 | FLOATING_POINT LBRAC RBRAC
1737 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1738 $$->u.type_specifier.type = TYPESPEC_FLOATING_POINT;
1739 $$->u.type_specifier.node = make_node(scanner, NODE_FLOATING_POINT);
1741 | FLOATING_POINT LBRAC ctf_assignment_expression_list RBRAC
1743 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1744 $$->u.type_specifier.type = TYPESPEC_FLOATING_POINT;
1745 $$->u.type_specifier.node = make_node(scanner, NODE_FLOATING_POINT);
1746 if (set_parent_node($3, $$->u.type_specifier.node))
1747 reparent_error(scanner, "floating point reparent error");
1749 | INTEGER LBRAC RBRAC
1751 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1752 $$->u.type_specifier.type = TYPESPEC_INTEGER;
1753 $$->u.type_specifier.node = make_node(scanner, NODE_INTEGER);
1755 | INTEGER LBRAC ctf_assignment_expression_list RBRAC
1757 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1758 $$->u.type_specifier.type = TYPESPEC_INTEGER;
1759 $$->u.type_specifier.node = make_node(scanner, NODE_INTEGER);
1760 if (set_parent_node($3, $$->u.type_specifier.node))
1761 reparent_error(scanner, "integer reparent error");
1765 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1766 $$->u.type_specifier.type = TYPESPEC_STRING;
1767 $$->u.type_specifier.node = make_node(scanner, NODE_STRING);
1769 | STRING LBRAC RBRAC
1771 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1772 $$->u.type_specifier.type = TYPESPEC_STRING;
1773 $$->u.type_specifier.node = make_node(scanner, NODE_STRING);
1775 | STRING LBRAC ctf_assignment_expression_list RBRAC
1777 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1778 $$->u.type_specifier.type = TYPESPEC_STRING;
1779 $$->u.type_specifier.node = make_node(scanner, NODE_STRING);
1780 if (set_parent_node($3, $$->u.type_specifier.node))
1781 reparent_error(scanner, "string reparent error");
1783 | ENUM enum_type_specifier
1785 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1786 $$->u.type_specifier.type = TYPESPEC_ENUM;
1787 $$->u.type_specifier.node = $2;
1789 | VARIANT variant_type_specifier
1791 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1792 $$->u.type_specifier.type = TYPESPEC_VARIANT;
1793 $$->u.type_specifier.node = $2;
1795 | STRUCT struct_type_specifier
1797 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1798 $$->u.type_specifier.type = TYPESPEC_STRUCT;
1799 $$->u.type_specifier.node = $2;
1803 struct_type_specifier:
1804 struct_declaration_begin struct_or_variant_declaration_list struct_declaration_end
1806 $$ = make_node(scanner, NODE_STRUCT);
1807 $$->u._struct.has_body = 1;
1808 if ($2 && set_parent_node($2, $$))
1809 reparent_error(scanner, "struct reparent error");
1811 | IDENTIFIER struct_declaration_begin struct_or_variant_declaration_list struct_declaration_end
1813 $$ = make_node(scanner, NODE_STRUCT);
1814 $$->u._struct.has_body = 1;
1815 $$->u._struct.name = $1->s;
1816 if ($3 && set_parent_node($3, $$))
1817 reparent_error(scanner, "struct reparent error");
1819 | ID_TYPE struct_declaration_begin struct_or_variant_declaration_list struct_declaration_end
1821 $$ = make_node(scanner, NODE_STRUCT);
1822 $$->u._struct.has_body = 1;
1823 $$->u._struct.name = $1->s;
1824 if ($3 && set_parent_node($3, $$))
1825 reparent_error(scanner, "struct reparent error");
1829 $$ = make_node(scanner, NODE_STRUCT);
1830 $$->u._struct.has_body = 0;
1831 $$->u._struct.name = $1->s;
1835 $$ = make_node(scanner, NODE_STRUCT);
1836 $$->u._struct.has_body = 0;
1837 $$->u._struct.name = $1->s;
1839 | struct_declaration_begin struct_or_variant_declaration_list struct_declaration_end TOK_ALIGN LPAREN unary_expression RPAREN
1841 $$ = make_node(scanner, NODE_STRUCT);
1842 $$->u._struct.has_body = 1;
1843 bt_list_add_tail(&($6)->siblings, &$$->u._struct.min_align);
1844 if ($2 && set_parent_node($2, $$))
1845 reparent_error(scanner, "struct reparent error");
1847 | IDENTIFIER struct_declaration_begin struct_or_variant_declaration_list struct_declaration_end TOK_ALIGN LPAREN unary_expression RPAREN
1849 $$ = make_node(scanner, NODE_STRUCT);
1850 $$->u._struct.has_body = 1;
1851 $$->u._struct.name = $1->s;
1852 bt_list_add_tail(&($7)->siblings, &$$->u._struct.min_align);
1853 if ($3 && set_parent_node($3, $$))
1854 reparent_error(scanner, "struct reparent error");
1856 | ID_TYPE struct_declaration_begin struct_or_variant_declaration_list struct_declaration_end TOK_ALIGN LPAREN unary_expression RPAREN
1858 $$ = make_node(scanner, NODE_STRUCT);
1859 $$->u._struct.has_body = 1;
1860 $$->u._struct.name = $1->s;
1861 bt_list_add_tail(&($7)->siblings, &$$->u._struct.min_align);
1862 if ($3 && set_parent_node($3, $$))
1863 reparent_error(scanner, "struct reparent error");
1867 struct_declaration_begin:
1869 { push_scope(scanner); }
1872 struct_declaration_end:
1874 { pop_scope(scanner); }
1877 variant_type_specifier:
1878 variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1880 $$ = make_node(scanner, NODE_VARIANT);
1881 $$->u.variant.has_body = 1;
1882 if ($2 && set_parent_node($2, $$))
1883 reparent_error(scanner, "variant reparent error");
1885 | LT IDENTIFIER GT variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1887 $$ = make_node(scanner, NODE_VARIANT);
1888 $$->u.variant.has_body = 1;
1889 $$->u.variant.choice = $2->s;
1890 if ($5 && set_parent_node($5, $$))
1891 reparent_error(scanner, "variant reparent error");
1893 | LT ID_TYPE GT variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1895 $$ = make_node(scanner, NODE_VARIANT);
1896 $$->u.variant.has_body = 1;
1897 $$->u.variant.choice = $2->s;
1898 if ($5 && set_parent_node($5, $$))
1899 reparent_error(scanner, "variant reparent error");
1901 | IDENTIFIER variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1903 $$ = make_node(scanner, NODE_VARIANT);
1904 $$->u.variant.has_body = 1;
1905 $$->u.variant.name = $1->s;
1906 if ($3 && set_parent_node($3, $$))
1907 reparent_error(scanner, "variant reparent error");
1909 | IDENTIFIER LT IDENTIFIER GT variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1911 $$ = make_node(scanner, NODE_VARIANT);
1912 $$->u.variant.has_body = 1;
1913 $$->u.variant.name = $1->s;
1914 $$->u.variant.choice = $3->s;
1915 if ($6 && set_parent_node($6, $$))
1916 reparent_error(scanner, "variant reparent error");
1918 | IDENTIFIER LT IDENTIFIER GT
1920 $$ = make_node(scanner, NODE_VARIANT);
1921 $$->u.variant.has_body = 0;
1922 $$->u.variant.name = $1->s;
1923 $$->u.variant.choice = $3->s;
1925 | IDENTIFIER LT ID_TYPE GT variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1927 $$ = make_node(scanner, NODE_VARIANT);
1928 $$->u.variant.has_body = 1;
1929 $$->u.variant.name = $1->s;
1930 $$->u.variant.choice = $3->s;
1931 if ($6 && set_parent_node($6, $$))
1932 reparent_error(scanner, "variant reparent error");
1934 | IDENTIFIER LT ID_TYPE GT
1936 $$ = make_node(scanner, NODE_VARIANT);
1937 $$->u.variant.has_body = 0;
1938 $$->u.variant.name = $1->s;
1939 $$->u.variant.choice = $3->s;
1941 | ID_TYPE variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1943 $$ = make_node(scanner, NODE_VARIANT);
1944 $$->u.variant.has_body = 1;
1945 $$->u.variant.name = $1->s;
1946 if ($3 && set_parent_node($3, $$))
1947 reparent_error(scanner, "variant reparent error");
1949 | ID_TYPE LT IDENTIFIER GT variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1951 $$ = make_node(scanner, NODE_VARIANT);
1952 $$->u.variant.has_body = 1;
1953 $$->u.variant.name = $1->s;
1954 $$->u.variant.choice = $3->s;
1955 if ($6 && set_parent_node($6, $$))
1956 reparent_error(scanner, "variant reparent error");
1958 | ID_TYPE LT IDENTIFIER GT
1960 $$ = make_node(scanner, NODE_VARIANT);
1961 $$->u.variant.has_body = 0;
1962 $$->u.variant.name = $1->s;
1963 $$->u.variant.choice = $3->s;
1965 | ID_TYPE LT ID_TYPE GT variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1967 $$ = make_node(scanner, NODE_VARIANT);
1968 $$->u.variant.has_body = 1;
1969 $$->u.variant.name = $1->s;
1970 $$->u.variant.choice = $3->s;
1971 if ($6 && set_parent_node($6, $$))
1972 reparent_error(scanner, "variant reparent error");
1974 | ID_TYPE LT ID_TYPE GT
1976 $$ = make_node(scanner, NODE_VARIANT);
1977 $$->u.variant.has_body = 0;
1978 $$->u.variant.name = $1->s;
1979 $$->u.variant.choice = $3->s;
1983 variant_declaration_begin:
1985 { push_scope(scanner); }
1988 variant_declaration_end:
1990 { pop_scope(scanner); }
1993 enum_type_specifier:
1994 LBRAC enumerator_list RBRAC
1996 $$ = make_node(scanner, NODE_ENUM);
1997 $$->u._enum.has_body = 1;
1998 _bt_list_splice_tail(&($2)->tmp_head, &($$)->u._enum.enumerator_list);
2000 | COLON integer_declaration_specifiers LBRAC enumerator_list RBRAC
2002 $$ = make_node(scanner, NODE_ENUM);
2003 $$->u._enum.has_body = 1;
2004 ($$)->u._enum.container_type = $2;
2005 _bt_list_splice_tail(&($4)->tmp_head, &($$)->u._enum.enumerator_list);
2007 | IDENTIFIER LBRAC enumerator_list RBRAC
2009 $$ = make_node(scanner, NODE_ENUM);
2010 $$->u._enum.has_body = 1;
2011 $$->u._enum.enum_id = $1->s;
2012 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._enum.enumerator_list);
2014 | IDENTIFIER COLON integer_declaration_specifiers LBRAC enumerator_list RBRAC
2016 $$ = make_node(scanner, NODE_ENUM);
2017 $$->u._enum.has_body = 1;
2018 $$->u._enum.enum_id = $1->s;
2019 ($$)->u._enum.container_type = $3;
2020 _bt_list_splice_tail(&($5)->tmp_head, &($$)->u._enum.enumerator_list);
2022 | ID_TYPE LBRAC enumerator_list RBRAC
2024 $$ = make_node(scanner, NODE_ENUM);
2025 $$->u._enum.has_body = 1;
2026 $$->u._enum.enum_id = $1->s;
2027 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._enum.enumerator_list);
2029 | ID_TYPE COLON integer_declaration_specifiers LBRAC enumerator_list RBRAC
2031 $$ = make_node(scanner, NODE_ENUM);
2032 $$->u._enum.has_body = 1;
2033 $$->u._enum.enum_id = $1->s;
2034 ($$)->u._enum.container_type = $3;
2035 _bt_list_splice_tail(&($5)->tmp_head, &($$)->u._enum.enumerator_list);
2037 | LBRAC enumerator_list COMMA RBRAC
2039 $$ = make_node(scanner, NODE_ENUM);
2040 $$->u._enum.has_body = 1;
2041 _bt_list_splice_tail(&($2)->tmp_head, &($$)->u._enum.enumerator_list);
2043 | COLON integer_declaration_specifiers LBRAC enumerator_list COMMA RBRAC
2045 $$ = make_node(scanner, NODE_ENUM);
2046 $$->u._enum.has_body = 1;
2047 ($$)->u._enum.container_type = $2;
2048 _bt_list_splice_tail(&($4)->tmp_head, &($$)->u._enum.enumerator_list);
2050 | IDENTIFIER LBRAC enumerator_list COMMA RBRAC
2052 $$ = make_node(scanner, NODE_ENUM);
2053 $$->u._enum.has_body = 1;
2054 $$->u._enum.enum_id = $1->s;
2055 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._enum.enumerator_list);
2057 | IDENTIFIER COLON integer_declaration_specifiers LBRAC enumerator_list COMMA RBRAC
2059 $$ = make_node(scanner, NODE_ENUM);
2060 $$->u._enum.has_body = 1;
2061 $$->u._enum.enum_id = $1->s;
2062 ($$)->u._enum.container_type = $3;
2063 _bt_list_splice_tail(&($5)->tmp_head, &($$)->u._enum.enumerator_list);
2067 $$ = make_node(scanner, NODE_ENUM);
2068 $$->u._enum.has_body = 0;
2069 $$->u._enum.enum_id = $1->s;
2071 | ID_TYPE LBRAC enumerator_list COMMA RBRAC
2073 $$ = make_node(scanner, NODE_ENUM);
2074 $$->u._enum.has_body = 1;
2075 $$->u._enum.enum_id = $1->s;
2076 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._enum.enumerator_list);
2078 | ID_TYPE COLON integer_declaration_specifiers LBRAC enumerator_list COMMA RBRAC
2080 $$ = make_node(scanner, NODE_ENUM);
2081 $$->u._enum.has_body = 1;
2082 $$->u._enum.enum_id = $1->s;
2083 ($$)->u._enum.container_type = $3;
2084 _bt_list_splice_tail(&($5)->tmp_head, &($$)->u._enum.enumerator_list);
2088 $$ = make_node(scanner, NODE_ENUM);
2089 $$->u._enum.has_body = 0;
2090 $$->u._enum.enum_id = $1->s;
2094 struct_or_variant_declaration_list:
2097 | struct_or_variant_declaration_list struct_or_variant_declaration
2101 bt_list_add_tail(&($2)->siblings, &($$)->tmp_head);
2104 bt_list_add_tail(&($$)->siblings, &($$)->tmp_head);
2109 struct_or_variant_declaration:
2110 declaration_specifiers struct_or_variant_declarator_list SEMICOLON
2112 struct ctf_node *list;
2114 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2115 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2116 $$ = make_node(scanner, NODE_STRUCT_OR_VARIANT_DECLARATION);
2117 ($$)->u.struct_or_variant_declaration.type_specifier_list = list;
2118 _bt_list_splice_tail(&($2)->tmp_head, &($$)->u.struct_or_variant_declaration.type_declarators);
2120 | declaration_specifiers TYPEDEF declaration_specifiers type_declarator_list SEMICOLON
2122 struct ctf_node *list;
2124 $$ = make_node(scanner, NODE_TYPEDEF);
2125 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2126 $$->u._typedef.type_specifier_list = list;
2127 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2128 _bt_list_splice_tail(&($3)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2129 _bt_list_splice_tail(&($4)->tmp_head, &($$)->u._typedef.type_declarators);
2131 | TYPEDEF declaration_specifiers type_declarator_list SEMICOLON
2133 struct ctf_node *list;
2135 $$ = make_node(scanner, NODE_TYPEDEF);
2136 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2137 $$->u._typedef.type_specifier_list = list;
2138 _bt_list_splice_tail(&($2)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2139 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._typedef.type_declarators);
2141 | declaration_specifiers TYPEDEF type_declarator_list SEMICOLON
2143 struct ctf_node *list;
2145 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2146 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2147 $$ = make_node(scanner, NODE_TYPEDEF);
2148 ($$)->u.struct_or_variant_declaration.type_specifier_list = list;
2149 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._typedef.type_declarators);
2151 | TYPEALIAS declaration_specifiers abstract_declarator_list TYPEASSIGN alias_declaration_specifiers alias_abstract_declarator_list SEMICOLON
2153 struct ctf_node *list;
2155 $$ = make_node(scanner, NODE_TYPEALIAS);
2156 $$->u.typealias.target = make_node(scanner, NODE_TYPEALIAS_TARGET);
2157 $$->u.typealias.alias = make_node(scanner, NODE_TYPEALIAS_ALIAS);
2159 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2160 $$->u.typealias.target->u.typealias_target.type_specifier_list = list;
2161 _bt_list_splice_tail(&($2)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2162 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.typealias.target->u.typealias_target.type_declarators);
2164 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2165 $$->u.typealias.alias->u.typealias_alias.type_specifier_list = list;
2166 _bt_list_splice_tail(&($5)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2167 _bt_list_splice_tail(&($6)->tmp_head, &($$)->u.typealias.alias->u.typealias_alias.type_declarators);
2171 alias_declaration_specifiers:
2174 struct ctf_node *node;
2176 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2177 node = make_node(scanner, NODE_TYPE_SPECIFIER);
2178 node->u.type_specifier.type = TYPESPEC_CONST;
2179 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
2183 struct ctf_node *node;
2185 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2187 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
2191 struct ctf_node *node;
2193 add_type(scanner, $1);
2194 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2195 node = make_node(scanner, NODE_TYPE_SPECIFIER);
2196 node->u.type_specifier.type = TYPESPEC_ID_TYPE;
2197 node->u.type_specifier.id_type = yylval.gs->s;
2198 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
2200 | alias_declaration_specifiers CONST
2202 struct ctf_node *node;
2205 node = make_node(scanner, NODE_TYPE_SPECIFIER);
2206 node->u.type_specifier.type = TYPESPEC_CONST;
2207 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
2209 | alias_declaration_specifiers type_specifier
2212 bt_list_add_tail(&($2)->siblings, &($$)->u.type_specifier_list.head);
2214 | alias_declaration_specifiers IDENTIFIER
2216 struct ctf_node *node;
2218 add_type(scanner, $2);
2220 node = make_node(scanner, NODE_TYPE_SPECIFIER);
2221 node->u.type_specifier.type = TYPESPEC_ID_TYPE;
2222 node->u.type_specifier.id_type = yylval.gs->s;
2223 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
2227 struct_or_variant_declarator_list:
2228 struct_or_variant_declarator
2230 | struct_or_variant_declarator_list COMMA struct_or_variant_declarator
2233 bt_list_add_tail(&($3)->siblings, &($$)->tmp_head);
2237 struct_or_variant_declarator:
2240 | COLON unary_expression
2242 | declarator COLON unary_expression
2245 if (set_parent_node($3, $1))
2246 reparent_error(scanner, "struct_or_variant_declarator");
2253 | enumerator_list COMMA enumerator
2256 bt_list_add_tail(&($3)->siblings, &($$)->tmp_head);
2263 $$ = make_node(scanner, NODE_ENUMERATOR);
2264 $$->u.enumerator.id = $1->s;
2268 $$ = make_node(scanner, NODE_ENUMERATOR);
2269 $$->u.enumerator.id = $1->s;
2273 $$ = make_node(scanner, NODE_ENUMERATOR);
2274 $$->u.enumerator.id = $1->s;
2278 $$ = make_node(scanner, NODE_ENUMERATOR);
2279 $$->u.enumerator.id = $1->s;
2281 | IDENTIFIER EQUAL unary_expression_or_range
2283 $$ = make_node(scanner, NODE_ENUMERATOR);
2284 $$->u.enumerator.id = $1->s;
2285 bt_list_splice(&($3)->tmp_head, &($$)->u.enumerator.values);
2287 | ID_TYPE EQUAL unary_expression_or_range
2289 $$ = make_node(scanner, NODE_ENUMERATOR);
2290 $$->u.enumerator.id = $1->s;
2291 bt_list_splice(&($3)->tmp_head, &($$)->u.enumerator.values);
2293 | keywords EQUAL unary_expression_or_range
2295 $$ = make_node(scanner, NODE_ENUMERATOR);
2296 $$->u.enumerator.id = $1->s;
2297 bt_list_splice(&($3)->tmp_head, &($$)->u.enumerator.values);
2299 | STRING_LITERAL EQUAL unary_expression_or_range
2301 $$ = make_node(scanner, NODE_ENUMERATOR);
2302 $$->u.enumerator.id = $1->s;
2303 bt_list_splice(&($3)->tmp_head, &($$)->u.enumerator.values);
2307 abstract_declarator_list:
2310 | abstract_declarator_list COMMA abstract_declarator
2313 bt_list_add_tail(&($3)->siblings, &($$)->tmp_head);
2317 abstract_declarator:
2318 direct_abstract_declarator
2320 | pointer direct_abstract_declarator
2323 bt_list_splice(&($1)->tmp_head, &($$)->u.type_declarator.pointers);
2327 direct_abstract_declarator:
2330 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2331 $$->u.type_declarator.type = TYPEDEC_ID;
2336 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2337 $$->u.type_declarator.type = TYPEDEC_ID;
2338 $$->u.type_declarator.u.id = $1->s;
2340 | LPAREN abstract_declarator RPAREN
2342 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2343 $$->u.type_declarator.type = TYPEDEC_NESTED;
2344 $$->u.type_declarator.u.nested.type_declarator = $2;
2346 | direct_abstract_declarator LSBRAC unary_expression 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 BT_INIT_LIST_HEAD(&($$)->u.type_declarator.u.nested.length);
2352 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.type_declarator.u.nested.length);
2354 | direct_abstract_declarator LSBRAC RSBRAC
2356 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2357 $$->u.type_declarator.type = TYPEDEC_NESTED;
2358 $$->u.type_declarator.u.nested.type_declarator = $1;
2359 $$->u.type_declarator.u.nested.abstract_array = 1;
2363 alias_abstract_declarator_list:
2364 alias_abstract_declarator
2366 | alias_abstract_declarator_list COMMA alias_abstract_declarator
2369 bt_list_add_tail(&($3)->siblings, &($$)->tmp_head);
2373 alias_abstract_declarator:
2374 direct_alias_abstract_declarator
2376 | pointer direct_alias_abstract_declarator
2379 bt_list_splice(&($1)->tmp_head, &($$)->u.type_declarator.pointers);
2383 direct_alias_abstract_declarator:
2386 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2387 $$->u.type_declarator.type = TYPEDEC_ID;
2390 | LPAREN alias_abstract_declarator RPAREN
2392 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2393 $$->u.type_declarator.type = TYPEDEC_NESTED;
2394 $$->u.type_declarator.u.nested.type_declarator = $2;
2396 | direct_alias_abstract_declarator LSBRAC unary_expression RSBRAC
2398 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2399 $$->u.type_declarator.type = TYPEDEC_NESTED;
2400 $$->u.type_declarator.u.nested.type_declarator = $1;
2401 BT_INIT_LIST_HEAD(&($$)->u.type_declarator.u.nested.length);
2402 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.type_declarator.u.nested.length);
2404 | direct_alias_abstract_declarator LSBRAC RSBRAC
2406 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2407 $$->u.type_declarator.type = TYPEDEC_NESTED;
2408 $$->u.type_declarator.u.nested.type_declarator = $1;
2409 $$->u.type_declarator.u.nested.abstract_array = 1;
2416 | pointer direct_declarator
2419 bt_list_splice(&($1)->tmp_head, &($$)->u.type_declarator.pointers);
2426 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2427 $$->u.type_declarator.type = TYPEDEC_ID;
2428 $$->u.type_declarator.u.id = $1->s;
2430 | LPAREN declarator RPAREN
2432 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2433 $$->u.type_declarator.type = TYPEDEC_NESTED;
2434 $$->u.type_declarator.u.nested.type_declarator = $2;
2436 | direct_declarator LSBRAC unary_expression RSBRAC
2438 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2439 $$->u.type_declarator.type = TYPEDEC_NESTED;
2440 $$->u.type_declarator.u.nested.type_declarator = $1;
2441 BT_INIT_LIST_HEAD(&($$)->u.type_declarator.u.nested.length);
2442 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.type_declarator.u.nested.length);
2447 direct_type_declarator
2449 | pointer direct_type_declarator
2452 bt_list_splice(&($1)->tmp_head, &($$)->u.type_declarator.pointers);
2456 direct_type_declarator:
2459 add_type(scanner, $1);
2460 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2461 $$->u.type_declarator.type = TYPEDEC_ID;
2462 $$->u.type_declarator.u.id = $1->s;
2464 | LPAREN type_declarator RPAREN
2466 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2467 $$->u.type_declarator.type = TYPEDEC_NESTED;
2468 $$->u.type_declarator.u.nested.type_declarator = $2;
2470 | direct_type_declarator LSBRAC unary_expression RSBRAC
2472 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2473 $$->u.type_declarator.type = TYPEDEC_NESTED;
2474 $$->u.type_declarator.u.nested.type_declarator = $1;
2475 BT_INIT_LIST_HEAD(&($$)->u.type_declarator.u.nested.length);
2476 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.type_declarator.u.nested.length);
2483 $$ = make_node(scanner, NODE_POINTER);
2487 $$ = make_node(scanner, NODE_POINTER);
2488 bt_list_splice(&($2)->tmp_head, &($$)->tmp_head);
2490 | STAR type_qualifier_list pointer
2492 $$ = make_node(scanner, NODE_POINTER);
2493 $$->u.pointer.const_qualifier = 1;
2494 bt_list_splice(&($3)->tmp_head, &($$)->tmp_head);
2498 type_qualifier_list:
2499 /* pointer assumes only const type qualifier */
2501 | type_qualifier_list CONST
2504 /* 2.3: CTF-specific declarations */
2506 ctf_assignment_expression_list:
2507 ctf_assignment_expression SEMICOLON
2509 | ctf_assignment_expression_list ctf_assignment_expression SEMICOLON
2512 bt_list_add_tail(&($2)->siblings, &($$)->tmp_head);
2516 ctf_assignment_expression:
2517 unary_expression EQUAL unary_expression
2520 * Because we have left and right, cannot use
2523 $$ = make_node(scanner, NODE_CTF_EXPRESSION);
2524 _bt_list_splice_tail(&($1)->tmp_head, &($$)->u.ctf_expression.left);
2525 if ($1->u.unary_expression.type != UNARY_STRING)
2526 reparent_error(scanner, "ctf_assignment_expression left expects string");
2527 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.ctf_expression.right);
2529 | unary_expression TYPEASSIGN declaration_specifiers /* Only allow struct */
2532 * Because we have left and right, cannot use
2535 $$ = make_node(scanner, NODE_CTF_EXPRESSION);
2536 _bt_list_splice_tail(&($1)->tmp_head, &($$)->u.ctf_expression.left);
2537 if ($1->u.unary_expression.type != UNARY_STRING)
2538 reparent_error(scanner, "ctf_assignment_expression left expects string");
2539 bt_list_add_tail(&($3)->siblings, &($$)->u.ctf_expression.right);
2541 | declaration_specifiers TYPEDEF declaration_specifiers type_declarator_list
2543 struct ctf_node *list;
2545 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2546 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2547 _bt_list_splice_tail(&($3)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2548 $$ = make_node(scanner, NODE_TYPEDEF);
2549 ($$)->u.struct_or_variant_declaration.type_specifier_list = list;
2550 _bt_list_splice_tail(&($4)->tmp_head, &($$)->u._typedef.type_declarators);
2552 | TYPEDEF declaration_specifiers type_declarator_list
2554 struct ctf_node *list;
2556 $$ = make_node(scanner, NODE_TYPEDEF);
2557 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2558 $$->u._typedef.type_specifier_list = list;
2559 _bt_list_splice_tail(&($2)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2560 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._typedef.type_declarators);
2562 | declaration_specifiers TYPEDEF type_declarator_list
2564 struct ctf_node *list;
2566 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2567 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2568 $$ = make_node(scanner, NODE_TYPEDEF);
2569 ($$)->u.struct_or_variant_declaration.type_specifier_list = list;
2570 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._typedef.type_declarators);
2572 | TYPEALIAS declaration_specifiers abstract_declarator_list TYPEASSIGN alias_declaration_specifiers alias_abstract_declarator_list
2574 struct ctf_node *list;
2576 $$ = make_node(scanner, NODE_TYPEALIAS);
2577 $$->u.typealias.target = make_node(scanner, NODE_TYPEALIAS_TARGET);
2578 $$->u.typealias.alias = make_node(scanner, NODE_TYPEALIAS_ALIAS);
2580 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2581 $$->u.typealias.target->u.typealias_target.type_specifier_list = list;
2582 _bt_list_splice_tail(&($2)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2583 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.typealias.target->u.typealias_target.type_declarators);
2585 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2586 $$->u.typealias.alias->u.typealias_alias.type_specifier_list = list;
2587 _bt_list_splice_tail(&($5)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2588 _bt_list_splice_tail(&($6)->tmp_head, &($$)->u.typealias.alias->u.typealias_alias.type_declarators);