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;
112 void setstring(struct ctf_scanner *scanner, YYSTYPE *lvalp, const char *src)
114 lvalp->gs = gc_string_alloc(scanner, strlen(src) + 1);
115 strcpy(lvalp->gs->s, src);
119 int str_check(size_t str_len, size_t offset, size_t len)
122 if (offset + len < offset)
124 if (offset + len > str_len)
130 int import_basic_string(struct ctf_scanner *scanner, YYSTYPE *lvalp,
131 size_t len, const char *src, char delim)
133 size_t pos = 0, dpos = 0;
135 if (str_check(len, pos, 1))
137 if (src[pos++] != delim)
140 while (src[pos] != delim) {
143 if (str_check(len, pos, 1))
147 if (str_check(len, pos, 1))
192 if (str_check(len, pos, oct_len))
194 if (!isdigit((int) src[pos]) || !isdigit((int) src[pos+1]) || !isdigit((int) src[pos+2]))
196 char oct_buffer[4] = { src[pos], src[pos+1], src[pos+2], '\0' };
197 c = strtoul(&oct_buffer[0], NULL, 8);
205 if (str_check(len, pos, hex_len))
207 if (!isxdigit((int) src[pos]) || !isxdigit((int) src[pos+1]))
209 char hex_buffer[3] = { src[pos], src[pos+1], '\0' };
210 c = strtoul(&hex_buffer[0], NULL, 16);
218 if (str_check(len, dpos, 1))
220 lvalp->gs->s[dpos++] = c;
223 if (str_check(len, dpos, 1))
225 lvalp->gs->s[dpos++] = '\0';
227 if (str_check(len, pos, 1))
229 if (src[pos++] != delim)
232 if (str_check(len, pos, 1))
234 if (src[pos] != '\0')
239 int import_string(struct ctf_scanner *scanner, YYSTYPE *lvalp,
240 const char *src, char delim)
244 len = strlen(src) + 1;
245 lvalp->gs = gc_string_alloc(scanner, len);
247 // TODO: import wide string
248 printfl_error(yyget_lineno(scanner),
249 "Wide string not supported yet.");
252 return import_basic_string(scanner, lvalp, len, src, delim);
256 static void init_scope(struct ctf_scanner_scope *scope,
257 struct ctf_scanner_scope *parent)
259 scope->parent = parent;
260 scope->types = g_hash_table_new_full(g_str_hash, g_str_equal,
264 static void finalize_scope(struct ctf_scanner_scope *scope)
266 g_hash_table_destroy(scope->types);
269 static void push_scope(struct ctf_scanner *scanner)
271 struct ctf_scanner_scope *ns;
273 printf_debug("push scope\n");
274 ns = malloc(sizeof(struct ctf_scanner_scope));
275 init_scope(ns, scanner->cs);
279 static void pop_scope(struct ctf_scanner *scanner)
281 struct ctf_scanner_scope *os;
283 printf_debug("pop scope\n");
285 scanner->cs = os->parent;
290 static int lookup_type(struct ctf_scanner_scope *s, const char *id)
294 ret = (int) (long) g_hash_table_lookup(s->types, id);
295 printf_debug("lookup %p %s %d\n", s, id, ret);
300 int is_type(struct ctf_scanner *scanner, const char *id)
302 struct ctf_scanner_scope *it;
305 for (it = scanner->cs; it != NULL; it = it->parent) {
306 if (lookup_type(it, id)) {
311 printf_debug("is type %s %d\n", id, ret);
315 static void add_type(struct ctf_scanner *scanner, struct gc_string *id)
317 printf_debug("add type %s\n", id->s);
318 if (lookup_type(scanner->cs, id->s))
320 g_hash_table_insert(scanner->cs->types, id->s, id->s);
323 static struct ctf_node *make_node(struct ctf_scanner *scanner,
326 struct ctf_ast *ast = ctf_scanner_get_ast(scanner);
327 struct ctf_node *node;
329 node = malloc(sizeof(*node));
332 memset(node, 0, sizeof(*node));
334 node->lineno = yyget_lineno(scanner->scanner);
335 BT_INIT_LIST_HEAD(&node->tmp_head);
336 bt_list_add(&node->gc, &ast->allocated_nodes);
337 bt_list_add(&node->siblings, &node->tmp_head);
341 printfn_fatal(node, "trying to create root node");
345 BT_INIT_LIST_HEAD(&node->u.event.declaration_list);
348 BT_INIT_LIST_HEAD(&node->u.stream.declaration_list);
351 BT_INIT_LIST_HEAD(&node->u.env.declaration_list);
354 BT_INIT_LIST_HEAD(&node->u.trace.declaration_list);
357 BT_INIT_LIST_HEAD(&node->u.clock.declaration_list);
360 BT_INIT_LIST_HEAD(&node->u.callsite.declaration_list);
363 case NODE_CTF_EXPRESSION:
364 BT_INIT_LIST_HEAD(&node->u.ctf_expression.left);
365 BT_INIT_LIST_HEAD(&node->u.ctf_expression.right);
367 case NODE_UNARY_EXPRESSION:
371 BT_INIT_LIST_HEAD(&node->u._typedef.type_declarators);
373 case NODE_TYPEALIAS_TARGET:
374 BT_INIT_LIST_HEAD(&node->u.typealias_target.type_declarators);
376 case NODE_TYPEALIAS_ALIAS:
377 BT_INIT_LIST_HEAD(&node->u.typealias_alias.type_declarators);
382 case NODE_TYPE_SPECIFIER:
384 case NODE_TYPE_SPECIFIER_LIST:
385 BT_INIT_LIST_HEAD(&node->u.type_specifier_list.head);
389 case NODE_TYPE_DECLARATOR:
390 BT_INIT_LIST_HEAD(&node->u.type_declarator.pointers);
393 case NODE_FLOATING_POINT:
394 BT_INIT_LIST_HEAD(&node->u.floating_point.expressions);
397 BT_INIT_LIST_HEAD(&node->u.integer.expressions);
400 BT_INIT_LIST_HEAD(&node->u.string.expressions);
402 case NODE_ENUMERATOR:
403 BT_INIT_LIST_HEAD(&node->u.enumerator.values);
406 BT_INIT_LIST_HEAD(&node->u._enum.enumerator_list);
408 case NODE_STRUCT_OR_VARIANT_DECLARATION:
409 BT_INIT_LIST_HEAD(&node->u.struct_or_variant_declaration.type_declarators);
412 BT_INIT_LIST_HEAD(&node->u.variant.declaration_list);
415 BT_INIT_LIST_HEAD(&node->u._struct.declaration_list);
416 BT_INIT_LIST_HEAD(&node->u._struct.min_align);
421 printfn_fatal(node, "unknown node type '%d'", (int) type);
428 static int reparent_ctf_expression(struct ctf_node *node,
429 struct ctf_node *parent)
431 switch (parent->type) {
433 _bt_list_splice_tail(&node->tmp_head, &parent->u.event.declaration_list);
436 _bt_list_splice_tail(&node->tmp_head, &parent->u.stream.declaration_list);
439 _bt_list_splice_tail(&node->tmp_head, &parent->u.env.declaration_list);
442 _bt_list_splice_tail(&node->tmp_head, &parent->u.trace.declaration_list);
445 _bt_list_splice_tail(&node->tmp_head, &parent->u.clock.declaration_list);
448 _bt_list_splice_tail(&node->tmp_head, &parent->u.callsite.declaration_list);
450 case NODE_FLOATING_POINT:
451 _bt_list_splice_tail(&node->tmp_head, &parent->u.floating_point.expressions);
454 _bt_list_splice_tail(&node->tmp_head, &parent->u.integer.expressions);
457 _bt_list_splice_tail(&node->tmp_head, &parent->u.string.expressions);
461 case NODE_CTF_EXPRESSION:
463 case NODE_TYPEALIAS_TARGET:
464 case NODE_TYPEALIAS_ALIAS:
466 case NODE_TYPE_SPECIFIER:
467 case NODE_TYPE_SPECIFIER_LIST:
469 case NODE_TYPE_DECLARATOR:
470 case NODE_ENUMERATOR:
472 case NODE_STRUCT_OR_VARIANT_DECLARATION:
475 case NODE_UNARY_EXPRESSION:
480 printfn_fatal(node, "unknown node type '%d'", (int) parent->type);
486 static int reparent_typedef(struct ctf_node *node, struct ctf_node *parent)
488 switch (parent->type) {
490 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.declaration_list);
493 _bt_list_splice_tail(&node->tmp_head, &parent->u.event.declaration_list);
496 _bt_list_splice_tail(&node->tmp_head, &parent->u.stream.declaration_list);
499 _bt_list_splice_tail(&node->tmp_head, &parent->u.env.declaration_list);
502 _bt_list_splice_tail(&node->tmp_head, &parent->u.trace.declaration_list);
505 _bt_list_splice_tail(&node->tmp_head, &parent->u.clock.declaration_list);
508 _bt_list_splice_tail(&node->tmp_head, &parent->u.callsite.declaration_list);
511 _bt_list_splice_tail(&node->tmp_head, &parent->u.variant.declaration_list);
514 _bt_list_splice_tail(&node->tmp_head, &parent->u._struct.declaration_list);
517 case NODE_FLOATING_POINT:
520 case NODE_CTF_EXPRESSION:
522 case NODE_TYPEALIAS_TARGET:
523 case NODE_TYPEALIAS_ALIAS:
525 case NODE_TYPE_SPECIFIER:
526 case NODE_TYPE_SPECIFIER_LIST:
528 case NODE_TYPE_DECLARATOR:
529 case NODE_ENUMERATOR:
531 case NODE_STRUCT_OR_VARIANT_DECLARATION:
532 case NODE_UNARY_EXPRESSION:
537 printfn_fatal(node, "unknown node type %d", parent->type);
543 static int reparent_typealias(struct ctf_node *node, struct ctf_node *parent)
545 switch (parent->type) {
547 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.declaration_list);
550 _bt_list_splice_tail(&node->tmp_head, &parent->u.event.declaration_list);
553 _bt_list_splice_tail(&node->tmp_head, &parent->u.stream.declaration_list);
556 _bt_list_splice_tail(&node->tmp_head, &parent->u.env.declaration_list);
559 _bt_list_splice_tail(&node->tmp_head, &parent->u.trace.declaration_list);
562 _bt_list_splice_tail(&node->tmp_head, &parent->u.clock.declaration_list);
565 _bt_list_splice_tail(&node->tmp_head, &parent->u.callsite.declaration_list);
568 _bt_list_splice_tail(&node->tmp_head, &parent->u.variant.declaration_list);
571 _bt_list_splice_tail(&node->tmp_head, &parent->u._struct.declaration_list);
574 case NODE_FLOATING_POINT:
577 case NODE_CTF_EXPRESSION:
579 case NODE_TYPEALIAS_TARGET:
580 case NODE_TYPEALIAS_ALIAS:
582 case NODE_TYPE_SPECIFIER:
583 case NODE_TYPE_SPECIFIER_LIST:
585 case NODE_TYPE_DECLARATOR:
586 case NODE_ENUMERATOR:
588 case NODE_STRUCT_OR_VARIANT_DECLARATION:
589 case NODE_UNARY_EXPRESSION:
594 printfn_fatal(node, "unknown node type '%d'", (int) parent->type);
600 static int reparent_type_specifier(struct ctf_node *node,
601 struct ctf_node *parent)
603 switch (parent->type) {
604 case NODE_TYPE_SPECIFIER_LIST:
605 _bt_list_splice_tail(&node->tmp_head, &parent->u.type_specifier_list.head);
608 case NODE_TYPE_SPECIFIER:
618 case NODE_TYPEALIAS_TARGET:
619 case NODE_TYPEALIAS_ALIAS:
620 case NODE_TYPE_DECLARATOR:
622 case NODE_STRUCT_OR_VARIANT_DECLARATION:
624 case NODE_FLOATING_POINT:
627 case NODE_CTF_EXPRESSION:
629 case NODE_ENUMERATOR:
630 case NODE_UNARY_EXPRESSION:
635 printfn_fatal(node, "unknown node type '%d'", (int) parent->type);
641 static int reparent_type_specifier_list(struct ctf_node *node,
642 struct ctf_node *parent)
644 switch (parent->type) {
646 bt_list_add_tail(&node->siblings, &parent->u.root.declaration_list);
649 bt_list_add_tail(&node->siblings, &parent->u.event.declaration_list);
652 bt_list_add_tail(&node->siblings, &parent->u.stream.declaration_list);
655 bt_list_add_tail(&node->siblings, &parent->u.env.declaration_list);
658 bt_list_add_tail(&node->siblings, &parent->u.trace.declaration_list);
661 bt_list_add_tail(&node->siblings, &parent->u.clock.declaration_list);
664 bt_list_add_tail(&node->siblings, &parent->u.callsite.declaration_list);
667 bt_list_add_tail(&node->siblings, &parent->u.variant.declaration_list);
670 bt_list_add_tail(&node->siblings, &parent->u._struct.declaration_list);
673 parent->u._typedef.type_specifier_list = node;
675 case NODE_TYPEALIAS_TARGET:
676 parent->u.typealias_target.type_specifier_list = node;
678 case NODE_TYPEALIAS_ALIAS:
679 parent->u.typealias_alias.type_specifier_list = node;
682 parent->u._enum.container_type = node;
684 case NODE_STRUCT_OR_VARIANT_DECLARATION:
685 parent->u.struct_or_variant_declaration.type_specifier_list = node;
687 case NODE_TYPE_DECLARATOR:
688 case NODE_TYPE_SPECIFIER:
690 case NODE_FLOATING_POINT:
693 case NODE_CTF_EXPRESSION:
695 case NODE_ENUMERATOR:
696 case NODE_UNARY_EXPRESSION:
701 printfn_fatal(node, "unknown node type '%d'", (int) parent->type);
707 static int reparent_type_declarator(struct ctf_node *node,
708 struct ctf_node *parent)
710 switch (parent->type) {
711 case NODE_TYPE_DECLARATOR:
712 parent->u.type_declarator.type = TYPEDEC_NESTED;
713 parent->u.type_declarator.u.nested.type_declarator = node;
715 case NODE_STRUCT_OR_VARIANT_DECLARATION:
716 _bt_list_splice_tail(&node->tmp_head, &parent->u.struct_or_variant_declaration.type_declarators);
719 _bt_list_splice_tail(&node->tmp_head, &parent->u._typedef.type_declarators);
721 case NODE_TYPEALIAS_TARGET:
722 _bt_list_splice_tail(&node->tmp_head, &parent->u.typealias_target.type_declarators);
724 case NODE_TYPEALIAS_ALIAS:
725 _bt_list_splice_tail(&node->tmp_head, &parent->u.typealias_alias.type_declarators);
739 case NODE_FLOATING_POINT:
742 case NODE_CTF_EXPRESSION:
743 case NODE_TYPE_SPECIFIER:
744 case NODE_TYPE_SPECIFIER_LIST:
746 case NODE_ENUMERATOR:
747 case NODE_UNARY_EXPRESSION:
752 printfn_fatal(node, "unknown node type '%d'", (int) parent->type);
761 * Link node to parent. Returns 0 on success, -EPERM if it is not permitted to
762 * create the link declared by the input, -ENOENT if node or parent is NULL,
763 * -EINVAL if there is an internal structure problem.
765 static int set_parent_node(struct ctf_node *node,
766 struct ctf_node *parent)
768 if (!node || !parent)
771 /* Note: Linking to parent will be done only by an external visitor */
773 switch (node->type) {
775 printfn_fatal(node, "trying to reparent root node");
779 if (parent->type == NODE_ROOT) {
780 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.event);
786 if (parent->type == NODE_ROOT) {
787 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.stream);
793 if (parent->type == NODE_ROOT) {
794 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.env);
800 if (parent->type == NODE_ROOT) {
801 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.trace);
807 if (parent->type == NODE_ROOT) {
808 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.clock);
814 if (parent->type == NODE_ROOT) {
815 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.callsite);
821 case NODE_CTF_EXPRESSION:
822 return reparent_ctf_expression(node, parent);
823 case NODE_UNARY_EXPRESSION:
824 if (parent->type == NODE_TYPE_DECLARATOR)
825 parent->u.type_declarator.bitfield_len = node;
831 return reparent_typedef(node, parent);
832 case NODE_TYPEALIAS_TARGET:
833 if (parent->type == NODE_TYPEALIAS)
834 parent->u.typealias.target = node;
837 case NODE_TYPEALIAS_ALIAS:
838 if (parent->type == NODE_TYPEALIAS)
839 parent->u.typealias.alias = node;
843 return reparent_typealias(node, parent);
846 if (parent->type == NODE_TYPE_DECLARATOR) {
847 _bt_list_splice_tail(&node->tmp_head, &parent->u.type_declarator.pointers);
851 case NODE_TYPE_DECLARATOR:
852 return reparent_type_declarator(node, parent);
854 case NODE_TYPE_SPECIFIER_LIST:
855 return reparent_type_specifier_list(node, parent);
857 case NODE_TYPE_SPECIFIER:
858 return reparent_type_specifier(node, parent);
860 case NODE_FLOATING_POINT:
866 return -EINVAL; /* Dealt with internally within grammar */
868 case NODE_ENUMERATOR:
869 if (parent->type == NODE_ENUM) {
870 _bt_list_splice_tail(&node->tmp_head, &parent->u._enum.enumerator_list);
875 case NODE_STRUCT_OR_VARIANT_DECLARATION:
876 switch (parent->type) {
878 _bt_list_splice_tail(&node->tmp_head, &parent->u._struct.declaration_list);
881 _bt_list_splice_tail(&node->tmp_head, &parent->u.variant.declaration_list);
890 printfn_fatal(node, "unknown node type '%d'", (int) parent->type);
897 void yyerror(struct ctf_scanner *scanner, const char *str)
899 printfl_error(yyget_lineno(scanner->scanner),
900 "token \"%s\": %s\n",
901 yyget_text(scanner->scanner), str);
910 #define reparent_error(scanner, str) \
912 yyerror(scanner, YY_("reparent_error: " str)); \
916 static void free_strings(struct bt_list_head *list)
918 struct gc_string *gstr, *tmp;
920 bt_list_for_each_entry_safe(gstr, tmp, list, gc)
924 static struct ctf_ast *ctf_ast_alloc(void)
928 ast = malloc(sizeof(*ast));
931 memset(ast, 0, sizeof(*ast));
932 BT_INIT_LIST_HEAD(&ast->allocated_nodes);
933 ast->root.type = NODE_ROOT;
934 BT_INIT_LIST_HEAD(&ast->root.tmp_head);
935 BT_INIT_LIST_HEAD(&ast->root.u.root.declaration_list);
936 BT_INIT_LIST_HEAD(&ast->root.u.root.trace);
937 BT_INIT_LIST_HEAD(&ast->root.u.root.env);
938 BT_INIT_LIST_HEAD(&ast->root.u.root.stream);
939 BT_INIT_LIST_HEAD(&ast->root.u.root.event);
940 BT_INIT_LIST_HEAD(&ast->root.u.root.clock);
941 BT_INIT_LIST_HEAD(&ast->root.u.root.callsite);
945 static void ctf_ast_free(struct ctf_ast *ast)
947 struct ctf_node *node, *tmp;
949 bt_list_for_each_entry_safe(node, tmp, &ast->allocated_nodes, gc)
954 int ctf_scanner_append_ast(struct ctf_scanner *scanner)
956 return yyparse(scanner);
959 struct ctf_scanner *ctf_scanner_alloc(FILE *input)
961 struct ctf_scanner *scanner;
964 yydebug = babeltrace_debug;
966 scanner = malloc(sizeof(*scanner));
969 memset(scanner, 0, sizeof(*scanner));
971 ret = yylex_init_extra(scanner, &scanner->scanner);
973 printf_fatal("yylex_init error");
974 goto cleanup_scanner;
976 /* Start processing new stream */
977 yyrestart(input, scanner->scanner);
979 scanner->ast = ctf_ast_alloc();
982 init_scope(&scanner->root_scope, NULL);
983 scanner->cs = &scanner->root_scope;
984 BT_INIT_LIST_HEAD(&scanner->allocated_strings);
987 fprintf(stdout, "Scanner input is a%s.\n",
988 isatty(fileno(input)) ? "n interactive tty" :
989 " noninteractive file");
994 ret = yylex_destroy(scanner->scanner);
996 printf_fatal("yylex_destroy error");
1002 void ctf_scanner_free(struct ctf_scanner *scanner)
1006 finalize_scope(&scanner->root_scope);
1007 free_strings(&scanner->allocated_strings);
1008 ctf_ast_free(scanner->ast);
1009 ret = yylex_destroy(scanner->scanner);
1011 printf_error("yylex_destroy error");
1020 %parse-param {struct ctf_scanner *scanner}
1021 %lex-param {struct ctf_scanner *scanner}
1023 * Expect two shift-reduce conflicts. Caused by enum name-opt : type {}
1024 * vs struct { int :value; } (unnamed bit-field). The default is to
1025 * shift, so whenever we encounter an enumeration, we are doing the
1026 * proper thing (shift). It is illegal to declare an enumeration
1027 * "bit-field", so it is OK if this situation ends up in a parsing
1032 %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
1033 %token <gs> IDENTIFIER ID_TYPE
1038 unsigned long long ull;
1040 struct gc_string *gs;
1044 %type <gs> STRING_LITERAL CHARACTER_LITERAL
1048 %type <ull> INTEGER_LITERAL
1049 %type <n> postfix_expression unary_expression unary_expression_or_range
1051 %type <n> declaration
1052 %type <n> event_declaration
1053 %type <n> stream_declaration
1054 %type <n> env_declaration
1055 %type <n> trace_declaration
1056 %type <n> clock_declaration
1057 %type <n> callsite_declaration
1058 %type <n> integer_declaration_specifiers
1059 %type <n> declaration_specifiers
1060 %type <n> alias_declaration_specifiers
1062 %type <n> type_declarator_list
1063 %type <n> integer_type_specifier
1064 %type <n> type_specifier
1065 %type <n> struct_type_specifier
1066 %type <n> variant_type_specifier
1067 %type <n> enum_type_specifier
1068 %type <n> struct_or_variant_declaration_list
1069 %type <n> struct_or_variant_declaration
1070 %type <n> struct_or_variant_declarator_list
1071 %type <n> struct_or_variant_declarator
1072 %type <n> enumerator_list
1073 %type <n> enumerator
1074 %type <n> abstract_declarator_list
1075 %type <n> abstract_declarator
1076 %type <n> direct_abstract_declarator
1077 %type <n> alias_abstract_declarator_list
1078 %type <n> alias_abstract_declarator
1079 %type <n> direct_alias_abstract_declarator
1080 %type <n> declarator
1081 %type <n> direct_declarator
1082 %type <n> type_declarator
1083 %type <n> direct_type_declarator
1085 %type <n> ctf_assignment_expression_list
1086 %type <n> ctf_assignment_expression
1093 if (set_parent_node($1, &ctf_scanner_get_ast(scanner)->root))
1094 reparent_error(scanner, "error reparenting to root");
1098 if (set_parent_node($2, &ctf_scanner_get_ast(scanner)->root))
1099 reparent_error(scanner, "error reparenting to root");
1161 /* 2: Phrase structure grammar */
1166 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1167 $$->u.unary_expression.type = UNARY_STRING;
1168 $$->u.unary_expression.u.string = yylval.gs->s;
1172 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1173 $$->u.unary_expression.type = UNARY_STRING;
1174 $$->u.unary_expression.u.string = yylval.gs->s;
1178 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1179 $$->u.unary_expression.type = UNARY_STRING;
1180 $$->u.unary_expression.u.string = yylval.gs->s;
1184 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1185 $$->u.unary_expression.type = UNARY_UNSIGNED_CONSTANT;
1186 $$->u.unary_expression.u.unsigned_constant = $1;
1190 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1191 $$->u.unary_expression.type = UNARY_STRING;
1192 $$->u.unary_expression.u.string = $1->s;
1196 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1197 $$->u.unary_expression.type = UNARY_STRING;
1198 $$->u.unary_expression.u.string = $1->s;
1200 | LPAREN unary_expression RPAREN
1204 | postfix_expression LSBRAC unary_expression RSBRAC
1206 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1207 $$->u.unary_expression.type = UNARY_SBRAC;
1208 $$->u.unary_expression.u.sbrac_exp = $3;
1209 bt_list_splice(&($1)->tmp_head, &($$)->tmp_head);
1210 bt_list_add_tail(&($$)->siblings, &($$)->tmp_head);
1212 | postfix_expression DOT IDENTIFIER
1214 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1215 $$->u.unary_expression.type = UNARY_STRING;
1216 $$->u.unary_expression.u.string = yylval.gs->s;
1217 $$->u.unary_expression.link = UNARY_DOTLINK;
1218 bt_list_splice(&($1)->tmp_head, &($$)->tmp_head);
1219 bt_list_add_tail(&($$)->siblings, &($$)->tmp_head);
1221 | postfix_expression DOT ID_TYPE
1223 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1224 $$->u.unary_expression.type = UNARY_STRING;
1225 $$->u.unary_expression.u.string = yylval.gs->s;
1226 $$->u.unary_expression.link = UNARY_DOTLINK;
1227 bt_list_splice(&($1)->tmp_head, &($$)->tmp_head);
1228 bt_list_add_tail(&($$)->siblings, &($$)->tmp_head);
1230 | postfix_expression RARROW IDENTIFIER
1232 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1233 $$->u.unary_expression.type = UNARY_STRING;
1234 $$->u.unary_expression.u.string = yylval.gs->s;
1235 $$->u.unary_expression.link = UNARY_ARROWLINK;
1236 bt_list_splice(&($1)->tmp_head, &($$)->tmp_head);
1237 bt_list_add_tail(&($$)->siblings, &($$)->tmp_head);
1239 | postfix_expression RARROW ID_TYPE
1241 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1242 $$->u.unary_expression.type = UNARY_STRING;
1243 $$->u.unary_expression.u.string = yylval.gs->s;
1244 $$->u.unary_expression.link = UNARY_ARROWLINK;
1245 bt_list_splice(&($1)->tmp_head, &($$)->tmp_head);
1246 bt_list_add_tail(&($$)->siblings, &($$)->tmp_head);
1253 | PLUS postfix_expression
1256 if ($$->u.unary_expression.type != UNARY_UNSIGNED_CONSTANT
1257 && $$->u.unary_expression.type != UNARY_SIGNED_CONSTANT) {
1258 reparent_error(scanner, "expecting numeric constant");
1261 | MINUS postfix_expression
1264 if ($$->u.unary_expression.type == UNARY_UNSIGNED_CONSTANT) {
1265 $$->u.unary_expression.type = UNARY_SIGNED_CONSTANT;
1266 $$->u.unary_expression.u.signed_constant =
1267 -($$->u.unary_expression.u.unsigned_constant);
1268 } else if ($$->u.unary_expression.type == UNARY_UNSIGNED_CONSTANT) {
1269 $$->u.unary_expression.u.signed_constant =
1270 -($$->u.unary_expression.u.signed_constant);
1272 reparent_error(scanner, "expecting numeric constant");
1277 unary_expression_or_range:
1278 unary_expression DOTDOTDOT unary_expression
1281 _bt_list_splice_tail(&($3)->tmp_head, &($$)->tmp_head);
1282 $3->u.unary_expression.link = UNARY_DOTDOTDOT;
1288 /* 2.2: Declarations */
1291 declaration_specifiers SEMICOLON
1295 | stream_declaration
1303 | callsite_declaration
1305 | declaration_specifiers TYPEDEF declaration_specifiers type_declarator_list SEMICOLON
1307 struct ctf_node *list;
1309 $$ = make_node(scanner, NODE_TYPEDEF);
1310 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1311 $$->u._typedef.type_specifier_list = list;
1312 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
1313 _bt_list_splice_tail(&($3)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
1314 _bt_list_splice_tail(&($4)->tmp_head, &($$)->u._typedef.type_declarators);
1316 | TYPEDEF declaration_specifiers type_declarator_list SEMICOLON
1318 struct ctf_node *list;
1320 $$ = make_node(scanner, NODE_TYPEDEF);
1321 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1322 $$->u._typedef.type_specifier_list = list;
1323 _bt_list_splice_tail(&($2)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
1324 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._typedef.type_declarators);
1326 | declaration_specifiers TYPEDEF type_declarator_list SEMICOLON
1328 struct ctf_node *list;
1330 $$ = make_node(scanner, NODE_TYPEDEF);
1331 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1332 $$->u._typedef.type_specifier_list = list;
1333 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
1334 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._typedef.type_declarators);
1336 | TYPEALIAS declaration_specifiers abstract_declarator_list TYPEASSIGN alias_declaration_specifiers alias_abstract_declarator_list SEMICOLON
1338 struct ctf_node *list;
1340 $$ = make_node(scanner, NODE_TYPEALIAS);
1341 $$->u.typealias.target = make_node(scanner, NODE_TYPEALIAS_TARGET);
1342 $$->u.typealias.alias = make_node(scanner, NODE_TYPEALIAS_ALIAS);
1344 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1345 $$->u.typealias.target->u.typealias_target.type_specifier_list = list;
1346 _bt_list_splice_tail(&($2)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
1347 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.typealias.target->u.typealias_target.type_declarators);
1349 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1350 $$->u.typealias.alias->u.typealias_alias.type_specifier_list = list;
1351 _bt_list_splice_tail(&($5)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
1352 _bt_list_splice_tail(&($6)->tmp_head, &($$)->u.typealias.alias->u.typealias_alias.type_declarators);
1357 event_declaration_begin event_declaration_end
1359 $$ = make_node(scanner, NODE_EVENT);
1361 | event_declaration_begin ctf_assignment_expression_list event_declaration_end
1363 $$ = make_node(scanner, NODE_EVENT);
1364 if (set_parent_node($2, $$))
1365 reparent_error(scanner, "event_declaration");
1369 event_declaration_begin:
1371 { push_scope(scanner); }
1374 event_declaration_end:
1376 { pop_scope(scanner); }
1381 stream_declaration_begin stream_declaration_end
1383 $$ = make_node(scanner, NODE_STREAM);
1385 | stream_declaration_begin ctf_assignment_expression_list stream_declaration_end
1387 $$ = make_node(scanner, NODE_STREAM);
1388 if (set_parent_node($2, $$))
1389 reparent_error(scanner, "stream_declaration");
1393 stream_declaration_begin:
1395 { push_scope(scanner); }
1398 stream_declaration_end:
1400 { pop_scope(scanner); }
1404 env_declaration_begin env_declaration_end
1406 $$ = make_node(scanner, NODE_ENV);
1408 | env_declaration_begin ctf_assignment_expression_list env_declaration_end
1410 $$ = make_node(scanner, NODE_ENV);
1411 if (set_parent_node($2, $$))
1412 reparent_error(scanner, "env declaration");
1416 env_declaration_begin:
1418 { push_scope(scanner); }
1421 env_declaration_end:
1423 { pop_scope(scanner); }
1427 trace_declaration_begin trace_declaration_end
1429 $$ = make_node(scanner, NODE_TRACE);
1431 | trace_declaration_begin ctf_assignment_expression_list trace_declaration_end
1433 $$ = make_node(scanner, NODE_TRACE);
1434 if (set_parent_node($2, $$))
1435 reparent_error(scanner, "trace_declaration");
1439 trace_declaration_begin:
1441 { push_scope(scanner); }
1444 trace_declaration_end:
1446 { pop_scope(scanner); }
1450 CLOCK clock_declaration_begin clock_declaration_end
1452 $$ = make_node(scanner, NODE_CLOCK);
1454 | CLOCK clock_declaration_begin ctf_assignment_expression_list clock_declaration_end
1456 $$ = make_node(scanner, NODE_CLOCK);
1457 if (set_parent_node($3, $$))
1458 reparent_error(scanner, "trace_declaration");
1462 clock_declaration_begin:
1464 { push_scope(scanner); }
1467 clock_declaration_end:
1469 { pop_scope(scanner); }
1472 callsite_declaration:
1473 CALLSITE callsite_declaration_begin callsite_declaration_end
1475 $$ = make_node(scanner, NODE_CALLSITE);
1477 | CALLSITE callsite_declaration_begin ctf_assignment_expression_list callsite_declaration_end
1479 $$ = make_node(scanner, NODE_CALLSITE);
1480 if (set_parent_node($3, $$))
1481 reparent_error(scanner, "trace_declaration");
1485 callsite_declaration_begin:
1487 { push_scope(scanner); }
1490 callsite_declaration_end:
1492 { pop_scope(scanner); }
1495 integer_declaration_specifiers:
1498 struct ctf_node *node;
1500 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1501 node = make_node(scanner, NODE_TYPE_SPECIFIER);
1502 node->u.type_specifier.type = TYPESPEC_CONST;
1503 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
1505 | integer_type_specifier
1507 struct ctf_node *node;
1509 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1511 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
1513 | integer_declaration_specifiers CONST
1515 struct ctf_node *node;
1518 node = make_node(scanner, NODE_TYPE_SPECIFIER);
1519 node->u.type_specifier.type = TYPESPEC_CONST;
1520 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
1522 | integer_declaration_specifiers integer_type_specifier
1525 bt_list_add_tail(&($2)->siblings, &($$)->u.type_specifier_list.head);
1529 declaration_specifiers:
1532 struct ctf_node *node;
1534 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1535 node = make_node(scanner, NODE_TYPE_SPECIFIER);
1536 node->u.type_specifier.type = TYPESPEC_CONST;
1537 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
1541 struct ctf_node *node;
1543 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1545 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
1547 | declaration_specifiers CONST
1549 struct ctf_node *node;
1552 node = make_node(scanner, NODE_TYPE_SPECIFIER);
1553 node->u.type_specifier.type = TYPESPEC_CONST;
1554 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
1556 | declaration_specifiers type_specifier
1559 bt_list_add_tail(&($2)->siblings, &($$)->u.type_specifier_list.head);
1563 type_declarator_list:
1566 | type_declarator_list COMMA type_declarator
1569 bt_list_add_tail(&($3)->siblings, &($$)->tmp_head);
1573 integer_type_specifier:
1576 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1577 $$->u.type_specifier.type = TYPESPEC_CHAR;
1581 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1582 $$->u.type_specifier.type = TYPESPEC_SHORT;
1586 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1587 $$->u.type_specifier.type = TYPESPEC_INT;
1591 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1592 $$->u.type_specifier.type = TYPESPEC_LONG;
1596 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1597 $$->u.type_specifier.type = TYPESPEC_SIGNED;
1601 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1602 $$->u.type_specifier.type = TYPESPEC_UNSIGNED;
1606 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1607 $$->u.type_specifier.type = TYPESPEC_BOOL;
1611 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1612 $$->u.type_specifier.type = TYPESPEC_ID_TYPE;
1613 $$->u.type_specifier.id_type = yylval.gs->s;
1615 | INTEGER LBRAC RBRAC
1617 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1618 $$->u.type_specifier.type = TYPESPEC_INTEGER;
1619 $$->u.type_specifier.node = make_node(scanner, NODE_INTEGER);
1621 | INTEGER LBRAC ctf_assignment_expression_list RBRAC
1623 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1624 $$->u.type_specifier.type = TYPESPEC_INTEGER;
1625 $$->u.type_specifier.node = make_node(scanner, NODE_INTEGER);
1626 if (set_parent_node($3, $$->u.type_specifier.node))
1627 reparent_error(scanner, "integer reparent error");
1634 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1635 $$->u.type_specifier.type = TYPESPEC_VOID;
1639 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1640 $$->u.type_specifier.type = TYPESPEC_CHAR;
1644 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1645 $$->u.type_specifier.type = TYPESPEC_SHORT;
1649 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1650 $$->u.type_specifier.type = TYPESPEC_INT;
1654 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1655 $$->u.type_specifier.type = TYPESPEC_LONG;
1659 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1660 $$->u.type_specifier.type = TYPESPEC_FLOAT;
1664 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1665 $$->u.type_specifier.type = TYPESPEC_DOUBLE;
1669 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1670 $$->u.type_specifier.type = TYPESPEC_SIGNED;
1674 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1675 $$->u.type_specifier.type = TYPESPEC_UNSIGNED;
1679 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1680 $$->u.type_specifier.type = TYPESPEC_BOOL;
1684 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1685 $$->u.type_specifier.type = TYPESPEC_COMPLEX;
1689 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1690 $$->u.type_specifier.type = TYPESPEC_IMAGINARY;
1694 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1695 $$->u.type_specifier.type = TYPESPEC_ID_TYPE;
1696 $$->u.type_specifier.id_type = yylval.gs->s;
1698 | FLOATING_POINT LBRAC RBRAC
1700 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1701 $$->u.type_specifier.type = TYPESPEC_FLOATING_POINT;
1702 $$->u.type_specifier.node = make_node(scanner, NODE_FLOATING_POINT);
1704 | FLOATING_POINT LBRAC ctf_assignment_expression_list RBRAC
1706 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1707 $$->u.type_specifier.type = TYPESPEC_FLOATING_POINT;
1708 $$->u.type_specifier.node = make_node(scanner, NODE_FLOATING_POINT);
1709 if (set_parent_node($3, $$->u.type_specifier.node))
1710 reparent_error(scanner, "floating point reparent error");
1712 | INTEGER LBRAC RBRAC
1714 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1715 $$->u.type_specifier.type = TYPESPEC_INTEGER;
1716 $$->u.type_specifier.node = make_node(scanner, NODE_INTEGER);
1718 | INTEGER LBRAC ctf_assignment_expression_list RBRAC
1720 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1721 $$->u.type_specifier.type = TYPESPEC_INTEGER;
1722 $$->u.type_specifier.node = make_node(scanner, NODE_INTEGER);
1723 if (set_parent_node($3, $$->u.type_specifier.node))
1724 reparent_error(scanner, "integer reparent error");
1728 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1729 $$->u.type_specifier.type = TYPESPEC_STRING;
1730 $$->u.type_specifier.node = make_node(scanner, NODE_STRING);
1732 | STRING LBRAC RBRAC
1734 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1735 $$->u.type_specifier.type = TYPESPEC_STRING;
1736 $$->u.type_specifier.node = make_node(scanner, NODE_STRING);
1738 | STRING LBRAC ctf_assignment_expression_list RBRAC
1740 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1741 $$->u.type_specifier.type = TYPESPEC_STRING;
1742 $$->u.type_specifier.node = make_node(scanner, NODE_STRING);
1743 if (set_parent_node($3, $$->u.type_specifier.node))
1744 reparent_error(scanner, "string reparent error");
1746 | ENUM enum_type_specifier
1748 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1749 $$->u.type_specifier.type = TYPESPEC_ENUM;
1750 $$->u.type_specifier.node = $2;
1752 | VARIANT variant_type_specifier
1754 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1755 $$->u.type_specifier.type = TYPESPEC_VARIANT;
1756 $$->u.type_specifier.node = $2;
1758 | STRUCT struct_type_specifier
1760 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1761 $$->u.type_specifier.type = TYPESPEC_STRUCT;
1762 $$->u.type_specifier.node = $2;
1766 struct_type_specifier:
1767 struct_declaration_begin struct_or_variant_declaration_list struct_declaration_end
1769 $$ = make_node(scanner, NODE_STRUCT);
1770 $$->u._struct.has_body = 1;
1771 if ($2 && set_parent_node($2, $$))
1772 reparent_error(scanner, "struct reparent error");
1774 | IDENTIFIER struct_declaration_begin struct_or_variant_declaration_list struct_declaration_end
1776 $$ = make_node(scanner, NODE_STRUCT);
1777 $$->u._struct.has_body = 1;
1778 $$->u._struct.name = $1->s;
1779 if ($3 && set_parent_node($3, $$))
1780 reparent_error(scanner, "struct reparent error");
1782 | ID_TYPE struct_declaration_begin struct_or_variant_declaration_list struct_declaration_end
1784 $$ = make_node(scanner, NODE_STRUCT);
1785 $$->u._struct.has_body = 1;
1786 $$->u._struct.name = $1->s;
1787 if ($3 && set_parent_node($3, $$))
1788 reparent_error(scanner, "struct reparent error");
1792 $$ = make_node(scanner, NODE_STRUCT);
1793 $$->u._struct.has_body = 0;
1794 $$->u._struct.name = $1->s;
1798 $$ = make_node(scanner, NODE_STRUCT);
1799 $$->u._struct.has_body = 0;
1800 $$->u._struct.name = $1->s;
1802 | struct_declaration_begin struct_or_variant_declaration_list struct_declaration_end TOK_ALIGN LPAREN unary_expression RPAREN
1804 $$ = make_node(scanner, NODE_STRUCT);
1805 $$->u._struct.has_body = 1;
1806 bt_list_add_tail(&($6)->siblings, &$$->u._struct.min_align);
1807 if ($2 && set_parent_node($2, $$))
1808 reparent_error(scanner, "struct reparent error");
1810 | IDENTIFIER struct_declaration_begin struct_or_variant_declaration_list struct_declaration_end TOK_ALIGN LPAREN unary_expression RPAREN
1812 $$ = make_node(scanner, NODE_STRUCT);
1813 $$->u._struct.has_body = 1;
1814 $$->u._struct.name = $1->s;
1815 bt_list_add_tail(&($7)->siblings, &$$->u._struct.min_align);
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 TOK_ALIGN LPAREN unary_expression RPAREN
1821 $$ = make_node(scanner, NODE_STRUCT);
1822 $$->u._struct.has_body = 1;
1823 $$->u._struct.name = $1->s;
1824 bt_list_add_tail(&($7)->siblings, &$$->u._struct.min_align);
1825 if ($3 && set_parent_node($3, $$))
1826 reparent_error(scanner, "struct reparent error");
1830 struct_declaration_begin:
1832 { push_scope(scanner); }
1835 struct_declaration_end:
1837 { pop_scope(scanner); }
1840 variant_type_specifier:
1841 variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1843 $$ = make_node(scanner, NODE_VARIANT);
1844 $$->u.variant.has_body = 1;
1845 if ($2 && set_parent_node($2, $$))
1846 reparent_error(scanner, "variant reparent error");
1848 | LT IDENTIFIER GT variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1850 $$ = make_node(scanner, NODE_VARIANT);
1851 $$->u.variant.has_body = 1;
1852 $$->u.variant.choice = $2->s;
1853 if ($5 && set_parent_node($5, $$))
1854 reparent_error(scanner, "variant reparent error");
1856 | 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.choice = $2->s;
1861 if ($5 && set_parent_node($5, $$))
1862 reparent_error(scanner, "variant reparent error");
1864 | IDENTIFIER variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1866 $$ = make_node(scanner, NODE_VARIANT);
1867 $$->u.variant.has_body = 1;
1868 $$->u.variant.name = $1->s;
1869 if ($3 && set_parent_node($3, $$))
1870 reparent_error(scanner, "variant reparent error");
1872 | IDENTIFIER LT IDENTIFIER GT variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1874 $$ = make_node(scanner, NODE_VARIANT);
1875 $$->u.variant.has_body = 1;
1876 $$->u.variant.name = $1->s;
1877 $$->u.variant.choice = $3->s;
1878 if ($6 && set_parent_node($6, $$))
1879 reparent_error(scanner, "variant reparent error");
1881 | IDENTIFIER LT IDENTIFIER GT
1883 $$ = make_node(scanner, NODE_VARIANT);
1884 $$->u.variant.has_body = 0;
1885 $$->u.variant.name = $1->s;
1886 $$->u.variant.choice = $3->s;
1888 | IDENTIFIER LT ID_TYPE GT variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1890 $$ = make_node(scanner, NODE_VARIANT);
1891 $$->u.variant.has_body = 1;
1892 $$->u.variant.name = $1->s;
1893 $$->u.variant.choice = $3->s;
1894 if ($6 && set_parent_node($6, $$))
1895 reparent_error(scanner, "variant reparent error");
1897 | IDENTIFIER LT ID_TYPE GT
1899 $$ = make_node(scanner, NODE_VARIANT);
1900 $$->u.variant.has_body = 0;
1901 $$->u.variant.name = $1->s;
1902 $$->u.variant.choice = $3->s;
1904 | ID_TYPE variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1906 $$ = make_node(scanner, NODE_VARIANT);
1907 $$->u.variant.has_body = 1;
1908 $$->u.variant.name = $1->s;
1909 if ($3 && set_parent_node($3, $$))
1910 reparent_error(scanner, "variant reparent error");
1912 | ID_TYPE LT IDENTIFIER GT variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1914 $$ = make_node(scanner, NODE_VARIANT);
1915 $$->u.variant.has_body = 1;
1916 $$->u.variant.name = $1->s;
1917 $$->u.variant.choice = $3->s;
1918 if ($6 && set_parent_node($6, $$))
1919 reparent_error(scanner, "variant reparent error");
1921 | ID_TYPE LT IDENTIFIER GT
1923 $$ = make_node(scanner, NODE_VARIANT);
1924 $$->u.variant.has_body = 0;
1925 $$->u.variant.name = $1->s;
1926 $$->u.variant.choice = $3->s;
1928 | ID_TYPE LT ID_TYPE GT variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1930 $$ = make_node(scanner, NODE_VARIANT);
1931 $$->u.variant.has_body = 1;
1932 $$->u.variant.name = $1->s;
1933 $$->u.variant.choice = $3->s;
1934 if ($6 && set_parent_node($6, $$))
1935 reparent_error(scanner, "variant reparent error");
1937 | ID_TYPE LT ID_TYPE GT
1939 $$ = make_node(scanner, NODE_VARIANT);
1940 $$->u.variant.has_body = 0;
1941 $$->u.variant.name = $1->s;
1942 $$->u.variant.choice = $3->s;
1946 variant_declaration_begin:
1948 { push_scope(scanner); }
1951 variant_declaration_end:
1953 { pop_scope(scanner); }
1956 enum_type_specifier:
1957 LBRAC enumerator_list RBRAC
1959 $$ = make_node(scanner, NODE_ENUM);
1960 $$->u._enum.has_body = 1;
1961 _bt_list_splice_tail(&($2)->tmp_head, &($$)->u._enum.enumerator_list);
1963 | COLON integer_declaration_specifiers LBRAC enumerator_list RBRAC
1965 $$ = make_node(scanner, NODE_ENUM);
1966 $$->u._enum.has_body = 1;
1967 ($$)->u._enum.container_type = $2;
1968 _bt_list_splice_tail(&($4)->tmp_head, &($$)->u._enum.enumerator_list);
1970 | IDENTIFIER LBRAC enumerator_list RBRAC
1972 $$ = make_node(scanner, NODE_ENUM);
1973 $$->u._enum.has_body = 1;
1974 $$->u._enum.enum_id = $1->s;
1975 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._enum.enumerator_list);
1977 | IDENTIFIER COLON integer_declaration_specifiers LBRAC enumerator_list RBRAC
1979 $$ = make_node(scanner, NODE_ENUM);
1980 $$->u._enum.has_body = 1;
1981 $$->u._enum.enum_id = $1->s;
1982 ($$)->u._enum.container_type = $3;
1983 _bt_list_splice_tail(&($5)->tmp_head, &($$)->u._enum.enumerator_list);
1985 | ID_TYPE LBRAC enumerator_list RBRAC
1987 $$ = make_node(scanner, NODE_ENUM);
1988 $$->u._enum.has_body = 1;
1989 $$->u._enum.enum_id = $1->s;
1990 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._enum.enumerator_list);
1992 | ID_TYPE COLON integer_declaration_specifiers LBRAC enumerator_list RBRAC
1994 $$ = make_node(scanner, NODE_ENUM);
1995 $$->u._enum.has_body = 1;
1996 $$->u._enum.enum_id = $1->s;
1997 ($$)->u._enum.container_type = $3;
1998 _bt_list_splice_tail(&($5)->tmp_head, &($$)->u._enum.enumerator_list);
2000 | LBRAC enumerator_list COMMA RBRAC
2002 $$ = make_node(scanner, NODE_ENUM);
2003 $$->u._enum.has_body = 1;
2004 _bt_list_splice_tail(&($2)->tmp_head, &($$)->u._enum.enumerator_list);
2006 | COLON integer_declaration_specifiers LBRAC enumerator_list COMMA RBRAC
2008 $$ = make_node(scanner, NODE_ENUM);
2009 $$->u._enum.has_body = 1;
2010 ($$)->u._enum.container_type = $2;
2011 _bt_list_splice_tail(&($4)->tmp_head, &($$)->u._enum.enumerator_list);
2013 | IDENTIFIER LBRAC enumerator_list COMMA RBRAC
2015 $$ = make_node(scanner, NODE_ENUM);
2016 $$->u._enum.has_body = 1;
2017 $$->u._enum.enum_id = $1->s;
2018 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._enum.enumerator_list);
2020 | IDENTIFIER COLON integer_declaration_specifiers LBRAC enumerator_list COMMA RBRAC
2022 $$ = make_node(scanner, NODE_ENUM);
2023 $$->u._enum.has_body = 1;
2024 $$->u._enum.enum_id = $1->s;
2025 ($$)->u._enum.container_type = $3;
2026 _bt_list_splice_tail(&($5)->tmp_head, &($$)->u._enum.enumerator_list);
2030 $$ = make_node(scanner, NODE_ENUM);
2031 $$->u._enum.has_body = 0;
2032 $$->u._enum.enum_id = $1->s;
2034 | ID_TYPE LBRAC enumerator_list COMMA RBRAC
2036 $$ = make_node(scanner, NODE_ENUM);
2037 $$->u._enum.has_body = 1;
2038 $$->u._enum.enum_id = $1->s;
2039 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._enum.enumerator_list);
2041 | ID_TYPE COLON integer_declaration_specifiers LBRAC enumerator_list COMMA RBRAC
2043 $$ = make_node(scanner, NODE_ENUM);
2044 $$->u._enum.has_body = 1;
2045 $$->u._enum.enum_id = $1->s;
2046 ($$)->u._enum.container_type = $3;
2047 _bt_list_splice_tail(&($5)->tmp_head, &($$)->u._enum.enumerator_list);
2051 $$ = make_node(scanner, NODE_ENUM);
2052 $$->u._enum.has_body = 0;
2053 $$->u._enum.enum_id = $1->s;
2057 struct_or_variant_declaration_list:
2060 | struct_or_variant_declaration_list struct_or_variant_declaration
2064 bt_list_add_tail(&($2)->siblings, &($$)->tmp_head);
2067 bt_list_add_tail(&($$)->siblings, &($$)->tmp_head);
2072 struct_or_variant_declaration:
2073 declaration_specifiers struct_or_variant_declarator_list SEMICOLON
2075 struct ctf_node *list;
2077 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2078 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2079 $$ = make_node(scanner, NODE_STRUCT_OR_VARIANT_DECLARATION);
2080 ($$)->u.struct_or_variant_declaration.type_specifier_list = list;
2081 _bt_list_splice_tail(&($2)->tmp_head, &($$)->u.struct_or_variant_declaration.type_declarators);
2083 | declaration_specifiers TYPEDEF declaration_specifiers type_declarator_list SEMICOLON
2085 struct ctf_node *list;
2087 $$ = make_node(scanner, NODE_TYPEDEF);
2088 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2089 $$->u._typedef.type_specifier_list = list;
2090 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2091 _bt_list_splice_tail(&($3)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2092 _bt_list_splice_tail(&($4)->tmp_head, &($$)->u._typedef.type_declarators);
2094 | TYPEDEF declaration_specifiers type_declarator_list SEMICOLON
2096 struct ctf_node *list;
2098 $$ = make_node(scanner, NODE_TYPEDEF);
2099 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2100 $$->u._typedef.type_specifier_list = list;
2101 _bt_list_splice_tail(&($2)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2102 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._typedef.type_declarators);
2104 | declaration_specifiers TYPEDEF type_declarator_list SEMICOLON
2106 struct ctf_node *list;
2108 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2109 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2110 $$ = make_node(scanner, NODE_TYPEDEF);
2111 ($$)->u.struct_or_variant_declaration.type_specifier_list = list;
2112 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._typedef.type_declarators);
2114 | TYPEALIAS declaration_specifiers abstract_declarator_list TYPEASSIGN alias_declaration_specifiers alias_abstract_declarator_list SEMICOLON
2116 struct ctf_node *list;
2118 $$ = make_node(scanner, NODE_TYPEALIAS);
2119 $$->u.typealias.target = make_node(scanner, NODE_TYPEALIAS_TARGET);
2120 $$->u.typealias.alias = make_node(scanner, NODE_TYPEALIAS_ALIAS);
2122 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2123 $$->u.typealias.target->u.typealias_target.type_specifier_list = list;
2124 _bt_list_splice_tail(&($2)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2125 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.typealias.target->u.typealias_target.type_declarators);
2127 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2128 $$->u.typealias.alias->u.typealias_alias.type_specifier_list = list;
2129 _bt_list_splice_tail(&($5)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2130 _bt_list_splice_tail(&($6)->tmp_head, &($$)->u.typealias.alias->u.typealias_alias.type_declarators);
2134 alias_declaration_specifiers:
2137 struct ctf_node *node;
2139 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2140 node = make_node(scanner, NODE_TYPE_SPECIFIER);
2141 node->u.type_specifier.type = TYPESPEC_CONST;
2142 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
2146 struct ctf_node *node;
2148 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2150 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
2154 struct ctf_node *node;
2156 add_type(scanner, $1);
2157 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2158 node = make_node(scanner, NODE_TYPE_SPECIFIER);
2159 node->u.type_specifier.type = TYPESPEC_ID_TYPE;
2160 node->u.type_specifier.id_type = yylval.gs->s;
2161 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
2163 | alias_declaration_specifiers CONST
2165 struct ctf_node *node;
2168 node = make_node(scanner, NODE_TYPE_SPECIFIER);
2169 node->u.type_specifier.type = TYPESPEC_CONST;
2170 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
2172 | alias_declaration_specifiers type_specifier
2175 bt_list_add_tail(&($2)->siblings, &($$)->u.type_specifier_list.head);
2177 | alias_declaration_specifiers IDENTIFIER
2179 struct ctf_node *node;
2181 add_type(scanner, $2);
2183 node = make_node(scanner, NODE_TYPE_SPECIFIER);
2184 node->u.type_specifier.type = TYPESPEC_ID_TYPE;
2185 node->u.type_specifier.id_type = yylval.gs->s;
2186 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
2190 struct_or_variant_declarator_list:
2191 struct_or_variant_declarator
2193 | struct_or_variant_declarator_list COMMA struct_or_variant_declarator
2196 bt_list_add_tail(&($3)->siblings, &($$)->tmp_head);
2200 struct_or_variant_declarator:
2203 | COLON unary_expression
2205 | declarator COLON unary_expression
2208 if (set_parent_node($3, $1))
2209 reparent_error(scanner, "struct_or_variant_declarator");
2216 | enumerator_list COMMA enumerator
2219 bt_list_add_tail(&($3)->siblings, &($$)->tmp_head);
2226 $$ = make_node(scanner, NODE_ENUMERATOR);
2227 $$->u.enumerator.id = $1->s;
2231 $$ = make_node(scanner, NODE_ENUMERATOR);
2232 $$->u.enumerator.id = $1->s;
2236 $$ = make_node(scanner, NODE_ENUMERATOR);
2237 $$->u.enumerator.id = $1->s;
2241 $$ = make_node(scanner, NODE_ENUMERATOR);
2242 $$->u.enumerator.id = $1->s;
2244 | IDENTIFIER EQUAL unary_expression_or_range
2246 $$ = make_node(scanner, NODE_ENUMERATOR);
2247 $$->u.enumerator.id = $1->s;
2248 bt_list_splice(&($3)->tmp_head, &($$)->u.enumerator.values);
2250 | ID_TYPE EQUAL unary_expression_or_range
2252 $$ = make_node(scanner, NODE_ENUMERATOR);
2253 $$->u.enumerator.id = $1->s;
2254 bt_list_splice(&($3)->tmp_head, &($$)->u.enumerator.values);
2256 | keywords EQUAL unary_expression_or_range
2258 $$ = make_node(scanner, NODE_ENUMERATOR);
2259 $$->u.enumerator.id = $1->s;
2260 bt_list_splice(&($3)->tmp_head, &($$)->u.enumerator.values);
2262 | STRING_LITERAL EQUAL unary_expression_or_range
2264 $$ = make_node(scanner, NODE_ENUMERATOR);
2265 $$->u.enumerator.id = $1->s;
2266 bt_list_splice(&($3)->tmp_head, &($$)->u.enumerator.values);
2270 abstract_declarator_list:
2273 | abstract_declarator_list COMMA abstract_declarator
2276 bt_list_add_tail(&($3)->siblings, &($$)->tmp_head);
2280 abstract_declarator:
2281 direct_abstract_declarator
2283 | pointer direct_abstract_declarator
2286 bt_list_splice(&($1)->tmp_head, &($$)->u.type_declarator.pointers);
2290 direct_abstract_declarator:
2293 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2294 $$->u.type_declarator.type = TYPEDEC_ID;
2299 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2300 $$->u.type_declarator.type = TYPEDEC_ID;
2301 $$->u.type_declarator.u.id = $1->s;
2303 | LPAREN abstract_declarator RPAREN
2305 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2306 $$->u.type_declarator.type = TYPEDEC_NESTED;
2307 $$->u.type_declarator.u.nested.type_declarator = $2;
2309 | direct_abstract_declarator LSBRAC unary_expression RSBRAC
2311 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2312 $$->u.type_declarator.type = TYPEDEC_NESTED;
2313 $$->u.type_declarator.u.nested.type_declarator = $1;
2314 BT_INIT_LIST_HEAD(&($$)->u.type_declarator.u.nested.length);
2315 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.type_declarator.u.nested.length);
2317 | direct_abstract_declarator LSBRAC RSBRAC
2319 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2320 $$->u.type_declarator.type = TYPEDEC_NESTED;
2321 $$->u.type_declarator.u.nested.type_declarator = $1;
2322 $$->u.type_declarator.u.nested.abstract_array = 1;
2326 alias_abstract_declarator_list:
2327 alias_abstract_declarator
2329 | alias_abstract_declarator_list COMMA alias_abstract_declarator
2332 bt_list_add_tail(&($3)->siblings, &($$)->tmp_head);
2336 alias_abstract_declarator:
2337 direct_alias_abstract_declarator
2339 | pointer direct_alias_abstract_declarator
2342 bt_list_splice(&($1)->tmp_head, &($$)->u.type_declarator.pointers);
2346 direct_alias_abstract_declarator:
2349 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2350 $$->u.type_declarator.type = TYPEDEC_ID;
2353 | LPAREN alias_abstract_declarator RPAREN
2355 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2356 $$->u.type_declarator.type = TYPEDEC_NESTED;
2357 $$->u.type_declarator.u.nested.type_declarator = $2;
2359 | direct_alias_abstract_declarator LSBRAC unary_expression RSBRAC
2361 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2362 $$->u.type_declarator.type = TYPEDEC_NESTED;
2363 $$->u.type_declarator.u.nested.type_declarator = $1;
2364 BT_INIT_LIST_HEAD(&($$)->u.type_declarator.u.nested.length);
2365 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.type_declarator.u.nested.length);
2367 | direct_alias_abstract_declarator LSBRAC RSBRAC
2369 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2370 $$->u.type_declarator.type = TYPEDEC_NESTED;
2371 $$->u.type_declarator.u.nested.type_declarator = $1;
2372 $$->u.type_declarator.u.nested.abstract_array = 1;
2379 | pointer direct_declarator
2382 bt_list_splice(&($1)->tmp_head, &($$)->u.type_declarator.pointers);
2389 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2390 $$->u.type_declarator.type = TYPEDEC_ID;
2391 $$->u.type_declarator.u.id = $1->s;
2393 | LPAREN declarator RPAREN
2395 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2396 $$->u.type_declarator.type = TYPEDEC_NESTED;
2397 $$->u.type_declarator.u.nested.type_declarator = $2;
2399 | direct_declarator LSBRAC unary_expression RSBRAC
2401 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2402 $$->u.type_declarator.type = TYPEDEC_NESTED;
2403 $$->u.type_declarator.u.nested.type_declarator = $1;
2404 BT_INIT_LIST_HEAD(&($$)->u.type_declarator.u.nested.length);
2405 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.type_declarator.u.nested.length);
2410 direct_type_declarator
2412 | pointer direct_type_declarator
2415 bt_list_splice(&($1)->tmp_head, &($$)->u.type_declarator.pointers);
2419 direct_type_declarator:
2422 add_type(scanner, $1);
2423 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2424 $$->u.type_declarator.type = TYPEDEC_ID;
2425 $$->u.type_declarator.u.id = $1->s;
2427 | LPAREN type_declarator RPAREN
2429 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2430 $$->u.type_declarator.type = TYPEDEC_NESTED;
2431 $$->u.type_declarator.u.nested.type_declarator = $2;
2433 | direct_type_declarator LSBRAC unary_expression RSBRAC
2435 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2436 $$->u.type_declarator.type = TYPEDEC_NESTED;
2437 $$->u.type_declarator.u.nested.type_declarator = $1;
2438 BT_INIT_LIST_HEAD(&($$)->u.type_declarator.u.nested.length);
2439 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.type_declarator.u.nested.length);
2446 $$ = make_node(scanner, NODE_POINTER);
2450 $$ = make_node(scanner, NODE_POINTER);
2451 bt_list_splice(&($2)->tmp_head, &($$)->tmp_head);
2453 | STAR type_qualifier_list pointer
2455 $$ = make_node(scanner, NODE_POINTER);
2456 $$->u.pointer.const_qualifier = 1;
2457 bt_list_splice(&($3)->tmp_head, &($$)->tmp_head);
2461 type_qualifier_list:
2462 /* pointer assumes only const type qualifier */
2464 | type_qualifier_list CONST
2467 /* 2.3: CTF-specific declarations */
2469 ctf_assignment_expression_list:
2470 ctf_assignment_expression SEMICOLON
2472 | ctf_assignment_expression_list ctf_assignment_expression SEMICOLON
2475 bt_list_add_tail(&($2)->siblings, &($$)->tmp_head);
2479 ctf_assignment_expression:
2480 unary_expression EQUAL unary_expression
2483 * Because we have left and right, cannot use
2486 $$ = make_node(scanner, NODE_CTF_EXPRESSION);
2487 _bt_list_splice_tail(&($1)->tmp_head, &($$)->u.ctf_expression.left);
2488 if ($1->u.unary_expression.type != UNARY_STRING)
2489 reparent_error(scanner, "ctf_assignment_expression left expects string");
2490 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.ctf_expression.right);
2492 | unary_expression TYPEASSIGN declaration_specifiers /* Only allow struct */
2495 * Because we have left and right, cannot use
2498 $$ = make_node(scanner, NODE_CTF_EXPRESSION);
2499 _bt_list_splice_tail(&($1)->tmp_head, &($$)->u.ctf_expression.left);
2500 if ($1->u.unary_expression.type != UNARY_STRING)
2501 reparent_error(scanner, "ctf_assignment_expression left expects string");
2502 bt_list_add_tail(&($3)->siblings, &($$)->u.ctf_expression.right);
2504 | declaration_specifiers TYPEDEF declaration_specifiers 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 _bt_list_splice_tail(&($3)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2511 $$ = make_node(scanner, NODE_TYPEDEF);
2512 ($$)->u.struct_or_variant_declaration.type_specifier_list = list;
2513 _bt_list_splice_tail(&($4)->tmp_head, &($$)->u._typedef.type_declarators);
2515 | TYPEDEF declaration_specifiers type_declarator_list
2517 struct ctf_node *list;
2519 $$ = make_node(scanner, NODE_TYPEDEF);
2520 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2521 $$->u._typedef.type_specifier_list = list;
2522 _bt_list_splice_tail(&($2)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2523 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._typedef.type_declarators);
2525 | declaration_specifiers TYPEDEF type_declarator_list
2527 struct ctf_node *list;
2529 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2530 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2531 $$ = make_node(scanner, NODE_TYPEDEF);
2532 ($$)->u.struct_or_variant_declaration.type_specifier_list = list;
2533 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._typedef.type_declarators);
2535 | TYPEALIAS declaration_specifiers abstract_declarator_list TYPEASSIGN alias_declaration_specifiers alias_abstract_declarator_list
2537 struct ctf_node *list;
2539 $$ = make_node(scanner, NODE_TYPEALIAS);
2540 $$->u.typealias.target = make_node(scanner, NODE_TYPEALIAS_TARGET);
2541 $$->u.typealias.alias = make_node(scanner, NODE_TYPEALIAS_ALIAS);
2543 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2544 $$->u.typealias.target->u.typealias_target.type_specifier_list = list;
2545 _bt_list_splice_tail(&($2)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2546 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.typealias.target->u.typealias_target.type_declarators);
2548 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2549 $$->u.typealias.alias->u.typealias_alias.type_specifier_list = list;
2550 _bt_list_splice_tail(&($5)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2551 _bt_list_splice_tail(&($6)->tmp_head, &($$)->u.typealias.alias->u.typealias_alias.type_declarators);