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 scope_t *global_scope = NULL;
48 static scope_t *scope = 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 label_statement_t *label_first = NULL;
56 static label_statement_t *label_last = NULL;
57 static struct obstack temp_obst;
59 /** The current source position. */
60 #define HERE token.source_position
62 static type_t *type_valist;
64 static statement_t *parse_compound_statement(void);
65 static statement_t *parse_statement(void);
67 static expression_t *parse_sub_expression(unsigned precedence);
68 static expression_t *parse_expression(void);
69 static type_t *parse_typename(void);
71 static void parse_compound_type_entries(declaration_t *compound_declaration);
72 static declaration_t *parse_declarator(
73 const declaration_specifiers_t *specifiers, bool may_be_abstract);
74 static declaration_t *record_declaration(declaration_t *declaration);
76 static void semantic_comparison(binary_expression_t *expression);
78 #define STORAGE_CLASSES \
85 #define TYPE_QUALIFIERS \
92 #ifdef PROVIDE_COMPLEX
93 #define COMPLEX_SPECIFIERS \
95 #define IMAGINARY_SPECIFIERS \
98 #define COMPLEX_SPECIFIERS
99 #define IMAGINARY_SPECIFIERS
102 #define TYPE_SPECIFIERS \
117 case T___builtin_va_list: \
121 #define DECLARATION_START \
126 #define TYPENAME_START \
131 * Allocate an AST node with given size and
132 * initialize all fields with zero.
134 static void *allocate_ast_zero(size_t size)
136 void *res = allocate_ast(size);
137 memset(res, 0, size);
141 static declaration_t *allocate_declaration_zero(void)
143 declaration_t *declaration = allocate_ast_zero(sizeof(declaration_t));
144 declaration->type = type_error_type;
149 * Returns the size of a statement node.
151 * @param kind the statement kind
153 static size_t get_statement_struct_size(statement_kind_t kind)
155 static const size_t sizes[] = {
156 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
157 [STATEMENT_RETURN] = sizeof(return_statement_t),
158 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
159 [STATEMENT_IF] = sizeof(if_statement_t),
160 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
161 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
162 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
163 [STATEMENT_BREAK] = sizeof(statement_base_t),
164 [STATEMENT_GOTO] = sizeof(goto_statement_t),
165 [STATEMENT_LABEL] = sizeof(label_statement_t),
166 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
167 [STATEMENT_WHILE] = sizeof(while_statement_t),
168 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
169 [STATEMENT_FOR] = sizeof(for_statement_t),
170 [STATEMENT_ASM] = sizeof(asm_statement_t)
172 assert(kind <= sizeof(sizes) / sizeof(sizes[0]));
173 assert(sizes[kind] != 0);
178 * Allocate a statement node of given kind and initialize all
181 static statement_t *allocate_statement_zero(statement_kind_t kind)
183 size_t size = get_statement_struct_size(kind);
184 statement_t *res = allocate_ast_zero(size);
186 res->base.kind = kind;
191 * Returns the size of an expression node.
193 * @param kind the expression kind
195 static size_t get_expression_struct_size(expression_kind_t kind)
197 static const size_t sizes[] = {
198 [EXPR_INVALID] = sizeof(expression_base_t),
199 [EXPR_REFERENCE] = sizeof(reference_expression_t),
200 [EXPR_CONST] = sizeof(const_expression_t),
201 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
202 [EXPR_WIDE_STRING_LITERAL] = sizeof(wide_string_literal_expression_t),
203 [EXPR_CALL] = sizeof(call_expression_t),
204 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
205 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
206 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
207 [EXPR_SELECT] = sizeof(select_expression_t),
208 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
209 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
210 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
211 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
212 [EXPR_FUNCTION] = sizeof(string_literal_expression_t),
213 [EXPR_PRETTY_FUNCTION] = sizeof(string_literal_expression_t),
214 [EXPR_BUILTIN_SYMBOL] = sizeof(builtin_symbol_expression_t),
215 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
216 [EXPR_BUILTIN_PREFETCH] = sizeof(builtin_prefetch_expression_t),
217 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
218 [EXPR_VA_START] = sizeof(va_start_expression_t),
219 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
220 [EXPR_STATEMENT] = sizeof(statement_expression_t),
222 if(kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
223 return sizes[EXPR_UNARY_FIRST];
225 if(kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
226 return sizes[EXPR_BINARY_FIRST];
228 assert(kind <= sizeof(sizes) / sizeof(sizes[0]));
229 assert(sizes[kind] != 0);
234 * Allocate an expression node of given kind and initialize all
237 static expression_t *allocate_expression_zero(expression_kind_t kind)
239 size_t size = get_expression_struct_size(kind);
240 expression_t *res = allocate_ast_zero(size);
242 res->base.kind = kind;
243 res->base.type = type_error_type;
248 * Returns the size of a type node.
250 * @param kind the type kind
252 static size_t get_type_struct_size(type_kind_t kind)
254 static const size_t sizes[] = {
255 [TYPE_ATOMIC] = sizeof(atomic_type_t),
256 [TYPE_BITFIELD] = sizeof(bitfield_type_t),
257 [TYPE_COMPOUND_STRUCT] = sizeof(compound_type_t),
258 [TYPE_COMPOUND_UNION] = sizeof(compound_type_t),
259 [TYPE_ENUM] = sizeof(enum_type_t),
260 [TYPE_FUNCTION] = sizeof(function_type_t),
261 [TYPE_POINTER] = sizeof(pointer_type_t),
262 [TYPE_ARRAY] = sizeof(array_type_t),
263 [TYPE_BUILTIN] = sizeof(builtin_type_t),
264 [TYPE_TYPEDEF] = sizeof(typedef_type_t),
265 [TYPE_TYPEOF] = sizeof(typeof_type_t),
267 assert(sizeof(sizes) / sizeof(sizes[0]) == (int) TYPE_TYPEOF + 1);
268 assert(kind <= TYPE_TYPEOF);
269 assert(sizes[kind] != 0);
274 * Allocate a type node of given kind and initialize all
277 static type_t *allocate_type_zero(type_kind_t kind)
279 size_t size = get_type_struct_size(kind);
280 type_t *res = obstack_alloc(type_obst, size);
281 memset(res, 0, size);
283 res->base.kind = kind;
288 * Returns the size of an initializer node.
290 * @param kind the initializer kind
292 static size_t get_initializer_size(initializer_kind_t kind)
294 static const size_t sizes[] = {
295 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
296 [INITIALIZER_STRING] = sizeof(initializer_string_t),
297 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
298 [INITIALIZER_LIST] = sizeof(initializer_list_t)
300 assert(kind < sizeof(sizes) / sizeof(*sizes));
301 assert(sizes[kind] != 0);
306 * Allocate an initializer node of given kind and initialize all
309 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
311 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
318 * Free a type from the type obstack.
320 static void free_type(void *type)
322 obstack_free(type_obst, type);
326 * Returns the index of the top element of the environment stack.
328 static size_t environment_top(void)
330 return ARR_LEN(environment_stack);
334 * Returns the index of the top element of the label stack.
336 static size_t label_top(void)
338 return ARR_LEN(label_stack);
343 * Return the next token.
345 static inline void next_token(void)
347 token = lookahead_buffer[lookahead_bufpos];
348 lookahead_buffer[lookahead_bufpos] = lexer_token;
351 lookahead_bufpos = (lookahead_bufpos+1) % MAX_LOOKAHEAD;
354 print_token(stderr, &token);
355 fprintf(stderr, "\n");
360 * Return the next token with a given lookahead.
362 static inline const token_t *look_ahead(int num)
364 assert(num > 0 && num <= MAX_LOOKAHEAD);
365 int pos = (lookahead_bufpos+num-1) % MAX_LOOKAHEAD;
366 return &lookahead_buffer[pos];
369 #define eat(token_type) do { assert(token.type == token_type); next_token(); } while(0)
372 * Report a parse error because an expected token was not found.
374 static void parse_error_expected(const char *message, ...)
376 if(message != NULL) {
377 errorf(HERE, "%s", message);
380 va_start(ap, message);
381 errorf(HERE, "got '%K', expected %#k", &token, &ap, ", ");
386 * Report a type error.
388 static void type_error(const char *msg, const source_position_t source_position,
391 errorf(source_position, "%s, but found type '%T'", msg, type);
395 * Report an incompatible type.
397 static void type_error_incompatible(const char *msg,
398 const source_position_t source_position, type_t *type1, type_t *type2)
400 errorf(source_position, "%s, incompatible types: '%T' - '%T'", msg, type1, type2);
404 * Eat an complete block, ie. '{ ... }'.
406 static void eat_block(void)
408 if(token.type == '{')
411 while(token.type != '}') {
412 if(token.type == T_EOF)
414 if(token.type == '{') {
424 * Eat a statement until an ';' token.
426 static void eat_statement(void)
428 while(token.type != ';') {
429 if(token.type == T_EOF)
431 if(token.type == '}')
433 if(token.type == '{') {
443 * Eat a parenthesed term, ie. '( ... )'.
445 static void eat_paren(void)
447 if(token.type == '(')
450 while(token.type != ')') {
451 if(token.type == T_EOF)
453 if(token.type == ')' || token.type == ';' || token.type == '}') {
456 if(token.type == '(') {
460 if(token.type == '{') {
469 #define expect(expected) \
470 if(UNLIKELY(token.type != (expected))) { \
471 parse_error_expected(NULL, (expected), 0); \
477 #define expect_block(expected) \
478 if(UNLIKELY(token.type != (expected))) { \
479 parse_error_expected(NULL, (expected), 0); \
485 #define expect_void(expected) \
486 if(UNLIKELY(token.type != (expected))) { \
487 parse_error_expected(NULL, (expected), 0); \
493 static void set_scope(scope_t *new_scope)
497 last_declaration = new_scope->declarations;
498 if(last_declaration != NULL) {
499 while(last_declaration->next != NULL) {
500 last_declaration = last_declaration->next;
506 * Search a symbol in a given namespace and returns its declaration or
507 * NULL if this symbol was not found.
509 static declaration_t *get_declaration(const symbol_t *const symbol, const namespace_t namespc)
511 declaration_t *declaration = symbol->declaration;
512 for( ; declaration != NULL; declaration = declaration->symbol_next) {
513 if(declaration->namespc == namespc)
521 * pushs an environment_entry on the environment stack and links the
522 * corresponding symbol to the new entry
524 static void stack_push(stack_entry_t **stack_ptr, declaration_t *declaration)
526 symbol_t *symbol = declaration->symbol;
527 namespace_t namespc = (namespace_t)declaration->namespc;
529 /* remember old declaration */
531 entry.symbol = symbol;
532 entry.old_declaration = symbol->declaration;
533 entry.namespc = (unsigned short) namespc;
534 ARR_APP1(stack_entry_t, *stack_ptr, entry);
536 /* replace/add declaration into declaration list of the symbol */
537 if(symbol->declaration == NULL) {
538 symbol->declaration = declaration;
540 declaration_t *iter_last = NULL;
541 declaration_t *iter = symbol->declaration;
542 for( ; iter != NULL; iter_last = iter, iter = iter->symbol_next) {
543 /* replace an entry? */
544 if(iter->namespc == namespc) {
545 if(iter_last == NULL) {
546 symbol->declaration = declaration;
548 iter_last->symbol_next = declaration;
550 declaration->symbol_next = iter->symbol_next;
555 assert(iter_last->symbol_next == NULL);
556 iter_last->symbol_next = declaration;
561 static void environment_push(declaration_t *declaration)
563 assert(declaration->source_position.input_name != NULL);
564 assert(declaration->parent_scope != NULL);
565 stack_push(&environment_stack, declaration);
568 static void label_push(declaration_t *declaration)
570 declaration->parent_scope = ¤t_function->scope;
571 stack_push(&label_stack, declaration);
575 * pops symbols from the environment stack until @p new_top is the top element
577 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
579 stack_entry_t *stack = *stack_ptr;
580 size_t top = ARR_LEN(stack);
583 assert(new_top <= top);
587 for(i = top; i > new_top; --i) {
588 stack_entry_t *entry = &stack[i - 1];
590 declaration_t *old_declaration = entry->old_declaration;
591 symbol_t *symbol = entry->symbol;
592 namespace_t namespc = (namespace_t)entry->namespc;
594 /* replace/remove declaration */
595 declaration_t *declaration = symbol->declaration;
596 assert(declaration != NULL);
597 if(declaration->namespc == namespc) {
598 if(old_declaration == NULL) {
599 symbol->declaration = declaration->symbol_next;
601 symbol->declaration = old_declaration;
604 declaration_t *iter_last = declaration;
605 declaration_t *iter = declaration->symbol_next;
606 for( ; iter != NULL; iter_last = iter, iter = iter->symbol_next) {
607 /* replace an entry? */
608 if(iter->namespc == namespc) {
609 assert(iter_last != NULL);
610 iter_last->symbol_next = old_declaration;
611 old_declaration->symbol_next = iter->symbol_next;
615 assert(iter != NULL);
619 ARR_SHRINKLEN(*stack_ptr, (int) new_top);
622 static void environment_pop_to(size_t new_top)
624 stack_pop_to(&environment_stack, new_top);
627 static void label_pop_to(size_t new_top)
629 stack_pop_to(&label_stack, new_top);
633 static int get_rank(const type_t *type)
635 assert(!is_typeref(type));
636 /* The C-standard allows promoting to int or unsigned int (see § 7.2.2
637 * and esp. footnote 108). However we can't fold constants (yet), so we
638 * can't decide whether unsigned int is possible, while int always works.
639 * (unsigned int would be preferable when possible... for stuff like
640 * struct { enum { ... } bla : 4; } ) */
641 if(type->kind == TYPE_ENUM)
642 return ATOMIC_TYPE_INT;
644 assert(type->kind == TYPE_ATOMIC);
645 return type->atomic.akind;
648 static type_t *promote_integer(type_t *type)
650 if(type->kind == TYPE_BITFIELD)
651 type = type->bitfield.base;
653 if(get_rank(type) < ATOMIC_TYPE_INT)
660 * Create a cast expression.
662 * @param expression the expression to cast
663 * @param dest_type the destination type
665 static expression_t *create_cast_expression(expression_t *expression,
668 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST_IMPLICIT);
670 cast->unary.value = expression;
671 cast->base.type = dest_type;
677 * Check if a given expression represents the 0 pointer constant.
679 static bool is_null_pointer_constant(const expression_t *expression)
681 /* skip void* cast */
682 if(expression->kind == EXPR_UNARY_CAST
683 || expression->kind == EXPR_UNARY_CAST_IMPLICIT) {
684 expression = expression->unary.value;
687 /* TODO: not correct yet, should be any constant integer expression
688 * which evaluates to 0 */
689 if (expression->kind != EXPR_CONST)
692 type_t *const type = skip_typeref(expression->base.type);
693 if (!is_type_integer(type))
696 return expression->conste.v.int_value == 0;
700 * Create an implicit cast expression.
702 * @param expression the expression to cast
703 * @param dest_type the destination type
705 static expression_t *create_implicit_cast(expression_t *expression,
708 type_t *const source_type = expression->base.type;
710 if (source_type == dest_type)
713 return create_cast_expression(expression, dest_type);
716 /** Implements the rules from § 6.5.16.1 */
717 static type_t *semantic_assign(type_t *orig_type_left,
718 const expression_t *const right,
721 type_t *const orig_type_right = right->base.type;
722 type_t *const type_left = skip_typeref(orig_type_left);
723 type_t *const type_right = skip_typeref(orig_type_right);
725 if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
726 (is_type_pointer(type_left) && is_null_pointer_constant(right)) ||
727 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
728 && is_type_pointer(type_right))) {
729 return orig_type_left;
732 if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
733 type_t *points_to_left = skip_typeref(type_left->pointer.points_to);
734 type_t *points_to_right = skip_typeref(type_right->pointer.points_to);
736 /* the left type has all qualifiers from the right type */
737 unsigned missing_qualifiers
738 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
739 if(missing_qualifiers != 0) {
740 errorf(HERE, "destination type '%T' in %s from type '%T' lacks qualifiers '%Q' in pointed-to type", type_left, context, type_right, missing_qualifiers);
741 return orig_type_left;
744 points_to_left = get_unqualified_type(points_to_left);
745 points_to_right = get_unqualified_type(points_to_right);
747 if (is_type_atomic(points_to_left, ATOMIC_TYPE_VOID) ||
748 is_type_atomic(points_to_right, ATOMIC_TYPE_VOID)) {
749 return orig_type_left;
752 if (!types_compatible(points_to_left, points_to_right)) {
753 warningf(right->base.source_position,
754 "destination type '%T' in %s is incompatible with '%E' of type '%T'",
755 orig_type_left, context, right, orig_type_right);
758 return orig_type_left;
761 if (is_type_compound(type_left) && is_type_compound(type_right)) {
762 type_t *const unqual_type_left = get_unqualified_type(type_left);
763 type_t *const unqual_type_right = get_unqualified_type(type_right);
764 if (types_compatible(unqual_type_left, unqual_type_right)) {
765 return orig_type_left;
769 if (!is_type_valid(type_left))
772 if (!is_type_valid(type_right))
773 return orig_type_right;
778 static expression_t *parse_constant_expression(void)
780 /* start parsing at precedence 7 (conditional expression) */
781 expression_t *result = parse_sub_expression(7);
783 if(!is_constant_expression(result)) {
784 errorf(result->base.source_position, "expression '%E' is not constant\n", result);
790 static expression_t *parse_assignment_expression(void)
792 /* start parsing at precedence 2 (assignment expression) */
793 return parse_sub_expression(2);
796 static type_t *make_global_typedef(const char *name, type_t *type)
798 symbol_t *const symbol = symbol_table_insert(name);
800 declaration_t *const declaration = allocate_declaration_zero();
801 declaration->namespc = NAMESPACE_NORMAL;
802 declaration->storage_class = STORAGE_CLASS_TYPEDEF;
803 declaration->type = type;
804 declaration->symbol = symbol;
805 declaration->source_position = builtin_source_position;
807 record_declaration(declaration);
809 type_t *typedef_type = allocate_type_zero(TYPE_TYPEDEF);
810 typedef_type->typedeft.declaration = declaration;
815 static string_t parse_string_literals(void)
817 assert(token.type == T_STRING_LITERAL);
818 string_t result = token.v.string;
822 while (token.type == T_STRING_LITERAL) {
823 result = concat_strings(&result, &token.v.string);
830 static void parse_attributes(void)
834 case T___attribute__: {
842 errorf(HERE, "EOF while parsing attribute");
861 if(token.type != T_STRING_LITERAL) {
862 parse_error_expected("while parsing assembler attribute",
867 parse_string_literals();
872 goto attributes_finished;
881 static designator_t *parse_designation(void)
883 if(token.type != '[' && token.type != '.')
886 designator_t *result = NULL;
887 designator_t *last = NULL;
890 designator_t *designator;
893 designator = allocate_ast_zero(sizeof(designator[0]));
895 designator->array_access = parse_constant_expression();
899 designator = allocate_ast_zero(sizeof(designator[0]));
901 if(token.type != T_IDENTIFIER) {
902 parse_error_expected("while parsing designator",
906 designator->symbol = token.v.symbol;
914 assert(designator != NULL);
916 last->next = designator;
925 static initializer_t *initializer_from_string(array_type_t *type,
926 const string_t *const string)
928 /* TODO: check len vs. size of array type */
931 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
932 initializer->string.string = *string;
937 static initializer_t *initializer_from_wide_string(array_type_t *const type,
938 wide_string_t *const string)
940 /* TODO: check len vs. size of array type */
943 initializer_t *const initializer =
944 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
945 initializer->wide_string.string = *string;
950 static initializer_t *initializer_from_expression(type_t *type,
951 expression_t *expression)
953 /* TODO check that expression is a constant expression */
955 /* § 6.7.8.14/15 char array may be initialized by string literals */
956 type_t *const expr_type = expression->base.type;
957 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
958 array_type_t *const array_type = &type->array;
959 type_t *const element_type = skip_typeref(array_type->element_type);
961 if (element_type->kind == TYPE_ATOMIC) {
962 switch (expression->kind) {
963 case EXPR_STRING_LITERAL:
964 if (element_type->atomic.akind == ATOMIC_TYPE_CHAR) {
965 return initializer_from_string(array_type,
966 &expression->string.value);
969 case EXPR_WIDE_STRING_LITERAL: {
970 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
971 if (get_unqualified_type(element_type) == bare_wchar_type) {
972 return initializer_from_wide_string(array_type,
973 &expression->wide_string.value);
983 type_t *const res_type = semantic_assign(type, expression, "initializer");
984 if (res_type == NULL)
987 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
988 result->value.value = create_implicit_cast(expression, res_type);
993 static initializer_t *parse_sub_initializer(type_t *type,
994 expression_t *expression);
996 static initializer_t *parse_sub_initializer_elem(type_t *type)
998 if(token.type == '{') {
999 return parse_sub_initializer(type, NULL);
1002 expression_t *expression = parse_assignment_expression();
1003 return parse_sub_initializer(type, expression);
1006 static bool had_initializer_brace_warning;
1008 static void skip_designator(void)
1011 if(token.type == '.') {
1013 if(token.type == T_IDENTIFIER)
1015 } else if(token.type == '[') {
1017 parse_constant_expression();
1018 if(token.type == ']')
1026 static initializer_t *parse_sub_initializer(type_t *type,
1027 expression_t *expression)
1029 if(is_type_scalar(type)) {
1030 /* there might be extra {} hierarchies */
1031 if(token.type == '{') {
1033 if(!had_initializer_brace_warning) {
1034 warningf(HERE, "braces around scalar initializer");
1035 had_initializer_brace_warning = true;
1037 initializer_t *result = parse_sub_initializer(type, NULL);
1038 if(token.type == ',') {
1040 /* TODO: warn about excessive elements */
1046 if(expression == NULL) {
1047 expression = parse_assignment_expression();
1049 return initializer_from_expression(type, expression);
1052 /* does the expression match the currently looked at object to initialize */
1053 if(expression != NULL) {
1054 initializer_t *result = initializer_from_expression(type, expression);
1059 bool read_paren = false;
1060 if(token.type == '{') {
1065 /* descend into subtype */
1066 initializer_t *result = NULL;
1067 initializer_t **elems;
1068 if(is_type_array(type)) {
1069 if(token.type == '.') {
1071 "compound designator in initializer for array type '%T'",
1076 type_t *const element_type = skip_typeref(type->array.element_type);
1079 had_initializer_brace_warning = false;
1080 if(expression == NULL) {
1081 sub = parse_sub_initializer_elem(element_type);
1083 sub = parse_sub_initializer(element_type, expression);
1086 /* didn't match the subtypes -> try the parent type */
1088 assert(!read_paren);
1092 elems = NEW_ARR_F(initializer_t*, 0);
1093 ARR_APP1(initializer_t*, elems, sub);
1096 if(token.type == '}')
1099 if(token.type == '}')
1102 sub = parse_sub_initializer_elem(element_type);
1104 /* TODO error, do nicer cleanup */
1105 errorf(HERE, "member initializer didn't match");
1109 ARR_APP1(initializer_t*, elems, sub);
1112 assert(is_type_compound(type));
1113 scope_t *const scope = &type->compound.declaration->scope;
1115 if(token.type == '[') {
1117 "array designator in initializer for compound type '%T'",
1122 declaration_t *first = scope->declarations;
1125 type_t *first_type = first->type;
1126 first_type = skip_typeref(first_type);
1129 had_initializer_brace_warning = false;
1130 if(expression == NULL) {
1131 sub = parse_sub_initializer_elem(first_type);
1133 sub = parse_sub_initializer(first_type, expression);
1136 /* didn't match the subtypes -> try our parent type */
1138 assert(!read_paren);
1142 elems = NEW_ARR_F(initializer_t*, 0);
1143 ARR_APP1(initializer_t*, elems, sub);
1145 declaration_t *iter = first->next;
1146 for( ; iter != NULL; iter = iter->next) {
1147 if(iter->symbol == NULL)
1149 if(iter->namespc != NAMESPACE_NORMAL)
1152 if(token.type == '}')
1155 if(token.type == '}')
1158 type_t *iter_type = iter->type;
1159 iter_type = skip_typeref(iter_type);
1161 sub = parse_sub_initializer_elem(iter_type);
1163 /* TODO error, do nicer cleanup */
1164 errorf(HERE, "member initializer didn't match");
1168 ARR_APP1(initializer_t*, elems, sub);
1172 int len = ARR_LEN(elems);
1173 size_t elems_size = sizeof(initializer_t*) * len;
1175 initializer_list_t *init = allocate_ast_zero(sizeof(init[0]) + elems_size);
1177 init->initializer.kind = INITIALIZER_LIST;
1179 memcpy(init->initializers, elems, elems_size);
1182 result = (initializer_t*) init;
1185 if(token.type == ',')
1192 static initializer_t *parse_initializer(type_t *const orig_type)
1194 initializer_t *result;
1196 type_t *const type = skip_typeref(orig_type);
1198 if(token.type != '{') {
1199 expression_t *expression = parse_assignment_expression();
1200 initializer_t *initializer = initializer_from_expression(type, expression);
1201 if(initializer == NULL) {
1203 "initializer expression '%E' of type '%T' is incompatible with type '%T'",
1204 expression, expression->base.type, orig_type);
1209 if(is_type_scalar(type)) {
1213 expression_t *expression = parse_assignment_expression();
1214 result = initializer_from_expression(type, expression);
1216 if(token.type == ',')
1222 result = parse_sub_initializer(type, NULL);
1228 static declaration_t *append_declaration(declaration_t *declaration);
1230 static declaration_t *parse_compound_type_specifier(bool is_struct)
1238 symbol_t *symbol = NULL;
1239 declaration_t *declaration = NULL;
1241 if (token.type == T___attribute__) {
1246 if(token.type == T_IDENTIFIER) {
1247 symbol = token.v.symbol;
1251 declaration = get_declaration(symbol, NAMESPACE_STRUCT);
1253 declaration = get_declaration(symbol, NAMESPACE_UNION);
1255 } else if(token.type != '{') {
1257 parse_error_expected("while parsing struct type specifier",
1258 T_IDENTIFIER, '{', 0);
1260 parse_error_expected("while parsing union type specifier",
1261 T_IDENTIFIER, '{', 0);
1267 if(declaration == NULL) {
1268 declaration = allocate_declaration_zero();
1269 declaration->namespc =
1270 (is_struct ? NAMESPACE_STRUCT : NAMESPACE_UNION);
1271 declaration->source_position = token.source_position;
1272 declaration->symbol = symbol;
1273 declaration->parent_scope = scope;
1274 if (symbol != NULL) {
1275 environment_push(declaration);
1277 append_declaration(declaration);
1280 if(token.type == '{') {
1281 if(declaration->init.is_defined) {
1282 assert(symbol != NULL);
1283 errorf(HERE, "multiple definitions of '%s %Y'",
1284 is_struct ? "struct" : "union", symbol);
1285 declaration->scope.declarations = NULL;
1287 declaration->init.is_defined = true;
1289 parse_compound_type_entries(declaration);
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_scope = scope;
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.type;
1428 type = parse_typename();
1432 expression = parse_expression();
1433 type = expression->base.type;
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_UNION);
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->type = NULL; /* a K&R parameter list has no types, yet */
1806 declaration->source_position = token.source_position;
1807 declaration->symbol = token.v.symbol;
1810 if(last_declaration != NULL) {
1811 last_declaration->next = declaration;
1813 declarations = declaration;
1815 last_declaration = declaration;
1817 if(token.type != ',')
1820 } while(token.type == T_IDENTIFIER);
1822 return declarations;
1825 static void semantic_parameter(declaration_t *declaration)
1827 /* TODO: improve error messages */
1829 if(declaration->storage_class == STORAGE_CLASS_TYPEDEF) {
1830 errorf(HERE, "typedef not allowed in parameter list");
1831 } else if(declaration->storage_class != STORAGE_CLASS_NONE
1832 && declaration->storage_class != STORAGE_CLASS_REGISTER) {
1833 errorf(HERE, "parameter may only have none or register storage class");
1836 type_t *const orig_type = declaration->type;
1837 type_t * type = skip_typeref(orig_type);
1839 /* Array as last part of a parameter type is just syntactic sugar. Turn it
1840 * into a pointer. § 6.7.5.3 (7) */
1841 if (is_type_array(type)) {
1842 type_t *const element_type = type->array.element_type;
1844 type = make_pointer_type(element_type, type->base.qualifiers);
1846 declaration->type = type;
1849 if(is_type_incomplete(type)) {
1850 errorf(HERE, "incomplete type ('%T') not allowed for parameter '%Y'",
1851 orig_type, declaration->symbol);
1855 static declaration_t *parse_parameter(void)
1857 declaration_specifiers_t specifiers;
1858 memset(&specifiers, 0, sizeof(specifiers));
1860 parse_declaration_specifiers(&specifiers);
1862 declaration_t *declaration = parse_declarator(&specifiers, /*may_be_abstract=*/true);
1864 semantic_parameter(declaration);
1869 static declaration_t *parse_parameters(function_type_t *type)
1871 if(token.type == T_IDENTIFIER) {
1872 symbol_t *symbol = token.v.symbol;
1873 if(!is_typedef_symbol(symbol)) {
1874 type->kr_style_parameters = true;
1875 return parse_identifier_list();
1879 if(token.type == ')') {
1880 type->unspecified_parameters = 1;
1883 if(token.type == T_void && look_ahead(1)->type == ')') {
1888 declaration_t *declarations = NULL;
1889 declaration_t *declaration;
1890 declaration_t *last_declaration = NULL;
1891 function_parameter_t *parameter;
1892 function_parameter_t *last_parameter = NULL;
1895 switch(token.type) {
1899 return declarations;
1902 case T___extension__:
1904 declaration = parse_parameter();
1906 parameter = obstack_alloc(type_obst, sizeof(parameter[0]));
1907 memset(parameter, 0, sizeof(parameter[0]));
1908 parameter->type = declaration->type;
1910 if(last_parameter != NULL) {
1911 last_declaration->next = declaration;
1912 last_parameter->next = parameter;
1914 type->parameters = parameter;
1915 declarations = declaration;
1917 last_parameter = parameter;
1918 last_declaration = declaration;
1922 return declarations;
1924 if(token.type != ',')
1925 return declarations;
1935 } construct_type_type_t;
1937 typedef struct construct_type_t construct_type_t;
1938 struct construct_type_t {
1939 construct_type_type_t type;
1940 construct_type_t *next;
1943 typedef struct parsed_pointer_t parsed_pointer_t;
1944 struct parsed_pointer_t {
1945 construct_type_t construct_type;
1946 type_qualifiers_t type_qualifiers;
1949 typedef struct construct_function_type_t construct_function_type_t;
1950 struct construct_function_type_t {
1951 construct_type_t construct_type;
1952 type_t *function_type;
1955 typedef struct parsed_array_t parsed_array_t;
1956 struct parsed_array_t {
1957 construct_type_t construct_type;
1958 type_qualifiers_t type_qualifiers;
1964 typedef struct construct_base_type_t construct_base_type_t;
1965 struct construct_base_type_t {
1966 construct_type_t construct_type;
1970 static construct_type_t *parse_pointer_declarator(void)
1974 parsed_pointer_t *pointer = obstack_alloc(&temp_obst, sizeof(pointer[0]));
1975 memset(pointer, 0, sizeof(pointer[0]));
1976 pointer->construct_type.type = CONSTRUCT_POINTER;
1977 pointer->type_qualifiers = parse_type_qualifiers();
1979 return (construct_type_t*) pointer;
1982 static construct_type_t *parse_array_declarator(void)
1986 parsed_array_t *array = obstack_alloc(&temp_obst, sizeof(array[0]));
1987 memset(array, 0, sizeof(array[0]));
1988 array->construct_type.type = CONSTRUCT_ARRAY;
1990 if(token.type == T_static) {
1991 array->is_static = true;
1995 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
1996 if(type_qualifiers != 0) {
1997 if(token.type == T_static) {
1998 array->is_static = true;
2002 array->type_qualifiers = type_qualifiers;
2004 if(token.type == '*' && look_ahead(1)->type == ']') {
2005 array->is_variable = true;
2007 } else if(token.type != ']') {
2008 array->size = parse_assignment_expression();
2013 return (construct_type_t*) array;
2016 static construct_type_t *parse_function_declarator(declaration_t *declaration)
2020 type_t *type = allocate_type_zero(TYPE_FUNCTION);
2022 declaration_t *parameters = parse_parameters(&type->function);
2023 if(declaration != NULL) {
2024 declaration->scope.declarations = parameters;
2027 construct_function_type_t *construct_function_type =
2028 obstack_alloc(&temp_obst, sizeof(construct_function_type[0]));
2029 memset(construct_function_type, 0, sizeof(construct_function_type[0]));
2030 construct_function_type->construct_type.type = CONSTRUCT_FUNCTION;
2031 construct_function_type->function_type = type;
2035 return (construct_type_t*) construct_function_type;
2038 static construct_type_t *parse_inner_declarator(declaration_t *declaration,
2039 bool may_be_abstract)
2041 /* construct a single linked list of construct_type_t's which describe
2042 * how to construct the final declarator type */
2043 construct_type_t *first = NULL;
2044 construct_type_t *last = NULL;
2047 while(token.type == '*') {
2048 construct_type_t *type = parse_pointer_declarator();
2059 /* TODO: find out if this is correct */
2062 construct_type_t *inner_types = NULL;
2064 switch(token.type) {
2066 if(declaration == NULL) {
2067 errorf(HERE, "no identifier expected in typename");
2069 declaration->symbol = token.v.symbol;
2070 declaration->source_position = token.source_position;
2076 inner_types = parse_inner_declarator(declaration, may_be_abstract);
2082 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', 0);
2083 /* avoid a loop in the outermost scope, because eat_statement doesn't
2085 if(token.type == '}' && current_function == NULL) {
2093 construct_type_t *p = last;
2096 construct_type_t *type;
2097 switch(token.type) {
2099 type = parse_function_declarator(declaration);
2102 type = parse_array_declarator();
2105 goto declarator_finished;
2108 /* insert in the middle of the list (behind p) */
2110 type->next = p->next;
2121 declarator_finished:
2124 /* append inner_types at the end of the list, we don't to set last anymore
2125 * as it's not needed anymore */
2127 assert(first == NULL);
2128 first = inner_types;
2130 last->next = inner_types;
2136 static type_t *construct_declarator_type(construct_type_t *construct_list,
2139 construct_type_t *iter = construct_list;
2140 for( ; iter != NULL; iter = iter->next) {
2141 switch(iter->type) {
2142 case CONSTRUCT_INVALID:
2143 panic("invalid type construction found");
2144 case CONSTRUCT_FUNCTION: {
2145 construct_function_type_t *construct_function_type
2146 = (construct_function_type_t*) iter;
2148 type_t *function_type = construct_function_type->function_type;
2150 function_type->function.return_type = type;
2152 type_t *skipped_return_type = skip_typeref(type);
2153 if (is_type_function(skipped_return_type)) {
2154 errorf(HERE, "function returning function is not allowed");
2155 type = type_error_type;
2156 } else if (is_type_array(skipped_return_type)) {
2157 errorf(HERE, "function returning array is not allowed");
2158 type = type_error_type;
2160 type = function_type;
2165 case CONSTRUCT_POINTER: {
2166 parsed_pointer_t *parsed_pointer = (parsed_pointer_t*) iter;
2167 type_t *pointer_type = allocate_type_zero(TYPE_POINTER);
2168 pointer_type->pointer.points_to = type;
2169 pointer_type->base.qualifiers = parsed_pointer->type_qualifiers;
2171 type = pointer_type;
2175 case CONSTRUCT_ARRAY: {
2176 parsed_array_t *parsed_array = (parsed_array_t*) iter;
2177 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
2179 array_type->base.qualifiers = parsed_array->type_qualifiers;
2180 array_type->array.element_type = type;
2181 array_type->array.is_static = parsed_array->is_static;
2182 array_type->array.is_variable = parsed_array->is_variable;
2183 array_type->array.size = parsed_array->size;
2185 type_t *skipped_type = skip_typeref(type);
2186 if (is_type_atomic(skipped_type, ATOMIC_TYPE_VOID)) {
2187 errorf(HERE, "array of void is not allowed");
2188 type = type_error_type;
2196 type_t *hashed_type = typehash_insert(type);
2197 if(hashed_type != type) {
2198 /* the function type was constructed earlier freeing it here will
2199 * destroy other types... */
2200 if(iter->type != CONSTRUCT_FUNCTION) {
2210 static declaration_t *parse_declarator(
2211 const declaration_specifiers_t *specifiers, bool may_be_abstract)
2213 declaration_t *const declaration = allocate_declaration_zero();
2214 declaration->storage_class = specifiers->storage_class;
2215 declaration->modifiers = specifiers->decl_modifiers;
2216 declaration->is_inline = specifiers->is_inline;
2218 construct_type_t *construct_type
2219 = parse_inner_declarator(declaration, may_be_abstract);
2220 type_t *const type = specifiers->type;
2221 declaration->type = construct_declarator_type(construct_type, type);
2223 if(construct_type != NULL) {
2224 obstack_free(&temp_obst, construct_type);
2230 static type_t *parse_abstract_declarator(type_t *base_type)
2232 construct_type_t *construct_type = parse_inner_declarator(NULL, 1);
2234 type_t *result = construct_declarator_type(construct_type, base_type);
2235 if(construct_type != NULL) {
2236 obstack_free(&temp_obst, construct_type);
2242 static declaration_t *append_declaration(declaration_t* const declaration)
2244 if (last_declaration != NULL) {
2245 last_declaration->next = declaration;
2247 scope->declarations = declaration;
2249 last_declaration = declaration;
2254 * Check if the declaration of main is suspicious. main should be a
2255 * function with external linkage, returning int, taking either zero
2256 * arguments, two, or three arguments of appropriate types, ie.
2258 * int main([ int argc, char **argv [, char **env ] ]).
2260 * @param decl the declaration to check
2261 * @param type the function type of the declaration
2263 static void check_type_of_main(const declaration_t *const decl, const function_type_t *const func_type)
2265 if (decl->storage_class == STORAGE_CLASS_STATIC) {
2266 warningf(decl->source_position, "'main' is normally a non-static function");
2268 if (skip_typeref(func_type->return_type) != type_int) {
2269 warningf(decl->source_position, "return type of 'main' should be 'int', but is '%T'", func_type->return_type);
2271 const function_parameter_t *parm = func_type->parameters;
2273 type_t *const first_type = parm->type;
2274 if (!types_compatible(skip_typeref(first_type), type_int)) {
2275 warningf(decl->source_position, "first argument of 'main' should be 'int', but is '%T'", first_type);
2279 type_t *const second_type = parm->type;
2280 if (!types_compatible(skip_typeref(second_type), type_char_ptr_ptr)) {
2281 warningf(decl->source_position, "second argument of 'main' should be 'char**', but is '%T'", second_type);
2285 type_t *const third_type = parm->type;
2286 if (!types_compatible(skip_typeref(third_type), type_char_ptr_ptr)) {
2287 warningf(decl->source_position, "third argument of 'main' should be 'char**', but is '%T'", third_type);
2291 warningf(decl->source_position, "'main' takes only zero, two or three arguments");
2295 warningf(decl->source_position, "'main' takes only zero, two or three arguments");
2301 * Check if a symbol is the equal to "main".
2303 static bool is_sym_main(const symbol_t *const sym)
2305 return strcmp(sym->string, "main") == 0;
2308 static declaration_t *internal_record_declaration(
2309 declaration_t *const declaration,
2310 const bool is_function_definition)
2312 const symbol_t *const symbol = declaration->symbol;
2313 const namespace_t namespc = (namespace_t)declaration->namespc;
2315 type_t *const orig_type = declaration->type;
2316 type_t *const type = skip_typeref(orig_type);
2317 if (is_type_function(type) &&
2318 type->function.unspecified_parameters &&
2319 warning.strict_prototypes) {
2320 warningf(declaration->source_position,
2321 "function declaration '%#T' is not a prototype",
2322 orig_type, declaration->symbol);
2325 if (is_function_definition && warning.main && is_sym_main(symbol)) {
2326 check_type_of_main(declaration, &type->function);
2329 assert(declaration->symbol != NULL);
2330 declaration_t *previous_declaration = get_declaration(symbol, namespc);
2332 assert(declaration != previous_declaration);
2333 if (previous_declaration != NULL) {
2334 if (previous_declaration->parent_scope == scope) {
2335 /* can happen for K&R style declarations */
2336 if(previous_declaration->type == NULL) {
2337 previous_declaration->type = declaration->type;
2340 const type_t *prev_type = skip_typeref(previous_declaration->type);
2341 if (!types_compatible(type, prev_type)) {
2342 errorf(declaration->source_position,
2343 "declaration '%#T' is incompatible with "
2344 "previous declaration '%#T'",
2345 orig_type, symbol, previous_declaration->type, symbol);
2346 errorf(previous_declaration->source_position,
2347 "previous declaration of '%Y' was here", symbol);
2349 unsigned old_storage_class
2350 = previous_declaration->storage_class;
2351 unsigned new_storage_class = declaration->storage_class;
2353 if(is_type_incomplete(prev_type)) {
2354 previous_declaration->type = type;
2358 /* pretend no storage class means extern for function
2359 * declarations (except if the previous declaration is neither
2360 * none nor extern) */
2361 if (is_type_function(type)) {
2362 switch (old_storage_class) {
2363 case STORAGE_CLASS_NONE:
2364 old_storage_class = STORAGE_CLASS_EXTERN;
2366 case STORAGE_CLASS_EXTERN:
2367 if (is_function_definition) {
2368 if (warning.missing_prototypes &&
2369 prev_type->function.unspecified_parameters &&
2370 !is_sym_main(symbol)) {
2371 warningf(declaration->source_position,
2372 "no previous prototype for '%#T'",
2375 } else if (new_storage_class == STORAGE_CLASS_NONE) {
2376 new_storage_class = STORAGE_CLASS_EXTERN;
2384 if (old_storage_class == STORAGE_CLASS_EXTERN &&
2385 new_storage_class == STORAGE_CLASS_EXTERN) {
2386 warn_redundant_declaration:
2387 if (warning.redundant_decls) {
2388 warningf(declaration->source_position,
2389 "redundant declaration for '%Y'", symbol);
2390 warningf(previous_declaration->source_position,
2391 "previous declaration of '%Y' was here",
2394 } else if (current_function == NULL) {
2395 if (old_storage_class != STORAGE_CLASS_STATIC &&
2396 new_storage_class == STORAGE_CLASS_STATIC) {
2397 errorf(declaration->source_position,
2398 "static declaration of '%Y' follows non-static declaration",
2400 errorf(previous_declaration->source_position,
2401 "previous declaration of '%Y' was here", symbol);
2403 if (old_storage_class != STORAGE_CLASS_EXTERN && !is_function_definition) {
2404 goto warn_redundant_declaration;
2406 if (new_storage_class == STORAGE_CLASS_NONE) {
2407 previous_declaration->storage_class = STORAGE_CLASS_NONE;
2411 if (old_storage_class == new_storage_class) {
2412 errorf(declaration->source_position,
2413 "redeclaration of '%Y'", symbol);
2415 errorf(declaration->source_position,
2416 "redeclaration of '%Y' with different linkage",
2419 errorf(previous_declaration->source_position,
2420 "previous declaration of '%Y' was here", symbol);
2423 return previous_declaration;
2425 } else if (is_function_definition) {
2426 if (declaration->storage_class != STORAGE_CLASS_STATIC) {
2427 if (warning.missing_prototypes && !is_sym_main(symbol)) {
2428 warningf(declaration->source_position,
2429 "no previous prototype for '%#T'", orig_type, symbol);
2430 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
2431 warningf(declaration->source_position,
2432 "no previous declaration for '%#T'", orig_type,
2436 } else if (warning.missing_declarations &&
2437 scope == global_scope &&
2438 !is_type_function(type) && (
2439 declaration->storage_class == STORAGE_CLASS_NONE ||
2440 declaration->storage_class == STORAGE_CLASS_THREAD
2442 warningf(declaration->source_position,
2443 "no previous declaration for '%#T'", orig_type, symbol);
2446 assert(declaration->parent_scope == NULL);
2447 assert(scope != NULL);
2449 declaration->parent_scope = scope;
2451 environment_push(declaration);
2452 return append_declaration(declaration);
2455 static declaration_t *record_declaration(declaration_t *declaration)
2457 return internal_record_declaration(declaration, false);
2460 static declaration_t *record_function_definition(declaration_t *declaration)
2462 return internal_record_declaration(declaration, true);
2465 static void parser_error_multiple_definition(declaration_t *declaration,
2466 const source_position_t source_position)
2468 errorf(source_position, "multiple definition of symbol '%Y'",
2469 declaration->symbol);
2470 errorf(declaration->source_position,
2471 "this is the location of the previous definition.");
2474 static bool is_declaration_specifier(const token_t *token,
2475 bool only_type_specifiers)
2477 switch(token->type) {
2481 return is_typedef_symbol(token->v.symbol);
2483 case T___extension__:
2486 return !only_type_specifiers;
2493 static void parse_init_declarator_rest(declaration_t *declaration)
2497 type_t *orig_type = declaration->type;
2498 type_t *type = type = skip_typeref(orig_type);
2500 if(declaration->init.initializer != NULL) {
2501 parser_error_multiple_definition(declaration, token.source_position);
2504 initializer_t *initializer = parse_initializer(type);
2506 /* § 6.7.5 (22) array initializers for arrays with unknown size determine
2507 * the array type size */
2508 if(is_type_array(type) && initializer != NULL) {
2509 array_type_t *array_type = &type->array;
2511 if(array_type->size == NULL) {
2512 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
2514 cnst->base.type = type_size_t;
2516 switch (initializer->kind) {
2517 case INITIALIZER_LIST: {
2518 cnst->conste.v.int_value = initializer->list.len;
2522 case INITIALIZER_STRING: {
2523 cnst->conste.v.int_value = initializer->string.string.size;
2527 case INITIALIZER_WIDE_STRING: {
2528 cnst->conste.v.int_value = initializer->wide_string.string.size;
2533 panic("invalid initializer type");
2536 array_type->size = cnst;
2540 if(is_type_function(type)) {
2541 errorf(declaration->source_position,
2542 "initializers not allowed for function types at declator '%Y' (type '%T')",
2543 declaration->symbol, orig_type);
2545 declaration->init.initializer = initializer;
2549 /* parse rest of a declaration without any declarator */
2550 static void parse_anonymous_declaration_rest(
2551 const declaration_specifiers_t *specifiers,
2552 parsed_declaration_func finished_declaration)
2556 declaration_t *const declaration = allocate_declaration_zero();
2557 declaration->type = specifiers->type;
2558 declaration->storage_class = specifiers->storage_class;
2559 declaration->source_position = specifiers->source_position;
2561 if (declaration->storage_class != STORAGE_CLASS_NONE) {
2562 warningf(declaration->source_position, "useless storage class in empty declaration");
2565 type_t *type = declaration->type;
2566 switch (type->kind) {
2567 case TYPE_COMPOUND_STRUCT:
2568 case TYPE_COMPOUND_UNION: {
2569 if (type->compound.declaration->symbol == NULL) {
2570 warningf(declaration->source_position, "unnamed struct/union that defines no instances");
2579 warningf(declaration->source_position, "empty declaration");
2583 finished_declaration(declaration);
2586 static void parse_declaration_rest(declaration_t *ndeclaration,
2587 const declaration_specifiers_t *specifiers,
2588 parsed_declaration_func finished_declaration)
2591 declaration_t *declaration = finished_declaration(ndeclaration);
2593 type_t *orig_type = declaration->type;
2594 type_t *type = skip_typeref(orig_type);
2596 if (type->kind != TYPE_FUNCTION &&
2597 declaration->is_inline &&
2598 is_type_valid(type)) {
2599 warningf(declaration->source_position,
2600 "variable '%Y' declared 'inline'\n", declaration->symbol);
2603 if(token.type == '=') {
2604 parse_init_declarator_rest(declaration);
2607 if(token.type != ',')
2611 ndeclaration = parse_declarator(specifiers, /*may_be_abstract=*/false);
2616 static declaration_t *finished_kr_declaration(declaration_t *declaration)
2618 symbol_t *symbol = declaration->symbol;
2619 if(symbol == NULL) {
2620 errorf(HERE, "anonymous declaration not valid as function parameter");
2623 namespace_t namespc = (namespace_t) declaration->namespc;
2624 if(namespc != NAMESPACE_NORMAL) {
2625 return record_declaration(declaration);
2628 declaration_t *previous_declaration = get_declaration(symbol, namespc);
2629 if(previous_declaration == NULL ||
2630 previous_declaration->parent_scope != scope) {
2631 errorf(HERE, "expected declaration of a function parameter, found '%Y'",
2636 if(previous_declaration->type == NULL) {
2637 previous_declaration->type = declaration->type;
2638 previous_declaration->storage_class = declaration->storage_class;
2639 previous_declaration->parent_scope = scope;
2640 return previous_declaration;
2642 return record_declaration(declaration);
2646 static void parse_declaration(parsed_declaration_func finished_declaration)
2648 declaration_specifiers_t specifiers;
2649 memset(&specifiers, 0, sizeof(specifiers));
2650 parse_declaration_specifiers(&specifiers);
2652 if(token.type == ';') {
2653 parse_anonymous_declaration_rest(&specifiers, append_declaration);
2655 declaration_t *declaration = parse_declarator(&specifiers, /*may_be_abstract=*/false);
2656 parse_declaration_rest(declaration, &specifiers, finished_declaration);
2660 static void parse_kr_declaration_list(declaration_t *declaration)
2662 type_t *type = skip_typeref(declaration->type);
2663 if(!is_type_function(type))
2666 if(!type->function.kr_style_parameters)
2669 /* push function parameters */
2670 int top = environment_top();
2671 scope_t *last_scope = scope;
2672 set_scope(&declaration->scope);
2674 declaration_t *parameter = declaration->scope.declarations;
2675 for( ; parameter != NULL; parameter = parameter->next) {
2676 assert(parameter->parent_scope == NULL);
2677 parameter->parent_scope = scope;
2678 environment_push(parameter);
2681 /* parse declaration list */
2682 while(is_declaration_specifier(&token, false)) {
2683 parse_declaration(finished_kr_declaration);
2686 /* pop function parameters */
2687 assert(scope == &declaration->scope);
2688 set_scope(last_scope);
2689 environment_pop_to(top);
2691 /* update function type */
2692 type_t *new_type = duplicate_type(type);
2693 new_type->function.kr_style_parameters = false;
2695 function_parameter_t *parameters = NULL;
2696 function_parameter_t *last_parameter = NULL;
2698 declaration_t *parameter_declaration = declaration->scope.declarations;
2699 for( ; parameter_declaration != NULL;
2700 parameter_declaration = parameter_declaration->next) {
2701 type_t *parameter_type = parameter_declaration->type;
2702 if(parameter_type == NULL) {
2704 errorf(HERE, "no type specified for function parameter '%Y'",
2705 parameter_declaration->symbol);
2707 if (warning.implicit_int) {
2708 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
2709 parameter_declaration->symbol);
2711 parameter_type = type_int;
2712 parameter_declaration->type = parameter_type;
2716 semantic_parameter(parameter_declaration);
2717 parameter_type = parameter_declaration->type;
2719 function_parameter_t *function_parameter
2720 = obstack_alloc(type_obst, sizeof(function_parameter[0]));
2721 memset(function_parameter, 0, sizeof(function_parameter[0]));
2723 function_parameter->type = parameter_type;
2724 if(last_parameter != NULL) {
2725 last_parameter->next = function_parameter;
2727 parameters = function_parameter;
2729 last_parameter = function_parameter;
2731 new_type->function.parameters = parameters;
2733 type = typehash_insert(new_type);
2734 if(type != new_type) {
2735 obstack_free(type_obst, new_type);
2738 declaration->type = type;
2741 static bool first_err = true;
2744 * When called with first_err set, prints the name of the current function,
2747 static void print_in_function(void) {
2750 diagnosticf("%s: In function '%Y':\n",
2751 current_function->source_position.input_name,
2752 current_function->symbol);
2757 * Check if all labels are defined in the current function.
2758 * Check if all labels are used in the current function.
2760 static void check_labels(void)
2762 for (const goto_statement_t *goto_statement = goto_first;
2763 goto_statement != NULL;
2764 goto_statement = goto_statement->next) {
2765 declaration_t *label = goto_statement->label;
2768 if (label->source_position.input_name == NULL) {
2769 print_in_function();
2770 errorf(goto_statement->base.source_position,
2771 "label '%Y' used but not defined", label->symbol);
2774 goto_first = goto_last = NULL;
2776 if (warning.unused_label) {
2777 for (const label_statement_t *label_statement = label_first;
2778 label_statement != NULL;
2779 label_statement = label_statement->next) {
2780 const declaration_t *label = label_statement->label;
2782 if (! label->used) {
2783 print_in_function();
2784 warningf(label_statement->base.source_position,
2785 "label '%Y' defined but not used", label->symbol);
2789 label_first = label_last = NULL;
2793 * Check declarations of current_function for unused entities.
2795 static void check_declarations(void)
2797 if (warning.unused_parameter) {
2798 const scope_t *scope = ¤t_function->scope;
2800 const declaration_t *parameter = scope->declarations;
2801 for (; parameter != NULL; parameter = parameter->next) {
2802 if (! parameter->used) {
2803 print_in_function();
2804 warningf(parameter->source_position,
2805 "unused parameter '%Y'", parameter->symbol);
2809 if (warning.unused_variable) {
2813 static void parse_external_declaration(void)
2815 /* function-definitions and declarations both start with declaration
2817 declaration_specifiers_t specifiers;
2818 memset(&specifiers, 0, sizeof(specifiers));
2819 parse_declaration_specifiers(&specifiers);
2821 /* must be a declaration */
2822 if(token.type == ';') {
2823 parse_anonymous_declaration_rest(&specifiers, append_declaration);
2827 /* declarator is common to both function-definitions and declarations */
2828 declaration_t *ndeclaration = parse_declarator(&specifiers, /*may_be_abstract=*/false);
2830 /* must be a declaration */
2831 if(token.type == ',' || token.type == '=' || token.type == ';') {
2832 parse_declaration_rest(ndeclaration, &specifiers, record_declaration);
2836 /* must be a function definition */
2837 parse_kr_declaration_list(ndeclaration);
2839 if(token.type != '{') {
2840 parse_error_expected("while parsing function definition", '{', 0);
2845 type_t *type = ndeclaration->type;
2847 /* note that we don't skip typerefs: the standard doesn't allow them here
2848 * (so we can't use is_type_function here) */
2849 if(type->kind != TYPE_FUNCTION) {
2850 if (is_type_valid(type)) {
2851 errorf(HERE, "declarator '%#T' has a body but is not a function type",
2852 type, ndeclaration->symbol);
2858 /* § 6.7.5.3 (14) a function definition with () means no
2859 * parameters (and not unspecified parameters) */
2860 if(type->function.unspecified_parameters) {
2861 type_t *duplicate = duplicate_type(type);
2862 duplicate->function.unspecified_parameters = false;
2864 type = typehash_insert(duplicate);
2865 if(type != duplicate) {
2866 obstack_free(type_obst, duplicate);
2868 ndeclaration->type = type;
2871 declaration_t *const declaration = record_function_definition(ndeclaration);
2872 if(ndeclaration != declaration) {
2873 declaration->scope = ndeclaration->scope;
2875 type = skip_typeref(declaration->type);
2877 /* push function parameters and switch scope */
2878 int top = environment_top();
2879 scope_t *last_scope = scope;
2880 set_scope(&declaration->scope);
2882 declaration_t *parameter = declaration->scope.declarations;
2883 for( ; parameter != NULL; parameter = parameter->next) {
2884 if(parameter->parent_scope == &ndeclaration->scope) {
2885 parameter->parent_scope = scope;
2887 assert(parameter->parent_scope == NULL
2888 || parameter->parent_scope == scope);
2889 parameter->parent_scope = scope;
2890 environment_push(parameter);
2893 if(declaration->init.statement != NULL) {
2894 parser_error_multiple_definition(declaration, token.source_position);
2896 goto end_of_parse_external_declaration;
2898 /* parse function body */
2899 int label_stack_top = label_top();
2900 declaration_t *old_current_function = current_function;
2901 current_function = declaration;
2903 declaration->init.statement = parse_compound_statement();
2906 check_declarations();
2908 assert(current_function == declaration);
2909 current_function = old_current_function;
2910 label_pop_to(label_stack_top);
2913 end_of_parse_external_declaration:
2914 assert(scope == &declaration->scope);
2915 set_scope(last_scope);
2916 environment_pop_to(top);
2919 static type_t *make_bitfield_type(type_t *base, expression_t *size)
2921 type_t *type = allocate_type_zero(TYPE_BITFIELD);
2922 type->bitfield.base = base;
2923 type->bitfield.size = size;
2928 static void parse_compound_declarators(declaration_t *struct_declaration,
2929 const declaration_specifiers_t *specifiers)
2931 declaration_t *last_declaration = struct_declaration->scope.declarations;
2932 if(last_declaration != NULL) {
2933 while(last_declaration->next != NULL) {
2934 last_declaration = last_declaration->next;
2939 declaration_t *declaration;
2941 if(token.type == ':') {
2944 type_t *base_type = specifiers->type;
2945 expression_t *size = parse_constant_expression();
2947 if(!is_type_integer(skip_typeref(base_type))) {
2948 errorf(HERE, "bitfield base type '%T' is not an integer type",
2952 type_t *type = make_bitfield_type(base_type, size);
2954 declaration = allocate_declaration_zero();
2955 declaration->namespc = NAMESPACE_NORMAL;
2956 declaration->storage_class = STORAGE_CLASS_NONE;
2957 declaration->source_position = token.source_position;
2958 declaration->modifiers = specifiers->decl_modifiers;
2959 declaration->type = type;
2961 declaration = parse_declarator(specifiers,/*may_be_abstract=*/true);
2963 type_t *orig_type = declaration->type;
2964 type_t *type = skip_typeref(orig_type);
2966 if(token.type == ':') {
2968 expression_t *size = parse_constant_expression();
2970 if(!is_type_integer(type)) {
2971 errorf(HERE, "bitfield base type '%T' is not an "
2972 "integer type", orig_type);
2975 type_t *bitfield_type = make_bitfield_type(orig_type, size);
2976 declaration->type = bitfield_type;
2978 /* TODO we ignore arrays for now... what is missing is a check
2979 * that they're at the end of the struct */
2980 if(is_type_incomplete(type) && !is_type_array(type)) {
2982 "compound member '%Y' has incomplete type '%T'",
2983 declaration->symbol, orig_type);
2984 } else if(is_type_function(type)) {
2985 errorf(HERE, "compound member '%Y' must not have function "
2986 "type '%T'", declaration->symbol, orig_type);
2991 /* make sure we don't define a symbol multiple times */
2992 symbol_t *symbol = declaration->symbol;
2993 if(symbol != NULL) {
2994 declaration_t *iter = struct_declaration->scope.declarations;
2995 for( ; iter != NULL; iter = iter->next) {
2996 if(iter->symbol == symbol) {
2997 errorf(declaration->source_position,
2998 "multiple declarations of symbol '%Y'", symbol);
2999 errorf(iter->source_position,
3000 "previous declaration of '%Y' was here", symbol);
3006 /* append declaration */
3007 if(last_declaration != NULL) {
3008 last_declaration->next = declaration;
3010 struct_declaration->scope.declarations = declaration;
3012 last_declaration = declaration;
3014 if(token.type != ',')
3021 static void parse_compound_type_entries(declaration_t *compound_declaration)
3025 while(token.type != '}' && token.type != T_EOF) {
3026 declaration_specifiers_t specifiers;
3027 memset(&specifiers, 0, sizeof(specifiers));
3028 parse_declaration_specifiers(&specifiers);
3030 parse_compound_declarators(compound_declaration, &specifiers);
3032 if(token.type == T_EOF) {
3033 errorf(HERE, "EOF while parsing struct");
3038 static type_t *parse_typename(void)
3040 declaration_specifiers_t specifiers;
3041 memset(&specifiers, 0, sizeof(specifiers));
3042 parse_declaration_specifiers(&specifiers);
3043 if(specifiers.storage_class != STORAGE_CLASS_NONE) {
3044 /* TODO: improve error message, user does probably not know what a
3045 * storage class is...
3047 errorf(HERE, "typename may not have a storage class");
3050 type_t *result = parse_abstract_declarator(specifiers.type);
3058 typedef expression_t* (*parse_expression_function) (unsigned precedence);
3059 typedef expression_t* (*parse_expression_infix_function) (unsigned precedence,
3060 expression_t *left);
3062 typedef struct expression_parser_function_t expression_parser_function_t;
3063 struct expression_parser_function_t {
3064 unsigned precedence;
3065 parse_expression_function parser;
3066 unsigned infix_precedence;
3067 parse_expression_infix_function infix_parser;
3070 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
3073 * Creates a new invalid expression.
3075 static expression_t *create_invalid_expression(void)
3077 expression_t *expression = allocate_expression_zero(EXPR_INVALID);
3078 expression->base.source_position = token.source_position;
3083 * Prints an error message if an expression was expected but not read
3085 static expression_t *expected_expression_error(void)
3087 /* skip the error message if the error token was read */
3088 if (token.type != T_ERROR) {
3089 errorf(HERE, "expected expression, got token '%K'", &token);
3093 return create_invalid_expression();
3097 * Parse a string constant.
3099 static expression_t *parse_string_const(void)
3101 expression_t *cnst = allocate_expression_zero(EXPR_STRING_LITERAL);
3102 cnst->base.type = type_char_ptr;
3103 cnst->string.value = parse_string_literals();
3109 * Parse a wide string constant.
3111 static expression_t *parse_wide_string_const(void)
3113 expression_t *const cnst = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
3114 cnst->base.type = type_wchar_t_ptr;
3115 cnst->wide_string.value = token.v.wide_string; /* TODO concatenate */
3121 * Parse an integer constant.
3123 static expression_t *parse_int_const(void)
3125 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
3126 cnst->base.type = token.datatype;
3127 cnst->conste.v.int_value = token.v.intvalue;
3135 * Parse a float constant.
3137 static expression_t *parse_float_const(void)
3139 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
3140 cnst->base.type = token.datatype;
3141 cnst->conste.v.float_value = token.v.floatvalue;
3148 static declaration_t *create_implicit_function(symbol_t *symbol,
3149 const source_position_t source_position)
3151 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
3152 ntype->function.return_type = type_int;
3153 ntype->function.unspecified_parameters = true;
3155 type_t *type = typehash_insert(ntype);
3160 declaration_t *const declaration = allocate_declaration_zero();
3161 declaration->storage_class = STORAGE_CLASS_EXTERN;
3162 declaration->type = type;
3163 declaration->symbol = symbol;
3164 declaration->source_position = source_position;
3165 declaration->parent_scope = global_scope;
3167 scope_t *old_scope = scope;
3168 set_scope(global_scope);
3170 environment_push(declaration);
3171 /* prepends the declaration to the global declarations list */
3172 declaration->next = scope->declarations;
3173 scope->declarations = declaration;
3175 assert(scope == global_scope);
3176 set_scope(old_scope);
3182 * Creates a return_type (func)(argument_type) function type if not
3185 * @param return_type the return type
3186 * @param argument_type the argument type
3188 static type_t *make_function_1_type(type_t *return_type, type_t *argument_type)
3190 function_parameter_t *parameter
3191 = obstack_alloc(type_obst, sizeof(parameter[0]));
3192 memset(parameter, 0, sizeof(parameter[0]));
3193 parameter->type = argument_type;
3195 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3196 type->function.return_type = return_type;
3197 type->function.parameters = parameter;
3199 type_t *result = typehash_insert(type);
3200 if(result != type) {
3208 * Creates a function type for some function like builtins.
3210 * @param symbol the symbol describing the builtin
3212 static type_t *get_builtin_symbol_type(symbol_t *symbol)
3214 switch(symbol->ID) {
3215 case T___builtin_alloca:
3216 return make_function_1_type(type_void_ptr, type_size_t);
3217 case T___builtin_nan:
3218 return make_function_1_type(type_double, type_char_ptr);
3219 case T___builtin_nanf:
3220 return make_function_1_type(type_float, type_char_ptr);
3221 case T___builtin_nand:
3222 return make_function_1_type(type_long_double, type_char_ptr);
3223 case T___builtin_va_end:
3224 return make_function_1_type(type_void, type_valist);
3226 panic("not implemented builtin symbol found");
3231 * Performs automatic type cast as described in § 6.3.2.1.
3233 * @param orig_type the original type
3235 static type_t *automatic_type_conversion(type_t *orig_type)
3237 type_t *type = skip_typeref(orig_type);
3238 if(is_type_array(type)) {
3239 array_type_t *array_type = &type->array;
3240 type_t *element_type = array_type->element_type;
3241 unsigned qualifiers = array_type->type.qualifiers;
3243 return make_pointer_type(element_type, qualifiers);
3246 if(is_type_function(type)) {
3247 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
3254 * reverts the automatic casts of array to pointer types and function
3255 * to function-pointer types as defined § 6.3.2.1
3257 type_t *revert_automatic_type_conversion(const expression_t *expression)
3259 switch (expression->kind) {
3260 case EXPR_REFERENCE: return expression->reference.declaration->type;
3261 case EXPR_SELECT: return expression->select.compound_entry->type;
3263 case EXPR_UNARY_DEREFERENCE: {
3264 const expression_t *const value = expression->unary.value;
3265 type_t *const type = skip_typeref(value->base.type);
3266 assert(is_type_pointer(type));
3267 return type->pointer.points_to;
3270 case EXPR_BUILTIN_SYMBOL:
3271 return get_builtin_symbol_type(expression->builtin_symbol.symbol);
3273 case EXPR_ARRAY_ACCESS: {
3274 const expression_t *array_ref = expression->array_access.array_ref;
3275 type_t *type_left = skip_typeref(array_ref->base.type);
3276 if (!is_type_valid(type_left))
3278 assert(is_type_pointer(type_left));
3279 return type_left->pointer.points_to;
3285 return expression->base.type;
3288 static expression_t *parse_reference(void)
3290 expression_t *expression = allocate_expression_zero(EXPR_REFERENCE);
3292 reference_expression_t *ref = &expression->reference;
3293 ref->symbol = token.v.symbol;
3295 declaration_t *declaration = get_declaration(ref->symbol, NAMESPACE_NORMAL);
3297 source_position_t source_position = token.source_position;
3300 if(declaration == NULL) {
3301 if (! strict_mode && token.type == '(') {
3302 /* an implicitly defined function */
3303 if (warning.implicit_function_declaration) {
3304 warningf(HERE, "implicit declaration of function '%Y'",
3308 declaration = create_implicit_function(ref->symbol,
3311 errorf(HERE, "unknown symbol '%Y' found.", ref->symbol);
3316 type_t *type = declaration->type;
3318 /* we always do the auto-type conversions; the & and sizeof parser contains
3319 * code to revert this! */
3320 type = automatic_type_conversion(type);
3322 ref->declaration = declaration;
3323 ref->base.type = type;
3325 /* this declaration is used */
3326 declaration->used = true;
3331 static void check_cast_allowed(expression_t *expression, type_t *dest_type)
3335 /* TODO check if explicit cast is allowed and issue warnings/errors */
3338 static expression_t *parse_cast(void)
3340 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
3342 cast->base.source_position = token.source_position;
3344 type_t *type = parse_typename();
3347 expression_t *value = parse_sub_expression(20);
3349 check_cast_allowed(value, type);
3351 cast->base.type = type;
3352 cast->unary.value = value;
3357 static expression_t *parse_statement_expression(void)
3359 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
3361 statement_t *statement = parse_compound_statement();
3362 expression->statement.statement = statement;
3363 expression->base.source_position = statement->base.source_position;
3365 /* find last statement and use its type */
3366 type_t *type = type_void;
3367 const statement_t *stmt = statement->compound.statements;
3369 while (stmt->base.next != NULL)
3370 stmt = stmt->base.next;
3372 if (stmt->kind == STATEMENT_EXPRESSION) {
3373 type = stmt->expression.expression->base.type;
3376 warningf(expression->base.source_position, "empty statement expression ({})");
3378 expression->base.type = type;
3385 static expression_t *parse_brace_expression(void)
3389 switch(token.type) {
3391 /* gcc extension: a statement expression */
3392 return parse_statement_expression();
3396 return parse_cast();
3398 if(is_typedef_symbol(token.v.symbol)) {
3399 return parse_cast();
3403 expression_t *result = parse_expression();
3409 static expression_t *parse_function_keyword(void)
3414 if (current_function == NULL) {
3415 errorf(HERE, "'__func__' used outside of a function");
3418 expression_t *expression = allocate_expression_zero(EXPR_FUNCTION);
3419 expression->base.type = type_char_ptr;
3424 static expression_t *parse_pretty_function_keyword(void)
3426 eat(T___PRETTY_FUNCTION__);
3429 if (current_function == NULL) {
3430 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
3433 expression_t *expression = allocate_expression_zero(EXPR_PRETTY_FUNCTION);
3434 expression->base.type = type_char_ptr;
3439 static designator_t *parse_designator(void)
3441 designator_t *result = allocate_ast_zero(sizeof(result[0]));
3443 if(token.type != T_IDENTIFIER) {
3444 parse_error_expected("while parsing member designator",
3449 result->symbol = token.v.symbol;
3452 designator_t *last_designator = result;
3454 if(token.type == '.') {
3456 if(token.type != T_IDENTIFIER) {
3457 parse_error_expected("while parsing member designator",
3462 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
3463 designator->symbol = token.v.symbol;
3466 last_designator->next = designator;
3467 last_designator = designator;
3470 if(token.type == '[') {
3472 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
3473 designator->array_access = parse_expression();
3474 if(designator->array_access == NULL) {
3480 last_designator->next = designator;
3481 last_designator = designator;
3490 static expression_t *parse_offsetof(void)
3492 eat(T___builtin_offsetof);
3494 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
3495 expression->base.type = type_size_t;
3498 expression->offsetofe.type = parse_typename();
3500 expression->offsetofe.designator = parse_designator();
3506 static expression_t *parse_va_start(void)
3508 eat(T___builtin_va_start);
3510 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
3513 expression->va_starte.ap = parse_assignment_expression();
3515 expression_t *const expr = parse_assignment_expression();
3516 if (expr->kind == EXPR_REFERENCE) {
3517 declaration_t *const decl = expr->reference.declaration;
3519 return create_invalid_expression();
3520 if (decl->parent_scope == ¤t_function->scope &&
3521 decl->next == NULL) {
3522 expression->va_starte.parameter = decl;
3527 errorf(expr->base.source_position, "second argument of 'va_start' must be last parameter of the current function");
3529 return create_invalid_expression();
3532 static expression_t *parse_va_arg(void)
3534 eat(T___builtin_va_arg);
3536 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
3539 expression->va_arge.ap = parse_assignment_expression();
3541 expression->base.type = parse_typename();
3547 static expression_t *parse_builtin_symbol(void)
3549 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_SYMBOL);
3551 symbol_t *symbol = token.v.symbol;
3553 expression->builtin_symbol.symbol = symbol;
3556 type_t *type = get_builtin_symbol_type(symbol);
3557 type = automatic_type_conversion(type);
3559 expression->base.type = type;
3563 static expression_t *parse_builtin_constant(void)
3565 eat(T___builtin_constant_p);
3567 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
3570 expression->builtin_constant.value = parse_assignment_expression();
3572 expression->base.type = type_int;
3577 static expression_t *parse_builtin_prefetch(void)
3579 eat(T___builtin_prefetch);
3581 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_PREFETCH);
3584 expression->builtin_prefetch.adr = parse_assignment_expression();
3585 if (token.type == ',') {
3587 expression->builtin_prefetch.rw = parse_assignment_expression();
3589 if (token.type == ',') {
3591 expression->builtin_prefetch.locality = parse_assignment_expression();
3594 expression->base.type = type_void;
3599 static expression_t *parse_compare_builtin(void)
3601 expression_t *expression;
3603 switch(token.type) {
3604 case T___builtin_isgreater:
3605 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
3607 case T___builtin_isgreaterequal:
3608 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
3610 case T___builtin_isless:
3611 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
3613 case T___builtin_islessequal:
3614 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
3616 case T___builtin_islessgreater:
3617 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
3619 case T___builtin_isunordered:
3620 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
3623 panic("invalid compare builtin found");
3626 expression->base.source_position = HERE;
3630 expression->binary.left = parse_assignment_expression();
3632 expression->binary.right = parse_assignment_expression();
3635 type_t *const orig_type_left = expression->binary.left->base.type;
3636 type_t *const orig_type_right = expression->binary.right->base.type;
3638 type_t *const type_left = skip_typeref(orig_type_left);
3639 type_t *const type_right = skip_typeref(orig_type_right);
3640 if(!is_type_float(type_left) && !is_type_float(type_right)) {
3641 if (is_type_valid(type_left) && is_type_valid(type_right)) {
3642 type_error_incompatible("invalid operands in comparison",
3643 expression->base.source_position, orig_type_left, orig_type_right);
3646 semantic_comparison(&expression->binary);
3652 static expression_t *parse_builtin_expect(void)
3654 eat(T___builtin_expect);
3656 expression_t *expression
3657 = allocate_expression_zero(EXPR_BINARY_BUILTIN_EXPECT);
3660 expression->binary.left = parse_assignment_expression();
3662 expression->binary.right = parse_constant_expression();
3665 expression->base.type = expression->binary.left->base.type;
3670 static expression_t *parse_assume(void) {
3673 expression_t *expression
3674 = allocate_expression_zero(EXPR_UNARY_ASSUME);
3677 expression->unary.value = parse_assignment_expression();
3680 expression->base.type = type_void;
3684 static expression_t *parse_primary_expression(void)
3686 switch(token.type) {
3688 return parse_int_const();
3689 case T_FLOATINGPOINT:
3690 return parse_float_const();
3691 case T_STRING_LITERAL:
3692 return parse_string_const();
3693 case T_WIDE_STRING_LITERAL:
3694 return parse_wide_string_const();
3696 return parse_reference();
3697 case T___FUNCTION__:
3699 return parse_function_keyword();
3700 case T___PRETTY_FUNCTION__:
3701 return parse_pretty_function_keyword();
3702 case T___builtin_offsetof:
3703 return parse_offsetof();
3704 case T___builtin_va_start:
3705 return parse_va_start();
3706 case T___builtin_va_arg:
3707 return parse_va_arg();
3708 case T___builtin_expect:
3709 return parse_builtin_expect();
3710 case T___builtin_alloca:
3711 case T___builtin_nan:
3712 case T___builtin_nand:
3713 case T___builtin_nanf:
3714 case T___builtin_va_end:
3715 return parse_builtin_symbol();
3716 case T___builtin_isgreater:
3717 case T___builtin_isgreaterequal:
3718 case T___builtin_isless:
3719 case T___builtin_islessequal:
3720 case T___builtin_islessgreater:
3721 case T___builtin_isunordered:
3722 return parse_compare_builtin();
3723 case T___builtin_constant_p:
3724 return parse_builtin_constant();
3725 case T___builtin_prefetch:
3726 return parse_builtin_prefetch();
3728 return parse_assume();
3731 return parse_brace_expression();
3734 errorf(HERE, "unexpected token '%K'", &token);
3737 return create_invalid_expression();
3741 * Check if the expression has the character type and issue a warning then.
3743 static void check_for_char_index_type(const expression_t *expression) {
3744 type_t *const type = expression->base.type;
3745 const type_t *const base_type = skip_typeref(type);
3747 if (is_type_atomic(base_type, ATOMIC_TYPE_CHAR) &&
3748 warning.char_subscripts) {
3749 warningf(expression->base.source_position,
3750 "array subscript has type '%T'", type);
3754 static expression_t *parse_array_expression(unsigned precedence,
3761 expression_t *inside = parse_expression();
3763 expression_t *expression = allocate_expression_zero(EXPR_ARRAY_ACCESS);
3765 array_access_expression_t *array_access = &expression->array_access;
3767 type_t *const orig_type_left = left->base.type;
3768 type_t *const orig_type_inside = inside->base.type;
3770 type_t *const type_left = skip_typeref(orig_type_left);
3771 type_t *const type_inside = skip_typeref(orig_type_inside);
3773 type_t *return_type;
3774 if (is_type_pointer(type_left)) {
3775 return_type = type_left->pointer.points_to;
3776 array_access->array_ref = left;
3777 array_access->index = inside;
3778 check_for_char_index_type(inside);
3779 } else if (is_type_pointer(type_inside)) {
3780 return_type = type_inside->pointer.points_to;
3781 array_access->array_ref = inside;
3782 array_access->index = left;
3783 array_access->flipped = true;
3784 check_for_char_index_type(left);
3786 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
3788 "array access on object with non-pointer types '%T', '%T'",
3789 orig_type_left, orig_type_inside);
3791 return_type = type_error_type;
3792 array_access->array_ref = create_invalid_expression();
3795 if(token.type != ']') {
3796 parse_error_expected("Problem while parsing array access", ']', 0);
3801 return_type = automatic_type_conversion(return_type);
3802 expression->base.type = return_type;
3807 static expression_t *parse_typeprop(expression_kind_t kind, unsigned precedence)
3809 expression_t *tp_expression = allocate_expression_zero(kind);
3810 tp_expression->base.type = type_size_t;
3812 if(token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
3814 tp_expression->typeprop.type = parse_typename();
3817 expression_t *expression = parse_sub_expression(precedence);
3818 expression->base.type = revert_automatic_type_conversion(expression);
3820 tp_expression->typeprop.type = expression->base.type;
3821 tp_expression->typeprop.tp_expression = expression;
3824 return tp_expression;
3827 static expression_t *parse_sizeof(unsigned precedence)
3830 return parse_typeprop(EXPR_SIZEOF, precedence);
3833 static expression_t *parse_alignof(unsigned precedence)
3836 return parse_typeprop(EXPR_SIZEOF, precedence);
3839 static expression_t *parse_select_expression(unsigned precedence,
3840 expression_t *compound)
3843 assert(token.type == '.' || token.type == T_MINUSGREATER);
3845 bool is_pointer = (token.type == T_MINUSGREATER);
3848 expression_t *select = allocate_expression_zero(EXPR_SELECT);
3849 select->select.compound = compound;
3851 if(token.type != T_IDENTIFIER) {
3852 parse_error_expected("while parsing select", T_IDENTIFIER, 0);
3855 symbol_t *symbol = token.v.symbol;
3856 select->select.symbol = symbol;
3859 type_t *const orig_type = compound->base.type;
3860 type_t *const type = skip_typeref(orig_type);
3862 type_t *type_left = type;
3864 if (!is_type_pointer(type)) {
3865 if (is_type_valid(type)) {
3866 errorf(HERE, "left hand side of '->' is not a pointer, but '%T'", orig_type);
3868 return create_invalid_expression();
3870 type_left = type->pointer.points_to;
3872 type_left = skip_typeref(type_left);
3874 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
3875 type_left->kind != TYPE_COMPOUND_UNION) {
3876 if (is_type_valid(type_left)) {
3877 errorf(HERE, "request for member '%Y' in something not a struct or "
3878 "union, but '%T'", symbol, type_left);
3880 return create_invalid_expression();
3883 declaration_t *const declaration = type_left->compound.declaration;
3885 if(!declaration->init.is_defined) {
3886 errorf(HERE, "request for member '%Y' of incomplete type '%T'",
3888 return create_invalid_expression();
3891 declaration_t *iter = declaration->scope.declarations;
3892 for( ; iter != NULL; iter = iter->next) {
3893 if(iter->symbol == symbol) {
3898 errorf(HERE, "'%T' has no member named '%Y'", orig_type, symbol);
3899 return create_invalid_expression();
3902 /* we always do the auto-type conversions; the & and sizeof parser contains
3903 * code to revert this! */
3904 type_t *expression_type = automatic_type_conversion(iter->type);
3906 select->select.compound_entry = iter;
3907 select->base.type = expression_type;
3909 if(expression_type->kind == TYPE_BITFIELD) {
3910 expression_t *extract
3911 = allocate_expression_zero(EXPR_UNARY_BITFIELD_EXTRACT);
3912 extract->unary.value = select;
3913 extract->base.type = expression_type->bitfield.base;
3922 * Parse a call expression, ie. expression '( ... )'.
3924 * @param expression the function address
3926 static expression_t *parse_call_expression(unsigned precedence,
3927 expression_t *expression)
3930 expression_t *result = allocate_expression_zero(EXPR_CALL);
3932 call_expression_t *call = &result->call;
3933 call->function = expression;
3935 type_t *const orig_type = expression->base.type;
3936 type_t *const type = skip_typeref(orig_type);
3938 function_type_t *function_type = NULL;
3939 if (is_type_pointer(type)) {
3940 type_t *const to_type = skip_typeref(type->pointer.points_to);
3942 if (is_type_function(to_type)) {
3943 function_type = &to_type->function;
3944 call->base.type = function_type->return_type;
3948 if (function_type == NULL && is_type_valid(type)) {
3949 errorf(HERE, "called object '%E' (type '%T') is not a pointer to a function", expression, orig_type);
3952 /* parse arguments */
3955 if(token.type != ')') {
3956 call_argument_t *last_argument = NULL;
3959 call_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
3961 argument->expression = parse_assignment_expression();
3962 if(last_argument == NULL) {
3963 call->arguments = argument;
3965 last_argument->next = argument;
3967 last_argument = argument;
3969 if(token.type != ',')
3976 if(function_type != NULL) {
3977 function_parameter_t *parameter = function_type->parameters;
3978 call_argument_t *argument = call->arguments;
3979 for( ; parameter != NULL && argument != NULL;
3980 parameter = parameter->next, argument = argument->next) {
3981 type_t *expected_type = parameter->type;
3982 /* TODO report scope in error messages */
3983 expression_t *const arg_expr = argument->expression;
3984 type_t *const res_type = semantic_assign(expected_type, arg_expr, "function call");
3985 if (res_type == NULL) {
3986 /* TODO improve error message */
3987 errorf(arg_expr->base.source_position,
3988 "Cannot call function with argument '%E' of type '%T' where type '%T' is expected",
3989 arg_expr, arg_expr->base.type, expected_type);
3991 argument->expression = create_implicit_cast(argument->expression, expected_type);
3994 /* too few parameters */
3995 if(parameter != NULL) {
3996 errorf(HERE, "too few arguments to function '%E'", expression);
3997 } else if(argument != NULL) {
3998 /* too many parameters */
3999 if(!function_type->variadic
4000 && !function_type->unspecified_parameters) {
4001 errorf(HERE, "too many arguments to function '%E'", expression);
4003 /* do default promotion */
4004 for( ; argument != NULL; argument = argument->next) {
4005 type_t *type = argument->expression->base.type;
4007 type = skip_typeref(type);
4008 if(is_type_integer(type)) {
4009 type = promote_integer(type);
4010 } else if(type == type_float) {
4014 argument->expression
4015 = create_implicit_cast(argument->expression, type);
4018 check_format(&result->call);
4021 check_format(&result->call);
4028 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
4030 static bool same_compound_type(const type_t *type1, const type_t *type2)
4033 is_type_compound(type1) &&
4034 type1->kind == type2->kind &&
4035 type1->compound.declaration == type2->compound.declaration;
4039 * Parse a conditional expression, ie. 'expression ? ... : ...'.
4041 * @param expression the conditional expression
4043 static expression_t *parse_conditional_expression(unsigned precedence,
4044 expression_t *expression)
4048 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
4050 conditional_expression_t *conditional = &result->conditional;
4051 conditional->condition = expression;
4054 type_t *const condition_type_orig = expression->base.type;
4055 type_t *const condition_type = skip_typeref(condition_type_orig);
4056 if (!is_type_scalar(condition_type) && is_type_valid(condition_type)) {
4057 type_error("expected a scalar type in conditional condition",
4058 expression->base.source_position, condition_type_orig);
4061 expression_t *true_expression = parse_expression();
4063 expression_t *false_expression = parse_sub_expression(precedence);
4065 conditional->true_expression = true_expression;
4066 conditional->false_expression = false_expression;
4068 type_t *const orig_true_type = true_expression->base.type;
4069 type_t *const orig_false_type = false_expression->base.type;
4070 type_t *const true_type = skip_typeref(orig_true_type);
4071 type_t *const false_type = skip_typeref(orig_false_type);
4074 type_t *result_type;
4075 if (is_type_arithmetic(true_type) && is_type_arithmetic(false_type)) {
4076 result_type = semantic_arithmetic(true_type, false_type);
4078 true_expression = create_implicit_cast(true_expression, result_type);
4079 false_expression = create_implicit_cast(false_expression, result_type);
4081 conditional->true_expression = true_expression;
4082 conditional->false_expression = false_expression;
4083 conditional->base.type = result_type;
4084 } else if (same_compound_type(true_type, false_type) || (
4085 is_type_atomic(true_type, ATOMIC_TYPE_VOID) &&
4086 is_type_atomic(false_type, ATOMIC_TYPE_VOID)
4088 /* just take 1 of the 2 types */
4089 result_type = true_type;
4090 } else if (is_type_pointer(true_type) && is_type_pointer(false_type)
4091 && pointers_compatible(true_type, false_type)) {
4093 result_type = true_type;
4096 if (is_type_valid(true_type) && is_type_valid(false_type)) {
4097 type_error_incompatible("while parsing conditional",
4098 expression->base.source_position, true_type,
4101 result_type = type_error_type;
4104 conditional->base.type = result_type;
4109 * Parse an extension expression.
4111 static expression_t *parse_extension(unsigned precedence)
4113 eat(T___extension__);
4115 /* TODO enable extensions */
4116 expression_t *expression = parse_sub_expression(precedence);
4117 /* TODO disable extensions */
4121 static expression_t *parse_builtin_classify_type(const unsigned precedence)
4123 eat(T___builtin_classify_type);
4125 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
4126 result->base.type = type_int;
4129 expression_t *expression = parse_sub_expression(precedence);
4131 result->classify_type.type_expression = expression;
4136 static void semantic_incdec(unary_expression_t *expression)
4138 type_t *const orig_type = expression->value->base.type;
4139 type_t *const type = skip_typeref(orig_type);
4140 /* TODO !is_type_real && !is_type_pointer */
4141 if(!is_type_arithmetic(type) && type->kind != TYPE_POINTER) {
4142 if (is_type_valid(type)) {
4143 /* TODO: improve error message */
4144 errorf(HERE, "operation needs an arithmetic or pointer type");
4149 expression->base.type = orig_type;
4152 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
4154 type_t *const orig_type = expression->value->base.type;
4155 type_t *const type = skip_typeref(orig_type);
4156 if(!is_type_arithmetic(type)) {
4157 if (is_type_valid(type)) {
4158 /* TODO: improve error message */
4159 errorf(HERE, "operation needs an arithmetic type");
4164 expression->base.type = orig_type;
4167 static void semantic_unexpr_scalar(unary_expression_t *expression)
4169 type_t *const orig_type = expression->value->base.type;
4170 type_t *const type = skip_typeref(orig_type);
4171 if (!is_type_scalar(type)) {
4172 if (is_type_valid(type)) {
4173 errorf(HERE, "operand of ! must be of scalar type");
4178 expression->base.type = orig_type;
4181 static void semantic_unexpr_integer(unary_expression_t *expression)
4183 type_t *const orig_type = expression->value->base.type;
4184 type_t *const type = skip_typeref(orig_type);
4185 if (!is_type_integer(type)) {
4186 if (is_type_valid(type)) {
4187 errorf(HERE, "operand of ~ must be of integer type");
4192 expression->base.type = orig_type;
4195 static void semantic_dereference(unary_expression_t *expression)
4197 type_t *const orig_type = expression->value->base.type;
4198 type_t *const type = skip_typeref(orig_type);
4199 if(!is_type_pointer(type)) {
4200 if (is_type_valid(type)) {
4201 errorf(HERE, "Unary '*' needs pointer or arrray type, but type '%T' given", orig_type);
4206 type_t *result_type = type->pointer.points_to;
4207 result_type = automatic_type_conversion(result_type);
4208 expression->base.type = result_type;
4212 * Check the semantic of the address taken expression.
4214 static void semantic_take_addr(unary_expression_t *expression)
4216 expression_t *value = expression->value;
4217 value->base.type = revert_automatic_type_conversion(value);
4219 type_t *orig_type = value->base.type;
4220 if(!is_type_valid(orig_type))
4223 if(value->kind == EXPR_REFERENCE) {
4224 declaration_t *const declaration = value->reference.declaration;
4225 if(declaration != NULL) {
4226 if (declaration->storage_class == STORAGE_CLASS_REGISTER) {
4227 errorf(expression->base.source_position,
4228 "address of register variable '%Y' requested",
4229 declaration->symbol);
4231 declaration->address_taken = 1;
4235 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
4238 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
4239 static expression_t *parse_##unexpression_type(unsigned precedence) \
4243 expression_t *unary_expression \
4244 = allocate_expression_zero(unexpression_type); \
4245 unary_expression->base.source_position = HERE; \
4246 unary_expression->unary.value = parse_sub_expression(precedence); \
4248 sfunc(&unary_expression->unary); \
4250 return unary_expression; \
4253 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
4254 semantic_unexpr_arithmetic)
4255 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
4256 semantic_unexpr_arithmetic)
4257 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
4258 semantic_unexpr_scalar)
4259 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
4260 semantic_dereference)
4261 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
4263 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
4264 semantic_unexpr_integer)
4265 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
4267 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
4270 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
4272 static expression_t *parse_##unexpression_type(unsigned precedence, \
4273 expression_t *left) \
4275 (void) precedence; \
4278 expression_t *unary_expression \
4279 = allocate_expression_zero(unexpression_type); \
4280 unary_expression->unary.value = left; \
4282 sfunc(&unary_expression->unary); \
4284 return unary_expression; \
4287 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
4288 EXPR_UNARY_POSTFIX_INCREMENT,
4290 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
4291 EXPR_UNARY_POSTFIX_DECREMENT,
4294 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
4296 /* TODO: handle complex + imaginary types */
4298 /* § 6.3.1.8 Usual arithmetic conversions */
4299 if(type_left == type_long_double || type_right == type_long_double) {
4300 return type_long_double;
4301 } else if(type_left == type_double || type_right == type_double) {
4303 } else if(type_left == type_float || type_right == type_float) {
4307 type_right = promote_integer(type_right);
4308 type_left = promote_integer(type_left);
4310 if(type_left == type_right)
4313 bool signed_left = is_type_signed(type_left);
4314 bool signed_right = is_type_signed(type_right);
4315 int rank_left = get_rank(type_left);
4316 int rank_right = get_rank(type_right);
4317 if(rank_left < rank_right) {
4318 if(signed_left == signed_right || !signed_right) {
4324 if(signed_left == signed_right || !signed_left) {
4333 * Check the semantic restrictions for a binary expression.
4335 static void semantic_binexpr_arithmetic(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.type;
4340 type_t *const orig_type_right = right->base.type;
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_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
4345 /* TODO: improve error message */
4346 if (is_type_valid(type_left) && is_type_valid(type_right)) {
4347 errorf(HERE, "operation needs arithmetic types");
4352 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
4353 expression->left = create_implicit_cast(left, arithmetic_type);
4354 expression->right = create_implicit_cast(right, arithmetic_type);
4355 expression->base.type = arithmetic_type;
4358 static void semantic_shift_op(binary_expression_t *expression)
4360 expression_t *const left = expression->left;
4361 expression_t *const right = expression->right;
4362 type_t *const orig_type_left = left->base.type;
4363 type_t *const orig_type_right = right->base.type;
4364 type_t * type_left = skip_typeref(orig_type_left);
4365 type_t * type_right = skip_typeref(orig_type_right);
4367 if(!is_type_integer(type_left) || !is_type_integer(type_right)) {
4368 /* TODO: improve error message */
4369 if (is_type_valid(type_left) && is_type_valid(type_right)) {
4370 errorf(HERE, "operation needs integer types");
4375 type_left = promote_integer(type_left);
4376 type_right = promote_integer(type_right);
4378 expression->left = create_implicit_cast(left, type_left);
4379 expression->right = create_implicit_cast(right, type_right);
4380 expression->base.type = type_left;
4383 static void semantic_add(binary_expression_t *expression)
4385 expression_t *const left = expression->left;
4386 expression_t *const right = expression->right;
4387 type_t *const orig_type_left = left->base.type;
4388 type_t *const orig_type_right = right->base.type;
4389 type_t *const type_left = skip_typeref(orig_type_left);
4390 type_t *const type_right = skip_typeref(orig_type_right);
4393 if(is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
4394 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
4395 expression->left = create_implicit_cast(left, arithmetic_type);
4396 expression->right = create_implicit_cast(right, arithmetic_type);
4397 expression->base.type = arithmetic_type;
4399 } else if(is_type_pointer(type_left) && is_type_integer(type_right)) {
4400 expression->base.type = type_left;
4401 } else if(is_type_pointer(type_right) && is_type_integer(type_left)) {
4402 expression->base.type = type_right;
4403 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
4404 errorf(HERE, "invalid operands to binary + ('%T', '%T')", orig_type_left, orig_type_right);
4408 static void semantic_sub(binary_expression_t *expression)
4410 expression_t *const left = expression->left;
4411 expression_t *const right = expression->right;
4412 type_t *const orig_type_left = left->base.type;
4413 type_t *const orig_type_right = right->base.type;
4414 type_t *const type_left = skip_typeref(orig_type_left);
4415 type_t *const type_right = skip_typeref(orig_type_right);
4418 if(is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
4419 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
4420 expression->left = create_implicit_cast(left, arithmetic_type);
4421 expression->right = create_implicit_cast(right, arithmetic_type);
4422 expression->base.type = arithmetic_type;
4424 } else if(is_type_pointer(type_left) && is_type_integer(type_right)) {
4425 expression->base.type = type_left;
4426 } else if(is_type_pointer(type_left) && is_type_pointer(type_right)) {
4427 if(!pointers_compatible(type_left, type_right)) {
4429 "pointers to incompatible objects to binary '-' ('%T', '%T')",
4430 orig_type_left, orig_type_right);
4432 expression->base.type = type_ptrdiff_t;
4434 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
4435 errorf(HERE, "invalid operands to binary '-' ('%T', '%T')",
4436 orig_type_left, orig_type_right);
4441 * Check the semantics of comparison expressions.
4443 * @param expression The expression to check.
4445 static void semantic_comparison(binary_expression_t *expression)
4447 expression_t *left = expression->left;
4448 expression_t *right = expression->right;
4449 type_t *orig_type_left = left->base.type;
4450 type_t *orig_type_right = right->base.type;
4452 type_t *type_left = skip_typeref(orig_type_left);
4453 type_t *type_right = skip_typeref(orig_type_right);
4455 /* TODO non-arithmetic types */
4456 if(is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
4457 if (warning.sign_compare &&
4458 (expression->base.kind != EXPR_BINARY_EQUAL &&
4459 expression->base.kind != EXPR_BINARY_NOTEQUAL) &&
4460 (is_type_signed(type_left) != is_type_signed(type_right))) {
4461 warningf(expression->base.source_position,
4462 "comparison between signed and unsigned");
4464 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
4465 expression->left = create_implicit_cast(left, arithmetic_type);
4466 expression->right = create_implicit_cast(right, arithmetic_type);
4467 expression->base.type = arithmetic_type;
4468 if (warning.float_equal &&
4469 (expression->base.kind == EXPR_BINARY_EQUAL ||
4470 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
4471 is_type_float(arithmetic_type)) {
4472 warningf(expression->base.source_position,
4473 "comparing floating point with == or != is unsafe");
4475 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
4476 /* TODO check compatibility */
4477 } else if (is_type_pointer(type_left)) {
4478 expression->right = create_implicit_cast(right, type_left);
4479 } else if (is_type_pointer(type_right)) {
4480 expression->left = create_implicit_cast(left, type_right);
4481 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
4482 type_error_incompatible("invalid operands in comparison",
4483 expression->base.source_position,
4484 type_left, type_right);
4486 expression->base.type = type_int;
4489 static void semantic_arithmetic_assign(binary_expression_t *expression)
4491 expression_t *left = expression->left;
4492 expression_t *right = expression->right;
4493 type_t *orig_type_left = left->base.type;
4494 type_t *orig_type_right = right->base.type;
4496 type_t *type_left = skip_typeref(orig_type_left);
4497 type_t *type_right = skip_typeref(orig_type_right);
4499 if(!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
4500 /* TODO: improve error message */
4501 if (is_type_valid(type_left) && is_type_valid(type_right)) {
4502 errorf(HERE, "operation needs arithmetic types");
4507 /* combined instructions are tricky. We can't create an implicit cast on
4508 * the left side, because we need the uncasted form for the store.
4509 * The ast2firm pass has to know that left_type must be right_type
4510 * for the arithmetic operation and create a cast by itself */
4511 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
4512 expression->right = create_implicit_cast(right, arithmetic_type);
4513 expression->base.type = type_left;
4516 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
4518 expression_t *const left = expression->left;
4519 expression_t *const right = expression->right;
4520 type_t *const orig_type_left = left->base.type;
4521 type_t *const orig_type_right = right->base.type;
4522 type_t *const type_left = skip_typeref(orig_type_left);
4523 type_t *const type_right = skip_typeref(orig_type_right);
4525 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
4526 /* combined instructions are tricky. We can't create an implicit cast on
4527 * the left side, because we need the uncasted form for the store.
4528 * The ast2firm pass has to know that left_type must be right_type
4529 * for the arithmetic operation and create a cast by itself */
4530 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
4531 expression->right = create_implicit_cast(right, arithmetic_type);
4532 expression->base.type = type_left;
4533 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
4534 expression->base.type = type_left;
4535 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
4536 errorf(HERE, "incompatible types '%T' and '%T' in assignment", orig_type_left, orig_type_right);
4541 * Check the semantic restrictions of a logical expression.
4543 static void semantic_logical_op(binary_expression_t *expression)
4545 expression_t *const left = expression->left;
4546 expression_t *const right = expression->right;
4547 type_t *const orig_type_left = left->base.type;
4548 type_t *const orig_type_right = right->base.type;
4549 type_t *const type_left = skip_typeref(orig_type_left);
4550 type_t *const type_right = skip_typeref(orig_type_right);
4552 if (!is_type_scalar(type_left) || !is_type_scalar(type_right)) {
4553 /* TODO: improve error message */
4554 if (is_type_valid(type_left) && is_type_valid(type_right)) {
4555 errorf(HERE, "operation needs scalar types");
4560 expression->base.type = type_int;
4564 * Checks if a compound type has constant fields.
4566 static bool has_const_fields(const compound_type_t *type)
4568 const scope_t *scope = &type->declaration->scope;
4569 const declaration_t *declaration = scope->declarations;
4571 for (; declaration != NULL; declaration = declaration->next) {
4572 if (declaration->namespc != NAMESPACE_NORMAL)
4575 const type_t *decl_type = skip_typeref(declaration->type);
4576 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
4584 * Check the semantic restrictions of a binary assign expression.
4586 static void semantic_binexpr_assign(binary_expression_t *expression)
4588 expression_t *left = expression->left;
4589 type_t *orig_type_left = left->base.type;
4591 type_t *type_left = revert_automatic_type_conversion(left);
4592 type_left = skip_typeref(orig_type_left);
4594 /* must be a modifiable lvalue */
4595 if (is_type_array(type_left)) {
4596 errorf(HERE, "cannot assign to arrays ('%E')", left);
4599 if(type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
4600 errorf(HERE, "assignment to readonly location '%E' (type '%T')", left,
4604 if(is_type_incomplete(type_left)) {
4606 "left-hand side of assignment '%E' has incomplete type '%T'",
4607 left, orig_type_left);
4610 if(is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
4611 errorf(HERE, "cannot assign to '%E' because compound type '%T' has readonly fields",
4612 left, orig_type_left);
4616 type_t *const res_type = semantic_assign(orig_type_left, expression->right,
4618 if (res_type == NULL) {
4619 errorf(expression->base.source_position,
4620 "cannot assign to '%T' from '%T'",
4621 orig_type_left, expression->right->base.type);
4623 expression->right = create_implicit_cast(expression->right, res_type);
4626 expression->base.type = orig_type_left;
4629 static bool expression_has_effect(const expression_t *const expr)
4631 switch (expr->kind) {
4632 case EXPR_UNKNOWN: break;
4633 case EXPR_INVALID: break;
4634 case EXPR_REFERENCE: return false;
4635 case EXPR_CONST: return false;
4636 case EXPR_STRING_LITERAL: return false;
4637 case EXPR_WIDE_STRING_LITERAL: return false;
4639 const call_expression_t *const call = &expr->call;
4640 if (call->function->kind != EXPR_BUILTIN_SYMBOL)
4643 switch (call->function->builtin_symbol.symbol->ID) {
4644 case T___builtin_va_end: return true;
4645 default: return false;
4648 case EXPR_CONDITIONAL: {
4649 const conditional_expression_t *const cond = &expr->conditional;
4651 expression_has_effect(cond->true_expression) &&
4652 expression_has_effect(cond->false_expression);
4654 case EXPR_SELECT: return false;
4655 case EXPR_ARRAY_ACCESS: return false;
4656 case EXPR_SIZEOF: return false;
4657 case EXPR_CLASSIFY_TYPE: return false;
4658 case EXPR_ALIGNOF: return false;
4660 case EXPR_FUNCTION: return false;
4661 case EXPR_PRETTY_FUNCTION: return false;
4662 case EXPR_BUILTIN_SYMBOL: break; /* handled in EXPR_CALL */
4663 case EXPR_BUILTIN_CONSTANT_P: return false;
4664 case EXPR_BUILTIN_PREFETCH: return true;
4665 case EXPR_OFFSETOF: return false;
4666 case EXPR_VA_START: return true;
4667 case EXPR_VA_ARG: return true;
4668 case EXPR_STATEMENT: return true; // TODO
4670 case EXPR_UNARY_NEGATE: return false;
4671 case EXPR_UNARY_PLUS: return false;
4672 case EXPR_UNARY_BITWISE_NEGATE: return false;
4673 case EXPR_UNARY_NOT: return false;
4674 case EXPR_UNARY_DEREFERENCE: return false;
4675 case EXPR_UNARY_TAKE_ADDRESS: return false;
4676 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
4677 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
4678 case EXPR_UNARY_PREFIX_INCREMENT: return true;
4679 case EXPR_UNARY_PREFIX_DECREMENT: return true;
4680 case EXPR_UNARY_CAST:
4681 return is_type_atomic(expr->base.type, ATOMIC_TYPE_VOID);
4682 case EXPR_UNARY_CAST_IMPLICIT: return true;
4683 case EXPR_UNARY_ASSUME: return true;
4684 case EXPR_UNARY_BITFIELD_EXTRACT: return false;
4686 case EXPR_BINARY_ADD: return false;
4687 case EXPR_BINARY_SUB: return false;
4688 case EXPR_BINARY_MUL: return false;
4689 case EXPR_BINARY_DIV: return false;
4690 case EXPR_BINARY_MOD: return false;
4691 case EXPR_BINARY_EQUAL: return false;
4692 case EXPR_BINARY_NOTEQUAL: return false;
4693 case EXPR_BINARY_LESS: return false;
4694 case EXPR_BINARY_LESSEQUAL: return false;
4695 case EXPR_BINARY_GREATER: return false;
4696 case EXPR_BINARY_GREATEREQUAL: return false;
4697 case EXPR_BINARY_BITWISE_AND: return false;
4698 case EXPR_BINARY_BITWISE_OR: return false;
4699 case EXPR_BINARY_BITWISE_XOR: return false;
4700 case EXPR_BINARY_SHIFTLEFT: return false;
4701 case EXPR_BINARY_SHIFTRIGHT: return false;
4702 case EXPR_BINARY_ASSIGN: return true;
4703 case EXPR_BINARY_MUL_ASSIGN: return true;
4704 case EXPR_BINARY_DIV_ASSIGN: return true;
4705 case EXPR_BINARY_MOD_ASSIGN: return true;
4706 case EXPR_BINARY_ADD_ASSIGN: return true;
4707 case EXPR_BINARY_SUB_ASSIGN: return true;
4708 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
4709 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
4710 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
4711 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
4712 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
4713 case EXPR_BINARY_LOGICAL_AND:
4714 case EXPR_BINARY_LOGICAL_OR:
4715 case EXPR_BINARY_COMMA:
4716 return expression_has_effect(expr->binary.right);
4718 case EXPR_BINARY_BUILTIN_EXPECT: return true;
4719 case EXPR_BINARY_ISGREATER: return false;
4720 case EXPR_BINARY_ISGREATEREQUAL: return false;
4721 case EXPR_BINARY_ISLESS: return false;
4722 case EXPR_BINARY_ISLESSEQUAL: return false;
4723 case EXPR_BINARY_ISLESSGREATER: return false;
4724 case EXPR_BINARY_ISUNORDERED: return false;
4727 panic("unexpected statement");
4730 static void semantic_comma(binary_expression_t *expression)
4732 if (warning.unused_value) {
4733 const expression_t *const left = expression->left;
4734 if (!expression_has_effect(left)) {
4735 warningf(left->base.source_position, "left-hand operand of comma expression has no effect");
4738 expression->base.type = expression->right->base.type;
4741 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, sfunc, lr) \
4742 static expression_t *parse_##binexpression_type(unsigned precedence, \
4743 expression_t *left) \
4746 source_position_t pos = HERE; \
4748 expression_t *right = parse_sub_expression(precedence + lr); \
4750 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
4751 binexpr->base.source_position = pos; \
4752 binexpr->binary.left = left; \
4753 binexpr->binary.right = right; \
4754 sfunc(&binexpr->binary); \
4759 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, semantic_comma, 1)
4760 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, semantic_binexpr_arithmetic, 1)
4761 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, semantic_binexpr_arithmetic, 1)
4762 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, semantic_binexpr_arithmetic, 1)
4763 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, semantic_add, 1)
4764 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, semantic_sub, 1)
4765 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, semantic_comparison, 1)
4766 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, semantic_comparison, 1)
4767 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, semantic_binexpr_assign, 0)
4769 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL,
4770 semantic_comparison, 1)
4771 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL,
4772 semantic_comparison, 1)
4773 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL,
4774 semantic_comparison, 1)
4775 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL,
4776 semantic_comparison, 1)
4778 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND,
4779 semantic_binexpr_arithmetic, 1)
4780 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR,
4781 semantic_binexpr_arithmetic, 1)
4782 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR,
4783 semantic_binexpr_arithmetic, 1)
4784 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND,
4785 semantic_logical_op, 1)
4786 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR,
4787 semantic_logical_op, 1)
4788 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT,
4789 semantic_shift_op, 1)
4790 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT,
4791 semantic_shift_op, 1)
4792 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN,
4793 semantic_arithmetic_addsubb_assign, 0)
4794 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN,
4795 semantic_arithmetic_addsubb_assign, 0)
4796 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN,
4797 semantic_arithmetic_assign, 0)
4798 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN,
4799 semantic_arithmetic_assign, 0)
4800 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN,
4801 semantic_arithmetic_assign, 0)
4802 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN,
4803 semantic_arithmetic_assign, 0)
4804 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN,
4805 semantic_arithmetic_assign, 0)
4806 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN,
4807 semantic_arithmetic_assign, 0)
4808 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN,
4809 semantic_arithmetic_assign, 0)
4810 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN,
4811 semantic_arithmetic_assign, 0)
4813 static expression_t *parse_sub_expression(unsigned precedence)
4815 if(token.type < 0) {
4816 return expected_expression_error();
4819 expression_parser_function_t *parser
4820 = &expression_parsers[token.type];
4821 source_position_t source_position = token.source_position;
4824 if(parser->parser != NULL) {
4825 left = parser->parser(parser->precedence);
4827 left = parse_primary_expression();
4829 assert(left != NULL);
4830 left->base.source_position = source_position;
4833 if(token.type < 0) {
4834 return expected_expression_error();
4837 parser = &expression_parsers[token.type];
4838 if(parser->infix_parser == NULL)
4840 if(parser->infix_precedence < precedence)
4843 left = parser->infix_parser(parser->infix_precedence, left);
4845 assert(left != NULL);
4846 assert(left->kind != EXPR_UNKNOWN);
4847 left->base.source_position = source_position;
4854 * Parse an expression.
4856 static expression_t *parse_expression(void)
4858 return parse_sub_expression(1);
4862 * Register a parser for a prefix-like operator with given precedence.
4864 * @param parser the parser function
4865 * @param token_type the token type of the prefix token
4866 * @param precedence the precedence of the operator
4868 static void register_expression_parser(parse_expression_function parser,
4869 int token_type, unsigned precedence)
4871 expression_parser_function_t *entry = &expression_parsers[token_type];
4873 if(entry->parser != NULL) {
4874 diagnosticf("for token '%k'\n", (token_type_t)token_type);
4875 panic("trying to register multiple expression parsers for a token");
4877 entry->parser = parser;
4878 entry->precedence = precedence;
4882 * Register a parser for an infix operator with given precedence.
4884 * @param parser the parser function
4885 * @param token_type the token type of the infix operator
4886 * @param precedence the precedence of the operator
4888 static void register_infix_parser(parse_expression_infix_function parser,
4889 int token_type, unsigned precedence)
4891 expression_parser_function_t *entry = &expression_parsers[token_type];
4893 if(entry->infix_parser != NULL) {
4894 diagnosticf("for token '%k'\n", (token_type_t)token_type);
4895 panic("trying to register multiple infix expression parsers for a "
4898 entry->infix_parser = parser;
4899 entry->infix_precedence = precedence;
4903 * Initialize the expression parsers.
4905 static void init_expression_parsers(void)
4907 memset(&expression_parsers, 0, sizeof(expression_parsers));
4909 register_infix_parser(parse_array_expression, '[', 30);
4910 register_infix_parser(parse_call_expression, '(', 30);
4911 register_infix_parser(parse_select_expression, '.', 30);
4912 register_infix_parser(parse_select_expression, T_MINUSGREATER, 30);
4913 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT,
4915 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT,
4918 register_infix_parser(parse_EXPR_BINARY_MUL, '*', 16);
4919 register_infix_parser(parse_EXPR_BINARY_DIV, '/', 16);
4920 register_infix_parser(parse_EXPR_BINARY_MOD, '%', 16);
4921 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, 16);
4922 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, 16);
4923 register_infix_parser(parse_EXPR_BINARY_ADD, '+', 15);
4924 register_infix_parser(parse_EXPR_BINARY_SUB, '-', 15);
4925 register_infix_parser(parse_EXPR_BINARY_LESS, '<', 14);
4926 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', 14);
4927 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, 14);
4928 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, 14);
4929 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, 13);
4930 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL,
4931 T_EXCLAMATIONMARKEQUAL, 13);
4932 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', 12);
4933 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', 11);
4934 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', 10);
4935 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, 9);
4936 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, 8);
4937 register_infix_parser(parse_conditional_expression, '?', 7);
4938 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', 2);
4939 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, 2);
4940 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, 2);
4941 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, 2);
4942 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, 2);
4943 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, 2);
4944 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN,
4945 T_LESSLESSEQUAL, 2);
4946 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN,
4947 T_GREATERGREATEREQUAL, 2);
4948 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN,
4950 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN,
4952 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN,
4955 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', 1);
4957 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-', 25);
4958 register_expression_parser(parse_EXPR_UNARY_PLUS, '+', 25);
4959 register_expression_parser(parse_EXPR_UNARY_NOT, '!', 25);
4960 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~', 25);
4961 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*', 25);
4962 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&', 25);
4963 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT,
4965 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT,
4967 register_expression_parser(parse_sizeof, T_sizeof, 25);
4968 register_expression_parser(parse_alignof, T___alignof__, 25);
4969 register_expression_parser(parse_extension, T___extension__, 25);
4970 register_expression_parser(parse_builtin_classify_type,
4971 T___builtin_classify_type, 25);
4975 * Parse a asm statement constraints specification.
4977 static asm_constraint_t *parse_asm_constraints(void)
4979 asm_constraint_t *result = NULL;
4980 asm_constraint_t *last = NULL;
4982 while(token.type == T_STRING_LITERAL || token.type == '[') {
4983 asm_constraint_t *constraint = allocate_ast_zero(sizeof(constraint[0]));
4984 memset(constraint, 0, sizeof(constraint[0]));
4986 if(token.type == '[') {
4988 if(token.type != T_IDENTIFIER) {
4989 parse_error_expected("while parsing asm constraint",
4993 constraint->symbol = token.v.symbol;
4998 constraint->constraints = parse_string_literals();
5000 constraint->expression = parse_expression();
5004 last->next = constraint;
5006 result = constraint;
5010 if(token.type != ',')
5019 * Parse a asm statement clobber specification.
5021 static asm_clobber_t *parse_asm_clobbers(void)
5023 asm_clobber_t *result = NULL;
5024 asm_clobber_t *last = NULL;
5026 while(token.type == T_STRING_LITERAL) {
5027 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
5028 clobber->clobber = parse_string_literals();
5031 last->next = clobber;
5037 if(token.type != ',')
5046 * Parse an asm statement.
5048 static statement_t *parse_asm_statement(void)
5052 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
5053 statement->base.source_position = token.source_position;
5055 asm_statement_t *asm_statement = &statement->asms;
5057 if(token.type == T_volatile) {
5059 asm_statement->is_volatile = true;
5063 asm_statement->asm_text = parse_string_literals();
5065 if(token.type != ':')
5069 asm_statement->inputs = parse_asm_constraints();
5070 if(token.type != ':')
5074 asm_statement->outputs = parse_asm_constraints();
5075 if(token.type != ':')
5079 asm_statement->clobbers = parse_asm_clobbers();
5088 * Parse a case statement.
5090 static statement_t *parse_case_statement(void)
5094 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
5096 statement->base.source_position = token.source_position;
5097 statement->case_label.expression = parse_expression();
5101 if (! is_constant_expression(statement->case_label.expression)) {
5102 errorf(statement->base.source_position,
5103 "case label does not reduce to an integer constant");
5105 /* TODO: check if the case label is already known */
5106 if (current_switch != NULL) {
5107 /* link all cases into the switch statement */
5108 if (current_switch->last_case == NULL) {
5109 current_switch->first_case =
5110 current_switch->last_case = &statement->case_label;
5112 current_switch->last_case->next = &statement->case_label;
5115 errorf(statement->base.source_position,
5116 "case label not within a switch statement");
5119 statement->case_label.statement = parse_statement();
5125 * Finds an existing default label of a switch statement.
5127 static case_label_statement_t *
5128 find_default_label(const switch_statement_t *statement)
5130 for (case_label_statement_t *label = statement->first_case;
5132 label = label->next) {
5133 if (label->expression == NULL)
5140 * Parse a default statement.
5142 static statement_t *parse_default_statement(void)
5146 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
5148 statement->base.source_position = token.source_position;
5151 if (current_switch != NULL) {
5152 const case_label_statement_t *def_label = find_default_label(current_switch);
5153 if (def_label != NULL) {
5154 errorf(HERE, "multiple default labels in one switch");
5155 errorf(def_label->base.source_position,
5156 "this is the first default label");
5158 /* link all cases into the switch statement */
5159 if (current_switch->last_case == NULL) {
5160 current_switch->first_case =
5161 current_switch->last_case = &statement->case_label;
5163 current_switch->last_case->next = &statement->case_label;
5167 errorf(statement->base.source_position,
5168 "'default' label not within a switch statement");
5170 statement->label.statement = parse_statement();
5176 * Return the declaration for a given label symbol or create a new one.
5178 static declaration_t *get_label(symbol_t *symbol)
5180 declaration_t *candidate = get_declaration(symbol, NAMESPACE_LABEL);
5181 assert(current_function != NULL);
5182 /* if we found a label in the same function, then we already created the
5184 if(candidate != NULL
5185 && candidate->parent_scope == ¤t_function->scope) {
5189 /* otherwise we need to create a new one */
5190 declaration_t *const declaration = allocate_declaration_zero();
5191 declaration->namespc = NAMESPACE_LABEL;
5192 declaration->symbol = symbol;
5194 label_push(declaration);
5200 * Parse a label statement.
5202 static statement_t *parse_label_statement(void)
5204 assert(token.type == T_IDENTIFIER);
5205 symbol_t *symbol = token.v.symbol;
5208 declaration_t *label = get_label(symbol);
5210 /* if source position is already set then the label is defined twice,
5211 * otherwise it was just mentioned in a goto so far */
5212 if(label->source_position.input_name != NULL) {
5213 errorf(HERE, "duplicate label '%Y'", symbol);
5214 errorf(label->source_position, "previous definition of '%Y' was here",
5217 label->source_position = token.source_position;
5220 statement_t *statement = allocate_statement_zero(STATEMENT_LABEL);
5222 statement->base.source_position = token.source_position;
5223 statement->label.label = label;
5227 if(token.type == '}') {
5228 /* TODO only warn? */
5229 errorf(HERE, "label at end of compound statement");
5232 if (token.type == ';') {
5233 /* eat an empty statement here, to avoid the warning about an empty
5234 * after a label. label:; is commonly used to have a label before
5238 statement->label.statement = parse_statement();
5242 /* remember the labels's in a list for later checking */
5243 if (label_last == NULL) {
5244 label_first = &statement->label;
5246 label_last->next = &statement->label;
5248 label_last = &statement->label;
5254 * Parse an if statement.
5256 static statement_t *parse_if(void)
5260 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
5261 statement->base.source_position = token.source_position;
5264 statement->ifs.condition = parse_expression();
5267 statement->ifs.true_statement = parse_statement();
5268 if(token.type == T_else) {
5270 statement->ifs.false_statement = parse_statement();
5277 * Parse a switch statement.
5279 static statement_t *parse_switch(void)
5283 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
5284 statement->base.source_position = token.source_position;
5287 expression_t *const expr = parse_expression();
5288 type_t * type = skip_typeref(expr->base.type);
5289 if (is_type_integer(type)) {
5290 type = promote_integer(type);
5291 } else if (is_type_valid(type)) {
5292 errorf(expr->base.source_position,
5293 "switch quantity is not an integer, but '%T'", type);
5294 type = type_error_type;
5296 statement->switchs.expression = create_implicit_cast(expr, type);
5299 switch_statement_t *rem = current_switch;
5300 current_switch = &statement->switchs;
5301 statement->switchs.body = parse_statement();
5302 current_switch = rem;
5304 if (warning.switch_default
5305 && find_default_label(&statement->switchs) == NULL) {
5306 warningf(statement->base.source_position, "switch has no default case");
5312 static statement_t *parse_loop_body(statement_t *const loop)
5314 statement_t *const rem = current_loop;
5315 current_loop = loop;
5317 statement_t *const body = parse_statement();
5324 * Parse a while statement.
5326 static statement_t *parse_while(void)
5330 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
5331 statement->base.source_position = token.source_position;
5334 statement->whiles.condition = parse_expression();
5337 statement->whiles.body = parse_loop_body(statement);
5343 * Parse a do statement.
5345 static statement_t *parse_do(void)
5349 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
5351 statement->base.source_position = token.source_position;
5353 statement->do_while.body = parse_loop_body(statement);
5357 statement->do_while.condition = parse_expression();
5365 * Parse a for statement.
5367 static statement_t *parse_for(void)
5371 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
5372 statement->base.source_position = token.source_position;
5376 int top = environment_top();
5377 scope_t *last_scope = scope;
5378 set_scope(&statement->fors.scope);
5380 if(token.type != ';') {
5381 if(is_declaration_specifier(&token, false)) {
5382 parse_declaration(record_declaration);
5384 statement->fors.initialisation = parse_expression();
5391 if(token.type != ';') {
5392 statement->fors.condition = parse_expression();
5395 if(token.type != ')') {
5396 statement->fors.step = parse_expression();
5399 statement->fors.body = parse_loop_body(statement);
5401 assert(scope == &statement->fors.scope);
5402 set_scope(last_scope);
5403 environment_pop_to(top);
5409 * Parse a goto statement.
5411 static statement_t *parse_goto(void)
5415 if(token.type != T_IDENTIFIER) {
5416 parse_error_expected("while parsing goto", T_IDENTIFIER, 0);
5420 symbol_t *symbol = token.v.symbol;
5423 declaration_t *label = get_label(symbol);
5425 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
5426 statement->base.source_position = token.source_position;
5428 statement->gotos.label = label;
5430 /* remember the goto's in a list for later checking */
5431 if (goto_last == NULL) {
5432 goto_first = &statement->gotos;
5434 goto_last->next = &statement->gotos;
5436 goto_last = &statement->gotos;
5444 * Parse a continue statement.
5446 static statement_t *parse_continue(void)
5448 statement_t *statement;
5449 if (current_loop == NULL) {
5450 errorf(HERE, "continue statement not within loop");
5453 statement = allocate_statement_zero(STATEMENT_CONTINUE);
5455 statement->base.source_position = token.source_position;
5465 * Parse a break statement.
5467 static statement_t *parse_break(void)
5469 statement_t *statement;
5470 if (current_switch == NULL && current_loop == NULL) {
5471 errorf(HERE, "break statement not within loop or switch");
5474 statement = allocate_statement_zero(STATEMENT_BREAK);
5476 statement->base.source_position = token.source_position;
5486 * Check if a given declaration represents a local variable.
5488 static bool is_local_var_declaration(const declaration_t *declaration) {
5489 switch ((storage_class_tag_t) declaration->storage_class) {
5490 case STORAGE_CLASS_NONE:
5491 case STORAGE_CLASS_AUTO:
5492 case STORAGE_CLASS_REGISTER: {
5493 const type_t *type = skip_typeref(declaration->type);
5494 if(is_type_function(type)) {
5506 * Check if a given declaration represents a variable.
5508 static bool is_var_declaration(const declaration_t *declaration) {
5509 switch ((storage_class_tag_t) declaration->storage_class) {
5510 case STORAGE_CLASS_NONE:
5511 case STORAGE_CLASS_EXTERN:
5512 case STORAGE_CLASS_STATIC:
5513 case STORAGE_CLASS_AUTO:
5514 case STORAGE_CLASS_REGISTER:
5515 case STORAGE_CLASS_THREAD:
5516 case STORAGE_CLASS_THREAD_EXTERN:
5517 case STORAGE_CLASS_THREAD_STATIC: {
5518 const type_t *type = skip_typeref(declaration->type);
5519 if(is_type_function(type)) {
5531 * Check if a given expression represents a local variable.
5533 static bool is_local_variable(const expression_t *expression)
5535 if (expression->base.kind != EXPR_REFERENCE) {
5538 const declaration_t *declaration = expression->reference.declaration;
5539 return is_local_var_declaration(declaration);
5543 * Check if a given expression represents a local variable and
5544 * return its declaration then, else return NULL.
5546 declaration_t *expr_is_variable(const expression_t *expression)
5548 if (expression->base.kind != EXPR_REFERENCE) {
5551 declaration_t *declaration = expression->reference.declaration;
5552 if (is_var_declaration(declaration))
5558 * Parse a return statement.
5560 static statement_t *parse_return(void)
5564 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
5565 statement->base.source_position = token.source_position;
5567 expression_t *return_value = NULL;
5568 if(token.type != ';') {
5569 return_value = parse_expression();
5573 const type_t *const func_type = current_function->type;
5574 assert(is_type_function(func_type));
5575 type_t *const return_type = skip_typeref(func_type->function.return_type);
5577 if(return_value != NULL) {
5578 type_t *return_value_type = skip_typeref(return_value->base.type);
5580 if(is_type_atomic(return_type, ATOMIC_TYPE_VOID)
5581 && !is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
5582 warningf(statement->base.source_position,
5583 "'return' with a value, in function returning void");
5584 return_value = NULL;
5586 type_t *const res_type = semantic_assign(return_type,
5587 return_value, "'return'");
5588 if (res_type == NULL) {
5589 errorf(statement->base.source_position,
5590 "cannot return something of type '%T' in function returning '%T'",
5591 return_value->base.type, return_type);
5593 return_value = create_implicit_cast(return_value, res_type);
5596 /* check for returning address of a local var */
5597 if (return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
5598 const expression_t *expression = return_value->unary.value;
5599 if (is_local_variable(expression)) {
5600 warningf(statement->base.source_position,
5601 "function returns address of local variable");
5605 if(!is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
5606 warningf(statement->base.source_position,
5607 "'return' without value, in function returning non-void");
5610 statement->returns.value = return_value;
5616 * Parse a declaration statement.
5618 static statement_t *parse_declaration_statement(void)
5620 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
5622 statement->base.source_position = token.source_position;
5624 declaration_t *before = last_declaration;
5625 parse_declaration(record_declaration);
5627 if(before == NULL) {
5628 statement->declaration.declarations_begin = scope->declarations;
5630 statement->declaration.declarations_begin = before->next;
5632 statement->declaration.declarations_end = last_declaration;
5638 * Parse an expression statement, ie. expr ';'.
5640 static statement_t *parse_expression_statement(void)
5642 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
5644 statement->base.source_position = token.source_position;
5645 expression_t *const expr = parse_expression();
5646 statement->expression.expression = expr;
5648 if (warning.unused_value && !expression_has_effect(expr)) {
5649 warningf(expr->base.source_position, "statement has no effect");
5658 * Parse a statement.
5660 static statement_t *parse_statement(void)
5662 statement_t *statement = NULL;
5664 /* declaration or statement */
5665 switch(token.type) {
5667 statement = parse_asm_statement();
5671 statement = parse_case_statement();
5675 statement = parse_default_statement();
5679 statement = parse_compound_statement();
5683 statement = parse_if();
5687 statement = parse_switch();
5691 statement = parse_while();
5695 statement = parse_do();
5699 statement = parse_for();
5703 statement = parse_goto();
5707 statement = parse_continue();
5711 statement = parse_break();
5715 statement = parse_return();
5719 if (warning.empty_statement) {
5720 warningf(HERE, "statement is empty");
5727 if(look_ahead(1)->type == ':') {
5728 statement = parse_label_statement();
5732 if(is_typedef_symbol(token.v.symbol)) {
5733 statement = parse_declaration_statement();
5737 statement = parse_expression_statement();
5740 case T___extension__:
5741 /* this can be a prefix to a declaration or an expression statement */
5742 /* we simply eat it now and parse the rest with tail recursion */
5745 } while(token.type == T___extension__);
5746 statement = parse_statement();
5750 statement = parse_declaration_statement();
5754 statement = parse_expression_statement();
5758 assert(statement == NULL
5759 || statement->base.source_position.input_name != NULL);
5765 * Parse a compound statement.
5767 static statement_t *parse_compound_statement(void)
5769 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
5771 statement->base.source_position = token.source_position;
5775 int top = environment_top();
5776 scope_t *last_scope = scope;
5777 set_scope(&statement->compound.scope);
5779 statement_t *last_statement = NULL;
5781 while(token.type != '}' && token.type != T_EOF) {
5782 statement_t *sub_statement = parse_statement();
5783 if(sub_statement == NULL)
5786 if(last_statement != NULL) {
5787 last_statement->base.next = sub_statement;
5789 statement->compound.statements = sub_statement;
5792 while(sub_statement->base.next != NULL)
5793 sub_statement = sub_statement->base.next;
5795 last_statement = sub_statement;
5798 if(token.type == '}') {
5801 errorf(statement->base.source_position,
5802 "end of file while looking for closing '}'");
5805 assert(scope == &statement->compound.scope);
5806 set_scope(last_scope);
5807 environment_pop_to(top);
5813 * Initialize builtin types.
5815 static void initialize_builtin_types(void)
5817 type_intmax_t = make_global_typedef("__intmax_t__", type_long_long);
5818 type_size_t = make_global_typedef("__SIZE_TYPE__", type_unsigned_long);
5819 type_ssize_t = make_global_typedef("__SSIZE_TYPE__", type_long);
5820 type_ptrdiff_t = make_global_typedef("__PTRDIFF_TYPE__", type_long);
5821 type_uintmax_t = make_global_typedef("__uintmax_t__", type_unsigned_long_long);
5822 type_uptrdiff_t = make_global_typedef("__UPTRDIFF_TYPE__", type_unsigned_long);
5823 type_wchar_t = make_global_typedef("__WCHAR_TYPE__", type_int);
5824 type_wint_t = make_global_typedef("__WINT_TYPE__", type_int);
5826 type_intmax_t_ptr = make_pointer_type(type_intmax_t, TYPE_QUALIFIER_NONE);
5827 type_ptrdiff_t_ptr = make_pointer_type(type_ptrdiff_t, TYPE_QUALIFIER_NONE);
5828 type_ssize_t_ptr = make_pointer_type(type_ssize_t, TYPE_QUALIFIER_NONE);
5829 type_wchar_t_ptr = make_pointer_type(type_wchar_t, TYPE_QUALIFIER_NONE);
5833 * Check for unused global static functions and variables
5835 static void check_unused_globals(void)
5837 if (!warning.unused_function && !warning.unused_variable)
5840 for (const declaration_t *decl = global_scope->declarations; decl != NULL; decl = decl->next) {
5841 if (decl->used || decl->storage_class != STORAGE_CLASS_STATIC)
5844 type_t *const type = decl->type;
5846 if (is_type_function(skip_typeref(type))) {
5847 if (!warning.unused_function || decl->is_inline)
5850 s = (decl->init.statement != NULL ? "defined" : "declared");
5852 if (!warning.unused_variable)
5858 warningf(decl->source_position, "'%#T' %s but not used",
5859 type, decl->symbol, s);
5864 * Parse a translation unit.
5866 static translation_unit_t *parse_translation_unit(void)
5868 translation_unit_t *unit = allocate_ast_zero(sizeof(unit[0]));
5870 assert(global_scope == NULL);
5871 global_scope = &unit->scope;
5873 assert(scope == NULL);
5874 set_scope(&unit->scope);
5876 initialize_builtin_types();
5878 while(token.type != T_EOF) {
5879 if (token.type == ';') {
5880 /* TODO error in strict mode */
5881 warningf(HERE, "stray ';' outside of function");
5884 parse_external_declaration();
5888 assert(scope == &unit->scope);
5890 last_declaration = NULL;
5892 assert(global_scope == &unit->scope);
5893 check_unused_globals();
5894 global_scope = NULL;
5902 * @return the translation unit or NULL if errors occurred.
5904 translation_unit_t *parse(void)
5906 environment_stack = NEW_ARR_F(stack_entry_t, 0);
5907 label_stack = NEW_ARR_F(stack_entry_t, 0);
5908 diagnostic_count = 0;
5912 type_set_output(stderr);
5913 ast_set_output(stderr);
5915 lookahead_bufpos = 0;
5916 for(int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
5919 translation_unit_t *unit = parse_translation_unit();
5921 DEL_ARR_F(environment_stack);
5922 DEL_ARR_F(label_stack);
5931 * Initialize the parser.
5933 void init_parser(void)
5935 init_expression_parsers();
5936 obstack_init(&temp_obst);
5938 symbol_t *const va_list_sym = symbol_table_insert("__builtin_va_list");
5939 type_valist = create_builtin_type(va_list_sym, type_void_ptr);
5943 * Terminate the parser.
5945 void exit_parser(void)
5947 obstack_free(&temp_obst, NULL);