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