2 * This file is part of cparser.
3 * Copyright (C) 2007-2009 Matthias Braun <matze@braunis.de>
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * as published by the Free Software Foundation; either version 2
8 * of the License, or (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
26 #include "adt/strutil.h"
28 #include "diagnostic.h"
29 #include "format_check.h"
35 #include "type_hash.h"
38 #include "attribute_t.h"
39 #include "lang_features.h"
43 #include "adt/bitfiddle.h"
44 #include "adt/error.h"
45 #include "adt/array.h"
47 //#define PRINT_TOKENS
48 #define MAX_LOOKAHEAD 1
53 entity_namespace_t namespc;
56 typedef struct declaration_specifiers_t declaration_specifiers_t;
57 struct declaration_specifiers_t {
58 source_position_t source_position;
59 storage_class_t storage_class;
60 unsigned char alignment; /**< Alignment, 0 if not set. */
62 bool thread_local : 1; /**< GCC __thread */
63 attribute_t *attributes; /**< list of attributes */
68 * An environment for parsing initializers (and compound literals).
70 typedef struct parse_initializer_env_t {
71 type_t *type; /**< the type of the initializer. In case of an
72 array type with unspecified size this gets
73 adjusted to the actual size. */
74 entity_t *entity; /**< the variable that is initialized if any */
75 bool must_be_constant;
76 } parse_initializer_env_t;
78 typedef entity_t* (*parsed_declaration_func) (entity_t *declaration, bool is_definition);
80 /** The current token. */
82 /** The lookahead ring-buffer. */
83 static token_t lookahead_buffer[MAX_LOOKAHEAD];
84 /** Position of the next token in the lookahead buffer. */
85 static size_t lookahead_bufpos;
86 static stack_entry_t *environment_stack = NULL;
87 static stack_entry_t *label_stack = NULL;
88 static scope_t *file_scope = NULL;
89 static scope_t *current_scope = NULL;
90 /** Point to the current function declaration if inside a function. */
91 static function_t *current_function = NULL;
92 static entity_t *current_entity = NULL;
93 static switch_statement_t *current_switch = NULL;
94 static statement_t *current_loop = NULL;
95 static statement_t *current_parent = NULL;
96 static ms_try_statement_t *current_try = NULL;
97 static linkage_kind_t current_linkage;
98 static goto_statement_t *goto_first = NULL;
99 static goto_statement_t **goto_anchor = NULL;
100 static label_statement_t *label_first = NULL;
101 static label_statement_t **label_anchor = NULL;
102 /** current translation unit. */
103 static translation_unit_t *unit = NULL;
104 /** true if we are in an __extension__ context. */
105 static bool in_gcc_extension = false;
106 static struct obstack temp_obst;
107 static entity_t *anonymous_entity;
108 static declaration_t **incomplete_arrays;
109 static elf_visibility_tag_t default_visibility = ELF_VISIBILITY_DEFAULT;
112 #define PUSH_PARENT(stmt) \
113 statement_t *const new_parent = (stmt); \
114 statement_t *const old_parent = current_parent; \
115 ((void)(current_parent = new_parent))
116 #define POP_PARENT() (assert(current_parent == new_parent), (void)(current_parent = old_parent))
118 #define PUSH_SCOPE(scope) \
119 size_t const top = environment_top(); \
120 scope_t *const new_scope = (scope); \
121 scope_t *const old_scope = (new_scope ? scope_push(new_scope) : NULL)
122 #define PUSH_SCOPE_STATEMENT(scope) PUSH_SCOPE(c_mode & (_C99 | _CXX) ? (scope) : NULL)
123 #define POP_SCOPE() (new_scope ? assert(current_scope == new_scope), scope_pop(old_scope), environment_pop_to(top) : (void)0)
125 #define PUSH_EXTENSION() \
127 bool const old_gcc_extension = in_gcc_extension; \
128 while (next_if(T___extension__)) { \
129 in_gcc_extension = true; \
132 #define POP_EXTENSION() \
133 ((void)(in_gcc_extension = old_gcc_extension))
135 /** special symbol used for anonymous entities. */
136 static symbol_t *sym_anonymous = NULL;
138 /** The token anchor set */
139 static unsigned short token_anchor_set[T_LAST_TOKEN];
141 /** The current source position. */
142 #define HERE (&token.base.source_position)
144 /** true if we are in GCC mode. */
145 #define GNU_MODE ((c_mode & _GNUC) || in_gcc_extension)
147 static statement_t *parse_compound_statement(bool inside_expression_statement);
148 static statement_t *parse_statement(void);
150 static expression_t *parse_subexpression(precedence_t);
151 static expression_t *parse_expression(void);
152 static type_t *parse_typename(void);
153 static void parse_externals(void);
154 static void parse_external(void);
156 static void parse_compound_type_entries(compound_t *compound_declaration);
158 static void check_call_argument(type_t *expected_type,
159 call_argument_t *argument, unsigned pos);
161 typedef enum declarator_flags_t {
163 DECL_MAY_BE_ABSTRACT = 1U << 0,
164 DECL_CREATE_COMPOUND_MEMBER = 1U << 1,
165 DECL_IS_PARAMETER = 1U << 2
166 } declarator_flags_t;
168 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
169 declarator_flags_t flags);
171 static void semantic_comparison(binary_expression_t *expression);
173 #define STORAGE_CLASSES \
174 STORAGE_CLASSES_NO_EXTERN \
177 #define STORAGE_CLASSES_NO_EXTERN \
184 #define TYPE_QUALIFIERS \
189 case T__forceinline: \
190 case T___attribute__:
192 #define COMPLEX_SPECIFIERS \
194 #define IMAGINARY_SPECIFIERS \
197 #define TYPE_SPECIFIERS \
199 case T___builtin_va_list: \
224 #define DECLARATION_START \
229 #define DECLARATION_START_NO_EXTERN \
230 STORAGE_CLASSES_NO_EXTERN \
234 #define EXPRESSION_START \
243 case T_CHARACTER_CONSTANT: \
244 case T_FLOATINGPOINT: \
245 case T_FLOATINGPOINT_HEXADECIMAL: \
247 case T_INTEGER_HEXADECIMAL: \
248 case T_INTEGER_OCTAL: \
251 case T_STRING_LITERAL: \
252 case T_WIDE_CHARACTER_CONSTANT: \
253 case T_WIDE_STRING_LITERAL: \
254 case T___FUNCDNAME__: \
255 case T___FUNCSIG__: \
256 case T___FUNCTION__: \
257 case T___PRETTY_FUNCTION__: \
258 case T___alignof__: \
259 case T___builtin_classify_type: \
260 case T___builtin_constant_p: \
261 case T___builtin_isgreater: \
262 case T___builtin_isgreaterequal: \
263 case T___builtin_isless: \
264 case T___builtin_islessequal: \
265 case T___builtin_islessgreater: \
266 case T___builtin_isunordered: \
267 case T___builtin_offsetof: \
268 case T___builtin_va_arg: \
269 case T___builtin_va_copy: \
270 case T___builtin_va_start: \
281 * Returns the size of a statement node.
283 * @param kind the statement kind
285 static size_t get_statement_struct_size(statement_kind_t kind)
287 static const size_t sizes[] = {
288 [STATEMENT_ERROR] = sizeof(statement_base_t),
289 [STATEMENT_EMPTY] = sizeof(statement_base_t),
290 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
291 [STATEMENT_RETURN] = sizeof(return_statement_t),
292 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
293 [STATEMENT_IF] = sizeof(if_statement_t),
294 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
295 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
296 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
297 [STATEMENT_BREAK] = sizeof(statement_base_t),
298 [STATEMENT_COMPUTED_GOTO] = sizeof(computed_goto_statement_t),
299 [STATEMENT_GOTO] = sizeof(goto_statement_t),
300 [STATEMENT_LABEL] = sizeof(label_statement_t),
301 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
302 [STATEMENT_WHILE] = sizeof(while_statement_t),
303 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
304 [STATEMENT_FOR] = sizeof(for_statement_t),
305 [STATEMENT_ASM] = sizeof(asm_statement_t),
306 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
307 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
309 assert((size_t)kind < lengthof(sizes));
310 assert(sizes[kind] != 0);
315 * Returns the size of an expression node.
317 * @param kind the expression kind
319 static size_t get_expression_struct_size(expression_kind_t kind)
321 static const size_t sizes[] = {
322 [EXPR_ERROR] = sizeof(expression_base_t),
323 [EXPR_REFERENCE] = sizeof(reference_expression_t),
324 [EXPR_ENUM_CONSTANT] = sizeof(reference_expression_t),
325 [EXPR_LITERAL_BOOLEAN] = sizeof(literal_expression_t),
326 [EXPR_LITERAL_INTEGER] = sizeof(literal_expression_t),
327 [EXPR_LITERAL_INTEGER_OCTAL] = sizeof(literal_expression_t),
328 [EXPR_LITERAL_INTEGER_HEXADECIMAL]= sizeof(literal_expression_t),
329 [EXPR_LITERAL_FLOATINGPOINT] = sizeof(literal_expression_t),
330 [EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL] = sizeof(literal_expression_t),
331 [EXPR_LITERAL_CHARACTER] = sizeof(literal_expression_t),
332 [EXPR_LITERAL_WIDE_CHARACTER] = sizeof(literal_expression_t),
333 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
334 [EXPR_WIDE_STRING_LITERAL] = sizeof(string_literal_expression_t),
335 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
336 [EXPR_CALL] = sizeof(call_expression_t),
337 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
338 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
339 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
340 [EXPR_SELECT] = sizeof(select_expression_t),
341 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
342 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
343 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
344 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
345 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
346 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
347 [EXPR_BUILTIN_TYPES_COMPATIBLE_P] = sizeof(builtin_types_compatible_expression_t),
348 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
349 [EXPR_VA_START] = sizeof(va_start_expression_t),
350 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
351 [EXPR_VA_COPY] = sizeof(va_copy_expression_t),
352 [EXPR_STATEMENT] = sizeof(statement_expression_t),
353 [EXPR_LABEL_ADDRESS] = sizeof(label_address_expression_t),
355 if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
356 return sizes[EXPR_UNARY_FIRST];
358 if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
359 return sizes[EXPR_BINARY_FIRST];
361 assert((size_t)kind < lengthof(sizes));
362 assert(sizes[kind] != 0);
367 * Allocate a statement node of given kind and initialize all
368 * fields with zero. Sets its source position to the position
369 * of the current token.
371 static statement_t *allocate_statement_zero(statement_kind_t kind)
373 size_t size = get_statement_struct_size(kind);
374 statement_t *res = allocate_ast_zero(size);
376 res->base.kind = kind;
377 res->base.parent = current_parent;
378 res->base.source_position = token.base.source_position;
383 * Allocate an expression node of given kind and initialize all
386 * @param kind the kind of the expression to allocate
388 static expression_t *allocate_expression_zero(expression_kind_t kind)
390 size_t size = get_expression_struct_size(kind);
391 expression_t *res = allocate_ast_zero(size);
393 res->base.kind = kind;
394 res->base.type = type_error_type;
395 res->base.source_position = token.base.source_position;
400 * Creates a new invalid expression at the source position
401 * of the current token.
403 static expression_t *create_error_expression(void)
405 expression_t *expression = allocate_expression_zero(EXPR_ERROR);
406 expression->base.type = type_error_type;
411 * Creates a new invalid statement.
413 static statement_t *create_error_statement(void)
415 return allocate_statement_zero(STATEMENT_ERROR);
419 * Allocate a new empty statement.
421 static statement_t *create_empty_statement(void)
423 return allocate_statement_zero(STATEMENT_EMPTY);
427 * Returns the size of an initializer node.
429 * @param kind the initializer kind
431 static size_t get_initializer_size(initializer_kind_t kind)
433 static const size_t sizes[] = {
434 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
435 [INITIALIZER_STRING] = sizeof(initializer_string_t),
436 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
437 [INITIALIZER_LIST] = sizeof(initializer_list_t),
438 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
440 assert((size_t)kind < lengthof(sizes));
441 assert(sizes[kind] != 0);
446 * Allocate an initializer node of given kind and initialize all
449 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
451 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
458 * Returns the index of the top element of the environment stack.
460 static size_t environment_top(void)
462 return ARR_LEN(environment_stack);
466 * Returns the index of the top element of the global label stack.
468 static size_t label_top(void)
470 return ARR_LEN(label_stack);
474 * Return the next token.
476 static inline void next_token(void)
478 token = lookahead_buffer[lookahead_bufpos];
479 lookahead_buffer[lookahead_bufpos] = lexer_token;
482 lookahead_bufpos = (lookahead_bufpos + 1) % MAX_LOOKAHEAD;
485 print_token(stderr, &token);
486 fprintf(stderr, "\n");
490 static inline bool next_if(int const type)
492 if (token.kind == type) {
501 * Return the next token with a given lookahead.
503 static inline const token_t *look_ahead(size_t num)
505 assert(0 < num && num <= MAX_LOOKAHEAD);
506 size_t pos = (lookahead_bufpos + num - 1) % MAX_LOOKAHEAD;
507 return &lookahead_buffer[pos];
511 * Adds a token type to the token type anchor set (a multi-set).
513 static void add_anchor_token(int token_kind)
515 assert(0 <= token_kind && token_kind < T_LAST_TOKEN);
516 ++token_anchor_set[token_kind];
520 * Remove a token type from the token type anchor set (a multi-set).
522 static void rem_anchor_token(int token_kind)
524 assert(0 <= token_kind && token_kind < T_LAST_TOKEN);
525 assert(token_anchor_set[token_kind] != 0);
526 --token_anchor_set[token_kind];
530 * Eat tokens until a matching token type is found.
532 static void eat_until_matching_token(int type)
536 case '(': end_token = ')'; break;
537 case '{': end_token = '}'; break;
538 case '[': end_token = ']'; break;
539 default: end_token = type; break;
542 unsigned parenthesis_count = 0;
543 unsigned brace_count = 0;
544 unsigned bracket_count = 0;
545 while (token.kind != end_token ||
546 parenthesis_count != 0 ||
548 bracket_count != 0) {
549 switch (token.kind) {
551 case '(': ++parenthesis_count; break;
552 case '{': ++brace_count; break;
553 case '[': ++bracket_count; break;
556 if (parenthesis_count > 0)
566 if (bracket_count > 0)
569 if (token.kind == end_token &&
570 parenthesis_count == 0 &&
584 * Eat input tokens until an anchor is found.
586 static void eat_until_anchor(void)
588 while (token_anchor_set[token.kind] == 0) {
589 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
590 eat_until_matching_token(token.kind);
596 * Eat a whole block from input tokens.
598 static void eat_block(void)
600 eat_until_matching_token('{');
604 #define eat(token_kind) (assert(token.kind == (token_kind)), next_token())
607 * Report a parse error because an expected token was not found.
610 #if defined __GNUC__ && __GNUC__ >= 4
611 __attribute__((sentinel))
613 void parse_error_expected(const char *message, ...)
615 if (message != NULL) {
616 errorf(HERE, "%s", message);
619 va_start(ap, message);
620 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
625 * Report an incompatible type.
627 static void type_error_incompatible(const char *msg,
628 const source_position_t *source_position, type_t *type1, type_t *type2)
630 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
635 * Expect the current token is the expected token.
636 * If not, generate an error and skip until the next anchor.
638 static void expect(token_kind_t const expected)
640 if (UNLIKELY(token.kind != expected)) {
641 parse_error_expected(NULL, expected, NULL);
642 add_anchor_token(expected);
644 rem_anchor_token(expected);
645 if (token.kind != expected)
651 static symbol_t *expect_identifier(char const *const context, source_position_t *const pos)
653 if (token.kind != T_IDENTIFIER) {
654 parse_error_expected(context, T_IDENTIFIER, NULL);
655 add_anchor_token(T_IDENTIFIER);
657 rem_anchor_token(T_IDENTIFIER);
658 if (token.kind != T_IDENTIFIER)
661 symbol_t *const sym = token.identifier.symbol;
669 * Push a given scope on the scope stack and make it the
672 static scope_t *scope_push(scope_t *new_scope)
674 if (current_scope != NULL) {
675 new_scope->depth = current_scope->depth + 1;
678 scope_t *old_scope = current_scope;
679 current_scope = new_scope;
684 * Pop the current scope from the scope stack.
686 static void scope_pop(scope_t *old_scope)
688 current_scope = old_scope;
692 * Search an entity by its symbol in a given namespace.
694 static entity_t *get_entity(const symbol_t *const symbol,
695 namespace_tag_t namespc)
697 entity_t *entity = symbol->entity;
698 for (; entity != NULL; entity = entity->base.symbol_next) {
699 if ((namespace_tag_t)entity->base.namespc == namespc)
706 /* §6.2.3:1 24) There is only one name space for tags even though three are
708 static entity_t *get_tag(symbol_t const *const symbol,
709 entity_kind_tag_t const kind)
711 entity_t *entity = get_entity(symbol, NAMESPACE_TAG);
712 if (entity != NULL && (entity_kind_tag_t)entity->kind != kind) {
714 "'%Y' defined as wrong kind of tag (previous definition %P)",
715 symbol, &entity->base.source_position);
722 * pushs an entity on the environment stack and links the corresponding symbol
725 static void stack_push(stack_entry_t **stack_ptr, entity_t *entity)
727 symbol_t *symbol = entity->base.symbol;
728 entity_namespace_t namespc = entity->base.namespc;
729 assert(namespc != 0);
731 /* replace/add entity into entity list of the symbol */
734 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
739 /* replace an entry? */
740 if (iter->base.namespc == namespc) {
741 entity->base.symbol_next = iter->base.symbol_next;
747 /* remember old declaration */
749 entry.symbol = symbol;
750 entry.old_entity = iter;
751 entry.namespc = namespc;
752 ARR_APP1(stack_entry_t, *stack_ptr, entry);
756 * Push an entity on the environment stack.
758 static void environment_push(entity_t *entity)
760 assert(entity->base.source_position.input_name != NULL);
761 assert(entity->base.parent_scope != NULL);
762 stack_push(&environment_stack, entity);
766 * Push a declaration on the global label stack.
768 * @param declaration the declaration
770 static void label_push(entity_t *label)
772 /* we abuse the parameters scope as parent for the labels */
773 label->base.parent_scope = ¤t_function->parameters;
774 stack_push(&label_stack, label);
778 * pops symbols from the environment stack until @p new_top is the top element
780 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
782 stack_entry_t *stack = *stack_ptr;
783 size_t top = ARR_LEN(stack);
786 assert(new_top <= top);
790 for (i = top; i > new_top; --i) {
791 stack_entry_t *entry = &stack[i - 1];
793 entity_t *old_entity = entry->old_entity;
794 symbol_t *symbol = entry->symbol;
795 entity_namespace_t namespc = entry->namespc;
797 /* replace with old_entity/remove */
800 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
802 assert(iter != NULL);
803 /* replace an entry? */
804 if (iter->base.namespc == namespc)
808 /* restore definition from outer scopes (if there was one) */
809 if (old_entity != NULL) {
810 old_entity->base.symbol_next = iter->base.symbol_next;
811 *anchor = old_entity;
813 /* remove entry from list */
814 *anchor = iter->base.symbol_next;
818 ARR_SHRINKLEN(*stack_ptr, new_top);
822 * Pop all entries from the environment stack until the new_top
825 * @param new_top the new stack top
827 static void environment_pop_to(size_t new_top)
829 stack_pop_to(&environment_stack, new_top);
833 * Pop all entries from the global label stack until the new_top
836 * @param new_top the new stack top
838 static void label_pop_to(size_t new_top)
840 stack_pop_to(&label_stack, new_top);
843 static atomic_type_kind_t get_akind(const type_t *type)
845 assert(type->kind == TYPE_ATOMIC || type->kind == TYPE_COMPLEX
846 || type->kind == TYPE_IMAGINARY || type->kind == TYPE_ENUM);
847 return type->atomic.akind;
851 * §6.3.1.1:2 Do integer promotion for a given type.
853 * @param type the type to promote
854 * @return the promoted type
856 static type_t *promote_integer(type_t *type)
858 if (get_akind_rank(get_akind(type)) < get_akind_rank(ATOMIC_TYPE_INT))
865 * Check if a given expression represents a null pointer constant.
867 * @param expression the expression to check
869 static bool is_null_pointer_constant(const expression_t *expression)
871 /* skip void* cast */
872 if (expression->kind == EXPR_UNARY_CAST) {
873 type_t *const type = skip_typeref(expression->base.type);
874 if (types_compatible(type, type_void_ptr))
875 expression = expression->unary.value;
878 type_t *const type = skip_typeref(expression->base.type);
879 if (!is_type_integer(type))
881 switch (is_constant_expression(expression)) {
882 case EXPR_CLASS_ERROR: return true;
883 case EXPR_CLASS_CONSTANT: return !fold_constant_to_bool(expression);
884 default: return false;
889 * Create an implicit cast expression.
891 * @param expression the expression to cast
892 * @param dest_type the destination type
894 static expression_t *create_implicit_cast(expression_t *expression,
897 type_t *const source_type = expression->base.type;
899 if (source_type == dest_type)
902 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
903 cast->unary.value = expression;
904 cast->base.type = dest_type;
905 cast->base.implicit = true;
910 typedef enum assign_error_t {
912 ASSIGN_ERROR_INCOMPATIBLE,
913 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
914 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
915 ASSIGN_WARNING_POINTER_FROM_INT,
916 ASSIGN_WARNING_INT_FROM_POINTER
919 static void report_assign_error(assign_error_t error, type_t *orig_type_left, expression_t const *const right, char const *const context, source_position_t const *const pos)
921 type_t *const orig_type_right = right->base.type;
922 type_t *const type_left = skip_typeref(orig_type_left);
923 type_t *const type_right = skip_typeref(orig_type_right);
928 case ASSIGN_ERROR_INCOMPATIBLE:
929 errorf(pos, "destination type '%T' in %s is incompatible with type '%T'", orig_type_left, context, orig_type_right);
932 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
933 type_t *points_to_left = skip_typeref(type_left->pointer.points_to);
934 type_t *points_to_right = skip_typeref(type_right->pointer.points_to);
936 /* the left type has all qualifiers from the right type */
937 unsigned missing_qualifiers = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
938 warningf(WARN_OTHER, pos, "destination type '%T' in %s from type '%T' lacks qualifiers '%Q' in pointer target type", orig_type_left, context, orig_type_right, missing_qualifiers);
942 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
943 warningf(WARN_OTHER, pos, "destination type '%T' in %s is incompatible with '%E' of type '%T'", orig_type_left, context, right, orig_type_right);
946 case ASSIGN_WARNING_POINTER_FROM_INT:
947 warningf(WARN_OTHER, pos, "%s makes pointer '%T' from integer '%T' without a cast", context, orig_type_left, orig_type_right);
950 case ASSIGN_WARNING_INT_FROM_POINTER:
951 warningf(WARN_OTHER, pos, "%s makes integer '%T' from pointer '%T' without a cast", context, orig_type_left, orig_type_right);
955 panic("invalid error value");
959 /** Implements the rules from §6.5.16.1 */
960 static assign_error_t semantic_assign(type_t *orig_type_left,
961 const expression_t *const right)
963 type_t *const orig_type_right = right->base.type;
964 type_t *const type_left = skip_typeref(orig_type_left);
965 type_t *const type_right = skip_typeref(orig_type_right);
967 if (is_type_pointer(type_left)) {
968 if (is_null_pointer_constant(right)) {
969 return ASSIGN_SUCCESS;
970 } else if (is_type_pointer(type_right)) {
971 type_t *points_to_left
972 = skip_typeref(type_left->pointer.points_to);
973 type_t *points_to_right
974 = skip_typeref(type_right->pointer.points_to);
975 assign_error_t res = ASSIGN_SUCCESS;
977 /* the left type has all qualifiers from the right type */
978 unsigned missing_qualifiers
979 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
980 if (missing_qualifiers != 0) {
981 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
984 points_to_left = get_unqualified_type(points_to_left);
985 points_to_right = get_unqualified_type(points_to_right);
987 if (is_type_void(points_to_left))
990 if (is_type_void(points_to_right)) {
991 /* ISO/IEC 14882:1998(E) §C.1.2:6 */
992 return c_mode & _CXX ? ASSIGN_ERROR_INCOMPATIBLE : res;
995 if (!types_compatible(points_to_left, points_to_right)) {
996 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
1000 } else if (is_type_integer(type_right)) {
1001 return ASSIGN_WARNING_POINTER_FROM_INT;
1003 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1004 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1005 && is_type_pointer(type_right))) {
1006 return ASSIGN_SUCCESS;
1007 } else if (is_type_compound(type_left) && is_type_compound(type_right)) {
1008 type_t *const unqual_type_left = get_unqualified_type(type_left);
1009 type_t *const unqual_type_right = get_unqualified_type(type_right);
1010 if (types_compatible(unqual_type_left, unqual_type_right)) {
1011 return ASSIGN_SUCCESS;
1013 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1014 return ASSIGN_WARNING_INT_FROM_POINTER;
1017 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1018 return ASSIGN_SUCCESS;
1020 return ASSIGN_ERROR_INCOMPATIBLE;
1023 static expression_t *parse_constant_expression(void)
1025 expression_t *result = parse_subexpression(PREC_CONDITIONAL);
1027 if (is_constant_expression(result) == EXPR_CLASS_VARIABLE) {
1028 errorf(&result->base.source_position,
1029 "expression '%E' is not constant", result);
1035 static expression_t *parse_assignment_expression(void)
1037 return parse_subexpression(PREC_ASSIGNMENT);
1040 static void warn_string_concat(const source_position_t *pos)
1042 warningf(WARN_TRADITIONAL, pos, "traditional C rejects string constant concatenation");
1045 static string_t parse_string_literals(void)
1047 assert(token.kind == T_STRING_LITERAL);
1048 string_t result = token.string.string;
1052 while (token.kind == T_STRING_LITERAL) {
1053 warn_string_concat(&token.base.source_position);
1054 result = concat_strings(&result, &token.string.string);
1061 static attribute_t *allocate_attribute_zero(attribute_kind_t kind)
1063 attribute_t *attribute = allocate_ast_zero(sizeof(*attribute));
1064 attribute->kind = kind;
1065 attribute->source_position = *HERE;
1070 * Parse (gcc) attribute argument. From gcc comments in gcc source:
1073 * __attribute__ ( ( attribute-list ) )
1077 * attribute_list , attrib
1082 * any-word ( identifier )
1083 * any-word ( identifier , nonempty-expr-list )
1084 * any-word ( expr-list )
1086 * where the "identifier" must not be declared as a type, and
1087 * "any-word" may be any identifier (including one declared as a
1088 * type), a reserved word storage class specifier, type specifier or
1089 * type qualifier. ??? This still leaves out most reserved keywords
1090 * (following the old parser), shouldn't we include them, and why not
1091 * allow identifiers declared as types to start the arguments?
1093 * Matze: this all looks confusing and little systematic, so we're even less
1094 * strict and parse any list of things which are identifiers or
1095 * (assignment-)expressions.
1097 static attribute_argument_t *parse_attribute_arguments(void)
1099 attribute_argument_t *first = NULL;
1100 attribute_argument_t **anchor = &first;
1101 if (token.kind != ')') do {
1102 attribute_argument_t *argument = allocate_ast_zero(sizeof(*argument));
1104 /* is it an identifier */
1105 if (token.kind == T_IDENTIFIER
1106 && (look_ahead(1)->kind == ',' || look_ahead(1)->kind == ')')) {
1107 symbol_t *symbol = token.identifier.symbol;
1108 argument->kind = ATTRIBUTE_ARGUMENT_SYMBOL;
1109 argument->v.symbol = symbol;
1112 /* must be an expression */
1113 expression_t *expression = parse_assignment_expression();
1115 argument->kind = ATTRIBUTE_ARGUMENT_EXPRESSION;
1116 argument->v.expression = expression;
1119 /* append argument */
1121 anchor = &argument->next;
1122 } while (next_if(','));
1127 static attribute_t *parse_attribute_asm(void)
1129 attribute_t *attribute = allocate_attribute_zero(ATTRIBUTE_GNU_ASM);
1132 attribute->a.arguments = parse_attribute_arguments();
1136 static symbol_t *get_symbol_from_token(void)
1138 switch(token.kind) {
1140 return token.identifier.symbol;
1169 /* maybe we need more tokens ... add them on demand */
1170 return get_token_kind_symbol(token.kind);
1176 static attribute_t *parse_attribute_gnu_single(void)
1178 /* parse "any-word" */
1179 symbol_t *symbol = get_symbol_from_token();
1180 if (symbol == NULL) {
1181 parse_error_expected("while parsing attribute((", T_IDENTIFIER, NULL);
1185 attribute_kind_t kind;
1186 char const *const name = symbol->string;
1187 for (kind = ATTRIBUTE_GNU_FIRST;; ++kind) {
1188 if (kind > ATTRIBUTE_GNU_LAST) {
1189 warningf(WARN_ATTRIBUTE, HERE, "unknown attribute '%s' ignored", name);
1190 /* TODO: we should still save the attribute in the list... */
1191 kind = ATTRIBUTE_UNKNOWN;
1195 const char *attribute_name = get_attribute_name(kind);
1196 if (attribute_name != NULL && streq_underscore(attribute_name, name))
1200 attribute_t *attribute = allocate_attribute_zero(kind);
1203 /* parse arguments */
1205 attribute->a.arguments = parse_attribute_arguments();
1210 static attribute_t *parse_attribute_gnu(void)
1212 attribute_t *first = NULL;
1213 attribute_t **anchor = &first;
1215 eat(T___attribute__);
1219 add_anchor_token(')');
1220 add_anchor_token(',');
1221 if (token.kind != ')') do {
1222 attribute_t *attribute = parse_attribute_gnu_single();
1224 *anchor = attribute;
1225 anchor = &attribute->next;
1227 } while (next_if(','));
1228 rem_anchor_token(',');
1229 rem_anchor_token(')');
1236 /** Parse attributes. */
1237 static attribute_t *parse_attributes(attribute_t *first)
1239 attribute_t **anchor = &first;
1241 while (*anchor != NULL)
1242 anchor = &(*anchor)->next;
1244 attribute_t *attribute;
1245 switch (token.kind) {
1246 case T___attribute__:
1247 attribute = parse_attribute_gnu();
1248 if (attribute == NULL)
1253 attribute = parse_attribute_asm();
1257 attribute = allocate_attribute_zero(ATTRIBUTE_MS_CDECL);
1262 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FASTCALL);
1266 case T__forceinline:
1267 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FORCEINLINE);
1268 eat(T__forceinline);
1272 attribute = allocate_attribute_zero(ATTRIBUTE_MS_STDCALL);
1277 /* TODO record modifier */
1278 warningf(WARN_OTHER, HERE, "Ignoring declaration modifier %K", &token);
1279 attribute = allocate_attribute_zero(ATTRIBUTE_MS_THISCALL);
1287 *anchor = attribute;
1288 anchor = &attribute->next;
1292 static void mark_vars_read(expression_t *expr, entity_t *lhs_ent);
1294 static entity_t *determine_lhs_ent(expression_t *const expr,
1297 switch (expr->kind) {
1298 case EXPR_REFERENCE: {
1299 entity_t *const entity = expr->reference.entity;
1300 /* we should only find variables as lvalues... */
1301 if (entity->base.kind != ENTITY_VARIABLE
1302 && entity->base.kind != ENTITY_PARAMETER)
1308 case EXPR_ARRAY_ACCESS: {
1309 expression_t *const ref = expr->array_access.array_ref;
1310 entity_t * ent = NULL;
1311 if (is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1312 ent = determine_lhs_ent(ref, lhs_ent);
1315 mark_vars_read(ref, lhs_ent);
1317 mark_vars_read(expr->array_access.index, lhs_ent);
1322 mark_vars_read(expr->select.compound, lhs_ent);
1323 if (is_type_compound(skip_typeref(expr->base.type)))
1324 return determine_lhs_ent(expr->select.compound, lhs_ent);
1328 case EXPR_UNARY_DEREFERENCE: {
1329 expression_t *const val = expr->unary.value;
1330 if (val->kind == EXPR_UNARY_TAKE_ADDRESS) {
1332 return determine_lhs_ent(val->unary.value, lhs_ent);
1334 mark_vars_read(val, NULL);
1340 mark_vars_read(expr, NULL);
1345 #define ENT_ANY ((entity_t*)-1)
1348 * Mark declarations, which are read. This is used to detect variables, which
1352 * x is not marked as "read", because it is only read to calculate its own new
1356 * x and y are not detected as "not read", because multiple variables are
1359 static void mark_vars_read(expression_t *const expr, entity_t *lhs_ent)
1361 switch (expr->kind) {
1362 case EXPR_REFERENCE: {
1363 entity_t *const entity = expr->reference.entity;
1364 if (entity->kind != ENTITY_VARIABLE
1365 && entity->kind != ENTITY_PARAMETER)
1368 if (lhs_ent != entity && lhs_ent != ENT_ANY) {
1369 if (entity->kind == ENTITY_VARIABLE) {
1370 entity->variable.read = true;
1372 entity->parameter.read = true;
1379 // TODO respect pure/const
1380 mark_vars_read(expr->call.function, NULL);
1381 for (call_argument_t *arg = expr->call.arguments; arg != NULL; arg = arg->next) {
1382 mark_vars_read(arg->expression, NULL);
1386 case EXPR_CONDITIONAL:
1387 // TODO lhs_decl should depend on whether true/false have an effect
1388 mark_vars_read(expr->conditional.condition, NULL);
1389 if (expr->conditional.true_expression != NULL)
1390 mark_vars_read(expr->conditional.true_expression, lhs_ent);
1391 mark_vars_read(expr->conditional.false_expression, lhs_ent);
1395 if (lhs_ent == ENT_ANY
1396 && !is_type_compound(skip_typeref(expr->base.type)))
1398 mark_vars_read(expr->select.compound, lhs_ent);
1401 case EXPR_ARRAY_ACCESS: {
1402 mark_vars_read(expr->array_access.index, lhs_ent);
1403 expression_t *const ref = expr->array_access.array_ref;
1404 if (!is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1405 if (lhs_ent == ENT_ANY)
1408 mark_vars_read(ref, lhs_ent);
1413 mark_vars_read(expr->va_arge.ap, lhs_ent);
1417 mark_vars_read(expr->va_copye.src, lhs_ent);
1420 case EXPR_UNARY_CAST:
1421 /* Special case: Use void cast to mark a variable as "read" */
1422 if (is_type_void(skip_typeref(expr->base.type)))
1427 case EXPR_UNARY_THROW:
1428 if (expr->unary.value == NULL)
1431 case EXPR_UNARY_DEREFERENCE:
1432 case EXPR_UNARY_DELETE:
1433 case EXPR_UNARY_DELETE_ARRAY:
1434 if (lhs_ent == ENT_ANY)
1438 case EXPR_UNARY_NEGATE:
1439 case EXPR_UNARY_PLUS:
1440 case EXPR_UNARY_BITWISE_NEGATE:
1441 case EXPR_UNARY_NOT:
1442 case EXPR_UNARY_TAKE_ADDRESS:
1443 case EXPR_UNARY_POSTFIX_INCREMENT:
1444 case EXPR_UNARY_POSTFIX_DECREMENT:
1445 case EXPR_UNARY_PREFIX_INCREMENT:
1446 case EXPR_UNARY_PREFIX_DECREMENT:
1447 case EXPR_UNARY_ASSUME:
1449 mark_vars_read(expr->unary.value, lhs_ent);
1452 case EXPR_BINARY_ADD:
1453 case EXPR_BINARY_SUB:
1454 case EXPR_BINARY_MUL:
1455 case EXPR_BINARY_DIV:
1456 case EXPR_BINARY_MOD:
1457 case EXPR_BINARY_EQUAL:
1458 case EXPR_BINARY_NOTEQUAL:
1459 case EXPR_BINARY_LESS:
1460 case EXPR_BINARY_LESSEQUAL:
1461 case EXPR_BINARY_GREATER:
1462 case EXPR_BINARY_GREATEREQUAL:
1463 case EXPR_BINARY_BITWISE_AND:
1464 case EXPR_BINARY_BITWISE_OR:
1465 case EXPR_BINARY_BITWISE_XOR:
1466 case EXPR_BINARY_LOGICAL_AND:
1467 case EXPR_BINARY_LOGICAL_OR:
1468 case EXPR_BINARY_SHIFTLEFT:
1469 case EXPR_BINARY_SHIFTRIGHT:
1470 case EXPR_BINARY_COMMA:
1471 case EXPR_BINARY_ISGREATER:
1472 case EXPR_BINARY_ISGREATEREQUAL:
1473 case EXPR_BINARY_ISLESS:
1474 case EXPR_BINARY_ISLESSEQUAL:
1475 case EXPR_BINARY_ISLESSGREATER:
1476 case EXPR_BINARY_ISUNORDERED:
1477 mark_vars_read(expr->binary.left, lhs_ent);
1478 mark_vars_read(expr->binary.right, lhs_ent);
1481 case EXPR_BINARY_ASSIGN:
1482 case EXPR_BINARY_MUL_ASSIGN:
1483 case EXPR_BINARY_DIV_ASSIGN:
1484 case EXPR_BINARY_MOD_ASSIGN:
1485 case EXPR_BINARY_ADD_ASSIGN:
1486 case EXPR_BINARY_SUB_ASSIGN:
1487 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
1488 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
1489 case EXPR_BINARY_BITWISE_AND_ASSIGN:
1490 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
1491 case EXPR_BINARY_BITWISE_OR_ASSIGN: {
1492 if (lhs_ent == ENT_ANY)
1494 lhs_ent = determine_lhs_ent(expr->binary.left, lhs_ent);
1495 mark_vars_read(expr->binary.right, lhs_ent);
1500 determine_lhs_ent(expr->va_starte.ap, lhs_ent);
1503 case EXPR_LITERAL_CASES:
1505 case EXPR_STRING_LITERAL:
1506 case EXPR_WIDE_STRING_LITERAL:
1507 case EXPR_COMPOUND_LITERAL: // TODO init?
1509 case EXPR_CLASSIFY_TYPE:
1512 case EXPR_BUILTIN_CONSTANT_P:
1513 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
1515 case EXPR_STATEMENT: // TODO
1516 case EXPR_LABEL_ADDRESS:
1517 case EXPR_ENUM_CONSTANT:
1521 panic("unhandled expression");
1524 static designator_t *parse_designation(void)
1526 designator_t *result = NULL;
1527 designator_t **anchor = &result;
1530 designator_t *designator;
1531 switch (token.kind) {
1533 designator = allocate_ast_zero(sizeof(designator[0]));
1534 designator->source_position = token.base.source_position;
1536 add_anchor_token(']');
1537 designator->array_index = parse_constant_expression();
1538 rem_anchor_token(']');
1542 designator = allocate_ast_zero(sizeof(designator[0]));
1543 designator->source_position = token.base.source_position;
1545 designator->symbol = expect_identifier("while parsing designator", NULL);
1546 if (!designator->symbol)
1554 assert(designator != NULL);
1555 *anchor = designator;
1556 anchor = &designator->next;
1560 static initializer_t *initializer_from_string(array_type_t *const type,
1561 const string_t *const string)
1563 /* TODO: check len vs. size of array type */
1566 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
1567 initializer->string.string = *string;
1572 static initializer_t *initializer_from_wide_string(array_type_t *const type,
1573 const string_t *const string)
1575 /* TODO: check len vs. size of array type */
1578 initializer_t *const initializer =
1579 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
1580 initializer->wide_string.string = *string;
1586 * Build an initializer from a given expression.
1588 static initializer_t *initializer_from_expression(type_t *orig_type,
1589 expression_t *expression)
1591 /* TODO check that expression is a constant expression */
1593 /* §6.7.8.14/15 char array may be initialized by string literals */
1594 type_t *type = skip_typeref(orig_type);
1595 type_t *expr_type_orig = expression->base.type;
1596 type_t *expr_type = skip_typeref(expr_type_orig);
1598 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
1599 array_type_t *const array_type = &type->array;
1600 type_t *const element_type = skip_typeref(array_type->element_type);
1602 if (element_type->kind == TYPE_ATOMIC) {
1603 atomic_type_kind_t akind = element_type->atomic.akind;
1604 switch (expression->kind) {
1605 case EXPR_STRING_LITERAL:
1606 if (akind == ATOMIC_TYPE_CHAR
1607 || akind == ATOMIC_TYPE_SCHAR
1608 || akind == ATOMIC_TYPE_UCHAR) {
1609 return initializer_from_string(array_type,
1610 &expression->string_literal.value);
1614 case EXPR_WIDE_STRING_LITERAL: {
1615 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
1616 if (get_unqualified_type(element_type) == bare_wchar_type) {
1617 return initializer_from_wide_string(array_type,
1618 &expression->string_literal.value);
1629 assign_error_t error = semantic_assign(type, expression);
1630 if (error == ASSIGN_ERROR_INCOMPATIBLE)
1632 report_assign_error(error, type, expression, "initializer",
1633 &expression->base.source_position);
1635 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
1636 result->value.value = create_implicit_cast(expression, type);
1642 * Parses an scalar initializer.
1644 * §6.7.8.11; eat {} without warning
1646 static initializer_t *parse_scalar_initializer(type_t *type,
1647 bool must_be_constant)
1649 /* there might be extra {} hierarchies */
1651 if (token.kind == '{') {
1652 warningf(WARN_OTHER, HERE, "extra curly braces around scalar initializer");
1656 } while (token.kind == '{');
1659 expression_t *expression = parse_assignment_expression();
1660 mark_vars_read(expression, NULL);
1661 if (must_be_constant && !is_linker_constant(expression)) {
1662 errorf(&expression->base.source_position,
1663 "initialisation expression '%E' is not constant",
1667 initializer_t *initializer = initializer_from_expression(type, expression);
1669 if (initializer == NULL) {
1670 errorf(&expression->base.source_position,
1671 "expression '%E' (type '%T') doesn't match expected type '%T'",
1672 expression, expression->base.type, type);
1677 bool additional_warning_displayed = false;
1678 while (braces > 0) {
1680 if (token.kind != '}') {
1681 if (!additional_warning_displayed) {
1682 warningf(WARN_OTHER, HERE, "additional elements in scalar initializer");
1683 additional_warning_displayed = true;
1694 * An entry in the type path.
1696 typedef struct type_path_entry_t type_path_entry_t;
1697 struct type_path_entry_t {
1698 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
1700 size_t index; /**< For array types: the current index. */
1701 declaration_t *compound_entry; /**< For compound types: the current declaration. */
1706 * A type path expression a position inside compound or array types.
1708 typedef struct type_path_t type_path_t;
1709 struct type_path_t {
1710 type_path_entry_t *path; /**< An flexible array containing the current path. */
1711 type_t *top_type; /**< type of the element the path points */
1712 size_t max_index; /**< largest index in outermost array */
1716 * Prints a type path for debugging.
1718 static __attribute__((unused)) void debug_print_type_path(
1719 const type_path_t *path)
1721 size_t len = ARR_LEN(path->path);
1723 for (size_t i = 0; i < len; ++i) {
1724 const type_path_entry_t *entry = & path->path[i];
1726 type_t *type = skip_typeref(entry->type);
1727 if (is_type_compound(type)) {
1728 /* in gcc mode structs can have no members */
1729 if (entry->v.compound_entry == NULL) {
1733 fprintf(stderr, ".%s",
1734 entry->v.compound_entry->base.symbol->string);
1735 } else if (is_type_array(type)) {
1736 fprintf(stderr, "[%u]", (unsigned) entry->v.index);
1738 fprintf(stderr, "-INVALID-");
1741 if (path->top_type != NULL) {
1742 fprintf(stderr, " (");
1743 print_type(path->top_type);
1744 fprintf(stderr, ")");
1749 * Return the top type path entry, ie. in a path
1750 * (type).a.b returns the b.
1752 static type_path_entry_t *get_type_path_top(const type_path_t *path)
1754 size_t len = ARR_LEN(path->path);
1756 return &path->path[len-1];
1760 * Enlarge the type path by an (empty) element.
1762 static type_path_entry_t *append_to_type_path(type_path_t *path)
1764 size_t len = ARR_LEN(path->path);
1765 ARR_RESIZE(type_path_entry_t, path->path, len+1);
1767 type_path_entry_t *result = & path->path[len];
1768 memset(result, 0, sizeof(result[0]));
1773 * Descending into a sub-type. Enter the scope of the current top_type.
1775 static void descend_into_subtype(type_path_t *path)
1777 type_t *orig_top_type = path->top_type;
1778 type_t *top_type = skip_typeref(orig_top_type);
1780 type_path_entry_t *top = append_to_type_path(path);
1781 top->type = top_type;
1783 if (is_type_compound(top_type)) {
1784 compound_t *const compound = top_type->compound.compound;
1785 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
1787 if (entry != NULL) {
1788 top->v.compound_entry = &entry->declaration;
1789 path->top_type = entry->declaration.type;
1791 path->top_type = NULL;
1793 } else if (is_type_array(top_type)) {
1795 path->top_type = top_type->array.element_type;
1797 assert(!is_type_valid(top_type));
1802 * Pop an entry from the given type path, ie. returning from
1803 * (type).a.b to (type).a
1805 static void ascend_from_subtype(type_path_t *path)
1807 type_path_entry_t *top = get_type_path_top(path);
1809 path->top_type = top->type;
1811 size_t len = ARR_LEN(path->path);
1812 ARR_RESIZE(type_path_entry_t, path->path, len-1);
1816 * Pop entries from the given type path until the given
1817 * path level is reached.
1819 static void ascend_to(type_path_t *path, size_t top_path_level)
1821 size_t len = ARR_LEN(path->path);
1823 while (len > top_path_level) {
1824 ascend_from_subtype(path);
1825 len = ARR_LEN(path->path);
1829 static bool walk_designator(type_path_t *path, const designator_t *designator,
1830 bool used_in_offsetof)
1832 for (; designator != NULL; designator = designator->next) {
1833 type_path_entry_t *top = get_type_path_top(path);
1834 type_t *orig_type = top->type;
1836 type_t *type = skip_typeref(orig_type);
1838 if (designator->symbol != NULL) {
1839 symbol_t *symbol = designator->symbol;
1840 if (!is_type_compound(type)) {
1841 if (is_type_valid(type)) {
1842 errorf(&designator->source_position,
1843 "'.%Y' designator used for non-compound type '%T'",
1847 top->type = type_error_type;
1848 top->v.compound_entry = NULL;
1849 orig_type = type_error_type;
1851 compound_t *compound = type->compound.compound;
1852 entity_t *iter = compound->members.entities;
1853 for (; iter != NULL; iter = iter->base.next) {
1854 if (iter->base.symbol == symbol) {
1859 errorf(&designator->source_position,
1860 "'%T' has no member named '%Y'", orig_type, symbol);
1863 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
1864 if (used_in_offsetof && iter->compound_member.bitfield) {
1865 errorf(&designator->source_position,
1866 "offsetof designator '%Y' must not specify bitfield",
1871 top->type = orig_type;
1872 top->v.compound_entry = &iter->declaration;
1873 orig_type = iter->declaration.type;
1876 expression_t *array_index = designator->array_index;
1877 assert(designator->array_index != NULL);
1879 if (!is_type_array(type)) {
1880 if (is_type_valid(type)) {
1881 errorf(&designator->source_position,
1882 "[%E] designator used for non-array type '%T'",
1883 array_index, orig_type);
1888 long index = fold_constant_to_int(array_index);
1889 if (!used_in_offsetof) {
1891 errorf(&designator->source_position,
1892 "array index [%E] must be positive", array_index);
1893 } else if (type->array.size_constant) {
1894 long array_size = type->array.size;
1895 if (index >= array_size) {
1896 errorf(&designator->source_position,
1897 "designator [%E] (%d) exceeds array size %d",
1898 array_index, index, array_size);
1903 top->type = orig_type;
1904 top->v.index = (size_t) index;
1905 orig_type = type->array.element_type;
1907 path->top_type = orig_type;
1909 if (designator->next != NULL) {
1910 descend_into_subtype(path);
1916 static void advance_current_object(type_path_t *path, size_t top_path_level)
1918 type_path_entry_t *top = get_type_path_top(path);
1920 type_t *type = skip_typeref(top->type);
1921 if (is_type_union(type)) {
1922 /* in unions only the first element is initialized */
1923 top->v.compound_entry = NULL;
1924 } else if (is_type_struct(type)) {
1925 declaration_t *entry = top->v.compound_entry;
1927 entity_t *const next_entity = skip_unnamed_bitfields(entry->base.next);
1928 if (next_entity != NULL) {
1929 assert(is_declaration(next_entity));
1930 entry = &next_entity->declaration;
1935 top->v.compound_entry = entry;
1936 if (entry != NULL) {
1937 path->top_type = entry->type;
1940 } else if (is_type_array(type)) {
1941 assert(is_type_array(type));
1945 if (!type->array.size_constant || top->v.index < type->array.size) {
1949 assert(!is_type_valid(type));
1953 /* we're past the last member of the current sub-aggregate, try if we
1954 * can ascend in the type hierarchy and continue with another subobject */
1955 size_t len = ARR_LEN(path->path);
1957 if (len > top_path_level) {
1958 ascend_from_subtype(path);
1959 advance_current_object(path, top_path_level);
1961 path->top_type = NULL;
1966 * skip any {...} blocks until a closing bracket is reached.
1968 static void skip_initializers(void)
1972 while (token.kind != '}') {
1973 if (token.kind == T_EOF)
1975 if (token.kind == '{') {
1983 static initializer_t *create_empty_initializer(void)
1985 static initializer_t empty_initializer
1986 = { .list = { { INITIALIZER_LIST }, 0 } };
1987 return &empty_initializer;
1991 * Parse a part of an initialiser for a struct or union,
1993 static initializer_t *parse_sub_initializer(type_path_t *path,
1994 type_t *outer_type, size_t top_path_level,
1995 parse_initializer_env_t *env)
1997 if (token.kind == '}') {
1998 /* empty initializer */
1999 return create_empty_initializer();
2002 type_t *orig_type = path->top_type;
2003 type_t *type = NULL;
2005 if (orig_type == NULL) {
2006 /* We are initializing an empty compound. */
2008 type = skip_typeref(orig_type);
2011 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2014 designator_t *designator = NULL;
2015 if (token.kind == '.' || token.kind == '[') {
2016 designator = parse_designation();
2017 goto finish_designator;
2018 } else if (token.kind == T_IDENTIFIER && look_ahead(1)->kind == ':') {
2019 /* GNU-style designator ("identifier: value") */
2020 designator = allocate_ast_zero(sizeof(designator[0]));
2021 designator->source_position = token.base.source_position;
2022 designator->symbol = token.identifier.symbol;
2027 /* reset path to toplevel, evaluate designator from there */
2028 ascend_to(path, top_path_level);
2029 if (!walk_designator(path, designator, false)) {
2030 /* can't continue after designation error */
2034 initializer_t *designator_initializer
2035 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2036 designator_initializer->designator.designator = designator;
2037 ARR_APP1(initializer_t*, initializers, designator_initializer);
2039 orig_type = path->top_type;
2040 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2045 if (token.kind == '{') {
2046 if (type != NULL && is_type_scalar(type)) {
2047 sub = parse_scalar_initializer(type, env->must_be_constant);
2050 if (env->entity != NULL) {
2052 "extra brace group at end of initializer for '%Y'",
2053 env->entity->base.symbol);
2055 errorf(HERE, "extra brace group at end of initializer");
2060 descend_into_subtype(path);
2063 add_anchor_token('}');
2064 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2066 rem_anchor_token('}');
2071 goto error_parse_next;
2073 ascend_from_subtype(path);
2076 /* must be an expression */
2077 expression_t *expression = parse_assignment_expression();
2078 mark_vars_read(expression, NULL);
2080 if (env->must_be_constant && !is_linker_constant(expression)) {
2081 errorf(&expression->base.source_position,
2082 "Initialisation expression '%E' is not constant",
2087 /* we are already outside, ... */
2088 if (outer_type == NULL)
2089 goto error_parse_next;
2090 type_t *const outer_type_skip = skip_typeref(outer_type);
2091 if (is_type_compound(outer_type_skip) &&
2092 !outer_type_skip->compound.compound->complete) {
2093 goto error_parse_next;
2096 source_position_t const* const pos = &expression->base.source_position;
2097 if (env->entity != NULL) {
2098 warningf(WARN_OTHER, pos, "excess elements in initializer for '%Y'", env->entity->base.symbol);
2100 warningf(WARN_OTHER, pos, "excess elements in initializer");
2102 goto error_parse_next;
2105 /* handle { "string" } special case */
2106 if ((expression->kind == EXPR_STRING_LITERAL
2107 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2108 && outer_type != NULL) {
2109 sub = initializer_from_expression(outer_type, expression);
2112 if (token.kind != '}') {
2113 warningf(WARN_OTHER, HERE, "excessive elements in initializer for type '%T'", orig_type);
2115 /* TODO: eat , ... */
2120 /* descend into subtypes until expression matches type */
2122 orig_type = path->top_type;
2123 type = skip_typeref(orig_type);
2125 sub = initializer_from_expression(orig_type, expression);
2129 if (!is_type_valid(type)) {
2132 if (is_type_scalar(type)) {
2133 errorf(&expression->base.source_position,
2134 "expression '%E' doesn't match expected type '%T'",
2135 expression, orig_type);
2139 descend_into_subtype(path);
2143 /* update largest index of top array */
2144 const type_path_entry_t *first = &path->path[0];
2145 type_t *first_type = first->type;
2146 first_type = skip_typeref(first_type);
2147 if (is_type_array(first_type)) {
2148 size_t index = first->v.index;
2149 if (index > path->max_index)
2150 path->max_index = index;
2153 /* append to initializers list */
2154 ARR_APP1(initializer_t*, initializers, sub);
2157 if (token.kind == '}') {
2160 add_anchor_token('}');
2162 rem_anchor_token('}');
2163 if (token.kind == '}') {
2168 /* advance to the next declaration if we are not at the end */
2169 advance_current_object(path, top_path_level);
2170 orig_type = path->top_type;
2171 if (orig_type != NULL)
2172 type = skip_typeref(orig_type);
2178 size_t len = ARR_LEN(initializers);
2179 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2180 initializer_t *result = allocate_ast_zero(size);
2181 result->kind = INITIALIZER_LIST;
2182 result->list.len = len;
2183 memcpy(&result->list.initializers, initializers,
2184 len * sizeof(initializers[0]));
2186 DEL_ARR_F(initializers);
2187 ascend_to(path, top_path_level+1);
2192 skip_initializers();
2193 DEL_ARR_F(initializers);
2194 ascend_to(path, top_path_level+1);
2198 static expression_t *make_size_literal(size_t value)
2200 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_INTEGER);
2201 literal->base.type = type_size_t;
2204 snprintf(buf, sizeof(buf), "%u", (unsigned) value);
2205 literal->literal.value = make_string(buf);
2211 * Parses an initializer. Parsers either a compound literal
2212 * (env->declaration == NULL) or an initializer of a declaration.
2214 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2216 type_t *type = skip_typeref(env->type);
2217 size_t max_index = 0;
2218 initializer_t *result;
2220 if (is_type_scalar(type)) {
2221 result = parse_scalar_initializer(type, env->must_be_constant);
2222 } else if (token.kind == '{') {
2226 memset(&path, 0, sizeof(path));
2227 path.top_type = env->type;
2228 path.path = NEW_ARR_F(type_path_entry_t, 0);
2230 descend_into_subtype(&path);
2232 add_anchor_token('}');
2233 result = parse_sub_initializer(&path, env->type, 1, env);
2234 rem_anchor_token('}');
2236 max_index = path.max_index;
2237 DEL_ARR_F(path.path);
2241 /* parse_scalar_initializer() also works in this case: we simply
2242 * have an expression without {} around it */
2243 result = parse_scalar_initializer(type, env->must_be_constant);
2246 /* §6.7.8:22 array initializers for arrays with unknown size determine
2247 * the array type size */
2248 if (is_type_array(type) && type->array.size_expression == NULL
2249 && result != NULL) {
2251 switch (result->kind) {
2252 case INITIALIZER_LIST:
2253 assert(max_index != 0xdeadbeaf);
2254 size = max_index + 1;
2257 case INITIALIZER_STRING:
2258 size = result->string.string.size;
2261 case INITIALIZER_WIDE_STRING:
2262 size = result->wide_string.string.size;
2265 case INITIALIZER_DESIGNATOR:
2266 case INITIALIZER_VALUE:
2267 /* can happen for parse errors */
2272 internal_errorf(HERE, "invalid initializer type");
2275 type_t *new_type = duplicate_type(type);
2277 new_type->array.size_expression = make_size_literal(size);
2278 new_type->array.size_constant = true;
2279 new_type->array.has_implicit_size = true;
2280 new_type->array.size = size;
2281 env->type = new_type;
2287 static void append_entity(scope_t *scope, entity_t *entity)
2289 if (scope->last_entity != NULL) {
2290 scope->last_entity->base.next = entity;
2292 scope->entities = entity;
2294 entity->base.parent_entity = current_entity;
2295 scope->last_entity = entity;
2299 static compound_t *parse_compound_type_specifier(bool is_struct)
2301 source_position_t const pos = *HERE;
2302 eat(is_struct ? T_struct : T_union);
2304 symbol_t *symbol = NULL;
2305 entity_t *entity = NULL;
2306 attribute_t *attributes = NULL;
2308 if (token.kind == T___attribute__) {
2309 attributes = parse_attributes(NULL);
2312 entity_kind_tag_t const kind = is_struct ? ENTITY_STRUCT : ENTITY_UNION;
2313 if (token.kind == T_IDENTIFIER) {
2314 /* the compound has a name, check if we have seen it already */
2315 symbol = token.identifier.symbol;
2316 entity = get_tag(symbol, kind);
2319 if (entity != NULL) {
2320 if (entity->base.parent_scope != current_scope &&
2321 (token.kind == '{' || token.kind == ';')) {
2322 /* we're in an inner scope and have a definition. Shadow
2323 * existing definition in outer scope */
2325 } else if (entity->compound.complete && token.kind == '{') {
2326 source_position_t const *const ppos = &entity->base.source_position;
2327 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2328 /* clear members in the hope to avoid further errors */
2329 entity->compound.members.entities = NULL;
2332 } else if (token.kind != '{') {
2333 char const *const msg =
2334 is_struct ? "while parsing struct type specifier" :
2335 "while parsing union type specifier";
2336 parse_error_expected(msg, T_IDENTIFIER, '{', NULL);
2341 if (entity == NULL) {
2342 entity = allocate_entity_zero(kind, NAMESPACE_TAG, symbol, &pos);
2343 entity->compound.alignment = 1;
2344 entity->base.parent_scope = current_scope;
2345 if (symbol != NULL) {
2346 environment_push(entity);
2348 append_entity(current_scope, entity);
2351 if (token.kind == '{') {
2352 parse_compound_type_entries(&entity->compound);
2354 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2355 if (symbol == NULL) {
2356 assert(anonymous_entity == NULL);
2357 anonymous_entity = entity;
2361 if (attributes != NULL) {
2362 handle_entity_attributes(attributes, entity);
2365 return &entity->compound;
2368 static void parse_enum_entries(type_t *const enum_type)
2372 if (token.kind == '}') {
2373 errorf(HERE, "empty enum not allowed");
2378 add_anchor_token('}');
2379 add_anchor_token(',');
2381 add_anchor_token('=');
2382 source_position_t pos;
2383 symbol_t *const symbol = expect_identifier("while parsing enum entry", &pos);
2384 entity_t *const entity = allocate_entity_zero(ENTITY_ENUM_VALUE, NAMESPACE_NORMAL, symbol, &pos);
2385 entity->enum_value.enum_type = enum_type;
2386 rem_anchor_token('=');
2389 expression_t *value = parse_constant_expression();
2391 value = create_implicit_cast(value, enum_type);
2392 entity->enum_value.value = value;
2397 record_entity(entity, false);
2398 } while (next_if(',') && token.kind != '}');
2399 rem_anchor_token(',');
2400 rem_anchor_token('}');
2405 static type_t *parse_enum_specifier(void)
2407 source_position_t const pos = *HERE;
2412 switch (token.kind) {
2414 symbol = token.identifier.symbol;
2415 entity = get_tag(symbol, ENTITY_ENUM);
2418 if (entity != NULL) {
2419 if (entity->base.parent_scope != current_scope &&
2420 (token.kind == '{' || token.kind == ';')) {
2421 /* we're in an inner scope and have a definition. Shadow
2422 * existing definition in outer scope */
2424 } else if (entity->enume.complete && token.kind == '{') {
2425 source_position_t const *const ppos = &entity->base.source_position;
2426 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2437 parse_error_expected("while parsing enum type specifier",
2438 T_IDENTIFIER, '{', NULL);
2442 if (entity == NULL) {
2443 entity = allocate_entity_zero(ENTITY_ENUM, NAMESPACE_TAG, symbol, &pos);
2444 entity->base.parent_scope = current_scope;
2447 type_t *const type = allocate_type_zero(TYPE_ENUM);
2448 type->enumt.enume = &entity->enume;
2449 type->enumt.base.akind = ATOMIC_TYPE_INT;
2451 if (token.kind == '{') {
2452 if (symbol != NULL) {
2453 environment_push(entity);
2455 append_entity(current_scope, entity);
2456 entity->enume.complete = true;
2458 parse_enum_entries(type);
2459 parse_attributes(NULL);
2461 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2462 if (symbol == NULL) {
2463 assert(anonymous_entity == NULL);
2464 anonymous_entity = entity;
2466 } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
2467 errorf(HERE, "'%T' used before definition (incomplete enums are a GNU extension)", type);
2474 * if a symbol is a typedef to another type, return true
2476 static bool is_typedef_symbol(symbol_t *symbol)
2478 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
2479 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
2482 static type_t *parse_typeof(void)
2489 add_anchor_token(')');
2491 expression_t *expression = NULL;
2493 switch (token.kind) {
2495 if (is_typedef_symbol(token.identifier.symbol)) {
2497 type = parse_typename();
2500 expression = parse_expression();
2501 type = revert_automatic_type_conversion(expression);
2506 rem_anchor_token(')');
2509 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
2510 typeof_type->typeoft.expression = expression;
2511 typeof_type->typeoft.typeof_type = type;
2516 typedef enum specifiers_t {
2517 SPECIFIER_SIGNED = 1 << 0,
2518 SPECIFIER_UNSIGNED = 1 << 1,
2519 SPECIFIER_LONG = 1 << 2,
2520 SPECIFIER_INT = 1 << 3,
2521 SPECIFIER_DOUBLE = 1 << 4,
2522 SPECIFIER_CHAR = 1 << 5,
2523 SPECIFIER_WCHAR_T = 1 << 6,
2524 SPECIFIER_SHORT = 1 << 7,
2525 SPECIFIER_LONG_LONG = 1 << 8,
2526 SPECIFIER_FLOAT = 1 << 9,
2527 SPECIFIER_BOOL = 1 << 10,
2528 SPECIFIER_VOID = 1 << 11,
2529 SPECIFIER_INT8 = 1 << 12,
2530 SPECIFIER_INT16 = 1 << 13,
2531 SPECIFIER_INT32 = 1 << 14,
2532 SPECIFIER_INT64 = 1 << 15,
2533 SPECIFIER_INT128 = 1 << 16,
2534 SPECIFIER_COMPLEX = 1 << 17,
2535 SPECIFIER_IMAGINARY = 1 << 18,
2538 static type_t *get_typedef_type(symbol_t *symbol)
2540 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
2541 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
2544 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
2545 type->typedeft.typedefe = &entity->typedefe;
2550 static attribute_t *parse_attribute_ms_property(attribute_t *attribute)
2552 attribute_property_argument_t *const property = allocate_ast_zero(sizeof(*property));
2556 add_anchor_token(')');
2557 add_anchor_token(',');
2559 add_anchor_token('=');
2560 source_position_t pos;
2561 symbol_t *const prop_sym = expect_identifier("while parsing property declspec", &pos);
2562 rem_anchor_token('=');
2564 symbol_t **prop = NULL;
2566 if (streq(prop_sym->string, "put")) {
2567 prop = &property->put_symbol;
2568 } else if (streq(prop_sym->string, "get")) {
2569 prop = &property->get_symbol;
2571 errorf(&pos, "expected put or get in property declspec, but got '%Y'", prop_sym);
2575 add_anchor_token(T_IDENTIFIER);
2577 rem_anchor_token(T_IDENTIFIER);
2579 symbol_t *const sym = expect_identifier("while parsing property declspec", NULL);
2581 *prop = sym ? sym : sym_anonymous;
2582 } while (next_if(','));
2583 rem_anchor_token(',');
2584 rem_anchor_token(')');
2586 attribute->a.property = property;
2592 static attribute_t *parse_microsoft_extended_decl_modifier_single(void)
2594 attribute_kind_t kind = ATTRIBUTE_UNKNOWN;
2595 if (next_if(T_restrict)) {
2596 kind = ATTRIBUTE_MS_RESTRICT;
2597 } else if (token.kind == T_IDENTIFIER) {
2598 const char *name = token.identifier.symbol->string;
2599 for (attribute_kind_t k = ATTRIBUTE_MS_FIRST; k <= ATTRIBUTE_MS_LAST;
2601 const char *attribute_name = get_attribute_name(k);
2602 if (attribute_name != NULL && streq(attribute_name, name)) {
2608 if (kind == ATTRIBUTE_UNKNOWN) {
2609 warningf(WARN_ATTRIBUTE, HERE, "unknown __declspec '%s' ignored", name);
2612 parse_error_expected("while parsing __declspec", T_IDENTIFIER, NULL);
2616 attribute_t *attribute = allocate_attribute_zero(kind);
2619 if (kind == ATTRIBUTE_MS_PROPERTY) {
2620 return parse_attribute_ms_property(attribute);
2623 /* parse arguments */
2625 attribute->a.arguments = parse_attribute_arguments();
2630 static attribute_t *parse_microsoft_extended_decl_modifier(attribute_t *first)
2635 if (token.kind != ')') {
2636 add_anchor_token(')');
2638 attribute_t **anchor = &first;
2640 while (*anchor != NULL)
2641 anchor = &(*anchor)->next;
2643 attribute_t *attribute
2644 = parse_microsoft_extended_decl_modifier_single();
2645 if (attribute == NULL)
2648 *anchor = attribute;
2649 anchor = &attribute->next;
2650 } while (next_if(','));
2652 rem_anchor_token(')');
2658 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
2660 entity_t *const entity = allocate_entity_zero(kind, NAMESPACE_NORMAL, symbol, HERE);
2661 if (is_declaration(entity)) {
2662 entity->declaration.type = type_error_type;
2663 entity->declaration.implicit = true;
2664 } else if (kind == ENTITY_TYPEDEF) {
2665 entity->typedefe.type = type_error_type;
2666 entity->typedefe.builtin = true;
2668 if (kind != ENTITY_COMPOUND_MEMBER)
2669 record_entity(entity, false);
2673 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2675 type_t *type = NULL;
2676 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
2677 unsigned type_specifiers = 0;
2678 bool newtype = false;
2679 bool saw_error = false;
2681 memset(specifiers, 0, sizeof(*specifiers));
2682 specifiers->source_position = token.base.source_position;
2685 specifiers->attributes = parse_attributes(specifiers->attributes);
2687 switch (token.kind) {
2689 #define MATCH_STORAGE_CLASS(token, class) \
2691 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
2692 errorf(HERE, "multiple storage classes in declaration specifiers"); \
2694 specifiers->storage_class = class; \
2695 if (specifiers->thread_local) \
2696 goto check_thread_storage_class; \
2700 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
2701 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
2702 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
2703 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
2704 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
2707 specifiers->attributes
2708 = parse_microsoft_extended_decl_modifier(specifiers->attributes);
2712 if (specifiers->thread_local) {
2713 errorf(HERE, "duplicate '__thread'");
2715 specifiers->thread_local = true;
2716 check_thread_storage_class:
2717 switch (specifiers->storage_class) {
2718 case STORAGE_CLASS_EXTERN:
2719 case STORAGE_CLASS_NONE:
2720 case STORAGE_CLASS_STATIC:
2724 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_storage_class;
2725 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_storage_class;
2726 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_storage_class;
2727 wrong_thread_storage_class:
2728 errorf(HERE, "'__thread' used with '%s'", wrong);
2735 /* type qualifiers */
2736 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
2738 qualifiers |= qualifier; \
2742 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
2743 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
2744 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
2745 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
2746 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
2747 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
2748 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
2749 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
2751 /* type specifiers */
2752 #define MATCH_SPECIFIER(token, specifier, name) \
2754 if (type_specifiers & specifier) { \
2755 errorf(HERE, "multiple " name " type specifiers given"); \
2757 type_specifiers |= specifier; \
2762 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
2763 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
2764 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
2765 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
2766 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
2767 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
2768 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
2769 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
2770 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
2771 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
2772 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
2773 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
2774 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
2775 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
2776 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
2777 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
2778 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
2779 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
2783 specifiers->is_inline = true;
2787 case T__forceinline:
2789 specifiers->modifiers |= DM_FORCEINLINE;
2794 if (type_specifiers & SPECIFIER_LONG_LONG) {
2795 errorf(HERE, "too many long type specifiers given");
2796 } else if (type_specifiers & SPECIFIER_LONG) {
2797 type_specifiers |= SPECIFIER_LONG_LONG;
2799 type_specifiers |= SPECIFIER_LONG;
2804 #define CHECK_DOUBLE_TYPE() \
2805 (type != NULL ? errorf(HERE, "multiple types in declaration specifiers") : (void)0)
2808 CHECK_DOUBLE_TYPE();
2809 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
2811 type->compound.compound = parse_compound_type_specifier(true);
2814 CHECK_DOUBLE_TYPE();
2815 type = allocate_type_zero(TYPE_COMPOUND_UNION);
2816 type->compound.compound = parse_compound_type_specifier(false);
2819 CHECK_DOUBLE_TYPE();
2820 type = parse_enum_specifier();
2823 CHECK_DOUBLE_TYPE();
2824 type = parse_typeof();
2826 case T___builtin_va_list:
2827 CHECK_DOUBLE_TYPE();
2828 type = duplicate_type(type_valist);
2832 case T_IDENTIFIER: {
2833 /* only parse identifier if we haven't found a type yet */
2834 if (type != NULL || type_specifiers != 0) {
2835 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
2836 * declaration, so it doesn't generate errors about expecting '(' or
2838 switch (look_ahead(1)->kind) {
2845 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
2849 errorf(HERE, "discarding stray %K in declaration specifier", &token);
2854 goto finish_specifiers;
2858 type_t *const typedef_type = get_typedef_type(token.identifier.symbol);
2859 if (typedef_type == NULL) {
2860 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
2861 * declaration, so it doesn't generate 'implicit int' followed by more
2862 * errors later on. */
2863 token_kind_t const la1_type = (token_kind_t)look_ahead(1)->kind;
2869 errorf(HERE, "%K does not name a type", &token);
2871 symbol_t *symbol = token.identifier.symbol;
2873 = create_error_entity(symbol, ENTITY_TYPEDEF);
2875 type = allocate_type_zero(TYPE_TYPEDEF);
2876 type->typedeft.typedefe = &entity->typedefe;
2884 goto finish_specifiers;
2889 type = typedef_type;
2893 /* function specifier */
2895 goto finish_specifiers;
2900 specifiers->attributes = parse_attributes(specifiers->attributes);
2902 if (type == NULL || (saw_error && type_specifiers != 0)) {
2903 atomic_type_kind_t atomic_type;
2905 /* match valid basic types */
2906 switch (type_specifiers) {
2907 case SPECIFIER_VOID:
2908 atomic_type = ATOMIC_TYPE_VOID;
2910 case SPECIFIER_WCHAR_T:
2911 atomic_type = ATOMIC_TYPE_WCHAR_T;
2913 case SPECIFIER_CHAR:
2914 atomic_type = ATOMIC_TYPE_CHAR;
2916 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
2917 atomic_type = ATOMIC_TYPE_SCHAR;
2919 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
2920 atomic_type = ATOMIC_TYPE_UCHAR;
2922 case SPECIFIER_SHORT:
2923 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
2924 case SPECIFIER_SHORT | SPECIFIER_INT:
2925 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
2926 atomic_type = ATOMIC_TYPE_SHORT;
2928 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
2929 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
2930 atomic_type = ATOMIC_TYPE_USHORT;
2933 case SPECIFIER_SIGNED:
2934 case SPECIFIER_SIGNED | SPECIFIER_INT:
2935 atomic_type = ATOMIC_TYPE_INT;
2937 case SPECIFIER_UNSIGNED:
2938 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
2939 atomic_type = ATOMIC_TYPE_UINT;
2941 case SPECIFIER_LONG:
2942 case SPECIFIER_SIGNED | SPECIFIER_LONG:
2943 case SPECIFIER_LONG | SPECIFIER_INT:
2944 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
2945 atomic_type = ATOMIC_TYPE_LONG;
2947 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
2948 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
2949 atomic_type = ATOMIC_TYPE_ULONG;
2952 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2953 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2954 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
2955 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
2957 atomic_type = ATOMIC_TYPE_LONGLONG;
2958 goto warn_about_long_long;
2960 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2961 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
2963 atomic_type = ATOMIC_TYPE_ULONGLONG;
2964 warn_about_long_long:
2965 warningf(WARN_LONG_LONG, &specifiers->source_position, "ISO C90 does not support 'long long'");
2968 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
2969 atomic_type = unsigned_int8_type_kind;
2972 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
2973 atomic_type = unsigned_int16_type_kind;
2976 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
2977 atomic_type = unsigned_int32_type_kind;
2980 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
2981 atomic_type = unsigned_int64_type_kind;
2984 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
2985 atomic_type = unsigned_int128_type_kind;
2988 case SPECIFIER_INT8:
2989 case SPECIFIER_SIGNED | SPECIFIER_INT8:
2990 atomic_type = int8_type_kind;
2993 case SPECIFIER_INT16:
2994 case SPECIFIER_SIGNED | SPECIFIER_INT16:
2995 atomic_type = int16_type_kind;
2998 case SPECIFIER_INT32:
2999 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3000 atomic_type = int32_type_kind;
3003 case SPECIFIER_INT64:
3004 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3005 atomic_type = int64_type_kind;
3008 case SPECIFIER_INT128:
3009 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3010 atomic_type = int128_type_kind;
3013 case SPECIFIER_FLOAT:
3014 atomic_type = ATOMIC_TYPE_FLOAT;
3016 case SPECIFIER_DOUBLE:
3017 atomic_type = ATOMIC_TYPE_DOUBLE;
3019 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3020 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3022 case SPECIFIER_BOOL:
3023 atomic_type = ATOMIC_TYPE_BOOL;
3025 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3026 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3027 atomic_type = ATOMIC_TYPE_FLOAT;
3029 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3030 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3031 atomic_type = ATOMIC_TYPE_DOUBLE;
3033 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3034 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3035 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3038 /* invalid specifier combination, give an error message */
3039 source_position_t const* const pos = &specifiers->source_position;
3040 if (type_specifiers == 0) {
3042 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
3043 if (!(c_mode & _CXX) && !strict_mode) {
3044 warningf(WARN_IMPLICIT_INT, pos, "no type specifiers in declaration, using 'int'");
3045 atomic_type = ATOMIC_TYPE_INT;
3048 errorf(pos, "no type specifiers given in declaration");
3051 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3052 (type_specifiers & SPECIFIER_UNSIGNED)) {
3053 errorf(pos, "signed and unsigned specifiers given");
3054 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3055 errorf(pos, "only integer types can be signed or unsigned");
3057 errorf(pos, "multiple datatypes in declaration");
3063 if (type_specifiers & SPECIFIER_COMPLEX) {
3064 type = allocate_type_zero(TYPE_COMPLEX);
3065 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3066 type = allocate_type_zero(TYPE_IMAGINARY);
3068 type = allocate_type_zero(TYPE_ATOMIC);
3070 type->atomic.akind = atomic_type;
3072 } else if (type_specifiers != 0) {
3073 errorf(&specifiers->source_position, "multiple datatypes in declaration");
3076 /* FIXME: check type qualifiers here */
3077 type->base.qualifiers = qualifiers;
3080 type = identify_new_type(type);
3082 type = typehash_insert(type);
3085 if (specifiers->attributes != NULL)
3086 type = handle_type_attributes(specifiers->attributes, type);
3087 specifiers->type = type;
3091 specifiers->type = type_error_type;
3094 static type_qualifiers_t parse_type_qualifiers(void)
3096 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3099 switch (token.kind) {
3100 /* type qualifiers */
3101 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3102 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3103 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3104 /* microsoft extended type modifiers */
3105 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3106 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3107 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3108 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3109 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3118 * Parses an K&R identifier list
3120 static void parse_identifier_list(scope_t *scope)
3122 assert(token.kind == T_IDENTIFIER);
3124 entity_t *const entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, token.identifier.symbol, HERE);
3125 /* a K&R parameter has no type, yet */
3129 append_entity(scope, entity);
3130 } while (next_if(',') && token.kind == T_IDENTIFIER);
3133 static entity_t *parse_parameter(void)
3135 declaration_specifiers_t specifiers;
3136 parse_declaration_specifiers(&specifiers);
3138 entity_t *entity = parse_declarator(&specifiers,
3139 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
3140 anonymous_entity = NULL;
3144 static void semantic_parameter_incomplete(const entity_t *entity)
3146 assert(entity->kind == ENTITY_PARAMETER);
3148 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
3149 * list in a function declarator that is part of a
3150 * definition of that function shall not have
3151 * incomplete type. */
3152 type_t *type = skip_typeref(entity->declaration.type);
3153 if (is_type_incomplete(type)) {
3154 errorf(&entity->base.source_position, "'%N' has incomplete type", entity);
3158 static bool has_parameters(void)
3160 /* func(void) is not a parameter */
3161 if (look_ahead(1)->kind != ')')
3163 if (token.kind == T_IDENTIFIER) {
3164 entity_t const *const entity
3165 = get_entity(token.identifier.symbol, NAMESPACE_NORMAL);
3168 if (entity->kind != ENTITY_TYPEDEF)
3170 type_t const *const type = skip_typeref(entity->typedefe.type);
3171 if (!is_type_void(type))
3173 if (c_mode & _CXX) {
3174 /* ISO/IEC 14882:1998(E) §8.3.5:2 It must be literally (void). A typedef
3175 * is not allowed. */
3176 errorf(HERE, "empty parameter list defined with a typedef of 'void' not allowed in C++");
3177 } else if (type->base.qualifiers != TYPE_QUALIFIER_NONE) {
3178 /* §6.7.5.3:10 Qualification is not allowed here. */
3179 errorf(HERE, "'void' as parameter must not have type qualifiers");
3181 } else if (token.kind != T_void) {
3189 * Parses function type parameters (and optionally creates variable_t entities
3190 * for them in a scope)
3192 static void parse_parameters(function_type_t *type, scope_t *scope)
3195 add_anchor_token(')');
3197 if (token.kind == T_IDENTIFIER
3198 && !is_typedef_symbol(token.identifier.symbol)) {
3199 token_kind_t la1_type = (token_kind_t)look_ahead(1)->kind;
3200 if (la1_type == ',' || la1_type == ')') {
3201 type->kr_style_parameters = true;
3202 parse_identifier_list(scope);
3203 goto parameters_finished;
3207 if (token.kind == ')') {
3208 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
3209 if (!(c_mode & _CXX))
3210 type->unspecified_parameters = true;
3211 } else if (has_parameters()) {
3212 function_parameter_t **anchor = &type->parameters;
3214 switch (token.kind) {
3217 type->variadic = true;
3218 goto parameters_finished;
3223 entity_t *entity = parse_parameter();
3224 if (entity->kind == ENTITY_TYPEDEF) {
3225 errorf(&entity->base.source_position,
3226 "typedef not allowed as function parameter");
3229 assert(is_declaration(entity));
3231 semantic_parameter_incomplete(entity);
3233 function_parameter_t *const parameter =
3234 allocate_parameter(entity->declaration.type);
3236 if (scope != NULL) {
3237 append_entity(scope, entity);
3240 *anchor = parameter;
3241 anchor = ¶meter->next;
3246 goto parameters_finished;
3248 } while (next_if(','));
3251 parameters_finished:
3252 rem_anchor_token(')');
3256 typedef enum construct_type_kind_t {
3257 CONSTRUCT_POINTER = 1,
3258 CONSTRUCT_REFERENCE,
3261 } construct_type_kind_t;
3263 typedef union construct_type_t construct_type_t;
3265 typedef struct construct_type_base_t {
3266 construct_type_kind_t kind;
3267 source_position_t pos;
3268 construct_type_t *next;
3269 } construct_type_base_t;
3271 typedef struct parsed_pointer_t {
3272 construct_type_base_t base;
3273 type_qualifiers_t type_qualifiers;
3274 variable_t *base_variable; /**< MS __based extension. */
3277 typedef struct parsed_reference_t {
3278 construct_type_base_t base;
3279 } parsed_reference_t;
3281 typedef struct construct_function_type_t {
3282 construct_type_base_t base;
3283 type_t *function_type;
3284 } construct_function_type_t;
3286 typedef struct parsed_array_t {
3287 construct_type_base_t base;
3288 type_qualifiers_t type_qualifiers;
3294 union construct_type_t {
3295 construct_type_kind_t kind;
3296 construct_type_base_t base;
3297 parsed_pointer_t pointer;
3298 parsed_reference_t reference;
3299 construct_function_type_t function;
3300 parsed_array_t array;
3303 static construct_type_t *allocate_declarator_zero(construct_type_kind_t const kind, size_t const size)
3305 construct_type_t *const cons = obstack_alloc(&temp_obst, size);
3306 memset(cons, 0, size);
3308 cons->base.pos = *HERE;
3313 static construct_type_t *parse_pointer_declarator(void)
3315 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_POINTER, sizeof(parsed_pointer_t));
3317 cons->pointer.type_qualifiers = parse_type_qualifiers();
3318 //cons->pointer.base_variable = base_variable;
3323 /* ISO/IEC 14882:1998(E) §8.3.2 */
3324 static construct_type_t *parse_reference_declarator(void)
3326 if (!(c_mode & _CXX))
3327 errorf(HERE, "references are only available for C++");
3329 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_REFERENCE, sizeof(parsed_reference_t));
3336 static construct_type_t *parse_array_declarator(void)
3338 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_ARRAY, sizeof(parsed_array_t));
3339 parsed_array_t *const array = &cons->array;
3342 add_anchor_token(']');
3344 bool is_static = next_if(T_static);
3346 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3349 is_static = next_if(T_static);
3351 array->type_qualifiers = type_qualifiers;
3352 array->is_static = is_static;
3354 expression_t *size = NULL;
3355 if (token.kind == '*' && look_ahead(1)->kind == ']') {
3356 array->is_variable = true;
3358 } else if (token.kind != ']') {
3359 size = parse_assignment_expression();
3361 /* §6.7.5.2:1 Array size must have integer type */
3362 type_t *const orig_type = size->base.type;
3363 type_t *const type = skip_typeref(orig_type);
3364 if (!is_type_integer(type) && is_type_valid(type)) {
3365 errorf(&size->base.source_position,
3366 "array size '%E' must have integer type but has type '%T'",
3371 mark_vars_read(size, NULL);
3374 if (is_static && size == NULL)
3375 errorf(&array->base.pos, "static array parameters require a size");
3377 rem_anchor_token(']');
3383 static construct_type_t *parse_function_declarator(scope_t *scope)
3385 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_FUNCTION, sizeof(construct_function_type_t));
3387 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3388 function_type_t *ftype = &type->function;
3390 ftype->linkage = current_linkage;
3391 ftype->calling_convention = CC_DEFAULT;
3393 parse_parameters(ftype, scope);
3395 cons->function.function_type = type;
3400 typedef struct parse_declarator_env_t {
3401 bool may_be_abstract : 1;
3402 bool must_be_abstract : 1;
3403 decl_modifiers_t modifiers;
3405 source_position_t source_position;
3407 attribute_t *attributes;
3408 } parse_declarator_env_t;
3411 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env)
3413 /* construct a single linked list of construct_type_t's which describe
3414 * how to construct the final declarator type */
3415 construct_type_t *first = NULL;
3416 construct_type_t **anchor = &first;
3418 env->attributes = parse_attributes(env->attributes);
3421 construct_type_t *type;
3422 //variable_t *based = NULL; /* MS __based extension */
3423 switch (token.kind) {
3425 type = parse_reference_declarator();
3429 panic("based not supported anymore");
3434 type = parse_pointer_declarator();
3438 goto ptr_operator_end;
3442 anchor = &type->base.next;
3444 /* TODO: find out if this is correct */
3445 env->attributes = parse_attributes(env->attributes);
3449 construct_type_t *inner_types = NULL;
3451 switch (token.kind) {
3453 if (env->must_be_abstract) {
3454 errorf(HERE, "no identifier expected in typename");
3456 env->symbol = token.identifier.symbol;
3457 env->source_position = token.base.source_position;
3463 /* Parenthesized declarator or function declarator? */
3464 token_t const *const la1 = look_ahead(1);
3465 switch (la1->kind) {
3467 if (is_typedef_symbol(la1->identifier.symbol)) {
3469 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
3470 * interpreted as ``function with no parameter specification'', rather
3471 * than redundant parentheses around the omitted identifier. */
3473 /* Function declarator. */
3474 if (!env->may_be_abstract) {
3475 errorf(HERE, "function declarator must have a name");
3482 case T___attribute__: /* FIXME __attribute__ might also introduce a parameter of a function declarator. */
3483 /* Paranthesized declarator. */
3485 add_anchor_token(')');
3486 inner_types = parse_inner_declarator(env);
3487 if (inner_types != NULL) {
3488 /* All later declarators only modify the return type */
3489 env->must_be_abstract = true;
3491 rem_anchor_token(')');
3500 if (env->may_be_abstract)
3502 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3507 construct_type_t **const p = anchor;
3510 construct_type_t *type;
3511 switch (token.kind) {
3513 scope_t *scope = NULL;
3514 if (!env->must_be_abstract) {
3515 scope = &env->parameters;
3518 type = parse_function_declarator(scope);
3522 type = parse_array_declarator();
3525 goto declarator_finished;
3528 /* insert in the middle of the list (at p) */
3529 type->base.next = *p;
3532 anchor = &type->base.next;
3535 declarator_finished:
3536 /* append inner_types at the end of the list, we don't to set anchor anymore
3537 * as it's not needed anymore */
3538 *anchor = inner_types;
3543 static type_t *construct_declarator_type(construct_type_t *construct_list,
3546 construct_type_t *iter = construct_list;
3547 for (; iter != NULL; iter = iter->base.next) {
3548 source_position_t const* const pos = &iter->base.pos;
3549 switch (iter->kind) {
3550 case CONSTRUCT_FUNCTION: {
3551 construct_function_type_t *function = &iter->function;
3552 type_t *function_type = function->function_type;
3554 function_type->function.return_type = type;
3556 type_t *skipped_return_type = skip_typeref(type);
3558 if (is_type_function(skipped_return_type)) {
3559 errorf(pos, "function returning function is not allowed");
3560 } else if (is_type_array(skipped_return_type)) {
3561 errorf(pos, "function returning array is not allowed");
3563 if (skipped_return_type->base.qualifiers != 0) {
3564 warningf(WARN_IGNORED_QUALIFIERS, pos, "type qualifiers in return type of function type are meaningless");
3568 /* The function type was constructed earlier. Freeing it here will
3569 * destroy other types. */
3570 type = typehash_insert(function_type);
3574 case CONSTRUCT_POINTER: {
3575 if (is_type_reference(skip_typeref(type)))
3576 errorf(pos, "cannot declare a pointer to reference");
3578 parsed_pointer_t *pointer = &iter->pointer;
3579 type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
3583 case CONSTRUCT_REFERENCE:
3584 if (is_type_reference(skip_typeref(type)))
3585 errorf(pos, "cannot declare a reference to reference");
3587 type = make_reference_type(type);
3590 case CONSTRUCT_ARRAY: {
3591 if (is_type_reference(skip_typeref(type)))
3592 errorf(pos, "cannot declare an array of references");
3594 parsed_array_t *array = &iter->array;
3595 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
3597 expression_t *size_expression = array->size;
3598 if (size_expression != NULL) {
3600 = create_implicit_cast(size_expression, type_size_t);
3603 array_type->base.qualifiers = array->type_qualifiers;
3604 array_type->array.element_type = type;
3605 array_type->array.is_static = array->is_static;
3606 array_type->array.is_variable = array->is_variable;
3607 array_type->array.size_expression = size_expression;
3609 if (size_expression != NULL) {
3610 switch (is_constant_expression(size_expression)) {
3611 case EXPR_CLASS_CONSTANT: {
3612 long const size = fold_constant_to_int(size_expression);
3613 array_type->array.size = size;
3614 array_type->array.size_constant = true;
3615 /* §6.7.5.2:1 If the expression is a constant expression,
3616 * it shall have a value greater than zero. */
3618 errorf(&size_expression->base.source_position,
3619 "size of array must be greater than zero");
3620 } else if (size == 0 && !GNU_MODE) {
3621 errorf(&size_expression->base.source_position,
3622 "size of array must be greater than zero (zero length arrays are a GCC extension)");
3627 case EXPR_CLASS_VARIABLE:
3628 array_type->array.is_vla = true;
3631 case EXPR_CLASS_ERROR:
3636 type_t *skipped_type = skip_typeref(type);
3638 if (is_type_incomplete(skipped_type)) {
3639 errorf(pos, "array of incomplete type '%T' is not allowed", type);
3640 } else if (is_type_function(skipped_type)) {
3641 errorf(pos, "array of functions is not allowed");
3643 type = identify_new_type(array_type);
3647 internal_errorf(pos, "invalid type construction found");
3653 static type_t *automatic_type_conversion(type_t *orig_type);
3655 static type_t *semantic_parameter(const source_position_t *pos,
3657 const declaration_specifiers_t *specifiers,
3658 entity_t const *const param)
3660 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
3661 * shall be adjusted to ``qualified pointer to type'',
3663 * §6.7.5.3:8 A declaration of a parameter as ``function returning
3664 * type'' shall be adjusted to ``pointer to function
3665 * returning type'', as in 6.3.2.1. */
3666 type = automatic_type_conversion(type);
3668 if (specifiers->is_inline && is_type_valid(type)) {
3669 errorf(pos, "'%N' declared 'inline'", param);
3672 /* §6.9.1:6 The declarations in the declaration list shall contain
3673 * no storage-class specifier other than register and no
3674 * initializations. */
3675 if (specifiers->thread_local || (
3676 specifiers->storage_class != STORAGE_CLASS_NONE &&
3677 specifiers->storage_class != STORAGE_CLASS_REGISTER)
3679 errorf(pos, "invalid storage class for '%N'", param);
3682 /* delay test for incomplete type, because we might have (void)
3683 * which is legal but incomplete... */
3688 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
3689 declarator_flags_t flags)
3691 parse_declarator_env_t env;
3692 memset(&env, 0, sizeof(env));
3693 env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
3695 construct_type_t *construct_type = parse_inner_declarator(&env);
3697 construct_declarator_type(construct_type, specifiers->type);
3698 type_t *type = skip_typeref(orig_type);
3700 if (construct_type != NULL) {
3701 obstack_free(&temp_obst, construct_type);
3704 attribute_t *attributes = parse_attributes(env.attributes);
3705 /* append (shared) specifier attribute behind attributes of this
3707 attribute_t **anchor = &attributes;
3708 while (*anchor != NULL)
3709 anchor = &(*anchor)->next;
3710 *anchor = specifiers->attributes;
3713 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
3714 entity = allocate_entity_zero(ENTITY_TYPEDEF, NAMESPACE_NORMAL, env.symbol, &env.source_position);
3715 entity->typedefe.type = orig_type;
3717 if (anonymous_entity != NULL) {
3718 if (is_type_compound(type)) {
3719 assert(anonymous_entity->compound.alias == NULL);
3720 assert(anonymous_entity->kind == ENTITY_STRUCT ||
3721 anonymous_entity->kind == ENTITY_UNION);
3722 anonymous_entity->compound.alias = entity;
3723 anonymous_entity = NULL;
3724 } else if (is_type_enum(type)) {
3725 assert(anonymous_entity->enume.alias == NULL);
3726 assert(anonymous_entity->kind == ENTITY_ENUM);
3727 anonymous_entity->enume.alias = entity;
3728 anonymous_entity = NULL;
3732 /* create a declaration type entity */
3733 source_position_t const *const pos = env.symbol ? &env.source_position : &specifiers->source_position;
3734 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
3735 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, env.symbol, pos);
3737 if (env.symbol != NULL) {
3738 if (specifiers->is_inline && is_type_valid(type)) {
3739 errorf(&env.source_position,
3740 "compound member '%Y' declared 'inline'", env.symbol);
3743 if (specifiers->thread_local ||
3744 specifiers->storage_class != STORAGE_CLASS_NONE) {
3745 errorf(&env.source_position,
3746 "compound member '%Y' must have no storage class",
3750 } else if (flags & DECL_IS_PARAMETER) {
3751 entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, env.symbol, pos);
3752 orig_type = semantic_parameter(&env.source_position, orig_type, specifiers, entity);
3753 } else if (is_type_function(type)) {
3754 entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, env.symbol, pos);
3755 entity->function.is_inline = specifiers->is_inline;
3756 entity->function.elf_visibility = default_visibility;
3757 entity->function.parameters = env.parameters;
3759 if (env.symbol != NULL) {
3760 /* this needs fixes for C++ */
3761 bool in_function_scope = current_function != NULL;
3763 if (specifiers->thread_local || (
3764 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3765 specifiers->storage_class != STORAGE_CLASS_NONE &&
3766 (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
3768 errorf(&env.source_position, "invalid storage class for '%N'", entity);
3772 entity = allocate_entity_zero(ENTITY_VARIABLE, NAMESPACE_NORMAL, env.symbol, pos);
3773 entity->variable.elf_visibility = default_visibility;
3774 entity->variable.thread_local = specifiers->thread_local;
3776 if (env.symbol != NULL) {
3777 if (specifiers->is_inline && is_type_valid(type)) {
3778 errorf(&env.source_position, "'%N' declared 'inline'", entity);
3781 bool invalid_storage_class = false;
3782 if (current_scope == file_scope) {
3783 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3784 specifiers->storage_class != STORAGE_CLASS_NONE &&
3785 specifiers->storage_class != STORAGE_CLASS_STATIC) {
3786 invalid_storage_class = true;
3789 if (specifiers->thread_local &&
3790 specifiers->storage_class == STORAGE_CLASS_NONE) {
3791 invalid_storage_class = true;
3794 if (invalid_storage_class) {
3795 errorf(&env.source_position, "invalid storage class for variable '%N'", entity);
3800 entity->declaration.type = orig_type;
3801 entity->declaration.alignment = get_type_alignment(orig_type);
3802 entity->declaration.modifiers = env.modifiers;
3803 entity->declaration.attributes = attributes;
3805 storage_class_t storage_class = specifiers->storage_class;
3806 entity->declaration.declared_storage_class = storage_class;
3808 if (storage_class == STORAGE_CLASS_NONE && current_function != NULL)
3809 storage_class = STORAGE_CLASS_AUTO;
3810 entity->declaration.storage_class = storage_class;
3813 if (attributes != NULL) {
3814 handle_entity_attributes(attributes, entity);
3817 if (entity->kind == ENTITY_FUNCTION && !freestanding) {
3818 adapt_special_functions(&entity->function);
3824 static type_t *parse_abstract_declarator(type_t *base_type)
3826 parse_declarator_env_t env;
3827 memset(&env, 0, sizeof(env));
3828 env.may_be_abstract = true;
3829 env.must_be_abstract = true;
3831 construct_type_t *construct_type = parse_inner_declarator(&env);
3833 type_t *result = construct_declarator_type(construct_type, base_type);
3834 if (construct_type != NULL) {
3835 obstack_free(&temp_obst, construct_type);
3837 result = handle_type_attributes(env.attributes, result);
3843 * Check if the declaration of main is suspicious. main should be a
3844 * function with external linkage, returning int, taking either zero
3845 * arguments, two, or three arguments of appropriate types, ie.
3847 * int main([ int argc, char **argv [, char **env ] ]).
3849 * @param decl the declaration to check
3850 * @param type the function type of the declaration
3852 static void check_main(const entity_t *entity)
3854 const source_position_t *pos = &entity->base.source_position;
3855 if (entity->kind != ENTITY_FUNCTION) {
3856 warningf(WARN_MAIN, pos, "'main' is not a function");
3860 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
3861 warningf(WARN_MAIN, pos, "'main' is normally a non-static function");
3864 type_t *type = skip_typeref(entity->declaration.type);
3865 assert(is_type_function(type));
3867 function_type_t const *const func_type = &type->function;
3868 type_t *const ret_type = func_type->return_type;
3869 if (!types_compatible(skip_typeref(ret_type), type_int)) {
3870 warningf(WARN_MAIN, pos, "return type of 'main' should be 'int', but is '%T'", ret_type);
3872 const function_parameter_t *parm = func_type->parameters;
3874 type_t *const first_type = skip_typeref(parm->type);
3875 type_t *const first_type_unqual = get_unqualified_type(first_type);
3876 if (!types_compatible(first_type_unqual, type_int)) {
3877 warningf(WARN_MAIN, pos, "first argument of 'main' should be 'int', but is '%T'", parm->type);
3881 type_t *const second_type = skip_typeref(parm->type);
3882 type_t *const second_type_unqual
3883 = get_unqualified_type(second_type);
3884 if (!types_compatible(second_type_unqual, type_char_ptr_ptr)) {
3885 warningf(WARN_MAIN, pos, "second argument of 'main' should be 'char**', but is '%T'", parm->type);
3889 type_t *const third_type = skip_typeref(parm->type);
3890 type_t *const third_type_unqual
3891 = get_unqualified_type(third_type);
3892 if (!types_compatible(third_type_unqual, type_char_ptr_ptr)) {
3893 warningf(WARN_MAIN, pos, "third argument of 'main' should be 'char**', but is '%T'", parm->type);
3897 goto warn_arg_count;
3901 warningf(WARN_MAIN, pos, "'main' takes only zero, two or three arguments");
3907 * Check if a symbol is the equal to "main".
3909 static bool is_sym_main(const symbol_t *const sym)
3911 return streq(sym->string, "main");
3914 static void error_redefined_as_different_kind(const source_position_t *pos,
3915 const entity_t *old, entity_kind_t new_kind)
3917 char const *const what = get_entity_kind_name(new_kind);
3918 source_position_t const *const ppos = &old->base.source_position;
3919 errorf(pos, "redeclaration of '%N' as %s (declared %P)", old, what, ppos);
3922 static bool is_entity_valid(entity_t *const ent)
3924 if (is_declaration(ent)) {
3925 return is_type_valid(skip_typeref(ent->declaration.type));
3926 } else if (ent->kind == ENTITY_TYPEDEF) {
3927 return is_type_valid(skip_typeref(ent->typedefe.type));
3932 static bool contains_attribute(const attribute_t *list, const attribute_t *attr)
3934 for (const attribute_t *tattr = list; tattr != NULL; tattr = tattr->next) {
3935 if (attributes_equal(tattr, attr))
3942 * test wether new_list contains any attributes not included in old_list
3944 static bool has_new_attributes(const attribute_t *old_list,
3945 const attribute_t *new_list)
3947 for (const attribute_t *attr = new_list; attr != NULL; attr = attr->next) {
3948 if (!contains_attribute(old_list, attr))
3955 * Merge in attributes from an attribute list (probably from a previous
3956 * declaration with the same name). Warning: destroys the old structure
3957 * of the attribute list - don't reuse attributes after this call.
3959 static void merge_in_attributes(declaration_t *decl, attribute_t *attributes)
3962 for (attribute_t *attr = attributes; attr != NULL; attr = next) {
3964 if (contains_attribute(decl->attributes, attr))
3967 /* move attribute to new declarations attributes list */
3968 attr->next = decl->attributes;
3969 decl->attributes = attr;
3974 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
3975 * for various problems that occur for multiple definitions
3977 entity_t *record_entity(entity_t *entity, const bool is_definition)
3979 const symbol_t *const symbol = entity->base.symbol;
3980 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
3981 const source_position_t *pos = &entity->base.source_position;
3983 /* can happen in error cases */
3987 entity_t *const previous_entity = get_entity(symbol, namespc);
3988 /* pushing the same entity twice will break the stack structure */
3989 assert(previous_entity != entity);
3991 if (entity->kind == ENTITY_FUNCTION) {
3992 type_t *const orig_type = entity->declaration.type;
3993 type_t *const type = skip_typeref(orig_type);
3995 assert(is_type_function(type));
3996 if (type->function.unspecified_parameters &&
3997 previous_entity == NULL &&
3998 !entity->declaration.implicit) {
3999 warningf(WARN_STRICT_PROTOTYPES, pos, "function declaration '%#N' is not a prototype", entity);
4002 if (current_scope == file_scope && is_sym_main(symbol)) {
4007 if (is_declaration(entity) &&
4008 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
4009 current_scope != file_scope &&
4010 !entity->declaration.implicit) {
4011 warningf(WARN_NESTED_EXTERNS, pos, "nested extern declaration of '%#N'", entity);
4014 if (previous_entity != NULL) {
4015 source_position_t const *const ppos = &previous_entity->base.source_position;
4017 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
4018 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
4019 assert(previous_entity->kind == ENTITY_PARAMETER);
4020 errorf(pos, "declaration of '%N' redeclares the '%N' (declared %P)", entity, previous_entity, ppos);
4024 if (previous_entity->base.parent_scope == current_scope) {
4025 if (previous_entity->kind != entity->kind) {
4026 if (is_entity_valid(previous_entity) && is_entity_valid(entity)) {
4027 error_redefined_as_different_kind(pos, previous_entity,
4032 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
4033 errorf(pos, "redeclaration of '%N' (declared %P)", entity, ppos);
4036 if (previous_entity->kind == ENTITY_TYPEDEF) {
4037 type_t *const type = skip_typeref(entity->typedefe.type);
4038 type_t *const prev_type
4039 = skip_typeref(previous_entity->typedefe.type);
4040 if (c_mode & _CXX) {
4041 /* C++ allows double typedef if they are identical
4042 * (after skipping typedefs) */
4043 if (type == prev_type)
4046 /* GCC extension: redef in system headers is allowed */
4047 if ((pos->is_system_header || ppos->is_system_header) &&
4048 types_compatible(type, prev_type))
4051 errorf(pos, "redefinition of '%N' (declared %P)",
4056 /* at this point we should have only VARIABLES or FUNCTIONS */
4057 assert(is_declaration(previous_entity) && is_declaration(entity));
4059 declaration_t *const prev_decl = &previous_entity->declaration;
4060 declaration_t *const decl = &entity->declaration;
4062 /* can happen for K&R style declarations */
4063 if (prev_decl->type == NULL &&
4064 previous_entity->kind == ENTITY_PARAMETER &&
4065 entity->kind == ENTITY_PARAMETER) {
4066 prev_decl->type = decl->type;
4067 prev_decl->storage_class = decl->storage_class;
4068 prev_decl->declared_storage_class = decl->declared_storage_class;
4069 prev_decl->modifiers = decl->modifiers;
4070 return previous_entity;
4073 type_t *const type = skip_typeref(decl->type);
4074 type_t *const prev_type = skip_typeref(prev_decl->type);
4076 if (!types_compatible(type, prev_type)) {
4077 errorf(pos, "declaration '%#N' is incompatible with '%#N' (declared %P)", entity, previous_entity, ppos);
4079 unsigned old_storage_class = prev_decl->storage_class;
4081 if (is_definition &&
4083 !(prev_decl->modifiers & DM_USED) &&
4084 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4085 warningf(WARN_REDUNDANT_DECLS, ppos, "unnecessary static forward declaration for '%#N'", previous_entity);
4088 storage_class_t new_storage_class = decl->storage_class;
4090 /* pretend no storage class means extern for function
4091 * declarations (except if the previous declaration is neither
4092 * none nor extern) */
4093 if (entity->kind == ENTITY_FUNCTION) {
4094 /* the previous declaration could have unspecified parameters or
4095 * be a typedef, so use the new type */
4096 if (prev_type->function.unspecified_parameters || is_definition)
4097 prev_decl->type = type;
4099 switch (old_storage_class) {
4100 case STORAGE_CLASS_NONE:
4101 old_storage_class = STORAGE_CLASS_EXTERN;
4104 case STORAGE_CLASS_EXTERN:
4105 if (is_definition) {
4106 if (prev_type->function.unspecified_parameters && !is_sym_main(symbol)) {
4107 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4109 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4110 new_storage_class = STORAGE_CLASS_EXTERN;
4117 } else if (is_type_incomplete(prev_type)) {
4118 prev_decl->type = type;
4121 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4122 new_storage_class == STORAGE_CLASS_EXTERN) {
4124 warn_redundant_declaration: ;
4126 = has_new_attributes(prev_decl->attributes,
4128 if (has_new_attrs) {
4129 merge_in_attributes(decl, prev_decl->attributes);
4130 } else if (!is_definition &&
4131 is_type_valid(prev_type) &&
4132 !pos->is_system_header) {
4133 warningf(WARN_REDUNDANT_DECLS, pos, "redundant declaration for '%Y' (declared %P)", symbol, ppos);
4135 } else if (current_function == NULL) {
4136 if (old_storage_class != STORAGE_CLASS_STATIC &&
4137 new_storage_class == STORAGE_CLASS_STATIC) {
4138 errorf(pos, "static declaration of '%Y' follows non-static declaration (declared %P)", symbol, ppos);
4139 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4140 prev_decl->storage_class = STORAGE_CLASS_NONE;
4141 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4143 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4145 goto error_redeclaration;
4146 goto warn_redundant_declaration;
4148 } else if (is_type_valid(prev_type)) {
4149 if (old_storage_class == new_storage_class) {
4150 error_redeclaration:
4151 errorf(pos, "redeclaration of '%Y' (declared %P)", symbol, ppos);
4153 errorf(pos, "redeclaration of '%Y' with different linkage (declared %P)", symbol, ppos);
4158 prev_decl->modifiers |= decl->modifiers;
4159 if (entity->kind == ENTITY_FUNCTION) {
4160 previous_entity->function.is_inline |= entity->function.is_inline;
4162 return previous_entity;
4166 if (is_warn_on(why = WARN_SHADOW) ||
4167 (is_warn_on(why = WARN_SHADOW_LOCAL) && previous_entity->base.parent_scope != file_scope)) {
4168 char const *const what = get_entity_kind_name(previous_entity->kind);
4169 warningf(why, pos, "'%N' shadows %s (declared %P)", entity, what, ppos);
4173 if (entity->kind == ENTITY_FUNCTION) {
4174 if (is_definition &&
4175 entity->declaration.storage_class != STORAGE_CLASS_STATIC &&
4176 !is_sym_main(symbol)) {
4177 if (is_warn_on(WARN_MISSING_PROTOTYPES)) {
4178 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4180 goto warn_missing_declaration;
4183 } else if (entity->kind == ENTITY_VARIABLE) {
4184 if (current_scope == file_scope &&
4185 entity->declaration.storage_class == STORAGE_CLASS_NONE &&
4186 !entity->declaration.implicit) {
4187 warn_missing_declaration:
4188 warningf(WARN_MISSING_DECLARATIONS, pos, "no previous declaration for '%#N'", entity);
4193 assert(entity->base.parent_scope == NULL);
4194 assert(current_scope != NULL);
4196 entity->base.parent_scope = current_scope;
4197 environment_push(entity);
4198 append_entity(current_scope, entity);
4203 static void parser_error_multiple_definition(entity_t *entity,
4204 const source_position_t *source_position)
4206 errorf(source_position, "multiple definition of '%Y' (declared %P)",
4207 entity->base.symbol, &entity->base.source_position);
4210 static bool is_declaration_specifier(const token_t *token)
4212 switch (token->kind) {
4216 return is_typedef_symbol(token->identifier.symbol);
4223 static void parse_init_declarator_rest(entity_t *entity)
4225 type_t *orig_type = type_error_type;
4227 if (entity->base.kind == ENTITY_TYPEDEF) {
4228 source_position_t const *const pos = &entity->base.source_position;
4229 errorf(pos, "'%N' is initialized (use __typeof__ instead)", entity);
4231 assert(is_declaration(entity));
4232 orig_type = entity->declaration.type;
4235 type_t *type = skip_typeref(orig_type);
4237 if (entity->kind == ENTITY_VARIABLE
4238 && entity->variable.initializer != NULL) {
4239 parser_error_multiple_definition(entity, HERE);
4243 declaration_t *const declaration = &entity->declaration;
4244 bool must_be_constant = false;
4245 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4246 entity->base.parent_scope == file_scope) {
4247 must_be_constant = true;
4250 if (is_type_function(type)) {
4251 source_position_t const *const pos = &entity->base.source_position;
4252 errorf(pos, "'%N' is initialized like a variable", entity);
4253 orig_type = type_error_type;
4256 parse_initializer_env_t env;
4257 env.type = orig_type;
4258 env.must_be_constant = must_be_constant;
4259 env.entity = entity;
4261 initializer_t *initializer = parse_initializer(&env);
4263 if (entity->kind == ENTITY_VARIABLE) {
4264 /* §6.7.5:22 array initializers for arrays with unknown size
4265 * determine the array type size */
4266 declaration->type = env.type;
4267 entity->variable.initializer = initializer;
4271 /* parse rest of a declaration without any declarator */
4272 static void parse_anonymous_declaration_rest(
4273 const declaration_specifiers_t *specifiers)
4276 anonymous_entity = NULL;
4278 source_position_t const *const pos = &specifiers->source_position;
4279 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4280 specifiers->thread_local) {
4281 warningf(WARN_OTHER, pos, "useless storage class in empty declaration");
4284 type_t *type = specifiers->type;
4285 switch (type->kind) {
4286 case TYPE_COMPOUND_STRUCT:
4287 case TYPE_COMPOUND_UNION: {
4288 if (type->compound.compound->base.symbol == NULL) {
4289 warningf(WARN_OTHER, pos, "unnamed struct/union that defines no instances");
4298 warningf(WARN_OTHER, pos, "empty declaration");
4303 static void check_variable_type_complete(entity_t *ent)
4305 if (ent->kind != ENTITY_VARIABLE)
4308 /* §6.7:7 If an identifier for an object is declared with no linkage, the
4309 * type for the object shall be complete [...] */
4310 declaration_t *decl = &ent->declaration;
4311 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4312 decl->storage_class == STORAGE_CLASS_STATIC)
4315 type_t *const type = skip_typeref(decl->type);
4316 if (!is_type_incomplete(type))
4319 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4320 * are given length one. */
4321 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4322 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4326 errorf(&ent->base.source_position, "variable '%#N' has incomplete type", ent);
4330 static void parse_declaration_rest(entity_t *ndeclaration,
4331 const declaration_specifiers_t *specifiers,
4332 parsed_declaration_func finished_declaration,
4333 declarator_flags_t flags)
4335 add_anchor_token(';');
4336 add_anchor_token(',');
4338 entity_t *entity = finished_declaration(ndeclaration, token.kind == '=');
4340 if (token.kind == '=') {
4341 parse_init_declarator_rest(entity);
4342 } else if (entity->kind == ENTITY_VARIABLE) {
4343 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
4344 * [...] where the extern specifier is explicitly used. */
4345 declaration_t *decl = &entity->declaration;
4346 if (decl->storage_class != STORAGE_CLASS_EXTERN &&
4347 is_type_reference(skip_typeref(decl->type))) {
4348 source_position_t const *const pos = &entity->base.source_position;
4349 errorf(pos, "reference '%#N' must be initialized", entity);
4353 check_variable_type_complete(entity);
4358 add_anchor_token('=');
4359 ndeclaration = parse_declarator(specifiers, flags);
4360 rem_anchor_token('=');
4362 rem_anchor_token(',');
4363 rem_anchor_token(';');
4366 anonymous_entity = NULL;
4369 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4371 symbol_t *symbol = entity->base.symbol;
4375 assert(entity->base.namespc == NAMESPACE_NORMAL);
4376 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4377 if (previous_entity == NULL
4378 || previous_entity->base.parent_scope != current_scope) {
4379 errorf(&entity->base.source_position, "expected declaration of a function parameter, found '%Y'",
4384 if (is_definition) {
4385 errorf(HERE, "'%N' is initialised", entity);
4388 return record_entity(entity, false);
4391 static void parse_declaration(parsed_declaration_func finished_declaration,
4392 declarator_flags_t flags)
4394 add_anchor_token(';');
4395 declaration_specifiers_t specifiers;
4396 parse_declaration_specifiers(&specifiers);
4397 rem_anchor_token(';');
4399 if (token.kind == ';') {
4400 parse_anonymous_declaration_rest(&specifiers);
4402 entity_t *entity = parse_declarator(&specifiers, flags);
4403 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4408 static type_t *get_default_promoted_type(type_t *orig_type)
4410 type_t *result = orig_type;
4412 type_t *type = skip_typeref(orig_type);
4413 if (is_type_integer(type)) {
4414 result = promote_integer(type);
4415 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4416 result = type_double;
4422 static void parse_kr_declaration_list(entity_t *entity)
4424 if (entity->kind != ENTITY_FUNCTION)
4427 type_t *type = skip_typeref(entity->declaration.type);
4428 assert(is_type_function(type));
4429 if (!type->function.kr_style_parameters)
4432 add_anchor_token('{');
4434 PUSH_SCOPE(&entity->function.parameters);
4436 entity_t *parameter = entity->function.parameters.entities;
4437 for ( ; parameter != NULL; parameter = parameter->base.next) {
4438 assert(parameter->base.parent_scope == NULL);
4439 parameter->base.parent_scope = current_scope;
4440 environment_push(parameter);
4443 /* parse declaration list */
4445 switch (token.kind) {
4447 /* This covers symbols, which are no type, too, and results in
4448 * better error messages. The typical cases are misspelled type
4449 * names and missing includes. */
4451 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4461 /* update function type */
4462 type_t *new_type = duplicate_type(type);
4464 function_parameter_t *parameters = NULL;
4465 function_parameter_t **anchor = ¶meters;
4467 /* did we have an earlier prototype? */
4468 entity_t *proto_type = get_entity(entity->base.symbol, NAMESPACE_NORMAL);
4469 if (proto_type != NULL && proto_type->kind != ENTITY_FUNCTION)
4472 function_parameter_t *proto_parameter = NULL;
4473 if (proto_type != NULL) {
4474 type_t *proto_type_type = proto_type->declaration.type;
4475 proto_parameter = proto_type_type->function.parameters;
4476 /* If a K&R function definition has a variadic prototype earlier, then
4477 * make the function definition variadic, too. This should conform to
4478 * §6.7.5.3:15 and §6.9.1:8. */
4479 new_type->function.variadic = proto_type_type->function.variadic;
4481 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
4483 new_type->function.unspecified_parameters = true;
4486 bool need_incompatible_warning = false;
4487 parameter = entity->function.parameters.entities;
4488 for (; parameter != NULL; parameter = parameter->base.next,
4490 proto_parameter == NULL ? NULL : proto_parameter->next) {
4491 if (parameter->kind != ENTITY_PARAMETER)
4494 type_t *parameter_type = parameter->declaration.type;
4495 if (parameter_type == NULL) {
4496 source_position_t const* const pos = ¶meter->base.source_position;
4498 errorf(pos, "no type specified for function '%N'", parameter);
4499 parameter_type = type_error_type;
4501 warningf(WARN_IMPLICIT_INT, pos, "no type specified for function parameter '%N', using 'int'", parameter);
4502 parameter_type = type_int;
4504 parameter->declaration.type = parameter_type;
4507 semantic_parameter_incomplete(parameter);
4509 /* we need the default promoted types for the function type */
4510 type_t *not_promoted = parameter_type;
4511 parameter_type = get_default_promoted_type(parameter_type);
4513 /* gcc special: if the type of the prototype matches the unpromoted
4514 * type don't promote */
4515 if (!strict_mode && proto_parameter != NULL) {
4516 type_t *proto_p_type = skip_typeref(proto_parameter->type);
4517 type_t *promo_skip = skip_typeref(parameter_type);
4518 type_t *param_skip = skip_typeref(not_promoted);
4519 if (!types_compatible(proto_p_type, promo_skip)
4520 && types_compatible(proto_p_type, param_skip)) {
4522 need_incompatible_warning = true;
4523 parameter_type = not_promoted;
4526 function_parameter_t *const function_parameter
4527 = allocate_parameter(parameter_type);
4529 *anchor = function_parameter;
4530 anchor = &function_parameter->next;
4533 new_type->function.parameters = parameters;
4534 new_type = identify_new_type(new_type);
4536 if (need_incompatible_warning) {
4537 symbol_t const *const sym = entity->base.symbol;
4538 source_position_t const *const pos = &entity->base.source_position;
4539 source_position_t const *const ppos = &proto_type->base.source_position;
4540 warningf(WARN_OTHER, pos, "declaration '%#N' is incompatible with '%#T' (declared %P)", proto_type, new_type, sym, ppos);
4542 entity->declaration.type = new_type;
4544 rem_anchor_token('{');
4547 static bool first_err = true;
4550 * When called with first_err set, prints the name of the current function,
4553 static void print_in_function(void)
4557 char const *const file = current_function->base.base.source_position.input_name;
4558 diagnosticf("%s: In '%N':\n", file, (entity_t const*)current_function);
4563 * Check if all labels are defined in the current function.
4564 * Check if all labels are used in the current function.
4566 static void check_labels(void)
4568 for (const goto_statement_t *goto_statement = goto_first;
4569 goto_statement != NULL;
4570 goto_statement = goto_statement->next) {
4571 label_t *label = goto_statement->label;
4572 if (label->base.source_position.input_name == NULL) {
4573 print_in_function();
4574 source_position_t const *const pos = &goto_statement->base.source_position;
4575 errorf(pos, "'%N' used but not defined", (entity_t const*)label);
4579 if (is_warn_on(WARN_UNUSED_LABEL)) {
4580 for (const label_statement_t *label_statement = label_first;
4581 label_statement != NULL;
4582 label_statement = label_statement->next) {
4583 label_t *label = label_statement->label;
4585 if (! label->used) {
4586 print_in_function();
4587 source_position_t const *const pos = &label_statement->base.source_position;
4588 warningf(WARN_UNUSED_LABEL, pos, "'%N' defined but not used", (entity_t const*)label);
4594 static void warn_unused_entity(warning_t const why, entity_t *entity, entity_t *const last)
4596 entity_t const *const end = last != NULL ? last->base.next : NULL;
4597 for (; entity != end; entity = entity->base.next) {
4598 if (!is_declaration(entity))
4601 declaration_t *declaration = &entity->declaration;
4602 if (declaration->implicit)
4605 if (!declaration->used) {
4606 print_in_function();
4607 warningf(why, &entity->base.source_position, "'%N' is unused", entity);
4608 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
4609 print_in_function();
4610 warningf(why, &entity->base.source_position, "'%N' is never read", entity);
4615 static void check_unused_variables(statement_t *const stmt, void *const env)
4619 switch (stmt->kind) {
4620 case STATEMENT_DECLARATION: {
4621 declaration_statement_t const *const decls = &stmt->declaration;
4622 warn_unused_entity(WARN_UNUSED_VARIABLE, decls->declarations_begin, decls->declarations_end);
4627 warn_unused_entity(WARN_UNUSED_VARIABLE, stmt->fors.scope.entities, NULL);
4636 * Check declarations of current_function for unused entities.
4638 static void check_declarations(void)
4640 if (is_warn_on(WARN_UNUSED_PARAMETER)) {
4641 const scope_t *scope = ¤t_function->parameters;
4643 /* do not issue unused warnings for main */
4644 if (!is_sym_main(current_function->base.base.symbol)) {
4645 warn_unused_entity(WARN_UNUSED_PARAMETER, scope->entities, NULL);
4648 if (is_warn_on(WARN_UNUSED_VARIABLE)) {
4649 walk_statements(current_function->statement, check_unused_variables,
4654 static int determine_truth(expression_t const* const cond)
4657 is_constant_expression(cond) != EXPR_CLASS_CONSTANT ? 0 :
4658 fold_constant_to_bool(cond) ? 1 :
4662 static void check_reachable(statement_t *);
4663 static bool reaches_end;
4665 static bool expression_returns(expression_t const *const expr)
4667 switch (expr->kind) {
4669 expression_t const *const func = expr->call.function;
4670 type_t const *const type = skip_typeref(func->base.type);
4671 if (type->kind == TYPE_POINTER) {
4672 type_t const *const points_to
4673 = skip_typeref(type->pointer.points_to);
4674 if (points_to->kind == TYPE_FUNCTION
4675 && points_to->function.modifiers & DM_NORETURN)
4679 if (!expression_returns(func))
4682 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
4683 if (!expression_returns(arg->expression))
4690 case EXPR_REFERENCE:
4691 case EXPR_ENUM_CONSTANT:
4692 case EXPR_LITERAL_CASES:
4693 case EXPR_STRING_LITERAL:
4694 case EXPR_WIDE_STRING_LITERAL:
4695 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
4696 case EXPR_LABEL_ADDRESS:
4697 case EXPR_CLASSIFY_TYPE:
4698 case EXPR_SIZEOF: // TODO handle obscure VLA case
4701 case EXPR_BUILTIN_CONSTANT_P:
4702 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
4707 case EXPR_STATEMENT: {
4708 bool old_reaches_end = reaches_end;
4709 reaches_end = false;
4710 check_reachable(expr->statement.statement);
4711 bool returns = reaches_end;
4712 reaches_end = old_reaches_end;
4716 case EXPR_CONDITIONAL:
4717 // TODO handle constant expression
4719 if (!expression_returns(expr->conditional.condition))
4722 if (expr->conditional.true_expression != NULL
4723 && expression_returns(expr->conditional.true_expression))
4726 return expression_returns(expr->conditional.false_expression);
4729 return expression_returns(expr->select.compound);
4731 case EXPR_ARRAY_ACCESS:
4733 expression_returns(expr->array_access.array_ref) &&
4734 expression_returns(expr->array_access.index);
4737 return expression_returns(expr->va_starte.ap);
4740 return expression_returns(expr->va_arge.ap);
4743 return expression_returns(expr->va_copye.src);
4745 case EXPR_UNARY_CASES_MANDATORY:
4746 return expression_returns(expr->unary.value);
4748 case EXPR_UNARY_THROW:
4751 case EXPR_BINARY_CASES:
4752 // TODO handle constant lhs of && and ||
4754 expression_returns(expr->binary.left) &&
4755 expression_returns(expr->binary.right);
4758 panic("unhandled expression");
4761 static bool initializer_returns(initializer_t const *const init)
4763 switch (init->kind) {
4764 case INITIALIZER_VALUE:
4765 return expression_returns(init->value.value);
4767 case INITIALIZER_LIST: {
4768 initializer_t * const* i = init->list.initializers;
4769 initializer_t * const* const end = i + init->list.len;
4770 bool returns = true;
4771 for (; i != end; ++i) {
4772 if (!initializer_returns(*i))
4778 case INITIALIZER_STRING:
4779 case INITIALIZER_WIDE_STRING:
4780 case INITIALIZER_DESIGNATOR: // designators have no payload
4783 panic("unhandled initializer");
4786 static bool noreturn_candidate;
4788 static void check_reachable(statement_t *const stmt)
4790 if (stmt->base.reachable)
4792 if (stmt->kind != STATEMENT_DO_WHILE)
4793 stmt->base.reachable = true;
4795 statement_t *last = stmt;
4797 switch (stmt->kind) {
4798 case STATEMENT_ERROR:
4799 case STATEMENT_EMPTY:
4801 next = stmt->base.next;
4804 case STATEMENT_DECLARATION: {
4805 declaration_statement_t const *const decl = &stmt->declaration;
4806 entity_t const * ent = decl->declarations_begin;
4807 entity_t const *const last_decl = decl->declarations_end;
4809 for (;; ent = ent->base.next) {
4810 if (ent->kind == ENTITY_VARIABLE &&
4811 ent->variable.initializer != NULL &&
4812 !initializer_returns(ent->variable.initializer)) {
4815 if (ent == last_decl)
4819 next = stmt->base.next;
4823 case STATEMENT_COMPOUND:
4824 next = stmt->compound.statements;
4826 next = stmt->base.next;
4829 case STATEMENT_RETURN: {
4830 expression_t const *const val = stmt->returns.value;
4831 if (val == NULL || expression_returns(val))
4832 noreturn_candidate = false;
4836 case STATEMENT_IF: {
4837 if_statement_t const *const ifs = &stmt->ifs;
4838 expression_t const *const cond = ifs->condition;
4840 if (!expression_returns(cond))
4843 int const val = determine_truth(cond);
4846 check_reachable(ifs->true_statement);
4851 if (ifs->false_statement != NULL) {
4852 check_reachable(ifs->false_statement);
4856 next = stmt->base.next;
4860 case STATEMENT_SWITCH: {
4861 switch_statement_t const *const switchs = &stmt->switchs;
4862 expression_t const *const expr = switchs->expression;
4864 if (!expression_returns(expr))
4867 if (is_constant_expression(expr) == EXPR_CLASS_CONSTANT) {
4868 long const val = fold_constant_to_int(expr);
4869 case_label_statement_t * defaults = NULL;
4870 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4871 if (i->expression == NULL) {
4876 if (i->first_case <= val && val <= i->last_case) {
4877 check_reachable((statement_t*)i);
4882 if (defaults != NULL) {
4883 check_reachable((statement_t*)defaults);
4887 bool has_default = false;
4888 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4889 if (i->expression == NULL)
4892 check_reachable((statement_t*)i);
4899 next = stmt->base.next;
4903 case STATEMENT_EXPRESSION: {
4904 /* Check for noreturn function call */
4905 expression_t const *const expr = stmt->expression.expression;
4906 if (!expression_returns(expr))
4909 next = stmt->base.next;
4913 case STATEMENT_CONTINUE:
4914 for (statement_t *parent = stmt;;) {
4915 parent = parent->base.parent;
4916 if (parent == NULL) /* continue not within loop */
4920 switch (parent->kind) {
4921 case STATEMENT_WHILE: goto continue_while;
4922 case STATEMENT_DO_WHILE: goto continue_do_while;
4923 case STATEMENT_FOR: goto continue_for;
4929 case STATEMENT_BREAK:
4930 for (statement_t *parent = stmt;;) {
4931 parent = parent->base.parent;
4932 if (parent == NULL) /* break not within loop/switch */
4935 switch (parent->kind) {
4936 case STATEMENT_SWITCH:
4937 case STATEMENT_WHILE:
4938 case STATEMENT_DO_WHILE:
4941 next = parent->base.next;
4942 goto found_break_parent;
4950 case STATEMENT_COMPUTED_GOTO: {
4951 if (!expression_returns(stmt->computed_goto.expression))
4954 statement_t *parent = stmt->base.parent;
4955 if (parent == NULL) /* top level goto */
4961 case STATEMENT_GOTO:
4962 next = stmt->gotos.label->statement;
4963 if (next == NULL) /* missing label */
4967 case STATEMENT_LABEL:
4968 next = stmt->label.statement;
4971 case STATEMENT_CASE_LABEL:
4972 next = stmt->case_label.statement;
4975 case STATEMENT_WHILE: {
4976 while_statement_t const *const whiles = &stmt->whiles;
4977 expression_t const *const cond = whiles->condition;
4979 if (!expression_returns(cond))
4982 int const val = determine_truth(cond);
4985 check_reachable(whiles->body);
4990 next = stmt->base.next;
4994 case STATEMENT_DO_WHILE:
4995 next = stmt->do_while.body;
4998 case STATEMENT_FOR: {
4999 for_statement_t *const fors = &stmt->fors;
5001 if (fors->condition_reachable)
5003 fors->condition_reachable = true;
5005 expression_t const *const cond = fors->condition;
5010 } else if (expression_returns(cond)) {
5011 val = determine_truth(cond);
5017 check_reachable(fors->body);
5022 next = stmt->base.next;
5026 case STATEMENT_MS_TRY: {
5027 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5028 check_reachable(ms_try->try_statement);
5029 next = ms_try->final_statement;
5033 case STATEMENT_LEAVE: {
5034 statement_t *parent = stmt;
5036 parent = parent->base.parent;
5037 if (parent == NULL) /* __leave not within __try */
5040 if (parent->kind == STATEMENT_MS_TRY) {
5042 next = parent->ms_try.final_statement;
5050 panic("invalid statement kind");
5053 while (next == NULL) {
5054 next = last->base.parent;
5056 noreturn_candidate = false;
5058 type_t *const type = skip_typeref(current_function->base.type);
5059 assert(is_type_function(type));
5060 type_t *const ret = skip_typeref(type->function.return_type);
5061 if (!is_type_void(ret) &&
5062 is_type_valid(ret) &&
5063 !is_sym_main(current_function->base.base.symbol)) {
5064 source_position_t const *const pos = &stmt->base.source_position;
5065 warningf(WARN_RETURN_TYPE, pos, "control reaches end of non-void function");
5070 switch (next->kind) {
5071 case STATEMENT_ERROR:
5072 case STATEMENT_EMPTY:
5073 case STATEMENT_DECLARATION:
5074 case STATEMENT_EXPRESSION:
5076 case STATEMENT_RETURN:
5077 case STATEMENT_CONTINUE:
5078 case STATEMENT_BREAK:
5079 case STATEMENT_COMPUTED_GOTO:
5080 case STATEMENT_GOTO:
5081 case STATEMENT_LEAVE:
5082 panic("invalid control flow in function");
5084 case STATEMENT_COMPOUND:
5085 if (next->compound.stmt_expr) {
5091 case STATEMENT_SWITCH:
5092 case STATEMENT_LABEL:
5093 case STATEMENT_CASE_LABEL:
5095 next = next->base.next;
5098 case STATEMENT_WHILE: {
5100 if (next->base.reachable)
5102 next->base.reachable = true;
5104 while_statement_t const *const whiles = &next->whiles;
5105 expression_t const *const cond = whiles->condition;
5107 if (!expression_returns(cond))
5110 int const val = determine_truth(cond);
5113 check_reachable(whiles->body);
5119 next = next->base.next;
5123 case STATEMENT_DO_WHILE: {
5125 if (next->base.reachable)
5127 next->base.reachable = true;
5129 do_while_statement_t const *const dw = &next->do_while;
5130 expression_t const *const cond = dw->condition;
5132 if (!expression_returns(cond))
5135 int const val = determine_truth(cond);
5138 check_reachable(dw->body);
5144 next = next->base.next;
5148 case STATEMENT_FOR: {
5150 for_statement_t *const fors = &next->fors;
5152 fors->step_reachable = true;
5154 if (fors->condition_reachable)
5156 fors->condition_reachable = true;
5158 expression_t const *const cond = fors->condition;
5163 } else if (expression_returns(cond)) {
5164 val = determine_truth(cond);
5170 check_reachable(fors->body);
5176 next = next->base.next;
5180 case STATEMENT_MS_TRY:
5182 next = next->ms_try.final_statement;
5187 check_reachable(next);
5190 static void check_unreachable(statement_t* const stmt, void *const env)
5194 switch (stmt->kind) {
5195 case STATEMENT_DO_WHILE:
5196 if (!stmt->base.reachable) {
5197 expression_t const *const cond = stmt->do_while.condition;
5198 if (determine_truth(cond) >= 0) {
5199 source_position_t const *const pos = &cond->base.source_position;
5200 warningf(WARN_UNREACHABLE_CODE, pos, "condition of do-while-loop is unreachable");
5205 case STATEMENT_FOR: {
5206 for_statement_t const* const fors = &stmt->fors;
5208 // if init and step are unreachable, cond is unreachable, too
5209 if (!stmt->base.reachable && !fors->step_reachable) {
5210 goto warn_unreachable;
5212 if (!stmt->base.reachable && fors->initialisation != NULL) {
5213 source_position_t const *const pos = &fors->initialisation->base.source_position;
5214 warningf(WARN_UNREACHABLE_CODE, pos, "initialisation of for-statement is unreachable");
5217 if (!fors->condition_reachable && fors->condition != NULL) {
5218 source_position_t const *const pos = &fors->condition->base.source_position;
5219 warningf(WARN_UNREACHABLE_CODE, pos, "condition of for-statement is unreachable");
5222 if (!fors->step_reachable && fors->step != NULL) {
5223 source_position_t const *const pos = &fors->step->base.source_position;
5224 warningf(WARN_UNREACHABLE_CODE, pos, "step of for-statement is unreachable");
5230 case STATEMENT_COMPOUND:
5231 if (stmt->compound.statements != NULL)
5233 goto warn_unreachable;
5235 case STATEMENT_DECLARATION: {
5236 /* Only warn if there is at least one declarator with an initializer.
5237 * This typically occurs in switch statements. */
5238 declaration_statement_t const *const decl = &stmt->declaration;
5239 entity_t const * ent = decl->declarations_begin;
5240 entity_t const *const last = decl->declarations_end;
5242 for (;; ent = ent->base.next) {
5243 if (ent->kind == ENTITY_VARIABLE &&
5244 ent->variable.initializer != NULL) {
5245 goto warn_unreachable;
5255 if (!stmt->base.reachable) {
5256 source_position_t const *const pos = &stmt->base.source_position;
5257 warningf(WARN_UNREACHABLE_CODE, pos, "statement is unreachable");
5263 static bool is_main(entity_t *entity)
5265 static symbol_t *sym_main = NULL;
5266 if (sym_main == NULL) {
5267 sym_main = symbol_table_insert("main");
5270 if (entity->base.symbol != sym_main)
5272 /* must be in outermost scope */
5273 if (entity->base.parent_scope != file_scope)
5279 static void parse_external_declaration(void)
5281 /* function-definitions and declarations both start with declaration
5283 add_anchor_token(';');
5284 declaration_specifiers_t specifiers;
5285 parse_declaration_specifiers(&specifiers);
5286 rem_anchor_token(';');
5288 /* must be a declaration */
5289 if (token.kind == ';') {
5290 parse_anonymous_declaration_rest(&specifiers);
5294 add_anchor_token(',');
5295 add_anchor_token('=');
5296 add_anchor_token(';');
5297 add_anchor_token('{');
5299 /* declarator is common to both function-definitions and declarations */
5300 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
5302 rem_anchor_token('{');
5303 rem_anchor_token(';');
5304 rem_anchor_token('=');
5305 rem_anchor_token(',');
5307 /* must be a declaration */
5308 switch (token.kind) {
5312 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
5317 /* must be a function definition */
5318 parse_kr_declaration_list(ndeclaration);
5320 if (token.kind != '{') {
5321 parse_error_expected("while parsing function definition", '{', NULL);
5322 eat_until_matching_token(';');
5326 assert(is_declaration(ndeclaration));
5327 type_t *const orig_type = ndeclaration->declaration.type;
5328 type_t * type = skip_typeref(orig_type);
5330 if (!is_type_function(type)) {
5331 if (is_type_valid(type)) {
5332 errorf(HERE, "declarator '%#N' has a body but is not a function type", ndeclaration);
5338 source_position_t const *const pos = &ndeclaration->base.source_position;
5339 if (is_typeref(orig_type)) {
5341 errorf(pos, "type of function definition '%#N' is a typedef", ndeclaration);
5344 if (is_type_compound(skip_typeref(type->function.return_type))) {
5345 warningf(WARN_AGGREGATE_RETURN, pos, "'%N' returns an aggregate", ndeclaration);
5347 if (type->function.unspecified_parameters) {
5348 warningf(WARN_OLD_STYLE_DEFINITION, pos, "old-style definition of '%N'", ndeclaration);
5350 warningf(WARN_TRADITIONAL, pos, "traditional C rejects ISO C style definition of '%N'", ndeclaration);
5353 /* §6.7.5.3:14 a function definition with () means no
5354 * parameters (and not unspecified parameters) */
5355 if (type->function.unspecified_parameters &&
5356 type->function.parameters == NULL) {
5357 type_t *copy = duplicate_type(type);
5358 copy->function.unspecified_parameters = false;
5359 type = identify_new_type(copy);
5361 ndeclaration->declaration.type = type;
5364 entity_t *const entity = record_entity(ndeclaration, true);
5365 assert(entity->kind == ENTITY_FUNCTION);
5366 assert(ndeclaration->kind == ENTITY_FUNCTION);
5368 function_t *const function = &entity->function;
5369 if (ndeclaration != entity) {
5370 function->parameters = ndeclaration->function.parameters;
5372 assert(is_declaration(entity));
5373 type = skip_typeref(entity->declaration.type);
5375 PUSH_SCOPE(&function->parameters);
5377 entity_t *parameter = function->parameters.entities;
5378 for (; parameter != NULL; parameter = parameter->base.next) {
5379 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5380 parameter->base.parent_scope = current_scope;
5382 assert(parameter->base.parent_scope == NULL
5383 || parameter->base.parent_scope == current_scope);
5384 parameter->base.parent_scope = current_scope;
5385 if (parameter->base.symbol == NULL) {
5386 errorf(¶meter->base.source_position, "parameter name omitted");
5389 environment_push(parameter);
5392 if (function->statement != NULL) {
5393 parser_error_multiple_definition(entity, HERE);
5396 /* parse function body */
5397 int label_stack_top = label_top();
5398 function_t *old_current_function = current_function;
5399 entity_t *old_current_entity = current_entity;
5400 current_function = function;
5401 current_entity = entity;
5405 goto_anchor = &goto_first;
5407 label_anchor = &label_first;
5409 statement_t *const body = parse_compound_statement(false);
5410 function->statement = body;
5413 check_declarations();
5414 if (is_warn_on(WARN_RETURN_TYPE) ||
5415 is_warn_on(WARN_UNREACHABLE_CODE) ||
5416 (is_warn_on(WARN_MISSING_NORETURN) && !(function->base.modifiers & DM_NORETURN))) {
5417 noreturn_candidate = true;
5418 check_reachable(body);
5419 if (is_warn_on(WARN_UNREACHABLE_CODE))
5420 walk_statements(body, check_unreachable, NULL);
5421 if (noreturn_candidate &&
5422 !(function->base.modifiers & DM_NORETURN)) {
5423 source_position_t const *const pos = &body->base.source_position;
5424 warningf(WARN_MISSING_NORETURN, pos, "function '%#N' is candidate for attribute 'noreturn'", entity);
5428 if (is_main(entity) && enable_main_collect2_hack)
5429 prepare_main_collect2(entity);
5432 assert(current_function == function);
5433 assert(current_entity == entity);
5434 current_entity = old_current_entity;
5435 current_function = old_current_function;
5436 label_pop_to(label_stack_top);
5442 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
5444 entity_t *iter = compound->members.entities;
5445 for (; iter != NULL; iter = iter->base.next) {
5446 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5449 if (iter->base.symbol == symbol) {
5451 } else if (iter->base.symbol == NULL) {
5452 /* search in anonymous structs and unions */
5453 type_t *type = skip_typeref(iter->declaration.type);
5454 if (is_type_compound(type)) {
5455 if (find_compound_entry(type->compound.compound, symbol)
5466 static void check_deprecated(const source_position_t *source_position,
5467 const entity_t *entity)
5469 if (!is_declaration(entity))
5471 if ((entity->declaration.modifiers & DM_DEPRECATED) == 0)
5474 source_position_t const *const epos = &entity->base.source_position;
5475 char const *const msg = get_deprecated_string(entity->declaration.attributes);
5477 warningf(WARN_DEPRECATED_DECLARATIONS, source_position, "'%N' is deprecated (declared %P): \"%s\"", entity, epos, msg);
5479 warningf(WARN_DEPRECATED_DECLARATIONS, source_position, "'%N' is deprecated (declared %P)", entity, epos);
5484 static expression_t *create_select(const source_position_t *pos,
5486 type_qualifiers_t qualifiers,
5489 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
5491 check_deprecated(pos, entry);
5493 expression_t *select = allocate_expression_zero(EXPR_SELECT);
5494 select->select.compound = addr;
5495 select->select.compound_entry = entry;
5497 type_t *entry_type = entry->declaration.type;
5498 type_t *res_type = get_qualified_type(entry_type, qualifiers);
5500 /* bitfields need special treatment */
5501 if (entry->compound_member.bitfield) {
5502 unsigned bit_size = entry->compound_member.bit_size;
5503 /* if fewer bits than an int, convert to int (see §6.3.1.1) */
5504 if (bit_size < get_atomic_type_size(ATOMIC_TYPE_INT) * BITS_PER_BYTE) {
5505 res_type = type_int;
5509 /* we always do the auto-type conversions; the & and sizeof parser contains
5510 * code to revert this! */
5511 select->base.type = automatic_type_conversion(res_type);
5518 * Find entry with symbol in compound. Search anonymous structs and unions and
5519 * creates implicit select expressions for them.
5520 * Returns the adress for the innermost compound.
5522 static expression_t *find_create_select(const source_position_t *pos,
5524 type_qualifiers_t qualifiers,
5525 compound_t *compound, symbol_t *symbol)
5527 entity_t *iter = compound->members.entities;
5528 for (; iter != NULL; iter = iter->base.next) {
5529 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5532 symbol_t *iter_symbol = iter->base.symbol;
5533 if (iter_symbol == NULL) {
5534 type_t *type = iter->declaration.type;
5535 if (type->kind != TYPE_COMPOUND_STRUCT
5536 && type->kind != TYPE_COMPOUND_UNION)
5539 compound_t *sub_compound = type->compound.compound;
5541 if (find_compound_entry(sub_compound, symbol) == NULL)
5544 expression_t *sub_addr = create_select(pos, addr, qualifiers, iter);
5545 sub_addr->base.source_position = *pos;
5546 sub_addr->base.implicit = true;
5547 return find_create_select(pos, sub_addr, qualifiers, sub_compound,
5551 if (iter_symbol == symbol) {
5552 return create_select(pos, addr, qualifiers, iter);
5559 static void parse_bitfield_member(entity_t *entity)
5563 expression_t *size = parse_constant_expression();
5566 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5567 type_t *type = entity->declaration.type;
5568 if (!is_type_integer(skip_typeref(type))) {
5569 errorf(HERE, "bitfield base type '%T' is not an integer type",
5573 if (is_constant_expression(size) != EXPR_CLASS_CONSTANT) {
5574 /* error already reported by parse_constant_expression */
5575 size_long = get_type_size(type) * 8;
5577 size_long = fold_constant_to_int(size);
5579 const symbol_t *symbol = entity->base.symbol;
5580 const symbol_t *user_symbol
5581 = symbol == NULL ? sym_anonymous : symbol;
5582 unsigned bit_size = get_type_size(type) * 8;
5583 if (size_long < 0) {
5584 errorf(HERE, "negative width in bit-field '%Y'", user_symbol);
5585 } else if (size_long == 0 && symbol != NULL) {
5586 errorf(HERE, "zero width for bit-field '%Y'", user_symbol);
5587 } else if (bit_size > 0 && (unsigned)size_long > bit_size) {
5588 errorf(HERE, "width of bitfield '%Y' exceeds its type",
5591 /* hope that people don't invent crazy types with more bits
5592 * than our struct can hold */
5594 (1 << sizeof(entity->compound_member.bit_size)*8));
5598 entity->compound_member.bitfield = true;
5599 entity->compound_member.bit_size = (unsigned char)size_long;
5602 static void parse_compound_declarators(compound_t *compound,
5603 const declaration_specifiers_t *specifiers)
5605 add_anchor_token(';');
5606 add_anchor_token(',');
5610 if (token.kind == ':') {
5611 /* anonymous bitfield */
5612 type_t *type = specifiers->type;
5613 entity_t *const entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, NULL, HERE);
5614 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
5615 entity->declaration.storage_class = STORAGE_CLASS_NONE;
5616 entity->declaration.type = type;
5618 parse_bitfield_member(entity);
5620 attribute_t *attributes = parse_attributes(NULL);
5621 attribute_t **anchor = &attributes;
5622 while (*anchor != NULL)
5623 anchor = &(*anchor)->next;
5624 *anchor = specifiers->attributes;
5625 if (attributes != NULL) {
5626 handle_entity_attributes(attributes, entity);
5628 entity->declaration.attributes = attributes;
5630 append_entity(&compound->members, entity);
5632 entity = parse_declarator(specifiers,
5633 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
5634 source_position_t const *const pos = &entity->base.source_position;
5635 if (entity->kind == ENTITY_TYPEDEF) {
5636 errorf(pos, "typedef not allowed as compound member");
5638 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5640 /* make sure we don't define a symbol multiple times */
5641 symbol_t *symbol = entity->base.symbol;
5642 if (symbol != NULL) {
5643 entity_t *prev = find_compound_entry(compound, symbol);
5645 source_position_t const *const ppos = &prev->base.source_position;
5646 errorf(pos, "multiple declarations of symbol '%Y' (declared %P)", symbol, ppos);
5650 if (token.kind == ':') {
5651 parse_bitfield_member(entity);
5653 attribute_t *attributes = parse_attributes(NULL);
5654 handle_entity_attributes(attributes, entity);
5656 type_t *orig_type = entity->declaration.type;
5657 type_t *type = skip_typeref(orig_type);
5658 if (is_type_function(type)) {
5659 errorf(pos, "'%N' must not have function type '%T'", entity, orig_type);
5660 } else if (is_type_incomplete(type)) {
5661 /* §6.7.2.1:16 flexible array member */
5662 if (!is_type_array(type) ||
5663 token.kind != ';' ||
5664 look_ahead(1)->kind != '}') {
5665 errorf(pos, "'%N' has incomplete type '%T'", entity, orig_type);
5666 } else if (compound->members.entities == NULL) {
5667 errorf(pos, "flexible array member in otherwise empty struct");
5672 append_entity(&compound->members, entity);
5675 } while (next_if(','));
5676 rem_anchor_token(',');
5677 rem_anchor_token(';');
5680 anonymous_entity = NULL;
5683 static void parse_compound_type_entries(compound_t *compound)
5686 add_anchor_token('}');
5689 switch (token.kind) {
5691 case T___extension__:
5692 case T_IDENTIFIER: {
5694 declaration_specifiers_t specifiers;
5695 parse_declaration_specifiers(&specifiers);
5696 parse_compound_declarators(compound, &specifiers);
5702 rem_anchor_token('}');
5705 compound->complete = true;
5711 static type_t *parse_typename(void)
5713 declaration_specifiers_t specifiers;
5714 parse_declaration_specifiers(&specifiers);
5715 if (specifiers.storage_class != STORAGE_CLASS_NONE
5716 || specifiers.thread_local) {
5717 /* TODO: improve error message, user does probably not know what a
5718 * storage class is...
5720 errorf(&specifiers.source_position, "typename must not have a storage class");
5723 type_t *result = parse_abstract_declarator(specifiers.type);
5731 typedef expression_t* (*parse_expression_function)(void);
5732 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
5734 typedef struct expression_parser_function_t expression_parser_function_t;
5735 struct expression_parser_function_t {
5736 parse_expression_function parser;
5737 precedence_t infix_precedence;
5738 parse_expression_infix_function infix_parser;
5741 static expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5744 * Prints an error message if an expression was expected but not read
5746 static expression_t *expected_expression_error(void)
5748 /* skip the error message if the error token was read */
5749 if (token.kind != T_ERROR) {
5750 errorf(HERE, "expected expression, got token %K", &token);
5754 return create_error_expression();
5757 static type_t *get_string_type(void)
5759 return is_warn_on(WARN_WRITE_STRINGS) ? type_const_char_ptr : type_char_ptr;
5762 static type_t *get_wide_string_type(void)
5764 return is_warn_on(WARN_WRITE_STRINGS) ? type_const_wchar_t_ptr : type_wchar_t_ptr;
5768 * Parse a string constant.
5770 static expression_t *parse_string_literal(void)
5772 source_position_t begin = token.base.source_position;
5773 string_t res = token.string.string;
5774 bool is_wide = (token.kind == T_WIDE_STRING_LITERAL);
5777 while (token.kind == T_STRING_LITERAL
5778 || token.kind == T_WIDE_STRING_LITERAL) {
5779 warn_string_concat(&token.base.source_position);
5780 res = concat_strings(&res, &token.string.string);
5782 is_wide |= token.kind == T_WIDE_STRING_LITERAL;
5785 expression_t *literal;
5787 literal = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
5788 literal->base.type = get_wide_string_type();
5790 literal = allocate_expression_zero(EXPR_STRING_LITERAL);
5791 literal->base.type = get_string_type();
5793 literal->base.source_position = begin;
5794 literal->literal.value = res;
5800 * Parse a boolean constant.
5802 static expression_t *parse_boolean_literal(bool value)
5804 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_BOOLEAN);
5805 literal->base.type = type_bool;
5806 literal->literal.value.begin = value ? "true" : "false";
5807 literal->literal.value.size = value ? 4 : 5;
5813 static void warn_traditional_suffix(void)
5815 warningf(WARN_TRADITIONAL, HERE, "traditional C rejects the '%S' suffix",
5816 &token.number.suffix);
5819 static void check_integer_suffix(void)
5821 const string_t *suffix = &token.number.suffix;
5822 if (suffix->size == 0)
5825 bool not_traditional = false;
5826 const char *c = suffix->begin;
5827 if (*c == 'l' || *c == 'L') {
5830 not_traditional = true;
5832 if (*c == 'u' || *c == 'U') {
5835 } else if (*c == 'u' || *c == 'U') {
5836 not_traditional = true;
5839 } else if (*c == 'u' || *c == 'U') {
5840 not_traditional = true;
5842 if (*c == 'l' || *c == 'L') {
5850 errorf(&token.base.source_position,
5851 "invalid suffix '%S' on integer constant", suffix);
5852 } else if (not_traditional) {
5853 warn_traditional_suffix();
5857 static type_t *check_floatingpoint_suffix(void)
5859 const string_t *suffix = &token.number.suffix;
5860 type_t *type = type_double;
5861 if (suffix->size == 0)
5864 bool not_traditional = false;
5865 const char *c = suffix->begin;
5866 if (*c == 'f' || *c == 'F') {
5869 } else if (*c == 'l' || *c == 'L') {
5871 type = type_long_double;
5874 errorf(&token.base.source_position,
5875 "invalid suffix '%S' on floatingpoint constant", suffix);
5876 } else if (not_traditional) {
5877 warn_traditional_suffix();
5884 * Parse an integer constant.
5886 static expression_t *parse_number_literal(void)
5888 expression_kind_t kind;
5891 switch (token.kind) {
5893 kind = EXPR_LITERAL_INTEGER;
5894 check_integer_suffix();
5897 case T_INTEGER_OCTAL:
5898 kind = EXPR_LITERAL_INTEGER_OCTAL;
5899 check_integer_suffix();
5902 case T_INTEGER_HEXADECIMAL:
5903 kind = EXPR_LITERAL_INTEGER_HEXADECIMAL;
5904 check_integer_suffix();
5907 case T_FLOATINGPOINT:
5908 kind = EXPR_LITERAL_FLOATINGPOINT;
5909 type = check_floatingpoint_suffix();
5911 case T_FLOATINGPOINT_HEXADECIMAL:
5912 kind = EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL;
5913 type = check_floatingpoint_suffix();
5916 panic("unexpected token type in parse_number_literal");
5919 expression_t *literal = allocate_expression_zero(kind);
5920 literal->base.type = type;
5921 literal->literal.value = token.number.number;
5922 literal->literal.suffix = token.number.suffix;
5925 /* integer type depends on the size of the number and the size
5926 * representable by the types. The backend/codegeneration has to determine
5929 determine_literal_type(&literal->literal);
5934 * Parse a character constant.
5936 static expression_t *parse_character_constant(void)
5938 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_CHARACTER);
5939 literal->base.type = c_mode & _CXX ? type_char : type_int;
5940 literal->literal.value = token.string.string;
5942 size_t len = literal->literal.value.size;
5944 if (!GNU_MODE && !(c_mode & _C99)) {
5945 errorf(HERE, "more than 1 character in character constant");
5947 literal->base.type = type_int;
5948 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
5957 * Parse a wide character constant.
5959 static expression_t *parse_wide_character_constant(void)
5961 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_WIDE_CHARACTER);
5962 literal->base.type = type_int;
5963 literal->literal.value = token.string.string;
5965 size_t len = wstrlen(&literal->literal.value);
5967 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
5974 static entity_t *create_implicit_function(symbol_t *symbol, source_position_t const *const pos)
5976 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
5977 ntype->function.return_type = type_int;
5978 ntype->function.unspecified_parameters = true;
5979 ntype->function.linkage = LINKAGE_C;
5980 type_t *type = identify_new_type(ntype);
5982 entity_t *const entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, symbol, pos);
5983 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
5984 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
5985 entity->declaration.type = type;
5986 entity->declaration.implicit = true;
5988 if (current_scope != NULL)
5989 record_entity(entity, false);
5995 * Performs automatic type cast as described in §6.3.2.1.
5997 * @param orig_type the original type
5999 static type_t *automatic_type_conversion(type_t *orig_type)
6001 type_t *type = skip_typeref(orig_type);
6002 if (is_type_array(type)) {
6003 array_type_t *array_type = &type->array;
6004 type_t *element_type = array_type->element_type;
6005 unsigned qualifiers = array_type->base.qualifiers;
6007 return make_pointer_type(element_type, qualifiers);
6010 if (is_type_function(type)) {
6011 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6018 * reverts the automatic casts of array to pointer types and function
6019 * to function-pointer types as defined §6.3.2.1
6021 type_t *revert_automatic_type_conversion(const expression_t *expression)
6023 switch (expression->kind) {
6024 case EXPR_REFERENCE: {
6025 entity_t *entity = expression->reference.entity;
6026 if (is_declaration(entity)) {
6027 return entity->declaration.type;
6028 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6029 return entity->enum_value.enum_type;
6031 panic("no declaration or enum in reference");
6036 entity_t *entity = expression->select.compound_entry;
6037 assert(is_declaration(entity));
6038 type_t *type = entity->declaration.type;
6039 return get_qualified_type(type, expression->base.type->base.qualifiers);
6042 case EXPR_UNARY_DEREFERENCE: {
6043 const expression_t *const value = expression->unary.value;
6044 type_t *const type = skip_typeref(value->base.type);
6045 if (!is_type_pointer(type))
6046 return type_error_type;
6047 return type->pointer.points_to;
6050 case EXPR_ARRAY_ACCESS: {
6051 const expression_t *array_ref = expression->array_access.array_ref;
6052 type_t *type_left = skip_typeref(array_ref->base.type);
6053 if (!is_type_pointer(type_left))
6054 return type_error_type;
6055 return type_left->pointer.points_to;
6058 case EXPR_STRING_LITERAL: {
6059 size_t size = expression->string_literal.value.size;
6060 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6063 case EXPR_WIDE_STRING_LITERAL: {
6064 size_t size = wstrlen(&expression->string_literal.value);
6065 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6068 case EXPR_COMPOUND_LITERAL:
6069 return expression->compound_literal.type;
6074 return expression->base.type;
6078 * Find an entity matching a symbol in a scope.
6079 * Uses current scope if scope is NULL
6081 static entity_t *lookup_entity(const scope_t *scope, symbol_t *symbol,
6082 namespace_tag_t namespc)
6084 if (scope == NULL) {
6085 return get_entity(symbol, namespc);
6088 /* we should optimize here, if scope grows above a certain size we should
6089 construct a hashmap here... */
6090 entity_t *entity = scope->entities;
6091 for ( ; entity != NULL; entity = entity->base.next) {
6092 if (entity->base.symbol == symbol
6093 && (namespace_tag_t)entity->base.namespc == namespc)
6100 static entity_t *parse_qualified_identifier(void)
6102 /* namespace containing the symbol */
6104 source_position_t pos;
6105 const scope_t *lookup_scope = NULL;
6107 if (next_if(T_COLONCOLON))
6108 lookup_scope = &unit->scope;
6112 symbol = expect_identifier("while parsing identifier", &pos);
6114 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6117 entity = lookup_entity(lookup_scope, symbol, NAMESPACE_NORMAL);
6119 if (!next_if(T_COLONCOLON))
6122 switch (entity->kind) {
6123 case ENTITY_NAMESPACE:
6124 lookup_scope = &entity->namespacee.members;
6129 lookup_scope = &entity->compound.members;
6132 errorf(&pos, "'%Y' must be a namespace, class, struct or union (but is a %s)",
6133 symbol, get_entity_kind_name(entity->kind));
6135 /* skip further qualifications */
6136 while (next_if(T_IDENTIFIER) && next_if(T_COLONCOLON)) {}
6138 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6142 if (entity == NULL) {
6143 if (!strict_mode && token.kind == '(') {
6144 /* an implicitly declared function */
6145 warningf(WARN_IMPLICIT_FUNCTION_DECLARATION, &pos,
6146 "implicit declaration of function '%Y'", symbol);
6147 entity = create_implicit_function(symbol, &pos);
6149 errorf(&pos, "unknown identifier '%Y' found.", symbol);
6150 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6157 static expression_t *parse_reference(void)
6159 source_position_t const pos = token.base.source_position;
6160 entity_t *const entity = parse_qualified_identifier();
6163 if (is_declaration(entity)) {
6164 orig_type = entity->declaration.type;
6165 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6166 orig_type = entity->enum_value.enum_type;
6168 panic("expected declaration or enum value in reference");
6171 /* we always do the auto-type conversions; the & and sizeof parser contains
6172 * code to revert this! */
6173 type_t *type = automatic_type_conversion(orig_type);
6175 expression_kind_t kind = EXPR_REFERENCE;
6176 if (entity->kind == ENTITY_ENUM_VALUE)
6177 kind = EXPR_ENUM_CONSTANT;
6179 expression_t *expression = allocate_expression_zero(kind);
6180 expression->base.source_position = pos;
6181 expression->base.type = type;
6182 expression->reference.entity = entity;
6184 /* this declaration is used */
6185 if (is_declaration(entity)) {
6186 entity->declaration.used = true;
6189 if (entity->base.parent_scope != file_scope
6190 && (current_function != NULL
6191 && entity->base.parent_scope->depth < current_function->parameters.depth)
6192 && (entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER)) {
6193 if (entity->kind == ENTITY_VARIABLE) {
6194 /* access of a variable from an outer function */
6195 entity->variable.address_taken = true;
6196 } else if (entity->kind == ENTITY_PARAMETER) {
6197 entity->parameter.address_taken = true;
6199 current_function->need_closure = true;
6202 check_deprecated(&pos, entity);
6207 static bool semantic_cast(expression_t *cast)
6209 expression_t *expression = cast->unary.value;
6210 type_t *orig_dest_type = cast->base.type;
6211 type_t *orig_type_right = expression->base.type;
6212 type_t const *dst_type = skip_typeref(orig_dest_type);
6213 type_t const *src_type = skip_typeref(orig_type_right);
6214 source_position_t const *pos = &cast->base.source_position;
6216 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6217 if (is_type_void(dst_type))
6220 /* only integer and pointer can be casted to pointer */
6221 if (is_type_pointer(dst_type) &&
6222 !is_type_pointer(src_type) &&
6223 !is_type_integer(src_type) &&
6224 is_type_valid(src_type)) {
6225 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6229 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6230 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6234 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6235 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6239 if (is_type_pointer(src_type) && is_type_pointer(dst_type)) {
6240 type_t *src = skip_typeref(src_type->pointer.points_to);
6241 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6242 unsigned missing_qualifiers =
6243 src->base.qualifiers & ~dst->base.qualifiers;
6244 if (missing_qualifiers != 0) {
6245 warningf(WARN_CAST_QUAL, pos, "cast discards qualifiers '%Q' in pointer target type of '%T'", missing_qualifiers, orig_type_right);
6251 static expression_t *parse_compound_literal(source_position_t const *const pos, type_t *type)
6253 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6254 expression->base.source_position = *pos;
6256 parse_initializer_env_t env;
6259 env.must_be_constant = false;
6260 initializer_t *initializer = parse_initializer(&env);
6263 expression->compound_literal.initializer = initializer;
6264 expression->compound_literal.type = type;
6265 expression->base.type = automatic_type_conversion(type);
6271 * Parse a cast expression.
6273 static expression_t *parse_cast(void)
6275 source_position_t const pos = *HERE;
6278 add_anchor_token(')');
6280 type_t *type = parse_typename();
6282 rem_anchor_token(')');
6285 if (token.kind == '{') {
6286 return parse_compound_literal(&pos, type);
6289 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6290 cast->base.source_position = pos;
6292 expression_t *value = parse_subexpression(PREC_CAST);
6293 cast->base.type = type;
6294 cast->unary.value = value;
6296 if (! semantic_cast(cast)) {
6297 /* TODO: record the error in the AST. else it is impossible to detect it */
6304 * Parse a statement expression.
6306 static expression_t *parse_statement_expression(void)
6308 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6311 add_anchor_token(')');
6313 statement_t *statement = parse_compound_statement(true);
6314 statement->compound.stmt_expr = true;
6315 expression->statement.statement = statement;
6317 /* find last statement and use its type */
6318 type_t *type = type_void;
6319 const statement_t *stmt = statement->compound.statements;
6321 while (stmt->base.next != NULL)
6322 stmt = stmt->base.next;
6324 if (stmt->kind == STATEMENT_EXPRESSION) {
6325 type = stmt->expression.expression->base.type;
6328 source_position_t const *const pos = &expression->base.source_position;
6329 warningf(WARN_OTHER, pos, "empty statement expression ({})");
6331 expression->base.type = type;
6333 rem_anchor_token(')');
6339 * Parse a parenthesized expression.
6341 static expression_t *parse_parenthesized_expression(void)
6343 token_t const* const la1 = look_ahead(1);
6344 switch (la1->kind) {
6346 /* gcc extension: a statement expression */
6347 return parse_statement_expression();
6350 if (is_typedef_symbol(la1->identifier.symbol)) {
6352 return parse_cast();
6357 add_anchor_token(')');
6358 expression_t *result = parse_expression();
6359 result->base.parenthesized = true;
6360 rem_anchor_token(')');
6366 static expression_t *parse_function_keyword(void)
6370 if (current_function == NULL) {
6371 errorf(HERE, "'__func__' used outside of a function");
6374 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6375 expression->base.type = type_char_ptr;
6376 expression->funcname.kind = FUNCNAME_FUNCTION;
6383 static expression_t *parse_pretty_function_keyword(void)
6385 if (current_function == NULL) {
6386 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6389 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6390 expression->base.type = type_char_ptr;
6391 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6393 eat(T___PRETTY_FUNCTION__);
6398 static expression_t *parse_funcsig_keyword(void)
6400 if (current_function == NULL) {
6401 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6404 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6405 expression->base.type = type_char_ptr;
6406 expression->funcname.kind = FUNCNAME_FUNCSIG;
6413 static expression_t *parse_funcdname_keyword(void)
6415 if (current_function == NULL) {
6416 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6419 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6420 expression->base.type = type_char_ptr;
6421 expression->funcname.kind = FUNCNAME_FUNCDNAME;
6423 eat(T___FUNCDNAME__);
6428 static designator_t *parse_designator(void)
6430 designator_t *const result = allocate_ast_zero(sizeof(result[0]));
6431 result->symbol = expect_identifier("while parsing member designator", &result->source_position);
6432 if (!result->symbol)
6435 designator_t *last_designator = result;
6438 designator_t *const designator = allocate_ast_zero(sizeof(result[0]));
6439 designator->symbol = expect_identifier("while parsing member designator", &designator->source_position);
6440 if (!designator->symbol)
6443 last_designator->next = designator;
6444 last_designator = designator;
6448 add_anchor_token(']');
6449 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6450 designator->source_position = *HERE;
6451 designator->array_index = parse_expression();
6452 rem_anchor_token(']');
6454 if (designator->array_index == NULL) {
6458 last_designator->next = designator;
6459 last_designator = designator;
6469 * Parse the __builtin_offsetof() expression.
6471 static expression_t *parse_offsetof(void)
6473 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6474 expression->base.type = type_size_t;
6476 eat(T___builtin_offsetof);
6479 add_anchor_token(')');
6480 add_anchor_token(',');
6481 type_t *type = parse_typename();
6482 rem_anchor_token(',');
6484 designator_t *designator = parse_designator();
6485 rem_anchor_token(')');
6488 expression->offsetofe.type = type;
6489 expression->offsetofe.designator = designator;
6492 memset(&path, 0, sizeof(path));
6493 path.top_type = type;
6494 path.path = NEW_ARR_F(type_path_entry_t, 0);
6496 descend_into_subtype(&path);
6498 if (!walk_designator(&path, designator, true)) {
6499 return create_error_expression();
6502 DEL_ARR_F(path.path);
6508 * Parses a _builtin_va_start() expression.
6510 static expression_t *parse_va_start(void)
6512 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6514 eat(T___builtin_va_start);
6517 add_anchor_token(')');
6518 add_anchor_token(',');
6519 expression->va_starte.ap = parse_assignment_expression();
6520 rem_anchor_token(',');
6522 expression_t *const expr = parse_assignment_expression();
6523 if (expr->kind == EXPR_REFERENCE) {
6524 entity_t *const entity = expr->reference.entity;
6525 if (!current_function->base.type->function.variadic) {
6526 errorf(&expr->base.source_position,
6527 "'va_start' used in non-variadic function");
6528 } else if (entity->base.parent_scope != ¤t_function->parameters ||
6529 entity->base.next != NULL ||
6530 entity->kind != ENTITY_PARAMETER) {
6531 errorf(&expr->base.source_position,
6532 "second argument of 'va_start' must be last parameter of the current function");
6534 expression->va_starte.parameter = &entity->variable;
6537 expression = create_error_expression();
6539 rem_anchor_token(')');
6545 * Parses a __builtin_va_arg() expression.
6547 static expression_t *parse_va_arg(void)
6549 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6551 eat(T___builtin_va_arg);
6554 add_anchor_token(')');
6555 add_anchor_token(',');
6557 ap.expression = parse_assignment_expression();
6558 expression->va_arge.ap = ap.expression;
6559 check_call_argument(type_valist, &ap, 1);
6561 rem_anchor_token(',');
6563 expression->base.type = parse_typename();
6564 rem_anchor_token(')');
6571 * Parses a __builtin_va_copy() expression.
6573 static expression_t *parse_va_copy(void)
6575 expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
6577 eat(T___builtin_va_copy);
6580 add_anchor_token(')');
6581 add_anchor_token(',');
6582 expression_t *dst = parse_assignment_expression();
6583 assign_error_t error = semantic_assign(type_valist, dst);
6584 report_assign_error(error, type_valist, dst, "call argument 1",
6585 &dst->base.source_position);
6586 expression->va_copye.dst = dst;
6588 rem_anchor_token(',');
6591 call_argument_t src;
6592 src.expression = parse_assignment_expression();
6593 check_call_argument(type_valist, &src, 2);
6594 expression->va_copye.src = src.expression;
6595 rem_anchor_token(')');
6602 * Parses a __builtin_constant_p() expression.
6604 static expression_t *parse_builtin_constant(void)
6606 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6608 eat(T___builtin_constant_p);
6611 add_anchor_token(')');
6612 expression->builtin_constant.value = parse_assignment_expression();
6613 rem_anchor_token(')');
6615 expression->base.type = type_int;
6621 * Parses a __builtin_types_compatible_p() expression.
6623 static expression_t *parse_builtin_types_compatible(void)
6625 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
6627 eat(T___builtin_types_compatible_p);
6630 add_anchor_token(')');
6631 add_anchor_token(',');
6632 expression->builtin_types_compatible.left = parse_typename();
6633 rem_anchor_token(',');
6635 expression->builtin_types_compatible.right = parse_typename();
6636 rem_anchor_token(')');
6638 expression->base.type = type_int;
6644 * Parses a __builtin_is_*() compare expression.
6646 static expression_t *parse_compare_builtin(void)
6648 expression_t *expression;
6650 switch (token.kind) {
6651 case T___builtin_isgreater:
6652 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
6654 case T___builtin_isgreaterequal:
6655 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
6657 case T___builtin_isless:
6658 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
6660 case T___builtin_islessequal:
6661 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
6663 case T___builtin_islessgreater:
6664 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
6666 case T___builtin_isunordered:
6667 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
6670 internal_errorf(HERE, "invalid compare builtin found");
6672 expression->base.source_position = *HERE;
6676 add_anchor_token(')');
6677 add_anchor_token(',');
6678 expression->binary.left = parse_assignment_expression();
6679 rem_anchor_token(',');
6681 expression->binary.right = parse_assignment_expression();
6682 rem_anchor_token(')');
6685 type_t *const orig_type_left = expression->binary.left->base.type;
6686 type_t *const orig_type_right = expression->binary.right->base.type;
6688 type_t *const type_left = skip_typeref(orig_type_left);
6689 type_t *const type_right = skip_typeref(orig_type_right);
6690 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6691 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6692 type_error_incompatible("invalid operands in comparison",
6693 &expression->base.source_position, orig_type_left, orig_type_right);
6696 semantic_comparison(&expression->binary);
6703 * Parses a MS assume() expression.
6705 static expression_t *parse_assume(void)
6707 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
6712 add_anchor_token(')');
6713 expression->unary.value = parse_assignment_expression();
6714 rem_anchor_token(')');
6717 expression->base.type = type_void;
6722 * Return the label for the current symbol or create a new one.
6724 static label_t *get_label(void)
6726 assert(token.kind == T_IDENTIFIER);
6727 assert(current_function != NULL);
6729 entity_t *label = get_entity(token.identifier.symbol, NAMESPACE_LABEL);
6730 /* If we find a local label, we already created the declaration. */
6731 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
6732 if (label->base.parent_scope != current_scope) {
6733 assert(label->base.parent_scope->depth < current_scope->depth);
6734 current_function->goto_to_outer = true;
6736 } else if (label == NULL || label->base.parent_scope != ¤t_function->parameters) {
6737 /* There is no matching label in the same function, so create a new one. */
6738 source_position_t const nowhere = { NULL, 0, 0, false };
6739 label = allocate_entity_zero(ENTITY_LABEL, NAMESPACE_LABEL, token.identifier.symbol, &nowhere);
6744 return &label->label;
6748 * Parses a GNU && label address expression.
6750 static expression_t *parse_label_address(void)
6752 source_position_t source_position = token.base.source_position;
6754 if (token.kind != T_IDENTIFIER) {
6755 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
6756 return create_error_expression();
6759 label_t *const label = get_label();
6761 label->address_taken = true;
6763 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
6764 expression->base.source_position = source_position;
6766 /* label address is treated as a void pointer */
6767 expression->base.type = type_void_ptr;
6768 expression->label_address.label = label;
6773 * Parse a microsoft __noop expression.
6775 static expression_t *parse_noop_expression(void)
6777 /* the result is a (int)0 */
6778 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_MS_NOOP);
6779 literal->base.type = type_int;
6780 literal->literal.value.begin = "__noop";
6781 literal->literal.value.size = 6;
6785 if (token.kind == '(') {
6786 /* parse arguments */
6788 add_anchor_token(')');
6789 add_anchor_token(',');
6791 if (token.kind != ')') do {
6792 (void)parse_assignment_expression();
6793 } while (next_if(','));
6795 rem_anchor_token(',');
6796 rem_anchor_token(')');
6804 * Parses a primary expression.
6806 static expression_t *parse_primary_expression(void)
6808 switch (token.kind) {
6809 case T_false: return parse_boolean_literal(false);
6810 case T_true: return parse_boolean_literal(true);
6812 case T_INTEGER_OCTAL:
6813 case T_INTEGER_HEXADECIMAL:
6814 case T_FLOATINGPOINT:
6815 case T_FLOATINGPOINT_HEXADECIMAL: return parse_number_literal();
6816 case T_CHARACTER_CONSTANT: return parse_character_constant();
6817 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
6818 case T_STRING_LITERAL:
6819 case T_WIDE_STRING_LITERAL: return parse_string_literal();
6820 case T___FUNCTION__:
6821 case T___func__: return parse_function_keyword();
6822 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
6823 case T___FUNCSIG__: return parse_funcsig_keyword();
6824 case T___FUNCDNAME__: return parse_funcdname_keyword();
6825 case T___builtin_offsetof: return parse_offsetof();
6826 case T___builtin_va_start: return parse_va_start();
6827 case T___builtin_va_arg: return parse_va_arg();
6828 case T___builtin_va_copy: return parse_va_copy();
6829 case T___builtin_isgreater:
6830 case T___builtin_isgreaterequal:
6831 case T___builtin_isless:
6832 case T___builtin_islessequal:
6833 case T___builtin_islessgreater:
6834 case T___builtin_isunordered: return parse_compare_builtin();
6835 case T___builtin_constant_p: return parse_builtin_constant();
6836 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
6837 case T__assume: return parse_assume();
6840 return parse_label_address();
6843 case '(': return parse_parenthesized_expression();
6844 case T___noop: return parse_noop_expression();
6846 /* Gracefully handle type names while parsing expressions. */
6848 return parse_reference();
6850 if (!is_typedef_symbol(token.identifier.symbol)) {
6851 return parse_reference();
6855 source_position_t const pos = *HERE;
6856 declaration_specifiers_t specifiers;
6857 parse_declaration_specifiers(&specifiers);
6858 type_t const *const type = parse_abstract_declarator(specifiers.type);
6859 errorf(&pos, "encountered type '%T' while parsing expression", type);
6860 return create_error_expression();
6864 errorf(HERE, "unexpected token %K, expected an expression", &token);
6866 return create_error_expression();
6869 static expression_t *parse_array_expression(expression_t *left)
6871 expression_t *const expr = allocate_expression_zero(EXPR_ARRAY_ACCESS);
6872 array_access_expression_t *const arr = &expr->array_access;
6875 add_anchor_token(']');
6877 expression_t *const inside = parse_expression();
6879 type_t *const orig_type_left = left->base.type;
6880 type_t *const orig_type_inside = inside->base.type;
6882 type_t *const type_left = skip_typeref(orig_type_left);
6883 type_t *const type_inside = skip_typeref(orig_type_inside);
6889 if (is_type_pointer(type_left)) {
6892 idx_type = type_inside;
6893 res_type = type_left->pointer.points_to;
6895 } else if (is_type_pointer(type_inside)) {
6896 arr->flipped = true;
6899 idx_type = type_left;
6900 res_type = type_inside->pointer.points_to;
6902 res_type = automatic_type_conversion(res_type);
6903 if (!is_type_integer(idx_type)) {
6904 errorf(&idx->base.source_position, "array subscript must have integer type");
6905 } else if (is_type_atomic(idx_type, ATOMIC_TYPE_CHAR)) {
6906 source_position_t const *const pos = &idx->base.source_position;
6907 warningf(WARN_CHAR_SUBSCRIPTS, pos, "array subscript has char type");
6910 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
6911 errorf(&expr->base.source_position, "invalid types '%T[%T]' for array access", orig_type_left, orig_type_inside);
6913 res_type = type_error_type;
6918 arr->array_ref = ref;
6920 arr->base.type = res_type;
6922 rem_anchor_token(']');
6927 static bool is_bitfield(const expression_t *expression)
6929 return expression->kind == EXPR_SELECT
6930 && expression->select.compound_entry->compound_member.bitfield;
6933 static expression_t *parse_typeprop(expression_kind_t const kind)
6935 expression_t *tp_expression = allocate_expression_zero(kind);
6936 tp_expression->base.type = type_size_t;
6938 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
6941 expression_t *expression;
6942 if (token.kind == '(' && is_declaration_specifier(look_ahead(1))) {
6943 source_position_t const pos = *HERE;
6945 add_anchor_token(')');
6946 orig_type = parse_typename();
6947 rem_anchor_token(')');
6950 if (token.kind == '{') {
6951 /* It was not sizeof(type) after all. It is sizeof of an expression
6952 * starting with a compound literal */
6953 expression = parse_compound_literal(&pos, orig_type);
6954 goto typeprop_expression;
6957 expression = parse_subexpression(PREC_UNARY);
6959 typeprop_expression:
6960 if (is_bitfield(expression)) {
6961 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6962 errorf(&tp_expression->base.source_position,
6963 "operand of %s expression must not be a bitfield", what);
6966 tp_expression->typeprop.tp_expression = expression;
6968 orig_type = revert_automatic_type_conversion(expression);
6969 expression->base.type = orig_type;
6972 tp_expression->typeprop.type = orig_type;
6973 type_t const* const type = skip_typeref(orig_type);
6974 char const* wrong_type = NULL;
6975 if (is_type_incomplete(type)) {
6976 if (!is_type_void(type) || !GNU_MODE)
6977 wrong_type = "incomplete";
6978 } else if (type->kind == TYPE_FUNCTION) {
6980 /* function types are allowed (and return 1) */
6981 source_position_t const *const pos = &tp_expression->base.source_position;
6982 char const *const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6983 warningf(WARN_OTHER, pos, "%s expression with function argument returns invalid result", what);
6985 wrong_type = "function";
6989 if (wrong_type != NULL) {
6990 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6991 errorf(&tp_expression->base.source_position,
6992 "operand of %s expression must not be of %s type '%T'",
6993 what, wrong_type, orig_type);
6996 return tp_expression;
6999 static expression_t *parse_sizeof(void)
7001 return parse_typeprop(EXPR_SIZEOF);
7004 static expression_t *parse_alignof(void)
7006 return parse_typeprop(EXPR_ALIGNOF);
7009 static expression_t *parse_select_expression(expression_t *addr)
7011 assert(token.kind == '.' || token.kind == T_MINUSGREATER);
7012 bool select_left_arrow = (token.kind == T_MINUSGREATER);
7013 source_position_t const pos = *HERE;
7016 symbol_t *const symbol = expect_identifier("while parsing select", NULL);
7018 return create_error_expression();
7020 type_t *const orig_type = addr->base.type;
7021 type_t *const type = skip_typeref(orig_type);
7024 bool saw_error = false;
7025 if (is_type_pointer(type)) {
7026 if (!select_left_arrow) {
7028 "request for member '%Y' in something not a struct or union, but '%T'",
7032 type_left = skip_typeref(type->pointer.points_to);
7034 if (select_left_arrow && is_type_valid(type)) {
7035 errorf(&pos, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7041 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
7042 type_left->kind != TYPE_COMPOUND_UNION) {
7044 if (is_type_valid(type_left) && !saw_error) {
7046 "request for member '%Y' in something not a struct or union, but '%T'",
7049 return create_error_expression();
7052 compound_t *compound = type_left->compound.compound;
7053 if (!compound->complete) {
7054 errorf(&pos, "request for member '%Y' in incomplete type '%T'",
7056 return create_error_expression();
7059 type_qualifiers_t qualifiers = type_left->base.qualifiers;
7060 expression_t *result =
7061 find_create_select(&pos, addr, qualifiers, compound, symbol);
7063 if (result == NULL) {
7064 errorf(&pos, "'%T' has no member named '%Y'", orig_type, symbol);
7065 return create_error_expression();
7071 static void check_call_argument(type_t *expected_type,
7072 call_argument_t *argument, unsigned pos)
7074 type_t *expected_type_skip = skip_typeref(expected_type);
7075 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
7076 expression_t *arg_expr = argument->expression;
7077 type_t *arg_type = skip_typeref(arg_expr->base.type);
7079 /* handle transparent union gnu extension */
7080 if (is_type_union(expected_type_skip)
7081 && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
7082 compound_t *union_decl = expected_type_skip->compound.compound;
7083 type_t *best_type = NULL;
7084 entity_t *entry = union_decl->members.entities;
7085 for ( ; entry != NULL; entry = entry->base.next) {
7086 assert(is_declaration(entry));
7087 type_t *decl_type = entry->declaration.type;
7088 error = semantic_assign(decl_type, arg_expr);
7089 if (error == ASSIGN_ERROR_INCOMPATIBLE
7090 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
7093 if (error == ASSIGN_SUCCESS) {
7094 best_type = decl_type;
7095 } else if (best_type == NULL) {
7096 best_type = decl_type;
7100 if (best_type != NULL) {
7101 expected_type = best_type;
7105 error = semantic_assign(expected_type, arg_expr);
7106 argument->expression = create_implicit_cast(arg_expr, expected_type);
7108 if (error != ASSIGN_SUCCESS) {
7109 /* report exact scope in error messages (like "in argument 3") */
7111 snprintf(buf, sizeof(buf), "call argument %u", pos);
7112 report_assign_error(error, expected_type, arg_expr, buf,
7113 &arg_expr->base.source_position);
7115 type_t *const promoted_type = get_default_promoted_type(arg_type);
7116 if (!types_compatible(expected_type_skip, promoted_type) &&
7117 !types_compatible(expected_type_skip, type_void_ptr) &&
7118 !types_compatible(type_void_ptr, promoted_type)) {
7119 /* Deliberately show the skipped types in this warning */
7120 source_position_t const *const apos = &arg_expr->base.source_position;
7121 warningf(WARN_TRADITIONAL, apos, "passing call argument %u as '%T' rather than '%T' due to prototype", pos, expected_type_skip, promoted_type);
7127 * Handle the semantic restrictions of builtin calls
7129 static void handle_builtin_argument_restrictions(call_expression_t *call)
7131 entity_t *entity = call->function->reference.entity;
7132 switch (entity->function.btk) {
7134 switch (entity->function.b.firm_builtin_kind) {
7135 case ir_bk_return_address:
7136 case ir_bk_frame_address: {
7137 /* argument must be constant */
7138 call_argument_t *argument = call->arguments;
7140 if (is_constant_expression(argument->expression) == EXPR_CLASS_VARIABLE) {
7141 errorf(&call->base.source_position,
7142 "argument of '%Y' must be a constant expression",
7143 call->function->reference.entity->base.symbol);
7147 case ir_bk_prefetch:
7148 /* second and third argument must be constant if existent */
7149 if (call->arguments == NULL)
7151 call_argument_t *rw = call->arguments->next;
7152 call_argument_t *locality = NULL;
7155 if (is_constant_expression(rw->expression) == EXPR_CLASS_VARIABLE) {
7156 errorf(&call->base.source_position,
7157 "second argument of '%Y' must be a constant expression",
7158 call->function->reference.entity->base.symbol);
7160 locality = rw->next;
7162 if (locality != NULL) {
7163 if (is_constant_expression(locality->expression) == EXPR_CLASS_VARIABLE) {
7164 errorf(&call->base.source_position,
7165 "third argument of '%Y' must be a constant expression",
7166 call->function->reference.entity->base.symbol);
7168 locality = rw->next;
7175 case BUILTIN_OBJECT_SIZE:
7176 if (call->arguments == NULL)
7179 call_argument_t *arg = call->arguments->next;
7180 if (arg != NULL && is_constant_expression(arg->expression) == EXPR_CLASS_VARIABLE) {
7181 errorf(&call->base.source_position,
7182 "second argument of '%Y' must be a constant expression",
7183 call->function->reference.entity->base.symbol);
7192 * Parse a call expression, ie. expression '( ... )'.
7194 * @param expression the function address
7196 static expression_t *parse_call_expression(expression_t *expression)
7198 expression_t *result = allocate_expression_zero(EXPR_CALL);
7199 call_expression_t *call = &result->call;
7200 call->function = expression;
7202 type_t *const orig_type = expression->base.type;
7203 type_t *const type = skip_typeref(orig_type);
7205 function_type_t *function_type = NULL;
7206 if (is_type_pointer(type)) {
7207 type_t *const to_type = skip_typeref(type->pointer.points_to);
7209 if (is_type_function(to_type)) {
7210 function_type = &to_type->function;
7211 call->base.type = function_type->return_type;
7215 if (function_type == NULL && is_type_valid(type)) {
7217 "called object '%E' (type '%T') is not a pointer to a function",
7218 expression, orig_type);
7221 /* parse arguments */
7223 add_anchor_token(')');
7224 add_anchor_token(',');
7226 if (token.kind != ')') {
7227 call_argument_t **anchor = &call->arguments;
7229 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7230 argument->expression = parse_assignment_expression();
7233 anchor = &argument->next;
7234 } while (next_if(','));
7236 rem_anchor_token(',');
7237 rem_anchor_token(')');
7240 if (function_type == NULL)
7243 /* check type and count of call arguments */
7244 function_parameter_t *parameter = function_type->parameters;
7245 call_argument_t *argument = call->arguments;
7246 if (!function_type->unspecified_parameters) {
7247 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7248 parameter = parameter->next, argument = argument->next) {
7249 check_call_argument(parameter->type, argument, ++pos);
7252 if (parameter != NULL) {
7253 errorf(&expression->base.source_position, "too few arguments to function '%E'", expression);
7254 } else if (argument != NULL && !function_type->variadic) {
7255 errorf(&argument->expression->base.source_position, "too many arguments to function '%E'", expression);
7259 /* do default promotion for other arguments */
7260 for (; argument != NULL; argument = argument->next) {
7261 type_t *argument_type = argument->expression->base.type;
7262 if (!is_type_object(skip_typeref(argument_type))) {
7263 errorf(&argument->expression->base.source_position,
7264 "call argument '%E' must not be void", argument->expression);
7267 argument_type = get_default_promoted_type(argument_type);
7269 argument->expression
7270 = create_implicit_cast(argument->expression, argument_type);
7275 if (is_type_compound(skip_typeref(function_type->return_type))) {
7276 source_position_t const *const pos = &expression->base.source_position;
7277 warningf(WARN_AGGREGATE_RETURN, pos, "function call has aggregate value");
7280 if (expression->kind == EXPR_REFERENCE) {
7281 reference_expression_t *reference = &expression->reference;
7282 if (reference->entity->kind == ENTITY_FUNCTION &&
7283 reference->entity->function.btk != BUILTIN_NONE)
7284 handle_builtin_argument_restrictions(call);
7290 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7292 static bool same_compound_type(const type_t *type1, const type_t *type2)
7295 is_type_compound(type1) &&
7296 type1->kind == type2->kind &&
7297 type1->compound.compound == type2->compound.compound;
7300 static expression_t const *get_reference_address(expression_t const *expr)
7302 bool regular_take_address = true;
7304 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7305 expr = expr->unary.value;
7307 regular_take_address = false;
7310 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7313 expr = expr->unary.value;
7316 if (expr->kind != EXPR_REFERENCE)
7319 /* special case for functions which are automatically converted to a
7320 * pointer to function without an extra TAKE_ADDRESS operation */
7321 if (!regular_take_address &&
7322 expr->reference.entity->kind != ENTITY_FUNCTION) {
7329 static void warn_reference_address_as_bool(expression_t const* expr)
7331 expr = get_reference_address(expr);
7333 source_position_t const *const pos = &expr->base.source_position;
7334 entity_t const *const ent = expr->reference.entity;
7335 warningf(WARN_ADDRESS, pos, "the address of '%N' will always evaluate as 'true'", ent);
7339 static void warn_assignment_in_condition(const expression_t *const expr)
7341 if (expr->base.kind != EXPR_BINARY_ASSIGN)
7343 if (expr->base.parenthesized)
7345 source_position_t const *const pos = &expr->base.source_position;
7346 warningf(WARN_PARENTHESES, pos, "suggest parentheses around assignment used as truth value");
7349 static void semantic_condition(expression_t const *const expr,
7350 char const *const context)
7352 type_t *const type = skip_typeref(expr->base.type);
7353 if (is_type_scalar(type)) {
7354 warn_reference_address_as_bool(expr);
7355 warn_assignment_in_condition(expr);
7356 } else if (is_type_valid(type)) {
7357 errorf(&expr->base.source_position,
7358 "%s must have scalar type", context);
7363 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7365 * @param expression the conditional expression
7367 static expression_t *parse_conditional_expression(expression_t *expression)
7369 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7371 conditional_expression_t *conditional = &result->conditional;
7372 conditional->condition = expression;
7375 add_anchor_token(':');
7377 /* §6.5.15:2 The first operand shall have scalar type. */
7378 semantic_condition(expression, "condition of conditional operator");
7380 expression_t *true_expression = expression;
7381 bool gnu_cond = false;
7382 if (GNU_MODE && token.kind == ':') {
7385 true_expression = parse_expression();
7387 rem_anchor_token(':');
7389 expression_t *false_expression =
7390 parse_subexpression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7392 type_t *const orig_true_type = true_expression->base.type;
7393 type_t *const orig_false_type = false_expression->base.type;
7394 type_t *const true_type = skip_typeref(orig_true_type);
7395 type_t *const false_type = skip_typeref(orig_false_type);
7398 source_position_t const *const pos = &conditional->base.source_position;
7399 type_t *result_type;
7400 if (is_type_void(true_type) || is_type_void(false_type)) {
7401 /* ISO/IEC 14882:1998(E) §5.16:2 */
7402 if (true_expression->kind == EXPR_UNARY_THROW) {
7403 result_type = false_type;
7404 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7405 result_type = true_type;
7407 if (!is_type_void(true_type) || !is_type_void(false_type)) {
7408 warningf(WARN_OTHER, pos, "ISO C forbids conditional expression with only one void side");
7410 result_type = type_void;
7412 } else if (is_type_arithmetic(true_type)
7413 && is_type_arithmetic(false_type)) {
7414 result_type = semantic_arithmetic(true_type, false_type);
7415 } else if (same_compound_type(true_type, false_type)) {
7416 /* just take 1 of the 2 types */
7417 result_type = true_type;
7418 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7419 type_t *pointer_type;
7421 expression_t *other_expression;
7422 if (is_type_pointer(true_type) &&
7423 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7424 pointer_type = true_type;
7425 other_type = false_type;
7426 other_expression = false_expression;
7428 pointer_type = false_type;
7429 other_type = true_type;
7430 other_expression = true_expression;
7433 if (is_null_pointer_constant(other_expression)) {
7434 result_type = pointer_type;
7435 } else if (is_type_pointer(other_type)) {
7436 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7437 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7440 if (is_type_void(to1) || is_type_void(to2)) {
7442 } else if (types_compatible(get_unqualified_type(to1),
7443 get_unqualified_type(to2))) {
7446 warningf(WARN_OTHER, pos, "pointer types '%T' and '%T' in conditional expression are incompatible", true_type, false_type);
7450 type_t *const type =
7451 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7452 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7453 } else if (is_type_integer(other_type)) {
7454 warningf(WARN_OTHER, pos, "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7455 result_type = pointer_type;
7457 goto types_incompatible;
7461 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7462 type_error_incompatible("while parsing conditional", pos, true_type, false_type);
7464 result_type = type_error_type;
7467 conditional->true_expression
7468 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7469 conditional->false_expression
7470 = create_implicit_cast(false_expression, result_type);
7471 conditional->base.type = result_type;
7476 * Parse an extension expression.
7478 static expression_t *parse_extension(void)
7481 expression_t *expression = parse_subexpression(PREC_UNARY);
7487 * Parse a __builtin_classify_type() expression.
7489 static expression_t *parse_builtin_classify_type(void)
7491 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7492 result->base.type = type_int;
7494 eat(T___builtin_classify_type);
7497 add_anchor_token(')');
7498 expression_t *expression = parse_expression();
7499 rem_anchor_token(')');
7501 result->classify_type.type_expression = expression;
7507 * Parse a delete expression
7508 * ISO/IEC 14882:1998(E) §5.3.5
7510 static expression_t *parse_delete(void)
7512 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7513 result->base.type = type_void;
7518 result->kind = EXPR_UNARY_DELETE_ARRAY;
7522 expression_t *const value = parse_subexpression(PREC_CAST);
7523 result->unary.value = value;
7525 type_t *const type = skip_typeref(value->base.type);
7526 if (!is_type_pointer(type)) {
7527 if (is_type_valid(type)) {
7528 errorf(&value->base.source_position,
7529 "operand of delete must have pointer type");
7531 } else if (is_type_void(skip_typeref(type->pointer.points_to))) {
7532 source_position_t const *const pos = &value->base.source_position;
7533 warningf(WARN_OTHER, pos, "deleting 'void*' is undefined");
7540 * Parse a throw expression
7541 * ISO/IEC 14882:1998(E) §15:1
7543 static expression_t *parse_throw(void)
7545 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7546 result->base.type = type_void;
7550 expression_t *value = NULL;
7551 switch (token.kind) {
7553 value = parse_assignment_expression();
7554 /* ISO/IEC 14882:1998(E) §15.1:3 */
7555 type_t *const orig_type = value->base.type;
7556 type_t *const type = skip_typeref(orig_type);
7557 if (is_type_incomplete(type)) {
7558 errorf(&value->base.source_position,
7559 "cannot throw object of incomplete type '%T'", orig_type);
7560 } else if (is_type_pointer(type)) {
7561 type_t *const points_to = skip_typeref(type->pointer.points_to);
7562 if (is_type_incomplete(points_to) && !is_type_void(points_to)) {
7563 errorf(&value->base.source_position,
7564 "cannot throw pointer to incomplete type '%T'", orig_type);
7572 result->unary.value = value;
7577 static bool check_pointer_arithmetic(const source_position_t *source_position,
7578 type_t *pointer_type,
7579 type_t *orig_pointer_type)
7581 type_t *points_to = pointer_type->pointer.points_to;
7582 points_to = skip_typeref(points_to);
7584 if (is_type_incomplete(points_to)) {
7585 if (!GNU_MODE || !is_type_void(points_to)) {
7586 errorf(source_position,
7587 "arithmetic with pointer to incomplete type '%T' not allowed",
7591 warningf(WARN_POINTER_ARITH, source_position, "pointer of type '%T' used in arithmetic", orig_pointer_type);
7593 } else if (is_type_function(points_to)) {
7595 errorf(source_position,
7596 "arithmetic with pointer to function type '%T' not allowed",
7600 warningf(WARN_POINTER_ARITH, source_position, "pointer to a function '%T' used in arithmetic", orig_pointer_type);
7606 static bool is_lvalue(const expression_t *expression)
7608 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
7609 switch (expression->kind) {
7610 case EXPR_ARRAY_ACCESS:
7611 case EXPR_COMPOUND_LITERAL:
7612 case EXPR_REFERENCE:
7614 case EXPR_UNARY_DEREFERENCE:
7618 type_t *type = skip_typeref(expression->base.type);
7620 /* ISO/IEC 14882:1998(E) §3.10:3 */
7621 is_type_reference(type) ||
7622 /* Claim it is an lvalue, if the type is invalid. There was a parse
7623 * error before, which maybe prevented properly recognizing it as
7625 !is_type_valid(type);
7630 static void semantic_incdec(unary_expression_t *expression)
7632 type_t *const orig_type = expression->value->base.type;
7633 type_t *const type = skip_typeref(orig_type);
7634 if (is_type_pointer(type)) {
7635 if (!check_pointer_arithmetic(&expression->base.source_position,
7639 } else if (!is_type_real(type) && is_type_valid(type)) {
7640 /* TODO: improve error message */
7641 errorf(&expression->base.source_position,
7642 "operation needs an arithmetic or pointer type");
7645 if (!is_lvalue(expression->value)) {
7646 /* TODO: improve error message */
7647 errorf(&expression->base.source_position, "lvalue required as operand");
7649 expression->base.type = orig_type;
7652 static void promote_unary_int_expr(unary_expression_t *const expr, type_t *const type)
7654 type_t *const res_type = promote_integer(type);
7655 expr->base.type = res_type;
7656 expr->value = create_implicit_cast(expr->value, res_type);
7659 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
7661 type_t *const orig_type = expression->value->base.type;
7662 type_t *const type = skip_typeref(orig_type);
7663 if (!is_type_arithmetic(type)) {
7664 if (is_type_valid(type)) {
7665 /* TODO: improve error message */
7666 errorf(&expression->base.source_position,
7667 "operation needs an arithmetic type");
7670 } else if (is_type_integer(type)) {
7671 promote_unary_int_expr(expression, type);
7673 expression->base.type = orig_type;
7677 static void semantic_unexpr_plus(unary_expression_t *expression)
7679 semantic_unexpr_arithmetic(expression);
7680 source_position_t const *const pos = &expression->base.source_position;
7681 warningf(WARN_TRADITIONAL, pos, "traditional C rejects the unary plus operator");
7684 static void semantic_not(unary_expression_t *expression)
7686 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
7687 semantic_condition(expression->value, "operand of !");
7688 expression->base.type = c_mode & _CXX ? type_bool : type_int;
7691 static void semantic_unexpr_integer(unary_expression_t *expression)
7693 type_t *const orig_type = expression->value->base.type;
7694 type_t *const type = skip_typeref(orig_type);
7695 if (!is_type_integer(type)) {
7696 if (is_type_valid(type)) {
7697 errorf(&expression->base.source_position,
7698 "operand of ~ must be of integer type");
7703 promote_unary_int_expr(expression, type);
7706 static void semantic_dereference(unary_expression_t *expression)
7708 type_t *const orig_type = expression->value->base.type;
7709 type_t *const type = skip_typeref(orig_type);
7710 if (!is_type_pointer(type)) {
7711 if (is_type_valid(type)) {
7712 errorf(&expression->base.source_position,
7713 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
7718 type_t *result_type = type->pointer.points_to;
7719 result_type = automatic_type_conversion(result_type);
7720 expression->base.type = result_type;
7724 * Record that an address is taken (expression represents an lvalue).
7726 * @param expression the expression
7727 * @param may_be_register if true, the expression might be an register
7729 static void set_address_taken(expression_t *expression, bool may_be_register)
7731 if (expression->kind != EXPR_REFERENCE)
7734 entity_t *const entity = expression->reference.entity;
7736 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
7739 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
7740 && !may_be_register) {
7741 source_position_t const *const pos = &expression->base.source_position;
7742 errorf(pos, "address of register '%N' requested", entity);
7745 if (entity->kind == ENTITY_VARIABLE) {
7746 entity->variable.address_taken = true;
7748 assert(entity->kind == ENTITY_PARAMETER);
7749 entity->parameter.address_taken = true;
7754 * Check the semantic of the address taken expression.
7756 static void semantic_take_addr(unary_expression_t *expression)
7758 expression_t *value = expression->value;
7759 value->base.type = revert_automatic_type_conversion(value);
7761 type_t *orig_type = value->base.type;
7762 type_t *type = skip_typeref(orig_type);
7763 if (!is_type_valid(type))
7767 if (!is_lvalue(value)) {
7768 errorf(&expression->base.source_position, "'&' requires an lvalue");
7770 if (is_bitfield(value)) {
7771 errorf(&expression->base.source_position,
7772 "'&' not allowed on bitfield");
7775 set_address_taken(value, false);
7777 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
7780 #define CREATE_UNARY_EXPRESSION_PARSER(token_kind, unexpression_type, sfunc) \
7781 static expression_t *parse_##unexpression_type(void) \
7783 expression_t *unary_expression \
7784 = allocate_expression_zero(unexpression_type); \
7786 unary_expression->unary.value = parse_subexpression(PREC_UNARY); \
7788 sfunc(&unary_expression->unary); \
7790 return unary_expression; \
7793 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
7794 semantic_unexpr_arithmetic)
7795 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
7796 semantic_unexpr_plus)
7797 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
7799 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
7800 semantic_dereference)
7801 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
7803 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
7804 semantic_unexpr_integer)
7805 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
7807 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
7810 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_kind, unexpression_type, \
7812 static expression_t *parse_##unexpression_type(expression_t *left) \
7814 expression_t *unary_expression \
7815 = allocate_expression_zero(unexpression_type); \
7817 unary_expression->unary.value = left; \
7819 sfunc(&unary_expression->unary); \
7821 return unary_expression; \
7824 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
7825 EXPR_UNARY_POSTFIX_INCREMENT,
7827 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
7828 EXPR_UNARY_POSTFIX_DECREMENT,
7831 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
7833 /* TODO: handle complex + imaginary types */
7835 type_left = get_unqualified_type(type_left);
7836 type_right = get_unqualified_type(type_right);
7838 /* §6.3.1.8 Usual arithmetic conversions */
7839 if (type_left == type_long_double || type_right == type_long_double) {
7840 return type_long_double;
7841 } else if (type_left == type_double || type_right == type_double) {
7843 } else if (type_left == type_float || type_right == type_float) {
7847 type_left = promote_integer(type_left);
7848 type_right = promote_integer(type_right);
7850 if (type_left == type_right)
7853 bool const signed_left = is_type_signed(type_left);
7854 bool const signed_right = is_type_signed(type_right);
7855 unsigned const rank_left = get_akind_rank(get_akind(type_left));
7856 unsigned const rank_right = get_akind_rank(get_akind(type_right));
7858 if (signed_left == signed_right)
7859 return rank_left >= rank_right ? type_left : type_right;
7863 atomic_type_kind_t s_akind;
7864 atomic_type_kind_t u_akind;
7869 u_type = type_right;
7871 s_type = type_right;
7874 s_akind = get_akind(s_type);
7875 u_akind = get_akind(u_type);
7876 s_rank = get_akind_rank(s_akind);
7877 u_rank = get_akind_rank(u_akind);
7879 if (u_rank >= s_rank)
7882 if (get_atomic_type_size(s_akind) > get_atomic_type_size(u_akind))
7886 case ATOMIC_TYPE_INT: return type_unsigned_int;
7887 case ATOMIC_TYPE_LONG: return type_unsigned_long;
7888 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
7890 default: panic("invalid atomic type");
7895 * Check the semantic restrictions for a binary expression.
7897 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
7899 expression_t *const left = expression->left;
7900 expression_t *const right = expression->right;
7901 type_t *const orig_type_left = left->base.type;
7902 type_t *const orig_type_right = right->base.type;
7903 type_t *const type_left = skip_typeref(orig_type_left);
7904 type_t *const type_right = skip_typeref(orig_type_right);
7906 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
7907 /* TODO: improve error message */
7908 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7909 errorf(&expression->base.source_position,
7910 "operation needs arithmetic types");
7915 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7916 expression->left = create_implicit_cast(left, arithmetic_type);
7917 expression->right = create_implicit_cast(right, arithmetic_type);
7918 expression->base.type = arithmetic_type;
7921 static void semantic_binexpr_integer(binary_expression_t *const expression)
7923 expression_t *const left = expression->left;
7924 expression_t *const right = expression->right;
7925 type_t *const orig_type_left = left->base.type;
7926 type_t *const orig_type_right = right->base.type;
7927 type_t *const type_left = skip_typeref(orig_type_left);
7928 type_t *const type_right = skip_typeref(orig_type_right);
7930 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
7931 /* TODO: improve error message */
7932 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7933 errorf(&expression->base.source_position,
7934 "operation needs integer types");
7939 type_t *const result_type = semantic_arithmetic(type_left, type_right);
7940 expression->left = create_implicit_cast(left, result_type);
7941 expression->right = create_implicit_cast(right, result_type);
7942 expression->base.type = result_type;
7945 static void warn_div_by_zero(binary_expression_t const *const expression)
7947 if (!is_type_integer(expression->base.type))
7950 expression_t const *const right = expression->right;
7951 /* The type of the right operand can be different for /= */
7952 if (is_type_integer(right->base.type) &&
7953 is_constant_expression(right) == EXPR_CLASS_CONSTANT &&
7954 !fold_constant_to_bool(right)) {
7955 source_position_t const *const pos = &expression->base.source_position;
7956 warningf(WARN_DIV_BY_ZERO, pos, "division by zero");
7961 * Check the semantic restrictions for a div/mod expression.
7963 static void semantic_divmod_arithmetic(binary_expression_t *expression)
7965 semantic_binexpr_arithmetic(expression);
7966 warn_div_by_zero(expression);
7969 static void warn_addsub_in_shift(const expression_t *const expr)
7971 if (expr->base.parenthesized)
7975 switch (expr->kind) {
7976 case EXPR_BINARY_ADD: op = '+'; break;
7977 case EXPR_BINARY_SUB: op = '-'; break;
7981 source_position_t const *const pos = &expr->base.source_position;
7982 warningf(WARN_PARENTHESES, pos, "suggest parentheses around '%c' inside shift", op);
7985 static bool semantic_shift(binary_expression_t *expression)
7987 expression_t *const left = expression->left;
7988 expression_t *const right = expression->right;
7989 type_t *const orig_type_left = left->base.type;
7990 type_t *const orig_type_right = right->base.type;
7991 type_t * type_left = skip_typeref(orig_type_left);
7992 type_t * type_right = skip_typeref(orig_type_right);
7994 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
7995 /* TODO: improve error message */
7996 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7997 errorf(&expression->base.source_position,
7998 "operands of shift operation must have integer types");
8003 type_left = promote_integer(type_left);
8005 if (is_constant_expression(right) == EXPR_CLASS_CONSTANT) {
8006 source_position_t const *const pos = &right->base.source_position;
8007 long const count = fold_constant_to_int(right);
8009 warningf(WARN_OTHER, pos, "shift count must be non-negative");
8010 } else if ((unsigned long)count >=
8011 get_atomic_type_size(type_left->atomic.akind) * 8) {
8012 warningf(WARN_OTHER, pos, "shift count must be less than type width");
8016 type_right = promote_integer(type_right);
8017 expression->right = create_implicit_cast(right, type_right);
8022 static void semantic_shift_op(binary_expression_t *expression)
8024 expression_t *const left = expression->left;
8025 expression_t *const right = expression->right;
8027 if (!semantic_shift(expression))
8030 warn_addsub_in_shift(left);
8031 warn_addsub_in_shift(right);
8033 type_t *const orig_type_left = left->base.type;
8034 type_t * type_left = skip_typeref(orig_type_left);
8036 type_left = promote_integer(type_left);
8037 expression->left = create_implicit_cast(left, type_left);
8038 expression->base.type = type_left;
8041 static void semantic_add(binary_expression_t *expression)
8043 expression_t *const left = expression->left;
8044 expression_t *const right = expression->right;
8045 type_t *const orig_type_left = left->base.type;
8046 type_t *const orig_type_right = right->base.type;
8047 type_t *const type_left = skip_typeref(orig_type_left);
8048 type_t *const type_right = skip_typeref(orig_type_right);
8051 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8052 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8053 expression->left = create_implicit_cast(left, arithmetic_type);
8054 expression->right = create_implicit_cast(right, arithmetic_type);
8055 expression->base.type = arithmetic_type;
8056 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8057 check_pointer_arithmetic(&expression->base.source_position,
8058 type_left, orig_type_left);
8059 expression->base.type = type_left;
8060 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8061 check_pointer_arithmetic(&expression->base.source_position,
8062 type_right, orig_type_right);
8063 expression->base.type = type_right;
8064 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8065 errorf(&expression->base.source_position,
8066 "invalid operands to binary + ('%T', '%T')",
8067 orig_type_left, orig_type_right);
8071 static void semantic_sub(binary_expression_t *expression)
8073 expression_t *const left = expression->left;
8074 expression_t *const right = expression->right;
8075 type_t *const orig_type_left = left->base.type;
8076 type_t *const orig_type_right = right->base.type;
8077 type_t *const type_left = skip_typeref(orig_type_left);
8078 type_t *const type_right = skip_typeref(orig_type_right);
8079 source_position_t const *const pos = &expression->base.source_position;
8082 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8083 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8084 expression->left = create_implicit_cast(left, arithmetic_type);
8085 expression->right = create_implicit_cast(right, arithmetic_type);
8086 expression->base.type = arithmetic_type;
8087 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8088 check_pointer_arithmetic(&expression->base.source_position,
8089 type_left, orig_type_left);
8090 expression->base.type = type_left;
8091 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8092 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
8093 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
8094 if (!types_compatible(unqual_left, unqual_right)) {
8096 "subtracting pointers to incompatible types '%T' and '%T'",
8097 orig_type_left, orig_type_right);
8098 } else if (!is_type_object(unqual_left)) {
8099 if (!is_type_void(unqual_left)) {
8100 errorf(pos, "subtracting pointers to non-object types '%T'",
8103 warningf(WARN_OTHER, pos, "subtracting pointers to void");
8106 expression->base.type = type_ptrdiff_t;
8107 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8108 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8109 orig_type_left, orig_type_right);
8113 static void warn_string_literal_address(expression_t const* expr)
8115 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8116 expr = expr->unary.value;
8117 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8119 expr = expr->unary.value;
8122 if (expr->kind == EXPR_STRING_LITERAL
8123 || expr->kind == EXPR_WIDE_STRING_LITERAL) {
8124 source_position_t const *const pos = &expr->base.source_position;
8125 warningf(WARN_ADDRESS, pos, "comparison with string literal results in unspecified behaviour");
8129 static bool maybe_negative(expression_t const *const expr)
8131 switch (is_constant_expression(expr)) {
8132 case EXPR_CLASS_ERROR: return false;
8133 case EXPR_CLASS_CONSTANT: return constant_is_negative(expr);
8134 default: return true;
8138 static void warn_comparison(source_position_t const *const pos, expression_t const *const expr, expression_t const *const other)
8140 warn_string_literal_address(expr);
8142 expression_t const* const ref = get_reference_address(expr);
8143 if (ref != NULL && is_null_pointer_constant(other)) {
8144 entity_t const *const ent = ref->reference.entity;
8145 warningf(WARN_ADDRESS, pos, "the address of '%N' will never be NULL", ent);
8148 if (!expr->base.parenthesized) {
8149 switch (expr->base.kind) {
8150 case EXPR_BINARY_LESS:
8151 case EXPR_BINARY_GREATER:
8152 case EXPR_BINARY_LESSEQUAL:
8153 case EXPR_BINARY_GREATEREQUAL:
8154 case EXPR_BINARY_NOTEQUAL:
8155 case EXPR_BINARY_EQUAL:
8156 warningf(WARN_PARENTHESES, pos, "comparisons like 'x <= y < z' do not have their mathematical meaning");
8165 * Check the semantics of comparison expressions.
8167 * @param expression The expression to check.
8169 static void semantic_comparison(binary_expression_t *expression)
8171 source_position_t const *const pos = &expression->base.source_position;
8172 expression_t *const left = expression->left;
8173 expression_t *const right = expression->right;
8175 warn_comparison(pos, left, right);
8176 warn_comparison(pos, right, left);
8178 type_t *orig_type_left = left->base.type;
8179 type_t *orig_type_right = right->base.type;
8180 type_t *type_left = skip_typeref(orig_type_left);
8181 type_t *type_right = skip_typeref(orig_type_right);
8183 /* TODO non-arithmetic types */
8184 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8185 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8187 /* test for signed vs unsigned compares */
8188 if (is_type_integer(arithmetic_type)) {
8189 bool const signed_left = is_type_signed(type_left);
8190 bool const signed_right = is_type_signed(type_right);
8191 if (signed_left != signed_right) {
8192 /* FIXME long long needs better const folding magic */
8193 /* TODO check whether constant value can be represented by other type */
8194 if ((signed_left && maybe_negative(left)) ||
8195 (signed_right && maybe_negative(right))) {
8196 warningf(WARN_SIGN_COMPARE, pos, "comparison between signed and unsigned");
8201 expression->left = create_implicit_cast(left, arithmetic_type);
8202 expression->right = create_implicit_cast(right, arithmetic_type);
8203 expression->base.type = arithmetic_type;
8204 if ((expression->base.kind == EXPR_BINARY_EQUAL ||
8205 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8206 is_type_float(arithmetic_type)) {
8207 warningf(WARN_FLOAT_EQUAL, pos, "comparing floating point with == or != is unsafe");
8209 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8210 /* TODO check compatibility */
8211 } else if (is_type_pointer(type_left)) {
8212 expression->right = create_implicit_cast(right, type_left);
8213 } else if (is_type_pointer(type_right)) {
8214 expression->left = create_implicit_cast(left, type_right);
8215 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8216 type_error_incompatible("invalid operands in comparison", pos, type_left, type_right);
8218 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8222 * Checks if a compound type has constant fields.
8224 static bool has_const_fields(const compound_type_t *type)
8226 compound_t *compound = type->compound;
8227 entity_t *entry = compound->members.entities;
8229 for (; entry != NULL; entry = entry->base.next) {
8230 if (!is_declaration(entry))
8233 const type_t *decl_type = skip_typeref(entry->declaration.type);
8234 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8241 static bool is_valid_assignment_lhs(expression_t const* const left)
8243 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8244 type_t *const type_left = skip_typeref(orig_type_left);
8246 if (!is_lvalue(left)) {
8247 errorf(&left->base.source_position, "left hand side '%E' of assignment is not an lvalue",
8252 if (left->kind == EXPR_REFERENCE
8253 && left->reference.entity->kind == ENTITY_FUNCTION) {
8254 errorf(&left->base.source_position, "cannot assign to function '%E'", left);
8258 if (is_type_array(type_left)) {
8259 errorf(&left->base.source_position, "cannot assign to array '%E'", left);
8262 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8263 errorf(&left->base.source_position, "assignment to read-only location '%E' (type '%T')", left,
8267 if (is_type_incomplete(type_left)) {
8268 errorf(&left->base.source_position, "left-hand side '%E' of assignment has incomplete type '%T'",
8269 left, orig_type_left);
8272 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8273 errorf(&left->base.source_position, "cannot assign to '%E' because compound type '%T' has read-only fields",
8274 left, orig_type_left);
8281 static void semantic_arithmetic_assign(binary_expression_t *expression)
8283 expression_t *left = expression->left;
8284 expression_t *right = expression->right;
8285 type_t *orig_type_left = left->base.type;
8286 type_t *orig_type_right = right->base.type;
8288 if (!is_valid_assignment_lhs(left))
8291 type_t *type_left = skip_typeref(orig_type_left);
8292 type_t *type_right = skip_typeref(orig_type_right);
8294 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8295 /* TODO: improve error message */
8296 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8297 errorf(&expression->base.source_position,
8298 "operation needs arithmetic types");
8303 /* combined instructions are tricky. We can't create an implicit cast on
8304 * the left side, because we need the uncasted form for the store.
8305 * The ast2firm pass has to know that left_type must be right_type
8306 * for the arithmetic operation and create a cast by itself */
8307 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8308 expression->right = create_implicit_cast(right, arithmetic_type);
8309 expression->base.type = type_left;
8312 static void semantic_divmod_assign(binary_expression_t *expression)
8314 semantic_arithmetic_assign(expression);
8315 warn_div_by_zero(expression);
8318 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8320 expression_t *const left = expression->left;
8321 expression_t *const right = expression->right;
8322 type_t *const orig_type_left = left->base.type;
8323 type_t *const orig_type_right = right->base.type;
8324 type_t *const type_left = skip_typeref(orig_type_left);
8325 type_t *const type_right = skip_typeref(orig_type_right);
8327 if (!is_valid_assignment_lhs(left))
8330 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8331 /* combined instructions are tricky. We can't create an implicit cast on
8332 * the left side, because we need the uncasted form for the store.
8333 * The ast2firm pass has to know that left_type must be right_type
8334 * for the arithmetic operation and create a cast by itself */
8335 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8336 expression->right = create_implicit_cast(right, arithmetic_type);
8337 expression->base.type = type_left;
8338 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8339 check_pointer_arithmetic(&expression->base.source_position,
8340 type_left, orig_type_left);
8341 expression->base.type = type_left;
8342 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8343 errorf(&expression->base.source_position,
8344 "incompatible types '%T' and '%T' in assignment",
8345 orig_type_left, orig_type_right);
8349 static void semantic_integer_assign(binary_expression_t *expression)
8351 expression_t *left = expression->left;
8352 expression_t *right = expression->right;
8353 type_t *orig_type_left = left->base.type;
8354 type_t *orig_type_right = right->base.type;
8356 if (!is_valid_assignment_lhs(left))
8359 type_t *type_left = skip_typeref(orig_type_left);
8360 type_t *type_right = skip_typeref(orig_type_right);
8362 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8363 /* TODO: improve error message */
8364 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8365 errorf(&expression->base.source_position,
8366 "operation needs integer types");
8371 /* combined instructions are tricky. We can't create an implicit cast on
8372 * the left side, because we need the uncasted form for the store.
8373 * The ast2firm pass has to know that left_type must be right_type
8374 * for the arithmetic operation and create a cast by itself */
8375 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8376 expression->right = create_implicit_cast(right, arithmetic_type);
8377 expression->base.type = type_left;
8380 static void semantic_shift_assign(binary_expression_t *expression)
8382 expression_t *left = expression->left;
8384 if (!is_valid_assignment_lhs(left))
8387 if (!semantic_shift(expression))
8390 expression->base.type = skip_typeref(left->base.type);
8393 static void warn_logical_and_within_or(const expression_t *const expr)
8395 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8397 if (expr->base.parenthesized)
8399 source_position_t const *const pos = &expr->base.source_position;
8400 warningf(WARN_PARENTHESES, pos, "suggest parentheses around && within ||");
8404 * Check the semantic restrictions of a logical expression.
8406 static void semantic_logical_op(binary_expression_t *expression)
8408 /* §6.5.13:2 Each of the operands shall have scalar type.
8409 * §6.5.14:2 Each of the operands shall have scalar type. */
8410 semantic_condition(expression->left, "left operand of logical operator");
8411 semantic_condition(expression->right, "right operand of logical operator");
8412 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR) {
8413 warn_logical_and_within_or(expression->left);
8414 warn_logical_and_within_or(expression->right);
8416 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8420 * Check the semantic restrictions of a binary assign expression.
8422 static void semantic_binexpr_assign(binary_expression_t *expression)
8424 expression_t *left = expression->left;
8425 type_t *orig_type_left = left->base.type;
8427 if (!is_valid_assignment_lhs(left))
8430 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8431 report_assign_error(error, orig_type_left, expression->right,
8432 "assignment", &left->base.source_position);
8433 expression->right = create_implicit_cast(expression->right, orig_type_left);
8434 expression->base.type = orig_type_left;
8438 * Determine if the outermost operation (or parts thereof) of the given
8439 * expression has no effect in order to generate a warning about this fact.
8440 * Therefore in some cases this only examines some of the operands of the
8441 * expression (see comments in the function and examples below).
8443 * f() + 23; // warning, because + has no effect
8444 * x || f(); // no warning, because x controls execution of f()
8445 * x ? y : f(); // warning, because y has no effect
8446 * (void)x; // no warning to be able to suppress the warning
8447 * This function can NOT be used for an "expression has definitely no effect"-
8449 static bool expression_has_effect(const expression_t *const expr)
8451 switch (expr->kind) {
8452 case EXPR_ERROR: return true; /* do NOT warn */
8453 case EXPR_REFERENCE: return false;
8454 case EXPR_ENUM_CONSTANT: return false;
8455 case EXPR_LABEL_ADDRESS: return false;
8457 /* suppress the warning for microsoft __noop operations */
8458 case EXPR_LITERAL_MS_NOOP: return true;
8459 case EXPR_LITERAL_BOOLEAN:
8460 case EXPR_LITERAL_CHARACTER:
8461 case EXPR_LITERAL_WIDE_CHARACTER:
8462 case EXPR_LITERAL_INTEGER:
8463 case EXPR_LITERAL_INTEGER_OCTAL:
8464 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
8465 case EXPR_LITERAL_FLOATINGPOINT:
8466 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: return false;
8467 case EXPR_STRING_LITERAL: return false;
8468 case EXPR_WIDE_STRING_LITERAL: return false;
8471 const call_expression_t *const call = &expr->call;
8472 if (call->function->kind != EXPR_REFERENCE)
8475 switch (call->function->reference.entity->function.btk) {
8476 /* FIXME: which builtins have no effect? */
8477 default: return true;
8481 /* Generate the warning if either the left or right hand side of a
8482 * conditional expression has no effect */
8483 case EXPR_CONDITIONAL: {
8484 conditional_expression_t const *const cond = &expr->conditional;
8485 expression_t const *const t = cond->true_expression;
8487 (t == NULL || expression_has_effect(t)) &&
8488 expression_has_effect(cond->false_expression);
8491 case EXPR_SELECT: return false;
8492 case EXPR_ARRAY_ACCESS: return false;
8493 case EXPR_SIZEOF: return false;
8494 case EXPR_CLASSIFY_TYPE: return false;
8495 case EXPR_ALIGNOF: return false;
8497 case EXPR_FUNCNAME: return false;
8498 case EXPR_BUILTIN_CONSTANT_P: return false;
8499 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8500 case EXPR_OFFSETOF: return false;
8501 case EXPR_VA_START: return true;
8502 case EXPR_VA_ARG: return true;
8503 case EXPR_VA_COPY: return true;
8504 case EXPR_STATEMENT: return true; // TODO
8505 case EXPR_COMPOUND_LITERAL: return false;
8507 case EXPR_UNARY_NEGATE: return false;
8508 case EXPR_UNARY_PLUS: return false;
8509 case EXPR_UNARY_BITWISE_NEGATE: return false;
8510 case EXPR_UNARY_NOT: return false;
8511 case EXPR_UNARY_DEREFERENCE: return false;
8512 case EXPR_UNARY_TAKE_ADDRESS: return false;
8513 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8514 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8515 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8516 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8518 /* Treat void casts as if they have an effect in order to being able to
8519 * suppress the warning */
8520 case EXPR_UNARY_CAST: {
8521 type_t *const type = skip_typeref(expr->base.type);
8522 return is_type_void(type);
8525 case EXPR_UNARY_ASSUME: return true;
8526 case EXPR_UNARY_DELETE: return true;
8527 case EXPR_UNARY_DELETE_ARRAY: return true;
8528 case EXPR_UNARY_THROW: return true;
8530 case EXPR_BINARY_ADD: return false;
8531 case EXPR_BINARY_SUB: return false;
8532 case EXPR_BINARY_MUL: return false;
8533 case EXPR_BINARY_DIV: return false;
8534 case EXPR_BINARY_MOD: return false;
8535 case EXPR_BINARY_EQUAL: return false;
8536 case EXPR_BINARY_NOTEQUAL: return false;
8537 case EXPR_BINARY_LESS: return false;
8538 case EXPR_BINARY_LESSEQUAL: return false;
8539 case EXPR_BINARY_GREATER: return false;
8540 case EXPR_BINARY_GREATEREQUAL: return false;
8541 case EXPR_BINARY_BITWISE_AND: return false;
8542 case EXPR_BINARY_BITWISE_OR: return false;
8543 case EXPR_BINARY_BITWISE_XOR: return false;
8544 case EXPR_BINARY_SHIFTLEFT: return false;
8545 case EXPR_BINARY_SHIFTRIGHT: return false;
8546 case EXPR_BINARY_ASSIGN: return true;
8547 case EXPR_BINARY_MUL_ASSIGN: return true;
8548 case EXPR_BINARY_DIV_ASSIGN: return true;
8549 case EXPR_BINARY_MOD_ASSIGN: return true;
8550 case EXPR_BINARY_ADD_ASSIGN: return true;
8551 case EXPR_BINARY_SUB_ASSIGN: return true;
8552 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8553 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8554 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8555 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8556 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8558 /* Only examine the right hand side of && and ||, because the left hand
8559 * side already has the effect of controlling the execution of the right
8561 case EXPR_BINARY_LOGICAL_AND:
8562 case EXPR_BINARY_LOGICAL_OR:
8563 /* Only examine the right hand side of a comma expression, because the left
8564 * hand side has a separate warning */
8565 case EXPR_BINARY_COMMA:
8566 return expression_has_effect(expr->binary.right);
8568 case EXPR_BINARY_ISGREATER: return false;
8569 case EXPR_BINARY_ISGREATEREQUAL: return false;
8570 case EXPR_BINARY_ISLESS: return false;
8571 case EXPR_BINARY_ISLESSEQUAL: return false;
8572 case EXPR_BINARY_ISLESSGREATER: return false;
8573 case EXPR_BINARY_ISUNORDERED: return false;
8576 internal_errorf(HERE, "unexpected expression");
8579 static void semantic_comma(binary_expression_t *expression)
8581 const expression_t *const left = expression->left;
8582 if (!expression_has_effect(left)) {
8583 source_position_t const *const pos = &left->base.source_position;
8584 warningf(WARN_UNUSED_VALUE, pos, "left-hand operand of comma expression has no effect");
8586 expression->base.type = expression->right->base.type;
8590 * @param prec_r precedence of the right operand
8592 #define CREATE_BINEXPR_PARSER(token_kind, binexpression_type, prec_r, sfunc) \
8593 static expression_t *parse_##binexpression_type(expression_t *left) \
8595 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8596 binexpr->binary.left = left; \
8599 expression_t *right = parse_subexpression(prec_r); \
8601 binexpr->binary.right = right; \
8602 sfunc(&binexpr->binary); \
8607 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8608 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
8609 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
8610 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8611 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8612 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8613 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8614 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
8615 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
8616 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
8617 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
8618 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
8619 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
8620 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_integer)
8621 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_integer)
8622 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_integer)
8623 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8624 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8625 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
8626 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8627 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8628 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8629 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8630 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8631 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8632 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8633 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8634 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8635 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8636 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
8639 static expression_t *parse_subexpression(precedence_t precedence)
8641 if (token.kind < 0) {
8642 return expected_expression_error();
8645 expression_parser_function_t *parser
8646 = &expression_parsers[token.kind];
8649 if (parser->parser != NULL) {
8650 left = parser->parser();
8652 left = parse_primary_expression();
8654 assert(left != NULL);
8657 if (token.kind < 0) {
8658 return expected_expression_error();
8661 parser = &expression_parsers[token.kind];
8662 if (parser->infix_parser == NULL)
8664 if (parser->infix_precedence < precedence)
8667 left = parser->infix_parser(left);
8669 assert(left != NULL);
8676 * Parse an expression.
8678 static expression_t *parse_expression(void)
8680 return parse_subexpression(PREC_EXPRESSION);
8684 * Register a parser for a prefix-like operator.
8686 * @param parser the parser function
8687 * @param token_kind the token type of the prefix token
8689 static void register_expression_parser(parse_expression_function parser,
8692 expression_parser_function_t *entry = &expression_parsers[token_kind];
8694 if (entry->parser != NULL) {
8695 diagnosticf("for token '%k'\n", (token_kind_t)token_kind);
8696 panic("trying to register multiple expression parsers for a token");
8698 entry->parser = parser;
8702 * Register a parser for an infix operator with given precedence.
8704 * @param parser the parser function
8705 * @param token_kind the token type of the infix operator
8706 * @param precedence the precedence of the operator
8708 static void register_infix_parser(parse_expression_infix_function parser,
8709 int token_kind, precedence_t precedence)
8711 expression_parser_function_t *entry = &expression_parsers[token_kind];
8713 if (entry->infix_parser != NULL) {
8714 diagnosticf("for token '%k'\n", (token_kind_t)token_kind);
8715 panic("trying to register multiple infix expression parsers for a "
8718 entry->infix_parser = parser;
8719 entry->infix_precedence = precedence;
8723 * Initialize the expression parsers.
8725 static void init_expression_parsers(void)
8727 memset(&expression_parsers, 0, sizeof(expression_parsers));
8729 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
8730 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
8731 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
8732 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
8733 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
8734 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
8735 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
8736 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
8737 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
8738 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
8739 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
8740 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
8741 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
8742 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
8743 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
8744 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
8745 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
8746 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
8747 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
8748 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
8749 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
8750 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
8751 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
8752 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
8753 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
8754 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
8755 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
8756 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
8757 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
8758 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
8759 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
8760 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
8761 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
8762 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
8763 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
8764 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
8765 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
8767 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
8768 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
8769 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
8770 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
8771 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
8772 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
8773 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
8774 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
8775 register_expression_parser(parse_sizeof, T_sizeof);
8776 register_expression_parser(parse_alignof, T___alignof__);
8777 register_expression_parser(parse_extension, T___extension__);
8778 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
8779 register_expression_parser(parse_delete, T_delete);
8780 register_expression_parser(parse_throw, T_throw);
8784 * Parse a asm statement arguments specification.
8786 static asm_argument_t *parse_asm_arguments(bool is_out)
8788 asm_argument_t *result = NULL;
8789 asm_argument_t **anchor = &result;
8791 while (token.kind == T_STRING_LITERAL || token.kind == '[') {
8792 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
8795 add_anchor_token(']');
8796 argument->symbol = expect_identifier("while parsing asm argument", NULL);
8797 rem_anchor_token(']');
8799 if (!argument->symbol)
8803 argument->constraints = parse_string_literals();
8805 add_anchor_token(')');
8806 expression_t *expression = parse_expression();
8807 rem_anchor_token(')');
8809 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
8810 * change size or type representation (e.g. int -> long is ok, but
8811 * int -> float is not) */
8812 if (expression->kind == EXPR_UNARY_CAST) {
8813 type_t *const type = expression->base.type;
8814 type_kind_t const kind = type->kind;
8815 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
8818 if (kind == TYPE_ATOMIC) {
8819 atomic_type_kind_t const akind = type->atomic.akind;
8820 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8821 size = get_atomic_type_size(akind);
8823 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8824 size = get_type_size(type_void_ptr);
8828 expression_t *const value = expression->unary.value;
8829 type_t *const value_type = value->base.type;
8830 type_kind_t const value_kind = value_type->kind;
8832 unsigned value_flags;
8833 unsigned value_size;
8834 if (value_kind == TYPE_ATOMIC) {
8835 atomic_type_kind_t const value_akind = value_type->atomic.akind;
8836 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8837 value_size = get_atomic_type_size(value_akind);
8838 } else if (value_kind == TYPE_POINTER) {
8839 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8840 value_size = get_type_size(type_void_ptr);
8845 if (value_flags != flags || value_size != size)
8849 } while (expression->kind == EXPR_UNARY_CAST);
8853 if (!is_lvalue(expression)) {
8854 errorf(&expression->base.source_position,
8855 "asm output argument is not an lvalue");
8858 if (argument->constraints.begin[0] == '=')
8859 determine_lhs_ent(expression, NULL);
8861 mark_vars_read(expression, NULL);
8863 mark_vars_read(expression, NULL);
8865 argument->expression = expression;
8868 set_address_taken(expression, true);
8871 anchor = &argument->next;
8881 * Parse a asm statement clobber specification.
8883 static asm_clobber_t *parse_asm_clobbers(void)
8885 asm_clobber_t *result = NULL;
8886 asm_clobber_t **anchor = &result;
8888 while (token.kind == T_STRING_LITERAL) {
8889 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
8890 clobber->clobber = parse_string_literals();
8893 anchor = &clobber->next;
8903 * Parse an asm statement.
8905 static statement_t *parse_asm_statement(void)
8907 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
8908 asm_statement_t *asm_statement = &statement->asms;
8912 if (next_if(T_volatile))
8913 asm_statement->is_volatile = true;
8916 add_anchor_token(')');
8917 if (token.kind != T_STRING_LITERAL) {
8918 parse_error_expected("after asm(", T_STRING_LITERAL, NULL);
8921 asm_statement->asm_text = parse_string_literals();
8923 add_anchor_token(':');
8924 if (!next_if(':')) {
8925 rem_anchor_token(':');
8929 asm_statement->outputs = parse_asm_arguments(true);
8930 if (!next_if(':')) {
8931 rem_anchor_token(':');
8935 asm_statement->inputs = parse_asm_arguments(false);
8936 if (!next_if(':')) {
8937 rem_anchor_token(':');
8940 rem_anchor_token(':');
8942 asm_statement->clobbers = parse_asm_clobbers();
8945 rem_anchor_token(')');
8949 if (asm_statement->outputs == NULL) {
8950 /* GCC: An 'asm' instruction without any output operands will be treated
8951 * identically to a volatile 'asm' instruction. */
8952 asm_statement->is_volatile = true;
8958 static statement_t *parse_label_inner_statement(statement_t const *const label, char const *const label_kind)
8960 statement_t *inner_stmt;
8961 switch (token.kind) {
8963 errorf(&label->base.source_position, "%s at end of compound statement", label_kind);
8964 inner_stmt = create_error_statement();
8968 if (label->kind == STATEMENT_LABEL) {
8969 /* Eat an empty statement here, to avoid the warning about an empty
8970 * statement after a label. label:; is commonly used to have a label
8971 * before a closing brace. */
8972 inner_stmt = create_empty_statement();
8979 inner_stmt = parse_statement();
8980 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
8981 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
8982 if (inner_stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
8983 errorf(&inner_stmt->base.source_position, "declaration after %s", label_kind);
8991 * Parse a case statement.
8993 static statement_t *parse_case_statement(void)
8995 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
8996 source_position_t *const pos = &statement->base.source_position;
8999 add_anchor_token(':');
9001 expression_t *expression = parse_expression();
9002 type_t *expression_type = expression->base.type;
9003 type_t *skipped = skip_typeref(expression_type);
9004 if (!is_type_integer(skipped) && is_type_valid(skipped)) {
9005 errorf(pos, "case expression '%E' must have integer type but has type '%T'",
9006 expression, expression_type);
9009 type_t *type = expression_type;
9010 if (current_switch != NULL) {
9011 type_t *switch_type = current_switch->expression->base.type;
9012 if (is_type_valid(switch_type)) {
9013 expression = create_implicit_cast(expression, switch_type);
9017 statement->case_label.expression = expression;
9018 expression_classification_t const expr_class = is_constant_expression(expression);
9019 if (expr_class != EXPR_CLASS_CONSTANT) {
9020 if (expr_class != EXPR_CLASS_ERROR) {
9021 errorf(pos, "case label does not reduce to an integer constant");
9023 statement->case_label.is_bad = true;
9025 long const val = fold_constant_to_int(expression);
9026 statement->case_label.first_case = val;
9027 statement->case_label.last_case = val;
9031 if (next_if(T_DOTDOTDOT)) {
9032 expression_t *end_range = parse_expression();
9033 expression_type = expression->base.type;
9034 skipped = skip_typeref(expression_type);
9035 if (!is_type_integer(skipped) && is_type_valid(skipped)) {
9036 errorf(pos, "case expression '%E' must have integer type but has type '%T'",
9037 expression, expression_type);
9040 end_range = create_implicit_cast(end_range, type);
9041 statement->case_label.end_range = end_range;
9042 expression_classification_t const end_class = is_constant_expression(end_range);
9043 if (end_class != EXPR_CLASS_CONSTANT) {
9044 if (end_class != EXPR_CLASS_ERROR) {
9045 errorf(pos, "case range does not reduce to an integer constant");
9047 statement->case_label.is_bad = true;
9049 long const val = fold_constant_to_int(end_range);
9050 statement->case_label.last_case = val;
9052 if (val < statement->case_label.first_case) {
9053 statement->case_label.is_empty_range = true;
9054 warningf(WARN_OTHER, pos, "empty range specified");
9060 PUSH_PARENT(statement);
9062 rem_anchor_token(':');
9065 if (current_switch != NULL) {
9066 if (! statement->case_label.is_bad) {
9067 /* Check for duplicate case values */
9068 case_label_statement_t *c = &statement->case_label;
9069 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9070 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9073 if (c->last_case < l->first_case || c->first_case > l->last_case)
9076 errorf(pos, "duplicate case value (previously used %P)",
9077 &l->base.source_position);
9081 /* link all cases into the switch statement */
9082 if (current_switch->last_case == NULL) {
9083 current_switch->first_case = &statement->case_label;
9085 current_switch->last_case->next = &statement->case_label;
9087 current_switch->last_case = &statement->case_label;
9089 errorf(pos, "case label not within a switch statement");
9092 statement->case_label.statement = parse_label_inner_statement(statement, "case label");
9099 * Parse a default statement.
9101 static statement_t *parse_default_statement(void)
9103 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9107 PUSH_PARENT(statement);
9111 if (current_switch != NULL) {
9112 const case_label_statement_t *def_label = current_switch->default_label;
9113 if (def_label != NULL) {
9114 errorf(&statement->base.source_position, "multiple default labels in one switch (previous declared %P)", &def_label->base.source_position);
9116 current_switch->default_label = &statement->case_label;
9118 /* link all cases into the switch statement */
9119 if (current_switch->last_case == NULL) {
9120 current_switch->first_case = &statement->case_label;
9122 current_switch->last_case->next = &statement->case_label;
9124 current_switch->last_case = &statement->case_label;
9127 errorf(&statement->base.source_position,
9128 "'default' label not within a switch statement");
9131 statement->case_label.statement = parse_label_inner_statement(statement, "default label");
9138 * Parse a label statement.
9140 static statement_t *parse_label_statement(void)
9142 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9143 label_t *const label = get_label();
9144 statement->label.label = label;
9146 PUSH_PARENT(statement);
9148 /* if statement is already set then the label is defined twice,
9149 * otherwise it was just mentioned in a goto/local label declaration so far
9151 source_position_t const* const pos = &statement->base.source_position;
9152 if (label->statement != NULL) {
9153 errorf(pos, "duplicate '%N' (declared %P)", (entity_t const*)label, &label->base.source_position);
9155 label->base.source_position = *pos;
9156 label->statement = statement;
9161 if (token.kind == T___attribute__ && !(c_mode & _CXX)) {
9162 parse_attributes(NULL); // TODO process attributes
9165 statement->label.statement = parse_label_inner_statement(statement, "label");
9167 /* remember the labels in a list for later checking */
9168 *label_anchor = &statement->label;
9169 label_anchor = &statement->label.next;
9175 static statement_t *parse_inner_statement(void)
9177 statement_t *const stmt = parse_statement();
9178 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
9179 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
9180 if (stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
9181 errorf(&stmt->base.source_position, "declaration as inner statement, use {}");
9187 * Parse an expression in parentheses and mark its variables as read.
9189 static expression_t *parse_condition(void)
9192 add_anchor_token(')');
9193 expression_t *const expr = parse_expression();
9194 mark_vars_read(expr, NULL);
9195 rem_anchor_token(')');
9201 * Parse an if statement.
9203 static statement_t *parse_if(void)
9205 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9209 PUSH_PARENT(statement);
9210 PUSH_SCOPE_STATEMENT(&statement->ifs.scope);
9212 add_anchor_token(T_else);
9214 expression_t *const expr = parse_condition();
9215 statement->ifs.condition = expr;
9216 /* §6.8.4.1:1 The controlling expression of an if statement shall have
9218 semantic_condition(expr, "condition of 'if'-statment");
9220 statement_t *const true_stmt = parse_inner_statement();
9221 statement->ifs.true_statement = true_stmt;
9222 rem_anchor_token(T_else);
9224 if (true_stmt->kind == STATEMENT_EMPTY) {
9225 warningf(WARN_EMPTY_BODY, HERE,
9226 "suggest braces around empty body in an ‘if’ statement");
9229 if (next_if(T_else)) {
9230 statement->ifs.false_statement = parse_inner_statement();
9232 if (statement->ifs.false_statement->kind == STATEMENT_EMPTY) {
9233 warningf(WARN_EMPTY_BODY, HERE,
9234 "suggest braces around empty body in an ‘if’ statement");
9236 } else if (true_stmt->kind == STATEMENT_IF &&
9237 true_stmt->ifs.false_statement != NULL) {
9238 source_position_t const *const pos = &true_stmt->base.source_position;
9239 warningf(WARN_PARENTHESES, pos, "suggest explicit braces to avoid ambiguous 'else'");
9248 * Check that all enums are handled in a switch.
9250 * @param statement the switch statement to check
9252 static void check_enum_cases(const switch_statement_t *statement)
9254 if (!is_warn_on(WARN_SWITCH_ENUM))
9256 const type_t *type = skip_typeref(statement->expression->base.type);
9257 if (! is_type_enum(type))
9259 const enum_type_t *enumt = &type->enumt;
9261 /* if we have a default, no warnings */
9262 if (statement->default_label != NULL)
9265 /* FIXME: calculation of value should be done while parsing */
9266 /* TODO: quadratic algorithm here. Change to an n log n one */
9267 long last_value = -1;
9268 const entity_t *entry = enumt->enume->base.next;
9269 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9270 entry = entry->base.next) {
9271 const expression_t *expression = entry->enum_value.value;
9272 long value = expression != NULL ? fold_constant_to_int(expression) : last_value + 1;
9274 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9275 if (l->expression == NULL)
9277 if (l->first_case <= value && value <= l->last_case) {
9283 source_position_t const *const pos = &statement->base.source_position;
9284 warningf(WARN_SWITCH_ENUM, pos, "'%N' not handled in switch", entry);
9291 * Parse a switch statement.
9293 static statement_t *parse_switch(void)
9295 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9299 PUSH_PARENT(statement);
9300 PUSH_SCOPE_STATEMENT(&statement->switchs.scope);
9302 expression_t *const expr = parse_condition();
9303 type_t * type = skip_typeref(expr->base.type);
9304 if (is_type_integer(type)) {
9305 type = promote_integer(type);
9306 if (get_akind_rank(get_akind(type)) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9307 warningf(WARN_TRADITIONAL, &expr->base.source_position, "'%T' switch expression not converted to '%T' in ISO C", type, type_int);
9309 } else if (is_type_valid(type)) {
9310 errorf(&expr->base.source_position,
9311 "switch quantity is not an integer, but '%T'", type);
9312 type = type_error_type;
9314 statement->switchs.expression = create_implicit_cast(expr, type);
9316 switch_statement_t *rem = current_switch;
9317 current_switch = &statement->switchs;
9318 statement->switchs.body = parse_inner_statement();
9319 current_switch = rem;
9321 if (statement->switchs.default_label == NULL) {
9322 warningf(WARN_SWITCH_DEFAULT, &statement->base.source_position, "switch has no default case");
9324 check_enum_cases(&statement->switchs);
9331 static statement_t *parse_loop_body(statement_t *const loop)
9333 statement_t *const rem = current_loop;
9334 current_loop = loop;
9336 statement_t *const body = parse_inner_statement();
9343 * Parse a while statement.
9345 static statement_t *parse_while(void)
9347 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9351 PUSH_PARENT(statement);
9352 PUSH_SCOPE_STATEMENT(&statement->whiles.scope);
9354 expression_t *const cond = parse_condition();
9355 statement->whiles.condition = cond;
9356 /* §6.8.5:2 The controlling expression of an iteration statement shall
9357 * have scalar type. */
9358 semantic_condition(cond, "condition of 'while'-statement");
9360 statement->whiles.body = parse_loop_body(statement);
9368 * Parse a do statement.
9370 static statement_t *parse_do(void)
9372 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9376 PUSH_PARENT(statement);
9377 PUSH_SCOPE_STATEMENT(&statement->do_while.scope);
9379 add_anchor_token(T_while);
9380 statement->do_while.body = parse_loop_body(statement);
9381 rem_anchor_token(T_while);
9384 expression_t *const cond = parse_condition();
9385 statement->do_while.condition = cond;
9386 /* §6.8.5:2 The controlling expression of an iteration statement shall
9387 * have scalar type. */
9388 semantic_condition(cond, "condition of 'do-while'-statement");
9397 * Parse a for statement.
9399 static statement_t *parse_for(void)
9401 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9405 PUSH_PARENT(statement);
9406 PUSH_SCOPE_STATEMENT(&statement->fors.scope);
9409 add_anchor_token(')');
9414 } else if (is_declaration_specifier(&token)) {
9415 parse_declaration(record_entity, DECL_FLAGS_NONE);
9417 add_anchor_token(';');
9418 expression_t *const init = parse_expression();
9419 statement->fors.initialisation = init;
9420 mark_vars_read(init, ENT_ANY);
9421 if (!expression_has_effect(init)) {
9422 warningf(WARN_UNUSED_VALUE, &init->base.source_position, "initialisation of 'for'-statement has no effect");
9424 rem_anchor_token(';');
9430 if (token.kind != ';') {
9431 add_anchor_token(';');
9432 expression_t *const cond = parse_expression();
9433 statement->fors.condition = cond;
9434 /* §6.8.5:2 The controlling expression of an iteration statement
9435 * shall have scalar type. */
9436 semantic_condition(cond, "condition of 'for'-statement");
9437 mark_vars_read(cond, NULL);
9438 rem_anchor_token(';');
9441 if (token.kind != ')') {
9442 expression_t *const step = parse_expression();
9443 statement->fors.step = step;
9444 mark_vars_read(step, ENT_ANY);
9445 if (!expression_has_effect(step)) {
9446 warningf(WARN_UNUSED_VALUE, &step->base.source_position, "step of 'for'-statement has no effect");
9449 rem_anchor_token(')');
9451 statement->fors.body = parse_loop_body(statement);
9459 * Parse a goto statement.
9461 static statement_t *parse_goto(void)
9463 statement_t *statement;
9464 if (GNU_MODE && look_ahead(1)->kind == '*') {
9465 statement = allocate_statement_zero(STATEMENT_COMPUTED_GOTO);
9469 expression_t *expression = parse_expression();
9470 mark_vars_read(expression, NULL);
9472 /* Argh: although documentation says the expression must be of type void*,
9473 * gcc accepts anything that can be casted into void* without error */
9474 type_t *type = expression->base.type;
9476 if (type != type_error_type) {
9477 if (!is_type_pointer(type) && !is_type_integer(type)) {
9478 errorf(&expression->base.source_position,
9479 "cannot convert to a pointer type");
9480 } else if (type != type_void_ptr) {
9481 warningf(WARN_OTHER, &expression->base.source_position, "type of computed goto expression should be 'void*' not '%T'", type);
9483 expression = create_implicit_cast(expression, type_void_ptr);
9486 statement->computed_goto.expression = expression;
9488 statement = allocate_statement_zero(STATEMENT_GOTO);
9490 if (token.kind == T_IDENTIFIER) {
9491 label_t *const label = get_label();
9493 statement->gotos.label = label;
9495 /* remember the goto's in a list for later checking */
9496 *goto_anchor = &statement->gotos;
9497 goto_anchor = &statement->gotos.next;
9500 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
9502 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
9504 statement->gotos.label = &allocate_entity_zero(ENTITY_LABEL, NAMESPACE_LABEL, sym_anonymous, &builtin_source_position)->label;
9513 * Parse a continue statement.
9515 static statement_t *parse_continue(void)
9517 if (current_loop == NULL) {
9518 errorf(HERE, "continue statement not within loop");
9521 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9529 * Parse a break statement.
9531 static statement_t *parse_break(void)
9533 if (current_switch == NULL && current_loop == NULL) {
9534 errorf(HERE, "break statement not within loop or switch");
9537 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9545 * Parse a __leave statement.
9547 static statement_t *parse_leave_statement(void)
9549 if (current_try == NULL) {
9550 errorf(HERE, "__leave statement not within __try");
9553 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9561 * Check if a given entity represents a local variable.
9563 static bool is_local_variable(const entity_t *entity)
9565 if (entity->kind != ENTITY_VARIABLE)
9568 switch ((storage_class_tag_t) entity->declaration.storage_class) {
9569 case STORAGE_CLASS_AUTO:
9570 case STORAGE_CLASS_REGISTER: {
9571 const type_t *type = skip_typeref(entity->declaration.type);
9572 if (is_type_function(type)) {
9584 * Check if a given expression represents a local variable.
9586 static bool expression_is_local_variable(const expression_t *expression)
9588 if (expression->base.kind != EXPR_REFERENCE) {
9591 const entity_t *entity = expression->reference.entity;
9592 return is_local_variable(entity);
9596 * Check if a given expression represents a local variable and
9597 * return its declaration then, else return NULL.
9599 entity_t *expression_is_variable(const expression_t *expression)
9601 if (expression->base.kind != EXPR_REFERENCE) {
9604 entity_t *entity = expression->reference.entity;
9605 if (entity->kind != ENTITY_VARIABLE)
9611 static void err_or_warn(source_position_t const *const pos, char const *const msg)
9613 if (c_mode & _CXX || strict_mode) {
9616 warningf(WARN_OTHER, pos, msg);
9621 * Parse a return statement.
9623 static statement_t *parse_return(void)
9625 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9628 expression_t *return_value = NULL;
9629 if (token.kind != ';') {
9630 return_value = parse_expression();
9631 mark_vars_read(return_value, NULL);
9634 const type_t *const func_type = skip_typeref(current_function->base.type);
9635 assert(is_type_function(func_type));
9636 type_t *const return_type = skip_typeref(func_type->function.return_type);
9638 source_position_t const *const pos = &statement->base.source_position;
9639 if (return_value != NULL) {
9640 type_t *return_value_type = skip_typeref(return_value->base.type);
9642 if (is_type_void(return_type)) {
9643 if (!is_type_void(return_value_type)) {
9644 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
9645 /* Only warn in C mode, because GCC does the same */
9646 err_or_warn(pos, "'return' with a value, in function returning 'void'");
9647 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9648 /* Only warn in C mode, because GCC does the same */
9649 err_or_warn(pos, "'return' with expression in function returning 'void'");
9652 assign_error_t error = semantic_assign(return_type, return_value);
9653 report_assign_error(error, return_type, return_value, "'return'",
9656 return_value = create_implicit_cast(return_value, return_type);
9657 /* check for returning address of a local var */
9658 if (return_value != NULL && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
9659 const expression_t *expression = return_value->unary.value;
9660 if (expression_is_local_variable(expression)) {
9661 warningf(WARN_OTHER, pos, "function returns address of local variable");
9664 } else if (!is_type_void(return_type)) {
9665 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9666 err_or_warn(pos, "'return' without value, in function returning non-void");
9668 statement->returns.value = return_value;
9675 * Parse a declaration statement.
9677 static statement_t *parse_declaration_statement(void)
9679 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9681 entity_t *before = current_scope->last_entity;
9683 parse_external_declaration();
9685 parse_declaration(record_entity, DECL_FLAGS_NONE);
9688 declaration_statement_t *const decl = &statement->declaration;
9689 entity_t *const begin =
9690 before != NULL ? before->base.next : current_scope->entities;
9691 decl->declarations_begin = begin;
9692 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
9698 * Parse an expression statement, ie. expr ';'.
9700 static statement_t *parse_expression_statement(void)
9702 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
9704 expression_t *const expr = parse_expression();
9705 statement->expression.expression = expr;
9706 mark_vars_read(expr, ENT_ANY);
9713 * Parse a microsoft __try { } __finally { } or
9714 * __try{ } __except() { }
9716 static statement_t *parse_ms_try_statment(void)
9718 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
9721 PUSH_PARENT(statement);
9723 ms_try_statement_t *rem = current_try;
9724 current_try = &statement->ms_try;
9725 statement->ms_try.try_statement = parse_compound_statement(false);
9730 if (next_if(T___except)) {
9731 expression_t *const expr = parse_condition();
9732 type_t * type = skip_typeref(expr->base.type);
9733 if (is_type_integer(type)) {
9734 type = promote_integer(type);
9735 } else if (is_type_valid(type)) {
9736 errorf(&expr->base.source_position,
9737 "__expect expression is not an integer, but '%T'", type);
9738 type = type_error_type;
9740 statement->ms_try.except_expression = create_implicit_cast(expr, type);
9741 } else if (!next_if(T__finally)) {
9742 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
9744 statement->ms_try.final_statement = parse_compound_statement(false);
9748 static statement_t *parse_empty_statement(void)
9750 warningf(WARN_EMPTY_STATEMENT, HERE, "statement is empty");
9751 statement_t *const statement = create_empty_statement();
9756 static statement_t *parse_local_label_declaration(void)
9758 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9762 entity_t *begin = NULL;
9763 entity_t *end = NULL;
9764 entity_t **anchor = &begin;
9766 source_position_t pos;
9767 symbol_t *const symbol = expect_identifier("while parsing local label declaration", &pos);
9771 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
9772 if (entity != NULL && entity->base.parent_scope == current_scope) {
9773 source_position_t const *const ppos = &entity->base.source_position;
9774 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
9776 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL, NAMESPACE_LABEL, symbol, &pos);
9777 entity->base.parent_scope = current_scope;
9780 anchor = &entity->base.next;
9783 environment_push(entity);
9785 } while (next_if(','));
9788 statement->declaration.declarations_begin = begin;
9789 statement->declaration.declarations_end = end;
9793 static void parse_namespace_definition(void)
9797 entity_t *entity = NULL;
9798 symbol_t *symbol = NULL;
9800 if (token.kind == T_IDENTIFIER) {
9801 symbol = token.identifier.symbol;
9804 entity = get_entity(symbol, NAMESPACE_NORMAL);
9806 && entity->kind != ENTITY_NAMESPACE
9807 && entity->base.parent_scope == current_scope) {
9808 if (is_entity_valid(entity)) {
9809 error_redefined_as_different_kind(&token.base.source_position,
9810 entity, ENTITY_NAMESPACE);
9816 if (entity == NULL) {
9817 entity = allocate_entity_zero(ENTITY_NAMESPACE, NAMESPACE_NORMAL, symbol, HERE);
9818 entity->base.parent_scope = current_scope;
9821 if (token.kind == '=') {
9822 /* TODO: parse namespace alias */
9823 panic("namespace alias definition not supported yet");
9826 environment_push(entity);
9827 append_entity(current_scope, entity);
9829 PUSH_SCOPE(&entity->namespacee.members);
9831 entity_t *old_current_entity = current_entity;
9832 current_entity = entity;
9834 add_anchor_token('}');
9837 rem_anchor_token('}');
9840 assert(current_entity == entity);
9841 current_entity = old_current_entity;
9846 * Parse a statement.
9847 * There's also parse_statement() which additionally checks for
9848 * "statement has no effect" warnings
9850 static statement_t *intern_parse_statement(void)
9852 /* declaration or statement */
9853 statement_t *statement;
9854 switch (token.kind) {
9855 case T_IDENTIFIER: {
9856 token_kind_t la1_type = (token_kind_t)look_ahead(1)->kind;
9857 if (la1_type == ':') {
9858 statement = parse_label_statement();
9859 } else if (is_typedef_symbol(token.identifier.symbol)) {
9860 statement = parse_declaration_statement();
9862 /* it's an identifier, the grammar says this must be an
9863 * expression statement. However it is common that users mistype
9864 * declaration types, so we guess a bit here to improve robustness
9865 * for incorrect programs */
9869 if (get_entity(token.identifier.symbol, NAMESPACE_NORMAL) != NULL) {
9871 statement = parse_expression_statement();
9875 statement = parse_declaration_statement();
9883 case T___extension__: {
9884 /* This can be a prefix to a declaration or an expression statement.
9885 * We simply eat it now and parse the rest with tail recursion. */
9887 statement = intern_parse_statement();
9893 statement = parse_declaration_statement();
9897 statement = parse_local_label_declaration();
9900 case ';': statement = parse_empty_statement(); break;
9901 case '{': statement = parse_compound_statement(false); break;
9902 case T___leave: statement = parse_leave_statement(); break;
9903 case T___try: statement = parse_ms_try_statment(); break;
9904 case T_asm: statement = parse_asm_statement(); break;
9905 case T_break: statement = parse_break(); break;
9906 case T_case: statement = parse_case_statement(); break;
9907 case T_continue: statement = parse_continue(); break;
9908 case T_default: statement = parse_default_statement(); break;
9909 case T_do: statement = parse_do(); break;
9910 case T_for: statement = parse_for(); break;
9911 case T_goto: statement = parse_goto(); break;
9912 case T_if: statement = parse_if(); break;
9913 case T_return: statement = parse_return(); break;
9914 case T_switch: statement = parse_switch(); break;
9915 case T_while: statement = parse_while(); break;
9918 statement = parse_expression_statement();
9922 errorf(HERE, "unexpected token %K while parsing statement", &token);
9923 statement = create_error_statement();
9932 * parse a statement and emits "statement has no effect" warning if needed
9933 * (This is really a wrapper around intern_parse_statement with check for 1
9934 * single warning. It is needed, because for statement expressions we have
9935 * to avoid the warning on the last statement)
9937 static statement_t *parse_statement(void)
9939 statement_t *statement = intern_parse_statement();
9941 if (statement->kind == STATEMENT_EXPRESSION) {
9942 expression_t *expression = statement->expression.expression;
9943 if (!expression_has_effect(expression)) {
9944 warningf(WARN_UNUSED_VALUE, &expression->base.source_position, "statement has no effect");
9952 * Parse a compound statement.
9954 static statement_t *parse_compound_statement(bool inside_expression_statement)
9956 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
9958 PUSH_PARENT(statement);
9959 PUSH_SCOPE(&statement->compound.scope);
9962 add_anchor_token('}');
9963 /* tokens, which can start a statement */
9964 /* TODO MS, __builtin_FOO */
9965 add_anchor_token('!');
9966 add_anchor_token('&');
9967 add_anchor_token('(');
9968 add_anchor_token('*');
9969 add_anchor_token('+');
9970 add_anchor_token('-');
9971 add_anchor_token(';');
9972 add_anchor_token('{');
9973 add_anchor_token('~');
9974 add_anchor_token(T_CHARACTER_CONSTANT);
9975 add_anchor_token(T_COLONCOLON);
9976 add_anchor_token(T_FLOATINGPOINT);
9977 add_anchor_token(T_IDENTIFIER);
9978 add_anchor_token(T_INTEGER);
9979 add_anchor_token(T_MINUSMINUS);
9980 add_anchor_token(T_PLUSPLUS);
9981 add_anchor_token(T_STRING_LITERAL);
9982 add_anchor_token(T_WIDE_CHARACTER_CONSTANT);
9983 add_anchor_token(T_WIDE_STRING_LITERAL);
9984 add_anchor_token(T__Bool);
9985 add_anchor_token(T__Complex);
9986 add_anchor_token(T__Imaginary);
9987 add_anchor_token(T___FUNCTION__);
9988 add_anchor_token(T___PRETTY_FUNCTION__);
9989 add_anchor_token(T___alignof__);
9990 add_anchor_token(T___attribute__);
9991 add_anchor_token(T___builtin_va_start);
9992 add_anchor_token(T___extension__);
9993 add_anchor_token(T___func__);
9994 add_anchor_token(T___imag__);
9995 add_anchor_token(T___label__);
9996 add_anchor_token(T___real__);
9997 add_anchor_token(T___thread);
9998 add_anchor_token(T_asm);
9999 add_anchor_token(T_auto);
10000 add_anchor_token(T_bool);
10001 add_anchor_token(T_break);
10002 add_anchor_token(T_case);
10003 add_anchor_token(T_char);
10004 add_anchor_token(T_class);
10005 add_anchor_token(T_const);
10006 add_anchor_token(T_const_cast);
10007 add_anchor_token(T_continue);
10008 add_anchor_token(T_default);
10009 add_anchor_token(T_delete);
10010 add_anchor_token(T_double);
10011 add_anchor_token(T_do);
10012 add_anchor_token(T_dynamic_cast);
10013 add_anchor_token(T_enum);
10014 add_anchor_token(T_extern);
10015 add_anchor_token(T_false);
10016 add_anchor_token(T_float);
10017 add_anchor_token(T_for);
10018 add_anchor_token(T_goto);
10019 add_anchor_token(T_if);
10020 add_anchor_token(T_inline);
10021 add_anchor_token(T_int);
10022 add_anchor_token(T_long);
10023 add_anchor_token(T_new);
10024 add_anchor_token(T_operator);
10025 add_anchor_token(T_register);
10026 add_anchor_token(T_reinterpret_cast);
10027 add_anchor_token(T_restrict);
10028 add_anchor_token(T_return);
10029 add_anchor_token(T_short);
10030 add_anchor_token(T_signed);
10031 add_anchor_token(T_sizeof);
10032 add_anchor_token(T_static);
10033 add_anchor_token(T_static_cast);
10034 add_anchor_token(T_struct);
10035 add_anchor_token(T_switch);
10036 add_anchor_token(T_template);
10037 add_anchor_token(T_this);
10038 add_anchor_token(T_throw);
10039 add_anchor_token(T_true);
10040 add_anchor_token(T_try);
10041 add_anchor_token(T_typedef);
10042 add_anchor_token(T_typeid);
10043 add_anchor_token(T_typename);
10044 add_anchor_token(T_typeof);
10045 add_anchor_token(T_union);
10046 add_anchor_token(T_unsigned);
10047 add_anchor_token(T_using);
10048 add_anchor_token(T_void);
10049 add_anchor_token(T_volatile);
10050 add_anchor_token(T_wchar_t);
10051 add_anchor_token(T_while);
10053 statement_t **anchor = &statement->compound.statements;
10054 bool only_decls_so_far = true;
10055 while (token.kind != '}' && token.kind != T_EOF) {
10056 statement_t *sub_statement = intern_parse_statement();
10057 if (sub_statement->kind == STATEMENT_ERROR) {
10061 if (sub_statement->kind != STATEMENT_DECLARATION) {
10062 only_decls_so_far = false;
10063 } else if (!only_decls_so_far) {
10064 source_position_t const *const pos = &sub_statement->base.source_position;
10065 warningf(WARN_DECLARATION_AFTER_STATEMENT, pos, "ISO C90 forbids mixed declarations and code");
10068 *anchor = sub_statement;
10069 anchor = &sub_statement->base.next;
10073 /* look over all statements again to produce no effect warnings */
10074 if (is_warn_on(WARN_UNUSED_VALUE)) {
10075 statement_t *sub_statement = statement->compound.statements;
10076 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
10077 if (sub_statement->kind != STATEMENT_EXPRESSION)
10079 /* don't emit a warning for the last expression in an expression
10080 * statement as it has always an effect */
10081 if (inside_expression_statement && sub_statement->base.next == NULL)
10084 expression_t *expression = sub_statement->expression.expression;
10085 if (!expression_has_effect(expression)) {
10086 warningf(WARN_UNUSED_VALUE, &expression->base.source_position, "statement has no effect");
10091 rem_anchor_token(T_while);
10092 rem_anchor_token(T_wchar_t);
10093 rem_anchor_token(T_volatile);
10094 rem_anchor_token(T_void);
10095 rem_anchor_token(T_using);
10096 rem_anchor_token(T_unsigned);
10097 rem_anchor_token(T_union);
10098 rem_anchor_token(T_typeof);
10099 rem_anchor_token(T_typename);
10100 rem_anchor_token(T_typeid);
10101 rem_anchor_token(T_typedef);
10102 rem_anchor_token(T_try);
10103 rem_anchor_token(T_true);
10104 rem_anchor_token(T_throw);
10105 rem_anchor_token(T_this);
10106 rem_anchor_token(T_template);
10107 rem_anchor_token(T_switch);
10108 rem_anchor_token(T_struct);
10109 rem_anchor_token(T_static_cast);
10110 rem_anchor_token(T_static);
10111 rem_anchor_token(T_sizeof);
10112 rem_anchor_token(T_signed);
10113 rem_anchor_token(T_short);
10114 rem_anchor_token(T_return);
10115 rem_anchor_token(T_restrict);
10116 rem_anchor_token(T_reinterpret_cast);
10117 rem_anchor_token(T_register);
10118 rem_anchor_token(T_operator);
10119 rem_anchor_token(T_new);
10120 rem_anchor_token(T_long);
10121 rem_anchor_token(T_int);
10122 rem_anchor_token(T_inline);
10123 rem_anchor_token(T_if);
10124 rem_anchor_token(T_goto);
10125 rem_anchor_token(T_for);
10126 rem_anchor_token(T_float);
10127 rem_anchor_token(T_false);
10128 rem_anchor_token(T_extern);
10129 rem_anchor_token(T_enum);
10130 rem_anchor_token(T_dynamic_cast);
10131 rem_anchor_token(T_do);
10132 rem_anchor_token(T_double);
10133 rem_anchor_token(T_delete);
10134 rem_anchor_token(T_default);
10135 rem_anchor_token(T_continue);
10136 rem_anchor_token(T_const_cast);
10137 rem_anchor_token(T_const);
10138 rem_anchor_token(T_class);
10139 rem_anchor_token(T_char);
10140 rem_anchor_token(T_case);
10141 rem_anchor_token(T_break);
10142 rem_anchor_token(T_bool);
10143 rem_anchor_token(T_auto);
10144 rem_anchor_token(T_asm);
10145 rem_anchor_token(T___thread);
10146 rem_anchor_token(T___real__);
10147 rem_anchor_token(T___label__);
10148 rem_anchor_token(T___imag__);
10149 rem_anchor_token(T___func__);
10150 rem_anchor_token(T___extension__);
10151 rem_anchor_token(T___builtin_va_start);
10152 rem_anchor_token(T___attribute__);
10153 rem_anchor_token(T___alignof__);
10154 rem_anchor_token(T___PRETTY_FUNCTION__);
10155 rem_anchor_token(T___FUNCTION__);
10156 rem_anchor_token(T__Imaginary);
10157 rem_anchor_token(T__Complex);
10158 rem_anchor_token(T__Bool);
10159 rem_anchor_token(T_WIDE_STRING_LITERAL);
10160 rem_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10161 rem_anchor_token(T_STRING_LITERAL);
10162 rem_anchor_token(T_PLUSPLUS);
10163 rem_anchor_token(T_MINUSMINUS);
10164 rem_anchor_token(T_INTEGER);
10165 rem_anchor_token(T_IDENTIFIER);
10166 rem_anchor_token(T_FLOATINGPOINT);
10167 rem_anchor_token(T_COLONCOLON);
10168 rem_anchor_token(T_CHARACTER_CONSTANT);
10169 rem_anchor_token('~');
10170 rem_anchor_token('{');
10171 rem_anchor_token(';');
10172 rem_anchor_token('-');
10173 rem_anchor_token('+');
10174 rem_anchor_token('*');
10175 rem_anchor_token('(');
10176 rem_anchor_token('&');
10177 rem_anchor_token('!');
10178 rem_anchor_token('}');
10186 * Check for unused global static functions and variables
10188 static void check_unused_globals(void)
10190 if (!is_warn_on(WARN_UNUSED_FUNCTION) && !is_warn_on(WARN_UNUSED_VARIABLE))
10193 for (const entity_t *entity = file_scope->entities; entity != NULL;
10194 entity = entity->base.next) {
10195 if (!is_declaration(entity))
10198 const declaration_t *declaration = &entity->declaration;
10199 if (declaration->used ||
10200 declaration->modifiers & DM_UNUSED ||
10201 declaration->modifiers & DM_USED ||
10202 declaration->storage_class != STORAGE_CLASS_STATIC)
10207 if (entity->kind == ENTITY_FUNCTION) {
10208 /* inhibit warning for static inline functions */
10209 if (entity->function.is_inline)
10212 why = WARN_UNUSED_FUNCTION;
10213 s = entity->function.statement != NULL ? "defined" : "declared";
10215 why = WARN_UNUSED_VARIABLE;
10219 warningf(why, &declaration->base.source_position, "'%#N' %s but not used", entity, s);
10223 static void parse_global_asm(void)
10225 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10228 add_anchor_token(';');
10229 add_anchor_token(')');
10230 add_anchor_token(T_STRING_LITERAL);
10233 rem_anchor_token(T_STRING_LITERAL);
10234 statement->asms.asm_text = parse_string_literals();
10235 statement->base.next = unit->global_asm;
10236 unit->global_asm = statement;
10238 rem_anchor_token(')');
10240 rem_anchor_token(';');
10244 static void parse_linkage_specification(void)
10248 source_position_t const pos = *HERE;
10249 char const *const linkage = parse_string_literals().begin;
10251 linkage_kind_t old_linkage = current_linkage;
10252 linkage_kind_t new_linkage;
10253 if (streq(linkage, "C")) {
10254 new_linkage = LINKAGE_C;
10255 } else if (streq(linkage, "C++")) {
10256 new_linkage = LINKAGE_CXX;
10258 errorf(&pos, "linkage string \"%s\" not recognized", linkage);
10259 new_linkage = LINKAGE_C;
10261 current_linkage = new_linkage;
10263 if (next_if('{')) {
10270 assert(current_linkage == new_linkage);
10271 current_linkage = old_linkage;
10274 static void parse_external(void)
10276 switch (token.kind) {
10278 if (look_ahead(1)->kind == T_STRING_LITERAL) {
10279 parse_linkage_specification();
10281 DECLARATION_START_NO_EXTERN
10283 case T___extension__:
10284 /* tokens below are for implicit int */
10285 case '&': /* & x; -> int& x; (and error later, because C++ has no
10287 case '*': /* * x; -> int* x; */
10288 case '(': /* (x); -> int (x); */
10290 parse_external_declaration();
10296 parse_global_asm();
10300 parse_namespace_definition();
10304 if (!strict_mode) {
10305 warningf(WARN_STRAY_SEMICOLON, HERE, "stray ';' outside of function");
10312 errorf(HERE, "stray %K outside of function", &token);
10313 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10314 eat_until_matching_token(token.kind);
10320 static void parse_externals(void)
10322 add_anchor_token('}');
10323 add_anchor_token(T_EOF);
10326 /* make a copy of the anchor set, so we can check if it is restored after parsing */
10327 unsigned short token_anchor_copy[T_LAST_TOKEN];
10328 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10331 while (token.kind != T_EOF && token.kind != '}') {
10333 for (int i = 0; i < T_LAST_TOKEN; ++i) {
10334 unsigned short count = token_anchor_set[i] - token_anchor_copy[i];
10336 /* the anchor set and its copy differs */
10337 internal_errorf(HERE, "Leaked anchor token %k %d times", i, count);
10340 if (in_gcc_extension) {
10341 /* an gcc extension scope was not closed */
10342 internal_errorf(HERE, "Leaked __extension__");
10349 rem_anchor_token(T_EOF);
10350 rem_anchor_token('}');
10354 * Parse a translation unit.
10356 static void parse_translation_unit(void)
10358 add_anchor_token(T_EOF);
10363 if (token.kind == T_EOF)
10366 errorf(HERE, "stray %K outside of function", &token);
10367 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10368 eat_until_matching_token(token.kind);
10373 void set_default_visibility(elf_visibility_tag_t visibility)
10375 default_visibility = visibility;
10381 * @return the translation unit or NULL if errors occurred.
10383 void start_parsing(void)
10385 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10386 label_stack = NEW_ARR_F(stack_entry_t, 0);
10387 diagnostic_count = 0;
10391 print_to_file(stderr);
10393 assert(unit == NULL);
10394 unit = allocate_ast_zero(sizeof(unit[0]));
10396 assert(file_scope == NULL);
10397 file_scope = &unit->scope;
10399 assert(current_scope == NULL);
10400 scope_push(&unit->scope);
10402 create_gnu_builtins();
10404 create_microsoft_intrinsics();
10407 translation_unit_t *finish_parsing(void)
10409 assert(current_scope == &unit->scope);
10412 assert(file_scope == &unit->scope);
10413 check_unused_globals();
10416 DEL_ARR_F(environment_stack);
10417 DEL_ARR_F(label_stack);
10419 translation_unit_t *result = unit;
10424 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
10425 * are given length one. */
10426 static void complete_incomplete_arrays(void)
10428 size_t n = ARR_LEN(incomplete_arrays);
10429 for (size_t i = 0; i != n; ++i) {
10430 declaration_t *const decl = incomplete_arrays[i];
10431 type_t *const type = skip_typeref(decl->type);
10433 if (!is_type_incomplete(type))
10436 source_position_t const *const pos = &decl->base.source_position;
10437 warningf(WARN_OTHER, pos, "array '%#N' assumed to have one element", (entity_t const*)decl);
10439 type_t *const new_type = duplicate_type(type);
10440 new_type->array.size_constant = true;
10441 new_type->array.has_implicit_size = true;
10442 new_type->array.size = 1;
10444 type_t *const result = identify_new_type(new_type);
10446 decl->type = result;
10450 void prepare_main_collect2(entity_t *entity)
10452 PUSH_SCOPE(&entity->function.statement->compound.scope);
10454 // create call to __main
10455 symbol_t *symbol = symbol_table_insert("__main");
10456 entity_t *subsubmain_ent
10457 = create_implicit_function(symbol, &builtin_source_position);
10459 expression_t *ref = allocate_expression_zero(EXPR_REFERENCE);
10460 type_t *ftype = subsubmain_ent->declaration.type;
10461 ref->base.source_position = builtin_source_position;
10462 ref->base.type = make_pointer_type(ftype, TYPE_QUALIFIER_NONE);
10463 ref->reference.entity = subsubmain_ent;
10465 expression_t *call = allocate_expression_zero(EXPR_CALL);
10466 call->base.source_position = builtin_source_position;
10467 call->base.type = type_void;
10468 call->call.function = ref;
10470 statement_t *expr_statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10471 expr_statement->base.source_position = builtin_source_position;
10472 expr_statement->expression.expression = call;
10474 statement_t *statement = entity->function.statement;
10475 assert(statement->kind == STATEMENT_COMPOUND);
10476 compound_statement_t *compounds = &statement->compound;
10478 expr_statement->base.next = compounds->statements;
10479 compounds->statements = expr_statement;
10486 lookahead_bufpos = 0;
10487 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10490 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
10491 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
10492 parse_translation_unit();
10493 complete_incomplete_arrays();
10494 DEL_ARR_F(incomplete_arrays);
10495 incomplete_arrays = NULL;
10499 * Initialize the parser.
10501 void init_parser(void)
10503 sym_anonymous = symbol_table_insert("<anonymous>");
10505 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10507 init_expression_parsers();
10508 obstack_init(&temp_obst);
10512 * Terminate the parser.
10514 void exit_parser(void)
10516 obstack_free(&temp_obst, NULL);