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