2 * This file is part of cparser.
3 * Copyright (C) 2007-2009 Matthias Braun <matze@braunis.de>
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * as published by the Free Software Foundation; either version 2
8 * of the License, or (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
26 #include "adt/strutil.h"
28 #include "diagnostic.h"
29 #include "format_check.h"
35 #include "type_hash.h"
38 #include "attribute_t.h"
39 #include "lang_features.h"
43 #include "adt/bitfiddle.h"
44 #include "adt/error.h"
45 #include "adt/array.h"
47 //#define PRINT_TOKENS
48 #define MAX_LOOKAHEAD 1
53 entity_namespace_t namespc;
56 typedef struct declaration_specifiers_t declaration_specifiers_t;
57 struct declaration_specifiers_t {
58 source_position_t source_position;
59 storage_class_t storage_class;
60 unsigned char alignment; /**< Alignment, 0 if not set. */
62 bool thread_local : 1; /**< GCC __thread */
63 attribute_t *attributes; /**< list of attributes */
68 * An environment for parsing initializers (and compound literals).
70 typedef struct parse_initializer_env_t {
71 type_t *type; /**< the type of the initializer. In case of an
72 array type with unspecified size this gets
73 adjusted to the actual size. */
74 entity_t *entity; /**< the variable that is initialized if any */
75 bool must_be_constant;
76 } parse_initializer_env_t;
78 typedef entity_t* (*parsed_declaration_func) (entity_t *declaration, bool is_definition);
80 /** The current token. */
82 /** The lookahead ring-buffer. */
83 static token_t lookahead_buffer[MAX_LOOKAHEAD];
84 /** Position of the next token in the lookahead buffer. */
85 static size_t lookahead_bufpos;
86 static stack_entry_t *environment_stack = NULL;
87 static stack_entry_t *label_stack = NULL;
88 static scope_t *file_scope = NULL;
89 static scope_t *current_scope = NULL;
90 /** Point to the current function declaration if inside a function. */
91 static function_t *current_function = NULL;
92 static entity_t *current_entity = NULL;
93 static switch_statement_t *current_switch = NULL;
94 static statement_t *current_loop = NULL;
95 static statement_t *current_parent = NULL;
96 static ms_try_statement_t *current_try = NULL;
97 static linkage_kind_t current_linkage;
98 static goto_statement_t *goto_first = NULL;
99 static goto_statement_t **goto_anchor = NULL;
100 static label_statement_t *label_first = NULL;
101 static label_statement_t **label_anchor = NULL;
102 /** current translation unit. */
103 static translation_unit_t *unit = NULL;
104 /** true if we are in an __extension__ context. */
105 static bool in_gcc_extension = false;
106 static struct obstack temp_obst;
107 static entity_t *anonymous_entity;
108 static declaration_t **incomplete_arrays;
109 static elf_visibility_tag_t default_visibility = ELF_VISIBILITY_DEFAULT;
112 #define PUSH_CURRENT_ENTITY(entity) \
113 entity_t *const new_current_entity = (entity); \
114 entity_t *const old_current_entity = current_entity; \
115 ((void)(current_entity = new_current_entity))
116 #define POP_CURRENT_ENTITY() (assert(current_entity == new_current_entity), (void)(current_entity = old_current_entity))
118 #define PUSH_PARENT(stmt) \
119 statement_t *const new_parent = (stmt); \
120 statement_t *const old_parent = current_parent; \
121 ((void)(current_parent = new_parent))
122 #define POP_PARENT() (assert(current_parent == new_parent), (void)(current_parent = old_parent))
124 #define PUSH_SCOPE(scope) \
125 size_t const top = environment_top(); \
126 scope_t *const new_scope = (scope); \
127 scope_t *const old_scope = (new_scope ? scope_push(new_scope) : NULL)
128 #define PUSH_SCOPE_STATEMENT(scope) PUSH_SCOPE(c_mode & (_C99 | _CXX) ? (scope) : NULL)
129 #define POP_SCOPE() (new_scope ? assert(current_scope == new_scope), scope_pop(old_scope), environment_pop_to(top) : (void)0)
131 #define PUSH_EXTENSION() \
133 bool const old_gcc_extension = in_gcc_extension; \
134 while (next_if(T___extension__)) { \
135 in_gcc_extension = true; \
138 #define POP_EXTENSION() \
139 ((void)(in_gcc_extension = old_gcc_extension))
141 /** special symbol used for anonymous entities. */
142 static symbol_t *sym_anonymous = NULL;
144 /** The token anchor set */
145 static unsigned short token_anchor_set[T_LAST_TOKEN];
147 /** The current source position. */
148 #define HERE (&token.base.source_position)
150 /** true if we are in GCC mode. */
151 #define GNU_MODE ((c_mode & _GNUC) || in_gcc_extension)
153 static statement_t *parse_compound_statement(bool inside_expression_statement);
154 static statement_t *parse_statement(void);
156 static expression_t *parse_subexpression(precedence_t);
157 static expression_t *parse_expression(void);
158 static type_t *parse_typename(void);
159 static void parse_externals(void);
160 static void parse_external(void);
162 static void parse_compound_type_entries(compound_t *compound_declaration);
164 static void check_call_argument(type_t *expected_type,
165 call_argument_t *argument, unsigned pos);
167 typedef enum declarator_flags_t {
169 DECL_MAY_BE_ABSTRACT = 1U << 0,
170 DECL_CREATE_COMPOUND_MEMBER = 1U << 1,
171 DECL_IS_PARAMETER = 1U << 2
172 } declarator_flags_t;
174 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
175 declarator_flags_t flags);
177 static void semantic_comparison(binary_expression_t *expression);
179 #define STORAGE_CLASSES \
180 STORAGE_CLASSES_NO_EXTERN \
183 #define STORAGE_CLASSES_NO_EXTERN \
190 #define TYPE_QUALIFIERS \
195 case T__forceinline: \
196 case T___attribute__:
198 #define COMPLEX_SPECIFIERS \
200 #define IMAGINARY_SPECIFIERS \
203 #define TYPE_SPECIFIERS \
205 case T___builtin_va_list: \
230 #define DECLARATION_START \
235 #define DECLARATION_START_NO_EXTERN \
236 STORAGE_CLASSES_NO_EXTERN \
240 #define EXPRESSION_START \
249 case T_CHARACTER_CONSTANT: \
250 case T_FLOATINGPOINT: \
254 case T_STRING_LITERAL: \
255 case T_WIDE_CHARACTER_CONSTANT: \
256 case T_WIDE_STRING_LITERAL: \
257 case T___FUNCDNAME__: \
258 case T___FUNCSIG__: \
259 case T___FUNCTION__: \
260 case T___PRETTY_FUNCTION__: \
261 case T___alignof__: \
262 case T___builtin_classify_type: \
263 case T___builtin_constant_p: \
264 case T___builtin_isgreater: \
265 case T___builtin_isgreaterequal: \
266 case T___builtin_isless: \
267 case T___builtin_islessequal: \
268 case T___builtin_islessgreater: \
269 case T___builtin_isunordered: \
270 case T___builtin_offsetof: \
271 case T___builtin_va_arg: \
272 case T___builtin_va_copy: \
273 case T___builtin_va_start: \
284 * Returns the size of a statement node.
286 * @param kind the statement kind
288 static size_t get_statement_struct_size(statement_kind_t kind)
290 static const size_t sizes[] = {
291 [STATEMENT_ERROR] = sizeof(statement_base_t),
292 [STATEMENT_EMPTY] = sizeof(statement_base_t),
293 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
294 [STATEMENT_RETURN] = sizeof(return_statement_t),
295 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
296 [STATEMENT_IF] = sizeof(if_statement_t),
297 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
298 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
299 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
300 [STATEMENT_BREAK] = sizeof(statement_base_t),
301 [STATEMENT_COMPUTED_GOTO] = sizeof(computed_goto_statement_t),
302 [STATEMENT_GOTO] = sizeof(goto_statement_t),
303 [STATEMENT_LABEL] = sizeof(label_statement_t),
304 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
305 [STATEMENT_WHILE] = sizeof(while_statement_t),
306 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
307 [STATEMENT_FOR] = sizeof(for_statement_t),
308 [STATEMENT_ASM] = sizeof(asm_statement_t),
309 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
310 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
312 assert((size_t)kind < lengthof(sizes));
313 assert(sizes[kind] != 0);
318 * Returns the size of an expression node.
320 * @param kind the expression kind
322 static size_t get_expression_struct_size(expression_kind_t kind)
324 static const size_t sizes[] = {
325 [EXPR_ERROR] = sizeof(expression_base_t),
326 [EXPR_REFERENCE] = sizeof(reference_expression_t),
327 [EXPR_ENUM_CONSTANT] = sizeof(reference_expression_t),
328 [EXPR_LITERAL_BOOLEAN] = sizeof(literal_expression_t),
329 [EXPR_LITERAL_INTEGER] = sizeof(literal_expression_t),
330 [EXPR_LITERAL_FLOATINGPOINT] = sizeof(literal_expression_t),
331 [EXPR_LITERAL_CHARACTER] = sizeof(literal_expression_t),
332 [EXPR_LITERAL_WIDE_CHARACTER] = sizeof(literal_expression_t),
333 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
334 [EXPR_WIDE_STRING_LITERAL] = sizeof(string_literal_expression_t),
335 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
336 [EXPR_CALL] = sizeof(call_expression_t),
337 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
338 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
339 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
340 [EXPR_SELECT] = sizeof(select_expression_t),
341 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
342 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
343 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
344 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
345 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
346 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
347 [EXPR_BUILTIN_TYPES_COMPATIBLE_P] = sizeof(builtin_types_compatible_expression_t),
348 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
349 [EXPR_VA_START] = sizeof(va_start_expression_t),
350 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
351 [EXPR_VA_COPY] = sizeof(va_copy_expression_t),
352 [EXPR_STATEMENT] = sizeof(statement_expression_t),
353 [EXPR_LABEL_ADDRESS] = sizeof(label_address_expression_t),
355 if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
356 return sizes[EXPR_UNARY_FIRST];
358 if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
359 return sizes[EXPR_BINARY_FIRST];
361 assert((size_t)kind < lengthof(sizes));
362 assert(sizes[kind] != 0);
367 * Allocate a statement node of given kind and initialize all
368 * fields with zero. Sets its source position to the position
369 * of the current token.
371 static statement_t *allocate_statement_zero(statement_kind_t kind)
373 size_t size = get_statement_struct_size(kind);
374 statement_t *res = allocate_ast_zero(size);
376 res->base.kind = kind;
377 res->base.parent = current_parent;
378 res->base.source_position = *HERE;
383 * Allocate an expression node of given kind and initialize all
386 * @param kind the kind of the expression to allocate
388 static expression_t *allocate_expression_zero(expression_kind_t kind)
390 size_t size = get_expression_struct_size(kind);
391 expression_t *res = allocate_ast_zero(size);
393 res->base.kind = kind;
394 res->base.type = type_error_type;
395 res->base.source_position = *HERE;
400 * Creates a new invalid expression at the source position
401 * of the current token.
403 static expression_t *create_error_expression(void)
405 expression_t *expression = allocate_expression_zero(EXPR_ERROR);
406 expression->base.type = type_error_type;
411 * Creates a new invalid statement.
413 static statement_t *create_error_statement(void)
415 return allocate_statement_zero(STATEMENT_ERROR);
419 * Allocate a new empty statement.
421 static statement_t *create_empty_statement(void)
423 return allocate_statement_zero(STATEMENT_EMPTY);
427 * Returns the size of an initializer node.
429 * @param kind the initializer kind
431 static size_t get_initializer_size(initializer_kind_t kind)
433 static const size_t sizes[] = {
434 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
435 [INITIALIZER_STRING] = sizeof(initializer_string_t),
436 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
437 [INITIALIZER_LIST] = sizeof(initializer_list_t),
438 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
440 assert((size_t)kind < lengthof(sizes));
441 assert(sizes[kind] != 0);
446 * Allocate an initializer node of given kind and initialize all
449 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
451 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
458 * Returns the index of the top element of the environment stack.
460 static size_t environment_top(void)
462 return ARR_LEN(environment_stack);
466 * Returns the index of the top element of the global label stack.
468 static size_t label_top(void)
470 return ARR_LEN(label_stack);
474 * Return the next token.
476 static inline void next_token(void)
478 token = lookahead_buffer[lookahead_bufpos];
479 lookahead_buffer[lookahead_bufpos] = lexer_token;
482 lookahead_bufpos = (lookahead_bufpos + 1) % MAX_LOOKAHEAD;
485 print_token(stderr, &token);
486 fprintf(stderr, "\n");
490 #define eat(token_kind) (assert(token.kind == (token_kind)), next_token())
492 static inline bool next_if(token_kind_t const type)
494 if (token.kind == type) {
503 * Return the next token with a given lookahead.
505 static inline const token_t *look_ahead(size_t num)
507 assert(0 < num && num <= MAX_LOOKAHEAD);
508 size_t pos = (lookahead_bufpos + num - 1) % MAX_LOOKAHEAD;
509 return &lookahead_buffer[pos];
513 * Adds a token type to the token type anchor set (a multi-set).
515 static void add_anchor_token(token_kind_t const token_kind)
517 assert(token_kind < T_LAST_TOKEN);
518 ++token_anchor_set[token_kind];
522 * Remove a token type from the token type anchor set (a multi-set).
524 static void rem_anchor_token(token_kind_t const token_kind)
526 assert(token_kind < T_LAST_TOKEN);
527 assert(token_anchor_set[token_kind] != 0);
528 --token_anchor_set[token_kind];
532 * Eat tokens until a matching token type is found.
534 static void eat_until_matching_token(token_kind_t const type)
536 token_kind_t end_token;
538 case '(': end_token = ')'; break;
539 case '{': end_token = '}'; break;
540 case '[': end_token = ']'; break;
541 default: end_token = type; break;
544 unsigned parenthesis_count = 0;
545 unsigned brace_count = 0;
546 unsigned bracket_count = 0;
547 while (token.kind != end_token ||
548 parenthesis_count != 0 ||
550 bracket_count != 0) {
551 switch (token.kind) {
553 case '(': ++parenthesis_count; break;
554 case '{': ++brace_count; break;
555 case '[': ++bracket_count; break;
558 if (parenthesis_count > 0)
568 if (bracket_count > 0)
571 if (token.kind == end_token &&
572 parenthesis_count == 0 &&
586 * Eat input tokens until an anchor is found.
588 static void eat_until_anchor(void)
590 while (token_anchor_set[token.kind] == 0) {
591 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
592 eat_until_matching_token(token.kind);
598 * Eat a whole block from input tokens.
600 static void eat_block(void)
602 eat_until_matching_token('{');
607 * Report a parse error because an expected token was not found.
610 #if defined __GNUC__ && __GNUC__ >= 4
611 __attribute__((sentinel))
613 void parse_error_expected(const char *message, ...)
615 if (message != NULL) {
616 errorf(HERE, "%s", message);
619 va_start(ap, message);
620 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
625 * Report an incompatible type.
627 static void type_error_incompatible(const char *msg,
628 const source_position_t *source_position, type_t *type1, type_t *type2)
630 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
635 * Expect the current token is the expected token.
636 * If not, generate an error and skip until the next anchor.
638 static void expect(token_kind_t const expected)
640 if (UNLIKELY(token.kind != expected)) {
641 parse_error_expected(NULL, expected, NULL);
642 add_anchor_token(expected);
644 rem_anchor_token(expected);
645 if (token.kind != expected)
651 static symbol_t *expect_identifier(char const *const context, source_position_t *const pos)
653 if (token.kind != T_IDENTIFIER) {
654 parse_error_expected(context, T_IDENTIFIER, NULL);
655 add_anchor_token(T_IDENTIFIER);
657 rem_anchor_token(T_IDENTIFIER);
658 if (token.kind != T_IDENTIFIER)
661 symbol_t *const sym = token.base.symbol;
669 * Push a given scope on the scope stack and make it the
672 static scope_t *scope_push(scope_t *new_scope)
674 if (current_scope != NULL) {
675 new_scope->depth = current_scope->depth + 1;
678 scope_t *old_scope = current_scope;
679 current_scope = new_scope;
684 * Pop the current scope from the scope stack.
686 static void scope_pop(scope_t *old_scope)
688 current_scope = old_scope;
692 * Search an entity by its symbol in a given namespace.
694 static entity_t *get_entity(const symbol_t *const symbol,
695 namespace_tag_t namespc)
697 entity_t *entity = symbol->entity;
698 for (; entity != NULL; entity = entity->base.symbol_next) {
699 if ((namespace_tag_t)entity->base.namespc == namespc)
706 /* §6.2.3:1 24) There is only one name space for tags even though three are
708 static entity_t *get_tag(symbol_t const *const symbol,
709 entity_kind_tag_t const kind)
711 entity_t *entity = get_entity(symbol, NAMESPACE_TAG);
712 if (entity != NULL && (entity_kind_tag_t)entity->kind != kind) {
714 "'%Y' defined as wrong kind of tag (previous definition %P)",
715 symbol, &entity->base.source_position);
722 * pushs an entity on the environment stack and links the corresponding symbol
725 static void stack_push(stack_entry_t **stack_ptr, entity_t *entity)
727 symbol_t *symbol = entity->base.symbol;
728 entity_namespace_t namespc = entity->base.namespc;
729 assert(namespc != 0);
731 /* replace/add entity into entity list of the symbol */
734 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
739 /* replace an entry? */
740 if (iter->base.namespc == namespc) {
741 entity->base.symbol_next = iter->base.symbol_next;
747 /* remember old declaration */
749 entry.symbol = symbol;
750 entry.old_entity = iter;
751 entry.namespc = namespc;
752 ARR_APP1(stack_entry_t, *stack_ptr, entry);
756 * Push an entity on the environment stack.
758 static void environment_push(entity_t *entity)
760 assert(entity->base.source_position.input_name != NULL);
761 assert(entity->base.parent_scope != NULL);
762 stack_push(&environment_stack, entity);
766 * Push a declaration on the global label stack.
768 * @param declaration the declaration
770 static void label_push(entity_t *label)
772 /* we abuse the parameters scope as parent for the labels */
773 label->base.parent_scope = ¤t_function->parameters;
774 stack_push(&label_stack, label);
778 * pops symbols from the environment stack until @p new_top is the top element
780 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
782 stack_entry_t *stack = *stack_ptr;
783 size_t top = ARR_LEN(stack);
786 assert(new_top <= top);
790 for (i = top; i > new_top; --i) {
791 stack_entry_t *entry = &stack[i - 1];
793 entity_t *old_entity = entry->old_entity;
794 symbol_t *symbol = entry->symbol;
795 entity_namespace_t namespc = entry->namespc;
797 /* replace with old_entity/remove */
800 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
802 assert(iter != NULL);
803 /* replace an entry? */
804 if (iter->base.namespc == namespc)
808 /* restore definition from outer scopes (if there was one) */
809 if (old_entity != NULL) {
810 old_entity->base.symbol_next = iter->base.symbol_next;
811 *anchor = old_entity;
813 /* remove entry from list */
814 *anchor = iter->base.symbol_next;
818 ARR_SHRINKLEN(*stack_ptr, new_top);
822 * Pop all entries from the environment stack until the new_top
825 * @param new_top the new stack top
827 static void environment_pop_to(size_t new_top)
829 stack_pop_to(&environment_stack, new_top);
833 * Pop all entries from the global label stack until the new_top
836 * @param new_top the new stack top
838 static void label_pop_to(size_t new_top)
840 stack_pop_to(&label_stack, new_top);
843 static atomic_type_kind_t get_akind(const type_t *type)
845 assert(type->kind == TYPE_ATOMIC || type->kind == TYPE_COMPLEX
846 || type->kind == TYPE_IMAGINARY || type->kind == TYPE_ENUM);
847 return type->atomic.akind;
851 * §6.3.1.1:2 Do integer promotion for a given type.
853 * @param type the type to promote
854 * @return the promoted type
856 static type_t *promote_integer(type_t *type)
858 if (get_akind_rank(get_akind(type)) < get_akind_rank(ATOMIC_TYPE_INT))
865 * Check if a given expression represents a null pointer constant.
867 * @param expression the expression to check
869 static bool is_null_pointer_constant(const expression_t *expression)
871 /* skip void* cast */
872 if (expression->kind == EXPR_UNARY_CAST) {
873 type_t *const type = skip_typeref(expression->base.type);
874 if (types_compatible(type, type_void_ptr))
875 expression = expression->unary.value;
878 type_t *const type = skip_typeref(expression->base.type);
879 if (!is_type_integer(type))
881 switch (is_constant_expression(expression)) {
882 case EXPR_CLASS_ERROR: return true;
883 case EXPR_CLASS_CONSTANT: return !fold_constant_to_bool(expression);
884 default: return false;
889 * Create an implicit cast expression.
891 * @param expression the expression to cast
892 * @param dest_type the destination type
894 static expression_t *create_implicit_cast(expression_t *expression,
897 type_t *const source_type = expression->base.type;
899 if (source_type == dest_type)
902 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
903 cast->unary.value = expression;
904 cast->base.type = dest_type;
905 cast->base.implicit = true;
910 typedef enum assign_error_t {
912 ASSIGN_ERROR_INCOMPATIBLE,
913 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
914 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
915 ASSIGN_WARNING_POINTER_FROM_INT,
916 ASSIGN_WARNING_INT_FROM_POINTER
919 static void report_assign_error(assign_error_t error, type_t *orig_type_left, expression_t const *const right, char const *const context, source_position_t const *const pos)
921 type_t *const orig_type_right = right->base.type;
922 type_t *const type_left = skip_typeref(orig_type_left);
923 type_t *const type_right = skip_typeref(orig_type_right);
928 case ASSIGN_ERROR_INCOMPATIBLE:
929 errorf(pos, "destination type '%T' in %s is incompatible with type '%T'", orig_type_left, context, orig_type_right);
932 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
933 type_t *points_to_left = skip_typeref(type_left->pointer.points_to);
934 type_t *points_to_right = skip_typeref(type_right->pointer.points_to);
936 /* the left type has all qualifiers from the right type */
937 unsigned missing_qualifiers = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
938 warningf(WARN_OTHER, pos, "destination type '%T' in %s from type '%T' lacks qualifiers '%Q' in pointer target type", orig_type_left, context, orig_type_right, missing_qualifiers);
942 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
943 warningf(WARN_OTHER, pos, "destination type '%T' in %s is incompatible with '%E' of type '%T'", orig_type_left, context, right, orig_type_right);
946 case ASSIGN_WARNING_POINTER_FROM_INT:
947 warningf(WARN_OTHER, pos, "%s makes pointer '%T' from integer '%T' without a cast", context, orig_type_left, orig_type_right);
950 case ASSIGN_WARNING_INT_FROM_POINTER:
951 warningf(WARN_OTHER, pos, "%s makes integer '%T' from pointer '%T' without a cast", context, orig_type_left, orig_type_right);
955 panic("invalid error value");
959 /** Implements the rules from §6.5.16.1 */
960 static assign_error_t semantic_assign(type_t *orig_type_left,
961 const expression_t *const right)
963 type_t *const orig_type_right = right->base.type;
964 type_t *const type_left = skip_typeref(orig_type_left);
965 type_t *const type_right = skip_typeref(orig_type_right);
967 if (is_type_pointer(type_left)) {
968 if (is_null_pointer_constant(right)) {
969 return ASSIGN_SUCCESS;
970 } else if (is_type_pointer(type_right)) {
971 type_t *points_to_left
972 = skip_typeref(type_left->pointer.points_to);
973 type_t *points_to_right
974 = skip_typeref(type_right->pointer.points_to);
975 assign_error_t res = ASSIGN_SUCCESS;
977 /* the left type has all qualifiers from the right type */
978 unsigned missing_qualifiers
979 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
980 if (missing_qualifiers != 0) {
981 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
984 points_to_left = get_unqualified_type(points_to_left);
985 points_to_right = get_unqualified_type(points_to_right);
987 if (is_type_void(points_to_left))
990 if (is_type_void(points_to_right)) {
991 /* ISO/IEC 14882:1998(E) §C.1.2:6 */
992 return c_mode & _CXX ? ASSIGN_ERROR_INCOMPATIBLE : res;
995 if (!types_compatible(points_to_left, points_to_right)) {
996 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
1000 } else if (is_type_integer(type_right)) {
1001 return ASSIGN_WARNING_POINTER_FROM_INT;
1003 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1004 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1005 && is_type_pointer(type_right))) {
1006 return ASSIGN_SUCCESS;
1007 } else if (is_type_compound(type_left) && is_type_compound(type_right)) {
1008 type_t *const unqual_type_left = get_unqualified_type(type_left);
1009 type_t *const unqual_type_right = get_unqualified_type(type_right);
1010 if (types_compatible(unqual_type_left, unqual_type_right)) {
1011 return ASSIGN_SUCCESS;
1013 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1014 return ASSIGN_WARNING_INT_FROM_POINTER;
1017 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1018 return ASSIGN_SUCCESS;
1020 return ASSIGN_ERROR_INCOMPATIBLE;
1023 static expression_t *parse_constant_expression(void)
1025 expression_t *result = parse_subexpression(PREC_CONDITIONAL);
1027 if (is_constant_expression(result) == EXPR_CLASS_VARIABLE) {
1028 errorf(&result->base.source_position,
1029 "expression '%E' is not constant", result);
1035 static expression_t *parse_assignment_expression(void)
1037 return parse_subexpression(PREC_ASSIGNMENT);
1040 static void append_string(string_t const *const s)
1042 /* FIXME Using the ast_obstack is a hack. Using the symbol_obstack is not
1043 * possible, because other tokens are grown there alongside. */
1044 obstack_grow(&ast_obstack, s->begin, s->size - 1);
1047 static string_t finish_string(void)
1049 obstack_1grow(&ast_obstack, '\0');
1050 size_t const size = obstack_object_size(&ast_obstack);
1051 char const *const string = obstack_finish(&ast_obstack);
1052 return (string_t){ string, size };
1055 static string_t concat_string_literals(bool *const out_is_wide)
1057 assert(token.kind == T_STRING_LITERAL || token.kind == T_WIDE_STRING_LITERAL);
1060 bool is_wide = token.kind == T_WIDE_STRING_LITERAL;
1061 token_kind_t const la1 = (token_kind_t)look_ahead(1)->kind;
1062 if (la1 == T_STRING_LITERAL || la1 == T_WIDE_STRING_LITERAL) {
1063 append_string(&token.string.string);
1065 warningf(WARN_TRADITIONAL, HERE, "traditional C rejects string constant concatenation");
1067 is_wide |= token.kind == T_WIDE_STRING_LITERAL;
1068 append_string(&token.string.string);
1070 } while (token.kind == T_STRING_LITERAL || token.kind == T_WIDE_STRING_LITERAL);
1071 result = finish_string();
1073 result = token.string.string;
1077 *out_is_wide = is_wide;
1081 static string_t parse_string_literals(void)
1084 source_position_t const pos = *HERE;
1085 string_t const res = concat_string_literals(&is_wide);
1088 errorf(&pos, "expected plain string literal, got wide string literal");
1094 static attribute_t *allocate_attribute_zero(attribute_kind_t kind)
1096 attribute_t *attribute = allocate_ast_zero(sizeof(*attribute));
1097 attribute->kind = kind;
1098 attribute->source_position = *HERE;
1103 * Parse (gcc) attribute argument. From gcc comments in gcc source:
1106 * __attribute__ ( ( attribute-list ) )
1110 * attribute_list , attrib
1115 * any-word ( identifier )
1116 * any-word ( identifier , nonempty-expr-list )
1117 * any-word ( expr-list )
1119 * where the "identifier" must not be declared as a type, and
1120 * "any-word" may be any identifier (including one declared as a
1121 * type), a reserved word storage class specifier, type specifier or
1122 * type qualifier. ??? This still leaves out most reserved keywords
1123 * (following the old parser), shouldn't we include them, and why not
1124 * allow identifiers declared as types to start the arguments?
1126 * Matze: this all looks confusing and little systematic, so we're even less
1127 * strict and parse any list of things which are identifiers or
1128 * (assignment-)expressions.
1130 static attribute_argument_t *parse_attribute_arguments(void)
1132 attribute_argument_t *first = NULL;
1133 attribute_argument_t **anchor = &first;
1134 if (token.kind != ')') do {
1135 attribute_argument_t *argument = allocate_ast_zero(sizeof(*argument));
1137 /* is it an identifier */
1138 if (token.kind == T_IDENTIFIER
1139 && (look_ahead(1)->kind == ',' || look_ahead(1)->kind == ')')) {
1140 argument->kind = ATTRIBUTE_ARGUMENT_SYMBOL;
1141 argument->v.symbol = token.base.symbol;
1144 /* must be an expression */
1145 expression_t *expression = parse_assignment_expression();
1147 argument->kind = ATTRIBUTE_ARGUMENT_EXPRESSION;
1148 argument->v.expression = expression;
1151 /* append argument */
1153 anchor = &argument->next;
1154 } while (next_if(','));
1159 static attribute_t *parse_attribute_asm(void)
1161 attribute_t *attribute = allocate_attribute_zero(ATTRIBUTE_GNU_ASM);
1164 attribute->a.arguments = parse_attribute_arguments();
1168 static attribute_t *parse_attribute_gnu_single(void)
1170 /* parse "any-word" */
1171 symbol_t *const symbol = token.base.symbol;
1172 if (symbol == NULL) {
1173 parse_error_expected("while parsing attribute((", T_IDENTIFIER, NULL);
1177 attribute_kind_t kind;
1178 char const *const name = symbol->string;
1179 for (kind = ATTRIBUTE_GNU_FIRST;; ++kind) {
1180 if (kind > ATTRIBUTE_GNU_LAST) {
1181 warningf(WARN_ATTRIBUTE, HERE, "unknown attribute '%s' ignored", name);
1182 /* TODO: we should still save the attribute in the list... */
1183 kind = ATTRIBUTE_UNKNOWN;
1187 const char *attribute_name = get_attribute_name(kind);
1188 if (attribute_name != NULL && streq_underscore(attribute_name, name))
1192 attribute_t *attribute = allocate_attribute_zero(kind);
1195 /* parse arguments */
1197 attribute->a.arguments = parse_attribute_arguments();
1202 static attribute_t *parse_attribute_gnu(void)
1204 attribute_t *first = NULL;
1205 attribute_t **anchor = &first;
1207 eat(T___attribute__);
1208 add_anchor_token(')');
1209 add_anchor_token(',');
1213 if (token.kind != ')') do {
1214 attribute_t *attribute = parse_attribute_gnu_single();
1216 *anchor = attribute;
1217 anchor = &attribute->next;
1219 } while (next_if(','));
1220 rem_anchor_token(',');
1221 rem_anchor_token(')');
1228 /** Parse attributes. */
1229 static attribute_t *parse_attributes(attribute_t *first)
1231 attribute_t **anchor = &first;
1233 while (*anchor != NULL)
1234 anchor = &(*anchor)->next;
1236 attribute_t *attribute;
1237 switch (token.kind) {
1238 case T___attribute__:
1239 attribute = parse_attribute_gnu();
1240 if (attribute == NULL)
1245 attribute = parse_attribute_asm();
1249 attribute = allocate_attribute_zero(ATTRIBUTE_MS_CDECL);
1254 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FASTCALL);
1258 case T__forceinline:
1259 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FORCEINLINE);
1260 eat(T__forceinline);
1264 attribute = allocate_attribute_zero(ATTRIBUTE_MS_STDCALL);
1269 /* TODO record modifier */
1270 warningf(WARN_OTHER, HERE, "Ignoring declaration modifier %K", &token);
1271 attribute = allocate_attribute_zero(ATTRIBUTE_MS_THISCALL);
1279 *anchor = attribute;
1280 anchor = &attribute->next;
1284 static void mark_vars_read(expression_t *expr, entity_t *lhs_ent);
1286 static entity_t *determine_lhs_ent(expression_t *const expr,
1289 switch (expr->kind) {
1290 case EXPR_REFERENCE: {
1291 entity_t *const entity = expr->reference.entity;
1292 /* we should only find variables as lvalues... */
1293 if (entity->base.kind != ENTITY_VARIABLE
1294 && entity->base.kind != ENTITY_PARAMETER)
1300 case EXPR_ARRAY_ACCESS: {
1301 expression_t *const ref = expr->array_access.array_ref;
1302 entity_t * ent = NULL;
1303 if (is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1304 ent = determine_lhs_ent(ref, lhs_ent);
1307 mark_vars_read(ref, lhs_ent);
1309 mark_vars_read(expr->array_access.index, lhs_ent);
1314 mark_vars_read(expr->select.compound, lhs_ent);
1315 if (is_type_compound(skip_typeref(expr->base.type)))
1316 return determine_lhs_ent(expr->select.compound, lhs_ent);
1320 case EXPR_UNARY_DEREFERENCE: {
1321 expression_t *const val = expr->unary.value;
1322 if (val->kind == EXPR_UNARY_TAKE_ADDRESS) {
1324 return determine_lhs_ent(val->unary.value, lhs_ent);
1326 mark_vars_read(val, NULL);
1332 mark_vars_read(expr, NULL);
1337 #define ENT_ANY ((entity_t*)-1)
1340 * Mark declarations, which are read. This is used to detect variables, which
1344 * x is not marked as "read", because it is only read to calculate its own new
1348 * x and y are not detected as "not read", because multiple variables are
1351 static void mark_vars_read(expression_t *const expr, entity_t *lhs_ent)
1353 switch (expr->kind) {
1354 case EXPR_REFERENCE: {
1355 entity_t *const entity = expr->reference.entity;
1356 if (entity->kind != ENTITY_VARIABLE
1357 && entity->kind != ENTITY_PARAMETER)
1360 if (lhs_ent != entity && lhs_ent != ENT_ANY) {
1361 entity->variable.read = true;
1367 // TODO respect pure/const
1368 mark_vars_read(expr->call.function, NULL);
1369 for (call_argument_t *arg = expr->call.arguments; arg != NULL; arg = arg->next) {
1370 mark_vars_read(arg->expression, NULL);
1374 case EXPR_CONDITIONAL:
1375 // TODO lhs_decl should depend on whether true/false have an effect
1376 mark_vars_read(expr->conditional.condition, NULL);
1377 if (expr->conditional.true_expression != NULL)
1378 mark_vars_read(expr->conditional.true_expression, lhs_ent);
1379 mark_vars_read(expr->conditional.false_expression, lhs_ent);
1383 if (lhs_ent == ENT_ANY
1384 && !is_type_compound(skip_typeref(expr->base.type)))
1386 mark_vars_read(expr->select.compound, lhs_ent);
1389 case EXPR_ARRAY_ACCESS: {
1390 mark_vars_read(expr->array_access.index, lhs_ent);
1391 expression_t *const ref = expr->array_access.array_ref;
1392 if (!is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1393 if (lhs_ent == ENT_ANY)
1396 mark_vars_read(ref, lhs_ent);
1401 mark_vars_read(expr->va_arge.ap, lhs_ent);
1405 mark_vars_read(expr->va_copye.src, lhs_ent);
1408 case EXPR_UNARY_CAST:
1409 /* Special case: Use void cast to mark a variable as "read" */
1410 if (is_type_void(skip_typeref(expr->base.type)))
1415 case EXPR_UNARY_THROW:
1416 if (expr->unary.value == NULL)
1419 case EXPR_UNARY_DEREFERENCE:
1420 case EXPR_UNARY_DELETE:
1421 case EXPR_UNARY_DELETE_ARRAY:
1422 if (lhs_ent == ENT_ANY)
1426 case EXPR_UNARY_NEGATE:
1427 case EXPR_UNARY_PLUS:
1428 case EXPR_UNARY_BITWISE_NEGATE:
1429 case EXPR_UNARY_NOT:
1430 case EXPR_UNARY_TAKE_ADDRESS:
1431 case EXPR_UNARY_POSTFIX_INCREMENT:
1432 case EXPR_UNARY_POSTFIX_DECREMENT:
1433 case EXPR_UNARY_PREFIX_INCREMENT:
1434 case EXPR_UNARY_PREFIX_DECREMENT:
1435 case EXPR_UNARY_ASSUME:
1437 mark_vars_read(expr->unary.value, lhs_ent);
1440 case EXPR_BINARY_ADD:
1441 case EXPR_BINARY_SUB:
1442 case EXPR_BINARY_MUL:
1443 case EXPR_BINARY_DIV:
1444 case EXPR_BINARY_MOD:
1445 case EXPR_BINARY_EQUAL:
1446 case EXPR_BINARY_NOTEQUAL:
1447 case EXPR_BINARY_LESS:
1448 case EXPR_BINARY_LESSEQUAL:
1449 case EXPR_BINARY_GREATER:
1450 case EXPR_BINARY_GREATEREQUAL:
1451 case EXPR_BINARY_BITWISE_AND:
1452 case EXPR_BINARY_BITWISE_OR:
1453 case EXPR_BINARY_BITWISE_XOR:
1454 case EXPR_BINARY_LOGICAL_AND:
1455 case EXPR_BINARY_LOGICAL_OR:
1456 case EXPR_BINARY_SHIFTLEFT:
1457 case EXPR_BINARY_SHIFTRIGHT:
1458 case EXPR_BINARY_COMMA:
1459 case EXPR_BINARY_ISGREATER:
1460 case EXPR_BINARY_ISGREATEREQUAL:
1461 case EXPR_BINARY_ISLESS:
1462 case EXPR_BINARY_ISLESSEQUAL:
1463 case EXPR_BINARY_ISLESSGREATER:
1464 case EXPR_BINARY_ISUNORDERED:
1465 mark_vars_read(expr->binary.left, lhs_ent);
1466 mark_vars_read(expr->binary.right, lhs_ent);
1469 case EXPR_BINARY_ASSIGN:
1470 case EXPR_BINARY_MUL_ASSIGN:
1471 case EXPR_BINARY_DIV_ASSIGN:
1472 case EXPR_BINARY_MOD_ASSIGN:
1473 case EXPR_BINARY_ADD_ASSIGN:
1474 case EXPR_BINARY_SUB_ASSIGN:
1475 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
1476 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
1477 case EXPR_BINARY_BITWISE_AND_ASSIGN:
1478 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
1479 case EXPR_BINARY_BITWISE_OR_ASSIGN: {
1480 if (lhs_ent == ENT_ANY)
1482 lhs_ent = determine_lhs_ent(expr->binary.left, lhs_ent);
1483 mark_vars_read(expr->binary.right, lhs_ent);
1488 determine_lhs_ent(expr->va_starte.ap, lhs_ent);
1491 case EXPR_LITERAL_CASES:
1493 case EXPR_STRING_LITERAL:
1494 case EXPR_WIDE_STRING_LITERAL:
1495 case EXPR_COMPOUND_LITERAL: // TODO init?
1497 case EXPR_CLASSIFY_TYPE:
1500 case EXPR_BUILTIN_CONSTANT_P:
1501 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
1503 case EXPR_STATEMENT: // TODO
1504 case EXPR_LABEL_ADDRESS:
1505 case EXPR_ENUM_CONSTANT:
1509 panic("unhandled expression");
1512 static designator_t *parse_designation(void)
1514 designator_t *result = NULL;
1515 designator_t **anchor = &result;
1518 designator_t *designator;
1519 switch (token.kind) {
1521 designator = allocate_ast_zero(sizeof(designator[0]));
1522 designator->source_position = *HERE;
1524 add_anchor_token(']');
1525 designator->array_index = parse_constant_expression();
1526 rem_anchor_token(']');
1530 designator = allocate_ast_zero(sizeof(designator[0]));
1531 designator->source_position = *HERE;
1533 designator->symbol = expect_identifier("while parsing designator", NULL);
1534 if (!designator->symbol)
1542 assert(designator != NULL);
1543 *anchor = designator;
1544 anchor = &designator->next;
1548 static initializer_t *initializer_from_string(array_type_t *const type,
1549 const string_t *const string)
1551 /* TODO: check len vs. size of array type */
1554 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
1555 initializer->string.string = *string;
1560 static initializer_t *initializer_from_wide_string(array_type_t *const type,
1561 const string_t *const string)
1563 /* TODO: check len vs. size of array type */
1566 initializer_t *const initializer =
1567 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
1568 initializer->wide_string.string = *string;
1574 * Build an initializer from a given expression.
1576 static initializer_t *initializer_from_expression(type_t *orig_type,
1577 expression_t *expression)
1579 /* TODO check that expression is a constant expression */
1581 /* §6.7.8.14/15 char array may be initialized by string literals */
1582 type_t *type = skip_typeref(orig_type);
1583 type_t *expr_type_orig = expression->base.type;
1584 type_t *expr_type = skip_typeref(expr_type_orig);
1586 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
1587 array_type_t *const array_type = &type->array;
1588 type_t *const element_type = skip_typeref(array_type->element_type);
1590 if (element_type->kind == TYPE_ATOMIC) {
1591 atomic_type_kind_t akind = element_type->atomic.akind;
1592 switch (expression->kind) {
1593 case EXPR_STRING_LITERAL:
1594 if (akind == ATOMIC_TYPE_CHAR
1595 || akind == ATOMIC_TYPE_SCHAR
1596 || akind == ATOMIC_TYPE_UCHAR) {
1597 return initializer_from_string(array_type,
1598 &expression->string_literal.value);
1602 case EXPR_WIDE_STRING_LITERAL: {
1603 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
1604 if (get_unqualified_type(element_type) == bare_wchar_type) {
1605 return initializer_from_wide_string(array_type,
1606 &expression->string_literal.value);
1617 assign_error_t error = semantic_assign(type, expression);
1618 if (error == ASSIGN_ERROR_INCOMPATIBLE)
1620 report_assign_error(error, type, expression, "initializer",
1621 &expression->base.source_position);
1623 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
1624 result->value.value = create_implicit_cast(expression, type);
1630 * Parses an scalar initializer.
1632 * §6.7.8.11; eat {} without warning
1634 static initializer_t *parse_scalar_initializer(type_t *type,
1635 bool must_be_constant)
1637 /* there might be extra {} hierarchies */
1639 if (token.kind == '{') {
1640 warningf(WARN_OTHER, HERE, "extra curly braces around scalar initializer");
1644 } while (token.kind == '{');
1647 expression_t *expression = parse_assignment_expression();
1648 mark_vars_read(expression, NULL);
1649 if (must_be_constant && !is_linker_constant(expression)) {
1650 errorf(&expression->base.source_position,
1651 "initialisation expression '%E' is not constant",
1655 initializer_t *initializer = initializer_from_expression(type, expression);
1657 if (initializer == NULL) {
1658 errorf(&expression->base.source_position,
1659 "expression '%E' (type '%T') doesn't match expected type '%T'",
1660 expression, expression->base.type, type);
1665 bool additional_warning_displayed = false;
1666 while (braces > 0) {
1668 if (token.kind != '}') {
1669 if (!additional_warning_displayed) {
1670 warningf(WARN_OTHER, HERE, "additional elements in scalar initializer");
1671 additional_warning_displayed = true;
1682 * An entry in the type path.
1684 typedef struct type_path_entry_t type_path_entry_t;
1685 struct type_path_entry_t {
1686 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
1688 size_t index; /**< For array types: the current index. */
1689 declaration_t *compound_entry; /**< For compound types: the current declaration. */
1694 * A type path expression a position inside compound or array types.
1696 typedef struct type_path_t type_path_t;
1697 struct type_path_t {
1698 type_path_entry_t *path; /**< An flexible array containing the current path. */
1699 type_t *top_type; /**< type of the element the path points */
1700 size_t max_index; /**< largest index in outermost array */
1704 * Prints a type path for debugging.
1706 static __attribute__((unused)) void debug_print_type_path(
1707 const type_path_t *path)
1709 size_t len = ARR_LEN(path->path);
1711 for (size_t i = 0; i < len; ++i) {
1712 const type_path_entry_t *entry = & path->path[i];
1714 type_t *type = skip_typeref(entry->type);
1715 if (is_type_compound(type)) {
1716 /* in gcc mode structs can have no members */
1717 if (entry->v.compound_entry == NULL) {
1721 fprintf(stderr, ".%s",
1722 entry->v.compound_entry->base.symbol->string);
1723 } else if (is_type_array(type)) {
1724 fprintf(stderr, "[%u]", (unsigned) entry->v.index);
1726 fprintf(stderr, "-INVALID-");
1729 if (path->top_type != NULL) {
1730 fprintf(stderr, " (");
1731 print_type(path->top_type);
1732 fprintf(stderr, ")");
1737 * Return the top type path entry, ie. in a path
1738 * (type).a.b returns the b.
1740 static type_path_entry_t *get_type_path_top(const type_path_t *path)
1742 size_t len = ARR_LEN(path->path);
1744 return &path->path[len-1];
1748 * Enlarge the type path by an (empty) element.
1750 static type_path_entry_t *append_to_type_path(type_path_t *path)
1752 size_t len = ARR_LEN(path->path);
1753 ARR_RESIZE(type_path_entry_t, path->path, len+1);
1755 type_path_entry_t *result = & path->path[len];
1756 memset(result, 0, sizeof(result[0]));
1761 * Descending into a sub-type. Enter the scope of the current top_type.
1763 static void descend_into_subtype(type_path_t *path)
1765 type_t *orig_top_type = path->top_type;
1766 type_t *top_type = skip_typeref(orig_top_type);
1768 type_path_entry_t *top = append_to_type_path(path);
1769 top->type = top_type;
1771 if (is_type_compound(top_type)) {
1772 compound_t *const compound = top_type->compound.compound;
1773 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
1775 if (entry != NULL) {
1776 top->v.compound_entry = &entry->declaration;
1777 path->top_type = entry->declaration.type;
1779 path->top_type = NULL;
1781 } else if (is_type_array(top_type)) {
1783 path->top_type = top_type->array.element_type;
1785 assert(!is_type_valid(top_type));
1790 * Pop an entry from the given type path, ie. returning from
1791 * (type).a.b to (type).a
1793 static void ascend_from_subtype(type_path_t *path)
1795 type_path_entry_t *top = get_type_path_top(path);
1797 path->top_type = top->type;
1799 size_t len = ARR_LEN(path->path);
1800 ARR_RESIZE(type_path_entry_t, path->path, len-1);
1804 * Pop entries from the given type path until the given
1805 * path level is reached.
1807 static void ascend_to(type_path_t *path, size_t top_path_level)
1809 size_t len = ARR_LEN(path->path);
1811 while (len > top_path_level) {
1812 ascend_from_subtype(path);
1813 len = ARR_LEN(path->path);
1817 static bool walk_designator(type_path_t *path, const designator_t *designator,
1818 bool used_in_offsetof)
1820 for (; designator != NULL; designator = designator->next) {
1821 type_path_entry_t *top = get_type_path_top(path);
1822 type_t *orig_type = top->type;
1824 type_t *type = skip_typeref(orig_type);
1826 if (designator->symbol != NULL) {
1827 symbol_t *symbol = designator->symbol;
1828 if (!is_type_compound(type)) {
1829 if (is_type_valid(type)) {
1830 errorf(&designator->source_position,
1831 "'.%Y' designator used for non-compound type '%T'",
1835 top->type = type_error_type;
1836 top->v.compound_entry = NULL;
1837 orig_type = type_error_type;
1839 compound_t *compound = type->compound.compound;
1840 entity_t *iter = compound->members.entities;
1841 for (; iter != NULL; iter = iter->base.next) {
1842 if (iter->base.symbol == symbol) {
1847 errorf(&designator->source_position,
1848 "'%T' has no member named '%Y'", orig_type, symbol);
1851 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
1852 if (used_in_offsetof && iter->compound_member.bitfield) {
1853 errorf(&designator->source_position,
1854 "offsetof designator '%Y' must not specify bitfield",
1859 top->type = orig_type;
1860 top->v.compound_entry = &iter->declaration;
1861 orig_type = iter->declaration.type;
1864 expression_t *array_index = designator->array_index;
1865 if (is_constant_expression(array_index) != EXPR_CLASS_CONSTANT)
1868 if (!is_type_array(type)) {
1869 if (is_type_valid(type)) {
1870 errorf(&designator->source_position,
1871 "[%E] designator used for non-array type '%T'",
1872 array_index, orig_type);
1877 long index = fold_constant_to_int(array_index);
1878 if (!used_in_offsetof) {
1880 errorf(&designator->source_position,
1881 "array index [%E] must be positive", array_index);
1882 } else if (type->array.size_constant) {
1883 long array_size = type->array.size;
1884 if (index >= array_size) {
1885 errorf(&designator->source_position,
1886 "designator [%E] (%d) exceeds array size %d",
1887 array_index, index, array_size);
1892 top->type = orig_type;
1893 top->v.index = (size_t) index;
1894 orig_type = type->array.element_type;
1896 path->top_type = orig_type;
1898 if (designator->next != NULL) {
1899 descend_into_subtype(path);
1905 static void advance_current_object(type_path_t *path, size_t top_path_level)
1907 type_path_entry_t *top = get_type_path_top(path);
1909 type_t *type = skip_typeref(top->type);
1910 if (is_type_union(type)) {
1911 /* in unions only the first element is initialized */
1912 top->v.compound_entry = NULL;
1913 } else if (is_type_struct(type)) {
1914 declaration_t *entry = top->v.compound_entry;
1916 entity_t *const next_entity = skip_unnamed_bitfields(entry->base.next);
1917 if (next_entity != NULL) {
1918 assert(is_declaration(next_entity));
1919 entry = &next_entity->declaration;
1924 top->v.compound_entry = entry;
1925 if (entry != NULL) {
1926 path->top_type = entry->type;
1929 } else if (is_type_array(type)) {
1930 assert(is_type_array(type));
1934 if (!type->array.size_constant || top->v.index < type->array.size) {
1938 assert(!is_type_valid(type));
1942 /* we're past the last member of the current sub-aggregate, try if we
1943 * can ascend in the type hierarchy and continue with another subobject */
1944 size_t len = ARR_LEN(path->path);
1946 if (len > top_path_level) {
1947 ascend_from_subtype(path);
1948 advance_current_object(path, top_path_level);
1950 path->top_type = NULL;
1955 * skip any {...} blocks until a closing bracket is reached.
1957 static void skip_initializers(void)
1961 while (token.kind != '}') {
1962 if (token.kind == T_EOF)
1964 if (token.kind == '{') {
1972 static initializer_t *create_empty_initializer(void)
1974 static initializer_t empty_initializer
1975 = { .list = { { INITIALIZER_LIST }, 0 } };
1976 return &empty_initializer;
1980 * Parse a part of an initialiser for a struct or union,
1982 static initializer_t *parse_sub_initializer(type_path_t *path,
1983 type_t *outer_type, size_t top_path_level,
1984 parse_initializer_env_t *env)
1986 if (token.kind == '}') {
1987 /* empty initializer */
1988 return create_empty_initializer();
1991 type_t *orig_type = path->top_type;
1992 type_t *type = NULL;
1994 if (orig_type == NULL) {
1995 /* We are initializing an empty compound. */
1997 type = skip_typeref(orig_type);
2000 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2003 designator_t *designator = NULL;
2004 if (token.kind == '.' || token.kind == '[') {
2005 designator = parse_designation();
2006 goto finish_designator;
2007 } else if (token.kind == T_IDENTIFIER && look_ahead(1)->kind == ':') {
2008 /* GNU-style designator ("identifier: value") */
2009 designator = allocate_ast_zero(sizeof(designator[0]));
2010 designator->source_position = *HERE;
2011 designator->symbol = token.base.symbol;
2016 /* reset path to toplevel, evaluate designator from there */
2017 ascend_to(path, top_path_level);
2018 if (!walk_designator(path, designator, false)) {
2019 /* can't continue after designation error */
2023 initializer_t *designator_initializer
2024 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2025 designator_initializer->designator.designator = designator;
2026 ARR_APP1(initializer_t*, initializers, designator_initializer);
2028 orig_type = path->top_type;
2029 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2034 if (token.kind == '{') {
2035 if (type != NULL && is_type_scalar(type)) {
2036 sub = parse_scalar_initializer(type, env->must_be_constant);
2039 if (env->entity != NULL) {
2040 errorf(HERE, "extra brace group at end of initializer for '%N'", env->entity);
2042 errorf(HERE, "extra brace group at end of initializer");
2047 descend_into_subtype(path);
2050 add_anchor_token('}');
2051 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2053 rem_anchor_token('}');
2058 goto error_parse_next;
2060 ascend_from_subtype(path);
2063 /* must be an expression */
2064 expression_t *expression = parse_assignment_expression();
2065 mark_vars_read(expression, NULL);
2067 if (env->must_be_constant && !is_linker_constant(expression)) {
2068 errorf(&expression->base.source_position,
2069 "Initialisation expression '%E' is not constant",
2074 /* we are already outside, ... */
2075 if (outer_type == NULL)
2076 goto error_parse_next;
2077 type_t *const outer_type_skip = skip_typeref(outer_type);
2078 if (is_type_compound(outer_type_skip) &&
2079 !outer_type_skip->compound.compound->complete) {
2080 goto error_parse_next;
2083 source_position_t const* const pos = &expression->base.source_position;
2084 if (env->entity != NULL) {
2085 warningf(WARN_OTHER, pos, "excess elements in initializer for '%N'", env->entity);
2087 warningf(WARN_OTHER, pos, "excess elements in initializer");
2089 goto error_parse_next;
2092 /* handle { "string" } special case */
2093 if ((expression->kind == EXPR_STRING_LITERAL
2094 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2095 && outer_type != NULL) {
2096 sub = initializer_from_expression(outer_type, expression);
2099 if (token.kind != '}') {
2100 warningf(WARN_OTHER, HERE, "excessive elements in initializer for type '%T'", orig_type);
2102 /* TODO: eat , ... */
2107 /* descend into subtypes until expression matches type */
2109 orig_type = path->top_type;
2110 type = skip_typeref(orig_type);
2112 sub = initializer_from_expression(orig_type, expression);
2116 if (!is_type_valid(type)) {
2119 if (is_type_scalar(type)) {
2120 errorf(&expression->base.source_position,
2121 "expression '%E' doesn't match expected type '%T'",
2122 expression, orig_type);
2126 descend_into_subtype(path);
2130 /* update largest index of top array */
2131 const type_path_entry_t *first = &path->path[0];
2132 type_t *first_type = first->type;
2133 first_type = skip_typeref(first_type);
2134 if (is_type_array(first_type)) {
2135 size_t index = first->v.index;
2136 if (index > path->max_index)
2137 path->max_index = index;
2140 /* append to initializers list */
2141 ARR_APP1(initializer_t*, initializers, sub);
2144 if (token.kind == '}') {
2147 add_anchor_token('}');
2149 rem_anchor_token('}');
2150 if (token.kind == '}') {
2155 /* advance to the next declaration if we are not at the end */
2156 advance_current_object(path, top_path_level);
2157 orig_type = path->top_type;
2158 if (orig_type != NULL)
2159 type = skip_typeref(orig_type);
2165 size_t len = ARR_LEN(initializers);
2166 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2167 initializer_t *result = allocate_ast_zero(size);
2168 result->kind = INITIALIZER_LIST;
2169 result->list.len = len;
2170 memcpy(&result->list.initializers, initializers,
2171 len * sizeof(initializers[0]));
2173 DEL_ARR_F(initializers);
2174 ascend_to(path, top_path_level+1);
2179 skip_initializers();
2180 DEL_ARR_F(initializers);
2181 ascend_to(path, top_path_level+1);
2185 static expression_t *make_size_literal(size_t value)
2187 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_INTEGER);
2188 literal->base.type = type_size_t;
2191 snprintf(buf, sizeof(buf), "%u", (unsigned) value);
2192 literal->literal.value = make_string(buf);
2198 * Parses an initializer. Parsers either a compound literal
2199 * (env->declaration == NULL) or an initializer of a declaration.
2201 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2203 type_t *type = skip_typeref(env->type);
2204 size_t max_index = 0;
2205 initializer_t *result;
2207 if (is_type_scalar(type)) {
2208 result = parse_scalar_initializer(type, env->must_be_constant);
2209 } else if (token.kind == '{') {
2213 memset(&path, 0, sizeof(path));
2214 path.top_type = env->type;
2215 path.path = NEW_ARR_F(type_path_entry_t, 0);
2217 descend_into_subtype(&path);
2219 add_anchor_token('}');
2220 result = parse_sub_initializer(&path, env->type, 1, env);
2221 rem_anchor_token('}');
2223 max_index = path.max_index;
2224 DEL_ARR_F(path.path);
2228 /* parse_scalar_initializer() also works in this case: we simply
2229 * have an expression without {} around it */
2230 result = parse_scalar_initializer(type, env->must_be_constant);
2233 /* §6.7.8:22 array initializers for arrays with unknown size determine
2234 * the array type size */
2235 if (is_type_array(type) && type->array.size_expression == NULL
2236 && result != NULL) {
2238 switch (result->kind) {
2239 case INITIALIZER_LIST:
2240 assert(max_index != 0xdeadbeaf);
2241 size = max_index + 1;
2244 case INITIALIZER_STRING:
2245 size = result->string.string.size;
2248 case INITIALIZER_WIDE_STRING:
2249 size = result->wide_string.string.size;
2252 case INITIALIZER_DESIGNATOR:
2253 case INITIALIZER_VALUE:
2254 /* can happen for parse errors */
2259 internal_errorf(HERE, "invalid initializer type");
2262 type_t *new_type = duplicate_type(type);
2264 new_type->array.size_expression = make_size_literal(size);
2265 new_type->array.size_constant = true;
2266 new_type->array.has_implicit_size = true;
2267 new_type->array.size = size;
2268 env->type = new_type;
2274 static void append_entity(scope_t *scope, entity_t *entity)
2276 if (scope->last_entity != NULL) {
2277 scope->last_entity->base.next = entity;
2279 scope->entities = entity;
2281 entity->base.parent_entity = current_entity;
2282 scope->last_entity = entity;
2286 static compound_t *parse_compound_type_specifier(bool is_struct)
2288 source_position_t const pos = *HERE;
2289 eat(is_struct ? T_struct : T_union);
2291 symbol_t *symbol = NULL;
2292 entity_t *entity = NULL;
2293 attribute_t *attributes = NULL;
2295 if (token.kind == T___attribute__) {
2296 attributes = parse_attributes(NULL);
2299 entity_kind_tag_t const kind = is_struct ? ENTITY_STRUCT : ENTITY_UNION;
2300 if (token.kind == T_IDENTIFIER) {
2301 /* the compound has a name, check if we have seen it already */
2302 symbol = token.base.symbol;
2303 entity = get_tag(symbol, kind);
2306 if (entity != NULL) {
2307 if (entity->base.parent_scope != current_scope &&
2308 (token.kind == '{' || token.kind == ';')) {
2309 /* we're in an inner scope and have a definition. Shadow
2310 * existing definition in outer scope */
2312 } else if (entity->compound.complete && token.kind == '{') {
2313 source_position_t const *const ppos = &entity->base.source_position;
2314 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2315 /* clear members in the hope to avoid further errors */
2316 entity->compound.members.entities = NULL;
2319 } else if (token.kind != '{') {
2320 char const *const msg =
2321 is_struct ? "while parsing struct type specifier" :
2322 "while parsing union type specifier";
2323 parse_error_expected(msg, T_IDENTIFIER, '{', NULL);
2328 if (entity == NULL) {
2329 entity = allocate_entity_zero(kind, NAMESPACE_TAG, symbol, &pos);
2330 entity->compound.alignment = 1;
2331 entity->base.parent_scope = current_scope;
2332 if (symbol != NULL) {
2333 environment_push(entity);
2335 append_entity(current_scope, entity);
2338 if (token.kind == '{') {
2339 parse_compound_type_entries(&entity->compound);
2341 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2342 if (symbol == NULL) {
2343 assert(anonymous_entity == NULL);
2344 anonymous_entity = entity;
2348 if (attributes != NULL) {
2349 handle_entity_attributes(attributes, entity);
2352 return &entity->compound;
2355 static void parse_enum_entries(type_t *const enum_type)
2359 if (token.kind == '}') {
2360 errorf(HERE, "empty enum not allowed");
2365 add_anchor_token('}');
2366 add_anchor_token(',');
2368 add_anchor_token('=');
2369 source_position_t pos;
2370 symbol_t *const symbol = expect_identifier("while parsing enum entry", &pos);
2371 entity_t *const entity = allocate_entity_zero(ENTITY_ENUM_VALUE, NAMESPACE_NORMAL, symbol, &pos);
2372 entity->enum_value.enum_type = enum_type;
2373 rem_anchor_token('=');
2376 expression_t *value = parse_constant_expression();
2378 value = create_implicit_cast(value, enum_type);
2379 entity->enum_value.value = value;
2384 record_entity(entity, false);
2385 } while (next_if(',') && token.kind != '}');
2386 rem_anchor_token(',');
2387 rem_anchor_token('}');
2392 static type_t *parse_enum_specifier(void)
2394 source_position_t const pos = *HERE;
2399 switch (token.kind) {
2401 symbol = token.base.symbol;
2402 entity = get_tag(symbol, ENTITY_ENUM);
2405 if (entity != NULL) {
2406 if (entity->base.parent_scope != current_scope &&
2407 (token.kind == '{' || token.kind == ';')) {
2408 /* we're in an inner scope and have a definition. Shadow
2409 * existing definition in outer scope */
2411 } else if (entity->enume.complete && token.kind == '{') {
2412 source_position_t const *const ppos = &entity->base.source_position;
2413 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2424 parse_error_expected("while parsing enum type specifier",
2425 T_IDENTIFIER, '{', NULL);
2429 if (entity == NULL) {
2430 entity = allocate_entity_zero(ENTITY_ENUM, NAMESPACE_TAG, symbol, &pos);
2431 entity->base.parent_scope = current_scope;
2434 type_t *const type = allocate_type_zero(TYPE_ENUM);
2435 type->enumt.enume = &entity->enume;
2436 type->enumt.base.akind = ATOMIC_TYPE_INT;
2438 if (token.kind == '{') {
2439 if (symbol != NULL) {
2440 environment_push(entity);
2442 append_entity(current_scope, entity);
2443 entity->enume.complete = true;
2445 parse_enum_entries(type);
2446 parse_attributes(NULL);
2448 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2449 if (symbol == NULL) {
2450 assert(anonymous_entity == NULL);
2451 anonymous_entity = entity;
2453 } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
2454 errorf(HERE, "'%T' used before definition (incomplete enums are a GNU extension)", type);
2461 * if a symbol is a typedef to another type, return true
2463 static bool is_typedef_symbol(symbol_t *symbol)
2465 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
2466 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
2469 static type_t *parse_typeof(void)
2475 add_anchor_token(')');
2478 expression_t *expression = NULL;
2480 switch (token.kind) {
2482 if (is_typedef_symbol(token.base.symbol)) {
2484 type = parse_typename();
2487 expression = parse_expression();
2488 type = revert_automatic_type_conversion(expression);
2493 rem_anchor_token(')');
2496 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
2497 typeof_type->typeoft.expression = expression;
2498 typeof_type->typeoft.typeof_type = type;
2503 typedef enum specifiers_t {
2504 SPECIFIER_SIGNED = 1 << 0,
2505 SPECIFIER_UNSIGNED = 1 << 1,
2506 SPECIFIER_LONG = 1 << 2,
2507 SPECIFIER_INT = 1 << 3,
2508 SPECIFIER_DOUBLE = 1 << 4,
2509 SPECIFIER_CHAR = 1 << 5,
2510 SPECIFIER_WCHAR_T = 1 << 6,
2511 SPECIFIER_SHORT = 1 << 7,
2512 SPECIFIER_LONG_LONG = 1 << 8,
2513 SPECIFIER_FLOAT = 1 << 9,
2514 SPECIFIER_BOOL = 1 << 10,
2515 SPECIFIER_VOID = 1 << 11,
2516 SPECIFIER_INT8 = 1 << 12,
2517 SPECIFIER_INT16 = 1 << 13,
2518 SPECIFIER_INT32 = 1 << 14,
2519 SPECIFIER_INT64 = 1 << 15,
2520 SPECIFIER_INT128 = 1 << 16,
2521 SPECIFIER_COMPLEX = 1 << 17,
2522 SPECIFIER_IMAGINARY = 1 << 18,
2525 static type_t *get_typedef_type(symbol_t *symbol)
2527 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
2528 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
2531 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
2532 type->typedeft.typedefe = &entity->typedefe;
2537 static attribute_t *parse_attribute_ms_property(attribute_t *attribute)
2539 attribute_property_argument_t *const property = allocate_ast_zero(sizeof(*property));
2541 add_anchor_token(')');
2542 add_anchor_token(',');
2546 add_anchor_token('=');
2547 source_position_t pos;
2548 symbol_t *const prop_sym = expect_identifier("while parsing property declspec", &pos);
2549 rem_anchor_token('=');
2551 symbol_t **prop = NULL;
2553 if (streq(prop_sym->string, "put")) {
2554 prop = &property->put_symbol;
2555 } else if (streq(prop_sym->string, "get")) {
2556 prop = &property->get_symbol;
2558 errorf(&pos, "expected put or get in property declspec, but got '%Y'", prop_sym);
2562 add_anchor_token(T_IDENTIFIER);
2564 rem_anchor_token(T_IDENTIFIER);
2566 symbol_t *const sym = expect_identifier("while parsing property declspec", NULL);
2568 *prop = sym ? sym : sym_anonymous;
2569 } while (next_if(','));
2570 rem_anchor_token(',');
2571 rem_anchor_token(')');
2573 attribute->a.property = property;
2579 static attribute_t *parse_microsoft_extended_decl_modifier_single(void)
2581 attribute_kind_t kind = ATTRIBUTE_UNKNOWN;
2582 if (next_if(T_restrict)) {
2583 kind = ATTRIBUTE_MS_RESTRICT;
2584 } else if (token.kind == T_IDENTIFIER) {
2585 char const *const name = token.base.symbol->string;
2586 for (attribute_kind_t k = ATTRIBUTE_MS_FIRST; k <= ATTRIBUTE_MS_LAST;
2588 const char *attribute_name = get_attribute_name(k);
2589 if (attribute_name != NULL && streq(attribute_name, name)) {
2595 if (kind == ATTRIBUTE_UNKNOWN) {
2596 warningf(WARN_ATTRIBUTE, HERE, "unknown __declspec '%s' ignored", name);
2599 parse_error_expected("while parsing __declspec", T_IDENTIFIER, NULL);
2603 attribute_t *attribute = allocate_attribute_zero(kind);
2606 if (kind == ATTRIBUTE_MS_PROPERTY) {
2607 return parse_attribute_ms_property(attribute);
2610 /* parse arguments */
2612 attribute->a.arguments = parse_attribute_arguments();
2617 static attribute_t *parse_microsoft_extended_decl_modifier(attribute_t *first)
2621 add_anchor_token(')');
2623 if (token.kind != ')') {
2624 attribute_t **anchor = &first;
2626 while (*anchor != NULL)
2627 anchor = &(*anchor)->next;
2629 attribute_t *attribute
2630 = parse_microsoft_extended_decl_modifier_single();
2631 if (attribute == NULL)
2634 *anchor = attribute;
2635 anchor = &attribute->next;
2636 } while (next_if(','));
2638 rem_anchor_token(')');
2643 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
2645 entity_t *const entity = allocate_entity_zero(kind, NAMESPACE_NORMAL, symbol, HERE);
2646 if (is_declaration(entity)) {
2647 entity->declaration.type = type_error_type;
2648 entity->declaration.implicit = true;
2649 } else if (kind == ENTITY_TYPEDEF) {
2650 entity->typedefe.type = type_error_type;
2651 entity->typedefe.builtin = true;
2653 if (kind != ENTITY_COMPOUND_MEMBER)
2654 record_entity(entity, false);
2658 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2660 type_t *type = NULL;
2661 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
2662 unsigned type_specifiers = 0;
2663 bool newtype = false;
2664 bool saw_error = false;
2666 memset(specifiers, 0, sizeof(*specifiers));
2667 specifiers->source_position = *HERE;
2670 specifiers->attributes = parse_attributes(specifiers->attributes);
2672 switch (token.kind) {
2674 #define MATCH_STORAGE_CLASS(token, class) \
2676 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
2677 errorf(HERE, "multiple storage classes in declaration specifiers"); \
2679 specifiers->storage_class = class; \
2680 if (specifiers->thread_local) \
2681 goto check_thread_storage_class; \
2685 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
2686 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
2687 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
2688 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
2689 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
2692 specifiers->attributes
2693 = parse_microsoft_extended_decl_modifier(specifiers->attributes);
2697 if (specifiers->thread_local) {
2698 errorf(HERE, "duplicate '__thread'");
2700 specifiers->thread_local = true;
2701 check_thread_storage_class:
2702 switch (specifiers->storage_class) {
2703 case STORAGE_CLASS_EXTERN:
2704 case STORAGE_CLASS_NONE:
2705 case STORAGE_CLASS_STATIC:
2709 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_storage_class;
2710 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_storage_class;
2711 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_storage_class;
2712 wrong_thread_storage_class:
2713 errorf(HERE, "'__thread' used with '%s'", wrong);
2720 /* type qualifiers */
2721 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
2723 qualifiers |= qualifier; \
2727 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
2728 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
2729 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
2730 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
2731 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
2732 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
2733 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
2734 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
2736 /* type specifiers */
2737 #define MATCH_SPECIFIER(token, specifier, name) \
2739 if (type_specifiers & specifier) { \
2740 errorf(HERE, "multiple " name " type specifiers given"); \
2742 type_specifiers |= specifier; \
2747 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
2748 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
2749 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
2750 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
2751 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
2752 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
2753 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
2754 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
2755 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
2756 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
2757 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
2758 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
2759 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
2760 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
2761 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
2762 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
2763 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
2764 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
2768 specifiers->is_inline = true;
2772 case T__forceinline:
2773 eat(T__forceinline);
2774 specifiers->modifiers |= DM_FORCEINLINE;
2779 if (type_specifiers & SPECIFIER_LONG_LONG) {
2780 errorf(HERE, "too many long type specifiers given");
2781 } else if (type_specifiers & SPECIFIER_LONG) {
2782 type_specifiers |= SPECIFIER_LONG_LONG;
2784 type_specifiers |= SPECIFIER_LONG;
2789 #define CHECK_DOUBLE_TYPE() \
2790 (type != NULL ? errorf(HERE, "multiple types in declaration specifiers") : (void)0)
2793 CHECK_DOUBLE_TYPE();
2794 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
2796 type->compound.compound = parse_compound_type_specifier(true);
2799 CHECK_DOUBLE_TYPE();
2800 type = allocate_type_zero(TYPE_COMPOUND_UNION);
2801 type->compound.compound = parse_compound_type_specifier(false);
2804 CHECK_DOUBLE_TYPE();
2805 type = parse_enum_specifier();
2808 CHECK_DOUBLE_TYPE();
2809 type = parse_typeof();
2811 case T___builtin_va_list:
2812 CHECK_DOUBLE_TYPE();
2813 type = duplicate_type(type_valist);
2814 eat(T___builtin_va_list);
2817 case T_IDENTIFIER: {
2818 /* only parse identifier if we haven't found a type yet */
2819 if (type != NULL || type_specifiers != 0) {
2820 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
2821 * declaration, so it doesn't generate errors about expecting '(' or
2823 switch (look_ahead(1)->kind) {
2830 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
2834 errorf(HERE, "discarding stray %K in declaration specifier", &token);
2839 goto finish_specifiers;
2843 type_t *const typedef_type = get_typedef_type(token.base.symbol);
2844 if (typedef_type == NULL) {
2845 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
2846 * declaration, so it doesn't generate 'implicit int' followed by more
2847 * errors later on. */
2848 token_kind_t const la1_type = (token_kind_t)look_ahead(1)->kind;
2854 errorf(HERE, "%K does not name a type", &token);
2856 entity_t *const entity = create_error_entity(token.base.symbol, ENTITY_TYPEDEF);
2858 type = allocate_type_zero(TYPE_TYPEDEF);
2859 type->typedeft.typedefe = &entity->typedefe;
2867 goto finish_specifiers;
2872 type = typedef_type;
2876 /* function specifier */
2878 goto finish_specifiers;
2883 specifiers->attributes = parse_attributes(specifiers->attributes);
2885 if (type == NULL || (saw_error && type_specifiers != 0)) {
2886 atomic_type_kind_t atomic_type;
2888 /* match valid basic types */
2889 switch (type_specifiers) {
2890 case SPECIFIER_VOID:
2891 atomic_type = ATOMIC_TYPE_VOID;
2893 case SPECIFIER_WCHAR_T:
2894 atomic_type = ATOMIC_TYPE_WCHAR_T;
2896 case SPECIFIER_CHAR:
2897 atomic_type = ATOMIC_TYPE_CHAR;
2899 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
2900 atomic_type = ATOMIC_TYPE_SCHAR;
2902 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
2903 atomic_type = ATOMIC_TYPE_UCHAR;
2905 case SPECIFIER_SHORT:
2906 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
2907 case SPECIFIER_SHORT | SPECIFIER_INT:
2908 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
2909 atomic_type = ATOMIC_TYPE_SHORT;
2911 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
2912 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
2913 atomic_type = ATOMIC_TYPE_USHORT;
2916 case SPECIFIER_SIGNED:
2917 case SPECIFIER_SIGNED | SPECIFIER_INT:
2918 atomic_type = ATOMIC_TYPE_INT;
2920 case SPECIFIER_UNSIGNED:
2921 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
2922 atomic_type = ATOMIC_TYPE_UINT;
2924 case SPECIFIER_LONG:
2925 case SPECIFIER_SIGNED | SPECIFIER_LONG:
2926 case SPECIFIER_LONG | SPECIFIER_INT:
2927 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
2928 atomic_type = ATOMIC_TYPE_LONG;
2930 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
2931 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
2932 atomic_type = ATOMIC_TYPE_ULONG;
2935 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2936 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2937 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
2938 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
2940 atomic_type = ATOMIC_TYPE_LONGLONG;
2941 goto warn_about_long_long;
2943 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2944 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
2946 atomic_type = ATOMIC_TYPE_ULONGLONG;
2947 warn_about_long_long:
2948 warningf(WARN_LONG_LONG, &specifiers->source_position, "ISO C90 does not support 'long long'");
2951 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
2952 atomic_type = unsigned_int8_type_kind;
2955 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
2956 atomic_type = unsigned_int16_type_kind;
2959 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
2960 atomic_type = unsigned_int32_type_kind;
2963 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
2964 atomic_type = unsigned_int64_type_kind;
2967 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
2968 atomic_type = unsigned_int128_type_kind;
2971 case SPECIFIER_INT8:
2972 case SPECIFIER_SIGNED | SPECIFIER_INT8:
2973 atomic_type = int8_type_kind;
2976 case SPECIFIER_INT16:
2977 case SPECIFIER_SIGNED | SPECIFIER_INT16:
2978 atomic_type = int16_type_kind;
2981 case SPECIFIER_INT32:
2982 case SPECIFIER_SIGNED | SPECIFIER_INT32:
2983 atomic_type = int32_type_kind;
2986 case SPECIFIER_INT64:
2987 case SPECIFIER_SIGNED | SPECIFIER_INT64:
2988 atomic_type = int64_type_kind;
2991 case SPECIFIER_INT128:
2992 case SPECIFIER_SIGNED | SPECIFIER_INT128:
2993 atomic_type = int128_type_kind;
2996 case SPECIFIER_FLOAT:
2997 atomic_type = ATOMIC_TYPE_FLOAT;
2999 case SPECIFIER_DOUBLE:
3000 atomic_type = ATOMIC_TYPE_DOUBLE;
3002 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3003 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3005 case SPECIFIER_BOOL:
3006 atomic_type = ATOMIC_TYPE_BOOL;
3008 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3009 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3010 atomic_type = ATOMIC_TYPE_FLOAT;
3012 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3013 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3014 atomic_type = ATOMIC_TYPE_DOUBLE;
3016 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3017 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3018 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3021 /* invalid specifier combination, give an error message */
3022 source_position_t const* const pos = &specifiers->source_position;
3023 if (type_specifiers == 0) {
3025 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
3026 if (!(c_mode & _CXX) && !strict_mode) {
3027 warningf(WARN_IMPLICIT_INT, pos, "no type specifiers in declaration, using 'int'");
3028 atomic_type = ATOMIC_TYPE_INT;
3031 errorf(pos, "no type specifiers given in declaration");
3034 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3035 (type_specifiers & SPECIFIER_UNSIGNED)) {
3036 errorf(pos, "signed and unsigned specifiers given");
3037 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3038 errorf(pos, "only integer types can be signed or unsigned");
3040 errorf(pos, "multiple datatypes in declaration");
3046 if (type_specifiers & SPECIFIER_COMPLEX) {
3047 type = allocate_type_zero(TYPE_COMPLEX);
3048 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3049 type = allocate_type_zero(TYPE_IMAGINARY);
3051 type = allocate_type_zero(TYPE_ATOMIC);
3053 type->atomic.akind = atomic_type;
3055 } else if (type_specifiers != 0) {
3056 errorf(&specifiers->source_position, "multiple datatypes in declaration");
3059 /* FIXME: check type qualifiers here */
3060 type->base.qualifiers = qualifiers;
3063 type = identify_new_type(type);
3065 type = typehash_insert(type);
3068 if (specifiers->attributes != NULL)
3069 type = handle_type_attributes(specifiers->attributes, type);
3070 specifiers->type = type;
3074 specifiers->type = type_error_type;
3077 static type_qualifiers_t parse_type_qualifiers(void)
3079 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3082 switch (token.kind) {
3083 /* type qualifiers */
3084 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3085 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3086 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3087 /* microsoft extended type modifiers */
3088 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3089 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3090 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3091 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3092 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3101 * Parses an K&R identifier list
3103 static void parse_identifier_list(scope_t *scope)
3105 assert(token.kind == T_IDENTIFIER);
3107 entity_t *const entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, token.base.symbol, HERE);
3108 /* a K&R parameter has no type, yet */
3112 append_entity(scope, entity);
3113 } while (next_if(',') && token.kind == T_IDENTIFIER);
3116 static entity_t *parse_parameter(void)
3118 declaration_specifiers_t specifiers;
3119 parse_declaration_specifiers(&specifiers);
3121 entity_t *entity = parse_declarator(&specifiers,
3122 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
3123 anonymous_entity = NULL;
3127 static void semantic_parameter_incomplete(const entity_t *entity)
3129 assert(entity->kind == ENTITY_PARAMETER);
3131 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
3132 * list in a function declarator that is part of a
3133 * definition of that function shall not have
3134 * incomplete type. */
3135 type_t *type = skip_typeref(entity->declaration.type);
3136 if (is_type_incomplete(type)) {
3137 errorf(&entity->base.source_position, "'%N' has incomplete type", entity);
3141 static bool has_parameters(void)
3143 /* func(void) is not a parameter */
3144 if (look_ahead(1)->kind != ')')
3146 if (token.kind == T_IDENTIFIER) {
3147 entity_t const *const entity = get_entity(token.base.symbol, NAMESPACE_NORMAL);
3150 if (entity->kind != ENTITY_TYPEDEF)
3152 type_t const *const type = skip_typeref(entity->typedefe.type);
3153 if (!is_type_void(type))
3155 if (c_mode & _CXX) {
3156 /* ISO/IEC 14882:1998(E) §8.3.5:2 It must be literally (void). A typedef
3157 * is not allowed. */
3158 errorf(HERE, "empty parameter list defined with a typedef of 'void' not allowed in C++");
3159 } else if (type->base.qualifiers != TYPE_QUALIFIER_NONE) {
3160 /* §6.7.5.3:10 Qualification is not allowed here. */
3161 errorf(HERE, "'void' as parameter must not have type qualifiers");
3163 } else if (token.kind != T_void) {
3171 * Parses function type parameters (and optionally creates variable_t entities
3172 * for them in a scope)
3174 static void parse_parameters(function_type_t *type, scope_t *scope)
3176 add_anchor_token(')');
3179 if (token.kind == T_IDENTIFIER &&
3180 !is_typedef_symbol(token.base.symbol) &&
3181 (look_ahead(1)->kind == ',' || look_ahead(1)->kind == ')')) {
3182 type->kr_style_parameters = true;
3183 parse_identifier_list(scope);
3184 } else if (token.kind == ')') {
3185 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
3186 if (!(c_mode & _CXX))
3187 type->unspecified_parameters = true;
3188 } else if (has_parameters()) {
3189 function_parameter_t **anchor = &type->parameters;
3190 add_anchor_token(',');
3192 switch (token.kind) {
3195 type->variadic = true;
3196 goto parameters_finished;
3201 entity_t *entity = parse_parameter();
3202 if (entity->kind == ENTITY_TYPEDEF) {
3203 errorf(&entity->base.source_position,
3204 "typedef not allowed as function parameter");
3207 assert(is_declaration(entity));
3209 semantic_parameter_incomplete(entity);
3211 function_parameter_t *const parameter =
3212 allocate_parameter(entity->declaration.type);
3214 if (scope != NULL) {
3215 append_entity(scope, entity);
3218 *anchor = parameter;
3219 anchor = ¶meter->next;
3224 goto parameters_finished;
3226 } while (next_if(','));
3227 parameters_finished:
3228 rem_anchor_token(',');
3231 rem_anchor_token(')');
3235 typedef enum construct_type_kind_t {
3236 CONSTRUCT_POINTER = 1,
3237 CONSTRUCT_REFERENCE,
3240 } construct_type_kind_t;
3242 typedef union construct_type_t construct_type_t;
3244 typedef struct construct_type_base_t {
3245 construct_type_kind_t kind;
3246 source_position_t pos;
3247 construct_type_t *next;
3248 } construct_type_base_t;
3250 typedef struct parsed_pointer_t {
3251 construct_type_base_t base;
3252 type_qualifiers_t type_qualifiers;
3253 variable_t *base_variable; /**< MS __based extension. */
3256 typedef struct parsed_reference_t {
3257 construct_type_base_t base;
3258 } parsed_reference_t;
3260 typedef struct construct_function_type_t {
3261 construct_type_base_t base;
3262 type_t *function_type;
3263 } construct_function_type_t;
3265 typedef struct parsed_array_t {
3266 construct_type_base_t base;
3267 type_qualifiers_t type_qualifiers;
3273 union construct_type_t {
3274 construct_type_kind_t kind;
3275 construct_type_base_t base;
3276 parsed_pointer_t pointer;
3277 parsed_reference_t reference;
3278 construct_function_type_t function;
3279 parsed_array_t array;
3282 static construct_type_t *allocate_declarator_zero(construct_type_kind_t const kind, size_t const size)
3284 construct_type_t *const cons = obstack_alloc(&temp_obst, size);
3285 memset(cons, 0, size);
3287 cons->base.pos = *HERE;
3292 static construct_type_t *parse_pointer_declarator(void)
3294 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_POINTER, sizeof(parsed_pointer_t));
3296 cons->pointer.type_qualifiers = parse_type_qualifiers();
3297 //cons->pointer.base_variable = base_variable;
3302 /* ISO/IEC 14882:1998(E) §8.3.2 */
3303 static construct_type_t *parse_reference_declarator(void)
3305 if (!(c_mode & _CXX))
3306 errorf(HERE, "references are only available for C++");
3308 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_REFERENCE, sizeof(parsed_reference_t));
3315 static construct_type_t *parse_array_declarator(void)
3317 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_ARRAY, sizeof(parsed_array_t));
3318 parsed_array_t *const array = &cons->array;
3321 add_anchor_token(']');
3323 bool is_static = next_if(T_static);
3325 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3328 is_static = next_if(T_static);
3330 array->type_qualifiers = type_qualifiers;
3331 array->is_static = is_static;
3333 expression_t *size = NULL;
3334 if (token.kind == '*' && look_ahead(1)->kind == ']') {
3335 array->is_variable = true;
3337 } else if (token.kind != ']') {
3338 size = parse_assignment_expression();
3340 /* §6.7.5.2:1 Array size must have integer type */
3341 type_t *const orig_type = size->base.type;
3342 type_t *const type = skip_typeref(orig_type);
3343 if (!is_type_integer(type) && is_type_valid(type)) {
3344 errorf(&size->base.source_position,
3345 "array size '%E' must have integer type but has type '%T'",
3350 mark_vars_read(size, NULL);
3353 if (is_static && size == NULL)
3354 errorf(&array->base.pos, "static array parameters require a size");
3356 rem_anchor_token(']');
3362 static construct_type_t *parse_function_declarator(scope_t *scope)
3364 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_FUNCTION, sizeof(construct_function_type_t));
3366 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3367 function_type_t *ftype = &type->function;
3369 ftype->linkage = current_linkage;
3370 ftype->calling_convention = CC_DEFAULT;
3372 parse_parameters(ftype, scope);
3374 cons->function.function_type = type;
3379 typedef struct parse_declarator_env_t {
3380 bool may_be_abstract : 1;
3381 bool must_be_abstract : 1;
3382 decl_modifiers_t modifiers;
3384 source_position_t source_position;
3386 attribute_t *attributes;
3387 } parse_declarator_env_t;
3390 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env)
3392 /* construct a single linked list of construct_type_t's which describe
3393 * how to construct the final declarator type */
3394 construct_type_t *first = NULL;
3395 construct_type_t **anchor = &first;
3397 env->attributes = parse_attributes(env->attributes);
3400 construct_type_t *type;
3401 //variable_t *based = NULL; /* MS __based extension */
3402 switch (token.kind) {
3404 type = parse_reference_declarator();
3408 panic("based not supported anymore");
3413 type = parse_pointer_declarator();
3417 goto ptr_operator_end;
3421 anchor = &type->base.next;
3423 /* TODO: find out if this is correct */
3424 env->attributes = parse_attributes(env->attributes);
3428 construct_type_t *inner_types = NULL;
3430 switch (token.kind) {
3432 if (env->must_be_abstract) {
3433 errorf(HERE, "no identifier expected in typename");
3435 env->symbol = token.base.symbol;
3436 env->source_position = *HERE;
3442 /* Parenthesized declarator or function declarator? */
3443 token_t const *const la1 = look_ahead(1);
3444 switch (la1->kind) {
3446 if (is_typedef_symbol(la1->base.symbol)) {
3448 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
3449 * interpreted as ``function with no parameter specification'', rather
3450 * than redundant parentheses around the omitted identifier. */
3452 /* Function declarator. */
3453 if (!env->may_be_abstract) {
3454 errorf(HERE, "function declarator must have a name");
3461 case T___attribute__: /* FIXME __attribute__ might also introduce a parameter of a function declarator. */
3462 /* Paranthesized declarator. */
3464 add_anchor_token(')');
3465 inner_types = parse_inner_declarator(env);
3466 if (inner_types != NULL) {
3467 /* All later declarators only modify the return type */
3468 env->must_be_abstract = true;
3470 rem_anchor_token(')');
3479 if (env->may_be_abstract)
3481 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3486 construct_type_t **const p = anchor;
3489 construct_type_t *type;
3490 switch (token.kind) {
3492 scope_t *scope = NULL;
3493 if (!env->must_be_abstract) {
3494 scope = &env->parameters;
3497 type = parse_function_declarator(scope);
3501 type = parse_array_declarator();
3504 goto declarator_finished;
3507 /* insert in the middle of the list (at p) */
3508 type->base.next = *p;
3511 anchor = &type->base.next;
3514 declarator_finished:
3515 /* append inner_types at the end of the list, we don't to set anchor anymore
3516 * as it's not needed anymore */
3517 *anchor = inner_types;
3522 static type_t *construct_declarator_type(construct_type_t *construct_list,
3525 construct_type_t *iter = construct_list;
3526 for (; iter != NULL; iter = iter->base.next) {
3527 source_position_t const* const pos = &iter->base.pos;
3528 switch (iter->kind) {
3529 case CONSTRUCT_FUNCTION: {
3530 construct_function_type_t *function = &iter->function;
3531 type_t *function_type = function->function_type;
3533 function_type->function.return_type = type;
3535 type_t *skipped_return_type = skip_typeref(type);
3537 if (is_type_function(skipped_return_type)) {
3538 errorf(pos, "function returning function is not allowed");
3539 } else if (is_type_array(skipped_return_type)) {
3540 errorf(pos, "function returning array is not allowed");
3542 if (skipped_return_type->base.qualifiers != 0) {
3543 warningf(WARN_IGNORED_QUALIFIERS, pos, "type qualifiers in return type of function type are meaningless");
3547 /* The function type was constructed earlier. Freeing it here will
3548 * destroy other types. */
3549 type = typehash_insert(function_type);
3553 case CONSTRUCT_POINTER: {
3554 if (is_type_reference(skip_typeref(type)))
3555 errorf(pos, "cannot declare a pointer to reference");
3557 parsed_pointer_t *pointer = &iter->pointer;
3558 type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
3562 case CONSTRUCT_REFERENCE:
3563 if (is_type_reference(skip_typeref(type)))
3564 errorf(pos, "cannot declare a reference to reference");
3566 type = make_reference_type(type);
3569 case CONSTRUCT_ARRAY: {
3570 if (is_type_reference(skip_typeref(type)))
3571 errorf(pos, "cannot declare an array of references");
3573 parsed_array_t *array = &iter->array;
3574 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
3576 expression_t *size_expression = array->size;
3577 if (size_expression != NULL) {
3579 = create_implicit_cast(size_expression, type_size_t);
3582 array_type->base.qualifiers = array->type_qualifiers;
3583 array_type->array.element_type = type;
3584 array_type->array.is_static = array->is_static;
3585 array_type->array.is_variable = array->is_variable;
3586 array_type->array.size_expression = size_expression;
3588 if (size_expression != NULL) {
3589 switch (is_constant_expression(size_expression)) {
3590 case EXPR_CLASS_CONSTANT: {
3591 long const size = fold_constant_to_int(size_expression);
3592 array_type->array.size = size;
3593 array_type->array.size_constant = true;
3594 /* §6.7.5.2:1 If the expression is a constant expression,
3595 * it shall have a value greater than zero. */
3597 errorf(&size_expression->base.source_position,
3598 "size of array must be greater than zero");
3599 } else if (size == 0 && !GNU_MODE) {
3600 errorf(&size_expression->base.source_position,
3601 "size of array must be greater than zero (zero length arrays are a GCC extension)");
3606 case EXPR_CLASS_VARIABLE:
3607 array_type->array.is_vla = true;
3610 case EXPR_CLASS_ERROR:
3615 type_t *skipped_type = skip_typeref(type);
3617 if (is_type_incomplete(skipped_type)) {
3618 errorf(pos, "array of incomplete type '%T' is not allowed", type);
3619 } else if (is_type_function(skipped_type)) {
3620 errorf(pos, "array of functions is not allowed");
3622 type = identify_new_type(array_type);
3626 internal_errorf(pos, "invalid type construction found");
3632 static type_t *automatic_type_conversion(type_t *orig_type);
3634 static type_t *semantic_parameter(const source_position_t *pos,
3636 const declaration_specifiers_t *specifiers,
3637 entity_t const *const param)
3639 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
3640 * shall be adjusted to ``qualified pointer to type'',
3642 * §6.7.5.3:8 A declaration of a parameter as ``function returning
3643 * type'' shall be adjusted to ``pointer to function
3644 * returning type'', as in 6.3.2.1. */
3645 type = automatic_type_conversion(type);
3647 if (specifiers->is_inline && is_type_valid(type)) {
3648 errorf(pos, "'%N' declared 'inline'", param);
3651 /* §6.9.1:6 The declarations in the declaration list shall contain
3652 * no storage-class specifier other than register and no
3653 * initializations. */
3654 if (specifiers->thread_local || (
3655 specifiers->storage_class != STORAGE_CLASS_NONE &&
3656 specifiers->storage_class != STORAGE_CLASS_REGISTER)
3658 errorf(pos, "invalid storage class for '%N'", param);
3661 /* delay test for incomplete type, because we might have (void)
3662 * which is legal but incomplete... */
3667 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
3668 declarator_flags_t flags)
3670 parse_declarator_env_t env;
3671 memset(&env, 0, sizeof(env));
3672 env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
3674 construct_type_t *construct_type = parse_inner_declarator(&env);
3676 construct_declarator_type(construct_type, specifiers->type);
3677 type_t *type = skip_typeref(orig_type);
3679 if (construct_type != NULL) {
3680 obstack_free(&temp_obst, construct_type);
3683 attribute_t *attributes = parse_attributes(env.attributes);
3684 /* append (shared) specifier attribute behind attributes of this
3686 attribute_t **anchor = &attributes;
3687 while (*anchor != NULL)
3688 anchor = &(*anchor)->next;
3689 *anchor = specifiers->attributes;
3692 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
3693 entity = allocate_entity_zero(ENTITY_TYPEDEF, NAMESPACE_NORMAL, env.symbol, &env.source_position);
3694 entity->typedefe.type = orig_type;
3696 if (anonymous_entity != NULL) {
3697 if (is_type_compound(type)) {
3698 assert(anonymous_entity->compound.alias == NULL);
3699 assert(anonymous_entity->kind == ENTITY_STRUCT ||
3700 anonymous_entity->kind == ENTITY_UNION);
3701 anonymous_entity->compound.alias = entity;
3702 anonymous_entity = NULL;
3703 } else if (is_type_enum(type)) {
3704 assert(anonymous_entity->enume.alias == NULL);
3705 assert(anonymous_entity->kind == ENTITY_ENUM);
3706 anonymous_entity->enume.alias = entity;
3707 anonymous_entity = NULL;
3711 /* create a declaration type entity */
3712 source_position_t const *const pos = env.symbol ? &env.source_position : &specifiers->source_position;
3713 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
3714 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, env.symbol, pos);
3716 if (env.symbol != NULL) {
3717 if (specifiers->is_inline && is_type_valid(type)) {
3718 errorf(&env.source_position, "'%N' declared 'inline'", entity);
3721 if (specifiers->thread_local ||
3722 specifiers->storage_class != STORAGE_CLASS_NONE) {
3723 errorf(&env.source_position, "'%N' must have no storage class", entity);
3726 } else if (flags & DECL_IS_PARAMETER) {
3727 entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, env.symbol, pos);
3728 orig_type = semantic_parameter(&env.source_position, orig_type, specifiers, entity);
3729 } else if (is_type_function(type)) {
3730 entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, env.symbol, pos);
3731 entity->function.is_inline = specifiers->is_inline;
3732 entity->function.elf_visibility = default_visibility;
3733 entity->function.parameters = env.parameters;
3735 if (env.symbol != NULL) {
3736 /* this needs fixes for C++ */
3737 bool in_function_scope = current_function != NULL;
3739 if (specifiers->thread_local || (
3740 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3741 specifiers->storage_class != STORAGE_CLASS_NONE &&
3742 (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
3744 errorf(&env.source_position, "invalid storage class for '%N'", entity);
3748 entity = allocate_entity_zero(ENTITY_VARIABLE, NAMESPACE_NORMAL, env.symbol, pos);
3749 entity->variable.elf_visibility = default_visibility;
3750 entity->variable.thread_local = specifiers->thread_local;
3752 if (env.symbol != NULL) {
3753 if (specifiers->is_inline && is_type_valid(type)) {
3754 errorf(&env.source_position, "'%N' declared 'inline'", entity);
3757 bool invalid_storage_class = false;
3758 if (current_scope == file_scope) {
3759 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3760 specifiers->storage_class != STORAGE_CLASS_NONE &&
3761 specifiers->storage_class != STORAGE_CLASS_STATIC) {
3762 invalid_storage_class = true;
3765 if (specifiers->thread_local &&
3766 specifiers->storage_class == STORAGE_CLASS_NONE) {
3767 invalid_storage_class = true;
3770 if (invalid_storage_class) {
3771 errorf(&env.source_position, "invalid storage class for '%N'", entity);
3776 entity->declaration.type = orig_type;
3777 entity->declaration.alignment = get_type_alignment(orig_type);
3778 entity->declaration.modifiers = env.modifiers;
3779 entity->declaration.attributes = attributes;
3781 storage_class_t storage_class = specifiers->storage_class;
3782 entity->declaration.declared_storage_class = storage_class;
3784 if (storage_class == STORAGE_CLASS_NONE && current_function != NULL)
3785 storage_class = STORAGE_CLASS_AUTO;
3786 entity->declaration.storage_class = storage_class;
3789 if (attributes != NULL) {
3790 handle_entity_attributes(attributes, entity);
3793 if (entity->kind == ENTITY_FUNCTION && !freestanding) {
3794 adapt_special_functions(&entity->function);
3800 static type_t *parse_abstract_declarator(type_t *base_type)
3802 parse_declarator_env_t env;
3803 memset(&env, 0, sizeof(env));
3804 env.may_be_abstract = true;
3805 env.must_be_abstract = true;
3807 construct_type_t *construct_type = parse_inner_declarator(&env);
3809 type_t *result = construct_declarator_type(construct_type, base_type);
3810 if (construct_type != NULL) {
3811 obstack_free(&temp_obst, construct_type);
3813 result = handle_type_attributes(env.attributes, result);
3819 * Check if the declaration of main is suspicious. main should be a
3820 * function with external linkage, returning int, taking either zero
3821 * arguments, two, or three arguments of appropriate types, ie.
3823 * int main([ int argc, char **argv [, char **env ] ]).
3825 * @param decl the declaration to check
3826 * @param type the function type of the declaration
3828 static void check_main(const entity_t *entity)
3830 const source_position_t *pos = &entity->base.source_position;
3831 if (entity->kind != ENTITY_FUNCTION) {
3832 warningf(WARN_MAIN, pos, "'main' is not a function");
3836 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
3837 warningf(WARN_MAIN, pos, "'main' is normally a non-static function");
3840 type_t *type = skip_typeref(entity->declaration.type);
3841 assert(is_type_function(type));
3843 function_type_t const *const func_type = &type->function;
3844 type_t *const ret_type = func_type->return_type;
3845 if (!types_compatible(skip_typeref(ret_type), type_int)) {
3846 warningf(WARN_MAIN, pos, "return type of 'main' should be 'int', but is '%T'", ret_type);
3848 const function_parameter_t *parm = func_type->parameters;
3850 type_t *const first_type = skip_typeref(parm->type);
3851 type_t *const first_type_unqual = get_unqualified_type(first_type);
3852 if (!types_compatible(first_type_unqual, type_int)) {
3853 warningf(WARN_MAIN, pos, "first argument of 'main' should be 'int', but is '%T'", parm->type);
3857 type_t *const second_type = skip_typeref(parm->type);
3858 type_t *const second_type_unqual
3859 = get_unqualified_type(second_type);
3860 if (!types_compatible(second_type_unqual, type_char_ptr_ptr)) {
3861 warningf(WARN_MAIN, pos, "second argument of 'main' should be 'char**', but is '%T'", parm->type);
3865 type_t *const third_type = skip_typeref(parm->type);
3866 type_t *const third_type_unqual
3867 = get_unqualified_type(third_type);
3868 if (!types_compatible(third_type_unqual, type_char_ptr_ptr)) {
3869 warningf(WARN_MAIN, pos, "third argument of 'main' should be 'char**', but is '%T'", parm->type);
3873 goto warn_arg_count;
3877 warningf(WARN_MAIN, pos, "'main' takes only zero, two or three arguments");
3882 static void error_redefined_as_different_kind(const source_position_t *pos,
3883 const entity_t *old, entity_kind_t new_kind)
3885 char const *const what = get_entity_kind_name(new_kind);
3886 source_position_t const *const ppos = &old->base.source_position;
3887 errorf(pos, "redeclaration of '%N' as %s (declared %P)", old, what, ppos);
3890 static bool is_entity_valid(entity_t *const ent)
3892 if (is_declaration(ent)) {
3893 return is_type_valid(skip_typeref(ent->declaration.type));
3894 } else if (ent->kind == ENTITY_TYPEDEF) {
3895 return is_type_valid(skip_typeref(ent->typedefe.type));
3900 static bool contains_attribute(const attribute_t *list, const attribute_t *attr)
3902 for (const attribute_t *tattr = list; tattr != NULL; tattr = tattr->next) {
3903 if (attributes_equal(tattr, attr))
3910 * test wether new_list contains any attributes not included in old_list
3912 static bool has_new_attributes(const attribute_t *old_list,
3913 const attribute_t *new_list)
3915 for (const attribute_t *attr = new_list; attr != NULL; attr = attr->next) {
3916 if (!contains_attribute(old_list, attr))
3923 * Merge in attributes from an attribute list (probably from a previous
3924 * declaration with the same name). Warning: destroys the old structure
3925 * of the attribute list - don't reuse attributes after this call.
3927 static void merge_in_attributes(declaration_t *decl, attribute_t *attributes)
3930 for (attribute_t *attr = attributes; attr != NULL; attr = next) {
3932 if (contains_attribute(decl->attributes, attr))
3935 /* move attribute to new declarations attributes list */
3936 attr->next = decl->attributes;
3937 decl->attributes = attr;
3941 static bool is_main(entity_t*);
3944 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
3945 * for various problems that occur for multiple definitions
3947 entity_t *record_entity(entity_t *entity, const bool is_definition)
3949 const symbol_t *const symbol = entity->base.symbol;
3950 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
3951 const source_position_t *pos = &entity->base.source_position;
3953 /* can happen in error cases */
3957 assert(!entity->base.parent_scope);
3958 assert(current_scope);
3959 entity->base.parent_scope = current_scope;
3961 entity_t *const previous_entity = get_entity(symbol, namespc);
3962 /* pushing the same entity twice will break the stack structure */
3963 assert(previous_entity != entity);
3965 if (entity->kind == ENTITY_FUNCTION) {
3966 type_t *const orig_type = entity->declaration.type;
3967 type_t *const type = skip_typeref(orig_type);
3969 assert(is_type_function(type));
3970 if (type->function.unspecified_parameters &&
3971 previous_entity == NULL &&
3972 !entity->declaration.implicit) {
3973 warningf(WARN_STRICT_PROTOTYPES, pos, "function declaration '%#N' is not a prototype", entity);
3976 if (is_main(entity)) {
3981 if (is_declaration(entity) &&
3982 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
3983 current_scope != file_scope &&
3984 !entity->declaration.implicit) {
3985 warningf(WARN_NESTED_EXTERNS, pos, "nested extern declaration of '%#N'", entity);
3988 if (previous_entity != NULL) {
3989 source_position_t const *const ppos = &previous_entity->base.source_position;
3991 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
3992 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
3993 assert(previous_entity->kind == ENTITY_PARAMETER);
3994 errorf(pos, "declaration of '%N' redeclares the '%N' (declared %P)", entity, previous_entity, ppos);
3998 if (previous_entity->base.parent_scope == current_scope) {
3999 if (previous_entity->kind != entity->kind) {
4000 if (is_entity_valid(previous_entity) && is_entity_valid(entity)) {
4001 error_redefined_as_different_kind(pos, previous_entity,
4006 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
4007 errorf(pos, "redeclaration of '%N' (declared %P)", entity, ppos);
4010 if (previous_entity->kind == ENTITY_TYPEDEF) {
4011 type_t *const type = skip_typeref(entity->typedefe.type);
4012 type_t *const prev_type
4013 = skip_typeref(previous_entity->typedefe.type);
4014 if (c_mode & _CXX) {
4015 /* C++ allows double typedef if they are identical
4016 * (after skipping typedefs) */
4017 if (type == prev_type)
4020 /* GCC extension: redef in system headers is allowed */
4021 if ((pos->is_system_header || ppos->is_system_header) &&
4022 types_compatible(type, prev_type))
4025 errorf(pos, "redefinition of '%N' (declared %P)",
4030 /* at this point we should have only VARIABLES or FUNCTIONS */
4031 assert(is_declaration(previous_entity) && is_declaration(entity));
4033 declaration_t *const prev_decl = &previous_entity->declaration;
4034 declaration_t *const decl = &entity->declaration;
4036 /* can happen for K&R style declarations */
4037 if (prev_decl->type == NULL &&
4038 previous_entity->kind == ENTITY_PARAMETER &&
4039 entity->kind == ENTITY_PARAMETER) {
4040 prev_decl->type = decl->type;
4041 prev_decl->storage_class = decl->storage_class;
4042 prev_decl->declared_storage_class = decl->declared_storage_class;
4043 prev_decl->modifiers = decl->modifiers;
4044 return previous_entity;
4047 type_t *const type = skip_typeref(decl->type);
4048 type_t *const prev_type = skip_typeref(prev_decl->type);
4050 if (!types_compatible(type, prev_type)) {
4051 errorf(pos, "declaration '%#N' is incompatible with '%#N' (declared %P)", entity, previous_entity, ppos);
4053 unsigned old_storage_class = prev_decl->storage_class;
4055 if (is_definition &&
4057 !(prev_decl->modifiers & DM_USED) &&
4058 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4059 warningf(WARN_REDUNDANT_DECLS, ppos, "unnecessary static forward declaration for '%#N'", previous_entity);
4062 storage_class_t new_storage_class = decl->storage_class;
4064 /* pretend no storage class means extern for function
4065 * declarations (except if the previous declaration is neither
4066 * none nor extern) */
4067 if (entity->kind == ENTITY_FUNCTION) {
4068 /* the previous declaration could have unspecified parameters or
4069 * be a typedef, so use the new type */
4070 if (prev_type->function.unspecified_parameters || is_definition)
4071 prev_decl->type = type;
4073 switch (old_storage_class) {
4074 case STORAGE_CLASS_NONE:
4075 old_storage_class = STORAGE_CLASS_EXTERN;
4078 case STORAGE_CLASS_EXTERN:
4079 if (is_definition) {
4080 if (prev_type->function.unspecified_parameters && !is_main(entity)) {
4081 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4083 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4084 new_storage_class = STORAGE_CLASS_EXTERN;
4091 } else if (is_type_incomplete(prev_type)) {
4092 prev_decl->type = type;
4095 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4096 new_storage_class == STORAGE_CLASS_EXTERN) {
4098 warn_redundant_declaration: ;
4100 = has_new_attributes(prev_decl->attributes,
4102 if (has_new_attrs) {
4103 merge_in_attributes(decl, prev_decl->attributes);
4104 } else if (!is_definition &&
4105 is_type_valid(prev_type) &&
4106 !pos->is_system_header) {
4107 warningf(WARN_REDUNDANT_DECLS, pos, "redundant declaration for '%N' (declared %P)", entity, ppos);
4109 } else if (current_function == NULL) {
4110 if (old_storage_class != STORAGE_CLASS_STATIC &&
4111 new_storage_class == STORAGE_CLASS_STATIC) {
4112 errorf(pos, "static declaration of '%N' follows non-static declaration (declared %P)", entity, ppos);
4113 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4114 prev_decl->storage_class = STORAGE_CLASS_NONE;
4115 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4117 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4119 goto error_redeclaration;
4120 goto warn_redundant_declaration;
4122 } else if (is_type_valid(prev_type)) {
4123 if (old_storage_class == new_storage_class) {
4124 error_redeclaration:
4125 errorf(pos, "redeclaration of '%N' (declared %P)", entity, ppos);
4127 errorf(pos, "redeclaration of '%N' with different linkage (declared %P)", entity, ppos);
4132 prev_decl->modifiers |= decl->modifiers;
4133 if (entity->kind == ENTITY_FUNCTION) {
4134 previous_entity->function.is_inline |= entity->function.is_inline;
4136 return previous_entity;
4140 if (is_warn_on(why = WARN_SHADOW) ||
4141 (is_warn_on(why = WARN_SHADOW_LOCAL) && previous_entity->base.parent_scope != file_scope)) {
4142 char const *const what = get_entity_kind_name(previous_entity->kind);
4143 warningf(why, pos, "'%N' shadows %s (declared %P)", entity, what, ppos);
4147 if (entity->kind == ENTITY_FUNCTION) {
4148 if (is_definition &&
4149 entity->declaration.storage_class != STORAGE_CLASS_STATIC &&
4151 if (is_warn_on(WARN_MISSING_PROTOTYPES)) {
4152 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4154 goto warn_missing_declaration;
4157 } else if (entity->kind == ENTITY_VARIABLE) {
4158 if (current_scope == file_scope &&
4159 entity->declaration.storage_class == STORAGE_CLASS_NONE &&
4160 !entity->declaration.implicit) {
4161 warn_missing_declaration:
4162 warningf(WARN_MISSING_DECLARATIONS, pos, "no previous declaration for '%#N'", entity);
4167 environment_push(entity);
4168 append_entity(current_scope, entity);
4173 static void parser_error_multiple_definition(entity_t *entity,
4174 const source_position_t *source_position)
4176 errorf(source_position, "redefinition of '%N' (declared %P)", entity, &entity->base.source_position);
4179 static bool is_declaration_specifier(const token_t *token)
4181 switch (token->kind) {
4185 return is_typedef_symbol(token->base.symbol);
4192 static void parse_init_declarator_rest(entity_t *entity)
4194 type_t *orig_type = type_error_type;
4196 if (entity->base.kind == ENTITY_TYPEDEF) {
4197 source_position_t const *const pos = &entity->base.source_position;
4198 errorf(pos, "'%N' is initialized (use __typeof__ instead)", entity);
4200 assert(is_declaration(entity));
4201 orig_type = entity->declaration.type;
4204 type_t *type = skip_typeref(orig_type);
4206 if (entity->kind == ENTITY_VARIABLE
4207 && entity->variable.initializer != NULL) {
4208 parser_error_multiple_definition(entity, HERE);
4212 declaration_t *const declaration = &entity->declaration;
4213 bool must_be_constant = false;
4214 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4215 entity->base.parent_scope == file_scope) {
4216 must_be_constant = true;
4219 if (is_type_function(type)) {
4220 source_position_t const *const pos = &entity->base.source_position;
4221 errorf(pos, "'%N' is initialized like a variable", entity);
4222 orig_type = type_error_type;
4225 parse_initializer_env_t env;
4226 env.type = orig_type;
4227 env.must_be_constant = must_be_constant;
4228 env.entity = entity;
4230 initializer_t *initializer = parse_initializer(&env);
4232 if (entity->kind == ENTITY_VARIABLE) {
4233 /* §6.7.5:22 array initializers for arrays with unknown size
4234 * determine the array type size */
4235 declaration->type = env.type;
4236 entity->variable.initializer = initializer;
4240 /* parse rest of a declaration without any declarator */
4241 static void parse_anonymous_declaration_rest(
4242 const declaration_specifiers_t *specifiers)
4245 anonymous_entity = NULL;
4247 source_position_t const *const pos = &specifiers->source_position;
4248 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4249 specifiers->thread_local) {
4250 warningf(WARN_OTHER, pos, "useless storage class in empty declaration");
4253 type_t *type = specifiers->type;
4254 switch (type->kind) {
4255 case TYPE_COMPOUND_STRUCT:
4256 case TYPE_COMPOUND_UNION: {
4257 if (type->compound.compound->base.symbol == NULL) {
4258 warningf(WARN_OTHER, pos, "unnamed struct/union that defines no instances");
4267 warningf(WARN_OTHER, pos, "empty declaration");
4272 static void check_variable_type_complete(entity_t *ent)
4274 if (ent->kind != ENTITY_VARIABLE)
4277 /* §6.7:7 If an identifier for an object is declared with no linkage, the
4278 * type for the object shall be complete [...] */
4279 declaration_t *decl = &ent->declaration;
4280 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4281 decl->storage_class == STORAGE_CLASS_STATIC)
4284 type_t *const type = skip_typeref(decl->type);
4285 if (!is_type_incomplete(type))
4288 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4289 * are given length one. */
4290 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4291 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4295 errorf(&ent->base.source_position, "variable '%#N' has incomplete type", ent);
4299 static void parse_declaration_rest(entity_t *ndeclaration,
4300 const declaration_specifiers_t *specifiers,
4301 parsed_declaration_func finished_declaration,
4302 declarator_flags_t flags)
4304 add_anchor_token(';');
4305 add_anchor_token(',');
4307 entity_t *entity = finished_declaration(ndeclaration, token.kind == '=');
4309 if (token.kind == '=') {
4310 parse_init_declarator_rest(entity);
4311 } else if (entity->kind == ENTITY_VARIABLE) {
4312 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
4313 * [...] where the extern specifier is explicitly used. */
4314 declaration_t *decl = &entity->declaration;
4315 if (decl->storage_class != STORAGE_CLASS_EXTERN &&
4316 is_type_reference(skip_typeref(decl->type))) {
4317 source_position_t const *const pos = &entity->base.source_position;
4318 errorf(pos, "reference '%#N' must be initialized", entity);
4322 check_variable_type_complete(entity);
4327 add_anchor_token('=');
4328 ndeclaration = parse_declarator(specifiers, flags);
4329 rem_anchor_token('=');
4331 rem_anchor_token(',');
4332 rem_anchor_token(';');
4335 anonymous_entity = NULL;
4338 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4340 symbol_t *symbol = entity->base.symbol;
4344 assert(entity->base.namespc == NAMESPACE_NORMAL);
4345 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4346 if (previous_entity == NULL
4347 || previous_entity->base.parent_scope != current_scope) {
4348 errorf(&entity->base.source_position, "expected declaration of a function parameter, found '%Y'",
4353 if (is_definition) {
4354 errorf(HERE, "'%N' is initialised", entity);
4357 return record_entity(entity, false);
4360 static void parse_declaration(parsed_declaration_func finished_declaration,
4361 declarator_flags_t flags)
4363 add_anchor_token(';');
4364 declaration_specifiers_t specifiers;
4365 parse_declaration_specifiers(&specifiers);
4366 rem_anchor_token(';');
4368 if (token.kind == ';') {
4369 parse_anonymous_declaration_rest(&specifiers);
4371 entity_t *entity = parse_declarator(&specifiers, flags);
4372 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4377 static type_t *get_default_promoted_type(type_t *orig_type)
4379 type_t *result = orig_type;
4381 type_t *type = skip_typeref(orig_type);
4382 if (is_type_integer(type)) {
4383 result = promote_integer(type);
4384 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4385 result = type_double;
4391 static void parse_kr_declaration_list(entity_t *entity)
4393 if (entity->kind != ENTITY_FUNCTION)
4396 type_t *type = skip_typeref(entity->declaration.type);
4397 assert(is_type_function(type));
4398 if (!type->function.kr_style_parameters)
4401 add_anchor_token('{');
4403 PUSH_SCOPE(&entity->function.parameters);
4405 entity_t *parameter = entity->function.parameters.entities;
4406 for ( ; parameter != NULL; parameter = parameter->base.next) {
4407 assert(parameter->base.parent_scope == NULL);
4408 parameter->base.parent_scope = current_scope;
4409 environment_push(parameter);
4412 /* parse declaration list */
4414 switch (token.kind) {
4416 /* This covers symbols, which are no type, too, and results in
4417 * better error messages. The typical cases are misspelled type
4418 * names and missing includes. */
4420 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4430 /* update function type */
4431 type_t *new_type = duplicate_type(type);
4433 function_parameter_t *parameters = NULL;
4434 function_parameter_t **anchor = ¶meters;
4436 /* did we have an earlier prototype? */
4437 entity_t *proto_type = get_entity(entity->base.symbol, NAMESPACE_NORMAL);
4438 if (proto_type != NULL && proto_type->kind != ENTITY_FUNCTION)
4441 function_parameter_t *proto_parameter = NULL;
4442 if (proto_type != NULL) {
4443 type_t *proto_type_type = proto_type->declaration.type;
4444 proto_parameter = proto_type_type->function.parameters;
4445 /* If a K&R function definition has a variadic prototype earlier, then
4446 * make the function definition variadic, too. This should conform to
4447 * §6.7.5.3:15 and §6.9.1:8. */
4448 new_type->function.variadic = proto_type_type->function.variadic;
4450 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
4452 new_type->function.unspecified_parameters = true;
4455 bool need_incompatible_warning = false;
4456 parameter = entity->function.parameters.entities;
4457 for (; parameter != NULL; parameter = parameter->base.next,
4459 proto_parameter == NULL ? NULL : proto_parameter->next) {
4460 if (parameter->kind != ENTITY_PARAMETER)
4463 type_t *parameter_type = parameter->declaration.type;
4464 if (parameter_type == NULL) {
4465 source_position_t const* const pos = ¶meter->base.source_position;
4467 errorf(pos, "no type specified for function '%N'", parameter);
4468 parameter_type = type_error_type;
4470 warningf(WARN_IMPLICIT_INT, pos, "no type specified for function parameter '%N', using 'int'", parameter);
4471 parameter_type = type_int;
4473 parameter->declaration.type = parameter_type;
4476 semantic_parameter_incomplete(parameter);
4478 /* we need the default promoted types for the function type */
4479 type_t *not_promoted = parameter_type;
4480 parameter_type = get_default_promoted_type(parameter_type);
4482 /* gcc special: if the type of the prototype matches the unpromoted
4483 * type don't promote */
4484 if (!strict_mode && proto_parameter != NULL) {
4485 type_t *proto_p_type = skip_typeref(proto_parameter->type);
4486 type_t *promo_skip = skip_typeref(parameter_type);
4487 type_t *param_skip = skip_typeref(not_promoted);
4488 if (!types_compatible(proto_p_type, promo_skip)
4489 && types_compatible(proto_p_type, param_skip)) {
4491 need_incompatible_warning = true;
4492 parameter_type = not_promoted;
4495 function_parameter_t *const function_parameter
4496 = allocate_parameter(parameter_type);
4498 *anchor = function_parameter;
4499 anchor = &function_parameter->next;
4502 new_type->function.parameters = parameters;
4503 new_type = identify_new_type(new_type);
4505 if (need_incompatible_warning) {
4506 symbol_t const *const sym = entity->base.symbol;
4507 source_position_t const *const pos = &entity->base.source_position;
4508 source_position_t const *const ppos = &proto_type->base.source_position;
4509 warningf(WARN_OTHER, pos, "declaration '%#N' is incompatible with '%#T' (declared %P)", proto_type, new_type, sym, ppos);
4511 entity->declaration.type = new_type;
4513 rem_anchor_token('{');
4516 static bool first_err = true;
4519 * When called with first_err set, prints the name of the current function,
4522 static void print_in_function(void)
4526 char const *const file = current_function->base.base.source_position.input_name;
4527 diagnosticf("%s: In '%N':\n", file, (entity_t const*)current_function);
4532 * Check if all labels are defined in the current function.
4533 * Check if all labels are used in the current function.
4535 static void check_labels(void)
4537 for (const goto_statement_t *goto_statement = goto_first;
4538 goto_statement != NULL;
4539 goto_statement = goto_statement->next) {
4540 label_t *label = goto_statement->label;
4541 if (label->base.source_position.input_name == NULL) {
4542 print_in_function();
4543 source_position_t const *const pos = &goto_statement->base.source_position;
4544 errorf(pos, "'%N' used but not defined", (entity_t const*)label);
4548 if (is_warn_on(WARN_UNUSED_LABEL)) {
4549 for (const label_statement_t *label_statement = label_first;
4550 label_statement != NULL;
4551 label_statement = label_statement->next) {
4552 label_t *label = label_statement->label;
4554 if (! label->used) {
4555 print_in_function();
4556 source_position_t const *const pos = &label_statement->base.source_position;
4557 warningf(WARN_UNUSED_LABEL, pos, "'%N' defined but not used", (entity_t const*)label);
4563 static void warn_unused_entity(warning_t const why, entity_t *entity, entity_t *const last)
4565 entity_t const *const end = last != NULL ? last->base.next : NULL;
4566 for (; entity != end; entity = entity->base.next) {
4567 if (!is_declaration(entity))
4570 declaration_t *declaration = &entity->declaration;
4571 if (declaration->implicit)
4574 if (!declaration->used) {
4575 print_in_function();
4576 warningf(why, &entity->base.source_position, "'%N' is unused", entity);
4577 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
4578 print_in_function();
4579 warningf(why, &entity->base.source_position, "'%N' is never read", entity);
4584 static void check_unused_variables(statement_t *const stmt, void *const env)
4588 switch (stmt->kind) {
4589 case STATEMENT_DECLARATION: {
4590 declaration_statement_t const *const decls = &stmt->declaration;
4591 warn_unused_entity(WARN_UNUSED_VARIABLE, decls->declarations_begin, decls->declarations_end);
4596 warn_unused_entity(WARN_UNUSED_VARIABLE, stmt->fors.scope.entities, NULL);
4605 * Check declarations of current_function for unused entities.
4607 static void check_declarations(void)
4609 if (is_warn_on(WARN_UNUSED_PARAMETER)) {
4610 const scope_t *scope = ¤t_function->parameters;
4611 warn_unused_entity(WARN_UNUSED_PARAMETER, scope->entities, NULL);
4613 if (is_warn_on(WARN_UNUSED_VARIABLE)) {
4614 walk_statements(current_function->statement, check_unused_variables,
4619 static int determine_truth(expression_t const* const cond)
4622 is_constant_expression(cond) != EXPR_CLASS_CONSTANT ? 0 :
4623 fold_constant_to_bool(cond) ? 1 :
4627 static void check_reachable(statement_t *);
4628 static bool reaches_end;
4630 static bool expression_returns(expression_t const *const expr)
4632 switch (expr->kind) {
4634 expression_t const *const func = expr->call.function;
4635 type_t const *const type = skip_typeref(func->base.type);
4636 if (type->kind == TYPE_POINTER) {
4637 type_t const *const points_to
4638 = skip_typeref(type->pointer.points_to);
4639 if (points_to->kind == TYPE_FUNCTION
4640 && points_to->function.modifiers & DM_NORETURN)
4644 if (!expression_returns(func))
4647 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
4648 if (!expression_returns(arg->expression))
4655 case EXPR_REFERENCE:
4656 case EXPR_ENUM_CONSTANT:
4657 case EXPR_LITERAL_CASES:
4658 case EXPR_STRING_LITERAL:
4659 case EXPR_WIDE_STRING_LITERAL:
4660 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
4661 case EXPR_LABEL_ADDRESS:
4662 case EXPR_CLASSIFY_TYPE:
4663 case EXPR_SIZEOF: // TODO handle obscure VLA case
4666 case EXPR_BUILTIN_CONSTANT_P:
4667 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
4672 case EXPR_STATEMENT: {
4673 bool old_reaches_end = reaches_end;
4674 reaches_end = false;
4675 check_reachable(expr->statement.statement);
4676 bool returns = reaches_end;
4677 reaches_end = old_reaches_end;
4681 case EXPR_CONDITIONAL:
4682 // TODO handle constant expression
4684 if (!expression_returns(expr->conditional.condition))
4687 if (expr->conditional.true_expression != NULL
4688 && expression_returns(expr->conditional.true_expression))
4691 return expression_returns(expr->conditional.false_expression);
4694 return expression_returns(expr->select.compound);
4696 case EXPR_ARRAY_ACCESS:
4698 expression_returns(expr->array_access.array_ref) &&
4699 expression_returns(expr->array_access.index);
4702 return expression_returns(expr->va_starte.ap);
4705 return expression_returns(expr->va_arge.ap);
4708 return expression_returns(expr->va_copye.src);
4710 case EXPR_UNARY_CASES_MANDATORY:
4711 return expression_returns(expr->unary.value);
4713 case EXPR_UNARY_THROW:
4716 case EXPR_BINARY_CASES:
4717 // TODO handle constant lhs of && and ||
4719 expression_returns(expr->binary.left) &&
4720 expression_returns(expr->binary.right);
4723 panic("unhandled expression");
4726 static bool initializer_returns(initializer_t const *const init)
4728 switch (init->kind) {
4729 case INITIALIZER_VALUE:
4730 return expression_returns(init->value.value);
4732 case INITIALIZER_LIST: {
4733 initializer_t * const* i = init->list.initializers;
4734 initializer_t * const* const end = i + init->list.len;
4735 bool returns = true;
4736 for (; i != end; ++i) {
4737 if (!initializer_returns(*i))
4743 case INITIALIZER_STRING:
4744 case INITIALIZER_WIDE_STRING:
4745 case INITIALIZER_DESIGNATOR: // designators have no payload
4748 panic("unhandled initializer");
4751 static bool noreturn_candidate;
4753 static void check_reachable(statement_t *const stmt)
4755 if (stmt->base.reachable)
4757 if (stmt->kind != STATEMENT_DO_WHILE)
4758 stmt->base.reachable = true;
4760 statement_t *last = stmt;
4762 switch (stmt->kind) {
4763 case STATEMENT_ERROR:
4764 case STATEMENT_EMPTY:
4766 next = stmt->base.next;
4769 case STATEMENT_DECLARATION: {
4770 declaration_statement_t const *const decl = &stmt->declaration;
4771 entity_t const * ent = decl->declarations_begin;
4772 entity_t const *const last_decl = decl->declarations_end;
4774 for (;; ent = ent->base.next) {
4775 if (ent->kind == ENTITY_VARIABLE &&
4776 ent->variable.initializer != NULL &&
4777 !initializer_returns(ent->variable.initializer)) {
4780 if (ent == last_decl)
4784 next = stmt->base.next;
4788 case STATEMENT_COMPOUND:
4789 next = stmt->compound.statements;
4791 next = stmt->base.next;
4794 case STATEMENT_RETURN: {
4795 expression_t const *const val = stmt->returns.value;
4796 if (val == NULL || expression_returns(val))
4797 noreturn_candidate = false;
4801 case STATEMENT_IF: {
4802 if_statement_t const *const ifs = &stmt->ifs;
4803 expression_t const *const cond = ifs->condition;
4805 if (!expression_returns(cond))
4808 int const val = determine_truth(cond);
4811 check_reachable(ifs->true_statement);
4816 if (ifs->false_statement != NULL) {
4817 check_reachable(ifs->false_statement);
4821 next = stmt->base.next;
4825 case STATEMENT_SWITCH: {
4826 switch_statement_t const *const switchs = &stmt->switchs;
4827 expression_t const *const expr = switchs->expression;
4829 if (!expression_returns(expr))
4832 if (is_constant_expression(expr) == EXPR_CLASS_CONSTANT) {
4833 long const val = fold_constant_to_int(expr);
4834 case_label_statement_t * defaults = NULL;
4835 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4836 if (i->expression == NULL) {
4841 if (i->first_case <= val && val <= i->last_case) {
4842 check_reachable((statement_t*)i);
4847 if (defaults != NULL) {
4848 check_reachable((statement_t*)defaults);
4852 bool has_default = false;
4853 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4854 if (i->expression == NULL)
4857 check_reachable((statement_t*)i);
4864 next = stmt->base.next;
4868 case STATEMENT_EXPRESSION: {
4869 /* Check for noreturn function call */
4870 expression_t const *const expr = stmt->expression.expression;
4871 if (!expression_returns(expr))
4874 next = stmt->base.next;
4878 case STATEMENT_CONTINUE:
4879 for (statement_t *parent = stmt;;) {
4880 parent = parent->base.parent;
4881 if (parent == NULL) /* continue not within loop */
4885 switch (parent->kind) {
4886 case STATEMENT_WHILE: goto continue_while;
4887 case STATEMENT_DO_WHILE: goto continue_do_while;
4888 case STATEMENT_FOR: goto continue_for;
4894 case STATEMENT_BREAK:
4895 for (statement_t *parent = stmt;;) {
4896 parent = parent->base.parent;
4897 if (parent == NULL) /* break not within loop/switch */
4900 switch (parent->kind) {
4901 case STATEMENT_SWITCH:
4902 case STATEMENT_WHILE:
4903 case STATEMENT_DO_WHILE:
4906 next = parent->base.next;
4907 goto found_break_parent;
4915 case STATEMENT_COMPUTED_GOTO: {
4916 if (!expression_returns(stmt->computed_goto.expression))
4919 statement_t *parent = stmt->base.parent;
4920 if (parent == NULL) /* top level goto */
4926 case STATEMENT_GOTO:
4927 next = stmt->gotos.label->statement;
4928 if (next == NULL) /* missing label */
4932 case STATEMENT_LABEL:
4933 next = stmt->label.statement;
4936 case STATEMENT_CASE_LABEL:
4937 next = stmt->case_label.statement;
4940 case STATEMENT_WHILE: {
4941 while_statement_t const *const whiles = &stmt->whiles;
4942 expression_t const *const cond = whiles->condition;
4944 if (!expression_returns(cond))
4947 int const val = determine_truth(cond);
4950 check_reachable(whiles->body);
4955 next = stmt->base.next;
4959 case STATEMENT_DO_WHILE:
4960 next = stmt->do_while.body;
4963 case STATEMENT_FOR: {
4964 for_statement_t *const fors = &stmt->fors;
4966 if (fors->condition_reachable)
4968 fors->condition_reachable = true;
4970 expression_t const *const cond = fors->condition;
4975 } else if (expression_returns(cond)) {
4976 val = determine_truth(cond);
4982 check_reachable(fors->body);
4987 next = stmt->base.next;
4991 case STATEMENT_MS_TRY: {
4992 ms_try_statement_t const *const ms_try = &stmt->ms_try;
4993 check_reachable(ms_try->try_statement);
4994 next = ms_try->final_statement;
4998 case STATEMENT_LEAVE: {
4999 statement_t *parent = stmt;
5001 parent = parent->base.parent;
5002 if (parent == NULL) /* __leave not within __try */
5005 if (parent->kind == STATEMENT_MS_TRY) {
5007 next = parent->ms_try.final_statement;
5015 panic("invalid statement kind");
5018 while (next == NULL) {
5019 next = last->base.parent;
5021 noreturn_candidate = false;
5023 type_t *const type = skip_typeref(current_function->base.type);
5024 assert(is_type_function(type));
5025 type_t *const ret = skip_typeref(type->function.return_type);
5026 if (!is_type_void(ret) &&
5027 is_type_valid(ret) &&
5028 !is_main(current_entity)) {
5029 source_position_t const *const pos = &stmt->base.source_position;
5030 warningf(WARN_RETURN_TYPE, pos, "control reaches end of non-void function");
5035 switch (next->kind) {
5036 case STATEMENT_ERROR:
5037 case STATEMENT_EMPTY:
5038 case STATEMENT_DECLARATION:
5039 case STATEMENT_EXPRESSION:
5041 case STATEMENT_RETURN:
5042 case STATEMENT_CONTINUE:
5043 case STATEMENT_BREAK:
5044 case STATEMENT_COMPUTED_GOTO:
5045 case STATEMENT_GOTO:
5046 case STATEMENT_LEAVE:
5047 panic("invalid control flow in function");
5049 case STATEMENT_COMPOUND:
5050 if (next->compound.stmt_expr) {
5056 case STATEMENT_SWITCH:
5057 case STATEMENT_LABEL:
5058 case STATEMENT_CASE_LABEL:
5060 next = next->base.next;
5063 case STATEMENT_WHILE: {
5065 if (next->base.reachable)
5067 next->base.reachable = true;
5069 while_statement_t const *const whiles = &next->whiles;
5070 expression_t const *const cond = whiles->condition;
5072 if (!expression_returns(cond))
5075 int const val = determine_truth(cond);
5078 check_reachable(whiles->body);
5084 next = next->base.next;
5088 case STATEMENT_DO_WHILE: {
5090 if (next->base.reachable)
5092 next->base.reachable = true;
5094 do_while_statement_t const *const dw = &next->do_while;
5095 expression_t const *const cond = dw->condition;
5097 if (!expression_returns(cond))
5100 int const val = determine_truth(cond);
5103 check_reachable(dw->body);
5109 next = next->base.next;
5113 case STATEMENT_FOR: {
5115 for_statement_t *const fors = &next->fors;
5117 fors->step_reachable = true;
5119 if (fors->condition_reachable)
5121 fors->condition_reachable = true;
5123 expression_t const *const cond = fors->condition;
5128 } else if (expression_returns(cond)) {
5129 val = determine_truth(cond);
5135 check_reachable(fors->body);
5141 next = next->base.next;
5145 case STATEMENT_MS_TRY:
5147 next = next->ms_try.final_statement;
5152 check_reachable(next);
5155 static void check_unreachable(statement_t* const stmt, void *const env)
5159 switch (stmt->kind) {
5160 case STATEMENT_DO_WHILE:
5161 if (!stmt->base.reachable) {
5162 expression_t const *const cond = stmt->do_while.condition;
5163 if (determine_truth(cond) >= 0) {
5164 source_position_t const *const pos = &cond->base.source_position;
5165 warningf(WARN_UNREACHABLE_CODE, pos, "condition of do-while-loop is unreachable");
5170 case STATEMENT_FOR: {
5171 for_statement_t const* const fors = &stmt->fors;
5173 // if init and step are unreachable, cond is unreachable, too
5174 if (!stmt->base.reachable && !fors->step_reachable) {
5175 goto warn_unreachable;
5177 if (!stmt->base.reachable && fors->initialisation != NULL) {
5178 source_position_t const *const pos = &fors->initialisation->base.source_position;
5179 warningf(WARN_UNREACHABLE_CODE, pos, "initialisation of for-statement is unreachable");
5182 if (!fors->condition_reachable && fors->condition != NULL) {
5183 source_position_t const *const pos = &fors->condition->base.source_position;
5184 warningf(WARN_UNREACHABLE_CODE, pos, "condition of for-statement is unreachable");
5187 if (!fors->step_reachable && fors->step != NULL) {
5188 source_position_t const *const pos = &fors->step->base.source_position;
5189 warningf(WARN_UNREACHABLE_CODE, pos, "step of for-statement is unreachable");
5195 case STATEMENT_COMPOUND:
5196 if (stmt->compound.statements != NULL)
5198 goto warn_unreachable;
5200 case STATEMENT_DECLARATION: {
5201 /* Only warn if there is at least one declarator with an initializer.
5202 * This typically occurs in switch statements. */
5203 declaration_statement_t const *const decl = &stmt->declaration;
5204 entity_t const * ent = decl->declarations_begin;
5205 entity_t const *const last = decl->declarations_end;
5207 for (;; ent = ent->base.next) {
5208 if (ent->kind == ENTITY_VARIABLE &&
5209 ent->variable.initializer != NULL) {
5210 goto warn_unreachable;
5220 if (!stmt->base.reachable) {
5221 source_position_t const *const pos = &stmt->base.source_position;
5222 warningf(WARN_UNREACHABLE_CODE, pos, "statement is unreachable");
5228 static bool is_main(entity_t *entity)
5230 static symbol_t *sym_main = NULL;
5231 if (sym_main == NULL) {
5232 sym_main = symbol_table_insert("main");
5235 if (entity->base.symbol != sym_main)
5237 /* must be in outermost scope */
5238 if (entity->base.parent_scope != file_scope)
5244 static void prepare_main_collect2(entity_t*);
5246 static void parse_external_declaration(void)
5248 /* function-definitions and declarations both start with declaration
5250 add_anchor_token(';');
5251 declaration_specifiers_t specifiers;
5252 parse_declaration_specifiers(&specifiers);
5253 rem_anchor_token(';');
5255 /* must be a declaration */
5256 if (token.kind == ';') {
5257 parse_anonymous_declaration_rest(&specifiers);
5261 add_anchor_token(',');
5262 add_anchor_token('=');
5263 add_anchor_token(';');
5264 add_anchor_token('{');
5266 /* declarator is common to both function-definitions and declarations */
5267 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
5269 rem_anchor_token('{');
5270 rem_anchor_token(';');
5271 rem_anchor_token('=');
5272 rem_anchor_token(',');
5274 /* must be a declaration */
5275 switch (token.kind) {
5279 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
5284 /* must be a function definition */
5285 parse_kr_declaration_list(ndeclaration);
5287 if (token.kind != '{') {
5288 parse_error_expected("while parsing function definition", '{', NULL);
5289 eat_until_matching_token(';');
5293 assert(is_declaration(ndeclaration));
5294 type_t *const orig_type = ndeclaration->declaration.type;
5295 type_t * type = skip_typeref(orig_type);
5297 if (!is_type_function(type)) {
5298 if (is_type_valid(type)) {
5299 errorf(HERE, "declarator '%#N' has a body but is not a function type", ndeclaration);
5305 source_position_t const *const pos = &ndeclaration->base.source_position;
5306 if (is_typeref(orig_type)) {
5308 errorf(pos, "type of function definition '%#N' is a typedef", ndeclaration);
5311 if (is_type_compound(skip_typeref(type->function.return_type))) {
5312 warningf(WARN_AGGREGATE_RETURN, pos, "'%N' returns an aggregate", ndeclaration);
5314 if (type->function.unspecified_parameters) {
5315 warningf(WARN_OLD_STYLE_DEFINITION, pos, "old-style definition of '%N'", ndeclaration);
5317 warningf(WARN_TRADITIONAL, pos, "traditional C rejects ISO C style definition of '%N'", ndeclaration);
5320 /* §6.7.5.3:14 a function definition with () means no
5321 * parameters (and not unspecified parameters) */
5322 if (type->function.unspecified_parameters &&
5323 type->function.parameters == NULL) {
5324 type_t *copy = duplicate_type(type);
5325 copy->function.unspecified_parameters = false;
5326 type = identify_new_type(copy);
5328 ndeclaration->declaration.type = type;
5331 entity_t *const entity = record_entity(ndeclaration, true);
5332 assert(entity->kind == ENTITY_FUNCTION);
5333 assert(ndeclaration->kind == ENTITY_FUNCTION);
5335 function_t *const function = &entity->function;
5336 if (ndeclaration != entity) {
5337 function->parameters = ndeclaration->function.parameters;
5340 PUSH_SCOPE(&function->parameters);
5342 entity_t *parameter = function->parameters.entities;
5343 for (; parameter != NULL; parameter = parameter->base.next) {
5344 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5345 parameter->base.parent_scope = current_scope;
5347 assert(parameter->base.parent_scope == NULL
5348 || parameter->base.parent_scope == current_scope);
5349 parameter->base.parent_scope = current_scope;
5350 if (parameter->base.symbol == NULL) {
5351 errorf(¶meter->base.source_position, "parameter name omitted");
5354 environment_push(parameter);
5357 if (function->statement != NULL) {
5358 parser_error_multiple_definition(entity, HERE);
5361 /* parse function body */
5362 int label_stack_top = label_top();
5363 function_t *old_current_function = current_function;
5364 current_function = function;
5365 PUSH_CURRENT_ENTITY(entity);
5369 goto_anchor = &goto_first;
5371 label_anchor = &label_first;
5373 statement_t *const body = parse_compound_statement(false);
5374 function->statement = body;
5377 check_declarations();
5378 if (is_warn_on(WARN_RETURN_TYPE) ||
5379 is_warn_on(WARN_UNREACHABLE_CODE) ||
5380 (is_warn_on(WARN_MISSING_NORETURN) && !(function->base.modifiers & DM_NORETURN))) {
5381 noreturn_candidate = true;
5382 check_reachable(body);
5383 if (is_warn_on(WARN_UNREACHABLE_CODE))
5384 walk_statements(body, check_unreachable, NULL);
5385 if (noreturn_candidate &&
5386 !(function->base.modifiers & DM_NORETURN)) {
5387 source_position_t const *const pos = &body->base.source_position;
5388 warningf(WARN_MISSING_NORETURN, pos, "function '%#N' is candidate for attribute 'noreturn'", entity);
5392 if (is_main(entity)) {
5393 /* Force main to C linkage. */
5394 type_t *const type = entity->declaration.type;
5395 assert(is_type_function(type));
5396 if (type->function.linkage != LINKAGE_C) {
5397 type_t *new_type = duplicate_type(type);
5398 new_type->function.linkage = LINKAGE_C;
5399 entity->declaration.type = identify_new_type(new_type);
5402 if (enable_main_collect2_hack)
5403 prepare_main_collect2(entity);
5406 POP_CURRENT_ENTITY();
5408 assert(current_function == function);
5409 current_function = old_current_function;
5410 label_pop_to(label_stack_top);
5416 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
5418 entity_t *iter = compound->members.entities;
5419 for (; iter != NULL; iter = iter->base.next) {
5420 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5423 if (iter->base.symbol == symbol) {
5425 } else if (iter->base.symbol == NULL) {
5426 /* search in anonymous structs and unions */
5427 type_t *type = skip_typeref(iter->declaration.type);
5428 if (is_type_compound(type)) {
5429 if (find_compound_entry(type->compound.compound, symbol)
5440 static void check_deprecated(const source_position_t *source_position,
5441 const entity_t *entity)
5443 if (!is_declaration(entity))
5445 if ((entity->declaration.modifiers & DM_DEPRECATED) == 0)
5448 source_position_t const *const epos = &entity->base.source_position;
5449 char const *const msg = get_deprecated_string(entity->declaration.attributes);
5451 warningf(WARN_DEPRECATED_DECLARATIONS, source_position, "'%N' is deprecated (declared %P): \"%s\"", entity, epos, msg);
5453 warningf(WARN_DEPRECATED_DECLARATIONS, source_position, "'%N' is deprecated (declared %P)", entity, epos);
5458 static expression_t *create_select(const source_position_t *pos,
5460 type_qualifiers_t qualifiers,
5463 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
5465 check_deprecated(pos, entry);
5467 expression_t *select = allocate_expression_zero(EXPR_SELECT);
5468 select->select.compound = addr;
5469 select->select.compound_entry = entry;
5471 type_t *entry_type = entry->declaration.type;
5472 type_t *res_type = get_qualified_type(entry_type, qualifiers);
5474 /* bitfields need special treatment */
5475 if (entry->compound_member.bitfield) {
5476 unsigned bit_size = entry->compound_member.bit_size;
5477 /* if fewer bits than an int, convert to int (see §6.3.1.1) */
5478 if (bit_size < get_atomic_type_size(ATOMIC_TYPE_INT) * BITS_PER_BYTE) {
5479 res_type = type_int;
5483 /* we always do the auto-type conversions; the & and sizeof parser contains
5484 * code to revert this! */
5485 select->base.type = automatic_type_conversion(res_type);
5492 * Find entry with symbol in compound. Search anonymous structs and unions and
5493 * creates implicit select expressions for them.
5494 * Returns the adress for the innermost compound.
5496 static expression_t *find_create_select(const source_position_t *pos,
5498 type_qualifiers_t qualifiers,
5499 compound_t *compound, symbol_t *symbol)
5501 entity_t *iter = compound->members.entities;
5502 for (; iter != NULL; iter = iter->base.next) {
5503 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5506 symbol_t *iter_symbol = iter->base.symbol;
5507 if (iter_symbol == NULL) {
5508 type_t *type = iter->declaration.type;
5509 if (type->kind != TYPE_COMPOUND_STRUCT
5510 && type->kind != TYPE_COMPOUND_UNION)
5513 compound_t *sub_compound = type->compound.compound;
5515 if (find_compound_entry(sub_compound, symbol) == NULL)
5518 expression_t *sub_addr = create_select(pos, addr, qualifiers, iter);
5519 sub_addr->base.source_position = *pos;
5520 sub_addr->base.implicit = true;
5521 return find_create_select(pos, sub_addr, qualifiers, sub_compound,
5525 if (iter_symbol == symbol) {
5526 return create_select(pos, addr, qualifiers, iter);
5533 static void parse_bitfield_member(entity_t *entity)
5537 expression_t *size = parse_constant_expression();
5540 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5541 type_t *type = entity->declaration.type;
5542 if (!is_type_integer(skip_typeref(type))) {
5543 errorf(HERE, "bitfield base type '%T' is not an integer type",
5547 if (is_constant_expression(size) != EXPR_CLASS_CONSTANT) {
5548 /* error already reported by parse_constant_expression */
5549 size_long = get_type_size(type) * 8;
5551 size_long = fold_constant_to_int(size);
5553 const symbol_t *symbol = entity->base.symbol;
5554 const symbol_t *user_symbol
5555 = symbol == NULL ? sym_anonymous : symbol;
5556 unsigned bit_size = get_type_size(type) * 8;
5557 if (size_long < 0) {
5558 errorf(HERE, "negative width in bit-field '%Y'", user_symbol);
5559 } else if (size_long == 0 && symbol != NULL) {
5560 errorf(HERE, "zero width for bit-field '%Y'", user_symbol);
5561 } else if (bit_size > 0 && (unsigned)size_long > bit_size) {
5562 errorf(HERE, "width of bitfield '%Y' exceeds its type",
5565 /* hope that people don't invent crazy types with more bits
5566 * than our struct can hold */
5568 (1 << sizeof(entity->compound_member.bit_size)*8));
5572 entity->compound_member.bitfield = true;
5573 entity->compound_member.bit_size = (unsigned char)size_long;
5576 static void parse_compound_declarators(compound_t *compound,
5577 const declaration_specifiers_t *specifiers)
5579 add_anchor_token(';');
5580 add_anchor_token(',');
5584 if (token.kind == ':') {
5585 /* anonymous bitfield */
5586 type_t *type = specifiers->type;
5587 entity_t *const entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, NULL, HERE);
5588 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
5589 entity->declaration.storage_class = STORAGE_CLASS_NONE;
5590 entity->declaration.type = type;
5592 parse_bitfield_member(entity);
5594 attribute_t *attributes = parse_attributes(NULL);
5595 attribute_t **anchor = &attributes;
5596 while (*anchor != NULL)
5597 anchor = &(*anchor)->next;
5598 *anchor = specifiers->attributes;
5599 if (attributes != NULL) {
5600 handle_entity_attributes(attributes, entity);
5602 entity->declaration.attributes = attributes;
5604 append_entity(&compound->members, entity);
5606 entity = parse_declarator(specifiers,
5607 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
5608 source_position_t const *const pos = &entity->base.source_position;
5609 if (entity->kind == ENTITY_TYPEDEF) {
5610 errorf(pos, "typedef not allowed as compound member");
5612 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5614 /* make sure we don't define a symbol multiple times */
5615 symbol_t *symbol = entity->base.symbol;
5616 if (symbol != NULL) {
5617 entity_t *prev = find_compound_entry(compound, symbol);
5619 source_position_t const *const ppos = &prev->base.source_position;
5620 errorf(pos, "multiple declarations of '%N' (declared %P)", entity, ppos);
5624 if (token.kind == ':') {
5625 parse_bitfield_member(entity);
5627 attribute_t *attributes = parse_attributes(NULL);
5628 handle_entity_attributes(attributes, entity);
5630 type_t *orig_type = entity->declaration.type;
5631 type_t *type = skip_typeref(orig_type);
5632 if (is_type_function(type)) {
5633 errorf(pos, "'%N' must not have function type '%T'", entity, orig_type);
5634 } else if (is_type_incomplete(type)) {
5635 /* §6.7.2.1:16 flexible array member */
5636 if (!is_type_array(type) ||
5637 token.kind != ';' ||
5638 look_ahead(1)->kind != '}') {
5639 errorf(pos, "'%N' has incomplete type '%T'", entity, orig_type);
5640 } else if (compound->members.entities == NULL) {
5641 errorf(pos, "flexible array member in otherwise empty struct");
5646 append_entity(&compound->members, entity);
5649 } while (next_if(','));
5650 rem_anchor_token(',');
5651 rem_anchor_token(';');
5654 anonymous_entity = NULL;
5657 static void parse_compound_type_entries(compound_t *compound)
5660 add_anchor_token('}');
5663 switch (token.kind) {
5665 case T___extension__:
5666 case T_IDENTIFIER: {
5668 declaration_specifiers_t specifiers;
5669 parse_declaration_specifiers(&specifiers);
5670 parse_compound_declarators(compound, &specifiers);
5676 rem_anchor_token('}');
5679 compound->complete = true;
5685 static type_t *parse_typename(void)
5687 declaration_specifiers_t specifiers;
5688 parse_declaration_specifiers(&specifiers);
5689 if (specifiers.storage_class != STORAGE_CLASS_NONE
5690 || specifiers.thread_local) {
5691 /* TODO: improve error message, user does probably not know what a
5692 * storage class is...
5694 errorf(&specifiers.source_position, "typename must not have a storage class");
5697 type_t *result = parse_abstract_declarator(specifiers.type);
5705 typedef expression_t* (*parse_expression_function)(void);
5706 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
5708 typedef struct expression_parser_function_t expression_parser_function_t;
5709 struct expression_parser_function_t {
5710 parse_expression_function parser;
5711 precedence_t infix_precedence;
5712 parse_expression_infix_function infix_parser;
5715 static expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5717 static type_t *get_string_type(void)
5719 return is_warn_on(WARN_WRITE_STRINGS) ? type_const_char_ptr : type_char_ptr;
5722 static type_t *get_wide_string_type(void)
5724 return is_warn_on(WARN_WRITE_STRINGS) ? type_const_wchar_t_ptr : type_wchar_t_ptr;
5728 * Parse a string constant.
5730 static expression_t *parse_string_literal(void)
5733 source_position_t const pos = *HERE;
5734 string_t const res = concat_string_literals(&is_wide);
5736 expression_t *literal;
5738 literal = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
5739 literal->base.type = get_wide_string_type();
5741 literal = allocate_expression_zero(EXPR_STRING_LITERAL);
5742 literal->base.type = get_string_type();
5744 literal->base.source_position = pos;
5745 literal->literal.value = res;
5751 * Parse a boolean constant.
5753 static expression_t *parse_boolean_literal(bool value)
5755 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_BOOLEAN);
5756 literal->base.type = type_bool;
5757 literal->literal.value.begin = value ? "true" : "false";
5758 literal->literal.value.size = value ? 4 : 5;
5760 eat(value ? T_true : T_false);
5764 static void warn_traditional_suffix(void)
5766 warningf(WARN_TRADITIONAL, HERE, "traditional C rejects the '%S' suffix",
5767 &token.number.suffix);
5770 static void check_integer_suffix(void)
5772 const string_t *suffix = &token.number.suffix;
5773 if (suffix->size == 0)
5776 bool not_traditional = false;
5777 const char *c = suffix->begin;
5778 if (*c == 'l' || *c == 'L') {
5781 not_traditional = true;
5783 if (*c == 'u' || *c == 'U') {
5786 } else if (*c == 'u' || *c == 'U') {
5787 not_traditional = true;
5790 } else if (*c == 'u' || *c == 'U') {
5791 not_traditional = true;
5793 if (*c == 'l' || *c == 'L') {
5801 errorf(HERE, "invalid suffix '%S' on integer constant", suffix);
5802 } else if (not_traditional) {
5803 warn_traditional_suffix();
5807 static type_t *check_floatingpoint_suffix(void)
5809 const string_t *suffix = &token.number.suffix;
5810 type_t *type = type_double;
5811 if (suffix->size == 0)
5814 bool not_traditional = false;
5815 const char *c = suffix->begin;
5816 if (*c == 'f' || *c == 'F') {
5819 } else if (*c == 'l' || *c == 'L') {
5821 type = type_long_double;
5824 errorf(HERE, "invalid suffix '%S' on floatingpoint constant", suffix);
5825 } else if (not_traditional) {
5826 warn_traditional_suffix();
5833 * Parse an integer constant.
5835 static expression_t *parse_number_literal(void)
5837 expression_kind_t kind;
5840 switch (token.kind) {
5842 kind = EXPR_LITERAL_INTEGER;
5843 check_integer_suffix();
5847 case T_FLOATINGPOINT:
5848 kind = EXPR_LITERAL_FLOATINGPOINT;
5849 type = check_floatingpoint_suffix();
5853 panic("unexpected token type in parse_number_literal");
5856 expression_t *literal = allocate_expression_zero(kind);
5857 literal->base.type = type;
5858 literal->literal.value = token.number.number;
5859 literal->literal.suffix = token.number.suffix;
5862 /* integer type depends on the size of the number and the size
5863 * representable by the types. The backend/codegeneration has to determine
5866 determine_literal_type(&literal->literal);
5871 * Parse a character constant.
5873 static expression_t *parse_character_constant(void)
5875 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_CHARACTER);
5876 literal->base.type = c_mode & _CXX ? type_char : type_int;
5877 literal->literal.value = token.string.string;
5879 size_t len = literal->literal.value.size;
5881 if (!GNU_MODE && !(c_mode & _C99)) {
5882 errorf(HERE, "more than 1 character in character constant");
5884 literal->base.type = type_int;
5885 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
5889 eat(T_CHARACTER_CONSTANT);
5894 * Parse a wide character constant.
5896 static expression_t *parse_wide_character_constant(void)
5898 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_WIDE_CHARACTER);
5899 literal->base.type = type_int;
5900 literal->literal.value = token.string.string;
5902 size_t len = wstrlen(&literal->literal.value);
5904 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
5907 eat(T_WIDE_CHARACTER_CONSTANT);
5911 static entity_t *create_implicit_function(symbol_t *symbol, source_position_t const *const pos)
5913 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
5914 ntype->function.return_type = type_int;
5915 ntype->function.unspecified_parameters = true;
5916 ntype->function.linkage = LINKAGE_C;
5917 type_t *type = identify_new_type(ntype);
5919 entity_t *const entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, symbol, pos);
5920 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
5921 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
5922 entity->declaration.type = type;
5923 entity->declaration.implicit = true;
5925 if (current_scope != NULL)
5926 record_entity(entity, false);
5932 * Performs automatic type cast as described in §6.3.2.1.
5934 * @param orig_type the original type
5936 static type_t *automatic_type_conversion(type_t *orig_type)
5938 type_t *type = skip_typeref(orig_type);
5939 if (is_type_array(type)) {
5940 array_type_t *array_type = &type->array;
5941 type_t *element_type = array_type->element_type;
5942 unsigned qualifiers = array_type->base.qualifiers;
5944 return make_pointer_type(element_type, qualifiers);
5947 if (is_type_function(type)) {
5948 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
5955 * reverts the automatic casts of array to pointer types and function
5956 * to function-pointer types as defined §6.3.2.1
5958 type_t *revert_automatic_type_conversion(const expression_t *expression)
5960 switch (expression->kind) {
5961 case EXPR_REFERENCE: {
5962 entity_t *entity = expression->reference.entity;
5963 if (is_declaration(entity)) {
5964 return entity->declaration.type;
5965 } else if (entity->kind == ENTITY_ENUM_VALUE) {
5966 return entity->enum_value.enum_type;
5968 panic("no declaration or enum in reference");
5973 entity_t *entity = expression->select.compound_entry;
5974 assert(is_declaration(entity));
5975 type_t *type = entity->declaration.type;
5976 return get_qualified_type(type, expression->base.type->base.qualifiers);
5979 case EXPR_UNARY_DEREFERENCE: {
5980 const expression_t *const value = expression->unary.value;
5981 type_t *const type = skip_typeref(value->base.type);
5982 if (!is_type_pointer(type))
5983 return type_error_type;
5984 return type->pointer.points_to;
5987 case EXPR_ARRAY_ACCESS: {
5988 const expression_t *array_ref = expression->array_access.array_ref;
5989 type_t *type_left = skip_typeref(array_ref->base.type);
5990 if (!is_type_pointer(type_left))
5991 return type_error_type;
5992 return type_left->pointer.points_to;
5995 case EXPR_STRING_LITERAL: {
5996 size_t size = expression->string_literal.value.size;
5997 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6000 case EXPR_WIDE_STRING_LITERAL: {
6001 size_t size = wstrlen(&expression->string_literal.value);
6002 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6005 case EXPR_COMPOUND_LITERAL:
6006 return expression->compound_literal.type;
6011 return expression->base.type;
6015 * Find an entity matching a symbol in a scope.
6016 * Uses current scope if scope is NULL
6018 static entity_t *lookup_entity(const scope_t *scope, symbol_t *symbol,
6019 namespace_tag_t namespc)
6021 if (scope == NULL) {
6022 return get_entity(symbol, namespc);
6025 /* we should optimize here, if scope grows above a certain size we should
6026 construct a hashmap here... */
6027 entity_t *entity = scope->entities;
6028 for ( ; entity != NULL; entity = entity->base.next) {
6029 if (entity->base.symbol == symbol
6030 && (namespace_tag_t)entity->base.namespc == namespc)
6037 static entity_t *parse_qualified_identifier(void)
6039 /* namespace containing the symbol */
6041 source_position_t pos;
6042 const scope_t *lookup_scope = NULL;
6044 if (next_if(T_COLONCOLON))
6045 lookup_scope = &unit->scope;
6049 symbol = expect_identifier("while parsing identifier", &pos);
6051 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6054 entity = lookup_entity(lookup_scope, symbol, NAMESPACE_NORMAL);
6056 if (!next_if(T_COLONCOLON))
6059 switch (entity->kind) {
6060 case ENTITY_NAMESPACE:
6061 lookup_scope = &entity->namespacee.members;
6066 lookup_scope = &entity->compound.members;
6069 errorf(&pos, "'%Y' must be a namespace, class, struct or union (but is a %s)",
6070 symbol, get_entity_kind_name(entity->kind));
6072 /* skip further qualifications */
6073 while (next_if(T_IDENTIFIER) && next_if(T_COLONCOLON)) {}
6075 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6079 if (entity == NULL) {
6080 if (!strict_mode && token.kind == '(') {
6081 /* an implicitly declared function */
6082 entity = create_implicit_function(symbol, &pos);
6083 warningf(WARN_IMPLICIT_FUNCTION_DECLARATION, &pos, "implicit declaration of '%N'", entity);
6085 errorf(&pos, "unknown identifier '%Y' found.", symbol);
6086 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6093 static expression_t *parse_reference(void)
6095 source_position_t const pos = *HERE;
6096 entity_t *const entity = parse_qualified_identifier();
6099 if (is_declaration(entity)) {
6100 orig_type = entity->declaration.type;
6101 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6102 orig_type = entity->enum_value.enum_type;
6104 panic("expected declaration or enum value in reference");
6107 /* we always do the auto-type conversions; the & and sizeof parser contains
6108 * code to revert this! */
6109 type_t *type = automatic_type_conversion(orig_type);
6111 expression_kind_t kind = EXPR_REFERENCE;
6112 if (entity->kind == ENTITY_ENUM_VALUE)
6113 kind = EXPR_ENUM_CONSTANT;
6115 expression_t *expression = allocate_expression_zero(kind);
6116 expression->base.source_position = pos;
6117 expression->base.type = type;
6118 expression->reference.entity = entity;
6120 /* this declaration is used */
6121 if (is_declaration(entity)) {
6122 entity->declaration.used = true;
6125 if (entity->base.parent_scope != file_scope
6126 && (current_function != NULL
6127 && entity->base.parent_scope->depth < current_function->parameters.depth)
6128 && (entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER)) {
6129 /* access of a variable from an outer function */
6130 entity->variable.address_taken = true;
6131 current_function->need_closure = true;
6134 check_deprecated(&pos, entity);
6139 static bool semantic_cast(expression_t *cast)
6141 expression_t *expression = cast->unary.value;
6142 type_t *orig_dest_type = cast->base.type;
6143 type_t *orig_type_right = expression->base.type;
6144 type_t const *dst_type = skip_typeref(orig_dest_type);
6145 type_t const *src_type = skip_typeref(orig_type_right);
6146 source_position_t const *pos = &cast->base.source_position;
6148 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6149 if (is_type_void(dst_type))
6152 /* only integer and pointer can be casted to pointer */
6153 if (is_type_pointer(dst_type) &&
6154 !is_type_pointer(src_type) &&
6155 !is_type_integer(src_type) &&
6156 is_type_valid(src_type)) {
6157 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6161 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6162 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6166 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6167 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6171 if (is_type_pointer(src_type) && is_type_pointer(dst_type)) {
6172 type_t *src = skip_typeref(src_type->pointer.points_to);
6173 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6174 unsigned missing_qualifiers =
6175 src->base.qualifiers & ~dst->base.qualifiers;
6176 if (missing_qualifiers != 0) {
6177 warningf(WARN_CAST_QUAL, pos, "cast discards qualifiers '%Q' in pointer target type of '%T'", missing_qualifiers, orig_type_right);
6183 static expression_t *parse_compound_literal(source_position_t const *const pos, type_t *type)
6185 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6186 expression->base.source_position = *pos;
6188 parse_initializer_env_t env;
6191 env.must_be_constant = false;
6192 initializer_t *initializer = parse_initializer(&env);
6195 expression->compound_literal.initializer = initializer;
6196 expression->compound_literal.type = type;
6197 expression->base.type = automatic_type_conversion(type);
6203 * Parse a cast expression.
6205 static expression_t *parse_cast(void)
6207 source_position_t const pos = *HERE;
6210 add_anchor_token(')');
6212 type_t *type = parse_typename();
6214 rem_anchor_token(')');
6217 if (token.kind == '{') {
6218 return parse_compound_literal(&pos, type);
6221 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6222 cast->base.source_position = pos;
6224 expression_t *value = parse_subexpression(PREC_CAST);
6225 cast->base.type = type;
6226 cast->unary.value = value;
6228 if (! semantic_cast(cast)) {
6229 /* TODO: record the error in the AST. else it is impossible to detect it */
6236 * Parse a statement expression.
6238 static expression_t *parse_statement_expression(void)
6240 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6243 add_anchor_token(')');
6245 statement_t *statement = parse_compound_statement(true);
6246 statement->compound.stmt_expr = true;
6247 expression->statement.statement = statement;
6249 /* find last statement and use its type */
6250 type_t *type = type_void;
6251 const statement_t *stmt = statement->compound.statements;
6253 while (stmt->base.next != NULL)
6254 stmt = stmt->base.next;
6256 if (stmt->kind == STATEMENT_EXPRESSION) {
6257 type = stmt->expression.expression->base.type;
6260 source_position_t const *const pos = &expression->base.source_position;
6261 warningf(WARN_OTHER, pos, "empty statement expression ({})");
6263 expression->base.type = type;
6265 rem_anchor_token(')');
6271 * Parse a parenthesized expression.
6273 static expression_t *parse_parenthesized_expression(void)
6275 token_t const* const la1 = look_ahead(1);
6276 switch (la1->kind) {
6278 /* gcc extension: a statement expression */
6279 return parse_statement_expression();
6282 if (is_typedef_symbol(la1->base.symbol)) {
6284 return parse_cast();
6289 add_anchor_token(')');
6290 expression_t *result = parse_expression();
6291 result->base.parenthesized = true;
6292 rem_anchor_token(')');
6298 static expression_t *parse_function_keyword(funcname_kind_t const kind)
6300 if (current_function == NULL) {
6301 errorf(HERE, "'%K' used outside of a function", &token);
6304 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6305 expression->base.type = type_char_ptr;
6306 expression->funcname.kind = kind;
6313 static designator_t *parse_designator(void)
6315 designator_t *const result = allocate_ast_zero(sizeof(result[0]));
6316 result->symbol = expect_identifier("while parsing member designator", &result->source_position);
6317 if (!result->symbol)
6320 designator_t *last_designator = result;
6323 designator_t *const designator = allocate_ast_zero(sizeof(result[0]));
6324 designator->symbol = expect_identifier("while parsing member designator", &designator->source_position);
6325 if (!designator->symbol)
6328 last_designator->next = designator;
6329 last_designator = designator;
6333 add_anchor_token(']');
6334 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6335 designator->source_position = *HERE;
6336 designator->array_index = parse_expression();
6337 rem_anchor_token(']');
6339 if (designator->array_index == NULL) {
6343 last_designator->next = designator;
6344 last_designator = designator;
6354 * Parse the __builtin_offsetof() expression.
6356 static expression_t *parse_offsetof(void)
6358 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6359 expression->base.type = type_size_t;
6361 eat(T___builtin_offsetof);
6363 add_anchor_token(')');
6364 add_anchor_token(',');
6366 type_t *type = parse_typename();
6367 rem_anchor_token(',');
6369 designator_t *designator = parse_designator();
6370 rem_anchor_token(')');
6373 expression->offsetofe.type = type;
6374 expression->offsetofe.designator = designator;
6377 memset(&path, 0, sizeof(path));
6378 path.top_type = type;
6379 path.path = NEW_ARR_F(type_path_entry_t, 0);
6381 descend_into_subtype(&path);
6383 if (!walk_designator(&path, designator, true)) {
6384 return create_error_expression();
6387 DEL_ARR_F(path.path);
6392 static bool is_last_parameter(expression_t *const param)
6394 if (param->kind == EXPR_REFERENCE) {
6395 entity_t *const entity = param->reference.entity;
6396 if (entity->kind == ENTITY_PARAMETER &&
6397 !entity->base.next &&
6398 entity->base.parent_scope == ¤t_function->parameters) {
6403 if (!is_type_valid(skip_typeref(param->base.type)))
6410 * Parses a __builtin_va_start() expression.
6412 static expression_t *parse_va_start(void)
6414 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6416 eat(T___builtin_va_start);
6418 add_anchor_token(')');
6419 add_anchor_token(',');
6421 expression->va_starte.ap = parse_assignment_expression();
6422 rem_anchor_token(',');
6424 expression_t *const param = parse_assignment_expression();
6425 expression->va_starte.parameter = param;
6426 rem_anchor_token(')');
6429 if (!current_function) {
6430 errorf(&expression->base.source_position, "'va_start' used outside of function");
6431 } else if (!current_function->base.type->function.variadic) {
6432 errorf(&expression->base.source_position, "'va_start' used in non-variadic function");
6433 } else if (!is_last_parameter(param)) {
6434 errorf(¶m->base.source_position, "second argument of 'va_start' must be last parameter of the current function");
6441 * Parses a __builtin_va_arg() expression.
6443 static expression_t *parse_va_arg(void)
6445 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6447 eat(T___builtin_va_arg);
6449 add_anchor_token(')');
6450 add_anchor_token(',');
6453 ap.expression = parse_assignment_expression();
6454 expression->va_arge.ap = ap.expression;
6455 check_call_argument(type_valist, &ap, 1);
6457 rem_anchor_token(',');
6459 expression->base.type = parse_typename();
6460 rem_anchor_token(')');
6467 * Parses a __builtin_va_copy() expression.
6469 static expression_t *parse_va_copy(void)
6471 expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
6473 eat(T___builtin_va_copy);
6475 add_anchor_token(')');
6476 add_anchor_token(',');
6478 expression_t *dst = parse_assignment_expression();
6479 assign_error_t error = semantic_assign(type_valist, dst);
6480 report_assign_error(error, type_valist, dst, "call argument 1",
6481 &dst->base.source_position);
6482 expression->va_copye.dst = dst;
6484 rem_anchor_token(',');
6487 call_argument_t src;
6488 src.expression = parse_assignment_expression();
6489 check_call_argument(type_valist, &src, 2);
6490 expression->va_copye.src = src.expression;
6491 rem_anchor_token(')');
6498 * Parses a __builtin_constant_p() expression.
6500 static expression_t *parse_builtin_constant(void)
6502 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6504 eat(T___builtin_constant_p);
6506 add_anchor_token(')');
6508 expression->builtin_constant.value = parse_assignment_expression();
6509 rem_anchor_token(')');
6511 expression->base.type = type_int;
6517 * Parses a __builtin_types_compatible_p() expression.
6519 static expression_t *parse_builtin_types_compatible(void)
6521 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
6523 eat(T___builtin_types_compatible_p);
6525 add_anchor_token(')');
6526 add_anchor_token(',');
6528 expression->builtin_types_compatible.left = parse_typename();
6529 rem_anchor_token(',');
6531 expression->builtin_types_compatible.right = parse_typename();
6532 rem_anchor_token(')');
6534 expression->base.type = type_int;
6540 * Parses a __builtin_is_*() compare expression.
6542 static expression_t *parse_compare_builtin(void)
6544 expression_kind_t kind;
6545 switch (token.kind) {
6546 case T___builtin_isgreater: kind = EXPR_BINARY_ISGREATER; break;
6547 case T___builtin_isgreaterequal: kind = EXPR_BINARY_ISGREATEREQUAL; break;
6548 case T___builtin_isless: kind = EXPR_BINARY_ISLESS; break;
6549 case T___builtin_islessequal: kind = EXPR_BINARY_ISLESSEQUAL; break;
6550 case T___builtin_islessgreater: kind = EXPR_BINARY_ISLESSGREATER; break;
6551 case T___builtin_isunordered: kind = EXPR_BINARY_ISUNORDERED; break;
6552 default: internal_errorf(HERE, "invalid compare builtin found");
6554 expression_t *const expression = allocate_expression_zero(kind);
6557 add_anchor_token(')');
6558 add_anchor_token(',');
6560 expression->binary.left = parse_assignment_expression();
6561 rem_anchor_token(',');
6563 expression->binary.right = parse_assignment_expression();
6564 rem_anchor_token(')');
6567 type_t *const orig_type_left = expression->binary.left->base.type;
6568 type_t *const orig_type_right = expression->binary.right->base.type;
6570 type_t *const type_left = skip_typeref(orig_type_left);
6571 type_t *const type_right = skip_typeref(orig_type_right);
6572 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6573 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6574 type_error_incompatible("invalid operands in comparison",
6575 &expression->base.source_position, orig_type_left, orig_type_right);
6578 semantic_comparison(&expression->binary);
6585 * Parses a MS assume() expression.
6587 static expression_t *parse_assume(void)
6589 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
6593 add_anchor_token(')');
6595 expression->unary.value = parse_assignment_expression();
6596 rem_anchor_token(')');
6599 expression->base.type = type_void;
6604 * Return the label for the current symbol or create a new one.
6606 static label_t *get_label(char const *const context)
6608 assert(current_function != NULL);
6610 symbol_t *const sym = expect_identifier(context, NULL);
6614 entity_t *label = get_entity(sym, NAMESPACE_LABEL);
6615 /* If we find a local label, we already created the declaration. */
6616 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
6617 if (label->base.parent_scope != current_scope) {
6618 assert(label->base.parent_scope->depth < current_scope->depth);
6619 current_function->goto_to_outer = true;
6621 } else if (label == NULL || label->base.parent_scope != ¤t_function->parameters) {
6622 /* There is no matching label in the same function, so create a new one. */
6623 source_position_t const nowhere = { NULL, 0, 0, false };
6624 label = allocate_entity_zero(ENTITY_LABEL, NAMESPACE_LABEL, sym, &nowhere);
6628 return &label->label;
6632 * Parses a GNU && label address expression.
6634 static expression_t *parse_label_address(void)
6636 source_position_t const source_position = *HERE;
6639 label_t *const label = get_label("while parsing label address");
6641 return create_error_expression();
6644 label->address_taken = true;
6646 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
6647 expression->base.source_position = source_position;
6649 /* label address is treated as a void pointer */
6650 expression->base.type = type_void_ptr;
6651 expression->label_address.label = label;
6656 * Parse a microsoft __noop expression.
6658 static expression_t *parse_noop_expression(void)
6660 /* the result is a (int)0 */
6661 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_MS_NOOP);
6662 literal->base.type = type_int;
6663 literal->literal.value.begin = "__noop";
6664 literal->literal.value.size = 6;
6668 if (token.kind == '(') {
6669 /* parse arguments */
6671 add_anchor_token(')');
6672 add_anchor_token(',');
6674 if (token.kind != ')') do {
6675 (void)parse_assignment_expression();
6676 } while (next_if(','));
6678 rem_anchor_token(',');
6679 rem_anchor_token(')');
6687 * Parses a primary expression.
6689 static expression_t *parse_primary_expression(void)
6691 switch (token.kind) {
6692 case T_false: return parse_boolean_literal(false);
6693 case T_true: return parse_boolean_literal(true);
6695 case T_FLOATINGPOINT: return parse_number_literal();
6696 case T_CHARACTER_CONSTANT: return parse_character_constant();
6697 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
6698 case T_STRING_LITERAL:
6699 case T_WIDE_STRING_LITERAL: return parse_string_literal();
6700 case T___FUNCTION__:
6701 case T___func__: return parse_function_keyword(FUNCNAME_FUNCTION);
6702 case T___PRETTY_FUNCTION__: return parse_function_keyword(FUNCNAME_PRETTY_FUNCTION);
6703 case T___FUNCSIG__: return parse_function_keyword(FUNCNAME_FUNCSIG);
6704 case T___FUNCDNAME__: return parse_function_keyword(FUNCNAME_FUNCDNAME);
6705 case T___builtin_offsetof: return parse_offsetof();
6706 case T___builtin_va_start: return parse_va_start();
6707 case T___builtin_va_arg: return parse_va_arg();
6708 case T___builtin_va_copy: return parse_va_copy();
6709 case T___builtin_isgreater:
6710 case T___builtin_isgreaterequal:
6711 case T___builtin_isless:
6712 case T___builtin_islessequal:
6713 case T___builtin_islessgreater:
6714 case T___builtin_isunordered: return parse_compare_builtin();
6715 case T___builtin_constant_p: return parse_builtin_constant();
6716 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
6717 case T__assume: return parse_assume();
6720 return parse_label_address();
6723 case '(': return parse_parenthesized_expression();
6724 case T___noop: return parse_noop_expression();
6726 /* Gracefully handle type names while parsing expressions. */
6728 return parse_reference();
6730 if (!is_typedef_symbol(token.base.symbol)) {
6731 return parse_reference();
6735 source_position_t const pos = *HERE;
6736 declaration_specifiers_t specifiers;
6737 parse_declaration_specifiers(&specifiers);
6738 type_t const *const type = parse_abstract_declarator(specifiers.type);
6739 errorf(&pos, "encountered type '%T' while parsing expression", type);
6740 return create_error_expression();
6744 errorf(HERE, "unexpected token %K, expected an expression", &token);
6746 return create_error_expression();
6749 static expression_t *parse_array_expression(expression_t *left)
6751 expression_t *const expr = allocate_expression_zero(EXPR_ARRAY_ACCESS);
6752 array_access_expression_t *const arr = &expr->array_access;
6755 add_anchor_token(']');
6757 expression_t *const inside = parse_expression();
6759 type_t *const orig_type_left = left->base.type;
6760 type_t *const orig_type_inside = inside->base.type;
6762 type_t *const type_left = skip_typeref(orig_type_left);
6763 type_t *const type_inside = skip_typeref(orig_type_inside);
6769 if (is_type_pointer(type_left)) {
6772 idx_type = type_inside;
6773 res_type = type_left->pointer.points_to;
6775 } else if (is_type_pointer(type_inside)) {
6776 arr->flipped = true;
6779 idx_type = type_left;
6780 res_type = type_inside->pointer.points_to;
6782 res_type = automatic_type_conversion(res_type);
6783 if (!is_type_integer(idx_type)) {
6784 errorf(&idx->base.source_position, "array subscript must have integer type");
6785 } else if (is_type_atomic(idx_type, ATOMIC_TYPE_CHAR)) {
6786 source_position_t const *const pos = &idx->base.source_position;
6787 warningf(WARN_CHAR_SUBSCRIPTS, pos, "array subscript has char type");
6790 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
6791 errorf(&expr->base.source_position, "invalid types '%T[%T]' for array access", orig_type_left, orig_type_inside);
6793 res_type = type_error_type;
6798 arr->array_ref = ref;
6800 arr->base.type = res_type;
6802 rem_anchor_token(']');
6807 static bool is_bitfield(const expression_t *expression)
6809 return expression->kind == EXPR_SELECT
6810 && expression->select.compound_entry->compound_member.bitfield;
6813 static expression_t *parse_typeprop(expression_kind_t const kind)
6815 expression_t *tp_expression = allocate_expression_zero(kind);
6816 tp_expression->base.type = type_size_t;
6818 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
6821 expression_t *expression;
6822 if (token.kind == '(' && is_declaration_specifier(look_ahead(1))) {
6823 source_position_t const pos = *HERE;
6825 add_anchor_token(')');
6826 orig_type = parse_typename();
6827 rem_anchor_token(')');
6830 if (token.kind == '{') {
6831 /* It was not sizeof(type) after all. It is sizeof of an expression
6832 * starting with a compound literal */
6833 expression = parse_compound_literal(&pos, orig_type);
6834 goto typeprop_expression;
6837 expression = parse_subexpression(PREC_UNARY);
6839 typeprop_expression:
6840 if (is_bitfield(expression)) {
6841 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6842 errorf(&tp_expression->base.source_position,
6843 "operand of %s expression must not be a bitfield", what);
6846 tp_expression->typeprop.tp_expression = expression;
6848 orig_type = revert_automatic_type_conversion(expression);
6849 expression->base.type = orig_type;
6852 tp_expression->typeprop.type = orig_type;
6853 type_t const* const type = skip_typeref(orig_type);
6854 char const* wrong_type = NULL;
6855 if (is_type_incomplete(type)) {
6856 if (!is_type_void(type) || !GNU_MODE)
6857 wrong_type = "incomplete";
6858 } else if (type->kind == TYPE_FUNCTION) {
6860 /* function types are allowed (and return 1) */
6861 source_position_t const *const pos = &tp_expression->base.source_position;
6862 char const *const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6863 warningf(WARN_OTHER, pos, "%s expression with function argument returns invalid result", what);
6865 wrong_type = "function";
6869 if (wrong_type != NULL) {
6870 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6871 errorf(&tp_expression->base.source_position,
6872 "operand of %s expression must not be of %s type '%T'",
6873 what, wrong_type, orig_type);
6876 return tp_expression;
6879 static expression_t *parse_sizeof(void)
6881 return parse_typeprop(EXPR_SIZEOF);
6884 static expression_t *parse_alignof(void)
6886 return parse_typeprop(EXPR_ALIGNOF);
6889 static expression_t *parse_select_expression(expression_t *addr)
6891 assert(token.kind == '.' || token.kind == T_MINUSGREATER);
6892 bool select_left_arrow = (token.kind == T_MINUSGREATER);
6893 source_position_t const pos = *HERE;
6896 symbol_t *const symbol = expect_identifier("while parsing select", NULL);
6898 return create_error_expression();
6900 type_t *const orig_type = addr->base.type;
6901 type_t *const type = skip_typeref(orig_type);
6904 bool saw_error = false;
6905 if (is_type_pointer(type)) {
6906 if (!select_left_arrow) {
6908 "request for member '%Y' in something not a struct or union, but '%T'",
6912 type_left = skip_typeref(type->pointer.points_to);
6914 if (select_left_arrow && is_type_valid(type)) {
6915 errorf(&pos, "left hand side of '->' is not a pointer, but '%T'", orig_type);
6921 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
6922 type_left->kind != TYPE_COMPOUND_UNION) {
6924 if (is_type_valid(type_left) && !saw_error) {
6926 "request for member '%Y' in something not a struct or union, but '%T'",
6929 return create_error_expression();
6932 compound_t *compound = type_left->compound.compound;
6933 if (!compound->complete) {
6934 errorf(&pos, "request for member '%Y' in incomplete type '%T'",
6936 return create_error_expression();
6939 type_qualifiers_t qualifiers = type_left->base.qualifiers;
6940 expression_t *result =
6941 find_create_select(&pos, addr, qualifiers, compound, symbol);
6943 if (result == NULL) {
6944 errorf(&pos, "'%T' has no member named '%Y'", orig_type, symbol);
6945 return create_error_expression();
6951 static void check_call_argument(type_t *expected_type,
6952 call_argument_t *argument, unsigned pos)
6954 type_t *expected_type_skip = skip_typeref(expected_type);
6955 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
6956 expression_t *arg_expr = argument->expression;
6957 type_t *arg_type = skip_typeref(arg_expr->base.type);
6959 /* handle transparent union gnu extension */
6960 if (is_type_union(expected_type_skip)
6961 && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
6962 compound_t *union_decl = expected_type_skip->compound.compound;
6963 type_t *best_type = NULL;
6964 entity_t *entry = union_decl->members.entities;
6965 for ( ; entry != NULL; entry = entry->base.next) {
6966 assert(is_declaration(entry));
6967 type_t *decl_type = entry->declaration.type;
6968 error = semantic_assign(decl_type, arg_expr);
6969 if (error == ASSIGN_ERROR_INCOMPATIBLE
6970 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
6973 if (error == ASSIGN_SUCCESS) {
6974 best_type = decl_type;
6975 } else if (best_type == NULL) {
6976 best_type = decl_type;
6980 if (best_type != NULL) {
6981 expected_type = best_type;
6985 error = semantic_assign(expected_type, arg_expr);
6986 argument->expression = create_implicit_cast(arg_expr, expected_type);
6988 if (error != ASSIGN_SUCCESS) {
6989 /* report exact scope in error messages (like "in argument 3") */
6991 snprintf(buf, sizeof(buf), "call argument %u", pos);
6992 report_assign_error(error, expected_type, arg_expr, buf,
6993 &arg_expr->base.source_position);
6995 type_t *const promoted_type = get_default_promoted_type(arg_type);
6996 if (!types_compatible(expected_type_skip, promoted_type) &&
6997 !types_compatible(expected_type_skip, type_void_ptr) &&
6998 !types_compatible(type_void_ptr, promoted_type)) {
6999 /* Deliberately show the skipped types in this warning */
7000 source_position_t const *const apos = &arg_expr->base.source_position;
7001 warningf(WARN_TRADITIONAL, apos, "passing call argument %u as '%T' rather than '%T' due to prototype", pos, expected_type_skip, promoted_type);
7007 * Handle the semantic restrictions of builtin calls
7009 static void handle_builtin_argument_restrictions(call_expression_t *call)
7011 entity_t *entity = call->function->reference.entity;
7012 switch (entity->function.btk) {
7014 switch (entity->function.b.firm_builtin_kind) {
7015 case ir_bk_return_address:
7016 case ir_bk_frame_address: {
7017 /* argument must be constant */
7018 call_argument_t *argument = call->arguments;
7020 if (is_constant_expression(argument->expression) == EXPR_CLASS_VARIABLE) {
7021 errorf(&call->base.source_position,
7022 "argument of '%Y' must be a constant expression",
7023 call->function->reference.entity->base.symbol);
7027 case ir_bk_prefetch:
7028 /* second and third argument must be constant if existent */
7029 if (call->arguments == NULL)
7031 call_argument_t *rw = call->arguments->next;
7032 call_argument_t *locality = NULL;
7035 if (is_constant_expression(rw->expression) == EXPR_CLASS_VARIABLE) {
7036 errorf(&call->base.source_position,
7037 "second argument of '%Y' must be a constant expression",
7038 call->function->reference.entity->base.symbol);
7040 locality = rw->next;
7042 if (locality != NULL) {
7043 if (is_constant_expression(locality->expression) == EXPR_CLASS_VARIABLE) {
7044 errorf(&call->base.source_position,
7045 "third argument of '%Y' must be a constant expression",
7046 call->function->reference.entity->base.symbol);
7048 locality = rw->next;
7055 case BUILTIN_OBJECT_SIZE:
7056 if (call->arguments == NULL)
7059 call_argument_t *arg = call->arguments->next;
7060 if (arg != NULL && is_constant_expression(arg->expression) == EXPR_CLASS_VARIABLE) {
7061 errorf(&call->base.source_position,
7062 "second argument of '%Y' must be a constant expression",
7063 call->function->reference.entity->base.symbol);
7072 * Parse a call expression, ie. expression '( ... )'.
7074 * @param expression the function address
7076 static expression_t *parse_call_expression(expression_t *expression)
7078 expression_t *result = allocate_expression_zero(EXPR_CALL);
7079 call_expression_t *call = &result->call;
7080 call->function = expression;
7082 type_t *const orig_type = expression->base.type;
7083 type_t *const type = skip_typeref(orig_type);
7085 function_type_t *function_type = NULL;
7086 if (is_type_pointer(type)) {
7087 type_t *const to_type = skip_typeref(type->pointer.points_to);
7089 if (is_type_function(to_type)) {
7090 function_type = &to_type->function;
7091 call->base.type = function_type->return_type;
7095 if (function_type == NULL && is_type_valid(type)) {
7097 "called object '%E' (type '%T') is not a pointer to a function",
7098 expression, orig_type);
7101 /* parse arguments */
7103 add_anchor_token(')');
7104 add_anchor_token(',');
7106 if (token.kind != ')') {
7107 call_argument_t **anchor = &call->arguments;
7109 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7110 argument->expression = parse_assignment_expression();
7113 anchor = &argument->next;
7114 } while (next_if(','));
7116 rem_anchor_token(',');
7117 rem_anchor_token(')');
7120 if (function_type == NULL)
7123 /* check type and count of call arguments */
7124 function_parameter_t *parameter = function_type->parameters;
7125 call_argument_t *argument = call->arguments;
7126 if (!function_type->unspecified_parameters) {
7127 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7128 parameter = parameter->next, argument = argument->next) {
7129 check_call_argument(parameter->type, argument, ++pos);
7132 if (parameter != NULL) {
7133 errorf(&expression->base.source_position, "too few arguments to function '%E'", expression);
7134 } else if (argument != NULL && !function_type->variadic) {
7135 errorf(&argument->expression->base.source_position, "too many arguments to function '%E'", expression);
7139 /* do default promotion for other arguments */
7140 for (; argument != NULL; argument = argument->next) {
7141 type_t *argument_type = argument->expression->base.type;
7142 if (!is_type_object(skip_typeref(argument_type))) {
7143 errorf(&argument->expression->base.source_position,
7144 "call argument '%E' must not be void", argument->expression);
7147 argument_type = get_default_promoted_type(argument_type);
7149 argument->expression
7150 = create_implicit_cast(argument->expression, argument_type);
7155 if (is_type_compound(skip_typeref(function_type->return_type))) {
7156 source_position_t const *const pos = &expression->base.source_position;
7157 warningf(WARN_AGGREGATE_RETURN, pos, "function call has aggregate value");
7160 if (expression->kind == EXPR_REFERENCE) {
7161 reference_expression_t *reference = &expression->reference;
7162 if (reference->entity->kind == ENTITY_FUNCTION &&
7163 reference->entity->function.btk != BUILTIN_NONE)
7164 handle_builtin_argument_restrictions(call);
7170 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7172 static bool same_compound_type(const type_t *type1, const type_t *type2)
7175 is_type_compound(type1) &&
7176 type1->kind == type2->kind &&
7177 type1->compound.compound == type2->compound.compound;
7180 static expression_t const *get_reference_address(expression_t const *expr)
7182 bool regular_take_address = true;
7184 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7185 expr = expr->unary.value;
7187 regular_take_address = false;
7190 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7193 expr = expr->unary.value;
7196 if (expr->kind != EXPR_REFERENCE)
7199 /* special case for functions which are automatically converted to a
7200 * pointer to function without an extra TAKE_ADDRESS operation */
7201 if (!regular_take_address &&
7202 expr->reference.entity->kind != ENTITY_FUNCTION) {
7209 static void warn_reference_address_as_bool(expression_t const* expr)
7211 expr = get_reference_address(expr);
7213 source_position_t const *const pos = &expr->base.source_position;
7214 entity_t const *const ent = expr->reference.entity;
7215 warningf(WARN_ADDRESS, pos, "the address of '%N' will always evaluate as 'true'", ent);
7219 static void warn_assignment_in_condition(const expression_t *const expr)
7221 if (expr->base.kind != EXPR_BINARY_ASSIGN)
7223 if (expr->base.parenthesized)
7225 source_position_t const *const pos = &expr->base.source_position;
7226 warningf(WARN_PARENTHESES, pos, "suggest parentheses around assignment used as truth value");
7229 static void semantic_condition(expression_t const *const expr,
7230 char const *const context)
7232 type_t *const type = skip_typeref(expr->base.type);
7233 if (is_type_scalar(type)) {
7234 warn_reference_address_as_bool(expr);
7235 warn_assignment_in_condition(expr);
7236 } else if (is_type_valid(type)) {
7237 errorf(&expr->base.source_position,
7238 "%s must have scalar type", context);
7243 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7245 * @param expression the conditional expression
7247 static expression_t *parse_conditional_expression(expression_t *expression)
7249 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7251 conditional_expression_t *conditional = &result->conditional;
7252 conditional->condition = expression;
7255 add_anchor_token(':');
7257 /* §6.5.15:2 The first operand shall have scalar type. */
7258 semantic_condition(expression, "condition of conditional operator");
7260 expression_t *true_expression = expression;
7261 bool gnu_cond = false;
7262 if (GNU_MODE && token.kind == ':') {
7265 true_expression = parse_expression();
7267 rem_anchor_token(':');
7269 expression_t *false_expression =
7270 parse_subexpression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7272 type_t *const orig_true_type = true_expression->base.type;
7273 type_t *const orig_false_type = false_expression->base.type;
7274 type_t *const true_type = skip_typeref(orig_true_type);
7275 type_t *const false_type = skip_typeref(orig_false_type);
7278 source_position_t const *const pos = &conditional->base.source_position;
7279 type_t *result_type;
7280 if (is_type_void(true_type) || is_type_void(false_type)) {
7281 /* ISO/IEC 14882:1998(E) §5.16:2 */
7282 if (true_expression->kind == EXPR_UNARY_THROW) {
7283 result_type = false_type;
7284 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7285 result_type = true_type;
7287 if (!is_type_void(true_type) || !is_type_void(false_type)) {
7288 warningf(WARN_OTHER, pos, "ISO C forbids conditional expression with only one void side");
7290 result_type = type_void;
7292 } else if (is_type_arithmetic(true_type)
7293 && is_type_arithmetic(false_type)) {
7294 result_type = semantic_arithmetic(true_type, false_type);
7295 } else if (same_compound_type(true_type, false_type)) {
7296 /* just take 1 of the 2 types */
7297 result_type = true_type;
7298 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7299 type_t *pointer_type;
7301 expression_t *other_expression;
7302 if (is_type_pointer(true_type) &&
7303 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7304 pointer_type = true_type;
7305 other_type = false_type;
7306 other_expression = false_expression;
7308 pointer_type = false_type;
7309 other_type = true_type;
7310 other_expression = true_expression;
7313 if (is_null_pointer_constant(other_expression)) {
7314 result_type = pointer_type;
7315 } else if (is_type_pointer(other_type)) {
7316 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7317 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7320 if (is_type_void(to1) || is_type_void(to2)) {
7322 } else if (types_compatible(get_unqualified_type(to1),
7323 get_unqualified_type(to2))) {
7326 warningf(WARN_OTHER, pos, "pointer types '%T' and '%T' in conditional expression are incompatible", true_type, false_type);
7330 type_t *const type =
7331 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7332 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7333 } else if (is_type_integer(other_type)) {
7334 warningf(WARN_OTHER, pos, "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7335 result_type = pointer_type;
7337 goto types_incompatible;
7341 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7342 type_error_incompatible("while parsing conditional", pos, true_type, false_type);
7344 result_type = type_error_type;
7347 conditional->true_expression
7348 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7349 conditional->false_expression
7350 = create_implicit_cast(false_expression, result_type);
7351 conditional->base.type = result_type;
7356 * Parse an extension expression.
7358 static expression_t *parse_extension(void)
7361 expression_t *expression = parse_subexpression(PREC_UNARY);
7367 * Parse a __builtin_classify_type() expression.
7369 static expression_t *parse_builtin_classify_type(void)
7371 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7372 result->base.type = type_int;
7374 eat(T___builtin_classify_type);
7376 add_anchor_token(')');
7378 expression_t *expression = parse_expression();
7379 rem_anchor_token(')');
7381 result->classify_type.type_expression = expression;
7387 * Parse a delete expression
7388 * ISO/IEC 14882:1998(E) §5.3.5
7390 static expression_t *parse_delete(void)
7392 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7393 result->base.type = type_void;
7398 result->kind = EXPR_UNARY_DELETE_ARRAY;
7402 expression_t *const value = parse_subexpression(PREC_CAST);
7403 result->unary.value = value;
7405 type_t *const type = skip_typeref(value->base.type);
7406 if (!is_type_pointer(type)) {
7407 if (is_type_valid(type)) {
7408 errorf(&value->base.source_position,
7409 "operand of delete must have pointer type");
7411 } else if (is_type_void(skip_typeref(type->pointer.points_to))) {
7412 source_position_t const *const pos = &value->base.source_position;
7413 warningf(WARN_OTHER, pos, "deleting 'void*' is undefined");
7420 * Parse a throw expression
7421 * ISO/IEC 14882:1998(E) §15:1
7423 static expression_t *parse_throw(void)
7425 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7426 result->base.type = type_void;
7430 expression_t *value = NULL;
7431 switch (token.kind) {
7433 value = parse_assignment_expression();
7434 /* ISO/IEC 14882:1998(E) §15.1:3 */
7435 type_t *const orig_type = value->base.type;
7436 type_t *const type = skip_typeref(orig_type);
7437 if (is_type_incomplete(type)) {
7438 errorf(&value->base.source_position,
7439 "cannot throw object of incomplete type '%T'", orig_type);
7440 } else if (is_type_pointer(type)) {
7441 type_t *const points_to = skip_typeref(type->pointer.points_to);
7442 if (is_type_incomplete(points_to) && !is_type_void(points_to)) {
7443 errorf(&value->base.source_position,
7444 "cannot throw pointer to incomplete type '%T'", orig_type);
7452 result->unary.value = value;
7457 static bool check_pointer_arithmetic(const source_position_t *source_position,
7458 type_t *pointer_type,
7459 type_t *orig_pointer_type)
7461 type_t *points_to = pointer_type->pointer.points_to;
7462 points_to = skip_typeref(points_to);
7464 if (is_type_incomplete(points_to)) {
7465 if (!GNU_MODE || !is_type_void(points_to)) {
7466 errorf(source_position,
7467 "arithmetic with pointer to incomplete type '%T' not allowed",
7471 warningf(WARN_POINTER_ARITH, source_position, "pointer of type '%T' used in arithmetic", orig_pointer_type);
7473 } else if (is_type_function(points_to)) {
7475 errorf(source_position,
7476 "arithmetic with pointer to function type '%T' not allowed",
7480 warningf(WARN_POINTER_ARITH, source_position, "pointer to a function '%T' used in arithmetic", orig_pointer_type);
7486 static bool is_lvalue(const expression_t *expression)
7488 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
7489 switch (expression->kind) {
7490 case EXPR_ARRAY_ACCESS:
7491 case EXPR_COMPOUND_LITERAL:
7492 case EXPR_REFERENCE:
7494 case EXPR_UNARY_DEREFERENCE:
7498 type_t *type = skip_typeref(expression->base.type);
7500 /* ISO/IEC 14882:1998(E) §3.10:3 */
7501 is_type_reference(type) ||
7502 /* Claim it is an lvalue, if the type is invalid. There was a parse
7503 * error before, which maybe prevented properly recognizing it as
7505 !is_type_valid(type);
7510 static void semantic_incdec(unary_expression_t *expression)
7512 type_t *const orig_type = expression->value->base.type;
7513 type_t *const type = skip_typeref(orig_type);
7514 if (is_type_pointer(type)) {
7515 if (!check_pointer_arithmetic(&expression->base.source_position,
7519 } else if (!is_type_real(type) && is_type_valid(type)) {
7520 /* TODO: improve error message */
7521 errorf(&expression->base.source_position,
7522 "operation needs an arithmetic or pointer type");
7525 if (!is_lvalue(expression->value)) {
7526 /* TODO: improve error message */
7527 errorf(&expression->base.source_position, "lvalue required as operand");
7529 expression->base.type = orig_type;
7532 static void promote_unary_int_expr(unary_expression_t *const expr, type_t *const type)
7534 type_t *const res_type = promote_integer(type);
7535 expr->base.type = res_type;
7536 expr->value = create_implicit_cast(expr->value, res_type);
7539 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
7541 type_t *const orig_type = expression->value->base.type;
7542 type_t *const type = skip_typeref(orig_type);
7543 if (!is_type_arithmetic(type)) {
7544 if (is_type_valid(type)) {
7545 /* TODO: improve error message */
7546 errorf(&expression->base.source_position,
7547 "operation needs an arithmetic type");
7550 } else if (is_type_integer(type)) {
7551 promote_unary_int_expr(expression, type);
7553 expression->base.type = orig_type;
7557 static void semantic_unexpr_plus(unary_expression_t *expression)
7559 semantic_unexpr_arithmetic(expression);
7560 source_position_t const *const pos = &expression->base.source_position;
7561 warningf(WARN_TRADITIONAL, pos, "traditional C rejects the unary plus operator");
7564 static void semantic_not(unary_expression_t *expression)
7566 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
7567 semantic_condition(expression->value, "operand of !");
7568 expression->base.type = c_mode & _CXX ? type_bool : type_int;
7571 static void semantic_unexpr_integer(unary_expression_t *expression)
7573 type_t *const orig_type = expression->value->base.type;
7574 type_t *const type = skip_typeref(orig_type);
7575 if (!is_type_integer(type)) {
7576 if (is_type_valid(type)) {
7577 errorf(&expression->base.source_position,
7578 "operand of ~ must be of integer type");
7583 promote_unary_int_expr(expression, type);
7586 static void semantic_dereference(unary_expression_t *expression)
7588 type_t *const orig_type = expression->value->base.type;
7589 type_t *const type = skip_typeref(orig_type);
7590 if (!is_type_pointer(type)) {
7591 if (is_type_valid(type)) {
7592 errorf(&expression->base.source_position,
7593 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
7598 type_t *result_type = type->pointer.points_to;
7599 result_type = automatic_type_conversion(result_type);
7600 expression->base.type = result_type;
7604 * Record that an address is taken (expression represents an lvalue).
7606 * @param expression the expression
7607 * @param may_be_register if true, the expression might be an register
7609 static void set_address_taken(expression_t *expression, bool may_be_register)
7611 if (expression->kind != EXPR_REFERENCE)
7614 entity_t *const entity = expression->reference.entity;
7616 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
7619 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
7620 && !may_be_register) {
7621 source_position_t const *const pos = &expression->base.source_position;
7622 errorf(pos, "address of register '%N' requested", entity);
7625 entity->variable.address_taken = true;
7629 * Check the semantic of the address taken expression.
7631 static void semantic_take_addr(unary_expression_t *expression)
7633 expression_t *value = expression->value;
7634 value->base.type = revert_automatic_type_conversion(value);
7636 type_t *orig_type = value->base.type;
7637 type_t *type = skip_typeref(orig_type);
7638 if (!is_type_valid(type))
7642 if (!is_lvalue(value)) {
7643 errorf(&expression->base.source_position, "'&' requires an lvalue");
7645 if (is_bitfield(value)) {
7646 errorf(&expression->base.source_position,
7647 "'&' not allowed on bitfield");
7650 set_address_taken(value, false);
7652 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
7655 #define CREATE_UNARY_EXPRESSION_PARSER(token_kind, unexpression_type, sfunc) \
7656 static expression_t *parse_##unexpression_type(void) \
7658 expression_t *unary_expression \
7659 = allocate_expression_zero(unexpression_type); \
7661 unary_expression->unary.value = parse_subexpression(PREC_UNARY); \
7663 sfunc(&unary_expression->unary); \
7665 return unary_expression; \
7668 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
7669 semantic_unexpr_arithmetic)
7670 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
7671 semantic_unexpr_plus)
7672 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
7674 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
7675 semantic_dereference)
7676 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
7678 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
7679 semantic_unexpr_integer)
7680 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
7682 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
7685 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_kind, unexpression_type, \
7687 static expression_t *parse_##unexpression_type(expression_t *left) \
7689 expression_t *unary_expression \
7690 = allocate_expression_zero(unexpression_type); \
7692 unary_expression->unary.value = left; \
7694 sfunc(&unary_expression->unary); \
7696 return unary_expression; \
7699 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
7700 EXPR_UNARY_POSTFIX_INCREMENT,
7702 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
7703 EXPR_UNARY_POSTFIX_DECREMENT,
7706 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
7708 /* TODO: handle complex + imaginary types */
7710 type_left = get_unqualified_type(type_left);
7711 type_right = get_unqualified_type(type_right);
7713 /* §6.3.1.8 Usual arithmetic conversions */
7714 if (type_left == type_long_double || type_right == type_long_double) {
7715 return type_long_double;
7716 } else if (type_left == type_double || type_right == type_double) {
7718 } else if (type_left == type_float || type_right == type_float) {
7722 type_left = promote_integer(type_left);
7723 type_right = promote_integer(type_right);
7725 if (type_left == type_right)
7728 bool const signed_left = is_type_signed(type_left);
7729 bool const signed_right = is_type_signed(type_right);
7730 unsigned const rank_left = get_akind_rank(get_akind(type_left));
7731 unsigned const rank_right = get_akind_rank(get_akind(type_right));
7733 if (signed_left == signed_right)
7734 return rank_left >= rank_right ? type_left : type_right;
7738 atomic_type_kind_t s_akind;
7739 atomic_type_kind_t u_akind;
7744 u_type = type_right;
7746 s_type = type_right;
7749 s_akind = get_akind(s_type);
7750 u_akind = get_akind(u_type);
7751 s_rank = get_akind_rank(s_akind);
7752 u_rank = get_akind_rank(u_akind);
7754 if (u_rank >= s_rank)
7757 if (get_atomic_type_size(s_akind) > get_atomic_type_size(u_akind))
7761 case ATOMIC_TYPE_INT: return type_unsigned_int;
7762 case ATOMIC_TYPE_LONG: return type_unsigned_long;
7763 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
7765 default: panic("invalid atomic type");
7770 * Check the semantic restrictions for a binary expression.
7772 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
7774 expression_t *const left = expression->left;
7775 expression_t *const right = expression->right;
7776 type_t *const orig_type_left = left->base.type;
7777 type_t *const orig_type_right = right->base.type;
7778 type_t *const type_left = skip_typeref(orig_type_left);
7779 type_t *const type_right = skip_typeref(orig_type_right);
7781 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
7782 /* TODO: improve error message */
7783 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7784 errorf(&expression->base.source_position,
7785 "operation needs arithmetic types");
7790 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7791 expression->left = create_implicit_cast(left, arithmetic_type);
7792 expression->right = create_implicit_cast(right, arithmetic_type);
7793 expression->base.type = arithmetic_type;
7796 static void semantic_binexpr_integer(binary_expression_t *const expression)
7798 expression_t *const left = expression->left;
7799 expression_t *const right = expression->right;
7800 type_t *const orig_type_left = left->base.type;
7801 type_t *const orig_type_right = right->base.type;
7802 type_t *const type_left = skip_typeref(orig_type_left);
7803 type_t *const type_right = skip_typeref(orig_type_right);
7805 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
7806 /* TODO: improve error message */
7807 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7808 errorf(&expression->base.source_position,
7809 "operation needs integer types");
7814 type_t *const result_type = semantic_arithmetic(type_left, type_right);
7815 expression->left = create_implicit_cast(left, result_type);
7816 expression->right = create_implicit_cast(right, result_type);
7817 expression->base.type = result_type;
7820 static void warn_div_by_zero(binary_expression_t const *const expression)
7822 if (!is_type_integer(expression->base.type))
7825 expression_t const *const right = expression->right;
7826 /* The type of the right operand can be different for /= */
7827 if (is_type_integer(right->base.type) &&
7828 is_constant_expression(right) == EXPR_CLASS_CONSTANT &&
7829 !fold_constant_to_bool(right)) {
7830 source_position_t const *const pos = &expression->base.source_position;
7831 warningf(WARN_DIV_BY_ZERO, pos, "division by zero");
7836 * Check the semantic restrictions for a div/mod expression.
7838 static void semantic_divmod_arithmetic(binary_expression_t *expression)
7840 semantic_binexpr_arithmetic(expression);
7841 warn_div_by_zero(expression);
7844 static void warn_addsub_in_shift(const expression_t *const expr)
7846 if (expr->base.parenthesized)
7850 switch (expr->kind) {
7851 case EXPR_BINARY_ADD: op = '+'; break;
7852 case EXPR_BINARY_SUB: op = '-'; break;
7856 source_position_t const *const pos = &expr->base.source_position;
7857 warningf(WARN_PARENTHESES, pos, "suggest parentheses around '%c' inside shift", op);
7860 static bool semantic_shift(binary_expression_t *expression)
7862 expression_t *const left = expression->left;
7863 expression_t *const right = expression->right;
7864 type_t *const orig_type_left = left->base.type;
7865 type_t *const orig_type_right = right->base.type;
7866 type_t * type_left = skip_typeref(orig_type_left);
7867 type_t * type_right = skip_typeref(orig_type_right);
7869 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
7870 /* TODO: improve error message */
7871 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7872 errorf(&expression->base.source_position,
7873 "operands of shift operation must have integer types");
7878 type_left = promote_integer(type_left);
7880 if (is_constant_expression(right) == EXPR_CLASS_CONSTANT) {
7881 source_position_t const *const pos = &right->base.source_position;
7882 long const count = fold_constant_to_int(right);
7884 warningf(WARN_OTHER, pos, "shift count must be non-negative");
7885 } else if ((unsigned long)count >=
7886 get_atomic_type_size(type_left->atomic.akind) * 8) {
7887 warningf(WARN_OTHER, pos, "shift count must be less than type width");
7891 type_right = promote_integer(type_right);
7892 expression->right = create_implicit_cast(right, type_right);
7897 static void semantic_shift_op(binary_expression_t *expression)
7899 expression_t *const left = expression->left;
7900 expression_t *const right = expression->right;
7902 if (!semantic_shift(expression))
7905 warn_addsub_in_shift(left);
7906 warn_addsub_in_shift(right);
7908 type_t *const orig_type_left = left->base.type;
7909 type_t * type_left = skip_typeref(orig_type_left);
7911 type_left = promote_integer(type_left);
7912 expression->left = create_implicit_cast(left, type_left);
7913 expression->base.type = type_left;
7916 static void semantic_add(binary_expression_t *expression)
7918 expression_t *const left = expression->left;
7919 expression_t *const right = expression->right;
7920 type_t *const orig_type_left = left->base.type;
7921 type_t *const orig_type_right = right->base.type;
7922 type_t *const type_left = skip_typeref(orig_type_left);
7923 type_t *const type_right = skip_typeref(orig_type_right);
7926 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7927 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7928 expression->left = create_implicit_cast(left, arithmetic_type);
7929 expression->right = create_implicit_cast(right, arithmetic_type);
7930 expression->base.type = arithmetic_type;
7931 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
7932 check_pointer_arithmetic(&expression->base.source_position,
7933 type_left, orig_type_left);
7934 expression->base.type = type_left;
7935 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
7936 check_pointer_arithmetic(&expression->base.source_position,
7937 type_right, orig_type_right);
7938 expression->base.type = type_right;
7939 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
7940 errorf(&expression->base.source_position,
7941 "invalid operands to binary + ('%T', '%T')",
7942 orig_type_left, orig_type_right);
7946 static void semantic_sub(binary_expression_t *expression)
7948 expression_t *const left = expression->left;
7949 expression_t *const right = expression->right;
7950 type_t *const orig_type_left = left->base.type;
7951 type_t *const orig_type_right = right->base.type;
7952 type_t *const type_left = skip_typeref(orig_type_left);
7953 type_t *const type_right = skip_typeref(orig_type_right);
7954 source_position_t const *const pos = &expression->base.source_position;
7957 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7958 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7959 expression->left = create_implicit_cast(left, arithmetic_type);
7960 expression->right = create_implicit_cast(right, arithmetic_type);
7961 expression->base.type = arithmetic_type;
7962 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
7963 check_pointer_arithmetic(&expression->base.source_position,
7964 type_left, orig_type_left);
7965 expression->base.type = type_left;
7966 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
7967 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
7968 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
7969 if (!types_compatible(unqual_left, unqual_right)) {
7971 "subtracting pointers to incompatible types '%T' and '%T'",
7972 orig_type_left, orig_type_right);
7973 } else if (!is_type_object(unqual_left)) {
7974 if (!is_type_void(unqual_left)) {
7975 errorf(pos, "subtracting pointers to non-object types '%T'",
7978 warningf(WARN_OTHER, pos, "subtracting pointers to void");
7981 expression->base.type = type_ptrdiff_t;
7982 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
7983 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
7984 orig_type_left, orig_type_right);
7988 static void warn_string_literal_address(expression_t const* expr)
7990 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7991 expr = expr->unary.value;
7992 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7994 expr = expr->unary.value;
7997 if (expr->kind == EXPR_STRING_LITERAL
7998 || expr->kind == EXPR_WIDE_STRING_LITERAL) {
7999 source_position_t const *const pos = &expr->base.source_position;
8000 warningf(WARN_ADDRESS, pos, "comparison with string literal results in unspecified behaviour");
8004 static bool maybe_negative(expression_t const *const expr)
8006 switch (is_constant_expression(expr)) {
8007 case EXPR_CLASS_ERROR: return false;
8008 case EXPR_CLASS_CONSTANT: return constant_is_negative(expr);
8009 default: return true;
8013 static void warn_comparison(source_position_t const *const pos, expression_t const *const expr, expression_t const *const other)
8015 warn_string_literal_address(expr);
8017 expression_t const* const ref = get_reference_address(expr);
8018 if (ref != NULL && is_null_pointer_constant(other)) {
8019 entity_t const *const ent = ref->reference.entity;
8020 warningf(WARN_ADDRESS, pos, "the address of '%N' will never be NULL", ent);
8023 if (!expr->base.parenthesized) {
8024 switch (expr->base.kind) {
8025 case EXPR_BINARY_LESS:
8026 case EXPR_BINARY_GREATER:
8027 case EXPR_BINARY_LESSEQUAL:
8028 case EXPR_BINARY_GREATEREQUAL:
8029 case EXPR_BINARY_NOTEQUAL:
8030 case EXPR_BINARY_EQUAL:
8031 warningf(WARN_PARENTHESES, pos, "comparisons like 'x <= y < z' do not have their mathematical meaning");
8040 * Check the semantics of comparison expressions.
8042 * @param expression The expression to check.
8044 static void semantic_comparison(binary_expression_t *expression)
8046 source_position_t const *const pos = &expression->base.source_position;
8047 expression_t *const left = expression->left;
8048 expression_t *const right = expression->right;
8050 warn_comparison(pos, left, right);
8051 warn_comparison(pos, right, left);
8053 type_t *orig_type_left = left->base.type;
8054 type_t *orig_type_right = right->base.type;
8055 type_t *type_left = skip_typeref(orig_type_left);
8056 type_t *type_right = skip_typeref(orig_type_right);
8058 /* TODO non-arithmetic types */
8059 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8060 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8062 /* test for signed vs unsigned compares */
8063 if (is_type_integer(arithmetic_type)) {
8064 bool const signed_left = is_type_signed(type_left);
8065 bool const signed_right = is_type_signed(type_right);
8066 if (signed_left != signed_right) {
8067 /* FIXME long long needs better const folding magic */
8068 /* TODO check whether constant value can be represented by other type */
8069 if ((signed_left && maybe_negative(left)) ||
8070 (signed_right && maybe_negative(right))) {
8071 warningf(WARN_SIGN_COMPARE, pos, "comparison between signed and unsigned");
8076 expression->left = create_implicit_cast(left, arithmetic_type);
8077 expression->right = create_implicit_cast(right, arithmetic_type);
8078 expression->base.type = arithmetic_type;
8079 if ((expression->base.kind == EXPR_BINARY_EQUAL ||
8080 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8081 is_type_float(arithmetic_type)) {
8082 warningf(WARN_FLOAT_EQUAL, pos, "comparing floating point with == or != is unsafe");
8084 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8085 /* TODO check compatibility */
8086 } else if (is_type_pointer(type_left)) {
8087 expression->right = create_implicit_cast(right, type_left);
8088 } else if (is_type_pointer(type_right)) {
8089 expression->left = create_implicit_cast(left, type_right);
8090 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8091 type_error_incompatible("invalid operands in comparison", pos, type_left, type_right);
8093 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8097 * Checks if a compound type has constant fields.
8099 static bool has_const_fields(const compound_type_t *type)
8101 compound_t *compound = type->compound;
8102 entity_t *entry = compound->members.entities;
8104 for (; entry != NULL; entry = entry->base.next) {
8105 if (!is_declaration(entry))
8108 const type_t *decl_type = skip_typeref(entry->declaration.type);
8109 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8116 static bool is_valid_assignment_lhs(expression_t const* const left)
8118 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8119 type_t *const type_left = skip_typeref(orig_type_left);
8121 if (!is_lvalue(left)) {
8122 errorf(&left->base.source_position, "left hand side '%E' of assignment is not an lvalue",
8127 if (left->kind == EXPR_REFERENCE
8128 && left->reference.entity->kind == ENTITY_FUNCTION) {
8129 errorf(&left->base.source_position, "cannot assign to function '%E'", left);
8133 if (is_type_array(type_left)) {
8134 errorf(&left->base.source_position, "cannot assign to array '%E'", left);
8137 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8138 errorf(&left->base.source_position, "assignment to read-only location '%E' (type '%T')", left,
8142 if (is_type_incomplete(type_left)) {
8143 errorf(&left->base.source_position, "left-hand side '%E' of assignment has incomplete type '%T'",
8144 left, orig_type_left);
8147 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8148 errorf(&left->base.source_position, "cannot assign to '%E' because compound type '%T' has read-only fields",
8149 left, orig_type_left);
8156 static void semantic_arithmetic_assign(binary_expression_t *expression)
8158 expression_t *left = expression->left;
8159 expression_t *right = expression->right;
8160 type_t *orig_type_left = left->base.type;
8161 type_t *orig_type_right = right->base.type;
8163 if (!is_valid_assignment_lhs(left))
8166 type_t *type_left = skip_typeref(orig_type_left);
8167 type_t *type_right = skip_typeref(orig_type_right);
8169 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8170 /* TODO: improve error message */
8171 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8172 errorf(&expression->base.source_position,
8173 "operation needs arithmetic types");
8178 /* combined instructions are tricky. We can't create an implicit cast on
8179 * the left side, because we need the uncasted form for the store.
8180 * The ast2firm pass has to know that left_type must be right_type
8181 * for the arithmetic operation and create a cast by itself */
8182 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8183 expression->right = create_implicit_cast(right, arithmetic_type);
8184 expression->base.type = type_left;
8187 static void semantic_divmod_assign(binary_expression_t *expression)
8189 semantic_arithmetic_assign(expression);
8190 warn_div_by_zero(expression);
8193 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8195 expression_t *const left = expression->left;
8196 expression_t *const right = expression->right;
8197 type_t *const orig_type_left = left->base.type;
8198 type_t *const orig_type_right = right->base.type;
8199 type_t *const type_left = skip_typeref(orig_type_left);
8200 type_t *const type_right = skip_typeref(orig_type_right);
8202 if (!is_valid_assignment_lhs(left))
8205 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8206 /* combined instructions are tricky. We can't create an implicit cast on
8207 * the left side, because we need the uncasted form for the store.
8208 * The ast2firm pass has to know that left_type must be right_type
8209 * for the arithmetic operation and create a cast by itself */
8210 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8211 expression->right = create_implicit_cast(right, arithmetic_type);
8212 expression->base.type = type_left;
8213 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8214 check_pointer_arithmetic(&expression->base.source_position,
8215 type_left, orig_type_left);
8216 expression->base.type = type_left;
8217 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8218 errorf(&expression->base.source_position,
8219 "incompatible types '%T' and '%T' in assignment",
8220 orig_type_left, orig_type_right);
8224 static void semantic_integer_assign(binary_expression_t *expression)
8226 expression_t *left = expression->left;
8227 expression_t *right = expression->right;
8228 type_t *orig_type_left = left->base.type;
8229 type_t *orig_type_right = right->base.type;
8231 if (!is_valid_assignment_lhs(left))
8234 type_t *type_left = skip_typeref(orig_type_left);
8235 type_t *type_right = skip_typeref(orig_type_right);
8237 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8238 /* TODO: improve error message */
8239 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8240 errorf(&expression->base.source_position,
8241 "operation needs integer types");
8246 /* combined instructions are tricky. We can't create an implicit cast on
8247 * the left side, because we need the uncasted form for the store.
8248 * The ast2firm pass has to know that left_type must be right_type
8249 * for the arithmetic operation and create a cast by itself */
8250 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8251 expression->right = create_implicit_cast(right, arithmetic_type);
8252 expression->base.type = type_left;
8255 static void semantic_shift_assign(binary_expression_t *expression)
8257 expression_t *left = expression->left;
8259 if (!is_valid_assignment_lhs(left))
8262 if (!semantic_shift(expression))
8265 expression->base.type = skip_typeref(left->base.type);
8268 static void warn_logical_and_within_or(const expression_t *const expr)
8270 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8272 if (expr->base.parenthesized)
8274 source_position_t const *const pos = &expr->base.source_position;
8275 warningf(WARN_PARENTHESES, pos, "suggest parentheses around && within ||");
8279 * Check the semantic restrictions of a logical expression.
8281 static void semantic_logical_op(binary_expression_t *expression)
8283 /* §6.5.13:2 Each of the operands shall have scalar type.
8284 * §6.5.14:2 Each of the operands shall have scalar type. */
8285 semantic_condition(expression->left, "left operand of logical operator");
8286 semantic_condition(expression->right, "right operand of logical operator");
8287 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR) {
8288 warn_logical_and_within_or(expression->left);
8289 warn_logical_and_within_or(expression->right);
8291 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8295 * Check the semantic restrictions of a binary assign expression.
8297 static void semantic_binexpr_assign(binary_expression_t *expression)
8299 expression_t *left = expression->left;
8300 type_t *orig_type_left = left->base.type;
8302 if (!is_valid_assignment_lhs(left))
8305 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8306 report_assign_error(error, orig_type_left, expression->right,
8307 "assignment", &left->base.source_position);
8308 expression->right = create_implicit_cast(expression->right, orig_type_left);
8309 expression->base.type = orig_type_left;
8313 * Determine if the outermost operation (or parts thereof) of the given
8314 * expression has no effect in order to generate a warning about this fact.
8315 * Therefore in some cases this only examines some of the operands of the
8316 * expression (see comments in the function and examples below).
8318 * f() + 23; // warning, because + has no effect
8319 * x || f(); // no warning, because x controls execution of f()
8320 * x ? y : f(); // warning, because y has no effect
8321 * (void)x; // no warning to be able to suppress the warning
8322 * This function can NOT be used for an "expression has definitely no effect"-
8324 static bool expression_has_effect(const expression_t *const expr)
8326 switch (expr->kind) {
8327 case EXPR_ERROR: return true; /* do NOT warn */
8328 case EXPR_REFERENCE: return false;
8329 case EXPR_ENUM_CONSTANT: return false;
8330 case EXPR_LABEL_ADDRESS: return false;
8332 /* suppress the warning for microsoft __noop operations */
8333 case EXPR_LITERAL_MS_NOOP: return true;
8334 case EXPR_LITERAL_BOOLEAN:
8335 case EXPR_LITERAL_CHARACTER:
8336 case EXPR_LITERAL_WIDE_CHARACTER:
8337 case EXPR_LITERAL_INTEGER:
8338 case EXPR_LITERAL_FLOATINGPOINT:
8339 case EXPR_STRING_LITERAL: return false;
8340 case EXPR_WIDE_STRING_LITERAL: return false;
8343 const call_expression_t *const call = &expr->call;
8344 if (call->function->kind != EXPR_REFERENCE)
8347 switch (call->function->reference.entity->function.btk) {
8348 /* FIXME: which builtins have no effect? */
8349 default: return true;
8353 /* Generate the warning if either the left or right hand side of a
8354 * conditional expression has no effect */
8355 case EXPR_CONDITIONAL: {
8356 conditional_expression_t const *const cond = &expr->conditional;
8357 expression_t const *const t = cond->true_expression;
8359 (t == NULL || expression_has_effect(t)) &&
8360 expression_has_effect(cond->false_expression);
8363 case EXPR_SELECT: return false;
8364 case EXPR_ARRAY_ACCESS: return false;
8365 case EXPR_SIZEOF: return false;
8366 case EXPR_CLASSIFY_TYPE: return false;
8367 case EXPR_ALIGNOF: return false;
8369 case EXPR_FUNCNAME: return false;
8370 case EXPR_BUILTIN_CONSTANT_P: return false;
8371 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8372 case EXPR_OFFSETOF: return false;
8373 case EXPR_VA_START: return true;
8374 case EXPR_VA_ARG: return true;
8375 case EXPR_VA_COPY: return true;
8376 case EXPR_STATEMENT: return true; // TODO
8377 case EXPR_COMPOUND_LITERAL: return false;
8379 case EXPR_UNARY_NEGATE: return false;
8380 case EXPR_UNARY_PLUS: return false;
8381 case EXPR_UNARY_BITWISE_NEGATE: return false;
8382 case EXPR_UNARY_NOT: return false;
8383 case EXPR_UNARY_DEREFERENCE: return false;
8384 case EXPR_UNARY_TAKE_ADDRESS: return false;
8385 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8386 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8387 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8388 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8390 /* Treat void casts as if they have an effect in order to being able to
8391 * suppress the warning */
8392 case EXPR_UNARY_CAST: {
8393 type_t *const type = skip_typeref(expr->base.type);
8394 return is_type_void(type);
8397 case EXPR_UNARY_ASSUME: return true;
8398 case EXPR_UNARY_DELETE: return true;
8399 case EXPR_UNARY_DELETE_ARRAY: return true;
8400 case EXPR_UNARY_THROW: return true;
8402 case EXPR_BINARY_ADD: return false;
8403 case EXPR_BINARY_SUB: return false;
8404 case EXPR_BINARY_MUL: return false;
8405 case EXPR_BINARY_DIV: return false;
8406 case EXPR_BINARY_MOD: return false;
8407 case EXPR_BINARY_EQUAL: return false;
8408 case EXPR_BINARY_NOTEQUAL: return false;
8409 case EXPR_BINARY_LESS: return false;
8410 case EXPR_BINARY_LESSEQUAL: return false;
8411 case EXPR_BINARY_GREATER: return false;
8412 case EXPR_BINARY_GREATEREQUAL: return false;
8413 case EXPR_BINARY_BITWISE_AND: return false;
8414 case EXPR_BINARY_BITWISE_OR: return false;
8415 case EXPR_BINARY_BITWISE_XOR: return false;
8416 case EXPR_BINARY_SHIFTLEFT: return false;
8417 case EXPR_BINARY_SHIFTRIGHT: return false;
8418 case EXPR_BINARY_ASSIGN: return true;
8419 case EXPR_BINARY_MUL_ASSIGN: return true;
8420 case EXPR_BINARY_DIV_ASSIGN: return true;
8421 case EXPR_BINARY_MOD_ASSIGN: return true;
8422 case EXPR_BINARY_ADD_ASSIGN: return true;
8423 case EXPR_BINARY_SUB_ASSIGN: return true;
8424 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8425 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8426 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8427 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8428 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8430 /* Only examine the right hand side of && and ||, because the left hand
8431 * side already has the effect of controlling the execution of the right
8433 case EXPR_BINARY_LOGICAL_AND:
8434 case EXPR_BINARY_LOGICAL_OR:
8435 /* Only examine the right hand side of a comma expression, because the left
8436 * hand side has a separate warning */
8437 case EXPR_BINARY_COMMA:
8438 return expression_has_effect(expr->binary.right);
8440 case EXPR_BINARY_ISGREATER: return false;
8441 case EXPR_BINARY_ISGREATEREQUAL: return false;
8442 case EXPR_BINARY_ISLESS: return false;
8443 case EXPR_BINARY_ISLESSEQUAL: return false;
8444 case EXPR_BINARY_ISLESSGREATER: return false;
8445 case EXPR_BINARY_ISUNORDERED: return false;
8448 internal_errorf(HERE, "unexpected expression");
8451 static void semantic_comma(binary_expression_t *expression)
8453 const expression_t *const left = expression->left;
8454 if (!expression_has_effect(left)) {
8455 source_position_t const *const pos = &left->base.source_position;
8456 warningf(WARN_UNUSED_VALUE, pos, "left-hand operand of comma expression has no effect");
8458 expression->base.type = expression->right->base.type;
8462 * @param prec_r precedence of the right operand
8464 #define CREATE_BINEXPR_PARSER(token_kind, binexpression_type, prec_r, sfunc) \
8465 static expression_t *parse_##binexpression_type(expression_t *left) \
8467 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8468 binexpr->binary.left = left; \
8471 expression_t *right = parse_subexpression(prec_r); \
8473 binexpr->binary.right = right; \
8474 sfunc(&binexpr->binary); \
8479 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8480 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
8481 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
8482 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8483 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8484 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8485 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8486 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
8487 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
8488 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
8489 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
8490 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
8491 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
8492 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_integer)
8493 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_integer)
8494 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_integer)
8495 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8496 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8497 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
8498 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8499 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8500 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8501 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8502 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8503 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8504 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8505 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8506 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8507 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8508 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
8511 static expression_t *parse_subexpression(precedence_t precedence)
8513 expression_parser_function_t *parser
8514 = &expression_parsers[token.kind];
8517 if (parser->parser != NULL) {
8518 left = parser->parser();
8520 left = parse_primary_expression();
8522 assert(left != NULL);
8525 parser = &expression_parsers[token.kind];
8526 if (parser->infix_parser == NULL)
8528 if (parser->infix_precedence < precedence)
8531 left = parser->infix_parser(left);
8533 assert(left != NULL);
8540 * Parse an expression.
8542 static expression_t *parse_expression(void)
8544 return parse_subexpression(PREC_EXPRESSION);
8548 * Register a parser for a prefix-like operator.
8550 * @param parser the parser function
8551 * @param token_kind the token type of the prefix token
8553 static void register_expression_parser(parse_expression_function parser,
8556 expression_parser_function_t *entry = &expression_parsers[token_kind];
8558 if (entry->parser != NULL) {
8559 diagnosticf("for token '%k'\n", (token_kind_t)token_kind);
8560 panic("trying to register multiple expression parsers for a token");
8562 entry->parser = parser;
8566 * Register a parser for an infix operator with given precedence.
8568 * @param parser the parser function
8569 * @param token_kind the token type of the infix operator
8570 * @param precedence the precedence of the operator
8572 static void register_infix_parser(parse_expression_infix_function parser,
8573 int token_kind, precedence_t precedence)
8575 expression_parser_function_t *entry = &expression_parsers[token_kind];
8577 if (entry->infix_parser != NULL) {
8578 diagnosticf("for token '%k'\n", (token_kind_t)token_kind);
8579 panic("trying to register multiple infix expression parsers for a "
8582 entry->infix_parser = parser;
8583 entry->infix_precedence = precedence;
8587 * Initialize the expression parsers.
8589 static void init_expression_parsers(void)
8591 memset(&expression_parsers, 0, sizeof(expression_parsers));
8593 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
8594 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
8595 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
8596 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
8597 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
8598 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
8599 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
8600 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
8601 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
8602 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
8603 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
8604 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
8605 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
8606 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
8607 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
8608 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
8609 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
8610 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
8611 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
8612 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
8613 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
8614 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
8615 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
8616 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
8617 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
8618 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
8619 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
8620 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
8621 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
8622 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
8623 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
8624 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
8625 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
8626 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
8627 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
8628 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
8629 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
8631 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
8632 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
8633 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
8634 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
8635 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
8636 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
8637 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
8638 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
8639 register_expression_parser(parse_sizeof, T_sizeof);
8640 register_expression_parser(parse_alignof, T___alignof__);
8641 register_expression_parser(parse_extension, T___extension__);
8642 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
8643 register_expression_parser(parse_delete, T_delete);
8644 register_expression_parser(parse_throw, T_throw);
8648 * Parse a asm statement arguments specification.
8650 static asm_argument_t *parse_asm_arguments(bool is_out)
8652 asm_argument_t *result = NULL;
8653 asm_argument_t **anchor = &result;
8655 while (token.kind == T_STRING_LITERAL || token.kind == '[') {
8656 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
8659 add_anchor_token(']');
8660 argument->symbol = expect_identifier("while parsing asm argument", NULL);
8661 rem_anchor_token(']');
8663 if (!argument->symbol)
8667 argument->constraints = parse_string_literals();
8668 add_anchor_token(')');
8670 expression_t *expression = parse_expression();
8671 rem_anchor_token(')');
8673 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
8674 * change size or type representation (e.g. int -> long is ok, but
8675 * int -> float is not) */
8676 if (expression->kind == EXPR_UNARY_CAST) {
8677 type_t *const type = expression->base.type;
8678 type_kind_t const kind = type->kind;
8679 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
8682 if (kind == TYPE_ATOMIC) {
8683 atomic_type_kind_t const akind = type->atomic.akind;
8684 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8685 size = get_atomic_type_size(akind);
8687 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8688 size = get_type_size(type_void_ptr);
8692 expression_t *const value = expression->unary.value;
8693 type_t *const value_type = value->base.type;
8694 type_kind_t const value_kind = value_type->kind;
8696 unsigned value_flags;
8697 unsigned value_size;
8698 if (value_kind == TYPE_ATOMIC) {
8699 atomic_type_kind_t const value_akind = value_type->atomic.akind;
8700 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8701 value_size = get_atomic_type_size(value_akind);
8702 } else if (value_kind == TYPE_POINTER) {
8703 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8704 value_size = get_type_size(type_void_ptr);
8709 if (value_flags != flags || value_size != size)
8713 } while (expression->kind == EXPR_UNARY_CAST);
8717 if (!is_lvalue(expression)) {
8718 errorf(&expression->base.source_position,
8719 "asm output argument is not an lvalue");
8722 if (argument->constraints.begin[0] == '=')
8723 determine_lhs_ent(expression, NULL);
8725 mark_vars_read(expression, NULL);
8727 mark_vars_read(expression, NULL);
8729 argument->expression = expression;
8732 set_address_taken(expression, true);
8735 anchor = &argument->next;
8745 * Parse a asm statement clobber specification.
8747 static asm_clobber_t *parse_asm_clobbers(void)
8749 asm_clobber_t *result = NULL;
8750 asm_clobber_t **anchor = &result;
8752 while (token.kind == T_STRING_LITERAL) {
8753 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
8754 clobber->clobber = parse_string_literals();
8757 anchor = &clobber->next;
8767 * Parse an asm statement.
8769 static statement_t *parse_asm_statement(void)
8771 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
8772 asm_statement_t *asm_statement = &statement->asms;
8776 if (next_if(T_volatile))
8777 asm_statement->is_volatile = true;
8780 add_anchor_token(')');
8781 if (token.kind != T_STRING_LITERAL) {
8782 parse_error_expected("after asm(", T_STRING_LITERAL, NULL);
8785 asm_statement->asm_text = parse_string_literals();
8787 add_anchor_token(':');
8788 if (!next_if(':')) {
8789 rem_anchor_token(':');
8793 asm_statement->outputs = parse_asm_arguments(true);
8794 if (!next_if(':')) {
8795 rem_anchor_token(':');
8799 asm_statement->inputs = parse_asm_arguments(false);
8800 if (!next_if(':')) {
8801 rem_anchor_token(':');
8804 rem_anchor_token(':');
8806 asm_statement->clobbers = parse_asm_clobbers();
8809 rem_anchor_token(')');
8813 if (asm_statement->outputs == NULL) {
8814 /* GCC: An 'asm' instruction without any output operands will be treated
8815 * identically to a volatile 'asm' instruction. */
8816 asm_statement->is_volatile = true;
8822 static statement_t *parse_label_inner_statement(statement_t const *const label, char const *const label_kind)
8824 statement_t *inner_stmt;
8825 switch (token.kind) {
8827 errorf(&label->base.source_position, "%s at end of compound statement", label_kind);
8828 inner_stmt = create_error_statement();
8832 if (label->kind == STATEMENT_LABEL) {
8833 /* Eat an empty statement here, to avoid the warning about an empty
8834 * statement after a label. label:; is commonly used to have a label
8835 * before a closing brace. */
8836 inner_stmt = create_empty_statement();
8843 inner_stmt = parse_statement();
8844 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
8845 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
8846 if (inner_stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
8847 errorf(&inner_stmt->base.source_position, "declaration after %s", label_kind);
8855 * Parse a case statement.
8857 static statement_t *parse_case_statement(void)
8859 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
8860 source_position_t *const pos = &statement->base.source_position;
8863 add_anchor_token(':');
8865 expression_t *expression = parse_expression();
8866 type_t *expression_type = expression->base.type;
8867 type_t *skipped = skip_typeref(expression_type);
8868 if (!is_type_integer(skipped) && is_type_valid(skipped)) {
8869 errorf(pos, "case expression '%E' must have integer type but has type '%T'",
8870 expression, expression_type);
8873 type_t *type = expression_type;
8874 if (current_switch != NULL) {
8875 type_t *switch_type = current_switch->expression->base.type;
8876 if (is_type_valid(switch_type)) {
8877 expression = create_implicit_cast(expression, switch_type);
8881 statement->case_label.expression = expression;
8882 expression_classification_t const expr_class = is_constant_expression(expression);
8883 if (expr_class != EXPR_CLASS_CONSTANT) {
8884 if (expr_class != EXPR_CLASS_ERROR) {
8885 errorf(pos, "case label does not reduce to an integer constant");
8887 statement->case_label.is_bad = true;
8889 long const val = fold_constant_to_int(expression);
8890 statement->case_label.first_case = val;
8891 statement->case_label.last_case = val;
8895 if (next_if(T_DOTDOTDOT)) {
8896 expression_t *end_range = parse_expression();
8897 expression_type = expression->base.type;
8898 skipped = skip_typeref(expression_type);
8899 if (!is_type_integer(skipped) && is_type_valid(skipped)) {
8900 errorf(pos, "case expression '%E' must have integer type but has type '%T'",
8901 expression, expression_type);
8904 end_range = create_implicit_cast(end_range, type);
8905 statement->case_label.end_range = end_range;
8906 expression_classification_t const end_class = is_constant_expression(end_range);
8907 if (end_class != EXPR_CLASS_CONSTANT) {
8908 if (end_class != EXPR_CLASS_ERROR) {
8909 errorf(pos, "case range does not reduce to an integer constant");
8911 statement->case_label.is_bad = true;
8913 long const val = fold_constant_to_int(end_range);
8914 statement->case_label.last_case = val;
8916 if (val < statement->case_label.first_case) {
8917 statement->case_label.is_empty_range = true;
8918 warningf(WARN_OTHER, pos, "empty range specified");
8924 PUSH_PARENT(statement);
8926 rem_anchor_token(':');
8929 if (current_switch != NULL) {
8930 if (! statement->case_label.is_bad) {
8931 /* Check for duplicate case values */
8932 case_label_statement_t *c = &statement->case_label;
8933 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
8934 if (l->is_bad || l->is_empty_range || l->expression == NULL)
8937 if (c->last_case < l->first_case || c->first_case > l->last_case)
8940 errorf(pos, "duplicate case value (previously used %P)",
8941 &l->base.source_position);
8945 /* link all cases into the switch statement */
8946 if (current_switch->last_case == NULL) {
8947 current_switch->first_case = &statement->case_label;
8949 current_switch->last_case->next = &statement->case_label;
8951 current_switch->last_case = &statement->case_label;
8953 errorf(pos, "case label not within a switch statement");
8956 statement->case_label.statement = parse_label_inner_statement(statement, "case label");
8963 * Parse a default statement.
8965 static statement_t *parse_default_statement(void)
8967 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
8971 PUSH_PARENT(statement);
8975 if (current_switch != NULL) {
8976 const case_label_statement_t *def_label = current_switch->default_label;
8977 if (def_label != NULL) {
8978 errorf(&statement->base.source_position, "multiple default labels in one switch (previous declared %P)", &def_label->base.source_position);
8980 current_switch->default_label = &statement->case_label;
8982 /* link all cases into the switch statement */
8983 if (current_switch->last_case == NULL) {
8984 current_switch->first_case = &statement->case_label;
8986 current_switch->last_case->next = &statement->case_label;
8988 current_switch->last_case = &statement->case_label;
8991 errorf(&statement->base.source_position,
8992 "'default' label not within a switch statement");
8995 statement->case_label.statement = parse_label_inner_statement(statement, "default label");
9002 * Parse a label statement.
9004 static statement_t *parse_label_statement(void)
9006 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9007 label_t *const label = get_label(NULL /* Cannot fail, token is T_IDENTIFIER. */);
9008 statement->label.label = label;
9010 PUSH_PARENT(statement);
9012 /* if statement is already set then the label is defined twice,
9013 * otherwise it was just mentioned in a goto/local label declaration so far
9015 source_position_t const* const pos = &statement->base.source_position;
9016 if (label->statement != NULL) {
9017 errorf(pos, "duplicate '%N' (declared %P)", (entity_t const*)label, &label->base.source_position);
9019 label->base.source_position = *pos;
9020 label->statement = statement;
9025 if (token.kind == T___attribute__ && !(c_mode & _CXX)) {
9026 parse_attributes(NULL); // TODO process attributes
9029 statement->label.statement = parse_label_inner_statement(statement, "label");
9031 /* remember the labels in a list for later checking */
9032 *label_anchor = &statement->label;
9033 label_anchor = &statement->label.next;
9039 static statement_t *parse_inner_statement(void)
9041 statement_t *const stmt = parse_statement();
9042 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
9043 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
9044 if (stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
9045 errorf(&stmt->base.source_position, "declaration as inner statement, use {}");
9051 * Parse an expression in parentheses and mark its variables as read.
9053 static expression_t *parse_condition(void)
9055 add_anchor_token(')');
9057 expression_t *const expr = parse_expression();
9058 mark_vars_read(expr, NULL);
9059 rem_anchor_token(')');
9065 * Parse an if statement.
9067 static statement_t *parse_if(void)
9069 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9073 PUSH_PARENT(statement);
9074 PUSH_SCOPE_STATEMENT(&statement->ifs.scope);
9076 add_anchor_token(T_else);
9078 expression_t *const expr = parse_condition();
9079 statement->ifs.condition = expr;
9080 /* §6.8.4.1:1 The controlling expression of an if statement shall have
9082 semantic_condition(expr, "condition of 'if'-statment");
9084 statement_t *const true_stmt = parse_inner_statement();
9085 statement->ifs.true_statement = true_stmt;
9086 rem_anchor_token(T_else);
9088 if (true_stmt->kind == STATEMENT_EMPTY) {
9089 warningf(WARN_EMPTY_BODY, HERE,
9090 "suggest braces around empty body in an ‘if’ statement");
9093 if (next_if(T_else)) {
9094 statement->ifs.false_statement = parse_inner_statement();
9096 if (statement->ifs.false_statement->kind == STATEMENT_EMPTY) {
9097 warningf(WARN_EMPTY_BODY, HERE,
9098 "suggest braces around empty body in an ‘if’ statement");
9100 } else if (true_stmt->kind == STATEMENT_IF &&
9101 true_stmt->ifs.false_statement != NULL) {
9102 source_position_t const *const pos = &true_stmt->base.source_position;
9103 warningf(WARN_PARENTHESES, pos, "suggest explicit braces to avoid ambiguous 'else'");
9112 * Check that all enums are handled in a switch.
9114 * @param statement the switch statement to check
9116 static void check_enum_cases(const switch_statement_t *statement)
9118 if (!is_warn_on(WARN_SWITCH_ENUM))
9120 const type_t *type = skip_typeref(statement->expression->base.type);
9121 if (! is_type_enum(type))
9123 const enum_type_t *enumt = &type->enumt;
9125 /* if we have a default, no warnings */
9126 if (statement->default_label != NULL)
9129 /* FIXME: calculation of value should be done while parsing */
9130 /* TODO: quadratic algorithm here. Change to an n log n one */
9131 long last_value = -1;
9132 const entity_t *entry = enumt->enume->base.next;
9133 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9134 entry = entry->base.next) {
9135 const expression_t *expression = entry->enum_value.value;
9136 long value = expression != NULL ? fold_constant_to_int(expression) : last_value + 1;
9138 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9139 if (l->expression == NULL)
9141 if (l->first_case <= value && value <= l->last_case) {
9147 source_position_t const *const pos = &statement->base.source_position;
9148 warningf(WARN_SWITCH_ENUM, pos, "'%N' not handled in switch", entry);
9155 * Parse a switch statement.
9157 static statement_t *parse_switch(void)
9159 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9163 PUSH_PARENT(statement);
9164 PUSH_SCOPE_STATEMENT(&statement->switchs.scope);
9166 expression_t *const expr = parse_condition();
9167 type_t * type = skip_typeref(expr->base.type);
9168 if (is_type_integer(type)) {
9169 type = promote_integer(type);
9170 if (get_akind_rank(get_akind(type)) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9171 warningf(WARN_TRADITIONAL, &expr->base.source_position, "'%T' switch expression not converted to '%T' in ISO C", type, type_int);
9173 } else if (is_type_valid(type)) {
9174 errorf(&expr->base.source_position,
9175 "switch quantity is not an integer, but '%T'", type);
9176 type = type_error_type;
9178 statement->switchs.expression = create_implicit_cast(expr, type);
9180 switch_statement_t *rem = current_switch;
9181 current_switch = &statement->switchs;
9182 statement->switchs.body = parse_inner_statement();
9183 current_switch = rem;
9185 if (statement->switchs.default_label == NULL) {
9186 warningf(WARN_SWITCH_DEFAULT, &statement->base.source_position, "switch has no default case");
9188 check_enum_cases(&statement->switchs);
9195 static statement_t *parse_loop_body(statement_t *const loop)
9197 statement_t *const rem = current_loop;
9198 current_loop = loop;
9200 statement_t *const body = parse_inner_statement();
9207 * Parse a while statement.
9209 static statement_t *parse_while(void)
9211 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9215 PUSH_PARENT(statement);
9216 PUSH_SCOPE_STATEMENT(&statement->whiles.scope);
9218 expression_t *const cond = parse_condition();
9219 statement->whiles.condition = cond;
9220 /* §6.8.5:2 The controlling expression of an iteration statement shall
9221 * have scalar type. */
9222 semantic_condition(cond, "condition of 'while'-statement");
9224 statement->whiles.body = parse_loop_body(statement);
9232 * Parse a do statement.
9234 static statement_t *parse_do(void)
9236 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9240 PUSH_PARENT(statement);
9241 PUSH_SCOPE_STATEMENT(&statement->do_while.scope);
9243 add_anchor_token(T_while);
9244 statement->do_while.body = parse_loop_body(statement);
9245 rem_anchor_token(T_while);
9248 expression_t *const cond = parse_condition();
9249 statement->do_while.condition = cond;
9250 /* §6.8.5:2 The controlling expression of an iteration statement shall
9251 * have scalar type. */
9252 semantic_condition(cond, "condition of 'do-while'-statement");
9261 * Parse a for statement.
9263 static statement_t *parse_for(void)
9265 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9269 PUSH_PARENT(statement);
9270 PUSH_SCOPE_STATEMENT(&statement->fors.scope);
9272 add_anchor_token(')');
9278 } else if (is_declaration_specifier(&token)) {
9279 parse_declaration(record_entity, DECL_FLAGS_NONE);
9281 add_anchor_token(';');
9282 expression_t *const init = parse_expression();
9283 statement->fors.initialisation = init;
9284 mark_vars_read(init, ENT_ANY);
9285 if (!expression_has_effect(init)) {
9286 warningf(WARN_UNUSED_VALUE, &init->base.source_position, "initialisation of 'for'-statement has no effect");
9288 rem_anchor_token(';');
9294 if (token.kind != ';') {
9295 add_anchor_token(';');
9296 expression_t *const cond = parse_expression();
9297 statement->fors.condition = cond;
9298 /* §6.8.5:2 The controlling expression of an iteration statement
9299 * shall have scalar type. */
9300 semantic_condition(cond, "condition of 'for'-statement");
9301 mark_vars_read(cond, NULL);
9302 rem_anchor_token(';');
9305 if (token.kind != ')') {
9306 expression_t *const step = parse_expression();
9307 statement->fors.step = step;
9308 mark_vars_read(step, ENT_ANY);
9309 if (!expression_has_effect(step)) {
9310 warningf(WARN_UNUSED_VALUE, &step->base.source_position, "step of 'for'-statement has no effect");
9313 rem_anchor_token(')');
9315 statement->fors.body = parse_loop_body(statement);
9323 * Parse a goto statement.
9325 static statement_t *parse_goto(void)
9327 statement_t *statement;
9328 if (GNU_MODE && look_ahead(1)->kind == '*') {
9329 statement = allocate_statement_zero(STATEMENT_COMPUTED_GOTO);
9333 expression_t *expression = parse_expression();
9334 mark_vars_read(expression, NULL);
9336 /* Argh: although documentation says the expression must be of type void*,
9337 * gcc accepts anything that can be casted into void* without error */
9338 type_t *type = expression->base.type;
9340 if (type != type_error_type) {
9341 if (!is_type_pointer(type) && !is_type_integer(type)) {
9342 errorf(&expression->base.source_position,
9343 "cannot convert to a pointer type");
9344 } else if (type != type_void_ptr) {
9345 warningf(WARN_OTHER, &expression->base.source_position, "type of computed goto expression should be 'void*' not '%T'", type);
9347 expression = create_implicit_cast(expression, type_void_ptr);
9350 statement->computed_goto.expression = expression;
9352 statement = allocate_statement_zero(STATEMENT_GOTO);
9355 label_t *const label = get_label("while parsing goto");
9358 statement->gotos.label = label;
9360 /* remember the goto's in a list for later checking */
9361 *goto_anchor = &statement->gotos;
9362 goto_anchor = &statement->gotos.next;
9364 statement->gotos.label = &allocate_entity_zero(ENTITY_LABEL, NAMESPACE_LABEL, sym_anonymous, &builtin_source_position)->label;
9373 * Parse a continue statement.
9375 static statement_t *parse_continue(void)
9377 if (current_loop == NULL) {
9378 errorf(HERE, "continue statement not within loop");
9381 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9389 * Parse a break statement.
9391 static statement_t *parse_break(void)
9393 if (current_switch == NULL && current_loop == NULL) {
9394 errorf(HERE, "break statement not within loop or switch");
9397 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9405 * Parse a __leave statement.
9407 static statement_t *parse_leave_statement(void)
9409 if (current_try == NULL) {
9410 errorf(HERE, "__leave statement not within __try");
9413 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9421 * Check if a given entity represents a local variable.
9423 static bool is_local_variable(const entity_t *entity)
9425 if (entity->kind != ENTITY_VARIABLE)
9428 switch ((storage_class_tag_t) entity->declaration.storage_class) {
9429 case STORAGE_CLASS_AUTO:
9430 case STORAGE_CLASS_REGISTER: {
9431 const type_t *type = skip_typeref(entity->declaration.type);
9432 if (is_type_function(type)) {
9444 * Check if a given expression represents a local variable.
9446 static bool expression_is_local_variable(const expression_t *expression)
9448 if (expression->base.kind != EXPR_REFERENCE) {
9451 const entity_t *entity = expression->reference.entity;
9452 return is_local_variable(entity);
9456 * Check if a given expression represents a local variable and
9457 * return its declaration then, else return NULL.
9459 entity_t *expression_is_variable(const expression_t *expression)
9461 if (expression->base.kind != EXPR_REFERENCE) {
9464 entity_t *entity = expression->reference.entity;
9465 if (entity->kind != ENTITY_VARIABLE)
9471 static void err_or_warn(source_position_t const *const pos, char const *const msg)
9473 if (c_mode & _CXX || strict_mode) {
9476 warningf(WARN_OTHER, pos, msg);
9481 * Parse a return statement.
9483 static statement_t *parse_return(void)
9485 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9488 expression_t *return_value = NULL;
9489 if (token.kind != ';') {
9490 return_value = parse_expression();
9491 mark_vars_read(return_value, NULL);
9494 const type_t *const func_type = skip_typeref(current_function->base.type);
9495 assert(is_type_function(func_type));
9496 type_t *const return_type = skip_typeref(func_type->function.return_type);
9498 source_position_t const *const pos = &statement->base.source_position;
9499 if (return_value != NULL) {
9500 type_t *return_value_type = skip_typeref(return_value->base.type);
9502 if (is_type_void(return_type)) {
9503 if (!is_type_void(return_value_type)) {
9504 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
9505 /* Only warn in C mode, because GCC does the same */
9506 err_or_warn(pos, "'return' with a value, in function returning 'void'");
9507 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9508 /* Only warn in C mode, because GCC does the same */
9509 err_or_warn(pos, "'return' with expression in function returning 'void'");
9512 assign_error_t error = semantic_assign(return_type, return_value);
9513 report_assign_error(error, return_type, return_value, "'return'",
9516 return_value = create_implicit_cast(return_value, return_type);
9517 /* check for returning address of a local var */
9518 if (return_value != NULL && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
9519 const expression_t *expression = return_value->unary.value;
9520 if (expression_is_local_variable(expression)) {
9521 warningf(WARN_OTHER, pos, "function returns address of local variable");
9524 } else if (!is_type_void(return_type)) {
9525 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9526 err_or_warn(pos, "'return' without value, in function returning non-void");
9528 statement->returns.value = return_value;
9535 * Parse a declaration statement.
9537 static statement_t *parse_declaration_statement(void)
9539 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9541 entity_t *before = current_scope->last_entity;
9543 parse_external_declaration();
9545 parse_declaration(record_entity, DECL_FLAGS_NONE);
9548 declaration_statement_t *const decl = &statement->declaration;
9549 entity_t *const begin =
9550 before != NULL ? before->base.next : current_scope->entities;
9551 decl->declarations_begin = begin;
9552 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
9558 * Parse an expression statement, ie. expr ';'.
9560 static statement_t *parse_expression_statement(void)
9562 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
9564 expression_t *const expr = parse_expression();
9565 statement->expression.expression = expr;
9566 mark_vars_read(expr, ENT_ANY);
9573 * Parse a microsoft __try { } __finally { } or
9574 * __try{ } __except() { }
9576 static statement_t *parse_ms_try_statment(void)
9578 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
9581 PUSH_PARENT(statement);
9583 ms_try_statement_t *rem = current_try;
9584 current_try = &statement->ms_try;
9585 statement->ms_try.try_statement = parse_compound_statement(false);
9590 if (next_if(T___except)) {
9591 expression_t *const expr = parse_condition();
9592 type_t * type = skip_typeref(expr->base.type);
9593 if (is_type_integer(type)) {
9594 type = promote_integer(type);
9595 } else if (is_type_valid(type)) {
9596 errorf(&expr->base.source_position,
9597 "__expect expression is not an integer, but '%T'", type);
9598 type = type_error_type;
9600 statement->ms_try.except_expression = create_implicit_cast(expr, type);
9601 } else if (!next_if(T__finally)) {
9602 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
9604 statement->ms_try.final_statement = parse_compound_statement(false);
9608 static statement_t *parse_empty_statement(void)
9610 warningf(WARN_EMPTY_STATEMENT, HERE, "statement is empty");
9611 statement_t *const statement = create_empty_statement();
9616 static statement_t *parse_local_label_declaration(void)
9618 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9622 entity_t *begin = NULL;
9623 entity_t *end = NULL;
9624 entity_t **anchor = &begin;
9625 add_anchor_token(';');
9626 add_anchor_token(',');
9628 source_position_t pos;
9629 symbol_t *const symbol = expect_identifier("while parsing local label declaration", &pos);
9631 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
9632 if (entity != NULL && entity->base.parent_scope == current_scope) {
9633 source_position_t const *const ppos = &entity->base.source_position;
9634 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
9636 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL, NAMESPACE_LABEL, symbol, &pos);
9637 entity->base.parent_scope = current_scope;
9640 anchor = &entity->base.next;
9643 environment_push(entity);
9646 } while (next_if(','));
9647 rem_anchor_token(',');
9648 rem_anchor_token(';');
9650 statement->declaration.declarations_begin = begin;
9651 statement->declaration.declarations_end = end;
9655 static void parse_namespace_definition(void)
9659 entity_t *entity = NULL;
9660 symbol_t *symbol = NULL;
9662 if (token.kind == T_IDENTIFIER) {
9663 symbol = token.base.symbol;
9664 entity = get_entity(symbol, NAMESPACE_NORMAL);
9665 if (entity && entity->kind != ENTITY_NAMESPACE) {
9667 if (entity->base.parent_scope == current_scope && is_entity_valid(entity)) {
9668 error_redefined_as_different_kind(HERE, entity, ENTITY_NAMESPACE);
9674 if (entity == NULL) {
9675 entity = allocate_entity_zero(ENTITY_NAMESPACE, NAMESPACE_NORMAL, symbol, HERE);
9676 entity->base.parent_scope = current_scope;
9679 if (token.kind == '=') {
9680 /* TODO: parse namespace alias */
9681 panic("namespace alias definition not supported yet");
9684 environment_push(entity);
9685 append_entity(current_scope, entity);
9687 PUSH_SCOPE(&entity->namespacee.members);
9688 PUSH_CURRENT_ENTITY(entity);
9690 add_anchor_token('}');
9693 rem_anchor_token('}');
9696 POP_CURRENT_ENTITY();
9701 * Parse a statement.
9702 * There's also parse_statement() which additionally checks for
9703 * "statement has no effect" warnings
9705 static statement_t *intern_parse_statement(void)
9707 /* declaration or statement */
9708 statement_t *statement;
9709 switch (token.kind) {
9710 case T_IDENTIFIER: {
9711 token_kind_t la1_type = (token_kind_t)look_ahead(1)->kind;
9712 if (la1_type == ':') {
9713 statement = parse_label_statement();
9714 } else if (is_typedef_symbol(token.base.symbol)) {
9715 statement = parse_declaration_statement();
9717 /* it's an identifier, the grammar says this must be an
9718 * expression statement. However it is common that users mistype
9719 * declaration types, so we guess a bit here to improve robustness
9720 * for incorrect programs */
9724 if (get_entity(token.base.symbol, NAMESPACE_NORMAL) != NULL) {
9726 statement = parse_expression_statement();
9730 statement = parse_declaration_statement();
9738 case T___extension__: {
9739 /* This can be a prefix to a declaration or an expression statement.
9740 * We simply eat it now and parse the rest with tail recursion. */
9742 statement = intern_parse_statement();
9748 statement = parse_declaration_statement();
9752 statement = parse_local_label_declaration();
9755 case ';': statement = parse_empty_statement(); break;
9756 case '{': statement = parse_compound_statement(false); break;
9757 case T___leave: statement = parse_leave_statement(); break;
9758 case T___try: statement = parse_ms_try_statment(); break;
9759 case T_asm: statement = parse_asm_statement(); break;
9760 case T_break: statement = parse_break(); break;
9761 case T_case: statement = parse_case_statement(); break;
9762 case T_continue: statement = parse_continue(); break;
9763 case T_default: statement = parse_default_statement(); break;
9764 case T_do: statement = parse_do(); break;
9765 case T_for: statement = parse_for(); break;
9766 case T_goto: statement = parse_goto(); break;
9767 case T_if: statement = parse_if(); break;
9768 case T_return: statement = parse_return(); break;
9769 case T_switch: statement = parse_switch(); break;
9770 case T_while: statement = parse_while(); break;
9773 statement = parse_expression_statement();
9777 errorf(HERE, "unexpected token %K while parsing statement", &token);
9778 statement = create_error_statement();
9787 * parse a statement and emits "statement has no effect" warning if needed
9788 * (This is really a wrapper around intern_parse_statement with check for 1
9789 * single warning. It is needed, because for statement expressions we have
9790 * to avoid the warning on the last statement)
9792 static statement_t *parse_statement(void)
9794 statement_t *statement = intern_parse_statement();
9796 if (statement->kind == STATEMENT_EXPRESSION) {
9797 expression_t *expression = statement->expression.expression;
9798 if (!expression_has_effect(expression)) {
9799 warningf(WARN_UNUSED_VALUE, &expression->base.source_position, "statement has no effect");
9807 * Parse a compound statement.
9809 static statement_t *parse_compound_statement(bool inside_expression_statement)
9811 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
9813 PUSH_PARENT(statement);
9814 PUSH_SCOPE(&statement->compound.scope);
9817 add_anchor_token('}');
9818 /* tokens, which can start a statement */
9819 /* TODO MS, __builtin_FOO */
9820 add_anchor_token('!');
9821 add_anchor_token('&');
9822 add_anchor_token('(');
9823 add_anchor_token('*');
9824 add_anchor_token('+');
9825 add_anchor_token('-');
9826 add_anchor_token(';');
9827 add_anchor_token('{');
9828 add_anchor_token('~');
9829 add_anchor_token(T_CHARACTER_CONSTANT);
9830 add_anchor_token(T_COLONCOLON);
9831 add_anchor_token(T_FLOATINGPOINT);
9832 add_anchor_token(T_IDENTIFIER);
9833 add_anchor_token(T_INTEGER);
9834 add_anchor_token(T_MINUSMINUS);
9835 add_anchor_token(T_PLUSPLUS);
9836 add_anchor_token(T_STRING_LITERAL);
9837 add_anchor_token(T_WIDE_CHARACTER_CONSTANT);
9838 add_anchor_token(T_WIDE_STRING_LITERAL);
9839 add_anchor_token(T__Bool);
9840 add_anchor_token(T__Complex);
9841 add_anchor_token(T__Imaginary);
9842 add_anchor_token(T___FUNCTION__);
9843 add_anchor_token(T___PRETTY_FUNCTION__);
9844 add_anchor_token(T___alignof__);
9845 add_anchor_token(T___attribute__);
9846 add_anchor_token(T___builtin_va_start);
9847 add_anchor_token(T___extension__);
9848 add_anchor_token(T___func__);
9849 add_anchor_token(T___imag__);
9850 add_anchor_token(T___label__);
9851 add_anchor_token(T___real__);
9852 add_anchor_token(T___thread);
9853 add_anchor_token(T_asm);
9854 add_anchor_token(T_auto);
9855 add_anchor_token(T_bool);
9856 add_anchor_token(T_break);
9857 add_anchor_token(T_case);
9858 add_anchor_token(T_char);
9859 add_anchor_token(T_class);
9860 add_anchor_token(T_const);
9861 add_anchor_token(T_const_cast);
9862 add_anchor_token(T_continue);
9863 add_anchor_token(T_default);
9864 add_anchor_token(T_delete);
9865 add_anchor_token(T_double);
9866 add_anchor_token(T_do);
9867 add_anchor_token(T_dynamic_cast);
9868 add_anchor_token(T_enum);
9869 add_anchor_token(T_extern);
9870 add_anchor_token(T_false);
9871 add_anchor_token(T_float);
9872 add_anchor_token(T_for);
9873 add_anchor_token(T_goto);
9874 add_anchor_token(T_if);
9875 add_anchor_token(T_inline);
9876 add_anchor_token(T_int);
9877 add_anchor_token(T_long);
9878 add_anchor_token(T_new);
9879 add_anchor_token(T_operator);
9880 add_anchor_token(T_register);
9881 add_anchor_token(T_reinterpret_cast);
9882 add_anchor_token(T_restrict);
9883 add_anchor_token(T_return);
9884 add_anchor_token(T_short);
9885 add_anchor_token(T_signed);
9886 add_anchor_token(T_sizeof);
9887 add_anchor_token(T_static);
9888 add_anchor_token(T_static_cast);
9889 add_anchor_token(T_struct);
9890 add_anchor_token(T_switch);
9891 add_anchor_token(T_template);
9892 add_anchor_token(T_this);
9893 add_anchor_token(T_throw);
9894 add_anchor_token(T_true);
9895 add_anchor_token(T_try);
9896 add_anchor_token(T_typedef);
9897 add_anchor_token(T_typeid);
9898 add_anchor_token(T_typename);
9899 add_anchor_token(T_typeof);
9900 add_anchor_token(T_union);
9901 add_anchor_token(T_unsigned);
9902 add_anchor_token(T_using);
9903 add_anchor_token(T_void);
9904 add_anchor_token(T_volatile);
9905 add_anchor_token(T_wchar_t);
9906 add_anchor_token(T_while);
9908 statement_t **anchor = &statement->compound.statements;
9909 bool only_decls_so_far = true;
9910 while (token.kind != '}' && token.kind != T_EOF) {
9911 statement_t *sub_statement = intern_parse_statement();
9912 if (sub_statement->kind == STATEMENT_ERROR) {
9916 if (sub_statement->kind != STATEMENT_DECLARATION) {
9917 only_decls_so_far = false;
9918 } else if (!only_decls_so_far) {
9919 source_position_t const *const pos = &sub_statement->base.source_position;
9920 warningf(WARN_DECLARATION_AFTER_STATEMENT, pos, "ISO C90 forbids mixed declarations and code");
9923 *anchor = sub_statement;
9924 anchor = &sub_statement->base.next;
9928 /* look over all statements again to produce no effect warnings */
9929 if (is_warn_on(WARN_UNUSED_VALUE)) {
9930 statement_t *sub_statement = statement->compound.statements;
9931 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
9932 if (sub_statement->kind != STATEMENT_EXPRESSION)
9934 /* don't emit a warning for the last expression in an expression
9935 * statement as it has always an effect */
9936 if (inside_expression_statement && sub_statement->base.next == NULL)
9939 expression_t *expression = sub_statement->expression.expression;
9940 if (!expression_has_effect(expression)) {
9941 warningf(WARN_UNUSED_VALUE, &expression->base.source_position, "statement has no effect");
9946 rem_anchor_token(T_while);
9947 rem_anchor_token(T_wchar_t);
9948 rem_anchor_token(T_volatile);
9949 rem_anchor_token(T_void);
9950 rem_anchor_token(T_using);
9951 rem_anchor_token(T_unsigned);
9952 rem_anchor_token(T_union);
9953 rem_anchor_token(T_typeof);
9954 rem_anchor_token(T_typename);
9955 rem_anchor_token(T_typeid);
9956 rem_anchor_token(T_typedef);
9957 rem_anchor_token(T_try);
9958 rem_anchor_token(T_true);
9959 rem_anchor_token(T_throw);
9960 rem_anchor_token(T_this);
9961 rem_anchor_token(T_template);
9962 rem_anchor_token(T_switch);
9963 rem_anchor_token(T_struct);
9964 rem_anchor_token(T_static_cast);
9965 rem_anchor_token(T_static);
9966 rem_anchor_token(T_sizeof);
9967 rem_anchor_token(T_signed);
9968 rem_anchor_token(T_short);
9969 rem_anchor_token(T_return);
9970 rem_anchor_token(T_restrict);
9971 rem_anchor_token(T_reinterpret_cast);
9972 rem_anchor_token(T_register);
9973 rem_anchor_token(T_operator);
9974 rem_anchor_token(T_new);
9975 rem_anchor_token(T_long);
9976 rem_anchor_token(T_int);
9977 rem_anchor_token(T_inline);
9978 rem_anchor_token(T_if);
9979 rem_anchor_token(T_goto);
9980 rem_anchor_token(T_for);
9981 rem_anchor_token(T_float);
9982 rem_anchor_token(T_false);
9983 rem_anchor_token(T_extern);
9984 rem_anchor_token(T_enum);
9985 rem_anchor_token(T_dynamic_cast);
9986 rem_anchor_token(T_do);
9987 rem_anchor_token(T_double);
9988 rem_anchor_token(T_delete);
9989 rem_anchor_token(T_default);
9990 rem_anchor_token(T_continue);
9991 rem_anchor_token(T_const_cast);
9992 rem_anchor_token(T_const);
9993 rem_anchor_token(T_class);
9994 rem_anchor_token(T_char);
9995 rem_anchor_token(T_case);
9996 rem_anchor_token(T_break);
9997 rem_anchor_token(T_bool);
9998 rem_anchor_token(T_auto);
9999 rem_anchor_token(T_asm);
10000 rem_anchor_token(T___thread);
10001 rem_anchor_token(T___real__);
10002 rem_anchor_token(T___label__);
10003 rem_anchor_token(T___imag__);
10004 rem_anchor_token(T___func__);
10005 rem_anchor_token(T___extension__);
10006 rem_anchor_token(T___builtin_va_start);
10007 rem_anchor_token(T___attribute__);
10008 rem_anchor_token(T___alignof__);
10009 rem_anchor_token(T___PRETTY_FUNCTION__);
10010 rem_anchor_token(T___FUNCTION__);
10011 rem_anchor_token(T__Imaginary);
10012 rem_anchor_token(T__Complex);
10013 rem_anchor_token(T__Bool);
10014 rem_anchor_token(T_WIDE_STRING_LITERAL);
10015 rem_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10016 rem_anchor_token(T_STRING_LITERAL);
10017 rem_anchor_token(T_PLUSPLUS);
10018 rem_anchor_token(T_MINUSMINUS);
10019 rem_anchor_token(T_INTEGER);
10020 rem_anchor_token(T_IDENTIFIER);
10021 rem_anchor_token(T_FLOATINGPOINT);
10022 rem_anchor_token(T_COLONCOLON);
10023 rem_anchor_token(T_CHARACTER_CONSTANT);
10024 rem_anchor_token('~');
10025 rem_anchor_token('{');
10026 rem_anchor_token(';');
10027 rem_anchor_token('-');
10028 rem_anchor_token('+');
10029 rem_anchor_token('*');
10030 rem_anchor_token('(');
10031 rem_anchor_token('&');
10032 rem_anchor_token('!');
10033 rem_anchor_token('}');
10041 * Check for unused global static functions and variables
10043 static void check_unused_globals(void)
10045 if (!is_warn_on(WARN_UNUSED_FUNCTION) && !is_warn_on(WARN_UNUSED_VARIABLE))
10048 for (const entity_t *entity = file_scope->entities; entity != NULL;
10049 entity = entity->base.next) {
10050 if (!is_declaration(entity))
10053 const declaration_t *declaration = &entity->declaration;
10054 if (declaration->used ||
10055 declaration->modifiers & DM_UNUSED ||
10056 declaration->modifiers & DM_USED ||
10057 declaration->storage_class != STORAGE_CLASS_STATIC)
10062 if (entity->kind == ENTITY_FUNCTION) {
10063 /* inhibit warning for static inline functions */
10064 if (entity->function.is_inline)
10067 why = WARN_UNUSED_FUNCTION;
10068 s = entity->function.statement != NULL ? "defined" : "declared";
10070 why = WARN_UNUSED_VARIABLE;
10074 warningf(why, &declaration->base.source_position, "'%#N' %s but not used", entity, s);
10078 static void parse_global_asm(void)
10080 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10083 add_anchor_token(';');
10084 add_anchor_token(')');
10085 add_anchor_token(T_STRING_LITERAL);
10088 rem_anchor_token(T_STRING_LITERAL);
10089 statement->asms.asm_text = parse_string_literals();
10090 statement->base.next = unit->global_asm;
10091 unit->global_asm = statement;
10093 rem_anchor_token(')');
10095 rem_anchor_token(';');
10099 static void parse_linkage_specification(void)
10103 source_position_t const pos = *HERE;
10104 char const *const linkage = parse_string_literals().begin;
10106 linkage_kind_t old_linkage = current_linkage;
10107 linkage_kind_t new_linkage;
10108 if (streq(linkage, "C")) {
10109 new_linkage = LINKAGE_C;
10110 } else if (streq(linkage, "C++")) {
10111 new_linkage = LINKAGE_CXX;
10113 errorf(&pos, "linkage string \"%s\" not recognized", linkage);
10114 new_linkage = LINKAGE_C;
10116 current_linkage = new_linkage;
10118 if (next_if('{')) {
10125 assert(current_linkage == new_linkage);
10126 current_linkage = old_linkage;
10129 static void parse_external(void)
10131 switch (token.kind) {
10133 if (look_ahead(1)->kind == T_STRING_LITERAL) {
10134 parse_linkage_specification();
10136 DECLARATION_START_NO_EXTERN
10138 case T___extension__:
10139 /* tokens below are for implicit int */
10140 case '&': /* & x; -> int& x; (and error later, because C++ has no
10142 case '*': /* * x; -> int* x; */
10143 case '(': /* (x); -> int (x); */
10145 parse_external_declaration();
10151 parse_global_asm();
10155 parse_namespace_definition();
10159 if (!strict_mode) {
10160 warningf(WARN_STRAY_SEMICOLON, HERE, "stray ';' outside of function");
10167 errorf(HERE, "stray %K outside of function", &token);
10168 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10169 eat_until_matching_token(token.kind);
10175 static void parse_externals(void)
10177 add_anchor_token('}');
10178 add_anchor_token(T_EOF);
10181 /* make a copy of the anchor set, so we can check if it is restored after parsing */
10182 unsigned short token_anchor_copy[T_LAST_TOKEN];
10183 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10186 while (token.kind != T_EOF && token.kind != '}') {
10188 for (int i = 0; i < T_LAST_TOKEN; ++i) {
10189 unsigned short count = token_anchor_set[i] - token_anchor_copy[i];
10191 /* the anchor set and its copy differs */
10192 internal_errorf(HERE, "Leaked anchor token %k %d times", i, count);
10195 if (in_gcc_extension) {
10196 /* an gcc extension scope was not closed */
10197 internal_errorf(HERE, "Leaked __extension__");
10204 rem_anchor_token(T_EOF);
10205 rem_anchor_token('}');
10209 * Parse a translation unit.
10211 static void parse_translation_unit(void)
10213 add_anchor_token(T_EOF);
10218 if (token.kind == T_EOF)
10221 errorf(HERE, "stray %K outside of function", &token);
10222 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10223 eat_until_matching_token(token.kind);
10228 void set_default_visibility(elf_visibility_tag_t visibility)
10230 default_visibility = visibility;
10236 * @return the translation unit or NULL if errors occurred.
10238 void start_parsing(void)
10240 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10241 label_stack = NEW_ARR_F(stack_entry_t, 0);
10242 diagnostic_count = 0;
10246 print_to_file(stderr);
10248 assert(unit == NULL);
10249 unit = allocate_ast_zero(sizeof(unit[0]));
10251 assert(file_scope == NULL);
10252 file_scope = &unit->scope;
10254 assert(current_scope == NULL);
10255 scope_push(&unit->scope);
10257 create_gnu_builtins();
10259 create_microsoft_intrinsics();
10262 translation_unit_t *finish_parsing(void)
10264 assert(current_scope == &unit->scope);
10267 assert(file_scope == &unit->scope);
10268 check_unused_globals();
10271 DEL_ARR_F(environment_stack);
10272 DEL_ARR_F(label_stack);
10274 translation_unit_t *result = unit;
10279 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
10280 * are given length one. */
10281 static void complete_incomplete_arrays(void)
10283 size_t n = ARR_LEN(incomplete_arrays);
10284 for (size_t i = 0; i != n; ++i) {
10285 declaration_t *const decl = incomplete_arrays[i];
10286 type_t *const type = skip_typeref(decl->type);
10288 if (!is_type_incomplete(type))
10291 source_position_t const *const pos = &decl->base.source_position;
10292 warningf(WARN_OTHER, pos, "array '%#N' assumed to have one element", (entity_t const*)decl);
10294 type_t *const new_type = duplicate_type(type);
10295 new_type->array.size_constant = true;
10296 new_type->array.has_implicit_size = true;
10297 new_type->array.size = 1;
10299 type_t *const result = identify_new_type(new_type);
10301 decl->type = result;
10305 static void prepare_main_collect2(entity_t *const entity)
10307 PUSH_SCOPE(&entity->function.statement->compound.scope);
10309 // create call to __main
10310 symbol_t *symbol = symbol_table_insert("__main");
10311 entity_t *subsubmain_ent
10312 = create_implicit_function(symbol, &builtin_source_position);
10314 expression_t *ref = allocate_expression_zero(EXPR_REFERENCE);
10315 type_t *ftype = subsubmain_ent->declaration.type;
10316 ref->base.source_position = builtin_source_position;
10317 ref->base.type = make_pointer_type(ftype, TYPE_QUALIFIER_NONE);
10318 ref->reference.entity = subsubmain_ent;
10320 expression_t *call = allocate_expression_zero(EXPR_CALL);
10321 call->base.source_position = builtin_source_position;
10322 call->base.type = type_void;
10323 call->call.function = ref;
10325 statement_t *expr_statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10326 expr_statement->base.source_position = builtin_source_position;
10327 expr_statement->expression.expression = call;
10329 statement_t *statement = entity->function.statement;
10330 assert(statement->kind == STATEMENT_COMPOUND);
10331 compound_statement_t *compounds = &statement->compound;
10333 expr_statement->base.next = compounds->statements;
10334 compounds->statements = expr_statement;
10341 lookahead_bufpos = 0;
10342 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10345 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
10346 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
10347 parse_translation_unit();
10348 complete_incomplete_arrays();
10349 DEL_ARR_F(incomplete_arrays);
10350 incomplete_arrays = NULL;
10354 * Initialize the parser.
10356 void init_parser(void)
10358 sym_anonymous = symbol_table_insert("<anonymous>");
10360 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10362 init_expression_parsers();
10363 obstack_init(&temp_obst);
10367 * Terminate the parser.
10369 void exit_parser(void)
10371 obstack_free(&temp_obst, NULL);