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_CURRENT_ENTITY(entity) \
113 entity_t *const new_current_entity = (entity); \
114 entity_t *const old_current_entity = current_entity; \
115 ((void)(current_entity = new_current_entity))
116 #define POP_CURRENT_ENTITY() (assert(current_entity == new_current_entity), (void)(current_entity = old_current_entity))
118 #define PUSH_PARENT(stmt) \
119 statement_t *const new_parent = (stmt); \
120 statement_t *const old_parent = current_parent; \
121 ((void)(current_parent = new_parent))
122 #define POP_PARENT() (assert(current_parent == new_parent), (void)(current_parent = old_parent))
124 #define PUSH_SCOPE(scope) \
125 size_t const top = environment_top(); \
126 scope_t *const new_scope = (scope); \
127 scope_t *const old_scope = (new_scope ? scope_push(new_scope) : NULL)
128 #define PUSH_SCOPE_STATEMENT(scope) PUSH_SCOPE(c_mode & (_C99 | _CXX) ? (scope) : NULL)
129 #define POP_SCOPE() (new_scope ? assert(current_scope == new_scope), scope_pop(old_scope), environment_pop_to(top) : (void)0)
131 #define PUSH_EXTENSION() \
133 bool const old_gcc_extension = in_gcc_extension; \
134 while (next_if(T___extension__)) { \
135 in_gcc_extension = true; \
138 #define POP_EXTENSION() \
139 ((void)(in_gcc_extension = old_gcc_extension))
141 /** special symbol used for anonymous entities. */
142 static symbol_t *sym_anonymous = NULL;
144 /** The token anchor set */
145 static unsigned short token_anchor_set[T_LAST_TOKEN];
147 /** The current source position. */
148 #define HERE (&token.base.source_position)
150 /** true if we are in GCC mode. */
151 #define GNU_MODE ((c_mode & _GNUC) || in_gcc_extension)
153 static statement_t *parse_compound_statement(bool inside_expression_statement);
154 static statement_t *parse_statement(void);
156 static expression_t *parse_subexpression(precedence_t);
157 static expression_t *parse_expression(void);
158 static type_t *parse_typename(void);
159 static void parse_externals(void);
160 static void parse_external(void);
162 static void parse_compound_type_entries(compound_t *compound_declaration);
164 static void check_call_argument(type_t *expected_type,
165 call_argument_t *argument, unsigned pos);
167 typedef enum declarator_flags_t {
169 DECL_MAY_BE_ABSTRACT = 1U << 0,
170 DECL_CREATE_COMPOUND_MEMBER = 1U << 1,
171 DECL_IS_PARAMETER = 1U << 2
172 } declarator_flags_t;
174 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
175 declarator_flags_t flags);
177 static void semantic_comparison(binary_expression_t *expression);
179 #define STORAGE_CLASSES \
180 STORAGE_CLASSES_NO_EXTERN \
183 #define STORAGE_CLASSES_NO_EXTERN \
190 #define TYPE_QUALIFIERS \
195 case T__forceinline: \
196 case T___attribute__:
198 #define COMPLEX_SPECIFIERS \
200 #define IMAGINARY_SPECIFIERS \
203 #define TYPE_SPECIFIERS \
205 case T___builtin_va_list: \
230 #define DECLARATION_START \
235 #define DECLARATION_START_NO_EXTERN \
236 STORAGE_CLASSES_NO_EXTERN \
240 #define EXPRESSION_START \
249 case T_CHARACTER_CONSTANT: \
250 case T_FLOATINGPOINT: \
254 case T_STRING_LITERAL: \
255 case T_WIDE_CHARACTER_CONSTANT: \
256 case T_WIDE_STRING_LITERAL: \
257 case T___FUNCDNAME__: \
258 case T___FUNCSIG__: \
259 case T___FUNCTION__: \
260 case T___PRETTY_FUNCTION__: \
261 case T___alignof__: \
262 case T___builtin_classify_type: \
263 case T___builtin_constant_p: \
264 case T___builtin_isgreater: \
265 case T___builtin_isgreaterequal: \
266 case T___builtin_isless: \
267 case T___builtin_islessequal: \
268 case T___builtin_islessgreater: \
269 case T___builtin_isunordered: \
270 case T___builtin_offsetof: \
271 case T___builtin_va_arg: \
272 case T___builtin_va_copy: \
273 case T___builtin_va_start: \
284 * Returns the size of a statement node.
286 * @param kind the statement kind
288 static size_t get_statement_struct_size(statement_kind_t kind)
290 static const size_t sizes[] = {
291 [STATEMENT_ERROR] = sizeof(statement_base_t),
292 [STATEMENT_EMPTY] = sizeof(statement_base_t),
293 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
294 [STATEMENT_RETURN] = sizeof(return_statement_t),
295 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
296 [STATEMENT_IF] = sizeof(if_statement_t),
297 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
298 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
299 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
300 [STATEMENT_BREAK] = sizeof(statement_base_t),
301 [STATEMENT_COMPUTED_GOTO] = sizeof(computed_goto_statement_t),
302 [STATEMENT_GOTO] = sizeof(goto_statement_t),
303 [STATEMENT_LABEL] = sizeof(label_statement_t),
304 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
305 [STATEMENT_WHILE] = sizeof(while_statement_t),
306 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
307 [STATEMENT_FOR] = sizeof(for_statement_t),
308 [STATEMENT_ASM] = sizeof(asm_statement_t),
309 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
310 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
312 assert((size_t)kind < lengthof(sizes));
313 assert(sizes[kind] != 0);
318 * Returns the size of an expression node.
320 * @param kind the expression kind
322 static size_t get_expression_struct_size(expression_kind_t kind)
324 static const size_t sizes[] = {
325 [EXPR_ERROR] = sizeof(expression_base_t),
326 [EXPR_REFERENCE] = sizeof(reference_expression_t),
327 [EXPR_ENUM_CONSTANT] = sizeof(reference_expression_t),
328 [EXPR_LITERAL_BOOLEAN] = sizeof(literal_expression_t),
329 [EXPR_LITERAL_INTEGER] = sizeof(literal_expression_t),
330 [EXPR_LITERAL_FLOATINGPOINT] = 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 = *HERE;
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 = *HERE;
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 #define eat(token_kind) (assert(token.kind == (token_kind)), next_token())
492 static inline bool next_if(token_kind_t const type)
494 if (token.kind == type) {
503 * Return the next token with a given lookahead.
505 static inline const token_t *look_ahead(size_t num)
507 assert(0 < num && num <= MAX_LOOKAHEAD);
508 size_t pos = (lookahead_bufpos + num - 1) % MAX_LOOKAHEAD;
509 return &lookahead_buffer[pos];
513 * Adds a token type to the token type anchor set (a multi-set).
515 static void add_anchor_token(token_kind_t const token_kind)
517 assert(token_kind < T_LAST_TOKEN);
518 ++token_anchor_set[token_kind];
522 * Remove a token type from the token type anchor set (a multi-set).
524 static void rem_anchor_token(token_kind_t const token_kind)
526 assert(token_kind < T_LAST_TOKEN);
527 assert(token_anchor_set[token_kind] != 0);
528 --token_anchor_set[token_kind];
532 * Eat tokens until a matching token type is found.
534 static void eat_until_matching_token(token_kind_t const type)
536 token_kind_t end_token;
538 case '(': end_token = ')'; break;
539 case '{': end_token = '}'; break;
540 case '[': end_token = ']'; break;
541 default: end_token = type; break;
544 unsigned parenthesis_count = 0;
545 unsigned brace_count = 0;
546 unsigned bracket_count = 0;
547 while (token.kind != end_token ||
548 parenthesis_count != 0 ||
550 bracket_count != 0) {
551 switch (token.kind) {
553 case '(': ++parenthesis_count; break;
554 case '{': ++brace_count; break;
555 case '[': ++bracket_count; break;
558 if (parenthesis_count > 0)
568 if (bracket_count > 0)
571 if (token.kind == end_token &&
572 parenthesis_count == 0 &&
586 * Eat input tokens until an anchor is found.
588 static void eat_until_anchor(void)
590 while (token_anchor_set[token.kind] == 0) {
591 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
592 eat_until_matching_token(token.kind);
598 * Eat a whole block from input tokens.
600 static void eat_block(void)
602 eat_until_matching_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.base.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;
1050 eat(T_STRING_LITERAL);
1052 while (token.kind == T_STRING_LITERAL) {
1053 warn_string_concat(HERE);
1054 result = concat_strings(&result, &token.string.string);
1055 eat(T_STRING_LITERAL);
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 argument->kind = ATTRIBUTE_ARGUMENT_SYMBOL;
1108 argument->v.symbol = token.base.symbol;
1111 /* must be an expression */
1112 expression_t *expression = parse_assignment_expression();
1114 argument->kind = ATTRIBUTE_ARGUMENT_EXPRESSION;
1115 argument->v.expression = expression;
1118 /* append argument */
1120 anchor = &argument->next;
1121 } while (next_if(','));
1126 static attribute_t *parse_attribute_asm(void)
1128 attribute_t *attribute = allocate_attribute_zero(ATTRIBUTE_GNU_ASM);
1131 attribute->a.arguments = parse_attribute_arguments();
1135 static attribute_t *parse_attribute_gnu_single(void)
1137 /* parse "any-word" */
1138 symbol_t *const symbol = token.base.symbol;
1139 if (symbol == NULL) {
1140 parse_error_expected("while parsing attribute((", T_IDENTIFIER, NULL);
1144 attribute_kind_t kind;
1145 char const *const name = symbol->string;
1146 for (kind = ATTRIBUTE_GNU_FIRST;; ++kind) {
1147 if (kind > ATTRIBUTE_GNU_LAST) {
1148 warningf(WARN_ATTRIBUTE, HERE, "unknown attribute '%s' ignored", name);
1149 /* TODO: we should still save the attribute in the list... */
1150 kind = ATTRIBUTE_UNKNOWN;
1154 const char *attribute_name = get_attribute_name(kind);
1155 if (attribute_name != NULL && streq_underscore(attribute_name, name))
1159 attribute_t *attribute = allocate_attribute_zero(kind);
1162 /* parse arguments */
1164 attribute->a.arguments = parse_attribute_arguments();
1169 static attribute_t *parse_attribute_gnu(void)
1171 attribute_t *first = NULL;
1172 attribute_t **anchor = &first;
1174 eat(T___attribute__);
1175 add_anchor_token(')');
1176 add_anchor_token(',');
1180 if (token.kind != ')') do {
1181 attribute_t *attribute = parse_attribute_gnu_single();
1183 *anchor = attribute;
1184 anchor = &attribute->next;
1186 } while (next_if(','));
1187 rem_anchor_token(',');
1188 rem_anchor_token(')');
1195 /** Parse attributes. */
1196 static attribute_t *parse_attributes(attribute_t *first)
1198 attribute_t **anchor = &first;
1200 while (*anchor != NULL)
1201 anchor = &(*anchor)->next;
1203 attribute_t *attribute;
1204 switch (token.kind) {
1205 case T___attribute__:
1206 attribute = parse_attribute_gnu();
1207 if (attribute == NULL)
1212 attribute = parse_attribute_asm();
1216 attribute = allocate_attribute_zero(ATTRIBUTE_MS_CDECL);
1221 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FASTCALL);
1225 case T__forceinline:
1226 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FORCEINLINE);
1227 eat(T__forceinline);
1231 attribute = allocate_attribute_zero(ATTRIBUTE_MS_STDCALL);
1236 /* TODO record modifier */
1237 warningf(WARN_OTHER, HERE, "Ignoring declaration modifier %K", &token);
1238 attribute = allocate_attribute_zero(ATTRIBUTE_MS_THISCALL);
1246 *anchor = attribute;
1247 anchor = &attribute->next;
1251 static void mark_vars_read(expression_t *expr, entity_t *lhs_ent);
1253 static entity_t *determine_lhs_ent(expression_t *const expr,
1256 switch (expr->kind) {
1257 case EXPR_REFERENCE: {
1258 entity_t *const entity = expr->reference.entity;
1259 /* we should only find variables as lvalues... */
1260 if (entity->base.kind != ENTITY_VARIABLE
1261 && entity->base.kind != ENTITY_PARAMETER)
1267 case EXPR_ARRAY_ACCESS: {
1268 expression_t *const ref = expr->array_access.array_ref;
1269 entity_t * ent = NULL;
1270 if (is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1271 ent = determine_lhs_ent(ref, lhs_ent);
1274 mark_vars_read(ref, lhs_ent);
1276 mark_vars_read(expr->array_access.index, lhs_ent);
1281 mark_vars_read(expr->select.compound, lhs_ent);
1282 if (is_type_compound(skip_typeref(expr->base.type)))
1283 return determine_lhs_ent(expr->select.compound, lhs_ent);
1287 case EXPR_UNARY_DEREFERENCE: {
1288 expression_t *const val = expr->unary.value;
1289 if (val->kind == EXPR_UNARY_TAKE_ADDRESS) {
1291 return determine_lhs_ent(val->unary.value, lhs_ent);
1293 mark_vars_read(val, NULL);
1299 mark_vars_read(expr, NULL);
1304 #define ENT_ANY ((entity_t*)-1)
1307 * Mark declarations, which are read. This is used to detect variables, which
1311 * x is not marked as "read", because it is only read to calculate its own new
1315 * x and y are not detected as "not read", because multiple variables are
1318 static void mark_vars_read(expression_t *const expr, entity_t *lhs_ent)
1320 switch (expr->kind) {
1321 case EXPR_REFERENCE: {
1322 entity_t *const entity = expr->reference.entity;
1323 if (entity->kind != ENTITY_VARIABLE
1324 && entity->kind != ENTITY_PARAMETER)
1327 if (lhs_ent != entity && lhs_ent != ENT_ANY) {
1328 entity->variable.read = true;
1334 // TODO respect pure/const
1335 mark_vars_read(expr->call.function, NULL);
1336 for (call_argument_t *arg = expr->call.arguments; arg != NULL; arg = arg->next) {
1337 mark_vars_read(arg->expression, NULL);
1341 case EXPR_CONDITIONAL:
1342 // TODO lhs_decl should depend on whether true/false have an effect
1343 mark_vars_read(expr->conditional.condition, NULL);
1344 if (expr->conditional.true_expression != NULL)
1345 mark_vars_read(expr->conditional.true_expression, lhs_ent);
1346 mark_vars_read(expr->conditional.false_expression, lhs_ent);
1350 if (lhs_ent == ENT_ANY
1351 && !is_type_compound(skip_typeref(expr->base.type)))
1353 mark_vars_read(expr->select.compound, lhs_ent);
1356 case EXPR_ARRAY_ACCESS: {
1357 mark_vars_read(expr->array_access.index, lhs_ent);
1358 expression_t *const ref = expr->array_access.array_ref;
1359 if (!is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1360 if (lhs_ent == ENT_ANY)
1363 mark_vars_read(ref, lhs_ent);
1368 mark_vars_read(expr->va_arge.ap, lhs_ent);
1372 mark_vars_read(expr->va_copye.src, lhs_ent);
1375 case EXPR_UNARY_CAST:
1376 /* Special case: Use void cast to mark a variable as "read" */
1377 if (is_type_void(skip_typeref(expr->base.type)))
1382 case EXPR_UNARY_THROW:
1383 if (expr->unary.value == NULL)
1386 case EXPR_UNARY_DEREFERENCE:
1387 case EXPR_UNARY_DELETE:
1388 case EXPR_UNARY_DELETE_ARRAY:
1389 if (lhs_ent == ENT_ANY)
1393 case EXPR_UNARY_NEGATE:
1394 case EXPR_UNARY_PLUS:
1395 case EXPR_UNARY_BITWISE_NEGATE:
1396 case EXPR_UNARY_NOT:
1397 case EXPR_UNARY_TAKE_ADDRESS:
1398 case EXPR_UNARY_POSTFIX_INCREMENT:
1399 case EXPR_UNARY_POSTFIX_DECREMENT:
1400 case EXPR_UNARY_PREFIX_INCREMENT:
1401 case EXPR_UNARY_PREFIX_DECREMENT:
1402 case EXPR_UNARY_ASSUME:
1404 mark_vars_read(expr->unary.value, lhs_ent);
1407 case EXPR_BINARY_ADD:
1408 case EXPR_BINARY_SUB:
1409 case EXPR_BINARY_MUL:
1410 case EXPR_BINARY_DIV:
1411 case EXPR_BINARY_MOD:
1412 case EXPR_BINARY_EQUAL:
1413 case EXPR_BINARY_NOTEQUAL:
1414 case EXPR_BINARY_LESS:
1415 case EXPR_BINARY_LESSEQUAL:
1416 case EXPR_BINARY_GREATER:
1417 case EXPR_BINARY_GREATEREQUAL:
1418 case EXPR_BINARY_BITWISE_AND:
1419 case EXPR_BINARY_BITWISE_OR:
1420 case EXPR_BINARY_BITWISE_XOR:
1421 case EXPR_BINARY_LOGICAL_AND:
1422 case EXPR_BINARY_LOGICAL_OR:
1423 case EXPR_BINARY_SHIFTLEFT:
1424 case EXPR_BINARY_SHIFTRIGHT:
1425 case EXPR_BINARY_COMMA:
1426 case EXPR_BINARY_ISGREATER:
1427 case EXPR_BINARY_ISGREATEREQUAL:
1428 case EXPR_BINARY_ISLESS:
1429 case EXPR_BINARY_ISLESSEQUAL:
1430 case EXPR_BINARY_ISLESSGREATER:
1431 case EXPR_BINARY_ISUNORDERED:
1432 mark_vars_read(expr->binary.left, lhs_ent);
1433 mark_vars_read(expr->binary.right, lhs_ent);
1436 case EXPR_BINARY_ASSIGN:
1437 case EXPR_BINARY_MUL_ASSIGN:
1438 case EXPR_BINARY_DIV_ASSIGN:
1439 case EXPR_BINARY_MOD_ASSIGN:
1440 case EXPR_BINARY_ADD_ASSIGN:
1441 case EXPR_BINARY_SUB_ASSIGN:
1442 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
1443 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
1444 case EXPR_BINARY_BITWISE_AND_ASSIGN:
1445 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
1446 case EXPR_BINARY_BITWISE_OR_ASSIGN: {
1447 if (lhs_ent == ENT_ANY)
1449 lhs_ent = determine_lhs_ent(expr->binary.left, lhs_ent);
1450 mark_vars_read(expr->binary.right, lhs_ent);
1455 determine_lhs_ent(expr->va_starte.ap, lhs_ent);
1458 case EXPR_LITERAL_CASES:
1460 case EXPR_STRING_LITERAL:
1461 case EXPR_WIDE_STRING_LITERAL:
1462 case EXPR_COMPOUND_LITERAL: // TODO init?
1464 case EXPR_CLASSIFY_TYPE:
1467 case EXPR_BUILTIN_CONSTANT_P:
1468 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
1470 case EXPR_STATEMENT: // TODO
1471 case EXPR_LABEL_ADDRESS:
1472 case EXPR_ENUM_CONSTANT:
1476 panic("unhandled expression");
1479 static designator_t *parse_designation(void)
1481 designator_t *result = NULL;
1482 designator_t **anchor = &result;
1485 designator_t *designator;
1486 switch (token.kind) {
1488 designator = allocate_ast_zero(sizeof(designator[0]));
1489 designator->source_position = *HERE;
1491 add_anchor_token(']');
1492 designator->array_index = parse_constant_expression();
1493 rem_anchor_token(']');
1497 designator = allocate_ast_zero(sizeof(designator[0]));
1498 designator->source_position = *HERE;
1500 designator->symbol = expect_identifier("while parsing designator", NULL);
1501 if (!designator->symbol)
1509 assert(designator != NULL);
1510 *anchor = designator;
1511 anchor = &designator->next;
1515 static initializer_t *initializer_from_string(array_type_t *const type,
1516 const string_t *const string)
1518 /* TODO: check len vs. size of array type */
1521 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
1522 initializer->string.string = *string;
1527 static initializer_t *initializer_from_wide_string(array_type_t *const type,
1528 const string_t *const string)
1530 /* TODO: check len vs. size of array type */
1533 initializer_t *const initializer =
1534 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
1535 initializer->wide_string.string = *string;
1541 * Build an initializer from a given expression.
1543 static initializer_t *initializer_from_expression(type_t *orig_type,
1544 expression_t *expression)
1546 /* TODO check that expression is a constant expression */
1548 /* §6.7.8.14/15 char array may be initialized by string literals */
1549 type_t *type = skip_typeref(orig_type);
1550 type_t *expr_type_orig = expression->base.type;
1551 type_t *expr_type = skip_typeref(expr_type_orig);
1553 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
1554 array_type_t *const array_type = &type->array;
1555 type_t *const element_type = skip_typeref(array_type->element_type);
1557 if (element_type->kind == TYPE_ATOMIC) {
1558 atomic_type_kind_t akind = element_type->atomic.akind;
1559 switch (expression->kind) {
1560 case EXPR_STRING_LITERAL:
1561 if (akind == ATOMIC_TYPE_CHAR
1562 || akind == ATOMIC_TYPE_SCHAR
1563 || akind == ATOMIC_TYPE_UCHAR) {
1564 return initializer_from_string(array_type,
1565 &expression->string_literal.value);
1569 case EXPR_WIDE_STRING_LITERAL: {
1570 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
1571 if (get_unqualified_type(element_type) == bare_wchar_type) {
1572 return initializer_from_wide_string(array_type,
1573 &expression->string_literal.value);
1584 assign_error_t error = semantic_assign(type, expression);
1585 if (error == ASSIGN_ERROR_INCOMPATIBLE)
1587 report_assign_error(error, type, expression, "initializer",
1588 &expression->base.source_position);
1590 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
1591 result->value.value = create_implicit_cast(expression, type);
1597 * Parses an scalar initializer.
1599 * §6.7.8.11; eat {} without warning
1601 static initializer_t *parse_scalar_initializer(type_t *type,
1602 bool must_be_constant)
1604 /* there might be extra {} hierarchies */
1606 if (token.kind == '{') {
1607 warningf(WARN_OTHER, HERE, "extra curly braces around scalar initializer");
1611 } while (token.kind == '{');
1614 expression_t *expression = parse_assignment_expression();
1615 mark_vars_read(expression, NULL);
1616 if (must_be_constant && !is_linker_constant(expression)) {
1617 errorf(&expression->base.source_position,
1618 "initialisation expression '%E' is not constant",
1622 initializer_t *initializer = initializer_from_expression(type, expression);
1624 if (initializer == NULL) {
1625 errorf(&expression->base.source_position,
1626 "expression '%E' (type '%T') doesn't match expected type '%T'",
1627 expression, expression->base.type, type);
1632 bool additional_warning_displayed = false;
1633 while (braces > 0) {
1635 if (token.kind != '}') {
1636 if (!additional_warning_displayed) {
1637 warningf(WARN_OTHER, HERE, "additional elements in scalar initializer");
1638 additional_warning_displayed = true;
1649 * An entry in the type path.
1651 typedef struct type_path_entry_t type_path_entry_t;
1652 struct type_path_entry_t {
1653 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
1655 size_t index; /**< For array types: the current index. */
1656 declaration_t *compound_entry; /**< For compound types: the current declaration. */
1661 * A type path expression a position inside compound or array types.
1663 typedef struct type_path_t type_path_t;
1664 struct type_path_t {
1665 type_path_entry_t *path; /**< An flexible array containing the current path. */
1666 type_t *top_type; /**< type of the element the path points */
1667 size_t max_index; /**< largest index in outermost array */
1671 * Prints a type path for debugging.
1673 static __attribute__((unused)) void debug_print_type_path(
1674 const type_path_t *path)
1676 size_t len = ARR_LEN(path->path);
1678 for (size_t i = 0; i < len; ++i) {
1679 const type_path_entry_t *entry = & path->path[i];
1681 type_t *type = skip_typeref(entry->type);
1682 if (is_type_compound(type)) {
1683 /* in gcc mode structs can have no members */
1684 if (entry->v.compound_entry == NULL) {
1688 fprintf(stderr, ".%s",
1689 entry->v.compound_entry->base.symbol->string);
1690 } else if (is_type_array(type)) {
1691 fprintf(stderr, "[%u]", (unsigned) entry->v.index);
1693 fprintf(stderr, "-INVALID-");
1696 if (path->top_type != NULL) {
1697 fprintf(stderr, " (");
1698 print_type(path->top_type);
1699 fprintf(stderr, ")");
1704 * Return the top type path entry, ie. in a path
1705 * (type).a.b returns the b.
1707 static type_path_entry_t *get_type_path_top(const type_path_t *path)
1709 size_t len = ARR_LEN(path->path);
1711 return &path->path[len-1];
1715 * Enlarge the type path by an (empty) element.
1717 static type_path_entry_t *append_to_type_path(type_path_t *path)
1719 size_t len = ARR_LEN(path->path);
1720 ARR_RESIZE(type_path_entry_t, path->path, len+1);
1722 type_path_entry_t *result = & path->path[len];
1723 memset(result, 0, sizeof(result[0]));
1728 * Descending into a sub-type. Enter the scope of the current top_type.
1730 static void descend_into_subtype(type_path_t *path)
1732 type_t *orig_top_type = path->top_type;
1733 type_t *top_type = skip_typeref(orig_top_type);
1735 type_path_entry_t *top = append_to_type_path(path);
1736 top->type = top_type;
1738 if (is_type_compound(top_type)) {
1739 compound_t *const compound = top_type->compound.compound;
1740 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
1742 if (entry != NULL) {
1743 top->v.compound_entry = &entry->declaration;
1744 path->top_type = entry->declaration.type;
1746 path->top_type = NULL;
1748 } else if (is_type_array(top_type)) {
1750 path->top_type = top_type->array.element_type;
1752 assert(!is_type_valid(top_type));
1757 * Pop an entry from the given type path, ie. returning from
1758 * (type).a.b to (type).a
1760 static void ascend_from_subtype(type_path_t *path)
1762 type_path_entry_t *top = get_type_path_top(path);
1764 path->top_type = top->type;
1766 size_t len = ARR_LEN(path->path);
1767 ARR_RESIZE(type_path_entry_t, path->path, len-1);
1771 * Pop entries from the given type path until the given
1772 * path level is reached.
1774 static void ascend_to(type_path_t *path, size_t top_path_level)
1776 size_t len = ARR_LEN(path->path);
1778 while (len > top_path_level) {
1779 ascend_from_subtype(path);
1780 len = ARR_LEN(path->path);
1784 static bool walk_designator(type_path_t *path, const designator_t *designator,
1785 bool used_in_offsetof)
1787 for (; designator != NULL; designator = designator->next) {
1788 type_path_entry_t *top = get_type_path_top(path);
1789 type_t *orig_type = top->type;
1791 type_t *type = skip_typeref(orig_type);
1793 if (designator->symbol != NULL) {
1794 symbol_t *symbol = designator->symbol;
1795 if (!is_type_compound(type)) {
1796 if (is_type_valid(type)) {
1797 errorf(&designator->source_position,
1798 "'.%Y' designator used for non-compound type '%T'",
1802 top->type = type_error_type;
1803 top->v.compound_entry = NULL;
1804 orig_type = type_error_type;
1806 compound_t *compound = type->compound.compound;
1807 entity_t *iter = compound->members.entities;
1808 for (; iter != NULL; iter = iter->base.next) {
1809 if (iter->base.symbol == symbol) {
1814 errorf(&designator->source_position,
1815 "'%T' has no member named '%Y'", orig_type, symbol);
1818 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
1819 if (used_in_offsetof && iter->compound_member.bitfield) {
1820 errorf(&designator->source_position,
1821 "offsetof designator '%Y' must not specify bitfield",
1826 top->type = orig_type;
1827 top->v.compound_entry = &iter->declaration;
1828 orig_type = iter->declaration.type;
1831 expression_t *array_index = designator->array_index;
1832 assert(designator->array_index != NULL);
1834 if (!is_type_array(type)) {
1835 if (is_type_valid(type)) {
1836 errorf(&designator->source_position,
1837 "[%E] designator used for non-array type '%T'",
1838 array_index, orig_type);
1843 long index = fold_constant_to_int(array_index);
1844 if (!used_in_offsetof) {
1846 errorf(&designator->source_position,
1847 "array index [%E] must be positive", array_index);
1848 } else if (type->array.size_constant) {
1849 long array_size = type->array.size;
1850 if (index >= array_size) {
1851 errorf(&designator->source_position,
1852 "designator [%E] (%d) exceeds array size %d",
1853 array_index, index, array_size);
1858 top->type = orig_type;
1859 top->v.index = (size_t) index;
1860 orig_type = type->array.element_type;
1862 path->top_type = orig_type;
1864 if (designator->next != NULL) {
1865 descend_into_subtype(path);
1871 static void advance_current_object(type_path_t *path, size_t top_path_level)
1873 type_path_entry_t *top = get_type_path_top(path);
1875 type_t *type = skip_typeref(top->type);
1876 if (is_type_union(type)) {
1877 /* in unions only the first element is initialized */
1878 top->v.compound_entry = NULL;
1879 } else if (is_type_struct(type)) {
1880 declaration_t *entry = top->v.compound_entry;
1882 entity_t *const next_entity = skip_unnamed_bitfields(entry->base.next);
1883 if (next_entity != NULL) {
1884 assert(is_declaration(next_entity));
1885 entry = &next_entity->declaration;
1890 top->v.compound_entry = entry;
1891 if (entry != NULL) {
1892 path->top_type = entry->type;
1895 } else if (is_type_array(type)) {
1896 assert(is_type_array(type));
1900 if (!type->array.size_constant || top->v.index < type->array.size) {
1904 assert(!is_type_valid(type));
1908 /* we're past the last member of the current sub-aggregate, try if we
1909 * can ascend in the type hierarchy and continue with another subobject */
1910 size_t len = ARR_LEN(path->path);
1912 if (len > top_path_level) {
1913 ascend_from_subtype(path);
1914 advance_current_object(path, top_path_level);
1916 path->top_type = NULL;
1921 * skip any {...} blocks until a closing bracket is reached.
1923 static void skip_initializers(void)
1927 while (token.kind != '}') {
1928 if (token.kind == T_EOF)
1930 if (token.kind == '{') {
1938 static initializer_t *create_empty_initializer(void)
1940 static initializer_t empty_initializer
1941 = { .list = { { INITIALIZER_LIST }, 0 } };
1942 return &empty_initializer;
1946 * Parse a part of an initialiser for a struct or union,
1948 static initializer_t *parse_sub_initializer(type_path_t *path,
1949 type_t *outer_type, size_t top_path_level,
1950 parse_initializer_env_t *env)
1952 if (token.kind == '}') {
1953 /* empty initializer */
1954 return create_empty_initializer();
1957 type_t *orig_type = path->top_type;
1958 type_t *type = NULL;
1960 if (orig_type == NULL) {
1961 /* We are initializing an empty compound. */
1963 type = skip_typeref(orig_type);
1966 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
1969 designator_t *designator = NULL;
1970 if (token.kind == '.' || token.kind == '[') {
1971 designator = parse_designation();
1972 goto finish_designator;
1973 } else if (token.kind == T_IDENTIFIER && look_ahead(1)->kind == ':') {
1974 /* GNU-style designator ("identifier: value") */
1975 designator = allocate_ast_zero(sizeof(designator[0]));
1976 designator->source_position = *HERE;
1977 designator->symbol = token.base.symbol;
1982 /* reset path to toplevel, evaluate designator from there */
1983 ascend_to(path, top_path_level);
1984 if (!walk_designator(path, designator, false)) {
1985 /* can't continue after designation error */
1989 initializer_t *designator_initializer
1990 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
1991 designator_initializer->designator.designator = designator;
1992 ARR_APP1(initializer_t*, initializers, designator_initializer);
1994 orig_type = path->top_type;
1995 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2000 if (token.kind == '{') {
2001 if (type != NULL && is_type_scalar(type)) {
2002 sub = parse_scalar_initializer(type, env->must_be_constant);
2005 if (env->entity != NULL) {
2006 errorf(HERE, "extra brace group at end of initializer for '%N'", env->entity);
2008 errorf(HERE, "extra brace group at end of initializer");
2013 descend_into_subtype(path);
2016 add_anchor_token('}');
2017 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2019 rem_anchor_token('}');
2024 goto error_parse_next;
2026 ascend_from_subtype(path);
2029 /* must be an expression */
2030 expression_t *expression = parse_assignment_expression();
2031 mark_vars_read(expression, NULL);
2033 if (env->must_be_constant && !is_linker_constant(expression)) {
2034 errorf(&expression->base.source_position,
2035 "Initialisation expression '%E' is not constant",
2040 /* we are already outside, ... */
2041 if (outer_type == NULL)
2042 goto error_parse_next;
2043 type_t *const outer_type_skip = skip_typeref(outer_type);
2044 if (is_type_compound(outer_type_skip) &&
2045 !outer_type_skip->compound.compound->complete) {
2046 goto error_parse_next;
2049 source_position_t const* const pos = &expression->base.source_position;
2050 if (env->entity != NULL) {
2051 warningf(WARN_OTHER, pos, "excess elements in initializer for '%N'", env->entity);
2053 warningf(WARN_OTHER, pos, "excess elements in initializer");
2055 goto error_parse_next;
2058 /* handle { "string" } special case */
2059 if ((expression->kind == EXPR_STRING_LITERAL
2060 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2061 && outer_type != NULL) {
2062 sub = initializer_from_expression(outer_type, expression);
2065 if (token.kind != '}') {
2066 warningf(WARN_OTHER, HERE, "excessive elements in initializer for type '%T'", orig_type);
2068 /* TODO: eat , ... */
2073 /* descend into subtypes until expression matches type */
2075 orig_type = path->top_type;
2076 type = skip_typeref(orig_type);
2078 sub = initializer_from_expression(orig_type, expression);
2082 if (!is_type_valid(type)) {
2085 if (is_type_scalar(type)) {
2086 errorf(&expression->base.source_position,
2087 "expression '%E' doesn't match expected type '%T'",
2088 expression, orig_type);
2092 descend_into_subtype(path);
2096 /* update largest index of top array */
2097 const type_path_entry_t *first = &path->path[0];
2098 type_t *first_type = first->type;
2099 first_type = skip_typeref(first_type);
2100 if (is_type_array(first_type)) {
2101 size_t index = first->v.index;
2102 if (index > path->max_index)
2103 path->max_index = index;
2106 /* append to initializers list */
2107 ARR_APP1(initializer_t*, initializers, sub);
2110 if (token.kind == '}') {
2113 add_anchor_token('}');
2115 rem_anchor_token('}');
2116 if (token.kind == '}') {
2121 /* advance to the next declaration if we are not at the end */
2122 advance_current_object(path, top_path_level);
2123 orig_type = path->top_type;
2124 if (orig_type != NULL)
2125 type = skip_typeref(orig_type);
2131 size_t len = ARR_LEN(initializers);
2132 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2133 initializer_t *result = allocate_ast_zero(size);
2134 result->kind = INITIALIZER_LIST;
2135 result->list.len = len;
2136 memcpy(&result->list.initializers, initializers,
2137 len * sizeof(initializers[0]));
2139 DEL_ARR_F(initializers);
2140 ascend_to(path, top_path_level+1);
2145 skip_initializers();
2146 DEL_ARR_F(initializers);
2147 ascend_to(path, top_path_level+1);
2151 static expression_t *make_size_literal(size_t value)
2153 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_INTEGER);
2154 literal->base.type = type_size_t;
2157 snprintf(buf, sizeof(buf), "%u", (unsigned) value);
2158 literal->literal.value = make_string(buf);
2164 * Parses an initializer. Parsers either a compound literal
2165 * (env->declaration == NULL) or an initializer of a declaration.
2167 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2169 type_t *type = skip_typeref(env->type);
2170 size_t max_index = 0;
2171 initializer_t *result;
2173 if (is_type_scalar(type)) {
2174 result = parse_scalar_initializer(type, env->must_be_constant);
2175 } else if (token.kind == '{') {
2179 memset(&path, 0, sizeof(path));
2180 path.top_type = env->type;
2181 path.path = NEW_ARR_F(type_path_entry_t, 0);
2183 descend_into_subtype(&path);
2185 add_anchor_token('}');
2186 result = parse_sub_initializer(&path, env->type, 1, env);
2187 rem_anchor_token('}');
2189 max_index = path.max_index;
2190 DEL_ARR_F(path.path);
2194 /* parse_scalar_initializer() also works in this case: we simply
2195 * have an expression without {} around it */
2196 result = parse_scalar_initializer(type, env->must_be_constant);
2199 /* §6.7.8:22 array initializers for arrays with unknown size determine
2200 * the array type size */
2201 if (is_type_array(type) && type->array.size_expression == NULL
2202 && result != NULL) {
2204 switch (result->kind) {
2205 case INITIALIZER_LIST:
2206 assert(max_index != 0xdeadbeaf);
2207 size = max_index + 1;
2210 case INITIALIZER_STRING:
2211 size = result->string.string.size;
2214 case INITIALIZER_WIDE_STRING:
2215 size = result->wide_string.string.size;
2218 case INITIALIZER_DESIGNATOR:
2219 case INITIALIZER_VALUE:
2220 /* can happen for parse errors */
2225 internal_errorf(HERE, "invalid initializer type");
2228 type_t *new_type = duplicate_type(type);
2230 new_type->array.size_expression = make_size_literal(size);
2231 new_type->array.size_constant = true;
2232 new_type->array.has_implicit_size = true;
2233 new_type->array.size = size;
2234 env->type = new_type;
2240 static void append_entity(scope_t *scope, entity_t *entity)
2242 if (scope->last_entity != NULL) {
2243 scope->last_entity->base.next = entity;
2245 scope->entities = entity;
2247 entity->base.parent_entity = current_entity;
2248 scope->last_entity = entity;
2252 static compound_t *parse_compound_type_specifier(bool is_struct)
2254 source_position_t const pos = *HERE;
2255 eat(is_struct ? T_struct : T_union);
2257 symbol_t *symbol = NULL;
2258 entity_t *entity = NULL;
2259 attribute_t *attributes = NULL;
2261 if (token.kind == T___attribute__) {
2262 attributes = parse_attributes(NULL);
2265 entity_kind_tag_t const kind = is_struct ? ENTITY_STRUCT : ENTITY_UNION;
2266 if (token.kind == T_IDENTIFIER) {
2267 /* the compound has a name, check if we have seen it already */
2268 symbol = token.base.symbol;
2269 entity = get_tag(symbol, kind);
2272 if (entity != NULL) {
2273 if (entity->base.parent_scope != current_scope &&
2274 (token.kind == '{' || token.kind == ';')) {
2275 /* we're in an inner scope and have a definition. Shadow
2276 * existing definition in outer scope */
2278 } else if (entity->compound.complete && token.kind == '{') {
2279 source_position_t const *const ppos = &entity->base.source_position;
2280 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2281 /* clear members in the hope to avoid further errors */
2282 entity->compound.members.entities = NULL;
2285 } else if (token.kind != '{') {
2286 char const *const msg =
2287 is_struct ? "while parsing struct type specifier" :
2288 "while parsing union type specifier";
2289 parse_error_expected(msg, T_IDENTIFIER, '{', NULL);
2294 if (entity == NULL) {
2295 entity = allocate_entity_zero(kind, NAMESPACE_TAG, symbol, &pos);
2296 entity->compound.alignment = 1;
2297 entity->base.parent_scope = current_scope;
2298 if (symbol != NULL) {
2299 environment_push(entity);
2301 append_entity(current_scope, entity);
2304 if (token.kind == '{') {
2305 parse_compound_type_entries(&entity->compound);
2307 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2308 if (symbol == NULL) {
2309 assert(anonymous_entity == NULL);
2310 anonymous_entity = entity;
2314 if (attributes != NULL) {
2315 handle_entity_attributes(attributes, entity);
2318 return &entity->compound;
2321 static void parse_enum_entries(type_t *const enum_type)
2325 if (token.kind == '}') {
2326 errorf(HERE, "empty enum not allowed");
2331 add_anchor_token('}');
2332 add_anchor_token(',');
2334 add_anchor_token('=');
2335 source_position_t pos;
2336 symbol_t *const symbol = expect_identifier("while parsing enum entry", &pos);
2337 entity_t *const entity = allocate_entity_zero(ENTITY_ENUM_VALUE, NAMESPACE_NORMAL, symbol, &pos);
2338 entity->enum_value.enum_type = enum_type;
2339 rem_anchor_token('=');
2342 expression_t *value = parse_constant_expression();
2344 value = create_implicit_cast(value, enum_type);
2345 entity->enum_value.value = value;
2350 record_entity(entity, false);
2351 } while (next_if(',') && token.kind != '}');
2352 rem_anchor_token(',');
2353 rem_anchor_token('}');
2358 static type_t *parse_enum_specifier(void)
2360 source_position_t const pos = *HERE;
2365 switch (token.kind) {
2367 symbol = token.base.symbol;
2368 entity = get_tag(symbol, ENTITY_ENUM);
2371 if (entity != NULL) {
2372 if (entity->base.parent_scope != current_scope &&
2373 (token.kind == '{' || token.kind == ';')) {
2374 /* we're in an inner scope and have a definition. Shadow
2375 * existing definition in outer scope */
2377 } else if (entity->enume.complete && token.kind == '{') {
2378 source_position_t const *const ppos = &entity->base.source_position;
2379 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2390 parse_error_expected("while parsing enum type specifier",
2391 T_IDENTIFIER, '{', NULL);
2395 if (entity == NULL) {
2396 entity = allocate_entity_zero(ENTITY_ENUM, NAMESPACE_TAG, symbol, &pos);
2397 entity->base.parent_scope = current_scope;
2400 type_t *const type = allocate_type_zero(TYPE_ENUM);
2401 type->enumt.enume = &entity->enume;
2402 type->enumt.base.akind = ATOMIC_TYPE_INT;
2404 if (token.kind == '{') {
2405 if (symbol != NULL) {
2406 environment_push(entity);
2408 append_entity(current_scope, entity);
2409 entity->enume.complete = true;
2411 parse_enum_entries(type);
2412 parse_attributes(NULL);
2414 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2415 if (symbol == NULL) {
2416 assert(anonymous_entity == NULL);
2417 anonymous_entity = entity;
2419 } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
2420 errorf(HERE, "'%T' used before definition (incomplete enums are a GNU extension)", type);
2427 * if a symbol is a typedef to another type, return true
2429 static bool is_typedef_symbol(symbol_t *symbol)
2431 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
2432 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
2435 static type_t *parse_typeof(void)
2441 add_anchor_token(')');
2444 expression_t *expression = NULL;
2446 switch (token.kind) {
2448 if (is_typedef_symbol(token.base.symbol)) {
2450 type = parse_typename();
2453 expression = parse_expression();
2454 type = revert_automatic_type_conversion(expression);
2459 rem_anchor_token(')');
2462 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
2463 typeof_type->typeoft.expression = expression;
2464 typeof_type->typeoft.typeof_type = type;
2469 typedef enum specifiers_t {
2470 SPECIFIER_SIGNED = 1 << 0,
2471 SPECIFIER_UNSIGNED = 1 << 1,
2472 SPECIFIER_LONG = 1 << 2,
2473 SPECIFIER_INT = 1 << 3,
2474 SPECIFIER_DOUBLE = 1 << 4,
2475 SPECIFIER_CHAR = 1 << 5,
2476 SPECIFIER_WCHAR_T = 1 << 6,
2477 SPECIFIER_SHORT = 1 << 7,
2478 SPECIFIER_LONG_LONG = 1 << 8,
2479 SPECIFIER_FLOAT = 1 << 9,
2480 SPECIFIER_BOOL = 1 << 10,
2481 SPECIFIER_VOID = 1 << 11,
2482 SPECIFIER_INT8 = 1 << 12,
2483 SPECIFIER_INT16 = 1 << 13,
2484 SPECIFIER_INT32 = 1 << 14,
2485 SPECIFIER_INT64 = 1 << 15,
2486 SPECIFIER_INT128 = 1 << 16,
2487 SPECIFIER_COMPLEX = 1 << 17,
2488 SPECIFIER_IMAGINARY = 1 << 18,
2491 static type_t *get_typedef_type(symbol_t *symbol)
2493 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
2494 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
2497 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
2498 type->typedeft.typedefe = &entity->typedefe;
2503 static attribute_t *parse_attribute_ms_property(attribute_t *attribute)
2505 attribute_property_argument_t *const property = allocate_ast_zero(sizeof(*property));
2507 add_anchor_token(')');
2508 add_anchor_token(',');
2512 add_anchor_token('=');
2513 source_position_t pos;
2514 symbol_t *const prop_sym = expect_identifier("while parsing property declspec", &pos);
2515 rem_anchor_token('=');
2517 symbol_t **prop = NULL;
2519 if (streq(prop_sym->string, "put")) {
2520 prop = &property->put_symbol;
2521 } else if (streq(prop_sym->string, "get")) {
2522 prop = &property->get_symbol;
2524 errorf(&pos, "expected put or get in property declspec, but got '%Y'", prop_sym);
2528 add_anchor_token(T_IDENTIFIER);
2530 rem_anchor_token(T_IDENTIFIER);
2532 symbol_t *const sym = expect_identifier("while parsing property declspec", NULL);
2534 *prop = sym ? sym : sym_anonymous;
2535 } while (next_if(','));
2536 rem_anchor_token(',');
2537 rem_anchor_token(')');
2539 attribute->a.property = property;
2545 static attribute_t *parse_microsoft_extended_decl_modifier_single(void)
2547 attribute_kind_t kind = ATTRIBUTE_UNKNOWN;
2548 if (next_if(T_restrict)) {
2549 kind = ATTRIBUTE_MS_RESTRICT;
2550 } else if (token.kind == T_IDENTIFIER) {
2551 char const *const name = token.base.symbol->string;
2552 for (attribute_kind_t k = ATTRIBUTE_MS_FIRST; k <= ATTRIBUTE_MS_LAST;
2554 const char *attribute_name = get_attribute_name(k);
2555 if (attribute_name != NULL && streq(attribute_name, name)) {
2561 if (kind == ATTRIBUTE_UNKNOWN) {
2562 warningf(WARN_ATTRIBUTE, HERE, "unknown __declspec '%s' ignored", name);
2565 parse_error_expected("while parsing __declspec", T_IDENTIFIER, NULL);
2569 attribute_t *attribute = allocate_attribute_zero(kind);
2572 if (kind == ATTRIBUTE_MS_PROPERTY) {
2573 return parse_attribute_ms_property(attribute);
2576 /* parse arguments */
2578 attribute->a.arguments = parse_attribute_arguments();
2583 static attribute_t *parse_microsoft_extended_decl_modifier(attribute_t *first)
2587 add_anchor_token(')');
2589 if (token.kind != ')') {
2590 attribute_t **anchor = &first;
2592 while (*anchor != NULL)
2593 anchor = &(*anchor)->next;
2595 attribute_t *attribute
2596 = parse_microsoft_extended_decl_modifier_single();
2597 if (attribute == NULL)
2600 *anchor = attribute;
2601 anchor = &attribute->next;
2602 } while (next_if(','));
2604 rem_anchor_token(')');
2609 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
2611 entity_t *const entity = allocate_entity_zero(kind, NAMESPACE_NORMAL, symbol, HERE);
2612 if (is_declaration(entity)) {
2613 entity->declaration.type = type_error_type;
2614 entity->declaration.implicit = true;
2615 } else if (kind == ENTITY_TYPEDEF) {
2616 entity->typedefe.type = type_error_type;
2617 entity->typedefe.builtin = true;
2619 if (kind != ENTITY_COMPOUND_MEMBER)
2620 record_entity(entity, false);
2624 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2626 type_t *type = NULL;
2627 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
2628 unsigned type_specifiers = 0;
2629 bool newtype = false;
2630 bool saw_error = false;
2632 memset(specifiers, 0, sizeof(*specifiers));
2633 specifiers->source_position = *HERE;
2636 specifiers->attributes = parse_attributes(specifiers->attributes);
2638 switch (token.kind) {
2640 #define MATCH_STORAGE_CLASS(token, class) \
2642 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
2643 errorf(HERE, "multiple storage classes in declaration specifiers"); \
2645 specifiers->storage_class = class; \
2646 if (specifiers->thread_local) \
2647 goto check_thread_storage_class; \
2651 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
2652 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
2653 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
2654 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
2655 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
2658 specifiers->attributes
2659 = parse_microsoft_extended_decl_modifier(specifiers->attributes);
2663 if (specifiers->thread_local) {
2664 errorf(HERE, "duplicate '__thread'");
2666 specifiers->thread_local = true;
2667 check_thread_storage_class:
2668 switch (specifiers->storage_class) {
2669 case STORAGE_CLASS_EXTERN:
2670 case STORAGE_CLASS_NONE:
2671 case STORAGE_CLASS_STATIC:
2675 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_storage_class;
2676 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_storage_class;
2677 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_storage_class;
2678 wrong_thread_storage_class:
2679 errorf(HERE, "'__thread' used with '%s'", wrong);
2686 /* type qualifiers */
2687 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
2689 qualifiers |= qualifier; \
2693 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
2694 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
2695 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
2696 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
2697 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
2698 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
2699 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
2700 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
2702 /* type specifiers */
2703 #define MATCH_SPECIFIER(token, specifier, name) \
2705 if (type_specifiers & specifier) { \
2706 errorf(HERE, "multiple " name " type specifiers given"); \
2708 type_specifiers |= specifier; \
2713 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
2714 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
2715 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
2716 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
2717 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
2718 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
2719 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
2720 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
2721 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
2722 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
2723 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
2724 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
2725 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
2726 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
2727 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
2728 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
2729 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
2730 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
2734 specifiers->is_inline = true;
2738 case T__forceinline:
2739 eat(T__forceinline);
2740 specifiers->modifiers |= DM_FORCEINLINE;
2745 if (type_specifiers & SPECIFIER_LONG_LONG) {
2746 errorf(HERE, "too many long type specifiers given");
2747 } else if (type_specifiers & SPECIFIER_LONG) {
2748 type_specifiers |= SPECIFIER_LONG_LONG;
2750 type_specifiers |= SPECIFIER_LONG;
2755 #define CHECK_DOUBLE_TYPE() \
2756 (type != NULL ? errorf(HERE, "multiple types in declaration specifiers") : (void)0)
2759 CHECK_DOUBLE_TYPE();
2760 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
2762 type->compound.compound = parse_compound_type_specifier(true);
2765 CHECK_DOUBLE_TYPE();
2766 type = allocate_type_zero(TYPE_COMPOUND_UNION);
2767 type->compound.compound = parse_compound_type_specifier(false);
2770 CHECK_DOUBLE_TYPE();
2771 type = parse_enum_specifier();
2774 CHECK_DOUBLE_TYPE();
2775 type = parse_typeof();
2777 case T___builtin_va_list:
2778 CHECK_DOUBLE_TYPE();
2779 type = duplicate_type(type_valist);
2780 eat(T___builtin_va_list);
2783 case T_IDENTIFIER: {
2784 /* only parse identifier if we haven't found a type yet */
2785 if (type != NULL || type_specifiers != 0) {
2786 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
2787 * declaration, so it doesn't generate errors about expecting '(' or
2789 switch (look_ahead(1)->kind) {
2796 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
2800 errorf(HERE, "discarding stray %K in declaration specifier", &token);
2805 goto finish_specifiers;
2809 type_t *const typedef_type = get_typedef_type(token.base.symbol);
2810 if (typedef_type == NULL) {
2811 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
2812 * declaration, so it doesn't generate 'implicit int' followed by more
2813 * errors later on. */
2814 token_kind_t const la1_type = (token_kind_t)look_ahead(1)->kind;
2820 errorf(HERE, "%K does not name a type", &token);
2822 entity_t *const entity = create_error_entity(token.base.symbol, ENTITY_TYPEDEF);
2824 type = allocate_type_zero(TYPE_TYPEDEF);
2825 type->typedeft.typedefe = &entity->typedefe;
2833 goto finish_specifiers;
2838 type = typedef_type;
2842 /* function specifier */
2844 goto finish_specifiers;
2849 specifiers->attributes = parse_attributes(specifiers->attributes);
2851 if (type == NULL || (saw_error && type_specifiers != 0)) {
2852 atomic_type_kind_t atomic_type;
2854 /* match valid basic types */
2855 switch (type_specifiers) {
2856 case SPECIFIER_VOID:
2857 atomic_type = ATOMIC_TYPE_VOID;
2859 case SPECIFIER_WCHAR_T:
2860 atomic_type = ATOMIC_TYPE_WCHAR_T;
2862 case SPECIFIER_CHAR:
2863 atomic_type = ATOMIC_TYPE_CHAR;
2865 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
2866 atomic_type = ATOMIC_TYPE_SCHAR;
2868 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
2869 atomic_type = ATOMIC_TYPE_UCHAR;
2871 case SPECIFIER_SHORT:
2872 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
2873 case SPECIFIER_SHORT | SPECIFIER_INT:
2874 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
2875 atomic_type = ATOMIC_TYPE_SHORT;
2877 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
2878 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
2879 atomic_type = ATOMIC_TYPE_USHORT;
2882 case SPECIFIER_SIGNED:
2883 case SPECIFIER_SIGNED | SPECIFIER_INT:
2884 atomic_type = ATOMIC_TYPE_INT;
2886 case SPECIFIER_UNSIGNED:
2887 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
2888 atomic_type = ATOMIC_TYPE_UINT;
2890 case SPECIFIER_LONG:
2891 case SPECIFIER_SIGNED | SPECIFIER_LONG:
2892 case SPECIFIER_LONG | SPECIFIER_INT:
2893 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
2894 atomic_type = ATOMIC_TYPE_LONG;
2896 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
2897 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
2898 atomic_type = ATOMIC_TYPE_ULONG;
2901 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2902 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2903 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
2904 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
2906 atomic_type = ATOMIC_TYPE_LONGLONG;
2907 goto warn_about_long_long;
2909 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2910 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
2912 atomic_type = ATOMIC_TYPE_ULONGLONG;
2913 warn_about_long_long:
2914 warningf(WARN_LONG_LONG, &specifiers->source_position, "ISO C90 does not support 'long long'");
2917 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
2918 atomic_type = unsigned_int8_type_kind;
2921 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
2922 atomic_type = unsigned_int16_type_kind;
2925 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
2926 atomic_type = unsigned_int32_type_kind;
2929 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
2930 atomic_type = unsigned_int64_type_kind;
2933 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
2934 atomic_type = unsigned_int128_type_kind;
2937 case SPECIFIER_INT8:
2938 case SPECIFIER_SIGNED | SPECIFIER_INT8:
2939 atomic_type = int8_type_kind;
2942 case SPECIFIER_INT16:
2943 case SPECIFIER_SIGNED | SPECIFIER_INT16:
2944 atomic_type = int16_type_kind;
2947 case SPECIFIER_INT32:
2948 case SPECIFIER_SIGNED | SPECIFIER_INT32:
2949 atomic_type = int32_type_kind;
2952 case SPECIFIER_INT64:
2953 case SPECIFIER_SIGNED | SPECIFIER_INT64:
2954 atomic_type = int64_type_kind;
2957 case SPECIFIER_INT128:
2958 case SPECIFIER_SIGNED | SPECIFIER_INT128:
2959 atomic_type = int128_type_kind;
2962 case SPECIFIER_FLOAT:
2963 atomic_type = ATOMIC_TYPE_FLOAT;
2965 case SPECIFIER_DOUBLE:
2966 atomic_type = ATOMIC_TYPE_DOUBLE;
2968 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
2969 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
2971 case SPECIFIER_BOOL:
2972 atomic_type = ATOMIC_TYPE_BOOL;
2974 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
2975 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
2976 atomic_type = ATOMIC_TYPE_FLOAT;
2978 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
2979 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
2980 atomic_type = ATOMIC_TYPE_DOUBLE;
2982 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
2983 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
2984 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
2987 /* invalid specifier combination, give an error message */
2988 source_position_t const* const pos = &specifiers->source_position;
2989 if (type_specifiers == 0) {
2991 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
2992 if (!(c_mode & _CXX) && !strict_mode) {
2993 warningf(WARN_IMPLICIT_INT, pos, "no type specifiers in declaration, using 'int'");
2994 atomic_type = ATOMIC_TYPE_INT;
2997 errorf(pos, "no type specifiers given in declaration");
3000 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3001 (type_specifiers & SPECIFIER_UNSIGNED)) {
3002 errorf(pos, "signed and unsigned specifiers given");
3003 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3004 errorf(pos, "only integer types can be signed or unsigned");
3006 errorf(pos, "multiple datatypes in declaration");
3012 if (type_specifiers & SPECIFIER_COMPLEX) {
3013 type = allocate_type_zero(TYPE_COMPLEX);
3014 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3015 type = allocate_type_zero(TYPE_IMAGINARY);
3017 type = allocate_type_zero(TYPE_ATOMIC);
3019 type->atomic.akind = atomic_type;
3021 } else if (type_specifiers != 0) {
3022 errorf(&specifiers->source_position, "multiple datatypes in declaration");
3025 /* FIXME: check type qualifiers here */
3026 type->base.qualifiers = qualifiers;
3029 type = identify_new_type(type);
3031 type = typehash_insert(type);
3034 if (specifiers->attributes != NULL)
3035 type = handle_type_attributes(specifiers->attributes, type);
3036 specifiers->type = type;
3040 specifiers->type = type_error_type;
3043 static type_qualifiers_t parse_type_qualifiers(void)
3045 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3048 switch (token.kind) {
3049 /* type qualifiers */
3050 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3051 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3052 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3053 /* microsoft extended type modifiers */
3054 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3055 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3056 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3057 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3058 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3067 * Parses an K&R identifier list
3069 static void parse_identifier_list(scope_t *scope)
3071 assert(token.kind == T_IDENTIFIER);
3073 entity_t *const entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, token.base.symbol, HERE);
3074 /* a K&R parameter has no type, yet */
3078 append_entity(scope, entity);
3079 } while (next_if(',') && token.kind == T_IDENTIFIER);
3082 static entity_t *parse_parameter(void)
3084 declaration_specifiers_t specifiers;
3085 parse_declaration_specifiers(&specifiers);
3087 entity_t *entity = parse_declarator(&specifiers,
3088 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
3089 anonymous_entity = NULL;
3093 static void semantic_parameter_incomplete(const entity_t *entity)
3095 assert(entity->kind == ENTITY_PARAMETER);
3097 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
3098 * list in a function declarator that is part of a
3099 * definition of that function shall not have
3100 * incomplete type. */
3101 type_t *type = skip_typeref(entity->declaration.type);
3102 if (is_type_incomplete(type)) {
3103 errorf(&entity->base.source_position, "'%N' has incomplete type", entity);
3107 static bool has_parameters(void)
3109 /* func(void) is not a parameter */
3110 if (look_ahead(1)->kind != ')')
3112 if (token.kind == T_IDENTIFIER) {
3113 entity_t const *const entity = get_entity(token.base.symbol, NAMESPACE_NORMAL);
3116 if (entity->kind != ENTITY_TYPEDEF)
3118 type_t const *const type = skip_typeref(entity->typedefe.type);
3119 if (!is_type_void(type))
3121 if (c_mode & _CXX) {
3122 /* ISO/IEC 14882:1998(E) §8.3.5:2 It must be literally (void). A typedef
3123 * is not allowed. */
3124 errorf(HERE, "empty parameter list defined with a typedef of 'void' not allowed in C++");
3125 } else if (type->base.qualifiers != TYPE_QUALIFIER_NONE) {
3126 /* §6.7.5.3:10 Qualification is not allowed here. */
3127 errorf(HERE, "'void' as parameter must not have type qualifiers");
3129 } else if (token.kind != T_void) {
3137 * Parses function type parameters (and optionally creates variable_t entities
3138 * for them in a scope)
3140 static void parse_parameters(function_type_t *type, scope_t *scope)
3142 add_anchor_token(')');
3145 if (token.kind == T_IDENTIFIER &&
3146 !is_typedef_symbol(token.base.symbol) &&
3147 (look_ahead(1)->kind == ',' || look_ahead(1)->kind == ')')) {
3148 type->kr_style_parameters = true;
3149 parse_identifier_list(scope);
3150 } else if (token.kind == ')') {
3151 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
3152 if (!(c_mode & _CXX))
3153 type->unspecified_parameters = true;
3154 } else if (has_parameters()) {
3155 function_parameter_t **anchor = &type->parameters;
3156 add_anchor_token(',');
3158 switch (token.kind) {
3161 type->variadic = true;
3162 goto parameters_finished;
3167 entity_t *entity = parse_parameter();
3168 if (entity->kind == ENTITY_TYPEDEF) {
3169 errorf(&entity->base.source_position,
3170 "typedef not allowed as function parameter");
3173 assert(is_declaration(entity));
3175 semantic_parameter_incomplete(entity);
3177 function_parameter_t *const parameter =
3178 allocate_parameter(entity->declaration.type);
3180 if (scope != NULL) {
3181 append_entity(scope, entity);
3184 *anchor = parameter;
3185 anchor = ¶meter->next;
3190 goto parameters_finished;
3192 } while (next_if(','));
3193 parameters_finished:
3194 rem_anchor_token(',');
3197 rem_anchor_token(')');
3201 typedef enum construct_type_kind_t {
3202 CONSTRUCT_POINTER = 1,
3203 CONSTRUCT_REFERENCE,
3206 } construct_type_kind_t;
3208 typedef union construct_type_t construct_type_t;
3210 typedef struct construct_type_base_t {
3211 construct_type_kind_t kind;
3212 source_position_t pos;
3213 construct_type_t *next;
3214 } construct_type_base_t;
3216 typedef struct parsed_pointer_t {
3217 construct_type_base_t base;
3218 type_qualifiers_t type_qualifiers;
3219 variable_t *base_variable; /**< MS __based extension. */
3222 typedef struct parsed_reference_t {
3223 construct_type_base_t base;
3224 } parsed_reference_t;
3226 typedef struct construct_function_type_t {
3227 construct_type_base_t base;
3228 type_t *function_type;
3229 } construct_function_type_t;
3231 typedef struct parsed_array_t {
3232 construct_type_base_t base;
3233 type_qualifiers_t type_qualifiers;
3239 union construct_type_t {
3240 construct_type_kind_t kind;
3241 construct_type_base_t base;
3242 parsed_pointer_t pointer;
3243 parsed_reference_t reference;
3244 construct_function_type_t function;
3245 parsed_array_t array;
3248 static construct_type_t *allocate_declarator_zero(construct_type_kind_t const kind, size_t const size)
3250 construct_type_t *const cons = obstack_alloc(&temp_obst, size);
3251 memset(cons, 0, size);
3253 cons->base.pos = *HERE;
3258 static construct_type_t *parse_pointer_declarator(void)
3260 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_POINTER, sizeof(parsed_pointer_t));
3262 cons->pointer.type_qualifiers = parse_type_qualifiers();
3263 //cons->pointer.base_variable = base_variable;
3268 /* ISO/IEC 14882:1998(E) §8.3.2 */
3269 static construct_type_t *parse_reference_declarator(void)
3271 if (!(c_mode & _CXX))
3272 errorf(HERE, "references are only available for C++");
3274 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_REFERENCE, sizeof(parsed_reference_t));
3281 static construct_type_t *parse_array_declarator(void)
3283 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_ARRAY, sizeof(parsed_array_t));
3284 parsed_array_t *const array = &cons->array;
3287 add_anchor_token(']');
3289 bool is_static = next_if(T_static);
3291 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3294 is_static = next_if(T_static);
3296 array->type_qualifiers = type_qualifiers;
3297 array->is_static = is_static;
3299 expression_t *size = NULL;
3300 if (token.kind == '*' && look_ahead(1)->kind == ']') {
3301 array->is_variable = true;
3303 } else if (token.kind != ']') {
3304 size = parse_assignment_expression();
3306 /* §6.7.5.2:1 Array size must have integer type */
3307 type_t *const orig_type = size->base.type;
3308 type_t *const type = skip_typeref(orig_type);
3309 if (!is_type_integer(type) && is_type_valid(type)) {
3310 errorf(&size->base.source_position,
3311 "array size '%E' must have integer type but has type '%T'",
3316 mark_vars_read(size, NULL);
3319 if (is_static && size == NULL)
3320 errorf(&array->base.pos, "static array parameters require a size");
3322 rem_anchor_token(']');
3328 static construct_type_t *parse_function_declarator(scope_t *scope)
3330 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_FUNCTION, sizeof(construct_function_type_t));
3332 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3333 function_type_t *ftype = &type->function;
3335 ftype->linkage = current_linkage;
3336 ftype->calling_convention = CC_DEFAULT;
3338 parse_parameters(ftype, scope);
3340 cons->function.function_type = type;
3345 typedef struct parse_declarator_env_t {
3346 bool may_be_abstract : 1;
3347 bool must_be_abstract : 1;
3348 decl_modifiers_t modifiers;
3350 source_position_t source_position;
3352 attribute_t *attributes;
3353 } parse_declarator_env_t;
3356 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env)
3358 /* construct a single linked list of construct_type_t's which describe
3359 * how to construct the final declarator type */
3360 construct_type_t *first = NULL;
3361 construct_type_t **anchor = &first;
3363 env->attributes = parse_attributes(env->attributes);
3366 construct_type_t *type;
3367 //variable_t *based = NULL; /* MS __based extension */
3368 switch (token.kind) {
3370 type = parse_reference_declarator();
3374 panic("based not supported anymore");
3379 type = parse_pointer_declarator();
3383 goto ptr_operator_end;
3387 anchor = &type->base.next;
3389 /* TODO: find out if this is correct */
3390 env->attributes = parse_attributes(env->attributes);
3394 construct_type_t *inner_types = NULL;
3396 switch (token.kind) {
3398 if (env->must_be_abstract) {
3399 errorf(HERE, "no identifier expected in typename");
3401 env->symbol = token.base.symbol;
3402 env->source_position = *HERE;
3408 /* Parenthesized declarator or function declarator? */
3409 token_t const *const la1 = look_ahead(1);
3410 switch (la1->kind) {
3412 if (is_typedef_symbol(la1->base.symbol)) {
3414 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
3415 * interpreted as ``function with no parameter specification'', rather
3416 * than redundant parentheses around the omitted identifier. */
3418 /* Function declarator. */
3419 if (!env->may_be_abstract) {
3420 errorf(HERE, "function declarator must have a name");
3427 case T___attribute__: /* FIXME __attribute__ might also introduce a parameter of a function declarator. */
3428 /* Paranthesized declarator. */
3430 add_anchor_token(')');
3431 inner_types = parse_inner_declarator(env);
3432 if (inner_types != NULL) {
3433 /* All later declarators only modify the return type */
3434 env->must_be_abstract = true;
3436 rem_anchor_token(')');
3445 if (env->may_be_abstract)
3447 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3452 construct_type_t **const p = anchor;
3455 construct_type_t *type;
3456 switch (token.kind) {
3458 scope_t *scope = NULL;
3459 if (!env->must_be_abstract) {
3460 scope = &env->parameters;
3463 type = parse_function_declarator(scope);
3467 type = parse_array_declarator();
3470 goto declarator_finished;
3473 /* insert in the middle of the list (at p) */
3474 type->base.next = *p;
3477 anchor = &type->base.next;
3480 declarator_finished:
3481 /* append inner_types at the end of the list, we don't to set anchor anymore
3482 * as it's not needed anymore */
3483 *anchor = inner_types;
3488 static type_t *construct_declarator_type(construct_type_t *construct_list,
3491 construct_type_t *iter = construct_list;
3492 for (; iter != NULL; iter = iter->base.next) {
3493 source_position_t const* const pos = &iter->base.pos;
3494 switch (iter->kind) {
3495 case CONSTRUCT_FUNCTION: {
3496 construct_function_type_t *function = &iter->function;
3497 type_t *function_type = function->function_type;
3499 function_type->function.return_type = type;
3501 type_t *skipped_return_type = skip_typeref(type);
3503 if (is_type_function(skipped_return_type)) {
3504 errorf(pos, "function returning function is not allowed");
3505 } else if (is_type_array(skipped_return_type)) {
3506 errorf(pos, "function returning array is not allowed");
3508 if (skipped_return_type->base.qualifiers != 0) {
3509 warningf(WARN_IGNORED_QUALIFIERS, pos, "type qualifiers in return type of function type are meaningless");
3513 /* The function type was constructed earlier. Freeing it here will
3514 * destroy other types. */
3515 type = typehash_insert(function_type);
3519 case CONSTRUCT_POINTER: {
3520 if (is_type_reference(skip_typeref(type)))
3521 errorf(pos, "cannot declare a pointer to reference");
3523 parsed_pointer_t *pointer = &iter->pointer;
3524 type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
3528 case CONSTRUCT_REFERENCE:
3529 if (is_type_reference(skip_typeref(type)))
3530 errorf(pos, "cannot declare a reference to reference");
3532 type = make_reference_type(type);
3535 case CONSTRUCT_ARRAY: {
3536 if (is_type_reference(skip_typeref(type)))
3537 errorf(pos, "cannot declare an array of references");
3539 parsed_array_t *array = &iter->array;
3540 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
3542 expression_t *size_expression = array->size;
3543 if (size_expression != NULL) {
3545 = create_implicit_cast(size_expression, type_size_t);
3548 array_type->base.qualifiers = array->type_qualifiers;
3549 array_type->array.element_type = type;
3550 array_type->array.is_static = array->is_static;
3551 array_type->array.is_variable = array->is_variable;
3552 array_type->array.size_expression = size_expression;
3554 if (size_expression != NULL) {
3555 switch (is_constant_expression(size_expression)) {
3556 case EXPR_CLASS_CONSTANT: {
3557 long const size = fold_constant_to_int(size_expression);
3558 array_type->array.size = size;
3559 array_type->array.size_constant = true;
3560 /* §6.7.5.2:1 If the expression is a constant expression,
3561 * it shall have a value greater than zero. */
3563 errorf(&size_expression->base.source_position,
3564 "size of array must be greater than zero");
3565 } else if (size == 0 && !GNU_MODE) {
3566 errorf(&size_expression->base.source_position,
3567 "size of array must be greater than zero (zero length arrays are a GCC extension)");
3572 case EXPR_CLASS_VARIABLE:
3573 array_type->array.is_vla = true;
3576 case EXPR_CLASS_ERROR:
3581 type_t *skipped_type = skip_typeref(type);
3583 if (is_type_incomplete(skipped_type)) {
3584 errorf(pos, "array of incomplete type '%T' is not allowed", type);
3585 } else if (is_type_function(skipped_type)) {
3586 errorf(pos, "array of functions is not allowed");
3588 type = identify_new_type(array_type);
3592 internal_errorf(pos, "invalid type construction found");
3598 static type_t *automatic_type_conversion(type_t *orig_type);
3600 static type_t *semantic_parameter(const source_position_t *pos,
3602 const declaration_specifiers_t *specifiers,
3603 entity_t const *const param)
3605 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
3606 * shall be adjusted to ``qualified pointer to type'',
3608 * §6.7.5.3:8 A declaration of a parameter as ``function returning
3609 * type'' shall be adjusted to ``pointer to function
3610 * returning type'', as in 6.3.2.1. */
3611 type = automatic_type_conversion(type);
3613 if (specifiers->is_inline && is_type_valid(type)) {
3614 errorf(pos, "'%N' declared 'inline'", param);
3617 /* §6.9.1:6 The declarations in the declaration list shall contain
3618 * no storage-class specifier other than register and no
3619 * initializations. */
3620 if (specifiers->thread_local || (
3621 specifiers->storage_class != STORAGE_CLASS_NONE &&
3622 specifiers->storage_class != STORAGE_CLASS_REGISTER)
3624 errorf(pos, "invalid storage class for '%N'", param);
3627 /* delay test for incomplete type, because we might have (void)
3628 * which is legal but incomplete... */
3633 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
3634 declarator_flags_t flags)
3636 parse_declarator_env_t env;
3637 memset(&env, 0, sizeof(env));
3638 env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
3640 construct_type_t *construct_type = parse_inner_declarator(&env);
3642 construct_declarator_type(construct_type, specifiers->type);
3643 type_t *type = skip_typeref(orig_type);
3645 if (construct_type != NULL) {
3646 obstack_free(&temp_obst, construct_type);
3649 attribute_t *attributes = parse_attributes(env.attributes);
3650 /* append (shared) specifier attribute behind attributes of this
3652 attribute_t **anchor = &attributes;
3653 while (*anchor != NULL)
3654 anchor = &(*anchor)->next;
3655 *anchor = specifiers->attributes;
3658 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
3659 entity = allocate_entity_zero(ENTITY_TYPEDEF, NAMESPACE_NORMAL, env.symbol, &env.source_position);
3660 entity->typedefe.type = orig_type;
3662 if (anonymous_entity != NULL) {
3663 if (is_type_compound(type)) {
3664 assert(anonymous_entity->compound.alias == NULL);
3665 assert(anonymous_entity->kind == ENTITY_STRUCT ||
3666 anonymous_entity->kind == ENTITY_UNION);
3667 anonymous_entity->compound.alias = entity;
3668 anonymous_entity = NULL;
3669 } else if (is_type_enum(type)) {
3670 assert(anonymous_entity->enume.alias == NULL);
3671 assert(anonymous_entity->kind == ENTITY_ENUM);
3672 anonymous_entity->enume.alias = entity;
3673 anonymous_entity = NULL;
3677 /* create a declaration type entity */
3678 source_position_t const *const pos = env.symbol ? &env.source_position : &specifiers->source_position;
3679 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
3680 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, env.symbol, pos);
3682 if (env.symbol != NULL) {
3683 if (specifiers->is_inline && is_type_valid(type)) {
3684 errorf(&env.source_position, "'%N' declared 'inline'", entity);
3687 if (specifiers->thread_local ||
3688 specifiers->storage_class != STORAGE_CLASS_NONE) {
3689 errorf(&env.source_position, "'%N' must have no storage class", entity);
3692 } else if (flags & DECL_IS_PARAMETER) {
3693 entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, env.symbol, pos);
3694 orig_type = semantic_parameter(&env.source_position, orig_type, specifiers, entity);
3695 } else if (is_type_function(type)) {
3696 entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, env.symbol, pos);
3697 entity->function.is_inline = specifiers->is_inline;
3698 entity->function.elf_visibility = default_visibility;
3699 entity->function.parameters = env.parameters;
3701 if (env.symbol != NULL) {
3702 /* this needs fixes for C++ */
3703 bool in_function_scope = current_function != NULL;
3705 if (specifiers->thread_local || (
3706 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3707 specifiers->storage_class != STORAGE_CLASS_NONE &&
3708 (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
3710 errorf(&env.source_position, "invalid storage class for '%N'", entity);
3714 entity = allocate_entity_zero(ENTITY_VARIABLE, NAMESPACE_NORMAL, env.symbol, pos);
3715 entity->variable.elf_visibility = default_visibility;
3716 entity->variable.thread_local = specifiers->thread_local;
3718 if (env.symbol != NULL) {
3719 if (specifiers->is_inline && is_type_valid(type)) {
3720 errorf(&env.source_position, "'%N' declared 'inline'", entity);
3723 bool invalid_storage_class = false;
3724 if (current_scope == file_scope) {
3725 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3726 specifiers->storage_class != STORAGE_CLASS_NONE &&
3727 specifiers->storage_class != STORAGE_CLASS_STATIC) {
3728 invalid_storage_class = true;
3731 if (specifiers->thread_local &&
3732 specifiers->storage_class == STORAGE_CLASS_NONE) {
3733 invalid_storage_class = true;
3736 if (invalid_storage_class) {
3737 errorf(&env.source_position, "invalid storage class for '%N'", entity);
3742 entity->declaration.type = orig_type;
3743 entity->declaration.alignment = get_type_alignment(orig_type);
3744 entity->declaration.modifiers = env.modifiers;
3745 entity->declaration.attributes = attributes;
3747 storage_class_t storage_class = specifiers->storage_class;
3748 entity->declaration.declared_storage_class = storage_class;
3750 if (storage_class == STORAGE_CLASS_NONE && current_function != NULL)
3751 storage_class = STORAGE_CLASS_AUTO;
3752 entity->declaration.storage_class = storage_class;
3755 if (attributes != NULL) {
3756 handle_entity_attributes(attributes, entity);
3759 if (entity->kind == ENTITY_FUNCTION && !freestanding) {
3760 adapt_special_functions(&entity->function);
3766 static type_t *parse_abstract_declarator(type_t *base_type)
3768 parse_declarator_env_t env;
3769 memset(&env, 0, sizeof(env));
3770 env.may_be_abstract = true;
3771 env.must_be_abstract = true;
3773 construct_type_t *construct_type = parse_inner_declarator(&env);
3775 type_t *result = construct_declarator_type(construct_type, base_type);
3776 if (construct_type != NULL) {
3777 obstack_free(&temp_obst, construct_type);
3779 result = handle_type_attributes(env.attributes, result);
3785 * Check if the declaration of main is suspicious. main should be a
3786 * function with external linkage, returning int, taking either zero
3787 * arguments, two, or three arguments of appropriate types, ie.
3789 * int main([ int argc, char **argv [, char **env ] ]).
3791 * @param decl the declaration to check
3792 * @param type the function type of the declaration
3794 static void check_main(const entity_t *entity)
3796 const source_position_t *pos = &entity->base.source_position;
3797 if (entity->kind != ENTITY_FUNCTION) {
3798 warningf(WARN_MAIN, pos, "'main' is not a function");
3802 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
3803 warningf(WARN_MAIN, pos, "'main' is normally a non-static function");
3806 type_t *type = skip_typeref(entity->declaration.type);
3807 assert(is_type_function(type));
3809 function_type_t const *const func_type = &type->function;
3810 type_t *const ret_type = func_type->return_type;
3811 if (!types_compatible(skip_typeref(ret_type), type_int)) {
3812 warningf(WARN_MAIN, pos, "return type of 'main' should be 'int', but is '%T'", ret_type);
3814 const function_parameter_t *parm = func_type->parameters;
3816 type_t *const first_type = skip_typeref(parm->type);
3817 type_t *const first_type_unqual = get_unqualified_type(first_type);
3818 if (!types_compatible(first_type_unqual, type_int)) {
3819 warningf(WARN_MAIN, pos, "first argument of 'main' should be 'int', but is '%T'", parm->type);
3823 type_t *const second_type = skip_typeref(parm->type);
3824 type_t *const second_type_unqual
3825 = get_unqualified_type(second_type);
3826 if (!types_compatible(second_type_unqual, type_char_ptr_ptr)) {
3827 warningf(WARN_MAIN, pos, "second argument of 'main' should be 'char**', but is '%T'", parm->type);
3831 type_t *const third_type = skip_typeref(parm->type);
3832 type_t *const third_type_unqual
3833 = get_unqualified_type(third_type);
3834 if (!types_compatible(third_type_unqual, type_char_ptr_ptr)) {
3835 warningf(WARN_MAIN, pos, "third argument of 'main' should be 'char**', but is '%T'", parm->type);
3839 goto warn_arg_count;
3843 warningf(WARN_MAIN, pos, "'main' takes only zero, two or three arguments");
3848 static void error_redefined_as_different_kind(const source_position_t *pos,
3849 const entity_t *old, entity_kind_t new_kind)
3851 char const *const what = get_entity_kind_name(new_kind);
3852 source_position_t const *const ppos = &old->base.source_position;
3853 errorf(pos, "redeclaration of '%N' as %s (declared %P)", old, what, ppos);
3856 static bool is_entity_valid(entity_t *const ent)
3858 if (is_declaration(ent)) {
3859 return is_type_valid(skip_typeref(ent->declaration.type));
3860 } else if (ent->kind == ENTITY_TYPEDEF) {
3861 return is_type_valid(skip_typeref(ent->typedefe.type));
3866 static bool contains_attribute(const attribute_t *list, const attribute_t *attr)
3868 for (const attribute_t *tattr = list; tattr != NULL; tattr = tattr->next) {
3869 if (attributes_equal(tattr, attr))
3876 * test wether new_list contains any attributes not included in old_list
3878 static bool has_new_attributes(const attribute_t *old_list,
3879 const attribute_t *new_list)
3881 for (const attribute_t *attr = new_list; attr != NULL; attr = attr->next) {
3882 if (!contains_attribute(old_list, attr))
3889 * Merge in attributes from an attribute list (probably from a previous
3890 * declaration with the same name). Warning: destroys the old structure
3891 * of the attribute list - don't reuse attributes after this call.
3893 static void merge_in_attributes(declaration_t *decl, attribute_t *attributes)
3896 for (attribute_t *attr = attributes; attr != NULL; attr = next) {
3898 if (contains_attribute(decl->attributes, attr))
3901 /* move attribute to new declarations attributes list */
3902 attr->next = decl->attributes;
3903 decl->attributes = attr;
3907 static bool is_main(entity_t*);
3910 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
3911 * for various problems that occur for multiple definitions
3913 entity_t *record_entity(entity_t *entity, const bool is_definition)
3915 const symbol_t *const symbol = entity->base.symbol;
3916 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
3917 const source_position_t *pos = &entity->base.source_position;
3919 /* can happen in error cases */
3923 assert(!entity->base.parent_scope);
3924 assert(current_scope);
3925 entity->base.parent_scope = current_scope;
3927 entity_t *const previous_entity = get_entity(symbol, namespc);
3928 /* pushing the same entity twice will break the stack structure */
3929 assert(previous_entity != entity);
3931 if (entity->kind == ENTITY_FUNCTION) {
3932 type_t *const orig_type = entity->declaration.type;
3933 type_t *const type = skip_typeref(orig_type);
3935 assert(is_type_function(type));
3936 if (type->function.unspecified_parameters &&
3937 previous_entity == NULL &&
3938 !entity->declaration.implicit) {
3939 warningf(WARN_STRICT_PROTOTYPES, pos, "function declaration '%#N' is not a prototype", entity);
3942 if (is_main(entity)) {
3947 if (is_declaration(entity) &&
3948 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
3949 current_scope != file_scope &&
3950 !entity->declaration.implicit) {
3951 warningf(WARN_NESTED_EXTERNS, pos, "nested extern declaration of '%#N'", entity);
3954 if (previous_entity != NULL) {
3955 source_position_t const *const ppos = &previous_entity->base.source_position;
3957 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
3958 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
3959 assert(previous_entity->kind == ENTITY_PARAMETER);
3960 errorf(pos, "declaration of '%N' redeclares the '%N' (declared %P)", entity, previous_entity, ppos);
3964 if (previous_entity->base.parent_scope == current_scope) {
3965 if (previous_entity->kind != entity->kind) {
3966 if (is_entity_valid(previous_entity) && is_entity_valid(entity)) {
3967 error_redefined_as_different_kind(pos, previous_entity,
3972 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
3973 errorf(pos, "redeclaration of '%N' (declared %P)", entity, ppos);
3976 if (previous_entity->kind == ENTITY_TYPEDEF) {
3977 type_t *const type = skip_typeref(entity->typedefe.type);
3978 type_t *const prev_type
3979 = skip_typeref(previous_entity->typedefe.type);
3980 if (c_mode & _CXX) {
3981 /* C++ allows double typedef if they are identical
3982 * (after skipping typedefs) */
3983 if (type == prev_type)
3986 /* GCC extension: redef in system headers is allowed */
3987 if ((pos->is_system_header || ppos->is_system_header) &&
3988 types_compatible(type, prev_type))
3991 errorf(pos, "redefinition of '%N' (declared %P)",
3996 /* at this point we should have only VARIABLES or FUNCTIONS */
3997 assert(is_declaration(previous_entity) && is_declaration(entity));
3999 declaration_t *const prev_decl = &previous_entity->declaration;
4000 declaration_t *const decl = &entity->declaration;
4002 /* can happen for K&R style declarations */
4003 if (prev_decl->type == NULL &&
4004 previous_entity->kind == ENTITY_PARAMETER &&
4005 entity->kind == ENTITY_PARAMETER) {
4006 prev_decl->type = decl->type;
4007 prev_decl->storage_class = decl->storage_class;
4008 prev_decl->declared_storage_class = decl->declared_storage_class;
4009 prev_decl->modifiers = decl->modifiers;
4010 return previous_entity;
4013 type_t *const type = skip_typeref(decl->type);
4014 type_t *const prev_type = skip_typeref(prev_decl->type);
4016 if (!types_compatible(type, prev_type)) {
4017 errorf(pos, "declaration '%#N' is incompatible with '%#N' (declared %P)", entity, previous_entity, ppos);
4019 unsigned old_storage_class = prev_decl->storage_class;
4021 if (is_definition &&
4023 !(prev_decl->modifiers & DM_USED) &&
4024 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4025 warningf(WARN_REDUNDANT_DECLS, ppos, "unnecessary static forward declaration for '%#N'", previous_entity);
4028 storage_class_t new_storage_class = decl->storage_class;
4030 /* pretend no storage class means extern for function
4031 * declarations (except if the previous declaration is neither
4032 * none nor extern) */
4033 if (entity->kind == ENTITY_FUNCTION) {
4034 /* the previous declaration could have unspecified parameters or
4035 * be a typedef, so use the new type */
4036 if (prev_type->function.unspecified_parameters || is_definition)
4037 prev_decl->type = type;
4039 switch (old_storage_class) {
4040 case STORAGE_CLASS_NONE:
4041 old_storage_class = STORAGE_CLASS_EXTERN;
4044 case STORAGE_CLASS_EXTERN:
4045 if (is_definition) {
4046 if (prev_type->function.unspecified_parameters && !is_main(entity)) {
4047 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4049 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4050 new_storage_class = STORAGE_CLASS_EXTERN;
4057 } else if (is_type_incomplete(prev_type)) {
4058 prev_decl->type = type;
4061 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4062 new_storage_class == STORAGE_CLASS_EXTERN) {
4064 warn_redundant_declaration: ;
4066 = has_new_attributes(prev_decl->attributes,
4068 if (has_new_attrs) {
4069 merge_in_attributes(decl, prev_decl->attributes);
4070 } else if (!is_definition &&
4071 is_type_valid(prev_type) &&
4072 !pos->is_system_header) {
4073 warningf(WARN_REDUNDANT_DECLS, pos, "redundant declaration for '%N' (declared %P)", entity, ppos);
4075 } else if (current_function == NULL) {
4076 if (old_storage_class != STORAGE_CLASS_STATIC &&
4077 new_storage_class == STORAGE_CLASS_STATIC) {
4078 errorf(pos, "static declaration of '%N' follows non-static declaration (declared %P)", entity, ppos);
4079 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4080 prev_decl->storage_class = STORAGE_CLASS_NONE;
4081 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4083 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4085 goto error_redeclaration;
4086 goto warn_redundant_declaration;
4088 } else if (is_type_valid(prev_type)) {
4089 if (old_storage_class == new_storage_class) {
4090 error_redeclaration:
4091 errorf(pos, "redeclaration of '%N' (declared %P)", entity, ppos);
4093 errorf(pos, "redeclaration of '%N' with different linkage (declared %P)", entity, ppos);
4098 prev_decl->modifiers |= decl->modifiers;
4099 if (entity->kind == ENTITY_FUNCTION) {
4100 previous_entity->function.is_inline |= entity->function.is_inline;
4102 return previous_entity;
4106 if (is_warn_on(why = WARN_SHADOW) ||
4107 (is_warn_on(why = WARN_SHADOW_LOCAL) && previous_entity->base.parent_scope != file_scope)) {
4108 char const *const what = get_entity_kind_name(previous_entity->kind);
4109 warningf(why, pos, "'%N' shadows %s (declared %P)", entity, what, ppos);
4113 if (entity->kind == ENTITY_FUNCTION) {
4114 if (is_definition &&
4115 entity->declaration.storage_class != STORAGE_CLASS_STATIC &&
4117 if (is_warn_on(WARN_MISSING_PROTOTYPES)) {
4118 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4120 goto warn_missing_declaration;
4123 } else if (entity->kind == ENTITY_VARIABLE) {
4124 if (current_scope == file_scope &&
4125 entity->declaration.storage_class == STORAGE_CLASS_NONE &&
4126 !entity->declaration.implicit) {
4127 warn_missing_declaration:
4128 warningf(WARN_MISSING_DECLARATIONS, pos, "no previous declaration for '%#N'", entity);
4133 environment_push(entity);
4134 append_entity(current_scope, entity);
4139 static void parser_error_multiple_definition(entity_t *entity,
4140 const source_position_t *source_position)
4142 errorf(source_position, "redefinition of '%N' (declared %P)", entity, &entity->base.source_position);
4145 static bool is_declaration_specifier(const token_t *token)
4147 switch (token->kind) {
4151 return is_typedef_symbol(token->base.symbol);
4158 static void parse_init_declarator_rest(entity_t *entity)
4160 type_t *orig_type = type_error_type;
4162 if (entity->base.kind == ENTITY_TYPEDEF) {
4163 source_position_t const *const pos = &entity->base.source_position;
4164 errorf(pos, "'%N' is initialized (use __typeof__ instead)", entity);
4166 assert(is_declaration(entity));
4167 orig_type = entity->declaration.type;
4170 type_t *type = skip_typeref(orig_type);
4172 if (entity->kind == ENTITY_VARIABLE
4173 && entity->variable.initializer != NULL) {
4174 parser_error_multiple_definition(entity, HERE);
4178 declaration_t *const declaration = &entity->declaration;
4179 bool must_be_constant = false;
4180 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4181 entity->base.parent_scope == file_scope) {
4182 must_be_constant = true;
4185 if (is_type_function(type)) {
4186 source_position_t const *const pos = &entity->base.source_position;
4187 errorf(pos, "'%N' is initialized like a variable", entity);
4188 orig_type = type_error_type;
4191 parse_initializer_env_t env;
4192 env.type = orig_type;
4193 env.must_be_constant = must_be_constant;
4194 env.entity = entity;
4196 initializer_t *initializer = parse_initializer(&env);
4198 if (entity->kind == ENTITY_VARIABLE) {
4199 /* §6.7.5:22 array initializers for arrays with unknown size
4200 * determine the array type size */
4201 declaration->type = env.type;
4202 entity->variable.initializer = initializer;
4206 /* parse rest of a declaration without any declarator */
4207 static void parse_anonymous_declaration_rest(
4208 const declaration_specifiers_t *specifiers)
4211 anonymous_entity = NULL;
4213 source_position_t const *const pos = &specifiers->source_position;
4214 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4215 specifiers->thread_local) {
4216 warningf(WARN_OTHER, pos, "useless storage class in empty declaration");
4219 type_t *type = specifiers->type;
4220 switch (type->kind) {
4221 case TYPE_COMPOUND_STRUCT:
4222 case TYPE_COMPOUND_UNION: {
4223 if (type->compound.compound->base.symbol == NULL) {
4224 warningf(WARN_OTHER, pos, "unnamed struct/union that defines no instances");
4233 warningf(WARN_OTHER, pos, "empty declaration");
4238 static void check_variable_type_complete(entity_t *ent)
4240 if (ent->kind != ENTITY_VARIABLE)
4243 /* §6.7:7 If an identifier for an object is declared with no linkage, the
4244 * type for the object shall be complete [...] */
4245 declaration_t *decl = &ent->declaration;
4246 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4247 decl->storage_class == STORAGE_CLASS_STATIC)
4250 type_t *const type = skip_typeref(decl->type);
4251 if (!is_type_incomplete(type))
4254 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4255 * are given length one. */
4256 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4257 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4261 errorf(&ent->base.source_position, "variable '%#N' has incomplete type", ent);
4265 static void parse_declaration_rest(entity_t *ndeclaration,
4266 const declaration_specifiers_t *specifiers,
4267 parsed_declaration_func finished_declaration,
4268 declarator_flags_t flags)
4270 add_anchor_token(';');
4271 add_anchor_token(',');
4273 entity_t *entity = finished_declaration(ndeclaration, token.kind == '=');
4275 if (token.kind == '=') {
4276 parse_init_declarator_rest(entity);
4277 } else if (entity->kind == ENTITY_VARIABLE) {
4278 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
4279 * [...] where the extern specifier is explicitly used. */
4280 declaration_t *decl = &entity->declaration;
4281 if (decl->storage_class != STORAGE_CLASS_EXTERN &&
4282 is_type_reference(skip_typeref(decl->type))) {
4283 source_position_t const *const pos = &entity->base.source_position;
4284 errorf(pos, "reference '%#N' must be initialized", entity);
4288 check_variable_type_complete(entity);
4293 add_anchor_token('=');
4294 ndeclaration = parse_declarator(specifiers, flags);
4295 rem_anchor_token('=');
4297 rem_anchor_token(',');
4298 rem_anchor_token(';');
4301 anonymous_entity = NULL;
4304 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4306 symbol_t *symbol = entity->base.symbol;
4310 assert(entity->base.namespc == NAMESPACE_NORMAL);
4311 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4312 if (previous_entity == NULL
4313 || previous_entity->base.parent_scope != current_scope) {
4314 errorf(&entity->base.source_position, "expected declaration of a function parameter, found '%Y'",
4319 if (is_definition) {
4320 errorf(HERE, "'%N' is initialised", entity);
4323 return record_entity(entity, false);
4326 static void parse_declaration(parsed_declaration_func finished_declaration,
4327 declarator_flags_t flags)
4329 add_anchor_token(';');
4330 declaration_specifiers_t specifiers;
4331 parse_declaration_specifiers(&specifiers);
4332 rem_anchor_token(';');
4334 if (token.kind == ';') {
4335 parse_anonymous_declaration_rest(&specifiers);
4337 entity_t *entity = parse_declarator(&specifiers, flags);
4338 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4343 static type_t *get_default_promoted_type(type_t *orig_type)
4345 type_t *result = orig_type;
4347 type_t *type = skip_typeref(orig_type);
4348 if (is_type_integer(type)) {
4349 result = promote_integer(type);
4350 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4351 result = type_double;
4357 static void parse_kr_declaration_list(entity_t *entity)
4359 if (entity->kind != ENTITY_FUNCTION)
4362 type_t *type = skip_typeref(entity->declaration.type);
4363 assert(is_type_function(type));
4364 if (!type->function.kr_style_parameters)
4367 add_anchor_token('{');
4369 PUSH_SCOPE(&entity->function.parameters);
4371 entity_t *parameter = entity->function.parameters.entities;
4372 for ( ; parameter != NULL; parameter = parameter->base.next) {
4373 assert(parameter->base.parent_scope == NULL);
4374 parameter->base.parent_scope = current_scope;
4375 environment_push(parameter);
4378 /* parse declaration list */
4380 switch (token.kind) {
4382 /* This covers symbols, which are no type, too, and results in
4383 * better error messages. The typical cases are misspelled type
4384 * names and missing includes. */
4386 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4396 /* update function type */
4397 type_t *new_type = duplicate_type(type);
4399 function_parameter_t *parameters = NULL;
4400 function_parameter_t **anchor = ¶meters;
4402 /* did we have an earlier prototype? */
4403 entity_t *proto_type = get_entity(entity->base.symbol, NAMESPACE_NORMAL);
4404 if (proto_type != NULL && proto_type->kind != ENTITY_FUNCTION)
4407 function_parameter_t *proto_parameter = NULL;
4408 if (proto_type != NULL) {
4409 type_t *proto_type_type = proto_type->declaration.type;
4410 proto_parameter = proto_type_type->function.parameters;
4411 /* If a K&R function definition has a variadic prototype earlier, then
4412 * make the function definition variadic, too. This should conform to
4413 * §6.7.5.3:15 and §6.9.1:8. */
4414 new_type->function.variadic = proto_type_type->function.variadic;
4416 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
4418 new_type->function.unspecified_parameters = true;
4421 bool need_incompatible_warning = false;
4422 parameter = entity->function.parameters.entities;
4423 for (; parameter != NULL; parameter = parameter->base.next,
4425 proto_parameter == NULL ? NULL : proto_parameter->next) {
4426 if (parameter->kind != ENTITY_PARAMETER)
4429 type_t *parameter_type = parameter->declaration.type;
4430 if (parameter_type == NULL) {
4431 source_position_t const* const pos = ¶meter->base.source_position;
4433 errorf(pos, "no type specified for function '%N'", parameter);
4434 parameter_type = type_error_type;
4436 warningf(WARN_IMPLICIT_INT, pos, "no type specified for function parameter '%N', using 'int'", parameter);
4437 parameter_type = type_int;
4439 parameter->declaration.type = parameter_type;
4442 semantic_parameter_incomplete(parameter);
4444 /* we need the default promoted types for the function type */
4445 type_t *not_promoted = parameter_type;
4446 parameter_type = get_default_promoted_type(parameter_type);
4448 /* gcc special: if the type of the prototype matches the unpromoted
4449 * type don't promote */
4450 if (!strict_mode && proto_parameter != NULL) {
4451 type_t *proto_p_type = skip_typeref(proto_parameter->type);
4452 type_t *promo_skip = skip_typeref(parameter_type);
4453 type_t *param_skip = skip_typeref(not_promoted);
4454 if (!types_compatible(proto_p_type, promo_skip)
4455 && types_compatible(proto_p_type, param_skip)) {
4457 need_incompatible_warning = true;
4458 parameter_type = not_promoted;
4461 function_parameter_t *const function_parameter
4462 = allocate_parameter(parameter_type);
4464 *anchor = function_parameter;
4465 anchor = &function_parameter->next;
4468 new_type->function.parameters = parameters;
4469 new_type = identify_new_type(new_type);
4471 if (need_incompatible_warning) {
4472 symbol_t const *const sym = entity->base.symbol;
4473 source_position_t const *const pos = &entity->base.source_position;
4474 source_position_t const *const ppos = &proto_type->base.source_position;
4475 warningf(WARN_OTHER, pos, "declaration '%#N' is incompatible with '%#T' (declared %P)", proto_type, new_type, sym, ppos);
4477 entity->declaration.type = new_type;
4479 rem_anchor_token('{');
4482 static bool first_err = true;
4485 * When called with first_err set, prints the name of the current function,
4488 static void print_in_function(void)
4492 char const *const file = current_function->base.base.source_position.input_name;
4493 diagnosticf("%s: In '%N':\n", file, (entity_t const*)current_function);
4498 * Check if all labels are defined in the current function.
4499 * Check if all labels are used in the current function.
4501 static void check_labels(void)
4503 for (const goto_statement_t *goto_statement = goto_first;
4504 goto_statement != NULL;
4505 goto_statement = goto_statement->next) {
4506 label_t *label = goto_statement->label;
4507 if (label->base.source_position.input_name == NULL) {
4508 print_in_function();
4509 source_position_t const *const pos = &goto_statement->base.source_position;
4510 errorf(pos, "'%N' used but not defined", (entity_t const*)label);
4514 if (is_warn_on(WARN_UNUSED_LABEL)) {
4515 for (const label_statement_t *label_statement = label_first;
4516 label_statement != NULL;
4517 label_statement = label_statement->next) {
4518 label_t *label = label_statement->label;
4520 if (! label->used) {
4521 print_in_function();
4522 source_position_t const *const pos = &label_statement->base.source_position;
4523 warningf(WARN_UNUSED_LABEL, pos, "'%N' defined but not used", (entity_t const*)label);
4529 static void warn_unused_entity(warning_t const why, entity_t *entity, entity_t *const last)
4531 entity_t const *const end = last != NULL ? last->base.next : NULL;
4532 for (; entity != end; entity = entity->base.next) {
4533 if (!is_declaration(entity))
4536 declaration_t *declaration = &entity->declaration;
4537 if (declaration->implicit)
4540 if (!declaration->used) {
4541 print_in_function();
4542 warningf(why, &entity->base.source_position, "'%N' is unused", entity);
4543 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
4544 print_in_function();
4545 warningf(why, &entity->base.source_position, "'%N' is never read", entity);
4550 static void check_unused_variables(statement_t *const stmt, void *const env)
4554 switch (stmt->kind) {
4555 case STATEMENT_DECLARATION: {
4556 declaration_statement_t const *const decls = &stmt->declaration;
4557 warn_unused_entity(WARN_UNUSED_VARIABLE, decls->declarations_begin, decls->declarations_end);
4562 warn_unused_entity(WARN_UNUSED_VARIABLE, stmt->fors.scope.entities, NULL);
4571 * Check declarations of current_function for unused entities.
4573 static void check_declarations(void)
4575 if (is_warn_on(WARN_UNUSED_PARAMETER)) {
4576 const scope_t *scope = ¤t_function->parameters;
4577 warn_unused_entity(WARN_UNUSED_PARAMETER, scope->entities, NULL);
4579 if (is_warn_on(WARN_UNUSED_VARIABLE)) {
4580 walk_statements(current_function->statement, check_unused_variables,
4585 static int determine_truth(expression_t const* const cond)
4588 is_constant_expression(cond) != EXPR_CLASS_CONSTANT ? 0 :
4589 fold_constant_to_bool(cond) ? 1 :
4593 static void check_reachable(statement_t *);
4594 static bool reaches_end;
4596 static bool expression_returns(expression_t const *const expr)
4598 switch (expr->kind) {
4600 expression_t const *const func = expr->call.function;
4601 type_t const *const type = skip_typeref(func->base.type);
4602 if (type->kind == TYPE_POINTER) {
4603 type_t const *const points_to
4604 = skip_typeref(type->pointer.points_to);
4605 if (points_to->kind == TYPE_FUNCTION
4606 && points_to->function.modifiers & DM_NORETURN)
4610 if (!expression_returns(func))
4613 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
4614 if (!expression_returns(arg->expression))
4621 case EXPR_REFERENCE:
4622 case EXPR_ENUM_CONSTANT:
4623 case EXPR_LITERAL_CASES:
4624 case EXPR_STRING_LITERAL:
4625 case EXPR_WIDE_STRING_LITERAL:
4626 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
4627 case EXPR_LABEL_ADDRESS:
4628 case EXPR_CLASSIFY_TYPE:
4629 case EXPR_SIZEOF: // TODO handle obscure VLA case
4632 case EXPR_BUILTIN_CONSTANT_P:
4633 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
4638 case EXPR_STATEMENT: {
4639 bool old_reaches_end = reaches_end;
4640 reaches_end = false;
4641 check_reachable(expr->statement.statement);
4642 bool returns = reaches_end;
4643 reaches_end = old_reaches_end;
4647 case EXPR_CONDITIONAL:
4648 // TODO handle constant expression
4650 if (!expression_returns(expr->conditional.condition))
4653 if (expr->conditional.true_expression != NULL
4654 && expression_returns(expr->conditional.true_expression))
4657 return expression_returns(expr->conditional.false_expression);
4660 return expression_returns(expr->select.compound);
4662 case EXPR_ARRAY_ACCESS:
4664 expression_returns(expr->array_access.array_ref) &&
4665 expression_returns(expr->array_access.index);
4668 return expression_returns(expr->va_starte.ap);
4671 return expression_returns(expr->va_arge.ap);
4674 return expression_returns(expr->va_copye.src);
4676 case EXPR_UNARY_CASES_MANDATORY:
4677 return expression_returns(expr->unary.value);
4679 case EXPR_UNARY_THROW:
4682 case EXPR_BINARY_CASES:
4683 // TODO handle constant lhs of && and ||
4685 expression_returns(expr->binary.left) &&
4686 expression_returns(expr->binary.right);
4689 panic("unhandled expression");
4692 static bool initializer_returns(initializer_t const *const init)
4694 switch (init->kind) {
4695 case INITIALIZER_VALUE:
4696 return expression_returns(init->value.value);
4698 case INITIALIZER_LIST: {
4699 initializer_t * const* i = init->list.initializers;
4700 initializer_t * const* const end = i + init->list.len;
4701 bool returns = true;
4702 for (; i != end; ++i) {
4703 if (!initializer_returns(*i))
4709 case INITIALIZER_STRING:
4710 case INITIALIZER_WIDE_STRING:
4711 case INITIALIZER_DESIGNATOR: // designators have no payload
4714 panic("unhandled initializer");
4717 static bool noreturn_candidate;
4719 static void check_reachable(statement_t *const stmt)
4721 if (stmt->base.reachable)
4723 if (stmt->kind != STATEMENT_DO_WHILE)
4724 stmt->base.reachable = true;
4726 statement_t *last = stmt;
4728 switch (stmt->kind) {
4729 case STATEMENT_ERROR:
4730 case STATEMENT_EMPTY:
4732 next = stmt->base.next;
4735 case STATEMENT_DECLARATION: {
4736 declaration_statement_t const *const decl = &stmt->declaration;
4737 entity_t const * ent = decl->declarations_begin;
4738 entity_t const *const last_decl = decl->declarations_end;
4740 for (;; ent = ent->base.next) {
4741 if (ent->kind == ENTITY_VARIABLE &&
4742 ent->variable.initializer != NULL &&
4743 !initializer_returns(ent->variable.initializer)) {
4746 if (ent == last_decl)
4750 next = stmt->base.next;
4754 case STATEMENT_COMPOUND:
4755 next = stmt->compound.statements;
4757 next = stmt->base.next;
4760 case STATEMENT_RETURN: {
4761 expression_t const *const val = stmt->returns.value;
4762 if (val == NULL || expression_returns(val))
4763 noreturn_candidate = false;
4767 case STATEMENT_IF: {
4768 if_statement_t const *const ifs = &stmt->ifs;
4769 expression_t const *const cond = ifs->condition;
4771 if (!expression_returns(cond))
4774 int const val = determine_truth(cond);
4777 check_reachable(ifs->true_statement);
4782 if (ifs->false_statement != NULL) {
4783 check_reachable(ifs->false_statement);
4787 next = stmt->base.next;
4791 case STATEMENT_SWITCH: {
4792 switch_statement_t const *const switchs = &stmt->switchs;
4793 expression_t const *const expr = switchs->expression;
4795 if (!expression_returns(expr))
4798 if (is_constant_expression(expr) == EXPR_CLASS_CONSTANT) {
4799 long const val = fold_constant_to_int(expr);
4800 case_label_statement_t * defaults = NULL;
4801 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4802 if (i->expression == NULL) {
4807 if (i->first_case <= val && val <= i->last_case) {
4808 check_reachable((statement_t*)i);
4813 if (defaults != NULL) {
4814 check_reachable((statement_t*)defaults);
4818 bool has_default = false;
4819 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4820 if (i->expression == NULL)
4823 check_reachable((statement_t*)i);
4830 next = stmt->base.next;
4834 case STATEMENT_EXPRESSION: {
4835 /* Check for noreturn function call */
4836 expression_t const *const expr = stmt->expression.expression;
4837 if (!expression_returns(expr))
4840 next = stmt->base.next;
4844 case STATEMENT_CONTINUE:
4845 for (statement_t *parent = stmt;;) {
4846 parent = parent->base.parent;
4847 if (parent == NULL) /* continue not within loop */
4851 switch (parent->kind) {
4852 case STATEMENT_WHILE: goto continue_while;
4853 case STATEMENT_DO_WHILE: goto continue_do_while;
4854 case STATEMENT_FOR: goto continue_for;
4860 case STATEMENT_BREAK:
4861 for (statement_t *parent = stmt;;) {
4862 parent = parent->base.parent;
4863 if (parent == NULL) /* break not within loop/switch */
4866 switch (parent->kind) {
4867 case STATEMENT_SWITCH:
4868 case STATEMENT_WHILE:
4869 case STATEMENT_DO_WHILE:
4872 next = parent->base.next;
4873 goto found_break_parent;
4881 case STATEMENT_COMPUTED_GOTO: {
4882 if (!expression_returns(stmt->computed_goto.expression))
4885 statement_t *parent = stmt->base.parent;
4886 if (parent == NULL) /* top level goto */
4892 case STATEMENT_GOTO:
4893 next = stmt->gotos.label->statement;
4894 if (next == NULL) /* missing label */
4898 case STATEMENT_LABEL:
4899 next = stmt->label.statement;
4902 case STATEMENT_CASE_LABEL:
4903 next = stmt->case_label.statement;
4906 case STATEMENT_WHILE: {
4907 while_statement_t const *const whiles = &stmt->whiles;
4908 expression_t const *const cond = whiles->condition;
4910 if (!expression_returns(cond))
4913 int const val = determine_truth(cond);
4916 check_reachable(whiles->body);
4921 next = stmt->base.next;
4925 case STATEMENT_DO_WHILE:
4926 next = stmt->do_while.body;
4929 case STATEMENT_FOR: {
4930 for_statement_t *const fors = &stmt->fors;
4932 if (fors->condition_reachable)
4934 fors->condition_reachable = true;
4936 expression_t const *const cond = fors->condition;
4941 } else if (expression_returns(cond)) {
4942 val = determine_truth(cond);
4948 check_reachable(fors->body);
4953 next = stmt->base.next;
4957 case STATEMENT_MS_TRY: {
4958 ms_try_statement_t const *const ms_try = &stmt->ms_try;
4959 check_reachable(ms_try->try_statement);
4960 next = ms_try->final_statement;
4964 case STATEMENT_LEAVE: {
4965 statement_t *parent = stmt;
4967 parent = parent->base.parent;
4968 if (parent == NULL) /* __leave not within __try */
4971 if (parent->kind == STATEMENT_MS_TRY) {
4973 next = parent->ms_try.final_statement;
4981 panic("invalid statement kind");
4984 while (next == NULL) {
4985 next = last->base.parent;
4987 noreturn_candidate = false;
4989 type_t *const type = skip_typeref(current_function->base.type);
4990 assert(is_type_function(type));
4991 type_t *const ret = skip_typeref(type->function.return_type);
4992 if (!is_type_void(ret) &&
4993 is_type_valid(ret) &&
4994 !is_main(current_entity)) {
4995 source_position_t const *const pos = &stmt->base.source_position;
4996 warningf(WARN_RETURN_TYPE, pos, "control reaches end of non-void function");
5001 switch (next->kind) {
5002 case STATEMENT_ERROR:
5003 case STATEMENT_EMPTY:
5004 case STATEMENT_DECLARATION:
5005 case STATEMENT_EXPRESSION:
5007 case STATEMENT_RETURN:
5008 case STATEMENT_CONTINUE:
5009 case STATEMENT_BREAK:
5010 case STATEMENT_COMPUTED_GOTO:
5011 case STATEMENT_GOTO:
5012 case STATEMENT_LEAVE:
5013 panic("invalid control flow in function");
5015 case STATEMENT_COMPOUND:
5016 if (next->compound.stmt_expr) {
5022 case STATEMENT_SWITCH:
5023 case STATEMENT_LABEL:
5024 case STATEMENT_CASE_LABEL:
5026 next = next->base.next;
5029 case STATEMENT_WHILE: {
5031 if (next->base.reachable)
5033 next->base.reachable = true;
5035 while_statement_t const *const whiles = &next->whiles;
5036 expression_t const *const cond = whiles->condition;
5038 if (!expression_returns(cond))
5041 int const val = determine_truth(cond);
5044 check_reachable(whiles->body);
5050 next = next->base.next;
5054 case STATEMENT_DO_WHILE: {
5056 if (next->base.reachable)
5058 next->base.reachable = true;
5060 do_while_statement_t const *const dw = &next->do_while;
5061 expression_t const *const cond = dw->condition;
5063 if (!expression_returns(cond))
5066 int const val = determine_truth(cond);
5069 check_reachable(dw->body);
5075 next = next->base.next;
5079 case STATEMENT_FOR: {
5081 for_statement_t *const fors = &next->fors;
5083 fors->step_reachable = true;
5085 if (fors->condition_reachable)
5087 fors->condition_reachable = true;
5089 expression_t const *const cond = fors->condition;
5094 } else if (expression_returns(cond)) {
5095 val = determine_truth(cond);
5101 check_reachable(fors->body);
5107 next = next->base.next;
5111 case STATEMENT_MS_TRY:
5113 next = next->ms_try.final_statement;
5118 check_reachable(next);
5121 static void check_unreachable(statement_t* const stmt, void *const env)
5125 switch (stmt->kind) {
5126 case STATEMENT_DO_WHILE:
5127 if (!stmt->base.reachable) {
5128 expression_t const *const cond = stmt->do_while.condition;
5129 if (determine_truth(cond) >= 0) {
5130 source_position_t const *const pos = &cond->base.source_position;
5131 warningf(WARN_UNREACHABLE_CODE, pos, "condition of do-while-loop is unreachable");
5136 case STATEMENT_FOR: {
5137 for_statement_t const* const fors = &stmt->fors;
5139 // if init and step are unreachable, cond is unreachable, too
5140 if (!stmt->base.reachable && !fors->step_reachable) {
5141 goto warn_unreachable;
5143 if (!stmt->base.reachable && fors->initialisation != NULL) {
5144 source_position_t const *const pos = &fors->initialisation->base.source_position;
5145 warningf(WARN_UNREACHABLE_CODE, pos, "initialisation of for-statement is unreachable");
5148 if (!fors->condition_reachable && fors->condition != NULL) {
5149 source_position_t const *const pos = &fors->condition->base.source_position;
5150 warningf(WARN_UNREACHABLE_CODE, pos, "condition of for-statement is unreachable");
5153 if (!fors->step_reachable && fors->step != NULL) {
5154 source_position_t const *const pos = &fors->step->base.source_position;
5155 warningf(WARN_UNREACHABLE_CODE, pos, "step of for-statement is unreachable");
5161 case STATEMENT_COMPOUND:
5162 if (stmt->compound.statements != NULL)
5164 goto warn_unreachable;
5166 case STATEMENT_DECLARATION: {
5167 /* Only warn if there is at least one declarator with an initializer.
5168 * This typically occurs in switch statements. */
5169 declaration_statement_t const *const decl = &stmt->declaration;
5170 entity_t const * ent = decl->declarations_begin;
5171 entity_t const *const last = decl->declarations_end;
5173 for (;; ent = ent->base.next) {
5174 if (ent->kind == ENTITY_VARIABLE &&
5175 ent->variable.initializer != NULL) {
5176 goto warn_unreachable;
5186 if (!stmt->base.reachable) {
5187 source_position_t const *const pos = &stmt->base.source_position;
5188 warningf(WARN_UNREACHABLE_CODE, pos, "statement is unreachable");
5194 static bool is_main(entity_t *entity)
5196 static symbol_t *sym_main = NULL;
5197 if (sym_main == NULL) {
5198 sym_main = symbol_table_insert("main");
5201 if (entity->base.symbol != sym_main)
5203 /* must be in outermost scope */
5204 if (entity->base.parent_scope != file_scope)
5210 static void prepare_main_collect2(entity_t*);
5212 static void parse_external_declaration(void)
5214 /* function-definitions and declarations both start with declaration
5216 add_anchor_token(';');
5217 declaration_specifiers_t specifiers;
5218 parse_declaration_specifiers(&specifiers);
5219 rem_anchor_token(';');
5221 /* must be a declaration */
5222 if (token.kind == ';') {
5223 parse_anonymous_declaration_rest(&specifiers);
5227 add_anchor_token(',');
5228 add_anchor_token('=');
5229 add_anchor_token(';');
5230 add_anchor_token('{');
5232 /* declarator is common to both function-definitions and declarations */
5233 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
5235 rem_anchor_token('{');
5236 rem_anchor_token(';');
5237 rem_anchor_token('=');
5238 rem_anchor_token(',');
5240 /* must be a declaration */
5241 switch (token.kind) {
5245 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
5250 /* must be a function definition */
5251 parse_kr_declaration_list(ndeclaration);
5253 if (token.kind != '{') {
5254 parse_error_expected("while parsing function definition", '{', NULL);
5255 eat_until_matching_token(';');
5259 assert(is_declaration(ndeclaration));
5260 type_t *const orig_type = ndeclaration->declaration.type;
5261 type_t * type = skip_typeref(orig_type);
5263 if (!is_type_function(type)) {
5264 if (is_type_valid(type)) {
5265 errorf(HERE, "declarator '%#N' has a body but is not a function type", ndeclaration);
5271 source_position_t const *const pos = &ndeclaration->base.source_position;
5272 if (is_typeref(orig_type)) {
5274 errorf(pos, "type of function definition '%#N' is a typedef", ndeclaration);
5277 if (is_type_compound(skip_typeref(type->function.return_type))) {
5278 warningf(WARN_AGGREGATE_RETURN, pos, "'%N' returns an aggregate", ndeclaration);
5280 if (type->function.unspecified_parameters) {
5281 warningf(WARN_OLD_STYLE_DEFINITION, pos, "old-style definition of '%N'", ndeclaration);
5283 warningf(WARN_TRADITIONAL, pos, "traditional C rejects ISO C style definition of '%N'", ndeclaration);
5286 /* §6.7.5.3:14 a function definition with () means no
5287 * parameters (and not unspecified parameters) */
5288 if (type->function.unspecified_parameters &&
5289 type->function.parameters == NULL) {
5290 type_t *copy = duplicate_type(type);
5291 copy->function.unspecified_parameters = false;
5292 type = identify_new_type(copy);
5294 ndeclaration->declaration.type = type;
5297 entity_t *const entity = record_entity(ndeclaration, true);
5298 assert(entity->kind == ENTITY_FUNCTION);
5299 assert(ndeclaration->kind == ENTITY_FUNCTION);
5301 function_t *const function = &entity->function;
5302 if (ndeclaration != entity) {
5303 function->parameters = ndeclaration->function.parameters;
5306 PUSH_SCOPE(&function->parameters);
5308 entity_t *parameter = function->parameters.entities;
5309 for (; parameter != NULL; parameter = parameter->base.next) {
5310 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5311 parameter->base.parent_scope = current_scope;
5313 assert(parameter->base.parent_scope == NULL
5314 || parameter->base.parent_scope == current_scope);
5315 parameter->base.parent_scope = current_scope;
5316 if (parameter->base.symbol == NULL) {
5317 errorf(¶meter->base.source_position, "parameter name omitted");
5320 environment_push(parameter);
5323 if (function->statement != NULL) {
5324 parser_error_multiple_definition(entity, HERE);
5327 /* parse function body */
5328 int label_stack_top = label_top();
5329 function_t *old_current_function = current_function;
5330 current_function = function;
5331 PUSH_CURRENT_ENTITY(entity);
5335 goto_anchor = &goto_first;
5337 label_anchor = &label_first;
5339 statement_t *const body = parse_compound_statement(false);
5340 function->statement = body;
5343 check_declarations();
5344 if (is_warn_on(WARN_RETURN_TYPE) ||
5345 is_warn_on(WARN_UNREACHABLE_CODE) ||
5346 (is_warn_on(WARN_MISSING_NORETURN) && !(function->base.modifiers & DM_NORETURN))) {
5347 noreturn_candidate = true;
5348 check_reachable(body);
5349 if (is_warn_on(WARN_UNREACHABLE_CODE))
5350 walk_statements(body, check_unreachable, NULL);
5351 if (noreturn_candidate &&
5352 !(function->base.modifiers & DM_NORETURN)) {
5353 source_position_t const *const pos = &body->base.source_position;
5354 warningf(WARN_MISSING_NORETURN, pos, "function '%#N' is candidate for attribute 'noreturn'", entity);
5358 if (is_main(entity)) {
5359 /* Force main to C linkage. */
5360 type_t *const type = entity->declaration.type;
5361 assert(is_type_function(type));
5362 if (type->function.linkage != LINKAGE_C) {
5363 type_t *new_type = duplicate_type(type);
5364 new_type->function.linkage = LINKAGE_C;
5365 entity->declaration.type = identify_new_type(new_type);
5368 if (enable_main_collect2_hack)
5369 prepare_main_collect2(entity);
5372 POP_CURRENT_ENTITY();
5374 assert(current_function == function);
5375 current_function = old_current_function;
5376 label_pop_to(label_stack_top);
5382 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
5384 entity_t *iter = compound->members.entities;
5385 for (; iter != NULL; iter = iter->base.next) {
5386 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5389 if (iter->base.symbol == symbol) {
5391 } else if (iter->base.symbol == NULL) {
5392 /* search in anonymous structs and unions */
5393 type_t *type = skip_typeref(iter->declaration.type);
5394 if (is_type_compound(type)) {
5395 if (find_compound_entry(type->compound.compound, symbol)
5406 static void check_deprecated(const source_position_t *source_position,
5407 const entity_t *entity)
5409 if (!is_declaration(entity))
5411 if ((entity->declaration.modifiers & DM_DEPRECATED) == 0)
5414 source_position_t const *const epos = &entity->base.source_position;
5415 char const *const msg = get_deprecated_string(entity->declaration.attributes);
5417 warningf(WARN_DEPRECATED_DECLARATIONS, source_position, "'%N' is deprecated (declared %P): \"%s\"", entity, epos, msg);
5419 warningf(WARN_DEPRECATED_DECLARATIONS, source_position, "'%N' is deprecated (declared %P)", entity, epos);
5424 static expression_t *create_select(const source_position_t *pos,
5426 type_qualifiers_t qualifiers,
5429 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
5431 check_deprecated(pos, entry);
5433 expression_t *select = allocate_expression_zero(EXPR_SELECT);
5434 select->select.compound = addr;
5435 select->select.compound_entry = entry;
5437 type_t *entry_type = entry->declaration.type;
5438 type_t *res_type = get_qualified_type(entry_type, qualifiers);
5440 /* bitfields need special treatment */
5441 if (entry->compound_member.bitfield) {
5442 unsigned bit_size = entry->compound_member.bit_size;
5443 /* if fewer bits than an int, convert to int (see §6.3.1.1) */
5444 if (bit_size < get_atomic_type_size(ATOMIC_TYPE_INT) * BITS_PER_BYTE) {
5445 res_type = type_int;
5449 /* we always do the auto-type conversions; the & and sizeof parser contains
5450 * code to revert this! */
5451 select->base.type = automatic_type_conversion(res_type);
5458 * Find entry with symbol in compound. Search anonymous structs and unions and
5459 * creates implicit select expressions for them.
5460 * Returns the adress for the innermost compound.
5462 static expression_t *find_create_select(const source_position_t *pos,
5464 type_qualifiers_t qualifiers,
5465 compound_t *compound, symbol_t *symbol)
5467 entity_t *iter = compound->members.entities;
5468 for (; iter != NULL; iter = iter->base.next) {
5469 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5472 symbol_t *iter_symbol = iter->base.symbol;
5473 if (iter_symbol == NULL) {
5474 type_t *type = iter->declaration.type;
5475 if (type->kind != TYPE_COMPOUND_STRUCT
5476 && type->kind != TYPE_COMPOUND_UNION)
5479 compound_t *sub_compound = type->compound.compound;
5481 if (find_compound_entry(sub_compound, symbol) == NULL)
5484 expression_t *sub_addr = create_select(pos, addr, qualifiers, iter);
5485 sub_addr->base.source_position = *pos;
5486 sub_addr->base.implicit = true;
5487 return find_create_select(pos, sub_addr, qualifiers, sub_compound,
5491 if (iter_symbol == symbol) {
5492 return create_select(pos, addr, qualifiers, iter);
5499 static void parse_bitfield_member(entity_t *entity)
5503 expression_t *size = parse_constant_expression();
5506 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5507 type_t *type = entity->declaration.type;
5508 if (!is_type_integer(skip_typeref(type))) {
5509 errorf(HERE, "bitfield base type '%T' is not an integer type",
5513 if (is_constant_expression(size) != EXPR_CLASS_CONSTANT) {
5514 /* error already reported by parse_constant_expression */
5515 size_long = get_type_size(type) * 8;
5517 size_long = fold_constant_to_int(size);
5519 const symbol_t *symbol = entity->base.symbol;
5520 const symbol_t *user_symbol
5521 = symbol == NULL ? sym_anonymous : symbol;
5522 unsigned bit_size = get_type_size(type) * 8;
5523 if (size_long < 0) {
5524 errorf(HERE, "negative width in bit-field '%Y'", user_symbol);
5525 } else if (size_long == 0 && symbol != NULL) {
5526 errorf(HERE, "zero width for bit-field '%Y'", user_symbol);
5527 } else if (bit_size > 0 && (unsigned)size_long > bit_size) {
5528 errorf(HERE, "width of bitfield '%Y' exceeds its type",
5531 /* hope that people don't invent crazy types with more bits
5532 * than our struct can hold */
5534 (1 << sizeof(entity->compound_member.bit_size)*8));
5538 entity->compound_member.bitfield = true;
5539 entity->compound_member.bit_size = (unsigned char)size_long;
5542 static void parse_compound_declarators(compound_t *compound,
5543 const declaration_specifiers_t *specifiers)
5545 add_anchor_token(';');
5546 add_anchor_token(',');
5550 if (token.kind == ':') {
5551 /* anonymous bitfield */
5552 type_t *type = specifiers->type;
5553 entity_t *const entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, NULL, HERE);
5554 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
5555 entity->declaration.storage_class = STORAGE_CLASS_NONE;
5556 entity->declaration.type = type;
5558 parse_bitfield_member(entity);
5560 attribute_t *attributes = parse_attributes(NULL);
5561 attribute_t **anchor = &attributes;
5562 while (*anchor != NULL)
5563 anchor = &(*anchor)->next;
5564 *anchor = specifiers->attributes;
5565 if (attributes != NULL) {
5566 handle_entity_attributes(attributes, entity);
5568 entity->declaration.attributes = attributes;
5570 append_entity(&compound->members, entity);
5572 entity = parse_declarator(specifiers,
5573 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
5574 source_position_t const *const pos = &entity->base.source_position;
5575 if (entity->kind == ENTITY_TYPEDEF) {
5576 errorf(pos, "typedef not allowed as compound member");
5578 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5580 /* make sure we don't define a symbol multiple times */
5581 symbol_t *symbol = entity->base.symbol;
5582 if (symbol != NULL) {
5583 entity_t *prev = find_compound_entry(compound, symbol);
5585 source_position_t const *const ppos = &prev->base.source_position;
5586 errorf(pos, "multiple declarations of '%N' (declared %P)", entity, ppos);
5590 if (token.kind == ':') {
5591 parse_bitfield_member(entity);
5593 attribute_t *attributes = parse_attributes(NULL);
5594 handle_entity_attributes(attributes, entity);
5596 type_t *orig_type = entity->declaration.type;
5597 type_t *type = skip_typeref(orig_type);
5598 if (is_type_function(type)) {
5599 errorf(pos, "'%N' must not have function type '%T'", entity, orig_type);
5600 } else if (is_type_incomplete(type)) {
5601 /* §6.7.2.1:16 flexible array member */
5602 if (!is_type_array(type) ||
5603 token.kind != ';' ||
5604 look_ahead(1)->kind != '}') {
5605 errorf(pos, "'%N' has incomplete type '%T'", entity, orig_type);
5606 } else if (compound->members.entities == NULL) {
5607 errorf(pos, "flexible array member in otherwise empty struct");
5612 append_entity(&compound->members, entity);
5615 } while (next_if(','));
5616 rem_anchor_token(',');
5617 rem_anchor_token(';');
5620 anonymous_entity = NULL;
5623 static void parse_compound_type_entries(compound_t *compound)
5626 add_anchor_token('}');
5629 switch (token.kind) {
5631 case T___extension__:
5632 case T_IDENTIFIER: {
5634 declaration_specifiers_t specifiers;
5635 parse_declaration_specifiers(&specifiers);
5636 parse_compound_declarators(compound, &specifiers);
5642 rem_anchor_token('}');
5645 compound->complete = true;
5651 static type_t *parse_typename(void)
5653 declaration_specifiers_t specifiers;
5654 parse_declaration_specifiers(&specifiers);
5655 if (specifiers.storage_class != STORAGE_CLASS_NONE
5656 || specifiers.thread_local) {
5657 /* TODO: improve error message, user does probably not know what a
5658 * storage class is...
5660 errorf(&specifiers.source_position, "typename must not have a storage class");
5663 type_t *result = parse_abstract_declarator(specifiers.type);
5671 typedef expression_t* (*parse_expression_function)(void);
5672 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
5674 typedef struct expression_parser_function_t expression_parser_function_t;
5675 struct expression_parser_function_t {
5676 parse_expression_function parser;
5677 precedence_t infix_precedence;
5678 parse_expression_infix_function infix_parser;
5681 static expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5683 static type_t *get_string_type(void)
5685 return is_warn_on(WARN_WRITE_STRINGS) ? type_const_char_ptr : type_char_ptr;
5688 static type_t *get_wide_string_type(void)
5690 return is_warn_on(WARN_WRITE_STRINGS) ? type_const_wchar_t_ptr : type_wchar_t_ptr;
5694 * Parse a string constant.
5696 static expression_t *parse_string_literal(void)
5698 source_position_t begin = *HERE;
5699 string_t res = token.string.string;
5700 bool is_wide = (token.kind == T_WIDE_STRING_LITERAL);
5703 while (token.kind == T_STRING_LITERAL
5704 || token.kind == T_WIDE_STRING_LITERAL) {
5705 warn_string_concat(HERE);
5706 res = concat_strings(&res, &token.string.string);
5708 is_wide |= token.kind == T_WIDE_STRING_LITERAL;
5711 expression_t *literal;
5713 literal = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
5714 literal->base.type = get_wide_string_type();
5716 literal = allocate_expression_zero(EXPR_STRING_LITERAL);
5717 literal->base.type = get_string_type();
5719 literal->base.source_position = begin;
5720 literal->literal.value = res;
5726 * Parse a boolean constant.
5728 static expression_t *parse_boolean_literal(bool value)
5730 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_BOOLEAN);
5731 literal->base.type = type_bool;
5732 literal->literal.value.begin = value ? "true" : "false";
5733 literal->literal.value.size = value ? 4 : 5;
5735 eat(value ? T_true : T_false);
5739 static void warn_traditional_suffix(void)
5741 warningf(WARN_TRADITIONAL, HERE, "traditional C rejects the '%S' suffix",
5742 &token.number.suffix);
5745 static void check_integer_suffix(void)
5747 const string_t *suffix = &token.number.suffix;
5748 if (suffix->size == 0)
5751 bool not_traditional = false;
5752 const char *c = suffix->begin;
5753 if (*c == 'l' || *c == 'L') {
5756 not_traditional = true;
5758 if (*c == 'u' || *c == 'U') {
5761 } else if (*c == 'u' || *c == 'U') {
5762 not_traditional = true;
5765 } else if (*c == 'u' || *c == 'U') {
5766 not_traditional = true;
5768 if (*c == 'l' || *c == 'L') {
5776 errorf(HERE, "invalid suffix '%S' on integer constant", suffix);
5777 } else if (not_traditional) {
5778 warn_traditional_suffix();
5782 static type_t *check_floatingpoint_suffix(void)
5784 const string_t *suffix = &token.number.suffix;
5785 type_t *type = type_double;
5786 if (suffix->size == 0)
5789 bool not_traditional = false;
5790 const char *c = suffix->begin;
5791 if (*c == 'f' || *c == 'F') {
5794 } else if (*c == 'l' || *c == 'L') {
5796 type = type_long_double;
5799 errorf(HERE, "invalid suffix '%S' on floatingpoint constant", suffix);
5800 } else if (not_traditional) {
5801 warn_traditional_suffix();
5808 * Parse an integer constant.
5810 static expression_t *parse_number_literal(void)
5812 expression_kind_t kind;
5815 switch (token.kind) {
5817 kind = EXPR_LITERAL_INTEGER;
5818 check_integer_suffix();
5822 case T_FLOATINGPOINT:
5823 kind = EXPR_LITERAL_FLOATINGPOINT;
5824 type = check_floatingpoint_suffix();
5828 panic("unexpected token type in parse_number_literal");
5831 expression_t *literal = allocate_expression_zero(kind);
5832 literal->base.type = type;
5833 literal->literal.value = token.number.number;
5834 literal->literal.suffix = token.number.suffix;
5837 /* integer type depends on the size of the number and the size
5838 * representable by the types. The backend/codegeneration has to determine
5841 determine_literal_type(&literal->literal);
5846 * Parse a character constant.
5848 static expression_t *parse_character_constant(void)
5850 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_CHARACTER);
5851 literal->base.type = c_mode & _CXX ? type_char : type_int;
5852 literal->literal.value = token.string.string;
5854 size_t len = literal->literal.value.size;
5856 if (!GNU_MODE && !(c_mode & _C99)) {
5857 errorf(HERE, "more than 1 character in character constant");
5859 literal->base.type = type_int;
5860 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
5864 eat(T_CHARACTER_CONSTANT);
5869 * Parse a wide character constant.
5871 static expression_t *parse_wide_character_constant(void)
5873 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_WIDE_CHARACTER);
5874 literal->base.type = type_int;
5875 literal->literal.value = token.string.string;
5877 size_t len = wstrlen(&literal->literal.value);
5879 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
5882 eat(T_WIDE_CHARACTER_CONSTANT);
5886 static entity_t *create_implicit_function(symbol_t *symbol, source_position_t const *const pos)
5888 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
5889 ntype->function.return_type = type_int;
5890 ntype->function.unspecified_parameters = true;
5891 ntype->function.linkage = LINKAGE_C;
5892 type_t *type = identify_new_type(ntype);
5894 entity_t *const entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, symbol, pos);
5895 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
5896 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
5897 entity->declaration.type = type;
5898 entity->declaration.implicit = true;
5900 if (current_scope != NULL)
5901 record_entity(entity, false);
5907 * Performs automatic type cast as described in §6.3.2.1.
5909 * @param orig_type the original type
5911 static type_t *automatic_type_conversion(type_t *orig_type)
5913 type_t *type = skip_typeref(orig_type);
5914 if (is_type_array(type)) {
5915 array_type_t *array_type = &type->array;
5916 type_t *element_type = array_type->element_type;
5917 unsigned qualifiers = array_type->base.qualifiers;
5919 return make_pointer_type(element_type, qualifiers);
5922 if (is_type_function(type)) {
5923 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
5930 * reverts the automatic casts of array to pointer types and function
5931 * to function-pointer types as defined §6.3.2.1
5933 type_t *revert_automatic_type_conversion(const expression_t *expression)
5935 switch (expression->kind) {
5936 case EXPR_REFERENCE: {
5937 entity_t *entity = expression->reference.entity;
5938 if (is_declaration(entity)) {
5939 return entity->declaration.type;
5940 } else if (entity->kind == ENTITY_ENUM_VALUE) {
5941 return entity->enum_value.enum_type;
5943 panic("no declaration or enum in reference");
5948 entity_t *entity = expression->select.compound_entry;
5949 assert(is_declaration(entity));
5950 type_t *type = entity->declaration.type;
5951 return get_qualified_type(type, expression->base.type->base.qualifiers);
5954 case EXPR_UNARY_DEREFERENCE: {
5955 const expression_t *const value = expression->unary.value;
5956 type_t *const type = skip_typeref(value->base.type);
5957 if (!is_type_pointer(type))
5958 return type_error_type;
5959 return type->pointer.points_to;
5962 case EXPR_ARRAY_ACCESS: {
5963 const expression_t *array_ref = expression->array_access.array_ref;
5964 type_t *type_left = skip_typeref(array_ref->base.type);
5965 if (!is_type_pointer(type_left))
5966 return type_error_type;
5967 return type_left->pointer.points_to;
5970 case EXPR_STRING_LITERAL: {
5971 size_t size = expression->string_literal.value.size;
5972 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
5975 case EXPR_WIDE_STRING_LITERAL: {
5976 size_t size = wstrlen(&expression->string_literal.value);
5977 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
5980 case EXPR_COMPOUND_LITERAL:
5981 return expression->compound_literal.type;
5986 return expression->base.type;
5990 * Find an entity matching a symbol in a scope.
5991 * Uses current scope if scope is NULL
5993 static entity_t *lookup_entity(const scope_t *scope, symbol_t *symbol,
5994 namespace_tag_t namespc)
5996 if (scope == NULL) {
5997 return get_entity(symbol, namespc);
6000 /* we should optimize here, if scope grows above a certain size we should
6001 construct a hashmap here... */
6002 entity_t *entity = scope->entities;
6003 for ( ; entity != NULL; entity = entity->base.next) {
6004 if (entity->base.symbol == symbol
6005 && (namespace_tag_t)entity->base.namespc == namespc)
6012 static entity_t *parse_qualified_identifier(void)
6014 /* namespace containing the symbol */
6016 source_position_t pos;
6017 const scope_t *lookup_scope = NULL;
6019 if (next_if(T_COLONCOLON))
6020 lookup_scope = &unit->scope;
6024 symbol = expect_identifier("while parsing identifier", &pos);
6026 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6029 entity = lookup_entity(lookup_scope, symbol, NAMESPACE_NORMAL);
6031 if (!next_if(T_COLONCOLON))
6034 switch (entity->kind) {
6035 case ENTITY_NAMESPACE:
6036 lookup_scope = &entity->namespacee.members;
6041 lookup_scope = &entity->compound.members;
6044 errorf(&pos, "'%Y' must be a namespace, class, struct or union (but is a %s)",
6045 symbol, get_entity_kind_name(entity->kind));
6047 /* skip further qualifications */
6048 while (next_if(T_IDENTIFIER) && next_if(T_COLONCOLON)) {}
6050 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6054 if (entity == NULL) {
6055 if (!strict_mode && token.kind == '(') {
6056 /* an implicitly declared function */
6057 entity = create_implicit_function(symbol, &pos);
6058 warningf(WARN_IMPLICIT_FUNCTION_DECLARATION, &pos, "implicit declaration of '%N'", entity);
6060 errorf(&pos, "unknown identifier '%Y' found.", symbol);
6061 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6068 static expression_t *parse_reference(void)
6070 source_position_t const pos = *HERE;
6071 entity_t *const entity = parse_qualified_identifier();
6074 if (is_declaration(entity)) {
6075 orig_type = entity->declaration.type;
6076 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6077 orig_type = entity->enum_value.enum_type;
6079 panic("expected declaration or enum value in reference");
6082 /* we always do the auto-type conversions; the & and sizeof parser contains
6083 * code to revert this! */
6084 type_t *type = automatic_type_conversion(orig_type);
6086 expression_kind_t kind = EXPR_REFERENCE;
6087 if (entity->kind == ENTITY_ENUM_VALUE)
6088 kind = EXPR_ENUM_CONSTANT;
6090 expression_t *expression = allocate_expression_zero(kind);
6091 expression->base.source_position = pos;
6092 expression->base.type = type;
6093 expression->reference.entity = entity;
6095 /* this declaration is used */
6096 if (is_declaration(entity)) {
6097 entity->declaration.used = true;
6100 if (entity->base.parent_scope != file_scope
6101 && (current_function != NULL
6102 && entity->base.parent_scope->depth < current_function->parameters.depth)
6103 && (entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER)) {
6104 /* access of a variable from an outer function */
6105 entity->variable.address_taken = true;
6106 current_function->need_closure = true;
6109 check_deprecated(&pos, entity);
6114 static bool semantic_cast(expression_t *cast)
6116 expression_t *expression = cast->unary.value;
6117 type_t *orig_dest_type = cast->base.type;
6118 type_t *orig_type_right = expression->base.type;
6119 type_t const *dst_type = skip_typeref(orig_dest_type);
6120 type_t const *src_type = skip_typeref(orig_type_right);
6121 source_position_t const *pos = &cast->base.source_position;
6123 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6124 if (is_type_void(dst_type))
6127 /* only integer and pointer can be casted to pointer */
6128 if (is_type_pointer(dst_type) &&
6129 !is_type_pointer(src_type) &&
6130 !is_type_integer(src_type) &&
6131 is_type_valid(src_type)) {
6132 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6136 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6137 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6141 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6142 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6146 if (is_type_pointer(src_type) && is_type_pointer(dst_type)) {
6147 type_t *src = skip_typeref(src_type->pointer.points_to);
6148 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6149 unsigned missing_qualifiers =
6150 src->base.qualifiers & ~dst->base.qualifiers;
6151 if (missing_qualifiers != 0) {
6152 warningf(WARN_CAST_QUAL, pos, "cast discards qualifiers '%Q' in pointer target type of '%T'", missing_qualifiers, orig_type_right);
6158 static expression_t *parse_compound_literal(source_position_t const *const pos, type_t *type)
6160 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6161 expression->base.source_position = *pos;
6163 parse_initializer_env_t env;
6166 env.must_be_constant = false;
6167 initializer_t *initializer = parse_initializer(&env);
6170 expression->compound_literal.initializer = initializer;
6171 expression->compound_literal.type = type;
6172 expression->base.type = automatic_type_conversion(type);
6178 * Parse a cast expression.
6180 static expression_t *parse_cast(void)
6182 source_position_t const pos = *HERE;
6185 add_anchor_token(')');
6187 type_t *type = parse_typename();
6189 rem_anchor_token(')');
6192 if (token.kind == '{') {
6193 return parse_compound_literal(&pos, type);
6196 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6197 cast->base.source_position = pos;
6199 expression_t *value = parse_subexpression(PREC_CAST);
6200 cast->base.type = type;
6201 cast->unary.value = value;
6203 if (! semantic_cast(cast)) {
6204 /* TODO: record the error in the AST. else it is impossible to detect it */
6211 * Parse a statement expression.
6213 static expression_t *parse_statement_expression(void)
6215 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6218 add_anchor_token(')');
6220 statement_t *statement = parse_compound_statement(true);
6221 statement->compound.stmt_expr = true;
6222 expression->statement.statement = statement;
6224 /* find last statement and use its type */
6225 type_t *type = type_void;
6226 const statement_t *stmt = statement->compound.statements;
6228 while (stmt->base.next != NULL)
6229 stmt = stmt->base.next;
6231 if (stmt->kind == STATEMENT_EXPRESSION) {
6232 type = stmt->expression.expression->base.type;
6235 source_position_t const *const pos = &expression->base.source_position;
6236 warningf(WARN_OTHER, pos, "empty statement expression ({})");
6238 expression->base.type = type;
6240 rem_anchor_token(')');
6246 * Parse a parenthesized expression.
6248 static expression_t *parse_parenthesized_expression(void)
6250 token_t const* const la1 = look_ahead(1);
6251 switch (la1->kind) {
6253 /* gcc extension: a statement expression */
6254 return parse_statement_expression();
6257 if (is_typedef_symbol(la1->base.symbol)) {
6259 return parse_cast();
6264 add_anchor_token(')');
6265 expression_t *result = parse_expression();
6266 result->base.parenthesized = true;
6267 rem_anchor_token(')');
6273 static expression_t *parse_function_keyword(funcname_kind_t const kind)
6275 if (current_function == NULL) {
6276 errorf(HERE, "'%K' used outside of a function", &token);
6279 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6280 expression->base.type = type_char_ptr;
6281 expression->funcname.kind = kind;
6288 static designator_t *parse_designator(void)
6290 designator_t *const result = allocate_ast_zero(sizeof(result[0]));
6291 result->symbol = expect_identifier("while parsing member designator", &result->source_position);
6292 if (!result->symbol)
6295 designator_t *last_designator = result;
6298 designator_t *const designator = allocate_ast_zero(sizeof(result[0]));
6299 designator->symbol = expect_identifier("while parsing member designator", &designator->source_position);
6300 if (!designator->symbol)
6303 last_designator->next = designator;
6304 last_designator = designator;
6308 add_anchor_token(']');
6309 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6310 designator->source_position = *HERE;
6311 designator->array_index = parse_expression();
6312 rem_anchor_token(']');
6314 if (designator->array_index == NULL) {
6318 last_designator->next = designator;
6319 last_designator = designator;
6329 * Parse the __builtin_offsetof() expression.
6331 static expression_t *parse_offsetof(void)
6333 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6334 expression->base.type = type_size_t;
6336 eat(T___builtin_offsetof);
6338 add_anchor_token(')');
6339 add_anchor_token(',');
6341 type_t *type = parse_typename();
6342 rem_anchor_token(',');
6344 designator_t *designator = parse_designator();
6345 rem_anchor_token(')');
6348 expression->offsetofe.type = type;
6349 expression->offsetofe.designator = designator;
6352 memset(&path, 0, sizeof(path));
6353 path.top_type = type;
6354 path.path = NEW_ARR_F(type_path_entry_t, 0);
6356 descend_into_subtype(&path);
6358 if (!walk_designator(&path, designator, true)) {
6359 return create_error_expression();
6362 DEL_ARR_F(path.path);
6367 static bool is_last_parameter(expression_t *const param)
6369 if (param->kind == EXPR_REFERENCE) {
6370 entity_t *const entity = param->reference.entity;
6371 if (entity->kind == ENTITY_PARAMETER &&
6372 !entity->base.next &&
6373 entity->base.parent_scope == ¤t_function->parameters) {
6378 if (!is_type_valid(skip_typeref(param->base.type)))
6385 * Parses a __builtin_va_start() expression.
6387 static expression_t *parse_va_start(void)
6389 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6391 eat(T___builtin_va_start);
6393 add_anchor_token(')');
6394 add_anchor_token(',');
6396 expression->va_starte.ap = parse_assignment_expression();
6397 rem_anchor_token(',');
6399 expression_t *const param = parse_assignment_expression();
6400 expression->va_starte.parameter = param;
6401 rem_anchor_token(')');
6404 if (!current_function) {
6405 errorf(&expression->base.source_position, "'va_start' used outside of function");
6406 } else if (!current_function->base.type->function.variadic) {
6407 errorf(&expression->base.source_position, "'va_start' used in non-variadic function");
6408 } else if (!is_last_parameter(param)) {
6409 errorf(¶m->base.source_position, "second argument of 'va_start' must be last parameter of the current function");
6416 * Parses a __builtin_va_arg() expression.
6418 static expression_t *parse_va_arg(void)
6420 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6422 eat(T___builtin_va_arg);
6424 add_anchor_token(')');
6425 add_anchor_token(',');
6428 ap.expression = parse_assignment_expression();
6429 expression->va_arge.ap = ap.expression;
6430 check_call_argument(type_valist, &ap, 1);
6432 rem_anchor_token(',');
6434 expression->base.type = parse_typename();
6435 rem_anchor_token(')');
6442 * Parses a __builtin_va_copy() expression.
6444 static expression_t *parse_va_copy(void)
6446 expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
6448 eat(T___builtin_va_copy);
6450 add_anchor_token(')');
6451 add_anchor_token(',');
6453 expression_t *dst = parse_assignment_expression();
6454 assign_error_t error = semantic_assign(type_valist, dst);
6455 report_assign_error(error, type_valist, dst, "call argument 1",
6456 &dst->base.source_position);
6457 expression->va_copye.dst = dst;
6459 rem_anchor_token(',');
6462 call_argument_t src;
6463 src.expression = parse_assignment_expression();
6464 check_call_argument(type_valist, &src, 2);
6465 expression->va_copye.src = src.expression;
6466 rem_anchor_token(')');
6473 * Parses a __builtin_constant_p() expression.
6475 static expression_t *parse_builtin_constant(void)
6477 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6479 eat(T___builtin_constant_p);
6481 add_anchor_token(')');
6483 expression->builtin_constant.value = parse_assignment_expression();
6484 rem_anchor_token(')');
6486 expression->base.type = type_int;
6492 * Parses a __builtin_types_compatible_p() expression.
6494 static expression_t *parse_builtin_types_compatible(void)
6496 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
6498 eat(T___builtin_types_compatible_p);
6500 add_anchor_token(')');
6501 add_anchor_token(',');
6503 expression->builtin_types_compatible.left = parse_typename();
6504 rem_anchor_token(',');
6506 expression->builtin_types_compatible.right = parse_typename();
6507 rem_anchor_token(')');
6509 expression->base.type = type_int;
6515 * Parses a __builtin_is_*() compare expression.
6517 static expression_t *parse_compare_builtin(void)
6519 expression_kind_t kind;
6520 switch (token.kind) {
6521 case T___builtin_isgreater: kind = EXPR_BINARY_ISGREATER; break;
6522 case T___builtin_isgreaterequal: kind = EXPR_BINARY_ISGREATEREQUAL; break;
6523 case T___builtin_isless: kind = EXPR_BINARY_ISLESS; break;
6524 case T___builtin_islessequal: kind = EXPR_BINARY_ISLESSEQUAL; break;
6525 case T___builtin_islessgreater: kind = EXPR_BINARY_ISLESSGREATER; break;
6526 case T___builtin_isunordered: kind = EXPR_BINARY_ISUNORDERED; break;
6527 default: internal_errorf(HERE, "invalid compare builtin found");
6529 expression_t *const expression = allocate_expression_zero(kind);
6532 add_anchor_token(')');
6533 add_anchor_token(',');
6535 expression->binary.left = parse_assignment_expression();
6536 rem_anchor_token(',');
6538 expression->binary.right = parse_assignment_expression();
6539 rem_anchor_token(')');
6542 type_t *const orig_type_left = expression->binary.left->base.type;
6543 type_t *const orig_type_right = expression->binary.right->base.type;
6545 type_t *const type_left = skip_typeref(orig_type_left);
6546 type_t *const type_right = skip_typeref(orig_type_right);
6547 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6548 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6549 type_error_incompatible("invalid operands in comparison",
6550 &expression->base.source_position, orig_type_left, orig_type_right);
6553 semantic_comparison(&expression->binary);
6560 * Parses a MS assume() expression.
6562 static expression_t *parse_assume(void)
6564 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
6568 add_anchor_token(')');
6570 expression->unary.value = parse_assignment_expression();
6571 rem_anchor_token(')');
6574 expression->base.type = type_void;
6579 * Return the label for the current symbol or create a new one.
6581 static label_t *get_label(void)
6583 assert(token.kind == T_IDENTIFIER);
6584 assert(current_function != NULL);
6586 entity_t *label = get_entity(token.base.symbol, NAMESPACE_LABEL);
6587 /* If we find a local label, we already created the declaration. */
6588 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
6589 if (label->base.parent_scope != current_scope) {
6590 assert(label->base.parent_scope->depth < current_scope->depth);
6591 current_function->goto_to_outer = true;
6593 } else if (label == NULL || label->base.parent_scope != ¤t_function->parameters) {
6594 /* There is no matching label in the same function, so create a new one. */
6595 source_position_t const nowhere = { NULL, 0, 0, false };
6596 label = allocate_entity_zero(ENTITY_LABEL, NAMESPACE_LABEL, token.base.symbol, &nowhere);
6601 return &label->label;
6605 * Parses a GNU && label address expression.
6607 static expression_t *parse_label_address(void)
6609 source_position_t const source_position = *HERE;
6611 if (token.kind != T_IDENTIFIER) {
6612 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
6613 return create_error_expression();
6616 label_t *const label = get_label();
6618 label->address_taken = true;
6620 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
6621 expression->base.source_position = source_position;
6623 /* label address is treated as a void pointer */
6624 expression->base.type = type_void_ptr;
6625 expression->label_address.label = label;
6630 * Parse a microsoft __noop expression.
6632 static expression_t *parse_noop_expression(void)
6634 /* the result is a (int)0 */
6635 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_MS_NOOP);
6636 literal->base.type = type_int;
6637 literal->literal.value.begin = "__noop";
6638 literal->literal.value.size = 6;
6642 if (token.kind == '(') {
6643 /* parse arguments */
6645 add_anchor_token(')');
6646 add_anchor_token(',');
6648 if (token.kind != ')') do {
6649 (void)parse_assignment_expression();
6650 } while (next_if(','));
6652 rem_anchor_token(',');
6653 rem_anchor_token(')');
6661 * Parses a primary expression.
6663 static expression_t *parse_primary_expression(void)
6665 switch (token.kind) {
6666 case T_false: return parse_boolean_literal(false);
6667 case T_true: return parse_boolean_literal(true);
6669 case T_FLOATINGPOINT: return parse_number_literal();
6670 case T_CHARACTER_CONSTANT: return parse_character_constant();
6671 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
6672 case T_STRING_LITERAL:
6673 case T_WIDE_STRING_LITERAL: return parse_string_literal();
6674 case T___FUNCTION__:
6675 case T___func__: return parse_function_keyword(FUNCNAME_FUNCTION);
6676 case T___PRETTY_FUNCTION__: return parse_function_keyword(FUNCNAME_PRETTY_FUNCTION);
6677 case T___FUNCSIG__: return parse_function_keyword(FUNCNAME_FUNCSIG);
6678 case T___FUNCDNAME__: return parse_function_keyword(FUNCNAME_FUNCDNAME);
6679 case T___builtin_offsetof: return parse_offsetof();
6680 case T___builtin_va_start: return parse_va_start();
6681 case T___builtin_va_arg: return parse_va_arg();
6682 case T___builtin_va_copy: return parse_va_copy();
6683 case T___builtin_isgreater:
6684 case T___builtin_isgreaterequal:
6685 case T___builtin_isless:
6686 case T___builtin_islessequal:
6687 case T___builtin_islessgreater:
6688 case T___builtin_isunordered: return parse_compare_builtin();
6689 case T___builtin_constant_p: return parse_builtin_constant();
6690 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
6691 case T__assume: return parse_assume();
6694 return parse_label_address();
6697 case '(': return parse_parenthesized_expression();
6698 case T___noop: return parse_noop_expression();
6700 /* Gracefully handle type names while parsing expressions. */
6702 return parse_reference();
6704 if (!is_typedef_symbol(token.base.symbol)) {
6705 return parse_reference();
6709 source_position_t const pos = *HERE;
6710 declaration_specifiers_t specifiers;
6711 parse_declaration_specifiers(&specifiers);
6712 type_t const *const type = parse_abstract_declarator(specifiers.type);
6713 errorf(&pos, "encountered type '%T' while parsing expression", type);
6714 return create_error_expression();
6718 errorf(HERE, "unexpected token %K, expected an expression", &token);
6720 return create_error_expression();
6723 static expression_t *parse_array_expression(expression_t *left)
6725 expression_t *const expr = allocate_expression_zero(EXPR_ARRAY_ACCESS);
6726 array_access_expression_t *const arr = &expr->array_access;
6729 add_anchor_token(']');
6731 expression_t *const inside = parse_expression();
6733 type_t *const orig_type_left = left->base.type;
6734 type_t *const orig_type_inside = inside->base.type;
6736 type_t *const type_left = skip_typeref(orig_type_left);
6737 type_t *const type_inside = skip_typeref(orig_type_inside);
6743 if (is_type_pointer(type_left)) {
6746 idx_type = type_inside;
6747 res_type = type_left->pointer.points_to;
6749 } else if (is_type_pointer(type_inside)) {
6750 arr->flipped = true;
6753 idx_type = type_left;
6754 res_type = type_inside->pointer.points_to;
6756 res_type = automatic_type_conversion(res_type);
6757 if (!is_type_integer(idx_type)) {
6758 errorf(&idx->base.source_position, "array subscript must have integer type");
6759 } else if (is_type_atomic(idx_type, ATOMIC_TYPE_CHAR)) {
6760 source_position_t const *const pos = &idx->base.source_position;
6761 warningf(WARN_CHAR_SUBSCRIPTS, pos, "array subscript has char type");
6764 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
6765 errorf(&expr->base.source_position, "invalid types '%T[%T]' for array access", orig_type_left, orig_type_inside);
6767 res_type = type_error_type;
6772 arr->array_ref = ref;
6774 arr->base.type = res_type;
6776 rem_anchor_token(']');
6781 static bool is_bitfield(const expression_t *expression)
6783 return expression->kind == EXPR_SELECT
6784 && expression->select.compound_entry->compound_member.bitfield;
6787 static expression_t *parse_typeprop(expression_kind_t const kind)
6789 expression_t *tp_expression = allocate_expression_zero(kind);
6790 tp_expression->base.type = type_size_t;
6792 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
6795 expression_t *expression;
6796 if (token.kind == '(' && is_declaration_specifier(look_ahead(1))) {
6797 source_position_t const pos = *HERE;
6799 add_anchor_token(')');
6800 orig_type = parse_typename();
6801 rem_anchor_token(')');
6804 if (token.kind == '{') {
6805 /* It was not sizeof(type) after all. It is sizeof of an expression
6806 * starting with a compound literal */
6807 expression = parse_compound_literal(&pos, orig_type);
6808 goto typeprop_expression;
6811 expression = parse_subexpression(PREC_UNARY);
6813 typeprop_expression:
6814 if (is_bitfield(expression)) {
6815 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6816 errorf(&tp_expression->base.source_position,
6817 "operand of %s expression must not be a bitfield", what);
6820 tp_expression->typeprop.tp_expression = expression;
6822 orig_type = revert_automatic_type_conversion(expression);
6823 expression->base.type = orig_type;
6826 tp_expression->typeprop.type = orig_type;
6827 type_t const* const type = skip_typeref(orig_type);
6828 char const* wrong_type = NULL;
6829 if (is_type_incomplete(type)) {
6830 if (!is_type_void(type) || !GNU_MODE)
6831 wrong_type = "incomplete";
6832 } else if (type->kind == TYPE_FUNCTION) {
6834 /* function types are allowed (and return 1) */
6835 source_position_t const *const pos = &tp_expression->base.source_position;
6836 char const *const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6837 warningf(WARN_OTHER, pos, "%s expression with function argument returns invalid result", what);
6839 wrong_type = "function";
6843 if (wrong_type != NULL) {
6844 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6845 errorf(&tp_expression->base.source_position,
6846 "operand of %s expression must not be of %s type '%T'",
6847 what, wrong_type, orig_type);
6850 return tp_expression;
6853 static expression_t *parse_sizeof(void)
6855 return parse_typeprop(EXPR_SIZEOF);
6858 static expression_t *parse_alignof(void)
6860 return parse_typeprop(EXPR_ALIGNOF);
6863 static expression_t *parse_select_expression(expression_t *addr)
6865 assert(token.kind == '.' || token.kind == T_MINUSGREATER);
6866 bool select_left_arrow = (token.kind == T_MINUSGREATER);
6867 source_position_t const pos = *HERE;
6870 symbol_t *const symbol = expect_identifier("while parsing select", NULL);
6872 return create_error_expression();
6874 type_t *const orig_type = addr->base.type;
6875 type_t *const type = skip_typeref(orig_type);
6878 bool saw_error = false;
6879 if (is_type_pointer(type)) {
6880 if (!select_left_arrow) {
6882 "request for member '%Y' in something not a struct or union, but '%T'",
6886 type_left = skip_typeref(type->pointer.points_to);
6888 if (select_left_arrow && is_type_valid(type)) {
6889 errorf(&pos, "left hand side of '->' is not a pointer, but '%T'", orig_type);
6895 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
6896 type_left->kind != TYPE_COMPOUND_UNION) {
6898 if (is_type_valid(type_left) && !saw_error) {
6900 "request for member '%Y' in something not a struct or union, but '%T'",
6903 return create_error_expression();
6906 compound_t *compound = type_left->compound.compound;
6907 if (!compound->complete) {
6908 errorf(&pos, "request for member '%Y' in incomplete type '%T'",
6910 return create_error_expression();
6913 type_qualifiers_t qualifiers = type_left->base.qualifiers;
6914 expression_t *result =
6915 find_create_select(&pos, addr, qualifiers, compound, symbol);
6917 if (result == NULL) {
6918 errorf(&pos, "'%T' has no member named '%Y'", orig_type, symbol);
6919 return create_error_expression();
6925 static void check_call_argument(type_t *expected_type,
6926 call_argument_t *argument, unsigned pos)
6928 type_t *expected_type_skip = skip_typeref(expected_type);
6929 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
6930 expression_t *arg_expr = argument->expression;
6931 type_t *arg_type = skip_typeref(arg_expr->base.type);
6933 /* handle transparent union gnu extension */
6934 if (is_type_union(expected_type_skip)
6935 && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
6936 compound_t *union_decl = expected_type_skip->compound.compound;
6937 type_t *best_type = NULL;
6938 entity_t *entry = union_decl->members.entities;
6939 for ( ; entry != NULL; entry = entry->base.next) {
6940 assert(is_declaration(entry));
6941 type_t *decl_type = entry->declaration.type;
6942 error = semantic_assign(decl_type, arg_expr);
6943 if (error == ASSIGN_ERROR_INCOMPATIBLE
6944 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
6947 if (error == ASSIGN_SUCCESS) {
6948 best_type = decl_type;
6949 } else if (best_type == NULL) {
6950 best_type = decl_type;
6954 if (best_type != NULL) {
6955 expected_type = best_type;
6959 error = semantic_assign(expected_type, arg_expr);
6960 argument->expression = create_implicit_cast(arg_expr, expected_type);
6962 if (error != ASSIGN_SUCCESS) {
6963 /* report exact scope in error messages (like "in argument 3") */
6965 snprintf(buf, sizeof(buf), "call argument %u", pos);
6966 report_assign_error(error, expected_type, arg_expr, buf,
6967 &arg_expr->base.source_position);
6969 type_t *const promoted_type = get_default_promoted_type(arg_type);
6970 if (!types_compatible(expected_type_skip, promoted_type) &&
6971 !types_compatible(expected_type_skip, type_void_ptr) &&
6972 !types_compatible(type_void_ptr, promoted_type)) {
6973 /* Deliberately show the skipped types in this warning */
6974 source_position_t const *const apos = &arg_expr->base.source_position;
6975 warningf(WARN_TRADITIONAL, apos, "passing call argument %u as '%T' rather than '%T' due to prototype", pos, expected_type_skip, promoted_type);
6981 * Handle the semantic restrictions of builtin calls
6983 static void handle_builtin_argument_restrictions(call_expression_t *call)
6985 entity_t *entity = call->function->reference.entity;
6986 switch (entity->function.btk) {
6988 switch (entity->function.b.firm_builtin_kind) {
6989 case ir_bk_return_address:
6990 case ir_bk_frame_address: {
6991 /* argument must be constant */
6992 call_argument_t *argument = call->arguments;
6994 if (is_constant_expression(argument->expression) == EXPR_CLASS_VARIABLE) {
6995 errorf(&call->base.source_position,
6996 "argument of '%Y' must be a constant expression",
6997 call->function->reference.entity->base.symbol);
7001 case ir_bk_prefetch:
7002 /* second and third argument must be constant if existent */
7003 if (call->arguments == NULL)
7005 call_argument_t *rw = call->arguments->next;
7006 call_argument_t *locality = NULL;
7009 if (is_constant_expression(rw->expression) == EXPR_CLASS_VARIABLE) {
7010 errorf(&call->base.source_position,
7011 "second argument of '%Y' must be a constant expression",
7012 call->function->reference.entity->base.symbol);
7014 locality = rw->next;
7016 if (locality != NULL) {
7017 if (is_constant_expression(locality->expression) == EXPR_CLASS_VARIABLE) {
7018 errorf(&call->base.source_position,
7019 "third argument of '%Y' must be a constant expression",
7020 call->function->reference.entity->base.symbol);
7022 locality = rw->next;
7029 case BUILTIN_OBJECT_SIZE:
7030 if (call->arguments == NULL)
7033 call_argument_t *arg = call->arguments->next;
7034 if (arg != NULL && is_constant_expression(arg->expression) == EXPR_CLASS_VARIABLE) {
7035 errorf(&call->base.source_position,
7036 "second argument of '%Y' must be a constant expression",
7037 call->function->reference.entity->base.symbol);
7046 * Parse a call expression, ie. expression '( ... )'.
7048 * @param expression the function address
7050 static expression_t *parse_call_expression(expression_t *expression)
7052 expression_t *result = allocate_expression_zero(EXPR_CALL);
7053 call_expression_t *call = &result->call;
7054 call->function = expression;
7056 type_t *const orig_type = expression->base.type;
7057 type_t *const type = skip_typeref(orig_type);
7059 function_type_t *function_type = NULL;
7060 if (is_type_pointer(type)) {
7061 type_t *const to_type = skip_typeref(type->pointer.points_to);
7063 if (is_type_function(to_type)) {
7064 function_type = &to_type->function;
7065 call->base.type = function_type->return_type;
7069 if (function_type == NULL && is_type_valid(type)) {
7071 "called object '%E' (type '%T') is not a pointer to a function",
7072 expression, orig_type);
7075 /* parse arguments */
7077 add_anchor_token(')');
7078 add_anchor_token(',');
7080 if (token.kind != ')') {
7081 call_argument_t **anchor = &call->arguments;
7083 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7084 argument->expression = parse_assignment_expression();
7087 anchor = &argument->next;
7088 } while (next_if(','));
7090 rem_anchor_token(',');
7091 rem_anchor_token(')');
7094 if (function_type == NULL)
7097 /* check type and count of call arguments */
7098 function_parameter_t *parameter = function_type->parameters;
7099 call_argument_t *argument = call->arguments;
7100 if (!function_type->unspecified_parameters) {
7101 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7102 parameter = parameter->next, argument = argument->next) {
7103 check_call_argument(parameter->type, argument, ++pos);
7106 if (parameter != NULL) {
7107 errorf(&expression->base.source_position, "too few arguments to function '%E'", expression);
7108 } else if (argument != NULL && !function_type->variadic) {
7109 errorf(&argument->expression->base.source_position, "too many arguments to function '%E'", expression);
7113 /* do default promotion for other arguments */
7114 for (; argument != NULL; argument = argument->next) {
7115 type_t *argument_type = argument->expression->base.type;
7116 if (!is_type_object(skip_typeref(argument_type))) {
7117 errorf(&argument->expression->base.source_position,
7118 "call argument '%E' must not be void", argument->expression);
7121 argument_type = get_default_promoted_type(argument_type);
7123 argument->expression
7124 = create_implicit_cast(argument->expression, argument_type);
7129 if (is_type_compound(skip_typeref(function_type->return_type))) {
7130 source_position_t const *const pos = &expression->base.source_position;
7131 warningf(WARN_AGGREGATE_RETURN, pos, "function call has aggregate value");
7134 if (expression->kind == EXPR_REFERENCE) {
7135 reference_expression_t *reference = &expression->reference;
7136 if (reference->entity->kind == ENTITY_FUNCTION &&
7137 reference->entity->function.btk != BUILTIN_NONE)
7138 handle_builtin_argument_restrictions(call);
7144 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7146 static bool same_compound_type(const type_t *type1, const type_t *type2)
7149 is_type_compound(type1) &&
7150 type1->kind == type2->kind &&
7151 type1->compound.compound == type2->compound.compound;
7154 static expression_t const *get_reference_address(expression_t const *expr)
7156 bool regular_take_address = true;
7158 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7159 expr = expr->unary.value;
7161 regular_take_address = false;
7164 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7167 expr = expr->unary.value;
7170 if (expr->kind != EXPR_REFERENCE)
7173 /* special case for functions which are automatically converted to a
7174 * pointer to function without an extra TAKE_ADDRESS operation */
7175 if (!regular_take_address &&
7176 expr->reference.entity->kind != ENTITY_FUNCTION) {
7183 static void warn_reference_address_as_bool(expression_t const* expr)
7185 expr = get_reference_address(expr);
7187 source_position_t const *const pos = &expr->base.source_position;
7188 entity_t const *const ent = expr->reference.entity;
7189 warningf(WARN_ADDRESS, pos, "the address of '%N' will always evaluate as 'true'", ent);
7193 static void warn_assignment_in_condition(const expression_t *const expr)
7195 if (expr->base.kind != EXPR_BINARY_ASSIGN)
7197 if (expr->base.parenthesized)
7199 source_position_t const *const pos = &expr->base.source_position;
7200 warningf(WARN_PARENTHESES, pos, "suggest parentheses around assignment used as truth value");
7203 static void semantic_condition(expression_t const *const expr,
7204 char const *const context)
7206 type_t *const type = skip_typeref(expr->base.type);
7207 if (is_type_scalar(type)) {
7208 warn_reference_address_as_bool(expr);
7209 warn_assignment_in_condition(expr);
7210 } else if (is_type_valid(type)) {
7211 errorf(&expr->base.source_position,
7212 "%s must have scalar type", context);
7217 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7219 * @param expression the conditional expression
7221 static expression_t *parse_conditional_expression(expression_t *expression)
7223 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7225 conditional_expression_t *conditional = &result->conditional;
7226 conditional->condition = expression;
7229 add_anchor_token(':');
7231 /* §6.5.15:2 The first operand shall have scalar type. */
7232 semantic_condition(expression, "condition of conditional operator");
7234 expression_t *true_expression = expression;
7235 bool gnu_cond = false;
7236 if (GNU_MODE && token.kind == ':') {
7239 true_expression = parse_expression();
7241 rem_anchor_token(':');
7243 expression_t *false_expression =
7244 parse_subexpression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7246 type_t *const orig_true_type = true_expression->base.type;
7247 type_t *const orig_false_type = false_expression->base.type;
7248 type_t *const true_type = skip_typeref(orig_true_type);
7249 type_t *const false_type = skip_typeref(orig_false_type);
7252 source_position_t const *const pos = &conditional->base.source_position;
7253 type_t *result_type;
7254 if (is_type_void(true_type) || is_type_void(false_type)) {
7255 /* ISO/IEC 14882:1998(E) §5.16:2 */
7256 if (true_expression->kind == EXPR_UNARY_THROW) {
7257 result_type = false_type;
7258 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7259 result_type = true_type;
7261 if (!is_type_void(true_type) || !is_type_void(false_type)) {
7262 warningf(WARN_OTHER, pos, "ISO C forbids conditional expression with only one void side");
7264 result_type = type_void;
7266 } else if (is_type_arithmetic(true_type)
7267 && is_type_arithmetic(false_type)) {
7268 result_type = semantic_arithmetic(true_type, false_type);
7269 } else if (same_compound_type(true_type, false_type)) {
7270 /* just take 1 of the 2 types */
7271 result_type = true_type;
7272 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7273 type_t *pointer_type;
7275 expression_t *other_expression;
7276 if (is_type_pointer(true_type) &&
7277 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7278 pointer_type = true_type;
7279 other_type = false_type;
7280 other_expression = false_expression;
7282 pointer_type = false_type;
7283 other_type = true_type;
7284 other_expression = true_expression;
7287 if (is_null_pointer_constant(other_expression)) {
7288 result_type = pointer_type;
7289 } else if (is_type_pointer(other_type)) {
7290 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7291 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7294 if (is_type_void(to1) || is_type_void(to2)) {
7296 } else if (types_compatible(get_unqualified_type(to1),
7297 get_unqualified_type(to2))) {
7300 warningf(WARN_OTHER, pos, "pointer types '%T' and '%T' in conditional expression are incompatible", true_type, false_type);
7304 type_t *const type =
7305 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7306 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7307 } else if (is_type_integer(other_type)) {
7308 warningf(WARN_OTHER, pos, "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7309 result_type = pointer_type;
7311 goto types_incompatible;
7315 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7316 type_error_incompatible("while parsing conditional", pos, true_type, false_type);
7318 result_type = type_error_type;
7321 conditional->true_expression
7322 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7323 conditional->false_expression
7324 = create_implicit_cast(false_expression, result_type);
7325 conditional->base.type = result_type;
7330 * Parse an extension expression.
7332 static expression_t *parse_extension(void)
7335 expression_t *expression = parse_subexpression(PREC_UNARY);
7341 * Parse a __builtin_classify_type() expression.
7343 static expression_t *parse_builtin_classify_type(void)
7345 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7346 result->base.type = type_int;
7348 eat(T___builtin_classify_type);
7350 add_anchor_token(')');
7352 expression_t *expression = parse_expression();
7353 rem_anchor_token(')');
7355 result->classify_type.type_expression = expression;
7361 * Parse a delete expression
7362 * ISO/IEC 14882:1998(E) §5.3.5
7364 static expression_t *parse_delete(void)
7366 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7367 result->base.type = type_void;
7372 result->kind = EXPR_UNARY_DELETE_ARRAY;
7376 expression_t *const value = parse_subexpression(PREC_CAST);
7377 result->unary.value = value;
7379 type_t *const type = skip_typeref(value->base.type);
7380 if (!is_type_pointer(type)) {
7381 if (is_type_valid(type)) {
7382 errorf(&value->base.source_position,
7383 "operand of delete must have pointer type");
7385 } else if (is_type_void(skip_typeref(type->pointer.points_to))) {
7386 source_position_t const *const pos = &value->base.source_position;
7387 warningf(WARN_OTHER, pos, "deleting 'void*' is undefined");
7394 * Parse a throw expression
7395 * ISO/IEC 14882:1998(E) §15:1
7397 static expression_t *parse_throw(void)
7399 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7400 result->base.type = type_void;
7404 expression_t *value = NULL;
7405 switch (token.kind) {
7407 value = parse_assignment_expression();
7408 /* ISO/IEC 14882:1998(E) §15.1:3 */
7409 type_t *const orig_type = value->base.type;
7410 type_t *const type = skip_typeref(orig_type);
7411 if (is_type_incomplete(type)) {
7412 errorf(&value->base.source_position,
7413 "cannot throw object of incomplete type '%T'", orig_type);
7414 } else if (is_type_pointer(type)) {
7415 type_t *const points_to = skip_typeref(type->pointer.points_to);
7416 if (is_type_incomplete(points_to) && !is_type_void(points_to)) {
7417 errorf(&value->base.source_position,
7418 "cannot throw pointer to incomplete type '%T'", orig_type);
7426 result->unary.value = value;
7431 static bool check_pointer_arithmetic(const source_position_t *source_position,
7432 type_t *pointer_type,
7433 type_t *orig_pointer_type)
7435 type_t *points_to = pointer_type->pointer.points_to;
7436 points_to = skip_typeref(points_to);
7438 if (is_type_incomplete(points_to)) {
7439 if (!GNU_MODE || !is_type_void(points_to)) {
7440 errorf(source_position,
7441 "arithmetic with pointer to incomplete type '%T' not allowed",
7445 warningf(WARN_POINTER_ARITH, source_position, "pointer of type '%T' used in arithmetic", orig_pointer_type);
7447 } else if (is_type_function(points_to)) {
7449 errorf(source_position,
7450 "arithmetic with pointer to function type '%T' not allowed",
7454 warningf(WARN_POINTER_ARITH, source_position, "pointer to a function '%T' used in arithmetic", orig_pointer_type);
7460 static bool is_lvalue(const expression_t *expression)
7462 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
7463 switch (expression->kind) {
7464 case EXPR_ARRAY_ACCESS:
7465 case EXPR_COMPOUND_LITERAL:
7466 case EXPR_REFERENCE:
7468 case EXPR_UNARY_DEREFERENCE:
7472 type_t *type = skip_typeref(expression->base.type);
7474 /* ISO/IEC 14882:1998(E) §3.10:3 */
7475 is_type_reference(type) ||
7476 /* Claim it is an lvalue, if the type is invalid. There was a parse
7477 * error before, which maybe prevented properly recognizing it as
7479 !is_type_valid(type);
7484 static void semantic_incdec(unary_expression_t *expression)
7486 type_t *const orig_type = expression->value->base.type;
7487 type_t *const type = skip_typeref(orig_type);
7488 if (is_type_pointer(type)) {
7489 if (!check_pointer_arithmetic(&expression->base.source_position,
7493 } else if (!is_type_real(type) && is_type_valid(type)) {
7494 /* TODO: improve error message */
7495 errorf(&expression->base.source_position,
7496 "operation needs an arithmetic or pointer type");
7499 if (!is_lvalue(expression->value)) {
7500 /* TODO: improve error message */
7501 errorf(&expression->base.source_position, "lvalue required as operand");
7503 expression->base.type = orig_type;
7506 static void promote_unary_int_expr(unary_expression_t *const expr, type_t *const type)
7508 type_t *const res_type = promote_integer(type);
7509 expr->base.type = res_type;
7510 expr->value = create_implicit_cast(expr->value, res_type);
7513 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
7515 type_t *const orig_type = expression->value->base.type;
7516 type_t *const type = skip_typeref(orig_type);
7517 if (!is_type_arithmetic(type)) {
7518 if (is_type_valid(type)) {
7519 /* TODO: improve error message */
7520 errorf(&expression->base.source_position,
7521 "operation needs an arithmetic type");
7524 } else if (is_type_integer(type)) {
7525 promote_unary_int_expr(expression, type);
7527 expression->base.type = orig_type;
7531 static void semantic_unexpr_plus(unary_expression_t *expression)
7533 semantic_unexpr_arithmetic(expression);
7534 source_position_t const *const pos = &expression->base.source_position;
7535 warningf(WARN_TRADITIONAL, pos, "traditional C rejects the unary plus operator");
7538 static void semantic_not(unary_expression_t *expression)
7540 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
7541 semantic_condition(expression->value, "operand of !");
7542 expression->base.type = c_mode & _CXX ? type_bool : type_int;
7545 static void semantic_unexpr_integer(unary_expression_t *expression)
7547 type_t *const orig_type = expression->value->base.type;
7548 type_t *const type = skip_typeref(orig_type);
7549 if (!is_type_integer(type)) {
7550 if (is_type_valid(type)) {
7551 errorf(&expression->base.source_position,
7552 "operand of ~ must be of integer type");
7557 promote_unary_int_expr(expression, type);
7560 static void semantic_dereference(unary_expression_t *expression)
7562 type_t *const orig_type = expression->value->base.type;
7563 type_t *const type = skip_typeref(orig_type);
7564 if (!is_type_pointer(type)) {
7565 if (is_type_valid(type)) {
7566 errorf(&expression->base.source_position,
7567 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
7572 type_t *result_type = type->pointer.points_to;
7573 result_type = automatic_type_conversion(result_type);
7574 expression->base.type = result_type;
7578 * Record that an address is taken (expression represents an lvalue).
7580 * @param expression the expression
7581 * @param may_be_register if true, the expression might be an register
7583 static void set_address_taken(expression_t *expression, bool may_be_register)
7585 if (expression->kind != EXPR_REFERENCE)
7588 entity_t *const entity = expression->reference.entity;
7590 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
7593 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
7594 && !may_be_register) {
7595 source_position_t const *const pos = &expression->base.source_position;
7596 errorf(pos, "address of register '%N' requested", entity);
7599 entity->variable.address_taken = true;
7603 * Check the semantic of the address taken expression.
7605 static void semantic_take_addr(unary_expression_t *expression)
7607 expression_t *value = expression->value;
7608 value->base.type = revert_automatic_type_conversion(value);
7610 type_t *orig_type = value->base.type;
7611 type_t *type = skip_typeref(orig_type);
7612 if (!is_type_valid(type))
7616 if (!is_lvalue(value)) {
7617 errorf(&expression->base.source_position, "'&' requires an lvalue");
7619 if (is_bitfield(value)) {
7620 errorf(&expression->base.source_position,
7621 "'&' not allowed on bitfield");
7624 set_address_taken(value, false);
7626 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
7629 #define CREATE_UNARY_EXPRESSION_PARSER(token_kind, unexpression_type, sfunc) \
7630 static expression_t *parse_##unexpression_type(void) \
7632 expression_t *unary_expression \
7633 = allocate_expression_zero(unexpression_type); \
7635 unary_expression->unary.value = parse_subexpression(PREC_UNARY); \
7637 sfunc(&unary_expression->unary); \
7639 return unary_expression; \
7642 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
7643 semantic_unexpr_arithmetic)
7644 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
7645 semantic_unexpr_plus)
7646 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
7648 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
7649 semantic_dereference)
7650 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
7652 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
7653 semantic_unexpr_integer)
7654 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
7656 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
7659 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_kind, unexpression_type, \
7661 static expression_t *parse_##unexpression_type(expression_t *left) \
7663 expression_t *unary_expression \
7664 = allocate_expression_zero(unexpression_type); \
7666 unary_expression->unary.value = left; \
7668 sfunc(&unary_expression->unary); \
7670 return unary_expression; \
7673 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
7674 EXPR_UNARY_POSTFIX_INCREMENT,
7676 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
7677 EXPR_UNARY_POSTFIX_DECREMENT,
7680 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
7682 /* TODO: handle complex + imaginary types */
7684 type_left = get_unqualified_type(type_left);
7685 type_right = get_unqualified_type(type_right);
7687 /* §6.3.1.8 Usual arithmetic conversions */
7688 if (type_left == type_long_double || type_right == type_long_double) {
7689 return type_long_double;
7690 } else if (type_left == type_double || type_right == type_double) {
7692 } else if (type_left == type_float || type_right == type_float) {
7696 type_left = promote_integer(type_left);
7697 type_right = promote_integer(type_right);
7699 if (type_left == type_right)
7702 bool const signed_left = is_type_signed(type_left);
7703 bool const signed_right = is_type_signed(type_right);
7704 unsigned const rank_left = get_akind_rank(get_akind(type_left));
7705 unsigned const rank_right = get_akind_rank(get_akind(type_right));
7707 if (signed_left == signed_right)
7708 return rank_left >= rank_right ? type_left : type_right;
7712 atomic_type_kind_t s_akind;
7713 atomic_type_kind_t u_akind;
7718 u_type = type_right;
7720 s_type = type_right;
7723 s_akind = get_akind(s_type);
7724 u_akind = get_akind(u_type);
7725 s_rank = get_akind_rank(s_akind);
7726 u_rank = get_akind_rank(u_akind);
7728 if (u_rank >= s_rank)
7731 if (get_atomic_type_size(s_akind) > get_atomic_type_size(u_akind))
7735 case ATOMIC_TYPE_INT: return type_unsigned_int;
7736 case ATOMIC_TYPE_LONG: return type_unsigned_long;
7737 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
7739 default: panic("invalid atomic type");
7744 * Check the semantic restrictions for a binary expression.
7746 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
7748 expression_t *const left = expression->left;
7749 expression_t *const right = expression->right;
7750 type_t *const orig_type_left = left->base.type;
7751 type_t *const orig_type_right = right->base.type;
7752 type_t *const type_left = skip_typeref(orig_type_left);
7753 type_t *const type_right = skip_typeref(orig_type_right);
7755 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
7756 /* TODO: improve error message */
7757 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7758 errorf(&expression->base.source_position,
7759 "operation needs arithmetic types");
7764 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7765 expression->left = create_implicit_cast(left, arithmetic_type);
7766 expression->right = create_implicit_cast(right, arithmetic_type);
7767 expression->base.type = arithmetic_type;
7770 static void semantic_binexpr_integer(binary_expression_t *const expression)
7772 expression_t *const left = expression->left;
7773 expression_t *const right = expression->right;
7774 type_t *const orig_type_left = left->base.type;
7775 type_t *const orig_type_right = right->base.type;
7776 type_t *const type_left = skip_typeref(orig_type_left);
7777 type_t *const type_right = skip_typeref(orig_type_right);
7779 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
7780 /* TODO: improve error message */
7781 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7782 errorf(&expression->base.source_position,
7783 "operation needs integer types");
7788 type_t *const result_type = semantic_arithmetic(type_left, type_right);
7789 expression->left = create_implicit_cast(left, result_type);
7790 expression->right = create_implicit_cast(right, result_type);
7791 expression->base.type = result_type;
7794 static void warn_div_by_zero(binary_expression_t const *const expression)
7796 if (!is_type_integer(expression->base.type))
7799 expression_t const *const right = expression->right;
7800 /* The type of the right operand can be different for /= */
7801 if (is_type_integer(right->base.type) &&
7802 is_constant_expression(right) == EXPR_CLASS_CONSTANT &&
7803 !fold_constant_to_bool(right)) {
7804 source_position_t const *const pos = &expression->base.source_position;
7805 warningf(WARN_DIV_BY_ZERO, pos, "division by zero");
7810 * Check the semantic restrictions for a div/mod expression.
7812 static void semantic_divmod_arithmetic(binary_expression_t *expression)
7814 semantic_binexpr_arithmetic(expression);
7815 warn_div_by_zero(expression);
7818 static void warn_addsub_in_shift(const expression_t *const expr)
7820 if (expr->base.parenthesized)
7824 switch (expr->kind) {
7825 case EXPR_BINARY_ADD: op = '+'; break;
7826 case EXPR_BINARY_SUB: op = '-'; break;
7830 source_position_t const *const pos = &expr->base.source_position;
7831 warningf(WARN_PARENTHESES, pos, "suggest parentheses around '%c' inside shift", op);
7834 static bool semantic_shift(binary_expression_t *expression)
7836 expression_t *const left = expression->left;
7837 expression_t *const right = expression->right;
7838 type_t *const orig_type_left = left->base.type;
7839 type_t *const orig_type_right = right->base.type;
7840 type_t * type_left = skip_typeref(orig_type_left);
7841 type_t * type_right = skip_typeref(orig_type_right);
7843 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
7844 /* TODO: improve error message */
7845 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7846 errorf(&expression->base.source_position,
7847 "operands of shift operation must have integer types");
7852 type_left = promote_integer(type_left);
7854 if (is_constant_expression(right) == EXPR_CLASS_CONSTANT) {
7855 source_position_t const *const pos = &right->base.source_position;
7856 long const count = fold_constant_to_int(right);
7858 warningf(WARN_OTHER, pos, "shift count must be non-negative");
7859 } else if ((unsigned long)count >=
7860 get_atomic_type_size(type_left->atomic.akind) * 8) {
7861 warningf(WARN_OTHER, pos, "shift count must be less than type width");
7865 type_right = promote_integer(type_right);
7866 expression->right = create_implicit_cast(right, type_right);
7871 static void semantic_shift_op(binary_expression_t *expression)
7873 expression_t *const left = expression->left;
7874 expression_t *const right = expression->right;
7876 if (!semantic_shift(expression))
7879 warn_addsub_in_shift(left);
7880 warn_addsub_in_shift(right);
7882 type_t *const orig_type_left = left->base.type;
7883 type_t * type_left = skip_typeref(orig_type_left);
7885 type_left = promote_integer(type_left);
7886 expression->left = create_implicit_cast(left, type_left);
7887 expression->base.type = type_left;
7890 static void semantic_add(binary_expression_t *expression)
7892 expression_t *const left = expression->left;
7893 expression_t *const right = expression->right;
7894 type_t *const orig_type_left = left->base.type;
7895 type_t *const orig_type_right = right->base.type;
7896 type_t *const type_left = skip_typeref(orig_type_left);
7897 type_t *const type_right = skip_typeref(orig_type_right);
7900 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7901 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7902 expression->left = create_implicit_cast(left, arithmetic_type);
7903 expression->right = create_implicit_cast(right, arithmetic_type);
7904 expression->base.type = arithmetic_type;
7905 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
7906 check_pointer_arithmetic(&expression->base.source_position,
7907 type_left, orig_type_left);
7908 expression->base.type = type_left;
7909 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
7910 check_pointer_arithmetic(&expression->base.source_position,
7911 type_right, orig_type_right);
7912 expression->base.type = type_right;
7913 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
7914 errorf(&expression->base.source_position,
7915 "invalid operands to binary + ('%T', '%T')",
7916 orig_type_left, orig_type_right);
7920 static void semantic_sub(binary_expression_t *expression)
7922 expression_t *const left = expression->left;
7923 expression_t *const right = expression->right;
7924 type_t *const orig_type_left = left->base.type;
7925 type_t *const orig_type_right = right->base.type;
7926 type_t *const type_left = skip_typeref(orig_type_left);
7927 type_t *const type_right = skip_typeref(orig_type_right);
7928 source_position_t const *const pos = &expression->base.source_position;
7931 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7932 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7933 expression->left = create_implicit_cast(left, arithmetic_type);
7934 expression->right = create_implicit_cast(right, arithmetic_type);
7935 expression->base.type = arithmetic_type;
7936 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
7937 check_pointer_arithmetic(&expression->base.source_position,
7938 type_left, orig_type_left);
7939 expression->base.type = type_left;
7940 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
7941 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
7942 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
7943 if (!types_compatible(unqual_left, unqual_right)) {
7945 "subtracting pointers to incompatible types '%T' and '%T'",
7946 orig_type_left, orig_type_right);
7947 } else if (!is_type_object(unqual_left)) {
7948 if (!is_type_void(unqual_left)) {
7949 errorf(pos, "subtracting pointers to non-object types '%T'",
7952 warningf(WARN_OTHER, pos, "subtracting pointers to void");
7955 expression->base.type = type_ptrdiff_t;
7956 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
7957 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
7958 orig_type_left, orig_type_right);
7962 static void warn_string_literal_address(expression_t const* expr)
7964 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7965 expr = expr->unary.value;
7966 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7968 expr = expr->unary.value;
7971 if (expr->kind == EXPR_STRING_LITERAL
7972 || expr->kind == EXPR_WIDE_STRING_LITERAL) {
7973 source_position_t const *const pos = &expr->base.source_position;
7974 warningf(WARN_ADDRESS, pos, "comparison with string literal results in unspecified behaviour");
7978 static bool maybe_negative(expression_t const *const expr)
7980 switch (is_constant_expression(expr)) {
7981 case EXPR_CLASS_ERROR: return false;
7982 case EXPR_CLASS_CONSTANT: return constant_is_negative(expr);
7983 default: return true;
7987 static void warn_comparison(source_position_t const *const pos, expression_t const *const expr, expression_t const *const other)
7989 warn_string_literal_address(expr);
7991 expression_t const* const ref = get_reference_address(expr);
7992 if (ref != NULL && is_null_pointer_constant(other)) {
7993 entity_t const *const ent = ref->reference.entity;
7994 warningf(WARN_ADDRESS, pos, "the address of '%N' will never be NULL", ent);
7997 if (!expr->base.parenthesized) {
7998 switch (expr->base.kind) {
7999 case EXPR_BINARY_LESS:
8000 case EXPR_BINARY_GREATER:
8001 case EXPR_BINARY_LESSEQUAL:
8002 case EXPR_BINARY_GREATEREQUAL:
8003 case EXPR_BINARY_NOTEQUAL:
8004 case EXPR_BINARY_EQUAL:
8005 warningf(WARN_PARENTHESES, pos, "comparisons like 'x <= y < z' do not have their mathematical meaning");
8014 * Check the semantics of comparison expressions.
8016 * @param expression The expression to check.
8018 static void semantic_comparison(binary_expression_t *expression)
8020 source_position_t const *const pos = &expression->base.source_position;
8021 expression_t *const left = expression->left;
8022 expression_t *const right = expression->right;
8024 warn_comparison(pos, left, right);
8025 warn_comparison(pos, right, left);
8027 type_t *orig_type_left = left->base.type;
8028 type_t *orig_type_right = right->base.type;
8029 type_t *type_left = skip_typeref(orig_type_left);
8030 type_t *type_right = skip_typeref(orig_type_right);
8032 /* TODO non-arithmetic types */
8033 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8034 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8036 /* test for signed vs unsigned compares */
8037 if (is_type_integer(arithmetic_type)) {
8038 bool const signed_left = is_type_signed(type_left);
8039 bool const signed_right = is_type_signed(type_right);
8040 if (signed_left != signed_right) {
8041 /* FIXME long long needs better const folding magic */
8042 /* TODO check whether constant value can be represented by other type */
8043 if ((signed_left && maybe_negative(left)) ||
8044 (signed_right && maybe_negative(right))) {
8045 warningf(WARN_SIGN_COMPARE, pos, "comparison between signed and unsigned");
8050 expression->left = create_implicit_cast(left, arithmetic_type);
8051 expression->right = create_implicit_cast(right, arithmetic_type);
8052 expression->base.type = arithmetic_type;
8053 if ((expression->base.kind == EXPR_BINARY_EQUAL ||
8054 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8055 is_type_float(arithmetic_type)) {
8056 warningf(WARN_FLOAT_EQUAL, pos, "comparing floating point with == or != is unsafe");
8058 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8059 /* TODO check compatibility */
8060 } else if (is_type_pointer(type_left)) {
8061 expression->right = create_implicit_cast(right, type_left);
8062 } else if (is_type_pointer(type_right)) {
8063 expression->left = create_implicit_cast(left, type_right);
8064 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8065 type_error_incompatible("invalid operands in comparison", pos, type_left, type_right);
8067 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8071 * Checks if a compound type has constant fields.
8073 static bool has_const_fields(const compound_type_t *type)
8075 compound_t *compound = type->compound;
8076 entity_t *entry = compound->members.entities;
8078 for (; entry != NULL; entry = entry->base.next) {
8079 if (!is_declaration(entry))
8082 const type_t *decl_type = skip_typeref(entry->declaration.type);
8083 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8090 static bool is_valid_assignment_lhs(expression_t const* const left)
8092 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8093 type_t *const type_left = skip_typeref(orig_type_left);
8095 if (!is_lvalue(left)) {
8096 errorf(&left->base.source_position, "left hand side '%E' of assignment is not an lvalue",
8101 if (left->kind == EXPR_REFERENCE
8102 && left->reference.entity->kind == ENTITY_FUNCTION) {
8103 errorf(&left->base.source_position, "cannot assign to function '%E'", left);
8107 if (is_type_array(type_left)) {
8108 errorf(&left->base.source_position, "cannot assign to array '%E'", left);
8111 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8112 errorf(&left->base.source_position, "assignment to read-only location '%E' (type '%T')", left,
8116 if (is_type_incomplete(type_left)) {
8117 errorf(&left->base.source_position, "left-hand side '%E' of assignment has incomplete type '%T'",
8118 left, orig_type_left);
8121 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8122 errorf(&left->base.source_position, "cannot assign to '%E' because compound type '%T' has read-only fields",
8123 left, orig_type_left);
8130 static void semantic_arithmetic_assign(binary_expression_t *expression)
8132 expression_t *left = expression->left;
8133 expression_t *right = expression->right;
8134 type_t *orig_type_left = left->base.type;
8135 type_t *orig_type_right = right->base.type;
8137 if (!is_valid_assignment_lhs(left))
8140 type_t *type_left = skip_typeref(orig_type_left);
8141 type_t *type_right = skip_typeref(orig_type_right);
8143 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8144 /* TODO: improve error message */
8145 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8146 errorf(&expression->base.source_position,
8147 "operation needs arithmetic types");
8152 /* combined instructions are tricky. We can't create an implicit cast on
8153 * the left side, because we need the uncasted form for the store.
8154 * The ast2firm pass has to know that left_type must be right_type
8155 * for the arithmetic operation and create a cast by itself */
8156 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8157 expression->right = create_implicit_cast(right, arithmetic_type);
8158 expression->base.type = type_left;
8161 static void semantic_divmod_assign(binary_expression_t *expression)
8163 semantic_arithmetic_assign(expression);
8164 warn_div_by_zero(expression);
8167 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8169 expression_t *const left = expression->left;
8170 expression_t *const right = expression->right;
8171 type_t *const orig_type_left = left->base.type;
8172 type_t *const orig_type_right = right->base.type;
8173 type_t *const type_left = skip_typeref(orig_type_left);
8174 type_t *const type_right = skip_typeref(orig_type_right);
8176 if (!is_valid_assignment_lhs(left))
8179 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8180 /* combined instructions are tricky. We can't create an implicit cast on
8181 * the left side, because we need the uncasted form for the store.
8182 * The ast2firm pass has to know that left_type must be right_type
8183 * for the arithmetic operation and create a cast by itself */
8184 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8185 expression->right = create_implicit_cast(right, arithmetic_type);
8186 expression->base.type = type_left;
8187 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8188 check_pointer_arithmetic(&expression->base.source_position,
8189 type_left, orig_type_left);
8190 expression->base.type = type_left;
8191 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8192 errorf(&expression->base.source_position,
8193 "incompatible types '%T' and '%T' in assignment",
8194 orig_type_left, orig_type_right);
8198 static void semantic_integer_assign(binary_expression_t *expression)
8200 expression_t *left = expression->left;
8201 expression_t *right = expression->right;
8202 type_t *orig_type_left = left->base.type;
8203 type_t *orig_type_right = right->base.type;
8205 if (!is_valid_assignment_lhs(left))
8208 type_t *type_left = skip_typeref(orig_type_left);
8209 type_t *type_right = skip_typeref(orig_type_right);
8211 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8212 /* TODO: improve error message */
8213 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8214 errorf(&expression->base.source_position,
8215 "operation needs integer types");
8220 /* combined instructions are tricky. We can't create an implicit cast on
8221 * the left side, because we need the uncasted form for the store.
8222 * The ast2firm pass has to know that left_type must be right_type
8223 * for the arithmetic operation and create a cast by itself */
8224 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8225 expression->right = create_implicit_cast(right, arithmetic_type);
8226 expression->base.type = type_left;
8229 static void semantic_shift_assign(binary_expression_t *expression)
8231 expression_t *left = expression->left;
8233 if (!is_valid_assignment_lhs(left))
8236 if (!semantic_shift(expression))
8239 expression->base.type = skip_typeref(left->base.type);
8242 static void warn_logical_and_within_or(const expression_t *const expr)
8244 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8246 if (expr->base.parenthesized)
8248 source_position_t const *const pos = &expr->base.source_position;
8249 warningf(WARN_PARENTHESES, pos, "suggest parentheses around && within ||");
8253 * Check the semantic restrictions of a logical expression.
8255 static void semantic_logical_op(binary_expression_t *expression)
8257 /* §6.5.13:2 Each of the operands shall have scalar type.
8258 * §6.5.14:2 Each of the operands shall have scalar type. */
8259 semantic_condition(expression->left, "left operand of logical operator");
8260 semantic_condition(expression->right, "right operand of logical operator");
8261 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR) {
8262 warn_logical_and_within_or(expression->left);
8263 warn_logical_and_within_or(expression->right);
8265 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8269 * Check the semantic restrictions of a binary assign expression.
8271 static void semantic_binexpr_assign(binary_expression_t *expression)
8273 expression_t *left = expression->left;
8274 type_t *orig_type_left = left->base.type;
8276 if (!is_valid_assignment_lhs(left))
8279 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8280 report_assign_error(error, orig_type_left, expression->right,
8281 "assignment", &left->base.source_position);
8282 expression->right = create_implicit_cast(expression->right, orig_type_left);
8283 expression->base.type = orig_type_left;
8287 * Determine if the outermost operation (or parts thereof) of the given
8288 * expression has no effect in order to generate a warning about this fact.
8289 * Therefore in some cases this only examines some of the operands of the
8290 * expression (see comments in the function and examples below).
8292 * f() + 23; // warning, because + has no effect
8293 * x || f(); // no warning, because x controls execution of f()
8294 * x ? y : f(); // warning, because y has no effect
8295 * (void)x; // no warning to be able to suppress the warning
8296 * This function can NOT be used for an "expression has definitely no effect"-
8298 static bool expression_has_effect(const expression_t *const expr)
8300 switch (expr->kind) {
8301 case EXPR_ERROR: return true; /* do NOT warn */
8302 case EXPR_REFERENCE: return false;
8303 case EXPR_ENUM_CONSTANT: return false;
8304 case EXPR_LABEL_ADDRESS: return false;
8306 /* suppress the warning for microsoft __noop operations */
8307 case EXPR_LITERAL_MS_NOOP: return true;
8308 case EXPR_LITERAL_BOOLEAN:
8309 case EXPR_LITERAL_CHARACTER:
8310 case EXPR_LITERAL_WIDE_CHARACTER:
8311 case EXPR_LITERAL_INTEGER:
8312 case EXPR_LITERAL_FLOATINGPOINT:
8313 case EXPR_STRING_LITERAL: return false;
8314 case EXPR_WIDE_STRING_LITERAL: return false;
8317 const call_expression_t *const call = &expr->call;
8318 if (call->function->kind != EXPR_REFERENCE)
8321 switch (call->function->reference.entity->function.btk) {
8322 /* FIXME: which builtins have no effect? */
8323 default: return true;
8327 /* Generate the warning if either the left or right hand side of a
8328 * conditional expression has no effect */
8329 case EXPR_CONDITIONAL: {
8330 conditional_expression_t const *const cond = &expr->conditional;
8331 expression_t const *const t = cond->true_expression;
8333 (t == NULL || expression_has_effect(t)) &&
8334 expression_has_effect(cond->false_expression);
8337 case EXPR_SELECT: return false;
8338 case EXPR_ARRAY_ACCESS: return false;
8339 case EXPR_SIZEOF: return false;
8340 case EXPR_CLASSIFY_TYPE: return false;
8341 case EXPR_ALIGNOF: return false;
8343 case EXPR_FUNCNAME: return false;
8344 case EXPR_BUILTIN_CONSTANT_P: return false;
8345 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8346 case EXPR_OFFSETOF: return false;
8347 case EXPR_VA_START: return true;
8348 case EXPR_VA_ARG: return true;
8349 case EXPR_VA_COPY: return true;
8350 case EXPR_STATEMENT: return true; // TODO
8351 case EXPR_COMPOUND_LITERAL: return false;
8353 case EXPR_UNARY_NEGATE: return false;
8354 case EXPR_UNARY_PLUS: return false;
8355 case EXPR_UNARY_BITWISE_NEGATE: return false;
8356 case EXPR_UNARY_NOT: return false;
8357 case EXPR_UNARY_DEREFERENCE: return false;
8358 case EXPR_UNARY_TAKE_ADDRESS: return false;
8359 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8360 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8361 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8362 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8364 /* Treat void casts as if they have an effect in order to being able to
8365 * suppress the warning */
8366 case EXPR_UNARY_CAST: {
8367 type_t *const type = skip_typeref(expr->base.type);
8368 return is_type_void(type);
8371 case EXPR_UNARY_ASSUME: return true;
8372 case EXPR_UNARY_DELETE: return true;
8373 case EXPR_UNARY_DELETE_ARRAY: return true;
8374 case EXPR_UNARY_THROW: return true;
8376 case EXPR_BINARY_ADD: return false;
8377 case EXPR_BINARY_SUB: return false;
8378 case EXPR_BINARY_MUL: return false;
8379 case EXPR_BINARY_DIV: return false;
8380 case EXPR_BINARY_MOD: return false;
8381 case EXPR_BINARY_EQUAL: return false;
8382 case EXPR_BINARY_NOTEQUAL: return false;
8383 case EXPR_BINARY_LESS: return false;
8384 case EXPR_BINARY_LESSEQUAL: return false;
8385 case EXPR_BINARY_GREATER: return false;
8386 case EXPR_BINARY_GREATEREQUAL: return false;
8387 case EXPR_BINARY_BITWISE_AND: return false;
8388 case EXPR_BINARY_BITWISE_OR: return false;
8389 case EXPR_BINARY_BITWISE_XOR: return false;
8390 case EXPR_BINARY_SHIFTLEFT: return false;
8391 case EXPR_BINARY_SHIFTRIGHT: return false;
8392 case EXPR_BINARY_ASSIGN: return true;
8393 case EXPR_BINARY_MUL_ASSIGN: return true;
8394 case EXPR_BINARY_DIV_ASSIGN: return true;
8395 case EXPR_BINARY_MOD_ASSIGN: return true;
8396 case EXPR_BINARY_ADD_ASSIGN: return true;
8397 case EXPR_BINARY_SUB_ASSIGN: return true;
8398 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8399 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8400 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8401 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8402 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8404 /* Only examine the right hand side of && and ||, because the left hand
8405 * side already has the effect of controlling the execution of the right
8407 case EXPR_BINARY_LOGICAL_AND:
8408 case EXPR_BINARY_LOGICAL_OR:
8409 /* Only examine the right hand side of a comma expression, because the left
8410 * hand side has a separate warning */
8411 case EXPR_BINARY_COMMA:
8412 return expression_has_effect(expr->binary.right);
8414 case EXPR_BINARY_ISGREATER: return false;
8415 case EXPR_BINARY_ISGREATEREQUAL: return false;
8416 case EXPR_BINARY_ISLESS: return false;
8417 case EXPR_BINARY_ISLESSEQUAL: return false;
8418 case EXPR_BINARY_ISLESSGREATER: return false;
8419 case EXPR_BINARY_ISUNORDERED: return false;
8422 internal_errorf(HERE, "unexpected expression");
8425 static void semantic_comma(binary_expression_t *expression)
8427 const expression_t *const left = expression->left;
8428 if (!expression_has_effect(left)) {
8429 source_position_t const *const pos = &left->base.source_position;
8430 warningf(WARN_UNUSED_VALUE, pos, "left-hand operand of comma expression has no effect");
8432 expression->base.type = expression->right->base.type;
8436 * @param prec_r precedence of the right operand
8438 #define CREATE_BINEXPR_PARSER(token_kind, binexpression_type, prec_r, sfunc) \
8439 static expression_t *parse_##binexpression_type(expression_t *left) \
8441 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8442 binexpr->binary.left = left; \
8445 expression_t *right = parse_subexpression(prec_r); \
8447 binexpr->binary.right = right; \
8448 sfunc(&binexpr->binary); \
8453 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8454 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
8455 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
8456 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8457 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8458 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8459 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8460 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
8461 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
8462 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
8463 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
8464 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
8465 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
8466 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_integer)
8467 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_integer)
8468 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_integer)
8469 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8470 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8471 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
8472 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8473 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8474 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8475 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8476 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8477 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8478 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8479 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8480 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8481 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8482 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
8485 static expression_t *parse_subexpression(precedence_t precedence)
8487 expression_parser_function_t *parser
8488 = &expression_parsers[token.kind];
8491 if (parser->parser != NULL) {
8492 left = parser->parser();
8494 left = parse_primary_expression();
8496 assert(left != NULL);
8499 parser = &expression_parsers[token.kind];
8500 if (parser->infix_parser == NULL)
8502 if (parser->infix_precedence < precedence)
8505 left = parser->infix_parser(left);
8507 assert(left != NULL);
8514 * Parse an expression.
8516 static expression_t *parse_expression(void)
8518 return parse_subexpression(PREC_EXPRESSION);
8522 * Register a parser for a prefix-like operator.
8524 * @param parser the parser function
8525 * @param token_kind the token type of the prefix token
8527 static void register_expression_parser(parse_expression_function parser,
8530 expression_parser_function_t *entry = &expression_parsers[token_kind];
8532 if (entry->parser != NULL) {
8533 diagnosticf("for token '%k'\n", (token_kind_t)token_kind);
8534 panic("trying to register multiple expression parsers for a token");
8536 entry->parser = parser;
8540 * Register a parser for an infix operator with given precedence.
8542 * @param parser the parser function
8543 * @param token_kind the token type of the infix operator
8544 * @param precedence the precedence of the operator
8546 static void register_infix_parser(parse_expression_infix_function parser,
8547 int token_kind, precedence_t precedence)
8549 expression_parser_function_t *entry = &expression_parsers[token_kind];
8551 if (entry->infix_parser != NULL) {
8552 diagnosticf("for token '%k'\n", (token_kind_t)token_kind);
8553 panic("trying to register multiple infix expression parsers for a "
8556 entry->infix_parser = parser;
8557 entry->infix_precedence = precedence;
8561 * Initialize the expression parsers.
8563 static void init_expression_parsers(void)
8565 memset(&expression_parsers, 0, sizeof(expression_parsers));
8567 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
8568 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
8569 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
8570 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
8571 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
8572 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
8573 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
8574 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
8575 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
8576 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
8577 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
8578 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
8579 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
8580 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
8581 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
8582 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
8583 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
8584 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
8585 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
8586 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
8587 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
8588 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
8589 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
8590 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
8591 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
8592 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
8593 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
8594 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
8595 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
8596 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
8597 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
8598 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
8599 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
8600 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
8601 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
8602 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
8603 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
8605 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
8606 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
8607 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
8608 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
8609 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
8610 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
8611 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
8612 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
8613 register_expression_parser(parse_sizeof, T_sizeof);
8614 register_expression_parser(parse_alignof, T___alignof__);
8615 register_expression_parser(parse_extension, T___extension__);
8616 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
8617 register_expression_parser(parse_delete, T_delete);
8618 register_expression_parser(parse_throw, T_throw);
8622 * Parse a asm statement arguments specification.
8624 static asm_argument_t *parse_asm_arguments(bool is_out)
8626 asm_argument_t *result = NULL;
8627 asm_argument_t **anchor = &result;
8629 while (token.kind == T_STRING_LITERAL || token.kind == '[') {
8630 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
8633 add_anchor_token(']');
8634 argument->symbol = expect_identifier("while parsing asm argument", NULL);
8635 rem_anchor_token(']');
8637 if (!argument->symbol)
8641 argument->constraints = parse_string_literals();
8642 add_anchor_token(')');
8644 expression_t *expression = parse_expression();
8645 rem_anchor_token(')');
8647 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
8648 * change size or type representation (e.g. int -> long is ok, but
8649 * int -> float is not) */
8650 if (expression->kind == EXPR_UNARY_CAST) {
8651 type_t *const type = expression->base.type;
8652 type_kind_t const kind = type->kind;
8653 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
8656 if (kind == TYPE_ATOMIC) {
8657 atomic_type_kind_t const akind = type->atomic.akind;
8658 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8659 size = get_atomic_type_size(akind);
8661 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8662 size = get_type_size(type_void_ptr);
8666 expression_t *const value = expression->unary.value;
8667 type_t *const value_type = value->base.type;
8668 type_kind_t const value_kind = value_type->kind;
8670 unsigned value_flags;
8671 unsigned value_size;
8672 if (value_kind == TYPE_ATOMIC) {
8673 atomic_type_kind_t const value_akind = value_type->atomic.akind;
8674 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8675 value_size = get_atomic_type_size(value_akind);
8676 } else if (value_kind == TYPE_POINTER) {
8677 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8678 value_size = get_type_size(type_void_ptr);
8683 if (value_flags != flags || value_size != size)
8687 } while (expression->kind == EXPR_UNARY_CAST);
8691 if (!is_lvalue(expression)) {
8692 errorf(&expression->base.source_position,
8693 "asm output argument is not an lvalue");
8696 if (argument->constraints.begin[0] == '=')
8697 determine_lhs_ent(expression, NULL);
8699 mark_vars_read(expression, NULL);
8701 mark_vars_read(expression, NULL);
8703 argument->expression = expression;
8706 set_address_taken(expression, true);
8709 anchor = &argument->next;
8719 * Parse a asm statement clobber specification.
8721 static asm_clobber_t *parse_asm_clobbers(void)
8723 asm_clobber_t *result = NULL;
8724 asm_clobber_t **anchor = &result;
8726 while (token.kind == T_STRING_LITERAL) {
8727 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
8728 clobber->clobber = parse_string_literals();
8731 anchor = &clobber->next;
8741 * Parse an asm statement.
8743 static statement_t *parse_asm_statement(void)
8745 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
8746 asm_statement_t *asm_statement = &statement->asms;
8750 if (next_if(T_volatile))
8751 asm_statement->is_volatile = true;
8754 add_anchor_token(')');
8755 if (token.kind != T_STRING_LITERAL) {
8756 parse_error_expected("after asm(", T_STRING_LITERAL, NULL);
8759 asm_statement->asm_text = parse_string_literals();
8761 add_anchor_token(':');
8762 if (!next_if(':')) {
8763 rem_anchor_token(':');
8767 asm_statement->outputs = parse_asm_arguments(true);
8768 if (!next_if(':')) {
8769 rem_anchor_token(':');
8773 asm_statement->inputs = parse_asm_arguments(false);
8774 if (!next_if(':')) {
8775 rem_anchor_token(':');
8778 rem_anchor_token(':');
8780 asm_statement->clobbers = parse_asm_clobbers();
8783 rem_anchor_token(')');
8787 if (asm_statement->outputs == NULL) {
8788 /* GCC: An 'asm' instruction without any output operands will be treated
8789 * identically to a volatile 'asm' instruction. */
8790 asm_statement->is_volatile = true;
8796 static statement_t *parse_label_inner_statement(statement_t const *const label, char const *const label_kind)
8798 statement_t *inner_stmt;
8799 switch (token.kind) {
8801 errorf(&label->base.source_position, "%s at end of compound statement", label_kind);
8802 inner_stmt = create_error_statement();
8806 if (label->kind == STATEMENT_LABEL) {
8807 /* Eat an empty statement here, to avoid the warning about an empty
8808 * statement after a label. label:; is commonly used to have a label
8809 * before a closing brace. */
8810 inner_stmt = create_empty_statement();
8817 inner_stmt = parse_statement();
8818 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
8819 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
8820 if (inner_stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
8821 errorf(&inner_stmt->base.source_position, "declaration after %s", label_kind);
8829 * Parse a case statement.
8831 static statement_t *parse_case_statement(void)
8833 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
8834 source_position_t *const pos = &statement->base.source_position;
8837 add_anchor_token(':');
8839 expression_t *expression = parse_expression();
8840 type_t *expression_type = expression->base.type;
8841 type_t *skipped = skip_typeref(expression_type);
8842 if (!is_type_integer(skipped) && is_type_valid(skipped)) {
8843 errorf(pos, "case expression '%E' must have integer type but has type '%T'",
8844 expression, expression_type);
8847 type_t *type = expression_type;
8848 if (current_switch != NULL) {
8849 type_t *switch_type = current_switch->expression->base.type;
8850 if (is_type_valid(switch_type)) {
8851 expression = create_implicit_cast(expression, switch_type);
8855 statement->case_label.expression = expression;
8856 expression_classification_t const expr_class = is_constant_expression(expression);
8857 if (expr_class != EXPR_CLASS_CONSTANT) {
8858 if (expr_class != EXPR_CLASS_ERROR) {
8859 errorf(pos, "case label does not reduce to an integer constant");
8861 statement->case_label.is_bad = true;
8863 long const val = fold_constant_to_int(expression);
8864 statement->case_label.first_case = val;
8865 statement->case_label.last_case = val;
8869 if (next_if(T_DOTDOTDOT)) {
8870 expression_t *end_range = parse_expression();
8871 expression_type = expression->base.type;
8872 skipped = skip_typeref(expression_type);
8873 if (!is_type_integer(skipped) && is_type_valid(skipped)) {
8874 errorf(pos, "case expression '%E' must have integer type but has type '%T'",
8875 expression, expression_type);
8878 end_range = create_implicit_cast(end_range, type);
8879 statement->case_label.end_range = end_range;
8880 expression_classification_t const end_class = is_constant_expression(end_range);
8881 if (end_class != EXPR_CLASS_CONSTANT) {
8882 if (end_class != EXPR_CLASS_ERROR) {
8883 errorf(pos, "case range does not reduce to an integer constant");
8885 statement->case_label.is_bad = true;
8887 long const val = fold_constant_to_int(end_range);
8888 statement->case_label.last_case = val;
8890 if (val < statement->case_label.first_case) {
8891 statement->case_label.is_empty_range = true;
8892 warningf(WARN_OTHER, pos, "empty range specified");
8898 PUSH_PARENT(statement);
8900 rem_anchor_token(':');
8903 if (current_switch != NULL) {
8904 if (! statement->case_label.is_bad) {
8905 /* Check for duplicate case values */
8906 case_label_statement_t *c = &statement->case_label;
8907 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
8908 if (l->is_bad || l->is_empty_range || l->expression == NULL)
8911 if (c->last_case < l->first_case || c->first_case > l->last_case)
8914 errorf(pos, "duplicate case value (previously used %P)",
8915 &l->base.source_position);
8919 /* link all cases into the switch statement */
8920 if (current_switch->last_case == NULL) {
8921 current_switch->first_case = &statement->case_label;
8923 current_switch->last_case->next = &statement->case_label;
8925 current_switch->last_case = &statement->case_label;
8927 errorf(pos, "case label not within a switch statement");
8930 statement->case_label.statement = parse_label_inner_statement(statement, "case label");
8937 * Parse a default statement.
8939 static statement_t *parse_default_statement(void)
8941 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
8945 PUSH_PARENT(statement);
8949 if (current_switch != NULL) {
8950 const case_label_statement_t *def_label = current_switch->default_label;
8951 if (def_label != NULL) {
8952 errorf(&statement->base.source_position, "multiple default labels in one switch (previous declared %P)", &def_label->base.source_position);
8954 current_switch->default_label = &statement->case_label;
8956 /* link all cases into the switch statement */
8957 if (current_switch->last_case == NULL) {
8958 current_switch->first_case = &statement->case_label;
8960 current_switch->last_case->next = &statement->case_label;
8962 current_switch->last_case = &statement->case_label;
8965 errorf(&statement->base.source_position,
8966 "'default' label not within a switch statement");
8969 statement->case_label.statement = parse_label_inner_statement(statement, "default label");
8976 * Parse a label statement.
8978 static statement_t *parse_label_statement(void)
8980 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
8981 label_t *const label = get_label();
8982 statement->label.label = label;
8984 PUSH_PARENT(statement);
8986 /* if statement is already set then the label is defined twice,
8987 * otherwise it was just mentioned in a goto/local label declaration so far
8989 source_position_t const* const pos = &statement->base.source_position;
8990 if (label->statement != NULL) {
8991 errorf(pos, "duplicate '%N' (declared %P)", (entity_t const*)label, &label->base.source_position);
8993 label->base.source_position = *pos;
8994 label->statement = statement;
8999 if (token.kind == T___attribute__ && !(c_mode & _CXX)) {
9000 parse_attributes(NULL); // TODO process attributes
9003 statement->label.statement = parse_label_inner_statement(statement, "label");
9005 /* remember the labels in a list for later checking */
9006 *label_anchor = &statement->label;
9007 label_anchor = &statement->label.next;
9013 static statement_t *parse_inner_statement(void)
9015 statement_t *const stmt = parse_statement();
9016 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
9017 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
9018 if (stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
9019 errorf(&stmt->base.source_position, "declaration as inner statement, use {}");
9025 * Parse an expression in parentheses and mark its variables as read.
9027 static expression_t *parse_condition(void)
9029 add_anchor_token(')');
9031 expression_t *const expr = parse_expression();
9032 mark_vars_read(expr, NULL);
9033 rem_anchor_token(')');
9039 * Parse an if statement.
9041 static statement_t *parse_if(void)
9043 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9047 PUSH_PARENT(statement);
9048 PUSH_SCOPE_STATEMENT(&statement->ifs.scope);
9050 add_anchor_token(T_else);
9052 expression_t *const expr = parse_condition();
9053 statement->ifs.condition = expr;
9054 /* §6.8.4.1:1 The controlling expression of an if statement shall have
9056 semantic_condition(expr, "condition of 'if'-statment");
9058 statement_t *const true_stmt = parse_inner_statement();
9059 statement->ifs.true_statement = true_stmt;
9060 rem_anchor_token(T_else);
9062 if (true_stmt->kind == STATEMENT_EMPTY) {
9063 warningf(WARN_EMPTY_BODY, HERE,
9064 "suggest braces around empty body in an ‘if’ statement");
9067 if (next_if(T_else)) {
9068 statement->ifs.false_statement = parse_inner_statement();
9070 if (statement->ifs.false_statement->kind == STATEMENT_EMPTY) {
9071 warningf(WARN_EMPTY_BODY, HERE,
9072 "suggest braces around empty body in an ‘if’ statement");
9074 } else if (true_stmt->kind == STATEMENT_IF &&
9075 true_stmt->ifs.false_statement != NULL) {
9076 source_position_t const *const pos = &true_stmt->base.source_position;
9077 warningf(WARN_PARENTHESES, pos, "suggest explicit braces to avoid ambiguous 'else'");
9086 * Check that all enums are handled in a switch.
9088 * @param statement the switch statement to check
9090 static void check_enum_cases(const switch_statement_t *statement)
9092 if (!is_warn_on(WARN_SWITCH_ENUM))
9094 const type_t *type = skip_typeref(statement->expression->base.type);
9095 if (! is_type_enum(type))
9097 const enum_type_t *enumt = &type->enumt;
9099 /* if we have a default, no warnings */
9100 if (statement->default_label != NULL)
9103 /* FIXME: calculation of value should be done while parsing */
9104 /* TODO: quadratic algorithm here. Change to an n log n one */
9105 long last_value = -1;
9106 const entity_t *entry = enumt->enume->base.next;
9107 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9108 entry = entry->base.next) {
9109 const expression_t *expression = entry->enum_value.value;
9110 long value = expression != NULL ? fold_constant_to_int(expression) : last_value + 1;
9112 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9113 if (l->expression == NULL)
9115 if (l->first_case <= value && value <= l->last_case) {
9121 source_position_t const *const pos = &statement->base.source_position;
9122 warningf(WARN_SWITCH_ENUM, pos, "'%N' not handled in switch", entry);
9129 * Parse a switch statement.
9131 static statement_t *parse_switch(void)
9133 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9137 PUSH_PARENT(statement);
9138 PUSH_SCOPE_STATEMENT(&statement->switchs.scope);
9140 expression_t *const expr = parse_condition();
9141 type_t * type = skip_typeref(expr->base.type);
9142 if (is_type_integer(type)) {
9143 type = promote_integer(type);
9144 if (get_akind_rank(get_akind(type)) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9145 warningf(WARN_TRADITIONAL, &expr->base.source_position, "'%T' switch expression not converted to '%T' in ISO C", type, type_int);
9147 } else if (is_type_valid(type)) {
9148 errorf(&expr->base.source_position,
9149 "switch quantity is not an integer, but '%T'", type);
9150 type = type_error_type;
9152 statement->switchs.expression = create_implicit_cast(expr, type);
9154 switch_statement_t *rem = current_switch;
9155 current_switch = &statement->switchs;
9156 statement->switchs.body = parse_inner_statement();
9157 current_switch = rem;
9159 if (statement->switchs.default_label == NULL) {
9160 warningf(WARN_SWITCH_DEFAULT, &statement->base.source_position, "switch has no default case");
9162 check_enum_cases(&statement->switchs);
9169 static statement_t *parse_loop_body(statement_t *const loop)
9171 statement_t *const rem = current_loop;
9172 current_loop = loop;
9174 statement_t *const body = parse_inner_statement();
9181 * Parse a while statement.
9183 static statement_t *parse_while(void)
9185 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9189 PUSH_PARENT(statement);
9190 PUSH_SCOPE_STATEMENT(&statement->whiles.scope);
9192 expression_t *const cond = parse_condition();
9193 statement->whiles.condition = cond;
9194 /* §6.8.5:2 The controlling expression of an iteration statement shall
9195 * have scalar type. */
9196 semantic_condition(cond, "condition of 'while'-statement");
9198 statement->whiles.body = parse_loop_body(statement);
9206 * Parse a do statement.
9208 static statement_t *parse_do(void)
9210 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9214 PUSH_PARENT(statement);
9215 PUSH_SCOPE_STATEMENT(&statement->do_while.scope);
9217 add_anchor_token(T_while);
9218 statement->do_while.body = parse_loop_body(statement);
9219 rem_anchor_token(T_while);
9222 expression_t *const cond = parse_condition();
9223 statement->do_while.condition = cond;
9224 /* §6.8.5:2 The controlling expression of an iteration statement shall
9225 * have scalar type. */
9226 semantic_condition(cond, "condition of 'do-while'-statement");
9235 * Parse a for statement.
9237 static statement_t *parse_for(void)
9239 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9243 PUSH_PARENT(statement);
9244 PUSH_SCOPE_STATEMENT(&statement->fors.scope);
9246 add_anchor_token(')');
9252 } else if (is_declaration_specifier(&token)) {
9253 parse_declaration(record_entity, DECL_FLAGS_NONE);
9255 add_anchor_token(';');
9256 expression_t *const init = parse_expression();
9257 statement->fors.initialisation = init;
9258 mark_vars_read(init, ENT_ANY);
9259 if (!expression_has_effect(init)) {
9260 warningf(WARN_UNUSED_VALUE, &init->base.source_position, "initialisation of 'for'-statement has no effect");
9262 rem_anchor_token(';');
9268 if (token.kind != ';') {
9269 add_anchor_token(';');
9270 expression_t *const cond = parse_expression();
9271 statement->fors.condition = cond;
9272 /* §6.8.5:2 The controlling expression of an iteration statement
9273 * shall have scalar type. */
9274 semantic_condition(cond, "condition of 'for'-statement");
9275 mark_vars_read(cond, NULL);
9276 rem_anchor_token(';');
9279 if (token.kind != ')') {
9280 expression_t *const step = parse_expression();
9281 statement->fors.step = step;
9282 mark_vars_read(step, ENT_ANY);
9283 if (!expression_has_effect(step)) {
9284 warningf(WARN_UNUSED_VALUE, &step->base.source_position, "step of 'for'-statement has no effect");
9287 rem_anchor_token(')');
9289 statement->fors.body = parse_loop_body(statement);
9297 * Parse a goto statement.
9299 static statement_t *parse_goto(void)
9301 statement_t *statement;
9302 if (GNU_MODE && look_ahead(1)->kind == '*') {
9303 statement = allocate_statement_zero(STATEMENT_COMPUTED_GOTO);
9307 expression_t *expression = parse_expression();
9308 mark_vars_read(expression, NULL);
9310 /* Argh: although documentation says the expression must be of type void*,
9311 * gcc accepts anything that can be casted into void* without error */
9312 type_t *type = expression->base.type;
9314 if (type != type_error_type) {
9315 if (!is_type_pointer(type) && !is_type_integer(type)) {
9316 errorf(&expression->base.source_position,
9317 "cannot convert to a pointer type");
9318 } else if (type != type_void_ptr) {
9319 warningf(WARN_OTHER, &expression->base.source_position, "type of computed goto expression should be 'void*' not '%T'", type);
9321 expression = create_implicit_cast(expression, type_void_ptr);
9324 statement->computed_goto.expression = expression;
9326 statement = allocate_statement_zero(STATEMENT_GOTO);
9328 if (token.kind == T_IDENTIFIER) {
9329 label_t *const label = get_label();
9331 statement->gotos.label = label;
9333 /* remember the goto's in a list for later checking */
9334 *goto_anchor = &statement->gotos;
9335 goto_anchor = &statement->gotos.next;
9338 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
9340 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
9342 statement->gotos.label = &allocate_entity_zero(ENTITY_LABEL, NAMESPACE_LABEL, sym_anonymous, &builtin_source_position)->label;
9351 * Parse a continue statement.
9353 static statement_t *parse_continue(void)
9355 if (current_loop == NULL) {
9356 errorf(HERE, "continue statement not within loop");
9359 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9367 * Parse a break statement.
9369 static statement_t *parse_break(void)
9371 if (current_switch == NULL && current_loop == NULL) {
9372 errorf(HERE, "break statement not within loop or switch");
9375 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9383 * Parse a __leave statement.
9385 static statement_t *parse_leave_statement(void)
9387 if (current_try == NULL) {
9388 errorf(HERE, "__leave statement not within __try");
9391 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9399 * Check if a given entity represents a local variable.
9401 static bool is_local_variable(const entity_t *entity)
9403 if (entity->kind != ENTITY_VARIABLE)
9406 switch ((storage_class_tag_t) entity->declaration.storage_class) {
9407 case STORAGE_CLASS_AUTO:
9408 case STORAGE_CLASS_REGISTER: {
9409 const type_t *type = skip_typeref(entity->declaration.type);
9410 if (is_type_function(type)) {
9422 * Check if a given expression represents a local variable.
9424 static bool expression_is_local_variable(const expression_t *expression)
9426 if (expression->base.kind != EXPR_REFERENCE) {
9429 const entity_t *entity = expression->reference.entity;
9430 return is_local_variable(entity);
9434 * Check if a given expression represents a local variable and
9435 * return its declaration then, else return NULL.
9437 entity_t *expression_is_variable(const expression_t *expression)
9439 if (expression->base.kind != EXPR_REFERENCE) {
9442 entity_t *entity = expression->reference.entity;
9443 if (entity->kind != ENTITY_VARIABLE)
9449 static void err_or_warn(source_position_t const *const pos, char const *const msg)
9451 if (c_mode & _CXX || strict_mode) {
9454 warningf(WARN_OTHER, pos, msg);
9459 * Parse a return statement.
9461 static statement_t *parse_return(void)
9463 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9466 expression_t *return_value = NULL;
9467 if (token.kind != ';') {
9468 return_value = parse_expression();
9469 mark_vars_read(return_value, NULL);
9472 const type_t *const func_type = skip_typeref(current_function->base.type);
9473 assert(is_type_function(func_type));
9474 type_t *const return_type = skip_typeref(func_type->function.return_type);
9476 source_position_t const *const pos = &statement->base.source_position;
9477 if (return_value != NULL) {
9478 type_t *return_value_type = skip_typeref(return_value->base.type);
9480 if (is_type_void(return_type)) {
9481 if (!is_type_void(return_value_type)) {
9482 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
9483 /* Only warn in C mode, because GCC does the same */
9484 err_or_warn(pos, "'return' with a value, in function returning 'void'");
9485 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9486 /* Only warn in C mode, because GCC does the same */
9487 err_or_warn(pos, "'return' with expression in function returning 'void'");
9490 assign_error_t error = semantic_assign(return_type, return_value);
9491 report_assign_error(error, return_type, return_value, "'return'",
9494 return_value = create_implicit_cast(return_value, return_type);
9495 /* check for returning address of a local var */
9496 if (return_value != NULL && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
9497 const expression_t *expression = return_value->unary.value;
9498 if (expression_is_local_variable(expression)) {
9499 warningf(WARN_OTHER, pos, "function returns address of local variable");
9502 } else if (!is_type_void(return_type)) {
9503 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9504 err_or_warn(pos, "'return' without value, in function returning non-void");
9506 statement->returns.value = return_value;
9513 * Parse a declaration statement.
9515 static statement_t *parse_declaration_statement(void)
9517 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9519 entity_t *before = current_scope->last_entity;
9521 parse_external_declaration();
9523 parse_declaration(record_entity, DECL_FLAGS_NONE);
9526 declaration_statement_t *const decl = &statement->declaration;
9527 entity_t *const begin =
9528 before != NULL ? before->base.next : current_scope->entities;
9529 decl->declarations_begin = begin;
9530 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
9536 * Parse an expression statement, ie. expr ';'.
9538 static statement_t *parse_expression_statement(void)
9540 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
9542 expression_t *const expr = parse_expression();
9543 statement->expression.expression = expr;
9544 mark_vars_read(expr, ENT_ANY);
9551 * Parse a microsoft __try { } __finally { } or
9552 * __try{ } __except() { }
9554 static statement_t *parse_ms_try_statment(void)
9556 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
9559 PUSH_PARENT(statement);
9561 ms_try_statement_t *rem = current_try;
9562 current_try = &statement->ms_try;
9563 statement->ms_try.try_statement = parse_compound_statement(false);
9568 if (next_if(T___except)) {
9569 expression_t *const expr = parse_condition();
9570 type_t * type = skip_typeref(expr->base.type);
9571 if (is_type_integer(type)) {
9572 type = promote_integer(type);
9573 } else if (is_type_valid(type)) {
9574 errorf(&expr->base.source_position,
9575 "__expect expression is not an integer, but '%T'", type);
9576 type = type_error_type;
9578 statement->ms_try.except_expression = create_implicit_cast(expr, type);
9579 } else if (!next_if(T__finally)) {
9580 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
9582 statement->ms_try.final_statement = parse_compound_statement(false);
9586 static statement_t *parse_empty_statement(void)
9588 warningf(WARN_EMPTY_STATEMENT, HERE, "statement is empty");
9589 statement_t *const statement = create_empty_statement();
9594 static statement_t *parse_local_label_declaration(void)
9596 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9600 entity_t *begin = NULL;
9601 entity_t *end = NULL;
9602 entity_t **anchor = &begin;
9603 add_anchor_token(';');
9604 add_anchor_token(',');
9606 source_position_t pos;
9607 symbol_t *const symbol = expect_identifier("while parsing local label declaration", &pos);
9609 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
9610 if (entity != NULL && entity->base.parent_scope == current_scope) {
9611 source_position_t const *const ppos = &entity->base.source_position;
9612 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
9614 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL, NAMESPACE_LABEL, symbol, &pos);
9615 entity->base.parent_scope = current_scope;
9618 anchor = &entity->base.next;
9621 environment_push(entity);
9624 } while (next_if(','));
9625 rem_anchor_token(',');
9626 rem_anchor_token(';');
9628 statement->declaration.declarations_begin = begin;
9629 statement->declaration.declarations_end = end;
9633 static void parse_namespace_definition(void)
9637 entity_t *entity = NULL;
9638 symbol_t *symbol = NULL;
9640 if (token.kind == T_IDENTIFIER) {
9641 symbol = token.base.symbol;
9642 entity = get_entity(symbol, NAMESPACE_NORMAL);
9644 && entity->kind != ENTITY_NAMESPACE
9645 && entity->base.parent_scope == current_scope) {
9646 if (is_entity_valid(entity)) {
9647 error_redefined_as_different_kind(HERE, entity, ENTITY_NAMESPACE);
9654 if (entity == NULL) {
9655 entity = allocate_entity_zero(ENTITY_NAMESPACE, NAMESPACE_NORMAL, symbol, HERE);
9656 entity->base.parent_scope = current_scope;
9659 if (token.kind == '=') {
9660 /* TODO: parse namespace alias */
9661 panic("namespace alias definition not supported yet");
9664 environment_push(entity);
9665 append_entity(current_scope, entity);
9667 PUSH_SCOPE(&entity->namespacee.members);
9668 PUSH_CURRENT_ENTITY(entity);
9670 add_anchor_token('}');
9673 rem_anchor_token('}');
9676 POP_CURRENT_ENTITY();
9681 * Parse a statement.
9682 * There's also parse_statement() which additionally checks for
9683 * "statement has no effect" warnings
9685 static statement_t *intern_parse_statement(void)
9687 /* declaration or statement */
9688 statement_t *statement;
9689 switch (token.kind) {
9690 case T_IDENTIFIER: {
9691 token_kind_t la1_type = (token_kind_t)look_ahead(1)->kind;
9692 if (la1_type == ':') {
9693 statement = parse_label_statement();
9694 } else if (is_typedef_symbol(token.base.symbol)) {
9695 statement = parse_declaration_statement();
9697 /* it's an identifier, the grammar says this must be an
9698 * expression statement. However it is common that users mistype
9699 * declaration types, so we guess a bit here to improve robustness
9700 * for incorrect programs */
9704 if (get_entity(token.base.symbol, NAMESPACE_NORMAL) != NULL) {
9706 statement = parse_expression_statement();
9710 statement = parse_declaration_statement();
9718 case T___extension__: {
9719 /* This can be a prefix to a declaration or an expression statement.
9720 * We simply eat it now and parse the rest with tail recursion. */
9722 statement = intern_parse_statement();
9728 statement = parse_declaration_statement();
9732 statement = parse_local_label_declaration();
9735 case ';': statement = parse_empty_statement(); break;
9736 case '{': statement = parse_compound_statement(false); break;
9737 case T___leave: statement = parse_leave_statement(); break;
9738 case T___try: statement = parse_ms_try_statment(); break;
9739 case T_asm: statement = parse_asm_statement(); break;
9740 case T_break: statement = parse_break(); break;
9741 case T_case: statement = parse_case_statement(); break;
9742 case T_continue: statement = parse_continue(); break;
9743 case T_default: statement = parse_default_statement(); break;
9744 case T_do: statement = parse_do(); break;
9745 case T_for: statement = parse_for(); break;
9746 case T_goto: statement = parse_goto(); break;
9747 case T_if: statement = parse_if(); break;
9748 case T_return: statement = parse_return(); break;
9749 case T_switch: statement = parse_switch(); break;
9750 case T_while: statement = parse_while(); break;
9753 statement = parse_expression_statement();
9757 errorf(HERE, "unexpected token %K while parsing statement", &token);
9758 statement = create_error_statement();
9767 * parse a statement and emits "statement has no effect" warning if needed
9768 * (This is really a wrapper around intern_parse_statement with check for 1
9769 * single warning. It is needed, because for statement expressions we have
9770 * to avoid the warning on the last statement)
9772 static statement_t *parse_statement(void)
9774 statement_t *statement = intern_parse_statement();
9776 if (statement->kind == STATEMENT_EXPRESSION) {
9777 expression_t *expression = statement->expression.expression;
9778 if (!expression_has_effect(expression)) {
9779 warningf(WARN_UNUSED_VALUE, &expression->base.source_position, "statement has no effect");
9787 * Parse a compound statement.
9789 static statement_t *parse_compound_statement(bool inside_expression_statement)
9791 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
9793 PUSH_PARENT(statement);
9794 PUSH_SCOPE(&statement->compound.scope);
9797 add_anchor_token('}');
9798 /* tokens, which can start a statement */
9799 /* TODO MS, __builtin_FOO */
9800 add_anchor_token('!');
9801 add_anchor_token('&');
9802 add_anchor_token('(');
9803 add_anchor_token('*');
9804 add_anchor_token('+');
9805 add_anchor_token('-');
9806 add_anchor_token(';');
9807 add_anchor_token('{');
9808 add_anchor_token('~');
9809 add_anchor_token(T_CHARACTER_CONSTANT);
9810 add_anchor_token(T_COLONCOLON);
9811 add_anchor_token(T_FLOATINGPOINT);
9812 add_anchor_token(T_IDENTIFIER);
9813 add_anchor_token(T_INTEGER);
9814 add_anchor_token(T_MINUSMINUS);
9815 add_anchor_token(T_PLUSPLUS);
9816 add_anchor_token(T_STRING_LITERAL);
9817 add_anchor_token(T_WIDE_CHARACTER_CONSTANT);
9818 add_anchor_token(T_WIDE_STRING_LITERAL);
9819 add_anchor_token(T__Bool);
9820 add_anchor_token(T__Complex);
9821 add_anchor_token(T__Imaginary);
9822 add_anchor_token(T___FUNCTION__);
9823 add_anchor_token(T___PRETTY_FUNCTION__);
9824 add_anchor_token(T___alignof__);
9825 add_anchor_token(T___attribute__);
9826 add_anchor_token(T___builtin_va_start);
9827 add_anchor_token(T___extension__);
9828 add_anchor_token(T___func__);
9829 add_anchor_token(T___imag__);
9830 add_anchor_token(T___label__);
9831 add_anchor_token(T___real__);
9832 add_anchor_token(T___thread);
9833 add_anchor_token(T_asm);
9834 add_anchor_token(T_auto);
9835 add_anchor_token(T_bool);
9836 add_anchor_token(T_break);
9837 add_anchor_token(T_case);
9838 add_anchor_token(T_char);
9839 add_anchor_token(T_class);
9840 add_anchor_token(T_const);
9841 add_anchor_token(T_const_cast);
9842 add_anchor_token(T_continue);
9843 add_anchor_token(T_default);
9844 add_anchor_token(T_delete);
9845 add_anchor_token(T_double);
9846 add_anchor_token(T_do);
9847 add_anchor_token(T_dynamic_cast);
9848 add_anchor_token(T_enum);
9849 add_anchor_token(T_extern);
9850 add_anchor_token(T_false);
9851 add_anchor_token(T_float);
9852 add_anchor_token(T_for);
9853 add_anchor_token(T_goto);
9854 add_anchor_token(T_if);
9855 add_anchor_token(T_inline);
9856 add_anchor_token(T_int);
9857 add_anchor_token(T_long);
9858 add_anchor_token(T_new);
9859 add_anchor_token(T_operator);
9860 add_anchor_token(T_register);
9861 add_anchor_token(T_reinterpret_cast);
9862 add_anchor_token(T_restrict);
9863 add_anchor_token(T_return);
9864 add_anchor_token(T_short);
9865 add_anchor_token(T_signed);
9866 add_anchor_token(T_sizeof);
9867 add_anchor_token(T_static);
9868 add_anchor_token(T_static_cast);
9869 add_anchor_token(T_struct);
9870 add_anchor_token(T_switch);
9871 add_anchor_token(T_template);
9872 add_anchor_token(T_this);
9873 add_anchor_token(T_throw);
9874 add_anchor_token(T_true);
9875 add_anchor_token(T_try);
9876 add_anchor_token(T_typedef);
9877 add_anchor_token(T_typeid);
9878 add_anchor_token(T_typename);
9879 add_anchor_token(T_typeof);
9880 add_anchor_token(T_union);
9881 add_anchor_token(T_unsigned);
9882 add_anchor_token(T_using);
9883 add_anchor_token(T_void);
9884 add_anchor_token(T_volatile);
9885 add_anchor_token(T_wchar_t);
9886 add_anchor_token(T_while);
9888 statement_t **anchor = &statement->compound.statements;
9889 bool only_decls_so_far = true;
9890 while (token.kind != '}' && token.kind != T_EOF) {
9891 statement_t *sub_statement = intern_parse_statement();
9892 if (sub_statement->kind == STATEMENT_ERROR) {
9896 if (sub_statement->kind != STATEMENT_DECLARATION) {
9897 only_decls_so_far = false;
9898 } else if (!only_decls_so_far) {
9899 source_position_t const *const pos = &sub_statement->base.source_position;
9900 warningf(WARN_DECLARATION_AFTER_STATEMENT, pos, "ISO C90 forbids mixed declarations and code");
9903 *anchor = sub_statement;
9904 anchor = &sub_statement->base.next;
9908 /* look over all statements again to produce no effect warnings */
9909 if (is_warn_on(WARN_UNUSED_VALUE)) {
9910 statement_t *sub_statement = statement->compound.statements;
9911 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
9912 if (sub_statement->kind != STATEMENT_EXPRESSION)
9914 /* don't emit a warning for the last expression in an expression
9915 * statement as it has always an effect */
9916 if (inside_expression_statement && sub_statement->base.next == NULL)
9919 expression_t *expression = sub_statement->expression.expression;
9920 if (!expression_has_effect(expression)) {
9921 warningf(WARN_UNUSED_VALUE, &expression->base.source_position, "statement has no effect");
9926 rem_anchor_token(T_while);
9927 rem_anchor_token(T_wchar_t);
9928 rem_anchor_token(T_volatile);
9929 rem_anchor_token(T_void);
9930 rem_anchor_token(T_using);
9931 rem_anchor_token(T_unsigned);
9932 rem_anchor_token(T_union);
9933 rem_anchor_token(T_typeof);
9934 rem_anchor_token(T_typename);
9935 rem_anchor_token(T_typeid);
9936 rem_anchor_token(T_typedef);
9937 rem_anchor_token(T_try);
9938 rem_anchor_token(T_true);
9939 rem_anchor_token(T_throw);
9940 rem_anchor_token(T_this);
9941 rem_anchor_token(T_template);
9942 rem_anchor_token(T_switch);
9943 rem_anchor_token(T_struct);
9944 rem_anchor_token(T_static_cast);
9945 rem_anchor_token(T_static);
9946 rem_anchor_token(T_sizeof);
9947 rem_anchor_token(T_signed);
9948 rem_anchor_token(T_short);
9949 rem_anchor_token(T_return);
9950 rem_anchor_token(T_restrict);
9951 rem_anchor_token(T_reinterpret_cast);
9952 rem_anchor_token(T_register);
9953 rem_anchor_token(T_operator);
9954 rem_anchor_token(T_new);
9955 rem_anchor_token(T_long);
9956 rem_anchor_token(T_int);
9957 rem_anchor_token(T_inline);
9958 rem_anchor_token(T_if);
9959 rem_anchor_token(T_goto);
9960 rem_anchor_token(T_for);
9961 rem_anchor_token(T_float);
9962 rem_anchor_token(T_false);
9963 rem_anchor_token(T_extern);
9964 rem_anchor_token(T_enum);
9965 rem_anchor_token(T_dynamic_cast);
9966 rem_anchor_token(T_do);
9967 rem_anchor_token(T_double);
9968 rem_anchor_token(T_delete);
9969 rem_anchor_token(T_default);
9970 rem_anchor_token(T_continue);
9971 rem_anchor_token(T_const_cast);
9972 rem_anchor_token(T_const);
9973 rem_anchor_token(T_class);
9974 rem_anchor_token(T_char);
9975 rem_anchor_token(T_case);
9976 rem_anchor_token(T_break);
9977 rem_anchor_token(T_bool);
9978 rem_anchor_token(T_auto);
9979 rem_anchor_token(T_asm);
9980 rem_anchor_token(T___thread);
9981 rem_anchor_token(T___real__);
9982 rem_anchor_token(T___label__);
9983 rem_anchor_token(T___imag__);
9984 rem_anchor_token(T___func__);
9985 rem_anchor_token(T___extension__);
9986 rem_anchor_token(T___builtin_va_start);
9987 rem_anchor_token(T___attribute__);
9988 rem_anchor_token(T___alignof__);
9989 rem_anchor_token(T___PRETTY_FUNCTION__);
9990 rem_anchor_token(T___FUNCTION__);
9991 rem_anchor_token(T__Imaginary);
9992 rem_anchor_token(T__Complex);
9993 rem_anchor_token(T__Bool);
9994 rem_anchor_token(T_WIDE_STRING_LITERAL);
9995 rem_anchor_token(T_WIDE_CHARACTER_CONSTANT);
9996 rem_anchor_token(T_STRING_LITERAL);
9997 rem_anchor_token(T_PLUSPLUS);
9998 rem_anchor_token(T_MINUSMINUS);
9999 rem_anchor_token(T_INTEGER);
10000 rem_anchor_token(T_IDENTIFIER);
10001 rem_anchor_token(T_FLOATINGPOINT);
10002 rem_anchor_token(T_COLONCOLON);
10003 rem_anchor_token(T_CHARACTER_CONSTANT);
10004 rem_anchor_token('~');
10005 rem_anchor_token('{');
10006 rem_anchor_token(';');
10007 rem_anchor_token('-');
10008 rem_anchor_token('+');
10009 rem_anchor_token('*');
10010 rem_anchor_token('(');
10011 rem_anchor_token('&');
10012 rem_anchor_token('!');
10013 rem_anchor_token('}');
10021 * Check for unused global static functions and variables
10023 static void check_unused_globals(void)
10025 if (!is_warn_on(WARN_UNUSED_FUNCTION) && !is_warn_on(WARN_UNUSED_VARIABLE))
10028 for (const entity_t *entity = file_scope->entities; entity != NULL;
10029 entity = entity->base.next) {
10030 if (!is_declaration(entity))
10033 const declaration_t *declaration = &entity->declaration;
10034 if (declaration->used ||
10035 declaration->modifiers & DM_UNUSED ||
10036 declaration->modifiers & DM_USED ||
10037 declaration->storage_class != STORAGE_CLASS_STATIC)
10042 if (entity->kind == ENTITY_FUNCTION) {
10043 /* inhibit warning for static inline functions */
10044 if (entity->function.is_inline)
10047 why = WARN_UNUSED_FUNCTION;
10048 s = entity->function.statement != NULL ? "defined" : "declared";
10050 why = WARN_UNUSED_VARIABLE;
10054 warningf(why, &declaration->base.source_position, "'%#N' %s but not used", entity, s);
10058 static void parse_global_asm(void)
10060 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10063 add_anchor_token(';');
10064 add_anchor_token(')');
10065 add_anchor_token(T_STRING_LITERAL);
10068 rem_anchor_token(T_STRING_LITERAL);
10069 statement->asms.asm_text = parse_string_literals();
10070 statement->base.next = unit->global_asm;
10071 unit->global_asm = statement;
10073 rem_anchor_token(')');
10075 rem_anchor_token(';');
10079 static void parse_linkage_specification(void)
10083 source_position_t const pos = *HERE;
10084 char const *const linkage = parse_string_literals().begin;
10086 linkage_kind_t old_linkage = current_linkage;
10087 linkage_kind_t new_linkage;
10088 if (streq(linkage, "C")) {
10089 new_linkage = LINKAGE_C;
10090 } else if (streq(linkage, "C++")) {
10091 new_linkage = LINKAGE_CXX;
10093 errorf(&pos, "linkage string \"%s\" not recognized", linkage);
10094 new_linkage = LINKAGE_C;
10096 current_linkage = new_linkage;
10098 if (next_if('{')) {
10105 assert(current_linkage == new_linkage);
10106 current_linkage = old_linkage;
10109 static void parse_external(void)
10111 switch (token.kind) {
10113 if (look_ahead(1)->kind == T_STRING_LITERAL) {
10114 parse_linkage_specification();
10116 DECLARATION_START_NO_EXTERN
10118 case T___extension__:
10119 /* tokens below are for implicit int */
10120 case '&': /* & x; -> int& x; (and error later, because C++ has no
10122 case '*': /* * x; -> int* x; */
10123 case '(': /* (x); -> int (x); */
10125 parse_external_declaration();
10131 parse_global_asm();
10135 parse_namespace_definition();
10139 if (!strict_mode) {
10140 warningf(WARN_STRAY_SEMICOLON, HERE, "stray ';' outside of function");
10147 errorf(HERE, "stray %K outside of function", &token);
10148 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10149 eat_until_matching_token(token.kind);
10155 static void parse_externals(void)
10157 add_anchor_token('}');
10158 add_anchor_token(T_EOF);
10161 /* make a copy of the anchor set, so we can check if it is restored after parsing */
10162 unsigned short token_anchor_copy[T_LAST_TOKEN];
10163 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10166 while (token.kind != T_EOF && token.kind != '}') {
10168 for (int i = 0; i < T_LAST_TOKEN; ++i) {
10169 unsigned short count = token_anchor_set[i] - token_anchor_copy[i];
10171 /* the anchor set and its copy differs */
10172 internal_errorf(HERE, "Leaked anchor token %k %d times", i, count);
10175 if (in_gcc_extension) {
10176 /* an gcc extension scope was not closed */
10177 internal_errorf(HERE, "Leaked __extension__");
10184 rem_anchor_token(T_EOF);
10185 rem_anchor_token('}');
10189 * Parse a translation unit.
10191 static void parse_translation_unit(void)
10193 add_anchor_token(T_EOF);
10198 if (token.kind == T_EOF)
10201 errorf(HERE, "stray %K outside of function", &token);
10202 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10203 eat_until_matching_token(token.kind);
10208 void set_default_visibility(elf_visibility_tag_t visibility)
10210 default_visibility = visibility;
10216 * @return the translation unit or NULL if errors occurred.
10218 void start_parsing(void)
10220 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10221 label_stack = NEW_ARR_F(stack_entry_t, 0);
10222 diagnostic_count = 0;
10226 print_to_file(stderr);
10228 assert(unit == NULL);
10229 unit = allocate_ast_zero(sizeof(unit[0]));
10231 assert(file_scope == NULL);
10232 file_scope = &unit->scope;
10234 assert(current_scope == NULL);
10235 scope_push(&unit->scope);
10237 create_gnu_builtins();
10239 create_microsoft_intrinsics();
10242 translation_unit_t *finish_parsing(void)
10244 assert(current_scope == &unit->scope);
10247 assert(file_scope == &unit->scope);
10248 check_unused_globals();
10251 DEL_ARR_F(environment_stack);
10252 DEL_ARR_F(label_stack);
10254 translation_unit_t *result = unit;
10259 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
10260 * are given length one. */
10261 static void complete_incomplete_arrays(void)
10263 size_t n = ARR_LEN(incomplete_arrays);
10264 for (size_t i = 0; i != n; ++i) {
10265 declaration_t *const decl = incomplete_arrays[i];
10266 type_t *const type = skip_typeref(decl->type);
10268 if (!is_type_incomplete(type))
10271 source_position_t const *const pos = &decl->base.source_position;
10272 warningf(WARN_OTHER, pos, "array '%#N' assumed to have one element", (entity_t const*)decl);
10274 type_t *const new_type = duplicate_type(type);
10275 new_type->array.size_constant = true;
10276 new_type->array.has_implicit_size = true;
10277 new_type->array.size = 1;
10279 type_t *const result = identify_new_type(new_type);
10281 decl->type = result;
10285 static void prepare_main_collect2(entity_t *const entity)
10287 PUSH_SCOPE(&entity->function.statement->compound.scope);
10289 // create call to __main
10290 symbol_t *symbol = symbol_table_insert("__main");
10291 entity_t *subsubmain_ent
10292 = create_implicit_function(symbol, &builtin_source_position);
10294 expression_t *ref = allocate_expression_zero(EXPR_REFERENCE);
10295 type_t *ftype = subsubmain_ent->declaration.type;
10296 ref->base.source_position = builtin_source_position;
10297 ref->base.type = make_pointer_type(ftype, TYPE_QUALIFIER_NONE);
10298 ref->reference.entity = subsubmain_ent;
10300 expression_t *call = allocate_expression_zero(EXPR_CALL);
10301 call->base.source_position = builtin_source_position;
10302 call->base.type = type_void;
10303 call->call.function = ref;
10305 statement_t *expr_statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10306 expr_statement->base.source_position = builtin_source_position;
10307 expr_statement->expression.expression = call;
10309 statement_t *statement = entity->function.statement;
10310 assert(statement->kind == STATEMENT_COMPOUND);
10311 compound_statement_t *compounds = &statement->compound;
10313 expr_statement->base.next = compounds->statements;
10314 compounds->statements = expr_statement;
10321 lookahead_bufpos = 0;
10322 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10325 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
10326 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
10327 parse_translation_unit();
10328 complete_incomplete_arrays();
10329 DEL_ARR_F(incomplete_arrays);
10330 incomplete_arrays = NULL;
10334 * Initialize the parser.
10336 void init_parser(void)
10338 sym_anonymous = symbol_table_insert("<anonymous>");
10340 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10342 init_expression_parsers();
10343 obstack_init(&temp_obst);
10347 * Terminate the parser.
10349 void exit_parser(void)
10351 obstack_free(&temp_obst, NULL);