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;
1081 if(token.type == '{') {
1082 return parse_sub_initializer(type, NULL);
1085 if(expression == NULL) {
1086 expression = parse_assignment_expression();
1088 /* 6.7.8.14 + 15: we can have an optional {} around the string
1090 if(read_paren && (expression->kind == EXPR_STRING_LITERAL
1091 || expression->kind == EXPR_WIDE_STRING_LITERAL)) {
1092 initializer_t *result
1093 = initializer_from_expression(type, expression);
1094 if(result != NULL) {
1101 sub = parse_sub_initializer(element_type, expression);
1103 /* didn't match the subtypes -> try the parent type */
1105 assert(!read_paren);
1109 elems = NEW_ARR_F(initializer_t*, 0);
1110 ARR_APP1(initializer_t*, elems, sub);
1113 if(token.type == '}')
1116 if(token.type == '}')
1119 sub = parse_sub_initializer_elem(element_type);
1121 /* TODO error, do nicer cleanup */
1122 errorf(HERE, "member initializer didn't match");
1126 ARR_APP1(initializer_t*, elems, sub);
1129 assert(is_type_compound(type));
1130 scope_t *const scope = &type->compound.declaration->scope;
1132 if(token.type == '[') {
1134 "array designator in initializer for compound type '%T'",
1139 declaration_t *first = scope->declarations;
1142 type_t *first_type = first->type;
1143 first_type = skip_typeref(first_type);
1146 had_initializer_brace_warning = false;
1147 if(expression == NULL) {
1148 sub = parse_sub_initializer_elem(first_type);
1150 sub = parse_sub_initializer(first_type, expression);
1153 /* didn't match the subtypes -> try our parent type */
1155 assert(!read_paren);
1159 elems = NEW_ARR_F(initializer_t*, 0);
1160 ARR_APP1(initializer_t*, elems, sub);
1162 declaration_t *iter = first->next;
1163 for( ; iter != NULL; iter = iter->next) {
1164 if(iter->symbol == NULL)
1166 if(iter->namespc != NAMESPACE_NORMAL)
1169 if(token.type == '}')
1172 if(token.type == '}')
1175 type_t *iter_type = iter->type;
1176 iter_type = skip_typeref(iter_type);
1178 sub = parse_sub_initializer_elem(iter_type);
1180 /* TODO error, do nicer cleanup */
1181 errorf(HERE, "member initializer didn't match");
1185 ARR_APP1(initializer_t*, elems, sub);
1189 int len = ARR_LEN(elems);
1190 size_t elems_size = sizeof(initializer_t*) * len;
1192 initializer_list_t *init = allocate_ast_zero(sizeof(init[0]) + elems_size);
1194 init->initializer.kind = INITIALIZER_LIST;
1196 memcpy(init->initializers, elems, elems_size);
1199 result = (initializer_t*) init;
1202 if(token.type == ',')
1209 static initializer_t *parse_initializer(type_t *const orig_type)
1211 initializer_t *result;
1213 type_t *const type = skip_typeref(orig_type);
1215 if(token.type != '{') {
1216 expression_t *expression = parse_assignment_expression();
1217 initializer_t *initializer = initializer_from_expression(type, expression);
1218 if(initializer == NULL) {
1220 "initializer expression '%E' of type '%T' is incompatible with type '%T'",
1221 expression, expression->base.type, orig_type);
1226 if(is_type_scalar(type)) {
1230 expression_t *expression = parse_assignment_expression();
1231 result = initializer_from_expression(type, expression);
1233 if(token.type == ',')
1239 result = parse_sub_initializer(type, NULL);
1245 static declaration_t *append_declaration(declaration_t *declaration);
1247 static declaration_t *parse_compound_type_specifier(bool is_struct)
1255 symbol_t *symbol = NULL;
1256 declaration_t *declaration = NULL;
1258 if (token.type == T___attribute__) {
1263 if(token.type == T_IDENTIFIER) {
1264 symbol = token.v.symbol;
1268 declaration = get_declaration(symbol, NAMESPACE_STRUCT);
1270 declaration = get_declaration(symbol, NAMESPACE_UNION);
1272 } else if(token.type != '{') {
1274 parse_error_expected("while parsing struct type specifier",
1275 T_IDENTIFIER, '{', 0);
1277 parse_error_expected("while parsing union type specifier",
1278 T_IDENTIFIER, '{', 0);
1284 if(declaration == NULL) {
1285 declaration = allocate_declaration_zero();
1286 declaration->namespc =
1287 (is_struct ? NAMESPACE_STRUCT : NAMESPACE_UNION);
1288 declaration->source_position = token.source_position;
1289 declaration->symbol = symbol;
1290 declaration->parent_scope = scope;
1291 if (symbol != NULL) {
1292 environment_push(declaration);
1294 append_declaration(declaration);
1297 if(token.type == '{') {
1298 if(declaration->init.is_defined) {
1299 assert(symbol != NULL);
1300 errorf(HERE, "multiple definitions of '%s %Y'",
1301 is_struct ? "struct" : "union", symbol);
1302 declaration->scope.declarations = NULL;
1304 declaration->init.is_defined = true;
1306 parse_compound_type_entries(declaration);
1313 static void parse_enum_entries(type_t *const enum_type)
1317 if(token.type == '}') {
1319 errorf(HERE, "empty enum not allowed");
1324 if(token.type != T_IDENTIFIER) {
1325 parse_error_expected("while parsing enum entry", T_IDENTIFIER, 0);
1330 declaration_t *const entry = allocate_declaration_zero();
1331 entry->storage_class = STORAGE_CLASS_ENUM_ENTRY;
1332 entry->type = enum_type;
1333 entry->symbol = token.v.symbol;
1334 entry->source_position = token.source_position;
1337 if(token.type == '=') {
1339 entry->init.enum_value = parse_constant_expression();
1344 record_declaration(entry);
1346 if(token.type != ',')
1349 } while(token.type != '}');
1354 static type_t *parse_enum_specifier(void)
1358 declaration_t *declaration;
1361 if(token.type == T_IDENTIFIER) {
1362 symbol = token.v.symbol;
1365 declaration = get_declaration(symbol, NAMESPACE_ENUM);
1366 } else if(token.type != '{') {
1367 parse_error_expected("while parsing enum type specifier",
1368 T_IDENTIFIER, '{', 0);
1375 if(declaration == NULL) {
1376 declaration = allocate_declaration_zero();
1377 declaration->namespc = NAMESPACE_ENUM;
1378 declaration->source_position = token.source_position;
1379 declaration->symbol = symbol;
1380 declaration->parent_scope = scope;
1383 type_t *const type = allocate_type_zero(TYPE_ENUM);
1384 type->enumt.declaration = declaration;
1386 if(token.type == '{') {
1387 if(declaration->init.is_defined) {
1388 errorf(HERE, "multiple definitions of enum %Y", symbol);
1390 if (symbol != NULL) {
1391 environment_push(declaration);
1393 append_declaration(declaration);
1394 declaration->init.is_defined = 1;
1396 parse_enum_entries(type);
1404 * if a symbol is a typedef to another type, return true
1406 static bool is_typedef_symbol(symbol_t *symbol)
1408 const declaration_t *const declaration =
1409 get_declaration(symbol, NAMESPACE_NORMAL);
1411 declaration != NULL &&
1412 declaration->storage_class == STORAGE_CLASS_TYPEDEF;
1415 static type_t *parse_typeof(void)
1423 expression_t *expression = NULL;
1426 switch(token.type) {
1427 case T___extension__:
1428 /* this can be a prefix to a typename or an expression */
1429 /* we simply eat it now. */
1432 } while(token.type == T___extension__);
1436 if(is_typedef_symbol(token.v.symbol)) {
1437 type = parse_typename();
1439 expression = parse_expression();
1440 type = expression->base.type;
1445 type = parse_typename();
1449 expression = parse_expression();
1450 type = expression->base.type;
1456 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
1457 typeof_type->typeoft.expression = expression;
1458 typeof_type->typeoft.typeof_type = type;
1464 SPECIFIER_SIGNED = 1 << 0,
1465 SPECIFIER_UNSIGNED = 1 << 1,
1466 SPECIFIER_LONG = 1 << 2,
1467 SPECIFIER_INT = 1 << 3,
1468 SPECIFIER_DOUBLE = 1 << 4,
1469 SPECIFIER_CHAR = 1 << 5,
1470 SPECIFIER_SHORT = 1 << 6,
1471 SPECIFIER_LONG_LONG = 1 << 7,
1472 SPECIFIER_FLOAT = 1 << 8,
1473 SPECIFIER_BOOL = 1 << 9,
1474 SPECIFIER_VOID = 1 << 10,
1475 #ifdef PROVIDE_COMPLEX
1476 SPECIFIER_COMPLEX = 1 << 11,
1477 SPECIFIER_IMAGINARY = 1 << 12,
1481 static type_t *create_builtin_type(symbol_t *const symbol,
1482 type_t *const real_type)
1484 type_t *type = allocate_type_zero(TYPE_BUILTIN);
1485 type->builtin.symbol = symbol;
1486 type->builtin.real_type = real_type;
1488 type_t *result = typehash_insert(type);
1489 if (type != result) {
1496 static type_t *get_typedef_type(symbol_t *symbol)
1498 declaration_t *declaration = get_declaration(symbol, NAMESPACE_NORMAL);
1499 if(declaration == NULL
1500 || declaration->storage_class != STORAGE_CLASS_TYPEDEF)
1503 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
1504 type->typedeft.declaration = declaration;
1509 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
1511 type_t *type = NULL;
1512 unsigned type_qualifiers = 0;
1513 unsigned type_specifiers = 0;
1516 specifiers->source_position = token.source_position;
1519 switch(token.type) {
1522 #define MATCH_STORAGE_CLASS(token, class) \
1524 if(specifiers->storage_class != STORAGE_CLASS_NONE) { \
1525 errorf(HERE, "multiple storage classes in declaration specifiers"); \
1527 specifiers->storage_class = class; \
1531 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
1532 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
1533 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
1534 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
1535 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
1538 switch (specifiers->storage_class) {
1539 case STORAGE_CLASS_NONE:
1540 specifiers->storage_class = STORAGE_CLASS_THREAD;
1543 case STORAGE_CLASS_EXTERN:
1544 specifiers->storage_class = STORAGE_CLASS_THREAD_EXTERN;
1547 case STORAGE_CLASS_STATIC:
1548 specifiers->storage_class = STORAGE_CLASS_THREAD_STATIC;
1552 errorf(HERE, "multiple storage classes in declaration specifiers");
1558 /* type qualifiers */
1559 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
1561 type_qualifiers |= qualifier; \
1565 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
1566 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
1567 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
1569 case T___extension__:
1574 /* type specifiers */
1575 #define MATCH_SPECIFIER(token, specifier, name) \
1578 if(type_specifiers & specifier) { \
1579 errorf(HERE, "multiple " name " type specifiers given"); \
1581 type_specifiers |= specifier; \
1585 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void")
1586 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char")
1587 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short")
1588 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int")
1589 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float")
1590 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double")
1591 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed")
1592 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned")
1593 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool")
1594 #ifdef PROVIDE_COMPLEX
1595 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex")
1596 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary")
1599 /* only in microsoft mode */
1600 specifiers->decl_modifiers |= DM_FORCEINLINE;
1604 specifiers->is_inline = true;
1609 if(type_specifiers & SPECIFIER_LONG_LONG) {
1610 errorf(HERE, "multiple type specifiers given");
1611 } else if(type_specifiers & SPECIFIER_LONG) {
1612 type_specifiers |= SPECIFIER_LONG_LONG;
1614 type_specifiers |= SPECIFIER_LONG;
1618 /* TODO: if is_type_valid(type) for the following rules should issue
1621 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
1623 type->compound.declaration = parse_compound_type_specifier(true);
1627 type = allocate_type_zero(TYPE_COMPOUND_UNION);
1629 type->compound.declaration = parse_compound_type_specifier(false);
1633 type = parse_enum_specifier();
1636 type = parse_typeof();
1638 case T___builtin_va_list:
1639 type = duplicate_type(type_valist);
1643 case T___attribute__:
1648 case T_IDENTIFIER: {
1649 type_t *typedef_type = get_typedef_type(token.v.symbol);
1651 if(typedef_type == NULL)
1652 goto finish_specifiers;
1655 type = typedef_type;
1659 /* function specifier */
1661 goto finish_specifiers;
1668 atomic_type_kind_t atomic_type;
1670 /* match valid basic types */
1671 switch(type_specifiers) {
1672 case SPECIFIER_VOID:
1673 atomic_type = ATOMIC_TYPE_VOID;
1675 case SPECIFIER_CHAR:
1676 atomic_type = ATOMIC_TYPE_CHAR;
1678 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
1679 atomic_type = ATOMIC_TYPE_SCHAR;
1681 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
1682 atomic_type = ATOMIC_TYPE_UCHAR;
1684 case SPECIFIER_SHORT:
1685 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
1686 case SPECIFIER_SHORT | SPECIFIER_INT:
1687 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
1688 atomic_type = ATOMIC_TYPE_SHORT;
1690 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
1691 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
1692 atomic_type = ATOMIC_TYPE_USHORT;
1695 case SPECIFIER_SIGNED:
1696 case SPECIFIER_SIGNED | SPECIFIER_INT:
1697 atomic_type = ATOMIC_TYPE_INT;
1699 case SPECIFIER_UNSIGNED:
1700 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
1701 atomic_type = ATOMIC_TYPE_UINT;
1703 case SPECIFIER_LONG:
1704 case SPECIFIER_SIGNED | SPECIFIER_LONG:
1705 case SPECIFIER_LONG | SPECIFIER_INT:
1706 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
1707 atomic_type = ATOMIC_TYPE_LONG;
1709 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
1710 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
1711 atomic_type = ATOMIC_TYPE_ULONG;
1713 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
1714 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
1715 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
1716 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
1718 atomic_type = ATOMIC_TYPE_LONGLONG;
1720 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
1721 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
1723 atomic_type = ATOMIC_TYPE_ULONGLONG;
1725 case SPECIFIER_FLOAT:
1726 atomic_type = ATOMIC_TYPE_FLOAT;
1728 case SPECIFIER_DOUBLE:
1729 atomic_type = ATOMIC_TYPE_DOUBLE;
1731 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
1732 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
1734 case SPECIFIER_BOOL:
1735 atomic_type = ATOMIC_TYPE_BOOL;
1737 #ifdef PROVIDE_COMPLEX
1738 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
1739 atomic_type = ATOMIC_TYPE_FLOAT_COMPLEX;
1741 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
1742 atomic_type = ATOMIC_TYPE_DOUBLE_COMPLEX;
1744 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
1745 atomic_type = ATOMIC_TYPE_LONG_DOUBLE_COMPLEX;
1747 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
1748 atomic_type = ATOMIC_TYPE_FLOAT_IMAGINARY;
1750 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
1751 atomic_type = ATOMIC_TYPE_DOUBLE_IMAGINARY;
1753 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
1754 atomic_type = ATOMIC_TYPE_LONG_DOUBLE_IMAGINARY;
1758 /* invalid specifier combination, give an error message */
1759 if(type_specifiers == 0) {
1760 if (! strict_mode) {
1761 if (warning.implicit_int) {
1762 warningf(HERE, "no type specifiers in declaration, using 'int'");
1764 atomic_type = ATOMIC_TYPE_INT;
1767 errorf(HERE, "no type specifiers given in declaration");
1769 } else if((type_specifiers & SPECIFIER_SIGNED) &&
1770 (type_specifiers & SPECIFIER_UNSIGNED)) {
1771 errorf(HERE, "signed and unsigned specifiers gives");
1772 } else if(type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
1773 errorf(HERE, "only integer types can be signed or unsigned");
1775 errorf(HERE, "multiple datatypes in declaration");
1777 atomic_type = ATOMIC_TYPE_INVALID;
1780 type = allocate_type_zero(TYPE_ATOMIC);
1781 type->atomic.akind = atomic_type;
1784 if(type_specifiers != 0) {
1785 errorf(HERE, "multiple datatypes in declaration");
1789 type->base.qualifiers = type_qualifiers;
1791 type_t *result = typehash_insert(type);
1792 if(newtype && result != type) {
1796 specifiers->type = result;
1799 static type_qualifiers_t parse_type_qualifiers(void)
1801 type_qualifiers_t type_qualifiers = TYPE_QUALIFIER_NONE;
1804 switch(token.type) {
1805 /* type qualifiers */
1806 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
1807 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
1808 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
1811 return type_qualifiers;
1816 static declaration_t *parse_identifier_list(void)
1818 declaration_t *declarations = NULL;
1819 declaration_t *last_declaration = NULL;
1821 declaration_t *const declaration = allocate_declaration_zero();
1822 declaration->type = NULL; /* a K&R parameter list has no types, yet */
1823 declaration->source_position = token.source_position;
1824 declaration->symbol = token.v.symbol;
1827 if(last_declaration != NULL) {
1828 last_declaration->next = declaration;
1830 declarations = declaration;
1832 last_declaration = declaration;
1834 if(token.type != ',')
1837 } while(token.type == T_IDENTIFIER);
1839 return declarations;
1842 static void semantic_parameter(declaration_t *declaration)
1844 /* TODO: improve error messages */
1846 if(declaration->storage_class == STORAGE_CLASS_TYPEDEF) {
1847 errorf(HERE, "typedef not allowed in parameter list");
1848 } else if(declaration->storage_class != STORAGE_CLASS_NONE
1849 && declaration->storage_class != STORAGE_CLASS_REGISTER) {
1850 errorf(HERE, "parameter may only have none or register storage class");
1853 type_t *const orig_type = declaration->type;
1854 type_t * type = skip_typeref(orig_type);
1856 /* Array as last part of a parameter type is just syntactic sugar. Turn it
1857 * into a pointer. § 6.7.5.3 (7) */
1858 if (is_type_array(type)) {
1859 type_t *const element_type = type->array.element_type;
1861 type = make_pointer_type(element_type, type->base.qualifiers);
1863 declaration->type = type;
1866 if(is_type_incomplete(type)) {
1867 errorf(HERE, "incomplete type ('%T') not allowed for parameter '%Y'",
1868 orig_type, declaration->symbol);
1872 static declaration_t *parse_parameter(void)
1874 declaration_specifiers_t specifiers;
1875 memset(&specifiers, 0, sizeof(specifiers));
1877 parse_declaration_specifiers(&specifiers);
1879 declaration_t *declaration = parse_declarator(&specifiers, /*may_be_abstract=*/true);
1881 semantic_parameter(declaration);
1886 static declaration_t *parse_parameters(function_type_t *type)
1888 if(token.type == T_IDENTIFIER) {
1889 symbol_t *symbol = token.v.symbol;
1890 if(!is_typedef_symbol(symbol)) {
1891 type->kr_style_parameters = true;
1892 return parse_identifier_list();
1896 if(token.type == ')') {
1897 type->unspecified_parameters = 1;
1900 if(token.type == T_void && look_ahead(1)->type == ')') {
1905 declaration_t *declarations = NULL;
1906 declaration_t *declaration;
1907 declaration_t *last_declaration = NULL;
1908 function_parameter_t *parameter;
1909 function_parameter_t *last_parameter = NULL;
1912 switch(token.type) {
1916 return declarations;
1919 case T___extension__:
1921 declaration = parse_parameter();
1923 parameter = obstack_alloc(type_obst, sizeof(parameter[0]));
1924 memset(parameter, 0, sizeof(parameter[0]));
1925 parameter->type = declaration->type;
1927 if(last_parameter != NULL) {
1928 last_declaration->next = declaration;
1929 last_parameter->next = parameter;
1931 type->parameters = parameter;
1932 declarations = declaration;
1934 last_parameter = parameter;
1935 last_declaration = declaration;
1939 return declarations;
1941 if(token.type != ',')
1942 return declarations;
1952 } construct_type_type_t;
1954 typedef struct construct_type_t construct_type_t;
1955 struct construct_type_t {
1956 construct_type_type_t type;
1957 construct_type_t *next;
1960 typedef struct parsed_pointer_t parsed_pointer_t;
1961 struct parsed_pointer_t {
1962 construct_type_t construct_type;
1963 type_qualifiers_t type_qualifiers;
1966 typedef struct construct_function_type_t construct_function_type_t;
1967 struct construct_function_type_t {
1968 construct_type_t construct_type;
1969 type_t *function_type;
1972 typedef struct parsed_array_t parsed_array_t;
1973 struct parsed_array_t {
1974 construct_type_t construct_type;
1975 type_qualifiers_t type_qualifiers;
1981 typedef struct construct_base_type_t construct_base_type_t;
1982 struct construct_base_type_t {
1983 construct_type_t construct_type;
1987 static construct_type_t *parse_pointer_declarator(void)
1991 parsed_pointer_t *pointer = obstack_alloc(&temp_obst, sizeof(pointer[0]));
1992 memset(pointer, 0, sizeof(pointer[0]));
1993 pointer->construct_type.type = CONSTRUCT_POINTER;
1994 pointer->type_qualifiers = parse_type_qualifiers();
1996 return (construct_type_t*) pointer;
1999 static construct_type_t *parse_array_declarator(void)
2003 parsed_array_t *array = obstack_alloc(&temp_obst, sizeof(array[0]));
2004 memset(array, 0, sizeof(array[0]));
2005 array->construct_type.type = CONSTRUCT_ARRAY;
2007 if(token.type == T_static) {
2008 array->is_static = true;
2012 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
2013 if(type_qualifiers != 0) {
2014 if(token.type == T_static) {
2015 array->is_static = true;
2019 array->type_qualifiers = type_qualifiers;
2021 if(token.type == '*' && look_ahead(1)->type == ']') {
2022 array->is_variable = true;
2024 } else if(token.type != ']') {
2025 array->size = parse_assignment_expression();
2030 return (construct_type_t*) array;
2033 static construct_type_t *parse_function_declarator(declaration_t *declaration)
2037 type_t *type = allocate_type_zero(TYPE_FUNCTION);
2039 declaration_t *parameters = parse_parameters(&type->function);
2040 if(declaration != NULL) {
2041 declaration->scope.declarations = parameters;
2044 construct_function_type_t *construct_function_type =
2045 obstack_alloc(&temp_obst, sizeof(construct_function_type[0]));
2046 memset(construct_function_type, 0, sizeof(construct_function_type[0]));
2047 construct_function_type->construct_type.type = CONSTRUCT_FUNCTION;
2048 construct_function_type->function_type = type;
2052 return (construct_type_t*) construct_function_type;
2055 static construct_type_t *parse_inner_declarator(declaration_t *declaration,
2056 bool may_be_abstract)
2058 /* construct a single linked list of construct_type_t's which describe
2059 * how to construct the final declarator type */
2060 construct_type_t *first = NULL;
2061 construct_type_t *last = NULL;
2064 while(token.type == '*') {
2065 construct_type_t *type = parse_pointer_declarator();
2076 /* TODO: find out if this is correct */
2079 construct_type_t *inner_types = NULL;
2081 switch(token.type) {
2083 if(declaration == NULL) {
2084 errorf(HERE, "no identifier expected in typename");
2086 declaration->symbol = token.v.symbol;
2087 declaration->source_position = token.source_position;
2093 inner_types = parse_inner_declarator(declaration, may_be_abstract);
2099 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', 0);
2100 /* avoid a loop in the outermost scope, because eat_statement doesn't
2102 if(token.type == '}' && current_function == NULL) {
2110 construct_type_t *p = last;
2113 construct_type_t *type;
2114 switch(token.type) {
2116 type = parse_function_declarator(declaration);
2119 type = parse_array_declarator();
2122 goto declarator_finished;
2125 /* insert in the middle of the list (behind p) */
2127 type->next = p->next;
2138 declarator_finished:
2141 /* append inner_types at the end of the list, we don't to set last anymore
2142 * as it's not needed anymore */
2144 assert(first == NULL);
2145 first = inner_types;
2147 last->next = inner_types;
2153 static type_t *construct_declarator_type(construct_type_t *construct_list,
2156 construct_type_t *iter = construct_list;
2157 for( ; iter != NULL; iter = iter->next) {
2158 switch(iter->type) {
2159 case CONSTRUCT_INVALID:
2160 panic("invalid type construction found");
2161 case CONSTRUCT_FUNCTION: {
2162 construct_function_type_t *construct_function_type
2163 = (construct_function_type_t*) iter;
2165 type_t *function_type = construct_function_type->function_type;
2167 function_type->function.return_type = type;
2169 type_t *skipped_return_type = skip_typeref(type);
2170 if (is_type_function(skipped_return_type)) {
2171 errorf(HERE, "function returning function is not allowed");
2172 type = type_error_type;
2173 } else if (is_type_array(skipped_return_type)) {
2174 errorf(HERE, "function returning array is not allowed");
2175 type = type_error_type;
2177 type = function_type;
2182 case CONSTRUCT_POINTER: {
2183 parsed_pointer_t *parsed_pointer = (parsed_pointer_t*) iter;
2184 type_t *pointer_type = allocate_type_zero(TYPE_POINTER);
2185 pointer_type->pointer.points_to = type;
2186 pointer_type->base.qualifiers = parsed_pointer->type_qualifiers;
2188 type = pointer_type;
2192 case CONSTRUCT_ARRAY: {
2193 parsed_array_t *parsed_array = (parsed_array_t*) iter;
2194 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
2196 array_type->base.qualifiers = parsed_array->type_qualifiers;
2197 array_type->array.element_type = type;
2198 array_type->array.is_static = parsed_array->is_static;
2199 array_type->array.is_variable = parsed_array->is_variable;
2200 array_type->array.size = parsed_array->size;
2202 type_t *skipped_type = skip_typeref(type);
2203 if (is_type_atomic(skipped_type, ATOMIC_TYPE_VOID)) {
2204 errorf(HERE, "array of void is not allowed");
2205 type = type_error_type;
2213 type_t *hashed_type = typehash_insert(type);
2214 if(hashed_type != type) {
2215 /* the function type was constructed earlier freeing it here will
2216 * destroy other types... */
2217 if(iter->type != CONSTRUCT_FUNCTION) {
2227 static declaration_t *parse_declarator(
2228 const declaration_specifiers_t *specifiers, bool may_be_abstract)
2230 declaration_t *const declaration = allocate_declaration_zero();
2231 declaration->storage_class = specifiers->storage_class;
2232 declaration->modifiers = specifiers->decl_modifiers;
2233 declaration->is_inline = specifiers->is_inline;
2235 construct_type_t *construct_type
2236 = parse_inner_declarator(declaration, may_be_abstract);
2237 type_t *const type = specifiers->type;
2238 declaration->type = construct_declarator_type(construct_type, type);
2240 if(construct_type != NULL) {
2241 obstack_free(&temp_obst, construct_type);
2247 static type_t *parse_abstract_declarator(type_t *base_type)
2249 construct_type_t *construct_type = parse_inner_declarator(NULL, 1);
2251 type_t *result = construct_declarator_type(construct_type, base_type);
2252 if(construct_type != NULL) {
2253 obstack_free(&temp_obst, construct_type);
2259 static declaration_t *append_declaration(declaration_t* const declaration)
2261 if (last_declaration != NULL) {
2262 last_declaration->next = declaration;
2264 scope->declarations = declaration;
2266 last_declaration = declaration;
2271 * Check if the declaration of main is suspicious. main should be a
2272 * function with external linkage, returning int, taking either zero
2273 * arguments, two, or three arguments of appropriate types, ie.
2275 * int main([ int argc, char **argv [, char **env ] ]).
2277 * @param decl the declaration to check
2278 * @param type the function type of the declaration
2280 static void check_type_of_main(const declaration_t *const decl, const function_type_t *const func_type)
2282 if (decl->storage_class == STORAGE_CLASS_STATIC) {
2283 warningf(decl->source_position, "'main' is normally a non-static function");
2285 if (skip_typeref(func_type->return_type) != type_int) {
2286 warningf(decl->source_position, "return type of 'main' should be 'int', but is '%T'", func_type->return_type);
2288 const function_parameter_t *parm = func_type->parameters;
2290 type_t *const first_type = parm->type;
2291 if (!types_compatible(skip_typeref(first_type), type_int)) {
2292 warningf(decl->source_position, "first argument of 'main' should be 'int', but is '%T'", first_type);
2296 type_t *const second_type = parm->type;
2297 if (!types_compatible(skip_typeref(second_type), type_char_ptr_ptr)) {
2298 warningf(decl->source_position, "second argument of 'main' should be 'char**', but is '%T'", second_type);
2302 type_t *const third_type = parm->type;
2303 if (!types_compatible(skip_typeref(third_type), type_char_ptr_ptr)) {
2304 warningf(decl->source_position, "third argument of 'main' should be 'char**', but is '%T'", third_type);
2308 warningf(decl->source_position, "'main' takes only zero, two or three arguments");
2312 warningf(decl->source_position, "'main' takes only zero, two or three arguments");
2318 * Check if a symbol is the equal to "main".
2320 static bool is_sym_main(const symbol_t *const sym)
2322 return strcmp(sym->string, "main") == 0;
2325 static declaration_t *internal_record_declaration(
2326 declaration_t *const declaration,
2327 const bool is_function_definition)
2329 const symbol_t *const symbol = declaration->symbol;
2330 const namespace_t namespc = (namespace_t)declaration->namespc;
2332 type_t *const orig_type = declaration->type;
2333 type_t *const type = skip_typeref(orig_type);
2334 if (is_type_function(type) &&
2335 type->function.unspecified_parameters &&
2336 warning.strict_prototypes) {
2337 warningf(declaration->source_position,
2338 "function declaration '%#T' is not a prototype",
2339 orig_type, declaration->symbol);
2342 if (is_function_definition && warning.main && is_sym_main(symbol)) {
2343 check_type_of_main(declaration, &type->function);
2346 assert(declaration->symbol != NULL);
2347 declaration_t *previous_declaration = get_declaration(symbol, namespc);
2349 assert(declaration != previous_declaration);
2350 if (previous_declaration != NULL) {
2351 if (previous_declaration->parent_scope == scope) {
2352 /* can happen for K&R style declarations */
2353 if(previous_declaration->type == NULL) {
2354 previous_declaration->type = declaration->type;
2357 const type_t *prev_type = skip_typeref(previous_declaration->type);
2358 if (!types_compatible(type, prev_type)) {
2359 errorf(declaration->source_position,
2360 "declaration '%#T' is incompatible with "
2361 "previous declaration '%#T'",
2362 orig_type, symbol, previous_declaration->type, symbol);
2363 errorf(previous_declaration->source_position,
2364 "previous declaration of '%Y' was here", symbol);
2366 unsigned old_storage_class
2367 = previous_declaration->storage_class;
2368 unsigned new_storage_class = declaration->storage_class;
2370 if(is_type_incomplete(prev_type)) {
2371 previous_declaration->type = type;
2375 /* pretend no storage class means extern for function
2376 * declarations (except if the previous declaration is neither
2377 * none nor extern) */
2378 if (is_type_function(type)) {
2379 switch (old_storage_class) {
2380 case STORAGE_CLASS_NONE:
2381 old_storage_class = STORAGE_CLASS_EXTERN;
2383 case STORAGE_CLASS_EXTERN:
2384 if (is_function_definition) {
2385 if (warning.missing_prototypes &&
2386 prev_type->function.unspecified_parameters &&
2387 !is_sym_main(symbol)) {
2388 warningf(declaration->source_position,
2389 "no previous prototype for '%#T'",
2392 } else if (new_storage_class == STORAGE_CLASS_NONE) {
2393 new_storage_class = STORAGE_CLASS_EXTERN;
2401 if (old_storage_class == STORAGE_CLASS_EXTERN &&
2402 new_storage_class == STORAGE_CLASS_EXTERN) {
2403 warn_redundant_declaration:
2404 if (warning.redundant_decls) {
2405 warningf(declaration->source_position,
2406 "redundant declaration for '%Y'", symbol);
2407 warningf(previous_declaration->source_position,
2408 "previous declaration of '%Y' was here",
2411 } else if (current_function == NULL) {
2412 if (old_storage_class != STORAGE_CLASS_STATIC &&
2413 new_storage_class == STORAGE_CLASS_STATIC) {
2414 errorf(declaration->source_position,
2415 "static declaration of '%Y' follows non-static declaration",
2417 errorf(previous_declaration->source_position,
2418 "previous declaration of '%Y' was here", symbol);
2420 if (old_storage_class != STORAGE_CLASS_EXTERN && !is_function_definition) {
2421 goto warn_redundant_declaration;
2423 if (new_storage_class == STORAGE_CLASS_NONE) {
2424 previous_declaration->storage_class = STORAGE_CLASS_NONE;
2428 if (old_storage_class == new_storage_class) {
2429 errorf(declaration->source_position,
2430 "redeclaration of '%Y'", symbol);
2432 errorf(declaration->source_position,
2433 "redeclaration of '%Y' with different linkage",
2436 errorf(previous_declaration->source_position,
2437 "previous declaration of '%Y' was here", symbol);
2440 return previous_declaration;
2442 } else if (is_function_definition) {
2443 if (declaration->storage_class != STORAGE_CLASS_STATIC) {
2444 if (warning.missing_prototypes && !is_sym_main(symbol)) {
2445 warningf(declaration->source_position,
2446 "no previous prototype for '%#T'", orig_type, symbol);
2447 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
2448 warningf(declaration->source_position,
2449 "no previous declaration for '%#T'", orig_type,
2453 } else if (warning.missing_declarations &&
2454 scope == global_scope &&
2455 !is_type_function(type) && (
2456 declaration->storage_class == STORAGE_CLASS_NONE ||
2457 declaration->storage_class == STORAGE_CLASS_THREAD
2459 warningf(declaration->source_position,
2460 "no previous declaration for '%#T'", orig_type, symbol);
2463 assert(declaration->parent_scope == NULL);
2464 assert(scope != NULL);
2466 declaration->parent_scope = scope;
2468 environment_push(declaration);
2469 return append_declaration(declaration);
2472 static declaration_t *record_declaration(declaration_t *declaration)
2474 return internal_record_declaration(declaration, false);
2477 static declaration_t *record_function_definition(declaration_t *declaration)
2479 return internal_record_declaration(declaration, true);
2482 static void parser_error_multiple_definition(declaration_t *declaration,
2483 const source_position_t source_position)
2485 errorf(source_position, "multiple definition of symbol '%Y'",
2486 declaration->symbol);
2487 errorf(declaration->source_position,
2488 "this is the location of the previous definition.");
2491 static bool is_declaration_specifier(const token_t *token,
2492 bool only_type_specifiers)
2494 switch(token->type) {
2498 return is_typedef_symbol(token->v.symbol);
2500 case T___extension__:
2503 return !only_type_specifiers;
2510 static void parse_init_declarator_rest(declaration_t *declaration)
2514 type_t *orig_type = declaration->type;
2515 type_t *type = type = skip_typeref(orig_type);
2517 if(declaration->init.initializer != NULL) {
2518 parser_error_multiple_definition(declaration, token.source_position);
2521 initializer_t *initializer = parse_initializer(type);
2523 /* § 6.7.5 (22) array initializers for arrays with unknown size determine
2524 * the array type size */
2525 if(is_type_array(type) && initializer != NULL) {
2526 array_type_t *array_type = &type->array;
2528 if(array_type->size == NULL) {
2529 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
2531 cnst->base.type = type_size_t;
2533 switch (initializer->kind) {
2534 case INITIALIZER_LIST: {
2535 cnst->conste.v.int_value = initializer->list.len;
2539 case INITIALIZER_STRING: {
2540 cnst->conste.v.int_value = initializer->string.string.size;
2544 case INITIALIZER_WIDE_STRING: {
2545 cnst->conste.v.int_value = initializer->wide_string.string.size;
2550 panic("invalid initializer type");
2553 array_type->size = cnst;
2554 array_type->has_implicit_size = true;
2558 if(is_type_function(type)) {
2559 errorf(declaration->source_position,
2560 "initializers not allowed for function types at declator '%Y' (type '%T')",
2561 declaration->symbol, orig_type);
2563 declaration->init.initializer = initializer;
2567 /* parse rest of a declaration without any declarator */
2568 static void parse_anonymous_declaration_rest(
2569 const declaration_specifiers_t *specifiers,
2570 parsed_declaration_func finished_declaration)
2574 declaration_t *const declaration = allocate_declaration_zero();
2575 declaration->type = specifiers->type;
2576 declaration->storage_class = specifiers->storage_class;
2577 declaration->source_position = specifiers->source_position;
2579 if (declaration->storage_class != STORAGE_CLASS_NONE) {
2580 warningf(declaration->source_position, "useless storage class in empty declaration");
2583 type_t *type = declaration->type;
2584 switch (type->kind) {
2585 case TYPE_COMPOUND_STRUCT:
2586 case TYPE_COMPOUND_UNION: {
2587 if (type->compound.declaration->symbol == NULL) {
2588 warningf(declaration->source_position, "unnamed struct/union that defines no instances");
2597 warningf(declaration->source_position, "empty declaration");
2601 finished_declaration(declaration);
2604 static void parse_declaration_rest(declaration_t *ndeclaration,
2605 const declaration_specifiers_t *specifiers,
2606 parsed_declaration_func finished_declaration)
2609 declaration_t *declaration = finished_declaration(ndeclaration);
2611 type_t *orig_type = declaration->type;
2612 type_t *type = skip_typeref(orig_type);
2614 if (type->kind != TYPE_FUNCTION &&
2615 declaration->is_inline &&
2616 is_type_valid(type)) {
2617 warningf(declaration->source_position,
2618 "variable '%Y' declared 'inline'\n", declaration->symbol);
2621 if(token.type == '=') {
2622 parse_init_declarator_rest(declaration);
2625 if(token.type != ',')
2629 ndeclaration = parse_declarator(specifiers, /*may_be_abstract=*/false);
2634 static declaration_t *finished_kr_declaration(declaration_t *declaration)
2636 symbol_t *symbol = declaration->symbol;
2637 if(symbol == NULL) {
2638 errorf(HERE, "anonymous declaration not valid as function parameter");
2641 namespace_t namespc = (namespace_t) declaration->namespc;
2642 if(namespc != NAMESPACE_NORMAL) {
2643 return record_declaration(declaration);
2646 declaration_t *previous_declaration = get_declaration(symbol, namespc);
2647 if(previous_declaration == NULL ||
2648 previous_declaration->parent_scope != scope) {
2649 errorf(HERE, "expected declaration of a function parameter, found '%Y'",
2654 if(previous_declaration->type == NULL) {
2655 previous_declaration->type = declaration->type;
2656 previous_declaration->storage_class = declaration->storage_class;
2657 previous_declaration->parent_scope = scope;
2658 return previous_declaration;
2660 return record_declaration(declaration);
2664 static void parse_declaration(parsed_declaration_func finished_declaration)
2666 declaration_specifiers_t specifiers;
2667 memset(&specifiers, 0, sizeof(specifiers));
2668 parse_declaration_specifiers(&specifiers);
2670 if(token.type == ';') {
2671 parse_anonymous_declaration_rest(&specifiers, append_declaration);
2673 declaration_t *declaration = parse_declarator(&specifiers, /*may_be_abstract=*/false);
2674 parse_declaration_rest(declaration, &specifiers, finished_declaration);
2678 static void parse_kr_declaration_list(declaration_t *declaration)
2680 type_t *type = skip_typeref(declaration->type);
2681 if(!is_type_function(type))
2684 if(!type->function.kr_style_parameters)
2687 /* push function parameters */
2688 int top = environment_top();
2689 scope_t *last_scope = scope;
2690 set_scope(&declaration->scope);
2692 declaration_t *parameter = declaration->scope.declarations;
2693 for( ; parameter != NULL; parameter = parameter->next) {
2694 assert(parameter->parent_scope == NULL);
2695 parameter->parent_scope = scope;
2696 environment_push(parameter);
2699 /* parse declaration list */
2700 while(is_declaration_specifier(&token, false)) {
2701 parse_declaration(finished_kr_declaration);
2704 /* pop function parameters */
2705 assert(scope == &declaration->scope);
2706 set_scope(last_scope);
2707 environment_pop_to(top);
2709 /* update function type */
2710 type_t *new_type = duplicate_type(type);
2711 new_type->function.kr_style_parameters = false;
2713 function_parameter_t *parameters = NULL;
2714 function_parameter_t *last_parameter = NULL;
2716 declaration_t *parameter_declaration = declaration->scope.declarations;
2717 for( ; parameter_declaration != NULL;
2718 parameter_declaration = parameter_declaration->next) {
2719 type_t *parameter_type = parameter_declaration->type;
2720 if(parameter_type == NULL) {
2722 errorf(HERE, "no type specified for function parameter '%Y'",
2723 parameter_declaration->symbol);
2725 if (warning.implicit_int) {
2726 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
2727 parameter_declaration->symbol);
2729 parameter_type = type_int;
2730 parameter_declaration->type = parameter_type;
2734 semantic_parameter(parameter_declaration);
2735 parameter_type = parameter_declaration->type;
2737 function_parameter_t *function_parameter
2738 = obstack_alloc(type_obst, sizeof(function_parameter[0]));
2739 memset(function_parameter, 0, sizeof(function_parameter[0]));
2741 function_parameter->type = parameter_type;
2742 if(last_parameter != NULL) {
2743 last_parameter->next = function_parameter;
2745 parameters = function_parameter;
2747 last_parameter = function_parameter;
2749 new_type->function.parameters = parameters;
2751 type = typehash_insert(new_type);
2752 if(type != new_type) {
2753 obstack_free(type_obst, new_type);
2756 declaration->type = type;
2759 static bool first_err = true;
2762 * When called with first_err set, prints the name of the current function,
2765 static void print_in_function(void) {
2768 diagnosticf("%s: In function '%Y':\n",
2769 current_function->source_position.input_name,
2770 current_function->symbol);
2775 * Check if all labels are defined in the current function.
2776 * Check if all labels are used in the current function.
2778 static void check_labels(void)
2780 for (const goto_statement_t *goto_statement = goto_first;
2781 goto_statement != NULL;
2782 goto_statement = goto_statement->next) {
2783 declaration_t *label = goto_statement->label;
2786 if (label->source_position.input_name == NULL) {
2787 print_in_function();
2788 errorf(goto_statement->base.source_position,
2789 "label '%Y' used but not defined", label->symbol);
2792 goto_first = goto_last = NULL;
2794 if (warning.unused_label) {
2795 for (const label_statement_t *label_statement = label_first;
2796 label_statement != NULL;
2797 label_statement = label_statement->next) {
2798 const declaration_t *label = label_statement->label;
2800 if (! label->used) {
2801 print_in_function();
2802 warningf(label_statement->base.source_position,
2803 "label '%Y' defined but not used", label->symbol);
2807 label_first = label_last = NULL;
2811 * Check declarations of current_function for unused entities.
2813 static void check_declarations(void)
2815 if (warning.unused_parameter) {
2816 const scope_t *scope = ¤t_function->scope;
2818 const declaration_t *parameter = scope->declarations;
2819 for (; parameter != NULL; parameter = parameter->next) {
2820 if (! parameter->used) {
2821 print_in_function();
2822 warningf(parameter->source_position,
2823 "unused parameter '%Y'", parameter->symbol);
2827 if (warning.unused_variable) {
2831 static void parse_external_declaration(void)
2833 /* function-definitions and declarations both start with declaration
2835 declaration_specifiers_t specifiers;
2836 memset(&specifiers, 0, sizeof(specifiers));
2837 parse_declaration_specifiers(&specifiers);
2839 /* must be a declaration */
2840 if(token.type == ';') {
2841 parse_anonymous_declaration_rest(&specifiers, append_declaration);
2845 /* declarator is common to both function-definitions and declarations */
2846 declaration_t *ndeclaration = parse_declarator(&specifiers, /*may_be_abstract=*/false);
2848 /* must be a declaration */
2849 if(token.type == ',' || token.type == '=' || token.type == ';') {
2850 parse_declaration_rest(ndeclaration, &specifiers, record_declaration);
2854 /* must be a function definition */
2855 parse_kr_declaration_list(ndeclaration);
2857 if(token.type != '{') {
2858 parse_error_expected("while parsing function definition", '{', 0);
2863 type_t *type = ndeclaration->type;
2865 /* note that we don't skip typerefs: the standard doesn't allow them here
2866 * (so we can't use is_type_function here) */
2867 if(type->kind != TYPE_FUNCTION) {
2868 if (is_type_valid(type)) {
2869 errorf(HERE, "declarator '%#T' has a body but is not a function type",
2870 type, ndeclaration->symbol);
2876 /* § 6.7.5.3 (14) a function definition with () means no
2877 * parameters (and not unspecified parameters) */
2878 if(type->function.unspecified_parameters) {
2879 type_t *duplicate = duplicate_type(type);
2880 duplicate->function.unspecified_parameters = false;
2882 type = typehash_insert(duplicate);
2883 if(type != duplicate) {
2884 obstack_free(type_obst, duplicate);
2886 ndeclaration->type = type;
2889 declaration_t *const declaration = record_function_definition(ndeclaration);
2890 if(ndeclaration != declaration) {
2891 declaration->scope = ndeclaration->scope;
2893 type = skip_typeref(declaration->type);
2895 /* push function parameters and switch scope */
2896 int top = environment_top();
2897 scope_t *last_scope = scope;
2898 set_scope(&declaration->scope);
2900 declaration_t *parameter = declaration->scope.declarations;
2901 for( ; parameter != NULL; parameter = parameter->next) {
2902 if(parameter->parent_scope == &ndeclaration->scope) {
2903 parameter->parent_scope = scope;
2905 assert(parameter->parent_scope == NULL
2906 || parameter->parent_scope == scope);
2907 parameter->parent_scope = scope;
2908 environment_push(parameter);
2911 if(declaration->init.statement != NULL) {
2912 parser_error_multiple_definition(declaration, token.source_position);
2914 goto end_of_parse_external_declaration;
2916 /* parse function body */
2917 int label_stack_top = label_top();
2918 declaration_t *old_current_function = current_function;
2919 current_function = declaration;
2921 declaration->init.statement = parse_compound_statement();
2924 check_declarations();
2926 assert(current_function == declaration);
2927 current_function = old_current_function;
2928 label_pop_to(label_stack_top);
2931 end_of_parse_external_declaration:
2932 assert(scope == &declaration->scope);
2933 set_scope(last_scope);
2934 environment_pop_to(top);
2937 static type_t *make_bitfield_type(type_t *base, expression_t *size)
2939 type_t *type = allocate_type_zero(TYPE_BITFIELD);
2940 type->bitfield.base = base;
2941 type->bitfield.size = size;
2946 static void parse_compound_declarators(declaration_t *struct_declaration,
2947 const declaration_specifiers_t *specifiers)
2949 declaration_t *last_declaration = struct_declaration->scope.declarations;
2950 if(last_declaration != NULL) {
2951 while(last_declaration->next != NULL) {
2952 last_declaration = last_declaration->next;
2957 declaration_t *declaration;
2959 if(token.type == ':') {
2962 type_t *base_type = specifiers->type;
2963 expression_t *size = parse_constant_expression();
2965 if(!is_type_integer(skip_typeref(base_type))) {
2966 errorf(HERE, "bitfield base type '%T' is not an integer type",
2970 type_t *type = make_bitfield_type(base_type, size);
2972 declaration = allocate_declaration_zero();
2973 declaration->namespc = NAMESPACE_NORMAL;
2974 declaration->storage_class = STORAGE_CLASS_NONE;
2975 declaration->source_position = token.source_position;
2976 declaration->modifiers = specifiers->decl_modifiers;
2977 declaration->type = type;
2979 declaration = parse_declarator(specifiers,/*may_be_abstract=*/true);
2981 type_t *orig_type = declaration->type;
2982 type_t *type = skip_typeref(orig_type);
2984 if(token.type == ':') {
2986 expression_t *size = parse_constant_expression();
2988 if(!is_type_integer(type)) {
2989 errorf(HERE, "bitfield base type '%T' is not an "
2990 "integer type", orig_type);
2993 type_t *bitfield_type = make_bitfield_type(orig_type, size);
2994 declaration->type = bitfield_type;
2996 /* TODO we ignore arrays for now... what is missing is a check
2997 * that they're at the end of the struct */
2998 if(is_type_incomplete(type) && !is_type_array(type)) {
3000 "compound member '%Y' has incomplete type '%T'",
3001 declaration->symbol, orig_type);
3002 } else if(is_type_function(type)) {
3003 errorf(HERE, "compound member '%Y' must not have function "
3004 "type '%T'", declaration->symbol, orig_type);
3009 /* make sure we don't define a symbol multiple times */
3010 symbol_t *symbol = declaration->symbol;
3011 if(symbol != NULL) {
3012 declaration_t *iter = struct_declaration->scope.declarations;
3013 for( ; iter != NULL; iter = iter->next) {
3014 if(iter->symbol == symbol) {
3015 errorf(declaration->source_position,
3016 "multiple declarations of symbol '%Y'", symbol);
3017 errorf(iter->source_position,
3018 "previous declaration of '%Y' was here", symbol);
3024 /* append declaration */
3025 if(last_declaration != NULL) {
3026 last_declaration->next = declaration;
3028 struct_declaration->scope.declarations = declaration;
3030 last_declaration = declaration;
3032 if(token.type != ',')
3039 static void parse_compound_type_entries(declaration_t *compound_declaration)
3043 while(token.type != '}' && token.type != T_EOF) {
3044 declaration_specifiers_t specifiers;
3045 memset(&specifiers, 0, sizeof(specifiers));
3046 parse_declaration_specifiers(&specifiers);
3048 parse_compound_declarators(compound_declaration, &specifiers);
3050 if(token.type == T_EOF) {
3051 errorf(HERE, "EOF while parsing struct");
3056 static type_t *parse_typename(void)
3058 declaration_specifiers_t specifiers;
3059 memset(&specifiers, 0, sizeof(specifiers));
3060 parse_declaration_specifiers(&specifiers);
3061 if(specifiers.storage_class != STORAGE_CLASS_NONE) {
3062 /* TODO: improve error message, user does probably not know what a
3063 * storage class is...
3065 errorf(HERE, "typename may not have a storage class");
3068 type_t *result = parse_abstract_declarator(specifiers.type);
3076 typedef expression_t* (*parse_expression_function) (unsigned precedence);
3077 typedef expression_t* (*parse_expression_infix_function) (unsigned precedence,
3078 expression_t *left);
3080 typedef struct expression_parser_function_t expression_parser_function_t;
3081 struct expression_parser_function_t {
3082 unsigned precedence;
3083 parse_expression_function parser;
3084 unsigned infix_precedence;
3085 parse_expression_infix_function infix_parser;
3088 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
3091 * Creates a new invalid expression.
3093 static expression_t *create_invalid_expression(void)
3095 expression_t *expression = allocate_expression_zero(EXPR_INVALID);
3096 expression->base.source_position = token.source_position;
3101 * Prints an error message if an expression was expected but not read
3103 static expression_t *expected_expression_error(void)
3105 /* skip the error message if the error token was read */
3106 if (token.type != T_ERROR) {
3107 errorf(HERE, "expected expression, got token '%K'", &token);
3111 return create_invalid_expression();
3115 * Parse a string constant.
3117 static expression_t *parse_string_const(void)
3119 expression_t *cnst = allocate_expression_zero(EXPR_STRING_LITERAL);
3120 cnst->base.type = type_char_ptr;
3121 cnst->string.value = parse_string_literals();
3127 * Parse a wide string constant.
3129 static expression_t *parse_wide_string_const(void)
3131 expression_t *const cnst = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
3132 cnst->base.type = type_wchar_t_ptr;
3133 cnst->wide_string.value = token.v.wide_string; /* TODO concatenate */
3139 * Parse an integer constant.
3141 static expression_t *parse_int_const(void)
3143 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
3144 cnst->base.type = token.datatype;
3145 cnst->conste.v.int_value = token.v.intvalue;
3153 * Parse a float constant.
3155 static expression_t *parse_float_const(void)
3157 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
3158 cnst->base.type = token.datatype;
3159 cnst->conste.v.float_value = token.v.floatvalue;
3166 static declaration_t *create_implicit_function(symbol_t *symbol,
3167 const source_position_t source_position)
3169 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
3170 ntype->function.return_type = type_int;
3171 ntype->function.unspecified_parameters = true;
3173 type_t *type = typehash_insert(ntype);
3178 declaration_t *const declaration = allocate_declaration_zero();
3179 declaration->storage_class = STORAGE_CLASS_EXTERN;
3180 declaration->type = type;
3181 declaration->symbol = symbol;
3182 declaration->source_position = source_position;
3183 declaration->parent_scope = global_scope;
3185 scope_t *old_scope = scope;
3186 set_scope(global_scope);
3188 environment_push(declaration);
3189 /* prepends the declaration to the global declarations list */
3190 declaration->next = scope->declarations;
3191 scope->declarations = declaration;
3193 assert(scope == global_scope);
3194 set_scope(old_scope);
3200 * Creates a return_type (func)(argument_type) function type if not
3203 * @param return_type the return type
3204 * @param argument_type the argument type
3206 static type_t *make_function_1_type(type_t *return_type, type_t *argument_type)
3208 function_parameter_t *parameter
3209 = obstack_alloc(type_obst, sizeof(parameter[0]));
3210 memset(parameter, 0, sizeof(parameter[0]));
3211 parameter->type = argument_type;
3213 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3214 type->function.return_type = return_type;
3215 type->function.parameters = parameter;
3217 type_t *result = typehash_insert(type);
3218 if(result != type) {
3226 * Creates a function type for some function like builtins.
3228 * @param symbol the symbol describing the builtin
3230 static type_t *get_builtin_symbol_type(symbol_t *symbol)
3232 switch(symbol->ID) {
3233 case T___builtin_alloca:
3234 return make_function_1_type(type_void_ptr, type_size_t);
3235 case T___builtin_nan:
3236 return make_function_1_type(type_double, type_char_ptr);
3237 case T___builtin_nanf:
3238 return make_function_1_type(type_float, type_char_ptr);
3239 case T___builtin_nand:
3240 return make_function_1_type(type_long_double, type_char_ptr);
3241 case T___builtin_va_end:
3242 return make_function_1_type(type_void, type_valist);
3244 panic("not implemented builtin symbol found");
3249 * Performs automatic type cast as described in § 6.3.2.1.
3251 * @param orig_type the original type
3253 static type_t *automatic_type_conversion(type_t *orig_type)
3255 type_t *type = skip_typeref(orig_type);
3256 if(is_type_array(type)) {
3257 array_type_t *array_type = &type->array;
3258 type_t *element_type = array_type->element_type;
3259 unsigned qualifiers = array_type->type.qualifiers;
3261 return make_pointer_type(element_type, qualifiers);
3264 if(is_type_function(type)) {
3265 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
3272 * reverts the automatic casts of array to pointer types and function
3273 * to function-pointer types as defined § 6.3.2.1
3275 type_t *revert_automatic_type_conversion(const expression_t *expression)
3277 switch (expression->kind) {
3278 case EXPR_REFERENCE: return expression->reference.declaration->type;
3279 case EXPR_SELECT: return expression->select.compound_entry->type;
3281 case EXPR_UNARY_DEREFERENCE: {
3282 const expression_t *const value = expression->unary.value;
3283 type_t *const type = skip_typeref(value->base.type);
3284 assert(is_type_pointer(type));
3285 return type->pointer.points_to;
3288 case EXPR_BUILTIN_SYMBOL:
3289 return get_builtin_symbol_type(expression->builtin_symbol.symbol);
3291 case EXPR_ARRAY_ACCESS: {
3292 const expression_t *array_ref = expression->array_access.array_ref;
3293 type_t *type_left = skip_typeref(array_ref->base.type);
3294 if (!is_type_valid(type_left))
3296 assert(is_type_pointer(type_left));
3297 return type_left->pointer.points_to;
3303 return expression->base.type;
3306 static expression_t *parse_reference(void)
3308 expression_t *expression = allocate_expression_zero(EXPR_REFERENCE);
3310 reference_expression_t *ref = &expression->reference;
3311 ref->symbol = token.v.symbol;
3313 declaration_t *declaration = get_declaration(ref->symbol, NAMESPACE_NORMAL);
3315 source_position_t source_position = token.source_position;
3318 if(declaration == NULL) {
3319 if (! strict_mode && token.type == '(') {
3320 /* an implicitly defined function */
3321 if (warning.implicit_function_declaration) {
3322 warningf(HERE, "implicit declaration of function '%Y'",
3326 declaration = create_implicit_function(ref->symbol,
3329 errorf(HERE, "unknown symbol '%Y' found.", ref->symbol);
3334 type_t *type = declaration->type;
3336 /* we always do the auto-type conversions; the & and sizeof parser contains
3337 * code to revert this! */
3338 type = automatic_type_conversion(type);
3340 ref->declaration = declaration;
3341 ref->base.type = type;
3343 /* this declaration is used */
3344 declaration->used = true;
3349 static void check_cast_allowed(expression_t *expression, type_t *dest_type)
3353 /* TODO check if explicit cast is allowed and issue warnings/errors */
3356 static expression_t *parse_cast(void)
3358 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
3360 cast->base.source_position = token.source_position;
3362 type_t *type = parse_typename();
3365 expression_t *value = parse_sub_expression(20);
3367 check_cast_allowed(value, type);
3369 cast->base.type = type;
3370 cast->unary.value = value;
3375 static expression_t *parse_statement_expression(void)
3377 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
3379 statement_t *statement = parse_compound_statement();
3380 expression->statement.statement = statement;
3381 expression->base.source_position = statement->base.source_position;
3383 /* find last statement and use its type */
3384 type_t *type = type_void;
3385 const statement_t *stmt = statement->compound.statements;
3387 while (stmt->base.next != NULL)
3388 stmt = stmt->base.next;
3390 if (stmt->kind == STATEMENT_EXPRESSION) {
3391 type = stmt->expression.expression->base.type;
3394 warningf(expression->base.source_position, "empty statement expression ({})");
3396 expression->base.type = type;
3403 static expression_t *parse_brace_expression(void)
3407 switch(token.type) {
3409 /* gcc extension: a statement expression */
3410 return parse_statement_expression();
3414 return parse_cast();
3416 if(is_typedef_symbol(token.v.symbol)) {
3417 return parse_cast();
3421 expression_t *result = parse_expression();
3427 static expression_t *parse_function_keyword(void)
3432 if (current_function == NULL) {
3433 errorf(HERE, "'__func__' used outside of a function");
3436 expression_t *expression = allocate_expression_zero(EXPR_FUNCTION);
3437 expression->base.type = type_char_ptr;
3442 static expression_t *parse_pretty_function_keyword(void)
3444 eat(T___PRETTY_FUNCTION__);
3447 if (current_function == NULL) {
3448 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
3451 expression_t *expression = allocate_expression_zero(EXPR_PRETTY_FUNCTION);
3452 expression->base.type = type_char_ptr;
3457 static designator_t *parse_designator(void)
3459 designator_t *result = allocate_ast_zero(sizeof(result[0]));
3461 if(token.type != T_IDENTIFIER) {
3462 parse_error_expected("while parsing member designator",
3467 result->symbol = token.v.symbol;
3470 designator_t *last_designator = result;
3472 if(token.type == '.') {
3474 if(token.type != T_IDENTIFIER) {
3475 parse_error_expected("while parsing member designator",
3480 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
3481 designator->symbol = token.v.symbol;
3484 last_designator->next = designator;
3485 last_designator = designator;
3488 if(token.type == '[') {
3490 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
3491 designator->array_access = parse_expression();
3492 if(designator->array_access == NULL) {
3498 last_designator->next = designator;
3499 last_designator = designator;
3508 static expression_t *parse_offsetof(void)
3510 eat(T___builtin_offsetof);
3512 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
3513 expression->base.type = type_size_t;
3516 expression->offsetofe.type = parse_typename();
3518 expression->offsetofe.designator = parse_designator();
3524 static expression_t *parse_va_start(void)
3526 eat(T___builtin_va_start);
3528 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
3531 expression->va_starte.ap = parse_assignment_expression();
3533 expression_t *const expr = parse_assignment_expression();
3534 if (expr->kind == EXPR_REFERENCE) {
3535 declaration_t *const decl = expr->reference.declaration;
3537 return create_invalid_expression();
3538 if (decl->parent_scope == ¤t_function->scope &&
3539 decl->next == NULL) {
3540 expression->va_starte.parameter = decl;
3545 errorf(expr->base.source_position, "second argument of 'va_start' must be last parameter of the current function");
3547 return create_invalid_expression();
3550 static expression_t *parse_va_arg(void)
3552 eat(T___builtin_va_arg);
3554 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
3557 expression->va_arge.ap = parse_assignment_expression();
3559 expression->base.type = parse_typename();
3565 static expression_t *parse_builtin_symbol(void)
3567 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_SYMBOL);
3569 symbol_t *symbol = token.v.symbol;
3571 expression->builtin_symbol.symbol = symbol;
3574 type_t *type = get_builtin_symbol_type(symbol);
3575 type = automatic_type_conversion(type);
3577 expression->base.type = type;
3581 static expression_t *parse_builtin_constant(void)
3583 eat(T___builtin_constant_p);
3585 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
3588 expression->builtin_constant.value = parse_assignment_expression();
3590 expression->base.type = type_int;
3595 static expression_t *parse_builtin_prefetch(void)
3597 eat(T___builtin_prefetch);
3599 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_PREFETCH);
3602 expression->builtin_prefetch.adr = parse_assignment_expression();
3603 if (token.type == ',') {
3605 expression->builtin_prefetch.rw = parse_assignment_expression();
3607 if (token.type == ',') {
3609 expression->builtin_prefetch.locality = parse_assignment_expression();
3612 expression->base.type = type_void;
3617 static expression_t *parse_compare_builtin(void)
3619 expression_t *expression;
3621 switch(token.type) {
3622 case T___builtin_isgreater:
3623 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
3625 case T___builtin_isgreaterequal:
3626 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
3628 case T___builtin_isless:
3629 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
3631 case T___builtin_islessequal:
3632 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
3634 case T___builtin_islessgreater:
3635 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
3637 case T___builtin_isunordered:
3638 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
3641 panic("invalid compare builtin found");
3644 expression->base.source_position = HERE;
3648 expression->binary.left = parse_assignment_expression();
3650 expression->binary.right = parse_assignment_expression();
3653 type_t *const orig_type_left = expression->binary.left->base.type;
3654 type_t *const orig_type_right = expression->binary.right->base.type;
3656 type_t *const type_left = skip_typeref(orig_type_left);
3657 type_t *const type_right = skip_typeref(orig_type_right);
3658 if(!is_type_float(type_left) && !is_type_float(type_right)) {
3659 if (is_type_valid(type_left) && is_type_valid(type_right)) {
3660 type_error_incompatible("invalid operands in comparison",
3661 expression->base.source_position, orig_type_left, orig_type_right);
3664 semantic_comparison(&expression->binary);
3670 static expression_t *parse_builtin_expect(void)
3672 eat(T___builtin_expect);
3674 expression_t *expression
3675 = allocate_expression_zero(EXPR_BINARY_BUILTIN_EXPECT);
3678 expression->binary.left = parse_assignment_expression();
3680 expression->binary.right = parse_constant_expression();
3683 expression->base.type = expression->binary.left->base.type;
3688 static expression_t *parse_assume(void) {
3691 expression_t *expression
3692 = allocate_expression_zero(EXPR_UNARY_ASSUME);
3695 expression->unary.value = parse_assignment_expression();
3698 expression->base.type = type_void;
3702 static expression_t *parse_primary_expression(void)
3704 switch(token.type) {
3706 return parse_int_const();
3707 case T_FLOATINGPOINT:
3708 return parse_float_const();
3709 case T_STRING_LITERAL:
3710 return parse_string_const();
3711 case T_WIDE_STRING_LITERAL:
3712 return parse_wide_string_const();
3714 return parse_reference();
3715 case T___FUNCTION__:
3717 return parse_function_keyword();
3718 case T___PRETTY_FUNCTION__:
3719 return parse_pretty_function_keyword();
3720 case T___builtin_offsetof:
3721 return parse_offsetof();
3722 case T___builtin_va_start:
3723 return parse_va_start();
3724 case T___builtin_va_arg:
3725 return parse_va_arg();
3726 case T___builtin_expect:
3727 return parse_builtin_expect();
3728 case T___builtin_alloca:
3729 case T___builtin_nan:
3730 case T___builtin_nand:
3731 case T___builtin_nanf:
3732 case T___builtin_va_end:
3733 return parse_builtin_symbol();
3734 case T___builtin_isgreater:
3735 case T___builtin_isgreaterequal:
3736 case T___builtin_isless:
3737 case T___builtin_islessequal:
3738 case T___builtin_islessgreater:
3739 case T___builtin_isunordered:
3740 return parse_compare_builtin();
3741 case T___builtin_constant_p:
3742 return parse_builtin_constant();
3743 case T___builtin_prefetch:
3744 return parse_builtin_prefetch();
3746 return parse_assume();
3749 return parse_brace_expression();
3752 errorf(HERE, "unexpected token %K", &token);
3755 return create_invalid_expression();
3759 * Check if the expression has the character type and issue a warning then.
3761 static void check_for_char_index_type(const expression_t *expression) {
3762 type_t *const type = expression->base.type;
3763 const type_t *const base_type = skip_typeref(type);
3765 if (is_type_atomic(base_type, ATOMIC_TYPE_CHAR) &&
3766 warning.char_subscripts) {
3767 warningf(expression->base.source_position,
3768 "array subscript has type '%T'", type);
3772 static expression_t *parse_array_expression(unsigned precedence,
3779 expression_t *inside = parse_expression();
3781 expression_t *expression = allocate_expression_zero(EXPR_ARRAY_ACCESS);
3783 array_access_expression_t *array_access = &expression->array_access;
3785 type_t *const orig_type_left = left->base.type;
3786 type_t *const orig_type_inside = inside->base.type;
3788 type_t *const type_left = skip_typeref(orig_type_left);
3789 type_t *const type_inside = skip_typeref(orig_type_inside);
3791 type_t *return_type;
3792 if (is_type_pointer(type_left)) {
3793 return_type = type_left->pointer.points_to;
3794 array_access->array_ref = left;
3795 array_access->index = inside;
3796 check_for_char_index_type(inside);
3797 } else if (is_type_pointer(type_inside)) {
3798 return_type = type_inside->pointer.points_to;
3799 array_access->array_ref = inside;
3800 array_access->index = left;
3801 array_access->flipped = true;
3802 check_for_char_index_type(left);
3804 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
3806 "array access on object with non-pointer types '%T', '%T'",
3807 orig_type_left, orig_type_inside);
3809 return_type = type_error_type;
3810 array_access->array_ref = create_invalid_expression();
3813 if(token.type != ']') {
3814 parse_error_expected("Problem while parsing array access", ']', 0);
3819 return_type = automatic_type_conversion(return_type);
3820 expression->base.type = return_type;
3825 static expression_t *parse_typeprop(expression_kind_t kind, unsigned precedence)
3827 expression_t *tp_expression = allocate_expression_zero(kind);
3828 tp_expression->base.type = type_size_t;
3830 if(token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
3832 tp_expression->typeprop.type = parse_typename();
3835 expression_t *expression = parse_sub_expression(precedence);
3836 expression->base.type = revert_automatic_type_conversion(expression);
3838 tp_expression->typeprop.type = expression->base.type;
3839 tp_expression->typeprop.tp_expression = expression;
3842 return tp_expression;
3845 static expression_t *parse_sizeof(unsigned precedence)
3848 return parse_typeprop(EXPR_SIZEOF, precedence);
3851 static expression_t *parse_alignof(unsigned precedence)
3854 return parse_typeprop(EXPR_SIZEOF, precedence);
3857 static expression_t *parse_select_expression(unsigned precedence,
3858 expression_t *compound)
3861 assert(token.type == '.' || token.type == T_MINUSGREATER);
3863 bool is_pointer = (token.type == T_MINUSGREATER);
3866 expression_t *select = allocate_expression_zero(EXPR_SELECT);
3867 select->select.compound = compound;
3869 if(token.type != T_IDENTIFIER) {
3870 parse_error_expected("while parsing select", T_IDENTIFIER, 0);
3873 symbol_t *symbol = token.v.symbol;
3874 select->select.symbol = symbol;
3877 type_t *const orig_type = compound->base.type;
3878 type_t *const type = skip_typeref(orig_type);
3880 type_t *type_left = type;
3882 if (!is_type_pointer(type)) {
3883 if (is_type_valid(type)) {
3884 errorf(HERE, "left hand side of '->' is not a pointer, but '%T'", orig_type);
3886 return create_invalid_expression();
3888 type_left = type->pointer.points_to;
3890 type_left = skip_typeref(type_left);
3892 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
3893 type_left->kind != TYPE_COMPOUND_UNION) {
3894 if (is_type_valid(type_left)) {
3895 errorf(HERE, "request for member '%Y' in something not a struct or "
3896 "union, but '%T'", symbol, type_left);
3898 return create_invalid_expression();
3901 declaration_t *const declaration = type_left->compound.declaration;
3903 if(!declaration->init.is_defined) {
3904 errorf(HERE, "request for member '%Y' of incomplete type '%T'",
3906 return create_invalid_expression();
3909 declaration_t *iter = declaration->scope.declarations;
3910 for( ; iter != NULL; iter = iter->next) {
3911 if(iter->symbol == symbol) {
3916 errorf(HERE, "'%T' has no member named '%Y'", orig_type, symbol);
3917 return create_invalid_expression();
3920 /* we always do the auto-type conversions; the & and sizeof parser contains
3921 * code to revert this! */
3922 type_t *expression_type = automatic_type_conversion(iter->type);
3924 select->select.compound_entry = iter;
3925 select->base.type = expression_type;
3927 if(expression_type->kind == TYPE_BITFIELD) {
3928 expression_t *extract
3929 = allocate_expression_zero(EXPR_UNARY_BITFIELD_EXTRACT);
3930 extract->unary.value = select;
3931 extract->base.type = expression_type->bitfield.base;
3940 * Parse a call expression, ie. expression '( ... )'.
3942 * @param expression the function address
3944 static expression_t *parse_call_expression(unsigned precedence,
3945 expression_t *expression)
3948 expression_t *result = allocate_expression_zero(EXPR_CALL);
3950 call_expression_t *call = &result->call;
3951 call->function = expression;
3953 type_t *const orig_type = expression->base.type;
3954 type_t *const type = skip_typeref(orig_type);
3956 function_type_t *function_type = NULL;
3957 if (is_type_pointer(type)) {
3958 type_t *const to_type = skip_typeref(type->pointer.points_to);
3960 if (is_type_function(to_type)) {
3961 function_type = &to_type->function;
3962 call->base.type = function_type->return_type;
3966 if (function_type == NULL && is_type_valid(type)) {
3967 errorf(HERE, "called object '%E' (type '%T') is not a pointer to a function", expression, orig_type);
3970 /* parse arguments */
3973 if(token.type != ')') {
3974 call_argument_t *last_argument = NULL;
3977 call_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
3979 argument->expression = parse_assignment_expression();
3980 if(last_argument == NULL) {
3981 call->arguments = argument;
3983 last_argument->next = argument;
3985 last_argument = argument;
3987 if(token.type != ',')
3994 if(function_type != NULL) {
3995 function_parameter_t *parameter = function_type->parameters;
3996 call_argument_t *argument = call->arguments;
3997 for( ; parameter != NULL && argument != NULL;
3998 parameter = parameter->next, argument = argument->next) {
3999 type_t *expected_type = parameter->type;
4000 /* TODO report scope in error messages */
4001 expression_t *const arg_expr = argument->expression;
4002 type_t *const res_type = semantic_assign(expected_type, arg_expr, "function call");
4003 if (res_type == NULL) {
4004 /* TODO improve error message */
4005 errorf(arg_expr->base.source_position,
4006 "Cannot call function with argument '%E' of type '%T' where type '%T' is expected",
4007 arg_expr, arg_expr->base.type, expected_type);
4009 argument->expression = create_implicit_cast(argument->expression, expected_type);
4012 /* too few parameters */
4013 if(parameter != NULL) {
4014 errorf(HERE, "too few arguments to function '%E'", expression);
4015 } else if(argument != NULL) {
4016 /* too many parameters */
4017 if(!function_type->variadic
4018 && !function_type->unspecified_parameters) {
4019 errorf(HERE, "too many arguments to function '%E'", expression);
4021 /* do default promotion */
4022 for( ; argument != NULL; argument = argument->next) {
4023 type_t *type = argument->expression->base.type;
4025 type = skip_typeref(type);
4026 if(is_type_integer(type)) {
4027 type = promote_integer(type);
4028 } else if(type == type_float) {
4032 argument->expression
4033 = create_implicit_cast(argument->expression, type);
4036 check_format(&result->call);
4039 check_format(&result->call);
4046 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
4048 static bool same_compound_type(const type_t *type1, const type_t *type2)
4051 is_type_compound(type1) &&
4052 type1->kind == type2->kind &&
4053 type1->compound.declaration == type2->compound.declaration;
4057 * Parse a conditional expression, ie. 'expression ? ... : ...'.
4059 * @param expression the conditional expression
4061 static expression_t *parse_conditional_expression(unsigned precedence,
4062 expression_t *expression)
4066 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
4068 conditional_expression_t *conditional = &result->conditional;
4069 conditional->condition = expression;
4072 type_t *const condition_type_orig = expression->base.type;
4073 type_t *const condition_type = skip_typeref(condition_type_orig);
4074 if (!is_type_scalar(condition_type) && is_type_valid(condition_type)) {
4075 type_error("expected a scalar type in conditional condition",
4076 expression->base.source_position, condition_type_orig);
4079 expression_t *true_expression = parse_expression();
4081 expression_t *false_expression = parse_sub_expression(precedence);
4083 conditional->true_expression = true_expression;
4084 conditional->false_expression = false_expression;
4086 type_t *const orig_true_type = true_expression->base.type;
4087 type_t *const orig_false_type = false_expression->base.type;
4088 type_t *const true_type = skip_typeref(orig_true_type);
4089 type_t *const false_type = skip_typeref(orig_false_type);
4092 type_t *result_type;
4093 if (is_type_arithmetic(true_type) && is_type_arithmetic(false_type)) {
4094 result_type = semantic_arithmetic(true_type, false_type);
4096 true_expression = create_implicit_cast(true_expression, result_type);
4097 false_expression = create_implicit_cast(false_expression, result_type);
4099 conditional->true_expression = true_expression;
4100 conditional->false_expression = false_expression;
4101 conditional->base.type = result_type;
4102 } else if (same_compound_type(true_type, false_type) || (
4103 is_type_atomic(true_type, ATOMIC_TYPE_VOID) &&
4104 is_type_atomic(false_type, ATOMIC_TYPE_VOID)
4106 /* just take 1 of the 2 types */
4107 result_type = true_type;
4108 } else if (is_type_pointer(true_type) && is_type_pointer(false_type)
4109 && pointers_compatible(true_type, false_type)) {
4111 result_type = true_type;
4114 if (is_type_valid(true_type) && is_type_valid(false_type)) {
4115 type_error_incompatible("while parsing conditional",
4116 expression->base.source_position, true_type,
4119 result_type = type_error_type;
4122 conditional->base.type = result_type;
4127 * Parse an extension expression.
4129 static expression_t *parse_extension(unsigned precedence)
4131 eat(T___extension__);
4133 /* TODO enable extensions */
4134 expression_t *expression = parse_sub_expression(precedence);
4135 /* TODO disable extensions */
4139 static expression_t *parse_builtin_classify_type(const unsigned precedence)
4141 eat(T___builtin_classify_type);
4143 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
4144 result->base.type = type_int;
4147 expression_t *expression = parse_sub_expression(precedence);
4149 result->classify_type.type_expression = expression;
4154 static void semantic_incdec(unary_expression_t *expression)
4156 type_t *const orig_type = expression->value->base.type;
4157 type_t *const type = skip_typeref(orig_type);
4158 /* TODO !is_type_real && !is_type_pointer */
4159 if(!is_type_arithmetic(type) && type->kind != TYPE_POINTER) {
4160 if (is_type_valid(type)) {
4161 /* TODO: improve error message */
4162 errorf(HERE, "operation needs an arithmetic or pointer type");
4167 expression->base.type = orig_type;
4170 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
4172 type_t *const orig_type = expression->value->base.type;
4173 type_t *const type = skip_typeref(orig_type);
4174 if(!is_type_arithmetic(type)) {
4175 if (is_type_valid(type)) {
4176 /* TODO: improve error message */
4177 errorf(HERE, "operation needs an arithmetic type");
4182 expression->base.type = orig_type;
4185 static void semantic_unexpr_scalar(unary_expression_t *expression)
4187 type_t *const orig_type = expression->value->base.type;
4188 type_t *const type = skip_typeref(orig_type);
4189 if (!is_type_scalar(type)) {
4190 if (is_type_valid(type)) {
4191 errorf(HERE, "operand of ! must be of scalar type");
4196 expression->base.type = orig_type;
4199 static void semantic_unexpr_integer(unary_expression_t *expression)
4201 type_t *const orig_type = expression->value->base.type;
4202 type_t *const type = skip_typeref(orig_type);
4203 if (!is_type_integer(type)) {
4204 if (is_type_valid(type)) {
4205 errorf(HERE, "operand of ~ must be of integer type");
4210 expression->base.type = orig_type;
4213 static void semantic_dereference(unary_expression_t *expression)
4215 type_t *const orig_type = expression->value->base.type;
4216 type_t *const type = skip_typeref(orig_type);
4217 if(!is_type_pointer(type)) {
4218 if (is_type_valid(type)) {
4219 errorf(HERE, "Unary '*' needs pointer or arrray type, but type '%T' given", orig_type);
4224 type_t *result_type = type->pointer.points_to;
4225 result_type = automatic_type_conversion(result_type);
4226 expression->base.type = result_type;
4230 * Check the semantic of the address taken expression.
4232 static void semantic_take_addr(unary_expression_t *expression)
4234 expression_t *value = expression->value;
4235 value->base.type = revert_automatic_type_conversion(value);
4237 type_t *orig_type = value->base.type;
4238 if(!is_type_valid(orig_type))
4241 if(value->kind == EXPR_REFERENCE) {
4242 declaration_t *const declaration = value->reference.declaration;
4243 if(declaration != NULL) {
4244 if (declaration->storage_class == STORAGE_CLASS_REGISTER) {
4245 errorf(expression->base.source_position,
4246 "address of register variable '%Y' requested",
4247 declaration->symbol);
4249 declaration->address_taken = 1;
4253 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
4256 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
4257 static expression_t *parse_##unexpression_type(unsigned precedence) \
4261 expression_t *unary_expression \
4262 = allocate_expression_zero(unexpression_type); \
4263 unary_expression->base.source_position = HERE; \
4264 unary_expression->unary.value = parse_sub_expression(precedence); \
4266 sfunc(&unary_expression->unary); \
4268 return unary_expression; \
4271 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
4272 semantic_unexpr_arithmetic)
4273 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
4274 semantic_unexpr_arithmetic)
4275 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
4276 semantic_unexpr_scalar)
4277 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
4278 semantic_dereference)
4279 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
4281 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
4282 semantic_unexpr_integer)
4283 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
4285 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
4288 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
4290 static expression_t *parse_##unexpression_type(unsigned precedence, \
4291 expression_t *left) \
4293 (void) precedence; \
4296 expression_t *unary_expression \
4297 = allocate_expression_zero(unexpression_type); \
4298 unary_expression->unary.value = left; \
4300 sfunc(&unary_expression->unary); \
4302 return unary_expression; \
4305 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
4306 EXPR_UNARY_POSTFIX_INCREMENT,
4308 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
4309 EXPR_UNARY_POSTFIX_DECREMENT,
4312 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
4314 /* TODO: handle complex + imaginary types */
4316 /* § 6.3.1.8 Usual arithmetic conversions */
4317 if(type_left == type_long_double || type_right == type_long_double) {
4318 return type_long_double;
4319 } else if(type_left == type_double || type_right == type_double) {
4321 } else if(type_left == type_float || type_right == type_float) {
4325 type_right = promote_integer(type_right);
4326 type_left = promote_integer(type_left);
4328 if(type_left == type_right)
4331 bool signed_left = is_type_signed(type_left);
4332 bool signed_right = is_type_signed(type_right);
4333 int rank_left = get_rank(type_left);
4334 int rank_right = get_rank(type_right);
4335 if(rank_left < rank_right) {
4336 if(signed_left == signed_right || !signed_right) {
4342 if(signed_left == signed_right || !signed_left) {
4351 * Check the semantic restrictions for a binary expression.
4353 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
4355 expression_t *const left = expression->left;
4356 expression_t *const right = expression->right;
4357 type_t *const orig_type_left = left->base.type;
4358 type_t *const orig_type_right = right->base.type;
4359 type_t *const type_left = skip_typeref(orig_type_left);
4360 type_t *const type_right = skip_typeref(orig_type_right);
4362 if(!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
4363 /* TODO: improve error message */
4364 if (is_type_valid(type_left) && is_type_valid(type_right)) {
4365 errorf(HERE, "operation needs arithmetic types");
4370 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
4371 expression->left = create_implicit_cast(left, arithmetic_type);
4372 expression->right = create_implicit_cast(right, arithmetic_type);
4373 expression->base.type = arithmetic_type;
4376 static void semantic_shift_op(binary_expression_t *expression)
4378 expression_t *const left = expression->left;
4379 expression_t *const right = expression->right;
4380 type_t *const orig_type_left = left->base.type;
4381 type_t *const orig_type_right = right->base.type;
4382 type_t * type_left = skip_typeref(orig_type_left);
4383 type_t * type_right = skip_typeref(orig_type_right);
4385 if(!is_type_integer(type_left) || !is_type_integer(type_right)) {
4386 /* TODO: improve error message */
4387 if (is_type_valid(type_left) && is_type_valid(type_right)) {
4388 errorf(HERE, "operation needs integer types");
4393 type_left = promote_integer(type_left);
4394 type_right = promote_integer(type_right);
4396 expression->left = create_implicit_cast(left, type_left);
4397 expression->right = create_implicit_cast(right, type_right);
4398 expression->base.type = type_left;
4401 static void semantic_add(binary_expression_t *expression)
4403 expression_t *const left = expression->left;
4404 expression_t *const right = expression->right;
4405 type_t *const orig_type_left = left->base.type;
4406 type_t *const orig_type_right = right->base.type;
4407 type_t *const type_left = skip_typeref(orig_type_left);
4408 type_t *const type_right = skip_typeref(orig_type_right);
4411 if(is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
4412 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
4413 expression->left = create_implicit_cast(left, arithmetic_type);
4414 expression->right = create_implicit_cast(right, arithmetic_type);
4415 expression->base.type = arithmetic_type;
4417 } else if(is_type_pointer(type_left) && is_type_integer(type_right)) {
4418 expression->base.type = type_left;
4419 } else if(is_type_pointer(type_right) && is_type_integer(type_left)) {
4420 expression->base.type = type_right;
4421 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
4422 errorf(HERE, "invalid operands to binary + ('%T', '%T')", orig_type_left, orig_type_right);
4426 static void semantic_sub(binary_expression_t *expression)
4428 expression_t *const left = expression->left;
4429 expression_t *const right = expression->right;
4430 type_t *const orig_type_left = left->base.type;
4431 type_t *const orig_type_right = right->base.type;
4432 type_t *const type_left = skip_typeref(orig_type_left);
4433 type_t *const type_right = skip_typeref(orig_type_right);
4436 if(is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
4437 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
4438 expression->left = create_implicit_cast(left, arithmetic_type);
4439 expression->right = create_implicit_cast(right, arithmetic_type);
4440 expression->base.type = arithmetic_type;
4442 } else if(is_type_pointer(type_left) && is_type_integer(type_right)) {
4443 expression->base.type = type_left;
4444 } else if(is_type_pointer(type_left) && is_type_pointer(type_right)) {
4445 if(!pointers_compatible(type_left, type_right)) {
4447 "pointers to incompatible objects to binary '-' ('%T', '%T')",
4448 orig_type_left, orig_type_right);
4450 expression->base.type = type_ptrdiff_t;
4452 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
4453 errorf(HERE, "invalid operands to binary '-' ('%T', '%T')",
4454 orig_type_left, orig_type_right);
4459 * Check the semantics of comparison expressions.
4461 * @param expression The expression to check.
4463 static void semantic_comparison(binary_expression_t *expression)
4465 expression_t *left = expression->left;
4466 expression_t *right = expression->right;
4467 type_t *orig_type_left = left->base.type;
4468 type_t *orig_type_right = right->base.type;
4470 type_t *type_left = skip_typeref(orig_type_left);
4471 type_t *type_right = skip_typeref(orig_type_right);
4473 /* TODO non-arithmetic types */
4474 if(is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
4475 if (warning.sign_compare &&
4476 (expression->base.kind != EXPR_BINARY_EQUAL &&
4477 expression->base.kind != EXPR_BINARY_NOTEQUAL) &&
4478 (is_type_signed(type_left) != is_type_signed(type_right))) {
4479 warningf(expression->base.source_position,
4480 "comparison between signed and unsigned");
4482 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
4483 expression->left = create_implicit_cast(left, arithmetic_type);
4484 expression->right = create_implicit_cast(right, arithmetic_type);
4485 expression->base.type = arithmetic_type;
4486 if (warning.float_equal &&
4487 (expression->base.kind == EXPR_BINARY_EQUAL ||
4488 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
4489 is_type_float(arithmetic_type)) {
4490 warningf(expression->base.source_position,
4491 "comparing floating point with == or != is unsafe");
4493 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
4494 /* TODO check compatibility */
4495 } else if (is_type_pointer(type_left)) {
4496 expression->right = create_implicit_cast(right, type_left);
4497 } else if (is_type_pointer(type_right)) {
4498 expression->left = create_implicit_cast(left, type_right);
4499 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
4500 type_error_incompatible("invalid operands in comparison",
4501 expression->base.source_position,
4502 type_left, type_right);
4504 expression->base.type = type_int;
4507 static void semantic_arithmetic_assign(binary_expression_t *expression)
4509 expression_t *left = expression->left;
4510 expression_t *right = expression->right;
4511 type_t *orig_type_left = left->base.type;
4512 type_t *orig_type_right = right->base.type;
4514 type_t *type_left = skip_typeref(orig_type_left);
4515 type_t *type_right = skip_typeref(orig_type_right);
4517 if(!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
4518 /* TODO: improve error message */
4519 if (is_type_valid(type_left) && is_type_valid(type_right)) {
4520 errorf(HERE, "operation needs arithmetic types");
4525 /* combined instructions are tricky. We can't create an implicit cast on
4526 * the left side, because we need the uncasted form for the store.
4527 * The ast2firm pass has to know that left_type must be right_type
4528 * for the arithmetic operation and create a cast by itself */
4529 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
4530 expression->right = create_implicit_cast(right, arithmetic_type);
4531 expression->base.type = type_left;
4534 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
4536 expression_t *const left = expression->left;
4537 expression_t *const right = expression->right;
4538 type_t *const orig_type_left = left->base.type;
4539 type_t *const orig_type_right = right->base.type;
4540 type_t *const type_left = skip_typeref(orig_type_left);
4541 type_t *const type_right = skip_typeref(orig_type_right);
4543 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
4544 /* combined instructions are tricky. We can't create an implicit cast on
4545 * the left side, because we need the uncasted form for the store.
4546 * The ast2firm pass has to know that left_type must be right_type
4547 * for the arithmetic operation and create a cast by itself */
4548 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
4549 expression->right = create_implicit_cast(right, arithmetic_type);
4550 expression->base.type = type_left;
4551 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
4552 expression->base.type = type_left;
4553 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
4554 errorf(HERE, "incompatible types '%T' and '%T' in assignment", orig_type_left, orig_type_right);
4559 * Check the semantic restrictions of a logical expression.
4561 static void semantic_logical_op(binary_expression_t *expression)
4563 expression_t *const left = expression->left;
4564 expression_t *const right = expression->right;
4565 type_t *const orig_type_left = left->base.type;
4566 type_t *const orig_type_right = right->base.type;
4567 type_t *const type_left = skip_typeref(orig_type_left);
4568 type_t *const type_right = skip_typeref(orig_type_right);
4570 if (!is_type_scalar(type_left) || !is_type_scalar(type_right)) {
4571 /* TODO: improve error message */
4572 if (is_type_valid(type_left) && is_type_valid(type_right)) {
4573 errorf(HERE, "operation needs scalar types");
4578 expression->base.type = type_int;
4582 * Checks if a compound type has constant fields.
4584 static bool has_const_fields(const compound_type_t *type)
4586 const scope_t *scope = &type->declaration->scope;
4587 const declaration_t *declaration = scope->declarations;
4589 for (; declaration != NULL; declaration = declaration->next) {
4590 if (declaration->namespc != NAMESPACE_NORMAL)
4593 const type_t *decl_type = skip_typeref(declaration->type);
4594 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
4602 * Check the semantic restrictions of a binary assign expression.
4604 static void semantic_binexpr_assign(binary_expression_t *expression)
4606 expression_t *left = expression->left;
4607 type_t *orig_type_left = left->base.type;
4609 type_t *type_left = revert_automatic_type_conversion(left);
4610 type_left = skip_typeref(orig_type_left);
4612 /* must be a modifiable lvalue */
4613 if (is_type_array(type_left)) {
4614 errorf(HERE, "cannot assign to arrays ('%E')", left);
4617 if(type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
4618 errorf(HERE, "assignment to readonly location '%E' (type '%T')", left,
4622 if(is_type_incomplete(type_left)) {
4624 "left-hand side of assignment '%E' has incomplete type '%T'",
4625 left, orig_type_left);
4628 if(is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
4629 errorf(HERE, "cannot assign to '%E' because compound type '%T' has readonly fields",
4630 left, orig_type_left);
4634 type_t *const res_type = semantic_assign(orig_type_left, expression->right,
4636 if (res_type == NULL) {
4637 errorf(expression->base.source_position,
4638 "cannot assign to '%T' from '%T'",
4639 orig_type_left, expression->right->base.type);
4641 expression->right = create_implicit_cast(expression->right, res_type);
4644 expression->base.type = orig_type_left;
4647 static bool expression_has_effect(const expression_t *const expr)
4649 switch (expr->kind) {
4650 case EXPR_UNKNOWN: break;
4651 case EXPR_INVALID: break;
4652 case EXPR_REFERENCE: return false;
4653 case EXPR_CONST: return false;
4654 case EXPR_STRING_LITERAL: return false;
4655 case EXPR_WIDE_STRING_LITERAL: return false;
4657 const call_expression_t *const call = &expr->call;
4658 if (call->function->kind != EXPR_BUILTIN_SYMBOL)
4661 switch (call->function->builtin_symbol.symbol->ID) {
4662 case T___builtin_va_end: return true;
4663 default: return false;
4666 case EXPR_CONDITIONAL: {
4667 const conditional_expression_t *const cond = &expr->conditional;
4669 expression_has_effect(cond->true_expression) &&
4670 expression_has_effect(cond->false_expression);
4672 case EXPR_SELECT: return false;
4673 case EXPR_ARRAY_ACCESS: return false;
4674 case EXPR_SIZEOF: return false;
4675 case EXPR_CLASSIFY_TYPE: return false;
4676 case EXPR_ALIGNOF: return false;
4678 case EXPR_FUNCTION: return false;
4679 case EXPR_PRETTY_FUNCTION: return false;
4680 case EXPR_BUILTIN_SYMBOL: break; /* handled in EXPR_CALL */
4681 case EXPR_BUILTIN_CONSTANT_P: return false;
4682 case EXPR_BUILTIN_PREFETCH: return true;
4683 case EXPR_OFFSETOF: return false;
4684 case EXPR_VA_START: return true;
4685 case EXPR_VA_ARG: return true;
4686 case EXPR_STATEMENT: return true; // TODO
4688 case EXPR_UNARY_NEGATE: return false;
4689 case EXPR_UNARY_PLUS: return false;
4690 case EXPR_UNARY_BITWISE_NEGATE: return false;
4691 case EXPR_UNARY_NOT: return false;
4692 case EXPR_UNARY_DEREFERENCE: return false;
4693 case EXPR_UNARY_TAKE_ADDRESS: return false;
4694 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
4695 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
4696 case EXPR_UNARY_PREFIX_INCREMENT: return true;
4697 case EXPR_UNARY_PREFIX_DECREMENT: return true;
4698 case EXPR_UNARY_CAST:
4699 return is_type_atomic(expr->base.type, ATOMIC_TYPE_VOID);
4700 case EXPR_UNARY_CAST_IMPLICIT: return true;
4701 case EXPR_UNARY_ASSUME: return true;
4702 case EXPR_UNARY_BITFIELD_EXTRACT: return false;
4704 case EXPR_BINARY_ADD: return false;
4705 case EXPR_BINARY_SUB: return false;
4706 case EXPR_BINARY_MUL: return false;
4707 case EXPR_BINARY_DIV: return false;
4708 case EXPR_BINARY_MOD: return false;
4709 case EXPR_BINARY_EQUAL: return false;
4710 case EXPR_BINARY_NOTEQUAL: return false;
4711 case EXPR_BINARY_LESS: return false;
4712 case EXPR_BINARY_LESSEQUAL: return false;
4713 case EXPR_BINARY_GREATER: return false;
4714 case EXPR_BINARY_GREATEREQUAL: return false;
4715 case EXPR_BINARY_BITWISE_AND: return false;
4716 case EXPR_BINARY_BITWISE_OR: return false;
4717 case EXPR_BINARY_BITWISE_XOR: return false;
4718 case EXPR_BINARY_SHIFTLEFT: return false;
4719 case EXPR_BINARY_SHIFTRIGHT: return false;
4720 case EXPR_BINARY_ASSIGN: return true;
4721 case EXPR_BINARY_MUL_ASSIGN: return true;
4722 case EXPR_BINARY_DIV_ASSIGN: return true;
4723 case EXPR_BINARY_MOD_ASSIGN: return true;
4724 case EXPR_BINARY_ADD_ASSIGN: return true;
4725 case EXPR_BINARY_SUB_ASSIGN: return true;
4726 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
4727 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
4728 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
4729 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
4730 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
4731 case EXPR_BINARY_LOGICAL_AND:
4732 case EXPR_BINARY_LOGICAL_OR:
4733 case EXPR_BINARY_COMMA:
4734 return expression_has_effect(expr->binary.right);
4736 case EXPR_BINARY_BUILTIN_EXPECT: return true;
4737 case EXPR_BINARY_ISGREATER: return false;
4738 case EXPR_BINARY_ISGREATEREQUAL: return false;
4739 case EXPR_BINARY_ISLESS: return false;
4740 case EXPR_BINARY_ISLESSEQUAL: return false;
4741 case EXPR_BINARY_ISLESSGREATER: return false;
4742 case EXPR_BINARY_ISUNORDERED: return false;
4745 panic("unexpected statement");
4748 static void semantic_comma(binary_expression_t *expression)
4750 if (warning.unused_value) {
4751 const expression_t *const left = expression->left;
4752 if (!expression_has_effect(left)) {
4753 warningf(left->base.source_position, "left-hand operand of comma expression has no effect");
4756 expression->base.type = expression->right->base.type;
4759 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, sfunc, lr) \
4760 static expression_t *parse_##binexpression_type(unsigned precedence, \
4761 expression_t *left) \
4764 source_position_t pos = HERE; \
4766 expression_t *right = parse_sub_expression(precedence + lr); \
4768 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
4769 binexpr->base.source_position = pos; \
4770 binexpr->binary.left = left; \
4771 binexpr->binary.right = right; \
4772 sfunc(&binexpr->binary); \
4777 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, semantic_comma, 1)
4778 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, semantic_binexpr_arithmetic, 1)
4779 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, semantic_binexpr_arithmetic, 1)
4780 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, semantic_binexpr_arithmetic, 1)
4781 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, semantic_add, 1)
4782 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, semantic_sub, 1)
4783 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, semantic_comparison, 1)
4784 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, semantic_comparison, 1)
4785 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, semantic_binexpr_assign, 0)
4787 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL,
4788 semantic_comparison, 1)
4789 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL,
4790 semantic_comparison, 1)
4791 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL,
4792 semantic_comparison, 1)
4793 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL,
4794 semantic_comparison, 1)
4796 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND,
4797 semantic_binexpr_arithmetic, 1)
4798 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR,
4799 semantic_binexpr_arithmetic, 1)
4800 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR,
4801 semantic_binexpr_arithmetic, 1)
4802 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND,
4803 semantic_logical_op, 1)
4804 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR,
4805 semantic_logical_op, 1)
4806 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT,
4807 semantic_shift_op, 1)
4808 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT,
4809 semantic_shift_op, 1)
4810 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN,
4811 semantic_arithmetic_addsubb_assign, 0)
4812 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN,
4813 semantic_arithmetic_addsubb_assign, 0)
4814 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN,
4815 semantic_arithmetic_assign, 0)
4816 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN,
4817 semantic_arithmetic_assign, 0)
4818 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN,
4819 semantic_arithmetic_assign, 0)
4820 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN,
4821 semantic_arithmetic_assign, 0)
4822 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN,
4823 semantic_arithmetic_assign, 0)
4824 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN,
4825 semantic_arithmetic_assign, 0)
4826 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN,
4827 semantic_arithmetic_assign, 0)
4828 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN,
4829 semantic_arithmetic_assign, 0)
4831 static expression_t *parse_sub_expression(unsigned precedence)
4833 if(token.type < 0) {
4834 return expected_expression_error();
4837 expression_parser_function_t *parser
4838 = &expression_parsers[token.type];
4839 source_position_t source_position = token.source_position;
4842 if(parser->parser != NULL) {
4843 left = parser->parser(parser->precedence);
4845 left = parse_primary_expression();
4847 assert(left != NULL);
4848 left->base.source_position = source_position;
4851 if(token.type < 0) {
4852 return expected_expression_error();
4855 parser = &expression_parsers[token.type];
4856 if(parser->infix_parser == NULL)
4858 if(parser->infix_precedence < precedence)
4861 left = parser->infix_parser(parser->infix_precedence, left);
4863 assert(left != NULL);
4864 assert(left->kind != EXPR_UNKNOWN);
4865 left->base.source_position = source_position;
4872 * Parse an expression.
4874 static expression_t *parse_expression(void)
4876 return parse_sub_expression(1);
4880 * Register a parser for a prefix-like operator with given precedence.
4882 * @param parser the parser function
4883 * @param token_type the token type of the prefix token
4884 * @param precedence the precedence of the operator
4886 static void register_expression_parser(parse_expression_function parser,
4887 int token_type, unsigned precedence)
4889 expression_parser_function_t *entry = &expression_parsers[token_type];
4891 if(entry->parser != NULL) {
4892 diagnosticf("for token '%k'\n", (token_type_t)token_type);
4893 panic("trying to register multiple expression parsers for a token");
4895 entry->parser = parser;
4896 entry->precedence = precedence;
4900 * Register a parser for an infix operator with given precedence.
4902 * @param parser the parser function
4903 * @param token_type the token type of the infix operator
4904 * @param precedence the precedence of the operator
4906 static void register_infix_parser(parse_expression_infix_function parser,
4907 int token_type, unsigned precedence)
4909 expression_parser_function_t *entry = &expression_parsers[token_type];
4911 if(entry->infix_parser != NULL) {
4912 diagnosticf("for token '%k'\n", (token_type_t)token_type);
4913 panic("trying to register multiple infix expression parsers for a "
4916 entry->infix_parser = parser;
4917 entry->infix_precedence = precedence;
4921 * Initialize the expression parsers.
4923 static void init_expression_parsers(void)
4925 memset(&expression_parsers, 0, sizeof(expression_parsers));
4927 register_infix_parser(parse_array_expression, '[', 30);
4928 register_infix_parser(parse_call_expression, '(', 30);
4929 register_infix_parser(parse_select_expression, '.', 30);
4930 register_infix_parser(parse_select_expression, T_MINUSGREATER, 30);
4931 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT,
4933 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT,
4936 register_infix_parser(parse_EXPR_BINARY_MUL, '*', 16);
4937 register_infix_parser(parse_EXPR_BINARY_DIV, '/', 16);
4938 register_infix_parser(parse_EXPR_BINARY_MOD, '%', 16);
4939 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, 16);
4940 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, 16);
4941 register_infix_parser(parse_EXPR_BINARY_ADD, '+', 15);
4942 register_infix_parser(parse_EXPR_BINARY_SUB, '-', 15);
4943 register_infix_parser(parse_EXPR_BINARY_LESS, '<', 14);
4944 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', 14);
4945 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, 14);
4946 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, 14);
4947 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, 13);
4948 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL,
4949 T_EXCLAMATIONMARKEQUAL, 13);
4950 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', 12);
4951 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', 11);
4952 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', 10);
4953 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, 9);
4954 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, 8);
4955 register_infix_parser(parse_conditional_expression, '?', 7);
4956 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', 2);
4957 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, 2);
4958 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, 2);
4959 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, 2);
4960 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, 2);
4961 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, 2);
4962 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN,
4963 T_LESSLESSEQUAL, 2);
4964 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN,
4965 T_GREATERGREATEREQUAL, 2);
4966 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN,
4968 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN,
4970 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN,
4973 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', 1);
4975 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-', 25);
4976 register_expression_parser(parse_EXPR_UNARY_PLUS, '+', 25);
4977 register_expression_parser(parse_EXPR_UNARY_NOT, '!', 25);
4978 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~', 25);
4979 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*', 25);
4980 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&', 25);
4981 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT,
4983 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT,
4985 register_expression_parser(parse_sizeof, T_sizeof, 25);
4986 register_expression_parser(parse_alignof, T___alignof__, 25);
4987 register_expression_parser(parse_extension, T___extension__, 25);
4988 register_expression_parser(parse_builtin_classify_type,
4989 T___builtin_classify_type, 25);
4993 * Parse a asm statement constraints specification.
4995 static asm_constraint_t *parse_asm_constraints(void)
4997 asm_constraint_t *result = NULL;
4998 asm_constraint_t *last = NULL;
5000 while(token.type == T_STRING_LITERAL || token.type == '[') {
5001 asm_constraint_t *constraint = allocate_ast_zero(sizeof(constraint[0]));
5002 memset(constraint, 0, sizeof(constraint[0]));
5004 if(token.type == '[') {
5006 if(token.type != T_IDENTIFIER) {
5007 parse_error_expected("while parsing asm constraint",
5011 constraint->symbol = token.v.symbol;
5016 constraint->constraints = parse_string_literals();
5018 constraint->expression = parse_expression();
5022 last->next = constraint;
5024 result = constraint;
5028 if(token.type != ',')
5037 * Parse a asm statement clobber specification.
5039 static asm_clobber_t *parse_asm_clobbers(void)
5041 asm_clobber_t *result = NULL;
5042 asm_clobber_t *last = NULL;
5044 while(token.type == T_STRING_LITERAL) {
5045 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
5046 clobber->clobber = parse_string_literals();
5049 last->next = clobber;
5055 if(token.type != ',')
5064 * Parse an asm statement.
5066 static statement_t *parse_asm_statement(void)
5070 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
5071 statement->base.source_position = token.source_position;
5073 asm_statement_t *asm_statement = &statement->asms;
5075 if(token.type == T_volatile) {
5077 asm_statement->is_volatile = true;
5081 asm_statement->asm_text = parse_string_literals();
5083 if(token.type != ':')
5087 asm_statement->inputs = parse_asm_constraints();
5088 if(token.type != ':')
5092 asm_statement->outputs = parse_asm_constraints();
5093 if(token.type != ':')
5097 asm_statement->clobbers = parse_asm_clobbers();
5106 * Parse a case statement.
5108 static statement_t *parse_case_statement(void)
5112 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
5114 statement->base.source_position = token.source_position;
5115 statement->case_label.expression = parse_expression();
5119 if (! is_constant_expression(statement->case_label.expression)) {
5120 errorf(statement->base.source_position,
5121 "case label does not reduce to an integer constant");
5123 /* TODO: check if the case label is already known */
5124 if (current_switch != NULL) {
5125 /* link all cases into the switch statement */
5126 if (current_switch->last_case == NULL) {
5127 current_switch->first_case =
5128 current_switch->last_case = &statement->case_label;
5130 current_switch->last_case->next = &statement->case_label;
5133 errorf(statement->base.source_position,
5134 "case label not within a switch statement");
5137 statement->case_label.statement = parse_statement();
5143 * Finds an existing default label of a switch statement.
5145 static case_label_statement_t *
5146 find_default_label(const switch_statement_t *statement)
5148 for (case_label_statement_t *label = statement->first_case;
5150 label = label->next) {
5151 if (label->expression == NULL)
5158 * Parse a default statement.
5160 static statement_t *parse_default_statement(void)
5164 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
5166 statement->base.source_position = token.source_position;
5169 if (current_switch != NULL) {
5170 const case_label_statement_t *def_label = find_default_label(current_switch);
5171 if (def_label != NULL) {
5172 errorf(HERE, "multiple default labels in one switch");
5173 errorf(def_label->base.source_position,
5174 "this is the first default label");
5176 /* link all cases into the switch statement */
5177 if (current_switch->last_case == NULL) {
5178 current_switch->first_case =
5179 current_switch->last_case = &statement->case_label;
5181 current_switch->last_case->next = &statement->case_label;
5185 errorf(statement->base.source_position,
5186 "'default' label not within a switch statement");
5188 statement->label.statement = parse_statement();
5194 * Return the declaration for a given label symbol or create a new one.
5196 static declaration_t *get_label(symbol_t *symbol)
5198 declaration_t *candidate = get_declaration(symbol, NAMESPACE_LABEL);
5199 assert(current_function != NULL);
5200 /* if we found a label in the same function, then we already created the
5202 if(candidate != NULL
5203 && candidate->parent_scope == ¤t_function->scope) {
5207 /* otherwise we need to create a new one */
5208 declaration_t *const declaration = allocate_declaration_zero();
5209 declaration->namespc = NAMESPACE_LABEL;
5210 declaration->symbol = symbol;
5212 label_push(declaration);
5218 * Parse a label statement.
5220 static statement_t *parse_label_statement(void)
5222 assert(token.type == T_IDENTIFIER);
5223 symbol_t *symbol = token.v.symbol;
5226 declaration_t *label = get_label(symbol);
5228 /* if source position is already set then the label is defined twice,
5229 * otherwise it was just mentioned in a goto so far */
5230 if(label->source_position.input_name != NULL) {
5231 errorf(HERE, "duplicate label '%Y'", symbol);
5232 errorf(label->source_position, "previous definition of '%Y' was here",
5235 label->source_position = token.source_position;
5238 statement_t *statement = allocate_statement_zero(STATEMENT_LABEL);
5240 statement->base.source_position = token.source_position;
5241 statement->label.label = label;
5245 if(token.type == '}') {
5246 /* TODO only warn? */
5247 errorf(HERE, "label at end of compound statement");
5250 if (token.type == ';') {
5251 /* eat an empty statement here, to avoid the warning about an empty
5252 * after a label. label:; is commonly used to have a label before
5256 statement->label.statement = parse_statement();
5260 /* remember the labels's in a list for later checking */
5261 if (label_last == NULL) {
5262 label_first = &statement->label;
5264 label_last->next = &statement->label;
5266 label_last = &statement->label;
5272 * Parse an if statement.
5274 static statement_t *parse_if(void)
5278 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
5279 statement->base.source_position = token.source_position;
5282 statement->ifs.condition = parse_expression();
5285 statement->ifs.true_statement = parse_statement();
5286 if(token.type == T_else) {
5288 statement->ifs.false_statement = parse_statement();
5295 * Parse a switch statement.
5297 static statement_t *parse_switch(void)
5301 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
5302 statement->base.source_position = token.source_position;
5305 expression_t *const expr = parse_expression();
5306 type_t * type = skip_typeref(expr->base.type);
5307 if (is_type_integer(type)) {
5308 type = promote_integer(type);
5309 } else if (is_type_valid(type)) {
5310 errorf(expr->base.source_position,
5311 "switch quantity is not an integer, but '%T'", type);
5312 type = type_error_type;
5314 statement->switchs.expression = create_implicit_cast(expr, type);
5317 switch_statement_t *rem = current_switch;
5318 current_switch = &statement->switchs;
5319 statement->switchs.body = parse_statement();
5320 current_switch = rem;
5322 if (warning.switch_default
5323 && find_default_label(&statement->switchs) == NULL) {
5324 warningf(statement->base.source_position, "switch has no default case");
5330 static statement_t *parse_loop_body(statement_t *const loop)
5332 statement_t *const rem = current_loop;
5333 current_loop = loop;
5335 statement_t *const body = parse_statement();
5342 * Parse a while statement.
5344 static statement_t *parse_while(void)
5348 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
5349 statement->base.source_position = token.source_position;
5352 statement->whiles.condition = parse_expression();
5355 statement->whiles.body = parse_loop_body(statement);
5361 * Parse a do statement.
5363 static statement_t *parse_do(void)
5367 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
5369 statement->base.source_position = token.source_position;
5371 statement->do_while.body = parse_loop_body(statement);
5375 statement->do_while.condition = parse_expression();
5383 * Parse a for statement.
5385 static statement_t *parse_for(void)
5389 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
5390 statement->base.source_position = token.source_position;
5394 int top = environment_top();
5395 scope_t *last_scope = scope;
5396 set_scope(&statement->fors.scope);
5398 if(token.type != ';') {
5399 if(is_declaration_specifier(&token, false)) {
5400 parse_declaration(record_declaration);
5402 statement->fors.initialisation = parse_expression();
5409 if(token.type != ';') {
5410 statement->fors.condition = parse_expression();
5413 if(token.type != ')') {
5414 statement->fors.step = parse_expression();
5417 statement->fors.body = parse_loop_body(statement);
5419 assert(scope == &statement->fors.scope);
5420 set_scope(last_scope);
5421 environment_pop_to(top);
5427 * Parse a goto statement.
5429 static statement_t *parse_goto(void)
5433 if(token.type != T_IDENTIFIER) {
5434 parse_error_expected("while parsing goto", T_IDENTIFIER, 0);
5438 symbol_t *symbol = token.v.symbol;
5441 declaration_t *label = get_label(symbol);
5443 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
5444 statement->base.source_position = token.source_position;
5446 statement->gotos.label = label;
5448 /* remember the goto's in a list for later checking */
5449 if (goto_last == NULL) {
5450 goto_first = &statement->gotos;
5452 goto_last->next = &statement->gotos;
5454 goto_last = &statement->gotos;
5462 * Parse a continue statement.
5464 static statement_t *parse_continue(void)
5466 statement_t *statement;
5467 if (current_loop == NULL) {
5468 errorf(HERE, "continue statement not within loop");
5471 statement = allocate_statement_zero(STATEMENT_CONTINUE);
5473 statement->base.source_position = token.source_position;
5483 * Parse a break statement.
5485 static statement_t *parse_break(void)
5487 statement_t *statement;
5488 if (current_switch == NULL && current_loop == NULL) {
5489 errorf(HERE, "break statement not within loop or switch");
5492 statement = allocate_statement_zero(STATEMENT_BREAK);
5494 statement->base.source_position = token.source_position;
5504 * Check if a given declaration represents a local variable.
5506 static bool is_local_var_declaration(const declaration_t *declaration) {
5507 switch ((storage_class_tag_t) declaration->storage_class) {
5508 case STORAGE_CLASS_NONE:
5509 case STORAGE_CLASS_AUTO:
5510 case STORAGE_CLASS_REGISTER: {
5511 const type_t *type = skip_typeref(declaration->type);
5512 if(is_type_function(type)) {
5524 * Check if a given declaration represents a variable.
5526 static bool is_var_declaration(const declaration_t *declaration) {
5527 switch ((storage_class_tag_t) declaration->storage_class) {
5528 case STORAGE_CLASS_NONE:
5529 case STORAGE_CLASS_EXTERN:
5530 case STORAGE_CLASS_STATIC:
5531 case STORAGE_CLASS_AUTO:
5532 case STORAGE_CLASS_REGISTER:
5533 case STORAGE_CLASS_THREAD:
5534 case STORAGE_CLASS_THREAD_EXTERN:
5535 case STORAGE_CLASS_THREAD_STATIC: {
5536 const type_t *type = skip_typeref(declaration->type);
5537 if(is_type_function(type)) {
5549 * Check if a given expression represents a local variable.
5551 static bool is_local_variable(const expression_t *expression)
5553 if (expression->base.kind != EXPR_REFERENCE) {
5556 const declaration_t *declaration = expression->reference.declaration;
5557 return is_local_var_declaration(declaration);
5561 * Check if a given expression represents a local variable and
5562 * return its declaration then, else return NULL.
5564 declaration_t *expr_is_variable(const expression_t *expression)
5566 if (expression->base.kind != EXPR_REFERENCE) {
5569 declaration_t *declaration = expression->reference.declaration;
5570 if (is_var_declaration(declaration))
5576 * Parse a return statement.
5578 static statement_t *parse_return(void)
5582 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
5583 statement->base.source_position = token.source_position;
5585 expression_t *return_value = NULL;
5586 if(token.type != ';') {
5587 return_value = parse_expression();
5591 const type_t *const func_type = current_function->type;
5592 assert(is_type_function(func_type));
5593 type_t *const return_type = skip_typeref(func_type->function.return_type);
5595 if(return_value != NULL) {
5596 type_t *return_value_type = skip_typeref(return_value->base.type);
5598 if(is_type_atomic(return_type, ATOMIC_TYPE_VOID)
5599 && !is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
5600 warningf(statement->base.source_position,
5601 "'return' with a value, in function returning void");
5602 return_value = NULL;
5604 type_t *const res_type = semantic_assign(return_type,
5605 return_value, "'return'");
5606 if (res_type == NULL) {
5607 errorf(statement->base.source_position,
5608 "cannot return something of type '%T' in function returning '%T'",
5609 return_value->base.type, return_type);
5611 return_value = create_implicit_cast(return_value, res_type);
5614 /* check for returning address of a local var */
5615 if (return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
5616 const expression_t *expression = return_value->unary.value;
5617 if (is_local_variable(expression)) {
5618 warningf(statement->base.source_position,
5619 "function returns address of local variable");
5623 if(!is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
5624 warningf(statement->base.source_position,
5625 "'return' without value, in function returning non-void");
5628 statement->returns.value = return_value;
5634 * Parse a declaration statement.
5636 static statement_t *parse_declaration_statement(void)
5638 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
5640 statement->base.source_position = token.source_position;
5642 declaration_t *before = last_declaration;
5643 parse_declaration(record_declaration);
5645 if(before == NULL) {
5646 statement->declaration.declarations_begin = scope->declarations;
5648 statement->declaration.declarations_begin = before->next;
5650 statement->declaration.declarations_end = last_declaration;
5656 * Parse an expression statement, ie. expr ';'.
5658 static statement_t *parse_expression_statement(void)
5660 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
5662 statement->base.source_position = token.source_position;
5663 expression_t *const expr = parse_expression();
5664 statement->expression.expression = expr;
5666 if (warning.unused_value && !expression_has_effect(expr)) {
5667 warningf(expr->base.source_position, "statement has no effect");
5676 * Parse a statement.
5678 static statement_t *parse_statement(void)
5680 statement_t *statement = NULL;
5682 /* declaration or statement */
5683 switch(token.type) {
5685 statement = parse_asm_statement();
5689 statement = parse_case_statement();
5693 statement = parse_default_statement();
5697 statement = parse_compound_statement();
5701 statement = parse_if();
5705 statement = parse_switch();
5709 statement = parse_while();
5713 statement = parse_do();
5717 statement = parse_for();
5721 statement = parse_goto();
5725 statement = parse_continue();
5729 statement = parse_break();
5733 statement = parse_return();
5737 if (warning.empty_statement) {
5738 warningf(HERE, "statement is empty");
5745 if(look_ahead(1)->type == ':') {
5746 statement = parse_label_statement();
5750 if(is_typedef_symbol(token.v.symbol)) {
5751 statement = parse_declaration_statement();
5755 statement = parse_expression_statement();
5758 case T___extension__:
5759 /* this can be a prefix to a declaration or an expression statement */
5760 /* we simply eat it now and parse the rest with tail recursion */
5763 } while(token.type == T___extension__);
5764 statement = parse_statement();
5768 statement = parse_declaration_statement();
5772 statement = parse_expression_statement();
5776 assert(statement == NULL
5777 || statement->base.source_position.input_name != NULL);
5783 * Parse a compound statement.
5785 static statement_t *parse_compound_statement(void)
5787 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
5789 statement->base.source_position = token.source_position;
5793 int top = environment_top();
5794 scope_t *last_scope = scope;
5795 set_scope(&statement->compound.scope);
5797 statement_t *last_statement = NULL;
5799 while(token.type != '}' && token.type != T_EOF) {
5800 statement_t *sub_statement = parse_statement();
5801 if(sub_statement == NULL)
5804 if(last_statement != NULL) {
5805 last_statement->base.next = sub_statement;
5807 statement->compound.statements = sub_statement;
5810 while(sub_statement->base.next != NULL)
5811 sub_statement = sub_statement->base.next;
5813 last_statement = sub_statement;
5816 if(token.type == '}') {
5819 errorf(statement->base.source_position,
5820 "end of file while looking for closing '}'");
5823 assert(scope == &statement->compound.scope);
5824 set_scope(last_scope);
5825 environment_pop_to(top);
5831 * Initialize builtin types.
5833 static void initialize_builtin_types(void)
5835 type_intmax_t = make_global_typedef("__intmax_t__", type_long_long);
5836 type_size_t = make_global_typedef("__SIZE_TYPE__", type_unsigned_long);
5837 type_ssize_t = make_global_typedef("__SSIZE_TYPE__", type_long);
5838 type_ptrdiff_t = make_global_typedef("__PTRDIFF_TYPE__", type_long);
5839 type_uintmax_t = make_global_typedef("__uintmax_t__", type_unsigned_long_long);
5840 type_uptrdiff_t = make_global_typedef("__UPTRDIFF_TYPE__", type_unsigned_long);
5841 type_wchar_t = make_global_typedef("__WCHAR_TYPE__", type_int);
5842 type_wint_t = make_global_typedef("__WINT_TYPE__", type_int);
5844 type_intmax_t_ptr = make_pointer_type(type_intmax_t, TYPE_QUALIFIER_NONE);
5845 type_ptrdiff_t_ptr = make_pointer_type(type_ptrdiff_t, TYPE_QUALIFIER_NONE);
5846 type_ssize_t_ptr = make_pointer_type(type_ssize_t, TYPE_QUALIFIER_NONE);
5847 type_wchar_t_ptr = make_pointer_type(type_wchar_t, TYPE_QUALIFIER_NONE);
5851 * Check for unused global static functions and variables
5853 static void check_unused_globals(void)
5855 if (!warning.unused_function && !warning.unused_variable)
5858 for (const declaration_t *decl = global_scope->declarations; decl != NULL; decl = decl->next) {
5859 if (decl->used || decl->storage_class != STORAGE_CLASS_STATIC)
5862 type_t *const type = decl->type;
5864 if (is_type_function(skip_typeref(type))) {
5865 if (!warning.unused_function || decl->is_inline)
5868 s = (decl->init.statement != NULL ? "defined" : "declared");
5870 if (!warning.unused_variable)
5876 warningf(decl->source_position, "'%#T' %s but not used",
5877 type, decl->symbol, s);
5882 * Parse a translation unit.
5884 static translation_unit_t *parse_translation_unit(void)
5886 translation_unit_t *unit = allocate_ast_zero(sizeof(unit[0]));
5888 assert(global_scope == NULL);
5889 global_scope = &unit->scope;
5891 assert(scope == NULL);
5892 set_scope(&unit->scope);
5894 initialize_builtin_types();
5896 while(token.type != T_EOF) {
5897 if (token.type == ';') {
5898 /* TODO error in strict mode */
5899 warningf(HERE, "stray ';' outside of function");
5902 parse_external_declaration();
5906 assert(scope == &unit->scope);
5908 last_declaration = NULL;
5910 assert(global_scope == &unit->scope);
5911 check_unused_globals();
5912 global_scope = NULL;
5920 * @return the translation unit or NULL if errors occurred.
5922 translation_unit_t *parse(void)
5924 environment_stack = NEW_ARR_F(stack_entry_t, 0);
5925 label_stack = NEW_ARR_F(stack_entry_t, 0);
5926 diagnostic_count = 0;
5930 type_set_output(stderr);
5931 ast_set_output(stderr);
5933 lookahead_bufpos = 0;
5934 for(int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
5937 translation_unit_t *unit = parse_translation_unit();
5939 DEL_ARR_F(environment_stack);
5940 DEL_ARR_F(label_stack);
5949 * Initialize the parser.
5951 void init_parser(void)
5953 init_expression_parsers();
5954 obstack_init(&temp_obst);
5956 symbol_t *const va_list_sym = symbol_table_insert("__builtin_va_list");
5957 type_valist = create_builtin_type(va_list_sym, type_void_ptr);
5961 * Terminate the parser.
5963 void exit_parser(void)
5965 obstack_free(&temp_obst, NULL);