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
27 #include "adt/strutil.h"
29 #include "diagnostic.h"
30 #include "format_check.h"
36 #include "type_hash.h"
39 #include "attribute_t.h"
40 #include "lang_features.h"
44 #include "adt/bitfiddle.h"
45 #include "adt/error.h"
46 #include "adt/array.h"
48 //#define PRINT_TOKENS
49 #define MAX_LOOKAHEAD 1
54 entity_namespace_t namespc;
57 typedef struct declaration_specifiers_t declaration_specifiers_t;
58 struct declaration_specifiers_t {
59 source_position_t source_position;
60 storage_class_t storage_class;
61 unsigned char alignment; /**< Alignment, 0 if not set. */
63 bool thread_local : 1; /**< GCC __thread */
64 attribute_t *attributes; /**< list of attributes */
69 * An environment for parsing initializers (and compound literals).
71 typedef struct parse_initializer_env_t {
72 type_t *type; /**< the type of the initializer. In case of an
73 array type with unspecified size this gets
74 adjusted to the actual size. */
75 entity_t *entity; /**< the variable that is initialized if any */
76 bool must_be_constant;
77 } parse_initializer_env_t;
79 typedef entity_t* (*parsed_declaration_func) (entity_t *declaration, bool is_definition);
81 /** The current token. */
83 /** The lookahead ring-buffer. */
84 static token_t lookahead_buffer[MAX_LOOKAHEAD];
85 /** Position of the next token in the lookahead buffer. */
86 static size_t lookahead_bufpos;
87 static stack_entry_t *environment_stack = NULL;
88 static stack_entry_t *label_stack = NULL;
89 static scope_t *file_scope = NULL;
90 static scope_t *current_scope = NULL;
91 /** Point to the current function declaration if inside a function. */
92 static function_t *current_function = NULL;
93 static entity_t *current_entity = NULL;
94 static switch_statement_t *current_switch = NULL;
95 static statement_t *current_loop = NULL;
96 static statement_t *current_parent = NULL;
97 static ms_try_statement_t *current_try = NULL;
98 static linkage_kind_t current_linkage;
99 static goto_statement_t *goto_first = NULL;
100 static goto_statement_t **goto_anchor = NULL;
101 static label_statement_t *label_first = NULL;
102 static label_statement_t **label_anchor = NULL;
103 /** current translation unit. */
104 static translation_unit_t *unit = NULL;
105 /** true if we are in an __extension__ context. */
106 static bool in_gcc_extension = false;
107 static struct obstack temp_obst;
108 static entity_t *anonymous_entity;
109 static declaration_t **incomplete_arrays;
110 static elf_visibility_tag_t default_visibility = ELF_VISIBILITY_DEFAULT;
113 #define PUSH_CURRENT_ENTITY(entity) \
114 entity_t *const new_current_entity = (entity); \
115 entity_t *const old_current_entity = current_entity; \
116 ((void)(current_entity = new_current_entity))
117 #define POP_CURRENT_ENTITY() (assert(current_entity == new_current_entity), (void)(current_entity = old_current_entity))
119 #define PUSH_PARENT(stmt) \
120 statement_t *const new_parent = (stmt); \
121 statement_t *const old_parent = current_parent; \
122 ((void)(current_parent = new_parent))
123 #define POP_PARENT() (assert(current_parent == new_parent), (void)(current_parent = old_parent))
125 #define PUSH_SCOPE(scope) \
126 size_t const top = environment_top(); \
127 scope_t *const new_scope = (scope); \
128 scope_t *const old_scope = (new_scope ? scope_push(new_scope) : NULL)
129 #define PUSH_SCOPE_STATEMENT(scope) PUSH_SCOPE(c_mode & (_C99 | _CXX) ? (scope) : NULL)
130 #define POP_SCOPE() (new_scope ? assert(current_scope == new_scope), scope_pop(old_scope), environment_pop_to(top) : (void)0)
132 #define PUSH_EXTENSION() \
134 bool const old_gcc_extension = in_gcc_extension; \
135 while (next_if(T___extension__)) { \
136 in_gcc_extension = true; \
139 #define POP_EXTENSION() \
140 ((void)(in_gcc_extension = old_gcc_extension))
142 /** The token anchor set */
143 static unsigned short token_anchor_set[T_LAST_TOKEN];
145 /** The current source position. */
146 #define HERE (&token.base.source_position)
148 /** true if we are in GCC mode. */
149 #define GNU_MODE ((c_mode & _GNUC) || in_gcc_extension)
151 static statement_t *parse_compound_statement(bool inside_expression_statement);
152 static statement_t *parse_statement(void);
154 static expression_t *parse_subexpression(precedence_t);
155 static expression_t *parse_expression(void);
156 static type_t *parse_typename(void);
157 static void parse_externals(void);
158 static void parse_external(void);
160 static void parse_compound_type_entries(compound_t *compound_declaration);
162 static void check_call_argument(type_t *expected_type,
163 call_argument_t *argument, unsigned pos);
165 typedef enum declarator_flags_t {
167 DECL_MAY_BE_ABSTRACT = 1U << 0,
168 DECL_CREATE_COMPOUND_MEMBER = 1U << 1,
169 DECL_IS_PARAMETER = 1U << 2
170 } declarator_flags_t;
172 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
173 declarator_flags_t flags);
175 static void semantic_comparison(binary_expression_t *expression);
177 #define STORAGE_CLASSES \
178 STORAGE_CLASSES_NO_EXTERN \
181 #define STORAGE_CLASSES_NO_EXTERN \
188 #define TYPE_QUALIFIERS \
193 case T__forceinline: \
194 case T___attribute__:
196 #define COMPLEX_SPECIFIERS \
198 #define IMAGINARY_SPECIFIERS \
201 #define TYPE_SPECIFIERS \
203 case T___builtin_va_list: \
228 #define DECLARATION_START \
233 #define DECLARATION_START_NO_EXTERN \
234 STORAGE_CLASSES_NO_EXTERN \
238 #define EXPRESSION_START \
247 case T_CHARACTER_CONSTANT: \
251 case T_STRING_LITERAL: \
252 case T___FUNCDNAME__: \
253 case T___FUNCSIG__: \
254 case T___PRETTY_FUNCTION__: \
255 case T___alignof__: \
256 case T___builtin_classify_type: \
257 case T___builtin_constant_p: \
258 case T___builtin_isgreater: \
259 case T___builtin_isgreaterequal: \
260 case T___builtin_isless: \
261 case T___builtin_islessequal: \
262 case T___builtin_islessgreater: \
263 case T___builtin_isunordered: \
264 case T___builtin_offsetof: \
265 case T___builtin_va_arg: \
266 case T___builtin_va_copy: \
267 case T___builtin_va_start: \
278 * Returns the size of a statement node.
280 * @param kind the statement kind
282 static size_t get_statement_struct_size(statement_kind_t kind)
284 static const size_t sizes[] = {
285 [STATEMENT_ERROR] = sizeof(statement_base_t),
286 [STATEMENT_EMPTY] = sizeof(statement_base_t),
287 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
288 [STATEMENT_RETURN] = sizeof(return_statement_t),
289 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
290 [STATEMENT_IF] = sizeof(if_statement_t),
291 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
292 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
293 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
294 [STATEMENT_BREAK] = sizeof(statement_base_t),
295 [STATEMENT_COMPUTED_GOTO] = sizeof(computed_goto_statement_t),
296 [STATEMENT_GOTO] = sizeof(goto_statement_t),
297 [STATEMENT_LABEL] = sizeof(label_statement_t),
298 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
299 [STATEMENT_WHILE] = sizeof(while_statement_t),
300 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
301 [STATEMENT_FOR] = sizeof(for_statement_t),
302 [STATEMENT_ASM] = sizeof(asm_statement_t),
303 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
304 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
306 assert((size_t)kind < lengthof(sizes));
307 assert(sizes[kind] != 0);
312 * Returns the size of an expression node.
314 * @param kind the expression kind
316 static size_t get_expression_struct_size(expression_kind_t kind)
318 static const size_t sizes[] = {
319 [EXPR_ERROR] = sizeof(expression_base_t),
320 [EXPR_REFERENCE] = sizeof(reference_expression_t),
321 [EXPR_ENUM_CONSTANT] = sizeof(reference_expression_t),
322 [EXPR_LITERAL_BOOLEAN] = sizeof(literal_expression_t),
323 [EXPR_LITERAL_INTEGER] = sizeof(literal_expression_t),
324 [EXPR_LITERAL_FLOATINGPOINT] = sizeof(literal_expression_t),
325 [EXPR_LITERAL_CHARACTER] = sizeof(string_literal_expression_t),
326 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
327 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
328 [EXPR_CALL] = sizeof(call_expression_t),
329 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
330 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
331 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
332 [EXPR_SELECT] = sizeof(select_expression_t),
333 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
334 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
335 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
336 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
337 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
338 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
339 [EXPR_BUILTIN_TYPES_COMPATIBLE_P] = sizeof(builtin_types_compatible_expression_t),
340 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
341 [EXPR_VA_START] = sizeof(va_start_expression_t),
342 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
343 [EXPR_VA_COPY] = sizeof(va_copy_expression_t),
344 [EXPR_STATEMENT] = sizeof(statement_expression_t),
345 [EXPR_LABEL_ADDRESS] = sizeof(label_address_expression_t),
347 if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
348 return sizes[EXPR_UNARY_FIRST];
350 if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
351 return sizes[EXPR_BINARY_FIRST];
353 assert((size_t)kind < lengthof(sizes));
354 assert(sizes[kind] != 0);
359 * Allocate a statement node of given kind and initialize all
360 * fields with zero. Sets its source position to the position
361 * of the current token.
363 static statement_t *allocate_statement_zero(statement_kind_t kind)
365 size_t size = get_statement_struct_size(kind);
366 statement_t *res = allocate_ast_zero(size);
368 res->base.kind = kind;
369 res->base.parent = current_parent;
370 res->base.source_position = *HERE;
375 * Allocate an expression node of given kind and initialize all
378 * @param kind the kind of the expression to allocate
380 static expression_t *allocate_expression_zero(expression_kind_t kind)
382 size_t size = get_expression_struct_size(kind);
383 expression_t *res = allocate_ast_zero(size);
385 res->base.kind = kind;
386 res->base.type = type_error_type;
387 res->base.source_position = *HERE;
392 * Creates a new invalid expression at the source position
393 * of the current token.
395 static expression_t *create_error_expression(void)
397 expression_t *expression = allocate_expression_zero(EXPR_ERROR);
398 expression->base.type = type_error_type;
403 * Creates a new invalid statement.
405 static statement_t *create_error_statement(void)
407 return allocate_statement_zero(STATEMENT_ERROR);
411 * Allocate a new empty statement.
413 static statement_t *create_empty_statement(void)
415 return allocate_statement_zero(STATEMENT_EMPTY);
419 * Returns the size of an initializer node.
421 * @param kind the initializer kind
423 static size_t get_initializer_size(initializer_kind_t kind)
425 static const size_t sizes[] = {
426 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
427 [INITIALIZER_STRING] = sizeof(initializer_value_t),
428 [INITIALIZER_LIST] = sizeof(initializer_list_t),
429 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
431 assert((size_t)kind < lengthof(sizes));
432 assert(sizes[kind] != 0);
437 * Allocate an initializer node of given kind and initialize all
440 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
442 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
449 * Returns the index of the top element of the environment stack.
451 static size_t environment_top(void)
453 return ARR_LEN(environment_stack);
457 * Returns the index of the top element of the global label stack.
459 static size_t label_top(void)
461 return ARR_LEN(label_stack);
465 * Return the next token.
467 static inline void next_token(void)
469 token = lookahead_buffer[lookahead_bufpos];
470 lookahead_buffer[lookahead_bufpos] = lexer_token;
473 lookahead_bufpos = (lookahead_bufpos + 1) % MAX_LOOKAHEAD;
476 print_token(stderr, &token);
477 fprintf(stderr, "\n");
481 static inline void eat(token_kind_t const kind)
483 assert(token.kind == kind);
488 static inline bool next_if(token_kind_t const kind)
490 if (token.kind == kind) {
499 * Return the next token with a given lookahead.
501 static inline const token_t *look_ahead(size_t num)
503 assert(0 < num && num <= MAX_LOOKAHEAD);
504 size_t pos = (lookahead_bufpos + num - 1) % MAX_LOOKAHEAD;
505 return &lookahead_buffer[pos];
509 * Adds a token type to the token type anchor set (a multi-set).
511 static void add_anchor_token(token_kind_t const token_kind)
513 assert(token_kind < T_LAST_TOKEN);
514 ++token_anchor_set[token_kind];
518 * Remove a token type from the token type anchor set (a multi-set).
520 static void rem_anchor_token(token_kind_t const token_kind)
522 assert(token_kind < T_LAST_TOKEN);
523 assert(token_anchor_set[token_kind] != 0);
524 --token_anchor_set[token_kind];
528 * Eat tokens until a matching token type is found.
530 static void eat_until_matching_token(token_kind_t const type)
532 token_kind_t end_token;
534 case '(': end_token = ')'; break;
535 case '{': end_token = '}'; break;
536 case '[': end_token = ']'; break;
537 default: end_token = type; break;
540 unsigned parenthesis_count = 0;
541 unsigned brace_count = 0;
542 unsigned bracket_count = 0;
543 while (token.kind != end_token ||
544 parenthesis_count != 0 ||
546 bracket_count != 0) {
547 switch (token.kind) {
549 case '(': ++parenthesis_count; break;
550 case '{': ++brace_count; break;
551 case '[': ++bracket_count; break;
554 if (parenthesis_count > 0)
564 if (bracket_count > 0)
567 if (token.kind == end_token &&
568 parenthesis_count == 0 &&
582 * Eat input tokens until an anchor is found.
584 static void eat_until_anchor(void)
586 while (token_anchor_set[token.kind] == 0) {
587 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
588 eat_until_matching_token(token.kind);
594 * Eat a whole block from input tokens.
596 static void eat_block(void)
598 eat_until_matching_token('{');
603 * Report a parse error because an expected token was not found.
606 #if defined __GNUC__ && __GNUC__ >= 4
607 __attribute__((sentinel))
609 void parse_error_expected(const char *message, ...)
611 if (message != NULL) {
612 errorf(HERE, "%s", message);
615 va_start(ap, message);
616 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
621 * Report an incompatible type.
623 static void type_error_incompatible(const char *msg,
624 const source_position_t *source_position, type_t *type1, type_t *type2)
626 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
630 static bool skip_till(token_kind_t const expected, char const *const context)
632 if (UNLIKELY(token.kind != expected)) {
633 parse_error_expected(context, expected, NULL);
634 add_anchor_token(expected);
636 rem_anchor_token(expected);
637 if (token.kind != expected)
644 * Expect the current token is the expected token.
645 * If not, generate an error and skip until the next anchor.
647 static void expect(token_kind_t const expected)
649 if (skip_till(expected, NULL))
653 static symbol_t *expect_identifier(char const *const context, source_position_t *const pos)
655 if (!skip_till(T_IDENTIFIER, context))
657 symbol_t *const sym = token.base.symbol;
665 * Push a given scope on the scope stack and make it the
668 static scope_t *scope_push(scope_t *new_scope)
670 if (current_scope != NULL) {
671 new_scope->depth = current_scope->depth + 1;
674 scope_t *old_scope = current_scope;
675 current_scope = new_scope;
680 * Pop the current scope from the scope stack.
682 static void scope_pop(scope_t *old_scope)
684 current_scope = old_scope;
688 * Search an entity by its symbol in a given namespace.
690 static entity_t *get_entity(const symbol_t *const symbol,
691 namespace_tag_t namespc)
693 entity_t *entity = symbol->entity;
694 for (; entity != NULL; entity = entity->base.symbol_next) {
695 if ((namespace_tag_t)entity->base.namespc == namespc)
702 /* §6.2.3:1 24) There is only one name space for tags even though three are
704 static entity_t *get_tag(symbol_t const *const symbol,
705 entity_kind_tag_t const kind)
707 entity_t *entity = get_entity(symbol, NAMESPACE_TAG);
708 if (entity != NULL && (entity_kind_tag_t)entity->kind != kind) {
710 "'%Y' defined as wrong kind of tag (previous definition %P)",
711 symbol, &entity->base.source_position);
718 * pushs an entity on the environment stack and links the corresponding symbol
721 static void stack_push(stack_entry_t **stack_ptr, entity_t *entity)
723 symbol_t *symbol = entity->base.symbol;
724 entity_namespace_t namespc = entity->base.namespc;
725 assert(namespc != 0);
727 /* replace/add entity into entity list of the symbol */
730 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
735 /* replace an entry? */
736 if (iter->base.namespc == namespc) {
737 entity->base.symbol_next = iter->base.symbol_next;
743 /* remember old declaration */
745 entry.symbol = symbol;
746 entry.old_entity = iter;
747 entry.namespc = namespc;
748 ARR_APP1(stack_entry_t, *stack_ptr, entry);
752 * Push an entity on the environment stack.
754 static void environment_push(entity_t *entity)
756 assert(entity->base.source_position.input_name != NULL);
757 assert(entity->base.parent_scope != NULL);
758 stack_push(&environment_stack, entity);
762 * Push a declaration on the global label stack.
764 * @param declaration the declaration
766 static void label_push(entity_t *label)
768 /* we abuse the parameters scope as parent for the labels */
769 label->base.parent_scope = ¤t_function->parameters;
770 stack_push(&label_stack, label);
774 * pops symbols from the environment stack until @p new_top is the top element
776 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
778 stack_entry_t *stack = *stack_ptr;
779 size_t top = ARR_LEN(stack);
782 assert(new_top <= top);
786 for (i = top; i > new_top; --i) {
787 stack_entry_t *entry = &stack[i - 1];
789 entity_t *old_entity = entry->old_entity;
790 symbol_t *symbol = entry->symbol;
791 entity_namespace_t namespc = entry->namespc;
793 /* replace with old_entity/remove */
796 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
798 assert(iter != NULL);
799 /* replace an entry? */
800 if (iter->base.namespc == namespc)
804 /* restore definition from outer scopes (if there was one) */
805 if (old_entity != NULL) {
806 old_entity->base.symbol_next = iter->base.symbol_next;
807 *anchor = old_entity;
809 /* remove entry from list */
810 *anchor = iter->base.symbol_next;
814 ARR_SHRINKLEN(*stack_ptr, new_top);
818 * Pop all entries from the environment stack until the new_top
821 * @param new_top the new stack top
823 static void environment_pop_to(size_t new_top)
825 stack_pop_to(&environment_stack, new_top);
829 * Pop all entries from the global label stack until the new_top
832 * @param new_top the new stack top
834 static void label_pop_to(size_t new_top)
836 stack_pop_to(&label_stack, new_top);
839 static atomic_type_kind_t get_akind(const type_t *type)
841 assert(type->kind == TYPE_ATOMIC || type->kind == TYPE_COMPLEX
842 || type->kind == TYPE_IMAGINARY || type->kind == TYPE_ENUM);
843 return type->atomic.akind;
847 * §6.3.1.1:2 Do integer promotion for a given type.
849 * @param type the type to promote
850 * @return the promoted type
852 static type_t *promote_integer(type_t *type)
854 if (get_akind_rank(get_akind(type)) < get_akind_rank(ATOMIC_TYPE_INT))
861 * Check if a given expression represents a null pointer constant.
863 * @param expression the expression to check
865 static bool is_null_pointer_constant(const expression_t *expression)
867 /* skip void* cast */
868 if (expression->kind == EXPR_UNARY_CAST) {
869 type_t *const type = skip_typeref(expression->base.type);
870 if (types_compatible(type, type_void_ptr))
871 expression = expression->unary.value;
874 type_t *const type = skip_typeref(expression->base.type);
875 if (!is_type_integer(type))
877 switch (is_constant_expression(expression)) {
878 case EXPR_CLASS_ERROR: return true;
879 case EXPR_CLASS_CONSTANT: return !fold_constant_to_bool(expression);
880 default: return false;
885 * Create an implicit cast expression.
887 * @param expression the expression to cast
888 * @param dest_type the destination type
890 static expression_t *create_implicit_cast(expression_t *expression,
893 type_t *const source_type = expression->base.type;
895 if (source_type == dest_type)
898 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
899 cast->unary.value = expression;
900 cast->base.type = dest_type;
901 cast->base.implicit = true;
906 typedef enum assign_error_t {
908 ASSIGN_ERROR_INCOMPATIBLE,
909 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
910 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
911 ASSIGN_WARNING_POINTER_FROM_INT,
912 ASSIGN_WARNING_INT_FROM_POINTER
915 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)
917 type_t *const orig_type_right = right->base.type;
918 type_t *const type_left = skip_typeref(orig_type_left);
919 type_t *const type_right = skip_typeref(orig_type_right);
924 case ASSIGN_ERROR_INCOMPATIBLE:
925 errorf(pos, "destination type '%T' in %s is incompatible with type '%T'", orig_type_left, context, orig_type_right);
928 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
929 type_t *points_to_left = skip_typeref(type_left->pointer.points_to);
930 type_t *points_to_right = skip_typeref(type_right->pointer.points_to);
932 /* the left type has all qualifiers from the right type */
933 unsigned missing_qualifiers = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
934 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);
938 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
939 warningf(WARN_OTHER, pos, "destination type '%T' in %s is incompatible with '%E' of type '%T'", orig_type_left, context, right, orig_type_right);
942 case ASSIGN_WARNING_POINTER_FROM_INT:
943 warningf(WARN_OTHER, pos, "%s makes pointer '%T' from integer '%T' without a cast", context, orig_type_left, orig_type_right);
946 case ASSIGN_WARNING_INT_FROM_POINTER:
947 warningf(WARN_OTHER, pos, "%s makes integer '%T' from pointer '%T' without a cast", context, orig_type_left, orig_type_right);
951 panic("invalid error value");
955 /** Implements the rules from §6.5.16.1 */
956 static assign_error_t semantic_assign(type_t *orig_type_left,
957 const expression_t *const right)
959 type_t *const orig_type_right = right->base.type;
960 type_t *const type_left = skip_typeref(orig_type_left);
961 type_t *const type_right = skip_typeref(orig_type_right);
963 if (is_type_pointer(type_left)) {
964 if (is_null_pointer_constant(right)) {
965 return ASSIGN_SUCCESS;
966 } else if (is_type_pointer(type_right)) {
967 type_t *points_to_left
968 = skip_typeref(type_left->pointer.points_to);
969 type_t *points_to_right
970 = skip_typeref(type_right->pointer.points_to);
971 assign_error_t res = ASSIGN_SUCCESS;
973 /* the left type has all qualifiers from the right type */
974 unsigned missing_qualifiers
975 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
976 if (missing_qualifiers != 0) {
977 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
980 points_to_left = get_unqualified_type(points_to_left);
981 points_to_right = get_unqualified_type(points_to_right);
983 if (is_type_void(points_to_left))
986 if (is_type_void(points_to_right)) {
987 /* ISO/IEC 14882:1998(E) §C.1.2:6 */
988 return c_mode & _CXX ? ASSIGN_ERROR_INCOMPATIBLE : res;
991 if (!types_compatible(points_to_left, points_to_right)) {
992 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
996 } else if (is_type_integer(type_right)) {
997 return ASSIGN_WARNING_POINTER_FROM_INT;
999 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1000 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1001 && is_type_pointer(type_right))) {
1002 return ASSIGN_SUCCESS;
1003 } else if (is_type_compound(type_left) && is_type_compound(type_right)) {
1004 type_t *const unqual_type_left = get_unqualified_type(type_left);
1005 type_t *const unqual_type_right = get_unqualified_type(type_right);
1006 if (types_compatible(unqual_type_left, unqual_type_right)) {
1007 return ASSIGN_SUCCESS;
1009 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1010 return ASSIGN_WARNING_INT_FROM_POINTER;
1013 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1014 return ASSIGN_SUCCESS;
1016 return ASSIGN_ERROR_INCOMPATIBLE;
1019 static expression_t *parse_constant_expression(void)
1021 expression_t *result = parse_subexpression(PREC_CONDITIONAL);
1023 if (is_constant_expression(result) == EXPR_CLASS_VARIABLE) {
1024 errorf(&result->base.source_position,
1025 "expression '%E' is not constant", result);
1031 static expression_t *parse_assignment_expression(void)
1033 return parse_subexpression(PREC_ASSIGNMENT);
1036 static void append_string(string_t const *const s)
1038 /* FIXME Using the ast_obstack is a hack. Using the symbol_obstack is not
1039 * possible, because other tokens are grown there alongside. */
1040 obstack_grow(&ast_obstack, s->begin, s->size);
1043 static string_t finish_string(string_encoding_t const enc)
1045 obstack_1grow(&ast_obstack, '\0');
1046 size_t const size = obstack_object_size(&ast_obstack) - 1;
1047 char const *const string = obstack_finish(&ast_obstack);
1048 return (string_t){ string, size, enc };
1051 static string_t concat_string_literals(void)
1053 assert(token.kind == T_STRING_LITERAL);
1056 if (look_ahead(1)->kind == T_STRING_LITERAL) {
1057 append_string(&token.literal.string);
1058 eat(T_STRING_LITERAL);
1059 warningf(WARN_TRADITIONAL, HERE, "traditional C rejects string constant concatenation");
1060 string_encoding_t enc = token.literal.string.encoding;
1062 if (token.literal.string.encoding != STRING_ENCODING_CHAR) {
1063 enc = token.literal.string.encoding;
1065 append_string(&token.literal.string);
1066 eat(T_STRING_LITERAL);
1067 } while (token.kind == T_STRING_LITERAL);
1068 result = finish_string(enc);
1070 result = token.literal.string;
1071 eat(T_STRING_LITERAL);
1077 static string_t parse_string_literals(char const *const context)
1079 if (!skip_till(T_STRING_LITERAL, context))
1080 return (string_t){ "", 0, STRING_ENCODING_CHAR };
1082 source_position_t const pos = *HERE;
1083 string_t const res = concat_string_literals();
1085 if (res.encoding != STRING_ENCODING_CHAR) {
1086 errorf(&pos, "expected plain string literal, got wide string literal");
1092 static attribute_t *allocate_attribute_zero(attribute_kind_t kind)
1094 attribute_t *attribute = allocate_ast_zero(sizeof(*attribute));
1095 attribute->kind = kind;
1096 attribute->source_position = *HERE;
1101 * Parse (gcc) attribute argument. From gcc comments in gcc source:
1104 * __attribute__ ( ( attribute-list ) )
1108 * attribute_list , attrib
1113 * any-word ( identifier )
1114 * any-word ( identifier , nonempty-expr-list )
1115 * any-word ( expr-list )
1117 * where the "identifier" must not be declared as a type, and
1118 * "any-word" may be any identifier (including one declared as a
1119 * type), a reserved word storage class specifier, type specifier or
1120 * type qualifier. ??? This still leaves out most reserved keywords
1121 * (following the old parser), shouldn't we include them, and why not
1122 * allow identifiers declared as types to start the arguments?
1124 * Matze: this all looks confusing and little systematic, so we're even less
1125 * strict and parse any list of things which are identifiers or
1126 * (assignment-)expressions.
1128 static attribute_argument_t *parse_attribute_arguments(void)
1130 attribute_argument_t *first = NULL;
1131 attribute_argument_t **anchor = &first;
1132 if (token.kind != ')') do {
1133 attribute_argument_t *argument = allocate_ast_zero(sizeof(*argument));
1135 /* is it an identifier */
1136 if (token.kind == T_IDENTIFIER
1137 && (look_ahead(1)->kind == ',' || look_ahead(1)->kind == ')')) {
1138 argument->kind = ATTRIBUTE_ARGUMENT_SYMBOL;
1139 argument->v.symbol = token.base.symbol;
1142 /* must be an expression */
1143 expression_t *expression = parse_assignment_expression();
1145 argument->kind = ATTRIBUTE_ARGUMENT_EXPRESSION;
1146 argument->v.expression = expression;
1149 /* append argument */
1151 anchor = &argument->next;
1152 } while (next_if(','));
1157 static attribute_t *parse_attribute_asm(void)
1159 attribute_t *attribute = allocate_attribute_zero(ATTRIBUTE_GNU_ASM);
1162 attribute->a.arguments = parse_attribute_arguments();
1166 static attribute_t *parse_attribute_gnu_single(void)
1168 /* parse "any-word" */
1169 symbol_t *const symbol = token.base.symbol;
1170 if (symbol == NULL) {
1171 parse_error_expected("while parsing attribute((", T_IDENTIFIER, NULL);
1175 attribute_kind_t kind;
1176 char const *const name = symbol->string;
1177 for (kind = ATTRIBUTE_GNU_FIRST;; ++kind) {
1178 if (kind > ATTRIBUTE_GNU_LAST) {
1179 warningf(WARN_ATTRIBUTE, HERE, "unknown attribute '%s' ignored", name);
1180 /* TODO: we should still save the attribute in the list... */
1181 kind = ATTRIBUTE_UNKNOWN;
1185 const char *attribute_name = get_attribute_name(kind);
1186 if (attribute_name != NULL && streq_underscore(attribute_name, name))
1190 attribute_t *attribute = allocate_attribute_zero(kind);
1193 /* parse arguments */
1195 attribute->a.arguments = parse_attribute_arguments();
1200 static attribute_t *parse_attribute_gnu(void)
1202 attribute_t *first = NULL;
1203 attribute_t **anchor = &first;
1205 eat(T___attribute__);
1206 add_anchor_token(')');
1207 add_anchor_token(',');
1211 if (token.kind != ')') do {
1212 attribute_t *attribute = parse_attribute_gnu_single();
1214 *anchor = attribute;
1215 anchor = &attribute->next;
1217 } while (next_if(','));
1218 rem_anchor_token(',');
1219 rem_anchor_token(')');
1226 /** Parse attributes. */
1227 static attribute_t *parse_attributes(attribute_t *first)
1229 attribute_t **anchor = &first;
1231 while (*anchor != NULL)
1232 anchor = &(*anchor)->next;
1234 attribute_t *attribute;
1235 switch (token.kind) {
1236 case T___attribute__:
1237 attribute = parse_attribute_gnu();
1238 if (attribute == NULL)
1243 attribute = parse_attribute_asm();
1247 attribute = allocate_attribute_zero(ATTRIBUTE_MS_CDECL);
1252 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FASTCALL);
1256 case T__forceinline:
1257 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FORCEINLINE);
1258 eat(T__forceinline);
1262 attribute = allocate_attribute_zero(ATTRIBUTE_MS_STDCALL);
1267 /* TODO record modifier */
1268 warningf(WARN_OTHER, HERE, "Ignoring declaration modifier %K", &token);
1269 attribute = allocate_attribute_zero(ATTRIBUTE_MS_THISCALL);
1277 *anchor = attribute;
1278 anchor = &attribute->next;
1282 static void mark_vars_read(expression_t *expr, entity_t *lhs_ent);
1284 static entity_t *determine_lhs_ent(expression_t *const expr,
1287 switch (expr->kind) {
1288 case EXPR_REFERENCE: {
1289 entity_t *const entity = expr->reference.entity;
1290 /* we should only find variables as lvalues... */
1291 if (entity->base.kind != ENTITY_VARIABLE
1292 && entity->base.kind != ENTITY_PARAMETER)
1298 case EXPR_ARRAY_ACCESS: {
1299 expression_t *const ref = expr->array_access.array_ref;
1300 entity_t * ent = NULL;
1301 if (is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1302 ent = determine_lhs_ent(ref, lhs_ent);
1305 mark_vars_read(ref, lhs_ent);
1307 mark_vars_read(expr->array_access.index, lhs_ent);
1312 mark_vars_read(expr->select.compound, lhs_ent);
1313 if (is_type_compound(skip_typeref(expr->base.type)))
1314 return determine_lhs_ent(expr->select.compound, lhs_ent);
1318 case EXPR_UNARY_DEREFERENCE: {
1319 expression_t *const val = expr->unary.value;
1320 if (val->kind == EXPR_UNARY_TAKE_ADDRESS) {
1322 return determine_lhs_ent(val->unary.value, lhs_ent);
1324 mark_vars_read(val, NULL);
1330 mark_vars_read(expr, NULL);
1335 #define ENT_ANY ((entity_t*)-1)
1338 * Mark declarations, which are read. This is used to detect variables, which
1342 * x is not marked as "read", because it is only read to calculate its own new
1346 * x and y are not detected as "not read", because multiple variables are
1349 static void mark_vars_read(expression_t *const expr, entity_t *lhs_ent)
1351 switch (expr->kind) {
1352 case EXPR_REFERENCE: {
1353 entity_t *const entity = expr->reference.entity;
1354 if (entity->kind != ENTITY_VARIABLE
1355 && entity->kind != ENTITY_PARAMETER)
1358 if (lhs_ent != entity && lhs_ent != ENT_ANY) {
1359 entity->variable.read = true;
1365 // TODO respect pure/const
1366 mark_vars_read(expr->call.function, NULL);
1367 for (call_argument_t *arg = expr->call.arguments; arg != NULL; arg = arg->next) {
1368 mark_vars_read(arg->expression, NULL);
1372 case EXPR_CONDITIONAL:
1373 // TODO lhs_decl should depend on whether true/false have an effect
1374 mark_vars_read(expr->conditional.condition, NULL);
1375 if (expr->conditional.true_expression != NULL)
1376 mark_vars_read(expr->conditional.true_expression, lhs_ent);
1377 mark_vars_read(expr->conditional.false_expression, lhs_ent);
1381 if (lhs_ent == ENT_ANY
1382 && !is_type_compound(skip_typeref(expr->base.type)))
1384 mark_vars_read(expr->select.compound, lhs_ent);
1387 case EXPR_ARRAY_ACCESS: {
1388 mark_vars_read(expr->array_access.index, lhs_ent);
1389 expression_t *const ref = expr->array_access.array_ref;
1390 if (!is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1391 if (lhs_ent == ENT_ANY)
1394 mark_vars_read(ref, lhs_ent);
1399 mark_vars_read(expr->va_arge.ap, lhs_ent);
1403 mark_vars_read(expr->va_copye.src, lhs_ent);
1406 case EXPR_UNARY_CAST:
1407 /* Special case: Use void cast to mark a variable as "read" */
1408 if (is_type_void(skip_typeref(expr->base.type)))
1413 case EXPR_UNARY_THROW:
1414 if (expr->unary.value == NULL)
1417 case EXPR_UNARY_DEREFERENCE:
1418 case EXPR_UNARY_DELETE:
1419 case EXPR_UNARY_DELETE_ARRAY:
1420 if (lhs_ent == ENT_ANY)
1424 case EXPR_UNARY_NEGATE:
1425 case EXPR_UNARY_PLUS:
1426 case EXPR_UNARY_BITWISE_NEGATE:
1427 case EXPR_UNARY_NOT:
1428 case EXPR_UNARY_TAKE_ADDRESS:
1429 case EXPR_UNARY_POSTFIX_INCREMENT:
1430 case EXPR_UNARY_POSTFIX_DECREMENT:
1431 case EXPR_UNARY_PREFIX_INCREMENT:
1432 case EXPR_UNARY_PREFIX_DECREMENT:
1433 case EXPR_UNARY_ASSUME:
1435 mark_vars_read(expr->unary.value, lhs_ent);
1438 case EXPR_BINARY_ADD:
1439 case EXPR_BINARY_SUB:
1440 case EXPR_BINARY_MUL:
1441 case EXPR_BINARY_DIV:
1442 case EXPR_BINARY_MOD:
1443 case EXPR_BINARY_EQUAL:
1444 case EXPR_BINARY_NOTEQUAL:
1445 case EXPR_BINARY_LESS:
1446 case EXPR_BINARY_LESSEQUAL:
1447 case EXPR_BINARY_GREATER:
1448 case EXPR_BINARY_GREATEREQUAL:
1449 case EXPR_BINARY_BITWISE_AND:
1450 case EXPR_BINARY_BITWISE_OR:
1451 case EXPR_BINARY_BITWISE_XOR:
1452 case EXPR_BINARY_LOGICAL_AND:
1453 case EXPR_BINARY_LOGICAL_OR:
1454 case EXPR_BINARY_SHIFTLEFT:
1455 case EXPR_BINARY_SHIFTRIGHT:
1456 case EXPR_BINARY_COMMA:
1457 case EXPR_BINARY_ISGREATER:
1458 case EXPR_BINARY_ISGREATEREQUAL:
1459 case EXPR_BINARY_ISLESS:
1460 case EXPR_BINARY_ISLESSEQUAL:
1461 case EXPR_BINARY_ISLESSGREATER:
1462 case EXPR_BINARY_ISUNORDERED:
1463 mark_vars_read(expr->binary.left, lhs_ent);
1464 mark_vars_read(expr->binary.right, lhs_ent);
1467 case EXPR_BINARY_ASSIGN:
1468 case EXPR_BINARY_MUL_ASSIGN:
1469 case EXPR_BINARY_DIV_ASSIGN:
1470 case EXPR_BINARY_MOD_ASSIGN:
1471 case EXPR_BINARY_ADD_ASSIGN:
1472 case EXPR_BINARY_SUB_ASSIGN:
1473 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
1474 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
1475 case EXPR_BINARY_BITWISE_AND_ASSIGN:
1476 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
1477 case EXPR_BINARY_BITWISE_OR_ASSIGN: {
1478 if (lhs_ent == ENT_ANY)
1480 lhs_ent = determine_lhs_ent(expr->binary.left, lhs_ent);
1481 mark_vars_read(expr->binary.right, lhs_ent);
1486 determine_lhs_ent(expr->va_starte.ap, lhs_ent);
1489 case EXPR_LITERAL_CASES:
1490 case EXPR_LITERAL_CHARACTER:
1492 case EXPR_STRING_LITERAL:
1493 case EXPR_COMPOUND_LITERAL: // TODO init?
1495 case EXPR_CLASSIFY_TYPE:
1498 case EXPR_BUILTIN_CONSTANT_P:
1499 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
1501 case EXPR_STATEMENT: // TODO
1502 case EXPR_LABEL_ADDRESS:
1503 case EXPR_ENUM_CONSTANT:
1507 panic("unhandled expression");
1510 static designator_t *parse_designation(void)
1512 designator_t *result = NULL;
1513 designator_t **anchor = &result;
1516 designator_t *designator;
1517 switch (token.kind) {
1519 designator = allocate_ast_zero(sizeof(designator[0]));
1520 designator->source_position = *HERE;
1522 add_anchor_token(']');
1523 designator->array_index = parse_constant_expression();
1524 rem_anchor_token(']');
1528 designator = allocate_ast_zero(sizeof(designator[0]));
1529 designator->source_position = *HERE;
1531 designator->symbol = expect_identifier("while parsing designator", NULL);
1532 if (!designator->symbol)
1540 assert(designator != NULL);
1541 *anchor = designator;
1542 anchor = &designator->next;
1547 * Build an initializer from a given expression.
1549 static initializer_t *initializer_from_expression(type_t *orig_type,
1550 expression_t *expression)
1552 /* TODO check that expression is a constant expression */
1554 type_t *const type = skip_typeref(orig_type);
1556 /* §6.7.8.14/15 char array may be initialized by string literals */
1557 if (expression->kind == EXPR_STRING_LITERAL && is_type_array(type)) {
1558 array_type_t *const array_type = &type->array;
1559 type_t *const element_type = skip_typeref(array_type->element_type);
1560 switch (expression->string_literal.value.encoding) {
1561 case STRING_ENCODING_CHAR: {
1562 if (is_type_atomic(element_type, ATOMIC_TYPE_CHAR) ||
1563 is_type_atomic(element_type, ATOMIC_TYPE_SCHAR) ||
1564 is_type_atomic(element_type, ATOMIC_TYPE_UCHAR)) {
1565 goto make_string_init;
1570 case STRING_ENCODING_WIDE: {
1571 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
1572 if (get_unqualified_type(element_type) == bare_wchar_type) {
1574 initializer_t *const init = allocate_initializer_zero(INITIALIZER_STRING);
1575 init->value.value = expression;
1583 assign_error_t error = semantic_assign(type, expression);
1584 if (error == ASSIGN_ERROR_INCOMPATIBLE)
1586 report_assign_error(error, type, expression, "initializer",
1587 &expression->base.source_position);
1589 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
1590 result->value.value = create_implicit_cast(expression, type);
1596 * Parses an scalar initializer.
1598 * §6.7.8.11; eat {} without warning
1600 static initializer_t *parse_scalar_initializer(type_t *type,
1601 bool must_be_constant)
1603 /* there might be extra {} hierarchies */
1605 if (token.kind == '{') {
1606 warningf(WARN_OTHER, HERE, "extra curly braces around scalar initializer");
1610 } while (token.kind == '{');
1613 expression_t *expression = parse_assignment_expression();
1614 mark_vars_read(expression, NULL);
1615 if (must_be_constant && !is_linker_constant(expression)) {
1616 errorf(&expression->base.source_position,
1617 "initialisation expression '%E' is not constant",
1621 initializer_t *initializer = initializer_from_expression(type, expression);
1623 if (initializer == NULL) {
1624 errorf(&expression->base.source_position,
1625 "expression '%E' (type '%T') doesn't match expected type '%T'",
1626 expression, expression->base.type, type);
1631 bool additional_warning_displayed = false;
1632 while (braces > 0) {
1634 if (token.kind != '}') {
1635 if (!additional_warning_displayed) {
1636 warningf(WARN_OTHER, HERE, "additional elements in scalar initializer");
1637 additional_warning_displayed = true;
1648 * An entry in the type path.
1650 typedef struct type_path_entry_t type_path_entry_t;
1651 struct type_path_entry_t {
1652 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
1654 size_t index; /**< For array types: the current index. */
1655 declaration_t *compound_entry; /**< For compound types: the current declaration. */
1660 * A type path expression a position inside compound or array types.
1662 typedef struct type_path_t type_path_t;
1663 struct type_path_t {
1664 type_path_entry_t *path; /**< An flexible array containing the current path. */
1665 type_t *top_type; /**< type of the element the path points */
1666 size_t max_index; /**< largest index in outermost array */
1670 * Prints a type path for debugging.
1672 static __attribute__((unused)) void debug_print_type_path(
1673 const type_path_t *path)
1675 size_t len = ARR_LEN(path->path);
1677 for (size_t i = 0; i < len; ++i) {
1678 const type_path_entry_t *entry = & path->path[i];
1680 type_t *type = skip_typeref(entry->type);
1681 if (is_type_compound(type)) {
1682 /* in gcc mode structs can have no members */
1683 if (entry->v.compound_entry == NULL) {
1687 fprintf(stderr, ".%s",
1688 entry->v.compound_entry->base.symbol->string);
1689 } else if (is_type_array(type)) {
1690 fprintf(stderr, "[%u]", (unsigned) entry->v.index);
1692 fprintf(stderr, "-INVALID-");
1695 if (path->top_type != NULL) {
1696 fprintf(stderr, " (");
1697 print_type(path->top_type);
1698 fprintf(stderr, ")");
1703 * Return the top type path entry, ie. in a path
1704 * (type).a.b returns the b.
1706 static type_path_entry_t *get_type_path_top(const type_path_t *path)
1708 size_t len = ARR_LEN(path->path);
1710 return &path->path[len-1];
1714 * Enlarge the type path by an (empty) element.
1716 static type_path_entry_t *append_to_type_path(type_path_t *path)
1718 size_t len = ARR_LEN(path->path);
1719 ARR_RESIZE(type_path_entry_t, path->path, len+1);
1721 type_path_entry_t *result = & path->path[len];
1722 memset(result, 0, sizeof(result[0]));
1727 * Descending into a sub-type. Enter the scope of the current top_type.
1729 static void descend_into_subtype(type_path_t *path)
1731 type_t *orig_top_type = path->top_type;
1732 type_t *top_type = skip_typeref(orig_top_type);
1734 type_path_entry_t *top = append_to_type_path(path);
1735 top->type = top_type;
1737 if (is_type_compound(top_type)) {
1738 compound_t *const compound = top_type->compound.compound;
1739 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
1741 if (entry != NULL) {
1742 top->v.compound_entry = &entry->declaration;
1743 path->top_type = entry->declaration.type;
1745 path->top_type = NULL;
1747 } else if (is_type_array(top_type)) {
1749 path->top_type = top_type->array.element_type;
1751 assert(!is_type_valid(top_type));
1756 * Pop an entry from the given type path, ie. returning from
1757 * (type).a.b to (type).a
1759 static void ascend_from_subtype(type_path_t *path)
1761 type_path_entry_t *top = get_type_path_top(path);
1763 path->top_type = top->type;
1765 size_t len = ARR_LEN(path->path);
1766 ARR_RESIZE(type_path_entry_t, path->path, len-1);
1770 * Pop entries from the given type path until the given
1771 * path level is reached.
1773 static void ascend_to(type_path_t *path, size_t top_path_level)
1775 size_t len = ARR_LEN(path->path);
1777 while (len > top_path_level) {
1778 ascend_from_subtype(path);
1779 len = ARR_LEN(path->path);
1783 static bool walk_designator(type_path_t *path, const designator_t *designator,
1784 bool used_in_offsetof)
1786 for (; designator != NULL; designator = designator->next) {
1787 type_path_entry_t *top = get_type_path_top(path);
1788 type_t *orig_type = top->type;
1790 type_t *type = skip_typeref(orig_type);
1792 if (designator->symbol != NULL) {
1793 symbol_t *symbol = designator->symbol;
1794 if (!is_type_compound(type)) {
1795 if (is_type_valid(type)) {
1796 errorf(&designator->source_position,
1797 "'.%Y' designator used for non-compound type '%T'",
1801 top->type = type_error_type;
1802 top->v.compound_entry = NULL;
1803 orig_type = type_error_type;
1805 compound_t *compound = type->compound.compound;
1806 entity_t *iter = compound->members.entities;
1807 for (; iter != NULL; iter = iter->base.next) {
1808 if (iter->base.symbol == symbol) {
1813 errorf(&designator->source_position,
1814 "'%T' has no member named '%Y'", orig_type, symbol);
1817 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
1818 if (used_in_offsetof && iter->compound_member.bitfield) {
1819 errorf(&designator->source_position,
1820 "offsetof designator '%Y' must not specify bitfield",
1825 top->type = orig_type;
1826 top->v.compound_entry = &iter->declaration;
1827 orig_type = iter->declaration.type;
1830 expression_t *array_index = designator->array_index;
1831 if (is_constant_expression(array_index) != EXPR_CLASS_CONSTANT)
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 && outer_type != NULL) {
2060 sub = initializer_from_expression(outer_type, expression);
2063 if (token.kind != '}') {
2064 warningf(WARN_OTHER, HERE, "excessive elements in initializer for type '%T'", orig_type);
2066 /* TODO: eat , ... */
2071 /* descend into subtypes until expression matches type */
2073 orig_type = path->top_type;
2074 type = skip_typeref(orig_type);
2076 sub = initializer_from_expression(orig_type, expression);
2080 if (!is_type_valid(type)) {
2083 if (is_type_scalar(type)) {
2084 errorf(&expression->base.source_position,
2085 "expression '%E' doesn't match expected type '%T'",
2086 expression, orig_type);
2090 descend_into_subtype(path);
2094 /* update largest index of top array */
2095 const type_path_entry_t *first = &path->path[0];
2096 type_t *first_type = first->type;
2097 first_type = skip_typeref(first_type);
2098 if (is_type_array(first_type)) {
2099 size_t index = first->v.index;
2100 if (index > path->max_index)
2101 path->max_index = index;
2104 /* append to initializers list */
2105 ARR_APP1(initializer_t*, initializers, sub);
2108 if (token.kind == '}') {
2111 add_anchor_token('}');
2113 rem_anchor_token('}');
2114 if (token.kind == '}') {
2119 /* advance to the next declaration if we are not at the end */
2120 advance_current_object(path, top_path_level);
2121 orig_type = path->top_type;
2122 if (orig_type != NULL)
2123 type = skip_typeref(orig_type);
2129 size_t len = ARR_LEN(initializers);
2130 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2131 initializer_t *result = allocate_ast_zero(size);
2132 result->kind = INITIALIZER_LIST;
2133 result->list.len = len;
2134 memcpy(&result->list.initializers, initializers,
2135 len * sizeof(initializers[0]));
2137 DEL_ARR_F(initializers);
2138 ascend_to(path, top_path_level+1);
2143 skip_initializers();
2144 DEL_ARR_F(initializers);
2145 ascend_to(path, top_path_level+1);
2149 static expression_t *make_size_literal(size_t value)
2151 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_INTEGER);
2152 literal->base.type = type_size_t;
2155 snprintf(buf, sizeof(buf), "%u", (unsigned) value);
2156 literal->literal.value = make_string(buf);
2162 * Parses an initializer. Parsers either a compound literal
2163 * (env->declaration == NULL) or an initializer of a declaration.
2165 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2167 type_t *type = skip_typeref(env->type);
2168 size_t max_index = 0;
2169 initializer_t *result;
2171 if (is_type_scalar(type)) {
2172 result = parse_scalar_initializer(type, env->must_be_constant);
2173 } else if (token.kind == '{') {
2177 memset(&path, 0, sizeof(path));
2178 path.top_type = env->type;
2179 path.path = NEW_ARR_F(type_path_entry_t, 0);
2181 descend_into_subtype(&path);
2183 add_anchor_token('}');
2184 result = parse_sub_initializer(&path, env->type, 1, env);
2185 rem_anchor_token('}');
2187 max_index = path.max_index;
2188 DEL_ARR_F(path.path);
2192 /* parse_scalar_initializer() also works in this case: we simply
2193 * have an expression without {} around it */
2194 result = parse_scalar_initializer(type, env->must_be_constant);
2197 /* §6.7.8:22 array initializers for arrays with unknown size determine
2198 * the array type size */
2199 if (is_type_array(type) && type->array.size_expression == NULL
2200 && result != NULL) {
2202 switch (result->kind) {
2203 case INITIALIZER_LIST:
2204 assert(max_index != 0xdeadbeaf);
2205 size = max_index + 1;
2208 case INITIALIZER_STRING: {
2209 size = get_string_len(&get_init_string(result)->value) + 1;
2213 case INITIALIZER_DESIGNATOR:
2214 case INITIALIZER_VALUE:
2215 /* can happen for parse errors */
2220 internal_errorf(HERE, "invalid initializer type");
2223 type_t *new_type = duplicate_type(type);
2225 new_type->array.size_expression = make_size_literal(size);
2226 new_type->array.size_constant = true;
2227 new_type->array.has_implicit_size = true;
2228 new_type->array.size = size;
2229 env->type = new_type;
2235 static void append_entity(scope_t *scope, entity_t *entity)
2237 if (scope->last_entity != NULL) {
2238 scope->last_entity->base.next = entity;
2240 scope->entities = entity;
2242 entity->base.parent_entity = current_entity;
2243 scope->last_entity = entity;
2247 static compound_t *parse_compound_type_specifier(bool is_struct)
2249 source_position_t const pos = *HERE;
2250 eat(is_struct ? T_struct : T_union);
2252 symbol_t *symbol = NULL;
2253 entity_t *entity = NULL;
2254 attribute_t *attributes = NULL;
2256 if (token.kind == T___attribute__) {
2257 attributes = parse_attributes(NULL);
2260 entity_kind_tag_t const kind = is_struct ? ENTITY_STRUCT : ENTITY_UNION;
2261 if (token.kind == T_IDENTIFIER) {
2262 /* the compound has a name, check if we have seen it already */
2263 symbol = token.base.symbol;
2264 entity = get_tag(symbol, kind);
2267 if (entity != NULL) {
2268 if (entity->base.parent_scope != current_scope &&
2269 (token.kind == '{' || token.kind == ';')) {
2270 /* we're in an inner scope and have a definition. Shadow
2271 * existing definition in outer scope */
2273 } else if (entity->compound.complete && token.kind == '{') {
2274 source_position_t const *const ppos = &entity->base.source_position;
2275 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2276 /* clear members in the hope to avoid further errors */
2277 entity->compound.members.entities = NULL;
2280 } else if (token.kind != '{') {
2281 char const *const msg =
2282 is_struct ? "while parsing struct type specifier" :
2283 "while parsing union type specifier";
2284 parse_error_expected(msg, T_IDENTIFIER, '{', NULL);
2289 if (entity == NULL) {
2290 entity = allocate_entity_zero(kind, NAMESPACE_TAG, symbol, &pos);
2291 entity->compound.alignment = 1;
2292 entity->base.parent_scope = current_scope;
2293 if (symbol != NULL) {
2294 environment_push(entity);
2296 append_entity(current_scope, entity);
2299 if (token.kind == '{') {
2300 parse_compound_type_entries(&entity->compound);
2302 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2303 if (symbol == NULL) {
2304 assert(anonymous_entity == NULL);
2305 anonymous_entity = entity;
2309 if (attributes != NULL) {
2310 handle_entity_attributes(attributes, entity);
2313 return &entity->compound;
2316 static void parse_enum_entries(type_t *const enum_type)
2320 if (token.kind == '}') {
2321 errorf(HERE, "empty enum not allowed");
2326 add_anchor_token('}');
2327 add_anchor_token(',');
2329 add_anchor_token('=');
2330 source_position_t pos;
2331 symbol_t *const symbol = expect_identifier("while parsing enum entry", &pos);
2332 entity_t *const entity = allocate_entity_zero(ENTITY_ENUM_VALUE, NAMESPACE_NORMAL, symbol, &pos);
2333 entity->enum_value.enum_type = enum_type;
2334 rem_anchor_token('=');
2337 expression_t *value = parse_constant_expression();
2339 value = create_implicit_cast(value, enum_type);
2340 entity->enum_value.value = value;
2345 record_entity(entity, false);
2346 } while (next_if(',') && token.kind != '}');
2347 rem_anchor_token(',');
2348 rem_anchor_token('}');
2353 static type_t *parse_enum_specifier(void)
2355 source_position_t const pos = *HERE;
2360 switch (token.kind) {
2362 symbol = token.base.symbol;
2363 entity = get_tag(symbol, ENTITY_ENUM);
2366 if (entity != NULL) {
2367 if (entity->base.parent_scope != current_scope &&
2368 (token.kind == '{' || token.kind == ';')) {
2369 /* we're in an inner scope and have a definition. Shadow
2370 * existing definition in outer scope */
2372 } else if (entity->enume.complete && token.kind == '{') {
2373 source_position_t const *const ppos = &entity->base.source_position;
2374 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2385 parse_error_expected("while parsing enum type specifier",
2386 T_IDENTIFIER, '{', NULL);
2390 if (entity == NULL) {
2391 entity = allocate_entity_zero(ENTITY_ENUM, NAMESPACE_TAG, symbol, &pos);
2392 entity->base.parent_scope = current_scope;
2395 type_t *const type = allocate_type_zero(TYPE_ENUM);
2396 type->enumt.enume = &entity->enume;
2397 type->enumt.base.akind = ATOMIC_TYPE_INT;
2399 if (token.kind == '{') {
2400 if (symbol != NULL) {
2401 environment_push(entity);
2403 append_entity(current_scope, entity);
2404 entity->enume.complete = true;
2406 parse_enum_entries(type);
2407 parse_attributes(NULL);
2409 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2410 if (symbol == NULL) {
2411 assert(anonymous_entity == NULL);
2412 anonymous_entity = entity;
2414 } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
2415 errorf(HERE, "'%T' used before definition (incomplete enums are a GNU extension)", type);
2422 * if a symbol is a typedef to another type, return true
2424 static bool is_typedef_symbol(symbol_t *symbol)
2426 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
2427 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
2430 static type_t *parse_typeof(void)
2436 add_anchor_token(')');
2439 expression_t *expression = NULL;
2441 switch (token.kind) {
2443 if (is_typedef_symbol(token.base.symbol)) {
2445 type = parse_typename();
2448 expression = parse_expression();
2449 type = revert_automatic_type_conversion(expression);
2454 rem_anchor_token(')');
2457 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
2458 typeof_type->typeoft.expression = expression;
2459 typeof_type->typeoft.typeof_type = type;
2464 typedef enum specifiers_t {
2466 SPECIFIER_SIGNED = 1 << 0,
2467 SPECIFIER_UNSIGNED = 1 << 1,
2468 SPECIFIER_LONG = 1 << 2,
2469 SPECIFIER_INT = 1 << 3,
2470 SPECIFIER_DOUBLE = 1 << 4,
2471 SPECIFIER_CHAR = 1 << 5,
2472 SPECIFIER_WCHAR_T = 1 << 6,
2473 SPECIFIER_SHORT = 1 << 7,
2474 SPECIFIER_LONG_LONG = 1 << 8,
2475 SPECIFIER_FLOAT = 1 << 9,
2476 SPECIFIER_BOOL = 1 << 10,
2477 SPECIFIER_VOID = 1 << 11,
2478 SPECIFIER_INT8 = 1 << 12,
2479 SPECIFIER_INT16 = 1 << 13,
2480 SPECIFIER_INT32 = 1 << 14,
2481 SPECIFIER_INT64 = 1 << 15,
2482 SPECIFIER_INT128 = 1 << 16,
2483 SPECIFIER_COMPLEX = 1 << 17,
2484 SPECIFIER_IMAGINARY = 1 << 18,
2487 static type_t *get_typedef_type(symbol_t *symbol)
2489 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
2490 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
2493 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
2494 type->typedeft.typedefe = &entity->typedefe;
2499 static attribute_t *parse_attribute_ms_property(attribute_t *attribute)
2501 attribute_property_argument_t *const property = allocate_ast_zero(sizeof(*property));
2503 add_anchor_token(')');
2504 add_anchor_token(',');
2508 add_anchor_token('=');
2509 source_position_t pos;
2510 symbol_t *const prop_sym = expect_identifier("while parsing property declspec", &pos);
2511 rem_anchor_token('=');
2513 symbol_t **prop = NULL;
2515 if (streq(prop_sym->string, "put")) {
2516 prop = &property->put_symbol;
2517 } else if (streq(prop_sym->string, "get")) {
2518 prop = &property->get_symbol;
2520 errorf(&pos, "expected put or get in property declspec, but got '%Y'", prop_sym);
2524 add_anchor_token(T_IDENTIFIER);
2526 rem_anchor_token(T_IDENTIFIER);
2528 symbol_t *const sym = expect_identifier("while parsing property declspec", NULL);
2530 *prop = sym ? sym : sym_anonymous;
2531 } while (next_if(','));
2532 rem_anchor_token(',');
2533 rem_anchor_token(')');
2535 attribute->a.property = property;
2541 static attribute_t *parse_microsoft_extended_decl_modifier_single(void)
2543 attribute_kind_t kind = ATTRIBUTE_UNKNOWN;
2544 if (next_if(T_restrict)) {
2545 kind = ATTRIBUTE_MS_RESTRICT;
2546 } else if (token.kind == T_IDENTIFIER) {
2547 char const *const name = token.base.symbol->string;
2548 for (attribute_kind_t k = ATTRIBUTE_MS_FIRST; k <= ATTRIBUTE_MS_LAST;
2550 const char *attribute_name = get_attribute_name(k);
2551 if (attribute_name != NULL && streq(attribute_name, name)) {
2557 if (kind == ATTRIBUTE_UNKNOWN) {
2558 warningf(WARN_ATTRIBUTE, HERE, "unknown __declspec '%s' ignored", name);
2561 parse_error_expected("while parsing __declspec", T_IDENTIFIER, NULL);
2565 attribute_t *attribute = allocate_attribute_zero(kind);
2568 if (kind == ATTRIBUTE_MS_PROPERTY) {
2569 return parse_attribute_ms_property(attribute);
2572 /* parse arguments */
2574 attribute->a.arguments = parse_attribute_arguments();
2579 static attribute_t *parse_microsoft_extended_decl_modifier(attribute_t *first)
2583 add_anchor_token(')');
2585 if (token.kind != ')') {
2586 attribute_t **anchor = &first;
2588 while (*anchor != NULL)
2589 anchor = &(*anchor)->next;
2591 attribute_t *attribute
2592 = parse_microsoft_extended_decl_modifier_single();
2593 if (attribute == NULL)
2596 *anchor = attribute;
2597 anchor = &attribute->next;
2598 } while (next_if(','));
2600 rem_anchor_token(')');
2605 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
2607 entity_t *const entity = allocate_entity_zero(kind, NAMESPACE_NORMAL, symbol, HERE);
2608 if (is_declaration(entity)) {
2609 entity->declaration.type = type_error_type;
2610 entity->declaration.implicit = true;
2611 } else if (kind == ENTITY_TYPEDEF) {
2612 entity->typedefe.type = type_error_type;
2613 entity->typedefe.builtin = true;
2615 if (kind != ENTITY_COMPOUND_MEMBER)
2616 record_entity(entity, false);
2620 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2622 type_t *type = NULL;
2623 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
2624 unsigned type_specifiers = 0;
2625 bool newtype = false;
2626 bool saw_error = false;
2628 memset(specifiers, 0, sizeof(*specifiers));
2629 specifiers->source_position = *HERE;
2632 specifiers->attributes = parse_attributes(specifiers->attributes);
2634 switch (token.kind) {
2636 #define MATCH_STORAGE_CLASS(token, class) \
2638 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
2639 errorf(HERE, "multiple storage classes in declaration specifiers"); \
2641 specifiers->storage_class = class; \
2642 if (specifiers->thread_local) \
2643 goto check_thread_storage_class; \
2647 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
2648 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
2649 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
2650 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
2651 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
2654 specifiers->attributes
2655 = parse_microsoft_extended_decl_modifier(specifiers->attributes);
2659 if (specifiers->thread_local) {
2660 errorf(HERE, "duplicate '__thread'");
2662 specifiers->thread_local = true;
2663 check_thread_storage_class:
2664 switch (specifiers->storage_class) {
2665 case STORAGE_CLASS_EXTERN:
2666 case STORAGE_CLASS_NONE:
2667 case STORAGE_CLASS_STATIC:
2671 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_storage_class;
2672 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_storage_class;
2673 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_storage_class;
2674 wrong_thread_storage_class:
2675 errorf(HERE, "'__thread' used with '%s'", wrong);
2682 /* type qualifiers */
2683 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
2685 qualifiers |= qualifier; \
2689 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
2690 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
2691 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
2692 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
2693 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
2694 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
2695 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
2696 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
2698 /* type specifiers */
2699 #define MATCH_SPECIFIER(token, specifier, name) \
2701 if (type_specifiers & specifier) { \
2702 errorf(HERE, "multiple " name " type specifiers given"); \
2704 type_specifiers |= specifier; \
2709 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
2710 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
2711 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
2712 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
2713 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
2714 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
2715 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
2716 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
2717 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
2718 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
2719 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
2720 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
2721 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
2722 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
2723 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
2724 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
2725 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
2726 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
2730 specifiers->is_inline = true;
2734 case T__forceinline:
2735 eat(T__forceinline);
2736 specifiers->modifiers |= DM_FORCEINLINE;
2741 if (type_specifiers & SPECIFIER_LONG_LONG) {
2742 errorf(HERE, "too many long type specifiers given");
2743 } else if (type_specifiers & SPECIFIER_LONG) {
2744 type_specifiers |= SPECIFIER_LONG_LONG;
2746 type_specifiers |= SPECIFIER_LONG;
2751 #define CHECK_DOUBLE_TYPE() \
2752 (type != NULL ? errorf(HERE, "multiple types in declaration specifiers") : (void)0)
2755 CHECK_DOUBLE_TYPE();
2756 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
2758 type->compound.compound = parse_compound_type_specifier(true);
2761 CHECK_DOUBLE_TYPE();
2762 type = allocate_type_zero(TYPE_COMPOUND_UNION);
2763 type->compound.compound = parse_compound_type_specifier(false);
2766 CHECK_DOUBLE_TYPE();
2767 type = parse_enum_specifier();
2770 CHECK_DOUBLE_TYPE();
2771 type = parse_typeof();
2773 case T___builtin_va_list:
2774 CHECK_DOUBLE_TYPE();
2775 type = duplicate_type(type_valist);
2776 eat(T___builtin_va_list);
2779 case T_IDENTIFIER: {
2780 /* only parse identifier if we haven't found a type yet */
2781 if (type != NULL || type_specifiers != 0) {
2782 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
2783 * declaration, so it doesn't generate errors about expecting '(' or
2785 switch (look_ahead(1)->kind) {
2792 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
2796 errorf(HERE, "discarding stray %K in declaration specifier", &token);
2801 goto finish_specifiers;
2805 type_t *const typedef_type = get_typedef_type(token.base.symbol);
2806 if (typedef_type == NULL) {
2807 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
2808 * declaration, so it doesn't generate 'implicit int' followed by more
2809 * errors later on. */
2810 token_kind_t const la1_type = (token_kind_t)look_ahead(1)->kind;
2816 errorf(HERE, "%K does not name a type", &token);
2818 entity_t *const entity = create_error_entity(token.base.symbol, ENTITY_TYPEDEF);
2820 type = allocate_type_zero(TYPE_TYPEDEF);
2821 type->typedeft.typedefe = &entity->typedefe;
2829 goto finish_specifiers;
2834 type = typedef_type;
2838 /* function specifier */
2840 goto finish_specifiers;
2845 specifiers->attributes = parse_attributes(specifiers->attributes);
2847 if (type == NULL || (saw_error && type_specifiers != 0)) {
2848 atomic_type_kind_t atomic_type;
2850 /* match valid basic types */
2851 switch (type_specifiers) {
2852 case SPECIFIER_VOID:
2853 atomic_type = ATOMIC_TYPE_VOID;
2855 case SPECIFIER_WCHAR_T:
2856 atomic_type = ATOMIC_TYPE_WCHAR_T;
2858 case SPECIFIER_CHAR:
2859 atomic_type = ATOMIC_TYPE_CHAR;
2861 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
2862 atomic_type = ATOMIC_TYPE_SCHAR;
2864 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
2865 atomic_type = ATOMIC_TYPE_UCHAR;
2867 case SPECIFIER_SHORT:
2868 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
2869 case SPECIFIER_SHORT | SPECIFIER_INT:
2870 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
2871 atomic_type = ATOMIC_TYPE_SHORT;
2873 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
2874 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
2875 atomic_type = ATOMIC_TYPE_USHORT;
2878 case SPECIFIER_SIGNED:
2879 case SPECIFIER_SIGNED | SPECIFIER_INT:
2880 atomic_type = ATOMIC_TYPE_INT;
2882 case SPECIFIER_UNSIGNED:
2883 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
2884 atomic_type = ATOMIC_TYPE_UINT;
2886 case SPECIFIER_LONG:
2887 case SPECIFIER_SIGNED | SPECIFIER_LONG:
2888 case SPECIFIER_LONG | SPECIFIER_INT:
2889 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
2890 atomic_type = ATOMIC_TYPE_LONG;
2892 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
2893 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
2894 atomic_type = ATOMIC_TYPE_ULONG;
2897 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2898 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2899 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
2900 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
2902 atomic_type = ATOMIC_TYPE_LONGLONG;
2903 goto warn_about_long_long;
2905 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2906 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
2908 atomic_type = ATOMIC_TYPE_ULONGLONG;
2909 warn_about_long_long:
2910 warningf(WARN_LONG_LONG, &specifiers->source_position, "ISO C90 does not support 'long long'");
2913 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
2914 atomic_type = unsigned_int8_type_kind;
2917 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
2918 atomic_type = unsigned_int16_type_kind;
2921 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
2922 atomic_type = unsigned_int32_type_kind;
2925 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
2926 atomic_type = unsigned_int64_type_kind;
2929 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
2930 atomic_type = unsigned_int128_type_kind;
2933 case SPECIFIER_INT8:
2934 case SPECIFIER_SIGNED | SPECIFIER_INT8:
2935 atomic_type = int8_type_kind;
2938 case SPECIFIER_INT16:
2939 case SPECIFIER_SIGNED | SPECIFIER_INT16:
2940 atomic_type = int16_type_kind;
2943 case SPECIFIER_INT32:
2944 case SPECIFIER_SIGNED | SPECIFIER_INT32:
2945 atomic_type = int32_type_kind;
2948 case SPECIFIER_INT64:
2949 case SPECIFIER_SIGNED | SPECIFIER_INT64:
2950 atomic_type = int64_type_kind;
2953 case SPECIFIER_INT128:
2954 case SPECIFIER_SIGNED | SPECIFIER_INT128:
2955 atomic_type = int128_type_kind;
2958 case SPECIFIER_FLOAT:
2959 atomic_type = ATOMIC_TYPE_FLOAT;
2961 case SPECIFIER_DOUBLE:
2962 atomic_type = ATOMIC_TYPE_DOUBLE;
2964 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
2965 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
2967 case SPECIFIER_BOOL:
2968 atomic_type = ATOMIC_TYPE_BOOL;
2970 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
2971 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
2972 atomic_type = ATOMIC_TYPE_FLOAT;
2974 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
2975 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
2976 atomic_type = ATOMIC_TYPE_DOUBLE;
2978 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
2979 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
2980 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
2983 /* invalid specifier combination, give an error message */
2984 source_position_t const* const pos = &specifiers->source_position;
2985 if (type_specifiers == 0) {
2987 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
2988 if (!(c_mode & _CXX) && !strict_mode) {
2989 warningf(WARN_IMPLICIT_INT, pos, "no type specifiers in declaration, using 'int'");
2990 atomic_type = ATOMIC_TYPE_INT;
2993 errorf(pos, "no type specifiers given in declaration");
2996 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
2997 (type_specifiers & SPECIFIER_UNSIGNED)) {
2998 errorf(pos, "signed and unsigned specifiers given");
2999 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3000 errorf(pos, "only integer types can be signed or unsigned");
3002 errorf(pos, "multiple datatypes in declaration");
3004 specifiers->type = type_error_type;
3009 if (type_specifiers & SPECIFIER_COMPLEX) {
3010 type = allocate_type_zero(TYPE_COMPLEX);
3011 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3012 type = allocate_type_zero(TYPE_IMAGINARY);
3014 type = allocate_type_zero(TYPE_ATOMIC);
3016 type->atomic.akind = atomic_type;
3018 } else if (type_specifiers != 0) {
3019 errorf(&specifiers->source_position, "multiple datatypes in declaration");
3022 /* FIXME: check type qualifiers here */
3023 type->base.qualifiers = qualifiers;
3026 type = identify_new_type(type);
3028 type = typehash_insert(type);
3031 if (specifiers->attributes != NULL)
3032 type = handle_type_attributes(specifiers->attributes, type);
3033 specifiers->type = type;
3036 static type_qualifiers_t parse_type_qualifiers(void)
3038 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3041 switch (token.kind) {
3042 /* type qualifiers */
3043 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3044 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3045 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3046 /* microsoft extended type modifiers */
3047 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3048 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3049 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3050 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3051 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3060 * Parses an K&R identifier list
3062 static void parse_identifier_list(scope_t *scope)
3064 assert(token.kind == T_IDENTIFIER);
3066 entity_t *const entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, token.base.symbol, HERE);
3067 /* a K&R parameter has no type, yet */
3071 append_entity(scope, entity);
3072 } while (next_if(',') && token.kind == T_IDENTIFIER);
3075 static entity_t *parse_parameter(void)
3077 declaration_specifiers_t specifiers;
3078 parse_declaration_specifiers(&specifiers);
3080 entity_t *entity = parse_declarator(&specifiers,
3081 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
3082 anonymous_entity = NULL;
3086 static void semantic_parameter_incomplete(const entity_t *entity)
3088 assert(entity->kind == ENTITY_PARAMETER);
3090 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
3091 * list in a function declarator that is part of a
3092 * definition of that function shall not have
3093 * incomplete type. */
3094 type_t *type = skip_typeref(entity->declaration.type);
3095 if (is_type_incomplete(type)) {
3096 errorf(&entity->base.source_position, "'%N' has incomplete type", entity);
3100 static bool has_parameters(void)
3102 /* func(void) is not a parameter */
3103 if (look_ahead(1)->kind != ')')
3105 if (token.kind == T_IDENTIFIER) {
3106 entity_t const *const entity = get_entity(token.base.symbol, NAMESPACE_NORMAL);
3109 if (entity->kind != ENTITY_TYPEDEF)
3111 type_t const *const type = skip_typeref(entity->typedefe.type);
3112 if (!is_type_void(type))
3114 if (c_mode & _CXX) {
3115 /* ISO/IEC 14882:1998(E) §8.3.5:2 It must be literally (void). A typedef
3116 * is not allowed. */
3117 errorf(HERE, "empty parameter list defined with a typedef of 'void' not allowed in C++");
3118 } else if (type->base.qualifiers != TYPE_QUALIFIER_NONE) {
3119 /* §6.7.5.3:10 Qualification is not allowed here. */
3120 errorf(HERE, "'void' as parameter must not have type qualifiers");
3122 } else if (token.kind != T_void) {
3130 * Parses function type parameters (and optionally creates variable_t entities
3131 * for them in a scope)
3133 static void parse_parameters(function_type_t *type, scope_t *scope)
3135 add_anchor_token(')');
3138 if (token.kind == T_IDENTIFIER &&
3139 !is_typedef_symbol(token.base.symbol) &&
3140 (look_ahead(1)->kind == ',' || look_ahead(1)->kind == ')')) {
3141 type->kr_style_parameters = true;
3142 parse_identifier_list(scope);
3143 } else if (token.kind == ')') {
3144 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
3145 if (!(c_mode & _CXX))
3146 type->unspecified_parameters = true;
3147 } else if (has_parameters()) {
3148 function_parameter_t **anchor = &type->parameters;
3149 add_anchor_token(',');
3151 switch (token.kind) {
3154 type->variadic = true;
3155 goto parameters_finished;
3160 entity_t *entity = parse_parameter();
3161 if (entity->kind == ENTITY_TYPEDEF) {
3162 errorf(&entity->base.source_position,
3163 "typedef not allowed as function parameter");
3166 assert(is_declaration(entity));
3168 semantic_parameter_incomplete(entity);
3170 function_parameter_t *const parameter =
3171 allocate_parameter(entity->declaration.type);
3173 if (scope != NULL) {
3174 append_entity(scope, entity);
3177 *anchor = parameter;
3178 anchor = ¶meter->next;
3183 goto parameters_finished;
3185 } while (next_if(','));
3186 parameters_finished:
3187 rem_anchor_token(',');
3190 rem_anchor_token(')');
3194 typedef enum construct_type_kind_t {
3195 CONSTRUCT_POINTER = 1,
3196 CONSTRUCT_REFERENCE,
3199 } construct_type_kind_t;
3201 typedef union construct_type_t construct_type_t;
3203 typedef struct construct_type_base_t {
3204 construct_type_kind_t kind;
3205 source_position_t pos;
3206 construct_type_t *next;
3207 } construct_type_base_t;
3209 typedef struct parsed_pointer_t {
3210 construct_type_base_t base;
3211 type_qualifiers_t type_qualifiers;
3212 variable_t *base_variable; /**< MS __based extension. */
3215 typedef struct parsed_reference_t {
3216 construct_type_base_t base;
3217 } parsed_reference_t;
3219 typedef struct construct_function_type_t {
3220 construct_type_base_t base;
3221 type_t *function_type;
3222 } construct_function_type_t;
3224 typedef struct parsed_array_t {
3225 construct_type_base_t base;
3226 type_qualifiers_t type_qualifiers;
3232 union construct_type_t {
3233 construct_type_kind_t kind;
3234 construct_type_base_t base;
3235 parsed_pointer_t pointer;
3236 parsed_reference_t reference;
3237 construct_function_type_t function;
3238 parsed_array_t array;
3241 static construct_type_t *allocate_declarator_zero(construct_type_kind_t const kind, size_t const size)
3243 construct_type_t *const cons = obstack_alloc(&temp_obst, size);
3244 memset(cons, 0, size);
3246 cons->base.pos = *HERE;
3251 static construct_type_t *parse_pointer_declarator(void)
3253 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_POINTER, sizeof(parsed_pointer_t));
3255 cons->pointer.type_qualifiers = parse_type_qualifiers();
3256 //cons->pointer.base_variable = base_variable;
3261 /* ISO/IEC 14882:1998(E) §8.3.2 */
3262 static construct_type_t *parse_reference_declarator(void)
3264 if (!(c_mode & _CXX))
3265 errorf(HERE, "references are only available for C++");
3267 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_REFERENCE, sizeof(parsed_reference_t));
3274 static construct_type_t *parse_array_declarator(void)
3276 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_ARRAY, sizeof(parsed_array_t));
3277 parsed_array_t *const array = &cons->array;
3280 add_anchor_token(']');
3282 bool is_static = next_if(T_static);
3284 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3287 is_static = next_if(T_static);
3289 array->type_qualifiers = type_qualifiers;
3290 array->is_static = is_static;
3292 expression_t *size = NULL;
3293 if (token.kind == '*' && look_ahead(1)->kind == ']') {
3294 array->is_variable = true;
3296 } else if (token.kind != ']') {
3297 size = parse_assignment_expression();
3299 /* §6.7.5.2:1 Array size must have integer type */
3300 type_t *const orig_type = size->base.type;
3301 type_t *const type = skip_typeref(orig_type);
3302 if (!is_type_integer(type) && is_type_valid(type)) {
3303 errorf(&size->base.source_position,
3304 "array size '%E' must have integer type but has type '%T'",
3309 mark_vars_read(size, NULL);
3312 if (is_static && size == NULL)
3313 errorf(&array->base.pos, "static array parameters require a size");
3315 rem_anchor_token(']');
3321 static construct_type_t *parse_function_declarator(scope_t *scope)
3323 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_FUNCTION, sizeof(construct_function_type_t));
3325 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3326 function_type_t *ftype = &type->function;
3328 ftype->linkage = current_linkage;
3329 ftype->calling_convention = CC_DEFAULT;
3331 parse_parameters(ftype, scope);
3333 cons->function.function_type = type;
3338 typedef struct parse_declarator_env_t {
3339 bool may_be_abstract : 1;
3340 bool must_be_abstract : 1;
3341 decl_modifiers_t modifiers;
3343 source_position_t source_position;
3345 attribute_t *attributes;
3346 } parse_declarator_env_t;
3349 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env)
3351 /* construct a single linked list of construct_type_t's which describe
3352 * how to construct the final declarator type */
3353 construct_type_t *first = NULL;
3354 construct_type_t **anchor = &first;
3356 env->attributes = parse_attributes(env->attributes);
3359 construct_type_t *type;
3360 //variable_t *based = NULL; /* MS __based extension */
3361 switch (token.kind) {
3363 type = parse_reference_declarator();
3367 panic("based not supported anymore");
3372 type = parse_pointer_declarator();
3376 goto ptr_operator_end;
3380 anchor = &type->base.next;
3382 /* TODO: find out if this is correct */
3383 env->attributes = parse_attributes(env->attributes);
3387 construct_type_t *inner_types = NULL;
3389 switch (token.kind) {
3391 if (env->must_be_abstract) {
3392 errorf(HERE, "no identifier expected in typename");
3394 env->symbol = token.base.symbol;
3395 env->source_position = *HERE;
3401 /* Parenthesized declarator or function declarator? */
3402 token_t const *const la1 = look_ahead(1);
3403 switch (la1->kind) {
3405 if (is_typedef_symbol(la1->base.symbol)) {
3407 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
3408 * interpreted as ``function with no parameter specification'', rather
3409 * than redundant parentheses around the omitted identifier. */
3411 /* Function declarator. */
3412 if (!env->may_be_abstract) {
3413 errorf(HERE, "function declarator must have a name");
3420 case T___attribute__: /* FIXME __attribute__ might also introduce a parameter of a function declarator. */
3421 /* Paranthesized declarator. */
3423 add_anchor_token(')');
3424 inner_types = parse_inner_declarator(env);
3425 if (inner_types != NULL) {
3426 /* All later declarators only modify the return type */
3427 env->must_be_abstract = true;
3429 rem_anchor_token(')');
3438 if (env->may_be_abstract)
3440 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3445 construct_type_t **const p = anchor;
3448 construct_type_t *type;
3449 switch (token.kind) {
3451 scope_t *scope = NULL;
3452 if (!env->must_be_abstract) {
3453 scope = &env->parameters;
3456 type = parse_function_declarator(scope);
3460 type = parse_array_declarator();
3463 goto declarator_finished;
3466 /* insert in the middle of the list (at p) */
3467 type->base.next = *p;
3470 anchor = &type->base.next;
3473 declarator_finished:
3474 /* append inner_types at the end of the list, we don't to set anchor anymore
3475 * as it's not needed anymore */
3476 *anchor = inner_types;
3481 static type_t *construct_declarator_type(construct_type_t *construct_list,
3484 construct_type_t *iter = construct_list;
3485 for (; iter != NULL; iter = iter->base.next) {
3486 source_position_t const* const pos = &iter->base.pos;
3487 switch (iter->kind) {
3488 case CONSTRUCT_FUNCTION: {
3489 construct_function_type_t *function = &iter->function;
3490 type_t *function_type = function->function_type;
3492 function_type->function.return_type = type;
3494 type_t *skipped_return_type = skip_typeref(type);
3496 if (is_type_function(skipped_return_type)) {
3497 errorf(pos, "function returning function is not allowed");
3498 } else if (is_type_array(skipped_return_type)) {
3499 errorf(pos, "function returning array is not allowed");
3501 if (skipped_return_type->base.qualifiers != 0) {
3502 warningf(WARN_IGNORED_QUALIFIERS, pos, "type qualifiers in return type of function type are meaningless");
3506 /* The function type was constructed earlier. Freeing it here will
3507 * destroy other types. */
3508 type = typehash_insert(function_type);
3512 case CONSTRUCT_POINTER: {
3513 if (is_type_reference(skip_typeref(type)))
3514 errorf(pos, "cannot declare a pointer to reference");
3516 parsed_pointer_t *pointer = &iter->pointer;
3517 type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
3521 case CONSTRUCT_REFERENCE:
3522 if (is_type_reference(skip_typeref(type)))
3523 errorf(pos, "cannot declare a reference to reference");
3525 type = make_reference_type(type);
3528 case CONSTRUCT_ARRAY: {
3529 if (is_type_reference(skip_typeref(type)))
3530 errorf(pos, "cannot declare an array of references");
3532 parsed_array_t *array = &iter->array;
3533 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
3535 expression_t *size_expression = array->size;
3536 if (size_expression != NULL) {
3538 = create_implicit_cast(size_expression, type_size_t);
3541 array_type->base.qualifiers = array->type_qualifiers;
3542 array_type->array.element_type = type;
3543 array_type->array.is_static = array->is_static;
3544 array_type->array.is_variable = array->is_variable;
3545 array_type->array.size_expression = size_expression;
3547 if (size_expression != NULL) {
3548 switch (is_constant_expression(size_expression)) {
3549 case EXPR_CLASS_CONSTANT: {
3550 long const size = fold_constant_to_int(size_expression);
3551 array_type->array.size = size;
3552 array_type->array.size_constant = true;
3553 /* §6.7.5.2:1 If the expression is a constant expression,
3554 * it shall have a value greater than zero. */
3556 errorf(&size_expression->base.source_position,
3557 "size of array must be greater than zero");
3558 } else if (size == 0 && !GNU_MODE) {
3559 errorf(&size_expression->base.source_position,
3560 "size of array must be greater than zero (zero length arrays are a GCC extension)");
3565 case EXPR_CLASS_VARIABLE:
3566 array_type->array.is_vla = true;
3569 case EXPR_CLASS_ERROR:
3574 type_t *skipped_type = skip_typeref(type);
3576 if (is_type_incomplete(skipped_type)) {
3577 errorf(pos, "array of incomplete type '%T' is not allowed", type);
3578 } else if (is_type_function(skipped_type)) {
3579 errorf(pos, "array of functions is not allowed");
3581 type = identify_new_type(array_type);
3585 internal_errorf(pos, "invalid type construction found");
3591 static type_t *automatic_type_conversion(type_t *orig_type);
3593 static type_t *semantic_parameter(const source_position_t *pos,
3595 const declaration_specifiers_t *specifiers,
3596 entity_t const *const param)
3598 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
3599 * shall be adjusted to ``qualified pointer to type'',
3601 * §6.7.5.3:8 A declaration of a parameter as ``function returning
3602 * type'' shall be adjusted to ``pointer to function
3603 * returning type'', as in 6.3.2.1. */
3604 type = automatic_type_conversion(type);
3606 if (specifiers->is_inline && is_type_valid(type)) {
3607 errorf(pos, "'%N' declared 'inline'", param);
3610 /* §6.9.1:6 The declarations in the declaration list shall contain
3611 * no storage-class specifier other than register and no
3612 * initializations. */
3613 if (specifiers->thread_local || (
3614 specifiers->storage_class != STORAGE_CLASS_NONE &&
3615 specifiers->storage_class != STORAGE_CLASS_REGISTER)
3617 errorf(pos, "invalid storage class for '%N'", param);
3620 /* delay test for incomplete type, because we might have (void)
3621 * which is legal but incomplete... */
3626 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
3627 declarator_flags_t flags)
3629 parse_declarator_env_t env;
3630 memset(&env, 0, sizeof(env));
3631 env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
3633 construct_type_t *construct_type = parse_inner_declarator(&env);
3635 construct_declarator_type(construct_type, specifiers->type);
3636 type_t *type = skip_typeref(orig_type);
3638 if (construct_type != NULL) {
3639 obstack_free(&temp_obst, construct_type);
3642 attribute_t *attributes = parse_attributes(env.attributes);
3643 /* append (shared) specifier attribute behind attributes of this
3645 attribute_t **anchor = &attributes;
3646 while (*anchor != NULL)
3647 anchor = &(*anchor)->next;
3648 *anchor = specifiers->attributes;
3651 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
3652 entity = allocate_entity_zero(ENTITY_TYPEDEF, NAMESPACE_NORMAL, env.symbol, &env.source_position);
3653 entity->typedefe.type = orig_type;
3655 if (anonymous_entity != NULL) {
3656 if (is_type_compound(type)) {
3657 assert(anonymous_entity->compound.alias == NULL);
3658 assert(anonymous_entity->kind == ENTITY_STRUCT ||
3659 anonymous_entity->kind == ENTITY_UNION);
3660 anonymous_entity->compound.alias = entity;
3661 anonymous_entity = NULL;
3662 } else if (is_type_enum(type)) {
3663 assert(anonymous_entity->enume.alias == NULL);
3664 assert(anonymous_entity->kind == ENTITY_ENUM);
3665 anonymous_entity->enume.alias = entity;
3666 anonymous_entity = NULL;
3670 /* create a declaration type entity */
3671 source_position_t const *const pos = env.symbol ? &env.source_position : &specifiers->source_position;
3672 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
3673 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, env.symbol, pos);
3675 if (env.symbol != NULL) {
3676 if (specifiers->is_inline && is_type_valid(type)) {
3677 errorf(&env.source_position, "'%N' declared 'inline'", entity);
3680 if (specifiers->thread_local ||
3681 specifiers->storage_class != STORAGE_CLASS_NONE) {
3682 errorf(&env.source_position, "'%N' must have no storage class", entity);
3685 } else if (flags & DECL_IS_PARAMETER) {
3686 entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, env.symbol, pos);
3687 orig_type = semantic_parameter(&env.source_position, orig_type, specifiers, entity);
3688 } else if (is_type_function(type)) {
3689 entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, env.symbol, pos);
3690 entity->function.is_inline = specifiers->is_inline;
3691 entity->function.elf_visibility = default_visibility;
3692 entity->function.parameters = env.parameters;
3694 if (env.symbol != NULL) {
3695 /* this needs fixes for C++ */
3696 bool in_function_scope = current_function != NULL;
3698 if (specifiers->thread_local || (
3699 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3700 specifiers->storage_class != STORAGE_CLASS_NONE &&
3701 (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
3703 errorf(&env.source_position, "invalid storage class for '%N'", entity);
3707 entity = allocate_entity_zero(ENTITY_VARIABLE, NAMESPACE_NORMAL, env.symbol, pos);
3708 entity->variable.elf_visibility = default_visibility;
3709 entity->variable.thread_local = specifiers->thread_local;
3711 if (env.symbol != NULL) {
3712 if (specifiers->is_inline && is_type_valid(type)) {
3713 errorf(&env.source_position, "'%N' declared 'inline'", entity);
3716 bool invalid_storage_class = false;
3717 if (current_scope == file_scope) {
3718 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3719 specifiers->storage_class != STORAGE_CLASS_NONE &&
3720 specifiers->storage_class != STORAGE_CLASS_STATIC) {
3721 invalid_storage_class = true;
3724 if (specifiers->thread_local &&
3725 specifiers->storage_class == STORAGE_CLASS_NONE) {
3726 invalid_storage_class = true;
3729 if (invalid_storage_class) {
3730 errorf(&env.source_position, "invalid storage class for '%N'", entity);
3735 entity->declaration.type = orig_type;
3736 entity->declaration.alignment = get_type_alignment(orig_type);
3737 entity->declaration.modifiers = env.modifiers;
3738 entity->declaration.attributes = attributes;
3740 storage_class_t storage_class = specifiers->storage_class;
3741 entity->declaration.declared_storage_class = storage_class;
3743 if (storage_class == STORAGE_CLASS_NONE && current_function != NULL)
3744 storage_class = STORAGE_CLASS_AUTO;
3745 entity->declaration.storage_class = storage_class;
3748 if (attributes != NULL) {
3749 handle_entity_attributes(attributes, entity);
3752 if (entity->kind == ENTITY_FUNCTION && !freestanding) {
3753 adapt_special_functions(&entity->function);
3759 static type_t *parse_abstract_declarator(type_t *base_type)
3761 parse_declarator_env_t env;
3762 memset(&env, 0, sizeof(env));
3763 env.may_be_abstract = true;
3764 env.must_be_abstract = true;
3766 construct_type_t *construct_type = parse_inner_declarator(&env);
3768 type_t *result = construct_declarator_type(construct_type, base_type);
3769 if (construct_type != NULL) {
3770 obstack_free(&temp_obst, construct_type);
3772 result = handle_type_attributes(env.attributes, result);
3778 * Check if the declaration of main is suspicious. main should be a
3779 * function with external linkage, returning int, taking either zero
3780 * arguments, two, or three arguments of appropriate types, ie.
3782 * int main([ int argc, char **argv [, char **env ] ]).
3784 * @param decl the declaration to check
3785 * @param type the function type of the declaration
3787 static void check_main(const entity_t *entity)
3789 const source_position_t *pos = &entity->base.source_position;
3790 if (entity->kind != ENTITY_FUNCTION) {
3791 warningf(WARN_MAIN, pos, "'main' is not a function");
3795 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
3796 warningf(WARN_MAIN, pos, "'main' is normally a non-static function");
3799 type_t *type = skip_typeref(entity->declaration.type);
3800 assert(is_type_function(type));
3802 function_type_t const *const func_type = &type->function;
3803 type_t *const ret_type = func_type->return_type;
3804 if (!types_compatible(skip_typeref(ret_type), type_int)) {
3805 warningf(WARN_MAIN, pos, "return type of 'main' should be 'int', but is '%T'", ret_type);
3807 const function_parameter_t *parm = func_type->parameters;
3809 type_t *const first_type = skip_typeref(parm->type);
3810 type_t *const first_type_unqual = get_unqualified_type(first_type);
3811 if (!types_compatible(first_type_unqual, type_int)) {
3812 warningf(WARN_MAIN, pos, "first argument of 'main' should be 'int', but is '%T'", parm->type);
3816 type_t *const second_type = skip_typeref(parm->type);
3817 type_t *const second_type_unqual
3818 = get_unqualified_type(second_type);
3819 if (!types_compatible(second_type_unqual, type_char_ptr_ptr)) {
3820 warningf(WARN_MAIN, pos, "second argument of 'main' should be 'char**', but is '%T'", parm->type);
3824 type_t *const third_type = skip_typeref(parm->type);
3825 type_t *const third_type_unqual
3826 = get_unqualified_type(third_type);
3827 if (!types_compatible(third_type_unqual, type_char_ptr_ptr)) {
3828 warningf(WARN_MAIN, pos, "third argument of 'main' should be 'char**', but is '%T'", parm->type);
3832 goto warn_arg_count;
3836 warningf(WARN_MAIN, pos, "'main' takes only zero, two or three arguments");
3841 static void error_redefined_as_different_kind(const source_position_t *pos,
3842 const entity_t *old, entity_kind_t new_kind)
3844 char const *const what = get_entity_kind_name(new_kind);
3845 source_position_t const *const ppos = &old->base.source_position;
3846 errorf(pos, "redeclaration of '%N' as %s (declared %P)", old, what, ppos);
3849 static bool is_entity_valid(entity_t *const ent)
3851 if (is_declaration(ent)) {
3852 return is_type_valid(skip_typeref(ent->declaration.type));
3853 } else if (ent->kind == ENTITY_TYPEDEF) {
3854 return is_type_valid(skip_typeref(ent->typedefe.type));
3859 static bool contains_attribute(const attribute_t *list, const attribute_t *attr)
3861 for (const attribute_t *tattr = list; tattr != NULL; tattr = tattr->next) {
3862 if (attributes_equal(tattr, attr))
3869 * test wether new_list contains any attributes not included in old_list
3871 static bool has_new_attributes(const attribute_t *old_list,
3872 const attribute_t *new_list)
3874 for (const attribute_t *attr = new_list; attr != NULL; attr = attr->next) {
3875 if (!contains_attribute(old_list, attr))
3882 * Merge in attributes from an attribute list (probably from a previous
3883 * declaration with the same name). Warning: destroys the old structure
3884 * of the attribute list - don't reuse attributes after this call.
3886 static void merge_in_attributes(declaration_t *decl, attribute_t *attributes)
3889 for (attribute_t *attr = attributes; attr != NULL; attr = next) {
3891 if (contains_attribute(decl->attributes, attr))
3894 /* move attribute to new declarations attributes list */
3895 attr->next = decl->attributes;
3896 decl->attributes = attr;
3900 static bool is_main(entity_t*);
3903 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
3904 * for various problems that occur for multiple definitions
3906 entity_t *record_entity(entity_t *entity, const bool is_definition)
3908 const symbol_t *const symbol = entity->base.symbol;
3909 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
3910 const source_position_t *pos = &entity->base.source_position;
3912 /* can happen in error cases */
3916 assert(!entity->base.parent_scope);
3917 assert(current_scope);
3918 entity->base.parent_scope = current_scope;
3920 entity_t *const previous_entity = get_entity(symbol, namespc);
3921 /* pushing the same entity twice will break the stack structure */
3922 assert(previous_entity != entity);
3924 if (entity->kind == ENTITY_FUNCTION) {
3925 type_t *const orig_type = entity->declaration.type;
3926 type_t *const type = skip_typeref(orig_type);
3928 assert(is_type_function(type));
3929 if (type->function.unspecified_parameters &&
3930 previous_entity == NULL &&
3931 !entity->declaration.implicit) {
3932 warningf(WARN_STRICT_PROTOTYPES, pos, "function declaration '%#N' is not a prototype", entity);
3935 if (is_main(entity)) {
3940 if (is_declaration(entity) &&
3941 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
3942 current_scope != file_scope &&
3943 !entity->declaration.implicit) {
3944 warningf(WARN_NESTED_EXTERNS, pos, "nested extern declaration of '%#N'", entity);
3947 if (previous_entity != NULL) {
3948 source_position_t const *const ppos = &previous_entity->base.source_position;
3950 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
3951 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
3952 assert(previous_entity->kind == ENTITY_PARAMETER);
3953 errorf(pos, "declaration of '%N' redeclares the '%N' (declared %P)", entity, previous_entity, ppos);
3957 if (previous_entity->base.parent_scope == current_scope) {
3958 if (previous_entity->kind != entity->kind) {
3959 if (is_entity_valid(previous_entity) && is_entity_valid(entity)) {
3960 error_redefined_as_different_kind(pos, previous_entity,
3965 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
3966 errorf(pos, "redeclaration of '%N' (declared %P)", entity, ppos);
3969 if (previous_entity->kind == ENTITY_TYPEDEF) {
3970 type_t *const type = skip_typeref(entity->typedefe.type);
3971 type_t *const prev_type
3972 = skip_typeref(previous_entity->typedefe.type);
3973 if (c_mode & _CXX) {
3974 /* C++ allows double typedef if they are identical
3975 * (after skipping typedefs) */
3976 if (type == prev_type)
3979 /* GCC extension: redef in system headers is allowed */
3980 if ((pos->is_system_header || ppos->is_system_header) &&
3981 types_compatible(type, prev_type))
3984 errorf(pos, "redefinition of '%N' (declared %P)",
3989 /* at this point we should have only VARIABLES or FUNCTIONS */
3990 assert(is_declaration(previous_entity) && is_declaration(entity));
3992 declaration_t *const prev_decl = &previous_entity->declaration;
3993 declaration_t *const decl = &entity->declaration;
3995 /* can happen for K&R style declarations */
3996 if (prev_decl->type == NULL &&
3997 previous_entity->kind == ENTITY_PARAMETER &&
3998 entity->kind == ENTITY_PARAMETER) {
3999 prev_decl->type = decl->type;
4000 prev_decl->storage_class = decl->storage_class;
4001 prev_decl->declared_storage_class = decl->declared_storage_class;
4002 prev_decl->modifiers = decl->modifiers;
4003 return previous_entity;
4006 type_t *const type = skip_typeref(decl->type);
4007 type_t *const prev_type = skip_typeref(prev_decl->type);
4009 if (!types_compatible(type, prev_type)) {
4010 errorf(pos, "declaration '%#N' is incompatible with '%#N' (declared %P)", entity, previous_entity, ppos);
4012 unsigned old_storage_class = prev_decl->storage_class;
4014 if (is_definition &&
4016 !(prev_decl->modifiers & DM_USED) &&
4017 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4018 warningf(WARN_REDUNDANT_DECLS, ppos, "unnecessary static forward declaration for '%#N'", previous_entity);
4021 storage_class_t new_storage_class = decl->storage_class;
4023 /* pretend no storage class means extern for function
4024 * declarations (except if the previous declaration is neither
4025 * none nor extern) */
4026 if (entity->kind == ENTITY_FUNCTION) {
4027 /* the previous declaration could have unspecified parameters or
4028 * be a typedef, so use the new type */
4029 if (prev_type->function.unspecified_parameters || is_definition)
4030 prev_decl->type = type;
4032 switch (old_storage_class) {
4033 case STORAGE_CLASS_NONE:
4034 old_storage_class = STORAGE_CLASS_EXTERN;
4037 case STORAGE_CLASS_EXTERN:
4038 if (is_definition) {
4039 if (prev_type->function.unspecified_parameters && !is_main(entity)) {
4040 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4042 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4043 new_storage_class = STORAGE_CLASS_EXTERN;
4050 } else if (is_type_incomplete(prev_type)) {
4051 prev_decl->type = type;
4054 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4055 new_storage_class == STORAGE_CLASS_EXTERN) {
4057 warn_redundant_declaration: ;
4059 = has_new_attributes(prev_decl->attributes,
4061 if (has_new_attrs) {
4062 merge_in_attributes(decl, prev_decl->attributes);
4063 } else if (!is_definition &&
4064 is_type_valid(prev_type) &&
4065 !pos->is_system_header) {
4066 warningf(WARN_REDUNDANT_DECLS, pos, "redundant declaration for '%N' (declared %P)", entity, ppos);
4068 } else if (current_function == NULL) {
4069 if (old_storage_class != STORAGE_CLASS_STATIC &&
4070 new_storage_class == STORAGE_CLASS_STATIC) {
4071 errorf(pos, "static declaration of '%N' follows non-static declaration (declared %P)", entity, ppos);
4072 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4073 prev_decl->storage_class = STORAGE_CLASS_NONE;
4074 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4076 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4078 goto error_redeclaration;
4079 goto warn_redundant_declaration;
4081 } else if (is_type_valid(prev_type)) {
4082 if (old_storage_class == new_storage_class) {
4083 error_redeclaration:
4084 errorf(pos, "redeclaration of '%N' (declared %P)", entity, ppos);
4086 errorf(pos, "redeclaration of '%N' with different linkage (declared %P)", entity, ppos);
4091 prev_decl->modifiers |= decl->modifiers;
4092 if (entity->kind == ENTITY_FUNCTION) {
4093 previous_entity->function.is_inline |= entity->function.is_inline;
4095 return previous_entity;
4099 if (is_warn_on(why = WARN_SHADOW) ||
4100 (is_warn_on(why = WARN_SHADOW_LOCAL) && previous_entity->base.parent_scope != file_scope)) {
4101 char const *const what = get_entity_kind_name(previous_entity->kind);
4102 warningf(why, pos, "'%N' shadows %s (declared %P)", entity, what, ppos);
4106 if (entity->kind == ENTITY_FUNCTION) {
4107 if (is_definition &&
4108 entity->declaration.storage_class != STORAGE_CLASS_STATIC &&
4110 if (is_warn_on(WARN_MISSING_PROTOTYPES)) {
4111 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4113 goto warn_missing_declaration;
4116 } else if (entity->kind == ENTITY_VARIABLE) {
4117 if (current_scope == file_scope &&
4118 entity->declaration.storage_class == STORAGE_CLASS_NONE &&
4119 !entity->declaration.implicit) {
4120 warn_missing_declaration:
4121 warningf(WARN_MISSING_DECLARATIONS, pos, "no previous declaration for '%#N'", entity);
4126 environment_push(entity);
4127 append_entity(current_scope, entity);
4132 static void parser_error_multiple_definition(entity_t *entity,
4133 const source_position_t *source_position)
4135 errorf(source_position, "redefinition of '%N' (declared %P)", entity, &entity->base.source_position);
4138 static bool is_declaration_specifier(const token_t *token)
4140 switch (token->kind) {
4144 return is_typedef_symbol(token->base.symbol);
4151 static void parse_init_declarator_rest(entity_t *entity)
4153 type_t *orig_type = type_error_type;
4155 if (entity->base.kind == ENTITY_TYPEDEF) {
4156 source_position_t const *const pos = &entity->base.source_position;
4157 errorf(pos, "'%N' is initialized (use __typeof__ instead)", entity);
4159 assert(is_declaration(entity));
4160 orig_type = entity->declaration.type;
4163 type_t *type = skip_typeref(orig_type);
4165 if (entity->kind == ENTITY_VARIABLE
4166 && entity->variable.initializer != NULL) {
4167 parser_error_multiple_definition(entity, HERE);
4171 declaration_t *const declaration = &entity->declaration;
4172 bool must_be_constant = false;
4173 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4174 entity->base.parent_scope == file_scope) {
4175 must_be_constant = true;
4178 if (is_type_function(type)) {
4179 source_position_t const *const pos = &entity->base.source_position;
4180 errorf(pos, "'%N' is initialized like a variable", entity);
4181 orig_type = type_error_type;
4184 parse_initializer_env_t env;
4185 env.type = orig_type;
4186 env.must_be_constant = must_be_constant;
4187 env.entity = entity;
4189 initializer_t *initializer = parse_initializer(&env);
4191 if (entity->kind == ENTITY_VARIABLE) {
4192 /* §6.7.5:22 array initializers for arrays with unknown size
4193 * determine the array type size */
4194 declaration->type = env.type;
4195 entity->variable.initializer = initializer;
4199 /* parse rest of a declaration without any declarator */
4200 static void parse_anonymous_declaration_rest(
4201 const declaration_specifiers_t *specifiers)
4204 anonymous_entity = NULL;
4206 source_position_t const *const pos = &specifiers->source_position;
4207 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4208 specifiers->thread_local) {
4209 warningf(WARN_OTHER, pos, "useless storage class in empty declaration");
4212 type_t *type = specifiers->type;
4213 switch (type->kind) {
4214 case TYPE_COMPOUND_STRUCT:
4215 case TYPE_COMPOUND_UNION: {
4216 if (type->compound.compound->base.symbol == NULL) {
4217 warningf(WARN_OTHER, pos, "unnamed struct/union that defines no instances");
4226 warningf(WARN_OTHER, pos, "empty declaration");
4231 static void check_variable_type_complete(entity_t *ent)
4233 if (ent->kind != ENTITY_VARIABLE)
4236 /* §6.7:7 If an identifier for an object is declared with no linkage, the
4237 * type for the object shall be complete [...] */
4238 declaration_t *decl = &ent->declaration;
4239 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4240 decl->storage_class == STORAGE_CLASS_STATIC)
4243 type_t *const type = skip_typeref(decl->type);
4244 if (!is_type_incomplete(type))
4247 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4248 * are given length one. */
4249 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4250 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4254 errorf(&ent->base.source_position, "variable '%#N' has incomplete type", ent);
4258 static void parse_declaration_rest(entity_t *ndeclaration,
4259 const declaration_specifiers_t *specifiers,
4260 parsed_declaration_func finished_declaration,
4261 declarator_flags_t flags)
4263 add_anchor_token(';');
4264 add_anchor_token(',');
4266 entity_t *entity = finished_declaration(ndeclaration, token.kind == '=');
4268 if (token.kind == '=') {
4269 parse_init_declarator_rest(entity);
4270 } else if (entity->kind == ENTITY_VARIABLE) {
4271 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
4272 * [...] where the extern specifier is explicitly used. */
4273 declaration_t *decl = &entity->declaration;
4274 if (decl->storage_class != STORAGE_CLASS_EXTERN &&
4275 is_type_reference(skip_typeref(decl->type))) {
4276 source_position_t const *const pos = &entity->base.source_position;
4277 errorf(pos, "reference '%#N' must be initialized", entity);
4281 check_variable_type_complete(entity);
4286 add_anchor_token('=');
4287 ndeclaration = parse_declarator(specifiers, flags);
4288 rem_anchor_token('=');
4290 rem_anchor_token(',');
4291 rem_anchor_token(';');
4294 anonymous_entity = NULL;
4297 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4299 symbol_t *symbol = entity->base.symbol;
4303 assert(entity->base.namespc == NAMESPACE_NORMAL);
4304 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4305 if (previous_entity == NULL
4306 || previous_entity->base.parent_scope != current_scope) {
4307 errorf(&entity->base.source_position, "expected declaration of a function parameter, found '%Y'",
4312 if (is_definition) {
4313 errorf(HERE, "'%N' is initialised", entity);
4316 return record_entity(entity, false);
4319 static void parse_declaration(parsed_declaration_func finished_declaration,
4320 declarator_flags_t flags)
4322 add_anchor_token(';');
4323 declaration_specifiers_t specifiers;
4324 parse_declaration_specifiers(&specifiers);
4325 rem_anchor_token(';');
4327 if (token.kind == ';') {
4328 parse_anonymous_declaration_rest(&specifiers);
4330 entity_t *entity = parse_declarator(&specifiers, flags);
4331 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4336 static type_t *get_default_promoted_type(type_t *orig_type)
4338 type_t *result = orig_type;
4340 type_t *type = skip_typeref(orig_type);
4341 if (is_type_integer(type)) {
4342 result = promote_integer(type);
4343 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4344 result = type_double;
4350 static void parse_kr_declaration_list(entity_t *entity)
4352 if (entity->kind != ENTITY_FUNCTION)
4355 type_t *type = skip_typeref(entity->declaration.type);
4356 assert(is_type_function(type));
4357 if (!type->function.kr_style_parameters)
4360 add_anchor_token('{');
4362 PUSH_SCOPE(&entity->function.parameters);
4364 entity_t *parameter = entity->function.parameters.entities;
4365 for ( ; parameter != NULL; parameter = parameter->base.next) {
4366 assert(parameter->base.parent_scope == NULL);
4367 parameter->base.parent_scope = current_scope;
4368 environment_push(parameter);
4371 /* parse declaration list */
4373 switch (token.kind) {
4375 /* This covers symbols, which are no type, too, and results in
4376 * better error messages. The typical cases are misspelled type
4377 * names and missing includes. */
4379 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4389 /* update function type */
4390 type_t *new_type = duplicate_type(type);
4392 function_parameter_t *parameters = NULL;
4393 function_parameter_t **anchor = ¶meters;
4395 /* did we have an earlier prototype? */
4396 entity_t *proto_type = get_entity(entity->base.symbol, NAMESPACE_NORMAL);
4397 if (proto_type != NULL && proto_type->kind != ENTITY_FUNCTION)
4400 function_parameter_t *proto_parameter = NULL;
4401 if (proto_type != NULL) {
4402 type_t *proto_type_type = proto_type->declaration.type;
4403 proto_parameter = proto_type_type->function.parameters;
4404 /* If a K&R function definition has a variadic prototype earlier, then
4405 * make the function definition variadic, too. This should conform to
4406 * §6.7.5.3:15 and §6.9.1:8. */
4407 new_type->function.variadic = proto_type_type->function.variadic;
4409 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
4411 new_type->function.unspecified_parameters = true;
4414 bool need_incompatible_warning = false;
4415 parameter = entity->function.parameters.entities;
4416 for (; parameter != NULL; parameter = parameter->base.next,
4418 proto_parameter == NULL ? NULL : proto_parameter->next) {
4419 if (parameter->kind != ENTITY_PARAMETER)
4422 type_t *parameter_type = parameter->declaration.type;
4423 if (parameter_type == NULL) {
4424 source_position_t const* const pos = ¶meter->base.source_position;
4426 errorf(pos, "no type specified for function '%N'", parameter);
4427 parameter_type = type_error_type;
4429 warningf(WARN_IMPLICIT_INT, pos, "no type specified for function parameter '%N', using 'int'", parameter);
4430 parameter_type = type_int;
4432 parameter->declaration.type = parameter_type;
4435 semantic_parameter_incomplete(parameter);
4437 /* we need the default promoted types for the function type */
4438 type_t *not_promoted = parameter_type;
4439 parameter_type = get_default_promoted_type(parameter_type);
4441 /* gcc special: if the type of the prototype matches the unpromoted
4442 * type don't promote */
4443 if (!strict_mode && proto_parameter != NULL) {
4444 type_t *proto_p_type = skip_typeref(proto_parameter->type);
4445 type_t *promo_skip = skip_typeref(parameter_type);
4446 type_t *param_skip = skip_typeref(not_promoted);
4447 if (!types_compatible(proto_p_type, promo_skip)
4448 && types_compatible(proto_p_type, param_skip)) {
4450 need_incompatible_warning = true;
4451 parameter_type = not_promoted;
4454 function_parameter_t *const function_parameter
4455 = allocate_parameter(parameter_type);
4457 *anchor = function_parameter;
4458 anchor = &function_parameter->next;
4461 new_type->function.parameters = parameters;
4462 new_type = identify_new_type(new_type);
4464 if (need_incompatible_warning) {
4465 symbol_t const *const sym = entity->base.symbol;
4466 source_position_t const *const pos = &entity->base.source_position;
4467 source_position_t const *const ppos = &proto_type->base.source_position;
4468 warningf(WARN_OTHER, pos, "declaration '%#N' is incompatible with '%#T' (declared %P)", proto_type, new_type, sym, ppos);
4470 entity->declaration.type = new_type;
4472 rem_anchor_token('{');
4475 static bool first_err = true;
4478 * When called with first_err set, prints the name of the current function,
4481 static void print_in_function(void)
4485 char const *const file = current_function->base.base.source_position.input_name;
4486 diagnosticf("%s: In '%N':\n", file, (entity_t const*)current_function);
4491 * Check if all labels are defined in the current function.
4492 * Check if all labels are used in the current function.
4494 static void check_labels(void)
4496 for (const goto_statement_t *goto_statement = goto_first;
4497 goto_statement != NULL;
4498 goto_statement = goto_statement->next) {
4499 label_t *label = goto_statement->label;
4500 if (label->base.source_position.input_name == NULL) {
4501 print_in_function();
4502 source_position_t const *const pos = &goto_statement->base.source_position;
4503 errorf(pos, "'%N' used but not defined", (entity_t const*)label);
4507 if (is_warn_on(WARN_UNUSED_LABEL)) {
4508 for (const label_statement_t *label_statement = label_first;
4509 label_statement != NULL;
4510 label_statement = label_statement->next) {
4511 label_t *label = label_statement->label;
4513 if (! label->used) {
4514 print_in_function();
4515 source_position_t const *const pos = &label_statement->base.source_position;
4516 warningf(WARN_UNUSED_LABEL, pos, "'%N' defined but not used", (entity_t const*)label);
4522 static void warn_unused_entity(warning_t const why, entity_t *entity, entity_t *const last)
4524 entity_t const *const end = last != NULL ? last->base.next : NULL;
4525 for (; entity != end; entity = entity->base.next) {
4526 if (!is_declaration(entity))
4529 declaration_t *declaration = &entity->declaration;
4530 if (declaration->implicit)
4533 if (!declaration->used) {
4534 print_in_function();
4535 warningf(why, &entity->base.source_position, "'%N' is unused", entity);
4536 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
4537 print_in_function();
4538 warningf(why, &entity->base.source_position, "'%N' is never read", entity);
4543 static void check_unused_variables(statement_t *const stmt, void *const env)
4547 switch (stmt->kind) {
4548 case STATEMENT_DECLARATION: {
4549 declaration_statement_t const *const decls = &stmt->declaration;
4550 warn_unused_entity(WARN_UNUSED_VARIABLE, decls->declarations_begin, decls->declarations_end);
4555 warn_unused_entity(WARN_UNUSED_VARIABLE, stmt->fors.scope.entities, NULL);
4564 * Check declarations of current_function for unused entities.
4566 static void check_declarations(void)
4568 if (is_warn_on(WARN_UNUSED_PARAMETER)) {
4569 const scope_t *scope = ¤t_function->parameters;
4570 warn_unused_entity(WARN_UNUSED_PARAMETER, scope->entities, NULL);
4572 if (is_warn_on(WARN_UNUSED_VARIABLE)) {
4573 walk_statements(current_function->statement, check_unused_variables,
4578 static int determine_truth(expression_t const* const cond)
4581 is_constant_expression(cond) != EXPR_CLASS_CONSTANT ? 0 :
4582 fold_constant_to_bool(cond) ? 1 :
4586 static void check_reachable(statement_t *);
4587 static bool reaches_end;
4589 static bool expression_returns(expression_t const *const expr)
4591 switch (expr->kind) {
4593 expression_t const *const func = expr->call.function;
4594 type_t const *const type = skip_typeref(func->base.type);
4595 if (type->kind == TYPE_POINTER) {
4596 type_t const *const points_to
4597 = skip_typeref(type->pointer.points_to);
4598 if (points_to->kind == TYPE_FUNCTION
4599 && points_to->function.modifiers & DM_NORETURN)
4603 if (!expression_returns(func))
4606 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
4607 if (!expression_returns(arg->expression))
4614 case EXPR_REFERENCE:
4615 case EXPR_ENUM_CONSTANT:
4616 case EXPR_LITERAL_CASES:
4617 case EXPR_LITERAL_CHARACTER:
4618 case EXPR_STRING_LITERAL:
4619 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
4620 case EXPR_LABEL_ADDRESS:
4621 case EXPR_CLASSIFY_TYPE:
4622 case EXPR_SIZEOF: // TODO handle obscure VLA case
4625 case EXPR_BUILTIN_CONSTANT_P:
4626 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
4631 case EXPR_STATEMENT: {
4632 bool old_reaches_end = reaches_end;
4633 reaches_end = false;
4634 check_reachable(expr->statement.statement);
4635 bool returns = reaches_end;
4636 reaches_end = old_reaches_end;
4640 case EXPR_CONDITIONAL:
4641 // TODO handle constant expression
4643 if (!expression_returns(expr->conditional.condition))
4646 if (expr->conditional.true_expression != NULL
4647 && expression_returns(expr->conditional.true_expression))
4650 return expression_returns(expr->conditional.false_expression);
4653 return expression_returns(expr->select.compound);
4655 case EXPR_ARRAY_ACCESS:
4657 expression_returns(expr->array_access.array_ref) &&
4658 expression_returns(expr->array_access.index);
4661 return expression_returns(expr->va_starte.ap);
4664 return expression_returns(expr->va_arge.ap);
4667 return expression_returns(expr->va_copye.src);
4669 case EXPR_UNARY_CASES_MANDATORY:
4670 return expression_returns(expr->unary.value);
4672 case EXPR_UNARY_THROW:
4675 case EXPR_BINARY_CASES:
4676 // TODO handle constant lhs of && and ||
4678 expression_returns(expr->binary.left) &&
4679 expression_returns(expr->binary.right);
4682 panic("unhandled expression");
4685 static bool initializer_returns(initializer_t const *const init)
4687 switch (init->kind) {
4688 case INITIALIZER_VALUE:
4689 return expression_returns(init->value.value);
4691 case INITIALIZER_LIST: {
4692 initializer_t * const* i = init->list.initializers;
4693 initializer_t * const* const end = i + init->list.len;
4694 bool returns = true;
4695 for (; i != end; ++i) {
4696 if (!initializer_returns(*i))
4702 case INITIALIZER_STRING:
4703 case INITIALIZER_DESIGNATOR: // designators have no payload
4706 panic("unhandled initializer");
4709 static bool noreturn_candidate;
4711 static void check_reachable(statement_t *const stmt)
4713 if (stmt->base.reachable)
4715 if (stmt->kind != STATEMENT_DO_WHILE)
4716 stmt->base.reachable = true;
4718 statement_t *last = stmt;
4720 switch (stmt->kind) {
4721 case STATEMENT_ERROR:
4722 case STATEMENT_EMPTY:
4724 next = stmt->base.next;
4727 case STATEMENT_DECLARATION: {
4728 declaration_statement_t const *const decl = &stmt->declaration;
4729 entity_t const * ent = decl->declarations_begin;
4730 entity_t const *const last_decl = decl->declarations_end;
4732 for (;; ent = ent->base.next) {
4733 if (ent->kind == ENTITY_VARIABLE &&
4734 ent->variable.initializer != NULL &&
4735 !initializer_returns(ent->variable.initializer)) {
4738 if (ent == last_decl)
4742 next = stmt->base.next;
4746 case STATEMENT_COMPOUND:
4747 next = stmt->compound.statements;
4749 next = stmt->base.next;
4752 case STATEMENT_RETURN: {
4753 expression_t const *const val = stmt->returns.value;
4754 if (val == NULL || expression_returns(val))
4755 noreturn_candidate = false;
4759 case STATEMENT_IF: {
4760 if_statement_t const *const ifs = &stmt->ifs;
4761 expression_t const *const cond = ifs->condition;
4763 if (!expression_returns(cond))
4766 int const val = determine_truth(cond);
4769 check_reachable(ifs->true_statement);
4774 if (ifs->false_statement != NULL) {
4775 check_reachable(ifs->false_statement);
4779 next = stmt->base.next;
4783 case STATEMENT_SWITCH: {
4784 switch_statement_t const *const switchs = &stmt->switchs;
4785 expression_t const *const expr = switchs->expression;
4787 if (!expression_returns(expr))
4790 if (is_constant_expression(expr) == EXPR_CLASS_CONSTANT) {
4791 long const val = fold_constant_to_int(expr);
4792 case_label_statement_t * defaults = NULL;
4793 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4794 if (i->expression == NULL) {
4799 if (i->first_case <= val && val <= i->last_case) {
4800 check_reachable((statement_t*)i);
4805 if (defaults != NULL) {
4806 check_reachable((statement_t*)defaults);
4810 bool has_default = false;
4811 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4812 if (i->expression == NULL)
4815 check_reachable((statement_t*)i);
4822 next = stmt->base.next;
4826 case STATEMENT_EXPRESSION: {
4827 /* Check for noreturn function call */
4828 expression_t const *const expr = stmt->expression.expression;
4829 if (!expression_returns(expr))
4832 next = stmt->base.next;
4836 case STATEMENT_CONTINUE:
4837 for (statement_t *parent = stmt;;) {
4838 parent = parent->base.parent;
4839 if (parent == NULL) /* continue not within loop */
4843 switch (parent->kind) {
4844 case STATEMENT_WHILE: goto continue_while;
4845 case STATEMENT_DO_WHILE: goto continue_do_while;
4846 case STATEMENT_FOR: goto continue_for;
4852 case STATEMENT_BREAK:
4853 for (statement_t *parent = stmt;;) {
4854 parent = parent->base.parent;
4855 if (parent == NULL) /* break not within loop/switch */
4858 switch (parent->kind) {
4859 case STATEMENT_SWITCH:
4860 case STATEMENT_WHILE:
4861 case STATEMENT_DO_WHILE:
4864 next = parent->base.next;
4865 goto found_break_parent;
4873 case STATEMENT_COMPUTED_GOTO: {
4874 if (!expression_returns(stmt->computed_goto.expression))
4877 statement_t *parent = stmt->base.parent;
4878 if (parent == NULL) /* top level goto */
4884 case STATEMENT_GOTO:
4885 next = stmt->gotos.label->statement;
4886 if (next == NULL) /* missing label */
4890 case STATEMENT_LABEL:
4891 next = stmt->label.statement;
4894 case STATEMENT_CASE_LABEL:
4895 next = stmt->case_label.statement;
4898 case STATEMENT_WHILE: {
4899 while_statement_t const *const whiles = &stmt->whiles;
4900 expression_t const *const cond = whiles->condition;
4902 if (!expression_returns(cond))
4905 int const val = determine_truth(cond);
4908 check_reachable(whiles->body);
4913 next = stmt->base.next;
4917 case STATEMENT_DO_WHILE:
4918 next = stmt->do_while.body;
4921 case STATEMENT_FOR: {
4922 for_statement_t *const fors = &stmt->fors;
4924 if (fors->condition_reachable)
4926 fors->condition_reachable = true;
4928 expression_t const *const cond = fors->condition;
4933 } else if (expression_returns(cond)) {
4934 val = determine_truth(cond);
4940 check_reachable(fors->body);
4945 next = stmt->base.next;
4949 case STATEMENT_MS_TRY: {
4950 ms_try_statement_t const *const ms_try = &stmt->ms_try;
4951 check_reachable(ms_try->try_statement);
4952 next = ms_try->final_statement;
4956 case STATEMENT_LEAVE: {
4957 statement_t *parent = stmt;
4959 parent = parent->base.parent;
4960 if (parent == NULL) /* __leave not within __try */
4963 if (parent->kind == STATEMENT_MS_TRY) {
4965 next = parent->ms_try.final_statement;
4973 panic("invalid statement kind");
4976 while (next == NULL) {
4977 next = last->base.parent;
4979 noreturn_candidate = false;
4981 type_t *const type = skip_typeref(current_function->base.type);
4982 assert(is_type_function(type));
4983 type_t *const ret = skip_typeref(type->function.return_type);
4984 if (!is_type_void(ret) &&
4985 is_type_valid(ret) &&
4986 !is_main(current_entity)) {
4987 source_position_t const *const pos = &stmt->base.source_position;
4988 warningf(WARN_RETURN_TYPE, pos, "control reaches end of non-void function");
4993 switch (next->kind) {
4994 case STATEMENT_ERROR:
4995 case STATEMENT_EMPTY:
4996 case STATEMENT_DECLARATION:
4997 case STATEMENT_EXPRESSION:
4999 case STATEMENT_RETURN:
5000 case STATEMENT_CONTINUE:
5001 case STATEMENT_BREAK:
5002 case STATEMENT_COMPUTED_GOTO:
5003 case STATEMENT_GOTO:
5004 case STATEMENT_LEAVE:
5005 panic("invalid control flow in function");
5007 case STATEMENT_COMPOUND:
5008 if (next->compound.stmt_expr) {
5014 case STATEMENT_SWITCH:
5015 case STATEMENT_LABEL:
5016 case STATEMENT_CASE_LABEL:
5018 next = next->base.next;
5021 case STATEMENT_WHILE: {
5023 if (next->base.reachable)
5025 next->base.reachable = true;
5027 while_statement_t const *const whiles = &next->whiles;
5028 expression_t const *const cond = whiles->condition;
5030 if (!expression_returns(cond))
5033 int const val = determine_truth(cond);
5036 check_reachable(whiles->body);
5042 next = next->base.next;
5046 case STATEMENT_DO_WHILE: {
5048 if (next->base.reachable)
5050 next->base.reachable = true;
5052 do_while_statement_t const *const dw = &next->do_while;
5053 expression_t const *const cond = dw->condition;
5055 if (!expression_returns(cond))
5058 int const val = determine_truth(cond);
5061 check_reachable(dw->body);
5067 next = next->base.next;
5071 case STATEMENT_FOR: {
5073 for_statement_t *const fors = &next->fors;
5075 fors->step_reachable = true;
5077 if (fors->condition_reachable)
5079 fors->condition_reachable = true;
5081 expression_t const *const cond = fors->condition;
5086 } else if (expression_returns(cond)) {
5087 val = determine_truth(cond);
5093 check_reachable(fors->body);
5099 next = next->base.next;
5103 case STATEMENT_MS_TRY:
5105 next = next->ms_try.final_statement;
5110 check_reachable(next);
5113 static void check_unreachable(statement_t* const stmt, void *const env)
5117 switch (stmt->kind) {
5118 case STATEMENT_DO_WHILE:
5119 if (!stmt->base.reachable) {
5120 expression_t const *const cond = stmt->do_while.condition;
5121 if (determine_truth(cond) >= 0) {
5122 source_position_t const *const pos = &cond->base.source_position;
5123 warningf(WARN_UNREACHABLE_CODE, pos, "condition of do-while-loop is unreachable");
5128 case STATEMENT_FOR: {
5129 for_statement_t const* const fors = &stmt->fors;
5131 // if init and step are unreachable, cond is unreachable, too
5132 if (!stmt->base.reachable && !fors->step_reachable) {
5133 goto warn_unreachable;
5135 if (!stmt->base.reachable && fors->initialisation != NULL) {
5136 source_position_t const *const pos = &fors->initialisation->base.source_position;
5137 warningf(WARN_UNREACHABLE_CODE, pos, "initialisation of for-statement is unreachable");
5140 if (!fors->condition_reachable && fors->condition != NULL) {
5141 source_position_t const *const pos = &fors->condition->base.source_position;
5142 warningf(WARN_UNREACHABLE_CODE, pos, "condition of for-statement is unreachable");
5145 if (!fors->step_reachable && fors->step != NULL) {
5146 source_position_t const *const pos = &fors->step->base.source_position;
5147 warningf(WARN_UNREACHABLE_CODE, pos, "step of for-statement is unreachable");
5153 case STATEMENT_COMPOUND:
5154 if (stmt->compound.statements != NULL)
5156 goto warn_unreachable;
5158 case STATEMENT_DECLARATION: {
5159 /* Only warn if there is at least one declarator with an initializer.
5160 * This typically occurs in switch statements. */
5161 declaration_statement_t const *const decl = &stmt->declaration;
5162 entity_t const * ent = decl->declarations_begin;
5163 entity_t const *const last = decl->declarations_end;
5165 for (;; ent = ent->base.next) {
5166 if (ent->kind == ENTITY_VARIABLE &&
5167 ent->variable.initializer != NULL) {
5168 goto warn_unreachable;
5178 if (!stmt->base.reachable) {
5179 source_position_t const *const pos = &stmt->base.source_position;
5180 warningf(WARN_UNREACHABLE_CODE, pos, "statement is unreachable");
5186 static bool is_main(entity_t *entity)
5188 static symbol_t *sym_main = NULL;
5189 if (sym_main == NULL) {
5190 sym_main = symbol_table_insert("main");
5193 if (entity->base.symbol != sym_main)
5195 /* must be in outermost scope */
5196 if (entity->base.parent_scope != file_scope)
5202 static void prepare_main_collect2(entity_t*);
5204 static void parse_external_declaration(void)
5206 /* function-definitions and declarations both start with declaration
5208 add_anchor_token(';');
5209 declaration_specifiers_t specifiers;
5210 parse_declaration_specifiers(&specifiers);
5211 rem_anchor_token(';');
5213 /* must be a declaration */
5214 if (token.kind == ';') {
5215 parse_anonymous_declaration_rest(&specifiers);
5219 add_anchor_token(',');
5220 add_anchor_token('=');
5221 add_anchor_token(';');
5222 add_anchor_token('{');
5224 /* declarator is common to both function-definitions and declarations */
5225 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
5227 rem_anchor_token('{');
5228 rem_anchor_token(';');
5229 rem_anchor_token('=');
5230 rem_anchor_token(',');
5232 /* must be a declaration */
5233 switch (token.kind) {
5237 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
5242 /* must be a function definition */
5243 parse_kr_declaration_list(ndeclaration);
5245 if (token.kind != '{') {
5246 parse_error_expected("while parsing function definition", '{', NULL);
5247 eat_until_matching_token(';');
5251 assert(is_declaration(ndeclaration));
5252 type_t *const orig_type = ndeclaration->declaration.type;
5253 type_t * type = skip_typeref(orig_type);
5255 if (!is_type_function(type)) {
5256 if (is_type_valid(type)) {
5257 errorf(HERE, "declarator '%#N' has a body but is not a function type", ndeclaration);
5263 source_position_t const *const pos = &ndeclaration->base.source_position;
5264 if (is_typeref(orig_type)) {
5266 errorf(pos, "type of function definition '%#N' is a typedef", ndeclaration);
5269 if (is_type_compound(skip_typeref(type->function.return_type))) {
5270 warningf(WARN_AGGREGATE_RETURN, pos, "'%N' returns an aggregate", ndeclaration);
5272 if (type->function.unspecified_parameters) {
5273 warningf(WARN_OLD_STYLE_DEFINITION, pos, "old-style definition of '%N'", ndeclaration);
5275 warningf(WARN_TRADITIONAL, pos, "traditional C rejects ISO C style definition of '%N'", ndeclaration);
5278 /* §6.7.5.3:14 a function definition with () means no
5279 * parameters (and not unspecified parameters) */
5280 if (type->function.unspecified_parameters &&
5281 type->function.parameters == NULL) {
5282 type_t *copy = duplicate_type(type);
5283 copy->function.unspecified_parameters = false;
5284 type = identify_new_type(copy);
5286 ndeclaration->declaration.type = type;
5289 entity_t *const entity = record_entity(ndeclaration, true);
5290 assert(entity->kind == ENTITY_FUNCTION);
5291 assert(ndeclaration->kind == ENTITY_FUNCTION);
5293 function_t *const function = &entity->function;
5294 if (ndeclaration != entity) {
5295 function->parameters = ndeclaration->function.parameters;
5298 PUSH_SCOPE(&function->parameters);
5300 entity_t *parameter = function->parameters.entities;
5301 for (; parameter != NULL; parameter = parameter->base.next) {
5302 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5303 parameter->base.parent_scope = current_scope;
5305 assert(parameter->base.parent_scope == NULL
5306 || parameter->base.parent_scope == current_scope);
5307 parameter->base.parent_scope = current_scope;
5308 if (parameter->base.symbol == NULL) {
5309 errorf(¶meter->base.source_position, "parameter name omitted");
5312 environment_push(parameter);
5315 if (function->statement != NULL) {
5316 parser_error_multiple_definition(entity, HERE);
5319 /* parse function body */
5320 int label_stack_top = label_top();
5321 function_t *old_current_function = current_function;
5322 current_function = function;
5323 PUSH_CURRENT_ENTITY(entity);
5327 goto_anchor = &goto_first;
5329 label_anchor = &label_first;
5331 statement_t *const body = parse_compound_statement(false);
5332 function->statement = body;
5335 check_declarations();
5336 if (is_warn_on(WARN_RETURN_TYPE) ||
5337 is_warn_on(WARN_UNREACHABLE_CODE) ||
5338 (is_warn_on(WARN_MISSING_NORETURN) && !(function->base.modifiers & DM_NORETURN))) {
5339 noreturn_candidate = true;
5340 check_reachable(body);
5341 if (is_warn_on(WARN_UNREACHABLE_CODE))
5342 walk_statements(body, check_unreachable, NULL);
5343 if (noreturn_candidate &&
5344 !(function->base.modifiers & DM_NORETURN)) {
5345 source_position_t const *const pos = &body->base.source_position;
5346 warningf(WARN_MISSING_NORETURN, pos, "function '%#N' is candidate for attribute 'noreturn'", entity);
5350 if (is_main(entity)) {
5351 /* Force main to C linkage. */
5352 type_t *const type = entity->declaration.type;
5353 assert(is_type_function(type));
5354 if (type->function.linkage != LINKAGE_C) {
5355 type_t *new_type = duplicate_type(type);
5356 new_type->function.linkage = LINKAGE_C;
5357 entity->declaration.type = identify_new_type(new_type);
5360 if (enable_main_collect2_hack)
5361 prepare_main_collect2(entity);
5364 POP_CURRENT_ENTITY();
5366 assert(current_function == function);
5367 current_function = old_current_function;
5368 label_pop_to(label_stack_top);
5374 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
5376 entity_t *iter = compound->members.entities;
5377 for (; iter != NULL; iter = iter->base.next) {
5378 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5381 if (iter->base.symbol == symbol) {
5383 } else if (iter->base.symbol == NULL) {
5384 /* search in anonymous structs and unions */
5385 type_t *type = skip_typeref(iter->declaration.type);
5386 if (is_type_compound(type)) {
5387 if (find_compound_entry(type->compound.compound, symbol)
5398 static void check_deprecated(const source_position_t *source_position,
5399 const entity_t *entity)
5401 if (!is_declaration(entity))
5403 if ((entity->declaration.modifiers & DM_DEPRECATED) == 0)
5406 source_position_t const *const epos = &entity->base.source_position;
5407 char const *const msg = get_deprecated_string(entity->declaration.attributes);
5409 warningf(WARN_DEPRECATED_DECLARATIONS, source_position, "'%N' is deprecated (declared %P): \"%s\"", entity, epos, msg);
5411 warningf(WARN_DEPRECATED_DECLARATIONS, source_position, "'%N' is deprecated (declared %P)", entity, epos);
5416 static expression_t *create_select(const source_position_t *pos,
5418 type_qualifiers_t qualifiers,
5421 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
5423 check_deprecated(pos, entry);
5425 expression_t *select = allocate_expression_zero(EXPR_SELECT);
5426 select->select.compound = addr;
5427 select->select.compound_entry = entry;
5429 type_t *entry_type = entry->declaration.type;
5430 type_t *res_type = get_qualified_type(entry_type, qualifiers);
5432 /* bitfields need special treatment */
5433 if (entry->compound_member.bitfield) {
5434 unsigned bit_size = entry->compound_member.bit_size;
5435 /* if fewer bits than an int, convert to int (see §6.3.1.1) */
5436 if (bit_size < get_atomic_type_size(ATOMIC_TYPE_INT) * BITS_PER_BYTE) {
5437 res_type = type_int;
5441 /* we always do the auto-type conversions; the & and sizeof parser contains
5442 * code to revert this! */
5443 select->base.type = automatic_type_conversion(res_type);
5450 * Find entry with symbol in compound. Search anonymous structs and unions and
5451 * creates implicit select expressions for them.
5452 * Returns the adress for the innermost compound.
5454 static expression_t *find_create_select(const source_position_t *pos,
5456 type_qualifiers_t qualifiers,
5457 compound_t *compound, symbol_t *symbol)
5459 entity_t *iter = compound->members.entities;
5460 for (; iter != NULL; iter = iter->base.next) {
5461 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5464 symbol_t *iter_symbol = iter->base.symbol;
5465 if (iter_symbol == NULL) {
5466 type_t *type = iter->declaration.type;
5467 if (!is_type_compound(type))
5470 compound_t *sub_compound = type->compound.compound;
5472 if (find_compound_entry(sub_compound, symbol) == NULL)
5475 expression_t *sub_addr = create_select(pos, addr, qualifiers, iter);
5476 sub_addr->base.source_position = *pos;
5477 sub_addr->base.implicit = true;
5478 return find_create_select(pos, sub_addr, qualifiers, sub_compound,
5482 if (iter_symbol == symbol) {
5483 return create_select(pos, addr, qualifiers, iter);
5490 static void parse_bitfield_member(entity_t *entity)
5494 expression_t *size = parse_constant_expression();
5497 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5498 type_t *type = entity->declaration.type;
5499 if (!is_type_integer(skip_typeref(type))) {
5500 errorf(HERE, "bitfield base type '%T' is not an integer type",
5504 if (is_constant_expression(size) != EXPR_CLASS_CONSTANT) {
5505 /* error already reported by parse_constant_expression */
5506 size_long = get_type_size(type) * 8;
5508 size_long = fold_constant_to_int(size);
5510 const symbol_t *symbol = entity->base.symbol;
5511 const symbol_t *user_symbol
5512 = symbol == NULL ? sym_anonymous : symbol;
5513 unsigned bit_size = get_type_size(type) * 8;
5514 if (size_long < 0) {
5515 errorf(HERE, "negative width in bit-field '%Y'", user_symbol);
5516 } else if (size_long == 0 && symbol != NULL) {
5517 errorf(HERE, "zero width for bit-field '%Y'", user_symbol);
5518 } else if (bit_size > 0 && (unsigned)size_long > bit_size) {
5519 errorf(HERE, "width of bitfield '%Y' exceeds its type",
5522 /* hope that people don't invent crazy types with more bits
5523 * than our struct can hold */
5525 (1 << sizeof(entity->compound_member.bit_size)*8));
5529 entity->compound_member.bitfield = true;
5530 entity->compound_member.bit_size = (unsigned char)size_long;
5533 static void parse_compound_declarators(compound_t *compound,
5534 const declaration_specifiers_t *specifiers)
5536 add_anchor_token(';');
5537 add_anchor_token(',');
5541 if (token.kind == ':') {
5542 /* anonymous bitfield */
5543 type_t *type = specifiers->type;
5544 entity_t *const entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, NULL, HERE);
5545 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
5546 entity->declaration.storage_class = STORAGE_CLASS_NONE;
5547 entity->declaration.type = type;
5549 parse_bitfield_member(entity);
5551 attribute_t *attributes = parse_attributes(NULL);
5552 attribute_t **anchor = &attributes;
5553 while (*anchor != NULL)
5554 anchor = &(*anchor)->next;
5555 *anchor = specifiers->attributes;
5556 if (attributes != NULL) {
5557 handle_entity_attributes(attributes, entity);
5559 entity->declaration.attributes = attributes;
5561 append_entity(&compound->members, entity);
5563 entity = parse_declarator(specifiers,
5564 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
5565 source_position_t const *const pos = &entity->base.source_position;
5566 if (entity->kind == ENTITY_TYPEDEF) {
5567 errorf(pos, "typedef not allowed as compound member");
5569 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5571 /* make sure we don't define a symbol multiple times */
5572 symbol_t *symbol = entity->base.symbol;
5573 if (symbol != NULL) {
5574 entity_t *prev = find_compound_entry(compound, symbol);
5576 source_position_t const *const ppos = &prev->base.source_position;
5577 errorf(pos, "multiple declarations of '%N' (declared %P)", entity, ppos);
5581 if (token.kind == ':') {
5582 parse_bitfield_member(entity);
5584 attribute_t *attributes = parse_attributes(NULL);
5585 handle_entity_attributes(attributes, entity);
5587 type_t *orig_type = entity->declaration.type;
5588 type_t *type = skip_typeref(orig_type);
5589 if (is_type_function(type)) {
5590 errorf(pos, "'%N' must not have function type '%T'", entity, orig_type);
5591 } else if (is_type_incomplete(type)) {
5592 /* §6.7.2.1:16 flexible array member */
5593 if (!is_type_array(type) ||
5594 token.kind != ';' ||
5595 look_ahead(1)->kind != '}') {
5596 errorf(pos, "'%N' has incomplete type '%T'", entity, orig_type);
5597 } else if (compound->members.entities == NULL) {
5598 errorf(pos, "flexible array member in otherwise empty struct");
5603 append_entity(&compound->members, entity);
5606 } while (next_if(','));
5607 rem_anchor_token(',');
5608 rem_anchor_token(';');
5611 anonymous_entity = NULL;
5614 static void parse_compound_type_entries(compound_t *compound)
5617 add_anchor_token('}');
5620 switch (token.kind) {
5622 case T___extension__:
5623 case T_IDENTIFIER: {
5625 declaration_specifiers_t specifiers;
5626 parse_declaration_specifiers(&specifiers);
5627 parse_compound_declarators(compound, &specifiers);
5633 rem_anchor_token('}');
5636 compound->complete = true;
5642 static type_t *parse_typename(void)
5644 declaration_specifiers_t specifiers;
5645 parse_declaration_specifiers(&specifiers);
5646 if (specifiers.storage_class != STORAGE_CLASS_NONE
5647 || specifiers.thread_local) {
5648 /* TODO: improve error message, user does probably not know what a
5649 * storage class is...
5651 errorf(&specifiers.source_position, "typename must not have a storage class");
5654 type_t *result = parse_abstract_declarator(specifiers.type);
5662 typedef expression_t* (*parse_expression_function)(void);
5663 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
5665 typedef struct expression_parser_function_t expression_parser_function_t;
5666 struct expression_parser_function_t {
5667 parse_expression_function parser;
5668 precedence_t infix_precedence;
5669 parse_expression_infix_function infix_parser;
5672 static expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5674 static type_t *get_string_type(string_encoding_t const enc)
5676 bool const warn = is_warn_on(WARN_WRITE_STRINGS);
5678 case STRING_ENCODING_CHAR: return warn ? type_const_char_ptr : type_char_ptr;
5679 case STRING_ENCODING_WIDE: return warn ? type_const_wchar_t_ptr : type_wchar_t_ptr;
5681 panic("invalid string encoding");
5685 * Parse a string constant.
5687 static expression_t *parse_string_literal(void)
5689 expression_t *const expr = allocate_expression_zero(EXPR_STRING_LITERAL);
5690 expr->string_literal.value = concat_string_literals();
5691 expr->base.type = get_string_type(expr->string_literal.value.encoding);
5696 * Parse a boolean constant.
5698 static expression_t *parse_boolean_literal(bool value)
5700 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_BOOLEAN);
5701 literal->base.type = type_bool;
5702 literal->literal.value.begin = value ? "true" : "false";
5703 literal->literal.value.size = value ? 4 : 5;
5705 eat(value ? T_true : T_false);
5709 static void warn_traditional_suffix(char const *const suffix)
5711 warningf(WARN_TRADITIONAL, HERE, "traditional C rejects the '%s' suffix", suffix);
5714 static void check_integer_suffix(expression_t *const expr, char const *const suffix)
5716 unsigned spec = SPECIFIER_NONE;
5717 char const *c = suffix;
5720 if (*c == 'L' || *c == 'l') {
5721 add = SPECIFIER_LONG;
5723 add |= SPECIFIER_LONG_LONG;
5726 } else if (*c == 'U' || *c == 'u') {
5727 add = SPECIFIER_UNSIGNED;
5740 case SPECIFIER_NONE: type = type_int; break;
5741 case SPECIFIER_LONG: type = type_long; break;
5742 case SPECIFIER_LONG | SPECIFIER_LONG_LONG: type = type_long_long; break;
5743 case SPECIFIER_UNSIGNED: type = type_unsigned_int; break;
5744 case SPECIFIER_UNSIGNED | SPECIFIER_LONG: type = type_unsigned_long; break;
5745 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG: type = type_unsigned_long_long; break;
5746 default: panic("inconsistent suffix");
5748 if (spec != SPECIFIER_NONE && spec != SPECIFIER_LONG) {
5749 warn_traditional_suffix(suffix);
5751 expr->base.type = type;
5752 /* Integer type depends on the size of the number and the size
5753 * representable by the types. The backend/codegeneration has to
5754 * determine that. */
5755 determine_literal_type(&expr->literal);
5758 errorf(HERE, "invalid suffix '%s' on integer constant", suffix);
5762 static void check_floatingpoint_suffix(expression_t *const expr, char const *const suffix)
5765 char const *c = suffix;
5768 case 'f': type = type_float; ++c; break;
5770 case 'l': type = type_long_double; ++c; break;
5771 default: type = type_double; break;
5775 expr->base.type = type;
5776 if (suffix[0] != '\0') {
5777 warn_traditional_suffix(suffix);
5780 errorf(HERE, "invalid suffix '%s' on floatingpoint constant", suffix);
5784 static expression_t *parse_number_literal(void)
5786 string_t const *const str = &token.literal.string;
5787 char const * i = str->begin;
5788 unsigned digits = 0;
5789 bool is_float = false;
5791 /* Parse base prefix. */
5795 case 'B': case 'b': base = 2; ++i; break;
5796 case 'X': case 'x': base = 16; ++i; break;
5797 default: base = 8; digits |= 1U << 0; break;
5803 /* Parse mantissa. */
5809 errorf(HERE, "multiple decimal points in %K", &token);
5818 case '0': digit = 0; break;
5819 case '1': digit = 1; break;
5820 case '2': digit = 2; break;
5821 case '3': digit = 3; break;
5822 case '4': digit = 4; break;
5823 case '5': digit = 5; break;
5824 case '6': digit = 6; break;
5825 case '7': digit = 7; break;
5826 case '8': digit = 8; break;
5827 case '9': digit = 9; break;
5828 case 'A': case 'a': digit = 10; break;
5829 case 'B': case 'b': digit = 11; break;
5830 case 'C': case 'c': digit = 12; break;
5831 case 'D': case 'd': digit = 13; break;
5832 case 'E': case 'e': digit = 14; break;
5833 case 'F': case 'f': digit = 15; break;
5835 default: goto done_mantissa;
5838 if (digit >= 10 && base != 16)
5841 digits |= 1U << digit;
5845 /* Parse exponent. */
5849 errorf(HERE, "binary floating %K not allowed", &token);
5854 if (*i == 'E' || *i == 'e') {
5856 goto parse_exponent;
5861 if (*i == 'P' || *i == 'p') {
5866 if (*i == '-' || *i == '+')
5872 } while (isdigit(*i));
5874 errorf(HERE, "exponent of %K has no digits", &token);
5876 } else if (is_float) {
5877 errorf(HERE, "hexadecimal floating %K requires an exponent", &token);
5883 panic("invalid base");
5887 expression_t *const expr = allocate_expression_zero(is_float ? EXPR_LITERAL_FLOATINGPOINT : EXPR_LITERAL_INTEGER);
5888 expr->literal.value = *str;
5892 errorf(HERE, "%K has no digits", &token);
5893 } else if (digits & ~((1U << base) - 1)) {
5894 errorf(HERE, "invalid digit in %K", &token);
5896 expr->literal.suffix = i;
5898 check_floatingpoint_suffix(expr, i);
5900 check_integer_suffix(expr, i);
5910 * Parse a character constant.
5912 static expression_t *parse_character_constant(void)
5914 expression_t *const literal = allocate_expression_zero(EXPR_LITERAL_CHARACTER);
5915 literal->string_literal.value = token.literal.string;
5917 size_t const size = get_string_len(&token.literal.string);
5918 switch (token.literal.string.encoding) {
5919 case STRING_ENCODING_CHAR:
5920 literal->base.type = c_mode & _CXX ? type_char : type_int;
5922 if (!GNU_MODE && !(c_mode & _C99)) {
5923 errorf(HERE, "more than 1 character in character constant");
5925 literal->base.type = type_int;
5926 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
5931 case STRING_ENCODING_WIDE:
5932 literal->base.type = type_int;
5934 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
5939 eat(T_CHARACTER_CONSTANT);
5943 static entity_t *create_implicit_function(symbol_t *symbol, source_position_t const *const pos)
5945 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
5946 ntype->function.return_type = type_int;
5947 ntype->function.unspecified_parameters = true;
5948 ntype->function.linkage = LINKAGE_C;
5949 type_t *type = identify_new_type(ntype);
5951 entity_t *const entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, symbol, pos);
5952 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
5953 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
5954 entity->declaration.type = type;
5955 entity->declaration.implicit = true;
5957 if (current_scope != NULL)
5958 record_entity(entity, false);
5964 * Performs automatic type cast as described in §6.3.2.1.
5966 * @param orig_type the original type
5968 static type_t *automatic_type_conversion(type_t *orig_type)
5970 type_t *type = skip_typeref(orig_type);
5971 if (is_type_array(type)) {
5972 array_type_t *array_type = &type->array;
5973 type_t *element_type = array_type->element_type;
5974 unsigned qualifiers = array_type->base.qualifiers;
5976 return make_pointer_type(element_type, qualifiers);
5979 if (is_type_function(type)) {
5980 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
5987 * reverts the automatic casts of array to pointer types and function
5988 * to function-pointer types as defined §6.3.2.1
5990 type_t *revert_automatic_type_conversion(const expression_t *expression)
5992 switch (expression->kind) {
5993 case EXPR_REFERENCE: {
5994 entity_t *entity = expression->reference.entity;
5995 if (is_declaration(entity)) {
5996 return entity->declaration.type;
5997 } else if (entity->kind == ENTITY_ENUM_VALUE) {
5998 return entity->enum_value.enum_type;
6000 panic("no declaration or enum in reference");
6005 entity_t *entity = expression->select.compound_entry;
6006 assert(is_declaration(entity));
6007 type_t *type = entity->declaration.type;
6008 return get_qualified_type(type, expression->base.type->base.qualifiers);
6011 case EXPR_UNARY_DEREFERENCE: {
6012 const expression_t *const value = expression->unary.value;
6013 type_t *const type = skip_typeref(value->base.type);
6014 if (!is_type_pointer(type))
6015 return type_error_type;
6016 return type->pointer.points_to;
6019 case EXPR_ARRAY_ACCESS: {
6020 const expression_t *array_ref = expression->array_access.array_ref;
6021 type_t *type_left = skip_typeref(array_ref->base.type);
6022 if (!is_type_pointer(type_left))
6023 return type_error_type;
6024 return type_left->pointer.points_to;
6027 case EXPR_STRING_LITERAL: {
6028 size_t const size = get_string_len(&expression->string_literal.value) + 1;
6029 type_t *const elem = get_unqualified_type(expression->base.type->pointer.points_to);
6030 return make_array_type(elem, size, TYPE_QUALIFIER_NONE);
6033 case EXPR_COMPOUND_LITERAL:
6034 return expression->compound_literal.type;
6039 return expression->base.type;
6043 * Find an entity matching a symbol in a scope.
6044 * Uses current scope if scope is NULL
6046 static entity_t *lookup_entity(const scope_t *scope, symbol_t *symbol,
6047 namespace_tag_t namespc)
6049 if (scope == NULL) {
6050 return get_entity(symbol, namespc);
6053 /* we should optimize here, if scope grows above a certain size we should
6054 construct a hashmap here... */
6055 entity_t *entity = scope->entities;
6056 for ( ; entity != NULL; entity = entity->base.next) {
6057 if (entity->base.symbol == symbol
6058 && (namespace_tag_t)entity->base.namespc == namespc)
6065 static entity_t *parse_qualified_identifier(void)
6067 /* namespace containing the symbol */
6069 source_position_t pos;
6070 const scope_t *lookup_scope = NULL;
6072 if (next_if(T_COLONCOLON))
6073 lookup_scope = &unit->scope;
6077 symbol = expect_identifier("while parsing identifier", &pos);
6079 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6082 entity = lookup_entity(lookup_scope, symbol, NAMESPACE_NORMAL);
6084 if (!next_if(T_COLONCOLON))
6087 switch (entity->kind) {
6088 case ENTITY_NAMESPACE:
6089 lookup_scope = &entity->namespacee.members;
6094 lookup_scope = &entity->compound.members;
6097 errorf(&pos, "'%Y' must be a namespace, class, struct or union (but is a %s)",
6098 symbol, get_entity_kind_name(entity->kind));
6100 /* skip further qualifications */
6101 while (next_if(T_IDENTIFIER) && next_if(T_COLONCOLON)) {}
6103 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6107 if (entity == NULL) {
6108 if (!strict_mode && token.kind == '(') {
6109 /* an implicitly declared function */
6110 entity = create_implicit_function(symbol, &pos);
6111 warningf(WARN_IMPLICIT_FUNCTION_DECLARATION, &pos, "implicit declaration of '%N'", entity);
6113 errorf(&pos, "unknown identifier '%Y' found.", symbol);
6114 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6121 static expression_t *parse_reference(void)
6123 source_position_t const pos = *HERE;
6124 entity_t *const entity = parse_qualified_identifier();
6127 if (is_declaration(entity)) {
6128 orig_type = entity->declaration.type;
6129 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6130 orig_type = entity->enum_value.enum_type;
6132 panic("expected declaration or enum value in reference");
6135 /* we always do the auto-type conversions; the & and sizeof parser contains
6136 * code to revert this! */
6137 type_t *type = automatic_type_conversion(orig_type);
6139 expression_kind_t kind = EXPR_REFERENCE;
6140 if (entity->kind == ENTITY_ENUM_VALUE)
6141 kind = EXPR_ENUM_CONSTANT;
6143 expression_t *expression = allocate_expression_zero(kind);
6144 expression->base.source_position = pos;
6145 expression->base.type = type;
6146 expression->reference.entity = entity;
6148 /* this declaration is used */
6149 if (is_declaration(entity)) {
6150 entity->declaration.used = true;
6153 if (entity->base.parent_scope != file_scope
6154 && (current_function != NULL
6155 && entity->base.parent_scope->depth < current_function->parameters.depth)
6156 && (entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER)) {
6157 /* access of a variable from an outer function */
6158 entity->variable.address_taken = true;
6159 current_function->need_closure = true;
6162 check_deprecated(&pos, entity);
6167 static bool semantic_cast(expression_t *cast)
6169 expression_t *expression = cast->unary.value;
6170 type_t *orig_dest_type = cast->base.type;
6171 type_t *orig_type_right = expression->base.type;
6172 type_t const *dst_type = skip_typeref(orig_dest_type);
6173 type_t const *src_type = skip_typeref(orig_type_right);
6174 source_position_t const *pos = &cast->base.source_position;
6176 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6177 if (is_type_void(dst_type))
6180 /* only integer and pointer can be casted to pointer */
6181 if (is_type_pointer(dst_type) &&
6182 !is_type_pointer(src_type) &&
6183 !is_type_integer(src_type) &&
6184 is_type_valid(src_type)) {
6185 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6189 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6190 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6194 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6195 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6199 if (is_type_pointer(src_type) && is_type_pointer(dst_type)) {
6200 type_t *src = skip_typeref(src_type->pointer.points_to);
6201 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6202 unsigned missing_qualifiers =
6203 src->base.qualifiers & ~dst->base.qualifiers;
6204 if (missing_qualifiers != 0) {
6205 warningf(WARN_CAST_QUAL, pos, "cast discards qualifiers '%Q' in pointer target type of '%T'", missing_qualifiers, orig_type_right);
6211 static expression_t *parse_compound_literal(source_position_t const *const pos, type_t *type)
6213 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6214 expression->base.source_position = *pos;
6216 parse_initializer_env_t env;
6219 env.must_be_constant = false;
6220 initializer_t *initializer = parse_initializer(&env);
6223 expression->compound_literal.initializer = initializer;
6224 expression->compound_literal.type = type;
6225 expression->base.type = automatic_type_conversion(type);
6231 * Parse a cast expression.
6233 static expression_t *parse_cast(void)
6235 source_position_t const pos = *HERE;
6238 add_anchor_token(')');
6240 type_t *type = parse_typename();
6242 rem_anchor_token(')');
6245 if (token.kind == '{') {
6246 return parse_compound_literal(&pos, type);
6249 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6250 cast->base.source_position = pos;
6252 expression_t *value = parse_subexpression(PREC_CAST);
6253 cast->base.type = type;
6254 cast->unary.value = value;
6256 if (! semantic_cast(cast)) {
6257 /* TODO: record the error in the AST. else it is impossible to detect it */
6264 * Parse a statement expression.
6266 static expression_t *parse_statement_expression(void)
6268 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6271 add_anchor_token(')');
6273 statement_t *statement = parse_compound_statement(true);
6274 statement->compound.stmt_expr = true;
6275 expression->statement.statement = statement;
6277 /* find last statement and use its type */
6278 type_t *type = type_void;
6279 const statement_t *stmt = statement->compound.statements;
6281 while (stmt->base.next != NULL)
6282 stmt = stmt->base.next;
6284 if (stmt->kind == STATEMENT_EXPRESSION) {
6285 type = stmt->expression.expression->base.type;
6288 source_position_t const *const pos = &expression->base.source_position;
6289 warningf(WARN_OTHER, pos, "empty statement expression ({})");
6291 expression->base.type = type;
6293 rem_anchor_token(')');
6299 * Parse a parenthesized expression.
6301 static expression_t *parse_parenthesized_expression(void)
6303 token_t const* const la1 = look_ahead(1);
6304 switch (la1->kind) {
6306 /* gcc extension: a statement expression */
6307 return parse_statement_expression();
6310 if (is_typedef_symbol(la1->base.symbol)) {
6312 return parse_cast();
6317 add_anchor_token(')');
6318 expression_t *result = parse_expression();
6319 result->base.parenthesized = true;
6320 rem_anchor_token(')');
6326 static expression_t *parse_function_keyword(funcname_kind_t const kind)
6328 if (current_function == NULL) {
6329 errorf(HERE, "'%K' used outside of a function", &token);
6332 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6333 expression->base.type = type_char_ptr;
6334 expression->funcname.kind = kind;
6341 static designator_t *parse_designator(void)
6343 designator_t *const result = allocate_ast_zero(sizeof(result[0]));
6344 result->symbol = expect_identifier("while parsing member designator", &result->source_position);
6345 if (!result->symbol)
6348 designator_t *last_designator = result;
6351 designator_t *const designator = allocate_ast_zero(sizeof(result[0]));
6352 designator->symbol = expect_identifier("while parsing member designator", &designator->source_position);
6353 if (!designator->symbol)
6356 last_designator->next = designator;
6357 last_designator = designator;
6361 add_anchor_token(']');
6362 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6363 designator->source_position = *HERE;
6364 designator->array_index = parse_expression();
6365 rem_anchor_token(']');
6367 if (designator->array_index == NULL) {
6371 last_designator->next = designator;
6372 last_designator = designator;
6382 * Parse the __builtin_offsetof() expression.
6384 static expression_t *parse_offsetof(void)
6386 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6387 expression->base.type = type_size_t;
6389 eat(T___builtin_offsetof);
6391 add_anchor_token(')');
6392 add_anchor_token(',');
6394 type_t *type = parse_typename();
6395 rem_anchor_token(',');
6397 designator_t *designator = parse_designator();
6398 rem_anchor_token(')');
6401 expression->offsetofe.type = type;
6402 expression->offsetofe.designator = designator;
6405 memset(&path, 0, sizeof(path));
6406 path.top_type = type;
6407 path.path = NEW_ARR_F(type_path_entry_t, 0);
6409 descend_into_subtype(&path);
6411 if (!walk_designator(&path, designator, true)) {
6412 return create_error_expression();
6415 DEL_ARR_F(path.path);
6420 static bool is_last_parameter(expression_t *const param)
6422 if (param->kind == EXPR_REFERENCE) {
6423 entity_t *const entity = param->reference.entity;
6424 if (entity->kind == ENTITY_PARAMETER &&
6425 !entity->base.next &&
6426 entity->base.parent_scope == ¤t_function->parameters) {
6431 if (!is_type_valid(skip_typeref(param->base.type)))
6438 * Parses a __builtin_va_start() expression.
6440 static expression_t *parse_va_start(void)
6442 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6444 eat(T___builtin_va_start);
6446 add_anchor_token(')');
6447 add_anchor_token(',');
6449 expression->va_starte.ap = parse_assignment_expression();
6450 rem_anchor_token(',');
6452 expression_t *const param = parse_assignment_expression();
6453 expression->va_starte.parameter = param;
6454 rem_anchor_token(')');
6457 if (!current_function) {
6458 errorf(&expression->base.source_position, "'va_start' used outside of function");
6459 } else if (!current_function->base.type->function.variadic) {
6460 errorf(&expression->base.source_position, "'va_start' used in non-variadic function");
6461 } else if (!is_last_parameter(param)) {
6462 errorf(¶m->base.source_position, "second argument of 'va_start' must be last parameter of the current function");
6469 * Parses a __builtin_va_arg() expression.
6471 static expression_t *parse_va_arg(void)
6473 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6475 eat(T___builtin_va_arg);
6477 add_anchor_token(')');
6478 add_anchor_token(',');
6481 ap.expression = parse_assignment_expression();
6482 expression->va_arge.ap = ap.expression;
6483 check_call_argument(type_valist, &ap, 1);
6485 rem_anchor_token(',');
6487 expression->base.type = parse_typename();
6488 rem_anchor_token(')');
6495 * Parses a __builtin_va_copy() expression.
6497 static expression_t *parse_va_copy(void)
6499 expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
6501 eat(T___builtin_va_copy);
6503 add_anchor_token(')');
6504 add_anchor_token(',');
6506 expression_t *dst = parse_assignment_expression();
6507 assign_error_t error = semantic_assign(type_valist, dst);
6508 report_assign_error(error, type_valist, dst, "call argument 1",
6509 &dst->base.source_position);
6510 expression->va_copye.dst = dst;
6512 rem_anchor_token(',');
6515 call_argument_t src;
6516 src.expression = parse_assignment_expression();
6517 check_call_argument(type_valist, &src, 2);
6518 expression->va_copye.src = src.expression;
6519 rem_anchor_token(')');
6526 * Parses a __builtin_constant_p() expression.
6528 static expression_t *parse_builtin_constant(void)
6530 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6532 eat(T___builtin_constant_p);
6534 add_anchor_token(')');
6536 expression->builtin_constant.value = parse_assignment_expression();
6537 rem_anchor_token(')');
6539 expression->base.type = type_int;
6545 * Parses a __builtin_types_compatible_p() expression.
6547 static expression_t *parse_builtin_types_compatible(void)
6549 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
6551 eat(T___builtin_types_compatible_p);
6553 add_anchor_token(')');
6554 add_anchor_token(',');
6556 expression->builtin_types_compatible.left = parse_typename();
6557 rem_anchor_token(',');
6559 expression->builtin_types_compatible.right = parse_typename();
6560 rem_anchor_token(')');
6562 expression->base.type = type_int;
6568 * Parses a __builtin_is_*() compare expression.
6570 static expression_t *parse_compare_builtin(void)
6572 expression_kind_t kind;
6573 switch (token.kind) {
6574 case T___builtin_isgreater: kind = EXPR_BINARY_ISGREATER; break;
6575 case T___builtin_isgreaterequal: kind = EXPR_BINARY_ISGREATEREQUAL; break;
6576 case T___builtin_isless: kind = EXPR_BINARY_ISLESS; break;
6577 case T___builtin_islessequal: kind = EXPR_BINARY_ISLESSEQUAL; break;
6578 case T___builtin_islessgreater: kind = EXPR_BINARY_ISLESSGREATER; break;
6579 case T___builtin_isunordered: kind = EXPR_BINARY_ISUNORDERED; break;
6580 default: internal_errorf(HERE, "invalid compare builtin found");
6582 expression_t *const expression = allocate_expression_zero(kind);
6585 add_anchor_token(')');
6586 add_anchor_token(',');
6588 expression->binary.left = parse_assignment_expression();
6589 rem_anchor_token(',');
6591 expression->binary.right = parse_assignment_expression();
6592 rem_anchor_token(')');
6595 type_t *const orig_type_left = expression->binary.left->base.type;
6596 type_t *const orig_type_right = expression->binary.right->base.type;
6598 type_t *const type_left = skip_typeref(orig_type_left);
6599 type_t *const type_right = skip_typeref(orig_type_right);
6600 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6601 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6602 type_error_incompatible("invalid operands in comparison",
6603 &expression->base.source_position, orig_type_left, orig_type_right);
6606 semantic_comparison(&expression->binary);
6613 * Parses a MS assume() expression.
6615 static expression_t *parse_assume(void)
6617 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
6621 add_anchor_token(')');
6623 expression->unary.value = parse_assignment_expression();
6624 rem_anchor_token(')');
6627 expression->base.type = type_void;
6632 * Return the label for the current symbol or create a new one.
6634 static label_t *get_label(char const *const context)
6636 assert(current_function != NULL);
6638 symbol_t *const sym = expect_identifier(context, NULL);
6642 entity_t *label = get_entity(sym, NAMESPACE_LABEL);
6643 /* If we find a local label, we already created the declaration. */
6644 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
6645 if (label->base.parent_scope != current_scope) {
6646 assert(label->base.parent_scope->depth < current_scope->depth);
6647 current_function->goto_to_outer = true;
6649 } else if (label == NULL || label->base.parent_scope != ¤t_function->parameters) {
6650 /* There is no matching label in the same function, so create a new one. */
6651 source_position_t const nowhere = { NULL, 0, 0, false };
6652 label = allocate_entity_zero(ENTITY_LABEL, NAMESPACE_LABEL, sym, &nowhere);
6656 return &label->label;
6660 * Parses a GNU && label address expression.
6662 static expression_t *parse_label_address(void)
6664 source_position_t const source_position = *HERE;
6667 label_t *const label = get_label("while parsing label address");
6669 return create_error_expression();
6672 label->address_taken = true;
6674 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
6675 expression->base.source_position = source_position;
6677 /* label address is treated as a void pointer */
6678 expression->base.type = type_void_ptr;
6679 expression->label_address.label = label;
6684 * Parse a microsoft __noop expression.
6686 static expression_t *parse_noop_expression(void)
6688 /* the result is a (int)0 */
6689 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_MS_NOOP);
6690 literal->base.type = type_int;
6691 literal->literal.value.begin = "__noop";
6692 literal->literal.value.size = 6;
6696 if (token.kind == '(') {
6697 /* parse arguments */
6699 add_anchor_token(')');
6700 add_anchor_token(',');
6702 if (token.kind != ')') do {
6703 (void)parse_assignment_expression();
6704 } while (next_if(','));
6706 rem_anchor_token(',');
6707 rem_anchor_token(')');
6715 * Parses a primary expression.
6717 static expression_t *parse_primary_expression(void)
6719 switch (token.kind) {
6720 case T_false: return parse_boolean_literal(false);
6721 case T_true: return parse_boolean_literal(true);
6722 case T_NUMBER: return parse_number_literal();
6723 case T_CHARACTER_CONSTANT: return parse_character_constant();
6724 case T_STRING_LITERAL: return parse_string_literal();
6725 case T___func__: return parse_function_keyword(FUNCNAME_FUNCTION);
6726 case T___PRETTY_FUNCTION__: return parse_function_keyword(FUNCNAME_PRETTY_FUNCTION);
6727 case T___FUNCSIG__: return parse_function_keyword(FUNCNAME_FUNCSIG);
6728 case T___FUNCDNAME__: return parse_function_keyword(FUNCNAME_FUNCDNAME);
6729 case T___builtin_offsetof: return parse_offsetof();
6730 case T___builtin_va_start: return parse_va_start();
6731 case T___builtin_va_arg: return parse_va_arg();
6732 case T___builtin_va_copy: return parse_va_copy();
6733 case T___builtin_isgreater:
6734 case T___builtin_isgreaterequal:
6735 case T___builtin_isless:
6736 case T___builtin_islessequal:
6737 case T___builtin_islessgreater:
6738 case T___builtin_isunordered: return parse_compare_builtin();
6739 case T___builtin_constant_p: return parse_builtin_constant();
6740 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
6741 case T__assume: return parse_assume();
6744 return parse_label_address();
6747 case '(': return parse_parenthesized_expression();
6748 case T___noop: return parse_noop_expression();
6750 /* Gracefully handle type names while parsing expressions. */
6752 return parse_reference();
6754 if (!is_typedef_symbol(token.base.symbol)) {
6755 return parse_reference();
6759 source_position_t const pos = *HERE;
6760 declaration_specifiers_t specifiers;
6761 parse_declaration_specifiers(&specifiers);
6762 type_t const *const type = parse_abstract_declarator(specifiers.type);
6763 errorf(&pos, "encountered type '%T' while parsing expression", type);
6764 return create_error_expression();
6768 errorf(HERE, "unexpected token %K, expected an expression", &token);
6770 return create_error_expression();
6773 static expression_t *parse_array_expression(expression_t *left)
6775 expression_t *const expr = allocate_expression_zero(EXPR_ARRAY_ACCESS);
6776 array_access_expression_t *const arr = &expr->array_access;
6779 add_anchor_token(']');
6781 expression_t *const inside = parse_expression();
6783 type_t *const orig_type_left = left->base.type;
6784 type_t *const orig_type_inside = inside->base.type;
6786 type_t *const type_left = skip_typeref(orig_type_left);
6787 type_t *const type_inside = skip_typeref(orig_type_inside);
6793 if (is_type_pointer(type_left)) {
6796 idx_type = type_inside;
6797 res_type = type_left->pointer.points_to;
6799 } else if (is_type_pointer(type_inside)) {
6800 arr->flipped = true;
6803 idx_type = type_left;
6804 res_type = type_inside->pointer.points_to;
6806 res_type = automatic_type_conversion(res_type);
6807 if (!is_type_integer(idx_type)) {
6808 errorf(&idx->base.source_position, "array subscript must have integer type");
6809 } else if (is_type_atomic(idx_type, ATOMIC_TYPE_CHAR)) {
6810 source_position_t const *const pos = &idx->base.source_position;
6811 warningf(WARN_CHAR_SUBSCRIPTS, pos, "array subscript has char type");
6814 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
6815 errorf(&expr->base.source_position, "invalid types '%T[%T]' for array access", orig_type_left, orig_type_inside);
6817 res_type = type_error_type;
6822 arr->array_ref = ref;
6824 arr->base.type = res_type;
6826 rem_anchor_token(']');
6831 static bool is_bitfield(const expression_t *expression)
6833 return expression->kind == EXPR_SELECT
6834 && expression->select.compound_entry->compound_member.bitfield;
6837 static expression_t *parse_typeprop(expression_kind_t const kind)
6839 expression_t *tp_expression = allocate_expression_zero(kind);
6840 tp_expression->base.type = type_size_t;
6842 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
6845 expression_t *expression;
6846 if (token.kind == '(' && is_declaration_specifier(look_ahead(1))) {
6847 source_position_t const pos = *HERE;
6849 add_anchor_token(')');
6850 orig_type = parse_typename();
6851 rem_anchor_token(')');
6854 if (token.kind == '{') {
6855 /* It was not sizeof(type) after all. It is sizeof of an expression
6856 * starting with a compound literal */
6857 expression = parse_compound_literal(&pos, orig_type);
6858 goto typeprop_expression;
6861 expression = parse_subexpression(PREC_UNARY);
6863 typeprop_expression:
6864 if (is_bitfield(expression)) {
6865 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6866 errorf(&tp_expression->base.source_position,
6867 "operand of %s expression must not be a bitfield", what);
6870 tp_expression->typeprop.tp_expression = expression;
6872 orig_type = revert_automatic_type_conversion(expression);
6873 expression->base.type = orig_type;
6876 tp_expression->typeprop.type = orig_type;
6877 type_t const* const type = skip_typeref(orig_type);
6878 char const* wrong_type = NULL;
6879 if (is_type_incomplete(type)) {
6880 if (!is_type_void(type) || !GNU_MODE)
6881 wrong_type = "incomplete";
6882 } else if (type->kind == TYPE_FUNCTION) {
6884 /* function types are allowed (and return 1) */
6885 source_position_t const *const pos = &tp_expression->base.source_position;
6886 char const *const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6887 warningf(WARN_OTHER, pos, "%s expression with function argument returns invalid result", what);
6889 wrong_type = "function";
6893 if (wrong_type != NULL) {
6894 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6895 errorf(&tp_expression->base.source_position,
6896 "operand of %s expression must not be of %s type '%T'",
6897 what, wrong_type, orig_type);
6900 return tp_expression;
6903 static expression_t *parse_sizeof(void)
6905 return parse_typeprop(EXPR_SIZEOF);
6908 static expression_t *parse_alignof(void)
6910 return parse_typeprop(EXPR_ALIGNOF);
6913 static expression_t *parse_select_expression(expression_t *addr)
6915 assert(token.kind == '.' || token.kind == T_MINUSGREATER);
6916 bool select_left_arrow = (token.kind == T_MINUSGREATER);
6917 source_position_t const pos = *HERE;
6920 symbol_t *const symbol = expect_identifier("while parsing select", NULL);
6922 return create_error_expression();
6924 type_t *const orig_type = addr->base.type;
6925 type_t *const type = skip_typeref(orig_type);
6928 bool saw_error = false;
6929 if (is_type_pointer(type)) {
6930 if (!select_left_arrow) {
6932 "request for member '%Y' in something not a struct or union, but '%T'",
6936 type_left = skip_typeref(type->pointer.points_to);
6938 if (select_left_arrow && is_type_valid(type)) {
6939 errorf(&pos, "left hand side of '->' is not a pointer, but '%T'", orig_type);
6945 if (!is_type_compound(type_left)) {
6946 if (is_type_valid(type_left) && !saw_error) {
6948 "request for member '%Y' in something not a struct or union, but '%T'",
6951 return create_error_expression();
6954 compound_t *compound = type_left->compound.compound;
6955 if (!compound->complete) {
6956 errorf(&pos, "request for member '%Y' in incomplete type '%T'",
6958 return create_error_expression();
6961 type_qualifiers_t qualifiers = type_left->base.qualifiers;
6962 expression_t *result =
6963 find_create_select(&pos, addr, qualifiers, compound, symbol);
6965 if (result == NULL) {
6966 errorf(&pos, "'%T' has no member named '%Y'", orig_type, symbol);
6967 return create_error_expression();
6973 static void check_call_argument(type_t *expected_type,
6974 call_argument_t *argument, unsigned pos)
6976 type_t *expected_type_skip = skip_typeref(expected_type);
6977 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
6978 expression_t *arg_expr = argument->expression;
6979 type_t *arg_type = skip_typeref(arg_expr->base.type);
6981 /* handle transparent union gnu extension */
6982 if (is_type_union(expected_type_skip)
6983 && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
6984 compound_t *union_decl = expected_type_skip->compound.compound;
6985 type_t *best_type = NULL;
6986 entity_t *entry = union_decl->members.entities;
6987 for ( ; entry != NULL; entry = entry->base.next) {
6988 assert(is_declaration(entry));
6989 type_t *decl_type = entry->declaration.type;
6990 error = semantic_assign(decl_type, arg_expr);
6991 if (error == ASSIGN_ERROR_INCOMPATIBLE
6992 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
6995 if (error == ASSIGN_SUCCESS) {
6996 best_type = decl_type;
6997 } else if (best_type == NULL) {
6998 best_type = decl_type;
7002 if (best_type != NULL) {
7003 expected_type = best_type;
7007 error = semantic_assign(expected_type, arg_expr);
7008 argument->expression = create_implicit_cast(arg_expr, expected_type);
7010 if (error != ASSIGN_SUCCESS) {
7011 /* report exact scope in error messages (like "in argument 3") */
7013 snprintf(buf, sizeof(buf), "call argument %u", pos);
7014 report_assign_error(error, expected_type, arg_expr, buf,
7015 &arg_expr->base.source_position);
7017 type_t *const promoted_type = get_default_promoted_type(arg_type);
7018 if (!types_compatible(expected_type_skip, promoted_type) &&
7019 !types_compatible(expected_type_skip, type_void_ptr) &&
7020 !types_compatible(type_void_ptr, promoted_type)) {
7021 /* Deliberately show the skipped types in this warning */
7022 source_position_t const *const apos = &arg_expr->base.source_position;
7023 warningf(WARN_TRADITIONAL, apos, "passing call argument %u as '%T' rather than '%T' due to prototype", pos, expected_type_skip, promoted_type);
7029 * Handle the semantic restrictions of builtin calls
7031 static void handle_builtin_argument_restrictions(call_expression_t *call)
7033 entity_t *entity = call->function->reference.entity;
7034 switch (entity->function.btk) {
7036 switch (entity->function.b.firm_builtin_kind) {
7037 case ir_bk_return_address:
7038 case ir_bk_frame_address: {
7039 /* argument must be constant */
7040 call_argument_t *argument = call->arguments;
7042 if (is_constant_expression(argument->expression) == EXPR_CLASS_VARIABLE) {
7043 errorf(&call->base.source_position,
7044 "argument of '%Y' must be a constant expression",
7045 call->function->reference.entity->base.symbol);
7049 case ir_bk_prefetch:
7050 /* second and third argument must be constant if existent */
7051 if (call->arguments == NULL)
7053 call_argument_t *rw = call->arguments->next;
7054 call_argument_t *locality = NULL;
7057 if (is_constant_expression(rw->expression) == EXPR_CLASS_VARIABLE) {
7058 errorf(&call->base.source_position,
7059 "second argument of '%Y' must be a constant expression",
7060 call->function->reference.entity->base.symbol);
7062 locality = rw->next;
7064 if (locality != NULL) {
7065 if (is_constant_expression(locality->expression) == EXPR_CLASS_VARIABLE) {
7066 errorf(&call->base.source_position,
7067 "third argument of '%Y' must be a constant expression",
7068 call->function->reference.entity->base.symbol);
7070 locality = rw->next;
7077 case BUILTIN_OBJECT_SIZE:
7078 if (call->arguments == NULL)
7081 call_argument_t *arg = call->arguments->next;
7082 if (arg != NULL && is_constant_expression(arg->expression) == EXPR_CLASS_VARIABLE) {
7083 errorf(&call->base.source_position,
7084 "second argument of '%Y' must be a constant expression",
7085 call->function->reference.entity->base.symbol);
7094 * Parse a call expression, ie. expression '( ... )'.
7096 * @param expression the function address
7098 static expression_t *parse_call_expression(expression_t *expression)
7100 expression_t *result = allocate_expression_zero(EXPR_CALL);
7101 call_expression_t *call = &result->call;
7102 call->function = expression;
7104 type_t *const orig_type = expression->base.type;
7105 type_t *const type = skip_typeref(orig_type);
7107 function_type_t *function_type = NULL;
7108 if (is_type_pointer(type)) {
7109 type_t *const to_type = skip_typeref(type->pointer.points_to);
7111 if (is_type_function(to_type)) {
7112 function_type = &to_type->function;
7113 call->base.type = function_type->return_type;
7117 if (function_type == NULL && is_type_valid(type)) {
7119 "called object '%E' (type '%T') is not a pointer to a function",
7120 expression, orig_type);
7123 /* parse arguments */
7125 add_anchor_token(')');
7126 add_anchor_token(',');
7128 if (token.kind != ')') {
7129 call_argument_t **anchor = &call->arguments;
7131 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7132 argument->expression = parse_assignment_expression();
7135 anchor = &argument->next;
7136 } while (next_if(','));
7138 rem_anchor_token(',');
7139 rem_anchor_token(')');
7142 if (function_type == NULL)
7145 /* check type and count of call arguments */
7146 function_parameter_t *parameter = function_type->parameters;
7147 call_argument_t *argument = call->arguments;
7148 if (!function_type->unspecified_parameters) {
7149 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7150 parameter = parameter->next, argument = argument->next) {
7151 check_call_argument(parameter->type, argument, ++pos);
7154 if (parameter != NULL) {
7155 errorf(&expression->base.source_position, "too few arguments to function '%E'", expression);
7156 } else if (argument != NULL && !function_type->variadic) {
7157 errorf(&argument->expression->base.source_position, "too many arguments to function '%E'", expression);
7161 /* do default promotion for other arguments */
7162 for (; argument != NULL; argument = argument->next) {
7163 type_t *argument_type = argument->expression->base.type;
7164 if (!is_type_object(skip_typeref(argument_type))) {
7165 errorf(&argument->expression->base.source_position,
7166 "call argument '%E' must not be void", argument->expression);
7169 argument_type = get_default_promoted_type(argument_type);
7171 argument->expression
7172 = create_implicit_cast(argument->expression, argument_type);
7177 if (is_type_compound(skip_typeref(function_type->return_type))) {
7178 source_position_t const *const pos = &expression->base.source_position;
7179 warningf(WARN_AGGREGATE_RETURN, pos, "function call has aggregate value");
7182 if (expression->kind == EXPR_REFERENCE) {
7183 reference_expression_t *reference = &expression->reference;
7184 if (reference->entity->kind == ENTITY_FUNCTION &&
7185 reference->entity->function.btk != BUILTIN_NONE)
7186 handle_builtin_argument_restrictions(call);
7192 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7194 static bool same_compound_type(const type_t *type1, const type_t *type2)
7197 is_type_compound(type1) &&
7198 type1->kind == type2->kind &&
7199 type1->compound.compound == type2->compound.compound;
7202 static expression_t const *get_reference_address(expression_t const *expr)
7204 bool regular_take_address = true;
7206 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7207 expr = expr->unary.value;
7209 regular_take_address = false;
7212 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7215 expr = expr->unary.value;
7218 if (expr->kind != EXPR_REFERENCE)
7221 /* special case for functions which are automatically converted to a
7222 * pointer to function without an extra TAKE_ADDRESS operation */
7223 if (!regular_take_address &&
7224 expr->reference.entity->kind != ENTITY_FUNCTION) {
7231 static void warn_reference_address_as_bool(expression_t const* expr)
7233 expr = get_reference_address(expr);
7235 source_position_t const *const pos = &expr->base.source_position;
7236 entity_t const *const ent = expr->reference.entity;
7237 warningf(WARN_ADDRESS, pos, "the address of '%N' will always evaluate as 'true'", ent);
7241 static void warn_assignment_in_condition(const expression_t *const expr)
7243 if (expr->base.kind != EXPR_BINARY_ASSIGN)
7245 if (expr->base.parenthesized)
7247 source_position_t const *const pos = &expr->base.source_position;
7248 warningf(WARN_PARENTHESES, pos, "suggest parentheses around assignment used as truth value");
7251 static void semantic_condition(expression_t const *const expr,
7252 char const *const context)
7254 type_t *const type = skip_typeref(expr->base.type);
7255 if (is_type_scalar(type)) {
7256 warn_reference_address_as_bool(expr);
7257 warn_assignment_in_condition(expr);
7258 } else if (is_type_valid(type)) {
7259 errorf(&expr->base.source_position,
7260 "%s must have scalar type", context);
7265 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7267 * @param expression the conditional expression
7269 static expression_t *parse_conditional_expression(expression_t *expression)
7271 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7273 conditional_expression_t *conditional = &result->conditional;
7274 conditional->condition = expression;
7277 add_anchor_token(':');
7279 /* §6.5.15:2 The first operand shall have scalar type. */
7280 semantic_condition(expression, "condition of conditional operator");
7282 expression_t *true_expression = expression;
7283 bool gnu_cond = false;
7284 if (GNU_MODE && token.kind == ':') {
7287 true_expression = parse_expression();
7289 rem_anchor_token(':');
7291 expression_t *false_expression =
7292 parse_subexpression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7294 type_t *const orig_true_type = true_expression->base.type;
7295 type_t *const orig_false_type = false_expression->base.type;
7296 type_t *const true_type = skip_typeref(orig_true_type);
7297 type_t *const false_type = skip_typeref(orig_false_type);
7300 source_position_t const *const pos = &conditional->base.source_position;
7301 type_t *result_type;
7302 if (is_type_void(true_type) || is_type_void(false_type)) {
7303 /* ISO/IEC 14882:1998(E) §5.16:2 */
7304 if (true_expression->kind == EXPR_UNARY_THROW) {
7305 result_type = false_type;
7306 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7307 result_type = true_type;
7309 if (!is_type_void(true_type) || !is_type_void(false_type)) {
7310 warningf(WARN_OTHER, pos, "ISO C forbids conditional expression with only one void side");
7312 result_type = type_void;
7314 } else if (is_type_arithmetic(true_type)
7315 && is_type_arithmetic(false_type)) {
7316 result_type = semantic_arithmetic(true_type, false_type);
7317 } else if (same_compound_type(true_type, false_type)) {
7318 /* just take 1 of the 2 types */
7319 result_type = true_type;
7320 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7321 type_t *pointer_type;
7323 expression_t *other_expression;
7324 if (is_type_pointer(true_type) &&
7325 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7326 pointer_type = true_type;
7327 other_type = false_type;
7328 other_expression = false_expression;
7330 pointer_type = false_type;
7331 other_type = true_type;
7332 other_expression = true_expression;
7335 if (is_null_pointer_constant(other_expression)) {
7336 result_type = pointer_type;
7337 } else if (is_type_pointer(other_type)) {
7338 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7339 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7342 if (is_type_void(to1) || is_type_void(to2)) {
7344 } else if (types_compatible(get_unqualified_type(to1),
7345 get_unqualified_type(to2))) {
7348 warningf(WARN_OTHER, pos, "pointer types '%T' and '%T' in conditional expression are incompatible", true_type, false_type);
7352 type_t *const type =
7353 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7354 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7355 } else if (is_type_integer(other_type)) {
7356 warningf(WARN_OTHER, pos, "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7357 result_type = pointer_type;
7359 goto types_incompatible;
7363 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7364 type_error_incompatible("while parsing conditional", pos, true_type, false_type);
7366 result_type = type_error_type;
7369 conditional->true_expression
7370 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7371 conditional->false_expression
7372 = create_implicit_cast(false_expression, result_type);
7373 conditional->base.type = result_type;
7378 * Parse an extension expression.
7380 static expression_t *parse_extension(void)
7383 expression_t *expression = parse_subexpression(PREC_UNARY);
7389 * Parse a __builtin_classify_type() expression.
7391 static expression_t *parse_builtin_classify_type(void)
7393 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7394 result->base.type = type_int;
7396 eat(T___builtin_classify_type);
7398 add_anchor_token(')');
7400 expression_t *expression = parse_expression();
7401 rem_anchor_token(')');
7403 result->classify_type.type_expression = expression;
7409 * Parse a delete expression
7410 * ISO/IEC 14882:1998(E) §5.3.5
7412 static expression_t *parse_delete(void)
7414 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7415 result->base.type = type_void;
7420 result->kind = EXPR_UNARY_DELETE_ARRAY;
7424 expression_t *const value = parse_subexpression(PREC_CAST);
7425 result->unary.value = value;
7427 type_t *const type = skip_typeref(value->base.type);
7428 if (!is_type_pointer(type)) {
7429 if (is_type_valid(type)) {
7430 errorf(&value->base.source_position,
7431 "operand of delete must have pointer type");
7433 } else if (is_type_void(skip_typeref(type->pointer.points_to))) {
7434 source_position_t const *const pos = &value->base.source_position;
7435 warningf(WARN_OTHER, pos, "deleting 'void*' is undefined");
7442 * Parse a throw expression
7443 * ISO/IEC 14882:1998(E) §15:1
7445 static expression_t *parse_throw(void)
7447 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7448 result->base.type = type_void;
7452 expression_t *value = NULL;
7453 switch (token.kind) {
7455 value = parse_assignment_expression();
7456 /* ISO/IEC 14882:1998(E) §15.1:3 */
7457 type_t *const orig_type = value->base.type;
7458 type_t *const type = skip_typeref(orig_type);
7459 if (is_type_incomplete(type)) {
7460 errorf(&value->base.source_position,
7461 "cannot throw object of incomplete type '%T'", orig_type);
7462 } else if (is_type_pointer(type)) {
7463 type_t *const points_to = skip_typeref(type->pointer.points_to);
7464 if (is_type_incomplete(points_to) && !is_type_void(points_to)) {
7465 errorf(&value->base.source_position,
7466 "cannot throw pointer to incomplete type '%T'", orig_type);
7474 result->unary.value = value;
7479 static bool check_pointer_arithmetic(const source_position_t *source_position,
7480 type_t *pointer_type,
7481 type_t *orig_pointer_type)
7483 type_t *points_to = pointer_type->pointer.points_to;
7484 points_to = skip_typeref(points_to);
7486 if (is_type_incomplete(points_to)) {
7487 if (!GNU_MODE || !is_type_void(points_to)) {
7488 errorf(source_position,
7489 "arithmetic with pointer to incomplete type '%T' not allowed",
7493 warningf(WARN_POINTER_ARITH, source_position, "pointer of type '%T' used in arithmetic", orig_pointer_type);
7495 } else if (is_type_function(points_to)) {
7497 errorf(source_position,
7498 "arithmetic with pointer to function type '%T' not allowed",
7502 warningf(WARN_POINTER_ARITH, source_position, "pointer to a function '%T' used in arithmetic", orig_pointer_type);
7508 static bool is_lvalue(const expression_t *expression)
7510 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
7511 switch (expression->kind) {
7512 case EXPR_ARRAY_ACCESS:
7513 case EXPR_COMPOUND_LITERAL:
7514 case EXPR_REFERENCE:
7516 case EXPR_UNARY_DEREFERENCE:
7520 type_t *type = skip_typeref(expression->base.type);
7522 /* ISO/IEC 14882:1998(E) §3.10:3 */
7523 is_type_reference(type) ||
7524 /* Claim it is an lvalue, if the type is invalid. There was a parse
7525 * error before, which maybe prevented properly recognizing it as
7527 !is_type_valid(type);
7532 static void semantic_incdec(unary_expression_t *expression)
7534 type_t *const orig_type = expression->value->base.type;
7535 type_t *const type = skip_typeref(orig_type);
7536 if (is_type_pointer(type)) {
7537 if (!check_pointer_arithmetic(&expression->base.source_position,
7541 } else if (!is_type_real(type) && is_type_valid(type)) {
7542 /* TODO: improve error message */
7543 errorf(&expression->base.source_position,
7544 "operation needs an arithmetic or pointer type");
7547 if (!is_lvalue(expression->value)) {
7548 /* TODO: improve error message */
7549 errorf(&expression->base.source_position, "lvalue required as operand");
7551 expression->base.type = orig_type;
7554 static void promote_unary_int_expr(unary_expression_t *const expr, type_t *const type)
7556 type_t *const res_type = promote_integer(type);
7557 expr->base.type = res_type;
7558 expr->value = create_implicit_cast(expr->value, res_type);
7561 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
7563 type_t *const orig_type = expression->value->base.type;
7564 type_t *const type = skip_typeref(orig_type);
7565 if (!is_type_arithmetic(type)) {
7566 if (is_type_valid(type)) {
7567 /* TODO: improve error message */
7568 errorf(&expression->base.source_position,
7569 "operation needs an arithmetic type");
7572 } else if (is_type_integer(type)) {
7573 promote_unary_int_expr(expression, type);
7575 expression->base.type = orig_type;
7579 static void semantic_unexpr_plus(unary_expression_t *expression)
7581 semantic_unexpr_arithmetic(expression);
7582 source_position_t const *const pos = &expression->base.source_position;
7583 warningf(WARN_TRADITIONAL, pos, "traditional C rejects the unary plus operator");
7586 static void semantic_not(unary_expression_t *expression)
7588 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
7589 semantic_condition(expression->value, "operand of !");
7590 expression->base.type = c_mode & _CXX ? type_bool : type_int;
7593 static void semantic_unexpr_integer(unary_expression_t *expression)
7595 type_t *const orig_type = expression->value->base.type;
7596 type_t *const type = skip_typeref(orig_type);
7597 if (!is_type_integer(type)) {
7598 if (is_type_valid(type)) {
7599 errorf(&expression->base.source_position,
7600 "operand of ~ must be of integer type");
7605 promote_unary_int_expr(expression, type);
7608 static void semantic_dereference(unary_expression_t *expression)
7610 type_t *const orig_type = expression->value->base.type;
7611 type_t *const type = skip_typeref(orig_type);
7612 if (!is_type_pointer(type)) {
7613 if (is_type_valid(type)) {
7614 errorf(&expression->base.source_position,
7615 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
7620 type_t *result_type = type->pointer.points_to;
7621 result_type = automatic_type_conversion(result_type);
7622 expression->base.type = result_type;
7626 * Record that an address is taken (expression represents an lvalue).
7628 * @param expression the expression
7629 * @param may_be_register if true, the expression might be an register
7631 static void set_address_taken(expression_t *expression, bool may_be_register)
7633 if (expression->kind != EXPR_REFERENCE)
7636 entity_t *const entity = expression->reference.entity;
7638 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
7641 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
7642 && !may_be_register) {
7643 source_position_t const *const pos = &expression->base.source_position;
7644 errorf(pos, "address of register '%N' requested", entity);
7647 entity->variable.address_taken = true;
7651 * Check the semantic of the address taken expression.
7653 static void semantic_take_addr(unary_expression_t *expression)
7655 expression_t *value = expression->value;
7656 value->base.type = revert_automatic_type_conversion(value);
7658 type_t *orig_type = value->base.type;
7659 type_t *type = skip_typeref(orig_type);
7660 if (!is_type_valid(type))
7664 if (!is_lvalue(value)) {
7665 errorf(&expression->base.source_position, "'&' requires an lvalue");
7667 if (is_bitfield(value)) {
7668 errorf(&expression->base.source_position,
7669 "'&' not allowed on bitfield");
7672 set_address_taken(value, false);
7674 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
7677 #define CREATE_UNARY_EXPRESSION_PARSER(token_kind, unexpression_type, sfunc) \
7678 static expression_t *parse_##unexpression_type(void) \
7680 expression_t *unary_expression \
7681 = allocate_expression_zero(unexpression_type); \
7683 unary_expression->unary.value = parse_subexpression(PREC_UNARY); \
7685 sfunc(&unary_expression->unary); \
7687 return unary_expression; \
7690 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
7691 semantic_unexpr_arithmetic)
7692 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
7693 semantic_unexpr_plus)
7694 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
7696 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
7697 semantic_dereference)
7698 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
7700 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
7701 semantic_unexpr_integer)
7702 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
7704 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
7707 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_kind, unexpression_type, \
7709 static expression_t *parse_##unexpression_type(expression_t *left) \
7711 expression_t *unary_expression \
7712 = allocate_expression_zero(unexpression_type); \
7714 unary_expression->unary.value = left; \
7716 sfunc(&unary_expression->unary); \
7718 return unary_expression; \
7721 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
7722 EXPR_UNARY_POSTFIX_INCREMENT,
7724 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
7725 EXPR_UNARY_POSTFIX_DECREMENT,
7728 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
7730 /* TODO: handle complex + imaginary types */
7732 type_left = get_unqualified_type(type_left);
7733 type_right = get_unqualified_type(type_right);
7735 /* §6.3.1.8 Usual arithmetic conversions */
7736 if (type_left == type_long_double || type_right == type_long_double) {
7737 return type_long_double;
7738 } else if (type_left == type_double || type_right == type_double) {
7740 } else if (type_left == type_float || type_right == type_float) {
7744 type_left = promote_integer(type_left);
7745 type_right = promote_integer(type_right);
7747 if (type_left == type_right)
7750 bool const signed_left = is_type_signed(type_left);
7751 bool const signed_right = is_type_signed(type_right);
7752 unsigned const rank_left = get_akind_rank(get_akind(type_left));
7753 unsigned const rank_right = get_akind_rank(get_akind(type_right));
7755 if (signed_left == signed_right)
7756 return rank_left >= rank_right ? type_left : type_right;
7760 atomic_type_kind_t s_akind;
7761 atomic_type_kind_t u_akind;
7766 u_type = type_right;
7768 s_type = type_right;
7771 s_akind = get_akind(s_type);
7772 u_akind = get_akind(u_type);
7773 s_rank = get_akind_rank(s_akind);
7774 u_rank = get_akind_rank(u_akind);
7776 if (u_rank >= s_rank)
7779 if (get_atomic_type_size(s_akind) > get_atomic_type_size(u_akind))
7783 case ATOMIC_TYPE_INT: return type_unsigned_int;
7784 case ATOMIC_TYPE_LONG: return type_unsigned_long;
7785 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
7787 default: panic("invalid atomic type");
7792 * Check the semantic restrictions for a binary expression.
7794 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
7796 expression_t *const left = expression->left;
7797 expression_t *const right = expression->right;
7798 type_t *const orig_type_left = left->base.type;
7799 type_t *const orig_type_right = right->base.type;
7800 type_t *const type_left = skip_typeref(orig_type_left);
7801 type_t *const type_right = skip_typeref(orig_type_right);
7803 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
7804 /* TODO: improve error message */
7805 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7806 errorf(&expression->base.source_position,
7807 "operation needs arithmetic types");
7812 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7813 expression->left = create_implicit_cast(left, arithmetic_type);
7814 expression->right = create_implicit_cast(right, arithmetic_type);
7815 expression->base.type = arithmetic_type;
7818 static void semantic_binexpr_integer(binary_expression_t *const expression)
7820 expression_t *const left = expression->left;
7821 expression_t *const right = expression->right;
7822 type_t *const orig_type_left = left->base.type;
7823 type_t *const orig_type_right = right->base.type;
7824 type_t *const type_left = skip_typeref(orig_type_left);
7825 type_t *const type_right = skip_typeref(orig_type_right);
7827 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
7828 /* TODO: improve error message */
7829 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7830 errorf(&expression->base.source_position,
7831 "operation needs integer types");
7836 type_t *const result_type = semantic_arithmetic(type_left, type_right);
7837 expression->left = create_implicit_cast(left, result_type);
7838 expression->right = create_implicit_cast(right, result_type);
7839 expression->base.type = result_type;
7842 static void warn_div_by_zero(binary_expression_t const *const expression)
7844 if (!is_type_integer(expression->base.type))
7847 expression_t const *const right = expression->right;
7848 /* The type of the right operand can be different for /= */
7849 if (is_type_integer(right->base.type) &&
7850 is_constant_expression(right) == EXPR_CLASS_CONSTANT &&
7851 !fold_constant_to_bool(right)) {
7852 source_position_t const *const pos = &expression->base.source_position;
7853 warningf(WARN_DIV_BY_ZERO, pos, "division by zero");
7858 * Check the semantic restrictions for a div/mod expression.
7860 static void semantic_divmod_arithmetic(binary_expression_t *expression)
7862 semantic_binexpr_arithmetic(expression);
7863 warn_div_by_zero(expression);
7866 static void warn_addsub_in_shift(const expression_t *const expr)
7868 if (expr->base.parenthesized)
7872 switch (expr->kind) {
7873 case EXPR_BINARY_ADD: op = '+'; break;
7874 case EXPR_BINARY_SUB: op = '-'; break;
7878 source_position_t const *const pos = &expr->base.source_position;
7879 warningf(WARN_PARENTHESES, pos, "suggest parentheses around '%c' inside shift", op);
7882 static bool semantic_shift(binary_expression_t *expression)
7884 expression_t *const left = expression->left;
7885 expression_t *const right = expression->right;
7886 type_t *const orig_type_left = left->base.type;
7887 type_t *const orig_type_right = right->base.type;
7888 type_t * type_left = skip_typeref(orig_type_left);
7889 type_t * type_right = skip_typeref(orig_type_right);
7891 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
7892 /* TODO: improve error message */
7893 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7894 errorf(&expression->base.source_position,
7895 "operands of shift operation must have integer types");
7900 type_left = promote_integer(type_left);
7902 if (is_constant_expression(right) == EXPR_CLASS_CONSTANT) {
7903 source_position_t const *const pos = &right->base.source_position;
7904 long const count = fold_constant_to_int(right);
7906 warningf(WARN_OTHER, pos, "shift count must be non-negative");
7907 } else if ((unsigned long)count >=
7908 get_atomic_type_size(type_left->atomic.akind) * 8) {
7909 warningf(WARN_OTHER, pos, "shift count must be less than type width");
7913 type_right = promote_integer(type_right);
7914 expression->right = create_implicit_cast(right, type_right);
7919 static void semantic_shift_op(binary_expression_t *expression)
7921 expression_t *const left = expression->left;
7922 expression_t *const right = expression->right;
7924 if (!semantic_shift(expression))
7927 warn_addsub_in_shift(left);
7928 warn_addsub_in_shift(right);
7930 type_t *const orig_type_left = left->base.type;
7931 type_t * type_left = skip_typeref(orig_type_left);
7933 type_left = promote_integer(type_left);
7934 expression->left = create_implicit_cast(left, type_left);
7935 expression->base.type = type_left;
7938 static void semantic_add(binary_expression_t *expression)
7940 expression_t *const left = expression->left;
7941 expression_t *const right = expression->right;
7942 type_t *const orig_type_left = left->base.type;
7943 type_t *const orig_type_right = right->base.type;
7944 type_t *const type_left = skip_typeref(orig_type_left);
7945 type_t *const type_right = skip_typeref(orig_type_right);
7948 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7949 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7950 expression->left = create_implicit_cast(left, arithmetic_type);
7951 expression->right = create_implicit_cast(right, arithmetic_type);
7952 expression->base.type = arithmetic_type;
7953 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
7954 check_pointer_arithmetic(&expression->base.source_position,
7955 type_left, orig_type_left);
7956 expression->base.type = type_left;
7957 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
7958 check_pointer_arithmetic(&expression->base.source_position,
7959 type_right, orig_type_right);
7960 expression->base.type = type_right;
7961 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
7962 errorf(&expression->base.source_position,
7963 "invalid operands to binary + ('%T', '%T')",
7964 orig_type_left, orig_type_right);
7968 static void semantic_sub(binary_expression_t *expression)
7970 expression_t *const left = expression->left;
7971 expression_t *const right = expression->right;
7972 type_t *const orig_type_left = left->base.type;
7973 type_t *const orig_type_right = right->base.type;
7974 type_t *const type_left = skip_typeref(orig_type_left);
7975 type_t *const type_right = skip_typeref(orig_type_right);
7976 source_position_t const *const pos = &expression->base.source_position;
7979 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7980 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7981 expression->left = create_implicit_cast(left, arithmetic_type);
7982 expression->right = create_implicit_cast(right, arithmetic_type);
7983 expression->base.type = arithmetic_type;
7984 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
7985 check_pointer_arithmetic(&expression->base.source_position,
7986 type_left, orig_type_left);
7987 expression->base.type = type_left;
7988 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
7989 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
7990 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
7991 if (!types_compatible(unqual_left, unqual_right)) {
7993 "subtracting pointers to incompatible types '%T' and '%T'",
7994 orig_type_left, orig_type_right);
7995 } else if (!is_type_object(unqual_left)) {
7996 if (!is_type_void(unqual_left)) {
7997 errorf(pos, "subtracting pointers to non-object types '%T'",
8000 warningf(WARN_OTHER, pos, "subtracting pointers to void");
8003 expression->base.type = type_ptrdiff_t;
8004 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8005 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8006 orig_type_left, orig_type_right);
8010 static void warn_string_literal_address(expression_t const* expr)
8012 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8013 expr = expr->unary.value;
8014 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8016 expr = expr->unary.value;
8019 if (expr->kind == EXPR_STRING_LITERAL) {
8020 source_position_t const *const pos = &expr->base.source_position;
8021 warningf(WARN_ADDRESS, pos, "comparison with string literal results in unspecified behaviour");
8025 static bool maybe_negative(expression_t const *const expr)
8027 switch (is_constant_expression(expr)) {
8028 case EXPR_CLASS_ERROR: return false;
8029 case EXPR_CLASS_CONSTANT: return constant_is_negative(expr);
8030 default: return true;
8034 static void warn_comparison(source_position_t const *const pos, expression_t const *const expr, expression_t const *const other)
8036 warn_string_literal_address(expr);
8038 expression_t const* const ref = get_reference_address(expr);
8039 if (ref != NULL && is_null_pointer_constant(other)) {
8040 entity_t const *const ent = ref->reference.entity;
8041 warningf(WARN_ADDRESS, pos, "the address of '%N' will never be NULL", ent);
8044 if (!expr->base.parenthesized) {
8045 switch (expr->base.kind) {
8046 case EXPR_BINARY_LESS:
8047 case EXPR_BINARY_GREATER:
8048 case EXPR_BINARY_LESSEQUAL:
8049 case EXPR_BINARY_GREATEREQUAL:
8050 case EXPR_BINARY_NOTEQUAL:
8051 case EXPR_BINARY_EQUAL:
8052 warningf(WARN_PARENTHESES, pos, "comparisons like 'x <= y < z' do not have their mathematical meaning");
8061 * Check the semantics of comparison expressions.
8063 * @param expression The expression to check.
8065 static void semantic_comparison(binary_expression_t *expression)
8067 source_position_t const *const pos = &expression->base.source_position;
8068 expression_t *const left = expression->left;
8069 expression_t *const right = expression->right;
8071 warn_comparison(pos, left, right);
8072 warn_comparison(pos, right, left);
8074 type_t *orig_type_left = left->base.type;
8075 type_t *orig_type_right = right->base.type;
8076 type_t *type_left = skip_typeref(orig_type_left);
8077 type_t *type_right = skip_typeref(orig_type_right);
8079 /* TODO non-arithmetic types */
8080 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8081 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8083 /* test for signed vs unsigned compares */
8084 if (is_type_integer(arithmetic_type)) {
8085 bool const signed_left = is_type_signed(type_left);
8086 bool const signed_right = is_type_signed(type_right);
8087 if (signed_left != signed_right) {
8088 /* FIXME long long needs better const folding magic */
8089 /* TODO check whether constant value can be represented by other type */
8090 if ((signed_left && maybe_negative(left)) ||
8091 (signed_right && maybe_negative(right))) {
8092 warningf(WARN_SIGN_COMPARE, pos, "comparison between signed and unsigned");
8097 expression->left = create_implicit_cast(left, arithmetic_type);
8098 expression->right = create_implicit_cast(right, arithmetic_type);
8099 expression->base.type = arithmetic_type;
8100 if ((expression->base.kind == EXPR_BINARY_EQUAL ||
8101 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8102 is_type_float(arithmetic_type)) {
8103 warningf(WARN_FLOAT_EQUAL, pos, "comparing floating point with == or != is unsafe");
8105 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8106 /* TODO check compatibility */
8107 } else if (is_type_pointer(type_left)) {
8108 expression->right = create_implicit_cast(right, type_left);
8109 } else if (is_type_pointer(type_right)) {
8110 expression->left = create_implicit_cast(left, type_right);
8111 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8112 type_error_incompatible("invalid operands in comparison", pos, type_left, type_right);
8114 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8118 * Checks if a compound type has constant fields.
8120 static bool has_const_fields(const compound_type_t *type)
8122 compound_t *compound = type->compound;
8123 entity_t *entry = compound->members.entities;
8125 for (; entry != NULL; entry = entry->base.next) {
8126 if (!is_declaration(entry))
8129 const type_t *decl_type = skip_typeref(entry->declaration.type);
8130 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8137 static bool is_valid_assignment_lhs(expression_t const* const left)
8139 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8140 type_t *const type_left = skip_typeref(orig_type_left);
8142 if (!is_lvalue(left)) {
8143 errorf(&left->base.source_position, "left hand side '%E' of assignment is not an lvalue",
8148 if (left->kind == EXPR_REFERENCE
8149 && left->reference.entity->kind == ENTITY_FUNCTION) {
8150 errorf(&left->base.source_position, "cannot assign to function '%E'", left);
8154 if (is_type_array(type_left)) {
8155 errorf(&left->base.source_position, "cannot assign to array '%E'", left);
8158 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8159 errorf(&left->base.source_position, "assignment to read-only location '%E' (type '%T')", left,
8163 if (is_type_incomplete(type_left)) {
8164 errorf(&left->base.source_position, "left-hand side '%E' of assignment has incomplete type '%T'",
8165 left, orig_type_left);
8168 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8169 errorf(&left->base.source_position, "cannot assign to '%E' because compound type '%T' has read-only fields",
8170 left, orig_type_left);
8177 static void semantic_arithmetic_assign(binary_expression_t *expression)
8179 expression_t *left = expression->left;
8180 expression_t *right = expression->right;
8181 type_t *orig_type_left = left->base.type;
8182 type_t *orig_type_right = right->base.type;
8184 if (!is_valid_assignment_lhs(left))
8187 type_t *type_left = skip_typeref(orig_type_left);
8188 type_t *type_right = skip_typeref(orig_type_right);
8190 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8191 /* TODO: improve error message */
8192 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8193 errorf(&expression->base.source_position,
8194 "operation needs arithmetic types");
8199 /* combined instructions are tricky. We can't create an implicit cast on
8200 * the left side, because we need the uncasted form for the store.
8201 * The ast2firm pass has to know that left_type must be right_type
8202 * for the arithmetic operation and create a cast by itself */
8203 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8204 expression->right = create_implicit_cast(right, arithmetic_type);
8205 expression->base.type = type_left;
8208 static void semantic_divmod_assign(binary_expression_t *expression)
8210 semantic_arithmetic_assign(expression);
8211 warn_div_by_zero(expression);
8214 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8216 expression_t *const left = expression->left;
8217 expression_t *const right = expression->right;
8218 type_t *const orig_type_left = left->base.type;
8219 type_t *const orig_type_right = right->base.type;
8220 type_t *const type_left = skip_typeref(orig_type_left);
8221 type_t *const type_right = skip_typeref(orig_type_right);
8223 if (!is_valid_assignment_lhs(left))
8226 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8227 /* combined instructions are tricky. We can't create an implicit cast on
8228 * the left side, because we need the uncasted form for the store.
8229 * The ast2firm pass has to know that left_type must be right_type
8230 * for the arithmetic operation and create a cast by itself */
8231 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8232 expression->right = create_implicit_cast(right, arithmetic_type);
8233 expression->base.type = type_left;
8234 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8235 check_pointer_arithmetic(&expression->base.source_position,
8236 type_left, orig_type_left);
8237 expression->base.type = type_left;
8238 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8239 errorf(&expression->base.source_position,
8240 "incompatible types '%T' and '%T' in assignment",
8241 orig_type_left, orig_type_right);
8245 static void semantic_integer_assign(binary_expression_t *expression)
8247 expression_t *left = expression->left;
8248 expression_t *right = expression->right;
8249 type_t *orig_type_left = left->base.type;
8250 type_t *orig_type_right = right->base.type;
8252 if (!is_valid_assignment_lhs(left))
8255 type_t *type_left = skip_typeref(orig_type_left);
8256 type_t *type_right = skip_typeref(orig_type_right);
8258 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8259 /* TODO: improve error message */
8260 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8261 errorf(&expression->base.source_position,
8262 "operation needs integer types");
8267 /* combined instructions are tricky. We can't create an implicit cast on
8268 * the left side, because we need the uncasted form for the store.
8269 * The ast2firm pass has to know that left_type must be right_type
8270 * for the arithmetic operation and create a cast by itself */
8271 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8272 expression->right = create_implicit_cast(right, arithmetic_type);
8273 expression->base.type = type_left;
8276 static void semantic_shift_assign(binary_expression_t *expression)
8278 expression_t *left = expression->left;
8280 if (!is_valid_assignment_lhs(left))
8283 if (!semantic_shift(expression))
8286 expression->base.type = skip_typeref(left->base.type);
8289 static void warn_logical_and_within_or(const expression_t *const expr)
8291 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8293 if (expr->base.parenthesized)
8295 source_position_t const *const pos = &expr->base.source_position;
8296 warningf(WARN_PARENTHESES, pos, "suggest parentheses around && within ||");
8300 * Check the semantic restrictions of a logical expression.
8302 static void semantic_logical_op(binary_expression_t *expression)
8304 /* §6.5.13:2 Each of the operands shall have scalar type.
8305 * §6.5.14:2 Each of the operands shall have scalar type. */
8306 semantic_condition(expression->left, "left operand of logical operator");
8307 semantic_condition(expression->right, "right operand of logical operator");
8308 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR) {
8309 warn_logical_and_within_or(expression->left);
8310 warn_logical_and_within_or(expression->right);
8312 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8316 * Check the semantic restrictions of a binary assign expression.
8318 static void semantic_binexpr_assign(binary_expression_t *expression)
8320 expression_t *left = expression->left;
8321 type_t *orig_type_left = left->base.type;
8323 if (!is_valid_assignment_lhs(left))
8326 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8327 report_assign_error(error, orig_type_left, expression->right,
8328 "assignment", &left->base.source_position);
8329 expression->right = create_implicit_cast(expression->right, orig_type_left);
8330 expression->base.type = orig_type_left;
8334 * Determine if the outermost operation (or parts thereof) of the given
8335 * expression has no effect in order to generate a warning about this fact.
8336 * Therefore in some cases this only examines some of the operands of the
8337 * expression (see comments in the function and examples below).
8339 * f() + 23; // warning, because + has no effect
8340 * x || f(); // no warning, because x controls execution of f()
8341 * x ? y : f(); // warning, because y has no effect
8342 * (void)x; // no warning to be able to suppress the warning
8343 * This function can NOT be used for an "expression has definitely no effect"-
8345 static bool expression_has_effect(const expression_t *const expr)
8347 switch (expr->kind) {
8348 case EXPR_ERROR: return true; /* do NOT warn */
8349 case EXPR_REFERENCE: return false;
8350 case EXPR_ENUM_CONSTANT: return false;
8351 case EXPR_LABEL_ADDRESS: return false;
8353 /* suppress the warning for microsoft __noop operations */
8354 case EXPR_LITERAL_MS_NOOP: return true;
8355 case EXPR_LITERAL_BOOLEAN:
8356 case EXPR_LITERAL_CHARACTER:
8357 case EXPR_LITERAL_INTEGER:
8358 case EXPR_LITERAL_FLOATINGPOINT:
8359 case EXPR_STRING_LITERAL: return false;
8362 const call_expression_t *const call = &expr->call;
8363 if (call->function->kind != EXPR_REFERENCE)
8366 switch (call->function->reference.entity->function.btk) {
8367 /* FIXME: which builtins have no effect? */
8368 default: return true;
8372 /* Generate the warning if either the left or right hand side of a
8373 * conditional expression has no effect */
8374 case EXPR_CONDITIONAL: {
8375 conditional_expression_t const *const cond = &expr->conditional;
8376 expression_t const *const t = cond->true_expression;
8378 (t == NULL || expression_has_effect(t)) &&
8379 expression_has_effect(cond->false_expression);
8382 case EXPR_SELECT: return false;
8383 case EXPR_ARRAY_ACCESS: return false;
8384 case EXPR_SIZEOF: return false;
8385 case EXPR_CLASSIFY_TYPE: return false;
8386 case EXPR_ALIGNOF: return false;
8388 case EXPR_FUNCNAME: return false;
8389 case EXPR_BUILTIN_CONSTANT_P: return false;
8390 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8391 case EXPR_OFFSETOF: return false;
8392 case EXPR_VA_START: return true;
8393 case EXPR_VA_ARG: return true;
8394 case EXPR_VA_COPY: return true;
8395 case EXPR_STATEMENT: return true; // TODO
8396 case EXPR_COMPOUND_LITERAL: return false;
8398 case EXPR_UNARY_NEGATE: return false;
8399 case EXPR_UNARY_PLUS: return false;
8400 case EXPR_UNARY_BITWISE_NEGATE: return false;
8401 case EXPR_UNARY_NOT: return false;
8402 case EXPR_UNARY_DEREFERENCE: return false;
8403 case EXPR_UNARY_TAKE_ADDRESS: return false;
8404 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8405 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8406 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8407 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8409 /* Treat void casts as if they have an effect in order to being able to
8410 * suppress the warning */
8411 case EXPR_UNARY_CAST: {
8412 type_t *const type = skip_typeref(expr->base.type);
8413 return is_type_void(type);
8416 case EXPR_UNARY_ASSUME: return true;
8417 case EXPR_UNARY_DELETE: return true;
8418 case EXPR_UNARY_DELETE_ARRAY: return true;
8419 case EXPR_UNARY_THROW: return true;
8421 case EXPR_BINARY_ADD: return false;
8422 case EXPR_BINARY_SUB: return false;
8423 case EXPR_BINARY_MUL: return false;
8424 case EXPR_BINARY_DIV: return false;
8425 case EXPR_BINARY_MOD: return false;
8426 case EXPR_BINARY_EQUAL: return false;
8427 case EXPR_BINARY_NOTEQUAL: return false;
8428 case EXPR_BINARY_LESS: return false;
8429 case EXPR_BINARY_LESSEQUAL: return false;
8430 case EXPR_BINARY_GREATER: return false;
8431 case EXPR_BINARY_GREATEREQUAL: return false;
8432 case EXPR_BINARY_BITWISE_AND: return false;
8433 case EXPR_BINARY_BITWISE_OR: return false;
8434 case EXPR_BINARY_BITWISE_XOR: return false;
8435 case EXPR_BINARY_SHIFTLEFT: return false;
8436 case EXPR_BINARY_SHIFTRIGHT: return false;
8437 case EXPR_BINARY_ASSIGN: return true;
8438 case EXPR_BINARY_MUL_ASSIGN: return true;
8439 case EXPR_BINARY_DIV_ASSIGN: return true;
8440 case EXPR_BINARY_MOD_ASSIGN: return true;
8441 case EXPR_BINARY_ADD_ASSIGN: return true;
8442 case EXPR_BINARY_SUB_ASSIGN: return true;
8443 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8444 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8445 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8446 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8447 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8449 /* Only examine the right hand side of && and ||, because the left hand
8450 * side already has the effect of controlling the execution of the right
8452 case EXPR_BINARY_LOGICAL_AND:
8453 case EXPR_BINARY_LOGICAL_OR:
8454 /* Only examine the right hand side of a comma expression, because the left
8455 * hand side has a separate warning */
8456 case EXPR_BINARY_COMMA:
8457 return expression_has_effect(expr->binary.right);
8459 case EXPR_BINARY_ISGREATER: return false;
8460 case EXPR_BINARY_ISGREATEREQUAL: return false;
8461 case EXPR_BINARY_ISLESS: return false;
8462 case EXPR_BINARY_ISLESSEQUAL: return false;
8463 case EXPR_BINARY_ISLESSGREATER: return false;
8464 case EXPR_BINARY_ISUNORDERED: return false;
8467 internal_errorf(HERE, "unexpected expression");
8470 static void semantic_comma(binary_expression_t *expression)
8472 const expression_t *const left = expression->left;
8473 if (!expression_has_effect(left)) {
8474 source_position_t const *const pos = &left->base.source_position;
8475 warningf(WARN_UNUSED_VALUE, pos, "left-hand operand of comma expression has no effect");
8477 expression->base.type = expression->right->base.type;
8481 * @param prec_r precedence of the right operand
8483 #define CREATE_BINEXPR_PARSER(token_kind, binexpression_type, prec_r, sfunc) \
8484 static expression_t *parse_##binexpression_type(expression_t *left) \
8486 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8487 binexpr->binary.left = left; \
8490 expression_t *right = parse_subexpression(prec_r); \
8492 binexpr->binary.right = right; \
8493 sfunc(&binexpr->binary); \
8498 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8499 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
8500 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
8501 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8502 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8503 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8504 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8505 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
8506 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
8507 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
8508 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
8509 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
8510 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
8511 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_integer)
8512 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_integer)
8513 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_integer)
8514 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8515 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8516 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
8517 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8518 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8519 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8520 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8521 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8522 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8523 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8524 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8525 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8526 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8527 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
8530 static expression_t *parse_subexpression(precedence_t precedence)
8532 expression_parser_function_t *parser
8533 = &expression_parsers[token.kind];
8536 if (parser->parser != NULL) {
8537 left = parser->parser();
8539 left = parse_primary_expression();
8541 assert(left != NULL);
8544 parser = &expression_parsers[token.kind];
8545 if (parser->infix_parser == NULL)
8547 if (parser->infix_precedence < precedence)
8550 left = parser->infix_parser(left);
8552 assert(left != NULL);
8559 * Parse an expression.
8561 static expression_t *parse_expression(void)
8563 return parse_subexpression(PREC_EXPRESSION);
8567 * Register a parser for a prefix-like operator.
8569 * @param parser the parser function
8570 * @param token_kind the token type of the prefix token
8572 static void register_expression_parser(parse_expression_function parser,
8575 expression_parser_function_t *entry = &expression_parsers[token_kind];
8577 assert(!entry->parser);
8578 entry->parser = parser;
8582 * Register a parser for an infix operator with given precedence.
8584 * @param parser the parser function
8585 * @param token_kind the token type of the infix operator
8586 * @param precedence the precedence of the operator
8588 static void register_infix_parser(parse_expression_infix_function parser,
8589 int token_kind, precedence_t precedence)
8591 expression_parser_function_t *entry = &expression_parsers[token_kind];
8593 assert(!entry->infix_parser);
8594 entry->infix_parser = parser;
8595 entry->infix_precedence = precedence;
8599 * Initialize the expression parsers.
8601 static void init_expression_parsers(void)
8603 memset(&expression_parsers, 0, sizeof(expression_parsers));
8605 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
8606 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
8607 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
8608 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
8609 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
8610 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
8611 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
8612 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
8613 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
8614 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
8615 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
8616 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
8617 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
8618 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
8619 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
8620 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
8621 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
8622 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
8623 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
8624 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
8625 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
8626 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
8627 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
8628 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
8629 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
8630 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
8631 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
8632 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
8633 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
8634 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
8635 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
8636 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
8637 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
8638 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
8639 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
8640 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
8641 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
8643 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
8644 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
8645 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
8646 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
8647 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
8648 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
8649 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
8650 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
8651 register_expression_parser(parse_sizeof, T_sizeof);
8652 register_expression_parser(parse_alignof, T___alignof__);
8653 register_expression_parser(parse_extension, T___extension__);
8654 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
8655 register_expression_parser(parse_delete, T_delete);
8656 register_expression_parser(parse_throw, T_throw);
8660 * Parse a asm statement arguments specification.
8662 static asm_argument_t *parse_asm_arguments(bool is_out)
8664 asm_argument_t *result = NULL;
8665 asm_argument_t **anchor = &result;
8667 while (token.kind == T_STRING_LITERAL || token.kind == '[') {
8668 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
8671 add_anchor_token(']');
8672 argument->symbol = expect_identifier("while parsing asm argument", NULL);
8673 rem_anchor_token(']');
8675 if (!argument->symbol)
8679 argument->constraints = parse_string_literals("asm argument");
8680 add_anchor_token(')');
8682 expression_t *expression = parse_expression();
8683 rem_anchor_token(')');
8685 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
8686 * change size or type representation (e.g. int -> long is ok, but
8687 * int -> float is not) */
8688 if (expression->kind == EXPR_UNARY_CAST) {
8689 type_t *const type = expression->base.type;
8690 type_kind_t const kind = type->kind;
8691 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
8694 if (kind == TYPE_ATOMIC) {
8695 atomic_type_kind_t const akind = type->atomic.akind;
8696 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8697 size = get_atomic_type_size(akind);
8699 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8700 size = get_type_size(type_void_ptr);
8704 expression_t *const value = expression->unary.value;
8705 type_t *const value_type = value->base.type;
8706 type_kind_t const value_kind = value_type->kind;
8708 unsigned value_flags;
8709 unsigned value_size;
8710 if (value_kind == TYPE_ATOMIC) {
8711 atomic_type_kind_t const value_akind = value_type->atomic.akind;
8712 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8713 value_size = get_atomic_type_size(value_akind);
8714 } else if (value_kind == TYPE_POINTER) {
8715 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8716 value_size = get_type_size(type_void_ptr);
8721 if (value_flags != flags || value_size != size)
8725 } while (expression->kind == EXPR_UNARY_CAST);
8729 if (!is_lvalue(expression)) {
8730 errorf(&expression->base.source_position,
8731 "asm output argument is not an lvalue");
8734 if (argument->constraints.begin[0] == '=')
8735 determine_lhs_ent(expression, NULL);
8737 mark_vars_read(expression, NULL);
8739 mark_vars_read(expression, NULL);
8741 argument->expression = expression;
8744 set_address_taken(expression, true);
8747 anchor = &argument->next;
8757 * Parse a asm statement clobber specification.
8759 static asm_clobber_t *parse_asm_clobbers(void)
8761 asm_clobber_t *result = NULL;
8762 asm_clobber_t **anchor = &result;
8764 while (token.kind == T_STRING_LITERAL) {
8765 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
8766 clobber->clobber = parse_string_literals(NULL);
8769 anchor = &clobber->next;
8779 * Parse an asm statement.
8781 static statement_t *parse_asm_statement(void)
8783 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
8784 asm_statement_t *asm_statement = &statement->asms;
8787 add_anchor_token(')');
8788 add_anchor_token(':');
8789 add_anchor_token(T_STRING_LITERAL);
8791 if (next_if(T_volatile))
8792 asm_statement->is_volatile = true;
8795 rem_anchor_token(T_STRING_LITERAL);
8796 asm_statement->asm_text = parse_string_literals("asm statement");
8799 asm_statement->outputs = parse_asm_arguments(true);
8802 asm_statement->inputs = parse_asm_arguments(false);
8804 rem_anchor_token(':');
8806 asm_statement->clobbers = parse_asm_clobbers();
8808 rem_anchor_token(')');
8812 if (asm_statement->outputs == NULL) {
8813 /* GCC: An 'asm' instruction without any output operands will be treated
8814 * identically to a volatile 'asm' instruction. */
8815 asm_statement->is_volatile = true;
8821 static statement_t *parse_label_inner_statement(statement_t const *const label, char const *const label_kind)
8823 statement_t *inner_stmt;
8824 switch (token.kind) {
8826 errorf(&label->base.source_position, "%s at end of compound statement", label_kind);
8827 inner_stmt = create_error_statement();
8831 if (label->kind == STATEMENT_LABEL) {
8832 /* Eat an empty statement here, to avoid the warning about an empty
8833 * statement after a label. label:; is commonly used to have a label
8834 * before a closing brace. */
8835 inner_stmt = create_empty_statement();
8842 inner_stmt = parse_statement();
8843 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
8844 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
8845 if (inner_stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
8846 errorf(&inner_stmt->base.source_position, "declaration after %s", label_kind);
8854 * Parse a case statement.
8856 static statement_t *parse_case_statement(void)
8858 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
8859 source_position_t *const pos = &statement->base.source_position;
8862 add_anchor_token(':');
8864 expression_t *expression = parse_expression();
8865 type_t *expression_type = expression->base.type;
8866 type_t *skipped = skip_typeref(expression_type);
8867 if (!is_type_integer(skipped) && is_type_valid(skipped)) {
8868 errorf(pos, "case expression '%E' must have integer type but has type '%T'",
8869 expression, expression_type);
8872 type_t *type = expression_type;
8873 if (current_switch != NULL) {
8874 type_t *switch_type = current_switch->expression->base.type;
8875 if (is_type_valid(switch_type)) {
8876 expression = create_implicit_cast(expression, switch_type);
8880 statement->case_label.expression = expression;
8881 expression_classification_t const expr_class = is_constant_expression(expression);
8882 if (expr_class != EXPR_CLASS_CONSTANT) {
8883 if (expr_class != EXPR_CLASS_ERROR) {
8884 errorf(pos, "case label does not reduce to an integer constant");
8886 statement->case_label.is_bad = true;
8888 long const val = fold_constant_to_int(expression);
8889 statement->case_label.first_case = val;
8890 statement->case_label.last_case = val;
8894 if (next_if(T_DOTDOTDOT)) {
8895 expression_t *end_range = parse_expression();
8896 expression_type = expression->base.type;
8897 skipped = skip_typeref(expression_type);
8898 if (!is_type_integer(skipped) && is_type_valid(skipped)) {
8899 errorf(pos, "case expression '%E' must have integer type but has type '%T'",
8900 expression, expression_type);
8903 end_range = create_implicit_cast(end_range, type);
8904 statement->case_label.end_range = end_range;
8905 expression_classification_t const end_class = is_constant_expression(end_range);
8906 if (end_class != EXPR_CLASS_CONSTANT) {
8907 if (end_class != EXPR_CLASS_ERROR) {
8908 errorf(pos, "case range does not reduce to an integer constant");
8910 statement->case_label.is_bad = true;
8912 long const val = fold_constant_to_int(end_range);
8913 statement->case_label.last_case = val;
8915 if (val < statement->case_label.first_case) {
8916 statement->case_label.is_empty_range = true;
8917 warningf(WARN_OTHER, pos, "empty range specified");
8923 PUSH_PARENT(statement);
8925 rem_anchor_token(':');
8928 if (current_switch != NULL) {
8929 if (! statement->case_label.is_bad) {
8930 /* Check for duplicate case values */
8931 case_label_statement_t *c = &statement->case_label;
8932 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
8933 if (l->is_bad || l->is_empty_range || l->expression == NULL)
8936 if (c->last_case < l->first_case || c->first_case > l->last_case)
8939 errorf(pos, "duplicate case value (previously used %P)",
8940 &l->base.source_position);
8944 /* link all cases into the switch statement */
8945 if (current_switch->last_case == NULL) {
8946 current_switch->first_case = &statement->case_label;
8948 current_switch->last_case->next = &statement->case_label;
8950 current_switch->last_case = &statement->case_label;
8952 errorf(pos, "case label not within a switch statement");
8955 statement->case_label.statement = parse_label_inner_statement(statement, "case label");
8962 * Parse a default statement.
8964 static statement_t *parse_default_statement(void)
8966 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
8970 PUSH_PARENT(statement);
8974 if (current_switch != NULL) {
8975 const case_label_statement_t *def_label = current_switch->default_label;
8976 if (def_label != NULL) {
8977 errorf(&statement->base.source_position, "multiple default labels in one switch (previous declared %P)", &def_label->base.source_position);
8979 current_switch->default_label = &statement->case_label;
8981 /* link all cases into the switch statement */
8982 if (current_switch->last_case == NULL) {
8983 current_switch->first_case = &statement->case_label;
8985 current_switch->last_case->next = &statement->case_label;
8987 current_switch->last_case = &statement->case_label;
8990 errorf(&statement->base.source_position,
8991 "'default' label not within a switch statement");
8994 statement->case_label.statement = parse_label_inner_statement(statement, "default label");
9001 * Parse a label statement.
9003 static statement_t *parse_label_statement(void)
9005 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9006 label_t *const label = get_label(NULL /* Cannot fail, token is T_IDENTIFIER. */);
9007 statement->label.label = label;
9009 PUSH_PARENT(statement);
9011 /* if statement is already set then the label is defined twice,
9012 * otherwise it was just mentioned in a goto/local label declaration so far
9014 source_position_t const* const pos = &statement->base.source_position;
9015 if (label->statement != NULL) {
9016 errorf(pos, "duplicate '%N' (declared %P)", (entity_t const*)label, &label->base.source_position);
9018 label->base.source_position = *pos;
9019 label->statement = statement;
9024 if (token.kind == T___attribute__ && !(c_mode & _CXX)) {
9025 parse_attributes(NULL); // TODO process attributes
9028 statement->label.statement = parse_label_inner_statement(statement, "label");
9030 /* remember the labels in a list for later checking */
9031 *label_anchor = &statement->label;
9032 label_anchor = &statement->label.next;
9038 static statement_t *parse_inner_statement(void)
9040 statement_t *const stmt = parse_statement();
9041 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
9042 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
9043 if (stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
9044 errorf(&stmt->base.source_position, "declaration as inner statement, use {}");
9050 * Parse an expression in parentheses and mark its variables as read.
9052 static expression_t *parse_condition(void)
9054 add_anchor_token(')');
9056 expression_t *const expr = parse_expression();
9057 mark_vars_read(expr, NULL);
9058 rem_anchor_token(')');
9064 * Parse an if statement.
9066 static statement_t *parse_if(void)
9068 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9072 PUSH_PARENT(statement);
9073 PUSH_SCOPE_STATEMENT(&statement->ifs.scope);
9075 add_anchor_token(T_else);
9077 expression_t *const expr = parse_condition();
9078 statement->ifs.condition = expr;
9079 /* §6.8.4.1:1 The controlling expression of an if statement shall have
9081 semantic_condition(expr, "condition of 'if'-statment");
9083 statement_t *const true_stmt = parse_inner_statement();
9084 statement->ifs.true_statement = true_stmt;
9085 rem_anchor_token(T_else);
9087 if (true_stmt->kind == STATEMENT_EMPTY) {
9088 warningf(WARN_EMPTY_BODY, HERE,
9089 "suggest braces around empty body in an ‘if’ statement");
9092 if (next_if(T_else)) {
9093 statement->ifs.false_statement = parse_inner_statement();
9095 if (statement->ifs.false_statement->kind == STATEMENT_EMPTY) {
9096 warningf(WARN_EMPTY_BODY, HERE,
9097 "suggest braces around empty body in an ‘if’ statement");
9099 } else if (true_stmt->kind == STATEMENT_IF &&
9100 true_stmt->ifs.false_statement != NULL) {
9101 source_position_t const *const pos = &true_stmt->base.source_position;
9102 warningf(WARN_PARENTHESES, pos, "suggest explicit braces to avoid ambiguous 'else'");
9111 * Check that all enums are handled in a switch.
9113 * @param statement the switch statement to check
9115 static void check_enum_cases(const switch_statement_t *statement)
9117 if (!is_warn_on(WARN_SWITCH_ENUM))
9119 const type_t *type = skip_typeref(statement->expression->base.type);
9120 if (! is_type_enum(type))
9122 const enum_type_t *enumt = &type->enumt;
9124 /* if we have a default, no warnings */
9125 if (statement->default_label != NULL)
9128 /* FIXME: calculation of value should be done while parsing */
9129 /* TODO: quadratic algorithm here. Change to an n log n one */
9130 long last_value = -1;
9131 const entity_t *entry = enumt->enume->base.next;
9132 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9133 entry = entry->base.next) {
9134 const expression_t *expression = entry->enum_value.value;
9135 long value = expression != NULL ? fold_constant_to_int(expression) : last_value + 1;
9137 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9138 if (l->expression == NULL)
9140 if (l->first_case <= value && value <= l->last_case) {
9146 source_position_t const *const pos = &statement->base.source_position;
9147 warningf(WARN_SWITCH_ENUM, pos, "'%N' not handled in switch", entry);
9154 * Parse a switch statement.
9156 static statement_t *parse_switch(void)
9158 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9162 PUSH_PARENT(statement);
9163 PUSH_SCOPE_STATEMENT(&statement->switchs.scope);
9165 expression_t *const expr = parse_condition();
9166 type_t * type = skip_typeref(expr->base.type);
9167 if (is_type_integer(type)) {
9168 type = promote_integer(type);
9169 if (get_akind_rank(get_akind(type)) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9170 warningf(WARN_TRADITIONAL, &expr->base.source_position, "'%T' switch expression not converted to '%T' in ISO C", type, type_int);
9172 } else if (is_type_valid(type)) {
9173 errorf(&expr->base.source_position,
9174 "switch quantity is not an integer, but '%T'", type);
9175 type = type_error_type;
9177 statement->switchs.expression = create_implicit_cast(expr, type);
9179 switch_statement_t *rem = current_switch;
9180 current_switch = &statement->switchs;
9181 statement->switchs.body = parse_inner_statement();
9182 current_switch = rem;
9184 if (statement->switchs.default_label == NULL) {
9185 warningf(WARN_SWITCH_DEFAULT, &statement->base.source_position, "switch has no default case");
9187 check_enum_cases(&statement->switchs);
9194 static statement_t *parse_loop_body(statement_t *const loop)
9196 statement_t *const rem = current_loop;
9197 current_loop = loop;
9199 statement_t *const body = parse_inner_statement();
9206 * Parse a while statement.
9208 static statement_t *parse_while(void)
9210 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9214 PUSH_PARENT(statement);
9215 PUSH_SCOPE_STATEMENT(&statement->whiles.scope);
9217 expression_t *const cond = parse_condition();
9218 statement->whiles.condition = cond;
9219 /* §6.8.5:2 The controlling expression of an iteration statement shall
9220 * have scalar type. */
9221 semantic_condition(cond, "condition of 'while'-statement");
9223 statement->whiles.body = parse_loop_body(statement);
9231 * Parse a do statement.
9233 static statement_t *parse_do(void)
9235 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9239 PUSH_PARENT(statement);
9240 PUSH_SCOPE_STATEMENT(&statement->do_while.scope);
9242 add_anchor_token(T_while);
9243 statement->do_while.body = parse_loop_body(statement);
9244 rem_anchor_token(T_while);
9247 expression_t *const cond = parse_condition();
9248 statement->do_while.condition = cond;
9249 /* §6.8.5:2 The controlling expression of an iteration statement shall
9250 * have scalar type. */
9251 semantic_condition(cond, "condition of 'do-while'-statement");
9260 * Parse a for statement.
9262 static statement_t *parse_for(void)
9264 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9268 PUSH_PARENT(statement);
9269 PUSH_SCOPE_STATEMENT(&statement->fors.scope);
9271 add_anchor_token(')');
9277 } else if (is_declaration_specifier(&token)) {
9278 parse_declaration(record_entity, DECL_FLAGS_NONE);
9280 add_anchor_token(';');
9281 expression_t *const init = parse_expression();
9282 statement->fors.initialisation = init;
9283 mark_vars_read(init, ENT_ANY);
9284 if (!expression_has_effect(init)) {
9285 warningf(WARN_UNUSED_VALUE, &init->base.source_position, "initialisation of 'for'-statement has no effect");
9287 rem_anchor_token(';');
9293 if (token.kind != ';') {
9294 add_anchor_token(';');
9295 expression_t *const cond = parse_expression();
9296 statement->fors.condition = cond;
9297 /* §6.8.5:2 The controlling expression of an iteration statement
9298 * shall have scalar type. */
9299 semantic_condition(cond, "condition of 'for'-statement");
9300 mark_vars_read(cond, NULL);
9301 rem_anchor_token(';');
9304 if (token.kind != ')') {
9305 expression_t *const step = parse_expression();
9306 statement->fors.step = step;
9307 mark_vars_read(step, ENT_ANY);
9308 if (!expression_has_effect(step)) {
9309 warningf(WARN_UNUSED_VALUE, &step->base.source_position, "step of 'for'-statement has no effect");
9312 rem_anchor_token(')');
9314 statement->fors.body = parse_loop_body(statement);
9322 * Parse a goto statement.
9324 static statement_t *parse_goto(void)
9326 statement_t *statement;
9327 if (GNU_MODE && look_ahead(1)->kind == '*') {
9328 statement = allocate_statement_zero(STATEMENT_COMPUTED_GOTO);
9332 expression_t *expression = parse_expression();
9333 mark_vars_read(expression, NULL);
9335 /* Argh: although documentation says the expression must be of type void*,
9336 * gcc accepts anything that can be casted into void* without error */
9337 type_t *type = expression->base.type;
9339 if (type != type_error_type) {
9340 if (!is_type_pointer(type) && !is_type_integer(type)) {
9341 errorf(&expression->base.source_position,
9342 "cannot convert to a pointer type");
9343 } else if (type != type_void_ptr) {
9344 warningf(WARN_OTHER, &expression->base.source_position, "type of computed goto expression should be 'void*' not '%T'", type);
9346 expression = create_implicit_cast(expression, type_void_ptr);
9349 statement->computed_goto.expression = expression;
9351 statement = allocate_statement_zero(STATEMENT_GOTO);
9354 label_t *const label = get_label("while parsing goto");
9357 statement->gotos.label = label;
9359 /* remember the goto's in a list for later checking */
9360 *goto_anchor = &statement->gotos;
9361 goto_anchor = &statement->gotos.next;
9363 statement->gotos.label = &allocate_entity_zero(ENTITY_LABEL, NAMESPACE_LABEL, sym_anonymous, &builtin_source_position)->label;
9372 * Parse a continue statement.
9374 static statement_t *parse_continue(void)
9376 if (current_loop == NULL) {
9377 errorf(HERE, "continue statement not within loop");
9380 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9388 * Parse a break statement.
9390 static statement_t *parse_break(void)
9392 if (current_switch == NULL && current_loop == NULL) {
9393 errorf(HERE, "break statement not within loop or switch");
9396 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9404 * Parse a __leave statement.
9406 static statement_t *parse_leave_statement(void)
9408 if (current_try == NULL) {
9409 errorf(HERE, "__leave statement not within __try");
9412 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9420 * Check if a given entity represents a local variable.
9422 static bool is_local_variable(const entity_t *entity)
9424 if (entity->kind != ENTITY_VARIABLE)
9427 switch ((storage_class_tag_t) entity->declaration.storage_class) {
9428 case STORAGE_CLASS_AUTO:
9429 case STORAGE_CLASS_REGISTER: {
9430 const type_t *type = skip_typeref(entity->declaration.type);
9431 if (is_type_function(type)) {
9443 * Check if a given expression represents a local variable.
9445 static bool expression_is_local_variable(const expression_t *expression)
9447 if (expression->base.kind != EXPR_REFERENCE) {
9450 const entity_t *entity = expression->reference.entity;
9451 return is_local_variable(entity);
9454 static void err_or_warn(source_position_t const *const pos, char const *const msg)
9456 if (c_mode & _CXX || strict_mode) {
9459 warningf(WARN_OTHER, pos, msg);
9464 * Parse a return statement.
9466 static statement_t *parse_return(void)
9468 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9471 expression_t *return_value = NULL;
9472 if (token.kind != ';') {
9473 return_value = parse_expression();
9474 mark_vars_read(return_value, NULL);
9477 const type_t *const func_type = skip_typeref(current_function->base.type);
9478 assert(is_type_function(func_type));
9479 type_t *const return_type = skip_typeref(func_type->function.return_type);
9481 source_position_t const *const pos = &statement->base.source_position;
9482 if (return_value != NULL) {
9483 type_t *return_value_type = skip_typeref(return_value->base.type);
9485 if (is_type_void(return_type)) {
9486 if (!is_type_void(return_value_type)) {
9487 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
9488 /* Only warn in C mode, because GCC does the same */
9489 err_or_warn(pos, "'return' with a value, in function returning 'void'");
9490 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9491 /* Only warn in C mode, because GCC does the same */
9492 err_or_warn(pos, "'return' with expression in function returning 'void'");
9495 assign_error_t error = semantic_assign(return_type, return_value);
9496 report_assign_error(error, return_type, return_value, "'return'",
9499 return_value = create_implicit_cast(return_value, return_type);
9500 /* check for returning address of a local var */
9501 if (return_value != NULL && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
9502 const expression_t *expression = return_value->unary.value;
9503 if (expression_is_local_variable(expression)) {
9504 warningf(WARN_OTHER, pos, "function returns address of local variable");
9507 } else if (!is_type_void(return_type)) {
9508 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9509 err_or_warn(pos, "'return' without value, in function returning non-void");
9511 statement->returns.value = return_value;
9518 * Parse a declaration statement.
9520 static statement_t *parse_declaration_statement(void)
9522 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9524 entity_t *before = current_scope->last_entity;
9526 parse_external_declaration();
9528 parse_declaration(record_entity, DECL_FLAGS_NONE);
9531 declaration_statement_t *const decl = &statement->declaration;
9532 entity_t *const begin =
9533 before != NULL ? before->base.next : current_scope->entities;
9534 decl->declarations_begin = begin;
9535 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
9541 * Parse an expression statement, ie. expr ';'.
9543 static statement_t *parse_expression_statement(void)
9545 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
9547 expression_t *const expr = parse_expression();
9548 statement->expression.expression = expr;
9549 mark_vars_read(expr, ENT_ANY);
9556 * Parse a microsoft __try { } __finally { } or
9557 * __try{ } __except() { }
9559 static statement_t *parse_ms_try_statment(void)
9561 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
9564 PUSH_PARENT(statement);
9566 ms_try_statement_t *rem = current_try;
9567 current_try = &statement->ms_try;
9568 statement->ms_try.try_statement = parse_compound_statement(false);
9573 if (next_if(T___except)) {
9574 expression_t *const expr = parse_condition();
9575 type_t * type = skip_typeref(expr->base.type);
9576 if (is_type_integer(type)) {
9577 type = promote_integer(type);
9578 } else if (is_type_valid(type)) {
9579 errorf(&expr->base.source_position,
9580 "__expect expression is not an integer, but '%T'", type);
9581 type = type_error_type;
9583 statement->ms_try.except_expression = create_implicit_cast(expr, type);
9584 } else if (!next_if(T__finally)) {
9585 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
9587 statement->ms_try.final_statement = parse_compound_statement(false);
9591 static statement_t *parse_empty_statement(void)
9593 warningf(WARN_EMPTY_STATEMENT, HERE, "statement is empty");
9594 statement_t *const statement = create_empty_statement();
9599 static statement_t *parse_local_label_declaration(void)
9601 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9605 entity_t *begin = NULL;
9606 entity_t *end = NULL;
9607 entity_t **anchor = &begin;
9608 add_anchor_token(';');
9609 add_anchor_token(',');
9611 source_position_t pos;
9612 symbol_t *const symbol = expect_identifier("while parsing local label declaration", &pos);
9614 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
9615 if (entity != NULL && entity->base.parent_scope == current_scope) {
9616 source_position_t const *const ppos = &entity->base.source_position;
9617 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
9619 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL, NAMESPACE_LABEL, symbol, &pos);
9620 entity->base.parent_scope = current_scope;
9623 anchor = &entity->base.next;
9626 environment_push(entity);
9629 } while (next_if(','));
9630 rem_anchor_token(',');
9631 rem_anchor_token(';');
9633 statement->declaration.declarations_begin = begin;
9634 statement->declaration.declarations_end = end;
9638 static void parse_namespace_definition(void)
9642 entity_t *entity = NULL;
9643 symbol_t *symbol = NULL;
9645 if (token.kind == T_IDENTIFIER) {
9646 symbol = token.base.symbol;
9647 entity = get_entity(symbol, NAMESPACE_NORMAL);
9648 if (entity && entity->kind != ENTITY_NAMESPACE) {
9650 if (entity->base.parent_scope == current_scope && is_entity_valid(entity)) {
9651 error_redefined_as_different_kind(HERE, entity, ENTITY_NAMESPACE);
9657 if (entity == NULL) {
9658 entity = allocate_entity_zero(ENTITY_NAMESPACE, NAMESPACE_NORMAL, symbol, HERE);
9659 entity->base.parent_scope = current_scope;
9662 if (token.kind == '=') {
9663 /* TODO: parse namespace alias */
9664 panic("namespace alias definition not supported yet");
9667 environment_push(entity);
9668 append_entity(current_scope, entity);
9670 PUSH_SCOPE(&entity->namespacee.members);
9671 PUSH_CURRENT_ENTITY(entity);
9673 add_anchor_token('}');
9676 rem_anchor_token('}');
9679 POP_CURRENT_ENTITY();
9684 * Parse a statement.
9685 * There's also parse_statement() which additionally checks for
9686 * "statement has no effect" warnings
9688 static statement_t *intern_parse_statement(void)
9690 /* declaration or statement */
9691 statement_t *statement;
9692 switch (token.kind) {
9693 case T_IDENTIFIER: {
9694 token_kind_t la1_type = (token_kind_t)look_ahead(1)->kind;
9695 if (la1_type == ':') {
9696 statement = parse_label_statement();
9697 } else if (is_typedef_symbol(token.base.symbol)) {
9698 statement = parse_declaration_statement();
9700 /* it's an identifier, the grammar says this must be an
9701 * expression statement. However it is common that users mistype
9702 * declaration types, so we guess a bit here to improve robustness
9703 * for incorrect programs */
9707 if (get_entity(token.base.symbol, NAMESPACE_NORMAL) != NULL) {
9709 statement = parse_expression_statement();
9713 statement = parse_declaration_statement();
9721 case T___extension__: {
9722 /* This can be a prefix to a declaration or an expression statement.
9723 * We simply eat it now and parse the rest with tail recursion. */
9725 statement = intern_parse_statement();
9731 statement = parse_declaration_statement();
9735 statement = parse_local_label_declaration();
9738 case ';': statement = parse_empty_statement(); break;
9739 case '{': statement = parse_compound_statement(false); break;
9740 case T___leave: statement = parse_leave_statement(); break;
9741 case T___try: statement = parse_ms_try_statment(); break;
9742 case T_asm: statement = parse_asm_statement(); break;
9743 case T_break: statement = parse_break(); break;
9744 case T_case: statement = parse_case_statement(); break;
9745 case T_continue: statement = parse_continue(); break;
9746 case T_default: statement = parse_default_statement(); break;
9747 case T_do: statement = parse_do(); break;
9748 case T_for: statement = parse_for(); break;
9749 case T_goto: statement = parse_goto(); break;
9750 case T_if: statement = parse_if(); break;
9751 case T_return: statement = parse_return(); break;
9752 case T_switch: statement = parse_switch(); break;
9753 case T_while: statement = parse_while(); break;
9756 statement = parse_expression_statement();
9760 errorf(HERE, "unexpected token %K while parsing statement", &token);
9761 statement = create_error_statement();
9770 * parse a statement and emits "statement has no effect" warning if needed
9771 * (This is really a wrapper around intern_parse_statement with check for 1
9772 * single warning. It is needed, because for statement expressions we have
9773 * to avoid the warning on the last statement)
9775 static statement_t *parse_statement(void)
9777 statement_t *statement = intern_parse_statement();
9779 if (statement->kind == STATEMENT_EXPRESSION) {
9780 expression_t *expression = statement->expression.expression;
9781 if (!expression_has_effect(expression)) {
9782 warningf(WARN_UNUSED_VALUE, &expression->base.source_position, "statement has no effect");
9790 * Parse a compound statement.
9792 static statement_t *parse_compound_statement(bool inside_expression_statement)
9794 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
9796 PUSH_PARENT(statement);
9797 PUSH_SCOPE(&statement->compound.scope);
9800 add_anchor_token('}');
9801 /* tokens, which can start a statement */
9802 /* TODO MS, __builtin_FOO */
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(';');
9810 add_anchor_token('{');
9811 add_anchor_token('~');
9812 add_anchor_token(T_CHARACTER_CONSTANT);
9813 add_anchor_token(T_COLONCOLON);
9814 add_anchor_token(T_IDENTIFIER);
9815 add_anchor_token(T_MINUSMINUS);
9816 add_anchor_token(T_NUMBER);
9817 add_anchor_token(T_PLUSPLUS);
9818 add_anchor_token(T_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___PRETTY_FUNCTION__);
9823 add_anchor_token(T___alignof__);
9824 add_anchor_token(T___attribute__);
9825 add_anchor_token(T___builtin_va_start);
9826 add_anchor_token(T___extension__);
9827 add_anchor_token(T___func__);
9828 add_anchor_token(T___imag__);
9829 add_anchor_token(T___label__);
9830 add_anchor_token(T___real__);
9831 add_anchor_token(T___thread);
9832 add_anchor_token(T_asm);
9833 add_anchor_token(T_auto);
9834 add_anchor_token(T_bool);
9835 add_anchor_token(T_break);
9836 add_anchor_token(T_case);
9837 add_anchor_token(T_char);
9838 add_anchor_token(T_class);
9839 add_anchor_token(T_const);
9840 add_anchor_token(T_const_cast);
9841 add_anchor_token(T_continue);
9842 add_anchor_token(T_default);
9843 add_anchor_token(T_delete);
9844 add_anchor_token(T_double);
9845 add_anchor_token(T_do);
9846 add_anchor_token(T_dynamic_cast);
9847 add_anchor_token(T_enum);
9848 add_anchor_token(T_extern);
9849 add_anchor_token(T_false);
9850 add_anchor_token(T_float);
9851 add_anchor_token(T_for);
9852 add_anchor_token(T_goto);
9853 add_anchor_token(T_if);
9854 add_anchor_token(T_inline);
9855 add_anchor_token(T_int);
9856 add_anchor_token(T_long);
9857 add_anchor_token(T_new);
9858 add_anchor_token(T_operator);
9859 add_anchor_token(T_register);
9860 add_anchor_token(T_reinterpret_cast);
9861 add_anchor_token(T_restrict);
9862 add_anchor_token(T_return);
9863 add_anchor_token(T_short);
9864 add_anchor_token(T_signed);
9865 add_anchor_token(T_sizeof);
9866 add_anchor_token(T_static);
9867 add_anchor_token(T_static_cast);
9868 add_anchor_token(T_struct);
9869 add_anchor_token(T_switch);
9870 add_anchor_token(T_template);
9871 add_anchor_token(T_this);
9872 add_anchor_token(T_throw);
9873 add_anchor_token(T_true);
9874 add_anchor_token(T_try);
9875 add_anchor_token(T_typedef);
9876 add_anchor_token(T_typeid);
9877 add_anchor_token(T_typename);
9878 add_anchor_token(T_typeof);
9879 add_anchor_token(T_union);
9880 add_anchor_token(T_unsigned);
9881 add_anchor_token(T_using);
9882 add_anchor_token(T_void);
9883 add_anchor_token(T_volatile);
9884 add_anchor_token(T_wchar_t);
9885 add_anchor_token(T_while);
9887 statement_t **anchor = &statement->compound.statements;
9888 bool only_decls_so_far = true;
9889 while (token.kind != '}' && token.kind != T_EOF) {
9890 statement_t *sub_statement = intern_parse_statement();
9891 if (sub_statement->kind == STATEMENT_ERROR) {
9895 if (sub_statement->kind != STATEMENT_DECLARATION) {
9896 only_decls_so_far = false;
9897 } else if (!only_decls_so_far) {
9898 source_position_t const *const pos = &sub_statement->base.source_position;
9899 warningf(WARN_DECLARATION_AFTER_STATEMENT, pos, "ISO C90 forbids mixed declarations and code");
9902 *anchor = sub_statement;
9903 anchor = &sub_statement->base.next;
9907 /* look over all statements again to produce no effect warnings */
9908 if (is_warn_on(WARN_UNUSED_VALUE)) {
9909 statement_t *sub_statement = statement->compound.statements;
9910 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
9911 if (sub_statement->kind != STATEMENT_EXPRESSION)
9913 /* don't emit a warning for the last expression in an expression
9914 * statement as it has always an effect */
9915 if (inside_expression_statement && sub_statement->base.next == NULL)
9918 expression_t *expression = sub_statement->expression.expression;
9919 if (!expression_has_effect(expression)) {
9920 warningf(WARN_UNUSED_VALUE, &expression->base.source_position, "statement has no effect");
9925 rem_anchor_token(T_while);
9926 rem_anchor_token(T_wchar_t);
9927 rem_anchor_token(T_volatile);
9928 rem_anchor_token(T_void);
9929 rem_anchor_token(T_using);
9930 rem_anchor_token(T_unsigned);
9931 rem_anchor_token(T_union);
9932 rem_anchor_token(T_typeof);
9933 rem_anchor_token(T_typename);
9934 rem_anchor_token(T_typeid);
9935 rem_anchor_token(T_typedef);
9936 rem_anchor_token(T_try);
9937 rem_anchor_token(T_true);
9938 rem_anchor_token(T_throw);
9939 rem_anchor_token(T_this);
9940 rem_anchor_token(T_template);
9941 rem_anchor_token(T_switch);
9942 rem_anchor_token(T_struct);
9943 rem_anchor_token(T_static_cast);
9944 rem_anchor_token(T_static);
9945 rem_anchor_token(T_sizeof);
9946 rem_anchor_token(T_signed);
9947 rem_anchor_token(T_short);
9948 rem_anchor_token(T_return);
9949 rem_anchor_token(T_restrict);
9950 rem_anchor_token(T_reinterpret_cast);
9951 rem_anchor_token(T_register);
9952 rem_anchor_token(T_operator);
9953 rem_anchor_token(T_new);
9954 rem_anchor_token(T_long);
9955 rem_anchor_token(T_int);
9956 rem_anchor_token(T_inline);
9957 rem_anchor_token(T_if);
9958 rem_anchor_token(T_goto);
9959 rem_anchor_token(T_for);
9960 rem_anchor_token(T_float);
9961 rem_anchor_token(T_false);
9962 rem_anchor_token(T_extern);
9963 rem_anchor_token(T_enum);
9964 rem_anchor_token(T_dynamic_cast);
9965 rem_anchor_token(T_do);
9966 rem_anchor_token(T_double);
9967 rem_anchor_token(T_delete);
9968 rem_anchor_token(T_default);
9969 rem_anchor_token(T_continue);
9970 rem_anchor_token(T_const_cast);
9971 rem_anchor_token(T_const);
9972 rem_anchor_token(T_class);
9973 rem_anchor_token(T_char);
9974 rem_anchor_token(T_case);
9975 rem_anchor_token(T_break);
9976 rem_anchor_token(T_bool);
9977 rem_anchor_token(T_auto);
9978 rem_anchor_token(T_asm);
9979 rem_anchor_token(T___thread);
9980 rem_anchor_token(T___real__);
9981 rem_anchor_token(T___label__);
9982 rem_anchor_token(T___imag__);
9983 rem_anchor_token(T___func__);
9984 rem_anchor_token(T___extension__);
9985 rem_anchor_token(T___builtin_va_start);
9986 rem_anchor_token(T___attribute__);
9987 rem_anchor_token(T___alignof__);
9988 rem_anchor_token(T___PRETTY_FUNCTION__);
9989 rem_anchor_token(T__Imaginary);
9990 rem_anchor_token(T__Complex);
9991 rem_anchor_token(T__Bool);
9992 rem_anchor_token(T_STRING_LITERAL);
9993 rem_anchor_token(T_PLUSPLUS);
9994 rem_anchor_token(T_NUMBER);
9995 rem_anchor_token(T_MINUSMINUS);
9996 rem_anchor_token(T_IDENTIFIER);
9997 rem_anchor_token(T_COLONCOLON);
9998 rem_anchor_token(T_CHARACTER_CONSTANT);
9999 rem_anchor_token('~');
10000 rem_anchor_token('{');
10001 rem_anchor_token(';');
10002 rem_anchor_token('-');
10003 rem_anchor_token('+');
10004 rem_anchor_token('*');
10005 rem_anchor_token('(');
10006 rem_anchor_token('&');
10007 rem_anchor_token('!');
10008 rem_anchor_token('}');
10016 * Check for unused global static functions and variables
10018 static void check_unused_globals(void)
10020 if (!is_warn_on(WARN_UNUSED_FUNCTION) && !is_warn_on(WARN_UNUSED_VARIABLE))
10023 for (const entity_t *entity = file_scope->entities; entity != NULL;
10024 entity = entity->base.next) {
10025 if (!is_declaration(entity))
10028 const declaration_t *declaration = &entity->declaration;
10029 if (declaration->used ||
10030 declaration->modifiers & DM_UNUSED ||
10031 declaration->modifiers & DM_USED ||
10032 declaration->storage_class != STORAGE_CLASS_STATIC)
10037 if (entity->kind == ENTITY_FUNCTION) {
10038 /* inhibit warning for static inline functions */
10039 if (entity->function.is_inline)
10042 why = WARN_UNUSED_FUNCTION;
10043 s = entity->function.statement != NULL ? "defined" : "declared";
10045 why = WARN_UNUSED_VARIABLE;
10049 warningf(why, &declaration->base.source_position, "'%#N' %s but not used", entity, s);
10053 static void parse_global_asm(void)
10055 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10058 add_anchor_token(';');
10059 add_anchor_token(')');
10060 add_anchor_token(T_STRING_LITERAL);
10063 rem_anchor_token(T_STRING_LITERAL);
10064 statement->asms.asm_text = parse_string_literals("global asm");
10065 statement->base.next = unit->global_asm;
10066 unit->global_asm = statement;
10068 rem_anchor_token(')');
10070 rem_anchor_token(';');
10074 static void parse_linkage_specification(void)
10078 source_position_t const pos = *HERE;
10079 char const *const linkage = parse_string_literals(NULL).begin;
10081 linkage_kind_t old_linkage = current_linkage;
10082 linkage_kind_t new_linkage;
10083 if (streq(linkage, "C")) {
10084 new_linkage = LINKAGE_C;
10085 } else if (streq(linkage, "C++")) {
10086 new_linkage = LINKAGE_CXX;
10088 errorf(&pos, "linkage string \"%s\" not recognized", linkage);
10089 new_linkage = LINKAGE_C;
10091 current_linkage = new_linkage;
10093 if (next_if('{')) {
10100 assert(current_linkage == new_linkage);
10101 current_linkage = old_linkage;
10104 static void parse_external(void)
10106 switch (token.kind) {
10108 if (look_ahead(1)->kind == T_STRING_LITERAL) {
10109 parse_linkage_specification();
10111 DECLARATION_START_NO_EXTERN
10113 case T___extension__:
10114 /* tokens below are for implicit int */
10115 case '&': /* & x; -> int& x; (and error later, because C++ has no
10117 case '*': /* * x; -> int* x; */
10118 case '(': /* (x); -> int (x); */
10120 parse_external_declaration();
10126 parse_global_asm();
10130 parse_namespace_definition();
10134 if (!strict_mode) {
10135 warningf(WARN_STRAY_SEMICOLON, HERE, "stray ';' outside of function");
10142 errorf(HERE, "stray %K outside of function", &token);
10143 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10144 eat_until_matching_token(token.kind);
10150 static void parse_externals(void)
10152 add_anchor_token('}');
10153 add_anchor_token(T_EOF);
10156 /* make a copy of the anchor set, so we can check if it is restored after parsing */
10157 unsigned short token_anchor_copy[T_LAST_TOKEN];
10158 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10161 while (token.kind != T_EOF && token.kind != '}') {
10163 for (int i = 0; i < T_LAST_TOKEN; ++i) {
10164 unsigned short count = token_anchor_set[i] - token_anchor_copy[i];
10166 /* the anchor set and its copy differs */
10167 internal_errorf(HERE, "Leaked anchor token %k %d times", i, count);
10170 if (in_gcc_extension) {
10171 /* an gcc extension scope was not closed */
10172 internal_errorf(HERE, "Leaked __extension__");
10179 rem_anchor_token(T_EOF);
10180 rem_anchor_token('}');
10184 * Parse a translation unit.
10186 static void parse_translation_unit(void)
10188 add_anchor_token(T_EOF);
10193 if (token.kind == T_EOF)
10196 errorf(HERE, "stray %K outside of function", &token);
10197 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10198 eat_until_matching_token(token.kind);
10203 void set_default_visibility(elf_visibility_tag_t visibility)
10205 default_visibility = visibility;
10211 * @return the translation unit or NULL if errors occurred.
10213 void start_parsing(void)
10215 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10216 label_stack = NEW_ARR_F(stack_entry_t, 0);
10220 print_to_file(stderr);
10222 assert(unit == NULL);
10223 unit = allocate_ast_zero(sizeof(unit[0]));
10225 assert(file_scope == NULL);
10226 file_scope = &unit->scope;
10228 assert(current_scope == NULL);
10229 scope_push(&unit->scope);
10231 create_gnu_builtins();
10233 create_microsoft_intrinsics();
10236 translation_unit_t *finish_parsing(void)
10238 assert(current_scope == &unit->scope);
10241 assert(file_scope == &unit->scope);
10242 check_unused_globals();
10245 DEL_ARR_F(environment_stack);
10246 DEL_ARR_F(label_stack);
10248 translation_unit_t *result = unit;
10253 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
10254 * are given length one. */
10255 static void complete_incomplete_arrays(void)
10257 size_t n = ARR_LEN(incomplete_arrays);
10258 for (size_t i = 0; i != n; ++i) {
10259 declaration_t *const decl = incomplete_arrays[i];
10260 type_t *const type = skip_typeref(decl->type);
10262 if (!is_type_incomplete(type))
10265 source_position_t const *const pos = &decl->base.source_position;
10266 warningf(WARN_OTHER, pos, "array '%#N' assumed to have one element", (entity_t const*)decl);
10268 type_t *const new_type = duplicate_type(type);
10269 new_type->array.size_constant = true;
10270 new_type->array.has_implicit_size = true;
10271 new_type->array.size = 1;
10273 type_t *const result = identify_new_type(new_type);
10275 decl->type = result;
10279 static void prepare_main_collect2(entity_t *const entity)
10281 PUSH_SCOPE(&entity->function.statement->compound.scope);
10283 // create call to __main
10284 symbol_t *symbol = symbol_table_insert("__main");
10285 entity_t *subsubmain_ent
10286 = create_implicit_function(symbol, &builtin_source_position);
10288 expression_t *ref = allocate_expression_zero(EXPR_REFERENCE);
10289 type_t *ftype = subsubmain_ent->declaration.type;
10290 ref->base.source_position = builtin_source_position;
10291 ref->base.type = make_pointer_type(ftype, TYPE_QUALIFIER_NONE);
10292 ref->reference.entity = subsubmain_ent;
10294 expression_t *call = allocate_expression_zero(EXPR_CALL);
10295 call->base.source_position = builtin_source_position;
10296 call->base.type = type_void;
10297 call->call.function = ref;
10299 statement_t *expr_statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10300 expr_statement->base.source_position = builtin_source_position;
10301 expr_statement->expression.expression = call;
10303 statement_t *statement = entity->function.statement;
10304 assert(statement->kind == STATEMENT_COMPOUND);
10305 compound_statement_t *compounds = &statement->compound;
10307 expr_statement->base.next = compounds->statements;
10308 compounds->statements = expr_statement;
10315 lookahead_bufpos = 0;
10316 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10319 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
10320 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
10321 parse_translation_unit();
10322 complete_incomplete_arrays();
10323 DEL_ARR_F(incomplete_arrays);
10324 incomplete_arrays = NULL;
10328 * Initialize the parser.
10330 void init_parser(void)
10332 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10334 init_expression_parsers();
10335 obstack_init(&temp_obst);
10339 * Terminate the parser.
10341 void exit_parser(void)
10343 obstack_free(&temp_obst, NULL);