Use objstack for strings
[babeltrace.git] / formats / ctf / metadata / ctf-parser.y
1 %{
2 /*
3 * ctf-parser.y
4 *
5 * Common Trace Format Metadata Grammar.
6 *
7 * Copyright 2010 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
8 *
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:
15 *
16 * The above copyright notice and this permission notice shall be included in
17 * all copies or substantial portions of the Software.
18 *
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
25 * SOFTWARE.
26 */
27
28 #include <stdio.h>
29 #include <ctype.h>
30 #include <unistd.h>
31 #include <string.h>
32 #include <stdlib.h>
33 #include <assert.h>
34 #include <glib.h>
35 #include <errno.h>
36 #include <inttypes.h>
37 #include <babeltrace/list.h>
38 #include <babeltrace/babeltrace-internal.h>
39 #include "ctf-scanner.h"
40 #include "ctf-parser.h"
41 #include "ctf-ast.h"
42 #include "objstack.h"
43
44 BT_HIDDEN
45 int yydebug;
46
47 /* Join two lists, put "add" at the end of "head". */
48 static inline void
49 _bt_list_splice_tail (struct bt_list_head *add, struct bt_list_head *head)
50 {
51 /* Do nothing if the list which gets added is empty. */
52 if (add != add->next) {
53 add->next->prev = head->prev;
54 add->prev->next = head;
55 head->prev->next = add->next;
56 head->prev = add->prev;
57 }
58 }
59
60 BT_HIDDEN
61 int yyparse(struct ctf_scanner *scanner);
62 BT_HIDDEN
63 int yylex(union YYSTYPE *yyval, struct ctf_scanner *scanner);
64 BT_HIDDEN
65 int yylex_init_extra(struct ctf_scanner *scanner, yyscan_t * ptr_yy_globals);
66 BT_HIDDEN
67 int yylex_destroy(yyscan_t yyscanner);
68 BT_HIDDEN
69 void yyrestart(FILE * in_str, yyscan_t scanner);
70 BT_HIDDEN
71 int yyget_lineno(yyscan_t yyscanner);
72 BT_HIDDEN
73 char *yyget_text(yyscan_t yyscanner);
74
75 static const char *node_type_to_str[] = {
76 #define ENTRY(S) [S] = #S,
77 FOREACH_CTF_NODES(ENTRY)
78 #undef ENTRY
79 };
80
81 /*
82 * Static node for out of memory errors. Only "type" is used. lineno is
83 * always left at 0. The rest of the node content can be overwritten,
84 * but is never used.
85 */
86 static struct ctf_node error_node = {
87 .type = NODE_ERROR,
88 };
89
90 BT_HIDDEN
91 const char *node_type(struct ctf_node *node)
92 {
93 if (node->type < NR_NODE_TYPES)
94 return node_type_to_str[node->type];
95 else
96 return NULL;
97 }
98
99 void setstring(struct ctf_scanner *scanner, YYSTYPE *lvalp, const char *src)
100 {
101 lvalp->s = objstack_alloc(scanner->objstack, strlen(src) + 1);
102 strcpy(lvalp->s, src);
103 }
104
105 static
106 int str_check(size_t str_len, size_t offset, size_t len)
107 {
108 /* check overflow */
109 if (offset + len < offset)
110 return -1;
111 if (offset + len > str_len)
112 return -1;
113 return 0;
114 }
115
116 static
117 int bt_isodigit(int c)
118 {
119 switch (c) {
120 case '0':
121 case '1':
122 case '2':
123 case '3':
124 case '4':
125 case '5':
126 case '6':
127 case '7':
128 return 1;
129 default:
130 return 0;
131 }
132 }
133
134 static
135 int parse_base_sequence(const char *src, size_t len, size_t pos,
136 char *buffer, size_t *buf_len, int base)
137 {
138 const size_t max_char = 3;
139 int nr_char = 0;
140
141 while (!str_check(len, pos, 1) && nr_char < max_char) {
142 char c = src[pos++];
143
144 if (base == 8) {
145 if (bt_isodigit(c))
146 buffer[nr_char++] = c;
147 else
148 break;
149 } else if (base == 16) {
150 if (isxdigit(c))
151 buffer[nr_char++] = c;
152 else
153 break;
154
155 } else {
156 /* Unsupported base */
157 return -1;
158 }
159 }
160 assert(nr_char > 0);
161 buffer[nr_char] = '\0';
162 *buf_len = nr_char;
163 return 0;
164 }
165
166 static
167 int import_basic_string(struct ctf_scanner *scanner, YYSTYPE *lvalp,
168 size_t len, const char *src, char delim)
169 {
170 size_t pos = 0, dpos = 0;
171
172 if (str_check(len, pos, 1))
173 return -1;
174 if (src[pos++] != delim)
175 return -1;
176
177 while (src[pos] != delim) {
178 char c;
179
180 if (str_check(len, pos, 1))
181 return -1;
182 c = src[pos++];
183 if (c == '\\') {
184 if (str_check(len, pos, 1))
185 return -1;
186 c = src[pos++];
187
188 switch (c) {
189 case 'a':
190 c = '\a';
191 break;
192 case 'b':
193 c = '\b';
194 break;
195 case 'f':
196 c = '\f';
197 break;
198 case 'n':
199 c = '\n';
200 break;
201 case 'r':
202 c = '\r';
203 break;
204 case 't':
205 c = '\t';
206 break;
207 case 'v':
208 c = '\v';
209 break;
210 case '\\':
211 c = '\\';
212 break;
213 case '\'':
214 c = '\'';
215 break;
216 case '\"':
217 c = '\"';
218 break;
219 case '?':
220 c = '?';
221 break;
222 case '0':
223 case '1':
224 case '2':
225 case '3':
226 case '4':
227 case '5':
228 case '6':
229 case '7':
230 {
231 char oct_buffer[4];
232 size_t oct_len;
233
234 if (parse_base_sequence(src, len, pos - 1,
235 oct_buffer, &oct_len, 8))
236 return -1;
237 c = strtoul(&oct_buffer[0], NULL, 8);
238 pos += oct_len - 1;
239 break;
240 }
241 case 'x':
242 {
243 char hex_buffer[4];
244 size_t hex_len;
245
246 if (parse_base_sequence(src, len, pos,
247 hex_buffer, &hex_len, 16))
248 return -1;
249 c = strtoul(&hex_buffer[0], NULL, 16);
250 pos += hex_len;
251 break;
252 }
253 default:
254 return -1;
255 }
256 }
257 if (str_check(len, dpos, 1))
258 return -1;
259 lvalp->s[dpos++] = c;
260 }
261
262 if (str_check(len, dpos, 1))
263 return -1;
264 lvalp->s[dpos++] = '\0';
265
266 if (str_check(len, pos, 1))
267 return -1;
268 if (src[pos++] != delim)
269 return -1;
270
271 if (str_check(len, pos, 1))
272 return -1;
273 if (src[pos] != '\0')
274 return -1;
275 return 0;
276 }
277
278 int import_string(struct ctf_scanner *scanner, YYSTYPE *lvalp,
279 const char *src, char delim)
280 {
281 size_t len;
282
283 len = strlen(src) + 1;
284 lvalp->s = objstack_alloc(scanner->objstack, len);
285 if (src[0] == 'L') {
286 // TODO: import wide string
287 printfl_error(yyget_lineno(scanner),
288 "Wide string not supported yet.");
289 return -1;
290 } else {
291 return import_basic_string(scanner, lvalp, len, src, delim);
292 }
293 }
294
295 static void init_scope(struct ctf_scanner_scope *scope,
296 struct ctf_scanner_scope *parent)
297 {
298 scope->parent = parent;
299 scope->types = g_hash_table_new_full(g_str_hash, g_str_equal,
300 NULL, NULL);
301 }
302
303 static void finalize_scope(struct ctf_scanner_scope *scope)
304 {
305 g_hash_table_destroy(scope->types);
306 }
307
308 static void push_scope(struct ctf_scanner *scanner)
309 {
310 struct ctf_scanner_scope *ns;
311
312 printf_debug("push scope\n");
313 ns = malloc(sizeof(struct ctf_scanner_scope));
314 init_scope(ns, scanner->cs);
315 scanner->cs = ns;
316 }
317
318 static void pop_scope(struct ctf_scanner *scanner)
319 {
320 struct ctf_scanner_scope *os;
321
322 printf_debug("pop scope\n");
323 os = scanner->cs;
324 scanner->cs = os->parent;
325 finalize_scope(os);
326 free(os);
327 }
328
329 static int lookup_type(struct ctf_scanner_scope *s, const char *id)
330 {
331 int ret;
332
333 ret = (int) (long) g_hash_table_lookup(s->types, id);
334 printf_debug("lookup %p %s %d\n", s, id, ret);
335 return ret;
336 }
337
338 BT_HIDDEN
339 int is_type(struct ctf_scanner *scanner, const char *id)
340 {
341 struct ctf_scanner_scope *it;
342 int ret = 0;
343
344 for (it = scanner->cs; it != NULL; it = it->parent) {
345 if (lookup_type(it, id)) {
346 ret = 1;
347 break;
348 }
349 }
350 printf_debug("is type %s %d\n", id, ret);
351 return ret;
352 }
353
354 static void add_type(struct ctf_scanner *scanner, char *id)
355 {
356 printf_debug("add type %s\n", id);
357 if (lookup_type(scanner->cs, id))
358 return;
359 g_hash_table_insert(scanner->cs->types, id, id);
360 }
361
362 static struct ctf_node *make_node(struct ctf_scanner *scanner,
363 enum node_type type)
364 {
365 struct ctf_ast *ast = ctf_scanner_get_ast(scanner);
366 struct ctf_node *node;
367
368 node = malloc(sizeof(*node));
369 if (!node) {
370 printfl_fatal(yyget_lineno(scanner->scanner), "out of memory");
371 return &error_node;
372 }
373 memset(node, 0, sizeof(*node));
374 node->type = type;
375 node->lineno = yyget_lineno(scanner->scanner);
376 BT_INIT_LIST_HEAD(&node->tmp_head);
377 bt_list_add(&node->gc, &ast->allocated_nodes);
378 bt_list_add(&node->siblings, &node->tmp_head);
379
380 switch (type) {
381 case NODE_ROOT:
382 node->type = NODE_ERROR;
383 printfn_fatal(node, "trying to create root node");
384 break;
385
386 case NODE_EVENT:
387 BT_INIT_LIST_HEAD(&node->u.event.declaration_list);
388 break;
389 case NODE_STREAM:
390 BT_INIT_LIST_HEAD(&node->u.stream.declaration_list);
391 break;
392 case NODE_ENV:
393 BT_INIT_LIST_HEAD(&node->u.env.declaration_list);
394 break;
395 case NODE_TRACE:
396 BT_INIT_LIST_HEAD(&node->u.trace.declaration_list);
397 break;
398 case NODE_CLOCK:
399 BT_INIT_LIST_HEAD(&node->u.clock.declaration_list);
400 break;
401 case NODE_CALLSITE:
402 BT_INIT_LIST_HEAD(&node->u.callsite.declaration_list);
403 break;
404
405 case NODE_CTF_EXPRESSION:
406 BT_INIT_LIST_HEAD(&node->u.ctf_expression.left);
407 BT_INIT_LIST_HEAD(&node->u.ctf_expression.right);
408 break;
409 case NODE_UNARY_EXPRESSION:
410 break;
411
412 case NODE_TYPEDEF:
413 BT_INIT_LIST_HEAD(&node->u._typedef.type_declarators);
414 break;
415 case NODE_TYPEALIAS_TARGET:
416 BT_INIT_LIST_HEAD(&node->u.typealias_target.type_declarators);
417 break;
418 case NODE_TYPEALIAS_ALIAS:
419 BT_INIT_LIST_HEAD(&node->u.typealias_alias.type_declarators);
420 break;
421 case NODE_TYPEALIAS:
422 break;
423
424 case NODE_TYPE_SPECIFIER:
425 break;
426 case NODE_TYPE_SPECIFIER_LIST:
427 BT_INIT_LIST_HEAD(&node->u.type_specifier_list.head);
428 break;
429 case NODE_POINTER:
430 break;
431 case NODE_TYPE_DECLARATOR:
432 BT_INIT_LIST_HEAD(&node->u.type_declarator.pointers);
433 break;
434
435 case NODE_FLOATING_POINT:
436 BT_INIT_LIST_HEAD(&node->u.floating_point.expressions);
437 break;
438 case NODE_INTEGER:
439 BT_INIT_LIST_HEAD(&node->u.integer.expressions);
440 break;
441 case NODE_STRING:
442 BT_INIT_LIST_HEAD(&node->u.string.expressions);
443 break;
444 case NODE_ENUMERATOR:
445 BT_INIT_LIST_HEAD(&node->u.enumerator.values);
446 break;
447 case NODE_ENUM:
448 BT_INIT_LIST_HEAD(&node->u._enum.enumerator_list);
449 break;
450 case NODE_STRUCT_OR_VARIANT_DECLARATION:
451 BT_INIT_LIST_HEAD(&node->u.struct_or_variant_declaration.type_declarators);
452 break;
453 case NODE_VARIANT:
454 BT_INIT_LIST_HEAD(&node->u.variant.declaration_list);
455 break;
456 case NODE_STRUCT:
457 BT_INIT_LIST_HEAD(&node->u._struct.declaration_list);
458 BT_INIT_LIST_HEAD(&node->u._struct.min_align);
459 break;
460
461 case NODE_UNKNOWN:
462 default:
463 node->type = NODE_ERROR;
464 printfn_fatal(node, "unknown node type '%d'", (int) type);
465 break;
466 }
467
468 return node;
469 }
470
471 static int reparent_ctf_expression(struct ctf_node *node,
472 struct ctf_node *parent)
473 {
474 switch (parent->type) {
475 case NODE_EVENT:
476 _bt_list_splice_tail(&node->tmp_head, &parent->u.event.declaration_list);
477 break;
478 case NODE_STREAM:
479 _bt_list_splice_tail(&node->tmp_head, &parent->u.stream.declaration_list);
480 break;
481 case NODE_ENV:
482 _bt_list_splice_tail(&node->tmp_head, &parent->u.env.declaration_list);
483 break;
484 case NODE_TRACE:
485 _bt_list_splice_tail(&node->tmp_head, &parent->u.trace.declaration_list);
486 break;
487 case NODE_CLOCK:
488 _bt_list_splice_tail(&node->tmp_head, &parent->u.clock.declaration_list);
489 break;
490 case NODE_CALLSITE:
491 _bt_list_splice_tail(&node->tmp_head, &parent->u.callsite.declaration_list);
492 break;
493 case NODE_FLOATING_POINT:
494 _bt_list_splice_tail(&node->tmp_head, &parent->u.floating_point.expressions);
495 break;
496 case NODE_INTEGER:
497 _bt_list_splice_tail(&node->tmp_head, &parent->u.integer.expressions);
498 break;
499 case NODE_STRING:
500 _bt_list_splice_tail(&node->tmp_head, &parent->u.string.expressions);
501 break;
502
503 case NODE_ROOT:
504 case NODE_CTF_EXPRESSION:
505 case NODE_TYPEDEF:
506 case NODE_TYPEALIAS_TARGET:
507 case NODE_TYPEALIAS_ALIAS:
508 case NODE_TYPEALIAS:
509 case NODE_TYPE_SPECIFIER:
510 case NODE_TYPE_SPECIFIER_LIST:
511 case NODE_POINTER:
512 case NODE_TYPE_DECLARATOR:
513 case NODE_ENUMERATOR:
514 case NODE_ENUM:
515 case NODE_STRUCT_OR_VARIANT_DECLARATION:
516 case NODE_VARIANT:
517 case NODE_STRUCT:
518 case NODE_UNARY_EXPRESSION:
519 return -EPERM;
520
521 case NODE_UNKNOWN:
522 default:
523 printfn_fatal(node, "unknown node type '%d'", (int) parent->type);
524 return -EINVAL;
525 }
526 return 0;
527 }
528
529 static int reparent_typedef(struct ctf_node *node, struct ctf_node *parent)
530 {
531 switch (parent->type) {
532 case NODE_ROOT:
533 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.declaration_list);
534 break;
535 case NODE_EVENT:
536 _bt_list_splice_tail(&node->tmp_head, &parent->u.event.declaration_list);
537 break;
538 case NODE_STREAM:
539 _bt_list_splice_tail(&node->tmp_head, &parent->u.stream.declaration_list);
540 break;
541 case NODE_ENV:
542 _bt_list_splice_tail(&node->tmp_head, &parent->u.env.declaration_list);
543 break;
544 case NODE_TRACE:
545 _bt_list_splice_tail(&node->tmp_head, &parent->u.trace.declaration_list);
546 break;
547 case NODE_CLOCK:
548 _bt_list_splice_tail(&node->tmp_head, &parent->u.clock.declaration_list);
549 break;
550 case NODE_CALLSITE:
551 _bt_list_splice_tail(&node->tmp_head, &parent->u.callsite.declaration_list);
552 break;
553 case NODE_VARIANT:
554 _bt_list_splice_tail(&node->tmp_head, &parent->u.variant.declaration_list);
555 break;
556 case NODE_STRUCT:
557 _bt_list_splice_tail(&node->tmp_head, &parent->u._struct.declaration_list);
558 break;
559
560 case NODE_FLOATING_POINT:
561 case NODE_INTEGER:
562 case NODE_STRING:
563 case NODE_CTF_EXPRESSION:
564 case NODE_TYPEDEF:
565 case NODE_TYPEALIAS_TARGET:
566 case NODE_TYPEALIAS_ALIAS:
567 case NODE_TYPEALIAS:
568 case NODE_TYPE_SPECIFIER:
569 case NODE_TYPE_SPECIFIER_LIST:
570 case NODE_POINTER:
571 case NODE_TYPE_DECLARATOR:
572 case NODE_ENUMERATOR:
573 case NODE_ENUM:
574 case NODE_STRUCT_OR_VARIANT_DECLARATION:
575 case NODE_UNARY_EXPRESSION:
576 return -EPERM;
577
578 case NODE_UNKNOWN:
579 default:
580 printfn_fatal(node, "unknown node type %d", parent->type);
581 return -EINVAL;
582 }
583 return 0;
584 }
585
586 static int reparent_typealias(struct ctf_node *node, struct ctf_node *parent)
587 {
588 switch (parent->type) {
589 case NODE_ROOT:
590 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.declaration_list);
591 break;
592 case NODE_EVENT:
593 _bt_list_splice_tail(&node->tmp_head, &parent->u.event.declaration_list);
594 break;
595 case NODE_STREAM:
596 _bt_list_splice_tail(&node->tmp_head, &parent->u.stream.declaration_list);
597 break;
598 case NODE_ENV:
599 _bt_list_splice_tail(&node->tmp_head, &parent->u.env.declaration_list);
600 break;
601 case NODE_TRACE:
602 _bt_list_splice_tail(&node->tmp_head, &parent->u.trace.declaration_list);
603 break;
604 case NODE_CLOCK:
605 _bt_list_splice_tail(&node->tmp_head, &parent->u.clock.declaration_list);
606 break;
607 case NODE_CALLSITE:
608 _bt_list_splice_tail(&node->tmp_head, &parent->u.callsite.declaration_list);
609 break;
610 case NODE_VARIANT:
611 _bt_list_splice_tail(&node->tmp_head, &parent->u.variant.declaration_list);
612 break;
613 case NODE_STRUCT:
614 _bt_list_splice_tail(&node->tmp_head, &parent->u._struct.declaration_list);
615 break;
616
617 case NODE_FLOATING_POINT:
618 case NODE_INTEGER:
619 case NODE_STRING:
620 case NODE_CTF_EXPRESSION:
621 case NODE_TYPEDEF:
622 case NODE_TYPEALIAS_TARGET:
623 case NODE_TYPEALIAS_ALIAS:
624 case NODE_TYPEALIAS:
625 case NODE_TYPE_SPECIFIER:
626 case NODE_TYPE_SPECIFIER_LIST:
627 case NODE_POINTER:
628 case NODE_TYPE_DECLARATOR:
629 case NODE_ENUMERATOR:
630 case NODE_ENUM:
631 case NODE_STRUCT_OR_VARIANT_DECLARATION:
632 case NODE_UNARY_EXPRESSION:
633 return -EPERM;
634
635 case NODE_UNKNOWN:
636 default:
637 printfn_fatal(node, "unknown node type '%d'", (int) parent->type);
638 return -EINVAL;
639 }
640 return 0;
641 }
642
643 static int reparent_type_specifier(struct ctf_node *node,
644 struct ctf_node *parent)
645 {
646 switch (parent->type) {
647 case NODE_TYPE_SPECIFIER_LIST:
648 _bt_list_splice_tail(&node->tmp_head, &parent->u.type_specifier_list.head);
649 break;
650
651 case NODE_TYPE_SPECIFIER:
652 case NODE_EVENT:
653 case NODE_STREAM:
654 case NODE_ENV:
655 case NODE_TRACE:
656 case NODE_CLOCK:
657 case NODE_CALLSITE:
658 case NODE_VARIANT:
659 case NODE_STRUCT:
660 case NODE_TYPEDEF:
661 case NODE_TYPEALIAS_TARGET:
662 case NODE_TYPEALIAS_ALIAS:
663 case NODE_TYPE_DECLARATOR:
664 case NODE_ENUM:
665 case NODE_STRUCT_OR_VARIANT_DECLARATION:
666 case NODE_TYPEALIAS:
667 case NODE_FLOATING_POINT:
668 case NODE_INTEGER:
669 case NODE_STRING:
670 case NODE_CTF_EXPRESSION:
671 case NODE_POINTER:
672 case NODE_ENUMERATOR:
673 case NODE_UNARY_EXPRESSION:
674 return -EPERM;
675
676 case NODE_UNKNOWN:
677 default:
678 printfn_fatal(node, "unknown node type '%d'", (int) parent->type);
679 return -EINVAL;
680 }
681 return 0;
682 }
683
684 static int reparent_type_specifier_list(struct ctf_node *node,
685 struct ctf_node *parent)
686 {
687 switch (parent->type) {
688 case NODE_ROOT:
689 bt_list_add_tail(&node->siblings, &parent->u.root.declaration_list);
690 break;
691 case NODE_EVENT:
692 bt_list_add_tail(&node->siblings, &parent->u.event.declaration_list);
693 break;
694 case NODE_STREAM:
695 bt_list_add_tail(&node->siblings, &parent->u.stream.declaration_list);
696 break;
697 case NODE_ENV:
698 bt_list_add_tail(&node->siblings, &parent->u.env.declaration_list);
699 break;
700 case NODE_TRACE:
701 bt_list_add_tail(&node->siblings, &parent->u.trace.declaration_list);
702 break;
703 case NODE_CLOCK:
704 bt_list_add_tail(&node->siblings, &parent->u.clock.declaration_list);
705 break;
706 case NODE_CALLSITE:
707 bt_list_add_tail(&node->siblings, &parent->u.callsite.declaration_list);
708 break;
709 case NODE_VARIANT:
710 bt_list_add_tail(&node->siblings, &parent->u.variant.declaration_list);
711 break;
712 case NODE_STRUCT:
713 bt_list_add_tail(&node->siblings, &parent->u._struct.declaration_list);
714 break;
715 case NODE_TYPEDEF:
716 parent->u._typedef.type_specifier_list = node;
717 break;
718 case NODE_TYPEALIAS_TARGET:
719 parent->u.typealias_target.type_specifier_list = node;
720 break;
721 case NODE_TYPEALIAS_ALIAS:
722 parent->u.typealias_alias.type_specifier_list = node;
723 break;
724 case NODE_ENUM:
725 parent->u._enum.container_type = node;
726 break;
727 case NODE_STRUCT_OR_VARIANT_DECLARATION:
728 parent->u.struct_or_variant_declaration.type_specifier_list = node;
729 break;
730 case NODE_TYPE_DECLARATOR:
731 case NODE_TYPE_SPECIFIER:
732 case NODE_TYPEALIAS:
733 case NODE_FLOATING_POINT:
734 case NODE_INTEGER:
735 case NODE_STRING:
736 case NODE_CTF_EXPRESSION:
737 case NODE_POINTER:
738 case NODE_ENUMERATOR:
739 case NODE_UNARY_EXPRESSION:
740 return -EPERM;
741
742 case NODE_UNKNOWN:
743 default:
744 printfn_fatal(node, "unknown node type '%d'", (int) parent->type);
745 return -EINVAL;
746 }
747 return 0;
748 }
749
750 static int reparent_type_declarator(struct ctf_node *node,
751 struct ctf_node *parent)
752 {
753 switch (parent->type) {
754 case NODE_TYPE_DECLARATOR:
755 parent->u.type_declarator.type = TYPEDEC_NESTED;
756 parent->u.type_declarator.u.nested.type_declarator = node;
757 break;
758 case NODE_STRUCT_OR_VARIANT_DECLARATION:
759 _bt_list_splice_tail(&node->tmp_head, &parent->u.struct_or_variant_declaration.type_declarators);
760 break;
761 case NODE_TYPEDEF:
762 _bt_list_splice_tail(&node->tmp_head, &parent->u._typedef.type_declarators);
763 break;
764 case NODE_TYPEALIAS_TARGET:
765 _bt_list_splice_tail(&node->tmp_head, &parent->u.typealias_target.type_declarators);
766 break;
767 case NODE_TYPEALIAS_ALIAS:
768 _bt_list_splice_tail(&node->tmp_head, &parent->u.typealias_alias.type_declarators);
769 break;
770
771 case NODE_ROOT:
772 case NODE_EVENT:
773 case NODE_STREAM:
774 case NODE_ENV:
775 case NODE_TRACE:
776 case NODE_CLOCK:
777 case NODE_CALLSITE:
778 case NODE_VARIANT:
779 case NODE_STRUCT:
780 case NODE_TYPEALIAS:
781 case NODE_ENUM:
782 case NODE_FLOATING_POINT:
783 case NODE_INTEGER:
784 case NODE_STRING:
785 case NODE_CTF_EXPRESSION:
786 case NODE_TYPE_SPECIFIER:
787 case NODE_TYPE_SPECIFIER_LIST:
788 case NODE_POINTER:
789 case NODE_ENUMERATOR:
790 case NODE_UNARY_EXPRESSION:
791 return -EPERM;
792
793 case NODE_UNKNOWN:
794 default:
795 printfn_fatal(node, "unknown node type '%d'", (int) parent->type);
796 return -EINVAL;
797 }
798 return 0;
799 }
800
801 /*
802 * set_parent_node
803 *
804 * Link node to parent. Returns 0 on success, -EPERM if it is not permitted to
805 * create the link declared by the input, -ENOENT if node or parent is NULL,
806 * -EINVAL if there is an internal structure problem.
807 */
808 static int set_parent_node(struct ctf_node *node,
809 struct ctf_node *parent)
810 {
811 if (!node || !parent)
812 return -ENOENT;
813
814 /* Note: Linking to parent will be done only by an external visitor */
815
816 switch (node->type) {
817 case NODE_ROOT:
818 printfn_fatal(node, "trying to reparent root node");
819 return -EINVAL;
820
821 case NODE_EVENT:
822 if (parent->type == NODE_ROOT) {
823 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.event);
824 } else {
825 return -EPERM;
826 }
827 break;
828 case NODE_STREAM:
829 if (parent->type == NODE_ROOT) {
830 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.stream);
831 } else {
832 return -EPERM;
833 }
834 break;
835 case NODE_ENV:
836 if (parent->type == NODE_ROOT) {
837 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.env);
838 } else {
839 return -EPERM;
840 }
841 break;
842 case NODE_TRACE:
843 if (parent->type == NODE_ROOT) {
844 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.trace);
845 } else {
846 return -EPERM;
847 }
848 break;
849 case NODE_CLOCK:
850 if (parent->type == NODE_ROOT) {
851 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.clock);
852 } else {
853 return -EPERM;
854 }
855 break;
856 case NODE_CALLSITE:
857 if (parent->type == NODE_ROOT) {
858 _bt_list_splice_tail(&node->tmp_head, &parent->u.root.callsite);
859 } else {
860 return -EPERM;
861 }
862 break;
863
864 case NODE_CTF_EXPRESSION:
865 return reparent_ctf_expression(node, parent);
866 case NODE_UNARY_EXPRESSION:
867 if (parent->type == NODE_TYPE_DECLARATOR)
868 parent->u.type_declarator.bitfield_len = node;
869 else
870 return -EPERM;
871 break;
872
873 case NODE_TYPEDEF:
874 return reparent_typedef(node, parent);
875 case NODE_TYPEALIAS_TARGET:
876 if (parent->type == NODE_TYPEALIAS)
877 parent->u.typealias.target = node;
878 else
879 return -EINVAL;
880 case NODE_TYPEALIAS_ALIAS:
881 if (parent->type == NODE_TYPEALIAS)
882 parent->u.typealias.alias = node;
883 else
884 return -EINVAL;
885 case NODE_TYPEALIAS:
886 return reparent_typealias(node, parent);
887
888 case NODE_POINTER:
889 if (parent->type == NODE_TYPE_DECLARATOR) {
890 _bt_list_splice_tail(&node->tmp_head, &parent->u.type_declarator.pointers);
891 } else
892 return -EPERM;
893 break;
894 case NODE_TYPE_DECLARATOR:
895 return reparent_type_declarator(node, parent);
896
897 case NODE_TYPE_SPECIFIER_LIST:
898 return reparent_type_specifier_list(node, parent);
899
900 case NODE_TYPE_SPECIFIER:
901 return reparent_type_specifier(node, parent);
902
903 case NODE_FLOATING_POINT:
904 case NODE_INTEGER:
905 case NODE_STRING:
906 case NODE_ENUM:
907 case NODE_VARIANT:
908 case NODE_STRUCT:
909 return -EINVAL; /* Dealt with internally within grammar */
910
911 case NODE_ENUMERATOR:
912 if (parent->type == NODE_ENUM) {
913 _bt_list_splice_tail(&node->tmp_head, &parent->u._enum.enumerator_list);
914 } else {
915 return -EPERM;
916 }
917 break;
918 case NODE_STRUCT_OR_VARIANT_DECLARATION:
919 switch (parent->type) {
920 case NODE_STRUCT:
921 _bt_list_splice_tail(&node->tmp_head, &parent->u._struct.declaration_list);
922 break;
923 case NODE_VARIANT:
924 _bt_list_splice_tail(&node->tmp_head, &parent->u.variant.declaration_list);
925 break;
926 default:
927 return -EINVAL;
928 }
929 break;
930
931 case NODE_UNKNOWN:
932 default:
933 printfn_fatal(node, "unknown node type '%d'", (int) parent->type);
934 return -EINVAL;
935 }
936 return 0;
937 }
938
939 BT_HIDDEN
940 void yyerror(struct ctf_scanner *scanner, const char *str)
941 {
942 printfl_error(yyget_lineno(scanner->scanner),
943 "token \"%s\": %s\n",
944 yyget_text(scanner->scanner), str);
945 }
946
947 BT_HIDDEN
948 int yywrap(void)
949 {
950 return 1;
951 }
952
953 #define reparent_error(scanner, str) \
954 do { \
955 yyerror(scanner, YY_("reparent_error: " str)); \
956 YYERROR; \
957 } while (0)
958
959 static struct ctf_ast *ctf_ast_alloc(void)
960 {
961 struct ctf_ast *ast;
962
963 ast = malloc(sizeof(*ast));
964 if (!ast)
965 return NULL;
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);
977 return ast;
978 }
979
980 static void ctf_ast_free(struct ctf_ast *ast)
981 {
982 struct ctf_node *node, *tmp;
983
984 bt_list_for_each_entry_safe(node, tmp, &ast->allocated_nodes, gc)
985 free(node);
986 free(ast);
987 }
988
989 int ctf_scanner_append_ast(struct ctf_scanner *scanner)
990 {
991 return yyparse(scanner);
992 }
993
994 struct ctf_scanner *ctf_scanner_alloc(FILE *input)
995 {
996 struct ctf_scanner *scanner;
997 int ret;
998
999 yydebug = babeltrace_debug;
1000
1001 scanner = malloc(sizeof(*scanner));
1002 if (!scanner)
1003 return NULL;
1004 memset(scanner, 0, sizeof(*scanner));
1005
1006 ret = yylex_init_extra(scanner, &scanner->scanner);
1007 if (ret) {
1008 printf_fatal("yylex_init error");
1009 goto cleanup_scanner;
1010 }
1011 /* Start processing new stream */
1012 yyrestart(input, scanner->scanner);
1013
1014 scanner->ast = ctf_ast_alloc();
1015 if (!scanner->ast)
1016 goto cleanup_lexer;
1017 scanner->objstack = objstack_create();
1018 if (!scanner->objstack)
1019 goto cleanup_ast;
1020 init_scope(&scanner->root_scope, NULL);
1021 scanner->cs = &scanner->root_scope;
1022
1023 if (yydebug)
1024 fprintf(stdout, "Scanner input is a%s.\n",
1025 isatty(fileno(input)) ? "n interactive tty" :
1026 " noninteractive file");
1027
1028 return scanner;
1029
1030 cleanup_ast:
1031 ctf_ast_free(scanner->ast);
1032 cleanup_lexer:
1033 ret = yylex_destroy(scanner->scanner);
1034 if (!ret)
1035 printf_fatal("yylex_destroy error");
1036 cleanup_scanner:
1037 free(scanner);
1038 return NULL;
1039 }
1040
1041 void ctf_scanner_free(struct ctf_scanner *scanner)
1042 {
1043 int ret;
1044
1045 finalize_scope(&scanner->root_scope);
1046 objstack_destroy(scanner->objstack);
1047 ctf_ast_free(scanner->ast);
1048 ret = yylex_destroy(scanner->scanner);
1049 if (ret)
1050 printf_error("yylex_destroy error");
1051 free(scanner);
1052 }
1053
1054 %}
1055
1056 %define api.pure
1057 /* %locations */
1058 %error-verbose
1059 %parse-param {struct ctf_scanner *scanner}
1060 %lex-param {struct ctf_scanner *scanner}
1061 /*
1062 * Expect two shift-reduce conflicts. Caused by enum name-opt : type {}
1063 * vs struct { int :value; } (unnamed bit-field). The default is to
1064 * shift, so whenever we encounter an enumeration, we are doing the
1065 * proper thing (shift). It is illegal to declare an enumeration
1066 * "bit-field", so it is OK if this situation ends up in a parsing
1067 * error.
1068 */
1069 %expect 2
1070 %start file
1071 %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
1072 %token <s> IDENTIFIER ID_TYPE
1073 %token ERROR
1074 %union
1075 {
1076 long long ll;
1077 unsigned long long ull;
1078 char c;
1079 char *s;
1080 struct ctf_node *n;
1081 }
1082
1083 %type <s> STRING_LITERAL CHARACTER_LITERAL
1084
1085 %type <s> keywords
1086
1087 %type <ull> INTEGER_LITERAL
1088 %type <n> postfix_expression unary_expression unary_expression_or_range
1089
1090 %type <n> declaration
1091 %type <n> event_declaration
1092 %type <n> stream_declaration
1093 %type <n> env_declaration
1094 %type <n> trace_declaration
1095 %type <n> clock_declaration
1096 %type <n> callsite_declaration
1097 %type <n> integer_declaration_specifiers
1098 %type <n> declaration_specifiers
1099 %type <n> alias_declaration_specifiers
1100
1101 %type <n> type_declarator_list
1102 %type <n> integer_type_specifier
1103 %type <n> type_specifier
1104 %type <n> struct_type_specifier
1105 %type <n> variant_type_specifier
1106 %type <n> enum_type_specifier
1107 %type <n> struct_or_variant_declaration_list
1108 %type <n> struct_or_variant_declaration
1109 %type <n> struct_or_variant_declarator_list
1110 %type <n> struct_or_variant_declarator
1111 %type <n> enumerator_list
1112 %type <n> enumerator
1113 %type <n> abstract_declarator_list
1114 %type <n> abstract_declarator
1115 %type <n> direct_abstract_declarator
1116 %type <n> alias_abstract_declarator_list
1117 %type <n> alias_abstract_declarator
1118 %type <n> direct_alias_abstract_declarator
1119 %type <n> declarator
1120 %type <n> direct_declarator
1121 %type <n> type_declarator
1122 %type <n> direct_type_declarator
1123 %type <n> pointer
1124 %type <n> ctf_assignment_expression_list
1125 %type <n> ctf_assignment_expression
1126
1127 %%
1128
1129 file:
1130 declaration
1131 {
1132 if (set_parent_node($1, &ctf_scanner_get_ast(scanner)->root))
1133 reparent_error(scanner, "error reparenting to root");
1134 }
1135 | file declaration
1136 {
1137 if (set_parent_node($2, &ctf_scanner_get_ast(scanner)->root))
1138 reparent_error(scanner, "error reparenting to root");
1139 }
1140 ;
1141
1142 keywords:
1143 VOID
1144 { $$ = yylval.s; }
1145 | CHAR
1146 { $$ = yylval.s; }
1147 | SHORT
1148 { $$ = yylval.s; }
1149 | INT
1150 { $$ = yylval.s; }
1151 | LONG
1152 { $$ = yylval.s; }
1153 | FLOAT
1154 { $$ = yylval.s; }
1155 | DOUBLE
1156 { $$ = yylval.s; }
1157 | SIGNED
1158 { $$ = yylval.s; }
1159 | UNSIGNED
1160 { $$ = yylval.s; }
1161 | _BOOL
1162 { $$ = yylval.s; }
1163 | _COMPLEX
1164 { $$ = yylval.s; }
1165 | _IMAGINARY
1166 { $$ = yylval.s; }
1167 | FLOATING_POINT
1168 { $$ = yylval.s; }
1169 | INTEGER
1170 { $$ = yylval.s; }
1171 | STRING
1172 { $$ = yylval.s; }
1173 | ENUM
1174 { $$ = yylval.s; }
1175 | VARIANT
1176 { $$ = yylval.s; }
1177 | STRUCT
1178 { $$ = yylval.s; }
1179 | CONST
1180 { $$ = yylval.s; }
1181 | TYPEDEF
1182 { $$ = yylval.s; }
1183 | EVENT
1184 { $$ = yylval.s; }
1185 | STREAM
1186 { $$ = yylval.s; }
1187 | ENV
1188 { $$ = yylval.s; }
1189 | TRACE
1190 { $$ = yylval.s; }
1191 | CLOCK
1192 { $$ = yylval.s; }
1193 | CALLSITE
1194 { $$ = yylval.s; }
1195 | TOK_ALIGN
1196 { $$ = yylval.s; }
1197 ;
1198
1199
1200 /* 2: Phrase structure grammar */
1201
1202 postfix_expression:
1203 IDENTIFIER
1204 {
1205 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1206 $$->u.unary_expression.type = UNARY_STRING;
1207 $$->u.unary_expression.u.string = yylval.s;
1208 }
1209 | ID_TYPE
1210 {
1211 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1212 $$->u.unary_expression.type = UNARY_STRING;
1213 $$->u.unary_expression.u.string = yylval.s;
1214 }
1215 | keywords
1216 {
1217 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1218 $$->u.unary_expression.type = UNARY_STRING;
1219 $$->u.unary_expression.u.string = yylval.s;
1220 }
1221 | INTEGER_LITERAL
1222 {
1223 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1224 $$->u.unary_expression.type = UNARY_UNSIGNED_CONSTANT;
1225 $$->u.unary_expression.u.unsigned_constant = $1;
1226 }
1227 | STRING_LITERAL
1228 {
1229 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1230 $$->u.unary_expression.type = UNARY_STRING;
1231 $$->u.unary_expression.u.string = $1;
1232 }
1233 | CHARACTER_LITERAL
1234 {
1235 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1236 $$->u.unary_expression.type = UNARY_STRING;
1237 $$->u.unary_expression.u.string = $1;
1238 }
1239 | LPAREN unary_expression RPAREN
1240 {
1241 $$ = $2;
1242 }
1243 | postfix_expression LSBRAC unary_expression RSBRAC
1244 {
1245 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1246 $$->u.unary_expression.type = UNARY_SBRAC;
1247 $$->u.unary_expression.u.sbrac_exp = $3;
1248 bt_list_splice(&($1)->tmp_head, &($$)->tmp_head);
1249 bt_list_add_tail(&($$)->siblings, &($$)->tmp_head);
1250 }
1251 | postfix_expression DOT IDENTIFIER
1252 {
1253 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1254 $$->u.unary_expression.type = UNARY_STRING;
1255 $$->u.unary_expression.u.string = yylval.s;
1256 $$->u.unary_expression.link = UNARY_DOTLINK;
1257 bt_list_splice(&($1)->tmp_head, &($$)->tmp_head);
1258 bt_list_add_tail(&($$)->siblings, &($$)->tmp_head);
1259 }
1260 | postfix_expression DOT ID_TYPE
1261 {
1262 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1263 $$->u.unary_expression.type = UNARY_STRING;
1264 $$->u.unary_expression.u.string = yylval.s;
1265 $$->u.unary_expression.link = UNARY_DOTLINK;
1266 bt_list_splice(&($1)->tmp_head, &($$)->tmp_head);
1267 bt_list_add_tail(&($$)->siblings, &($$)->tmp_head);
1268 }
1269 | postfix_expression RARROW IDENTIFIER
1270 {
1271 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1272 $$->u.unary_expression.type = UNARY_STRING;
1273 $$->u.unary_expression.u.string = yylval.s;
1274 $$->u.unary_expression.link = UNARY_ARROWLINK;
1275 bt_list_splice(&($1)->tmp_head, &($$)->tmp_head);
1276 bt_list_add_tail(&($$)->siblings, &($$)->tmp_head);
1277 }
1278 | postfix_expression RARROW ID_TYPE
1279 {
1280 $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
1281 $$->u.unary_expression.type = UNARY_STRING;
1282 $$->u.unary_expression.u.string = yylval.s;
1283 $$->u.unary_expression.link = UNARY_ARROWLINK;
1284 bt_list_splice(&($1)->tmp_head, &($$)->tmp_head);
1285 bt_list_add_tail(&($$)->siblings, &($$)->tmp_head);
1286 }
1287 ;
1288
1289 unary_expression:
1290 postfix_expression
1291 { $$ = $1; }
1292 | PLUS postfix_expression
1293 {
1294 $$ = $2;
1295 if ($$->u.unary_expression.type != UNARY_UNSIGNED_CONSTANT
1296 && $$->u.unary_expression.type != UNARY_SIGNED_CONSTANT) {
1297 reparent_error(scanner, "expecting numeric constant");
1298 }
1299 }
1300 | MINUS postfix_expression
1301 {
1302 $$ = $2;
1303 if ($$->u.unary_expression.type == UNARY_UNSIGNED_CONSTANT) {
1304 $$->u.unary_expression.type = UNARY_SIGNED_CONSTANT;
1305 $$->u.unary_expression.u.signed_constant =
1306 -($$->u.unary_expression.u.unsigned_constant);
1307 } else if ($$->u.unary_expression.type == UNARY_UNSIGNED_CONSTANT) {
1308 $$->u.unary_expression.u.signed_constant =
1309 -($$->u.unary_expression.u.signed_constant);
1310 } else {
1311 reparent_error(scanner, "expecting numeric constant");
1312 }
1313 }
1314 ;
1315
1316 unary_expression_or_range:
1317 unary_expression DOTDOTDOT unary_expression
1318 {
1319 $$ = $1;
1320 _bt_list_splice_tail(&($3)->tmp_head, &($$)->tmp_head);
1321 $3->u.unary_expression.link = UNARY_DOTDOTDOT;
1322 }
1323 | unary_expression
1324 { $$ = $1; }
1325 ;
1326
1327 /* 2.2: Declarations */
1328
1329 declaration:
1330 declaration_specifiers SEMICOLON
1331 { $$ = $1; }
1332 | event_declaration
1333 { $$ = $1; }
1334 | stream_declaration
1335 { $$ = $1; }
1336 | env_declaration
1337 { $$ = $1; }
1338 | trace_declaration
1339 { $$ = $1; }
1340 | clock_declaration
1341 { $$ = $1; }
1342 | callsite_declaration
1343 { $$ = $1; }
1344 | declaration_specifiers TYPEDEF declaration_specifiers type_declarator_list SEMICOLON
1345 {
1346 struct ctf_node *list;
1347
1348 $$ = make_node(scanner, NODE_TYPEDEF);
1349 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1350 $$->u._typedef.type_specifier_list = list;
1351 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
1352 _bt_list_splice_tail(&($3)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
1353 _bt_list_splice_tail(&($4)->tmp_head, &($$)->u._typedef.type_declarators);
1354 }
1355 | TYPEDEF declaration_specifiers type_declarator_list SEMICOLON
1356 {
1357 struct ctf_node *list;
1358
1359 $$ = make_node(scanner, NODE_TYPEDEF);
1360 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1361 $$->u._typedef.type_specifier_list = list;
1362 _bt_list_splice_tail(&($2)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
1363 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._typedef.type_declarators);
1364 }
1365 | declaration_specifiers TYPEDEF type_declarator_list SEMICOLON
1366 {
1367 struct ctf_node *list;
1368
1369 $$ = make_node(scanner, NODE_TYPEDEF);
1370 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1371 $$->u._typedef.type_specifier_list = list;
1372 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
1373 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._typedef.type_declarators);
1374 }
1375 | TYPEALIAS declaration_specifiers abstract_declarator_list TYPEASSIGN alias_declaration_specifiers alias_abstract_declarator_list SEMICOLON
1376 {
1377 struct ctf_node *list;
1378
1379 $$ = make_node(scanner, NODE_TYPEALIAS);
1380 $$->u.typealias.target = make_node(scanner, NODE_TYPEALIAS_TARGET);
1381 $$->u.typealias.alias = make_node(scanner, NODE_TYPEALIAS_ALIAS);
1382
1383 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1384 $$->u.typealias.target->u.typealias_target.type_specifier_list = list;
1385 _bt_list_splice_tail(&($2)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
1386 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.typealias.target->u.typealias_target.type_declarators);
1387
1388 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1389 $$->u.typealias.alias->u.typealias_alias.type_specifier_list = list;
1390 _bt_list_splice_tail(&($5)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
1391 _bt_list_splice_tail(&($6)->tmp_head, &($$)->u.typealias.alias->u.typealias_alias.type_declarators);
1392 }
1393 ;
1394
1395 event_declaration:
1396 event_declaration_begin event_declaration_end
1397 {
1398 $$ = make_node(scanner, NODE_EVENT);
1399 }
1400 | event_declaration_begin ctf_assignment_expression_list event_declaration_end
1401 {
1402 $$ = make_node(scanner, NODE_EVENT);
1403 if (set_parent_node($2, $$))
1404 reparent_error(scanner, "event_declaration");
1405 }
1406 ;
1407
1408 event_declaration_begin:
1409 EVENT LBRAC
1410 { push_scope(scanner); }
1411 ;
1412
1413 event_declaration_end:
1414 RBRAC SEMICOLON
1415 { pop_scope(scanner); }
1416 ;
1417
1418
1419 stream_declaration:
1420 stream_declaration_begin stream_declaration_end
1421 {
1422 $$ = make_node(scanner, NODE_STREAM);
1423 }
1424 | stream_declaration_begin ctf_assignment_expression_list stream_declaration_end
1425 {
1426 $$ = make_node(scanner, NODE_STREAM);
1427 if (set_parent_node($2, $$))
1428 reparent_error(scanner, "stream_declaration");
1429 }
1430 ;
1431
1432 stream_declaration_begin:
1433 STREAM LBRAC
1434 { push_scope(scanner); }
1435 ;
1436
1437 stream_declaration_end:
1438 RBRAC SEMICOLON
1439 { pop_scope(scanner); }
1440 ;
1441
1442 env_declaration:
1443 env_declaration_begin env_declaration_end
1444 {
1445 $$ = make_node(scanner, NODE_ENV);
1446 }
1447 | env_declaration_begin ctf_assignment_expression_list env_declaration_end
1448 {
1449 $$ = make_node(scanner, NODE_ENV);
1450 if (set_parent_node($2, $$))
1451 reparent_error(scanner, "env declaration");
1452 }
1453 ;
1454
1455 env_declaration_begin:
1456 ENV LBRAC
1457 { push_scope(scanner); }
1458 ;
1459
1460 env_declaration_end:
1461 RBRAC SEMICOLON
1462 { pop_scope(scanner); }
1463 ;
1464
1465 trace_declaration:
1466 trace_declaration_begin trace_declaration_end
1467 {
1468 $$ = make_node(scanner, NODE_TRACE);
1469 }
1470 | trace_declaration_begin ctf_assignment_expression_list trace_declaration_end
1471 {
1472 $$ = make_node(scanner, NODE_TRACE);
1473 if (set_parent_node($2, $$))
1474 reparent_error(scanner, "trace_declaration");
1475 }
1476 ;
1477
1478 trace_declaration_begin:
1479 TRACE LBRAC
1480 { push_scope(scanner); }
1481 ;
1482
1483 trace_declaration_end:
1484 RBRAC SEMICOLON
1485 { pop_scope(scanner); }
1486 ;
1487
1488 clock_declaration:
1489 CLOCK clock_declaration_begin clock_declaration_end
1490 {
1491 $$ = make_node(scanner, NODE_CLOCK);
1492 }
1493 | CLOCK clock_declaration_begin ctf_assignment_expression_list clock_declaration_end
1494 {
1495 $$ = make_node(scanner, NODE_CLOCK);
1496 if (set_parent_node($3, $$))
1497 reparent_error(scanner, "trace_declaration");
1498 }
1499 ;
1500
1501 clock_declaration_begin:
1502 LBRAC
1503 { push_scope(scanner); }
1504 ;
1505
1506 clock_declaration_end:
1507 RBRAC SEMICOLON
1508 { pop_scope(scanner); }
1509 ;
1510
1511 callsite_declaration:
1512 CALLSITE callsite_declaration_begin callsite_declaration_end
1513 {
1514 $$ = make_node(scanner, NODE_CALLSITE);
1515 }
1516 | CALLSITE callsite_declaration_begin ctf_assignment_expression_list callsite_declaration_end
1517 {
1518 $$ = make_node(scanner, NODE_CALLSITE);
1519 if (set_parent_node($3, $$))
1520 reparent_error(scanner, "trace_declaration");
1521 }
1522 ;
1523
1524 callsite_declaration_begin:
1525 LBRAC
1526 { push_scope(scanner); }
1527 ;
1528
1529 callsite_declaration_end:
1530 RBRAC SEMICOLON
1531 { pop_scope(scanner); }
1532 ;
1533
1534 integer_declaration_specifiers:
1535 CONST
1536 {
1537 struct ctf_node *node;
1538
1539 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1540 node = make_node(scanner, NODE_TYPE_SPECIFIER);
1541 node->u.type_specifier.type = TYPESPEC_CONST;
1542 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
1543 }
1544 | integer_type_specifier
1545 {
1546 struct ctf_node *node;
1547
1548 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1549 node = $1;
1550 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
1551 }
1552 | integer_declaration_specifiers CONST
1553 {
1554 struct ctf_node *node;
1555
1556 $$ = $1;
1557 node = make_node(scanner, NODE_TYPE_SPECIFIER);
1558 node->u.type_specifier.type = TYPESPEC_CONST;
1559 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
1560 }
1561 | integer_declaration_specifiers integer_type_specifier
1562 {
1563 $$ = $1;
1564 bt_list_add_tail(&($2)->siblings, &($$)->u.type_specifier_list.head);
1565 }
1566 ;
1567
1568 declaration_specifiers:
1569 CONST
1570 {
1571 struct ctf_node *node;
1572
1573 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1574 node = make_node(scanner, NODE_TYPE_SPECIFIER);
1575 node->u.type_specifier.type = TYPESPEC_CONST;
1576 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
1577 }
1578 | type_specifier
1579 {
1580 struct ctf_node *node;
1581
1582 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
1583 node = $1;
1584 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
1585 }
1586 | declaration_specifiers CONST
1587 {
1588 struct ctf_node *node;
1589
1590 $$ = $1;
1591 node = make_node(scanner, NODE_TYPE_SPECIFIER);
1592 node->u.type_specifier.type = TYPESPEC_CONST;
1593 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
1594 }
1595 | declaration_specifiers type_specifier
1596 {
1597 $$ = $1;
1598 bt_list_add_tail(&($2)->siblings, &($$)->u.type_specifier_list.head);
1599 }
1600 ;
1601
1602 type_declarator_list:
1603 type_declarator
1604 { $$ = $1; }
1605 | type_declarator_list COMMA type_declarator
1606 {
1607 $$ = $1;
1608 bt_list_add_tail(&($3)->siblings, &($$)->tmp_head);
1609 }
1610 ;
1611
1612 integer_type_specifier:
1613 CHAR
1614 {
1615 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1616 $$->u.type_specifier.type = TYPESPEC_CHAR;
1617 }
1618 | SHORT
1619 {
1620 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1621 $$->u.type_specifier.type = TYPESPEC_SHORT;
1622 }
1623 | INT
1624 {
1625 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1626 $$->u.type_specifier.type = TYPESPEC_INT;
1627 }
1628 | LONG
1629 {
1630 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1631 $$->u.type_specifier.type = TYPESPEC_LONG;
1632 }
1633 | SIGNED
1634 {
1635 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1636 $$->u.type_specifier.type = TYPESPEC_SIGNED;
1637 }
1638 | UNSIGNED
1639 {
1640 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1641 $$->u.type_specifier.type = TYPESPEC_UNSIGNED;
1642 }
1643 | _BOOL
1644 {
1645 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1646 $$->u.type_specifier.type = TYPESPEC_BOOL;
1647 }
1648 | ID_TYPE
1649 {
1650 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1651 $$->u.type_specifier.type = TYPESPEC_ID_TYPE;
1652 $$->u.type_specifier.id_type = yylval.s;
1653 }
1654 | INTEGER LBRAC RBRAC
1655 {
1656 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1657 $$->u.type_specifier.type = TYPESPEC_INTEGER;
1658 $$->u.type_specifier.node = make_node(scanner, NODE_INTEGER);
1659 }
1660 | INTEGER LBRAC ctf_assignment_expression_list RBRAC
1661 {
1662 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1663 $$->u.type_specifier.type = TYPESPEC_INTEGER;
1664 $$->u.type_specifier.node = make_node(scanner, NODE_INTEGER);
1665 if (set_parent_node($3, $$->u.type_specifier.node))
1666 reparent_error(scanner, "integer reparent error");
1667 }
1668 ;
1669
1670 type_specifier:
1671 VOID
1672 {
1673 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1674 $$->u.type_specifier.type = TYPESPEC_VOID;
1675 }
1676 | CHAR
1677 {
1678 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1679 $$->u.type_specifier.type = TYPESPEC_CHAR;
1680 }
1681 | SHORT
1682 {
1683 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1684 $$->u.type_specifier.type = TYPESPEC_SHORT;
1685 }
1686 | INT
1687 {
1688 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1689 $$->u.type_specifier.type = TYPESPEC_INT;
1690 }
1691 | LONG
1692 {
1693 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1694 $$->u.type_specifier.type = TYPESPEC_LONG;
1695 }
1696 | FLOAT
1697 {
1698 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1699 $$->u.type_specifier.type = TYPESPEC_FLOAT;
1700 }
1701 | DOUBLE
1702 {
1703 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1704 $$->u.type_specifier.type = TYPESPEC_DOUBLE;
1705 }
1706 | SIGNED
1707 {
1708 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1709 $$->u.type_specifier.type = TYPESPEC_SIGNED;
1710 }
1711 | UNSIGNED
1712 {
1713 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1714 $$->u.type_specifier.type = TYPESPEC_UNSIGNED;
1715 }
1716 | _BOOL
1717 {
1718 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1719 $$->u.type_specifier.type = TYPESPEC_BOOL;
1720 }
1721 | _COMPLEX
1722 {
1723 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1724 $$->u.type_specifier.type = TYPESPEC_COMPLEX;
1725 }
1726 | _IMAGINARY
1727 {
1728 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1729 $$->u.type_specifier.type = TYPESPEC_IMAGINARY;
1730 }
1731 | ID_TYPE
1732 {
1733 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1734 $$->u.type_specifier.type = TYPESPEC_ID_TYPE;
1735 $$->u.type_specifier.id_type = yylval.s;
1736 }
1737 | FLOATING_POINT LBRAC RBRAC
1738 {
1739 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1740 $$->u.type_specifier.type = TYPESPEC_FLOATING_POINT;
1741 $$->u.type_specifier.node = make_node(scanner, NODE_FLOATING_POINT);
1742 }
1743 | FLOATING_POINT LBRAC ctf_assignment_expression_list RBRAC
1744 {
1745 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1746 $$->u.type_specifier.type = TYPESPEC_FLOATING_POINT;
1747 $$->u.type_specifier.node = make_node(scanner, NODE_FLOATING_POINT);
1748 if (set_parent_node($3, $$->u.type_specifier.node))
1749 reparent_error(scanner, "floating point reparent error");
1750 }
1751 | INTEGER LBRAC RBRAC
1752 {
1753 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1754 $$->u.type_specifier.type = TYPESPEC_INTEGER;
1755 $$->u.type_specifier.node = make_node(scanner, NODE_INTEGER);
1756 }
1757 | INTEGER LBRAC ctf_assignment_expression_list RBRAC
1758 {
1759 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1760 $$->u.type_specifier.type = TYPESPEC_INTEGER;
1761 $$->u.type_specifier.node = make_node(scanner, NODE_INTEGER);
1762 if (set_parent_node($3, $$->u.type_specifier.node))
1763 reparent_error(scanner, "integer reparent error");
1764 }
1765 | STRING
1766 {
1767 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1768 $$->u.type_specifier.type = TYPESPEC_STRING;
1769 $$->u.type_specifier.node = make_node(scanner, NODE_STRING);
1770 }
1771 | STRING LBRAC RBRAC
1772 {
1773 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1774 $$->u.type_specifier.type = TYPESPEC_STRING;
1775 $$->u.type_specifier.node = make_node(scanner, NODE_STRING);
1776 }
1777 | STRING LBRAC ctf_assignment_expression_list RBRAC
1778 {
1779 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1780 $$->u.type_specifier.type = TYPESPEC_STRING;
1781 $$->u.type_specifier.node = make_node(scanner, NODE_STRING);
1782 if (set_parent_node($3, $$->u.type_specifier.node))
1783 reparent_error(scanner, "string reparent error");
1784 }
1785 | ENUM enum_type_specifier
1786 {
1787 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1788 $$->u.type_specifier.type = TYPESPEC_ENUM;
1789 $$->u.type_specifier.node = $2;
1790 }
1791 | VARIANT variant_type_specifier
1792 {
1793 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1794 $$->u.type_specifier.type = TYPESPEC_VARIANT;
1795 $$->u.type_specifier.node = $2;
1796 }
1797 | STRUCT struct_type_specifier
1798 {
1799 $$ = make_node(scanner, NODE_TYPE_SPECIFIER);
1800 $$->u.type_specifier.type = TYPESPEC_STRUCT;
1801 $$->u.type_specifier.node = $2;
1802 }
1803 ;
1804
1805 struct_type_specifier:
1806 struct_declaration_begin struct_or_variant_declaration_list struct_declaration_end
1807 {
1808 $$ = make_node(scanner, NODE_STRUCT);
1809 $$->u._struct.has_body = 1;
1810 if ($2 && set_parent_node($2, $$))
1811 reparent_error(scanner, "struct reparent error");
1812 }
1813 | IDENTIFIER struct_declaration_begin struct_or_variant_declaration_list struct_declaration_end
1814 {
1815 $$ = make_node(scanner, NODE_STRUCT);
1816 $$->u._struct.has_body = 1;
1817 $$->u._struct.name = $1;
1818 if ($3 && set_parent_node($3, $$))
1819 reparent_error(scanner, "struct reparent error");
1820 }
1821 | ID_TYPE struct_declaration_begin struct_or_variant_declaration_list struct_declaration_end
1822 {
1823 $$ = make_node(scanner, NODE_STRUCT);
1824 $$->u._struct.has_body = 1;
1825 $$->u._struct.name = $1;
1826 if ($3 && set_parent_node($3, $$))
1827 reparent_error(scanner, "struct reparent error");
1828 }
1829 | IDENTIFIER
1830 {
1831 $$ = make_node(scanner, NODE_STRUCT);
1832 $$->u._struct.has_body = 0;
1833 $$->u._struct.name = $1;
1834 }
1835 | ID_TYPE
1836 {
1837 $$ = make_node(scanner, NODE_STRUCT);
1838 $$->u._struct.has_body = 0;
1839 $$->u._struct.name = $1;
1840 }
1841 | struct_declaration_begin struct_or_variant_declaration_list struct_declaration_end TOK_ALIGN LPAREN unary_expression RPAREN
1842 {
1843 $$ = make_node(scanner, NODE_STRUCT);
1844 $$->u._struct.has_body = 1;
1845 bt_list_add_tail(&($6)->siblings, &$$->u._struct.min_align);
1846 if ($2 && set_parent_node($2, $$))
1847 reparent_error(scanner, "struct reparent error");
1848 }
1849 | IDENTIFIER struct_declaration_begin struct_or_variant_declaration_list struct_declaration_end TOK_ALIGN LPAREN unary_expression RPAREN
1850 {
1851 $$ = make_node(scanner, NODE_STRUCT);
1852 $$->u._struct.has_body = 1;
1853 $$->u._struct.name = $1;
1854 bt_list_add_tail(&($7)->siblings, &$$->u._struct.min_align);
1855 if ($3 && set_parent_node($3, $$))
1856 reparent_error(scanner, "struct reparent error");
1857 }
1858 | ID_TYPE struct_declaration_begin struct_or_variant_declaration_list struct_declaration_end TOK_ALIGN LPAREN unary_expression RPAREN
1859 {
1860 $$ = make_node(scanner, NODE_STRUCT);
1861 $$->u._struct.has_body = 1;
1862 $$->u._struct.name = $1;
1863 bt_list_add_tail(&($7)->siblings, &$$->u._struct.min_align);
1864 if ($3 && set_parent_node($3, $$))
1865 reparent_error(scanner, "struct reparent error");
1866 }
1867 ;
1868
1869 struct_declaration_begin:
1870 LBRAC
1871 { push_scope(scanner); }
1872 ;
1873
1874 struct_declaration_end:
1875 RBRAC
1876 { pop_scope(scanner); }
1877 ;
1878
1879 variant_type_specifier:
1880 variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1881 {
1882 $$ = make_node(scanner, NODE_VARIANT);
1883 $$->u.variant.has_body = 1;
1884 if ($2 && set_parent_node($2, $$))
1885 reparent_error(scanner, "variant reparent error");
1886 }
1887 | LT IDENTIFIER GT variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1888 {
1889 $$ = make_node(scanner, NODE_VARIANT);
1890 $$->u.variant.has_body = 1;
1891 $$->u.variant.choice = $2;
1892 if ($5 && set_parent_node($5, $$))
1893 reparent_error(scanner, "variant reparent error");
1894 }
1895 | LT ID_TYPE GT variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1896 {
1897 $$ = make_node(scanner, NODE_VARIANT);
1898 $$->u.variant.has_body = 1;
1899 $$->u.variant.choice = $2;
1900 if ($5 && set_parent_node($5, $$))
1901 reparent_error(scanner, "variant reparent error");
1902 }
1903 | IDENTIFIER variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1904 {
1905 $$ = make_node(scanner, NODE_VARIANT);
1906 $$->u.variant.has_body = 1;
1907 $$->u.variant.name = $1;
1908 if ($3 && set_parent_node($3, $$))
1909 reparent_error(scanner, "variant reparent error");
1910 }
1911 | IDENTIFIER LT IDENTIFIER GT variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1912 {
1913 $$ = make_node(scanner, NODE_VARIANT);
1914 $$->u.variant.has_body = 1;
1915 $$->u.variant.name = $1;
1916 $$->u.variant.choice = $3;
1917 if ($6 && set_parent_node($6, $$))
1918 reparent_error(scanner, "variant reparent error");
1919 }
1920 | IDENTIFIER LT IDENTIFIER GT
1921 {
1922 $$ = make_node(scanner, NODE_VARIANT);
1923 $$->u.variant.has_body = 0;
1924 $$->u.variant.name = $1;
1925 $$->u.variant.choice = $3;
1926 }
1927 | IDENTIFIER LT ID_TYPE GT variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1928 {
1929 $$ = make_node(scanner, NODE_VARIANT);
1930 $$->u.variant.has_body = 1;
1931 $$->u.variant.name = $1;
1932 $$->u.variant.choice = $3;
1933 if ($6 && set_parent_node($6, $$))
1934 reparent_error(scanner, "variant reparent error");
1935 }
1936 | IDENTIFIER LT ID_TYPE GT
1937 {
1938 $$ = make_node(scanner, NODE_VARIANT);
1939 $$->u.variant.has_body = 0;
1940 $$->u.variant.name = $1;
1941 $$->u.variant.choice = $3;
1942 }
1943 | ID_TYPE variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1944 {
1945 $$ = make_node(scanner, NODE_VARIANT);
1946 $$->u.variant.has_body = 1;
1947 $$->u.variant.name = $1;
1948 if ($3 && set_parent_node($3, $$))
1949 reparent_error(scanner, "variant reparent error");
1950 }
1951 | ID_TYPE LT IDENTIFIER GT variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1952 {
1953 $$ = make_node(scanner, NODE_VARIANT);
1954 $$->u.variant.has_body = 1;
1955 $$->u.variant.name = $1;
1956 $$->u.variant.choice = $3;
1957 if ($6 && set_parent_node($6, $$))
1958 reparent_error(scanner, "variant reparent error");
1959 }
1960 | ID_TYPE LT IDENTIFIER GT
1961 {
1962 $$ = make_node(scanner, NODE_VARIANT);
1963 $$->u.variant.has_body = 0;
1964 $$->u.variant.name = $1;
1965 $$->u.variant.choice = $3;
1966 }
1967 | ID_TYPE LT ID_TYPE GT variant_declaration_begin struct_or_variant_declaration_list variant_declaration_end
1968 {
1969 $$ = make_node(scanner, NODE_VARIANT);
1970 $$->u.variant.has_body = 1;
1971 $$->u.variant.name = $1;
1972 $$->u.variant.choice = $3;
1973 if ($6 && set_parent_node($6, $$))
1974 reparent_error(scanner, "variant reparent error");
1975 }
1976 | ID_TYPE LT ID_TYPE GT
1977 {
1978 $$ = make_node(scanner, NODE_VARIANT);
1979 $$->u.variant.has_body = 0;
1980 $$->u.variant.name = $1;
1981 $$->u.variant.choice = $3;
1982 }
1983 ;
1984
1985 variant_declaration_begin:
1986 LBRAC
1987 { push_scope(scanner); }
1988 ;
1989
1990 variant_declaration_end:
1991 RBRAC
1992 { pop_scope(scanner); }
1993 ;
1994
1995 enum_type_specifier:
1996 LBRAC enumerator_list RBRAC
1997 {
1998 $$ = make_node(scanner, NODE_ENUM);
1999 $$->u._enum.has_body = 1;
2000 _bt_list_splice_tail(&($2)->tmp_head, &($$)->u._enum.enumerator_list);
2001 }
2002 | COLON integer_declaration_specifiers LBRAC enumerator_list RBRAC
2003 {
2004 $$ = make_node(scanner, NODE_ENUM);
2005 $$->u._enum.has_body = 1;
2006 ($$)->u._enum.container_type = $2;
2007 _bt_list_splice_tail(&($4)->tmp_head, &($$)->u._enum.enumerator_list);
2008 }
2009 | IDENTIFIER LBRAC enumerator_list RBRAC
2010 {
2011 $$ = make_node(scanner, NODE_ENUM);
2012 $$->u._enum.has_body = 1;
2013 $$->u._enum.enum_id = $1;
2014 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._enum.enumerator_list);
2015 }
2016 | IDENTIFIER COLON integer_declaration_specifiers LBRAC enumerator_list RBRAC
2017 {
2018 $$ = make_node(scanner, NODE_ENUM);
2019 $$->u._enum.has_body = 1;
2020 $$->u._enum.enum_id = $1;
2021 ($$)->u._enum.container_type = $3;
2022 _bt_list_splice_tail(&($5)->tmp_head, &($$)->u._enum.enumerator_list);
2023 }
2024 | ID_TYPE LBRAC enumerator_list RBRAC
2025 {
2026 $$ = make_node(scanner, NODE_ENUM);
2027 $$->u._enum.has_body = 1;
2028 $$->u._enum.enum_id = $1;
2029 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._enum.enumerator_list);
2030 }
2031 | ID_TYPE COLON integer_declaration_specifiers LBRAC enumerator_list RBRAC
2032 {
2033 $$ = make_node(scanner, NODE_ENUM);
2034 $$->u._enum.has_body = 1;
2035 $$->u._enum.enum_id = $1;
2036 ($$)->u._enum.container_type = $3;
2037 _bt_list_splice_tail(&($5)->tmp_head, &($$)->u._enum.enumerator_list);
2038 }
2039 | LBRAC enumerator_list COMMA RBRAC
2040 {
2041 $$ = make_node(scanner, NODE_ENUM);
2042 $$->u._enum.has_body = 1;
2043 _bt_list_splice_tail(&($2)->tmp_head, &($$)->u._enum.enumerator_list);
2044 }
2045 | COLON integer_declaration_specifiers LBRAC enumerator_list COMMA RBRAC
2046 {
2047 $$ = make_node(scanner, NODE_ENUM);
2048 $$->u._enum.has_body = 1;
2049 ($$)->u._enum.container_type = $2;
2050 _bt_list_splice_tail(&($4)->tmp_head, &($$)->u._enum.enumerator_list);
2051 }
2052 | IDENTIFIER LBRAC enumerator_list COMMA RBRAC
2053 {
2054 $$ = make_node(scanner, NODE_ENUM);
2055 $$->u._enum.has_body = 1;
2056 $$->u._enum.enum_id = $1;
2057 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._enum.enumerator_list);
2058 }
2059 | IDENTIFIER COLON integer_declaration_specifiers LBRAC enumerator_list COMMA RBRAC
2060 {
2061 $$ = make_node(scanner, NODE_ENUM);
2062 $$->u._enum.has_body = 1;
2063 $$->u._enum.enum_id = $1;
2064 ($$)->u._enum.container_type = $3;
2065 _bt_list_splice_tail(&($5)->tmp_head, &($$)->u._enum.enumerator_list);
2066 }
2067 | IDENTIFIER
2068 {
2069 $$ = make_node(scanner, NODE_ENUM);
2070 $$->u._enum.has_body = 0;
2071 $$->u._enum.enum_id = $1;
2072 }
2073 | ID_TYPE LBRAC enumerator_list COMMA RBRAC
2074 {
2075 $$ = make_node(scanner, NODE_ENUM);
2076 $$->u._enum.has_body = 1;
2077 $$->u._enum.enum_id = $1;
2078 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._enum.enumerator_list);
2079 }
2080 | ID_TYPE COLON integer_declaration_specifiers LBRAC enumerator_list COMMA RBRAC
2081 {
2082 $$ = make_node(scanner, NODE_ENUM);
2083 $$->u._enum.has_body = 1;
2084 $$->u._enum.enum_id = $1;
2085 ($$)->u._enum.container_type = $3;
2086 _bt_list_splice_tail(&($5)->tmp_head, &($$)->u._enum.enumerator_list);
2087 }
2088 | ID_TYPE
2089 {
2090 $$ = make_node(scanner, NODE_ENUM);
2091 $$->u._enum.has_body = 0;
2092 $$->u._enum.enum_id = $1;
2093 }
2094 ;
2095
2096 struct_or_variant_declaration_list:
2097 /* empty */
2098 { $$ = NULL; }
2099 | struct_or_variant_declaration_list struct_or_variant_declaration
2100 {
2101 if ($1) {
2102 $$ = $1;
2103 bt_list_add_tail(&($2)->siblings, &($$)->tmp_head);
2104 } else {
2105 $$ = $2;
2106 bt_list_add_tail(&($$)->siblings, &($$)->tmp_head);
2107 }
2108 }
2109 ;
2110
2111 struct_or_variant_declaration:
2112 declaration_specifiers struct_or_variant_declarator_list SEMICOLON
2113 {
2114 struct ctf_node *list;
2115
2116 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2117 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2118 $$ = make_node(scanner, NODE_STRUCT_OR_VARIANT_DECLARATION);
2119 ($$)->u.struct_or_variant_declaration.type_specifier_list = list;
2120 _bt_list_splice_tail(&($2)->tmp_head, &($$)->u.struct_or_variant_declaration.type_declarators);
2121 }
2122 | declaration_specifiers TYPEDEF declaration_specifiers type_declarator_list SEMICOLON
2123 {
2124 struct ctf_node *list;
2125
2126 $$ = make_node(scanner, NODE_TYPEDEF);
2127 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2128 $$->u._typedef.type_specifier_list = list;
2129 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2130 _bt_list_splice_tail(&($3)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2131 _bt_list_splice_tail(&($4)->tmp_head, &($$)->u._typedef.type_declarators);
2132 }
2133 | TYPEDEF declaration_specifiers type_declarator_list SEMICOLON
2134 {
2135 struct ctf_node *list;
2136
2137 $$ = make_node(scanner, NODE_TYPEDEF);
2138 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2139 $$->u._typedef.type_specifier_list = list;
2140 _bt_list_splice_tail(&($2)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2141 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._typedef.type_declarators);
2142 }
2143 | declaration_specifiers TYPEDEF type_declarator_list SEMICOLON
2144 {
2145 struct ctf_node *list;
2146
2147 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2148 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2149 $$ = make_node(scanner, NODE_TYPEDEF);
2150 ($$)->u.struct_or_variant_declaration.type_specifier_list = list;
2151 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._typedef.type_declarators);
2152 }
2153 | TYPEALIAS declaration_specifiers abstract_declarator_list TYPEASSIGN alias_declaration_specifiers alias_abstract_declarator_list SEMICOLON
2154 {
2155 struct ctf_node *list;
2156
2157 $$ = make_node(scanner, NODE_TYPEALIAS);
2158 $$->u.typealias.target = make_node(scanner, NODE_TYPEALIAS_TARGET);
2159 $$->u.typealias.alias = make_node(scanner, NODE_TYPEALIAS_ALIAS);
2160
2161 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2162 $$->u.typealias.target->u.typealias_target.type_specifier_list = list;
2163 _bt_list_splice_tail(&($2)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2164 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.typealias.target->u.typealias_target.type_declarators);
2165
2166 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2167 $$->u.typealias.alias->u.typealias_alias.type_specifier_list = list;
2168 _bt_list_splice_tail(&($5)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2169 _bt_list_splice_tail(&($6)->tmp_head, &($$)->u.typealias.alias->u.typealias_alias.type_declarators);
2170 }
2171 ;
2172
2173 alias_declaration_specifiers:
2174 CONST
2175 {
2176 struct ctf_node *node;
2177
2178 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2179 node = make_node(scanner, NODE_TYPE_SPECIFIER);
2180 node->u.type_specifier.type = TYPESPEC_CONST;
2181 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
2182 }
2183 | type_specifier
2184 {
2185 struct ctf_node *node;
2186
2187 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2188 node = $1;
2189 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
2190 }
2191 | IDENTIFIER
2192 {
2193 struct ctf_node *node;
2194
2195 add_type(scanner, $1);
2196 $$ = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2197 node = make_node(scanner, NODE_TYPE_SPECIFIER);
2198 node->u.type_specifier.type = TYPESPEC_ID_TYPE;
2199 node->u.type_specifier.id_type = yylval.s;
2200 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
2201 }
2202 | alias_declaration_specifiers CONST
2203 {
2204 struct ctf_node *node;
2205
2206 $$ = $1;
2207 node = make_node(scanner, NODE_TYPE_SPECIFIER);
2208 node->u.type_specifier.type = TYPESPEC_CONST;
2209 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
2210 }
2211 | alias_declaration_specifiers type_specifier
2212 {
2213 $$ = $1;
2214 bt_list_add_tail(&($2)->siblings, &($$)->u.type_specifier_list.head);
2215 }
2216 | alias_declaration_specifiers IDENTIFIER
2217 {
2218 struct ctf_node *node;
2219
2220 add_type(scanner, $2);
2221 $$ = $1;
2222 node = make_node(scanner, NODE_TYPE_SPECIFIER);
2223 node->u.type_specifier.type = TYPESPEC_ID_TYPE;
2224 node->u.type_specifier.id_type = yylval.s;
2225 bt_list_add_tail(&node->siblings, &($$)->u.type_specifier_list.head);
2226 }
2227 ;
2228
2229 struct_or_variant_declarator_list:
2230 struct_or_variant_declarator
2231 { $$ = $1; }
2232 | struct_or_variant_declarator_list COMMA struct_or_variant_declarator
2233 {
2234 $$ = $1;
2235 bt_list_add_tail(&($3)->siblings, &($$)->tmp_head);
2236 }
2237 ;
2238
2239 struct_or_variant_declarator:
2240 declarator
2241 { $$ = $1; }
2242 | COLON unary_expression
2243 { $$ = $2; }
2244 | declarator COLON unary_expression
2245 {
2246 $$ = $1;
2247 if (set_parent_node($3, $1))
2248 reparent_error(scanner, "struct_or_variant_declarator");
2249 }
2250 ;
2251
2252 enumerator_list:
2253 enumerator
2254 { $$ = $1; }
2255 | enumerator_list COMMA enumerator
2256 {
2257 $$ = $1;
2258 bt_list_add_tail(&($3)->siblings, &($$)->tmp_head);
2259 }
2260 ;
2261
2262 enumerator:
2263 IDENTIFIER
2264 {
2265 $$ = make_node(scanner, NODE_ENUMERATOR);
2266 $$->u.enumerator.id = $1;
2267 }
2268 | ID_TYPE
2269 {
2270 $$ = make_node(scanner, NODE_ENUMERATOR);
2271 $$->u.enumerator.id = $1;
2272 }
2273 | keywords
2274 {
2275 $$ = make_node(scanner, NODE_ENUMERATOR);
2276 $$->u.enumerator.id = $1;
2277 }
2278 | STRING_LITERAL
2279 {
2280 $$ = make_node(scanner, NODE_ENUMERATOR);
2281 $$->u.enumerator.id = $1;
2282 }
2283 | IDENTIFIER EQUAL unary_expression_or_range
2284 {
2285 $$ = make_node(scanner, NODE_ENUMERATOR);
2286 $$->u.enumerator.id = $1;
2287 bt_list_splice(&($3)->tmp_head, &($$)->u.enumerator.values);
2288 }
2289 | ID_TYPE EQUAL unary_expression_or_range
2290 {
2291 $$ = make_node(scanner, NODE_ENUMERATOR);
2292 $$->u.enumerator.id = $1;
2293 bt_list_splice(&($3)->tmp_head, &($$)->u.enumerator.values);
2294 }
2295 | keywords EQUAL unary_expression_or_range
2296 {
2297 $$ = make_node(scanner, NODE_ENUMERATOR);
2298 $$->u.enumerator.id = $1;
2299 bt_list_splice(&($3)->tmp_head, &($$)->u.enumerator.values);
2300 }
2301 | STRING_LITERAL EQUAL unary_expression_or_range
2302 {
2303 $$ = make_node(scanner, NODE_ENUMERATOR);
2304 $$->u.enumerator.id = $1;
2305 bt_list_splice(&($3)->tmp_head, &($$)->u.enumerator.values);
2306 }
2307 ;
2308
2309 abstract_declarator_list:
2310 abstract_declarator
2311 { $$ = $1; }
2312 | abstract_declarator_list COMMA abstract_declarator
2313 {
2314 $$ = $1;
2315 bt_list_add_tail(&($3)->siblings, &($$)->tmp_head);
2316 }
2317 ;
2318
2319 abstract_declarator:
2320 direct_abstract_declarator
2321 { $$ = $1; }
2322 | pointer direct_abstract_declarator
2323 {
2324 $$ = $2;
2325 bt_list_splice(&($1)->tmp_head, &($$)->u.type_declarator.pointers);
2326 }
2327 ;
2328
2329 direct_abstract_declarator:
2330 /* empty */
2331 {
2332 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2333 $$->u.type_declarator.type = TYPEDEC_ID;
2334 /* id is NULL */
2335 }
2336 | IDENTIFIER
2337 {
2338 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2339 $$->u.type_declarator.type = TYPEDEC_ID;
2340 $$->u.type_declarator.u.id = $1;
2341 }
2342 | LPAREN abstract_declarator RPAREN
2343 {
2344 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2345 $$->u.type_declarator.type = TYPEDEC_NESTED;
2346 $$->u.type_declarator.u.nested.type_declarator = $2;
2347 }
2348 | direct_abstract_declarator LSBRAC unary_expression RSBRAC
2349 {
2350 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2351 $$->u.type_declarator.type = TYPEDEC_NESTED;
2352 $$->u.type_declarator.u.nested.type_declarator = $1;
2353 BT_INIT_LIST_HEAD(&($$)->u.type_declarator.u.nested.length);
2354 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.type_declarator.u.nested.length);
2355 }
2356 | direct_abstract_declarator LSBRAC RSBRAC
2357 {
2358 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2359 $$->u.type_declarator.type = TYPEDEC_NESTED;
2360 $$->u.type_declarator.u.nested.type_declarator = $1;
2361 $$->u.type_declarator.u.nested.abstract_array = 1;
2362 }
2363 ;
2364
2365 alias_abstract_declarator_list:
2366 alias_abstract_declarator
2367 { $$ = $1; }
2368 | alias_abstract_declarator_list COMMA alias_abstract_declarator
2369 {
2370 $$ = $1;
2371 bt_list_add_tail(&($3)->siblings, &($$)->tmp_head);
2372 }
2373 ;
2374
2375 alias_abstract_declarator:
2376 direct_alias_abstract_declarator
2377 { $$ = $1; }
2378 | pointer direct_alias_abstract_declarator
2379 {
2380 $$ = $2;
2381 bt_list_splice(&($1)->tmp_head, &($$)->u.type_declarator.pointers);
2382 }
2383 ;
2384
2385 direct_alias_abstract_declarator:
2386 /* empty */
2387 {
2388 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2389 $$->u.type_declarator.type = TYPEDEC_ID;
2390 /* id is NULL */
2391 }
2392 | LPAREN alias_abstract_declarator RPAREN
2393 {
2394 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2395 $$->u.type_declarator.type = TYPEDEC_NESTED;
2396 $$->u.type_declarator.u.nested.type_declarator = $2;
2397 }
2398 | direct_alias_abstract_declarator LSBRAC unary_expression RSBRAC
2399 {
2400 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2401 $$->u.type_declarator.type = TYPEDEC_NESTED;
2402 $$->u.type_declarator.u.nested.type_declarator = $1;
2403 BT_INIT_LIST_HEAD(&($$)->u.type_declarator.u.nested.length);
2404 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.type_declarator.u.nested.length);
2405 }
2406 | direct_alias_abstract_declarator LSBRAC RSBRAC
2407 {
2408 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2409 $$->u.type_declarator.type = TYPEDEC_NESTED;
2410 $$->u.type_declarator.u.nested.type_declarator = $1;
2411 $$->u.type_declarator.u.nested.abstract_array = 1;
2412 }
2413 ;
2414
2415 declarator:
2416 direct_declarator
2417 { $$ = $1; }
2418 | pointer direct_declarator
2419 {
2420 $$ = $2;
2421 bt_list_splice(&($1)->tmp_head, &($$)->u.type_declarator.pointers);
2422 }
2423 ;
2424
2425 direct_declarator:
2426 IDENTIFIER
2427 {
2428 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2429 $$->u.type_declarator.type = TYPEDEC_ID;
2430 $$->u.type_declarator.u.id = $1;
2431 }
2432 | LPAREN declarator RPAREN
2433 {
2434 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2435 $$->u.type_declarator.type = TYPEDEC_NESTED;
2436 $$->u.type_declarator.u.nested.type_declarator = $2;
2437 }
2438 | direct_declarator LSBRAC unary_expression RSBRAC
2439 {
2440 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2441 $$->u.type_declarator.type = TYPEDEC_NESTED;
2442 $$->u.type_declarator.u.nested.type_declarator = $1;
2443 BT_INIT_LIST_HEAD(&($$)->u.type_declarator.u.nested.length);
2444 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.type_declarator.u.nested.length);
2445 }
2446 ;
2447
2448 type_declarator:
2449 direct_type_declarator
2450 { $$ = $1; }
2451 | pointer direct_type_declarator
2452 {
2453 $$ = $2;
2454 bt_list_splice(&($1)->tmp_head, &($$)->u.type_declarator.pointers);
2455 }
2456 ;
2457
2458 direct_type_declarator:
2459 IDENTIFIER
2460 {
2461 add_type(scanner, $1);
2462 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2463 $$->u.type_declarator.type = TYPEDEC_ID;
2464 $$->u.type_declarator.u.id = $1;
2465 }
2466 | LPAREN type_declarator RPAREN
2467 {
2468 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2469 $$->u.type_declarator.type = TYPEDEC_NESTED;
2470 $$->u.type_declarator.u.nested.type_declarator = $2;
2471 }
2472 | direct_type_declarator LSBRAC unary_expression RSBRAC
2473 {
2474 $$ = make_node(scanner, NODE_TYPE_DECLARATOR);
2475 $$->u.type_declarator.type = TYPEDEC_NESTED;
2476 $$->u.type_declarator.u.nested.type_declarator = $1;
2477 BT_INIT_LIST_HEAD(&($$)->u.type_declarator.u.nested.length);
2478 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.type_declarator.u.nested.length);
2479 }
2480 ;
2481
2482 pointer:
2483 STAR
2484 {
2485 $$ = make_node(scanner, NODE_POINTER);
2486 }
2487 | STAR pointer
2488 {
2489 $$ = make_node(scanner, NODE_POINTER);
2490 bt_list_splice(&($2)->tmp_head, &($$)->tmp_head);
2491 }
2492 | STAR type_qualifier_list pointer
2493 {
2494 $$ = make_node(scanner, NODE_POINTER);
2495 $$->u.pointer.const_qualifier = 1;
2496 bt_list_splice(&($3)->tmp_head, &($$)->tmp_head);
2497 }
2498 ;
2499
2500 type_qualifier_list:
2501 /* pointer assumes only const type qualifier */
2502 CONST
2503 | type_qualifier_list CONST
2504 ;
2505
2506 /* 2.3: CTF-specific declarations */
2507
2508 ctf_assignment_expression_list:
2509 ctf_assignment_expression SEMICOLON
2510 { $$ = $1; }
2511 | ctf_assignment_expression_list ctf_assignment_expression SEMICOLON
2512 {
2513 $$ = $1;
2514 bt_list_add_tail(&($2)->siblings, &($$)->tmp_head);
2515 }
2516 ;
2517
2518 ctf_assignment_expression:
2519 unary_expression EQUAL unary_expression
2520 {
2521 /*
2522 * Because we have left and right, cannot use
2523 * set_parent_node.
2524 */
2525 $$ = make_node(scanner, NODE_CTF_EXPRESSION);
2526 _bt_list_splice_tail(&($1)->tmp_head, &($$)->u.ctf_expression.left);
2527 if ($1->u.unary_expression.type != UNARY_STRING)
2528 reparent_error(scanner, "ctf_assignment_expression left expects string");
2529 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.ctf_expression.right);
2530 }
2531 | unary_expression TYPEASSIGN declaration_specifiers /* Only allow struct */
2532 {
2533 /*
2534 * Because we have left and right, cannot use
2535 * set_parent_node.
2536 */
2537 $$ = make_node(scanner, NODE_CTF_EXPRESSION);
2538 _bt_list_splice_tail(&($1)->tmp_head, &($$)->u.ctf_expression.left);
2539 if ($1->u.unary_expression.type != UNARY_STRING)
2540 reparent_error(scanner, "ctf_assignment_expression left expects string");
2541 bt_list_add_tail(&($3)->siblings, &($$)->u.ctf_expression.right);
2542 }
2543 | declaration_specifiers TYPEDEF declaration_specifiers type_declarator_list
2544 {
2545 struct ctf_node *list;
2546
2547 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2548 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2549 _bt_list_splice_tail(&($3)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2550 $$ = make_node(scanner, NODE_TYPEDEF);
2551 ($$)->u.struct_or_variant_declaration.type_specifier_list = list;
2552 _bt_list_splice_tail(&($4)->tmp_head, &($$)->u._typedef.type_declarators);
2553 }
2554 | TYPEDEF declaration_specifiers type_declarator_list
2555 {
2556 struct ctf_node *list;
2557
2558 $$ = make_node(scanner, NODE_TYPEDEF);
2559 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2560 $$->u._typedef.type_specifier_list = list;
2561 _bt_list_splice_tail(&($2)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2562 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._typedef.type_declarators);
2563 }
2564 | declaration_specifiers TYPEDEF type_declarator_list
2565 {
2566 struct ctf_node *list;
2567
2568 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2569 _bt_list_splice_tail(&($1)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2570 $$ = make_node(scanner, NODE_TYPEDEF);
2571 ($$)->u.struct_or_variant_declaration.type_specifier_list = list;
2572 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u._typedef.type_declarators);
2573 }
2574 | TYPEALIAS declaration_specifiers abstract_declarator_list TYPEASSIGN alias_declaration_specifiers alias_abstract_declarator_list
2575 {
2576 struct ctf_node *list;
2577
2578 $$ = make_node(scanner, NODE_TYPEALIAS);
2579 $$->u.typealias.target = make_node(scanner, NODE_TYPEALIAS_TARGET);
2580 $$->u.typealias.alias = make_node(scanner, NODE_TYPEALIAS_ALIAS);
2581
2582 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2583 $$->u.typealias.target->u.typealias_target.type_specifier_list = list;
2584 _bt_list_splice_tail(&($2)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2585 _bt_list_splice_tail(&($3)->tmp_head, &($$)->u.typealias.target->u.typealias_target.type_declarators);
2586
2587 list = make_node(scanner, NODE_TYPE_SPECIFIER_LIST);
2588 $$->u.typealias.alias->u.typealias_alias.type_specifier_list = list;
2589 _bt_list_splice_tail(&($5)->u.type_specifier_list.head, &list->u.type_specifier_list.head);
2590 _bt_list_splice_tail(&($6)->tmp_head, &($$)->u.typealias.alias->u.typealias_alias.type_declarators);
2591 }
2592 ;
This page took 0.114453 seconds and 5 git commands to generate.