7 #include "diagnostic.h"
8 #include "format_check.h"
14 #include "type_hash.h"
16 #include "lang_features.h"
18 #include "adt/bitfiddle.h"
19 #include "adt/error.h"
20 #include "adt/array.h"
22 //#define PRINT_TOKENS
23 #define MAX_LOOKAHEAD 2
26 declaration_t *old_declaration;
28 unsigned short namespc;
31 typedef struct declaration_specifiers_t declaration_specifiers_t;
32 struct declaration_specifiers_t {
33 source_position_t source_position;
34 unsigned char storage_class;
36 decl_modifiers_t decl_modifiers;
40 typedef declaration_t* (*parsed_declaration_func) (declaration_t *declaration);
43 static token_t lookahead_buffer[MAX_LOOKAHEAD];
44 static int lookahead_bufpos;
45 static stack_entry_t *environment_stack = NULL;
46 static stack_entry_t *label_stack = NULL;
47 static context_t *global_context = NULL;
48 static context_t *context = NULL;
49 static declaration_t *last_declaration = NULL;
50 static declaration_t *current_function = NULL;
51 static switch_statement_t *current_switch = NULL;
52 static statement_t *current_loop = NULL;
53 static goto_statement_t *goto_first = NULL;
54 static goto_statement_t *goto_last = NULL;
55 static struct obstack temp_obst;
57 /** The current source position. */
58 #define HERE token.source_position
60 static type_t *type_valist;
62 static statement_t *parse_compound_statement(void);
63 static statement_t *parse_statement(void);
65 static expression_t *parse_sub_expression(unsigned precedence);
66 static expression_t *parse_expression(void);
67 static type_t *parse_typename(void);
69 static void parse_compound_type_entries(void);
70 static declaration_t *parse_declarator(
71 const declaration_specifiers_t *specifiers, bool may_be_abstract);
72 static declaration_t *record_declaration(declaration_t *declaration);
74 static void semantic_comparison(binary_expression_t *expression);
76 #define STORAGE_CLASSES \
83 #define TYPE_QUALIFIERS \
90 #ifdef PROVIDE_COMPLEX
91 #define COMPLEX_SPECIFIERS \
93 #define IMAGINARY_SPECIFIERS \
96 #define COMPLEX_SPECIFIERS
97 #define IMAGINARY_SPECIFIERS
100 #define TYPE_SPECIFIERS \
115 case T___builtin_va_list: \
119 #define DECLARATION_START \
124 #define TYPENAME_START \
129 * Allocate an AST node with given size and
130 * initialize all fields with zero.
132 static void *allocate_ast_zero(size_t size)
134 void *res = allocate_ast(size);
135 memset(res, 0, size);
139 static declaration_t *allocate_declaration_zero(void)
141 declaration_t *declaration = allocate_ast_zero(sizeof(*allocate_declaration_zero()));
142 declaration->type = type_error_type;
147 * Returns the size of a statement node.
149 * @param kind the statement kind
151 static size_t get_statement_struct_size(statement_kind_t kind)
153 static const size_t sizes[] = {
154 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
155 [STATEMENT_RETURN] = sizeof(return_statement_t),
156 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
157 [STATEMENT_IF] = sizeof(if_statement_t),
158 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
159 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
160 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
161 [STATEMENT_BREAK] = sizeof(statement_base_t),
162 [STATEMENT_GOTO] = sizeof(goto_statement_t),
163 [STATEMENT_LABEL] = sizeof(label_statement_t),
164 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
165 [STATEMENT_WHILE] = sizeof(while_statement_t),
166 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
167 [STATEMENT_FOR] = sizeof(for_statement_t),
168 [STATEMENT_ASM] = sizeof(asm_statement_t)
170 assert(kind <= sizeof(sizes) / sizeof(sizes[0]));
171 assert(sizes[kind] != 0);
176 * Allocate a statement node of given kind and initialize all
179 static statement_t *allocate_statement_zero(statement_kind_t kind)
181 size_t size = get_statement_struct_size(kind);
182 statement_t *res = allocate_ast_zero(size);
184 res->base.kind = kind;
189 * Returns the size of an expression node.
191 * @param kind the expression kind
193 static size_t get_expression_struct_size(expression_kind_t kind)
195 static const size_t sizes[] = {
196 [EXPR_INVALID] = sizeof(expression_base_t),
197 [EXPR_REFERENCE] = sizeof(reference_expression_t),
198 [EXPR_CONST] = sizeof(const_expression_t),
199 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
200 [EXPR_WIDE_STRING_LITERAL] = sizeof(wide_string_literal_expression_t),
201 [EXPR_CALL] = sizeof(call_expression_t),
202 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
203 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
204 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
205 [EXPR_SELECT] = sizeof(select_expression_t),
206 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
207 [EXPR_SIZEOF] = sizeof(sizeof_expression_t),
208 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
209 [EXPR_FUNCTION] = sizeof(string_literal_expression_t),
210 [EXPR_PRETTY_FUNCTION] = sizeof(string_literal_expression_t),
211 [EXPR_BUILTIN_SYMBOL] = sizeof(builtin_symbol_expression_t),
212 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
213 [EXPR_BUILTIN_PREFETCH] = sizeof(builtin_prefetch_expression_t),
214 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
215 [EXPR_VA_START] = sizeof(va_start_expression_t),
216 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
217 [EXPR_STATEMENT] = sizeof(statement_expression_t),
219 if(kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
220 return sizes[EXPR_UNARY_FIRST];
222 if(kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
223 return sizes[EXPR_BINARY_FIRST];
225 assert(kind <= sizeof(sizes) / sizeof(sizes[0]));
226 assert(sizes[kind] != 0);
231 * Allocate an expression node of given kind and initialize all
234 static expression_t *allocate_expression_zero(expression_kind_t kind)
236 size_t size = get_expression_struct_size(kind);
237 expression_t *res = allocate_ast_zero(size);
239 res->base.kind = kind;
240 res->base.datatype = type_error_type;
245 * Returns the size of a type node.
247 * @param kind the type kind
249 static size_t get_type_struct_size(type_kind_t kind)
251 static const size_t sizes[] = {
252 [TYPE_ATOMIC] = sizeof(atomic_type_t),
253 [TYPE_BITFIELD] = sizeof(bitfield_type_t),
254 [TYPE_COMPOUND_STRUCT] = sizeof(compound_type_t),
255 [TYPE_COMPOUND_UNION] = sizeof(compound_type_t),
256 [TYPE_ENUM] = sizeof(enum_type_t),
257 [TYPE_FUNCTION] = sizeof(function_type_t),
258 [TYPE_POINTER] = sizeof(pointer_type_t),
259 [TYPE_ARRAY] = sizeof(array_type_t),
260 [TYPE_BUILTIN] = sizeof(builtin_type_t),
261 [TYPE_TYPEDEF] = sizeof(typedef_type_t),
262 [TYPE_TYPEOF] = sizeof(typeof_type_t),
264 assert(sizeof(sizes) / sizeof(sizes[0]) == (int) TYPE_TYPEOF + 1);
265 assert(kind <= TYPE_TYPEOF);
266 assert(sizes[kind] != 0);
271 * Allocate a type node of given kind and initialize all
274 static type_t *allocate_type_zero(type_kind_t kind)
276 size_t size = get_type_struct_size(kind);
277 type_t *res = obstack_alloc(type_obst, size);
278 memset(res, 0, size);
280 res->base.kind = kind;
285 * Returns the size of an initializer node.
287 * @param kind the initializer kind
289 static size_t get_initializer_size(initializer_kind_t kind)
291 static const size_t sizes[] = {
292 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
293 [INITIALIZER_STRING] = sizeof(initializer_string_t),
294 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
295 [INITIALIZER_LIST] = sizeof(initializer_list_t)
297 assert(kind < sizeof(sizes) / sizeof(*sizes));
298 assert(sizes[kind] != 0);
303 * Allocate an initializer node of given kind and initialize all
306 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
308 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
315 * Free a type from the type obstack.
317 static void free_type(void *type)
319 obstack_free(type_obst, type);
323 * Returns the index of the top element of the environment stack.
325 static size_t environment_top(void)
327 return ARR_LEN(environment_stack);
331 * Returns the index of the top element of the label stack.
333 static size_t label_top(void)
335 return ARR_LEN(label_stack);
340 * Return the next token.
342 static inline void next_token(void)
344 token = lookahead_buffer[lookahead_bufpos];
345 lookahead_buffer[lookahead_bufpos] = lexer_token;
348 lookahead_bufpos = (lookahead_bufpos+1) % MAX_LOOKAHEAD;
351 print_token(stderr, &token);
352 fprintf(stderr, "\n");
357 * Return the next token with a given lookahead.
359 static inline const token_t *look_ahead(int num)
361 assert(num > 0 && num <= MAX_LOOKAHEAD);
362 int pos = (lookahead_bufpos+num-1) % MAX_LOOKAHEAD;
363 return &lookahead_buffer[pos];
366 #define eat(token_type) do { assert(token.type == token_type); next_token(); } while(0)
369 * Report a parse error because an expected token was not found.
371 static void parse_error_expected(const char *message, ...)
373 if(message != NULL) {
374 errorf(HERE, "%s", message);
377 va_start(ap, message);
378 errorf(HERE, "got '%K', expected %#k", &token, &ap, ", ");
383 * Report a type error.
385 static void type_error(const char *msg, const source_position_t source_position,
388 errorf(source_position, "%s, but found type '%T'", msg, type);
392 * Report an incompatible type.
394 static void type_error_incompatible(const char *msg,
395 const source_position_t source_position, type_t *type1, type_t *type2)
397 errorf(source_position, "%s, incompatible types: '%T' - '%T'", msg, type1, type2);
401 * Eat an complete block, ie. '{ ... }'.
403 static void eat_block(void)
405 if(token.type == '{')
408 while(token.type != '}') {
409 if(token.type == T_EOF)
411 if(token.type == '{') {
421 * Eat a statement until an ';' token.
423 static void eat_statement(void)
425 while(token.type != ';') {
426 if(token.type == T_EOF)
428 if(token.type == '}')
430 if(token.type == '{') {
440 * Eat a parenthesed term, ie. '( ... )'.
442 static void eat_paren(void)
444 if(token.type == '(')
447 while(token.type != ')') {
448 if(token.type == T_EOF)
450 if(token.type == ')' || token.type == ';' || token.type == '}') {
453 if(token.type == '(') {
457 if(token.type == '{') {
466 #define expect(expected) \
467 if(UNLIKELY(token.type != (expected))) { \
468 parse_error_expected(NULL, (expected), 0); \
474 #define expect_block(expected) \
475 if(UNLIKELY(token.type != (expected))) { \
476 parse_error_expected(NULL, (expected), 0); \
482 #define expect_void(expected) \
483 if(UNLIKELY(token.type != (expected))) { \
484 parse_error_expected(NULL, (expected), 0); \
490 static void set_context(context_t *new_context)
492 context = new_context;
494 last_declaration = new_context->declarations;
495 if(last_declaration != NULL) {
496 while(last_declaration->next != NULL) {
497 last_declaration = last_declaration->next;
503 * Search a symbol in a given namespace and returns its declaration or
504 * NULL if this symbol was not found.
506 static declaration_t *get_declaration(const symbol_t *const symbol, const namespace_t namespc)
508 declaration_t *declaration = symbol->declaration;
509 for( ; declaration != NULL; declaration = declaration->symbol_next) {
510 if(declaration->namespc == namespc)
518 * pushs an environment_entry on the environment stack and links the
519 * corresponding symbol to the new entry
521 static void stack_push(stack_entry_t **stack_ptr, declaration_t *declaration)
523 symbol_t *symbol = declaration->symbol;
524 namespace_t namespc = (namespace_t)declaration->namespc;
526 /* remember old declaration */
528 entry.symbol = symbol;
529 entry.old_declaration = symbol->declaration;
530 entry.namespc = (unsigned short) namespc;
531 ARR_APP1(stack_entry_t, *stack_ptr, entry);
533 /* replace/add declaration into declaration list of the symbol */
534 if(symbol->declaration == NULL) {
535 symbol->declaration = declaration;
537 declaration_t *iter_last = NULL;
538 declaration_t *iter = symbol->declaration;
539 for( ; iter != NULL; iter_last = iter, iter = iter->symbol_next) {
540 /* replace an entry? */
541 if(iter->namespc == namespc) {
542 if(iter_last == NULL) {
543 symbol->declaration = declaration;
545 iter_last->symbol_next = declaration;
547 declaration->symbol_next = iter->symbol_next;
552 assert(iter_last->symbol_next == NULL);
553 iter_last->symbol_next = declaration;
558 static void environment_push(declaration_t *declaration)
560 assert(declaration->source_position.input_name != NULL);
561 assert(declaration->parent_context != NULL);
562 stack_push(&environment_stack, declaration);
565 static void label_push(declaration_t *declaration)
567 declaration->parent_context = ¤t_function->context;
568 stack_push(&label_stack, declaration);
572 * pops symbols from the environment stack until @p new_top is the top element
574 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
576 stack_entry_t *stack = *stack_ptr;
577 size_t top = ARR_LEN(stack);
580 assert(new_top <= top);
584 for(i = top; i > new_top; --i) {
585 stack_entry_t *entry = &stack[i - 1];
587 declaration_t *old_declaration = entry->old_declaration;
588 symbol_t *symbol = entry->symbol;
589 namespace_t namespc = (namespace_t)entry->namespc;
591 /* replace/remove declaration */
592 declaration_t *declaration = symbol->declaration;
593 assert(declaration != NULL);
594 if(declaration->namespc == namespc) {
595 if(old_declaration == NULL) {
596 symbol->declaration = declaration->symbol_next;
598 symbol->declaration = old_declaration;
601 declaration_t *iter_last = declaration;
602 declaration_t *iter = declaration->symbol_next;
603 for( ; iter != NULL; iter_last = iter, iter = iter->symbol_next) {
604 /* replace an entry? */
605 if(iter->namespc == namespc) {
606 assert(iter_last != NULL);
607 iter_last->symbol_next = old_declaration;
608 old_declaration->symbol_next = iter->symbol_next;
612 assert(iter != NULL);
616 ARR_SHRINKLEN(*stack_ptr, (int) new_top);
619 static void environment_pop_to(size_t new_top)
621 stack_pop_to(&environment_stack, new_top);
624 static void label_pop_to(size_t new_top)
626 stack_pop_to(&label_stack, new_top);
630 static int get_rank(const type_t *type)
632 assert(!is_typeref(type));
633 /* The C-standard allows promoting to int or unsigned int (see § 7.2.2
634 * and esp. footnote 108). However we can't fold constants (yet), so we
635 * can't decide whether unsigned int is possible, while int always works.
636 * (unsigned int would be preferable when possible... for stuff like
637 * struct { enum { ... } bla : 4; } ) */
638 if(type->kind == TYPE_ENUM)
639 return ATOMIC_TYPE_INT;
641 assert(type->kind == TYPE_ATOMIC);
642 return type->atomic.akind;
645 static type_t *promote_integer(type_t *type)
647 if(type->kind == TYPE_BITFIELD)
648 type = type->bitfield.base;
650 if(get_rank(type) < ATOMIC_TYPE_INT)
657 * Create a cast expression.
659 * @param expression the expression to cast
660 * @param dest_type the destination type
662 static expression_t *create_cast_expression(expression_t *expression,
665 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST_IMPLICIT);
667 cast->unary.value = expression;
668 cast->base.datatype = dest_type;
674 * Check if a given expression represents the 0 pointer constant.
676 static bool is_null_pointer_constant(const expression_t *expression)
678 /* skip void* cast */
679 if(expression->kind == EXPR_UNARY_CAST
680 || expression->kind == EXPR_UNARY_CAST_IMPLICIT) {
681 expression = expression->unary.value;
684 /* TODO: not correct yet, should be any constant integer expression
685 * which evaluates to 0 */
686 if (expression->kind != EXPR_CONST)
689 type_t *const type = skip_typeref(expression->base.datatype);
690 if (!is_type_integer(type))
693 return expression->conste.v.int_value == 0;
697 * Create an implicit cast expression.
699 * @param expression the expression to cast
700 * @param dest_type the destination type
702 static expression_t *create_implicit_cast(expression_t *expression,
705 type_t *const source_type = expression->base.datatype;
707 if (source_type == dest_type)
710 return create_cast_expression(expression, dest_type);
713 /** Implements the rules from § 6.5.16.1 */
714 static type_t *semantic_assign(type_t *orig_type_left,
715 const expression_t *const right,
718 type_t *const orig_type_right = right->base.datatype;
719 type_t *const type_left = skip_typeref(orig_type_left);
720 type_t *const type_right = skip_typeref(orig_type_right);
722 if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
723 (is_type_pointer(type_left) && is_null_pointer_constant(right)) ||
724 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
725 && is_type_pointer(type_right))) {
726 return orig_type_left;
729 if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
730 type_t *points_to_left = skip_typeref(type_left->pointer.points_to);
731 type_t *points_to_right = skip_typeref(type_right->pointer.points_to);
733 /* the left type has all qualifiers from the right type */
734 unsigned missing_qualifiers
735 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
736 if(missing_qualifiers != 0) {
737 errorf(HERE, "destination type '%T' in %s from type '%T' lacks qualifiers '%Q' in pointed-to type", type_left, context, type_right, missing_qualifiers);
738 return orig_type_left;
741 points_to_left = get_unqualified_type(points_to_left);
742 points_to_right = get_unqualified_type(points_to_right);
744 if(!is_type_atomic(points_to_left, ATOMIC_TYPE_VOID)
745 && !is_type_atomic(points_to_right, ATOMIC_TYPE_VOID)
746 && !types_compatible(points_to_left, points_to_right)) {
750 return orig_type_left;
753 if (is_type_compound(type_left) && is_type_compound(type_right)) {
754 type_t *const unqual_type_left = get_unqualified_type(type_left);
755 type_t *const unqual_type_right = get_unqualified_type(type_right);
756 if (types_compatible(unqual_type_left, unqual_type_right)) {
757 return orig_type_left;
761 if (!is_type_valid(type_left))
764 if (!is_type_valid(type_right))
765 return orig_type_right;
770 static expression_t *parse_constant_expression(void)
772 /* start parsing at precedence 7 (conditional expression) */
773 expression_t *result = parse_sub_expression(7);
775 if(!is_constant_expression(result)) {
776 errorf(result->base.source_position, "expression '%E' is not constant\n", result);
782 static expression_t *parse_assignment_expression(void)
784 /* start parsing at precedence 2 (assignment expression) */
785 return parse_sub_expression(2);
788 static type_t *make_global_typedef(const char *name, type_t *type)
790 symbol_t *const symbol = symbol_table_insert(name);
792 declaration_t *const declaration = allocate_declaration_zero();
793 declaration->namespc = NAMESPACE_NORMAL;
794 declaration->storage_class = STORAGE_CLASS_TYPEDEF;
795 declaration->type = type;
796 declaration->symbol = symbol;
797 declaration->source_position = builtin_source_position;
799 record_declaration(declaration);
801 type_t *typedef_type = allocate_type_zero(TYPE_TYPEDEF);
802 typedef_type->typedeft.declaration = declaration;
807 static string_t parse_string_literals(void)
809 assert(token.type == T_STRING_LITERAL);
810 string_t result = token.v.string;
814 while (token.type == T_STRING_LITERAL) {
815 result = concat_strings(&result, &token.v.string);
822 static void parse_attributes(void)
826 case T___attribute__: {
834 errorf(HERE, "EOF while parsing attribute");
853 if(token.type != T_STRING_LITERAL) {
854 parse_error_expected("while parsing assembler attribute",
859 parse_string_literals();
864 goto attributes_finished;
873 static designator_t *parse_designation(void)
875 if(token.type != '[' && token.type != '.')
878 designator_t *result = NULL;
879 designator_t *last = NULL;
882 designator_t *designator;
885 designator = allocate_ast_zero(sizeof(designator[0]));
887 designator->array_access = parse_constant_expression();
891 designator = allocate_ast_zero(sizeof(designator[0]));
893 if(token.type != T_IDENTIFIER) {
894 parse_error_expected("while parsing designator",
898 designator->symbol = token.v.symbol;
906 assert(designator != NULL);
908 last->next = designator;
917 static initializer_t *initializer_from_string(array_type_t *type,
918 const string_t *const string)
920 /* TODO: check len vs. size of array type */
923 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
924 initializer->string.string = *string;
929 static initializer_t *initializer_from_wide_string(array_type_t *const type,
930 wide_string_t *const string)
932 /* TODO: check len vs. size of array type */
935 initializer_t *const initializer =
936 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
937 initializer->wide_string.string = *string;
942 static initializer_t *initializer_from_expression(type_t *type,
943 expression_t *expression)
945 /* TODO check that expression is a constant expression */
947 /* § 6.7.8.14/15 char array may be initialized by string literals */
948 type_t *const expr_type = expression->base.datatype;
949 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
950 array_type_t *const array_type = &type->array;
951 type_t *const element_type = skip_typeref(array_type->element_type);
953 if (element_type->kind == TYPE_ATOMIC) {
954 switch (expression->kind) {
955 case EXPR_STRING_LITERAL:
956 if (element_type->atomic.akind == ATOMIC_TYPE_CHAR) {
957 return initializer_from_string(array_type,
958 &expression->string.value);
961 case EXPR_WIDE_STRING_LITERAL: {
962 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
963 if (get_unqualified_type(element_type) == bare_wchar_type) {
964 return initializer_from_wide_string(array_type,
965 &expression->wide_string.value);
975 type_t *const res_type = semantic_assign(type, expression, "initializer");
976 if (res_type == NULL)
979 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
980 result->value.value = create_implicit_cast(expression, res_type);
985 static initializer_t *parse_sub_initializer(type_t *type,
986 expression_t *expression);
988 static initializer_t *parse_sub_initializer_elem(type_t *type)
990 if(token.type == '{') {
991 return parse_sub_initializer(type, NULL);
994 expression_t *expression = parse_assignment_expression();
995 return parse_sub_initializer(type, expression);
998 static bool had_initializer_brace_warning;
1000 static void skip_designator(void)
1003 if(token.type == '.') {
1005 if(token.type == T_IDENTIFIER)
1007 } else if(token.type == '[') {
1009 parse_constant_expression();
1010 if(token.type == ']')
1018 static initializer_t *parse_sub_initializer(type_t *type,
1019 expression_t *expression)
1021 if(is_type_scalar(type)) {
1022 /* there might be extra {} hierarchies */
1023 if(token.type == '{') {
1025 if(!had_initializer_brace_warning) {
1026 warningf(HERE, "braces around scalar initializer");
1027 had_initializer_brace_warning = true;
1029 initializer_t *result = parse_sub_initializer(type, NULL);
1030 if(token.type == ',') {
1032 /* TODO: warn about excessive elements */
1038 if(expression == NULL) {
1039 expression = parse_assignment_expression();
1041 return initializer_from_expression(type, expression);
1044 /* does the expression match the currently looked at object to initialize */
1045 if(expression != NULL) {
1046 initializer_t *result = initializer_from_expression(type, expression);
1051 bool read_paren = false;
1052 if(token.type == '{') {
1057 /* descend into subtype */
1058 initializer_t *result = NULL;
1059 initializer_t **elems;
1060 if(is_type_array(type)) {
1061 if(token.type == '.') {
1063 "compound designator in initializer for array type '%T'",
1068 type_t *const element_type = skip_typeref(type->array.element_type);
1071 had_initializer_brace_warning = false;
1072 if(expression == NULL) {
1073 sub = parse_sub_initializer_elem(element_type);
1075 sub = parse_sub_initializer(element_type, expression);
1078 /* didn't match the subtypes -> try the parent type */
1080 assert(!read_paren);
1084 elems = NEW_ARR_F(initializer_t*, 0);
1085 ARR_APP1(initializer_t*, elems, sub);
1088 if(token.type == '}')
1091 if(token.type == '}')
1094 sub = parse_sub_initializer_elem(element_type);
1096 /* TODO error, do nicer cleanup */
1097 errorf(HERE, "member initializer didn't match");
1101 ARR_APP1(initializer_t*, elems, sub);
1104 assert(is_type_compound(type));
1105 context_t *const context = &type->compound.declaration->context;
1107 if(token.type == '[') {
1109 "array designator in initializer for compound type '%T'",
1114 declaration_t *first = context->declarations;
1117 type_t *first_type = first->type;
1118 first_type = skip_typeref(first_type);
1121 had_initializer_brace_warning = false;
1122 if(expression == NULL) {
1123 sub = parse_sub_initializer_elem(first_type);
1125 sub = parse_sub_initializer(first_type, expression);
1128 /* didn't match the subtypes -> try our parent type */
1130 assert(!read_paren);
1134 elems = NEW_ARR_F(initializer_t*, 0);
1135 ARR_APP1(initializer_t*, elems, sub);
1137 declaration_t *iter = first->next;
1138 for( ; iter != NULL; iter = iter->next) {
1139 if(iter->symbol == NULL)
1141 if(iter->namespc != NAMESPACE_NORMAL)
1144 if(token.type == '}')
1147 if(token.type == '}')
1150 type_t *iter_type = iter->type;
1151 iter_type = skip_typeref(iter_type);
1153 sub = parse_sub_initializer_elem(iter_type);
1155 /* TODO error, do nicer cleanup */
1156 errorf(HERE, "member initializer didn't match");
1160 ARR_APP1(initializer_t*, elems, sub);
1164 int len = ARR_LEN(elems);
1165 size_t elems_size = sizeof(initializer_t*) * len;
1167 initializer_list_t *init = allocate_ast_zero(sizeof(init[0]) + elems_size);
1169 init->initializer.kind = INITIALIZER_LIST;
1171 memcpy(init->initializers, elems, elems_size);
1174 result = (initializer_t*) init;
1177 if(token.type == ',')
1184 static initializer_t *parse_initializer(type_t *const orig_type)
1186 initializer_t *result;
1188 type_t *const type = skip_typeref(orig_type);
1190 if(token.type != '{') {
1191 expression_t *expression = parse_assignment_expression();
1192 initializer_t *initializer = initializer_from_expression(type, expression);
1193 if(initializer == NULL) {
1195 "initializer expression '%E' of type '%T' is incompatible with type '%T'",
1196 expression, expression->base.datatype, orig_type);
1201 if(is_type_scalar(type)) {
1205 expression_t *expression = parse_assignment_expression();
1206 result = initializer_from_expression(type, expression);
1208 if(token.type == ',')
1214 result = parse_sub_initializer(type, NULL);
1220 static declaration_t *append_declaration(declaration_t *declaration);
1222 static declaration_t *parse_compound_type_specifier(bool is_struct)
1230 symbol_t *symbol = NULL;
1231 declaration_t *declaration = NULL;
1233 if (token.type == T___attribute__) {
1238 if(token.type == T_IDENTIFIER) {
1239 symbol = token.v.symbol;
1243 declaration = get_declaration(symbol, NAMESPACE_STRUCT);
1245 declaration = get_declaration(symbol, NAMESPACE_UNION);
1247 } else if(token.type != '{') {
1249 parse_error_expected("while parsing struct type specifier",
1250 T_IDENTIFIER, '{', 0);
1252 parse_error_expected("while parsing union type specifier",
1253 T_IDENTIFIER, '{', 0);
1259 if(declaration == NULL) {
1260 declaration = allocate_declaration_zero();
1261 declaration->namespc =
1262 (is_struct ? NAMESPACE_STRUCT : NAMESPACE_UNION);
1263 declaration->source_position = token.source_position;
1264 declaration->symbol = symbol;
1265 declaration->parent_context = context;
1266 if (symbol != NULL) {
1267 environment_push(declaration);
1269 append_declaration(declaration);
1272 if(token.type == '{') {
1273 if(declaration->init.is_defined) {
1274 assert(symbol != NULL);
1275 errorf(HERE, "multiple definition of '%s %Y'",
1276 is_struct ? "struct" : "union", symbol);
1277 declaration->context.declarations = NULL;
1279 declaration->init.is_defined = true;
1281 int top = environment_top();
1282 context_t *last_context = context;
1283 set_context(&declaration->context);
1285 parse_compound_type_entries();
1288 assert(context == &declaration->context);
1289 set_context(last_context);
1290 environment_pop_to(top);
1296 static void parse_enum_entries(type_t *const enum_type)
1300 if(token.type == '}') {
1302 errorf(HERE, "empty enum not allowed");
1307 if(token.type != T_IDENTIFIER) {
1308 parse_error_expected("while parsing enum entry", T_IDENTIFIER, 0);
1313 declaration_t *const entry = allocate_declaration_zero();
1314 entry->storage_class = STORAGE_CLASS_ENUM_ENTRY;
1315 entry->type = enum_type;
1316 entry->symbol = token.v.symbol;
1317 entry->source_position = token.source_position;
1320 if(token.type == '=') {
1322 entry->init.enum_value = parse_constant_expression();
1327 record_declaration(entry);
1329 if(token.type != ',')
1332 } while(token.type != '}');
1337 static type_t *parse_enum_specifier(void)
1341 declaration_t *declaration;
1344 if(token.type == T_IDENTIFIER) {
1345 symbol = token.v.symbol;
1348 declaration = get_declaration(symbol, NAMESPACE_ENUM);
1349 } else if(token.type != '{') {
1350 parse_error_expected("while parsing enum type specifier",
1351 T_IDENTIFIER, '{', 0);
1358 if(declaration == NULL) {
1359 declaration = allocate_declaration_zero();
1360 declaration->namespc = NAMESPACE_ENUM;
1361 declaration->source_position = token.source_position;
1362 declaration->symbol = symbol;
1363 declaration->parent_context = context;
1366 type_t *const type = allocate_type_zero(TYPE_ENUM);
1367 type->enumt.declaration = declaration;
1369 if(token.type == '{') {
1370 if(declaration->init.is_defined) {
1371 errorf(HERE, "multiple definitions of enum %Y", symbol);
1373 if (symbol != NULL) {
1374 environment_push(declaration);
1376 append_declaration(declaration);
1377 declaration->init.is_defined = 1;
1379 parse_enum_entries(type);
1387 * if a symbol is a typedef to another type, return true
1389 static bool is_typedef_symbol(symbol_t *symbol)
1391 const declaration_t *const declaration =
1392 get_declaration(symbol, NAMESPACE_NORMAL);
1394 declaration != NULL &&
1395 declaration->storage_class == STORAGE_CLASS_TYPEDEF;
1398 static type_t *parse_typeof(void)
1406 expression_t *expression = NULL;
1409 switch(token.type) {
1410 case T___extension__:
1411 /* this can be a prefix to a typename or an expression */
1412 /* we simply eat it now. */
1415 } while(token.type == T___extension__);
1419 if(is_typedef_symbol(token.v.symbol)) {
1420 type = parse_typename();
1422 expression = parse_expression();
1423 type = expression->base.datatype;
1428 type = parse_typename();
1432 expression = parse_expression();
1433 type = expression->base.datatype;
1439 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
1440 typeof_type->typeoft.expression = expression;
1441 typeof_type->typeoft.typeof_type = type;
1447 SPECIFIER_SIGNED = 1 << 0,
1448 SPECIFIER_UNSIGNED = 1 << 1,
1449 SPECIFIER_LONG = 1 << 2,
1450 SPECIFIER_INT = 1 << 3,
1451 SPECIFIER_DOUBLE = 1 << 4,
1452 SPECIFIER_CHAR = 1 << 5,
1453 SPECIFIER_SHORT = 1 << 6,
1454 SPECIFIER_LONG_LONG = 1 << 7,
1455 SPECIFIER_FLOAT = 1 << 8,
1456 SPECIFIER_BOOL = 1 << 9,
1457 SPECIFIER_VOID = 1 << 10,
1458 #ifdef PROVIDE_COMPLEX
1459 SPECIFIER_COMPLEX = 1 << 11,
1460 SPECIFIER_IMAGINARY = 1 << 12,
1464 static type_t *create_builtin_type(symbol_t *const symbol,
1465 type_t *const real_type)
1467 type_t *type = allocate_type_zero(TYPE_BUILTIN);
1468 type->builtin.symbol = symbol;
1469 type->builtin.real_type = real_type;
1471 type_t *result = typehash_insert(type);
1472 if (type != result) {
1479 static type_t *get_typedef_type(symbol_t *symbol)
1481 declaration_t *declaration = get_declaration(symbol, NAMESPACE_NORMAL);
1482 if(declaration == NULL
1483 || declaration->storage_class != STORAGE_CLASS_TYPEDEF)
1486 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
1487 type->typedeft.declaration = declaration;
1492 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
1494 type_t *type = NULL;
1495 unsigned type_qualifiers = 0;
1496 unsigned type_specifiers = 0;
1499 specifiers->source_position = token.source_position;
1502 switch(token.type) {
1505 #define MATCH_STORAGE_CLASS(token, class) \
1507 if(specifiers->storage_class != STORAGE_CLASS_NONE) { \
1508 errorf(HERE, "multiple storage classes in declaration specifiers"); \
1510 specifiers->storage_class = class; \
1514 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
1515 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
1516 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
1517 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
1518 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
1521 switch (specifiers->storage_class) {
1522 case STORAGE_CLASS_NONE:
1523 specifiers->storage_class = STORAGE_CLASS_THREAD;
1526 case STORAGE_CLASS_EXTERN:
1527 specifiers->storage_class = STORAGE_CLASS_THREAD_EXTERN;
1530 case STORAGE_CLASS_STATIC:
1531 specifiers->storage_class = STORAGE_CLASS_THREAD_STATIC;
1535 errorf(HERE, "multiple storage classes in declaration specifiers");
1541 /* type qualifiers */
1542 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
1544 type_qualifiers |= qualifier; \
1548 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
1549 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
1550 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
1552 case T___extension__:
1557 /* type specifiers */
1558 #define MATCH_SPECIFIER(token, specifier, name) \
1561 if(type_specifiers & specifier) { \
1562 errorf(HERE, "multiple " name " type specifiers given"); \
1564 type_specifiers |= specifier; \
1568 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void")
1569 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char")
1570 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short")
1571 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int")
1572 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float")
1573 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double")
1574 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed")
1575 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned")
1576 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool")
1577 #ifdef PROVIDE_COMPLEX
1578 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex")
1579 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary")
1582 /* only in microsoft mode */
1583 specifiers->decl_modifiers |= DM_FORCEINLINE;
1587 specifiers->is_inline = true;
1592 if(type_specifiers & SPECIFIER_LONG_LONG) {
1593 errorf(HERE, "multiple type specifiers given");
1594 } else if(type_specifiers & SPECIFIER_LONG) {
1595 type_specifiers |= SPECIFIER_LONG_LONG;
1597 type_specifiers |= SPECIFIER_LONG;
1601 /* TODO: if is_type_valid(type) for the following rules should issue
1604 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
1606 type->compound.declaration = parse_compound_type_specifier(true);
1610 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
1612 type->compound.declaration = parse_compound_type_specifier(false);
1616 type = parse_enum_specifier();
1619 type = parse_typeof();
1621 case T___builtin_va_list:
1622 type = duplicate_type(type_valist);
1626 case T___attribute__:
1631 case T_IDENTIFIER: {
1632 type_t *typedef_type = get_typedef_type(token.v.symbol);
1634 if(typedef_type == NULL)
1635 goto finish_specifiers;
1638 type = typedef_type;
1642 /* function specifier */
1644 goto finish_specifiers;
1651 atomic_type_kind_t atomic_type;
1653 /* match valid basic types */
1654 switch(type_specifiers) {
1655 case SPECIFIER_VOID:
1656 atomic_type = ATOMIC_TYPE_VOID;
1658 case SPECIFIER_CHAR:
1659 atomic_type = ATOMIC_TYPE_CHAR;
1661 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
1662 atomic_type = ATOMIC_TYPE_SCHAR;
1664 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
1665 atomic_type = ATOMIC_TYPE_UCHAR;
1667 case SPECIFIER_SHORT:
1668 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
1669 case SPECIFIER_SHORT | SPECIFIER_INT:
1670 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
1671 atomic_type = ATOMIC_TYPE_SHORT;
1673 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
1674 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
1675 atomic_type = ATOMIC_TYPE_USHORT;
1678 case SPECIFIER_SIGNED:
1679 case SPECIFIER_SIGNED | SPECIFIER_INT:
1680 atomic_type = ATOMIC_TYPE_INT;
1682 case SPECIFIER_UNSIGNED:
1683 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
1684 atomic_type = ATOMIC_TYPE_UINT;
1686 case SPECIFIER_LONG:
1687 case SPECIFIER_SIGNED | SPECIFIER_LONG:
1688 case SPECIFIER_LONG | SPECIFIER_INT:
1689 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
1690 atomic_type = ATOMIC_TYPE_LONG;
1692 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
1693 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
1694 atomic_type = ATOMIC_TYPE_ULONG;
1696 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
1697 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
1698 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
1699 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
1701 atomic_type = ATOMIC_TYPE_LONGLONG;
1703 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
1704 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
1706 atomic_type = ATOMIC_TYPE_ULONGLONG;
1708 case SPECIFIER_FLOAT:
1709 atomic_type = ATOMIC_TYPE_FLOAT;
1711 case SPECIFIER_DOUBLE:
1712 atomic_type = ATOMIC_TYPE_DOUBLE;
1714 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
1715 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
1717 case SPECIFIER_BOOL:
1718 atomic_type = ATOMIC_TYPE_BOOL;
1720 #ifdef PROVIDE_COMPLEX
1721 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
1722 atomic_type = ATOMIC_TYPE_FLOAT_COMPLEX;
1724 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
1725 atomic_type = ATOMIC_TYPE_DOUBLE_COMPLEX;
1727 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
1728 atomic_type = ATOMIC_TYPE_LONG_DOUBLE_COMPLEX;
1730 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
1731 atomic_type = ATOMIC_TYPE_FLOAT_IMAGINARY;
1733 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
1734 atomic_type = ATOMIC_TYPE_DOUBLE_IMAGINARY;
1736 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
1737 atomic_type = ATOMIC_TYPE_LONG_DOUBLE_IMAGINARY;
1741 /* invalid specifier combination, give an error message */
1742 if(type_specifiers == 0) {
1743 if (! strict_mode) {
1744 if (warning.implicit_int) {
1745 warningf(HERE, "no type specifiers in declaration, using 'int'");
1747 atomic_type = ATOMIC_TYPE_INT;
1750 errorf(HERE, "no type specifiers given in declaration");
1752 } else if((type_specifiers & SPECIFIER_SIGNED) &&
1753 (type_specifiers & SPECIFIER_UNSIGNED)) {
1754 errorf(HERE, "signed and unsigned specifiers gives");
1755 } else if(type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
1756 errorf(HERE, "only integer types can be signed or unsigned");
1758 errorf(HERE, "multiple datatypes in declaration");
1760 atomic_type = ATOMIC_TYPE_INVALID;
1763 type = allocate_type_zero(TYPE_ATOMIC);
1764 type->atomic.akind = atomic_type;
1767 if(type_specifiers != 0) {
1768 errorf(HERE, "multiple datatypes in declaration");
1772 type->base.qualifiers = type_qualifiers;
1774 type_t *result = typehash_insert(type);
1775 if(newtype && result != type) {
1779 specifiers->type = result;
1782 static type_qualifiers_t parse_type_qualifiers(void)
1784 type_qualifiers_t type_qualifiers = TYPE_QUALIFIER_NONE;
1787 switch(token.type) {
1788 /* type qualifiers */
1789 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
1790 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
1791 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
1794 return type_qualifiers;
1799 static declaration_t *parse_identifier_list(void)
1801 declaration_t *declarations = NULL;
1802 declaration_t *last_declaration = NULL;
1804 declaration_t *const declaration = allocate_declaration_zero();
1805 declaration->source_position = token.source_position;
1806 declaration->symbol = token.v.symbol;
1809 if(last_declaration != NULL) {
1810 last_declaration->next = declaration;
1812 declarations = declaration;
1814 last_declaration = declaration;
1816 if(token.type != ',')
1819 } while(token.type == T_IDENTIFIER);
1821 return declarations;
1824 static void semantic_parameter(declaration_t *declaration)
1826 /* TODO: improve error messages */
1828 if(declaration->storage_class == STORAGE_CLASS_TYPEDEF) {
1829 errorf(HERE, "typedef not allowed in parameter list");
1830 } else if(declaration->storage_class != STORAGE_CLASS_NONE
1831 && declaration->storage_class != STORAGE_CLASS_REGISTER) {
1832 errorf(HERE, "parameter may only have none or register storage class");
1835 type_t *const orig_type = declaration->type;
1836 type_t * type = skip_typeref(orig_type);
1838 /* Array as last part of a parameter type is just syntactic sugar. Turn it
1839 * into a pointer. § 6.7.5.3 (7) */
1840 if (is_type_array(type)) {
1841 type_t *const element_type = type->array.element_type;
1843 type = make_pointer_type(element_type, type->base.qualifiers);
1845 declaration->type = type;
1848 if(is_type_incomplete(type)) {
1849 errorf(HERE, "incomplete type ('%T') not allowed for parameter '%Y'",
1850 orig_type, declaration->symbol);
1854 static declaration_t *parse_parameter(void)
1856 declaration_specifiers_t specifiers;
1857 memset(&specifiers, 0, sizeof(specifiers));
1859 parse_declaration_specifiers(&specifiers);
1861 declaration_t *declaration = parse_declarator(&specifiers, /*may_be_abstract=*/true);
1863 semantic_parameter(declaration);
1868 static declaration_t *parse_parameters(function_type_t *type)
1870 if(token.type == T_IDENTIFIER) {
1871 symbol_t *symbol = token.v.symbol;
1872 if(!is_typedef_symbol(symbol)) {
1873 type->kr_style_parameters = true;
1874 return parse_identifier_list();
1878 if(token.type == ')') {
1879 type->unspecified_parameters = 1;
1882 if(token.type == T_void && look_ahead(1)->type == ')') {
1887 declaration_t *declarations = NULL;
1888 declaration_t *declaration;
1889 declaration_t *last_declaration = NULL;
1890 function_parameter_t *parameter;
1891 function_parameter_t *last_parameter = NULL;
1894 switch(token.type) {
1898 return declarations;
1901 case T___extension__:
1903 declaration = parse_parameter();
1905 parameter = obstack_alloc(type_obst, sizeof(parameter[0]));
1906 memset(parameter, 0, sizeof(parameter[0]));
1907 parameter->type = declaration->type;
1909 if(last_parameter != NULL) {
1910 last_declaration->next = declaration;
1911 last_parameter->next = parameter;
1913 type->parameters = parameter;
1914 declarations = declaration;
1916 last_parameter = parameter;
1917 last_declaration = declaration;
1921 return declarations;
1923 if(token.type != ',')
1924 return declarations;
1934 } construct_type_type_t;
1936 typedef struct construct_type_t construct_type_t;
1937 struct construct_type_t {
1938 construct_type_type_t type;
1939 construct_type_t *next;
1942 typedef struct parsed_pointer_t parsed_pointer_t;
1943 struct parsed_pointer_t {
1944 construct_type_t construct_type;
1945 type_qualifiers_t type_qualifiers;
1948 typedef struct construct_function_type_t construct_function_type_t;
1949 struct construct_function_type_t {
1950 construct_type_t construct_type;
1951 type_t *function_type;
1954 typedef struct parsed_array_t parsed_array_t;
1955 struct parsed_array_t {
1956 construct_type_t construct_type;
1957 type_qualifiers_t type_qualifiers;
1963 typedef struct construct_base_type_t construct_base_type_t;
1964 struct construct_base_type_t {
1965 construct_type_t construct_type;
1969 static construct_type_t *parse_pointer_declarator(void)
1973 parsed_pointer_t *pointer = obstack_alloc(&temp_obst, sizeof(pointer[0]));
1974 memset(pointer, 0, sizeof(pointer[0]));
1975 pointer->construct_type.type = CONSTRUCT_POINTER;
1976 pointer->type_qualifiers = parse_type_qualifiers();
1978 return (construct_type_t*) pointer;
1981 static construct_type_t *parse_array_declarator(void)
1985 parsed_array_t *array = obstack_alloc(&temp_obst, sizeof(array[0]));
1986 memset(array, 0, sizeof(array[0]));
1987 array->construct_type.type = CONSTRUCT_ARRAY;
1989 if(token.type == T_static) {
1990 array->is_static = true;
1994 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
1995 if(type_qualifiers != 0) {
1996 if(token.type == T_static) {
1997 array->is_static = true;
2001 array->type_qualifiers = type_qualifiers;
2003 if(token.type == '*' && look_ahead(1)->type == ']') {
2004 array->is_variable = true;
2006 } else if(token.type != ']') {
2007 array->size = parse_assignment_expression();
2012 return (construct_type_t*) array;
2015 static construct_type_t *parse_function_declarator(declaration_t *declaration)
2019 type_t *type = allocate_type_zero(TYPE_FUNCTION);
2021 declaration_t *parameters = parse_parameters(&type->function);
2022 if(declaration != NULL) {
2023 declaration->context.declarations = parameters;
2026 construct_function_type_t *construct_function_type =
2027 obstack_alloc(&temp_obst, sizeof(construct_function_type[0]));
2028 memset(construct_function_type, 0, sizeof(construct_function_type[0]));
2029 construct_function_type->construct_type.type = CONSTRUCT_FUNCTION;
2030 construct_function_type->function_type = type;
2034 return (construct_type_t*) construct_function_type;
2037 static construct_type_t *parse_inner_declarator(declaration_t *declaration,
2038 bool may_be_abstract)
2040 /* construct a single linked list of construct_type_t's which describe
2041 * how to construct the final declarator type */
2042 construct_type_t *first = NULL;
2043 construct_type_t *last = NULL;
2046 while(token.type == '*') {
2047 construct_type_t *type = parse_pointer_declarator();
2058 /* TODO: find out if this is correct */
2061 construct_type_t *inner_types = NULL;
2063 switch(token.type) {
2065 if(declaration == NULL) {
2066 errorf(HERE, "no identifier expected in typename");
2068 declaration->symbol = token.v.symbol;
2069 declaration->source_position = token.source_position;
2075 inner_types = parse_inner_declarator(declaration, may_be_abstract);
2081 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', 0);
2082 /* avoid a loop in the outermost scope, because eat_statement doesn't
2084 if(token.type == '}' && current_function == NULL) {
2092 construct_type_t *p = last;
2095 construct_type_t *type;
2096 switch(token.type) {
2098 type = parse_function_declarator(declaration);
2101 type = parse_array_declarator();
2104 goto declarator_finished;
2107 /* insert in the middle of the list (behind p) */
2109 type->next = p->next;
2120 declarator_finished:
2123 /* append inner_types at the end of the list, we don't to set last anymore
2124 * as it's not needed anymore */
2126 assert(first == NULL);
2127 first = inner_types;
2129 last->next = inner_types;
2135 static type_t *construct_declarator_type(construct_type_t *construct_list,
2138 construct_type_t *iter = construct_list;
2139 for( ; iter != NULL; iter = iter->next) {
2140 switch(iter->type) {
2141 case CONSTRUCT_INVALID:
2142 panic("invalid type construction found");
2143 case CONSTRUCT_FUNCTION: {
2144 construct_function_type_t *construct_function_type
2145 = (construct_function_type_t*) iter;
2147 type_t *function_type = construct_function_type->function_type;
2149 function_type->function.return_type = type;
2151 type_t *skipped_return_type = skip_typeref(type);
2152 if (is_type_function(skipped_return_type)) {
2153 errorf(HERE, "function returning function is not allowed");
2154 type = type_error_type;
2155 } else if (is_type_array(skipped_return_type)) {
2156 errorf(HERE, "function returning array is not allowed");
2157 type = type_error_type;
2159 type = function_type;
2164 case CONSTRUCT_POINTER: {
2165 parsed_pointer_t *parsed_pointer = (parsed_pointer_t*) iter;
2166 type_t *pointer_type = allocate_type_zero(TYPE_POINTER);
2167 pointer_type->pointer.points_to = type;
2168 pointer_type->base.qualifiers = parsed_pointer->type_qualifiers;
2170 type = pointer_type;
2174 case CONSTRUCT_ARRAY: {
2175 parsed_array_t *parsed_array = (parsed_array_t*) iter;
2176 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
2178 array_type->base.qualifiers = parsed_array->type_qualifiers;
2179 array_type->array.element_type = type;
2180 array_type->array.is_static = parsed_array->is_static;
2181 array_type->array.is_variable = parsed_array->is_variable;
2182 array_type->array.size = parsed_array->size;
2184 type_t *skipped_type = skip_typeref(type);
2185 if (is_type_atomic(skipped_type, ATOMIC_TYPE_VOID)) {
2186 errorf(HERE, "array of void is not allowed");
2187 type = type_error_type;
2195 type_t *hashed_type = typehash_insert(type);
2196 if(hashed_type != type) {
2197 /* the function type was constructed earlier freeing it here will
2198 * destroy other types... */
2199 if(iter->type != CONSTRUCT_FUNCTION) {
2209 static declaration_t *parse_declarator(
2210 const declaration_specifiers_t *specifiers, bool may_be_abstract)
2212 declaration_t *const declaration = allocate_declaration_zero();
2213 declaration->storage_class = specifiers->storage_class;
2214 declaration->modifiers = specifiers->decl_modifiers;
2215 declaration->is_inline = specifiers->is_inline;
2217 construct_type_t *construct_type
2218 = parse_inner_declarator(declaration, may_be_abstract);
2219 type_t *const type = specifiers->type;
2220 declaration->type = construct_declarator_type(construct_type, type);
2222 if(construct_type != NULL) {
2223 obstack_free(&temp_obst, construct_type);
2229 static type_t *parse_abstract_declarator(type_t *base_type)
2231 construct_type_t *construct_type = parse_inner_declarator(NULL, 1);
2233 type_t *result = construct_declarator_type(construct_type, base_type);
2234 if(construct_type != NULL) {
2235 obstack_free(&temp_obst, construct_type);
2241 static declaration_t *append_declaration(declaration_t* const declaration)
2243 if (last_declaration != NULL) {
2244 last_declaration->next = declaration;
2246 context->declarations = declaration;
2248 last_declaration = declaration;
2252 static bool is_sym_main(const symbol_t *const sym)
2254 return strcmp(sym->string, "main") == 0;
2257 static declaration_t *internal_record_declaration(
2258 declaration_t *const declaration,
2259 const bool is_function_definition)
2261 const symbol_t *const symbol = declaration->symbol;
2262 const namespace_t namespc = (namespace_t)declaration->namespc;
2264 const type_t *const type = skip_typeref(declaration->type);
2265 if (is_type_function(type) &&
2266 type->function.unspecified_parameters &&
2267 warning.strict_prototypes) {
2268 warningf(declaration->source_position,
2269 "function declaration '%#T' is not a prototype",
2270 type, declaration->symbol);
2273 declaration_t *const previous_declaration = get_declaration(symbol, namespc);
2274 assert(declaration != previous_declaration);
2275 if (previous_declaration != NULL) {
2276 if (previous_declaration->parent_context == context) {
2277 /* can happen for K&R style declarations */
2278 if(previous_declaration->type == NULL) {
2279 previous_declaration->type = declaration->type;
2282 const type_t *const prev_type = skip_typeref(previous_declaration->type);
2283 if (!types_compatible(type, prev_type)) {
2284 errorf(declaration->source_position,
2285 "declaration '%#T' is incompatible with previous declaration '%#T'",
2286 type, symbol, previous_declaration->type, symbol);
2287 errorf(previous_declaration->source_position, "previous declaration of '%Y' was here", symbol);
2289 unsigned old_storage_class = previous_declaration->storage_class;
2290 unsigned new_storage_class = declaration->storage_class;
2292 /* pretend no storage class means extern for function declarations
2293 * (except if the previous declaration is neither none nor extern) */
2294 if (is_type_function(type)) {
2295 switch (old_storage_class) {
2296 case STORAGE_CLASS_NONE:
2297 old_storage_class = STORAGE_CLASS_EXTERN;
2299 case STORAGE_CLASS_EXTERN:
2300 if (is_function_definition) {
2301 if (warning.missing_prototypes &&
2302 prev_type->function.unspecified_parameters &&
2303 !is_sym_main(symbol)) {
2304 warningf(declaration->source_position, "no previous prototype for '%#T'", type, symbol);
2306 } else if (new_storage_class == STORAGE_CLASS_NONE) {
2307 new_storage_class = STORAGE_CLASS_EXTERN;
2315 if (old_storage_class == STORAGE_CLASS_EXTERN &&
2316 new_storage_class == STORAGE_CLASS_EXTERN) {
2317 warn_redundant_declaration:
2318 if (warning.redundant_decls) {
2319 warningf(declaration->source_position, "redundant declaration for '%Y'", symbol);
2320 warningf(previous_declaration->source_position, "previous declaration of '%Y' was here", symbol);
2322 } else if (current_function == NULL) {
2323 if (old_storage_class != STORAGE_CLASS_STATIC &&
2324 new_storage_class == STORAGE_CLASS_STATIC) {
2325 errorf(declaration->source_position, "static declaration of '%Y' follows non-static declaration", symbol);
2326 errorf(previous_declaration->source_position, "previous declaration of '%Y' was here", symbol);
2328 if (old_storage_class != STORAGE_CLASS_EXTERN && !is_function_definition) {
2329 goto warn_redundant_declaration;
2331 if (new_storage_class == STORAGE_CLASS_NONE) {
2332 previous_declaration->storage_class = STORAGE_CLASS_NONE;
2336 if (old_storage_class == new_storage_class) {
2337 errorf(declaration->source_position, "redeclaration of '%Y'", symbol);
2339 errorf(declaration->source_position, "redeclaration of '%Y' with different linkage", symbol);
2341 errorf(previous_declaration->source_position, "previous declaration of '%Y' was here", symbol);
2344 return previous_declaration;
2346 } else if (is_function_definition &&
2347 declaration->storage_class != STORAGE_CLASS_STATIC) {
2348 if (warning.missing_prototypes && !is_sym_main(symbol)) {
2349 warningf(declaration->source_position, "no previous prototype for '%#T'", type, symbol);
2350 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
2351 warningf(declaration->source_position, "no previous declaration for '%#T'", type, symbol);
2355 assert(declaration->parent_context == NULL);
2356 assert(declaration->symbol != NULL);
2357 assert(context != NULL);
2359 declaration->parent_context = context;
2361 environment_push(declaration);
2362 return append_declaration(declaration);
2365 static declaration_t *record_declaration(declaration_t *declaration)
2367 return internal_record_declaration(declaration, false);
2370 static declaration_t *record_function_definition(declaration_t *declaration)
2372 return internal_record_declaration(declaration, true);
2375 static void parser_error_multiple_definition(declaration_t *declaration,
2376 const source_position_t source_position)
2378 errorf(source_position, "multiple definition of symbol '%Y'",
2379 declaration->symbol);
2380 errorf(declaration->source_position,
2381 "this is the location of the previous definition.");
2384 static bool is_declaration_specifier(const token_t *token,
2385 bool only_type_specifiers)
2387 switch(token->type) {
2391 return is_typedef_symbol(token->v.symbol);
2393 case T___extension__:
2396 return !only_type_specifiers;
2403 static void parse_init_declarator_rest(declaration_t *declaration)
2407 type_t *orig_type = declaration->type;
2408 type_t *type = type = skip_typeref(orig_type);
2410 if(declaration->init.initializer != NULL) {
2411 parser_error_multiple_definition(declaration, token.source_position);
2414 initializer_t *initializer = parse_initializer(type);
2416 /* § 6.7.5 (22) array initializers for arrays with unknown size determine
2417 * the array type size */
2418 if(is_type_array(type) && initializer != NULL) {
2419 array_type_t *array_type = &type->array;
2421 if(array_type->size == NULL) {
2422 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
2424 cnst->base.datatype = type_size_t;
2426 switch (initializer->kind) {
2427 case INITIALIZER_LIST: {
2428 cnst->conste.v.int_value = initializer->list.len;
2432 case INITIALIZER_STRING: {
2433 cnst->conste.v.int_value = initializer->string.string.size;
2437 case INITIALIZER_WIDE_STRING: {
2438 cnst->conste.v.int_value = initializer->wide_string.string.size;
2443 panic("invalid initializer type");
2446 array_type->size = cnst;
2450 if(is_type_function(type)) {
2451 errorf(declaration->source_position,
2452 "initializers not allowed for function types at declator '%Y' (type '%T')",
2453 declaration->symbol, orig_type);
2455 declaration->init.initializer = initializer;
2459 /* parse rest of a declaration without any declarator */
2460 static void parse_anonymous_declaration_rest(
2461 const declaration_specifiers_t *specifiers,
2462 parsed_declaration_func finished_declaration)
2466 declaration_t *const declaration = allocate_declaration_zero();
2467 declaration->type = specifiers->type;
2468 declaration->storage_class = specifiers->storage_class;
2469 declaration->source_position = specifiers->source_position;
2471 if (declaration->storage_class != STORAGE_CLASS_NONE) {
2472 warningf(declaration->source_position, "useless storage class in empty declaration");
2475 type_t *type = declaration->type;
2476 switch (type->kind) {
2477 case TYPE_COMPOUND_STRUCT:
2478 case TYPE_COMPOUND_UNION: {
2479 if (type->compound.declaration->symbol == NULL) {
2480 warningf(declaration->source_position, "unnamed struct/union that defines no instances");
2489 warningf(declaration->source_position, "empty declaration");
2493 finished_declaration(declaration);
2496 static void parse_declaration_rest(declaration_t *ndeclaration,
2497 const declaration_specifiers_t *specifiers,
2498 parsed_declaration_func finished_declaration)
2501 declaration_t *declaration = finished_declaration(ndeclaration);
2503 type_t *orig_type = declaration->type;
2504 type_t *type = skip_typeref(orig_type);
2506 if (type->kind != TYPE_FUNCTION &&
2507 declaration->is_inline &&
2508 is_type_valid(type)) {
2509 warningf(declaration->source_position,
2510 "variable '%Y' declared 'inline'\n", declaration->symbol);
2513 if(token.type == '=') {
2514 parse_init_declarator_rest(declaration);
2517 if(token.type != ',')
2521 ndeclaration = parse_declarator(specifiers, /*may_be_abstract=*/false);
2526 static declaration_t *finished_kr_declaration(declaration_t *declaration)
2528 symbol_t *symbol = declaration->symbol;
2529 if(symbol == NULL) {
2530 errorf(HERE, "anonymous declaration not valid as function parameter");
2533 namespace_t namespc = (namespace_t) declaration->namespc;
2534 if(namespc != NAMESPACE_NORMAL) {
2535 return record_declaration(declaration);
2538 declaration_t *previous_declaration = get_declaration(symbol, namespc);
2539 if(previous_declaration == NULL ||
2540 previous_declaration->parent_context != context) {
2541 errorf(HERE, "expected declaration of a function parameter, found '%Y'",
2546 if(previous_declaration->type == NULL) {
2547 previous_declaration->type = declaration->type;
2548 previous_declaration->storage_class = declaration->storage_class;
2549 previous_declaration->parent_context = context;
2550 return previous_declaration;
2552 return record_declaration(declaration);
2556 static void parse_declaration(parsed_declaration_func finished_declaration)
2558 declaration_specifiers_t specifiers;
2559 memset(&specifiers, 0, sizeof(specifiers));
2560 parse_declaration_specifiers(&specifiers);
2562 if(token.type == ';') {
2563 parse_anonymous_declaration_rest(&specifiers, finished_declaration);
2565 declaration_t *declaration = parse_declarator(&specifiers, /*may_be_abstract=*/false);
2566 parse_declaration_rest(declaration, &specifiers, finished_declaration);
2570 static void parse_kr_declaration_list(declaration_t *declaration)
2572 type_t *type = skip_typeref(declaration->type);
2573 if(!is_type_function(type))
2576 if(!type->function.kr_style_parameters)
2579 /* push function parameters */
2580 int top = environment_top();
2581 context_t *last_context = context;
2582 set_context(&declaration->context);
2584 declaration_t *parameter = declaration->context.declarations;
2585 for( ; parameter != NULL; parameter = parameter->next) {
2586 assert(parameter->parent_context == NULL);
2587 parameter->parent_context = context;
2588 environment_push(parameter);
2591 /* parse declaration list */
2592 while(is_declaration_specifier(&token, false)) {
2593 parse_declaration(finished_kr_declaration);
2596 /* pop function parameters */
2597 assert(context == &declaration->context);
2598 set_context(last_context);
2599 environment_pop_to(top);
2601 /* update function type */
2602 type_t *new_type = duplicate_type(type);
2603 new_type->function.kr_style_parameters = false;
2605 function_parameter_t *parameters = NULL;
2606 function_parameter_t *last_parameter = NULL;
2608 declaration_t *parameter_declaration = declaration->context.declarations;
2609 for( ; parameter_declaration != NULL;
2610 parameter_declaration = parameter_declaration->next) {
2611 type_t *parameter_type = parameter_declaration->type;
2612 if(parameter_type == NULL) {
2614 errorf(HERE, "no type specified for function parameter '%Y'",
2615 parameter_declaration->symbol);
2617 if (warning.implicit_int) {
2618 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
2619 parameter_declaration->symbol);
2621 parameter_type = type_int;
2622 parameter_declaration->type = parameter_type;
2626 semantic_parameter(parameter_declaration);
2627 parameter_type = parameter_declaration->type;
2629 function_parameter_t *function_parameter
2630 = obstack_alloc(type_obst, sizeof(function_parameter[0]));
2631 memset(function_parameter, 0, sizeof(function_parameter[0]));
2633 function_parameter->type = parameter_type;
2634 if(last_parameter != NULL) {
2635 last_parameter->next = function_parameter;
2637 parameters = function_parameter;
2639 last_parameter = function_parameter;
2641 new_type->function.parameters = parameters;
2643 type = typehash_insert(new_type);
2644 if(type != new_type) {
2645 obstack_free(type_obst, new_type);
2648 declaration->type = type;
2652 * Check if all labels are defined in the current function.
2654 static void check_for_missing_labels(void)
2656 bool first_err = true;
2657 for (const goto_statement_t *goto_statement = goto_first;
2658 goto_statement != NULL;
2659 goto_statement = goto_statement->next) {
2660 const declaration_t *label = goto_statement->label;
2662 if (label->source_position.input_name == NULL) {
2665 diagnosticf("%s: In function '%Y':\n",
2666 current_function->source_position.input_name,
2667 current_function->symbol);
2669 errorf(goto_statement->statement.source_position,
2670 "label '%Y' used but not defined", label->symbol);
2673 goto_first = goto_last = NULL;
2676 static void parse_external_declaration(void)
2678 /* function-definitions and declarations both start with declaration
2680 declaration_specifiers_t specifiers;
2681 memset(&specifiers, 0, sizeof(specifiers));
2682 parse_declaration_specifiers(&specifiers);
2684 /* must be a declaration */
2685 if(token.type == ';') {
2686 parse_anonymous_declaration_rest(&specifiers, append_declaration);
2690 /* declarator is common to both function-definitions and declarations */
2691 declaration_t *ndeclaration = parse_declarator(&specifiers, /*may_be_abstract=*/false);
2693 /* must be a declaration */
2694 if(token.type == ',' || token.type == '=' || token.type == ';') {
2695 parse_declaration_rest(ndeclaration, &specifiers, record_declaration);
2699 /* must be a function definition */
2700 parse_kr_declaration_list(ndeclaration);
2702 if(token.type != '{') {
2703 parse_error_expected("while parsing function definition", '{', 0);
2708 type_t *type = ndeclaration->type;
2710 /* note that we don't skip typerefs: the standard doesn't allow them here
2711 * (so we can't use is_type_function here) */
2712 if(type->kind != TYPE_FUNCTION) {
2713 if (is_type_valid(type)) {
2714 errorf(HERE, "declarator '%#T' has a body but is not a function type",
2715 type, ndeclaration->symbol);
2721 /* § 6.7.5.3 (14) a function definition with () means no
2722 * parameters (and not unspecified parameters) */
2723 if(type->function.unspecified_parameters) {
2724 type_t *duplicate = duplicate_type(type);
2725 duplicate->function.unspecified_parameters = false;
2727 type = typehash_insert(duplicate);
2728 if(type != duplicate) {
2729 obstack_free(type_obst, duplicate);
2731 ndeclaration->type = type;
2734 declaration_t *const declaration = record_function_definition(ndeclaration);
2735 if(ndeclaration != declaration) {
2736 declaration->context = ndeclaration->context;
2738 type = skip_typeref(declaration->type);
2740 /* push function parameters and switch context */
2741 int top = environment_top();
2742 context_t *last_context = context;
2743 set_context(&declaration->context);
2745 declaration_t *parameter = declaration->context.declarations;
2746 for( ; parameter != NULL; parameter = parameter->next) {
2747 if(parameter->parent_context == &ndeclaration->context) {
2748 parameter->parent_context = context;
2750 assert(parameter->parent_context == NULL
2751 || parameter->parent_context == context);
2752 parameter->parent_context = context;
2753 environment_push(parameter);
2756 if(declaration->init.statement != NULL) {
2757 parser_error_multiple_definition(declaration, token.source_position);
2759 goto end_of_parse_external_declaration;
2761 /* parse function body */
2762 int label_stack_top = label_top();
2763 declaration_t *old_current_function = current_function;
2764 current_function = declaration;
2766 declaration->init.statement = parse_compound_statement();
2767 check_for_missing_labels();
2769 assert(current_function == declaration);
2770 current_function = old_current_function;
2771 label_pop_to(label_stack_top);
2774 end_of_parse_external_declaration:
2775 assert(context == &declaration->context);
2776 set_context(last_context);
2777 environment_pop_to(top);
2780 static type_t *make_bitfield_type(type_t *base, expression_t *size)
2782 type_t *type = allocate_type_zero(TYPE_BITFIELD);
2783 type->bitfield.base = base;
2784 type->bitfield.size = size;
2789 static void parse_struct_declarators(const declaration_specifiers_t *specifiers)
2791 /* TODO: check constraints for struct declarations (in specifiers) */
2793 declaration_t *declaration;
2795 if(token.type == ':') {
2798 type_t *base_type = specifiers->type;
2799 expression_t *size = parse_constant_expression();
2801 type_t *type = make_bitfield_type(base_type, size);
2803 declaration = allocate_declaration_zero();
2804 declaration->namespc = NAMESPACE_NORMAL;
2805 declaration->storage_class = STORAGE_CLASS_NONE;
2806 declaration->source_position = token.source_position;
2807 declaration->modifiers = specifiers->decl_modifiers;
2808 declaration->type = type;
2810 declaration = parse_declarator(specifiers,/*may_be_abstract=*/true);
2812 if(token.type == ':') {
2814 expression_t *size = parse_constant_expression();
2816 type_t *type = make_bitfield_type(declaration->type, size);
2817 declaration->type = type;
2820 record_declaration(declaration);
2822 if(token.type != ',')
2829 static void parse_compound_type_entries(void)
2833 while(token.type != '}' && token.type != T_EOF) {
2834 declaration_specifiers_t specifiers;
2835 memset(&specifiers, 0, sizeof(specifiers));
2836 parse_declaration_specifiers(&specifiers);
2838 parse_struct_declarators(&specifiers);
2840 if(token.type == T_EOF) {
2841 errorf(HERE, "EOF while parsing struct");
2846 static type_t *parse_typename(void)
2848 declaration_specifiers_t specifiers;
2849 memset(&specifiers, 0, sizeof(specifiers));
2850 parse_declaration_specifiers(&specifiers);
2851 if(specifiers.storage_class != STORAGE_CLASS_NONE) {
2852 /* TODO: improve error message, user does probably not know what a
2853 * storage class is...
2855 errorf(HERE, "typename may not have a storage class");
2858 type_t *result = parse_abstract_declarator(specifiers.type);
2866 typedef expression_t* (*parse_expression_function) (unsigned precedence);
2867 typedef expression_t* (*parse_expression_infix_function) (unsigned precedence,
2868 expression_t *left);
2870 typedef struct expression_parser_function_t expression_parser_function_t;
2871 struct expression_parser_function_t {
2872 unsigned precedence;
2873 parse_expression_function parser;
2874 unsigned infix_precedence;
2875 parse_expression_infix_function infix_parser;
2878 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
2881 * Creates a new invalid expression.
2883 static expression_t *create_invalid_expression(void)
2885 expression_t *expression = allocate_expression_zero(EXPR_INVALID);
2886 expression->base.source_position = token.source_position;
2891 * Prints an error message if an expression was expected but not read
2893 static expression_t *expected_expression_error(void)
2895 /* skip the error message if the error token was read */
2896 if (token.type != T_ERROR) {
2897 errorf(HERE, "expected expression, got token '%K'", &token);
2901 return create_invalid_expression();
2905 * Parse a string constant.
2907 static expression_t *parse_string_const(void)
2909 expression_t *cnst = allocate_expression_zero(EXPR_STRING_LITERAL);
2910 cnst->base.datatype = type_string;
2911 cnst->string.value = parse_string_literals();
2917 * Parse a wide string constant.
2919 static expression_t *parse_wide_string_const(void)
2921 expression_t *const cnst = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
2922 cnst->base.datatype = type_wchar_t_ptr;
2923 cnst->wide_string.value = token.v.wide_string; /* TODO concatenate */
2929 * Parse an integer constant.
2931 static expression_t *parse_int_const(void)
2933 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
2934 cnst->base.datatype = token.datatype;
2935 cnst->conste.v.int_value = token.v.intvalue;
2943 * Parse a float constant.
2945 static expression_t *parse_float_const(void)
2947 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
2948 cnst->base.datatype = token.datatype;
2949 cnst->conste.v.float_value = token.v.floatvalue;
2956 static declaration_t *create_implicit_function(symbol_t *symbol,
2957 const source_position_t source_position)
2959 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
2960 ntype->function.return_type = type_int;
2961 ntype->function.unspecified_parameters = true;
2963 type_t *type = typehash_insert(ntype);
2968 declaration_t *const declaration = allocate_declaration_zero();
2969 declaration->storage_class = STORAGE_CLASS_EXTERN;
2970 declaration->type = type;
2971 declaration->symbol = symbol;
2972 declaration->source_position = source_position;
2973 declaration->parent_context = global_context;
2975 context_t *old_context = context;
2976 set_context(global_context);
2978 environment_push(declaration);
2979 /* prepend the declaration to the global declarations list */
2980 declaration->next = context->declarations;
2981 context->declarations = declaration;
2983 assert(context == global_context);
2984 set_context(old_context);
2990 * Creates a return_type (func)(argument_type) function type if not
2993 * @param return_type the return type
2994 * @param argument_type the argument type
2996 static type_t *make_function_1_type(type_t *return_type, type_t *argument_type)
2998 function_parameter_t *parameter
2999 = obstack_alloc(type_obst, sizeof(parameter[0]));
3000 memset(parameter, 0, sizeof(parameter[0]));
3001 parameter->type = argument_type;
3003 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3004 type->function.return_type = return_type;
3005 type->function.parameters = parameter;
3007 type_t *result = typehash_insert(type);
3008 if(result != type) {
3016 * Creates a function type for some function like builtins.
3018 * @param symbol the symbol describing the builtin
3020 static type_t *get_builtin_symbol_type(symbol_t *symbol)
3022 switch(symbol->ID) {
3023 case T___builtin_alloca:
3024 return make_function_1_type(type_void_ptr, type_size_t);
3025 case T___builtin_nan:
3026 return make_function_1_type(type_double, type_string);
3027 case T___builtin_nanf:
3028 return make_function_1_type(type_float, type_string);
3029 case T___builtin_nand:
3030 return make_function_1_type(type_long_double, type_string);
3031 case T___builtin_va_end:
3032 return make_function_1_type(type_void, type_valist);
3034 panic("not implemented builtin symbol found");
3039 * Performs automatic type cast as described in § 6.3.2.1.
3041 * @param orig_type the original type
3043 static type_t *automatic_type_conversion(type_t *orig_type)
3045 type_t *type = skip_typeref(orig_type);
3046 if(is_type_array(type)) {
3047 array_type_t *array_type = &type->array;
3048 type_t *element_type = array_type->element_type;
3049 unsigned qualifiers = array_type->type.qualifiers;
3051 return make_pointer_type(element_type, qualifiers);
3054 if(is_type_function(type)) {
3055 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
3062 * reverts the automatic casts of array to pointer types and function
3063 * to function-pointer types as defined § 6.3.2.1
3065 type_t *revert_automatic_type_conversion(const expression_t *expression)
3067 switch (expression->kind) {
3068 case EXPR_REFERENCE: return expression->reference.declaration->type;
3069 case EXPR_SELECT: return expression->select.compound_entry->type;
3071 case EXPR_UNARY_DEREFERENCE: {
3072 const expression_t *const value = expression->unary.value;
3073 type_t *const type = skip_typeref(value->base.datatype);
3074 assert(is_type_pointer(type));
3075 return type->pointer.points_to;
3078 case EXPR_BUILTIN_SYMBOL:
3079 return get_builtin_symbol_type(expression->builtin_symbol.symbol);
3081 case EXPR_ARRAY_ACCESS: {
3082 const expression_t *const array_ref = expression->array_access.array_ref;
3083 type_t *const type_left = skip_typeref(array_ref->base.datatype);
3084 if (!is_type_valid(type_left))
3086 assert(is_type_pointer(type_left));
3087 return type_left->pointer.points_to;
3093 return expression->base.datatype;
3096 static expression_t *parse_reference(void)
3098 expression_t *expression = allocate_expression_zero(EXPR_REFERENCE);
3100 reference_expression_t *ref = &expression->reference;
3101 ref->symbol = token.v.symbol;
3103 declaration_t *declaration = get_declaration(ref->symbol, NAMESPACE_NORMAL);
3105 source_position_t source_position = token.source_position;
3108 if(declaration == NULL) {
3109 if (! strict_mode && token.type == '(') {
3110 /* an implicitly defined function */
3111 if (warning.implicit_function_declaration) {
3112 warningf(HERE, "implicit declaration of function '%Y'",
3116 declaration = create_implicit_function(ref->symbol,
3119 errorf(HERE, "unknown symbol '%Y' found.", ref->symbol);
3124 type_t *type = declaration->type;
3126 /* we always do the auto-type conversions; the & and sizeof parser contains
3127 * code to revert this! */
3128 type = automatic_type_conversion(type);
3130 ref->declaration = declaration;
3131 ref->expression.datatype = type;
3136 static void check_cast_allowed(expression_t *expression, type_t *dest_type)
3140 /* TODO check if explicit cast is allowed and issue warnings/errors */
3143 static expression_t *parse_cast(void)
3145 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
3147 cast->base.source_position = token.source_position;
3149 type_t *type = parse_typename();
3152 expression_t *value = parse_sub_expression(20);
3154 check_cast_allowed(value, type);
3156 cast->base.datatype = type;
3157 cast->unary.value = value;
3162 static expression_t *parse_statement_expression(void)
3164 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
3166 statement_t *statement = parse_compound_statement();
3167 expression->statement.statement = statement;
3168 expression->base.source_position = statement->base.source_position;
3170 /* find last statement and use its type */
3171 type_t *type = type_void;
3172 const statement_t *stmt = statement->compound.statements;
3174 while (stmt->base.next != NULL)
3175 stmt = stmt->base.next;
3177 if (stmt->kind == STATEMENT_EXPRESSION) {
3178 type = stmt->expression.expression->base.datatype;
3181 warningf(expression->base.source_position, "empty statement expression ({})");
3183 expression->base.datatype = type;
3190 static expression_t *parse_brace_expression(void)
3194 switch(token.type) {
3196 /* gcc extension: a statement expression */
3197 return parse_statement_expression();
3201 return parse_cast();
3203 if(is_typedef_symbol(token.v.symbol)) {
3204 return parse_cast();
3208 expression_t *result = parse_expression();
3214 static expression_t *parse_function_keyword(void)
3219 if (current_function == NULL) {
3220 errorf(HERE, "'__func__' used outside of a function");
3223 string_literal_expression_t *expression
3224 = allocate_ast_zero(sizeof(expression[0]));
3226 expression->expression.kind = EXPR_FUNCTION;
3227 expression->expression.datatype = type_string;
3229 return (expression_t*) expression;
3232 static expression_t *parse_pretty_function_keyword(void)
3234 eat(T___PRETTY_FUNCTION__);
3237 if (current_function == NULL) {
3238 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
3241 string_literal_expression_t *expression
3242 = allocate_ast_zero(sizeof(expression[0]));
3244 expression->expression.kind = EXPR_PRETTY_FUNCTION;
3245 expression->expression.datatype = type_string;
3247 return (expression_t*) expression;
3250 static designator_t *parse_designator(void)
3252 designator_t *result = allocate_ast_zero(sizeof(result[0]));
3254 if(token.type != T_IDENTIFIER) {
3255 parse_error_expected("while parsing member designator",
3260 result->symbol = token.v.symbol;
3263 designator_t *last_designator = result;
3265 if(token.type == '.') {
3267 if(token.type != T_IDENTIFIER) {
3268 parse_error_expected("while parsing member designator",
3273 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
3274 designator->symbol = token.v.symbol;
3277 last_designator->next = designator;
3278 last_designator = designator;
3281 if(token.type == '[') {
3283 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
3284 designator->array_access = parse_expression();
3285 if(designator->array_access == NULL) {
3291 last_designator->next = designator;
3292 last_designator = designator;
3301 static expression_t *parse_offsetof(void)
3303 eat(T___builtin_offsetof);
3305 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
3306 expression->base.datatype = type_size_t;
3309 expression->offsetofe.type = parse_typename();
3311 expression->offsetofe.designator = parse_designator();
3317 static expression_t *parse_va_start(void)
3319 eat(T___builtin_va_start);
3321 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
3324 expression->va_starte.ap = parse_assignment_expression();
3326 expression_t *const expr = parse_assignment_expression();
3327 if (expr->kind == EXPR_REFERENCE) {
3328 declaration_t *const decl = expr->reference.declaration;
3329 if (decl->parent_context == ¤t_function->context &&
3330 decl->next == NULL) {
3331 expression->va_starte.parameter = decl;
3336 errorf(expr->base.source_position, "second argument of 'va_start' must be last parameter of the current function");
3338 return create_invalid_expression();
3341 static expression_t *parse_va_arg(void)
3343 eat(T___builtin_va_arg);
3345 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
3348 expression->va_arge.ap = parse_assignment_expression();
3350 expression->base.datatype = parse_typename();
3356 static expression_t *parse_builtin_symbol(void)
3358 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_SYMBOL);
3360 symbol_t *symbol = token.v.symbol;
3362 expression->builtin_symbol.symbol = symbol;
3365 type_t *type = get_builtin_symbol_type(symbol);
3366 type = automatic_type_conversion(type);
3368 expression->base.datatype = type;
3372 static expression_t *parse_builtin_constant(void)
3374 eat(T___builtin_constant_p);
3376 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
3379 expression->builtin_constant.value = parse_assignment_expression();
3381 expression->base.datatype = type_int;
3386 static expression_t *parse_builtin_prefetch(void)
3388 eat(T___builtin_prefetch);
3390 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_PREFETCH);
3393 expression->builtin_prefetch.adr = parse_assignment_expression();
3394 if (token.type == ',') {
3396 expression->builtin_prefetch.rw = parse_assignment_expression();
3398 if (token.type == ',') {
3400 expression->builtin_prefetch.locality = parse_assignment_expression();
3403 expression->base.datatype = type_void;
3408 static expression_t *parse_compare_builtin(void)
3410 expression_t *expression;
3412 switch(token.type) {
3413 case T___builtin_isgreater:
3414 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
3416 case T___builtin_isgreaterequal:
3417 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
3419 case T___builtin_isless:
3420 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
3422 case T___builtin_islessequal:
3423 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
3425 case T___builtin_islessgreater:
3426 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
3428 case T___builtin_isunordered:
3429 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
3432 panic("invalid compare builtin found");
3438 expression->binary.left = parse_assignment_expression();
3440 expression->binary.right = parse_assignment_expression();
3443 type_t *const orig_type_left = expression->binary.left->base.datatype;
3444 type_t *const orig_type_right = expression->binary.right->base.datatype;
3446 type_t *const type_left = skip_typeref(orig_type_left);
3447 type_t *const type_right = skip_typeref(orig_type_right);
3448 if(!is_type_floating(type_left) && !is_type_floating(type_right)) {
3449 if (is_type_valid(type_left) && is_type_valid(type_right)) {
3450 type_error_incompatible("invalid operands in comparison",
3451 token.source_position, orig_type_left, orig_type_right);
3454 semantic_comparison(&expression->binary);
3460 static expression_t *parse_builtin_expect(void)
3462 eat(T___builtin_expect);
3464 expression_t *expression
3465 = allocate_expression_zero(EXPR_BINARY_BUILTIN_EXPECT);
3468 expression->binary.left = parse_assignment_expression();
3470 expression->binary.right = parse_constant_expression();
3473 expression->base.datatype = expression->binary.left->base.datatype;
3478 static expression_t *parse_assume(void) {
3481 expression_t *expression
3482 = allocate_expression_zero(EXPR_UNARY_ASSUME);
3485 expression->unary.value = parse_assignment_expression();
3488 expression->base.datatype = type_void;
3492 static expression_t *parse_alignof(void) {
3495 expression_t *expression
3496 = allocate_expression_zero(EXPR_ALIGNOF);
3499 expression->alignofe.type = parse_typename();
3502 expression->base.datatype = type_size_t;
3506 static expression_t *parse_primary_expression(void)
3508 switch(token.type) {
3510 return parse_int_const();
3511 case T_FLOATINGPOINT:
3512 return parse_float_const();
3513 case T_STRING_LITERAL:
3514 return parse_string_const();
3515 case T_WIDE_STRING_LITERAL:
3516 return parse_wide_string_const();
3518 return parse_reference();
3519 case T___FUNCTION__:
3521 return parse_function_keyword();
3522 case T___PRETTY_FUNCTION__:
3523 return parse_pretty_function_keyword();
3524 case T___builtin_offsetof:
3525 return parse_offsetof();
3526 case T___builtin_va_start:
3527 return parse_va_start();
3528 case T___builtin_va_arg:
3529 return parse_va_arg();
3530 case T___builtin_expect:
3531 return parse_builtin_expect();
3532 case T___builtin_nanf:
3533 case T___builtin_alloca:
3534 case T___builtin_va_end:
3535 return parse_builtin_symbol();
3536 case T___builtin_isgreater:
3537 case T___builtin_isgreaterequal:
3538 case T___builtin_isless:
3539 case T___builtin_islessequal:
3540 case T___builtin_islessgreater:
3541 case T___builtin_isunordered:
3542 return parse_compare_builtin();
3543 case T___builtin_constant_p:
3544 return parse_builtin_constant();
3545 case T___builtin_prefetch:
3546 return parse_builtin_prefetch();
3548 return parse_alignof();
3550 return parse_assume();
3553 return parse_brace_expression();
3556 errorf(HERE, "unexpected token '%K'", &token);
3559 return create_invalid_expression();
3563 * Check if the expression has the character type and issue a warning then.
3565 static void check_for_char_index_type(const expression_t *expression) {
3566 type_t *const type = expression->base.datatype;
3567 const type_t *const base_type = skip_typeref(type);
3569 if (is_type_atomic(base_type, ATOMIC_TYPE_CHAR) &&
3570 warning.char_subscripts) {
3571 warningf(expression->base.source_position,
3572 "array subscript has type '%T'", type);
3576 static expression_t *parse_array_expression(unsigned precedence,
3583 expression_t *inside = parse_expression();
3585 array_access_expression_t *array_access
3586 = allocate_ast_zero(sizeof(array_access[0]));
3588 array_access->expression.kind = EXPR_ARRAY_ACCESS;
3590 type_t *const orig_type_left = left->base.datatype;
3591 type_t *const orig_type_inside = inside->base.datatype;
3593 type_t *const type_left = skip_typeref(orig_type_left);
3594 type_t *const type_inside = skip_typeref(orig_type_inside);
3596 type_t *return_type;
3597 if (is_type_pointer(type_left)) {
3598 return_type = type_left->pointer.points_to;
3599 array_access->array_ref = left;
3600 array_access->index = inside;
3601 check_for_char_index_type(inside);
3602 } else if (is_type_pointer(type_inside)) {
3603 return_type = type_inside->pointer.points_to;
3604 array_access->array_ref = inside;
3605 array_access->index = left;
3606 array_access->flipped = true;
3607 check_for_char_index_type(left);
3609 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
3611 "array access on object with non-pointer types '%T', '%T'",
3612 orig_type_left, orig_type_inside);
3614 return_type = type_error_type;
3615 array_access->array_ref = create_invalid_expression();
3618 if(token.type != ']') {
3619 parse_error_expected("Problem while parsing array access", ']', 0);
3620 return (expression_t*) array_access;
3624 return_type = automatic_type_conversion(return_type);
3625 array_access->expression.datatype = return_type;
3627 return (expression_t*) array_access;
3630 static expression_t *parse_sizeof(unsigned precedence)
3634 sizeof_expression_t *sizeof_expression
3635 = allocate_ast_zero(sizeof(sizeof_expression[0]));
3636 sizeof_expression->expression.kind = EXPR_SIZEOF;
3637 sizeof_expression->expression.datatype = type_size_t;
3639 if(token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
3641 sizeof_expression->type = parse_typename();
3644 expression_t *expression = parse_sub_expression(precedence);
3645 expression->base.datatype = revert_automatic_type_conversion(expression);
3647 sizeof_expression->type = expression->base.datatype;
3648 sizeof_expression->size_expression = expression;
3651 return (expression_t*) sizeof_expression;
3654 static expression_t *parse_select_expression(unsigned precedence,
3655 expression_t *compound)
3658 assert(token.type == '.' || token.type == T_MINUSGREATER);
3660 bool is_pointer = (token.type == T_MINUSGREATER);
3663 expression_t *select = allocate_expression_zero(EXPR_SELECT);
3664 select->select.compound = compound;
3666 if(token.type != T_IDENTIFIER) {
3667 parse_error_expected("while parsing select", T_IDENTIFIER, 0);
3670 symbol_t *symbol = token.v.symbol;
3671 select->select.symbol = symbol;
3674 type_t *const orig_type = compound->base.datatype;
3675 type_t *const type = skip_typeref(orig_type);
3677 type_t *type_left = type;
3679 if (!is_type_pointer(type)) {
3680 if (is_type_valid(type)) {
3681 errorf(HERE, "left hand side of '->' is not a pointer, but '%T'", orig_type);
3683 return create_invalid_expression();
3685 type_left = type->pointer.points_to;
3687 type_left = skip_typeref(type_left);
3689 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
3690 type_left->kind != TYPE_COMPOUND_UNION) {
3691 if (is_type_valid(type_left)) {
3692 errorf(HERE, "request for member '%Y' in something not a struct or "
3693 "union, but '%T'", symbol, type_left);
3695 return create_invalid_expression();
3698 declaration_t *const declaration = type_left->compound.declaration;
3700 if(!declaration->init.is_defined) {
3701 errorf(HERE, "request for member '%Y' of incomplete type '%T'",
3703 return create_invalid_expression();
3706 declaration_t *iter = declaration->context.declarations;
3707 for( ; iter != NULL; iter = iter->next) {
3708 if(iter->symbol == symbol) {
3713 errorf(HERE, "'%T' has no member named '%Y'", orig_type, symbol);
3714 return create_invalid_expression();
3717 /* we always do the auto-type conversions; the & and sizeof parser contains
3718 * code to revert this! */
3719 type_t *expression_type = automatic_type_conversion(iter->type);
3721 select->select.compound_entry = iter;
3722 select->base.datatype = expression_type;
3724 if(expression_type->kind == TYPE_BITFIELD) {
3725 expression_t *extract
3726 = allocate_expression_zero(EXPR_UNARY_BITFIELD_EXTRACT);
3727 extract->unary.value = select;
3728 extract->base.datatype = expression_type->bitfield.base;
3737 * Parse a call expression, ie. expression '( ... )'.
3739 * @param expression the function address
3741 static expression_t *parse_call_expression(unsigned precedence,
3742 expression_t *expression)
3745 expression_t *result = allocate_expression_zero(EXPR_CALL);
3747 call_expression_t *call = &result->call;
3748 call->function = expression;
3750 type_t *const orig_type = expression->base.datatype;
3751 type_t *const type = skip_typeref(orig_type);
3753 function_type_t *function_type = NULL;
3754 if (is_type_pointer(type)) {
3755 type_t *const to_type = skip_typeref(type->pointer.points_to);
3757 if (is_type_function(to_type)) {
3758 function_type = &to_type->function;
3759 call->expression.datatype = function_type->return_type;
3763 if (function_type == NULL && is_type_valid(type)) {
3764 errorf(HERE, "called object '%E' (type '%T') is not a pointer to a function", expression, orig_type);
3767 /* parse arguments */
3770 if(token.type != ')') {
3771 call_argument_t *last_argument = NULL;
3774 call_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
3776 argument->expression = parse_assignment_expression();
3777 if(last_argument == NULL) {
3778 call->arguments = argument;
3780 last_argument->next = argument;
3782 last_argument = argument;
3784 if(token.type != ',')
3791 if(function_type != NULL) {
3792 function_parameter_t *parameter = function_type->parameters;
3793 call_argument_t *argument = call->arguments;
3794 for( ; parameter != NULL && argument != NULL;
3795 parameter = parameter->next, argument = argument->next) {
3796 type_t *expected_type = parameter->type;
3797 /* TODO report context in error messages */
3798 expression_t *const arg_expr = argument->expression;
3799 type_t *const res_type = semantic_assign(expected_type, arg_expr, "function call");
3800 if (res_type == NULL) {
3801 /* TODO improve error message */
3802 errorf(arg_expr->base.source_position,
3803 "Cannot call function with argument '%E' of type '%T' where type '%T' is expected",
3804 arg_expr, arg_expr->base.datatype, expected_type);
3806 argument->expression = create_implicit_cast(argument->expression, expected_type);
3809 /* too few parameters */
3810 if(parameter != NULL) {
3811 errorf(HERE, "too few arguments to function '%E'", expression);
3812 } else if(argument != NULL) {
3813 /* too many parameters */
3814 if(!function_type->variadic
3815 && !function_type->unspecified_parameters) {
3816 errorf(HERE, "too many arguments to function '%E'", expression);
3818 /* do default promotion */
3819 for( ; argument != NULL; argument = argument->next) {
3820 type_t *type = argument->expression->base.datatype;
3822 type = skip_typeref(type);
3823 if(is_type_integer(type)) {
3824 type = promote_integer(type);
3825 } else if(type == type_float) {
3829 argument->expression
3830 = create_implicit_cast(argument->expression, type);
3833 check_format(&result->call);
3836 check_format(&result->call);
3843 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
3845 static bool same_compound_type(const type_t *type1, const type_t *type2)
3848 is_type_compound(type1) &&
3849 type1->kind == type2->kind &&
3850 type1->compound.declaration == type2->compound.declaration;
3854 * Parse a conditional expression, ie. 'expression ? ... : ...'.
3856 * @param expression the conditional expression
3858 static expression_t *parse_conditional_expression(unsigned precedence,
3859 expression_t *expression)
3863 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
3865 conditional_expression_t *conditional = &result->conditional;
3866 conditional->condition = expression;
3869 type_t *const condition_type_orig = expression->base.datatype;
3870 type_t *const condition_type = skip_typeref(condition_type_orig);
3871 if (!is_type_scalar(condition_type) && is_type_valid(condition_type)) {
3872 type_error("expected a scalar type in conditional condition",
3873 expression->base.source_position, condition_type_orig);
3876 expression_t *true_expression = parse_expression();
3878 expression_t *false_expression = parse_sub_expression(precedence);
3880 conditional->true_expression = true_expression;
3881 conditional->false_expression = false_expression;
3883 type_t *const orig_true_type = true_expression->base.datatype;
3884 type_t *const orig_false_type = false_expression->base.datatype;
3885 type_t *const true_type = skip_typeref(orig_true_type);
3886 type_t *const false_type = skip_typeref(orig_false_type);
3889 type_t *result_type;
3890 if (is_type_arithmetic(true_type) && is_type_arithmetic(false_type)) {
3891 result_type = semantic_arithmetic(true_type, false_type);
3893 true_expression = create_implicit_cast(true_expression, result_type);
3894 false_expression = create_implicit_cast(false_expression, result_type);
3896 conditional->true_expression = true_expression;
3897 conditional->false_expression = false_expression;
3898 conditional->expression.datatype = result_type;
3899 } else if (same_compound_type(true_type, false_type) || (
3900 is_type_atomic(true_type, ATOMIC_TYPE_VOID) &&
3901 is_type_atomic(false_type, ATOMIC_TYPE_VOID)
3903 /* just take 1 of the 2 types */
3904 result_type = true_type;
3905 } else if (is_type_pointer(true_type) && is_type_pointer(false_type)
3906 && pointers_compatible(true_type, false_type)) {
3908 result_type = true_type;
3911 if (is_type_valid(true_type) && is_type_valid(false_type)) {
3912 type_error_incompatible("while parsing conditional",
3913 expression->base.source_position, true_type,
3916 result_type = type_error_type;
3919 conditional->expression.datatype = result_type;
3924 * Parse an extension expression.
3926 static expression_t *parse_extension(unsigned precedence)
3928 eat(T___extension__);
3930 /* TODO enable extensions */
3931 expression_t *expression = parse_sub_expression(precedence);
3932 /* TODO disable extensions */
3936 static expression_t *parse_builtin_classify_type(const unsigned precedence)
3938 eat(T___builtin_classify_type);
3940 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
3941 result->base.datatype = type_int;
3944 expression_t *expression = parse_sub_expression(precedence);
3946 result->classify_type.type_expression = expression;
3951 static void semantic_incdec(unary_expression_t *expression)
3953 type_t *const orig_type = expression->value->base.datatype;
3954 type_t *const type = skip_typeref(orig_type);
3955 /* TODO !is_type_real && !is_type_pointer */
3956 if(!is_type_arithmetic(type) && type->kind != TYPE_POINTER) {
3957 if (is_type_valid(type)) {
3958 /* TODO: improve error message */
3959 errorf(HERE, "operation needs an arithmetic or pointer type");
3964 expression->expression.datatype = orig_type;
3967 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
3969 type_t *const orig_type = expression->value->base.datatype;
3970 type_t *const type = skip_typeref(orig_type);
3971 if(!is_type_arithmetic(type)) {
3972 if (is_type_valid(type)) {
3973 /* TODO: improve error message */
3974 errorf(HERE, "operation needs an arithmetic type");
3979 expression->expression.datatype = orig_type;
3982 static void semantic_unexpr_scalar(unary_expression_t *expression)
3984 type_t *const orig_type = expression->value->base.datatype;
3985 type_t *const type = skip_typeref(orig_type);
3986 if (!is_type_scalar(type)) {
3987 if (is_type_valid(type)) {
3988 errorf(HERE, "operand of ! must be of scalar type");
3993 expression->expression.datatype = orig_type;
3996 static void semantic_unexpr_integer(unary_expression_t *expression)
3998 type_t *const orig_type = expression->value->base.datatype;
3999 type_t *const type = skip_typeref(orig_type);
4000 if (!is_type_integer(type)) {
4001 if (is_type_valid(type)) {
4002 errorf(HERE, "operand of ~ must be of integer type");
4007 expression->expression.datatype = orig_type;
4010 static void semantic_dereference(unary_expression_t *expression)
4012 type_t *const orig_type = expression->value->base.datatype;
4013 type_t *const type = skip_typeref(orig_type);
4014 if(!is_type_pointer(type)) {
4015 if (is_type_valid(type)) {
4016 errorf(HERE, "Unary '*' needs pointer or arrray type, but type '%T' given", orig_type);
4021 type_t *result_type = type->pointer.points_to;
4022 result_type = automatic_type_conversion(result_type);
4023 expression->expression.datatype = result_type;
4027 * Check the semantic of the address taken expression.
4029 static void semantic_take_addr(unary_expression_t *expression)
4031 expression_t *value = expression->value;
4032 value->base.datatype = revert_automatic_type_conversion(value);
4034 type_t *orig_type = value->base.datatype;
4035 if(!is_type_valid(orig_type))
4038 if(value->kind == EXPR_REFERENCE) {
4039 declaration_t *const declaration = value->reference.declaration;
4040 if(declaration != NULL) {
4041 if (declaration->storage_class == STORAGE_CLASS_REGISTER) {
4042 errorf(expression->expression.source_position,
4043 "address of register variable '%Y' requested",
4044 declaration->symbol);
4046 declaration->address_taken = 1;
4050 expression->expression.datatype = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
4053 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
4054 static expression_t *parse_##unexpression_type(unsigned precedence) \
4058 expression_t *unary_expression \
4059 = allocate_expression_zero(unexpression_type); \
4060 unary_expression->base.source_position = HERE; \
4061 unary_expression->unary.value = parse_sub_expression(precedence); \
4063 sfunc(&unary_expression->unary); \
4065 return unary_expression; \
4068 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
4069 semantic_unexpr_arithmetic)
4070 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
4071 semantic_unexpr_arithmetic)
4072 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
4073 semantic_unexpr_scalar)
4074 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
4075 semantic_dereference)
4076 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
4078 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
4079 semantic_unexpr_integer)
4080 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
4082 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
4085 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
4087 static expression_t *parse_##unexpression_type(unsigned precedence, \
4088 expression_t *left) \
4090 (void) precedence; \
4093 expression_t *unary_expression \
4094 = allocate_expression_zero(unexpression_type); \
4095 unary_expression->unary.value = left; \
4097 sfunc(&unary_expression->unary); \
4099 return unary_expression; \
4102 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
4103 EXPR_UNARY_POSTFIX_INCREMENT,
4105 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
4106 EXPR_UNARY_POSTFIX_DECREMENT,
4109 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
4111 /* TODO: handle complex + imaginary types */
4113 /* § 6.3.1.8 Usual arithmetic conversions */
4114 if(type_left == type_long_double || type_right == type_long_double) {
4115 return type_long_double;
4116 } else if(type_left == type_double || type_right == type_double) {
4118 } else if(type_left == type_float || type_right == type_float) {
4122 type_right = promote_integer(type_right);
4123 type_left = promote_integer(type_left);
4125 if(type_left == type_right)
4128 bool signed_left = is_type_signed(type_left);
4129 bool signed_right = is_type_signed(type_right);
4130 int rank_left = get_rank(type_left);
4131 int rank_right = get_rank(type_right);
4132 if(rank_left < rank_right) {
4133 if(signed_left == signed_right || !signed_right) {
4139 if(signed_left == signed_right || !signed_left) {
4148 * Check the semantic restrictions for a binary expression.
4150 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
4152 expression_t *const left = expression->left;
4153 expression_t *const right = expression->right;
4154 type_t *const orig_type_left = left->base.datatype;
4155 type_t *const orig_type_right = right->base.datatype;
4156 type_t *const type_left = skip_typeref(orig_type_left);
4157 type_t *const type_right = skip_typeref(orig_type_right);
4159 if(!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
4160 /* TODO: improve error message */
4161 if (is_type_valid(type_left) && is_type_valid(type_right)) {
4162 errorf(HERE, "operation needs arithmetic types");
4167 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
4168 expression->left = create_implicit_cast(left, arithmetic_type);
4169 expression->right = create_implicit_cast(right, arithmetic_type);
4170 expression->expression.datatype = arithmetic_type;
4173 static void semantic_shift_op(binary_expression_t *expression)
4175 expression_t *const left = expression->left;
4176 expression_t *const right = expression->right;
4177 type_t *const orig_type_left = left->base.datatype;
4178 type_t *const orig_type_right = right->base.datatype;
4179 type_t * type_left = skip_typeref(orig_type_left);
4180 type_t * type_right = skip_typeref(orig_type_right);
4182 if(!is_type_integer(type_left) || !is_type_integer(type_right)) {
4183 /* TODO: improve error message */
4184 if (is_type_valid(type_left) && is_type_valid(type_right)) {
4185 errorf(HERE, "operation needs integer types");
4190 type_left = promote_integer(type_left);
4191 type_right = promote_integer(type_right);
4193 expression->left = create_implicit_cast(left, type_left);
4194 expression->right = create_implicit_cast(right, type_right);
4195 expression->expression.datatype = type_left;
4198 static void semantic_add(binary_expression_t *expression)
4200 expression_t *const left = expression->left;
4201 expression_t *const right = expression->right;
4202 type_t *const orig_type_left = left->base.datatype;
4203 type_t *const orig_type_right = right->base.datatype;
4204 type_t *const type_left = skip_typeref(orig_type_left);
4205 type_t *const type_right = skip_typeref(orig_type_right);
4208 if(is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
4209 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
4210 expression->left = create_implicit_cast(left, arithmetic_type);
4211 expression->right = create_implicit_cast(right, arithmetic_type);
4212 expression->expression.datatype = arithmetic_type;
4214 } else if(is_type_pointer(type_left) && is_type_integer(type_right)) {
4215 expression->expression.datatype = type_left;
4216 } else if(is_type_pointer(type_right) && is_type_integer(type_left)) {
4217 expression->expression.datatype = type_right;
4218 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
4219 errorf(HERE, "invalid operands to binary + ('%T', '%T')", orig_type_left, orig_type_right);
4223 static void semantic_sub(binary_expression_t *expression)
4225 expression_t *const left = expression->left;
4226 expression_t *const right = expression->right;
4227 type_t *const orig_type_left = left->base.datatype;
4228 type_t *const orig_type_right = right->base.datatype;
4229 type_t *const type_left = skip_typeref(orig_type_left);
4230 type_t *const type_right = skip_typeref(orig_type_right);
4233 if(is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
4234 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
4235 expression->left = create_implicit_cast(left, arithmetic_type);
4236 expression->right = create_implicit_cast(right, arithmetic_type);
4237 expression->expression.datatype = arithmetic_type;
4239 } else if(is_type_pointer(type_left) && is_type_integer(type_right)) {
4240 expression->expression.datatype = type_left;
4241 } else if(is_type_pointer(type_left) && is_type_pointer(type_right)) {
4242 if(!pointers_compatible(type_left, type_right)) {
4243 errorf(HERE, "pointers to incompatible objects to binary '-' ('%T', '%T')", orig_type_left, orig_type_right);
4245 expression->expression.datatype = type_ptrdiff_t;
4247 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
4248 errorf(HERE, "invalid operands to binary '-' ('%T', '%T')", orig_type_left, orig_type_right);
4252 static void semantic_comparison(binary_expression_t *expression)
4254 expression_t *left = expression->left;
4255 expression_t *right = expression->right;
4256 type_t *orig_type_left = left->base.datatype;
4257 type_t *orig_type_right = right->base.datatype;
4259 type_t *type_left = skip_typeref(orig_type_left);
4260 type_t *type_right = skip_typeref(orig_type_right);
4262 /* TODO non-arithmetic types */
4263 if(is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
4264 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
4265 expression->left = create_implicit_cast(left, arithmetic_type);
4266 expression->right = create_implicit_cast(right, arithmetic_type);
4267 expression->expression.datatype = arithmetic_type;
4268 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
4269 /* TODO check compatibility */
4270 } else if (is_type_pointer(type_left)) {
4271 expression->right = create_implicit_cast(right, type_left);
4272 } else if (is_type_pointer(type_right)) {
4273 expression->left = create_implicit_cast(left, type_right);
4274 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
4275 type_error_incompatible("invalid operands in comparison",
4276 token.source_position, type_left, type_right);
4278 expression->expression.datatype = type_int;
4281 static void semantic_arithmetic_assign(binary_expression_t *expression)
4283 expression_t *left = expression->left;
4284 expression_t *right = expression->right;
4285 type_t *orig_type_left = left->base.datatype;
4286 type_t *orig_type_right = right->base.datatype;
4288 type_t *type_left = skip_typeref(orig_type_left);
4289 type_t *type_right = skip_typeref(orig_type_right);
4291 if(!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
4292 /* TODO: improve error message */
4293 if (is_type_valid(type_left) && is_type_valid(type_right)) {
4294 errorf(HERE, "operation needs arithmetic types");
4299 /* combined instructions are tricky. We can't create an implicit cast on
4300 * the left side, because we need the uncasted form for the store.
4301 * The ast2firm pass has to know that left_type must be right_type
4302 * for the arithmetic operation and create a cast by itself */
4303 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
4304 expression->right = create_implicit_cast(right, arithmetic_type);
4305 expression->expression.datatype = type_left;
4308 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
4310 expression_t *const left = expression->left;
4311 expression_t *const right = expression->right;
4312 type_t *const orig_type_left = left->base.datatype;
4313 type_t *const orig_type_right = right->base.datatype;
4314 type_t *const type_left = skip_typeref(orig_type_left);
4315 type_t *const type_right = skip_typeref(orig_type_right);
4317 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
4318 /* combined instructions are tricky. We can't create an implicit cast on
4319 * the left side, because we need the uncasted form for the store.
4320 * The ast2firm pass has to know that left_type must be right_type
4321 * for the arithmetic operation and create a cast by itself */
4322 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
4323 expression->right = create_implicit_cast(right, arithmetic_type);
4324 expression->expression.datatype = type_left;
4325 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
4326 expression->expression.datatype = type_left;
4327 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
4328 errorf(HERE, "incompatible types '%T' and '%T' in assignment", orig_type_left, orig_type_right);
4333 * Check the semantic restrictions of a logical expression.
4335 static void semantic_logical_op(binary_expression_t *expression)
4337 expression_t *const left = expression->left;
4338 expression_t *const right = expression->right;
4339 type_t *const orig_type_left = left->base.datatype;
4340 type_t *const orig_type_right = right->base.datatype;
4341 type_t *const type_left = skip_typeref(orig_type_left);
4342 type_t *const type_right = skip_typeref(orig_type_right);
4344 if (!is_type_scalar(type_left) || !is_type_scalar(type_right)) {
4345 /* TODO: improve error message */
4346 if (is_type_valid(type_left) && is_type_valid(type_right)) {
4347 errorf(HERE, "operation needs scalar types");
4352 expression->expression.datatype = type_int;
4356 * Checks if a compound type has constant fields.
4358 static bool has_const_fields(const compound_type_t *type)
4360 const context_t *context = &type->declaration->context;
4361 const declaration_t *declaration = context->declarations;
4363 for (; declaration != NULL; declaration = declaration->next) {
4364 if (declaration->namespc != NAMESPACE_NORMAL)
4367 const type_t *decl_type = skip_typeref(declaration->type);
4368 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
4376 * Check the semantic restrictions of a binary assign expression.
4378 static void semantic_binexpr_assign(binary_expression_t *expression)
4380 expression_t *left = expression->left;
4381 type_t *orig_type_left = left->base.datatype;
4383 type_t *type_left = revert_automatic_type_conversion(left);
4384 type_left = skip_typeref(orig_type_left);
4386 /* must be a modifiable lvalue */
4387 if (is_type_array(type_left)) {
4388 errorf(HERE, "cannot assign to arrays ('%E')", left);
4391 if(type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
4392 errorf(HERE, "assignment to readonly location '%E' (type '%T')", left,
4396 if(is_type_incomplete(type_left)) {
4398 "left-hand side of assignment '%E' has incomplete type '%T'",
4399 left, orig_type_left);
4402 if(is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
4403 errorf(HERE, "cannot assign to '%E' because compound type '%T' has readonly fields",
4404 left, orig_type_left);
4408 type_t *const res_type = semantic_assign(orig_type_left, expression->right,
4410 if (res_type == NULL) {
4411 errorf(expression->expression.source_position,
4412 "cannot assign to '%T' from '%T'",
4413 orig_type_left, expression->right->base.datatype);
4415 expression->right = create_implicit_cast(expression->right, res_type);
4418 expression->expression.datatype = orig_type_left;
4421 static bool expression_has_effect(const expression_t *const expr)
4423 switch (expr->kind) {
4424 case EXPR_UNKNOWN: break;
4425 case EXPR_INVALID: break;
4426 case EXPR_REFERENCE: return false;
4427 case EXPR_CONST: return false;
4428 case EXPR_STRING_LITERAL: return false;
4429 case EXPR_WIDE_STRING_LITERAL: return false;
4431 const call_expression_t *const call = &expr->call;
4432 if (call->function->kind != EXPR_BUILTIN_SYMBOL)
4435 switch (call->function->builtin_symbol.symbol->ID) {
4436 case T___builtin_va_end: return true;
4437 default: return false;
4440 case EXPR_CONDITIONAL: {
4441 const conditional_expression_t *const cond = &expr->conditional;
4443 expression_has_effect(cond->true_expression) &&
4444 expression_has_effect(cond->false_expression);
4446 case EXPR_SELECT: return false;
4447 case EXPR_ARRAY_ACCESS: return false;
4448 case EXPR_SIZEOF: return false;
4449 case EXPR_CLASSIFY_TYPE: return false;
4450 case EXPR_ALIGNOF: return false;
4452 case EXPR_FUNCTION: return false;
4453 case EXPR_PRETTY_FUNCTION: return false;
4454 case EXPR_BUILTIN_SYMBOL: break; /* handled in EXPR_CALL */
4455 case EXPR_BUILTIN_CONSTANT_P: return false;
4456 case EXPR_BUILTIN_PREFETCH: return true;
4457 case EXPR_OFFSETOF: return false;
4458 case EXPR_VA_START: return true;
4459 case EXPR_VA_ARG: return true;
4460 case EXPR_STATEMENT: return true; // TODO
4462 case EXPR_UNARY_NEGATE: return false;
4463 case EXPR_UNARY_PLUS: return false;
4464 case EXPR_UNARY_BITWISE_NEGATE: return false;
4465 case EXPR_UNARY_NOT: return false;
4466 case EXPR_UNARY_DEREFERENCE: return false;
4467 case EXPR_UNARY_TAKE_ADDRESS: return false;
4468 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
4469 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
4470 case EXPR_UNARY_PREFIX_INCREMENT: return true;
4471 case EXPR_UNARY_PREFIX_DECREMENT: return true;
4472 case EXPR_UNARY_CAST:
4473 return is_type_atomic(expr->base.datatype, ATOMIC_TYPE_VOID);
4474 case EXPR_UNARY_CAST_IMPLICIT: return true;
4475 case EXPR_UNARY_ASSUME: return true;
4476 case EXPR_UNARY_BITFIELD_EXTRACT: return false;
4478 case EXPR_BINARY_ADD: return false;
4479 case EXPR_BINARY_SUB: return false;
4480 case EXPR_BINARY_MUL: return false;
4481 case EXPR_BINARY_DIV: return false;
4482 case EXPR_BINARY_MOD: return false;
4483 case EXPR_BINARY_EQUAL: return false;
4484 case EXPR_BINARY_NOTEQUAL: return false;
4485 case EXPR_BINARY_LESS: return false;
4486 case EXPR_BINARY_LESSEQUAL: return false;
4487 case EXPR_BINARY_GREATER: return false;
4488 case EXPR_BINARY_GREATEREQUAL: return false;
4489 case EXPR_BINARY_BITWISE_AND: return false;
4490 case EXPR_BINARY_BITWISE_OR: return false;
4491 case EXPR_BINARY_BITWISE_XOR: return false;
4492 case EXPR_BINARY_SHIFTLEFT: return false;
4493 case EXPR_BINARY_SHIFTRIGHT: return false;
4494 case EXPR_BINARY_ASSIGN: return true;
4495 case EXPR_BINARY_MUL_ASSIGN: return true;
4496 case EXPR_BINARY_DIV_ASSIGN: return true;
4497 case EXPR_BINARY_MOD_ASSIGN: return true;
4498 case EXPR_BINARY_ADD_ASSIGN: return true;
4499 case EXPR_BINARY_SUB_ASSIGN: return true;
4500 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
4501 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
4502 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
4503 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
4504 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
4505 case EXPR_BINARY_LOGICAL_AND:
4506 case EXPR_BINARY_LOGICAL_OR:
4507 case EXPR_BINARY_COMMA:
4508 return expression_has_effect(expr->binary.right);
4510 case EXPR_BINARY_BUILTIN_EXPECT: return true;
4511 case EXPR_BINARY_ISGREATER: return false;
4512 case EXPR_BINARY_ISGREATEREQUAL: return false;
4513 case EXPR_BINARY_ISLESS: return false;
4514 case EXPR_BINARY_ISLESSEQUAL: return false;
4515 case EXPR_BINARY_ISLESSGREATER: return false;
4516 case EXPR_BINARY_ISUNORDERED: return false;
4519 panic("unexpected statement");
4522 static void semantic_comma(binary_expression_t *expression)
4524 if (warning.unused_value) {
4525 const expression_t *const left = expression->left;
4526 if (!expression_has_effect(left)) {
4527 warningf(left->base.source_position, "left-hand operand of comma expression has no effect");
4530 expression->expression.datatype = expression->right->base.datatype;
4533 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, sfunc, lr) \
4534 static expression_t *parse_##binexpression_type(unsigned precedence, \
4535 expression_t *left) \
4539 expression_t *right = parse_sub_expression(precedence + lr); \
4541 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
4542 binexpr->binary.left = left; \
4543 binexpr->binary.right = right; \
4544 sfunc(&binexpr->binary); \
4549 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, semantic_comma, 1)
4550 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, semantic_binexpr_arithmetic, 1)
4551 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, semantic_binexpr_arithmetic, 1)
4552 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, semantic_binexpr_arithmetic, 1)
4553 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, semantic_add, 1)
4554 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, semantic_sub, 1)
4555 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, semantic_comparison, 1)
4556 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, semantic_comparison, 1)
4557 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, semantic_binexpr_assign, 0)
4559 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL,
4560 semantic_comparison, 1)
4561 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL,
4562 semantic_comparison, 1)
4563 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL,
4564 semantic_comparison, 1)
4565 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL,
4566 semantic_comparison, 1)
4568 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND,
4569 semantic_binexpr_arithmetic, 1)
4570 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR,
4571 semantic_binexpr_arithmetic, 1)
4572 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR,
4573 semantic_binexpr_arithmetic, 1)
4574 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND,
4575 semantic_logical_op, 1)
4576 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR,
4577 semantic_logical_op, 1)
4578 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT,
4579 semantic_shift_op, 1)
4580 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT,
4581 semantic_shift_op, 1)
4582 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN,
4583 semantic_arithmetic_addsubb_assign, 0)
4584 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN,
4585 semantic_arithmetic_addsubb_assign, 0)
4586 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN,
4587 semantic_arithmetic_assign, 0)
4588 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN,
4589 semantic_arithmetic_assign, 0)
4590 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN,
4591 semantic_arithmetic_assign, 0)
4592 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN,
4593 semantic_arithmetic_assign, 0)
4594 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN,
4595 semantic_arithmetic_assign, 0)
4596 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN,
4597 semantic_arithmetic_assign, 0)
4598 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN,
4599 semantic_arithmetic_assign, 0)
4600 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN,
4601 semantic_arithmetic_assign, 0)
4603 static expression_t *parse_sub_expression(unsigned precedence)
4605 if(token.type < 0) {
4606 return expected_expression_error();
4609 expression_parser_function_t *parser
4610 = &expression_parsers[token.type];
4611 source_position_t source_position = token.source_position;
4614 if(parser->parser != NULL) {
4615 left = parser->parser(parser->precedence);
4617 left = parse_primary_expression();
4619 assert(left != NULL);
4620 left->base.source_position = source_position;
4623 if(token.type < 0) {
4624 return expected_expression_error();
4627 parser = &expression_parsers[token.type];
4628 if(parser->infix_parser == NULL)
4630 if(parser->infix_precedence < precedence)
4633 left = parser->infix_parser(parser->infix_precedence, left);
4635 assert(left != NULL);
4636 assert(left->kind != EXPR_UNKNOWN);
4637 left->base.source_position = source_position;
4644 * Parse an expression.
4646 static expression_t *parse_expression(void)
4648 return parse_sub_expression(1);
4652 * Register a parser for a prefix-like operator with given precedence.
4654 * @param parser the parser function
4655 * @param token_type the token type of the prefix token
4656 * @param precedence the precedence of the operator
4658 static void register_expression_parser(parse_expression_function parser,
4659 int token_type, unsigned precedence)
4661 expression_parser_function_t *entry = &expression_parsers[token_type];
4663 if(entry->parser != NULL) {
4664 diagnosticf("for token '%k'\n", (token_type_t)token_type);
4665 panic("trying to register multiple expression parsers for a token");
4667 entry->parser = parser;
4668 entry->precedence = precedence;
4672 * Register a parser for an infix operator with given precedence.
4674 * @param parser the parser function
4675 * @param token_type the token type of the infix operator
4676 * @param precedence the precedence of the operator
4678 static void register_infix_parser(parse_expression_infix_function parser,
4679 int token_type, unsigned precedence)
4681 expression_parser_function_t *entry = &expression_parsers[token_type];
4683 if(entry->infix_parser != NULL) {
4684 diagnosticf("for token '%k'\n", (token_type_t)token_type);
4685 panic("trying to register multiple infix expression parsers for a "
4688 entry->infix_parser = parser;
4689 entry->infix_precedence = precedence;
4693 * Initialize the expression parsers.
4695 static void init_expression_parsers(void)
4697 memset(&expression_parsers, 0, sizeof(expression_parsers));
4699 register_infix_parser(parse_array_expression, '[', 30);
4700 register_infix_parser(parse_call_expression, '(', 30);
4701 register_infix_parser(parse_select_expression, '.', 30);
4702 register_infix_parser(parse_select_expression, T_MINUSGREATER, 30);
4703 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT,
4705 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT,
4708 register_infix_parser(parse_EXPR_BINARY_MUL, '*', 16);
4709 register_infix_parser(parse_EXPR_BINARY_DIV, '/', 16);
4710 register_infix_parser(parse_EXPR_BINARY_MOD, '%', 16);
4711 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, 16);
4712 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, 16);
4713 register_infix_parser(parse_EXPR_BINARY_ADD, '+', 15);
4714 register_infix_parser(parse_EXPR_BINARY_SUB, '-', 15);
4715 register_infix_parser(parse_EXPR_BINARY_LESS, '<', 14);
4716 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', 14);
4717 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, 14);
4718 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, 14);
4719 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, 13);
4720 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL,
4721 T_EXCLAMATIONMARKEQUAL, 13);
4722 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', 12);
4723 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', 11);
4724 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', 10);
4725 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, 9);
4726 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, 8);
4727 register_infix_parser(parse_conditional_expression, '?', 7);
4728 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', 2);
4729 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, 2);
4730 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, 2);
4731 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, 2);
4732 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, 2);
4733 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, 2);
4734 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN,
4735 T_LESSLESSEQUAL, 2);
4736 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN,
4737 T_GREATERGREATEREQUAL, 2);
4738 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN,
4740 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN,
4742 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN,
4745 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', 1);
4747 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-', 25);
4748 register_expression_parser(parse_EXPR_UNARY_PLUS, '+', 25);
4749 register_expression_parser(parse_EXPR_UNARY_NOT, '!', 25);
4750 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~', 25);
4751 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*', 25);
4752 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&', 25);
4753 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT,
4755 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT,
4757 register_expression_parser(parse_sizeof, T_sizeof, 25);
4758 register_expression_parser(parse_extension, T___extension__, 25);
4759 register_expression_parser(parse_builtin_classify_type,
4760 T___builtin_classify_type, 25);
4764 * Parse a asm statement constraints specification.
4766 static asm_constraint_t *parse_asm_constraints(void)
4768 asm_constraint_t *result = NULL;
4769 asm_constraint_t *last = NULL;
4771 while(token.type == T_STRING_LITERAL || token.type == '[') {
4772 asm_constraint_t *constraint = allocate_ast_zero(sizeof(constraint[0]));
4773 memset(constraint, 0, sizeof(constraint[0]));
4775 if(token.type == '[') {
4777 if(token.type != T_IDENTIFIER) {
4778 parse_error_expected("while parsing asm constraint",
4782 constraint->symbol = token.v.symbol;
4787 constraint->constraints = parse_string_literals();
4789 constraint->expression = parse_expression();
4793 last->next = constraint;
4795 result = constraint;
4799 if(token.type != ',')
4808 * Parse a asm statement clobber specification.
4810 static asm_clobber_t *parse_asm_clobbers(void)
4812 asm_clobber_t *result = NULL;
4813 asm_clobber_t *last = NULL;
4815 while(token.type == T_STRING_LITERAL) {
4816 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
4817 clobber->clobber = parse_string_literals();
4820 last->next = clobber;
4826 if(token.type != ',')
4835 * Parse an asm statement.
4837 static statement_t *parse_asm_statement(void)
4841 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
4842 statement->base.source_position = token.source_position;
4844 asm_statement_t *asm_statement = &statement->asms;
4846 if(token.type == T_volatile) {
4848 asm_statement->is_volatile = true;
4852 asm_statement->asm_text = parse_string_literals();
4854 if(token.type != ':')
4858 asm_statement->inputs = parse_asm_constraints();
4859 if(token.type != ':')
4863 asm_statement->outputs = parse_asm_constraints();
4864 if(token.type != ':')
4868 asm_statement->clobbers = parse_asm_clobbers();
4877 * Parse a case statement.
4879 static statement_t *parse_case_statement(void)
4883 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
4885 statement->base.source_position = token.source_position;
4886 statement->case_label.expression = parse_expression();
4890 if (! is_constant_expression(statement->case_label.expression)) {
4891 errorf(statement->base.source_position,
4892 "case label does not reduce to an integer constant");
4894 /* TODO: check if the case label is already known */
4895 if (current_switch != NULL) {
4896 /* link all cases into the switch statement */
4897 if (current_switch->last_case == NULL) {
4898 current_switch->first_case =
4899 current_switch->last_case = &statement->case_label;
4901 current_switch->last_case->next = &statement->case_label;
4904 errorf(statement->base.source_position,
4905 "case label not within a switch statement");
4908 statement->case_label.label_statement = parse_statement();
4914 * Finds an existing default label of a switch statement.
4916 static case_label_statement_t *
4917 find_default_label(const switch_statement_t *statement)
4919 for (case_label_statement_t *label = statement->first_case;
4921 label = label->next) {
4922 if (label->expression == NULL)
4929 * Parse a default statement.
4931 static statement_t *parse_default_statement(void)
4935 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
4937 statement->base.source_position = token.source_position;
4940 if (current_switch != NULL) {
4941 const case_label_statement_t *def_label = find_default_label(current_switch);
4942 if (def_label != NULL) {
4943 errorf(HERE, "multiple default labels in one switch");
4944 errorf(def_label->statement.source_position,
4945 "this is the first default label");
4947 /* link all cases into the switch statement */
4948 if (current_switch->last_case == NULL) {
4949 current_switch->first_case =
4950 current_switch->last_case = &statement->case_label;
4952 current_switch->last_case->next = &statement->case_label;
4956 errorf(statement->base.source_position,
4957 "'default' label not within a switch statement");
4959 statement->label.label_statement = parse_statement();
4965 * Return the declaration for a given label symbol or create a new one.
4967 static declaration_t *get_label(symbol_t *symbol)
4969 declaration_t *candidate = get_declaration(symbol, NAMESPACE_LABEL);
4970 assert(current_function != NULL);
4971 /* if we found a label in the same function, then we already created the
4973 if(candidate != NULL
4974 && candidate->parent_context == ¤t_function->context) {
4978 /* otherwise we need to create a new one */
4979 declaration_t *const declaration = allocate_declaration_zero();
4980 declaration->namespc = NAMESPACE_LABEL;
4981 declaration->symbol = symbol;
4983 label_push(declaration);
4989 * Parse a label statement.
4991 static statement_t *parse_label_statement(void)
4993 assert(token.type == T_IDENTIFIER);
4994 symbol_t *symbol = token.v.symbol;
4997 declaration_t *label = get_label(symbol);
4999 /* if source position is already set then the label is defined twice,
5000 * otherwise it was just mentioned in a goto so far */
5001 if(label->source_position.input_name != NULL) {
5002 errorf(HERE, "duplicate label '%Y'", symbol);
5003 errorf(label->source_position, "previous definition of '%Y' was here",
5006 label->source_position = token.source_position;
5009 label_statement_t *label_statement = allocate_ast_zero(sizeof(label[0]));
5011 label_statement->statement.kind = STATEMENT_LABEL;
5012 label_statement->statement.source_position = token.source_position;
5013 label_statement->label = label;
5017 if(token.type == '}') {
5018 /* TODO only warn? */
5019 errorf(HERE, "label at end of compound statement");
5020 return (statement_t*) label_statement;
5022 label_statement->label_statement = parse_statement();
5025 return (statement_t*) label_statement;
5029 * Parse an if statement.
5031 static statement_t *parse_if(void)
5035 if_statement_t *statement = allocate_ast_zero(sizeof(statement[0]));
5036 statement->statement.kind = STATEMENT_IF;
5037 statement->statement.source_position = token.source_position;
5040 statement->condition = parse_expression();
5043 statement->true_statement = parse_statement();
5044 if(token.type == T_else) {
5046 statement->false_statement = parse_statement();
5049 return (statement_t*) statement;
5053 * Parse a switch statement.
5055 static statement_t *parse_switch(void)
5059 switch_statement_t *statement = allocate_ast_zero(sizeof(statement[0]));
5060 statement->statement.kind = STATEMENT_SWITCH;
5061 statement->statement.source_position = token.source_position;
5064 expression_t *const expr = parse_expression();
5065 type_t * type = skip_typeref(expr->base.datatype);
5066 if (is_type_integer(type)) {
5067 type = promote_integer(type);
5068 } else if (is_type_valid(type)) {
5069 errorf(expr->base.source_position, "switch quantity is not an integer, but '%T'", type);
5070 type = type_error_type;
5072 statement->expression = create_implicit_cast(expr, type);
5075 switch_statement_t *rem = current_switch;
5076 current_switch = statement;
5077 statement->body = parse_statement();
5078 current_switch = rem;
5080 if (warning.switch_default && find_default_label(statement) == NULL) {
5081 warningf(statement->statement.source_position, "switch has no default case");
5084 return (statement_t*) statement;
5087 static statement_t *parse_loop_body(statement_t *const loop)
5089 statement_t *const rem = current_loop;
5090 current_loop = loop;
5091 statement_t *const body = parse_statement();
5097 * Parse a while statement.
5099 static statement_t *parse_while(void)
5103 while_statement_t *statement = allocate_ast_zero(sizeof(statement[0]));
5104 statement->statement.kind = STATEMENT_WHILE;
5105 statement->statement.source_position = token.source_position;
5108 statement->condition = parse_expression();
5111 statement->body = parse_loop_body((statement_t*)statement);
5113 return (statement_t*) statement;
5117 * Parse a do statement.
5119 static statement_t *parse_do(void)
5123 do_while_statement_t *statement = allocate_ast_zero(sizeof(statement[0]));
5124 statement->statement.kind = STATEMENT_DO_WHILE;
5125 statement->statement.source_position = token.source_position;
5127 statement->body = parse_loop_body((statement_t*)statement);
5130 statement->condition = parse_expression();
5134 return (statement_t*) statement;
5138 * Parse a for statement.
5140 static statement_t *parse_for(void)
5144 for_statement_t *statement = allocate_ast_zero(sizeof(statement[0]));
5145 statement->statement.kind = STATEMENT_FOR;
5146 statement->statement.source_position = token.source_position;
5150 int top = environment_top();
5151 context_t *last_context = context;
5152 set_context(&statement->context);
5154 if(token.type != ';') {
5155 if(is_declaration_specifier(&token, false)) {
5156 parse_declaration(record_declaration);
5158 statement->initialisation = parse_expression();
5165 if(token.type != ';') {
5166 statement->condition = parse_expression();
5169 if(token.type != ')') {
5170 statement->step = parse_expression();
5173 statement->body = parse_loop_body((statement_t*)statement);
5175 assert(context == &statement->context);
5176 set_context(last_context);
5177 environment_pop_to(top);
5179 return (statement_t*) statement;
5183 * Parse a goto statement.
5185 static statement_t *parse_goto(void)
5189 if(token.type != T_IDENTIFIER) {
5190 parse_error_expected("while parsing goto", T_IDENTIFIER, 0);
5194 symbol_t *symbol = token.v.symbol;
5197 declaration_t *label = get_label(symbol);
5199 goto_statement_t *statement = allocate_ast_zero(sizeof(statement[0]));
5201 statement->statement.kind = STATEMENT_GOTO;
5202 statement->statement.source_position = token.source_position;
5204 statement->label = label;
5206 /* remember the goto's in a list for later checking */
5207 if (goto_last == NULL) {
5208 goto_first = goto_last = statement;
5210 goto_last->next = statement;
5215 return (statement_t*) statement;
5219 * Parse a continue statement.
5221 static statement_t *parse_continue(void)
5223 statement_t *statement;
5224 if (current_loop == NULL) {
5225 errorf(HERE, "continue statement not within loop");
5228 statement = allocate_statement_zero(STATEMENT_CONTINUE);
5230 statement->base.source_position = token.source_position;
5240 * Parse a break statement.
5242 static statement_t *parse_break(void)
5244 statement_t *statement;
5245 if (current_switch == NULL && current_loop == NULL) {
5246 errorf(HERE, "break statement not within loop or switch");
5249 statement = allocate_statement_zero(STATEMENT_BREAK);
5251 statement->base.source_position = token.source_position;
5261 * Check if a given declaration represents a local variable.
5263 static bool is_local_var_declaration(const declaration_t *declaration) {
5264 switch ((storage_class_tag_t) declaration->storage_class) {
5265 case STORAGE_CLASS_NONE:
5266 case STORAGE_CLASS_AUTO:
5267 case STORAGE_CLASS_REGISTER: {
5268 const type_t *type = skip_typeref(declaration->type);
5269 if(is_type_function(type)) {
5281 * Check if a given expression represents a local variable.
5283 static bool is_local_variable(const expression_t *expression)
5285 if (expression->base.kind != EXPR_REFERENCE) {
5288 const declaration_t *declaration = expression->reference.declaration;
5289 return is_local_var_declaration(declaration);
5293 * Parse a return statement.
5295 static statement_t *parse_return(void)
5299 return_statement_t *statement = allocate_ast_zero(sizeof(statement[0]));
5301 statement->statement.kind = STATEMENT_RETURN;
5302 statement->statement.source_position = token.source_position;
5304 expression_t *return_value = NULL;
5305 if(token.type != ';') {
5306 return_value = parse_expression();
5310 const type_t *const func_type = current_function->type;
5311 assert(is_type_function(func_type));
5312 type_t *const return_type = skip_typeref(func_type->function.return_type);
5314 if(return_value != NULL) {
5315 type_t *return_value_type = skip_typeref(return_value->base.datatype);
5317 if(is_type_atomic(return_type, ATOMIC_TYPE_VOID)
5318 && !is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
5319 warningf(statement->statement.source_position,
5320 "'return' with a value, in function returning void");
5321 return_value = NULL;
5323 type_t *const res_type = semantic_assign(return_type,
5324 return_value, "'return'");
5325 if (res_type == NULL) {
5326 errorf(statement->statement.source_position,
5327 "cannot return something of type '%T' in function returning '%T'",
5328 return_value->base.datatype, return_type);
5330 return_value = create_implicit_cast(return_value, res_type);
5333 /* check for returning address of a local var */
5334 if (return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
5335 const expression_t *expression = return_value->unary.value;
5336 if (is_local_variable(expression)) {
5337 warningf(statement->statement.source_position,
5338 "function returns address of local variable");
5342 if(!is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
5343 warningf(statement->statement.source_position,
5344 "'return' without value, in function returning non-void");
5347 statement->return_value = return_value;
5349 return (statement_t*) statement;
5353 * Parse a declaration statement.
5355 static statement_t *parse_declaration_statement(void)
5357 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
5359 statement->base.source_position = token.source_position;
5361 declaration_t *before = last_declaration;
5362 parse_declaration(record_declaration);
5364 if(before == NULL) {
5365 statement->declaration.declarations_begin = context->declarations;
5367 statement->declaration.declarations_begin = before->next;
5369 statement->declaration.declarations_end = last_declaration;
5375 * Parse an expression statement, ie. expr ';'.
5377 static statement_t *parse_expression_statement(void)
5379 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
5381 statement->base.source_position = token.source_position;
5382 expression_t *const expr = parse_expression();
5383 statement->expression.expression = expr;
5385 if (warning.unused_value && !expression_has_effect(expr)) {
5386 warningf(expr->base.source_position, "statement has no effect");
5395 * Parse a statement.
5397 static statement_t *parse_statement(void)
5399 statement_t *statement = NULL;
5401 /* declaration or statement */
5402 switch(token.type) {
5404 statement = parse_asm_statement();
5408 statement = parse_case_statement();
5412 statement = parse_default_statement();
5416 statement = parse_compound_statement();
5420 statement = parse_if();
5424 statement = parse_switch();
5428 statement = parse_while();
5432 statement = parse_do();
5436 statement = parse_for();
5440 statement = parse_goto();
5444 statement = parse_continue();
5448 statement = parse_break();
5452 statement = parse_return();
5456 if (warning.empty_statement) {
5457 warningf(HERE, "statement is empty");
5464 if(look_ahead(1)->type == ':') {
5465 statement = parse_label_statement();
5469 if(is_typedef_symbol(token.v.symbol)) {
5470 statement = parse_declaration_statement();
5474 statement = parse_expression_statement();
5477 case T___extension__:
5478 /* this can be a prefix to a declaration or an expression statement */
5479 /* we simply eat it now and parse the rest with tail recursion */
5482 } while(token.type == T___extension__);
5483 statement = parse_statement();
5487 statement = parse_declaration_statement();
5491 statement = parse_expression_statement();
5495 assert(statement == NULL
5496 || statement->base.source_position.input_name != NULL);
5502 * Parse a compound statement.
5504 static statement_t *parse_compound_statement(void)
5506 compound_statement_t *const compound_statement
5507 = allocate_ast_zero(sizeof(compound_statement[0]));
5508 compound_statement->statement.kind = STATEMENT_COMPOUND;
5509 compound_statement->statement.source_position = token.source_position;
5513 int top = environment_top();
5514 context_t *last_context = context;
5515 set_context(&compound_statement->context);
5517 statement_t *last_statement = NULL;
5519 while(token.type != '}' && token.type != T_EOF) {
5520 statement_t *statement = parse_statement();
5521 if(statement == NULL)
5524 if(last_statement != NULL) {
5525 last_statement->base.next = statement;
5527 compound_statement->statements = statement;
5530 while(statement->base.next != NULL)
5531 statement = statement->base.next;
5533 last_statement = statement;
5536 if(token.type == '}') {
5539 errorf(compound_statement->statement.source_position, "end of file while looking for closing '}'");
5542 assert(context == &compound_statement->context);
5543 set_context(last_context);
5544 environment_pop_to(top);
5546 return (statement_t*) compound_statement;
5550 * Initialize builtin types.
5552 static void initialize_builtin_types(void)
5554 type_intmax_t = make_global_typedef("__intmax_t__", type_long_long);
5555 type_size_t = make_global_typedef("__SIZE_TYPE__", type_unsigned_long);
5556 type_ssize_t = make_global_typedef("__SSIZE_TYPE__", type_long);
5557 type_ptrdiff_t = make_global_typedef("__PTRDIFF_TYPE__", type_long);
5558 type_uintmax_t = make_global_typedef("__uintmax_t__", type_unsigned_long_long);
5559 type_uptrdiff_t = make_global_typedef("__UPTRDIFF_TYPE__", type_unsigned_long);
5560 type_wchar_t = make_global_typedef("__WCHAR_TYPE__", type_int);
5561 type_wint_t = make_global_typedef("__WINT_TYPE__", type_int);
5563 type_intmax_t_ptr = make_pointer_type(type_intmax_t, TYPE_QUALIFIER_NONE);
5564 type_ptrdiff_t_ptr = make_pointer_type(type_ptrdiff_t, TYPE_QUALIFIER_NONE);
5565 type_ssize_t_ptr = make_pointer_type(type_ssize_t, TYPE_QUALIFIER_NONE);
5566 type_wchar_t_ptr = make_pointer_type(type_wchar_t, TYPE_QUALIFIER_NONE);
5570 * Parse a translation unit.
5572 static translation_unit_t *parse_translation_unit(void)
5574 translation_unit_t *unit = allocate_ast_zero(sizeof(unit[0]));
5576 assert(global_context == NULL);
5577 global_context = &unit->context;
5579 assert(context == NULL);
5580 set_context(&unit->context);
5582 initialize_builtin_types();
5584 while(token.type != T_EOF) {
5585 if (token.type == ';') {
5586 /* TODO error in strict mode */
5587 warningf(HERE, "stray ';' outside of function");
5590 parse_external_declaration();
5594 assert(context == &unit->context);
5596 last_declaration = NULL;
5598 assert(global_context == &unit->context);
5599 global_context = NULL;
5607 * @return the translation unit or NULL if errors occurred.
5609 translation_unit_t *parse(void)
5611 environment_stack = NEW_ARR_F(stack_entry_t, 0);
5612 label_stack = NEW_ARR_F(stack_entry_t, 0);
5613 diagnostic_count = 0;
5617 type_set_output(stderr);
5618 ast_set_output(stderr);
5620 lookahead_bufpos = 0;
5621 for(int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
5624 translation_unit_t *unit = parse_translation_unit();
5626 DEL_ARR_F(environment_stack);
5627 DEL_ARR_F(label_stack);
5636 * Initialize the parser.
5638 void init_parser(void)
5640 init_expression_parsers();
5641 obstack_init(&temp_obst);
5643 symbol_t *const va_list_sym = symbol_table_insert("__builtin_va_list");
5644 type_valist = create_builtin_type(va_list_sym, type_void_ptr);
5648 * Terminate the parser.
5650 void exit_parser(void)
5652 obstack_free(&temp_obst, NULL);