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 declared_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_CHAR_CONST] = sizeof(const_expression_t),
202 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
203 [EXPR_WIDE_STRING_LITERAL] = sizeof(wide_string_literal_expression_t),
204 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
205 [EXPR_CALL] = sizeof(call_expression_t),
206 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
207 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
208 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
209 [EXPR_SELECT] = sizeof(select_expression_t),
210 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
211 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
212 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
213 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
214 [EXPR_FUNCTION] = sizeof(string_literal_expression_t),
215 [EXPR_PRETTY_FUNCTION] = sizeof(string_literal_expression_t),
216 [EXPR_BUILTIN_SYMBOL] = sizeof(builtin_symbol_expression_t),
217 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
218 [EXPR_BUILTIN_PREFETCH] = sizeof(builtin_prefetch_expression_t),
219 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
220 [EXPR_VA_START] = sizeof(va_start_expression_t),
221 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
222 [EXPR_STATEMENT] = sizeof(statement_expression_t),
224 if(kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
225 return sizes[EXPR_UNARY_FIRST];
227 if(kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
228 return sizes[EXPR_BINARY_FIRST];
230 assert(kind <= sizeof(sizes) / sizeof(sizes[0]));
231 assert(sizes[kind] != 0);
236 * Allocate an expression node of given kind and initialize all
239 static expression_t *allocate_expression_zero(expression_kind_t kind)
241 size_t size = get_expression_struct_size(kind);
242 expression_t *res = allocate_ast_zero(size);
244 res->base.kind = kind;
245 res->base.type = type_error_type;
250 * Returns the size of a type node.
252 * @param kind the type kind
254 static size_t get_type_struct_size(type_kind_t kind)
256 static const size_t sizes[] = {
257 [TYPE_ATOMIC] = sizeof(atomic_type_t),
258 [TYPE_BITFIELD] = sizeof(bitfield_type_t),
259 [TYPE_COMPOUND_STRUCT] = sizeof(compound_type_t),
260 [TYPE_COMPOUND_UNION] = sizeof(compound_type_t),
261 [TYPE_ENUM] = sizeof(enum_type_t),
262 [TYPE_FUNCTION] = sizeof(function_type_t),
263 [TYPE_POINTER] = sizeof(pointer_type_t),
264 [TYPE_ARRAY] = sizeof(array_type_t),
265 [TYPE_BUILTIN] = sizeof(builtin_type_t),
266 [TYPE_TYPEDEF] = sizeof(typedef_type_t),
267 [TYPE_TYPEOF] = sizeof(typeof_type_t),
269 assert(sizeof(sizes) / sizeof(sizes[0]) == (int) TYPE_TYPEOF + 1);
270 assert(kind <= TYPE_TYPEOF);
271 assert(sizes[kind] != 0);
276 * Allocate a type node of given kind and initialize all
279 static type_t *allocate_type_zero(type_kind_t kind, source_position_t source_position)
281 size_t size = get_type_struct_size(kind);
282 type_t *res = obstack_alloc(type_obst, size);
283 memset(res, 0, size);
285 res->base.kind = kind;
286 res->base.source_position = source_position;
291 * Returns the size of an initializer node.
293 * @param kind the initializer kind
295 static size_t get_initializer_size(initializer_kind_t kind)
297 static const size_t sizes[] = {
298 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
299 [INITIALIZER_STRING] = sizeof(initializer_string_t),
300 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
301 [INITIALIZER_LIST] = sizeof(initializer_list_t),
302 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
304 assert(kind < sizeof(sizes) / sizeof(*sizes));
305 assert(sizes[kind] != 0);
310 * Allocate an initializer node of given kind and initialize all
313 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
315 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
322 * Free a type from the type obstack.
324 static void free_type(void *type)
326 obstack_free(type_obst, type);
330 * Returns the index of the top element of the environment stack.
332 static size_t environment_top(void)
334 return ARR_LEN(environment_stack);
338 * Returns the index of the top element of the label stack.
340 static size_t label_top(void)
342 return ARR_LEN(label_stack);
347 * Return the next token.
349 static inline void next_token(void)
351 token = lookahead_buffer[lookahead_bufpos];
352 lookahead_buffer[lookahead_bufpos] = lexer_token;
355 lookahead_bufpos = (lookahead_bufpos+1) % MAX_LOOKAHEAD;
358 print_token(stderr, &token);
359 fprintf(stderr, "\n");
364 * Return the next token with a given lookahead.
366 static inline const token_t *look_ahead(int num)
368 assert(num > 0 && num <= MAX_LOOKAHEAD);
369 int pos = (lookahead_bufpos+num-1) % MAX_LOOKAHEAD;
370 return &lookahead_buffer[pos];
373 #define eat(token_type) do { assert(token.type == token_type); next_token(); } while(0)
376 * Report a parse error because an expected token was not found.
378 static void parse_error_expected(const char *message, ...)
380 if(message != NULL) {
381 errorf(HERE, "%s", message);
384 va_start(ap, message);
385 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
390 * Report a type error.
392 static void type_error(const char *msg, const source_position_t source_position,
395 errorf(source_position, "%s, but found type '%T'", msg, type);
399 * Report an incompatible type.
401 static void type_error_incompatible(const char *msg,
402 const source_position_t source_position, type_t *type1, type_t *type2)
404 errorf(source_position, "%s, incompatible types: '%T' - '%T'", msg, type1, type2);
408 * Eat an complete block, ie. '{ ... }'.
410 static void eat_block(void)
412 if(token.type == '{')
415 while(token.type != '}') {
416 if(token.type == T_EOF)
418 if(token.type == '{') {
428 * Eat a statement until an ';' token.
430 static void eat_statement(void)
432 while(token.type != ';') {
433 if(token.type == T_EOF)
435 if(token.type == '}')
437 if(token.type == '{') {
447 * Eat a parenthesed term, ie. '( ... )'.
449 static void eat_paren(void)
451 if(token.type == '(')
454 while(token.type != ')') {
455 if(token.type == T_EOF)
457 if(token.type == ')' || token.type == ';' || token.type == '}') {
460 if(token.type == '(') {
464 if(token.type == '{') {
473 #define expect(expected) \
475 if(UNLIKELY(token.type != (expected))) { \
476 parse_error_expected(NULL, (expected), 0); \
483 #define expect_block(expected) \
485 if(UNLIKELY(token.type != (expected))) { \
486 parse_error_expected(NULL, (expected), 0); \
493 #define expect_void(expected) \
495 if(UNLIKELY(token.type != (expected))) { \
496 parse_error_expected(NULL, (expected), 0); \
503 static void set_scope(scope_t *new_scope)
506 scope->last_declaration = last_declaration;
510 last_declaration = new_scope->last_declaration;
514 * Search a symbol in a given namespace and returns its declaration or
515 * NULL if this symbol was not found.
517 static declaration_t *get_declaration(const symbol_t *const symbol, const namespace_t namespc)
519 declaration_t *declaration = symbol->declaration;
520 for( ; declaration != NULL; declaration = declaration->symbol_next) {
521 if(declaration->namespc == namespc)
529 * pushs an environment_entry on the environment stack and links the
530 * corresponding symbol to the new entry
532 static void stack_push(stack_entry_t **stack_ptr, declaration_t *declaration)
534 symbol_t *symbol = declaration->symbol;
535 namespace_t namespc = (namespace_t) declaration->namespc;
537 /* replace/add declaration into declaration list of the symbol */
538 declaration_t *iter = symbol->declaration;
540 symbol->declaration = declaration;
542 declaration_t *iter_last = NULL;
543 for( ; iter != NULL; iter_last = iter, iter = iter->symbol_next) {
544 /* replace an entry? */
545 if(iter->namespc == namespc) {
546 if(iter_last == NULL) {
547 symbol->declaration = declaration;
549 iter_last->symbol_next = declaration;
551 declaration->symbol_next = iter->symbol_next;
556 assert(iter_last->symbol_next == NULL);
557 iter_last->symbol_next = declaration;
561 /* remember old declaration */
563 entry.symbol = symbol;
564 entry.old_declaration = iter;
565 entry.namespc = (unsigned short) namespc;
566 ARR_APP1(stack_entry_t, *stack_ptr, entry);
569 static void environment_push(declaration_t *declaration)
571 assert(declaration->source_position.input_name != NULL);
572 assert(declaration->parent_scope != NULL);
573 stack_push(&environment_stack, declaration);
576 static void label_push(declaration_t *declaration)
578 declaration->parent_scope = ¤t_function->scope;
579 stack_push(&label_stack, declaration);
583 * pops symbols from the environment stack until @p new_top is the top element
585 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
587 stack_entry_t *stack = *stack_ptr;
588 size_t top = ARR_LEN(stack);
591 assert(new_top <= top);
595 for(i = top; i > new_top; --i) {
596 stack_entry_t *entry = &stack[i - 1];
598 declaration_t *old_declaration = entry->old_declaration;
599 symbol_t *symbol = entry->symbol;
600 namespace_t namespc = (namespace_t)entry->namespc;
602 /* replace/remove declaration */
603 declaration_t *declaration = symbol->declaration;
604 assert(declaration != NULL);
605 if(declaration->namespc == namespc) {
606 if(old_declaration == NULL) {
607 symbol->declaration = declaration->symbol_next;
609 symbol->declaration = old_declaration;
612 declaration_t *iter_last = declaration;
613 declaration_t *iter = declaration->symbol_next;
614 for( ; iter != NULL; iter_last = iter, iter = iter->symbol_next) {
615 /* replace an entry? */
616 if(iter->namespc == namespc) {
617 assert(iter_last != NULL);
618 iter_last->symbol_next = old_declaration;
619 if(old_declaration != NULL) {
620 old_declaration->symbol_next = iter->symbol_next;
625 assert(iter != NULL);
629 ARR_SHRINKLEN(*stack_ptr, (int) new_top);
632 static void environment_pop_to(size_t new_top)
634 stack_pop_to(&environment_stack, new_top);
637 static void label_pop_to(size_t new_top)
639 stack_pop_to(&label_stack, new_top);
643 static int get_rank(const type_t *type)
645 assert(!is_typeref(type));
646 /* The C-standard allows promoting to int or unsigned int (see § 7.2.2
647 * and esp. footnote 108). However we can't fold constants (yet), so we
648 * can't decide whether unsigned int is possible, while int always works.
649 * (unsigned int would be preferable when possible... for stuff like
650 * struct { enum { ... } bla : 4; } ) */
651 if(type->kind == TYPE_ENUM)
652 return ATOMIC_TYPE_INT;
654 assert(type->kind == TYPE_ATOMIC);
655 return type->atomic.akind;
658 static type_t *promote_integer(type_t *type)
660 if(type->kind == TYPE_BITFIELD)
661 type = type->bitfield.base;
663 if(get_rank(type) < ATOMIC_TYPE_INT)
670 * Create a cast expression.
672 * @param expression the expression to cast
673 * @param dest_type the destination type
675 static expression_t *create_cast_expression(expression_t *expression,
678 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST_IMPLICIT);
680 cast->unary.value = expression;
681 cast->base.type = dest_type;
687 * Check if a given expression represents the 0 pointer constant.
689 static bool is_null_pointer_constant(const expression_t *expression)
691 /* skip void* cast */
692 if(expression->kind == EXPR_UNARY_CAST
693 || expression->kind == EXPR_UNARY_CAST_IMPLICIT) {
694 expression = expression->unary.value;
697 /* TODO: not correct yet, should be any constant integer expression
698 * which evaluates to 0 */
699 if (expression->kind != EXPR_CONST)
702 type_t *const type = skip_typeref(expression->base.type);
703 if (!is_type_integer(type))
706 return expression->conste.v.int_value == 0;
710 * Create an implicit cast expression.
712 * @param expression the expression to cast
713 * @param dest_type the destination type
715 static expression_t *create_implicit_cast(expression_t *expression,
718 type_t *const source_type = expression->base.type;
720 if (source_type == dest_type)
723 return create_cast_expression(expression, dest_type);
726 /** Implements the rules from § 6.5.16.1 */
727 static type_t *semantic_assign(type_t *orig_type_left,
728 const expression_t *const right,
731 type_t *const orig_type_right = right->base.type;
732 type_t *const type_left = skip_typeref(orig_type_left);
733 type_t *const type_right = skip_typeref(orig_type_right);
735 if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
736 (is_type_pointer(type_left) && is_null_pointer_constant(right)) ||
737 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
738 && is_type_pointer(type_right))) {
739 return orig_type_left;
742 if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
743 type_t *points_to_left = skip_typeref(type_left->pointer.points_to);
744 type_t *points_to_right = skip_typeref(type_right->pointer.points_to);
746 /* the left type has all qualifiers from the right type */
747 unsigned missing_qualifiers
748 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
749 if(missing_qualifiers != 0) {
750 errorf(HERE, "destination type '%T' in %s from type '%T' lacks qualifiers '%Q' in pointed-to type", type_left, context, type_right, missing_qualifiers);
751 return orig_type_left;
754 points_to_left = get_unqualified_type(points_to_left);
755 points_to_right = get_unqualified_type(points_to_right);
757 if (is_type_atomic(points_to_left, ATOMIC_TYPE_VOID) ||
758 is_type_atomic(points_to_right, ATOMIC_TYPE_VOID)) {
759 return orig_type_left;
762 if (!types_compatible(points_to_left, points_to_right)) {
763 warningf(right->base.source_position,
764 "destination type '%T' in %s is incompatible with '%E' of type '%T'",
765 orig_type_left, context, right, orig_type_right);
768 return orig_type_left;
771 if ((is_type_compound(type_left) && is_type_compound(type_right))
772 || (is_type_builtin(type_left) && is_type_builtin(type_right))) {
773 type_t *const unqual_type_left = get_unqualified_type(type_left);
774 type_t *const unqual_type_right = get_unqualified_type(type_right);
775 if (types_compatible(unqual_type_left, unqual_type_right)) {
776 return orig_type_left;
780 if (!is_type_valid(type_left))
783 if (!is_type_valid(type_right))
784 return orig_type_right;
789 static expression_t *parse_constant_expression(void)
791 /* start parsing at precedence 7 (conditional expression) */
792 expression_t *result = parse_sub_expression(7);
794 if(!is_constant_expression(result)) {
795 errorf(result->base.source_position, "expression '%E' is not constant\n", result);
801 static expression_t *parse_assignment_expression(void)
803 /* start parsing at precedence 2 (assignment expression) */
804 return parse_sub_expression(2);
807 static type_t *make_global_typedef(const char *name, type_t *type)
809 symbol_t *const symbol = symbol_table_insert(name);
811 declaration_t *const declaration = allocate_declaration_zero();
812 declaration->namespc = NAMESPACE_NORMAL;
813 declaration->storage_class = STORAGE_CLASS_TYPEDEF;
814 declaration->declared_storage_class = STORAGE_CLASS_TYPEDEF;
815 declaration->type = type;
816 declaration->symbol = symbol;
817 declaration->source_position = builtin_source_position;
819 record_declaration(declaration);
821 type_t *typedef_type = allocate_type_zero(TYPE_TYPEDEF, builtin_source_position);
822 typedef_type->typedeft.declaration = declaration;
827 static string_t parse_string_literals(void)
829 assert(token.type == T_STRING_LITERAL);
830 string_t result = token.v.string;
834 while (token.type == T_STRING_LITERAL) {
835 result = concat_strings(&result, &token.v.string);
842 static void parse_attributes(void)
846 case T___attribute__: {
854 errorf(HERE, "EOF while parsing attribute");
873 if(token.type != T_STRING_LITERAL) {
874 parse_error_expected("while parsing assembler attribute",
879 parse_string_literals();
884 goto attributes_finished;
892 static designator_t *parse_designation(void)
894 designator_t *result = NULL;
895 designator_t *last = NULL;
898 designator_t *designator;
901 designator = allocate_ast_zero(sizeof(designator[0]));
902 designator->source_position = token.source_position;
904 designator->array_index = parse_constant_expression();
908 designator = allocate_ast_zero(sizeof(designator[0]));
909 designator->source_position = token.source_position;
911 if(token.type != T_IDENTIFIER) {
912 parse_error_expected("while parsing designator",
916 designator->symbol = token.v.symbol;
924 assert(designator != NULL);
926 last->next = designator;
934 static initializer_t *initializer_from_string(array_type_t *type,
935 const string_t *const string)
937 /* TODO: check len vs. size of array type */
940 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
941 initializer->string.string = *string;
946 static initializer_t *initializer_from_wide_string(array_type_t *const type,
947 wide_string_t *const string)
949 /* TODO: check len vs. size of array type */
952 initializer_t *const initializer =
953 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
954 initializer->wide_string.string = *string;
959 static initializer_t *initializer_from_expression(type_t *orig_type,
960 expression_t *expression)
962 /* TODO check that expression is a constant expression */
964 /* § 6.7.8.14/15 char array may be initialized by string literals */
965 type_t *type = skip_typeref(orig_type);
966 type_t *expr_type_orig = expression->base.type;
967 type_t *expr_type = skip_typeref(expr_type_orig);
968 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
969 array_type_t *const array_type = &type->array;
970 type_t *const element_type = skip_typeref(array_type->element_type);
972 if (element_type->kind == TYPE_ATOMIC) {
973 atomic_type_kind_t akind = element_type->atomic.akind;
974 switch (expression->kind) {
975 case EXPR_STRING_LITERAL:
976 if (akind == ATOMIC_TYPE_CHAR
977 || akind == ATOMIC_TYPE_SCHAR
978 || akind == ATOMIC_TYPE_UCHAR) {
979 return initializer_from_string(array_type,
980 &expression->string.value);
983 case EXPR_WIDE_STRING_LITERAL: {
984 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
985 if (get_unqualified_type(element_type) == bare_wchar_type) {
986 return initializer_from_wide_string(array_type,
987 &expression->wide_string.value);
997 type_t *const res_type = semantic_assign(type, expression, "initializer");
998 if (res_type == NULL)
1001 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
1002 result->value.value = create_implicit_cast(expression, res_type);
1007 static bool is_initializer_constant(const expression_t *expression)
1009 return is_constant_expression(expression)
1010 || is_address_constant(expression);
1013 static initializer_t *parse_scalar_initializer(type_t *type,
1014 bool must_be_constant)
1016 /* there might be extra {} hierarchies */
1018 while(token.type == '{') {
1021 warningf(HERE, "extra curly braces around scalar initializer");
1026 expression_t *expression = parse_assignment_expression();
1027 if(must_be_constant && !is_initializer_constant(expression)) {
1028 errorf(expression->base.source_position,
1029 "Initialisation expression '%E' is not constant\n",
1033 initializer_t *initializer = initializer_from_expression(type, expression);
1035 if(initializer == NULL) {
1036 errorf(expression->base.source_position,
1037 "expression '%E' doesn't match expected type '%T'",
1043 bool additional_warning_displayed = false;
1045 if(token.type == ',') {
1048 if(token.type != '}') {
1049 if(!additional_warning_displayed) {
1050 warningf(HERE, "additional elements in scalar initializer");
1051 additional_warning_displayed = true;
1061 typedef struct type_path_entry_t type_path_entry_t;
1062 struct type_path_entry_t {
1066 declaration_t *compound_entry;
1070 typedef struct type_path_t type_path_t;
1071 struct type_path_t {
1072 type_path_entry_t *path;
1073 type_t *top_type; /**< type of the element the path points */
1074 size_t max_index; /**< largest index in outermost array */
1078 static __attribute__((unused)) void debug_print_type_path(
1079 const type_path_t *path)
1081 size_t len = ARR_LEN(path->path);
1084 fprintf(stderr, "invalid path");
1088 for(size_t i = 0; i < len; ++i) {
1089 const type_path_entry_t *entry = & path->path[i];
1091 type_t *type = skip_typeref(entry->type);
1092 if(is_type_compound(type)) {
1093 fprintf(stderr, ".%s", entry->v.compound_entry->symbol->string);
1094 } else if(is_type_array(type)) {
1095 fprintf(stderr, "[%u]", entry->v.index);
1097 fprintf(stderr, "-INVALID-");
1100 fprintf(stderr, " (");
1101 print_type(path->top_type);
1102 fprintf(stderr, ")");
1105 static type_path_entry_t *get_type_path_top(const type_path_t *path)
1107 size_t len = ARR_LEN(path->path);
1109 return & path->path[len-1];
1112 static type_path_entry_t *append_to_type_path(type_path_t *path)
1114 size_t len = ARR_LEN(path->path);
1115 ARR_RESIZE(type_path_entry_t, path->path, len+1);
1117 type_path_entry_t *result = & path->path[len];
1118 memset(result, 0, sizeof(result[0]));
1122 static void descend_into_subtype(type_path_t *path)
1124 type_t *orig_top_type = path->top_type;
1125 type_t *top_type = skip_typeref(orig_top_type);
1127 assert(is_type_compound(top_type) || is_type_array(top_type));
1129 type_path_entry_t *top = append_to_type_path(path);
1130 top->type = top_type;
1132 if(is_type_compound(top_type)) {
1133 declaration_t *declaration = top_type->compound.declaration;
1134 declaration_t *entry = declaration->scope.declarations;
1136 top->v.compound_entry = entry;
1137 path->top_type = entry->type;
1139 assert(is_type_array(top_type));
1142 path->top_type = top_type->array.element_type;
1146 static void ascend_from_subtype(type_path_t *path)
1148 type_path_entry_t *top = get_type_path_top(path);
1150 path->top_type = top->type;
1152 size_t len = ARR_LEN(path->path);
1153 ARR_RESIZE(type_path_entry_t, path->path, len-1);
1156 static void ascend_to(type_path_t *path, size_t top_path_level)
1158 size_t len = ARR_LEN(path->path);
1159 assert(len >= top_path_level);
1161 while(len > top_path_level) {
1162 ascend_from_subtype(path);
1163 len = ARR_LEN(path->path);
1167 static bool walk_designator(type_path_t *path, const designator_t *designator,
1168 bool used_in_offsetof)
1170 for( ; designator != NULL; designator = designator->next) {
1171 type_path_entry_t *top = get_type_path_top(path);
1172 type_t *orig_type = top->type;
1174 type_t *type = skip_typeref(orig_type);
1176 if(designator->symbol != NULL) {
1177 symbol_t *symbol = designator->symbol;
1178 if(!is_type_compound(type)) {
1179 if(is_type_valid(type)) {
1180 errorf(designator->source_position,
1181 "'.%Y' designator used for non-compound type '%T'",
1187 declaration_t *declaration = type->compound.declaration;
1188 declaration_t *iter = declaration->scope.declarations;
1189 for( ; iter != NULL; iter = iter->next) {
1190 if(iter->symbol == symbol) {
1195 errorf(designator->source_position,
1196 "'%T' has no member named '%Y'", orig_type, symbol);
1199 if(used_in_offsetof) {
1200 type_t *real_type = skip_typeref(iter->type);
1201 if(real_type->kind == TYPE_BITFIELD) {
1202 errorf(designator->source_position,
1203 "offsetof designator '%Y' may not specify bitfield",
1209 top->type = orig_type;
1210 top->v.compound_entry = iter;
1211 orig_type = iter->type;
1213 expression_t *array_index = designator->array_index;
1214 assert(designator->array_index != NULL);
1216 if(!is_type_array(type)) {
1217 if(is_type_valid(type)) {
1218 errorf(designator->source_position,
1219 "[%E] designator used for non-array type '%T'",
1220 array_index, orig_type);
1224 if(!is_type_valid(array_index->base.type)) {
1228 long index = fold_constant(array_index);
1229 if(!used_in_offsetof) {
1231 errorf(designator->source_position,
1232 "array index [%E] must be positive", array_index);
1235 if(type->array.size_constant == true) {
1236 long array_size = type->array.size;
1237 if(index >= array_size) {
1238 errorf(designator->source_position,
1239 "designator [%E] (%d) exceeds array size %d",
1240 array_index, index, array_size);
1246 top->type = orig_type;
1247 top->v.index = (size_t) index;
1248 orig_type = type->array.element_type;
1250 path->top_type = orig_type;
1252 if(designator->next != NULL) {
1253 descend_into_subtype(path);
1257 path->invalid = false;
1264 static void advance_current_object(type_path_t *path, size_t top_path_level)
1269 type_path_entry_t *top = get_type_path_top(path);
1271 type_t *type = skip_typeref(top->type);
1272 if(is_type_union(type)) {
1273 /* in unions only the first element is initialized */
1274 top->v.compound_entry = NULL;
1275 } else if(is_type_struct(type)) {
1276 declaration_t *entry = top->v.compound_entry;
1278 entry = entry->next;
1279 top->v.compound_entry = entry;
1281 path->top_type = entry->type;
1285 assert(is_type_array(type));
1289 if(!type->array.size_constant || top->v.index < type->array.size) {
1294 /* we're past the last member of the current sub-aggregate, try if we
1295 * can ascend in the type hierarchy and continue with another subobject */
1296 size_t len = ARR_LEN(path->path);
1298 if(len > top_path_level) {
1299 ascend_from_subtype(path);
1300 advance_current_object(path, top_path_level);
1302 path->invalid = true;
1306 static void skip_initializers(void)
1308 if(token.type == '{')
1311 while(token.type != '}') {
1312 if(token.type == T_EOF)
1314 if(token.type == '{') {
1322 static initializer_t *parse_sub_initializer(type_path_t *path,
1323 type_t *outer_type, size_t top_path_level, bool must_be_constant)
1325 type_t *orig_type = path->top_type;
1326 type_t *type = skip_typeref(orig_type);
1328 /* we can't do usefull stuff if we didn't even parse the type. Skip the
1329 * initializers in this case. */
1330 if(!is_type_valid(type)) {
1331 skip_initializers();
1335 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
1338 designator_t *designator = NULL;
1339 if(token.type == '.' || token.type == '[') {
1340 designator = parse_designation();
1342 /* reset path to toplevel, evaluate designator from there */
1343 ascend_to(path, top_path_level);
1344 if(!walk_designator(path, designator, false)) {
1345 /* can't continue after designation error */
1349 initializer_t *designator_initializer
1350 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
1351 designator_initializer->designator.designator = designator;
1352 ARR_APP1(initializer_t*, initializers, designator_initializer);
1357 if(token.type == '{') {
1358 if(is_type_scalar(type)) {
1359 sub = parse_scalar_initializer(type, must_be_constant);
1362 descend_into_subtype(path);
1364 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
1367 ascend_from_subtype(path);
1372 /* must be an expression */
1373 expression_t *expression = parse_assignment_expression();
1375 if(must_be_constant && !is_initializer_constant(expression)) {
1376 errorf(expression->base.source_position,
1377 "Initialisation expression '%E' is not constant\n",
1381 /* handle { "string" } special case */
1382 if((expression->kind == EXPR_STRING_LITERAL
1383 || expression->kind == EXPR_WIDE_STRING_LITERAL)
1384 && outer_type != NULL) {
1385 sub = initializer_from_expression(outer_type, expression);
1387 if(token.type == ',') {
1390 if(token.type != '}') {
1391 warningf(HERE, "excessive elements in initializer for type '%T'",
1394 /* TODO: eat , ... */
1399 /* descend into subtypes until expression matches type */
1401 orig_type = path->top_type;
1402 type = skip_typeref(orig_type);
1404 sub = initializer_from_expression(orig_type, expression);
1408 if(!is_type_valid(type)) {
1411 if(is_type_scalar(type)) {
1412 errorf(expression->base.source_position,
1413 "expression '%E' doesn't match expected type '%T'",
1414 expression, orig_type);
1418 descend_into_subtype(path);
1422 /* update largest index of top array */
1423 const type_path_entry_t *first = &path->path[0];
1424 type_t *first_type = first->type;
1425 first_type = skip_typeref(first_type);
1426 if(is_type_array(first_type)) {
1427 size_t index = first->v.index;
1428 if(index > path->max_index)
1429 path->max_index = index;
1432 /* append to initializers list */
1433 ARR_APP1(initializer_t*, initializers, sub);
1435 if(token.type == '}') {
1439 if(token.type == '}') {
1443 advance_current_object(path, top_path_level);
1444 orig_type = path->top_type;
1445 type = skip_typeref(orig_type);
1448 size_t len = ARR_LEN(initializers);
1449 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
1450 initializer_t *result = allocate_ast_zero(size);
1451 result->kind = INITIALIZER_LIST;
1452 result->list.len = len;
1453 memcpy(&result->list.initializers, initializers,
1454 len * sizeof(initializers[0]));
1456 ascend_to(path, top_path_level);
1461 skip_initializers();
1462 DEL_ARR_F(initializers);
1463 ascend_to(path, top_path_level);
1467 typedef struct parse_initializer_env_t {
1468 type_t *type; /* the type of the initializer. In case of an
1469 array type with unspecified size this gets
1470 adjusted to the actual size. */
1471 initializer_t *initializer; /* initializer will be filled in here */
1472 bool must_be_constant;
1473 } parse_initializer_env_t;
1475 static void parse_initializer(parse_initializer_env_t *env)
1477 type_t *type = skip_typeref(env->type);
1478 initializer_t *result = NULL;
1481 if(is_type_scalar(type)) {
1482 /* TODO: § 6.7.8.11; eat {} without warning */
1483 result = parse_scalar_initializer(type, env->must_be_constant);
1484 } else if(token.type == '{') {
1488 memset(&path, 0, sizeof(path));
1489 path.top_type = env->type;
1490 path.path = NEW_ARR_F(type_path_entry_t, 0);
1492 descend_into_subtype(&path);
1494 result = parse_sub_initializer(&path, env->type, 1,
1495 env->must_be_constant);
1497 max_index = path.max_index;
1498 DEL_ARR_F(path.path);
1502 /* parse_scalar_initializer also works in this case: we simply
1503 * have an expression without {} around it */
1504 result = parse_scalar_initializer(type, env->must_be_constant);
1507 /* § 6.7.5 (22) array initializers for arrays with unknown size determine
1508 * the array type size */
1509 if(is_type_array(type) && type->array.size_expression == NULL
1510 && result != NULL) {
1512 switch (result->kind) {
1513 case INITIALIZER_LIST:
1514 size = max_index + 1;
1517 case INITIALIZER_STRING:
1518 size = result->string.string.size;
1521 case INITIALIZER_WIDE_STRING:
1522 size = result->wide_string.string.size;
1526 panic("invalid initializer type");
1529 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
1530 cnst->base.type = type_size_t;
1531 cnst->conste.v.int_value = size;
1533 type_t *new_type = duplicate_type(type);
1535 new_type->array.size_expression = cnst;
1536 new_type->array.size_constant = true;
1537 new_type->array.size = size;
1538 env->type = new_type;
1541 env->initializer = result;
1544 static declaration_t *append_declaration(declaration_t *declaration);
1546 static declaration_t *parse_compound_type_specifier(bool is_struct)
1554 symbol_t *symbol = NULL;
1555 declaration_t *declaration = NULL;
1557 if (token.type == T___attribute__) {
1562 if(token.type == T_IDENTIFIER) {
1563 symbol = token.v.symbol;
1567 declaration = get_declaration(symbol, NAMESPACE_STRUCT);
1569 declaration = get_declaration(symbol, NAMESPACE_UNION);
1571 } else if(token.type != '{') {
1573 parse_error_expected("while parsing struct type specifier",
1574 T_IDENTIFIER, '{', 0);
1576 parse_error_expected("while parsing union type specifier",
1577 T_IDENTIFIER, '{', 0);
1583 if(declaration == NULL) {
1584 declaration = allocate_declaration_zero();
1585 declaration->namespc =
1586 (is_struct ? NAMESPACE_STRUCT : NAMESPACE_UNION);
1587 declaration->source_position = token.source_position;
1588 declaration->symbol = symbol;
1589 declaration->parent_scope = scope;
1590 if (symbol != NULL) {
1591 environment_push(declaration);
1593 append_declaration(declaration);
1596 if(token.type == '{') {
1597 if(declaration->init.is_defined) {
1598 assert(symbol != NULL);
1599 errorf(HERE, "multiple definitions of '%s %Y'",
1600 is_struct ? "struct" : "union", symbol);
1601 declaration->scope.declarations = NULL;
1603 declaration->init.is_defined = true;
1605 parse_compound_type_entries(declaration);
1612 static void parse_enum_entries(type_t *const enum_type)
1616 if(token.type == '}') {
1618 errorf(HERE, "empty enum not allowed");
1623 if(token.type != T_IDENTIFIER) {
1624 parse_error_expected("while parsing enum entry", T_IDENTIFIER, 0);
1629 declaration_t *const entry = allocate_declaration_zero();
1630 entry->storage_class = STORAGE_CLASS_ENUM_ENTRY;
1631 entry->type = enum_type;
1632 entry->symbol = token.v.symbol;
1633 entry->source_position = token.source_position;
1636 if(token.type == '=') {
1638 expression_t *value = parse_constant_expression();
1640 value = create_implicit_cast(value, enum_type);
1641 entry->init.enum_value = value;
1646 record_declaration(entry);
1648 if(token.type != ',')
1651 } while(token.type != '}');
1656 static type_t *parse_enum_specifier(void)
1660 declaration_t *declaration;
1663 if(token.type == T_IDENTIFIER) {
1664 symbol = token.v.symbol;
1667 declaration = get_declaration(symbol, NAMESPACE_ENUM);
1668 } else if(token.type != '{') {
1669 parse_error_expected("while parsing enum type specifier",
1670 T_IDENTIFIER, '{', 0);
1677 if(declaration == NULL) {
1678 declaration = allocate_declaration_zero();
1679 declaration->namespc = NAMESPACE_ENUM;
1680 declaration->source_position = token.source_position;
1681 declaration->symbol = symbol;
1682 declaration->parent_scope = scope;
1685 type_t *const type = allocate_type_zero(TYPE_ENUM, declaration->source_position);
1686 type->enumt.declaration = declaration;
1688 if(token.type == '{') {
1689 if(declaration->init.is_defined) {
1690 errorf(HERE, "multiple definitions of enum %Y", symbol);
1692 if (symbol != NULL) {
1693 environment_push(declaration);
1695 append_declaration(declaration);
1696 declaration->init.is_defined = 1;
1698 parse_enum_entries(type);
1706 * if a symbol is a typedef to another type, return true
1708 static bool is_typedef_symbol(symbol_t *symbol)
1710 const declaration_t *const declaration =
1711 get_declaration(symbol, NAMESPACE_NORMAL);
1713 declaration != NULL &&
1714 declaration->storage_class == STORAGE_CLASS_TYPEDEF;
1717 static type_t *parse_typeof(void)
1725 expression_t *expression = NULL;
1728 switch(token.type) {
1729 case T___extension__:
1730 /* this can be a prefix to a typename or an expression */
1731 /* we simply eat it now. */
1734 } while(token.type == T___extension__);
1738 if(is_typedef_symbol(token.v.symbol)) {
1739 type = parse_typename();
1741 expression = parse_expression();
1742 type = expression->base.type;
1747 type = parse_typename();
1751 expression = parse_expression();
1752 type = expression->base.type;
1758 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF, expression->base.source_position);
1759 typeof_type->typeoft.expression = expression;
1760 typeof_type->typeoft.typeof_type = type;
1766 SPECIFIER_SIGNED = 1 << 0,
1767 SPECIFIER_UNSIGNED = 1 << 1,
1768 SPECIFIER_LONG = 1 << 2,
1769 SPECIFIER_INT = 1 << 3,
1770 SPECIFIER_DOUBLE = 1 << 4,
1771 SPECIFIER_CHAR = 1 << 5,
1772 SPECIFIER_SHORT = 1 << 6,
1773 SPECIFIER_LONG_LONG = 1 << 7,
1774 SPECIFIER_FLOAT = 1 << 8,
1775 SPECIFIER_BOOL = 1 << 9,
1776 SPECIFIER_VOID = 1 << 10,
1777 #ifdef PROVIDE_COMPLEX
1778 SPECIFIER_COMPLEX = 1 << 11,
1779 SPECIFIER_IMAGINARY = 1 << 12,
1783 static type_t *create_builtin_type(symbol_t *const symbol,
1784 type_t *const real_type)
1786 type_t *type = allocate_type_zero(TYPE_BUILTIN, builtin_source_position);
1787 type->builtin.symbol = symbol;
1788 type->builtin.real_type = real_type;
1790 type_t *result = typehash_insert(type);
1791 if (type != result) {
1798 static type_t *get_typedef_type(symbol_t *symbol)
1800 declaration_t *declaration = get_declaration(symbol, NAMESPACE_NORMAL);
1801 if(declaration == NULL
1802 || declaration->storage_class != STORAGE_CLASS_TYPEDEF)
1805 type_t *type = allocate_type_zero(TYPE_TYPEDEF, declaration->source_position);
1806 type->typedeft.declaration = declaration;
1811 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
1813 type_t *type = NULL;
1814 unsigned type_qualifiers = 0;
1815 unsigned type_specifiers = 0;
1818 specifiers->source_position = token.source_position;
1821 switch(token.type) {
1824 #define MATCH_STORAGE_CLASS(token, class) \
1826 if(specifiers->declared_storage_class != STORAGE_CLASS_NONE) { \
1827 errorf(HERE, "multiple storage classes in declaration specifiers"); \
1829 specifiers->declared_storage_class = class; \
1833 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
1834 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
1835 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
1836 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
1837 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
1840 switch (specifiers->declared_storage_class) {
1841 case STORAGE_CLASS_NONE:
1842 specifiers->declared_storage_class = STORAGE_CLASS_THREAD;
1845 case STORAGE_CLASS_EXTERN:
1846 specifiers->declared_storage_class = STORAGE_CLASS_THREAD_EXTERN;
1849 case STORAGE_CLASS_STATIC:
1850 specifiers->declared_storage_class = STORAGE_CLASS_THREAD_STATIC;
1854 errorf(HERE, "multiple storage classes in declaration specifiers");
1860 /* type qualifiers */
1861 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
1863 type_qualifiers |= qualifier; \
1867 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
1868 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
1869 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
1871 case T___extension__:
1876 /* type specifiers */
1877 #define MATCH_SPECIFIER(token, specifier, name) \
1880 if(type_specifiers & specifier) { \
1881 errorf(HERE, "multiple " name " type specifiers given"); \
1883 type_specifiers |= specifier; \
1887 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void")
1888 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char")
1889 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short")
1890 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int")
1891 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float")
1892 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double")
1893 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed")
1894 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned")
1895 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool")
1896 #ifdef PROVIDE_COMPLEX
1897 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex")
1898 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary")
1901 /* only in microsoft mode */
1902 specifiers->decl_modifiers |= DM_FORCEINLINE;
1906 specifiers->is_inline = true;
1911 if(type_specifiers & SPECIFIER_LONG_LONG) {
1912 errorf(HERE, "multiple type specifiers given");
1913 } else if(type_specifiers & SPECIFIER_LONG) {
1914 type_specifiers |= SPECIFIER_LONG_LONG;
1916 type_specifiers |= SPECIFIER_LONG;
1921 type = allocate_type_zero(TYPE_COMPOUND_STRUCT, HERE);
1923 type->compound.declaration = parse_compound_type_specifier(true);
1927 type = allocate_type_zero(TYPE_COMPOUND_UNION, HERE);
1929 type->compound.declaration = parse_compound_type_specifier(false);
1933 type = parse_enum_specifier();
1936 type = parse_typeof();
1938 case T___builtin_va_list:
1939 type = duplicate_type(type_valist);
1943 case T___attribute__:
1947 case T_IDENTIFIER: {
1948 /* only parse identifier if we haven't found a type yet */
1949 if(type != NULL || type_specifiers != 0)
1950 goto finish_specifiers;
1952 type_t *typedef_type = get_typedef_type(token.v.symbol);
1954 if(typedef_type == NULL)
1955 goto finish_specifiers;
1958 type = typedef_type;
1962 /* function specifier */
1964 goto finish_specifiers;
1971 atomic_type_kind_t atomic_type;
1973 /* match valid basic types */
1974 switch(type_specifiers) {
1975 case SPECIFIER_VOID:
1976 atomic_type = ATOMIC_TYPE_VOID;
1978 case SPECIFIER_CHAR:
1979 atomic_type = ATOMIC_TYPE_CHAR;
1981 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
1982 atomic_type = ATOMIC_TYPE_SCHAR;
1984 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
1985 atomic_type = ATOMIC_TYPE_UCHAR;
1987 case SPECIFIER_SHORT:
1988 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
1989 case SPECIFIER_SHORT | SPECIFIER_INT:
1990 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
1991 atomic_type = ATOMIC_TYPE_SHORT;
1993 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
1994 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
1995 atomic_type = ATOMIC_TYPE_USHORT;
1998 case SPECIFIER_SIGNED:
1999 case SPECIFIER_SIGNED | SPECIFIER_INT:
2000 atomic_type = ATOMIC_TYPE_INT;
2002 case SPECIFIER_UNSIGNED:
2003 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
2004 atomic_type = ATOMIC_TYPE_UINT;
2006 case SPECIFIER_LONG:
2007 case SPECIFIER_SIGNED | SPECIFIER_LONG:
2008 case SPECIFIER_LONG | SPECIFIER_INT:
2009 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
2010 atomic_type = ATOMIC_TYPE_LONG;
2012 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
2013 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
2014 atomic_type = ATOMIC_TYPE_ULONG;
2016 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2017 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2018 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
2019 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
2021 atomic_type = ATOMIC_TYPE_LONGLONG;
2023 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2024 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
2026 atomic_type = ATOMIC_TYPE_ULONGLONG;
2028 case SPECIFIER_FLOAT:
2029 atomic_type = ATOMIC_TYPE_FLOAT;
2031 case SPECIFIER_DOUBLE:
2032 atomic_type = ATOMIC_TYPE_DOUBLE;
2034 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
2035 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
2037 case SPECIFIER_BOOL:
2038 atomic_type = ATOMIC_TYPE_BOOL;
2040 #ifdef PROVIDE_COMPLEX
2041 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
2042 atomic_type = ATOMIC_TYPE_FLOAT_COMPLEX;
2044 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
2045 atomic_type = ATOMIC_TYPE_DOUBLE_COMPLEX;
2047 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
2048 atomic_type = ATOMIC_TYPE_LONG_DOUBLE_COMPLEX;
2050 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
2051 atomic_type = ATOMIC_TYPE_FLOAT_IMAGINARY;
2053 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
2054 atomic_type = ATOMIC_TYPE_DOUBLE_IMAGINARY;
2056 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
2057 atomic_type = ATOMIC_TYPE_LONG_DOUBLE_IMAGINARY;
2061 /* invalid specifier combination, give an error message */
2062 if(type_specifiers == 0) {
2063 if (! strict_mode) {
2064 if (warning.implicit_int) {
2065 warningf(HERE, "no type specifiers in declaration, using 'int'");
2067 atomic_type = ATOMIC_TYPE_INT;
2070 errorf(HERE, "no type specifiers given in declaration");
2072 } else if((type_specifiers & SPECIFIER_SIGNED) &&
2073 (type_specifiers & SPECIFIER_UNSIGNED)) {
2074 errorf(HERE, "signed and unsigned specifiers gives");
2075 } else if(type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
2076 errorf(HERE, "only integer types can be signed or unsigned");
2078 errorf(HERE, "multiple datatypes in declaration");
2080 atomic_type = ATOMIC_TYPE_INVALID;
2083 type = allocate_type_zero(TYPE_ATOMIC, builtin_source_position);
2084 type->atomic.akind = atomic_type;
2087 if(type_specifiers != 0) {
2088 errorf(HERE, "multiple datatypes in declaration");
2092 type->base.qualifiers = type_qualifiers;
2094 type_t *result = typehash_insert(type);
2095 if(newtype && result != type) {
2099 specifiers->type = result;
2102 static type_qualifiers_t parse_type_qualifiers(void)
2104 type_qualifiers_t type_qualifiers = TYPE_QUALIFIER_NONE;
2107 switch(token.type) {
2108 /* type qualifiers */
2109 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
2110 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
2111 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
2114 return type_qualifiers;
2119 static declaration_t *parse_identifier_list(void)
2121 declaration_t *declarations = NULL;
2122 declaration_t *last_declaration = NULL;
2124 declaration_t *const declaration = allocate_declaration_zero();
2125 declaration->type = NULL; /* a K&R parameter list has no types, yet */
2126 declaration->source_position = token.source_position;
2127 declaration->symbol = token.v.symbol;
2130 if(last_declaration != NULL) {
2131 last_declaration->next = declaration;
2133 declarations = declaration;
2135 last_declaration = declaration;
2137 if(token.type != ',')
2140 } while(token.type == T_IDENTIFIER);
2142 return declarations;
2145 static void semantic_parameter(declaration_t *declaration)
2147 /* TODO: improve error messages */
2149 if(declaration->declared_storage_class == STORAGE_CLASS_TYPEDEF) {
2150 errorf(HERE, "typedef not allowed in parameter list");
2151 } else if(declaration->declared_storage_class != STORAGE_CLASS_NONE
2152 && declaration->declared_storage_class != STORAGE_CLASS_REGISTER) {
2153 errorf(HERE, "parameter may only have none or register storage class");
2156 type_t *const orig_type = declaration->type;
2157 type_t * type = skip_typeref(orig_type);
2159 /* Array as last part of a parameter type is just syntactic sugar. Turn it
2160 * into a pointer. § 6.7.5.3 (7) */
2161 if (is_type_array(type)) {
2162 type_t *const element_type = type->array.element_type;
2164 type = make_pointer_type(element_type, type->base.qualifiers);
2166 declaration->type = type;
2169 if(is_type_incomplete(type)) {
2170 errorf(HERE, "incomplete type '%T' not allowed for parameter '%Y'",
2171 orig_type, declaration->symbol);
2175 static declaration_t *parse_parameter(void)
2177 declaration_specifiers_t specifiers;
2178 memset(&specifiers, 0, sizeof(specifiers));
2180 parse_declaration_specifiers(&specifiers);
2182 declaration_t *declaration = parse_declarator(&specifiers, /*may_be_abstract=*/true);
2184 semantic_parameter(declaration);
2189 static declaration_t *parse_parameters(function_type_t *type)
2191 if(token.type == T_IDENTIFIER) {
2192 symbol_t *symbol = token.v.symbol;
2193 if(!is_typedef_symbol(symbol)) {
2194 type->kr_style_parameters = true;
2195 return parse_identifier_list();
2199 if(token.type == ')') {
2200 type->unspecified_parameters = 1;
2203 if(token.type == T_void && look_ahead(1)->type == ')') {
2208 declaration_t *declarations = NULL;
2209 declaration_t *declaration;
2210 declaration_t *last_declaration = NULL;
2211 function_parameter_t *parameter;
2212 function_parameter_t *last_parameter = NULL;
2215 switch(token.type) {
2219 return declarations;
2222 case T___extension__:
2224 declaration = parse_parameter();
2226 parameter = obstack_alloc(type_obst, sizeof(parameter[0]));
2227 memset(parameter, 0, sizeof(parameter[0]));
2228 parameter->type = declaration->type;
2230 if(last_parameter != NULL) {
2231 last_declaration->next = declaration;
2232 last_parameter->next = parameter;
2234 type->parameters = parameter;
2235 declarations = declaration;
2237 last_parameter = parameter;
2238 last_declaration = declaration;
2242 return declarations;
2244 if(token.type != ',')
2245 return declarations;
2255 } construct_type_kind_t;
2257 typedef struct construct_type_t construct_type_t;
2258 struct construct_type_t {
2259 construct_type_kind_t kind;
2260 construct_type_t *next;
2263 typedef struct parsed_pointer_t parsed_pointer_t;
2264 struct parsed_pointer_t {
2265 construct_type_t construct_type;
2266 type_qualifiers_t type_qualifiers;
2269 typedef struct construct_function_type_t construct_function_type_t;
2270 struct construct_function_type_t {
2271 construct_type_t construct_type;
2272 type_t *function_type;
2275 typedef struct parsed_array_t parsed_array_t;
2276 struct parsed_array_t {
2277 construct_type_t construct_type;
2278 type_qualifiers_t type_qualifiers;
2284 typedef struct construct_base_type_t construct_base_type_t;
2285 struct construct_base_type_t {
2286 construct_type_t construct_type;
2290 static construct_type_t *parse_pointer_declarator(void)
2294 parsed_pointer_t *pointer = obstack_alloc(&temp_obst, sizeof(pointer[0]));
2295 memset(pointer, 0, sizeof(pointer[0]));
2296 pointer->construct_type.kind = CONSTRUCT_POINTER;
2297 pointer->type_qualifiers = parse_type_qualifiers();
2299 return (construct_type_t*) pointer;
2302 static construct_type_t *parse_array_declarator(void)
2306 parsed_array_t *array = obstack_alloc(&temp_obst, sizeof(array[0]));
2307 memset(array, 0, sizeof(array[0]));
2308 array->construct_type.kind = CONSTRUCT_ARRAY;
2310 if(token.type == T_static) {
2311 array->is_static = true;
2315 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
2316 if(type_qualifiers != 0) {
2317 if(token.type == T_static) {
2318 array->is_static = true;
2322 array->type_qualifiers = type_qualifiers;
2324 if(token.type == '*' && look_ahead(1)->type == ']') {
2325 array->is_variable = true;
2327 } else if(token.type != ']') {
2328 array->size = parse_assignment_expression();
2333 return (construct_type_t*) array;
2336 static construct_type_t *parse_function_declarator(declaration_t *declaration)
2341 if(declaration != NULL) {
2342 type = allocate_type_zero(TYPE_FUNCTION, declaration->source_position);
2344 type = allocate_type_zero(TYPE_FUNCTION, token.source_position);
2347 declaration_t *parameters = parse_parameters(&type->function);
2348 if(declaration != NULL) {
2349 declaration->scope.declarations = parameters;
2352 construct_function_type_t *construct_function_type =
2353 obstack_alloc(&temp_obst, sizeof(construct_function_type[0]));
2354 memset(construct_function_type, 0, sizeof(construct_function_type[0]));
2355 construct_function_type->construct_type.kind = CONSTRUCT_FUNCTION;
2356 construct_function_type->function_type = type;
2360 return (construct_type_t*) construct_function_type;
2363 static construct_type_t *parse_inner_declarator(declaration_t *declaration,
2364 bool may_be_abstract)
2366 /* construct a single linked list of construct_type_t's which describe
2367 * how to construct the final declarator type */
2368 construct_type_t *first = NULL;
2369 construct_type_t *last = NULL;
2372 while(token.type == '*') {
2373 construct_type_t *type = parse_pointer_declarator();
2384 /* TODO: find out if this is correct */
2387 construct_type_t *inner_types = NULL;
2389 switch(token.type) {
2391 if(declaration == NULL) {
2392 errorf(HERE, "no identifier expected in typename");
2394 declaration->symbol = token.v.symbol;
2395 declaration->source_position = token.source_position;
2401 inner_types = parse_inner_declarator(declaration, may_be_abstract);
2407 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', 0);
2408 /* avoid a loop in the outermost scope, because eat_statement doesn't
2410 if(token.type == '}' && current_function == NULL) {
2418 construct_type_t *p = last;
2421 construct_type_t *type;
2422 switch(token.type) {
2424 type = parse_function_declarator(declaration);
2427 type = parse_array_declarator();
2430 goto declarator_finished;
2433 /* insert in the middle of the list (behind p) */
2435 type->next = p->next;
2446 declarator_finished:
2449 /* append inner_types at the end of the list, we don't to set last anymore
2450 * as it's not needed anymore */
2452 assert(first == NULL);
2453 first = inner_types;
2455 last->next = inner_types;
2461 static type_t *construct_declarator_type(construct_type_t *construct_list,
2464 construct_type_t *iter = construct_list;
2465 for( ; iter != NULL; iter = iter->next) {
2466 switch(iter->kind) {
2467 case CONSTRUCT_INVALID:
2468 panic("invalid type construction found");
2469 case CONSTRUCT_FUNCTION: {
2470 construct_function_type_t *construct_function_type
2471 = (construct_function_type_t*) iter;
2473 type_t *function_type = construct_function_type->function_type;
2475 function_type->function.return_type = type;
2477 type_t *skipped_return_type = skip_typeref(type);
2478 if (is_type_function(skipped_return_type)) {
2479 errorf(HERE, "function returning function is not allowed");
2480 type = type_error_type;
2481 } else if (is_type_array(skipped_return_type)) {
2482 errorf(HERE, "function returning array is not allowed");
2483 type = type_error_type;
2485 type = function_type;
2490 case CONSTRUCT_POINTER: {
2491 parsed_pointer_t *parsed_pointer = (parsed_pointer_t*) iter;
2492 type_t *pointer_type = allocate_type_zero(TYPE_POINTER, (source_position_t){NULL, 0});
2493 pointer_type->pointer.points_to = type;
2494 pointer_type->base.qualifiers = parsed_pointer->type_qualifiers;
2496 type = pointer_type;
2500 case CONSTRUCT_ARRAY: {
2501 parsed_array_t *parsed_array = (parsed_array_t*) iter;
2502 type_t *array_type = allocate_type_zero(TYPE_ARRAY, (source_position_t){NULL, 0});
2504 expression_t *size_expression = parsed_array->size;
2505 if(size_expression != NULL) {
2507 = create_implicit_cast(size_expression, type_size_t);
2510 array_type->base.qualifiers = parsed_array->type_qualifiers;
2511 array_type->array.element_type = type;
2512 array_type->array.is_static = parsed_array->is_static;
2513 array_type->array.is_variable = parsed_array->is_variable;
2514 array_type->array.size_expression = size_expression;
2516 if(size_expression != NULL) {
2517 if(is_constant_expression(size_expression)) {
2518 array_type->array.size_constant = true;
2519 array_type->array.size
2520 = fold_constant(size_expression);
2522 array_type->array.is_vla = true;
2526 type_t *skipped_type = skip_typeref(type);
2527 if (is_type_atomic(skipped_type, ATOMIC_TYPE_VOID)) {
2528 errorf(HERE, "array of void is not allowed");
2529 type = type_error_type;
2537 type_t *hashed_type = typehash_insert(type);
2538 if(hashed_type != type) {
2539 /* the function type was constructed earlier freeing it here will
2540 * destroy other types... */
2541 if(iter->kind != CONSTRUCT_FUNCTION) {
2551 static declaration_t *parse_declarator(
2552 const declaration_specifiers_t *specifiers, bool may_be_abstract)
2554 declaration_t *const declaration = allocate_declaration_zero();
2555 declaration->declared_storage_class = specifiers->declared_storage_class;
2556 declaration->modifiers = specifiers->decl_modifiers;
2557 declaration->is_inline = specifiers->is_inline;
2559 declaration->storage_class = specifiers->declared_storage_class;
2560 if(declaration->storage_class == STORAGE_CLASS_NONE
2561 && scope != global_scope) {
2562 declaration->storage_class = STORAGE_CLASS_AUTO;
2565 construct_type_t *construct_type
2566 = parse_inner_declarator(declaration, may_be_abstract);
2567 type_t *const type = specifiers->type;
2568 declaration->type = construct_declarator_type(construct_type, type);
2570 if(construct_type != NULL) {
2571 obstack_free(&temp_obst, construct_type);
2577 static type_t *parse_abstract_declarator(type_t *base_type)
2579 construct_type_t *construct_type = parse_inner_declarator(NULL, 1);
2581 type_t *result = construct_declarator_type(construct_type, base_type);
2582 if(construct_type != NULL) {
2583 obstack_free(&temp_obst, construct_type);
2589 static declaration_t *append_declaration(declaration_t* const declaration)
2591 if (last_declaration != NULL) {
2592 last_declaration->next = declaration;
2594 scope->declarations = declaration;
2596 last_declaration = declaration;
2601 * Check if the declaration of main is suspicious. main should be a
2602 * function with external linkage, returning int, taking either zero
2603 * arguments, two, or three arguments of appropriate types, ie.
2605 * int main([ int argc, char **argv [, char **env ] ]).
2607 * @param decl the declaration to check
2608 * @param type the function type of the declaration
2610 static void check_type_of_main(const declaration_t *const decl, const function_type_t *const func_type)
2612 if (decl->storage_class == STORAGE_CLASS_STATIC) {
2613 warningf(decl->source_position, "'main' is normally a non-static function");
2615 if (skip_typeref(func_type->return_type) != type_int) {
2616 warningf(decl->source_position, "return type of 'main' should be 'int', but is '%T'", func_type->return_type);
2618 const function_parameter_t *parm = func_type->parameters;
2620 type_t *const first_type = parm->type;
2621 if (!types_compatible(skip_typeref(first_type), type_int)) {
2622 warningf(decl->source_position, "first argument of 'main' should be 'int', but is '%T'", first_type);
2626 type_t *const second_type = parm->type;
2627 if (!types_compatible(skip_typeref(second_type), type_char_ptr_ptr)) {
2628 warningf(decl->source_position, "second argument of 'main' should be 'char**', but is '%T'", second_type);
2632 type_t *const third_type = parm->type;
2633 if (!types_compatible(skip_typeref(third_type), type_char_ptr_ptr)) {
2634 warningf(decl->source_position, "third argument of 'main' should be 'char**', but is '%T'", third_type);
2638 warningf(decl->source_position, "'main' takes only zero, two or three arguments");
2642 warningf(decl->source_position, "'main' takes only zero, two or three arguments");
2648 * Check if a symbol is the equal to "main".
2650 static bool is_sym_main(const symbol_t *const sym)
2652 return strcmp(sym->string, "main") == 0;
2655 static declaration_t *internal_record_declaration(
2656 declaration_t *const declaration,
2657 const bool is_function_definition)
2659 const symbol_t *const symbol = declaration->symbol;
2660 const namespace_t namespc = (namespace_t)declaration->namespc;
2662 type_t *const orig_type = declaration->type;
2663 type_t *const type = skip_typeref(orig_type);
2664 if (is_type_function(type) &&
2665 type->function.unspecified_parameters &&
2666 warning.strict_prototypes) {
2667 warningf(declaration->source_position,
2668 "function declaration '%#T' is not a prototype",
2669 orig_type, declaration->symbol);
2672 if (is_function_definition && warning.main && is_sym_main(symbol)) {
2673 check_type_of_main(declaration, &type->function);
2676 assert(declaration->symbol != NULL);
2677 declaration_t *previous_declaration = get_declaration(symbol, namespc);
2679 assert(declaration != previous_declaration);
2680 if (previous_declaration != NULL) {
2681 if (previous_declaration->parent_scope == scope) {
2682 /* can happen for K&R style declarations */
2683 if(previous_declaration->type == NULL) {
2684 previous_declaration->type = declaration->type;
2687 const type_t *prev_type = skip_typeref(previous_declaration->type);
2688 if (!types_compatible(type, prev_type)) {
2689 errorf(declaration->source_position,
2690 "declaration '%#T' is incompatible with "
2691 "previous declaration '%#T'",
2692 orig_type, symbol, previous_declaration->type, symbol);
2693 errorf(previous_declaration->source_position,
2694 "previous declaration of '%Y' was here", symbol);
2696 unsigned old_storage_class
2697 = previous_declaration->storage_class;
2698 unsigned new_storage_class = declaration->storage_class;
2700 if(is_type_incomplete(prev_type)) {
2701 previous_declaration->type = type;
2705 /* pretend no storage class means extern for function
2706 * declarations (except if the previous declaration is neither
2707 * none nor extern) */
2708 if (is_type_function(type)) {
2709 switch (old_storage_class) {
2710 case STORAGE_CLASS_NONE:
2711 old_storage_class = STORAGE_CLASS_EXTERN;
2713 case STORAGE_CLASS_EXTERN:
2714 if (is_function_definition) {
2715 if (warning.missing_prototypes &&
2716 prev_type->function.unspecified_parameters &&
2717 !is_sym_main(symbol)) {
2718 warningf(declaration->source_position,
2719 "no previous prototype for '%#T'",
2722 } else if (new_storage_class == STORAGE_CLASS_NONE) {
2723 new_storage_class = STORAGE_CLASS_EXTERN;
2731 if (old_storage_class == STORAGE_CLASS_EXTERN &&
2732 new_storage_class == STORAGE_CLASS_EXTERN) {
2733 warn_redundant_declaration:
2734 if (warning.redundant_decls) {
2735 warningf(declaration->source_position,
2736 "redundant declaration for '%Y'", symbol);
2737 warningf(previous_declaration->source_position,
2738 "previous declaration of '%Y' was here",
2741 } else if (current_function == NULL) {
2742 if (old_storage_class != STORAGE_CLASS_STATIC &&
2743 new_storage_class == STORAGE_CLASS_STATIC) {
2744 errorf(declaration->source_position,
2745 "static declaration of '%Y' follows non-static declaration",
2747 errorf(previous_declaration->source_position,
2748 "previous declaration of '%Y' was here", symbol);
2750 if (old_storage_class != STORAGE_CLASS_EXTERN && !is_function_definition) {
2751 goto warn_redundant_declaration;
2753 if (new_storage_class == STORAGE_CLASS_NONE) {
2754 previous_declaration->storage_class = STORAGE_CLASS_NONE;
2755 previous_declaration->declared_storage_class = STORAGE_CLASS_NONE;
2759 if (old_storage_class == new_storage_class) {
2760 errorf(declaration->source_position,
2761 "redeclaration of '%Y'", symbol);
2763 errorf(declaration->source_position,
2764 "redeclaration of '%Y' with different linkage",
2767 errorf(previous_declaration->source_position,
2768 "previous declaration of '%Y' was here", symbol);
2771 return previous_declaration;
2773 } else if (is_function_definition) {
2774 if (declaration->storage_class != STORAGE_CLASS_STATIC) {
2775 if (warning.missing_prototypes && !is_sym_main(symbol)) {
2776 warningf(declaration->source_position,
2777 "no previous prototype for '%#T'", orig_type, symbol);
2778 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
2779 warningf(declaration->source_position,
2780 "no previous declaration for '%#T'", orig_type,
2784 } else if (warning.missing_declarations &&
2785 scope == global_scope &&
2786 !is_type_function(type) && (
2787 declaration->storage_class == STORAGE_CLASS_NONE ||
2788 declaration->storage_class == STORAGE_CLASS_THREAD
2790 warningf(declaration->source_position,
2791 "no previous declaration for '%#T'", orig_type, symbol);
2794 assert(declaration->parent_scope == NULL);
2795 assert(scope != NULL);
2797 declaration->parent_scope = scope;
2799 environment_push(declaration);
2800 return append_declaration(declaration);
2803 static declaration_t *record_declaration(declaration_t *declaration)
2805 return internal_record_declaration(declaration, false);
2808 static declaration_t *record_function_definition(declaration_t *declaration)
2810 return internal_record_declaration(declaration, true);
2813 static void parser_error_multiple_definition(declaration_t *declaration,
2814 const source_position_t source_position)
2816 errorf(source_position, "multiple definition of symbol '%Y'",
2817 declaration->symbol);
2818 errorf(declaration->source_position,
2819 "this is the location of the previous definition.");
2822 static bool is_declaration_specifier(const token_t *token,
2823 bool only_type_specifiers)
2825 switch(token->type) {
2829 return is_typedef_symbol(token->v.symbol);
2831 case T___extension__:
2834 return !only_type_specifiers;
2841 static void parse_init_declarator_rest(declaration_t *declaration)
2845 type_t *orig_type = declaration->type;
2846 type_t *type = skip_typeref(orig_type);
2848 if(declaration->init.initializer != NULL) {
2849 parser_error_multiple_definition(declaration, token.source_position);
2852 bool must_be_constant = false;
2853 if(declaration->storage_class == STORAGE_CLASS_STATIC
2854 || declaration->storage_class == STORAGE_CLASS_THREAD_STATIC
2855 || declaration->parent_scope == global_scope) {
2856 must_be_constant = true;
2859 parse_initializer_env_t env;
2860 env.type = orig_type;
2861 env.must_be_constant = must_be_constant;
2862 parse_initializer(&env);
2864 if(env.type != orig_type) {
2865 orig_type = env.type;
2866 type = skip_typeref(orig_type);
2867 declaration->type = env.type;
2870 if(is_type_function(type)) {
2871 errorf(declaration->source_position,
2872 "initializers not allowed for function types at declator '%Y' (type '%T')",
2873 declaration->symbol, orig_type);
2875 declaration->init.initializer = env.initializer;
2879 /* parse rest of a declaration without any declarator */
2880 static void parse_anonymous_declaration_rest(
2881 const declaration_specifiers_t *specifiers,
2882 parsed_declaration_func finished_declaration)
2886 declaration_t *const declaration = allocate_declaration_zero();
2887 declaration->type = specifiers->type;
2888 declaration->declared_storage_class = specifiers->declared_storage_class;
2889 declaration->source_position = specifiers->source_position;
2891 if (declaration->declared_storage_class != STORAGE_CLASS_NONE) {
2892 warningf(declaration->source_position, "useless storage class in empty declaration");
2894 declaration->storage_class = STORAGE_CLASS_NONE;
2896 type_t *type = declaration->type;
2897 switch (type->kind) {
2898 case TYPE_COMPOUND_STRUCT:
2899 case TYPE_COMPOUND_UNION: {
2900 if (type->compound.declaration->symbol == NULL) {
2901 warningf(declaration->source_position, "unnamed struct/union that defines no instances");
2910 warningf(declaration->source_position, "empty declaration");
2914 finished_declaration(declaration);
2917 static void parse_declaration_rest(declaration_t *ndeclaration,
2918 const declaration_specifiers_t *specifiers,
2919 parsed_declaration_func finished_declaration)
2922 declaration_t *declaration = finished_declaration(ndeclaration);
2924 type_t *orig_type = declaration->type;
2925 type_t *type = skip_typeref(orig_type);
2927 if (type->kind != TYPE_FUNCTION &&
2928 declaration->is_inline &&
2929 is_type_valid(type)) {
2930 warningf(declaration->source_position,
2931 "variable '%Y' declared 'inline'\n", declaration->symbol);
2934 if(token.type == '=') {
2935 parse_init_declarator_rest(declaration);
2938 if(token.type != ',')
2942 ndeclaration = parse_declarator(specifiers, /*may_be_abstract=*/false);
2947 static declaration_t *finished_kr_declaration(declaration_t *declaration)
2949 symbol_t *symbol = declaration->symbol;
2950 if(symbol == NULL) {
2951 errorf(HERE, "anonymous declaration not valid as function parameter");
2954 namespace_t namespc = (namespace_t) declaration->namespc;
2955 if(namespc != NAMESPACE_NORMAL) {
2956 return record_declaration(declaration);
2959 declaration_t *previous_declaration = get_declaration(symbol, namespc);
2960 if(previous_declaration == NULL ||
2961 previous_declaration->parent_scope != scope) {
2962 errorf(HERE, "expected declaration of a function parameter, found '%Y'",
2967 if(previous_declaration->type == NULL) {
2968 previous_declaration->type = declaration->type;
2969 previous_declaration->declared_storage_class = declaration->declared_storage_class;
2970 previous_declaration->storage_class = declaration->storage_class;
2971 previous_declaration->parent_scope = scope;
2972 return previous_declaration;
2974 return record_declaration(declaration);
2978 static void parse_declaration(parsed_declaration_func finished_declaration)
2980 declaration_specifiers_t specifiers;
2981 memset(&specifiers, 0, sizeof(specifiers));
2982 parse_declaration_specifiers(&specifiers);
2984 if(token.type == ';') {
2985 parse_anonymous_declaration_rest(&specifiers, append_declaration);
2987 declaration_t *declaration = parse_declarator(&specifiers, /*may_be_abstract=*/false);
2988 parse_declaration_rest(declaration, &specifiers, finished_declaration);
2992 static void parse_kr_declaration_list(declaration_t *declaration)
2994 type_t *type = skip_typeref(declaration->type);
2995 if(!is_type_function(type))
2998 if(!type->function.kr_style_parameters)
3001 /* push function parameters */
3002 int top = environment_top();
3003 scope_t *last_scope = scope;
3004 set_scope(&declaration->scope);
3006 declaration_t *parameter = declaration->scope.declarations;
3007 for( ; parameter != NULL; parameter = parameter->next) {
3008 assert(parameter->parent_scope == NULL);
3009 parameter->parent_scope = scope;
3010 environment_push(parameter);
3013 /* parse declaration list */
3014 while(is_declaration_specifier(&token, false)) {
3015 parse_declaration(finished_kr_declaration);
3018 /* pop function parameters */
3019 assert(scope == &declaration->scope);
3020 set_scope(last_scope);
3021 environment_pop_to(top);
3023 /* update function type */
3024 type_t *new_type = duplicate_type(type);
3025 new_type->function.kr_style_parameters = false;
3027 function_parameter_t *parameters = NULL;
3028 function_parameter_t *last_parameter = NULL;
3030 declaration_t *parameter_declaration = declaration->scope.declarations;
3031 for( ; parameter_declaration != NULL;
3032 parameter_declaration = parameter_declaration->next) {
3033 type_t *parameter_type = parameter_declaration->type;
3034 if(parameter_type == NULL) {
3036 errorf(HERE, "no type specified for function parameter '%Y'",
3037 parameter_declaration->symbol);
3039 if (warning.implicit_int) {
3040 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
3041 parameter_declaration->symbol);
3043 parameter_type = type_int;
3044 parameter_declaration->type = parameter_type;
3048 semantic_parameter(parameter_declaration);
3049 parameter_type = parameter_declaration->type;
3051 function_parameter_t *function_parameter
3052 = obstack_alloc(type_obst, sizeof(function_parameter[0]));
3053 memset(function_parameter, 0, sizeof(function_parameter[0]));
3055 function_parameter->type = parameter_type;
3056 if(last_parameter != NULL) {
3057 last_parameter->next = function_parameter;
3059 parameters = function_parameter;
3061 last_parameter = function_parameter;
3063 new_type->function.parameters = parameters;
3065 type = typehash_insert(new_type);
3066 if(type != new_type) {
3067 obstack_free(type_obst, new_type);
3070 declaration->type = type;
3073 static bool first_err = true;
3076 * When called with first_err set, prints the name of the current function,
3079 static void print_in_function(void) {
3082 diagnosticf("%s: In function '%Y':\n",
3083 current_function->source_position.input_name,
3084 current_function->symbol);
3089 * Check if all labels are defined in the current function.
3090 * Check if all labels are used in the current function.
3092 static void check_labels(void)
3094 for (const goto_statement_t *goto_statement = goto_first;
3095 goto_statement != NULL;
3096 goto_statement = goto_statement->next) {
3097 declaration_t *label = goto_statement->label;
3100 if (label->source_position.input_name == NULL) {
3101 print_in_function();
3102 errorf(goto_statement->base.source_position,
3103 "label '%Y' used but not defined", label->symbol);
3106 goto_first = goto_last = NULL;
3108 if (warning.unused_label) {
3109 for (const label_statement_t *label_statement = label_first;
3110 label_statement != NULL;
3111 label_statement = label_statement->next) {
3112 const declaration_t *label = label_statement->label;
3114 if (! label->used) {
3115 print_in_function();
3116 warningf(label_statement->base.source_position,
3117 "label '%Y' defined but not used", label->symbol);
3121 label_first = label_last = NULL;
3125 * Check declarations of current_function for unused entities.
3127 static void check_declarations(void)
3129 if (warning.unused_parameter) {
3130 const scope_t *scope = ¤t_function->scope;
3132 const declaration_t *parameter = scope->declarations;
3133 for (; parameter != NULL; parameter = parameter->next) {
3134 if (! parameter->used) {
3135 print_in_function();
3136 warningf(parameter->source_position,
3137 "unused parameter '%Y'", parameter->symbol);
3141 if (warning.unused_variable) {
3145 static void parse_external_declaration(void)
3147 /* function-definitions and declarations both start with declaration
3149 declaration_specifiers_t specifiers;
3150 memset(&specifiers, 0, sizeof(specifiers));
3151 parse_declaration_specifiers(&specifiers);
3153 /* must be a declaration */
3154 if(token.type == ';') {
3155 parse_anonymous_declaration_rest(&specifiers, append_declaration);
3159 /* declarator is common to both function-definitions and declarations */
3160 declaration_t *ndeclaration = parse_declarator(&specifiers, /*may_be_abstract=*/false);
3162 /* must be a declaration */
3163 if(token.type == ',' || token.type == '=' || token.type == ';') {
3164 parse_declaration_rest(ndeclaration, &specifiers, record_declaration);
3168 /* must be a function definition */
3169 parse_kr_declaration_list(ndeclaration);
3171 if(token.type != '{') {
3172 parse_error_expected("while parsing function definition", '{', 0);
3177 type_t *type = ndeclaration->type;
3179 /* note that we don't skip typerefs: the standard doesn't allow them here
3180 * (so we can't use is_type_function here) */
3181 if(type->kind != TYPE_FUNCTION) {
3182 if (is_type_valid(type)) {
3183 errorf(HERE, "declarator '%#T' has a body but is not a function type",
3184 type, ndeclaration->symbol);
3190 /* § 6.7.5.3 (14) a function definition with () means no
3191 * parameters (and not unspecified parameters) */
3192 if(type->function.unspecified_parameters) {
3193 type_t *duplicate = duplicate_type(type);
3194 duplicate->function.unspecified_parameters = false;
3196 type = typehash_insert(duplicate);
3197 if(type != duplicate) {
3198 obstack_free(type_obst, duplicate);
3200 ndeclaration->type = type;
3203 declaration_t *const declaration = record_function_definition(ndeclaration);
3204 if(ndeclaration != declaration) {
3205 declaration->scope = ndeclaration->scope;
3207 type = skip_typeref(declaration->type);
3209 /* push function parameters and switch scope */
3210 int top = environment_top();
3211 scope_t *last_scope = scope;
3212 set_scope(&declaration->scope);
3214 declaration_t *parameter = declaration->scope.declarations;
3215 for( ; parameter != NULL; parameter = parameter->next) {
3216 if(parameter->parent_scope == &ndeclaration->scope) {
3217 parameter->parent_scope = scope;
3219 assert(parameter->parent_scope == NULL
3220 || parameter->parent_scope == scope);
3221 parameter->parent_scope = scope;
3222 environment_push(parameter);
3225 if(declaration->init.statement != NULL) {
3226 parser_error_multiple_definition(declaration, token.source_position);
3228 goto end_of_parse_external_declaration;
3230 /* parse function body */
3231 int label_stack_top = label_top();
3232 declaration_t *old_current_function = current_function;
3233 current_function = declaration;
3235 declaration->init.statement = parse_compound_statement();
3238 check_declarations();
3240 assert(current_function == declaration);
3241 current_function = old_current_function;
3242 label_pop_to(label_stack_top);
3245 end_of_parse_external_declaration:
3246 assert(scope == &declaration->scope);
3247 set_scope(last_scope);
3248 environment_pop_to(top);
3251 static type_t *make_bitfield_type(type_t *base, expression_t *size,
3252 source_position_t source_position)
3254 type_t *type = allocate_type_zero(TYPE_BITFIELD, source_position);
3255 type->bitfield.base = base;
3256 type->bitfield.size = size;
3261 static declaration_t *find_compound_entry(declaration_t *compound_declaration,
3264 declaration_t *iter = compound_declaration->scope.declarations;
3265 for( ; iter != NULL; iter = iter->next) {
3266 if(iter->namespc != NAMESPACE_NORMAL)
3269 if(iter->symbol == NULL) {
3270 type_t *type = skip_typeref(iter->type);
3271 if(is_type_compound(type)) {
3272 declaration_t *result
3273 = find_compound_entry(type->compound.declaration, symbol);
3280 if(iter->symbol == symbol) {
3288 static void parse_compound_declarators(declaration_t *struct_declaration,
3289 const declaration_specifiers_t *specifiers)
3291 declaration_t *last_declaration = struct_declaration->scope.declarations;
3292 if(last_declaration != NULL) {
3293 while(last_declaration->next != NULL) {
3294 last_declaration = last_declaration->next;
3299 declaration_t *declaration;
3301 if(token.type == ':') {
3302 source_position_t source_position = HERE;
3305 type_t *base_type = specifiers->type;
3306 expression_t *size = parse_constant_expression();
3308 if(!is_type_integer(skip_typeref(base_type))) {
3309 errorf(HERE, "bitfield base type '%T' is not an integer type",
3313 type_t *type = make_bitfield_type(base_type, size, source_position);
3315 declaration = allocate_declaration_zero();
3316 declaration->namespc = NAMESPACE_NORMAL;
3317 declaration->declared_storage_class = STORAGE_CLASS_NONE;
3318 declaration->storage_class = STORAGE_CLASS_NONE;
3319 declaration->source_position = source_position;
3320 declaration->modifiers = specifiers->decl_modifiers;
3321 declaration->type = type;
3323 declaration = parse_declarator(specifiers,/*may_be_abstract=*/true);
3325 type_t *orig_type = declaration->type;
3326 type_t *type = skip_typeref(orig_type);
3328 if(token.type == ':') {
3329 source_position_t source_position = HERE;
3331 expression_t *size = parse_constant_expression();
3333 if(!is_type_integer(type)) {
3334 errorf(HERE, "bitfield base type '%T' is not an "
3335 "integer type", orig_type);
3338 type_t *bitfield_type = make_bitfield_type(orig_type, size, source_position);
3339 declaration->type = bitfield_type;
3341 /* TODO we ignore arrays for now... what is missing is a check
3342 * that they're at the end of the struct */
3343 if(is_type_incomplete(type) && !is_type_array(type)) {
3345 "compound member '%Y' has incomplete type '%T'",
3346 declaration->symbol, orig_type);
3347 } else if(is_type_function(type)) {
3348 errorf(HERE, "compound member '%Y' must not have function "
3349 "type '%T'", declaration->symbol, orig_type);
3354 /* make sure we don't define a symbol multiple times */
3355 symbol_t *symbol = declaration->symbol;
3356 if(symbol != NULL) {
3357 declaration_t *prev_decl
3358 = find_compound_entry(struct_declaration, symbol);
3360 if(prev_decl != NULL) {
3361 assert(prev_decl->symbol == symbol);
3362 errorf(declaration->source_position,
3363 "multiple declarations of symbol '%Y'", symbol);
3364 errorf(prev_decl->source_position,
3365 "previous declaration of '%Y' was here", symbol);
3369 /* append declaration */
3370 if(last_declaration != NULL) {
3371 last_declaration->next = declaration;
3373 struct_declaration->scope.declarations = declaration;
3375 last_declaration = declaration;
3377 if(token.type != ',')
3384 static void parse_compound_type_entries(declaration_t *compound_declaration)
3388 while(token.type != '}' && token.type != T_EOF) {
3389 declaration_specifiers_t specifiers;
3390 memset(&specifiers, 0, sizeof(specifiers));
3391 parse_declaration_specifiers(&specifiers);
3393 parse_compound_declarators(compound_declaration, &specifiers);
3395 if(token.type == T_EOF) {
3396 errorf(HERE, "EOF while parsing struct");
3401 static type_t *parse_typename(void)
3403 declaration_specifiers_t specifiers;
3404 memset(&specifiers, 0, sizeof(specifiers));
3405 parse_declaration_specifiers(&specifiers);
3406 if(specifiers.declared_storage_class != STORAGE_CLASS_NONE) {
3407 /* TODO: improve error message, user does probably not know what a
3408 * storage class is...
3410 errorf(HERE, "typename may not have a storage class");
3413 type_t *result = parse_abstract_declarator(specifiers.type);
3421 typedef expression_t* (*parse_expression_function) (unsigned precedence);
3422 typedef expression_t* (*parse_expression_infix_function) (unsigned precedence,
3423 expression_t *left);
3425 typedef struct expression_parser_function_t expression_parser_function_t;
3426 struct expression_parser_function_t {
3427 unsigned precedence;
3428 parse_expression_function parser;
3429 unsigned infix_precedence;
3430 parse_expression_infix_function infix_parser;
3433 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
3436 * Creates a new invalid expression.
3438 static expression_t *create_invalid_expression(void)
3440 expression_t *expression = allocate_expression_zero(EXPR_INVALID);
3441 expression->base.source_position = token.source_position;
3446 * Prints an error message if an expression was expected but not read
3448 static expression_t *expected_expression_error(void)
3450 /* skip the error message if the error token was read */
3451 if (token.type != T_ERROR) {
3452 errorf(HERE, "expected expression, got token '%K'", &token);
3456 return create_invalid_expression();
3460 * Parse a string constant.
3462 static expression_t *parse_string_const(void)
3465 if (token.type == T_STRING_LITERAL) {
3466 string_t res = token.v.string;
3468 while (token.type == T_STRING_LITERAL) {
3469 res = concat_strings(&res, &token.v.string);
3472 if (token.type != T_WIDE_STRING_LITERAL) {
3473 expression_t *const cnst = allocate_expression_zero(EXPR_STRING_LITERAL);
3474 /* note: that we use type_char_ptr here, which is already the
3475 * automatic converted type. revert_automatic_type_conversion
3476 * will construct the array type */
3477 cnst->base.type = type_char_ptr;
3478 cnst->string.value = res;
3482 wres = concat_string_wide_string(&res, &token.v.wide_string);
3484 wres = token.v.wide_string;
3489 switch (token.type) {
3490 case T_WIDE_STRING_LITERAL:
3491 wres = concat_wide_strings(&wres, &token.v.wide_string);
3494 case T_STRING_LITERAL:
3495 wres = concat_wide_string_string(&wres, &token.v.string);
3499 expression_t *const cnst = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
3500 cnst->base.type = type_wchar_t_ptr;
3501 cnst->wide_string.value = wres;
3510 * Parse an integer constant.
3512 static expression_t *parse_int_const(void)
3514 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
3515 cnst->base.source_position = HERE;
3516 cnst->base.type = token.datatype;
3517 cnst->conste.v.int_value = token.v.intvalue;
3525 * Parse a character constant.
3527 static expression_t *parse_char_const(void)
3529 expression_t *cnst = allocate_expression_zero(EXPR_CHAR_CONST);
3530 cnst->base.source_position = HERE;
3531 cnst->base.type = token.datatype;
3532 cnst->conste.v.chars.begin = token.v.string.begin;
3533 cnst->conste.v.chars.size = token.v.string.size;
3535 if (cnst->conste.v.chars.size != 1) {
3536 if (warning.multichar && (c_mode & _GNUC)) {
3538 warningf(HERE, "multi-character character constant");
3540 errorf(HERE, "more than 1 characters in character constant");
3549 * Parse a float constant.
3551 static expression_t *parse_float_const(void)
3553 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
3554 cnst->base.type = token.datatype;
3555 cnst->conste.v.float_value = token.v.floatvalue;
3562 static declaration_t *create_implicit_function(symbol_t *symbol,
3563 const source_position_t source_position)
3565 type_t *ntype = allocate_type_zero(TYPE_FUNCTION, source_position);
3566 ntype->function.return_type = type_int;
3567 ntype->function.unspecified_parameters = true;
3569 type_t *type = typehash_insert(ntype);
3574 declaration_t *const declaration = allocate_declaration_zero();
3575 declaration->storage_class = STORAGE_CLASS_EXTERN;
3576 declaration->declared_storage_class = STORAGE_CLASS_EXTERN;
3577 declaration->type = type;
3578 declaration->symbol = symbol;
3579 declaration->source_position = source_position;
3580 declaration->parent_scope = global_scope;
3582 scope_t *old_scope = scope;
3583 set_scope(global_scope);
3585 environment_push(declaration);
3586 /* prepends the declaration to the global declarations list */
3587 declaration->next = scope->declarations;
3588 scope->declarations = declaration;
3590 assert(scope == global_scope);
3591 set_scope(old_scope);
3597 * Creates a return_type (func)(argument_type) function type if not
3600 * @param return_type the return type
3601 * @param argument_type the argument type
3603 static type_t *make_function_1_type(type_t *return_type, type_t *argument_type)
3605 function_parameter_t *parameter
3606 = obstack_alloc(type_obst, sizeof(parameter[0]));
3607 memset(parameter, 0, sizeof(parameter[0]));
3608 parameter->type = argument_type;
3610 type_t *type = allocate_type_zero(TYPE_FUNCTION, builtin_source_position);
3611 type->function.return_type = return_type;
3612 type->function.parameters = parameter;
3614 type_t *result = typehash_insert(type);
3615 if(result != type) {
3623 * Creates a function type for some function like builtins.
3625 * @param symbol the symbol describing the builtin
3627 static type_t *get_builtin_symbol_type(symbol_t *symbol)
3629 switch(symbol->ID) {
3630 case T___builtin_alloca:
3631 return make_function_1_type(type_void_ptr, type_size_t);
3632 case T___builtin_nan:
3633 return make_function_1_type(type_double, type_char_ptr);
3634 case T___builtin_nanf:
3635 return make_function_1_type(type_float, type_char_ptr);
3636 case T___builtin_nand:
3637 return make_function_1_type(type_long_double, type_char_ptr);
3638 case T___builtin_va_end:
3639 return make_function_1_type(type_void, type_valist);
3641 panic("not implemented builtin symbol found");
3646 * Performs automatic type cast as described in § 6.3.2.1.
3648 * @param orig_type the original type
3650 static type_t *automatic_type_conversion(type_t *orig_type)
3652 type_t *type = skip_typeref(orig_type);
3653 if(is_type_array(type)) {
3654 array_type_t *array_type = &type->array;
3655 type_t *element_type = array_type->element_type;
3656 unsigned qualifiers = array_type->type.qualifiers;
3658 return make_pointer_type(element_type, qualifiers);
3661 if(is_type_function(type)) {
3662 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
3669 * reverts the automatic casts of array to pointer types and function
3670 * to function-pointer types as defined § 6.3.2.1
3672 type_t *revert_automatic_type_conversion(const expression_t *expression)
3674 switch (expression->kind) {
3675 case EXPR_REFERENCE: return expression->reference.declaration->type;
3676 case EXPR_SELECT: return expression->select.compound_entry->type;
3678 case EXPR_UNARY_DEREFERENCE: {
3679 const expression_t *const value = expression->unary.value;
3680 type_t *const type = skip_typeref(value->base.type);
3681 assert(is_type_pointer(type));
3682 return type->pointer.points_to;
3685 case EXPR_BUILTIN_SYMBOL:
3686 return get_builtin_symbol_type(expression->builtin_symbol.symbol);
3688 case EXPR_ARRAY_ACCESS: {
3689 const expression_t *array_ref = expression->array_access.array_ref;
3690 type_t *type_left = skip_typeref(array_ref->base.type);
3691 if (!is_type_valid(type_left))
3693 assert(is_type_pointer(type_left));
3694 return type_left->pointer.points_to;
3697 case EXPR_STRING_LITERAL: {
3698 size_t size = expression->string.value.size;
3699 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
3702 case EXPR_WIDE_STRING_LITERAL: {
3703 size_t size = expression->wide_string.value.size;
3704 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
3707 case EXPR_COMPOUND_LITERAL:
3708 return expression->compound_literal.type;
3713 return expression->base.type;
3716 static expression_t *parse_reference(void)
3718 expression_t *expression = allocate_expression_zero(EXPR_REFERENCE);
3720 reference_expression_t *ref = &expression->reference;
3721 ref->symbol = token.v.symbol;
3723 declaration_t *declaration = get_declaration(ref->symbol, NAMESPACE_NORMAL);
3725 source_position_t source_position = token.source_position;
3728 if(declaration == NULL) {
3729 if (! strict_mode && token.type == '(') {
3730 /* an implicitly defined function */
3731 if (warning.implicit_function_declaration) {
3732 warningf(HERE, "implicit declaration of function '%Y'",
3736 declaration = create_implicit_function(ref->symbol,
3739 errorf(HERE, "unknown symbol '%Y' found.", ref->symbol);
3740 return create_invalid_expression();
3744 type_t *type = declaration->type;
3746 /* we always do the auto-type conversions; the & and sizeof parser contains
3747 * code to revert this! */
3748 type = automatic_type_conversion(type);
3750 ref->declaration = declaration;
3751 ref->base.type = type;
3753 /* this declaration is used */
3754 declaration->used = true;
3759 static void check_cast_allowed(expression_t *expression, type_t *dest_type)
3763 /* TODO check if explicit cast is allowed and issue warnings/errors */
3766 static expression_t *parse_compound_literal(type_t *type)
3768 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
3770 parse_initializer_env_t env;
3772 env.must_be_constant = false;
3773 parse_initializer(&env);
3776 expression->compound_literal.type = type;
3777 expression->compound_literal.initializer = env.initializer;
3778 expression->base.type = automatic_type_conversion(type);
3783 static expression_t *parse_cast(void)
3785 source_position_t source_position = token.source_position;
3787 type_t *type = parse_typename();
3791 if(token.type == '{') {
3792 return parse_compound_literal(type);
3795 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
3796 cast->base.source_position = source_position;
3798 expression_t *value = parse_sub_expression(20);
3800 check_cast_allowed(value, type);
3802 cast->base.type = type;
3803 cast->unary.value = value;
3808 static expression_t *parse_statement_expression(void)
3810 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
3812 statement_t *statement = parse_compound_statement();
3813 expression->statement.statement = statement;
3814 expression->base.source_position = statement->base.source_position;
3816 /* find last statement and use its type */
3817 type_t *type = type_void;
3818 const statement_t *stmt = statement->compound.statements;
3820 while (stmt->base.next != NULL)
3821 stmt = stmt->base.next;
3823 if (stmt->kind == STATEMENT_EXPRESSION) {
3824 type = stmt->expression.expression->base.type;
3827 warningf(expression->base.source_position, "empty statement expression ({})");
3829 expression->base.type = type;
3836 static expression_t *parse_brace_expression(void)
3840 switch(token.type) {
3842 /* gcc extension: a statement expression */
3843 return parse_statement_expression();
3847 return parse_cast();
3849 if(is_typedef_symbol(token.v.symbol)) {
3850 return parse_cast();
3854 expression_t *result = parse_expression();
3860 static expression_t *parse_function_keyword(void)
3865 if (current_function == NULL) {
3866 errorf(HERE, "'__func__' used outside of a function");
3869 expression_t *expression = allocate_expression_zero(EXPR_FUNCTION);
3870 expression->base.type = type_char_ptr;
3875 static expression_t *parse_pretty_function_keyword(void)
3877 eat(T___PRETTY_FUNCTION__);
3880 if (current_function == NULL) {
3881 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
3884 expression_t *expression = allocate_expression_zero(EXPR_PRETTY_FUNCTION);
3885 expression->base.type = type_char_ptr;
3890 static designator_t *parse_designator(void)
3892 designator_t *result = allocate_ast_zero(sizeof(result[0]));
3893 result->source_position = HERE;
3895 if(token.type != T_IDENTIFIER) {
3896 parse_error_expected("while parsing member designator",
3901 result->symbol = token.v.symbol;
3904 designator_t *last_designator = result;
3906 if(token.type == '.') {
3908 if(token.type != T_IDENTIFIER) {
3909 parse_error_expected("while parsing member designator",
3914 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
3915 designator->source_position = HERE;
3916 designator->symbol = token.v.symbol;
3919 last_designator->next = designator;
3920 last_designator = designator;
3923 if(token.type == '[') {
3925 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
3926 designator->source_position = HERE;
3927 designator->array_index = parse_expression();
3928 if(designator->array_index == NULL) {
3934 last_designator->next = designator;
3935 last_designator = designator;
3944 static expression_t *parse_offsetof(void)
3946 eat(T___builtin_offsetof);
3948 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
3949 expression->base.type = type_size_t;
3952 type_t *type = parse_typename();
3954 designator_t *designator = parse_designator();
3957 expression->offsetofe.type = type;
3958 expression->offsetofe.designator = designator;
3961 memset(&path, 0, sizeof(path));
3962 path.top_type = type;
3963 path.path = NEW_ARR_F(type_path_entry_t, 0);
3965 descend_into_subtype(&path);
3967 if(!walk_designator(&path, designator, true)) {
3968 return create_invalid_expression();
3971 DEL_ARR_F(path.path);
3976 static expression_t *parse_va_start(void)
3978 eat(T___builtin_va_start);
3980 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
3983 expression->va_starte.ap = parse_assignment_expression();
3985 expression_t *const expr = parse_assignment_expression();
3986 if (expr->kind == EXPR_REFERENCE) {
3987 declaration_t *const decl = expr->reference.declaration;
3989 return create_invalid_expression();
3990 if (decl->parent_scope == ¤t_function->scope &&
3991 decl->next == NULL) {
3992 expression->va_starte.parameter = decl;
3997 errorf(expr->base.source_position, "second argument of 'va_start' must be last parameter of the current function");
3999 return create_invalid_expression();
4002 static expression_t *parse_va_arg(void)
4004 eat(T___builtin_va_arg);
4006 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
4009 expression->va_arge.ap = parse_assignment_expression();
4011 expression->base.type = parse_typename();
4017 static expression_t *parse_builtin_symbol(void)
4019 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_SYMBOL);
4021 symbol_t *symbol = token.v.symbol;
4023 expression->builtin_symbol.symbol = symbol;
4026 type_t *type = get_builtin_symbol_type(symbol);
4027 type = automatic_type_conversion(type);
4029 expression->base.type = type;
4033 static expression_t *parse_builtin_constant(void)
4035 eat(T___builtin_constant_p);
4037 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
4040 expression->builtin_constant.value = parse_assignment_expression();
4042 expression->base.type = type_int;
4047 static expression_t *parse_builtin_prefetch(void)
4049 eat(T___builtin_prefetch);
4051 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_PREFETCH);
4054 expression->builtin_prefetch.adr = parse_assignment_expression();
4055 if (token.type == ',') {
4057 expression->builtin_prefetch.rw = parse_assignment_expression();
4059 if (token.type == ',') {
4061 expression->builtin_prefetch.locality = parse_assignment_expression();
4064 expression->base.type = type_void;
4069 static expression_t *parse_compare_builtin(void)
4071 expression_t *expression;
4073 switch(token.type) {
4074 case T___builtin_isgreater:
4075 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
4077 case T___builtin_isgreaterequal:
4078 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
4080 case T___builtin_isless:
4081 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
4083 case T___builtin_islessequal:
4084 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
4086 case T___builtin_islessgreater:
4087 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
4089 case T___builtin_isunordered:
4090 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
4093 panic("invalid compare builtin found");
4096 expression->base.source_position = HERE;
4100 expression->binary.left = parse_assignment_expression();
4102 expression->binary.right = parse_assignment_expression();
4105 type_t *const orig_type_left = expression->binary.left->base.type;
4106 type_t *const orig_type_right = expression->binary.right->base.type;
4108 type_t *const type_left = skip_typeref(orig_type_left);
4109 type_t *const type_right = skip_typeref(orig_type_right);
4110 if(!is_type_float(type_left) && !is_type_float(type_right)) {
4111 if (is_type_valid(type_left) && is_type_valid(type_right)) {
4112 type_error_incompatible("invalid operands in comparison",
4113 expression->base.source_position, orig_type_left, orig_type_right);
4116 semantic_comparison(&expression->binary);
4122 static expression_t *parse_builtin_expect(void)
4124 eat(T___builtin_expect);
4126 expression_t *expression
4127 = allocate_expression_zero(EXPR_BINARY_BUILTIN_EXPECT);
4130 expression->binary.left = parse_assignment_expression();
4132 expression->binary.right = parse_constant_expression();
4135 expression->base.type = expression->binary.left->base.type;
4140 static expression_t *parse_assume(void) {
4143 expression_t *expression
4144 = allocate_expression_zero(EXPR_UNARY_ASSUME);
4147 expression->unary.value = parse_assignment_expression();
4150 expression->base.type = type_void;
4154 static expression_t *parse_primary_expression(void)
4156 switch (token.type) {
4157 case T_INTEGER: return parse_int_const();
4158 case T_CHARS: return parse_char_const();
4159 case T_FLOATINGPOINT: return parse_float_const();
4160 case T_STRING_LITERAL:
4161 case T_WIDE_STRING_LITERAL: return parse_string_const();
4162 case T_IDENTIFIER: return parse_reference();
4163 case T___FUNCTION__:
4164 case T___func__: return parse_function_keyword();
4165 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
4166 case T___builtin_offsetof: return parse_offsetof();
4167 case T___builtin_va_start: return parse_va_start();
4168 case T___builtin_va_arg: return parse_va_arg();
4169 case T___builtin_expect: return parse_builtin_expect();
4170 case T___builtin_alloca:
4171 case T___builtin_nan:
4172 case T___builtin_nand:
4173 case T___builtin_nanf:
4174 case T___builtin_va_end: return parse_builtin_symbol();
4175 case T___builtin_isgreater:
4176 case T___builtin_isgreaterequal:
4177 case T___builtin_isless:
4178 case T___builtin_islessequal:
4179 case T___builtin_islessgreater:
4180 case T___builtin_isunordered: return parse_compare_builtin();
4181 case T___builtin_constant_p: return parse_builtin_constant();
4182 case T___builtin_prefetch: return parse_builtin_prefetch();
4183 case T_assume: return parse_assume();
4185 case '(': return parse_brace_expression();
4188 errorf(HERE, "unexpected token %K, expected an expression", &token);
4191 return create_invalid_expression();
4195 * Check if the expression has the character type and issue a warning then.
4197 static void check_for_char_index_type(const expression_t *expression) {
4198 type_t *const type = expression->base.type;
4199 const type_t *const base_type = skip_typeref(type);
4201 if (is_type_atomic(base_type, ATOMIC_TYPE_CHAR) &&
4202 warning.char_subscripts) {
4203 warningf(expression->base.source_position,
4204 "array subscript has type '%T'", type);
4208 static expression_t *parse_array_expression(unsigned precedence,
4215 expression_t *inside = parse_expression();
4217 expression_t *expression = allocate_expression_zero(EXPR_ARRAY_ACCESS);
4219 array_access_expression_t *array_access = &expression->array_access;
4221 type_t *const orig_type_left = left->base.type;
4222 type_t *const orig_type_inside = inside->base.type;
4224 type_t *const type_left = skip_typeref(orig_type_left);
4225 type_t *const type_inside = skip_typeref(orig_type_inside);
4227 type_t *return_type;
4228 if (is_type_pointer(type_left)) {
4229 return_type = type_left->pointer.points_to;
4230 array_access->array_ref = left;
4231 array_access->index = inside;
4232 check_for_char_index_type(inside);
4233 } else if (is_type_pointer(type_inside)) {
4234 return_type = type_inside->pointer.points_to;
4235 array_access->array_ref = inside;
4236 array_access->index = left;
4237 array_access->flipped = true;
4238 check_for_char_index_type(left);
4240 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
4242 "array access on object with non-pointer types '%T', '%T'",
4243 orig_type_left, orig_type_inside);
4245 return_type = type_error_type;
4246 array_access->array_ref = create_invalid_expression();
4249 if(token.type != ']') {
4250 parse_error_expected("Problem while parsing array access", ']', 0);
4255 return_type = automatic_type_conversion(return_type);
4256 expression->base.type = return_type;
4261 static expression_t *parse_typeprop(expression_kind_t kind, unsigned precedence)
4263 expression_t *tp_expression = allocate_expression_zero(kind);
4264 tp_expression->base.type = type_size_t;
4266 if(token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
4268 tp_expression->typeprop.type = parse_typename();
4271 expression_t *expression = parse_sub_expression(precedence);
4272 expression->base.type = revert_automatic_type_conversion(expression);
4274 tp_expression->typeprop.type = expression->base.type;
4275 tp_expression->typeprop.tp_expression = expression;
4278 return tp_expression;
4281 static expression_t *parse_sizeof(unsigned precedence)
4284 return parse_typeprop(EXPR_SIZEOF, precedence);
4287 static expression_t *parse_alignof(unsigned precedence)
4290 return parse_typeprop(EXPR_SIZEOF, precedence);
4293 static expression_t *parse_select_expression(unsigned precedence,
4294 expression_t *compound)
4297 assert(token.type == '.' || token.type == T_MINUSGREATER);
4299 bool is_pointer = (token.type == T_MINUSGREATER);
4302 expression_t *select = allocate_expression_zero(EXPR_SELECT);
4303 select->select.compound = compound;
4305 if(token.type != T_IDENTIFIER) {
4306 parse_error_expected("while parsing select", T_IDENTIFIER, 0);
4309 symbol_t *symbol = token.v.symbol;
4310 select->select.symbol = symbol;
4313 type_t *const orig_type = compound->base.type;
4314 type_t *const type = skip_typeref(orig_type);
4316 type_t *type_left = type;
4318 if (!is_type_pointer(type)) {
4319 if (is_type_valid(type)) {
4320 errorf(HERE, "left hand side of '->' is not a pointer, but '%T'", orig_type);
4322 return create_invalid_expression();
4324 type_left = type->pointer.points_to;
4326 type_left = skip_typeref(type_left);
4328 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
4329 type_left->kind != TYPE_COMPOUND_UNION) {
4330 if (is_type_valid(type_left)) {
4331 errorf(HERE, "request for member '%Y' in something not a struct or "
4332 "union, but '%T'", symbol, type_left);
4334 return create_invalid_expression();
4337 declaration_t *const declaration = type_left->compound.declaration;
4339 if(!declaration->init.is_defined) {
4340 errorf(HERE, "request for member '%Y' of incomplete type '%T'",
4342 return create_invalid_expression();
4345 declaration_t *iter = find_compound_entry(declaration, symbol);
4347 errorf(HERE, "'%T' has no member named '%Y'", orig_type, symbol);
4348 return create_invalid_expression();
4351 /* we always do the auto-type conversions; the & and sizeof parser contains
4352 * code to revert this! */
4353 type_t *expression_type = automatic_type_conversion(iter->type);
4355 select->select.compound_entry = iter;
4356 select->base.type = expression_type;
4358 if(expression_type->kind == TYPE_BITFIELD) {
4359 expression_t *extract
4360 = allocate_expression_zero(EXPR_UNARY_BITFIELD_EXTRACT);
4361 extract->unary.value = select;
4362 extract->base.type = expression_type->bitfield.base;
4371 * Parse a call expression, ie. expression '( ... )'.
4373 * @param expression the function address
4375 static expression_t *parse_call_expression(unsigned precedence,
4376 expression_t *expression)
4379 expression_t *result = allocate_expression_zero(EXPR_CALL);
4381 call_expression_t *call = &result->call;
4382 call->function = expression;
4384 type_t *const orig_type = expression->base.type;
4385 type_t *const type = skip_typeref(orig_type);
4387 function_type_t *function_type = NULL;
4388 if (is_type_pointer(type)) {
4389 type_t *const to_type = skip_typeref(type->pointer.points_to);
4391 if (is_type_function(to_type)) {
4392 function_type = &to_type->function;
4393 call->base.type = function_type->return_type;
4397 if (function_type == NULL && is_type_valid(type)) {
4398 errorf(HERE, "called object '%E' (type '%T') is not a pointer to a function", expression, orig_type);
4401 /* parse arguments */
4404 if(token.type != ')') {
4405 call_argument_t *last_argument = NULL;
4408 call_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
4410 argument->expression = parse_assignment_expression();
4411 if(last_argument == NULL) {
4412 call->arguments = argument;
4414 last_argument->next = argument;
4416 last_argument = argument;
4418 if(token.type != ',')
4425 if(function_type != NULL) {
4426 function_parameter_t *parameter = function_type->parameters;
4427 call_argument_t *argument = call->arguments;
4428 for( ; parameter != NULL && argument != NULL;
4429 parameter = parameter->next, argument = argument->next) {
4430 type_t *expected_type = parameter->type;
4431 /* TODO report scope in error messages */
4432 expression_t *const arg_expr = argument->expression;
4433 type_t *const res_type = semantic_assign(expected_type, arg_expr, "function call");
4434 if (res_type == NULL) {
4435 /* TODO improve error message */
4436 errorf(arg_expr->base.source_position,
4437 "Cannot call function with argument '%E' of type '%T' where type '%T' is expected",
4438 arg_expr, arg_expr->base.type, expected_type);
4440 argument->expression = create_implicit_cast(argument->expression, expected_type);
4443 /* too few parameters */
4444 if(parameter != NULL) {
4445 errorf(HERE, "too few arguments to function '%E'", expression);
4446 } else if(argument != NULL) {
4447 /* too many parameters */
4448 if(!function_type->variadic
4449 && !function_type->unspecified_parameters) {
4450 errorf(HERE, "too many arguments to function '%E'", expression);
4452 /* do default promotion */
4453 for( ; argument != NULL; argument = argument->next) {
4454 type_t *type = argument->expression->base.type;
4456 type = skip_typeref(type);
4457 if(is_type_integer(type)) {
4458 type = promote_integer(type);
4459 } else if(type == type_float) {
4463 argument->expression
4464 = create_implicit_cast(argument->expression, type);
4467 check_format(&result->call);
4470 check_format(&result->call);
4477 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
4479 static bool same_compound_type(const type_t *type1, const type_t *type2)
4482 is_type_compound(type1) &&
4483 type1->kind == type2->kind &&
4484 type1->compound.declaration == type2->compound.declaration;
4488 * Parse a conditional expression, ie. 'expression ? ... : ...'.
4490 * @param expression the conditional expression
4492 static expression_t *parse_conditional_expression(unsigned precedence,
4493 expression_t *expression)
4497 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
4499 conditional_expression_t *conditional = &result->conditional;
4500 conditional->condition = expression;
4503 type_t *const condition_type_orig = expression->base.type;
4504 type_t *const condition_type = skip_typeref(condition_type_orig);
4505 if (!is_type_scalar(condition_type) && is_type_valid(condition_type)) {
4506 type_error("expected a scalar type in conditional condition",
4507 expression->base.source_position, condition_type_orig);
4510 expression_t *true_expression = parse_expression();
4512 expression_t *false_expression = parse_sub_expression(precedence);
4514 type_t *const orig_true_type = true_expression->base.type;
4515 type_t *const orig_false_type = false_expression->base.type;
4516 type_t *const true_type = skip_typeref(orig_true_type);
4517 type_t *const false_type = skip_typeref(orig_false_type);
4520 type_t *result_type;
4521 if (is_type_arithmetic(true_type) && is_type_arithmetic(false_type)) {
4522 result_type = semantic_arithmetic(true_type, false_type);
4524 true_expression = create_implicit_cast(true_expression, result_type);
4525 false_expression = create_implicit_cast(false_expression, result_type);
4527 conditional->true_expression = true_expression;
4528 conditional->false_expression = false_expression;
4529 conditional->base.type = result_type;
4530 } else if (same_compound_type(true_type, false_type) || (
4531 is_type_atomic(true_type, ATOMIC_TYPE_VOID) &&
4532 is_type_atomic(false_type, ATOMIC_TYPE_VOID)
4534 /* just take 1 of the 2 types */
4535 result_type = true_type;
4536 } else if (is_type_pointer(true_type) && is_type_pointer(false_type)
4537 && pointers_compatible(true_type, false_type)) {
4539 result_type = true_type;
4540 } else if (is_type_pointer(true_type)
4541 && is_null_pointer_constant(false_expression)) {
4542 result_type = true_type;
4543 } else if (is_type_pointer(false_type)
4544 && is_null_pointer_constant(true_expression)) {
4545 result_type = false_type;
4547 /* TODO: one pointer to void*, other some pointer */
4549 if (is_type_valid(true_type) && is_type_valid(false_type)) {
4550 type_error_incompatible("while parsing conditional",
4551 expression->base.source_position, true_type,
4554 result_type = type_error_type;
4557 conditional->true_expression
4558 = create_implicit_cast(true_expression, result_type);
4559 conditional->false_expression
4560 = create_implicit_cast(false_expression, result_type);
4561 conditional->base.type = result_type;
4566 * Parse an extension expression.
4568 static expression_t *parse_extension(unsigned precedence)
4570 eat(T___extension__);
4572 /* TODO enable extensions */
4573 expression_t *expression = parse_sub_expression(precedence);
4574 /* TODO disable extensions */
4578 static expression_t *parse_builtin_classify_type(const unsigned precedence)
4580 eat(T___builtin_classify_type);
4582 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
4583 result->base.type = type_int;
4586 expression_t *expression = parse_sub_expression(precedence);
4588 result->classify_type.type_expression = expression;
4593 static void semantic_incdec(unary_expression_t *expression)
4595 type_t *const orig_type = expression->value->base.type;
4596 type_t *const type = skip_typeref(orig_type);
4597 /* TODO !is_type_real && !is_type_pointer */
4598 if(!is_type_arithmetic(type) && type->kind != TYPE_POINTER) {
4599 if (is_type_valid(type)) {
4600 /* TODO: improve error message */
4601 errorf(HERE, "operation needs an arithmetic or pointer type");
4606 expression->base.type = orig_type;
4609 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
4611 type_t *const orig_type = expression->value->base.type;
4612 type_t *const type = skip_typeref(orig_type);
4613 if(!is_type_arithmetic(type)) {
4614 if (is_type_valid(type)) {
4615 /* TODO: improve error message */
4616 errorf(HERE, "operation needs an arithmetic type");
4621 expression->base.type = orig_type;
4624 static void semantic_unexpr_scalar(unary_expression_t *expression)
4626 type_t *const orig_type = expression->value->base.type;
4627 type_t *const type = skip_typeref(orig_type);
4628 if (!is_type_scalar(type)) {
4629 if (is_type_valid(type)) {
4630 errorf(HERE, "operand of ! must be of scalar type");
4635 expression->base.type = orig_type;
4638 static void semantic_unexpr_integer(unary_expression_t *expression)
4640 type_t *const orig_type = expression->value->base.type;
4641 type_t *const type = skip_typeref(orig_type);
4642 if (!is_type_integer(type)) {
4643 if (is_type_valid(type)) {
4644 errorf(HERE, "operand of ~ must be of integer type");
4649 expression->base.type = orig_type;
4652 static void semantic_dereference(unary_expression_t *expression)
4654 type_t *const orig_type = expression->value->base.type;
4655 type_t *const type = skip_typeref(orig_type);
4656 if(!is_type_pointer(type)) {
4657 if (is_type_valid(type)) {
4658 errorf(HERE, "Unary '*' needs pointer or arrray type, but type '%T' given", orig_type);
4663 type_t *result_type = type->pointer.points_to;
4664 result_type = automatic_type_conversion(result_type);
4665 expression->base.type = result_type;
4669 * Check the semantic of the address taken expression.
4671 static void semantic_take_addr(unary_expression_t *expression)
4673 expression_t *value = expression->value;
4674 value->base.type = revert_automatic_type_conversion(value);
4676 type_t *orig_type = value->base.type;
4677 if(!is_type_valid(orig_type))
4680 if(value->kind == EXPR_REFERENCE) {
4681 declaration_t *const declaration = value->reference.declaration;
4682 if(declaration != NULL) {
4683 if (declaration->storage_class == STORAGE_CLASS_REGISTER) {
4684 errorf(expression->base.source_position,
4685 "address of register variable '%Y' requested",
4686 declaration->symbol);
4688 declaration->address_taken = 1;
4692 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
4695 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
4696 static expression_t *parse_##unexpression_type(unsigned precedence) \
4700 expression_t *unary_expression \
4701 = allocate_expression_zero(unexpression_type); \
4702 unary_expression->base.source_position = HERE; \
4703 unary_expression->unary.value = parse_sub_expression(precedence); \
4705 sfunc(&unary_expression->unary); \
4707 return unary_expression; \
4710 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
4711 semantic_unexpr_arithmetic)
4712 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
4713 semantic_unexpr_arithmetic)
4714 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
4715 semantic_unexpr_scalar)
4716 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
4717 semantic_dereference)
4718 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
4720 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
4721 semantic_unexpr_integer)
4722 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
4724 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
4727 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
4729 static expression_t *parse_##unexpression_type(unsigned precedence, \
4730 expression_t *left) \
4732 (void) precedence; \
4735 expression_t *unary_expression \
4736 = allocate_expression_zero(unexpression_type); \
4737 unary_expression->unary.value = left; \
4739 sfunc(&unary_expression->unary); \
4741 return unary_expression; \
4744 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
4745 EXPR_UNARY_POSTFIX_INCREMENT,
4747 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
4748 EXPR_UNARY_POSTFIX_DECREMENT,
4751 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
4753 /* TODO: handle complex + imaginary types */
4755 /* § 6.3.1.8 Usual arithmetic conversions */
4756 if(type_left == type_long_double || type_right == type_long_double) {
4757 return type_long_double;
4758 } else if(type_left == type_double || type_right == type_double) {
4760 } else if(type_left == type_float || type_right == type_float) {
4764 type_right = promote_integer(type_right);
4765 type_left = promote_integer(type_left);
4767 if(type_left == type_right)
4770 bool signed_left = is_type_signed(type_left);
4771 bool signed_right = is_type_signed(type_right);
4772 int rank_left = get_rank(type_left);
4773 int rank_right = get_rank(type_right);
4774 if(rank_left < rank_right) {
4775 if(signed_left == signed_right || !signed_right) {
4781 if(signed_left == signed_right || !signed_left) {
4790 * Check the semantic restrictions for a binary expression.
4792 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
4794 expression_t *const left = expression->left;
4795 expression_t *const right = expression->right;
4796 type_t *const orig_type_left = left->base.type;
4797 type_t *const orig_type_right = right->base.type;
4798 type_t *const type_left = skip_typeref(orig_type_left);
4799 type_t *const type_right = skip_typeref(orig_type_right);
4801 if(!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
4802 /* TODO: improve error message */
4803 if (is_type_valid(type_left) && is_type_valid(type_right)) {
4804 errorf(HERE, "operation needs arithmetic types");
4809 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
4810 expression->left = create_implicit_cast(left, arithmetic_type);
4811 expression->right = create_implicit_cast(right, arithmetic_type);
4812 expression->base.type = arithmetic_type;
4815 static void semantic_shift_op(binary_expression_t *expression)
4817 expression_t *const left = expression->left;
4818 expression_t *const right = expression->right;
4819 type_t *const orig_type_left = left->base.type;
4820 type_t *const orig_type_right = right->base.type;
4821 type_t * type_left = skip_typeref(orig_type_left);
4822 type_t * type_right = skip_typeref(orig_type_right);
4824 if(!is_type_integer(type_left) || !is_type_integer(type_right)) {
4825 /* TODO: improve error message */
4826 if (is_type_valid(type_left) && is_type_valid(type_right)) {
4827 errorf(HERE, "operation needs integer types");
4832 type_left = promote_integer(type_left);
4833 type_right = promote_integer(type_right);
4835 expression->left = create_implicit_cast(left, type_left);
4836 expression->right = create_implicit_cast(right, type_right);
4837 expression->base.type = type_left;
4840 static void semantic_add(binary_expression_t *expression)
4842 expression_t *const left = expression->left;
4843 expression_t *const right = expression->right;
4844 type_t *const orig_type_left = left->base.type;
4845 type_t *const orig_type_right = right->base.type;
4846 type_t *const type_left = skip_typeref(orig_type_left);
4847 type_t *const type_right = skip_typeref(orig_type_right);
4850 if(is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
4851 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
4852 expression->left = create_implicit_cast(left, arithmetic_type);
4853 expression->right = create_implicit_cast(right, arithmetic_type);
4854 expression->base.type = arithmetic_type;
4856 } else if(is_type_pointer(type_left) && is_type_integer(type_right)) {
4857 expression->base.type = type_left;
4858 } else if(is_type_pointer(type_right) && is_type_integer(type_left)) {
4859 expression->base.type = type_right;
4860 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
4861 errorf(HERE, "invalid operands to binary + ('%T', '%T')", orig_type_left, orig_type_right);
4865 static void semantic_sub(binary_expression_t *expression)
4867 expression_t *const left = expression->left;
4868 expression_t *const right = expression->right;
4869 type_t *const orig_type_left = left->base.type;
4870 type_t *const orig_type_right = right->base.type;
4871 type_t *const type_left = skip_typeref(orig_type_left);
4872 type_t *const type_right = skip_typeref(orig_type_right);
4875 if(is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
4876 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
4877 expression->left = create_implicit_cast(left, arithmetic_type);
4878 expression->right = create_implicit_cast(right, arithmetic_type);
4879 expression->base.type = arithmetic_type;
4881 } else if(is_type_pointer(type_left) && is_type_integer(type_right)) {
4882 expression->base.type = type_left;
4883 } else if(is_type_pointer(type_left) && is_type_pointer(type_right)) {
4884 if(!pointers_compatible(type_left, type_right)) {
4886 "pointers to incompatible objects to binary '-' ('%T', '%T')",
4887 orig_type_left, orig_type_right);
4889 expression->base.type = type_ptrdiff_t;
4891 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
4892 errorf(HERE, "invalid operands to binary '-' ('%T', '%T')",
4893 orig_type_left, orig_type_right);
4898 * Check the semantics of comparison expressions.
4900 * @param expression The expression to check.
4902 static void semantic_comparison(binary_expression_t *expression)
4904 expression_t *left = expression->left;
4905 expression_t *right = expression->right;
4906 type_t *orig_type_left = left->base.type;
4907 type_t *orig_type_right = right->base.type;
4909 type_t *type_left = skip_typeref(orig_type_left);
4910 type_t *type_right = skip_typeref(orig_type_right);
4912 /* TODO non-arithmetic types */
4913 if(is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
4914 if (warning.sign_compare &&
4915 (expression->base.kind != EXPR_BINARY_EQUAL &&
4916 expression->base.kind != EXPR_BINARY_NOTEQUAL) &&
4917 (is_type_signed(type_left) != is_type_signed(type_right))) {
4918 warningf(expression->base.source_position,
4919 "comparison between signed and unsigned");
4921 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
4922 expression->left = create_implicit_cast(left, arithmetic_type);
4923 expression->right = create_implicit_cast(right, arithmetic_type);
4924 expression->base.type = arithmetic_type;
4925 if (warning.float_equal &&
4926 (expression->base.kind == EXPR_BINARY_EQUAL ||
4927 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
4928 is_type_float(arithmetic_type)) {
4929 warningf(expression->base.source_position,
4930 "comparing floating point with == or != is unsafe");
4932 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
4933 /* TODO check compatibility */
4934 } else if (is_type_pointer(type_left)) {
4935 expression->right = create_implicit_cast(right, type_left);
4936 } else if (is_type_pointer(type_right)) {
4937 expression->left = create_implicit_cast(left, type_right);
4938 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
4939 type_error_incompatible("invalid operands in comparison",
4940 expression->base.source_position,
4941 type_left, type_right);
4943 expression->base.type = type_int;
4946 static void semantic_arithmetic_assign(binary_expression_t *expression)
4948 expression_t *left = expression->left;
4949 expression_t *right = expression->right;
4950 type_t *orig_type_left = left->base.type;
4951 type_t *orig_type_right = right->base.type;
4953 type_t *type_left = skip_typeref(orig_type_left);
4954 type_t *type_right = skip_typeref(orig_type_right);
4956 if(!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
4957 /* TODO: improve error message */
4958 if (is_type_valid(type_left) && is_type_valid(type_right)) {
4959 errorf(HERE, "operation needs arithmetic types");
4964 /* combined instructions are tricky. We can't create an implicit cast on
4965 * the left side, because we need the uncasted form for the store.
4966 * The ast2firm pass has to know that left_type must be right_type
4967 * for the arithmetic operation and create a cast by itself */
4968 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
4969 expression->right = create_implicit_cast(right, arithmetic_type);
4970 expression->base.type = type_left;
4973 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
4975 expression_t *const left = expression->left;
4976 expression_t *const right = expression->right;
4977 type_t *const orig_type_left = left->base.type;
4978 type_t *const orig_type_right = right->base.type;
4979 type_t *const type_left = skip_typeref(orig_type_left);
4980 type_t *const type_right = skip_typeref(orig_type_right);
4982 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
4983 /* combined instructions are tricky. We can't create an implicit cast on
4984 * the left side, because we need the uncasted form for the store.
4985 * The ast2firm pass has to know that left_type must be right_type
4986 * for the arithmetic operation and create a cast by itself */
4987 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
4988 expression->right = create_implicit_cast(right, arithmetic_type);
4989 expression->base.type = type_left;
4990 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
4991 expression->base.type = type_left;
4992 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
4993 errorf(HERE, "incompatible types '%T' and '%T' in assignment", orig_type_left, orig_type_right);
4998 * Check the semantic restrictions of a logical expression.
5000 static void semantic_logical_op(binary_expression_t *expression)
5002 expression_t *const left = expression->left;
5003 expression_t *const right = expression->right;
5004 type_t *const orig_type_left = left->base.type;
5005 type_t *const orig_type_right = right->base.type;
5006 type_t *const type_left = skip_typeref(orig_type_left);
5007 type_t *const type_right = skip_typeref(orig_type_right);
5009 if (!is_type_scalar(type_left) || !is_type_scalar(type_right)) {
5010 /* TODO: improve error message */
5011 if (is_type_valid(type_left) && is_type_valid(type_right)) {
5012 errorf(HERE, "operation needs scalar types");
5017 expression->base.type = type_int;
5021 * Checks if a compound type has constant fields.
5023 static bool has_const_fields(const compound_type_t *type)
5025 const scope_t *scope = &type->declaration->scope;
5026 const declaration_t *declaration = scope->declarations;
5028 for (; declaration != NULL; declaration = declaration->next) {
5029 if (declaration->namespc != NAMESPACE_NORMAL)
5032 const type_t *decl_type = skip_typeref(declaration->type);
5033 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
5041 * Check the semantic restrictions of a binary assign expression.
5043 static void semantic_binexpr_assign(binary_expression_t *expression)
5045 expression_t *left = expression->left;
5046 type_t *orig_type_left = left->base.type;
5048 type_t *type_left = revert_automatic_type_conversion(left);
5049 type_left = skip_typeref(orig_type_left);
5051 /* must be a modifiable lvalue */
5052 if (is_type_array(type_left)) {
5053 errorf(HERE, "cannot assign to arrays ('%E')", left);
5056 if(type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
5057 errorf(HERE, "assignment to readonly location '%E' (type '%T')", left,
5061 if(is_type_incomplete(type_left)) {
5063 "left-hand side of assignment '%E' has incomplete type '%T'",
5064 left, orig_type_left);
5067 if(is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
5068 errorf(HERE, "cannot assign to '%E' because compound type '%T' has readonly fields",
5069 left, orig_type_left);
5073 type_t *const res_type = semantic_assign(orig_type_left, expression->right,
5075 if (res_type == NULL) {
5076 errorf(expression->base.source_position,
5077 "cannot assign to '%T' from '%T'",
5078 orig_type_left, expression->right->base.type);
5080 expression->right = create_implicit_cast(expression->right, res_type);
5083 expression->base.type = orig_type_left;
5087 * Determine if the outermost operation (or parts thereof) of the given
5088 * expression has no effect in order to generate a warning about this fact.
5089 * Therefore in some cases this only examines some of the operands of the
5090 * expression (see comments in the function and examples below).
5092 * f() + 23; // warning, because + has no effect
5093 * x || f(); // no warning, because x controls execution of f()
5094 * x ? y : f(); // warning, because y has no effect
5095 * (void)x; // no warning to be able to suppress the warning
5096 * This function can NOT be used for an "expression has definitely no effect"-
5098 static bool expression_has_effect(const expression_t *const expr)
5100 switch (expr->kind) {
5101 case EXPR_UNKNOWN: break;
5102 case EXPR_INVALID: break;
5103 case EXPR_REFERENCE: return false;
5104 case EXPR_CONST: return false;
5105 case EXPR_CHAR_CONST: return false;
5106 case EXPR_STRING_LITERAL: return false;
5107 case EXPR_WIDE_STRING_LITERAL: return false;
5110 const call_expression_t *const call = &expr->call;
5111 if (call->function->kind != EXPR_BUILTIN_SYMBOL)
5114 switch (call->function->builtin_symbol.symbol->ID) {
5115 case T___builtin_va_end: return true;
5116 default: return false;
5120 /* Generate the warning if either the left or right hand side of a
5121 * conditional expression has no effect */
5122 case EXPR_CONDITIONAL: {
5123 const conditional_expression_t *const cond = &expr->conditional;
5125 expression_has_effect(cond->true_expression) &&
5126 expression_has_effect(cond->false_expression);
5129 case EXPR_SELECT: return false;
5130 case EXPR_ARRAY_ACCESS: return false;
5131 case EXPR_SIZEOF: return false;
5132 case EXPR_CLASSIFY_TYPE: return false;
5133 case EXPR_ALIGNOF: return false;
5135 case EXPR_FUNCTION: return false;
5136 case EXPR_PRETTY_FUNCTION: return false;
5137 case EXPR_BUILTIN_SYMBOL: break; /* handled in EXPR_CALL */
5138 case EXPR_BUILTIN_CONSTANT_P: return false;
5139 case EXPR_BUILTIN_PREFETCH: return true;
5140 case EXPR_OFFSETOF: return false;
5141 case EXPR_VA_START: return true;
5142 case EXPR_VA_ARG: return true;
5143 case EXPR_STATEMENT: return true; // TODO
5144 case EXPR_COMPOUND_LITERAL: return false;
5146 case EXPR_UNARY_NEGATE: return false;
5147 case EXPR_UNARY_PLUS: return false;
5148 case EXPR_UNARY_BITWISE_NEGATE: return false;
5149 case EXPR_UNARY_NOT: return false;
5150 case EXPR_UNARY_DEREFERENCE: return false;
5151 case EXPR_UNARY_TAKE_ADDRESS: return false;
5152 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
5153 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
5154 case EXPR_UNARY_PREFIX_INCREMENT: return true;
5155 case EXPR_UNARY_PREFIX_DECREMENT: return true;
5157 /* Treat void casts as if they have an effect in order to being able to
5158 * suppress the warning */
5159 case EXPR_UNARY_CAST: {
5160 type_t *const type = skip_typeref(expr->base.type);
5161 return is_type_atomic(type, ATOMIC_TYPE_VOID);
5164 case EXPR_UNARY_CAST_IMPLICIT: return true;
5165 case EXPR_UNARY_ASSUME: return true;
5166 case EXPR_UNARY_BITFIELD_EXTRACT: return false;
5168 case EXPR_BINARY_ADD: return false;
5169 case EXPR_BINARY_SUB: return false;
5170 case EXPR_BINARY_MUL: return false;
5171 case EXPR_BINARY_DIV: return false;
5172 case EXPR_BINARY_MOD: return false;
5173 case EXPR_BINARY_EQUAL: return false;
5174 case EXPR_BINARY_NOTEQUAL: return false;
5175 case EXPR_BINARY_LESS: return false;
5176 case EXPR_BINARY_LESSEQUAL: return false;
5177 case EXPR_BINARY_GREATER: return false;
5178 case EXPR_BINARY_GREATEREQUAL: return false;
5179 case EXPR_BINARY_BITWISE_AND: return false;
5180 case EXPR_BINARY_BITWISE_OR: return false;
5181 case EXPR_BINARY_BITWISE_XOR: return false;
5182 case EXPR_BINARY_SHIFTLEFT: return false;
5183 case EXPR_BINARY_SHIFTRIGHT: return false;
5184 case EXPR_BINARY_ASSIGN: return true;
5185 case EXPR_BINARY_MUL_ASSIGN: return true;
5186 case EXPR_BINARY_DIV_ASSIGN: return true;
5187 case EXPR_BINARY_MOD_ASSIGN: return true;
5188 case EXPR_BINARY_ADD_ASSIGN: return true;
5189 case EXPR_BINARY_SUB_ASSIGN: return true;
5190 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
5191 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
5192 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
5193 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
5194 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
5196 /* Only examine the right hand side of && and ||, because the left hand
5197 * side already has the effect of controlling the execution of the right
5199 case EXPR_BINARY_LOGICAL_AND:
5200 case EXPR_BINARY_LOGICAL_OR:
5201 /* Only examine the right hand side of a comma expression, because the left
5202 * hand side has a separate warning */
5203 case EXPR_BINARY_COMMA:
5204 return expression_has_effect(expr->binary.right);
5206 case EXPR_BINARY_BUILTIN_EXPECT: return true;
5207 case EXPR_BINARY_ISGREATER: return false;
5208 case EXPR_BINARY_ISGREATEREQUAL: return false;
5209 case EXPR_BINARY_ISLESS: return false;
5210 case EXPR_BINARY_ISLESSEQUAL: return false;
5211 case EXPR_BINARY_ISLESSGREATER: return false;
5212 case EXPR_BINARY_ISUNORDERED: return false;
5215 panic("unexpected statement");
5218 static void semantic_comma(binary_expression_t *expression)
5220 if (warning.unused_value) {
5221 const expression_t *const left = expression->left;
5222 if (!expression_has_effect(left)) {
5223 warningf(left->base.source_position, "left-hand operand of comma expression has no effect");
5226 expression->base.type = expression->right->base.type;
5229 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, sfunc, lr) \
5230 static expression_t *parse_##binexpression_type(unsigned precedence, \
5231 expression_t *left) \
5234 source_position_t pos = HERE; \
5236 expression_t *right = parse_sub_expression(precedence + lr); \
5238 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
5239 binexpr->base.source_position = pos; \
5240 binexpr->binary.left = left; \
5241 binexpr->binary.right = right; \
5242 sfunc(&binexpr->binary); \
5247 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, semantic_comma, 1)
5248 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, semantic_binexpr_arithmetic, 1)
5249 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, semantic_binexpr_arithmetic, 1)
5250 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, semantic_binexpr_arithmetic, 1)
5251 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, semantic_add, 1)
5252 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, semantic_sub, 1)
5253 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, semantic_comparison, 1)
5254 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, semantic_comparison, 1)
5255 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, semantic_binexpr_assign, 0)
5257 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL,
5258 semantic_comparison, 1)
5259 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL,
5260 semantic_comparison, 1)
5261 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL,
5262 semantic_comparison, 1)
5263 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL,
5264 semantic_comparison, 1)
5266 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND,
5267 semantic_binexpr_arithmetic, 1)
5268 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR,
5269 semantic_binexpr_arithmetic, 1)
5270 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR,
5271 semantic_binexpr_arithmetic, 1)
5272 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND,
5273 semantic_logical_op, 1)
5274 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR,
5275 semantic_logical_op, 1)
5276 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT,
5277 semantic_shift_op, 1)
5278 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT,
5279 semantic_shift_op, 1)
5280 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN,
5281 semantic_arithmetic_addsubb_assign, 0)
5282 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN,
5283 semantic_arithmetic_addsubb_assign, 0)
5284 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN,
5285 semantic_arithmetic_assign, 0)
5286 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN,
5287 semantic_arithmetic_assign, 0)
5288 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN,
5289 semantic_arithmetic_assign, 0)
5290 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN,
5291 semantic_arithmetic_assign, 0)
5292 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN,
5293 semantic_arithmetic_assign, 0)
5294 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN,
5295 semantic_arithmetic_assign, 0)
5296 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN,
5297 semantic_arithmetic_assign, 0)
5298 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN,
5299 semantic_arithmetic_assign, 0)
5301 static expression_t *parse_sub_expression(unsigned precedence)
5303 if(token.type < 0) {
5304 return expected_expression_error();
5307 expression_parser_function_t *parser
5308 = &expression_parsers[token.type];
5309 source_position_t source_position = token.source_position;
5312 if(parser->parser != NULL) {
5313 left = parser->parser(parser->precedence);
5315 left = parse_primary_expression();
5317 assert(left != NULL);
5318 left->base.source_position = source_position;
5321 if(token.type < 0) {
5322 return expected_expression_error();
5325 parser = &expression_parsers[token.type];
5326 if(parser->infix_parser == NULL)
5328 if(parser->infix_precedence < precedence)
5331 left = parser->infix_parser(parser->infix_precedence, left);
5333 assert(left != NULL);
5334 assert(left->kind != EXPR_UNKNOWN);
5335 left->base.source_position = source_position;
5342 * Parse an expression.
5344 static expression_t *parse_expression(void)
5346 return parse_sub_expression(1);
5350 * Register a parser for a prefix-like operator with given precedence.
5352 * @param parser the parser function
5353 * @param token_type the token type of the prefix token
5354 * @param precedence the precedence of the operator
5356 static void register_expression_parser(parse_expression_function parser,
5357 int token_type, unsigned precedence)
5359 expression_parser_function_t *entry = &expression_parsers[token_type];
5361 if(entry->parser != NULL) {
5362 diagnosticf("for token '%k'\n", (token_type_t)token_type);
5363 panic("trying to register multiple expression parsers for a token");
5365 entry->parser = parser;
5366 entry->precedence = precedence;
5370 * Register a parser for an infix operator with given precedence.
5372 * @param parser the parser function
5373 * @param token_type the token type of the infix operator
5374 * @param precedence the precedence of the operator
5376 static void register_infix_parser(parse_expression_infix_function parser,
5377 int token_type, unsigned precedence)
5379 expression_parser_function_t *entry = &expression_parsers[token_type];
5381 if(entry->infix_parser != NULL) {
5382 diagnosticf("for token '%k'\n", (token_type_t)token_type);
5383 panic("trying to register multiple infix expression parsers for a "
5386 entry->infix_parser = parser;
5387 entry->infix_precedence = precedence;
5391 * Initialize the expression parsers.
5393 static void init_expression_parsers(void)
5395 memset(&expression_parsers, 0, sizeof(expression_parsers));
5397 register_infix_parser(parse_array_expression, '[', 30);
5398 register_infix_parser(parse_call_expression, '(', 30);
5399 register_infix_parser(parse_select_expression, '.', 30);
5400 register_infix_parser(parse_select_expression, T_MINUSGREATER, 30);
5401 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT,
5403 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT,
5406 register_infix_parser(parse_EXPR_BINARY_MUL, '*', 16);
5407 register_infix_parser(parse_EXPR_BINARY_DIV, '/', 16);
5408 register_infix_parser(parse_EXPR_BINARY_MOD, '%', 16);
5409 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, 16);
5410 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, 16);
5411 register_infix_parser(parse_EXPR_BINARY_ADD, '+', 15);
5412 register_infix_parser(parse_EXPR_BINARY_SUB, '-', 15);
5413 register_infix_parser(parse_EXPR_BINARY_LESS, '<', 14);
5414 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', 14);
5415 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, 14);
5416 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, 14);
5417 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, 13);
5418 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL,
5419 T_EXCLAMATIONMARKEQUAL, 13);
5420 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', 12);
5421 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', 11);
5422 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', 10);
5423 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, 9);
5424 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, 8);
5425 register_infix_parser(parse_conditional_expression, '?', 7);
5426 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', 2);
5427 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, 2);
5428 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, 2);
5429 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, 2);
5430 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, 2);
5431 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, 2);
5432 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN,
5433 T_LESSLESSEQUAL, 2);
5434 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN,
5435 T_GREATERGREATEREQUAL, 2);
5436 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN,
5438 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN,
5440 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN,
5443 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', 1);
5445 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-', 25);
5446 register_expression_parser(parse_EXPR_UNARY_PLUS, '+', 25);
5447 register_expression_parser(parse_EXPR_UNARY_NOT, '!', 25);
5448 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~', 25);
5449 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*', 25);
5450 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&', 25);
5451 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT,
5453 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT,
5455 register_expression_parser(parse_sizeof, T_sizeof, 25);
5456 register_expression_parser(parse_alignof, T___alignof__, 25);
5457 register_expression_parser(parse_extension, T___extension__, 25);
5458 register_expression_parser(parse_builtin_classify_type,
5459 T___builtin_classify_type, 25);
5463 * Parse a asm statement constraints specification.
5465 static asm_constraint_t *parse_asm_constraints(void)
5467 asm_constraint_t *result = NULL;
5468 asm_constraint_t *last = NULL;
5470 while(token.type == T_STRING_LITERAL || token.type == '[') {
5471 asm_constraint_t *constraint = allocate_ast_zero(sizeof(constraint[0]));
5472 memset(constraint, 0, sizeof(constraint[0]));
5474 if(token.type == '[') {
5476 if(token.type != T_IDENTIFIER) {
5477 parse_error_expected("while parsing asm constraint",
5481 constraint->symbol = token.v.symbol;
5486 constraint->constraints = parse_string_literals();
5488 constraint->expression = parse_expression();
5492 last->next = constraint;
5494 result = constraint;
5498 if(token.type != ',')
5507 * Parse a asm statement clobber specification.
5509 static asm_clobber_t *parse_asm_clobbers(void)
5511 asm_clobber_t *result = NULL;
5512 asm_clobber_t *last = NULL;
5514 while(token.type == T_STRING_LITERAL) {
5515 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
5516 clobber->clobber = parse_string_literals();
5519 last->next = clobber;
5525 if(token.type != ',')
5534 * Parse an asm statement.
5536 static statement_t *parse_asm_statement(void)
5540 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
5541 statement->base.source_position = token.source_position;
5543 asm_statement_t *asm_statement = &statement->asms;
5545 if(token.type == T_volatile) {
5547 asm_statement->is_volatile = true;
5551 asm_statement->asm_text = parse_string_literals();
5553 if(token.type != ':')
5557 asm_statement->inputs = parse_asm_constraints();
5558 if(token.type != ':')
5562 asm_statement->outputs = parse_asm_constraints();
5563 if(token.type != ':')
5567 asm_statement->clobbers = parse_asm_clobbers();
5576 * Parse a case statement.
5578 static statement_t *parse_case_statement(void)
5582 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
5584 statement->base.source_position = token.source_position;
5585 statement->case_label.expression = parse_expression();
5587 if (c_mode & _GNUC) {
5588 if (token.type == T_DOTDOTDOT) {
5590 statement->case_label.end_range = parse_expression();
5596 if (! is_constant_expression(statement->case_label.expression)) {
5597 errorf(statement->base.source_position,
5598 "case label does not reduce to an integer constant");
5600 /* TODO: check if the case label is already known */
5601 if (current_switch != NULL) {
5602 /* link all cases into the switch statement */
5603 if (current_switch->last_case == NULL) {
5604 current_switch->first_case =
5605 current_switch->last_case = &statement->case_label;
5607 current_switch->last_case->next = &statement->case_label;
5610 errorf(statement->base.source_position,
5611 "case label not within a switch statement");
5614 statement->case_label.statement = parse_statement();
5620 * Finds an existing default label of a switch statement.
5622 static case_label_statement_t *
5623 find_default_label(const switch_statement_t *statement)
5625 case_label_statement_t *label = statement->first_case;
5626 for ( ; label != NULL; label = label->next) {
5627 if (label->expression == NULL)
5634 * Parse a default statement.
5636 static statement_t *parse_default_statement(void)
5640 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
5642 statement->base.source_position = token.source_position;
5645 if (current_switch != NULL) {
5646 const case_label_statement_t *def_label = find_default_label(current_switch);
5647 if (def_label != NULL) {
5648 errorf(HERE, "multiple default labels in one switch");
5649 errorf(def_label->base.source_position,
5650 "this is the first default label");
5652 /* link all cases into the switch statement */
5653 if (current_switch->last_case == NULL) {
5654 current_switch->first_case =
5655 current_switch->last_case = &statement->case_label;
5657 current_switch->last_case->next = &statement->case_label;
5661 errorf(statement->base.source_position,
5662 "'default' label not within a switch statement");
5664 statement->case_label.statement = parse_statement();
5670 * Return the declaration for a given label symbol or create a new one.
5672 static declaration_t *get_label(symbol_t *symbol)
5674 declaration_t *candidate = get_declaration(symbol, NAMESPACE_LABEL);
5675 assert(current_function != NULL);
5676 /* if we found a label in the same function, then we already created the
5678 if(candidate != NULL
5679 && candidate->parent_scope == ¤t_function->scope) {
5683 /* otherwise we need to create a new one */
5684 declaration_t *const declaration = allocate_declaration_zero();
5685 declaration->namespc = NAMESPACE_LABEL;
5686 declaration->symbol = symbol;
5688 label_push(declaration);
5694 * Parse a label statement.
5696 static statement_t *parse_label_statement(void)
5698 assert(token.type == T_IDENTIFIER);
5699 symbol_t *symbol = token.v.symbol;
5702 declaration_t *label = get_label(symbol);
5704 /* if source position is already set then the label is defined twice,
5705 * otherwise it was just mentioned in a goto so far */
5706 if(label->source_position.input_name != NULL) {
5707 errorf(HERE, "duplicate label '%Y'", symbol);
5708 errorf(label->source_position, "previous definition of '%Y' was here",
5711 label->source_position = token.source_position;
5714 statement_t *statement = allocate_statement_zero(STATEMENT_LABEL);
5716 statement->base.source_position = token.source_position;
5717 statement->label.label = label;
5721 if(token.type == '}') {
5722 /* TODO only warn? */
5723 errorf(HERE, "label at end of compound statement");
5726 if (token.type == ';') {
5727 /* eat an empty statement here, to avoid the warning about an empty
5728 * after a label. label:; is commonly used to have a label before
5732 statement->label.statement = parse_statement();
5736 /* remember the labels's in a list for later checking */
5737 if (label_last == NULL) {
5738 label_first = &statement->label;
5740 label_last->next = &statement->label;
5742 label_last = &statement->label;
5748 * Parse an if statement.
5750 static statement_t *parse_if(void)
5754 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
5755 statement->base.source_position = token.source_position;
5758 statement->ifs.condition = parse_expression();
5761 statement->ifs.true_statement = parse_statement();
5762 if(token.type == T_else) {
5764 statement->ifs.false_statement = parse_statement();
5771 * Parse a switch statement.
5773 static statement_t *parse_switch(void)
5777 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
5778 statement->base.source_position = token.source_position;
5781 expression_t *const expr = parse_expression();
5782 type_t * type = skip_typeref(expr->base.type);
5783 if (is_type_integer(type)) {
5784 type = promote_integer(type);
5785 } else if (is_type_valid(type)) {
5786 errorf(expr->base.source_position,
5787 "switch quantity is not an integer, but '%T'", type);
5788 type = type_error_type;
5790 statement->switchs.expression = create_implicit_cast(expr, type);
5793 switch_statement_t *rem = current_switch;
5794 current_switch = &statement->switchs;
5795 statement->switchs.body = parse_statement();
5796 current_switch = rem;
5798 if (warning.switch_default
5799 && find_default_label(&statement->switchs) == NULL) {
5800 warningf(statement->base.source_position, "switch has no default case");
5806 static statement_t *parse_loop_body(statement_t *const loop)
5808 statement_t *const rem = current_loop;
5809 current_loop = loop;
5811 statement_t *const body = parse_statement();
5818 * Parse a while statement.
5820 static statement_t *parse_while(void)
5824 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
5825 statement->base.source_position = token.source_position;
5828 statement->whiles.condition = parse_expression();
5831 statement->whiles.body = parse_loop_body(statement);
5837 * Parse a do statement.
5839 static statement_t *parse_do(void)
5843 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
5845 statement->base.source_position = token.source_position;
5847 statement->do_while.body = parse_loop_body(statement);
5851 statement->do_while.condition = parse_expression();
5859 * Parse a for statement.
5861 static statement_t *parse_for(void)
5865 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
5866 statement->base.source_position = token.source_position;
5870 int top = environment_top();
5871 scope_t *last_scope = scope;
5872 set_scope(&statement->fors.scope);
5874 if(token.type != ';') {
5875 if(is_declaration_specifier(&token, false)) {
5876 parse_declaration(record_declaration);
5878 expression_t *const init = parse_expression();
5879 statement->fors.initialisation = init;
5880 if (warning.unused_value && !expression_has_effect(init)) {
5881 warningf(init->base.source_position, "initialisation of 'for'-statement has no effect");
5889 if(token.type != ';') {
5890 statement->fors.condition = parse_expression();
5893 if(token.type != ')') {
5894 expression_t *const step = parse_expression();
5895 statement->fors.step = step;
5896 if (warning.unused_value && !expression_has_effect(step)) {
5897 warningf(step->base.source_position, "step of 'for'-statement has no effect");
5901 statement->fors.body = parse_loop_body(statement);
5903 assert(scope == &statement->fors.scope);
5904 set_scope(last_scope);
5905 environment_pop_to(top);
5911 * Parse a goto statement.
5913 static statement_t *parse_goto(void)
5917 if(token.type != T_IDENTIFIER) {
5918 parse_error_expected("while parsing goto", T_IDENTIFIER, 0);
5922 symbol_t *symbol = token.v.symbol;
5925 declaration_t *label = get_label(symbol);
5927 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
5928 statement->base.source_position = token.source_position;
5930 statement->gotos.label = label;
5932 /* remember the goto's in a list for later checking */
5933 if (goto_last == NULL) {
5934 goto_first = &statement->gotos;
5936 goto_last->next = &statement->gotos;
5938 goto_last = &statement->gotos;
5946 * Parse a continue statement.
5948 static statement_t *parse_continue(void)
5950 statement_t *statement;
5951 if (current_loop == NULL) {
5952 errorf(HERE, "continue statement not within loop");
5955 statement = allocate_statement_zero(STATEMENT_CONTINUE);
5957 statement->base.source_position = token.source_position;
5967 * Parse a break statement.
5969 static statement_t *parse_break(void)
5971 statement_t *statement;
5972 if (current_switch == NULL && current_loop == NULL) {
5973 errorf(HERE, "break statement not within loop or switch");
5976 statement = allocate_statement_zero(STATEMENT_BREAK);
5978 statement->base.source_position = token.source_position;
5988 * Check if a given declaration represents a local variable.
5990 static bool is_local_var_declaration(const declaration_t *declaration) {
5991 switch ((storage_class_tag_t) declaration->storage_class) {
5992 case STORAGE_CLASS_AUTO:
5993 case STORAGE_CLASS_REGISTER: {
5994 const type_t *type = skip_typeref(declaration->type);
5995 if(is_type_function(type)) {
6007 * Check if a given declaration represents a variable.
6009 static bool is_var_declaration(const declaration_t *declaration) {
6010 if(declaration->storage_class == STORAGE_CLASS_TYPEDEF)
6013 const type_t *type = skip_typeref(declaration->type);
6014 return !is_type_function(type);
6018 * Check if a given expression represents a local variable.
6020 static bool is_local_variable(const expression_t *expression)
6022 if (expression->base.kind != EXPR_REFERENCE) {
6025 const declaration_t *declaration = expression->reference.declaration;
6026 return is_local_var_declaration(declaration);
6030 * Check if a given expression represents a local variable and
6031 * return its declaration then, else return NULL.
6033 declaration_t *expr_is_variable(const expression_t *expression)
6035 if (expression->base.kind != EXPR_REFERENCE) {
6038 declaration_t *declaration = expression->reference.declaration;
6039 if (is_var_declaration(declaration))
6045 * Parse a return statement.
6047 static statement_t *parse_return(void)
6051 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
6052 statement->base.source_position = token.source_position;
6054 expression_t *return_value = NULL;
6055 if(token.type != ';') {
6056 return_value = parse_expression();
6060 const type_t *const func_type = current_function->type;
6061 assert(is_type_function(func_type));
6062 type_t *const return_type = skip_typeref(func_type->function.return_type);
6064 if(return_value != NULL) {
6065 type_t *return_value_type = skip_typeref(return_value->base.type);
6067 if(is_type_atomic(return_type, ATOMIC_TYPE_VOID)
6068 && !is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
6069 warningf(statement->base.source_position,
6070 "'return' with a value, in function returning void");
6071 return_value = NULL;
6073 type_t *const res_type = semantic_assign(return_type,
6074 return_value, "'return'");
6075 if (res_type == NULL) {
6076 errorf(statement->base.source_position,
6077 "cannot return something of type '%T' in function returning '%T'",
6078 return_value->base.type, return_type);
6080 return_value = create_implicit_cast(return_value, res_type);
6083 /* check for returning address of a local var */
6084 if (return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
6085 const expression_t *expression = return_value->unary.value;
6086 if (is_local_variable(expression)) {
6087 warningf(statement->base.source_position,
6088 "function returns address of local variable");
6092 if(!is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
6093 warningf(statement->base.source_position,
6094 "'return' without value, in function returning non-void");
6097 statement->returns.value = return_value;
6103 * Parse a declaration statement.
6105 static statement_t *parse_declaration_statement(void)
6107 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
6109 statement->base.source_position = token.source_position;
6111 declaration_t *before = last_declaration;
6112 parse_declaration(record_declaration);
6114 if(before == NULL) {
6115 statement->declaration.declarations_begin = scope->declarations;
6117 statement->declaration.declarations_begin = before->next;
6119 statement->declaration.declarations_end = last_declaration;
6125 * Parse an expression statement, ie. expr ';'.
6127 static statement_t *parse_expression_statement(void)
6129 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
6131 statement->base.source_position = token.source_position;
6132 expression_t *const expr = parse_expression();
6133 statement->expression.expression = expr;
6135 if (warning.unused_value && !expression_has_effect(expr)) {
6136 warningf(expr->base.source_position, "statement has no effect");
6145 * Parse a statement.
6147 static statement_t *parse_statement(void)
6149 statement_t *statement = NULL;
6151 /* declaration or statement */
6152 switch(token.type) {
6154 statement = parse_asm_statement();
6158 statement = parse_case_statement();
6162 statement = parse_default_statement();
6166 statement = parse_compound_statement();
6170 statement = parse_if();
6174 statement = parse_switch();
6178 statement = parse_while();
6182 statement = parse_do();
6186 statement = parse_for();
6190 statement = parse_goto();
6194 statement = parse_continue();
6198 statement = parse_break();
6202 statement = parse_return();
6206 if (warning.empty_statement) {
6207 warningf(HERE, "statement is empty");
6214 if(look_ahead(1)->type == ':') {
6215 statement = parse_label_statement();
6219 if(is_typedef_symbol(token.v.symbol)) {
6220 statement = parse_declaration_statement();
6224 statement = parse_expression_statement();
6227 case T___extension__:
6228 /* this can be a prefix to a declaration or an expression statement */
6229 /* we simply eat it now and parse the rest with tail recursion */
6232 } while(token.type == T___extension__);
6233 statement = parse_statement();
6237 statement = parse_declaration_statement();
6241 statement = parse_expression_statement();
6245 assert(statement == NULL
6246 || statement->base.source_position.input_name != NULL);
6252 * Parse a compound statement.
6254 static statement_t *parse_compound_statement(void)
6256 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
6258 statement->base.source_position = token.source_position;
6262 int top = environment_top();
6263 scope_t *last_scope = scope;
6264 set_scope(&statement->compound.scope);
6266 statement_t *last_statement = NULL;
6268 while(token.type != '}' && token.type != T_EOF) {
6269 statement_t *sub_statement = parse_statement();
6270 if(sub_statement == NULL)
6273 if(last_statement != NULL) {
6274 last_statement->base.next = sub_statement;
6276 statement->compound.statements = sub_statement;
6279 while(sub_statement->base.next != NULL)
6280 sub_statement = sub_statement->base.next;
6282 last_statement = sub_statement;
6285 if(token.type == '}') {
6288 errorf(statement->base.source_position,
6289 "end of file while looking for closing '}'");
6292 assert(scope == &statement->compound.scope);
6293 set_scope(last_scope);
6294 environment_pop_to(top);
6300 * Initialize builtin types.
6302 static void initialize_builtin_types(void)
6304 type_intmax_t = make_global_typedef("__intmax_t__", type_long_long);
6305 type_size_t = make_global_typedef("__SIZE_TYPE__", type_unsigned_long);
6306 type_ssize_t = make_global_typedef("__SSIZE_TYPE__", type_long);
6307 type_ptrdiff_t = make_global_typedef("__PTRDIFF_TYPE__", type_long);
6308 type_uintmax_t = make_global_typedef("__uintmax_t__", type_unsigned_long_long);
6309 type_uptrdiff_t = make_global_typedef("__UPTRDIFF_TYPE__", type_unsigned_long);
6310 type_wchar_t = make_global_typedef("__WCHAR_TYPE__", type_int);
6311 type_wint_t = make_global_typedef("__WINT_TYPE__", type_int);
6313 type_intmax_t_ptr = make_pointer_type(type_intmax_t, TYPE_QUALIFIER_NONE);
6314 type_ptrdiff_t_ptr = make_pointer_type(type_ptrdiff_t, TYPE_QUALIFIER_NONE);
6315 type_ssize_t_ptr = make_pointer_type(type_ssize_t, TYPE_QUALIFIER_NONE);
6316 type_wchar_t_ptr = make_pointer_type(type_wchar_t, TYPE_QUALIFIER_NONE);
6320 * Check for unused global static functions and variables
6322 static void check_unused_globals(void)
6324 if (!warning.unused_function && !warning.unused_variable)
6327 for (const declaration_t *decl = global_scope->declarations; decl != NULL; decl = decl->next) {
6328 if (decl->used || decl->storage_class != STORAGE_CLASS_STATIC)
6331 type_t *const type = decl->type;
6333 if (is_type_function(skip_typeref(type))) {
6334 if (!warning.unused_function || decl->is_inline)
6337 s = (decl->init.statement != NULL ? "defined" : "declared");
6339 if (!warning.unused_variable)
6345 warningf(decl->source_position, "'%#T' %s but not used",
6346 type, decl->symbol, s);
6351 * Parse a translation unit.
6353 static translation_unit_t *parse_translation_unit(void)
6355 translation_unit_t *unit = allocate_ast_zero(sizeof(unit[0]));
6357 assert(global_scope == NULL);
6358 global_scope = &unit->scope;
6360 assert(scope == NULL);
6361 set_scope(&unit->scope);
6363 initialize_builtin_types();
6365 while(token.type != T_EOF) {
6366 if (token.type == ';') {
6367 /* TODO error in strict mode */
6368 warningf(HERE, "stray ';' outside of function");
6371 parse_external_declaration();
6375 assert(scope == &unit->scope);
6377 last_declaration = NULL;
6379 assert(global_scope == &unit->scope);
6380 check_unused_globals();
6381 global_scope = NULL;
6389 * @return the translation unit or NULL if errors occurred.
6391 translation_unit_t *parse(void)
6393 environment_stack = NEW_ARR_F(stack_entry_t, 0);
6394 label_stack = NEW_ARR_F(stack_entry_t, 0);
6395 diagnostic_count = 0;
6399 type_set_output(stderr);
6400 ast_set_output(stderr);
6402 lookahead_bufpos = 0;
6403 for(int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
6406 translation_unit_t *unit = parse_translation_unit();
6408 DEL_ARR_F(environment_stack);
6409 DEL_ARR_F(label_stack);
6418 * Initialize the parser.
6420 void init_parser(void)
6422 init_expression_parsers();
6423 obstack_init(&temp_obst);
6425 symbol_t *const va_list_sym = symbol_table_insert("__builtin_va_list");
6426 type_valist = create_builtin_type(va_list_sym, type_void_ptr);
6430 * Terminate the parser.
6432 void exit_parser(void)
6434 obstack_free(&temp_obst, NULL);