2 * This file is part of cparser.
3 * Copyright (C) 2007-2009 Matthias Braun <matze@braunis.de>
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * as published by the Free Software Foundation; either version 2
8 * of the License, or (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
26 #include "adt/strutil.h"
28 #include "diagnostic.h"
29 #include "format_check.h"
35 #include "type_hash.h"
38 #include "attribute_t.h"
39 #include "lang_features.h"
43 #include "adt/bitfiddle.h"
44 #include "adt/error.h"
45 #include "adt/array.h"
47 //#define PRINT_TOKENS
48 #define MAX_LOOKAHEAD 1
53 entity_namespace_t namespc;
56 typedef struct declaration_specifiers_t declaration_specifiers_t;
57 struct declaration_specifiers_t {
58 source_position_t source_position;
59 storage_class_t storage_class;
60 unsigned char alignment; /**< Alignment, 0 if not set. */
62 bool thread_local : 1; /**< GCC __thread */
63 attribute_t *attributes; /**< list of attributes */
68 * An environment for parsing initializers (and compound literals).
70 typedef struct parse_initializer_env_t {
71 type_t *type; /**< the type of the initializer. In case of an
72 array type with unspecified size this gets
73 adjusted to the actual size. */
74 entity_t *entity; /**< the variable that is initialized if any */
75 bool must_be_constant;
76 } parse_initializer_env_t;
78 typedef entity_t* (*parsed_declaration_func) (entity_t *declaration, bool is_definition);
80 /** The current token. */
82 /** The lookahead ring-buffer. */
83 static token_t lookahead_buffer[MAX_LOOKAHEAD];
84 /** Position of the next token in the lookahead buffer. */
85 static size_t lookahead_bufpos;
86 static stack_entry_t *environment_stack = NULL;
87 static stack_entry_t *label_stack = NULL;
88 static scope_t *file_scope = NULL;
89 static scope_t *current_scope = NULL;
90 /** Point to the current function declaration if inside a function. */
91 static function_t *current_function = NULL;
92 static entity_t *current_entity = NULL;
93 static switch_statement_t *current_switch = NULL;
94 static statement_t *current_loop = NULL;
95 static statement_t *current_parent = NULL;
96 static ms_try_statement_t *current_try = NULL;
97 static linkage_kind_t current_linkage;
98 static goto_statement_t *goto_first = NULL;
99 static goto_statement_t **goto_anchor = NULL;
100 static label_statement_t *label_first = NULL;
101 static label_statement_t **label_anchor = NULL;
102 /** current translation unit. */
103 static translation_unit_t *unit = NULL;
104 /** true if we are in an __extension__ context. */
105 static bool in_gcc_extension = false;
106 static struct obstack temp_obst;
107 static entity_t *anonymous_entity;
108 static declaration_t **incomplete_arrays;
109 static elf_visibility_tag_t default_visibility = ELF_VISIBILITY_DEFAULT;
112 #define PUSH_PARENT(stmt) \
113 statement_t *const new_parent = (stmt); \
114 statement_t *const old_parent = current_parent; \
115 ((void)(current_parent = new_parent))
116 #define POP_PARENT() (assert(current_parent == new_parent), (void)(current_parent = old_parent))
118 #define PUSH_SCOPE(scope) \
119 size_t const top = environment_top(); \
120 scope_t *const new_scope = (scope); \
121 scope_t *const old_scope = scope_push(new_scope)
122 #define POP_SCOPE() (assert(current_scope == new_scope), scope_pop(old_scope), environment_pop_to(top))
124 #define PUSH_EXTENSION() \
126 bool const old_gcc_extension = in_gcc_extension; \
127 while (next_if(T___extension__)) { \
128 in_gcc_extension = true; \
131 #define POP_EXTENSION() \
132 ((void)(in_gcc_extension = old_gcc_extension))
134 /** special symbol used for anonymous entities. */
135 static symbol_t *sym_anonymous = NULL;
137 /** The token anchor set */
138 static unsigned short token_anchor_set[T_LAST_TOKEN];
140 /** The current source position. */
141 #define HERE (&token.base.source_position)
143 /** true if we are in GCC mode. */
144 #define GNU_MODE ((c_mode & _GNUC) || in_gcc_extension)
146 static statement_t *parse_compound_statement(bool inside_expression_statement);
147 static statement_t *parse_statement(void);
149 static expression_t *parse_subexpression(precedence_t);
150 static expression_t *parse_expression(void);
151 static type_t *parse_typename(void);
152 static void parse_externals(void);
153 static void parse_external(void);
155 static void parse_compound_type_entries(compound_t *compound_declaration);
157 static void check_call_argument(type_t *expected_type,
158 call_argument_t *argument, unsigned pos);
160 typedef enum declarator_flags_t {
162 DECL_MAY_BE_ABSTRACT = 1U << 0,
163 DECL_CREATE_COMPOUND_MEMBER = 1U << 1,
164 DECL_IS_PARAMETER = 1U << 2
165 } declarator_flags_t;
167 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
168 declarator_flags_t flags);
170 static void semantic_comparison(binary_expression_t *expression);
172 #define STORAGE_CLASSES \
173 STORAGE_CLASSES_NO_EXTERN \
176 #define STORAGE_CLASSES_NO_EXTERN \
183 #define TYPE_QUALIFIERS \
188 case T__forceinline: \
189 case T___attribute__:
191 #define COMPLEX_SPECIFIERS \
193 #define IMAGINARY_SPECIFIERS \
196 #define TYPE_SPECIFIERS \
198 case T___builtin_va_list: \
223 #define DECLARATION_START \
228 #define DECLARATION_START_NO_EXTERN \
229 STORAGE_CLASSES_NO_EXTERN \
233 #define EXPRESSION_START \
242 case T_CHARACTER_CONSTANT: \
243 case T_FLOATINGPOINT: \
244 case T_FLOATINGPOINT_HEXADECIMAL: \
246 case T_INTEGER_HEXADECIMAL: \
247 case T_INTEGER_OCTAL: \
250 case T_STRING_LITERAL: \
251 case T_WIDE_CHARACTER_CONSTANT: \
252 case T_WIDE_STRING_LITERAL: \
253 case T___FUNCDNAME__: \
254 case T___FUNCSIG__: \
255 case T___FUNCTION__: \
256 case T___PRETTY_FUNCTION__: \
257 case T___alignof__: \
258 case T___builtin_classify_type: \
259 case T___builtin_constant_p: \
260 case T___builtin_isgreater: \
261 case T___builtin_isgreaterequal: \
262 case T___builtin_isless: \
263 case T___builtin_islessequal: \
264 case T___builtin_islessgreater: \
265 case T___builtin_isunordered: \
266 case T___builtin_offsetof: \
267 case T___builtin_va_arg: \
268 case T___builtin_va_copy: \
269 case T___builtin_va_start: \
280 * Returns the size of a statement node.
282 * @param kind the statement kind
284 static size_t get_statement_struct_size(statement_kind_t kind)
286 static const size_t sizes[] = {
287 [STATEMENT_ERROR] = sizeof(statement_base_t),
288 [STATEMENT_EMPTY] = sizeof(statement_base_t),
289 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
290 [STATEMENT_RETURN] = sizeof(return_statement_t),
291 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
292 [STATEMENT_IF] = sizeof(if_statement_t),
293 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
294 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
295 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
296 [STATEMENT_BREAK] = sizeof(statement_base_t),
297 [STATEMENT_COMPUTED_GOTO] = sizeof(computed_goto_statement_t),
298 [STATEMENT_GOTO] = sizeof(goto_statement_t),
299 [STATEMENT_LABEL] = sizeof(label_statement_t),
300 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
301 [STATEMENT_WHILE] = sizeof(while_statement_t),
302 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
303 [STATEMENT_FOR] = sizeof(for_statement_t),
304 [STATEMENT_ASM] = sizeof(asm_statement_t),
305 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
306 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
308 assert((size_t)kind < lengthof(sizes));
309 assert(sizes[kind] != 0);
314 * Returns the size of an expression node.
316 * @param kind the expression kind
318 static size_t get_expression_struct_size(expression_kind_t kind)
320 static const size_t sizes[] = {
321 [EXPR_ERROR] = sizeof(expression_base_t),
322 [EXPR_REFERENCE] = sizeof(reference_expression_t),
323 [EXPR_REFERENCE_ENUM_VALUE] = sizeof(reference_expression_t),
324 [EXPR_LITERAL_BOOLEAN] = sizeof(literal_expression_t),
325 [EXPR_LITERAL_INTEGER] = sizeof(literal_expression_t),
326 [EXPR_LITERAL_INTEGER_OCTAL] = sizeof(literal_expression_t),
327 [EXPR_LITERAL_INTEGER_HEXADECIMAL]= sizeof(literal_expression_t),
328 [EXPR_LITERAL_FLOATINGPOINT] = sizeof(literal_expression_t),
329 [EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL] = sizeof(literal_expression_t),
330 [EXPR_LITERAL_CHARACTER] = sizeof(literal_expression_t),
331 [EXPR_LITERAL_WIDE_CHARACTER] = sizeof(literal_expression_t),
332 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
333 [EXPR_WIDE_STRING_LITERAL] = sizeof(string_literal_expression_t),
334 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
335 [EXPR_CALL] = sizeof(call_expression_t),
336 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
337 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
338 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
339 [EXPR_SELECT] = sizeof(select_expression_t),
340 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
341 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
342 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
343 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
344 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
345 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
346 [EXPR_BUILTIN_TYPES_COMPATIBLE_P] = sizeof(builtin_types_compatible_expression_t),
347 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
348 [EXPR_VA_START] = sizeof(va_start_expression_t),
349 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
350 [EXPR_VA_COPY] = sizeof(va_copy_expression_t),
351 [EXPR_STATEMENT] = sizeof(statement_expression_t),
352 [EXPR_LABEL_ADDRESS] = sizeof(label_address_expression_t),
354 if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
355 return sizes[EXPR_UNARY_FIRST];
357 if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
358 return sizes[EXPR_BINARY_FIRST];
360 assert((size_t)kind < lengthof(sizes));
361 assert(sizes[kind] != 0);
366 * Allocate a statement node of given kind and initialize all
367 * fields with zero. Sets its source position to the position
368 * of the current token.
370 static statement_t *allocate_statement_zero(statement_kind_t kind)
372 size_t size = get_statement_struct_size(kind);
373 statement_t *res = allocate_ast_zero(size);
375 res->base.kind = kind;
376 res->base.parent = current_parent;
377 res->base.source_position = token.base.source_position;
382 * Allocate an expression node of given kind and initialize all
385 * @param kind the kind of the expression to allocate
387 static expression_t *allocate_expression_zero(expression_kind_t kind)
389 size_t size = get_expression_struct_size(kind);
390 expression_t *res = allocate_ast_zero(size);
392 res->base.kind = kind;
393 res->base.type = type_error_type;
394 res->base.source_position = token.base.source_position;
399 * Creates a new invalid expression at the source position
400 * of the current token.
402 static expression_t *create_error_expression(void)
404 expression_t *expression = allocate_expression_zero(EXPR_ERROR);
405 expression->base.type = type_error_type;
410 * Creates a new invalid statement.
412 static statement_t *create_error_statement(void)
414 return allocate_statement_zero(STATEMENT_ERROR);
418 * Allocate a new empty statement.
420 static statement_t *create_empty_statement(void)
422 return allocate_statement_zero(STATEMENT_EMPTY);
426 * Returns the size of an initializer node.
428 * @param kind the initializer kind
430 static size_t get_initializer_size(initializer_kind_t kind)
432 static const size_t sizes[] = {
433 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
434 [INITIALIZER_STRING] = sizeof(initializer_string_t),
435 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
436 [INITIALIZER_LIST] = sizeof(initializer_list_t),
437 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
439 assert((size_t)kind < lengthof(sizes));
440 assert(sizes[kind] != 0);
445 * Allocate an initializer node of given kind and initialize all
448 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
450 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
457 * Returns the index of the top element of the environment stack.
459 static size_t environment_top(void)
461 return ARR_LEN(environment_stack);
465 * Returns the index of the top element of the global label stack.
467 static size_t label_top(void)
469 return ARR_LEN(label_stack);
473 * Return the next token.
475 static inline void next_token(void)
477 token = lookahead_buffer[lookahead_bufpos];
478 lookahead_buffer[lookahead_bufpos] = lexer_token;
481 lookahead_bufpos = (lookahead_bufpos + 1) % MAX_LOOKAHEAD;
484 print_token(stderr, &token);
485 fprintf(stderr, "\n");
489 static inline bool next_if(int const type)
491 if (token.kind == type) {
500 * Return the next token with a given lookahead.
502 static inline const token_t *look_ahead(size_t num)
504 assert(0 < num && num <= MAX_LOOKAHEAD);
505 size_t pos = (lookahead_bufpos + num - 1) % MAX_LOOKAHEAD;
506 return &lookahead_buffer[pos];
510 * Adds a token type to the token type anchor set (a multi-set).
512 static void add_anchor_token(int token_kind)
514 assert(0 <= token_kind && token_kind < T_LAST_TOKEN);
515 ++token_anchor_set[token_kind];
519 * Set the number of tokens types of the given type
520 * to zero and return the old count.
522 static int save_and_reset_anchor_state(int token_kind)
524 assert(0 <= token_kind && token_kind < T_LAST_TOKEN);
525 int count = token_anchor_set[token_kind];
526 token_anchor_set[token_kind] = 0;
531 * Restore the number of token types to the given count.
533 static void restore_anchor_state(int token_kind, int count)
535 assert(0 <= token_kind && token_kind < T_LAST_TOKEN);
536 token_anchor_set[token_kind] = count;
540 * Remove a token type from the token type anchor set (a multi-set).
542 static void rem_anchor_token(int token_kind)
544 assert(0 <= token_kind && token_kind < T_LAST_TOKEN);
545 assert(token_anchor_set[token_kind] != 0);
546 --token_anchor_set[token_kind];
550 * Return true if the token type of the current token is
553 static bool at_anchor(void)
557 return token_anchor_set[token.kind];
561 * Eat tokens until a matching token type is found.
563 static void eat_until_matching_token(int type)
567 case '(': end_token = ')'; break;
568 case '{': end_token = '}'; break;
569 case '[': end_token = ']'; break;
570 default: end_token = type; break;
573 unsigned parenthesis_count = 0;
574 unsigned brace_count = 0;
575 unsigned bracket_count = 0;
576 while (token.kind != end_token ||
577 parenthesis_count != 0 ||
579 bracket_count != 0) {
580 switch (token.kind) {
582 case '(': ++parenthesis_count; break;
583 case '{': ++brace_count; break;
584 case '[': ++bracket_count; break;
587 if (parenthesis_count > 0)
597 if (bracket_count > 0)
600 if (token.kind == end_token &&
601 parenthesis_count == 0 &&
615 * Eat input tokens until an anchor is found.
617 static void eat_until_anchor(void)
619 while (token_anchor_set[token.kind] == 0) {
620 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
621 eat_until_matching_token(token.kind);
627 * Eat a whole block from input tokens.
629 static void eat_block(void)
631 eat_until_matching_token('{');
635 #define eat(token_kind) (assert(token.kind == (token_kind)), next_token())
638 * Report a parse error because an expected token was not found.
641 #if defined __GNUC__ && __GNUC__ >= 4
642 __attribute__((sentinel))
644 void parse_error_expected(const char *message, ...)
646 if (message != NULL) {
647 errorf(HERE, "%s", message);
650 va_start(ap, message);
651 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
656 * Report an incompatible type.
658 static void type_error_incompatible(const char *msg,
659 const source_position_t *source_position, type_t *type1, type_t *type2)
661 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
666 * Expect the current token is the expected token.
667 * If not, generate an error, eat the current statement,
668 * and goto the error_label label.
670 #define expect(expected, error_label) \
672 if (UNLIKELY(token.kind != (expected))) { \
673 parse_error_expected(NULL, (expected), NULL); \
674 add_anchor_token(expected); \
675 eat_until_anchor(); \
676 rem_anchor_token(expected); \
677 if (token.kind != (expected)) \
684 * Push a given scope on the scope stack and make it the
687 static scope_t *scope_push(scope_t *new_scope)
689 if (current_scope != NULL) {
690 new_scope->depth = current_scope->depth + 1;
693 scope_t *old_scope = current_scope;
694 current_scope = new_scope;
699 * Pop the current scope from the scope stack.
701 static void scope_pop(scope_t *old_scope)
703 current_scope = old_scope;
707 * Search an entity by its symbol in a given namespace.
709 static entity_t *get_entity(const symbol_t *const symbol,
710 namespace_tag_t namespc)
712 entity_t *entity = symbol->entity;
713 for (; entity != NULL; entity = entity->base.symbol_next) {
714 if ((namespace_tag_t)entity->base.namespc == namespc)
721 /* §6.2.3:1 24) There is only one name space for tags even though three are
723 static entity_t *get_tag(symbol_t const *const symbol,
724 entity_kind_tag_t const kind)
726 entity_t *entity = get_entity(symbol, NAMESPACE_TAG);
727 if (entity != NULL && (entity_kind_tag_t)entity->kind != kind) {
729 "'%Y' defined as wrong kind of tag (previous definition %P)",
730 symbol, &entity->base.source_position);
737 * pushs an entity on the environment stack and links the corresponding symbol
740 static void stack_push(stack_entry_t **stack_ptr, entity_t *entity)
742 symbol_t *symbol = entity->base.symbol;
743 entity_namespace_t namespc = entity->base.namespc;
744 assert(namespc != 0);
746 /* replace/add entity into entity list of the symbol */
749 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
754 /* replace an entry? */
755 if (iter->base.namespc == namespc) {
756 entity->base.symbol_next = iter->base.symbol_next;
762 /* remember old declaration */
764 entry.symbol = symbol;
765 entry.old_entity = iter;
766 entry.namespc = namespc;
767 ARR_APP1(stack_entry_t, *stack_ptr, entry);
771 * Push an entity on the environment stack.
773 static void environment_push(entity_t *entity)
775 assert(entity->base.source_position.input_name != NULL);
776 assert(entity->base.parent_scope != NULL);
777 stack_push(&environment_stack, entity);
781 * Push a declaration on the global label stack.
783 * @param declaration the declaration
785 static void label_push(entity_t *label)
787 /* we abuse the parameters scope as parent for the labels */
788 label->base.parent_scope = ¤t_function->parameters;
789 stack_push(&label_stack, label);
793 * pops symbols from the environment stack until @p new_top is the top element
795 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
797 stack_entry_t *stack = *stack_ptr;
798 size_t top = ARR_LEN(stack);
801 assert(new_top <= top);
805 for (i = top; i > new_top; --i) {
806 stack_entry_t *entry = &stack[i - 1];
808 entity_t *old_entity = entry->old_entity;
809 symbol_t *symbol = entry->symbol;
810 entity_namespace_t namespc = entry->namespc;
812 /* replace with old_entity/remove */
815 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
817 assert(iter != NULL);
818 /* replace an entry? */
819 if (iter->base.namespc == namespc)
823 /* restore definition from outer scopes (if there was one) */
824 if (old_entity != NULL) {
825 old_entity->base.symbol_next = iter->base.symbol_next;
826 *anchor = old_entity;
828 /* remove entry from list */
829 *anchor = iter->base.symbol_next;
833 ARR_SHRINKLEN(*stack_ptr, new_top);
837 * Pop all entries from the environment stack until the new_top
840 * @param new_top the new stack top
842 static void environment_pop_to(size_t new_top)
844 stack_pop_to(&environment_stack, new_top);
848 * Pop all entries from the global label stack until the new_top
851 * @param new_top the new stack top
853 static void label_pop_to(size_t new_top)
855 stack_pop_to(&label_stack, new_top);
858 static atomic_type_kind_t get_akind(const type_t *type)
860 assert(type->kind == TYPE_ATOMIC || type->kind == TYPE_COMPLEX
861 || type->kind == TYPE_IMAGINARY || type->kind == TYPE_ENUM);
862 return type->atomic.akind;
866 * §6.3.1.1:2 Do integer promotion for a given type.
868 * @param type the type to promote
869 * @return the promoted type
871 static type_t *promote_integer(type_t *type)
873 if (get_akind_rank(get_akind(type)) < get_akind_rank(ATOMIC_TYPE_INT))
880 * Check if a given expression represents a null pointer constant.
882 * @param expression the expression to check
884 static bool is_null_pointer_constant(const expression_t *expression)
886 /* skip void* cast */
887 if (expression->kind == EXPR_UNARY_CAST) {
888 type_t *const type = skip_typeref(expression->base.type);
889 if (types_compatible(type, type_void_ptr))
890 expression = expression->unary.value;
893 type_t *const type = skip_typeref(expression->base.type);
894 if (!is_type_integer(type))
896 switch (is_constant_expression(expression)) {
897 case EXPR_CLASS_ERROR: return true;
898 case EXPR_CLASS_CONSTANT: return !fold_constant_to_bool(expression);
899 default: return false;
904 * Create an implicit cast expression.
906 * @param expression the expression to cast
907 * @param dest_type the destination type
909 static expression_t *create_implicit_cast(expression_t *expression,
912 type_t *const source_type = expression->base.type;
914 if (source_type == dest_type)
917 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
918 cast->unary.value = expression;
919 cast->base.type = dest_type;
920 cast->base.implicit = true;
925 typedef enum assign_error_t {
927 ASSIGN_ERROR_INCOMPATIBLE,
928 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
929 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
930 ASSIGN_WARNING_POINTER_FROM_INT,
931 ASSIGN_WARNING_INT_FROM_POINTER
934 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)
936 type_t *const orig_type_right = right->base.type;
937 type_t *const type_left = skip_typeref(orig_type_left);
938 type_t *const type_right = skip_typeref(orig_type_right);
943 case ASSIGN_ERROR_INCOMPATIBLE:
944 errorf(pos, "destination type '%T' in %s is incompatible with type '%T'", orig_type_left, context, orig_type_right);
947 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
948 type_t *points_to_left = skip_typeref(type_left->pointer.points_to);
949 type_t *points_to_right = skip_typeref(type_right->pointer.points_to);
951 /* the left type has all qualifiers from the right type */
952 unsigned missing_qualifiers = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
953 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);
957 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
958 warningf(WARN_OTHER, pos, "destination type '%T' in %s is incompatible with '%E' of type '%T'", orig_type_left, context, right, orig_type_right);
961 case ASSIGN_WARNING_POINTER_FROM_INT:
962 warningf(WARN_OTHER, pos, "%s makes pointer '%T' from integer '%T' without a cast", context, orig_type_left, orig_type_right);
965 case ASSIGN_WARNING_INT_FROM_POINTER:
966 warningf(WARN_OTHER, pos, "%s makes integer '%T' from pointer '%T' without a cast", context, orig_type_left, orig_type_right);
970 panic("invalid error value");
974 /** Implements the rules from §6.5.16.1 */
975 static assign_error_t semantic_assign(type_t *orig_type_left,
976 const expression_t *const right)
978 type_t *const orig_type_right = right->base.type;
979 type_t *const type_left = skip_typeref(orig_type_left);
980 type_t *const type_right = skip_typeref(orig_type_right);
982 if (is_type_pointer(type_left)) {
983 if (is_null_pointer_constant(right)) {
984 return ASSIGN_SUCCESS;
985 } else if (is_type_pointer(type_right)) {
986 type_t *points_to_left
987 = skip_typeref(type_left->pointer.points_to);
988 type_t *points_to_right
989 = skip_typeref(type_right->pointer.points_to);
990 assign_error_t res = ASSIGN_SUCCESS;
992 /* the left type has all qualifiers from the right type */
993 unsigned missing_qualifiers
994 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
995 if (missing_qualifiers != 0) {
996 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
999 points_to_left = get_unqualified_type(points_to_left);
1000 points_to_right = get_unqualified_type(points_to_right);
1002 if (is_type_atomic(points_to_left, ATOMIC_TYPE_VOID))
1005 if (is_type_atomic(points_to_right, ATOMIC_TYPE_VOID)) {
1006 /* ISO/IEC 14882:1998(E) §C.1.2:6 */
1007 return c_mode & _CXX ? ASSIGN_ERROR_INCOMPATIBLE : res;
1010 if (!types_compatible(points_to_left, points_to_right)) {
1011 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
1015 } else if (is_type_integer(type_right)) {
1016 return ASSIGN_WARNING_POINTER_FROM_INT;
1018 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1019 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1020 && is_type_pointer(type_right))) {
1021 return ASSIGN_SUCCESS;
1022 } else if (is_type_compound(type_left) && is_type_compound(type_right)) {
1023 type_t *const unqual_type_left = get_unqualified_type(type_left);
1024 type_t *const unqual_type_right = get_unqualified_type(type_right);
1025 if (types_compatible(unqual_type_left, unqual_type_right)) {
1026 return ASSIGN_SUCCESS;
1028 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1029 return ASSIGN_WARNING_INT_FROM_POINTER;
1032 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1033 return ASSIGN_SUCCESS;
1035 return ASSIGN_ERROR_INCOMPATIBLE;
1038 static expression_t *parse_constant_expression(void)
1040 expression_t *result = parse_subexpression(PREC_CONDITIONAL);
1042 if (is_constant_expression(result) == EXPR_CLASS_VARIABLE) {
1043 errorf(&result->base.source_position,
1044 "expression '%E' is not constant", result);
1050 static expression_t *parse_assignment_expression(void)
1052 return parse_subexpression(PREC_ASSIGNMENT);
1055 static void warn_string_concat(const source_position_t *pos)
1057 warningf(WARN_TRADITIONAL, pos, "traditional C rejects string constant concatenation");
1060 static string_t parse_string_literals(void)
1062 assert(token.kind == T_STRING_LITERAL);
1063 string_t result = token.string.string;
1067 while (token.kind == T_STRING_LITERAL) {
1068 warn_string_concat(&token.base.source_position);
1069 result = concat_strings(&result, &token.string.string);
1076 static attribute_t *allocate_attribute_zero(attribute_kind_t kind)
1078 attribute_t *attribute = allocate_ast_zero(sizeof(*attribute));
1079 attribute->kind = kind;
1080 attribute->source_position = *HERE;
1085 * Parse (gcc) attribute argument. From gcc comments in gcc source:
1088 * __attribute__ ( ( attribute-list ) )
1092 * attribute_list , attrib
1097 * any-word ( identifier )
1098 * any-word ( identifier , nonempty-expr-list )
1099 * any-word ( expr-list )
1101 * where the "identifier" must not be declared as a type, and
1102 * "any-word" may be any identifier (including one declared as a
1103 * type), a reserved word storage class specifier, type specifier or
1104 * type qualifier. ??? This still leaves out most reserved keywords
1105 * (following the old parser), shouldn't we include them, and why not
1106 * allow identifiers declared as types to start the arguments?
1108 * Matze: this all looks confusing and little systematic, so we're even less
1109 * strict and parse any list of things which are identifiers or
1110 * (assignment-)expressions.
1112 static attribute_argument_t *parse_attribute_arguments(void)
1114 attribute_argument_t *first = NULL;
1115 attribute_argument_t **anchor = &first;
1116 if (token.kind != ')') do {
1117 attribute_argument_t *argument = allocate_ast_zero(sizeof(*argument));
1119 /* is it an identifier */
1120 if (token.kind == T_IDENTIFIER
1121 && (look_ahead(1)->kind == ',' || look_ahead(1)->kind == ')')) {
1122 symbol_t *symbol = token.identifier.symbol;
1123 argument->kind = ATTRIBUTE_ARGUMENT_SYMBOL;
1124 argument->v.symbol = symbol;
1127 /* must be an expression */
1128 expression_t *expression = parse_assignment_expression();
1130 argument->kind = ATTRIBUTE_ARGUMENT_EXPRESSION;
1131 argument->v.expression = expression;
1134 /* append argument */
1136 anchor = &argument->next;
1137 } while (next_if(','));
1138 expect(')', end_error);
1147 static attribute_t *parse_attribute_asm(void)
1149 attribute_t *attribute = allocate_attribute_zero(ATTRIBUTE_GNU_ASM);
1152 expect('(', end_error);
1153 attribute->a.arguments = parse_attribute_arguments();
1160 static symbol_t *get_symbol_from_token(void)
1162 switch(token.kind) {
1164 return token.identifier.symbol;
1193 /* maybe we need more tokens ... add them on demand */
1194 return get_token_kind_symbol(token.kind);
1200 static attribute_t *parse_attribute_gnu_single(void)
1202 /* parse "any-word" */
1203 symbol_t *symbol = get_symbol_from_token();
1204 if (symbol == NULL) {
1205 parse_error_expected("while parsing attribute((", T_IDENTIFIER, NULL);
1209 attribute_kind_t kind;
1210 char const *const name = symbol->string;
1211 for (kind = ATTRIBUTE_GNU_FIRST;; ++kind) {
1212 if (kind > ATTRIBUTE_GNU_LAST) {
1213 warningf(WARN_ATTRIBUTE, HERE, "unknown attribute '%s' ignored", name);
1214 /* TODO: we should still save the attribute in the list... */
1215 kind = ATTRIBUTE_UNKNOWN;
1219 const char *attribute_name = get_attribute_name(kind);
1220 if (attribute_name != NULL && streq_underscore(attribute_name, name))
1224 attribute_t *attribute = allocate_attribute_zero(kind);
1227 /* parse arguments */
1229 attribute->a.arguments = parse_attribute_arguments();
1234 static attribute_t *parse_attribute_gnu(void)
1236 attribute_t *first = NULL;
1237 attribute_t **anchor = &first;
1239 eat(T___attribute__);
1240 expect('(', end_error);
1241 expect('(', end_error);
1243 if (token.kind != ')') do {
1244 attribute_t *attribute = parse_attribute_gnu_single();
1245 if (attribute == NULL)
1248 *anchor = attribute;
1249 anchor = &attribute->next;
1250 } while (next_if(','));
1251 expect(')', end_error);
1252 expect(')', end_error);
1258 /** Parse attributes. */
1259 static attribute_t *parse_attributes(attribute_t *first)
1261 attribute_t **anchor = &first;
1263 while (*anchor != NULL)
1264 anchor = &(*anchor)->next;
1266 attribute_t *attribute;
1267 switch (token.kind) {
1268 case T___attribute__:
1269 attribute = parse_attribute_gnu();
1270 if (attribute == NULL)
1275 attribute = parse_attribute_asm();
1279 attribute = allocate_attribute_zero(ATTRIBUTE_MS_CDECL);
1284 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FASTCALL);
1288 case T__forceinline:
1289 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FORCEINLINE);
1290 eat(T__forceinline);
1294 attribute = allocate_attribute_zero(ATTRIBUTE_MS_STDCALL);
1299 /* TODO record modifier */
1300 warningf(WARN_OTHER, HERE, "Ignoring declaration modifier %K", &token);
1301 attribute = allocate_attribute_zero(ATTRIBUTE_MS_THISCALL);
1309 *anchor = attribute;
1310 anchor = &attribute->next;
1314 static void mark_vars_read(expression_t *expr, entity_t *lhs_ent);
1316 static entity_t *determine_lhs_ent(expression_t *const expr,
1319 switch (expr->kind) {
1320 case EXPR_REFERENCE: {
1321 entity_t *const entity = expr->reference.entity;
1322 /* we should only find variables as lvalues... */
1323 if (entity->base.kind != ENTITY_VARIABLE
1324 && entity->base.kind != ENTITY_PARAMETER)
1330 case EXPR_ARRAY_ACCESS: {
1331 expression_t *const ref = expr->array_access.array_ref;
1332 entity_t * ent = NULL;
1333 if (is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1334 ent = determine_lhs_ent(ref, lhs_ent);
1337 mark_vars_read(ref, lhs_ent);
1339 mark_vars_read(expr->array_access.index, lhs_ent);
1344 mark_vars_read(expr->select.compound, lhs_ent);
1345 if (is_type_compound(skip_typeref(expr->base.type)))
1346 return determine_lhs_ent(expr->select.compound, lhs_ent);
1350 case EXPR_UNARY_DEREFERENCE: {
1351 expression_t *const val = expr->unary.value;
1352 if (val->kind == EXPR_UNARY_TAKE_ADDRESS) {
1354 return determine_lhs_ent(val->unary.value, lhs_ent);
1356 mark_vars_read(val, NULL);
1362 mark_vars_read(expr, NULL);
1367 #define ENT_ANY ((entity_t*)-1)
1370 * Mark declarations, which are read. This is used to detect variables, which
1374 * x is not marked as "read", because it is only read to calculate its own new
1378 * x and y are not detected as "not read", because multiple variables are
1381 static void mark_vars_read(expression_t *const expr, entity_t *lhs_ent)
1383 switch (expr->kind) {
1384 case EXPR_REFERENCE: {
1385 entity_t *const entity = expr->reference.entity;
1386 if (entity->kind != ENTITY_VARIABLE
1387 && entity->kind != ENTITY_PARAMETER)
1390 if (lhs_ent != entity && lhs_ent != ENT_ANY) {
1391 if (entity->kind == ENTITY_VARIABLE) {
1392 entity->variable.read = true;
1394 entity->parameter.read = true;
1401 // TODO respect pure/const
1402 mark_vars_read(expr->call.function, NULL);
1403 for (call_argument_t *arg = expr->call.arguments; arg != NULL; arg = arg->next) {
1404 mark_vars_read(arg->expression, NULL);
1408 case EXPR_CONDITIONAL:
1409 // TODO lhs_decl should depend on whether true/false have an effect
1410 mark_vars_read(expr->conditional.condition, NULL);
1411 if (expr->conditional.true_expression != NULL)
1412 mark_vars_read(expr->conditional.true_expression, lhs_ent);
1413 mark_vars_read(expr->conditional.false_expression, lhs_ent);
1417 if (lhs_ent == ENT_ANY
1418 && !is_type_compound(skip_typeref(expr->base.type)))
1420 mark_vars_read(expr->select.compound, lhs_ent);
1423 case EXPR_ARRAY_ACCESS: {
1424 mark_vars_read(expr->array_access.index, lhs_ent);
1425 expression_t *const ref = expr->array_access.array_ref;
1426 if (!is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1427 if (lhs_ent == ENT_ANY)
1430 mark_vars_read(ref, lhs_ent);
1435 mark_vars_read(expr->va_arge.ap, lhs_ent);
1439 mark_vars_read(expr->va_copye.src, lhs_ent);
1442 case EXPR_UNARY_CAST:
1443 /* Special case: Use void cast to mark a variable as "read" */
1444 if (is_type_atomic(skip_typeref(expr->base.type), ATOMIC_TYPE_VOID))
1449 case EXPR_UNARY_THROW:
1450 if (expr->unary.value == NULL)
1453 case EXPR_UNARY_DEREFERENCE:
1454 case EXPR_UNARY_DELETE:
1455 case EXPR_UNARY_DELETE_ARRAY:
1456 if (lhs_ent == ENT_ANY)
1460 case EXPR_UNARY_NEGATE:
1461 case EXPR_UNARY_PLUS:
1462 case EXPR_UNARY_BITWISE_NEGATE:
1463 case EXPR_UNARY_NOT:
1464 case EXPR_UNARY_TAKE_ADDRESS:
1465 case EXPR_UNARY_POSTFIX_INCREMENT:
1466 case EXPR_UNARY_POSTFIX_DECREMENT:
1467 case EXPR_UNARY_PREFIX_INCREMENT:
1468 case EXPR_UNARY_PREFIX_DECREMENT:
1469 case EXPR_UNARY_ASSUME:
1471 mark_vars_read(expr->unary.value, lhs_ent);
1474 case EXPR_BINARY_ADD:
1475 case EXPR_BINARY_SUB:
1476 case EXPR_BINARY_MUL:
1477 case EXPR_BINARY_DIV:
1478 case EXPR_BINARY_MOD:
1479 case EXPR_BINARY_EQUAL:
1480 case EXPR_BINARY_NOTEQUAL:
1481 case EXPR_BINARY_LESS:
1482 case EXPR_BINARY_LESSEQUAL:
1483 case EXPR_BINARY_GREATER:
1484 case EXPR_BINARY_GREATEREQUAL:
1485 case EXPR_BINARY_BITWISE_AND:
1486 case EXPR_BINARY_BITWISE_OR:
1487 case EXPR_BINARY_BITWISE_XOR:
1488 case EXPR_BINARY_LOGICAL_AND:
1489 case EXPR_BINARY_LOGICAL_OR:
1490 case EXPR_BINARY_SHIFTLEFT:
1491 case EXPR_BINARY_SHIFTRIGHT:
1492 case EXPR_BINARY_COMMA:
1493 case EXPR_BINARY_ISGREATER:
1494 case EXPR_BINARY_ISGREATEREQUAL:
1495 case EXPR_BINARY_ISLESS:
1496 case EXPR_BINARY_ISLESSEQUAL:
1497 case EXPR_BINARY_ISLESSGREATER:
1498 case EXPR_BINARY_ISUNORDERED:
1499 mark_vars_read(expr->binary.left, lhs_ent);
1500 mark_vars_read(expr->binary.right, lhs_ent);
1503 case EXPR_BINARY_ASSIGN:
1504 case EXPR_BINARY_MUL_ASSIGN:
1505 case EXPR_BINARY_DIV_ASSIGN:
1506 case EXPR_BINARY_MOD_ASSIGN:
1507 case EXPR_BINARY_ADD_ASSIGN:
1508 case EXPR_BINARY_SUB_ASSIGN:
1509 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
1510 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
1511 case EXPR_BINARY_BITWISE_AND_ASSIGN:
1512 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
1513 case EXPR_BINARY_BITWISE_OR_ASSIGN: {
1514 if (lhs_ent == ENT_ANY)
1516 lhs_ent = determine_lhs_ent(expr->binary.left, lhs_ent);
1517 mark_vars_read(expr->binary.right, lhs_ent);
1522 determine_lhs_ent(expr->va_starte.ap, lhs_ent);
1525 case EXPR_LITERAL_CASES:
1527 case EXPR_STRING_LITERAL:
1528 case EXPR_WIDE_STRING_LITERAL:
1529 case EXPR_COMPOUND_LITERAL: // TODO init?
1531 case EXPR_CLASSIFY_TYPE:
1534 case EXPR_BUILTIN_CONSTANT_P:
1535 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
1537 case EXPR_STATEMENT: // TODO
1538 case EXPR_LABEL_ADDRESS:
1539 case EXPR_REFERENCE_ENUM_VALUE:
1543 panic("unhandled expression");
1546 static designator_t *parse_designation(void)
1548 designator_t *result = NULL;
1549 designator_t **anchor = &result;
1552 designator_t *designator;
1553 switch (token.kind) {
1555 designator = allocate_ast_zero(sizeof(designator[0]));
1556 designator->source_position = token.base.source_position;
1558 add_anchor_token(']');
1559 designator->array_index = parse_constant_expression();
1560 rem_anchor_token(']');
1561 expect(']', end_error);
1564 designator = allocate_ast_zero(sizeof(designator[0]));
1565 designator->source_position = token.base.source_position;
1567 if (token.kind != T_IDENTIFIER) {
1568 parse_error_expected("while parsing designator",
1569 T_IDENTIFIER, NULL);
1572 designator->symbol = token.identifier.symbol;
1576 expect('=', end_error);
1580 assert(designator != NULL);
1581 *anchor = designator;
1582 anchor = &designator->next;
1588 static initializer_t *initializer_from_string(array_type_t *const type,
1589 const string_t *const string)
1591 /* TODO: check len vs. size of array type */
1594 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
1595 initializer->string.string = *string;
1600 static initializer_t *initializer_from_wide_string(array_type_t *const type,
1601 const string_t *const string)
1603 /* TODO: check len vs. size of array type */
1606 initializer_t *const initializer =
1607 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
1608 initializer->wide_string.string = *string;
1614 * Build an initializer from a given expression.
1616 static initializer_t *initializer_from_expression(type_t *orig_type,
1617 expression_t *expression)
1619 /* TODO check that expression is a constant expression */
1621 /* §6.7.8.14/15 char array may be initialized by string literals */
1622 type_t *type = skip_typeref(orig_type);
1623 type_t *expr_type_orig = expression->base.type;
1624 type_t *expr_type = skip_typeref(expr_type_orig);
1626 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
1627 array_type_t *const array_type = &type->array;
1628 type_t *const element_type = skip_typeref(array_type->element_type);
1630 if (element_type->kind == TYPE_ATOMIC) {
1631 atomic_type_kind_t akind = element_type->atomic.akind;
1632 switch (expression->kind) {
1633 case EXPR_STRING_LITERAL:
1634 if (akind == ATOMIC_TYPE_CHAR
1635 || akind == ATOMIC_TYPE_SCHAR
1636 || akind == ATOMIC_TYPE_UCHAR) {
1637 return initializer_from_string(array_type,
1638 &expression->string_literal.value);
1642 case EXPR_WIDE_STRING_LITERAL: {
1643 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
1644 if (get_unqualified_type(element_type) == bare_wchar_type) {
1645 return initializer_from_wide_string(array_type,
1646 &expression->string_literal.value);
1657 assign_error_t error = semantic_assign(type, expression);
1658 if (error == ASSIGN_ERROR_INCOMPATIBLE)
1660 report_assign_error(error, type, expression, "initializer",
1661 &expression->base.source_position);
1663 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
1664 result->value.value = create_implicit_cast(expression, type);
1670 * Parses an scalar initializer.
1672 * §6.7.8.11; eat {} without warning
1674 static initializer_t *parse_scalar_initializer(type_t *type,
1675 bool must_be_constant)
1677 /* there might be extra {} hierarchies */
1679 if (token.kind == '{') {
1680 warningf(WARN_OTHER, HERE, "extra curly braces around scalar initializer");
1684 } while (token.kind == '{');
1687 expression_t *expression = parse_assignment_expression();
1688 mark_vars_read(expression, NULL);
1689 if (must_be_constant && !is_linker_constant(expression)) {
1690 errorf(&expression->base.source_position,
1691 "initialisation expression '%E' is not constant",
1695 initializer_t *initializer = initializer_from_expression(type, expression);
1697 if (initializer == NULL) {
1698 errorf(&expression->base.source_position,
1699 "expression '%E' (type '%T') doesn't match expected type '%T'",
1700 expression, expression->base.type, type);
1705 bool additional_warning_displayed = false;
1706 while (braces > 0) {
1708 if (token.kind != '}') {
1709 if (!additional_warning_displayed) {
1710 warningf(WARN_OTHER, HERE, "additional elements in scalar initializer");
1711 additional_warning_displayed = true;
1722 * An entry in the type path.
1724 typedef struct type_path_entry_t type_path_entry_t;
1725 struct type_path_entry_t {
1726 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
1728 size_t index; /**< For array types: the current index. */
1729 declaration_t *compound_entry; /**< For compound types: the current declaration. */
1734 * A type path expression a position inside compound or array types.
1736 typedef struct type_path_t type_path_t;
1737 struct type_path_t {
1738 type_path_entry_t *path; /**< An flexible array containing the current path. */
1739 type_t *top_type; /**< type of the element the path points */
1740 size_t max_index; /**< largest index in outermost array */
1744 * Prints a type path for debugging.
1746 static __attribute__((unused)) void debug_print_type_path(
1747 const type_path_t *path)
1749 size_t len = ARR_LEN(path->path);
1751 for (size_t i = 0; i < len; ++i) {
1752 const type_path_entry_t *entry = & path->path[i];
1754 type_t *type = skip_typeref(entry->type);
1755 if (is_type_compound(type)) {
1756 /* in gcc mode structs can have no members */
1757 if (entry->v.compound_entry == NULL) {
1761 fprintf(stderr, ".%s",
1762 entry->v.compound_entry->base.symbol->string);
1763 } else if (is_type_array(type)) {
1764 fprintf(stderr, "[%u]", (unsigned) entry->v.index);
1766 fprintf(stderr, "-INVALID-");
1769 if (path->top_type != NULL) {
1770 fprintf(stderr, " (");
1771 print_type(path->top_type);
1772 fprintf(stderr, ")");
1777 * Return the top type path entry, ie. in a path
1778 * (type).a.b returns the b.
1780 static type_path_entry_t *get_type_path_top(const type_path_t *path)
1782 size_t len = ARR_LEN(path->path);
1784 return &path->path[len-1];
1788 * Enlarge the type path by an (empty) element.
1790 static type_path_entry_t *append_to_type_path(type_path_t *path)
1792 size_t len = ARR_LEN(path->path);
1793 ARR_RESIZE(type_path_entry_t, path->path, len+1);
1795 type_path_entry_t *result = & path->path[len];
1796 memset(result, 0, sizeof(result[0]));
1801 * Descending into a sub-type. Enter the scope of the current top_type.
1803 static void descend_into_subtype(type_path_t *path)
1805 type_t *orig_top_type = path->top_type;
1806 type_t *top_type = skip_typeref(orig_top_type);
1808 type_path_entry_t *top = append_to_type_path(path);
1809 top->type = top_type;
1811 if (is_type_compound(top_type)) {
1812 compound_t *const compound = top_type->compound.compound;
1813 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
1815 if (entry != NULL) {
1816 top->v.compound_entry = &entry->declaration;
1817 path->top_type = entry->declaration.type;
1819 path->top_type = NULL;
1821 } else if (is_type_array(top_type)) {
1823 path->top_type = top_type->array.element_type;
1825 assert(!is_type_valid(top_type));
1830 * Pop an entry from the given type path, ie. returning from
1831 * (type).a.b to (type).a
1833 static void ascend_from_subtype(type_path_t *path)
1835 type_path_entry_t *top = get_type_path_top(path);
1837 path->top_type = top->type;
1839 size_t len = ARR_LEN(path->path);
1840 ARR_RESIZE(type_path_entry_t, path->path, len-1);
1844 * Pop entries from the given type path until the given
1845 * path level is reached.
1847 static void ascend_to(type_path_t *path, size_t top_path_level)
1849 size_t len = ARR_LEN(path->path);
1851 while (len > top_path_level) {
1852 ascend_from_subtype(path);
1853 len = ARR_LEN(path->path);
1857 static bool walk_designator(type_path_t *path, const designator_t *designator,
1858 bool used_in_offsetof)
1860 for (; designator != NULL; designator = designator->next) {
1861 type_path_entry_t *top = get_type_path_top(path);
1862 type_t *orig_type = top->type;
1864 type_t *type = skip_typeref(orig_type);
1866 if (designator->symbol != NULL) {
1867 symbol_t *symbol = designator->symbol;
1868 if (!is_type_compound(type)) {
1869 if (is_type_valid(type)) {
1870 errorf(&designator->source_position,
1871 "'.%Y' designator used for non-compound type '%T'",
1875 top->type = type_error_type;
1876 top->v.compound_entry = NULL;
1877 orig_type = type_error_type;
1879 compound_t *compound = type->compound.compound;
1880 entity_t *iter = compound->members.entities;
1881 for (; iter != NULL; iter = iter->base.next) {
1882 if (iter->base.symbol == symbol) {
1887 errorf(&designator->source_position,
1888 "'%T' has no member named '%Y'", orig_type, symbol);
1891 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
1892 if (used_in_offsetof && iter->compound_member.bitfield) {
1893 errorf(&designator->source_position,
1894 "offsetof designator '%Y' must not specify bitfield",
1899 top->type = orig_type;
1900 top->v.compound_entry = &iter->declaration;
1901 orig_type = iter->declaration.type;
1904 expression_t *array_index = designator->array_index;
1905 assert(designator->array_index != NULL);
1907 if (!is_type_array(type)) {
1908 if (is_type_valid(type)) {
1909 errorf(&designator->source_position,
1910 "[%E] designator used for non-array type '%T'",
1911 array_index, orig_type);
1916 long index = fold_constant_to_int(array_index);
1917 if (!used_in_offsetof) {
1919 errorf(&designator->source_position,
1920 "array index [%E] must be positive", array_index);
1921 } else if (type->array.size_constant) {
1922 long array_size = type->array.size;
1923 if (index >= array_size) {
1924 errorf(&designator->source_position,
1925 "designator [%E] (%d) exceeds array size %d",
1926 array_index, index, array_size);
1931 top->type = orig_type;
1932 top->v.index = (size_t) index;
1933 orig_type = type->array.element_type;
1935 path->top_type = orig_type;
1937 if (designator->next != NULL) {
1938 descend_into_subtype(path);
1944 static void advance_current_object(type_path_t *path, size_t top_path_level)
1946 type_path_entry_t *top = get_type_path_top(path);
1948 type_t *type = skip_typeref(top->type);
1949 if (is_type_union(type)) {
1950 /* in unions only the first element is initialized */
1951 top->v.compound_entry = NULL;
1952 } else if (is_type_struct(type)) {
1953 declaration_t *entry = top->v.compound_entry;
1955 entity_t *const next_entity = skip_unnamed_bitfields(entry->base.next);
1956 if (next_entity != NULL) {
1957 assert(is_declaration(next_entity));
1958 entry = &next_entity->declaration;
1963 top->v.compound_entry = entry;
1964 if (entry != NULL) {
1965 path->top_type = entry->type;
1968 } else if (is_type_array(type)) {
1969 assert(is_type_array(type));
1973 if (!type->array.size_constant || top->v.index < type->array.size) {
1977 assert(!is_type_valid(type));
1981 /* we're past the last member of the current sub-aggregate, try if we
1982 * can ascend in the type hierarchy and continue with another subobject */
1983 size_t len = ARR_LEN(path->path);
1985 if (len > top_path_level) {
1986 ascend_from_subtype(path);
1987 advance_current_object(path, top_path_level);
1989 path->top_type = NULL;
1994 * skip any {...} blocks until a closing bracket is reached.
1996 static void skip_initializers(void)
2000 while (token.kind != '}') {
2001 if (token.kind == T_EOF)
2003 if (token.kind == '{') {
2011 static initializer_t *create_empty_initializer(void)
2013 static initializer_t empty_initializer
2014 = { .list = { { INITIALIZER_LIST }, 0 } };
2015 return &empty_initializer;
2019 * Parse a part of an initialiser for a struct or union,
2021 static initializer_t *parse_sub_initializer(type_path_t *path,
2022 type_t *outer_type, size_t top_path_level,
2023 parse_initializer_env_t *env)
2025 if (token.kind == '}') {
2026 /* empty initializer */
2027 return create_empty_initializer();
2030 type_t *orig_type = path->top_type;
2031 type_t *type = NULL;
2033 if (orig_type == NULL) {
2034 /* We are initializing an empty compound. */
2036 type = skip_typeref(orig_type);
2039 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2042 designator_t *designator = NULL;
2043 if (token.kind == '.' || token.kind == '[') {
2044 designator = parse_designation();
2045 goto finish_designator;
2046 } else if (token.kind == T_IDENTIFIER && look_ahead(1)->kind == ':') {
2047 /* GNU-style designator ("identifier: value") */
2048 designator = allocate_ast_zero(sizeof(designator[0]));
2049 designator->source_position = token.base.source_position;
2050 designator->symbol = token.identifier.symbol;
2055 /* reset path to toplevel, evaluate designator from there */
2056 ascend_to(path, top_path_level);
2057 if (!walk_designator(path, designator, false)) {
2058 /* can't continue after designation error */
2062 initializer_t *designator_initializer
2063 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2064 designator_initializer->designator.designator = designator;
2065 ARR_APP1(initializer_t*, initializers, designator_initializer);
2067 orig_type = path->top_type;
2068 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2073 if (token.kind == '{') {
2074 if (type != NULL && is_type_scalar(type)) {
2075 sub = parse_scalar_initializer(type, env->must_be_constant);
2078 if (env->entity != NULL) {
2080 "extra brace group at end of initializer for '%Y'",
2081 env->entity->base.symbol);
2083 errorf(HERE, "extra brace group at end of initializer");
2088 descend_into_subtype(path);
2091 add_anchor_token('}');
2092 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2094 rem_anchor_token('}');
2097 ascend_from_subtype(path);
2098 expect('}', end_error);
2100 expect('}', end_error);
2101 goto error_parse_next;
2105 /* must be an expression */
2106 expression_t *expression = parse_assignment_expression();
2107 mark_vars_read(expression, NULL);
2109 if (env->must_be_constant && !is_linker_constant(expression)) {
2110 errorf(&expression->base.source_position,
2111 "Initialisation expression '%E' is not constant",
2116 /* we are already outside, ... */
2117 if (outer_type == NULL)
2118 goto error_parse_next;
2119 type_t *const outer_type_skip = skip_typeref(outer_type);
2120 if (is_type_compound(outer_type_skip) &&
2121 !outer_type_skip->compound.compound->complete) {
2122 goto error_parse_next;
2125 source_position_t const* const pos = &expression->base.source_position;
2126 if (env->entity != NULL) {
2127 warningf(WARN_OTHER, pos, "excess elements in initializer for '%Y'", env->entity->base.symbol);
2129 warningf(WARN_OTHER, pos, "excess elements in initializer");
2131 goto error_parse_next;
2134 /* handle { "string" } special case */
2135 if ((expression->kind == EXPR_STRING_LITERAL
2136 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2137 && outer_type != NULL) {
2138 sub = initializer_from_expression(outer_type, expression);
2141 if (token.kind != '}') {
2142 warningf(WARN_OTHER, HERE, "excessive elements in initializer for type '%T'", orig_type);
2144 /* TODO: eat , ... */
2149 /* descend into subtypes until expression matches type */
2151 orig_type = path->top_type;
2152 type = skip_typeref(orig_type);
2154 sub = initializer_from_expression(orig_type, expression);
2158 if (!is_type_valid(type)) {
2161 if (is_type_scalar(type)) {
2162 errorf(&expression->base.source_position,
2163 "expression '%E' doesn't match expected type '%T'",
2164 expression, orig_type);
2168 descend_into_subtype(path);
2172 /* update largest index of top array */
2173 const type_path_entry_t *first = &path->path[0];
2174 type_t *first_type = first->type;
2175 first_type = skip_typeref(first_type);
2176 if (is_type_array(first_type)) {
2177 size_t index = first->v.index;
2178 if (index > path->max_index)
2179 path->max_index = index;
2182 /* append to initializers list */
2183 ARR_APP1(initializer_t*, initializers, sub);
2186 if (token.kind == '}') {
2189 expect(',', end_error);
2190 if (token.kind == '}') {
2195 /* advance to the next declaration if we are not at the end */
2196 advance_current_object(path, top_path_level);
2197 orig_type = path->top_type;
2198 if (orig_type != NULL)
2199 type = skip_typeref(orig_type);
2205 size_t len = ARR_LEN(initializers);
2206 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2207 initializer_t *result = allocate_ast_zero(size);
2208 result->kind = INITIALIZER_LIST;
2209 result->list.len = len;
2210 memcpy(&result->list.initializers, initializers,
2211 len * sizeof(initializers[0]));
2213 DEL_ARR_F(initializers);
2214 ascend_to(path, top_path_level+1);
2219 skip_initializers();
2220 DEL_ARR_F(initializers);
2221 ascend_to(path, top_path_level+1);
2225 static expression_t *make_size_literal(size_t value)
2227 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_INTEGER);
2228 literal->base.type = type_size_t;
2231 snprintf(buf, sizeof(buf), "%u", (unsigned) value);
2232 literal->literal.value = make_string(buf);
2238 * Parses an initializer. Parsers either a compound literal
2239 * (env->declaration == NULL) or an initializer of a declaration.
2241 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2243 type_t *type = skip_typeref(env->type);
2244 size_t max_index = 0;
2245 initializer_t *result;
2247 if (is_type_scalar(type)) {
2248 result = parse_scalar_initializer(type, env->must_be_constant);
2249 } else if (token.kind == '{') {
2253 memset(&path, 0, sizeof(path));
2254 path.top_type = env->type;
2255 path.path = NEW_ARR_F(type_path_entry_t, 0);
2257 descend_into_subtype(&path);
2259 add_anchor_token('}');
2260 result = parse_sub_initializer(&path, env->type, 1, env);
2261 rem_anchor_token('}');
2263 max_index = path.max_index;
2264 DEL_ARR_F(path.path);
2266 expect('}', end_error);
2269 /* parse_scalar_initializer() also works in this case: we simply
2270 * have an expression without {} around it */
2271 result = parse_scalar_initializer(type, env->must_be_constant);
2274 /* §6.7.8:22 array initializers for arrays with unknown size determine
2275 * the array type size */
2276 if (is_type_array(type) && type->array.size_expression == NULL
2277 && result != NULL) {
2279 switch (result->kind) {
2280 case INITIALIZER_LIST:
2281 assert(max_index != 0xdeadbeaf);
2282 size = max_index + 1;
2285 case INITIALIZER_STRING:
2286 size = result->string.string.size;
2289 case INITIALIZER_WIDE_STRING:
2290 size = result->wide_string.string.size;
2293 case INITIALIZER_DESIGNATOR:
2294 case INITIALIZER_VALUE:
2295 /* can happen for parse errors */
2300 internal_errorf(HERE, "invalid initializer type");
2303 type_t *new_type = duplicate_type(type);
2305 new_type->array.size_expression = make_size_literal(size);
2306 new_type->array.size_constant = true;
2307 new_type->array.has_implicit_size = true;
2308 new_type->array.size = size;
2309 env->type = new_type;
2315 static void append_entity(scope_t *scope, entity_t *entity)
2317 if (scope->last_entity != NULL) {
2318 scope->last_entity->base.next = entity;
2320 scope->entities = entity;
2322 entity->base.parent_entity = current_entity;
2323 scope->last_entity = entity;
2327 static compound_t *parse_compound_type_specifier(bool is_struct)
2329 source_position_t const pos = *HERE;
2330 eat(is_struct ? T_struct : T_union);
2332 symbol_t *symbol = NULL;
2333 entity_t *entity = NULL;
2334 attribute_t *attributes = NULL;
2336 if (token.kind == T___attribute__) {
2337 attributes = parse_attributes(NULL);
2340 entity_kind_tag_t const kind = is_struct ? ENTITY_STRUCT : ENTITY_UNION;
2341 if (token.kind == T_IDENTIFIER) {
2342 /* the compound has a name, check if we have seen it already */
2343 symbol = token.identifier.symbol;
2344 entity = get_tag(symbol, kind);
2347 if (entity != NULL) {
2348 if (entity->base.parent_scope != current_scope &&
2349 (token.kind == '{' || token.kind == ';')) {
2350 /* we're in an inner scope and have a definition. Shadow
2351 * existing definition in outer scope */
2353 } else if (entity->compound.complete && token.kind == '{') {
2354 source_position_t const *const ppos = &entity->base.source_position;
2355 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2356 /* clear members in the hope to avoid further errors */
2357 entity->compound.members.entities = NULL;
2360 } else if (token.kind != '{') {
2361 char const *const msg =
2362 is_struct ? "while parsing struct type specifier" :
2363 "while parsing union type specifier";
2364 parse_error_expected(msg, T_IDENTIFIER, '{', NULL);
2369 if (entity == NULL) {
2370 entity = allocate_entity_zero(kind, NAMESPACE_TAG, symbol);
2371 entity->compound.alignment = 1;
2372 entity->base.source_position = pos;
2373 entity->base.parent_scope = current_scope;
2374 if (symbol != NULL) {
2375 environment_push(entity);
2377 append_entity(current_scope, entity);
2380 if (token.kind == '{') {
2381 parse_compound_type_entries(&entity->compound);
2383 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2384 if (symbol == NULL) {
2385 assert(anonymous_entity == NULL);
2386 anonymous_entity = entity;
2390 if (attributes != NULL) {
2391 handle_entity_attributes(attributes, entity);
2394 return &entity->compound;
2397 static void parse_enum_entries(type_t *const enum_type)
2401 if (token.kind == '}') {
2402 errorf(HERE, "empty enum not allowed");
2407 add_anchor_token('}');
2409 if (token.kind != T_IDENTIFIER) {
2410 parse_error_expected("while parsing enum entry", T_IDENTIFIER, NULL);
2412 rem_anchor_token('}');
2416 symbol_t *symbol = token.identifier.symbol;
2417 entity_t *const entity
2418 = allocate_entity_zero(ENTITY_ENUM_VALUE, NAMESPACE_NORMAL, symbol);
2419 entity->enum_value.enum_type = enum_type;
2420 entity->base.source_position = token.base.source_position;
2424 expression_t *value = parse_constant_expression();
2426 value = create_implicit_cast(value, enum_type);
2427 entity->enum_value.value = value;
2432 record_entity(entity, false);
2433 } while (next_if(',') && token.kind != '}');
2434 rem_anchor_token('}');
2436 expect('}', end_error);
2442 static type_t *parse_enum_specifier(void)
2444 source_position_t const pos = *HERE;
2449 switch (token.kind) {
2451 symbol = token.identifier.symbol;
2452 entity = get_tag(symbol, ENTITY_ENUM);
2455 if (entity != NULL) {
2456 if (entity->base.parent_scope != current_scope &&
2457 (token.kind == '{' || token.kind == ';')) {
2458 /* we're in an inner scope and have a definition. Shadow
2459 * existing definition in outer scope */
2461 } else if (entity->enume.complete && token.kind == '{') {
2462 source_position_t const *const ppos = &entity->base.source_position;
2463 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2474 parse_error_expected("while parsing enum type specifier",
2475 T_IDENTIFIER, '{', NULL);
2479 if (entity == NULL) {
2480 entity = allocate_entity_zero(ENTITY_ENUM, NAMESPACE_TAG, symbol);
2481 entity->base.source_position = pos;
2482 entity->base.parent_scope = current_scope;
2485 type_t *const type = allocate_type_zero(TYPE_ENUM);
2486 type->enumt.enume = &entity->enume;
2487 type->enumt.base.akind = ATOMIC_TYPE_INT;
2489 if (token.kind == '{') {
2490 if (symbol != NULL) {
2491 environment_push(entity);
2493 append_entity(current_scope, entity);
2494 entity->enume.complete = true;
2496 parse_enum_entries(type);
2497 parse_attributes(NULL);
2499 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2500 if (symbol == NULL) {
2501 assert(anonymous_entity == NULL);
2502 anonymous_entity = entity;
2504 } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
2505 errorf(HERE, "'%T' used before definition (incomplete enums are a GNU extension)", type);
2512 * if a symbol is a typedef to another type, return true
2514 static bool is_typedef_symbol(symbol_t *symbol)
2516 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
2517 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
2520 static type_t *parse_typeof(void)
2526 expect('(', end_error);
2527 add_anchor_token(')');
2529 expression_t *expression = NULL;
2531 switch (token.kind) {
2533 if (is_typedef_symbol(token.identifier.symbol)) {
2535 type = parse_typename();
2538 expression = parse_expression();
2539 type = revert_automatic_type_conversion(expression);
2544 rem_anchor_token(')');
2545 expect(')', end_error);
2547 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
2548 typeof_type->typeoft.expression = expression;
2549 typeof_type->typeoft.typeof_type = type;
2556 typedef enum specifiers_t {
2557 SPECIFIER_SIGNED = 1 << 0,
2558 SPECIFIER_UNSIGNED = 1 << 1,
2559 SPECIFIER_LONG = 1 << 2,
2560 SPECIFIER_INT = 1 << 3,
2561 SPECIFIER_DOUBLE = 1 << 4,
2562 SPECIFIER_CHAR = 1 << 5,
2563 SPECIFIER_WCHAR_T = 1 << 6,
2564 SPECIFIER_SHORT = 1 << 7,
2565 SPECIFIER_LONG_LONG = 1 << 8,
2566 SPECIFIER_FLOAT = 1 << 9,
2567 SPECIFIER_BOOL = 1 << 10,
2568 SPECIFIER_VOID = 1 << 11,
2569 SPECIFIER_INT8 = 1 << 12,
2570 SPECIFIER_INT16 = 1 << 13,
2571 SPECIFIER_INT32 = 1 << 14,
2572 SPECIFIER_INT64 = 1 << 15,
2573 SPECIFIER_INT128 = 1 << 16,
2574 SPECIFIER_COMPLEX = 1 << 17,
2575 SPECIFIER_IMAGINARY = 1 << 18,
2578 static type_t *get_typedef_type(symbol_t *symbol)
2580 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
2581 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
2584 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
2585 type->typedeft.typedefe = &entity->typedefe;
2590 static attribute_t *parse_attribute_ms_property(attribute_t *attribute)
2592 expect('(', end_error);
2594 attribute_property_argument_t *property
2595 = allocate_ast_zero(sizeof(*property));
2598 if (token.kind != T_IDENTIFIER) {
2599 parse_error_expected("while parsing property declspec",
2600 T_IDENTIFIER, NULL);
2605 symbol_t *symbol = token.identifier.symbol;
2606 if (streq(symbol->string, "put")) {
2607 prop = &property->put_symbol;
2608 } else if (streq(symbol->string, "get")) {
2609 prop = &property->get_symbol;
2611 errorf(HERE, "expected put or get in property declspec");
2615 expect('=', end_error);
2616 if (token.kind != T_IDENTIFIER) {
2617 parse_error_expected("while parsing property declspec",
2618 T_IDENTIFIER, NULL);
2622 *prop = token.identifier.symbol;
2624 } while (next_if(','));
2626 attribute->a.property = property;
2628 expect(')', end_error);
2634 static attribute_t *parse_microsoft_extended_decl_modifier_single(void)
2636 attribute_kind_t kind = ATTRIBUTE_UNKNOWN;
2637 if (next_if(T_restrict)) {
2638 kind = ATTRIBUTE_MS_RESTRICT;
2639 } else if (token.kind == T_IDENTIFIER) {
2640 const char *name = token.identifier.symbol->string;
2641 for (attribute_kind_t k = ATTRIBUTE_MS_FIRST; k <= ATTRIBUTE_MS_LAST;
2643 const char *attribute_name = get_attribute_name(k);
2644 if (attribute_name != NULL && streq(attribute_name, name)) {
2650 if (kind == ATTRIBUTE_UNKNOWN) {
2651 warningf(WARN_ATTRIBUTE, HERE, "unknown __declspec '%s' ignored", name);
2654 parse_error_expected("while parsing __declspec", T_IDENTIFIER, NULL);
2658 attribute_t *attribute = allocate_attribute_zero(kind);
2661 if (kind == ATTRIBUTE_MS_PROPERTY) {
2662 return parse_attribute_ms_property(attribute);
2665 /* parse arguments */
2667 attribute->a.arguments = parse_attribute_arguments();
2672 static attribute_t *parse_microsoft_extended_decl_modifier(attribute_t *first)
2676 expect('(', end_error);
2681 add_anchor_token(')');
2683 attribute_t **anchor = &first;
2685 while (*anchor != NULL)
2686 anchor = &(*anchor)->next;
2688 attribute_t *attribute
2689 = parse_microsoft_extended_decl_modifier_single();
2690 if (attribute == NULL)
2693 *anchor = attribute;
2694 anchor = &attribute->next;
2695 } while (next_if(','));
2697 rem_anchor_token(')');
2698 expect(')', end_error);
2702 rem_anchor_token(')');
2706 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
2708 entity_t *const entity = allocate_entity_zero(kind, NAMESPACE_NORMAL, symbol);
2709 entity->base.source_position = *HERE;
2710 if (is_declaration(entity)) {
2711 entity->declaration.type = type_error_type;
2712 entity->declaration.implicit = true;
2713 } else if (kind == ENTITY_TYPEDEF) {
2714 entity->typedefe.type = type_error_type;
2715 entity->typedefe.builtin = true;
2717 if (kind != ENTITY_COMPOUND_MEMBER)
2718 record_entity(entity, false);
2722 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2724 type_t *type = NULL;
2725 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
2726 unsigned type_specifiers = 0;
2727 bool newtype = false;
2728 bool saw_error = false;
2730 memset(specifiers, 0, sizeof(*specifiers));
2731 specifiers->source_position = token.base.source_position;
2734 specifiers->attributes = parse_attributes(specifiers->attributes);
2736 switch (token.kind) {
2738 #define MATCH_STORAGE_CLASS(token, class) \
2740 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
2741 errorf(HERE, "multiple storage classes in declaration specifiers"); \
2743 specifiers->storage_class = class; \
2744 if (specifiers->thread_local) \
2745 goto check_thread_storage_class; \
2749 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
2750 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
2751 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
2752 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
2753 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
2756 specifiers->attributes
2757 = parse_microsoft_extended_decl_modifier(specifiers->attributes);
2761 if (specifiers->thread_local) {
2762 errorf(HERE, "duplicate '__thread'");
2764 specifiers->thread_local = true;
2765 check_thread_storage_class:
2766 switch (specifiers->storage_class) {
2767 case STORAGE_CLASS_EXTERN:
2768 case STORAGE_CLASS_NONE:
2769 case STORAGE_CLASS_STATIC:
2773 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_storage_class;
2774 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_storage_class;
2775 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_storage_class;
2776 wrong_thread_storage_class:
2777 errorf(HERE, "'__thread' used with '%s'", wrong);
2784 /* type qualifiers */
2785 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
2787 qualifiers |= qualifier; \
2791 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
2792 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
2793 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
2794 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
2795 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
2796 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
2797 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
2798 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
2800 /* type specifiers */
2801 #define MATCH_SPECIFIER(token, specifier, name) \
2803 if (type_specifiers & specifier) { \
2804 errorf(HERE, "multiple " name " type specifiers given"); \
2806 type_specifiers |= specifier; \
2811 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
2812 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
2813 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
2814 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
2815 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
2816 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
2817 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
2818 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
2819 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
2820 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
2821 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
2822 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
2823 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
2824 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
2825 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
2826 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
2827 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
2828 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
2832 specifiers->is_inline = true;
2836 case T__forceinline:
2838 specifiers->modifiers |= DM_FORCEINLINE;
2843 if (type_specifiers & SPECIFIER_LONG_LONG) {
2844 errorf(HERE, "too many long type specifiers given");
2845 } else if (type_specifiers & SPECIFIER_LONG) {
2846 type_specifiers |= SPECIFIER_LONG_LONG;
2848 type_specifiers |= SPECIFIER_LONG;
2853 #define CHECK_DOUBLE_TYPE() \
2854 (type != NULL ? errorf(HERE, "multiple types in declaration specifiers") : (void)0)
2857 CHECK_DOUBLE_TYPE();
2858 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
2860 type->compound.compound = parse_compound_type_specifier(true);
2863 CHECK_DOUBLE_TYPE();
2864 type = allocate_type_zero(TYPE_COMPOUND_UNION);
2865 type->compound.compound = parse_compound_type_specifier(false);
2868 CHECK_DOUBLE_TYPE();
2869 type = parse_enum_specifier();
2872 CHECK_DOUBLE_TYPE();
2873 type = parse_typeof();
2875 case T___builtin_va_list:
2876 CHECK_DOUBLE_TYPE();
2877 type = duplicate_type(type_valist);
2881 case T_IDENTIFIER: {
2882 /* only parse identifier if we haven't found a type yet */
2883 if (type != NULL || type_specifiers != 0) {
2884 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
2885 * declaration, so it doesn't generate errors about expecting '(' or
2887 switch (look_ahead(1)->kind) {
2894 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
2898 errorf(HERE, "discarding stray %K in declaration specifier", &token);
2903 goto finish_specifiers;
2907 type_t *const typedef_type = get_typedef_type(token.identifier.symbol);
2908 if (typedef_type == NULL) {
2909 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
2910 * declaration, so it doesn't generate 'implicit int' followed by more
2911 * errors later on. */
2912 token_kind_t const la1_type = (token_kind_t)look_ahead(1)->kind;
2918 errorf(HERE, "%K does not name a type", &token);
2920 symbol_t *symbol = token.identifier.symbol;
2922 = create_error_entity(symbol, ENTITY_TYPEDEF);
2924 type = allocate_type_zero(TYPE_TYPEDEF);
2925 type->typedeft.typedefe = &entity->typedefe;
2933 goto finish_specifiers;
2938 type = typedef_type;
2942 /* function specifier */
2944 goto finish_specifiers;
2949 specifiers->attributes = parse_attributes(specifiers->attributes);
2951 if (type == NULL || (saw_error && type_specifiers != 0)) {
2952 atomic_type_kind_t atomic_type;
2954 /* match valid basic types */
2955 switch (type_specifiers) {
2956 case SPECIFIER_VOID:
2957 atomic_type = ATOMIC_TYPE_VOID;
2959 case SPECIFIER_WCHAR_T:
2960 atomic_type = ATOMIC_TYPE_WCHAR_T;
2962 case SPECIFIER_CHAR:
2963 atomic_type = ATOMIC_TYPE_CHAR;
2965 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
2966 atomic_type = ATOMIC_TYPE_SCHAR;
2968 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
2969 atomic_type = ATOMIC_TYPE_UCHAR;
2971 case SPECIFIER_SHORT:
2972 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
2973 case SPECIFIER_SHORT | SPECIFIER_INT:
2974 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
2975 atomic_type = ATOMIC_TYPE_SHORT;
2977 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
2978 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
2979 atomic_type = ATOMIC_TYPE_USHORT;
2982 case SPECIFIER_SIGNED:
2983 case SPECIFIER_SIGNED | SPECIFIER_INT:
2984 atomic_type = ATOMIC_TYPE_INT;
2986 case SPECIFIER_UNSIGNED:
2987 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
2988 atomic_type = ATOMIC_TYPE_UINT;
2990 case SPECIFIER_LONG:
2991 case SPECIFIER_SIGNED | SPECIFIER_LONG:
2992 case SPECIFIER_LONG | SPECIFIER_INT:
2993 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
2994 atomic_type = ATOMIC_TYPE_LONG;
2996 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
2997 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
2998 atomic_type = ATOMIC_TYPE_ULONG;
3001 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3002 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3003 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3004 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3006 atomic_type = ATOMIC_TYPE_LONGLONG;
3007 goto warn_about_long_long;
3009 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3010 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3012 atomic_type = ATOMIC_TYPE_ULONGLONG;
3013 warn_about_long_long:
3014 warningf(WARN_LONG_LONG, &specifiers->source_position, "ISO C90 does not support 'long long'");
3017 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3018 atomic_type = unsigned_int8_type_kind;
3021 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3022 atomic_type = unsigned_int16_type_kind;
3025 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3026 atomic_type = unsigned_int32_type_kind;
3029 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3030 atomic_type = unsigned_int64_type_kind;
3033 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3034 atomic_type = unsigned_int128_type_kind;
3037 case SPECIFIER_INT8:
3038 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3039 atomic_type = int8_type_kind;
3042 case SPECIFIER_INT16:
3043 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3044 atomic_type = int16_type_kind;
3047 case SPECIFIER_INT32:
3048 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3049 atomic_type = int32_type_kind;
3052 case SPECIFIER_INT64:
3053 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3054 atomic_type = int64_type_kind;
3057 case SPECIFIER_INT128:
3058 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3059 atomic_type = int128_type_kind;
3062 case SPECIFIER_FLOAT:
3063 atomic_type = ATOMIC_TYPE_FLOAT;
3065 case SPECIFIER_DOUBLE:
3066 atomic_type = ATOMIC_TYPE_DOUBLE;
3068 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3069 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3071 case SPECIFIER_BOOL:
3072 atomic_type = ATOMIC_TYPE_BOOL;
3074 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3075 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3076 atomic_type = ATOMIC_TYPE_FLOAT;
3078 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3079 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3080 atomic_type = ATOMIC_TYPE_DOUBLE;
3082 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3083 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3084 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3087 /* invalid specifier combination, give an error message */
3088 source_position_t const* const pos = &specifiers->source_position;
3089 if (type_specifiers == 0) {
3091 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
3092 if (!(c_mode & _CXX) && !strict_mode) {
3093 warningf(WARN_IMPLICIT_INT, pos, "no type specifiers in declaration, using 'int'");
3094 atomic_type = ATOMIC_TYPE_INT;
3097 errorf(pos, "no type specifiers given in declaration");
3100 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3101 (type_specifiers & SPECIFIER_UNSIGNED)) {
3102 errorf(pos, "signed and unsigned specifiers given");
3103 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3104 errorf(pos, "only integer types can be signed or unsigned");
3106 errorf(pos, "multiple datatypes in declaration");
3112 if (type_specifiers & SPECIFIER_COMPLEX) {
3113 type = allocate_type_zero(TYPE_COMPLEX);
3114 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3115 type = allocate_type_zero(TYPE_IMAGINARY);
3117 type = allocate_type_zero(TYPE_ATOMIC);
3119 type->atomic.akind = atomic_type;
3121 } else if (type_specifiers != 0) {
3122 errorf(&specifiers->source_position, "multiple datatypes in declaration");
3125 /* FIXME: check type qualifiers here */
3126 type->base.qualifiers = qualifiers;
3129 type = identify_new_type(type);
3131 type = typehash_insert(type);
3134 if (specifiers->attributes != NULL)
3135 type = handle_type_attributes(specifiers->attributes, type);
3136 specifiers->type = type;
3140 specifiers->type = type_error_type;
3143 static type_qualifiers_t parse_type_qualifiers(void)
3145 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3148 switch (token.kind) {
3149 /* type qualifiers */
3150 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3151 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3152 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3153 /* microsoft extended type modifiers */
3154 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3155 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3156 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3157 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3158 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3167 * Parses an K&R identifier list
3169 static void parse_identifier_list(scope_t *scope)
3171 assert(token.kind == T_IDENTIFIER);
3173 entity_t *const entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, token.identifier.symbol);
3174 entity->base.source_position = token.base.source_position;
3175 /* a K&R parameter has no type, yet */
3179 append_entity(scope, entity);
3180 } while (next_if(',') && token.kind == T_IDENTIFIER);
3183 static entity_t *parse_parameter(void)
3185 declaration_specifiers_t specifiers;
3186 parse_declaration_specifiers(&specifiers);
3188 entity_t *entity = parse_declarator(&specifiers,
3189 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
3190 anonymous_entity = NULL;
3194 static void semantic_parameter_incomplete(const entity_t *entity)
3196 assert(entity->kind == ENTITY_PARAMETER);
3198 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
3199 * list in a function declarator that is part of a
3200 * definition of that function shall not have
3201 * incomplete type. */
3202 type_t *type = skip_typeref(entity->declaration.type);
3203 if (is_type_incomplete(type)) {
3204 errorf(&entity->base.source_position, "'%N' has incomplete type", entity);
3208 static bool has_parameters(void)
3210 /* func(void) is not a parameter */
3211 if (token.kind == T_IDENTIFIER) {
3212 entity_t const *const entity
3213 = get_entity(token.identifier.symbol, NAMESPACE_NORMAL);
3216 if (entity->kind != ENTITY_TYPEDEF)
3218 if (skip_typeref(entity->typedefe.type) != type_void)
3220 } else if (token.kind != T_void) {
3223 if (look_ahead(1)->kind != ')')
3230 * Parses function type parameters (and optionally creates variable_t entities
3231 * for them in a scope)
3233 static void parse_parameters(function_type_t *type, scope_t *scope)
3236 add_anchor_token(')');
3237 int saved_comma_state = save_and_reset_anchor_state(',');
3239 if (token.kind == T_IDENTIFIER
3240 && !is_typedef_symbol(token.identifier.symbol)) {
3241 token_kind_t la1_type = (token_kind_t)look_ahead(1)->kind;
3242 if (la1_type == ',' || la1_type == ')') {
3243 type->kr_style_parameters = true;
3244 parse_identifier_list(scope);
3245 goto parameters_finished;
3249 if (token.kind == ')') {
3250 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
3251 if (!(c_mode & _CXX))
3252 type->unspecified_parameters = true;
3253 } else if (has_parameters()) {
3254 function_parameter_t **anchor = &type->parameters;
3256 switch (token.kind) {
3259 type->variadic = true;
3260 goto parameters_finished;
3265 entity_t *entity = parse_parameter();
3266 if (entity->kind == ENTITY_TYPEDEF) {
3267 errorf(&entity->base.source_position,
3268 "typedef not allowed as function parameter");
3271 assert(is_declaration(entity));
3273 semantic_parameter_incomplete(entity);
3275 function_parameter_t *const parameter =
3276 allocate_parameter(entity->declaration.type);
3278 if (scope != NULL) {
3279 append_entity(scope, entity);
3282 *anchor = parameter;
3283 anchor = ¶meter->next;
3288 goto parameters_finished;
3290 } while (next_if(','));
3293 parameters_finished:
3294 rem_anchor_token(')');
3295 expect(')', end_error);
3298 restore_anchor_state(',', saved_comma_state);
3301 typedef enum construct_type_kind_t {
3302 CONSTRUCT_POINTER = 1,
3303 CONSTRUCT_REFERENCE,
3306 } construct_type_kind_t;
3308 typedef union construct_type_t construct_type_t;
3310 typedef struct construct_type_base_t {
3311 construct_type_kind_t kind;
3312 source_position_t pos;
3313 construct_type_t *next;
3314 } construct_type_base_t;
3316 typedef struct parsed_pointer_t {
3317 construct_type_base_t base;
3318 type_qualifiers_t type_qualifiers;
3319 variable_t *base_variable; /**< MS __based extension. */
3322 typedef struct parsed_reference_t {
3323 construct_type_base_t base;
3324 } parsed_reference_t;
3326 typedef struct construct_function_type_t {
3327 construct_type_base_t base;
3328 type_t *function_type;
3329 } construct_function_type_t;
3331 typedef struct parsed_array_t {
3332 construct_type_base_t base;
3333 type_qualifiers_t type_qualifiers;
3339 union construct_type_t {
3340 construct_type_kind_t kind;
3341 construct_type_base_t base;
3342 parsed_pointer_t pointer;
3343 parsed_reference_t reference;
3344 construct_function_type_t function;
3345 parsed_array_t array;
3348 static construct_type_t *allocate_declarator_zero(construct_type_kind_t const kind, size_t const size)
3350 construct_type_t *const cons = obstack_alloc(&temp_obst, size);
3351 memset(cons, 0, size);
3353 cons->base.pos = *HERE;
3358 static construct_type_t *parse_pointer_declarator(void)
3360 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_POINTER, sizeof(parsed_pointer_t));
3362 cons->pointer.type_qualifiers = parse_type_qualifiers();
3363 //cons->pointer.base_variable = base_variable;
3368 /* ISO/IEC 14882:1998(E) §8.3.2 */
3369 static construct_type_t *parse_reference_declarator(void)
3371 if (!(c_mode & _CXX))
3372 errorf(HERE, "references are only available for C++");
3374 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_REFERENCE, sizeof(parsed_reference_t));
3381 static construct_type_t *parse_array_declarator(void)
3383 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_ARRAY, sizeof(parsed_array_t));
3384 parsed_array_t *const array = &cons->array;
3387 add_anchor_token(']');
3389 bool is_static = next_if(T_static);
3391 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3394 is_static = next_if(T_static);
3396 array->type_qualifiers = type_qualifiers;
3397 array->is_static = is_static;
3399 expression_t *size = NULL;
3400 if (token.kind == '*' && look_ahead(1)->kind == ']') {
3401 array->is_variable = true;
3403 } else if (token.kind != ']') {
3404 size = parse_assignment_expression();
3406 /* §6.7.5.2:1 Array size must have integer type */
3407 type_t *const orig_type = size->base.type;
3408 type_t *const type = skip_typeref(orig_type);
3409 if (!is_type_integer(type) && is_type_valid(type)) {
3410 errorf(&size->base.source_position,
3411 "array size '%E' must have integer type but has type '%T'",
3416 mark_vars_read(size, NULL);
3419 if (is_static && size == NULL)
3420 errorf(&array->base.pos, "static array parameters require a size");
3422 rem_anchor_token(']');
3423 expect(']', end_error);
3430 static construct_type_t *parse_function_declarator(scope_t *scope)
3432 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_FUNCTION, sizeof(construct_function_type_t));
3434 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3435 function_type_t *ftype = &type->function;
3437 ftype->linkage = current_linkage;
3438 ftype->calling_convention = CC_DEFAULT;
3440 parse_parameters(ftype, scope);
3442 cons->function.function_type = type;
3447 typedef struct parse_declarator_env_t {
3448 bool may_be_abstract : 1;
3449 bool must_be_abstract : 1;
3450 decl_modifiers_t modifiers;
3452 source_position_t source_position;
3454 attribute_t *attributes;
3455 } parse_declarator_env_t;
3458 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env)
3460 /* construct a single linked list of construct_type_t's which describe
3461 * how to construct the final declarator type */
3462 construct_type_t *first = NULL;
3463 construct_type_t **anchor = &first;
3465 env->attributes = parse_attributes(env->attributes);
3468 construct_type_t *type;
3469 //variable_t *based = NULL; /* MS __based extension */
3470 switch (token.kind) {
3472 type = parse_reference_declarator();
3476 panic("based not supported anymore");
3481 type = parse_pointer_declarator();
3485 goto ptr_operator_end;
3489 anchor = &type->base.next;
3491 /* TODO: find out if this is correct */
3492 env->attributes = parse_attributes(env->attributes);
3496 construct_type_t *inner_types = NULL;
3498 switch (token.kind) {
3500 if (env->must_be_abstract) {
3501 errorf(HERE, "no identifier expected in typename");
3503 env->symbol = token.identifier.symbol;
3504 env->source_position = token.base.source_position;
3510 /* Parenthesized declarator or function declarator? */
3511 token_t const *const la1 = look_ahead(1);
3512 switch (la1->kind) {
3514 if (is_typedef_symbol(la1->identifier.symbol)) {
3516 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
3517 * interpreted as ``function with no parameter specification'', rather
3518 * than redundant parentheses around the omitted identifier. */
3520 /* Function declarator. */
3521 if (!env->may_be_abstract) {
3522 errorf(HERE, "function declarator must have a name");
3529 case T___attribute__: /* FIXME __attribute__ might also introduce a parameter of a function declarator. */
3530 /* Paranthesized declarator. */
3532 add_anchor_token(')');
3533 inner_types = parse_inner_declarator(env);
3534 if (inner_types != NULL) {
3535 /* All later declarators only modify the return type */
3536 env->must_be_abstract = true;
3538 rem_anchor_token(')');
3539 expect(')', end_error);
3547 if (env->may_be_abstract)
3549 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3554 construct_type_t **const p = anchor;
3557 construct_type_t *type;
3558 switch (token.kind) {
3560 scope_t *scope = NULL;
3561 if (!env->must_be_abstract) {
3562 scope = &env->parameters;
3565 type = parse_function_declarator(scope);
3569 type = parse_array_declarator();
3572 goto declarator_finished;
3575 /* insert in the middle of the list (at p) */
3576 type->base.next = *p;
3579 anchor = &type->base.next;
3582 declarator_finished:
3583 /* append inner_types at the end of the list, we don't to set anchor anymore
3584 * as it's not needed anymore */
3585 *anchor = inner_types;
3592 static type_t *construct_declarator_type(construct_type_t *construct_list,
3595 construct_type_t *iter = construct_list;
3596 for (; iter != NULL; iter = iter->base.next) {
3597 source_position_t const* const pos = &iter->base.pos;
3598 switch (iter->kind) {
3599 case CONSTRUCT_FUNCTION: {
3600 construct_function_type_t *function = &iter->function;
3601 type_t *function_type = function->function_type;
3603 function_type->function.return_type = type;
3605 type_t *skipped_return_type = skip_typeref(type);
3607 if (is_type_function(skipped_return_type)) {
3608 errorf(pos, "function returning function is not allowed");
3609 } else if (is_type_array(skipped_return_type)) {
3610 errorf(pos, "function returning array is not allowed");
3612 if (skipped_return_type->base.qualifiers != 0) {
3613 warningf(WARN_IGNORED_QUALIFIERS, pos, "type qualifiers in return type of function type are meaningless");
3617 /* The function type was constructed earlier. Freeing it here will
3618 * destroy other types. */
3619 type = typehash_insert(function_type);
3623 case CONSTRUCT_POINTER: {
3624 if (is_type_reference(skip_typeref(type)))
3625 errorf(pos, "cannot declare a pointer to reference");
3627 parsed_pointer_t *pointer = &iter->pointer;
3628 type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
3632 case CONSTRUCT_REFERENCE:
3633 if (is_type_reference(skip_typeref(type)))
3634 errorf(pos, "cannot declare a reference to reference");
3636 type = make_reference_type(type);
3639 case CONSTRUCT_ARRAY: {
3640 if (is_type_reference(skip_typeref(type)))
3641 errorf(pos, "cannot declare an array of references");
3643 parsed_array_t *array = &iter->array;
3644 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
3646 expression_t *size_expression = array->size;
3647 if (size_expression != NULL) {
3649 = create_implicit_cast(size_expression, type_size_t);
3652 array_type->base.qualifiers = array->type_qualifiers;
3653 array_type->array.element_type = type;
3654 array_type->array.is_static = array->is_static;
3655 array_type->array.is_variable = array->is_variable;
3656 array_type->array.size_expression = size_expression;
3658 if (size_expression != NULL) {
3659 switch (is_constant_expression(size_expression)) {
3660 case EXPR_CLASS_CONSTANT: {
3661 long const size = fold_constant_to_int(size_expression);
3662 array_type->array.size = size;
3663 array_type->array.size_constant = true;
3664 /* §6.7.5.2:1 If the expression is a constant expression,
3665 * it shall have a value greater than zero. */
3667 errorf(&size_expression->base.source_position,
3668 "size of array must be greater than zero");
3669 } else if (size == 0 && !GNU_MODE) {
3670 errorf(&size_expression->base.source_position,
3671 "size of array must be greater than zero (zero length arrays are a GCC extension)");
3676 case EXPR_CLASS_VARIABLE:
3677 array_type->array.is_vla = true;
3680 case EXPR_CLASS_ERROR:
3685 type_t *skipped_type = skip_typeref(type);
3687 if (is_type_incomplete(skipped_type)) {
3688 errorf(pos, "array of incomplete type '%T' is not allowed", type);
3689 } else if (is_type_function(skipped_type)) {
3690 errorf(pos, "array of functions is not allowed");
3692 type = identify_new_type(array_type);
3696 internal_errorf(pos, "invalid type construction found");
3702 static type_t *automatic_type_conversion(type_t *orig_type);
3704 static type_t *semantic_parameter(const source_position_t *pos,
3706 const declaration_specifiers_t *specifiers,
3707 entity_t const *const param)
3709 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
3710 * shall be adjusted to ``qualified pointer to type'',
3712 * §6.7.5.3:8 A declaration of a parameter as ``function returning
3713 * type'' shall be adjusted to ``pointer to function
3714 * returning type'', as in 6.3.2.1. */
3715 type = automatic_type_conversion(type);
3717 if (specifiers->is_inline && is_type_valid(type)) {
3718 errorf(pos, "'%N' declared 'inline'", param);
3721 /* §6.9.1:6 The declarations in the declaration list shall contain
3722 * no storage-class specifier other than register and no
3723 * initializations. */
3724 if (specifiers->thread_local || (
3725 specifiers->storage_class != STORAGE_CLASS_NONE &&
3726 specifiers->storage_class != STORAGE_CLASS_REGISTER)
3728 errorf(pos, "invalid storage class for '%N'", param);
3731 /* delay test for incomplete type, because we might have (void)
3732 * which is legal but incomplete... */
3737 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
3738 declarator_flags_t flags)
3740 parse_declarator_env_t env;
3741 memset(&env, 0, sizeof(env));
3742 env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
3744 construct_type_t *construct_type = parse_inner_declarator(&env);
3746 construct_declarator_type(construct_type, specifiers->type);
3747 type_t *type = skip_typeref(orig_type);
3749 if (construct_type != NULL) {
3750 obstack_free(&temp_obst, construct_type);
3753 attribute_t *attributes = parse_attributes(env.attributes);
3754 /* append (shared) specifier attribute behind attributes of this
3756 attribute_t **anchor = &attributes;
3757 while (*anchor != NULL)
3758 anchor = &(*anchor)->next;
3759 *anchor = specifiers->attributes;
3762 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
3763 entity = allocate_entity_zero(ENTITY_TYPEDEF, NAMESPACE_NORMAL, env.symbol);
3764 entity->base.source_position = env.source_position;
3765 entity->typedefe.type = orig_type;
3767 if (anonymous_entity != NULL) {
3768 if (is_type_compound(type)) {
3769 assert(anonymous_entity->compound.alias == NULL);
3770 assert(anonymous_entity->kind == ENTITY_STRUCT ||
3771 anonymous_entity->kind == ENTITY_UNION);
3772 anonymous_entity->compound.alias = entity;
3773 anonymous_entity = NULL;
3774 } else if (is_type_enum(type)) {
3775 assert(anonymous_entity->enume.alias == NULL);
3776 assert(anonymous_entity->kind == ENTITY_ENUM);
3777 anonymous_entity->enume.alias = entity;
3778 anonymous_entity = NULL;
3782 /* create a declaration type entity */
3783 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
3784 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, env.symbol);
3786 if (env.symbol != NULL) {
3787 if (specifiers->is_inline && is_type_valid(type)) {
3788 errorf(&env.source_position,
3789 "compound member '%Y' declared 'inline'", env.symbol);
3792 if (specifiers->thread_local ||
3793 specifiers->storage_class != STORAGE_CLASS_NONE) {
3794 errorf(&env.source_position,
3795 "compound member '%Y' must have no storage class",
3799 } else if (flags & DECL_IS_PARAMETER) {
3800 entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, env.symbol);
3801 orig_type = semantic_parameter(&env.source_position, orig_type, specifiers, entity);
3802 } else if (is_type_function(type)) {
3803 entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, env.symbol);
3804 entity->function.is_inline = specifiers->is_inline;
3805 entity->function.elf_visibility = default_visibility;
3806 entity->function.parameters = env.parameters;
3808 if (env.symbol != NULL) {
3809 /* this needs fixes for C++ */
3810 bool in_function_scope = current_function != NULL;
3812 if (specifiers->thread_local || (
3813 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3814 specifiers->storage_class != STORAGE_CLASS_NONE &&
3815 (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
3817 errorf(&env.source_position, "invalid storage class for '%N'", entity);
3821 entity = allocate_entity_zero(ENTITY_VARIABLE, NAMESPACE_NORMAL, env.symbol);
3822 entity->variable.elf_visibility = default_visibility;
3823 entity->variable.thread_local = specifiers->thread_local;
3825 if (env.symbol != NULL) {
3826 if (specifiers->is_inline && is_type_valid(type)) {
3827 errorf(&env.source_position, "'%N' declared 'inline'", entity);
3830 bool invalid_storage_class = false;
3831 if (current_scope == file_scope) {
3832 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3833 specifiers->storage_class != STORAGE_CLASS_NONE &&
3834 specifiers->storage_class != STORAGE_CLASS_STATIC) {
3835 invalid_storage_class = true;
3838 if (specifiers->thread_local &&
3839 specifiers->storage_class == STORAGE_CLASS_NONE) {
3840 invalid_storage_class = true;
3843 if (invalid_storage_class) {
3844 errorf(&env.source_position, "invalid storage class for variable '%N'", entity);
3849 entity->base.source_position = env.symbol != NULL ? env.source_position : specifiers->source_position;
3850 entity->declaration.type = orig_type;
3851 entity->declaration.alignment = get_type_alignment(orig_type);
3852 entity->declaration.modifiers = env.modifiers;
3853 entity->declaration.attributes = attributes;
3855 storage_class_t storage_class = specifiers->storage_class;
3856 entity->declaration.declared_storage_class = storage_class;
3858 if (storage_class == STORAGE_CLASS_NONE && current_function != NULL)
3859 storage_class = STORAGE_CLASS_AUTO;
3860 entity->declaration.storage_class = storage_class;
3863 if (attributes != NULL) {
3864 handle_entity_attributes(attributes, entity);
3867 if (entity->kind == ENTITY_FUNCTION && !freestanding) {
3868 adapt_special_functions(&entity->function);
3874 static type_t *parse_abstract_declarator(type_t *base_type)
3876 parse_declarator_env_t env;
3877 memset(&env, 0, sizeof(env));
3878 env.may_be_abstract = true;
3879 env.must_be_abstract = true;
3881 construct_type_t *construct_type = parse_inner_declarator(&env);
3883 type_t *result = construct_declarator_type(construct_type, base_type);
3884 if (construct_type != NULL) {
3885 obstack_free(&temp_obst, construct_type);
3887 result = handle_type_attributes(env.attributes, result);
3893 * Check if the declaration of main is suspicious. main should be a
3894 * function with external linkage, returning int, taking either zero
3895 * arguments, two, or three arguments of appropriate types, ie.
3897 * int main([ int argc, char **argv [, char **env ] ]).
3899 * @param decl the declaration to check
3900 * @param type the function type of the declaration
3902 static void check_main(const entity_t *entity)
3904 const source_position_t *pos = &entity->base.source_position;
3905 if (entity->kind != ENTITY_FUNCTION) {
3906 warningf(WARN_MAIN, pos, "'main' is not a function");
3910 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
3911 warningf(WARN_MAIN, pos, "'main' is normally a non-static function");
3914 type_t *type = skip_typeref(entity->declaration.type);
3915 assert(is_type_function(type));
3917 function_type_t const *const func_type = &type->function;
3918 type_t *const ret_type = func_type->return_type;
3919 if (!types_compatible(skip_typeref(ret_type), type_int)) {
3920 warningf(WARN_MAIN, pos, "return type of 'main' should be 'int', but is '%T'", ret_type);
3922 const function_parameter_t *parm = func_type->parameters;
3924 type_t *const first_type = skip_typeref(parm->type);
3925 type_t *const first_type_unqual = get_unqualified_type(first_type);
3926 if (!types_compatible(first_type_unqual, type_int)) {
3927 warningf(WARN_MAIN, pos, "first argument of 'main' should be 'int', but is '%T'", parm->type);
3931 type_t *const second_type = skip_typeref(parm->type);
3932 type_t *const second_type_unqual
3933 = get_unqualified_type(second_type);
3934 if (!types_compatible(second_type_unqual, type_char_ptr_ptr)) {
3935 warningf(WARN_MAIN, pos, "second argument of 'main' should be 'char**', but is '%T'", parm->type);
3939 type_t *const third_type = skip_typeref(parm->type);
3940 type_t *const third_type_unqual
3941 = get_unqualified_type(third_type);
3942 if (!types_compatible(third_type_unqual, type_char_ptr_ptr)) {
3943 warningf(WARN_MAIN, pos, "third argument of 'main' should be 'char**', but is '%T'", parm->type);
3947 goto warn_arg_count;
3951 warningf(WARN_MAIN, pos, "'main' takes only zero, two or three arguments");
3957 * Check if a symbol is the equal to "main".
3959 static bool is_sym_main(const symbol_t *const sym)
3961 return streq(sym->string, "main");
3964 static void error_redefined_as_different_kind(const source_position_t *pos,
3965 const entity_t *old, entity_kind_t new_kind)
3967 char const *const what = get_entity_kind_name(new_kind);
3968 source_position_t const *const ppos = &old->base.source_position;
3969 errorf(pos, "redeclaration of '%N' as %s (declared %P)", old, what, ppos);
3972 static bool is_entity_valid(entity_t *const ent)
3974 if (is_declaration(ent)) {
3975 return is_type_valid(skip_typeref(ent->declaration.type));
3976 } else if (ent->kind == ENTITY_TYPEDEF) {
3977 return is_type_valid(skip_typeref(ent->typedefe.type));
3982 static bool contains_attribute(const attribute_t *list, const attribute_t *attr)
3984 for (const attribute_t *tattr = list; tattr != NULL; tattr = tattr->next) {
3985 if (attributes_equal(tattr, attr))
3992 * test wether new_list contains any attributes not included in old_list
3994 static bool has_new_attributes(const attribute_t *old_list,
3995 const attribute_t *new_list)
3997 for (const attribute_t *attr = new_list; attr != NULL; attr = attr->next) {
3998 if (!contains_attribute(old_list, attr))
4005 * Merge in attributes from an attribute list (probably from a previous
4006 * declaration with the same name). Warning: destroys the old structure
4007 * of the attribute list - don't reuse attributes after this call.
4009 static void merge_in_attributes(declaration_t *decl, attribute_t *attributes)
4012 for (attribute_t *attr = attributes; attr != NULL; attr = next) {
4014 if (contains_attribute(decl->attributes, attr))
4017 /* move attribute to new declarations attributes list */
4018 attr->next = decl->attributes;
4019 decl->attributes = attr;
4024 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
4025 * for various problems that occur for multiple definitions
4027 entity_t *record_entity(entity_t *entity, const bool is_definition)
4029 const symbol_t *const symbol = entity->base.symbol;
4030 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
4031 const source_position_t *pos = &entity->base.source_position;
4033 /* can happen in error cases */
4037 entity_t *const previous_entity = get_entity(symbol, namespc);
4038 /* pushing the same entity twice will break the stack structure */
4039 assert(previous_entity != entity);
4041 if (entity->kind == ENTITY_FUNCTION) {
4042 type_t *const orig_type = entity->declaration.type;
4043 type_t *const type = skip_typeref(orig_type);
4045 assert(is_type_function(type));
4046 if (type->function.unspecified_parameters &&
4047 previous_entity == NULL &&
4048 !entity->declaration.implicit) {
4049 warningf(WARN_STRICT_PROTOTYPES, pos, "function declaration '%#N' is not a prototype", entity);
4052 if (current_scope == file_scope && is_sym_main(symbol)) {
4057 if (is_declaration(entity) &&
4058 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
4059 current_scope != file_scope &&
4060 !entity->declaration.implicit) {
4061 warningf(WARN_NESTED_EXTERNS, pos, "nested extern declaration of '%#N'", entity);
4064 if (previous_entity != NULL) {
4065 source_position_t const *const ppos = &previous_entity->base.source_position;
4067 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
4068 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
4069 assert(previous_entity->kind == ENTITY_PARAMETER);
4070 errorf(pos, "declaration of '%N' redeclares the '%N' (declared %P)", entity, previous_entity, ppos);
4074 if (previous_entity->base.parent_scope == current_scope) {
4075 if (previous_entity->kind != entity->kind) {
4076 if (is_entity_valid(previous_entity) && is_entity_valid(entity)) {
4077 error_redefined_as_different_kind(pos, previous_entity,
4082 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
4083 errorf(pos, "redeclaration of '%N' (declared %P)", entity, ppos);
4086 if (previous_entity->kind == ENTITY_TYPEDEF) {
4087 type_t *const type = skip_typeref(entity->typedefe.type);
4088 type_t *const prev_type
4089 = skip_typeref(previous_entity->typedefe.type);
4090 if (c_mode & _CXX) {
4091 /* C++ allows double typedef if they are identical
4092 * (after skipping typedefs) */
4093 if (type == prev_type)
4096 /* GCC extension: redef in system headers is allowed */
4097 if ((pos->is_system_header || ppos->is_system_header) &&
4098 types_compatible(type, prev_type))
4101 errorf(pos, "redefinition of '%N' (declared %P)",
4106 /* at this point we should have only VARIABLES or FUNCTIONS */
4107 assert(is_declaration(previous_entity) && is_declaration(entity));
4109 declaration_t *const prev_decl = &previous_entity->declaration;
4110 declaration_t *const decl = &entity->declaration;
4112 /* can happen for K&R style declarations */
4113 if (prev_decl->type == NULL &&
4114 previous_entity->kind == ENTITY_PARAMETER &&
4115 entity->kind == ENTITY_PARAMETER) {
4116 prev_decl->type = decl->type;
4117 prev_decl->storage_class = decl->storage_class;
4118 prev_decl->declared_storage_class = decl->declared_storage_class;
4119 prev_decl->modifiers = decl->modifiers;
4120 return previous_entity;
4123 type_t *const type = skip_typeref(decl->type);
4124 type_t *const prev_type = skip_typeref(prev_decl->type);
4126 if (!types_compatible(type, prev_type)) {
4127 errorf(pos, "declaration '%#N' is incompatible with '%#N' (declared %P)", entity, previous_entity, ppos);
4129 unsigned old_storage_class = prev_decl->storage_class;
4131 if (is_definition &&
4133 !(prev_decl->modifiers & DM_USED) &&
4134 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4135 warningf(WARN_REDUNDANT_DECLS, ppos, "unnecessary static forward declaration for '%#N'", previous_entity);
4138 storage_class_t new_storage_class = decl->storage_class;
4140 /* pretend no storage class means extern for function
4141 * declarations (except if the previous declaration is neither
4142 * none nor extern) */
4143 if (entity->kind == ENTITY_FUNCTION) {
4144 /* the previous declaration could have unspecified parameters or
4145 * be a typedef, so use the new type */
4146 if (prev_type->function.unspecified_parameters || is_definition)
4147 prev_decl->type = type;
4149 switch (old_storage_class) {
4150 case STORAGE_CLASS_NONE:
4151 old_storage_class = STORAGE_CLASS_EXTERN;
4154 case STORAGE_CLASS_EXTERN:
4155 if (is_definition) {
4156 if (prev_type->function.unspecified_parameters && !is_sym_main(symbol)) {
4157 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4159 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4160 new_storage_class = STORAGE_CLASS_EXTERN;
4167 } else if (is_type_incomplete(prev_type)) {
4168 prev_decl->type = type;
4171 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4172 new_storage_class == STORAGE_CLASS_EXTERN) {
4174 warn_redundant_declaration: ;
4176 = has_new_attributes(prev_decl->attributes,
4178 if (has_new_attrs) {
4179 merge_in_attributes(decl, prev_decl->attributes);
4180 } else if (!is_definition &&
4181 is_type_valid(prev_type) &&
4182 !pos->is_system_header) {
4183 warningf(WARN_REDUNDANT_DECLS, pos, "redundant declaration for '%Y' (declared %P)", symbol, ppos);
4185 } else if (current_function == NULL) {
4186 if (old_storage_class != STORAGE_CLASS_STATIC &&
4187 new_storage_class == STORAGE_CLASS_STATIC) {
4188 errorf(pos, "static declaration of '%Y' follows non-static declaration (declared %P)", symbol, ppos);
4189 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4190 prev_decl->storage_class = STORAGE_CLASS_NONE;
4191 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4193 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4195 goto error_redeclaration;
4196 goto warn_redundant_declaration;
4198 } else if (is_type_valid(prev_type)) {
4199 if (old_storage_class == new_storage_class) {
4200 error_redeclaration:
4201 errorf(pos, "redeclaration of '%Y' (declared %P)", symbol, ppos);
4203 errorf(pos, "redeclaration of '%Y' with different linkage (declared %P)", symbol, ppos);
4208 prev_decl->modifiers |= decl->modifiers;
4209 if (entity->kind == ENTITY_FUNCTION) {
4210 previous_entity->function.is_inline |= entity->function.is_inline;
4212 return previous_entity;
4216 if (is_warn_on(why = WARN_SHADOW) ||
4217 (is_warn_on(why = WARN_SHADOW_LOCAL) && previous_entity->base.parent_scope != file_scope)) {
4218 char const *const what = get_entity_kind_name(previous_entity->kind);
4219 warningf(why, pos, "'%N' shadows %s (declared %P)", entity, what, ppos);
4223 if (entity->kind == ENTITY_FUNCTION) {
4224 if (is_definition &&
4225 entity->declaration.storage_class != STORAGE_CLASS_STATIC &&
4226 !is_sym_main(symbol)) {
4227 if (is_warn_on(WARN_MISSING_PROTOTYPES)) {
4228 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4230 goto warn_missing_declaration;
4233 } else if (entity->kind == ENTITY_VARIABLE) {
4234 if (current_scope == file_scope &&
4235 entity->declaration.storage_class == STORAGE_CLASS_NONE &&
4236 !entity->declaration.implicit) {
4237 warn_missing_declaration:
4238 warningf(WARN_MISSING_DECLARATIONS, pos, "no previous declaration for '%#N'", entity);
4243 assert(entity->base.parent_scope == NULL);
4244 assert(current_scope != NULL);
4246 entity->base.parent_scope = current_scope;
4247 environment_push(entity);
4248 append_entity(current_scope, entity);
4253 static void parser_error_multiple_definition(entity_t *entity,
4254 const source_position_t *source_position)
4256 errorf(source_position, "multiple definition of '%Y' (declared %P)",
4257 entity->base.symbol, &entity->base.source_position);
4260 static bool is_declaration_specifier(const token_t *token)
4262 switch (token->kind) {
4266 return is_typedef_symbol(token->identifier.symbol);
4273 static void parse_init_declarator_rest(entity_t *entity)
4275 type_t *orig_type = type_error_type;
4277 if (entity->base.kind == ENTITY_TYPEDEF) {
4278 source_position_t const *const pos = &entity->base.source_position;
4279 errorf(pos, "'%N' is initialized (use __typeof__ instead)", entity);
4281 assert(is_declaration(entity));
4282 orig_type = entity->declaration.type;
4285 type_t *type = skip_typeref(orig_type);
4287 if (entity->kind == ENTITY_VARIABLE
4288 && entity->variable.initializer != NULL) {
4289 parser_error_multiple_definition(entity, HERE);
4293 declaration_t *const declaration = &entity->declaration;
4294 bool must_be_constant = false;
4295 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4296 entity->base.parent_scope == file_scope) {
4297 must_be_constant = true;
4300 if (is_type_function(type)) {
4301 source_position_t const *const pos = &entity->base.source_position;
4302 errorf(pos, "'%N' is initialized like a variable", entity);
4303 orig_type = type_error_type;
4306 parse_initializer_env_t env;
4307 env.type = orig_type;
4308 env.must_be_constant = must_be_constant;
4309 env.entity = entity;
4311 initializer_t *initializer = parse_initializer(&env);
4313 if (entity->kind == ENTITY_VARIABLE) {
4314 /* §6.7.5:22 array initializers for arrays with unknown size
4315 * determine the array type size */
4316 declaration->type = env.type;
4317 entity->variable.initializer = initializer;
4321 /* parse rest of a declaration without any declarator */
4322 static void parse_anonymous_declaration_rest(
4323 const declaration_specifiers_t *specifiers)
4326 anonymous_entity = NULL;
4328 source_position_t const *const pos = &specifiers->source_position;
4329 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4330 specifiers->thread_local) {
4331 warningf(WARN_OTHER, pos, "useless storage class in empty declaration");
4334 type_t *type = specifiers->type;
4335 switch (type->kind) {
4336 case TYPE_COMPOUND_STRUCT:
4337 case TYPE_COMPOUND_UNION: {
4338 if (type->compound.compound->base.symbol == NULL) {
4339 warningf(WARN_OTHER, pos, "unnamed struct/union that defines no instances");
4348 warningf(WARN_OTHER, pos, "empty declaration");
4353 static void check_variable_type_complete(entity_t *ent)
4355 if (ent->kind != ENTITY_VARIABLE)
4358 /* §6.7:7 If an identifier for an object is declared with no linkage, the
4359 * type for the object shall be complete [...] */
4360 declaration_t *decl = &ent->declaration;
4361 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4362 decl->storage_class == STORAGE_CLASS_STATIC)
4365 type_t *const type = skip_typeref(decl->type);
4366 if (!is_type_incomplete(type))
4369 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4370 * are given length one. */
4371 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4372 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4376 errorf(&ent->base.source_position, "variable '%#N' has incomplete type", ent);
4380 static void parse_declaration_rest(entity_t *ndeclaration,
4381 const declaration_specifiers_t *specifiers,
4382 parsed_declaration_func finished_declaration,
4383 declarator_flags_t flags)
4385 add_anchor_token(';');
4386 add_anchor_token(',');
4388 entity_t *entity = finished_declaration(ndeclaration, token.kind == '=');
4390 if (token.kind == '=') {
4391 parse_init_declarator_rest(entity);
4392 } else if (entity->kind == ENTITY_VARIABLE) {
4393 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
4394 * [...] where the extern specifier is explicitly used. */
4395 declaration_t *decl = &entity->declaration;
4396 if (decl->storage_class != STORAGE_CLASS_EXTERN) {
4397 type_t *type = decl->type;
4398 if (is_type_reference(skip_typeref(type))) {
4399 source_position_t const *const pos = &entity->base.source_position;
4400 errorf(pos, "reference '%#N' must be initialized", entity);
4405 check_variable_type_complete(entity);
4410 add_anchor_token('=');
4411 ndeclaration = parse_declarator(specifiers, flags);
4412 rem_anchor_token('=');
4414 expect(';', end_error);
4417 anonymous_entity = NULL;
4418 rem_anchor_token(';');
4419 rem_anchor_token(',');
4422 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4424 symbol_t *symbol = entity->base.symbol;
4428 assert(entity->base.namespc == NAMESPACE_NORMAL);
4429 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4430 if (previous_entity == NULL
4431 || previous_entity->base.parent_scope != current_scope) {
4432 errorf(&entity->base.source_position, "expected declaration of a function parameter, found '%Y'",
4437 if (is_definition) {
4438 errorf(HERE, "'%N' is initialised", entity);
4441 return record_entity(entity, false);
4444 static void parse_declaration(parsed_declaration_func finished_declaration,
4445 declarator_flags_t flags)
4447 add_anchor_token(';');
4448 declaration_specifiers_t specifiers;
4449 parse_declaration_specifiers(&specifiers);
4450 rem_anchor_token(';');
4452 if (token.kind == ';') {
4453 parse_anonymous_declaration_rest(&specifiers);
4455 entity_t *entity = parse_declarator(&specifiers, flags);
4456 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4461 static type_t *get_default_promoted_type(type_t *orig_type)
4463 type_t *result = orig_type;
4465 type_t *type = skip_typeref(orig_type);
4466 if (is_type_integer(type)) {
4467 result = promote_integer(type);
4468 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4469 result = type_double;
4475 static void parse_kr_declaration_list(entity_t *entity)
4477 if (entity->kind != ENTITY_FUNCTION)
4480 type_t *type = skip_typeref(entity->declaration.type);
4481 assert(is_type_function(type));
4482 if (!type->function.kr_style_parameters)
4485 add_anchor_token('{');
4487 PUSH_SCOPE(&entity->function.parameters);
4489 entity_t *parameter = entity->function.parameters.entities;
4490 for ( ; parameter != NULL; parameter = parameter->base.next) {
4491 assert(parameter->base.parent_scope == NULL);
4492 parameter->base.parent_scope = current_scope;
4493 environment_push(parameter);
4496 /* parse declaration list */
4498 switch (token.kind) {
4500 /* This covers symbols, which are no type, too, and results in
4501 * better error messages. The typical cases are misspelled type
4502 * names and missing includes. */
4504 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4514 /* update function type */
4515 type_t *new_type = duplicate_type(type);
4517 function_parameter_t *parameters = NULL;
4518 function_parameter_t **anchor = ¶meters;
4520 /* did we have an earlier prototype? */
4521 entity_t *proto_type = get_entity(entity->base.symbol, NAMESPACE_NORMAL);
4522 if (proto_type != NULL && proto_type->kind != ENTITY_FUNCTION)
4525 function_parameter_t *proto_parameter = NULL;
4526 if (proto_type != NULL) {
4527 type_t *proto_type_type = proto_type->declaration.type;
4528 proto_parameter = proto_type_type->function.parameters;
4529 /* If a K&R function definition has a variadic prototype earlier, then
4530 * make the function definition variadic, too. This should conform to
4531 * §6.7.5.3:15 and §6.9.1:8. */
4532 new_type->function.variadic = proto_type_type->function.variadic;
4534 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
4536 new_type->function.unspecified_parameters = true;
4539 bool need_incompatible_warning = false;
4540 parameter = entity->function.parameters.entities;
4541 for (; parameter != NULL; parameter = parameter->base.next,
4543 proto_parameter == NULL ? NULL : proto_parameter->next) {
4544 if (parameter->kind != ENTITY_PARAMETER)
4547 type_t *parameter_type = parameter->declaration.type;
4548 if (parameter_type == NULL) {
4549 source_position_t const* const pos = ¶meter->base.source_position;
4551 errorf(pos, "no type specified for function '%N'", parameter);
4552 parameter_type = type_error_type;
4554 warningf(WARN_IMPLICIT_INT, pos, "no type specified for function parameter '%N', using 'int'", parameter);
4555 parameter_type = type_int;
4557 parameter->declaration.type = parameter_type;
4560 semantic_parameter_incomplete(parameter);
4562 /* we need the default promoted types for the function type */
4563 type_t *not_promoted = parameter_type;
4564 parameter_type = get_default_promoted_type(parameter_type);
4566 /* gcc special: if the type of the prototype matches the unpromoted
4567 * type don't promote */
4568 if (!strict_mode && proto_parameter != NULL) {
4569 type_t *proto_p_type = skip_typeref(proto_parameter->type);
4570 type_t *promo_skip = skip_typeref(parameter_type);
4571 type_t *param_skip = skip_typeref(not_promoted);
4572 if (!types_compatible(proto_p_type, promo_skip)
4573 && types_compatible(proto_p_type, param_skip)) {
4575 need_incompatible_warning = true;
4576 parameter_type = not_promoted;
4579 function_parameter_t *const function_parameter
4580 = allocate_parameter(parameter_type);
4582 *anchor = function_parameter;
4583 anchor = &function_parameter->next;
4586 new_type->function.parameters = parameters;
4587 new_type = identify_new_type(new_type);
4589 if (need_incompatible_warning) {
4590 symbol_t const *const sym = entity->base.symbol;
4591 source_position_t const *const pos = &entity->base.source_position;
4592 source_position_t const *const ppos = &proto_type->base.source_position;
4593 warningf(WARN_OTHER, pos, "declaration '%#N' is incompatible with '%#T' (declared %P)", proto_type, new_type, sym, ppos);
4595 entity->declaration.type = new_type;
4597 rem_anchor_token('{');
4600 static bool first_err = true;
4603 * When called with first_err set, prints the name of the current function,
4606 static void print_in_function(void)
4610 char const *const file = current_function->base.base.source_position.input_name;
4611 diagnosticf("%s: In '%N':\n", file, (entity_t const*)current_function);
4616 * Check if all labels are defined in the current function.
4617 * Check if all labels are used in the current function.
4619 static void check_labels(void)
4621 for (const goto_statement_t *goto_statement = goto_first;
4622 goto_statement != NULL;
4623 goto_statement = goto_statement->next) {
4624 label_t *label = goto_statement->label;
4625 if (label->base.source_position.input_name == NULL) {
4626 print_in_function();
4627 source_position_t const *const pos = &goto_statement->base.source_position;
4628 errorf(pos, "'%N' used but not defined", (entity_t const*)label);
4632 if (is_warn_on(WARN_UNUSED_LABEL)) {
4633 for (const label_statement_t *label_statement = label_first;
4634 label_statement != NULL;
4635 label_statement = label_statement->next) {
4636 label_t *label = label_statement->label;
4638 if (! label->used) {
4639 print_in_function();
4640 source_position_t const *const pos = &label_statement->base.source_position;
4641 warningf(WARN_UNUSED_LABEL, pos, "'%N' defined but not used", (entity_t const*)label);
4647 static void warn_unused_entity(warning_t const why, entity_t *entity, entity_t *const last)
4649 entity_t const *const end = last != NULL ? last->base.next : NULL;
4650 for (; entity != end; entity = entity->base.next) {
4651 if (!is_declaration(entity))
4654 declaration_t *declaration = &entity->declaration;
4655 if (declaration->implicit)
4658 if (!declaration->used) {
4659 print_in_function();
4660 warningf(why, &entity->base.source_position, "'%N' is unused", entity);
4661 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
4662 print_in_function();
4663 warningf(why, &entity->base.source_position, "'%N' is never read", entity);
4668 static void check_unused_variables(statement_t *const stmt, void *const env)
4672 switch (stmt->kind) {
4673 case STATEMENT_DECLARATION: {
4674 declaration_statement_t const *const decls = &stmt->declaration;
4675 warn_unused_entity(WARN_UNUSED_VARIABLE, decls->declarations_begin, decls->declarations_end);
4680 warn_unused_entity(WARN_UNUSED_VARIABLE, stmt->fors.scope.entities, NULL);
4689 * Check declarations of current_function for unused entities.
4691 static void check_declarations(void)
4693 if (is_warn_on(WARN_UNUSED_PARAMETER)) {
4694 const scope_t *scope = ¤t_function->parameters;
4696 /* do not issue unused warnings for main */
4697 if (!is_sym_main(current_function->base.base.symbol)) {
4698 warn_unused_entity(WARN_UNUSED_PARAMETER, scope->entities, NULL);
4701 if (is_warn_on(WARN_UNUSED_VARIABLE)) {
4702 walk_statements(current_function->statement, check_unused_variables,
4707 static int determine_truth(expression_t const* const cond)
4710 is_constant_expression(cond) != EXPR_CLASS_CONSTANT ? 0 :
4711 fold_constant_to_bool(cond) ? 1 :
4715 static void check_reachable(statement_t *);
4716 static bool reaches_end;
4718 static bool expression_returns(expression_t const *const expr)
4720 switch (expr->kind) {
4722 expression_t const *const func = expr->call.function;
4723 type_t const *const type = skip_typeref(func->base.type);
4724 if (type->kind == TYPE_POINTER) {
4725 type_t const *const points_to
4726 = skip_typeref(type->pointer.points_to);
4727 if (points_to->kind == TYPE_FUNCTION
4728 && points_to->function.modifiers & DM_NORETURN)
4732 if (!expression_returns(func))
4735 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
4736 if (!expression_returns(arg->expression))
4743 case EXPR_REFERENCE:
4744 case EXPR_REFERENCE_ENUM_VALUE:
4745 case EXPR_LITERAL_CASES:
4746 case EXPR_STRING_LITERAL:
4747 case EXPR_WIDE_STRING_LITERAL:
4748 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
4749 case EXPR_LABEL_ADDRESS:
4750 case EXPR_CLASSIFY_TYPE:
4751 case EXPR_SIZEOF: // TODO handle obscure VLA case
4754 case EXPR_BUILTIN_CONSTANT_P:
4755 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
4760 case EXPR_STATEMENT: {
4761 bool old_reaches_end = reaches_end;
4762 reaches_end = false;
4763 check_reachable(expr->statement.statement);
4764 bool returns = reaches_end;
4765 reaches_end = old_reaches_end;
4769 case EXPR_CONDITIONAL:
4770 // TODO handle constant expression
4772 if (!expression_returns(expr->conditional.condition))
4775 if (expr->conditional.true_expression != NULL
4776 && expression_returns(expr->conditional.true_expression))
4779 return expression_returns(expr->conditional.false_expression);
4782 return expression_returns(expr->select.compound);
4784 case EXPR_ARRAY_ACCESS:
4786 expression_returns(expr->array_access.array_ref) &&
4787 expression_returns(expr->array_access.index);
4790 return expression_returns(expr->va_starte.ap);
4793 return expression_returns(expr->va_arge.ap);
4796 return expression_returns(expr->va_copye.src);
4798 case EXPR_UNARY_CASES_MANDATORY:
4799 return expression_returns(expr->unary.value);
4801 case EXPR_UNARY_THROW:
4804 case EXPR_BINARY_CASES:
4805 // TODO handle constant lhs of && and ||
4807 expression_returns(expr->binary.left) &&
4808 expression_returns(expr->binary.right);
4811 panic("unhandled expression");
4814 static bool initializer_returns(initializer_t const *const init)
4816 switch (init->kind) {
4817 case INITIALIZER_VALUE:
4818 return expression_returns(init->value.value);
4820 case INITIALIZER_LIST: {
4821 initializer_t * const* i = init->list.initializers;
4822 initializer_t * const* const end = i + init->list.len;
4823 bool returns = true;
4824 for (; i != end; ++i) {
4825 if (!initializer_returns(*i))
4831 case INITIALIZER_STRING:
4832 case INITIALIZER_WIDE_STRING:
4833 case INITIALIZER_DESIGNATOR: // designators have no payload
4836 panic("unhandled initializer");
4839 static bool noreturn_candidate;
4841 static void check_reachable(statement_t *const stmt)
4843 if (stmt->base.reachable)
4845 if (stmt->kind != STATEMENT_DO_WHILE)
4846 stmt->base.reachable = true;
4848 statement_t *last = stmt;
4850 switch (stmt->kind) {
4851 case STATEMENT_ERROR:
4852 case STATEMENT_EMPTY:
4854 next = stmt->base.next;
4857 case STATEMENT_DECLARATION: {
4858 declaration_statement_t const *const decl = &stmt->declaration;
4859 entity_t const * ent = decl->declarations_begin;
4860 entity_t const *const last_decl = decl->declarations_end;
4862 for (;; ent = ent->base.next) {
4863 if (ent->kind == ENTITY_VARIABLE &&
4864 ent->variable.initializer != NULL &&
4865 !initializer_returns(ent->variable.initializer)) {
4868 if (ent == last_decl)
4872 next = stmt->base.next;
4876 case STATEMENT_COMPOUND:
4877 next = stmt->compound.statements;
4879 next = stmt->base.next;
4882 case STATEMENT_RETURN: {
4883 expression_t const *const val = stmt->returns.value;
4884 if (val == NULL || expression_returns(val))
4885 noreturn_candidate = false;
4889 case STATEMENT_IF: {
4890 if_statement_t const *const ifs = &stmt->ifs;
4891 expression_t const *const cond = ifs->condition;
4893 if (!expression_returns(cond))
4896 int const val = determine_truth(cond);
4899 check_reachable(ifs->true_statement);
4904 if (ifs->false_statement != NULL) {
4905 check_reachable(ifs->false_statement);
4909 next = stmt->base.next;
4913 case STATEMENT_SWITCH: {
4914 switch_statement_t const *const switchs = &stmt->switchs;
4915 expression_t const *const expr = switchs->expression;
4917 if (!expression_returns(expr))
4920 if (is_constant_expression(expr) == EXPR_CLASS_CONSTANT) {
4921 long const val = fold_constant_to_int(expr);
4922 case_label_statement_t * defaults = NULL;
4923 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4924 if (i->expression == NULL) {
4929 if (i->first_case <= val && val <= i->last_case) {
4930 check_reachable((statement_t*)i);
4935 if (defaults != NULL) {
4936 check_reachable((statement_t*)defaults);
4940 bool has_default = false;
4941 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4942 if (i->expression == NULL)
4945 check_reachable((statement_t*)i);
4952 next = stmt->base.next;
4956 case STATEMENT_EXPRESSION: {
4957 /* Check for noreturn function call */
4958 expression_t const *const expr = stmt->expression.expression;
4959 if (!expression_returns(expr))
4962 next = stmt->base.next;
4966 case STATEMENT_CONTINUE:
4967 for (statement_t *parent = stmt;;) {
4968 parent = parent->base.parent;
4969 if (parent == NULL) /* continue not within loop */
4973 switch (parent->kind) {
4974 case STATEMENT_WHILE: goto continue_while;
4975 case STATEMENT_DO_WHILE: goto continue_do_while;
4976 case STATEMENT_FOR: goto continue_for;
4982 case STATEMENT_BREAK:
4983 for (statement_t *parent = stmt;;) {
4984 parent = parent->base.parent;
4985 if (parent == NULL) /* break not within loop/switch */
4988 switch (parent->kind) {
4989 case STATEMENT_SWITCH:
4990 case STATEMENT_WHILE:
4991 case STATEMENT_DO_WHILE:
4994 next = parent->base.next;
4995 goto found_break_parent;
5003 case STATEMENT_COMPUTED_GOTO: {
5004 if (!expression_returns(stmt->computed_goto.expression))
5007 statement_t *parent = stmt->base.parent;
5008 if (parent == NULL) /* top level goto */
5014 case STATEMENT_GOTO:
5015 next = stmt->gotos.label->statement;
5016 if (next == NULL) /* missing label */
5020 case STATEMENT_LABEL:
5021 next = stmt->label.statement;
5024 case STATEMENT_CASE_LABEL:
5025 next = stmt->case_label.statement;
5028 case STATEMENT_WHILE: {
5029 while_statement_t const *const whiles = &stmt->whiles;
5030 expression_t const *const cond = whiles->condition;
5032 if (!expression_returns(cond))
5035 int const val = determine_truth(cond);
5038 check_reachable(whiles->body);
5043 next = stmt->base.next;
5047 case STATEMENT_DO_WHILE:
5048 next = stmt->do_while.body;
5051 case STATEMENT_FOR: {
5052 for_statement_t *const fors = &stmt->fors;
5054 if (fors->condition_reachable)
5056 fors->condition_reachable = true;
5058 expression_t const *const cond = fors->condition;
5063 } else if (expression_returns(cond)) {
5064 val = determine_truth(cond);
5070 check_reachable(fors->body);
5075 next = stmt->base.next;
5079 case STATEMENT_MS_TRY: {
5080 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5081 check_reachable(ms_try->try_statement);
5082 next = ms_try->final_statement;
5086 case STATEMENT_LEAVE: {
5087 statement_t *parent = stmt;
5089 parent = parent->base.parent;
5090 if (parent == NULL) /* __leave not within __try */
5093 if (parent->kind == STATEMENT_MS_TRY) {
5095 next = parent->ms_try.final_statement;
5103 panic("invalid statement kind");
5106 while (next == NULL) {
5107 next = last->base.parent;
5109 noreturn_candidate = false;
5111 type_t *const type = skip_typeref(current_function->base.type);
5112 assert(is_type_function(type));
5113 type_t *const ret = skip_typeref(type->function.return_type);
5114 if (!is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
5115 is_type_valid(ret) &&
5116 !is_sym_main(current_function->base.base.symbol)) {
5117 source_position_t const *const pos = &stmt->base.source_position;
5118 warningf(WARN_RETURN_TYPE, pos, "control reaches end of non-void function");
5123 switch (next->kind) {
5124 case STATEMENT_ERROR:
5125 case STATEMENT_EMPTY:
5126 case STATEMENT_DECLARATION:
5127 case STATEMENT_EXPRESSION:
5129 case STATEMENT_RETURN:
5130 case STATEMENT_CONTINUE:
5131 case STATEMENT_BREAK:
5132 case STATEMENT_COMPUTED_GOTO:
5133 case STATEMENT_GOTO:
5134 case STATEMENT_LEAVE:
5135 panic("invalid control flow in function");
5137 case STATEMENT_COMPOUND:
5138 if (next->compound.stmt_expr) {
5144 case STATEMENT_SWITCH:
5145 case STATEMENT_LABEL:
5146 case STATEMENT_CASE_LABEL:
5148 next = next->base.next;
5151 case STATEMENT_WHILE: {
5153 if (next->base.reachable)
5155 next->base.reachable = true;
5157 while_statement_t const *const whiles = &next->whiles;
5158 expression_t const *const cond = whiles->condition;
5160 if (!expression_returns(cond))
5163 int const val = determine_truth(cond);
5166 check_reachable(whiles->body);
5172 next = next->base.next;
5176 case STATEMENT_DO_WHILE: {
5178 if (next->base.reachable)
5180 next->base.reachable = true;
5182 do_while_statement_t const *const dw = &next->do_while;
5183 expression_t const *const cond = dw->condition;
5185 if (!expression_returns(cond))
5188 int const val = determine_truth(cond);
5191 check_reachable(dw->body);
5197 next = next->base.next;
5201 case STATEMENT_FOR: {
5203 for_statement_t *const fors = &next->fors;
5205 fors->step_reachable = true;
5207 if (fors->condition_reachable)
5209 fors->condition_reachable = true;
5211 expression_t const *const cond = fors->condition;
5216 } else if (expression_returns(cond)) {
5217 val = determine_truth(cond);
5223 check_reachable(fors->body);
5229 next = next->base.next;
5233 case STATEMENT_MS_TRY:
5235 next = next->ms_try.final_statement;
5240 check_reachable(next);
5243 static void check_unreachable(statement_t* const stmt, void *const env)
5247 switch (stmt->kind) {
5248 case STATEMENT_DO_WHILE:
5249 if (!stmt->base.reachable) {
5250 expression_t const *const cond = stmt->do_while.condition;
5251 if (determine_truth(cond) >= 0) {
5252 source_position_t const *const pos = &cond->base.source_position;
5253 warningf(WARN_UNREACHABLE_CODE, pos, "condition of do-while-loop is unreachable");
5258 case STATEMENT_FOR: {
5259 for_statement_t const* const fors = &stmt->fors;
5261 // if init and step are unreachable, cond is unreachable, too
5262 if (!stmt->base.reachable && !fors->step_reachable) {
5263 goto warn_unreachable;
5265 if (!stmt->base.reachable && fors->initialisation != NULL) {
5266 source_position_t const *const pos = &fors->initialisation->base.source_position;
5267 warningf(WARN_UNREACHABLE_CODE, pos, "initialisation of for-statement is unreachable");
5270 if (!fors->condition_reachable && fors->condition != NULL) {
5271 source_position_t const *const pos = &fors->condition->base.source_position;
5272 warningf(WARN_UNREACHABLE_CODE, pos, "condition of for-statement is unreachable");
5275 if (!fors->step_reachable && fors->step != NULL) {
5276 source_position_t const *const pos = &fors->step->base.source_position;
5277 warningf(WARN_UNREACHABLE_CODE, pos, "step of for-statement is unreachable");
5283 case STATEMENT_COMPOUND:
5284 if (stmt->compound.statements != NULL)
5286 goto warn_unreachable;
5288 case STATEMENT_DECLARATION: {
5289 /* Only warn if there is at least one declarator with an initializer.
5290 * This typically occurs in switch statements. */
5291 declaration_statement_t const *const decl = &stmt->declaration;
5292 entity_t const * ent = decl->declarations_begin;
5293 entity_t const *const last = decl->declarations_end;
5295 for (;; ent = ent->base.next) {
5296 if (ent->kind == ENTITY_VARIABLE &&
5297 ent->variable.initializer != NULL) {
5298 goto warn_unreachable;
5308 if (!stmt->base.reachable) {
5309 source_position_t const *const pos = &stmt->base.source_position;
5310 warningf(WARN_UNREACHABLE_CODE, pos, "statement is unreachable");
5316 static bool is_main(entity_t *entity)
5318 static symbol_t *sym_main = NULL;
5319 if (sym_main == NULL) {
5320 sym_main = symbol_table_insert("main");
5323 if (entity->base.symbol != sym_main)
5325 /* must be in outermost scope */
5326 if (entity->base.parent_scope != file_scope)
5332 static void parse_external_declaration(void)
5334 /* function-definitions and declarations both start with declaration
5336 add_anchor_token(';');
5337 declaration_specifiers_t specifiers;
5338 parse_declaration_specifiers(&specifiers);
5339 rem_anchor_token(';');
5341 /* must be a declaration */
5342 if (token.kind == ';') {
5343 parse_anonymous_declaration_rest(&specifiers);
5347 add_anchor_token(',');
5348 add_anchor_token('=');
5349 add_anchor_token(';');
5350 add_anchor_token('{');
5352 /* declarator is common to both function-definitions and declarations */
5353 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
5355 rem_anchor_token('{');
5356 rem_anchor_token(';');
5357 rem_anchor_token('=');
5358 rem_anchor_token(',');
5360 /* must be a declaration */
5361 switch (token.kind) {
5365 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
5370 /* must be a function definition */
5371 parse_kr_declaration_list(ndeclaration);
5373 if (token.kind != '{') {
5374 parse_error_expected("while parsing function definition", '{', NULL);
5375 eat_until_matching_token(';');
5379 assert(is_declaration(ndeclaration));
5380 type_t *const orig_type = ndeclaration->declaration.type;
5381 type_t * type = skip_typeref(orig_type);
5383 if (!is_type_function(type)) {
5384 if (is_type_valid(type)) {
5385 errorf(HERE, "declarator '%#N' has a body but is not a function type", ndeclaration);
5391 source_position_t const *const pos = &ndeclaration->base.source_position;
5392 if (is_typeref(orig_type)) {
5394 errorf(pos, "type of function definition '%#N' is a typedef", ndeclaration);
5397 if (is_type_compound(skip_typeref(type->function.return_type))) {
5398 warningf(WARN_AGGREGATE_RETURN, pos, "'%N' returns an aggregate", ndeclaration);
5400 if (type->function.unspecified_parameters) {
5401 warningf(WARN_OLD_STYLE_DEFINITION, pos, "old-style definition of '%N'", ndeclaration);
5403 warningf(WARN_TRADITIONAL, pos, "traditional C rejects ISO C style definition of '%N'", ndeclaration);
5406 /* §6.7.5.3:14 a function definition with () means no
5407 * parameters (and not unspecified parameters) */
5408 if (type->function.unspecified_parameters &&
5409 type->function.parameters == NULL) {
5410 type_t *copy = duplicate_type(type);
5411 copy->function.unspecified_parameters = false;
5412 type = identify_new_type(copy);
5414 ndeclaration->declaration.type = type;
5417 entity_t *const entity = record_entity(ndeclaration, true);
5418 assert(entity->kind == ENTITY_FUNCTION);
5419 assert(ndeclaration->kind == ENTITY_FUNCTION);
5421 function_t *const function = &entity->function;
5422 if (ndeclaration != entity) {
5423 function->parameters = ndeclaration->function.parameters;
5425 assert(is_declaration(entity));
5426 type = skip_typeref(entity->declaration.type);
5428 PUSH_SCOPE(&function->parameters);
5430 entity_t *parameter = function->parameters.entities;
5431 for (; parameter != NULL; parameter = parameter->base.next) {
5432 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5433 parameter->base.parent_scope = current_scope;
5435 assert(parameter->base.parent_scope == NULL
5436 || parameter->base.parent_scope == current_scope);
5437 parameter->base.parent_scope = current_scope;
5438 if (parameter->base.symbol == NULL) {
5439 errorf(¶meter->base.source_position, "parameter name omitted");
5442 environment_push(parameter);
5445 if (function->statement != NULL) {
5446 parser_error_multiple_definition(entity, HERE);
5449 /* parse function body */
5450 int label_stack_top = label_top();
5451 function_t *old_current_function = current_function;
5452 entity_t *old_current_entity = current_entity;
5453 current_function = function;
5454 current_entity = entity;
5458 goto_anchor = &goto_first;
5460 label_anchor = &label_first;
5462 statement_t *const body = parse_compound_statement(false);
5463 function->statement = body;
5466 check_declarations();
5467 if (is_warn_on(WARN_RETURN_TYPE) ||
5468 is_warn_on(WARN_UNREACHABLE_CODE) ||
5469 (is_warn_on(WARN_MISSING_NORETURN) && !(function->base.modifiers & DM_NORETURN))) {
5470 noreturn_candidate = true;
5471 check_reachable(body);
5472 if (is_warn_on(WARN_UNREACHABLE_CODE))
5473 walk_statements(body, check_unreachable, NULL);
5474 if (noreturn_candidate &&
5475 !(function->base.modifiers & DM_NORETURN)) {
5476 source_position_t const *const pos = &body->base.source_position;
5477 warningf(WARN_MISSING_NORETURN, pos, "function '%#N' is candidate for attribute 'noreturn'", entity);
5481 if (is_main(entity) && enable_main_collect2_hack)
5482 prepare_main_collect2(entity);
5485 assert(current_function == function);
5486 assert(current_entity == entity);
5487 current_entity = old_current_entity;
5488 current_function = old_current_function;
5489 label_pop_to(label_stack_top);
5495 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
5497 entity_t *iter = compound->members.entities;
5498 for (; iter != NULL; iter = iter->base.next) {
5499 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5502 if (iter->base.symbol == symbol) {
5504 } else if (iter->base.symbol == NULL) {
5505 /* search in anonymous structs and unions */
5506 type_t *type = skip_typeref(iter->declaration.type);
5507 if (is_type_compound(type)) {
5508 if (find_compound_entry(type->compound.compound, symbol)
5519 static void check_deprecated(const source_position_t *source_position,
5520 const entity_t *entity)
5522 if (!is_declaration(entity))
5524 if ((entity->declaration.modifiers & DM_DEPRECATED) == 0)
5527 source_position_t const *const epos = &entity->base.source_position;
5528 char const *const msg = get_deprecated_string(entity->declaration.attributes);
5530 warningf(WARN_DEPRECATED_DECLARATIONS, source_position, "'%N' is deprecated (declared %P): \"%s\"", entity, epos, msg);
5532 warningf(WARN_DEPRECATED_DECLARATIONS, source_position, "'%N' is deprecated (declared %P)", entity, epos);
5537 static expression_t *create_select(const source_position_t *pos,
5539 type_qualifiers_t qualifiers,
5542 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
5544 check_deprecated(pos, entry);
5546 expression_t *select = allocate_expression_zero(EXPR_SELECT);
5547 select->select.compound = addr;
5548 select->select.compound_entry = entry;
5550 type_t *entry_type = entry->declaration.type;
5551 type_t *res_type = get_qualified_type(entry_type, qualifiers);
5553 /* bitfields need special treatment */
5554 if (entry->compound_member.bitfield) {
5555 unsigned bit_size = entry->compound_member.bit_size;
5556 /* if fewer bits than an int, convert to int (see §6.3.1.1) */
5557 if (bit_size < get_atomic_type_size(ATOMIC_TYPE_INT) * BITS_PER_BYTE) {
5558 res_type = type_int;
5562 /* we always do the auto-type conversions; the & and sizeof parser contains
5563 * code to revert this! */
5564 select->base.type = automatic_type_conversion(res_type);
5571 * Find entry with symbol in compound. Search anonymous structs and unions and
5572 * creates implicit select expressions for them.
5573 * Returns the adress for the innermost compound.
5575 static expression_t *find_create_select(const source_position_t *pos,
5577 type_qualifiers_t qualifiers,
5578 compound_t *compound, symbol_t *symbol)
5580 entity_t *iter = compound->members.entities;
5581 for (; iter != NULL; iter = iter->base.next) {
5582 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5585 symbol_t *iter_symbol = iter->base.symbol;
5586 if (iter_symbol == NULL) {
5587 type_t *type = iter->declaration.type;
5588 if (type->kind != TYPE_COMPOUND_STRUCT
5589 && type->kind != TYPE_COMPOUND_UNION)
5592 compound_t *sub_compound = type->compound.compound;
5594 if (find_compound_entry(sub_compound, symbol) == NULL)
5597 expression_t *sub_addr = create_select(pos, addr, qualifiers, iter);
5598 sub_addr->base.source_position = *pos;
5599 sub_addr->base.implicit = true;
5600 return find_create_select(pos, sub_addr, qualifiers, sub_compound,
5604 if (iter_symbol == symbol) {
5605 return create_select(pos, addr, qualifiers, iter);
5612 static void parse_bitfield_member(entity_t *entity)
5616 expression_t *size = parse_constant_expression();
5619 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5620 type_t *type = entity->declaration.type;
5621 if (!is_type_integer(skip_typeref(type))) {
5622 errorf(HERE, "bitfield base type '%T' is not an integer type",
5626 if (is_constant_expression(size) != EXPR_CLASS_CONSTANT) {
5627 /* error already reported by parse_constant_expression */
5628 size_long = get_type_size(type) * 8;
5630 size_long = fold_constant_to_int(size);
5632 const symbol_t *symbol = entity->base.symbol;
5633 const symbol_t *user_symbol
5634 = symbol == NULL ? sym_anonymous : symbol;
5635 unsigned bit_size = get_type_size(type) * 8;
5636 if (size_long < 0) {
5637 errorf(HERE, "negative width in bit-field '%Y'", user_symbol);
5638 } else if (size_long == 0 && symbol != NULL) {
5639 errorf(HERE, "zero width for bit-field '%Y'", user_symbol);
5640 } else if (bit_size > 0 && (unsigned)size_long > bit_size) {
5641 errorf(HERE, "width of bitfield '%Y' exceeds its type",
5644 /* hope that people don't invent crazy types with more bits
5645 * than our struct can hold */
5647 (1 << sizeof(entity->compound_member.bit_size)*8));
5651 entity->compound_member.bitfield = true;
5652 entity->compound_member.bit_size = (unsigned char)size_long;
5655 static void parse_compound_declarators(compound_t *compound,
5656 const declaration_specifiers_t *specifiers)
5661 if (token.kind == ':') {
5662 /* anonymous bitfield */
5663 type_t *type = specifiers->type;
5664 entity_t *entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER,
5665 NAMESPACE_NORMAL, NULL);
5666 entity->base.source_position = *HERE;
5667 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
5668 entity->declaration.storage_class = STORAGE_CLASS_NONE;
5669 entity->declaration.type = type;
5671 parse_bitfield_member(entity);
5673 attribute_t *attributes = parse_attributes(NULL);
5674 attribute_t **anchor = &attributes;
5675 while (*anchor != NULL)
5676 anchor = &(*anchor)->next;
5677 *anchor = specifiers->attributes;
5678 if (attributes != NULL) {
5679 handle_entity_attributes(attributes, entity);
5681 entity->declaration.attributes = attributes;
5683 append_entity(&compound->members, entity);
5685 entity = parse_declarator(specifiers,
5686 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
5687 source_position_t const *const pos = &entity->base.source_position;
5688 if (entity->kind == ENTITY_TYPEDEF) {
5689 errorf(pos, "typedef not allowed as compound member");
5691 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5693 /* make sure we don't define a symbol multiple times */
5694 symbol_t *symbol = entity->base.symbol;
5695 if (symbol != NULL) {
5696 entity_t *prev = find_compound_entry(compound, symbol);
5698 source_position_t const *const ppos = &prev->base.source_position;
5699 errorf(pos, "multiple declarations of symbol '%Y' (declared %P)", symbol, ppos);
5703 if (token.kind == ':') {
5704 parse_bitfield_member(entity);
5706 attribute_t *attributes = parse_attributes(NULL);
5707 handle_entity_attributes(attributes, entity);
5709 type_t *orig_type = entity->declaration.type;
5710 type_t *type = skip_typeref(orig_type);
5711 if (is_type_function(type)) {
5712 errorf(pos, "'%N' must not have function type '%T'", entity, orig_type);
5713 } else if (is_type_incomplete(type)) {
5714 /* §6.7.2.1:16 flexible array member */
5715 if (!is_type_array(type) ||
5716 token.kind != ';' ||
5717 look_ahead(1)->kind != '}') {
5718 errorf(pos, "'%N' has incomplete type '%T'", entity, orig_type);
5719 } else if (compound->members.entities == NULL) {
5720 errorf(pos, "flexible array member in otherwise empty struct");
5725 append_entity(&compound->members, entity);
5728 } while (next_if(','));
5729 expect(';', end_error);
5732 anonymous_entity = NULL;
5735 static void parse_compound_type_entries(compound_t *compound)
5738 add_anchor_token('}');
5741 switch (token.kind) {
5743 case T___extension__:
5744 case T_IDENTIFIER: {
5746 declaration_specifiers_t specifiers;
5747 parse_declaration_specifiers(&specifiers);
5748 parse_compound_declarators(compound, &specifiers);
5754 rem_anchor_token('}');
5755 expect('}', end_error);
5758 compound->complete = true;
5764 static type_t *parse_typename(void)
5766 declaration_specifiers_t specifiers;
5767 parse_declaration_specifiers(&specifiers);
5768 if (specifiers.storage_class != STORAGE_CLASS_NONE
5769 || specifiers.thread_local) {
5770 /* TODO: improve error message, user does probably not know what a
5771 * storage class is...
5773 errorf(&specifiers.source_position, "typename must not have a storage class");
5776 type_t *result = parse_abstract_declarator(specifiers.type);
5784 typedef expression_t* (*parse_expression_function)(void);
5785 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
5787 typedef struct expression_parser_function_t expression_parser_function_t;
5788 struct expression_parser_function_t {
5789 parse_expression_function parser;
5790 precedence_t infix_precedence;
5791 parse_expression_infix_function infix_parser;
5794 static expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5797 * Prints an error message if an expression was expected but not read
5799 static expression_t *expected_expression_error(void)
5801 /* skip the error message if the error token was read */
5802 if (token.kind != T_ERROR) {
5803 errorf(HERE, "expected expression, got token %K", &token);
5807 return create_error_expression();
5810 static type_t *get_string_type(void)
5812 return is_warn_on(WARN_WRITE_STRINGS) ? type_const_char_ptr : type_char_ptr;
5815 static type_t *get_wide_string_type(void)
5817 return is_warn_on(WARN_WRITE_STRINGS) ? type_const_wchar_t_ptr : type_wchar_t_ptr;
5821 * Parse a string constant.
5823 static expression_t *parse_string_literal(void)
5825 source_position_t begin = token.base.source_position;
5826 string_t res = token.string.string;
5827 bool is_wide = (token.kind == T_WIDE_STRING_LITERAL);
5830 while (token.kind == T_STRING_LITERAL
5831 || token.kind == T_WIDE_STRING_LITERAL) {
5832 warn_string_concat(&token.base.source_position);
5833 res = concat_strings(&res, &token.string.string);
5835 is_wide |= token.kind == T_WIDE_STRING_LITERAL;
5838 expression_t *literal;
5840 literal = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
5841 literal->base.type = get_wide_string_type();
5843 literal = allocate_expression_zero(EXPR_STRING_LITERAL);
5844 literal->base.type = get_string_type();
5846 literal->base.source_position = begin;
5847 literal->literal.value = res;
5853 * Parse a boolean constant.
5855 static expression_t *parse_boolean_literal(bool value)
5857 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_BOOLEAN);
5858 literal->base.type = type_bool;
5859 literal->literal.value.begin = value ? "true" : "false";
5860 literal->literal.value.size = value ? 4 : 5;
5866 static void warn_traditional_suffix(void)
5868 warningf(WARN_TRADITIONAL, HERE, "traditional C rejects the '%S' suffix",
5869 &token.number.suffix);
5872 static void check_integer_suffix(void)
5874 const string_t *suffix = &token.number.suffix;
5875 if (suffix->size == 0)
5878 bool not_traditional = false;
5879 const char *c = suffix->begin;
5880 if (*c == 'l' || *c == 'L') {
5883 not_traditional = true;
5885 if (*c == 'u' || *c == 'U') {
5888 } else if (*c == 'u' || *c == 'U') {
5889 not_traditional = true;
5892 } else if (*c == 'u' || *c == 'U') {
5893 not_traditional = true;
5895 if (*c == 'l' || *c == 'L') {
5903 errorf(&token.base.source_position,
5904 "invalid suffix '%S' on integer constant", suffix);
5905 } else if (not_traditional) {
5906 warn_traditional_suffix();
5910 static type_t *check_floatingpoint_suffix(void)
5912 const string_t *suffix = &token.number.suffix;
5913 type_t *type = type_double;
5914 if (suffix->size == 0)
5917 bool not_traditional = false;
5918 const char *c = suffix->begin;
5919 if (*c == 'f' || *c == 'F') {
5922 } else if (*c == 'l' || *c == 'L') {
5924 type = type_long_double;
5927 errorf(&token.base.source_position,
5928 "invalid suffix '%S' on floatingpoint constant", suffix);
5929 } else if (not_traditional) {
5930 warn_traditional_suffix();
5937 * Parse an integer constant.
5939 static expression_t *parse_number_literal(void)
5941 expression_kind_t kind;
5944 switch (token.kind) {
5946 kind = EXPR_LITERAL_INTEGER;
5947 check_integer_suffix();
5950 case T_INTEGER_OCTAL:
5951 kind = EXPR_LITERAL_INTEGER_OCTAL;
5952 check_integer_suffix();
5955 case T_INTEGER_HEXADECIMAL:
5956 kind = EXPR_LITERAL_INTEGER_HEXADECIMAL;
5957 check_integer_suffix();
5960 case T_FLOATINGPOINT:
5961 kind = EXPR_LITERAL_FLOATINGPOINT;
5962 type = check_floatingpoint_suffix();
5964 case T_FLOATINGPOINT_HEXADECIMAL:
5965 kind = EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL;
5966 type = check_floatingpoint_suffix();
5969 panic("unexpected token type in parse_number_literal");
5972 expression_t *literal = allocate_expression_zero(kind);
5973 literal->base.type = type;
5974 literal->literal.value = token.number.number;
5975 literal->literal.suffix = token.number.suffix;
5978 /* integer type depends on the size of the number and the size
5979 * representable by the types. The backend/codegeneration has to determine
5982 determine_literal_type(&literal->literal);
5987 * Parse a character constant.
5989 static expression_t *parse_character_constant(void)
5991 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_CHARACTER);
5992 literal->base.type = c_mode & _CXX ? type_char : type_int;
5993 literal->literal.value = token.string.string;
5995 size_t len = literal->literal.value.size;
5997 if (!GNU_MODE && !(c_mode & _C99)) {
5998 errorf(HERE, "more than 1 character in character constant");
6000 literal->base.type = type_int;
6001 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
6010 * Parse a wide character constant.
6012 static expression_t *parse_wide_character_constant(void)
6014 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_WIDE_CHARACTER);
6015 literal->base.type = type_int;
6016 literal->literal.value = token.string.string;
6018 size_t len = wstrlen(&literal->literal.value);
6020 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
6027 static entity_t *create_implicit_function(symbol_t *symbol,
6028 const source_position_t *source_position)
6030 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
6031 ntype->function.return_type = type_int;
6032 ntype->function.unspecified_parameters = true;
6033 ntype->function.linkage = LINKAGE_C;
6034 type_t *type = identify_new_type(ntype);
6036 entity_t *const entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, symbol);
6037 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
6038 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
6039 entity->declaration.type = type;
6040 entity->declaration.implicit = true;
6041 entity->base.source_position = *source_position;
6043 if (current_scope != NULL)
6044 record_entity(entity, false);
6050 * Performs automatic type cast as described in §6.3.2.1.
6052 * @param orig_type the original type
6054 static type_t *automatic_type_conversion(type_t *orig_type)
6056 type_t *type = skip_typeref(orig_type);
6057 if (is_type_array(type)) {
6058 array_type_t *array_type = &type->array;
6059 type_t *element_type = array_type->element_type;
6060 unsigned qualifiers = array_type->base.qualifiers;
6062 return make_pointer_type(element_type, qualifiers);
6065 if (is_type_function(type)) {
6066 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6073 * reverts the automatic casts of array to pointer types and function
6074 * to function-pointer types as defined §6.3.2.1
6076 type_t *revert_automatic_type_conversion(const expression_t *expression)
6078 switch (expression->kind) {
6079 case EXPR_REFERENCE: {
6080 entity_t *entity = expression->reference.entity;
6081 if (is_declaration(entity)) {
6082 return entity->declaration.type;
6083 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6084 return entity->enum_value.enum_type;
6086 panic("no declaration or enum in reference");
6091 entity_t *entity = expression->select.compound_entry;
6092 assert(is_declaration(entity));
6093 type_t *type = entity->declaration.type;
6094 return get_qualified_type(type, expression->base.type->base.qualifiers);
6097 case EXPR_UNARY_DEREFERENCE: {
6098 const expression_t *const value = expression->unary.value;
6099 type_t *const type = skip_typeref(value->base.type);
6100 if (!is_type_pointer(type))
6101 return type_error_type;
6102 return type->pointer.points_to;
6105 case EXPR_ARRAY_ACCESS: {
6106 const expression_t *array_ref = expression->array_access.array_ref;
6107 type_t *type_left = skip_typeref(array_ref->base.type);
6108 if (!is_type_pointer(type_left))
6109 return type_error_type;
6110 return type_left->pointer.points_to;
6113 case EXPR_STRING_LITERAL: {
6114 size_t size = expression->string_literal.value.size;
6115 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6118 case EXPR_WIDE_STRING_LITERAL: {
6119 size_t size = wstrlen(&expression->string_literal.value);
6120 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6123 case EXPR_COMPOUND_LITERAL:
6124 return expression->compound_literal.type;
6129 return expression->base.type;
6133 * Find an entity matching a symbol in a scope.
6134 * Uses current scope if scope is NULL
6136 static entity_t *lookup_entity(const scope_t *scope, symbol_t *symbol,
6137 namespace_tag_t namespc)
6139 if (scope == NULL) {
6140 return get_entity(symbol, namespc);
6143 /* we should optimize here, if scope grows above a certain size we should
6144 construct a hashmap here... */
6145 entity_t *entity = scope->entities;
6146 for ( ; entity != NULL; entity = entity->base.next) {
6147 if (entity->base.symbol == symbol
6148 && (namespace_tag_t)entity->base.namespc == namespc)
6155 static entity_t *parse_qualified_identifier(void)
6157 /* namespace containing the symbol */
6159 source_position_t pos;
6160 const scope_t *lookup_scope = NULL;
6162 if (next_if(T_COLONCOLON))
6163 lookup_scope = &unit->scope;
6167 if (token.kind != T_IDENTIFIER) {
6168 parse_error_expected("while parsing identifier", T_IDENTIFIER, NULL);
6169 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6171 symbol = token.identifier.symbol;
6176 entity = lookup_entity(lookup_scope, symbol, NAMESPACE_NORMAL);
6178 if (!next_if(T_COLONCOLON))
6181 switch (entity->kind) {
6182 case ENTITY_NAMESPACE:
6183 lookup_scope = &entity->namespacee.members;
6188 lookup_scope = &entity->compound.members;
6191 errorf(&pos, "'%Y' must be a namespace, class, struct or union (but is a %s)",
6192 symbol, get_entity_kind_name(entity->kind));
6194 /* skip further qualifications */
6195 while (next_if(T_IDENTIFIER) && next_if(T_COLONCOLON)) {}
6197 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6201 if (entity == NULL) {
6202 if (!strict_mode && token.kind == '(') {
6203 /* an implicitly declared function */
6204 warningf(WARN_IMPLICIT_FUNCTION_DECLARATION, &pos,
6205 "implicit declaration of function '%Y'", symbol);
6206 entity = create_implicit_function(symbol, &pos);
6208 errorf(&pos, "unknown identifier '%Y' found.", symbol);
6209 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6216 static expression_t *parse_reference(void)
6218 source_position_t const pos = token.base.source_position;
6219 entity_t *const entity = parse_qualified_identifier();
6222 if (is_declaration(entity)) {
6223 orig_type = entity->declaration.type;
6224 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6225 orig_type = entity->enum_value.enum_type;
6227 panic("expected declaration or enum value in reference");
6230 /* we always do the auto-type conversions; the & and sizeof parser contains
6231 * code to revert this! */
6232 type_t *type = automatic_type_conversion(orig_type);
6234 expression_kind_t kind = EXPR_REFERENCE;
6235 if (entity->kind == ENTITY_ENUM_VALUE)
6236 kind = EXPR_REFERENCE_ENUM_VALUE;
6238 expression_t *expression = allocate_expression_zero(kind);
6239 expression->base.source_position = pos;
6240 expression->base.type = type;
6241 expression->reference.entity = entity;
6243 /* this declaration is used */
6244 if (is_declaration(entity)) {
6245 entity->declaration.used = true;
6248 if (entity->base.parent_scope != file_scope
6249 && (current_function != NULL
6250 && entity->base.parent_scope->depth < current_function->parameters.depth)
6251 && (entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER)) {
6252 if (entity->kind == ENTITY_VARIABLE) {
6253 /* access of a variable from an outer function */
6254 entity->variable.address_taken = true;
6255 } else if (entity->kind == ENTITY_PARAMETER) {
6256 entity->parameter.address_taken = true;
6258 current_function->need_closure = true;
6261 check_deprecated(&pos, entity);
6266 static bool semantic_cast(expression_t *cast)
6268 expression_t *expression = cast->unary.value;
6269 type_t *orig_dest_type = cast->base.type;
6270 type_t *orig_type_right = expression->base.type;
6271 type_t const *dst_type = skip_typeref(orig_dest_type);
6272 type_t const *src_type = skip_typeref(orig_type_right);
6273 source_position_t const *pos = &cast->base.source_position;
6275 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6276 if (dst_type == type_void)
6279 /* only integer and pointer can be casted to pointer */
6280 if (is_type_pointer(dst_type) &&
6281 !is_type_pointer(src_type) &&
6282 !is_type_integer(src_type) &&
6283 is_type_valid(src_type)) {
6284 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6288 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6289 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6293 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6294 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6298 if (is_type_pointer(src_type) && is_type_pointer(dst_type)) {
6299 type_t *src = skip_typeref(src_type->pointer.points_to);
6300 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6301 unsigned missing_qualifiers =
6302 src->base.qualifiers & ~dst->base.qualifiers;
6303 if (missing_qualifiers != 0) {
6304 warningf(WARN_CAST_QUAL, pos, "cast discards qualifiers '%Q' in pointer target type of '%T'", missing_qualifiers, orig_type_right);
6310 static expression_t *parse_compound_literal(source_position_t const *const pos, type_t *type)
6312 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6313 expression->base.source_position = *pos;
6315 parse_initializer_env_t env;
6318 env.must_be_constant = false;
6319 initializer_t *initializer = parse_initializer(&env);
6322 expression->compound_literal.initializer = initializer;
6323 expression->compound_literal.type = type;
6324 expression->base.type = automatic_type_conversion(type);
6330 * Parse a cast expression.
6332 static expression_t *parse_cast(void)
6334 source_position_t const pos = *HERE;
6337 add_anchor_token(')');
6339 type_t *type = parse_typename();
6341 rem_anchor_token(')');
6342 expect(')', end_error);
6344 if (token.kind == '{') {
6345 return parse_compound_literal(&pos, type);
6348 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6349 cast->base.source_position = pos;
6351 expression_t *value = parse_subexpression(PREC_CAST);
6352 cast->base.type = type;
6353 cast->unary.value = value;
6355 if (! semantic_cast(cast)) {
6356 /* TODO: record the error in the AST. else it is impossible to detect it */
6361 return create_error_expression();
6365 * Parse a statement expression.
6367 static expression_t *parse_statement_expression(void)
6369 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6372 add_anchor_token(')');
6374 statement_t *statement = parse_compound_statement(true);
6375 statement->compound.stmt_expr = true;
6376 expression->statement.statement = statement;
6378 /* find last statement and use its type */
6379 type_t *type = type_void;
6380 const statement_t *stmt = statement->compound.statements;
6382 while (stmt->base.next != NULL)
6383 stmt = stmt->base.next;
6385 if (stmt->kind == STATEMENT_EXPRESSION) {
6386 type = stmt->expression.expression->base.type;
6389 source_position_t const *const pos = &expression->base.source_position;
6390 warningf(WARN_OTHER, pos, "empty statement expression ({})");
6392 expression->base.type = type;
6394 rem_anchor_token(')');
6395 expect(')', end_error);
6402 * Parse a parenthesized expression.
6404 static expression_t *parse_parenthesized_expression(void)
6406 token_t const* const la1 = look_ahead(1);
6407 switch (la1->kind) {
6409 /* gcc extension: a statement expression */
6410 return parse_statement_expression();
6413 if (is_typedef_symbol(la1->identifier.symbol)) {
6415 return parse_cast();
6420 add_anchor_token(')');
6421 expression_t *result = parse_expression();
6422 result->base.parenthesized = true;
6423 rem_anchor_token(')');
6424 expect(')', end_error);
6430 static expression_t *parse_function_keyword(void)
6434 if (current_function == NULL) {
6435 errorf(HERE, "'__func__' used outside of a function");
6438 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6439 expression->base.type = type_char_ptr;
6440 expression->funcname.kind = FUNCNAME_FUNCTION;
6447 static expression_t *parse_pretty_function_keyword(void)
6449 if (current_function == NULL) {
6450 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6453 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6454 expression->base.type = type_char_ptr;
6455 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6457 eat(T___PRETTY_FUNCTION__);
6462 static expression_t *parse_funcsig_keyword(void)
6464 if (current_function == NULL) {
6465 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6468 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6469 expression->base.type = type_char_ptr;
6470 expression->funcname.kind = FUNCNAME_FUNCSIG;
6477 static expression_t *parse_funcdname_keyword(void)
6479 if (current_function == NULL) {
6480 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6483 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6484 expression->base.type = type_char_ptr;
6485 expression->funcname.kind = FUNCNAME_FUNCDNAME;
6487 eat(T___FUNCDNAME__);
6492 static designator_t *parse_designator(void)
6494 designator_t *result = allocate_ast_zero(sizeof(result[0]));
6495 result->source_position = *HERE;
6497 if (token.kind != T_IDENTIFIER) {
6498 parse_error_expected("while parsing member designator",
6499 T_IDENTIFIER, NULL);
6502 result->symbol = token.identifier.symbol;
6505 designator_t *last_designator = result;
6508 if (token.kind != T_IDENTIFIER) {
6509 parse_error_expected("while parsing member designator",
6510 T_IDENTIFIER, NULL);
6513 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6514 designator->source_position = *HERE;
6515 designator->symbol = token.identifier.symbol;
6518 last_designator->next = designator;
6519 last_designator = designator;
6523 add_anchor_token(']');
6524 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6525 designator->source_position = *HERE;
6526 designator->array_index = parse_expression();
6527 rem_anchor_token(']');
6528 expect(']', end_error);
6529 if (designator->array_index == NULL) {
6533 last_designator->next = designator;
6534 last_designator = designator;
6546 * Parse the __builtin_offsetof() expression.
6548 static expression_t *parse_offsetof(void)
6550 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6551 expression->base.type = type_size_t;
6553 eat(T___builtin_offsetof);
6555 expect('(', end_error);
6556 add_anchor_token(',');
6557 type_t *type = parse_typename();
6558 rem_anchor_token(',');
6559 expect(',', end_error);
6560 add_anchor_token(')');
6561 designator_t *designator = parse_designator();
6562 rem_anchor_token(')');
6563 expect(')', end_error);
6565 expression->offsetofe.type = type;
6566 expression->offsetofe.designator = designator;
6569 memset(&path, 0, sizeof(path));
6570 path.top_type = type;
6571 path.path = NEW_ARR_F(type_path_entry_t, 0);
6573 descend_into_subtype(&path);
6575 if (!walk_designator(&path, designator, true)) {
6576 return create_error_expression();
6579 DEL_ARR_F(path.path);
6583 return create_error_expression();
6587 * Parses a _builtin_va_start() expression.
6589 static expression_t *parse_va_start(void)
6591 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6593 eat(T___builtin_va_start);
6595 expect('(', end_error);
6596 add_anchor_token(',');
6597 expression->va_starte.ap = parse_assignment_expression();
6598 rem_anchor_token(',');
6599 expect(',', end_error);
6600 expression_t *const expr = parse_assignment_expression();
6601 if (expr->kind == EXPR_REFERENCE) {
6602 entity_t *const entity = expr->reference.entity;
6603 if (!current_function->base.type->function.variadic) {
6604 errorf(&expr->base.source_position,
6605 "'va_start' used in non-variadic function");
6606 } else if (entity->base.parent_scope != ¤t_function->parameters ||
6607 entity->base.next != NULL ||
6608 entity->kind != ENTITY_PARAMETER) {
6609 errorf(&expr->base.source_position,
6610 "second argument of 'va_start' must be last parameter of the current function");
6612 expression->va_starte.parameter = &entity->variable;
6614 expect(')', end_error);
6617 expect(')', end_error);
6619 return create_error_expression();
6623 * Parses a __builtin_va_arg() expression.
6625 static expression_t *parse_va_arg(void)
6627 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6629 eat(T___builtin_va_arg);
6631 expect('(', end_error);
6633 ap.expression = parse_assignment_expression();
6634 expression->va_arge.ap = ap.expression;
6635 check_call_argument(type_valist, &ap, 1);
6637 expect(',', end_error);
6638 expression->base.type = parse_typename();
6639 expect(')', end_error);
6643 return create_error_expression();
6647 * Parses a __builtin_va_copy() expression.
6649 static expression_t *parse_va_copy(void)
6651 expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
6653 eat(T___builtin_va_copy);
6655 expect('(', end_error);
6656 expression_t *dst = parse_assignment_expression();
6657 assign_error_t error = semantic_assign(type_valist, dst);
6658 report_assign_error(error, type_valist, dst, "call argument 1",
6659 &dst->base.source_position);
6660 expression->va_copye.dst = dst;
6662 expect(',', end_error);
6664 call_argument_t src;
6665 src.expression = parse_assignment_expression();
6666 check_call_argument(type_valist, &src, 2);
6667 expression->va_copye.src = src.expression;
6668 expect(')', end_error);
6672 return create_error_expression();
6676 * Parses a __builtin_constant_p() expression.
6678 static expression_t *parse_builtin_constant(void)
6680 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6682 eat(T___builtin_constant_p);
6684 expect('(', end_error);
6685 add_anchor_token(')');
6686 expression->builtin_constant.value = parse_assignment_expression();
6687 rem_anchor_token(')');
6688 expect(')', end_error);
6689 expression->base.type = type_int;
6693 return create_error_expression();
6697 * Parses a __builtin_types_compatible_p() expression.
6699 static expression_t *parse_builtin_types_compatible(void)
6701 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
6703 eat(T___builtin_types_compatible_p);
6705 expect('(', end_error);
6706 add_anchor_token(')');
6707 add_anchor_token(',');
6708 expression->builtin_types_compatible.left = parse_typename();
6709 rem_anchor_token(',');
6710 expect(',', end_error);
6711 expression->builtin_types_compatible.right = parse_typename();
6712 rem_anchor_token(')');
6713 expect(')', end_error);
6714 expression->base.type = type_int;
6718 return create_error_expression();
6722 * Parses a __builtin_is_*() compare expression.
6724 static expression_t *parse_compare_builtin(void)
6726 expression_t *expression;
6728 switch (token.kind) {
6729 case T___builtin_isgreater:
6730 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
6732 case T___builtin_isgreaterequal:
6733 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
6735 case T___builtin_isless:
6736 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
6738 case T___builtin_islessequal:
6739 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
6741 case T___builtin_islessgreater:
6742 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
6744 case T___builtin_isunordered:
6745 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
6748 internal_errorf(HERE, "invalid compare builtin found");
6750 expression->base.source_position = *HERE;
6753 expect('(', end_error);
6754 expression->binary.left = parse_assignment_expression();
6755 expect(',', end_error);
6756 expression->binary.right = parse_assignment_expression();
6757 expect(')', end_error);
6759 type_t *const orig_type_left = expression->binary.left->base.type;
6760 type_t *const orig_type_right = expression->binary.right->base.type;
6762 type_t *const type_left = skip_typeref(orig_type_left);
6763 type_t *const type_right = skip_typeref(orig_type_right);
6764 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6765 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6766 type_error_incompatible("invalid operands in comparison",
6767 &expression->base.source_position, orig_type_left, orig_type_right);
6770 semantic_comparison(&expression->binary);
6775 return create_error_expression();
6779 * Parses a MS assume() expression.
6781 static expression_t *parse_assume(void)
6783 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
6787 expect('(', end_error);
6788 add_anchor_token(')');
6789 expression->unary.value = parse_assignment_expression();
6790 rem_anchor_token(')');
6791 expect(')', end_error);
6793 expression->base.type = type_void;
6796 return create_error_expression();
6800 * Return the label for the current symbol or create a new one.
6802 static label_t *get_label(void)
6804 assert(token.kind == T_IDENTIFIER);
6805 assert(current_function != NULL);
6807 entity_t *label = get_entity(token.identifier.symbol, NAMESPACE_LABEL);
6808 /* If we find a local label, we already created the declaration. */
6809 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
6810 if (label->base.parent_scope != current_scope) {
6811 assert(label->base.parent_scope->depth < current_scope->depth);
6812 current_function->goto_to_outer = true;
6814 } else if (label == NULL || label->base.parent_scope != ¤t_function->parameters) {
6815 /* There is no matching label in the same function, so create a new one. */
6816 label = allocate_entity_zero(ENTITY_LABEL, NAMESPACE_LABEL, token.identifier.symbol);
6821 return &label->label;
6825 * Parses a GNU && label address expression.
6827 static expression_t *parse_label_address(void)
6829 source_position_t source_position = token.base.source_position;
6831 if (token.kind != T_IDENTIFIER) {
6832 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
6833 return create_error_expression();
6836 label_t *const label = get_label();
6838 label->address_taken = true;
6840 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
6841 expression->base.source_position = source_position;
6843 /* label address is treated as a void pointer */
6844 expression->base.type = type_void_ptr;
6845 expression->label_address.label = label;
6850 * Parse a microsoft __noop expression.
6852 static expression_t *parse_noop_expression(void)
6854 /* the result is a (int)0 */
6855 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_MS_NOOP);
6856 literal->base.type = type_int;
6857 literal->literal.value.begin = "__noop";
6858 literal->literal.value.size = 6;
6862 if (token.kind == '(') {
6863 /* parse arguments */
6865 add_anchor_token(')');
6866 add_anchor_token(',');
6868 if (token.kind != ')') do {
6869 (void)parse_assignment_expression();
6870 } while (next_if(','));
6872 rem_anchor_token(',');
6873 rem_anchor_token(')');
6874 expect(')', end_error);
6881 * Parses a primary expression.
6883 static expression_t *parse_primary_expression(void)
6885 switch (token.kind) {
6886 case T_false: return parse_boolean_literal(false);
6887 case T_true: return parse_boolean_literal(true);
6889 case T_INTEGER_OCTAL:
6890 case T_INTEGER_HEXADECIMAL:
6891 case T_FLOATINGPOINT:
6892 case T_FLOATINGPOINT_HEXADECIMAL: return parse_number_literal();
6893 case T_CHARACTER_CONSTANT: return parse_character_constant();
6894 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
6895 case T_STRING_LITERAL:
6896 case T_WIDE_STRING_LITERAL: return parse_string_literal();
6897 case T___FUNCTION__:
6898 case T___func__: return parse_function_keyword();
6899 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
6900 case T___FUNCSIG__: return parse_funcsig_keyword();
6901 case T___FUNCDNAME__: return parse_funcdname_keyword();
6902 case T___builtin_offsetof: return parse_offsetof();
6903 case T___builtin_va_start: return parse_va_start();
6904 case T___builtin_va_arg: return parse_va_arg();
6905 case T___builtin_va_copy: return parse_va_copy();
6906 case T___builtin_isgreater:
6907 case T___builtin_isgreaterequal:
6908 case T___builtin_isless:
6909 case T___builtin_islessequal:
6910 case T___builtin_islessgreater:
6911 case T___builtin_isunordered: return parse_compare_builtin();
6912 case T___builtin_constant_p: return parse_builtin_constant();
6913 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
6914 case T__assume: return parse_assume();
6917 return parse_label_address();
6920 case '(': return parse_parenthesized_expression();
6921 case T___noop: return parse_noop_expression();
6923 /* Gracefully handle type names while parsing expressions. */
6925 return parse_reference();
6927 if (!is_typedef_symbol(token.identifier.symbol)) {
6928 return parse_reference();
6932 source_position_t const pos = *HERE;
6933 declaration_specifiers_t specifiers;
6934 parse_declaration_specifiers(&specifiers);
6935 type_t const *const type = parse_abstract_declarator(specifiers.type);
6936 errorf(&pos, "encountered type '%T' while parsing expression", type);
6937 return create_error_expression();
6941 errorf(HERE, "unexpected token %K, expected an expression", &token);
6943 return create_error_expression();
6946 static expression_t *parse_array_expression(expression_t *left)
6948 expression_t *const expr = allocate_expression_zero(EXPR_ARRAY_ACCESS);
6949 array_access_expression_t *const arr = &expr->array_access;
6952 add_anchor_token(']');
6954 expression_t *const inside = parse_expression();
6956 type_t *const orig_type_left = left->base.type;
6957 type_t *const orig_type_inside = inside->base.type;
6959 type_t *const type_left = skip_typeref(orig_type_left);
6960 type_t *const type_inside = skip_typeref(orig_type_inside);
6966 if (is_type_pointer(type_left)) {
6969 idx_type = type_inside;
6970 res_type = type_left->pointer.points_to;
6972 } else if (is_type_pointer(type_inside)) {
6973 arr->flipped = true;
6976 idx_type = type_left;
6977 res_type = type_inside->pointer.points_to;
6979 res_type = automatic_type_conversion(res_type);
6980 if (!is_type_integer(idx_type)) {
6981 errorf(&idx->base.source_position, "array subscript must have integer type");
6982 } else if (is_type_atomic(idx_type, ATOMIC_TYPE_CHAR)) {
6983 source_position_t const *const pos = &idx->base.source_position;
6984 warningf(WARN_CHAR_SUBSCRIPTS, pos, "array subscript has char type");
6987 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
6988 errorf(&expr->base.source_position, "invalid types '%T[%T]' for array access", orig_type_left, orig_type_inside);
6990 res_type = type_error_type;
6995 arr->array_ref = ref;
6997 arr->base.type = res_type;
6999 rem_anchor_token(']');
7000 expect(']', end_error);
7005 static bool is_bitfield(const expression_t *expression)
7007 return expression->kind == EXPR_SELECT
7008 && expression->select.compound_entry->compound_member.bitfield;
7011 static expression_t *parse_typeprop(expression_kind_t const kind)
7013 expression_t *tp_expression = allocate_expression_zero(kind);
7014 tp_expression->base.type = type_size_t;
7016 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
7019 expression_t *expression;
7020 if (token.kind == '(' && is_declaration_specifier(look_ahead(1))) {
7021 source_position_t const pos = *HERE;
7023 add_anchor_token(')');
7024 orig_type = parse_typename();
7025 rem_anchor_token(')');
7026 expect(')', end_error);
7028 if (token.kind == '{') {
7029 /* It was not sizeof(type) after all. It is sizeof of an expression
7030 * starting with a compound literal */
7031 expression = parse_compound_literal(&pos, orig_type);
7032 goto typeprop_expression;
7035 expression = parse_subexpression(PREC_UNARY);
7037 typeprop_expression:
7038 if (is_bitfield(expression)) {
7039 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7040 errorf(&tp_expression->base.source_position,
7041 "operand of %s expression must not be a bitfield", what);
7044 tp_expression->typeprop.tp_expression = expression;
7046 orig_type = revert_automatic_type_conversion(expression);
7047 expression->base.type = orig_type;
7050 tp_expression->typeprop.type = orig_type;
7051 type_t const* const type = skip_typeref(orig_type);
7052 char const* wrong_type = NULL;
7053 if (is_type_incomplete(type)) {
7054 if (!is_type_atomic(type, ATOMIC_TYPE_VOID) || !GNU_MODE)
7055 wrong_type = "incomplete";
7056 } else if (type->kind == TYPE_FUNCTION) {
7058 /* function types are allowed (and return 1) */
7059 source_position_t const *const pos = &tp_expression->base.source_position;
7060 char const *const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7061 warningf(WARN_OTHER, pos, "%s expression with function argument returns invalid result", what);
7063 wrong_type = "function";
7067 if (wrong_type != NULL) {
7068 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7069 errorf(&tp_expression->base.source_position,
7070 "operand of %s expression must not be of %s type '%T'",
7071 what, wrong_type, orig_type);
7075 return tp_expression;
7078 static expression_t *parse_sizeof(void)
7080 return parse_typeprop(EXPR_SIZEOF);
7083 static expression_t *parse_alignof(void)
7085 return parse_typeprop(EXPR_ALIGNOF);
7088 static expression_t *parse_select_expression(expression_t *addr)
7090 assert(token.kind == '.' || token.kind == T_MINUSGREATER);
7091 bool select_left_arrow = (token.kind == T_MINUSGREATER);
7092 source_position_t const pos = *HERE;
7095 if (token.kind != T_IDENTIFIER) {
7096 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
7097 return create_error_expression();
7099 symbol_t *symbol = token.identifier.symbol;
7102 type_t *const orig_type = addr->base.type;
7103 type_t *const type = skip_typeref(orig_type);
7106 bool saw_error = false;
7107 if (is_type_pointer(type)) {
7108 if (!select_left_arrow) {
7110 "request for member '%Y' in something not a struct or union, but '%T'",
7114 type_left = skip_typeref(type->pointer.points_to);
7116 if (select_left_arrow && is_type_valid(type)) {
7117 errorf(&pos, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7123 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
7124 type_left->kind != TYPE_COMPOUND_UNION) {
7126 if (is_type_valid(type_left) && !saw_error) {
7128 "request for member '%Y' in something not a struct or union, but '%T'",
7131 return create_error_expression();
7134 compound_t *compound = type_left->compound.compound;
7135 if (!compound->complete) {
7136 errorf(&pos, "request for member '%Y' in incomplete type '%T'",
7138 return create_error_expression();
7141 type_qualifiers_t qualifiers = type_left->base.qualifiers;
7142 expression_t *result =
7143 find_create_select(&pos, addr, qualifiers, compound, symbol);
7145 if (result == NULL) {
7146 errorf(&pos, "'%T' has no member named '%Y'", orig_type, symbol);
7147 return create_error_expression();
7153 static void check_call_argument(type_t *expected_type,
7154 call_argument_t *argument, unsigned pos)
7156 type_t *expected_type_skip = skip_typeref(expected_type);
7157 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
7158 expression_t *arg_expr = argument->expression;
7159 type_t *arg_type = skip_typeref(arg_expr->base.type);
7161 /* handle transparent union gnu extension */
7162 if (is_type_union(expected_type_skip)
7163 && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
7164 compound_t *union_decl = expected_type_skip->compound.compound;
7165 type_t *best_type = NULL;
7166 entity_t *entry = union_decl->members.entities;
7167 for ( ; entry != NULL; entry = entry->base.next) {
7168 assert(is_declaration(entry));
7169 type_t *decl_type = entry->declaration.type;
7170 error = semantic_assign(decl_type, arg_expr);
7171 if (error == ASSIGN_ERROR_INCOMPATIBLE
7172 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
7175 if (error == ASSIGN_SUCCESS) {
7176 best_type = decl_type;
7177 } else if (best_type == NULL) {
7178 best_type = decl_type;
7182 if (best_type != NULL) {
7183 expected_type = best_type;
7187 error = semantic_assign(expected_type, arg_expr);
7188 argument->expression = create_implicit_cast(arg_expr, expected_type);
7190 if (error != ASSIGN_SUCCESS) {
7191 /* report exact scope in error messages (like "in argument 3") */
7193 snprintf(buf, sizeof(buf), "call argument %u", pos);
7194 report_assign_error(error, expected_type, arg_expr, buf,
7195 &arg_expr->base.source_position);
7197 type_t *const promoted_type = get_default_promoted_type(arg_type);
7198 if (!types_compatible(expected_type_skip, promoted_type) &&
7199 !types_compatible(expected_type_skip, type_void_ptr) &&
7200 !types_compatible(type_void_ptr, promoted_type)) {
7201 /* Deliberately show the skipped types in this warning */
7202 source_position_t const *const apos = &arg_expr->base.source_position;
7203 warningf(WARN_TRADITIONAL, apos, "passing call argument %u as '%T' rather than '%T' due to prototype", pos, expected_type_skip, promoted_type);
7209 * Handle the semantic restrictions of builtin calls
7211 static void handle_builtin_argument_restrictions(call_expression_t *call)
7213 entity_t *entity = call->function->reference.entity;
7214 switch (entity->function.btk) {
7216 switch (entity->function.b.firm_builtin_kind) {
7217 case ir_bk_return_address:
7218 case ir_bk_frame_address: {
7219 /* argument must be constant */
7220 call_argument_t *argument = call->arguments;
7222 if (is_constant_expression(argument->expression) == EXPR_CLASS_VARIABLE) {
7223 errorf(&call->base.source_position,
7224 "argument of '%Y' must be a constant expression",
7225 call->function->reference.entity->base.symbol);
7229 case ir_bk_prefetch:
7230 /* second and third argument must be constant if existent */
7231 if (call->arguments == NULL)
7233 call_argument_t *rw = call->arguments->next;
7234 call_argument_t *locality = NULL;
7237 if (is_constant_expression(rw->expression) == EXPR_CLASS_VARIABLE) {
7238 errorf(&call->base.source_position,
7239 "second argument of '%Y' must be a constant expression",
7240 call->function->reference.entity->base.symbol);
7242 locality = rw->next;
7244 if (locality != NULL) {
7245 if (is_constant_expression(locality->expression) == EXPR_CLASS_VARIABLE) {
7246 errorf(&call->base.source_position,
7247 "third argument of '%Y' must be a constant expression",
7248 call->function->reference.entity->base.symbol);
7250 locality = rw->next;
7257 case BUILTIN_OBJECT_SIZE:
7258 if (call->arguments == NULL)
7261 call_argument_t *arg = call->arguments->next;
7262 if (arg != NULL && is_constant_expression(arg->expression) == EXPR_CLASS_VARIABLE) {
7263 errorf(&call->base.source_position,
7264 "second argument of '%Y' must be a constant expression",
7265 call->function->reference.entity->base.symbol);
7274 * Parse a call expression, ie. expression '( ... )'.
7276 * @param expression the function address
7278 static expression_t *parse_call_expression(expression_t *expression)
7280 expression_t *result = allocate_expression_zero(EXPR_CALL);
7281 call_expression_t *call = &result->call;
7282 call->function = expression;
7284 type_t *const orig_type = expression->base.type;
7285 type_t *const type = skip_typeref(orig_type);
7287 function_type_t *function_type = NULL;
7288 if (is_type_pointer(type)) {
7289 type_t *const to_type = skip_typeref(type->pointer.points_to);
7291 if (is_type_function(to_type)) {
7292 function_type = &to_type->function;
7293 call->base.type = function_type->return_type;
7297 if (function_type == NULL && is_type_valid(type)) {
7299 "called object '%E' (type '%T') is not a pointer to a function",
7300 expression, orig_type);
7303 /* parse arguments */
7305 add_anchor_token(')');
7306 add_anchor_token(',');
7308 if (token.kind != ')') {
7309 call_argument_t **anchor = &call->arguments;
7311 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7312 argument->expression = parse_assignment_expression();
7315 anchor = &argument->next;
7316 } while (next_if(','));
7318 rem_anchor_token(',');
7319 rem_anchor_token(')');
7320 expect(')', end_error);
7322 if (function_type == NULL)
7325 /* check type and count of call arguments */
7326 function_parameter_t *parameter = function_type->parameters;
7327 call_argument_t *argument = call->arguments;
7328 if (!function_type->unspecified_parameters) {
7329 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7330 parameter = parameter->next, argument = argument->next) {
7331 check_call_argument(parameter->type, argument, ++pos);
7334 if (parameter != NULL) {
7335 errorf(&expression->base.source_position, "too few arguments to function '%E'", expression);
7336 } else if (argument != NULL && !function_type->variadic) {
7337 errorf(&argument->expression->base.source_position, "too many arguments to function '%E'", expression);
7341 /* do default promotion for other arguments */
7342 for (; argument != NULL; argument = argument->next) {
7343 type_t *argument_type = argument->expression->base.type;
7344 if (!is_type_object(skip_typeref(argument_type))) {
7345 errorf(&argument->expression->base.source_position,
7346 "call argument '%E' must not be void", argument->expression);
7349 argument_type = get_default_promoted_type(argument_type);
7351 argument->expression
7352 = create_implicit_cast(argument->expression, argument_type);
7357 if (is_type_compound(skip_typeref(function_type->return_type))) {
7358 source_position_t const *const pos = &expression->base.source_position;
7359 warningf(WARN_AGGREGATE_RETURN, pos, "function call has aggregate value");
7362 if (expression->kind == EXPR_REFERENCE) {
7363 reference_expression_t *reference = &expression->reference;
7364 if (reference->entity->kind == ENTITY_FUNCTION &&
7365 reference->entity->function.btk != BUILTIN_NONE)
7366 handle_builtin_argument_restrictions(call);
7373 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7375 static bool same_compound_type(const type_t *type1, const type_t *type2)
7378 is_type_compound(type1) &&
7379 type1->kind == type2->kind &&
7380 type1->compound.compound == type2->compound.compound;
7383 static expression_t const *get_reference_address(expression_t const *expr)
7385 bool regular_take_address = true;
7387 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7388 expr = expr->unary.value;
7390 regular_take_address = false;
7393 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7396 expr = expr->unary.value;
7399 if (expr->kind != EXPR_REFERENCE)
7402 /* special case for functions which are automatically converted to a
7403 * pointer to function without an extra TAKE_ADDRESS operation */
7404 if (!regular_take_address &&
7405 expr->reference.entity->kind != ENTITY_FUNCTION) {
7412 static void warn_reference_address_as_bool(expression_t const* expr)
7414 expr = get_reference_address(expr);
7416 source_position_t const *const pos = &expr->base.source_position;
7417 entity_t const *const ent = expr->reference.entity;
7418 warningf(WARN_ADDRESS, pos, "the address of '%N' will always evaluate as 'true'", ent);
7422 static void warn_assignment_in_condition(const expression_t *const expr)
7424 if (expr->base.kind != EXPR_BINARY_ASSIGN)
7426 if (expr->base.parenthesized)
7428 source_position_t const *const pos = &expr->base.source_position;
7429 warningf(WARN_PARENTHESES, pos, "suggest parentheses around assignment used as truth value");
7432 static void semantic_condition(expression_t const *const expr,
7433 char const *const context)
7435 type_t *const type = skip_typeref(expr->base.type);
7436 if (is_type_scalar(type)) {
7437 warn_reference_address_as_bool(expr);
7438 warn_assignment_in_condition(expr);
7439 } else if (is_type_valid(type)) {
7440 errorf(&expr->base.source_position,
7441 "%s must have scalar type", context);
7446 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7448 * @param expression the conditional expression
7450 static expression_t *parse_conditional_expression(expression_t *expression)
7452 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7454 conditional_expression_t *conditional = &result->conditional;
7455 conditional->condition = expression;
7458 add_anchor_token(':');
7460 /* §6.5.15:2 The first operand shall have scalar type. */
7461 semantic_condition(expression, "condition of conditional operator");
7463 expression_t *true_expression = expression;
7464 bool gnu_cond = false;
7465 if (GNU_MODE && token.kind == ':') {
7468 true_expression = parse_expression();
7470 rem_anchor_token(':');
7471 expect(':', end_error);
7473 expression_t *false_expression =
7474 parse_subexpression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7476 type_t *const orig_true_type = true_expression->base.type;
7477 type_t *const orig_false_type = false_expression->base.type;
7478 type_t *const true_type = skip_typeref(orig_true_type);
7479 type_t *const false_type = skip_typeref(orig_false_type);
7482 source_position_t const *const pos = &conditional->base.source_position;
7483 type_t *result_type;
7484 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7485 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7486 /* ISO/IEC 14882:1998(E) §5.16:2 */
7487 if (true_expression->kind == EXPR_UNARY_THROW) {
7488 result_type = false_type;
7489 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7490 result_type = true_type;
7492 if (!is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7493 !is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7494 warningf(WARN_OTHER, pos, "ISO C forbids conditional expression with only one void side");
7496 result_type = type_void;
7498 } else if (is_type_arithmetic(true_type)
7499 && is_type_arithmetic(false_type)) {
7500 result_type = semantic_arithmetic(true_type, false_type);
7501 } else if (same_compound_type(true_type, false_type)) {
7502 /* just take 1 of the 2 types */
7503 result_type = true_type;
7504 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7505 type_t *pointer_type;
7507 expression_t *other_expression;
7508 if (is_type_pointer(true_type) &&
7509 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7510 pointer_type = true_type;
7511 other_type = false_type;
7512 other_expression = false_expression;
7514 pointer_type = false_type;
7515 other_type = true_type;
7516 other_expression = true_expression;
7519 if (is_null_pointer_constant(other_expression)) {
7520 result_type = pointer_type;
7521 } else if (is_type_pointer(other_type)) {
7522 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7523 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7526 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
7527 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
7529 } else if (types_compatible(get_unqualified_type(to1),
7530 get_unqualified_type(to2))) {
7533 warningf(WARN_OTHER, pos, "pointer types '%T' and '%T' in conditional expression are incompatible", true_type, false_type);
7537 type_t *const type =
7538 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7539 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7540 } else if (is_type_integer(other_type)) {
7541 warningf(WARN_OTHER, pos, "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7542 result_type = pointer_type;
7544 goto types_incompatible;
7548 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7549 type_error_incompatible("while parsing conditional", pos, true_type, false_type);
7551 result_type = type_error_type;
7554 conditional->true_expression
7555 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7556 conditional->false_expression
7557 = create_implicit_cast(false_expression, result_type);
7558 conditional->base.type = result_type;
7563 * Parse an extension expression.
7565 static expression_t *parse_extension(void)
7568 expression_t *expression = parse_subexpression(PREC_UNARY);
7574 * Parse a __builtin_classify_type() expression.
7576 static expression_t *parse_builtin_classify_type(void)
7578 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7579 result->base.type = type_int;
7581 eat(T___builtin_classify_type);
7583 expect('(', end_error);
7584 add_anchor_token(')');
7585 expression_t *expression = parse_expression();
7586 rem_anchor_token(')');
7587 expect(')', end_error);
7588 result->classify_type.type_expression = expression;
7592 return create_error_expression();
7596 * Parse a delete expression
7597 * ISO/IEC 14882:1998(E) §5.3.5
7599 static expression_t *parse_delete(void)
7601 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7602 result->base.type = type_void;
7607 result->kind = EXPR_UNARY_DELETE_ARRAY;
7608 expect(']', end_error);
7612 expression_t *const value = parse_subexpression(PREC_CAST);
7613 result->unary.value = value;
7615 type_t *const type = skip_typeref(value->base.type);
7616 if (!is_type_pointer(type)) {
7617 if (is_type_valid(type)) {
7618 errorf(&value->base.source_position,
7619 "operand of delete must have pointer type");
7621 } else if (is_type_atomic(skip_typeref(type->pointer.points_to), ATOMIC_TYPE_VOID)) {
7622 source_position_t const *const pos = &value->base.source_position;
7623 warningf(WARN_OTHER, pos, "deleting 'void*' is undefined");
7630 * Parse a throw expression
7631 * ISO/IEC 14882:1998(E) §15:1
7633 static expression_t *parse_throw(void)
7635 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7636 result->base.type = type_void;
7640 expression_t *value = NULL;
7641 switch (token.kind) {
7643 value = parse_assignment_expression();
7644 /* ISO/IEC 14882:1998(E) §15.1:3 */
7645 type_t *const orig_type = value->base.type;
7646 type_t *const type = skip_typeref(orig_type);
7647 if (is_type_incomplete(type)) {
7648 errorf(&value->base.source_position,
7649 "cannot throw object of incomplete type '%T'", orig_type);
7650 } else if (is_type_pointer(type)) {
7651 type_t *const points_to = skip_typeref(type->pointer.points_to);
7652 if (is_type_incomplete(points_to) &&
7653 !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7654 errorf(&value->base.source_position,
7655 "cannot throw pointer to incomplete type '%T'", orig_type);
7663 result->unary.value = value;
7668 static bool check_pointer_arithmetic(const source_position_t *source_position,
7669 type_t *pointer_type,
7670 type_t *orig_pointer_type)
7672 type_t *points_to = pointer_type->pointer.points_to;
7673 points_to = skip_typeref(points_to);
7675 if (is_type_incomplete(points_to)) {
7676 if (!GNU_MODE || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7677 errorf(source_position,
7678 "arithmetic with pointer to incomplete type '%T' not allowed",
7682 warningf(WARN_POINTER_ARITH, source_position, "pointer of type '%T' used in arithmetic", orig_pointer_type);
7684 } else if (is_type_function(points_to)) {
7686 errorf(source_position,
7687 "arithmetic with pointer to function type '%T' not allowed",
7691 warningf(WARN_POINTER_ARITH, source_position, "pointer to a function '%T' used in arithmetic", orig_pointer_type);
7697 static bool is_lvalue(const expression_t *expression)
7699 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
7700 switch (expression->kind) {
7701 case EXPR_ARRAY_ACCESS:
7702 case EXPR_COMPOUND_LITERAL:
7703 case EXPR_REFERENCE:
7705 case EXPR_UNARY_DEREFERENCE:
7709 type_t *type = skip_typeref(expression->base.type);
7711 /* ISO/IEC 14882:1998(E) §3.10:3 */
7712 is_type_reference(type) ||
7713 /* Claim it is an lvalue, if the type is invalid. There was a parse
7714 * error before, which maybe prevented properly recognizing it as
7716 !is_type_valid(type);
7721 static void semantic_incdec(unary_expression_t *expression)
7723 type_t *const orig_type = expression->value->base.type;
7724 type_t *const type = skip_typeref(orig_type);
7725 if (is_type_pointer(type)) {
7726 if (!check_pointer_arithmetic(&expression->base.source_position,
7730 } else if (!is_type_real(type) && is_type_valid(type)) {
7731 /* TODO: improve error message */
7732 errorf(&expression->base.source_position,
7733 "operation needs an arithmetic or pointer type");
7736 if (!is_lvalue(expression->value)) {
7737 /* TODO: improve error message */
7738 errorf(&expression->base.source_position, "lvalue required as operand");
7740 expression->base.type = orig_type;
7743 static void promote_unary_int_expr(unary_expression_t *const expr, type_t *const type)
7745 type_t *const res_type = promote_integer(type);
7746 expr->base.type = res_type;
7747 expr->value = create_implicit_cast(expr->value, res_type);
7750 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
7752 type_t *const orig_type = expression->value->base.type;
7753 type_t *const type = skip_typeref(orig_type);
7754 if (!is_type_arithmetic(type)) {
7755 if (is_type_valid(type)) {
7756 /* TODO: improve error message */
7757 errorf(&expression->base.source_position,
7758 "operation needs an arithmetic type");
7761 } else if (is_type_integer(type)) {
7762 promote_unary_int_expr(expression, type);
7764 expression->base.type = orig_type;
7768 static void semantic_unexpr_plus(unary_expression_t *expression)
7770 semantic_unexpr_arithmetic(expression);
7771 source_position_t const *const pos = &expression->base.source_position;
7772 warningf(WARN_TRADITIONAL, pos, "traditional C rejects the unary plus operator");
7775 static void semantic_not(unary_expression_t *expression)
7777 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
7778 semantic_condition(expression->value, "operand of !");
7779 expression->base.type = c_mode & _CXX ? type_bool : type_int;
7782 static void semantic_unexpr_integer(unary_expression_t *expression)
7784 type_t *const orig_type = expression->value->base.type;
7785 type_t *const type = skip_typeref(orig_type);
7786 if (!is_type_integer(type)) {
7787 if (is_type_valid(type)) {
7788 errorf(&expression->base.source_position,
7789 "operand of ~ must be of integer type");
7794 promote_unary_int_expr(expression, type);
7797 static void semantic_dereference(unary_expression_t *expression)
7799 type_t *const orig_type = expression->value->base.type;
7800 type_t *const type = skip_typeref(orig_type);
7801 if (!is_type_pointer(type)) {
7802 if (is_type_valid(type)) {
7803 errorf(&expression->base.source_position,
7804 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
7809 type_t *result_type = type->pointer.points_to;
7810 result_type = automatic_type_conversion(result_type);
7811 expression->base.type = result_type;
7815 * Record that an address is taken (expression represents an lvalue).
7817 * @param expression the expression
7818 * @param may_be_register if true, the expression might be an register
7820 static void set_address_taken(expression_t *expression, bool may_be_register)
7822 if (expression->kind != EXPR_REFERENCE)
7825 entity_t *const entity = expression->reference.entity;
7827 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
7830 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
7831 && !may_be_register) {
7832 source_position_t const *const pos = &expression->base.source_position;
7833 errorf(pos, "address of register '%N' requested", entity);
7836 if (entity->kind == ENTITY_VARIABLE) {
7837 entity->variable.address_taken = true;
7839 assert(entity->kind == ENTITY_PARAMETER);
7840 entity->parameter.address_taken = true;
7845 * Check the semantic of the address taken expression.
7847 static void semantic_take_addr(unary_expression_t *expression)
7849 expression_t *value = expression->value;
7850 value->base.type = revert_automatic_type_conversion(value);
7852 type_t *orig_type = value->base.type;
7853 type_t *type = skip_typeref(orig_type);
7854 if (!is_type_valid(type))
7858 if (!is_lvalue(value)) {
7859 errorf(&expression->base.source_position, "'&' requires an lvalue");
7861 if (is_bitfield(value)) {
7862 errorf(&expression->base.source_position,
7863 "'&' not allowed on bitfield");
7866 set_address_taken(value, false);
7868 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
7871 #define CREATE_UNARY_EXPRESSION_PARSER(token_kind, unexpression_type, sfunc) \
7872 static expression_t *parse_##unexpression_type(void) \
7874 expression_t *unary_expression \
7875 = allocate_expression_zero(unexpression_type); \
7877 unary_expression->unary.value = parse_subexpression(PREC_UNARY); \
7879 sfunc(&unary_expression->unary); \
7881 return unary_expression; \
7884 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
7885 semantic_unexpr_arithmetic)
7886 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
7887 semantic_unexpr_plus)
7888 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
7890 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
7891 semantic_dereference)
7892 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
7894 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
7895 semantic_unexpr_integer)
7896 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
7898 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
7901 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_kind, unexpression_type, \
7903 static expression_t *parse_##unexpression_type(expression_t *left) \
7905 expression_t *unary_expression \
7906 = allocate_expression_zero(unexpression_type); \
7908 unary_expression->unary.value = left; \
7910 sfunc(&unary_expression->unary); \
7912 return unary_expression; \
7915 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
7916 EXPR_UNARY_POSTFIX_INCREMENT,
7918 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
7919 EXPR_UNARY_POSTFIX_DECREMENT,
7922 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
7924 /* TODO: handle complex + imaginary types */
7926 type_left = get_unqualified_type(type_left);
7927 type_right = get_unqualified_type(type_right);
7929 /* §6.3.1.8 Usual arithmetic conversions */
7930 if (type_left == type_long_double || type_right == type_long_double) {
7931 return type_long_double;
7932 } else if (type_left == type_double || type_right == type_double) {
7934 } else if (type_left == type_float || type_right == type_float) {
7938 type_left = promote_integer(type_left);
7939 type_right = promote_integer(type_right);
7941 if (type_left == type_right)
7944 bool const signed_left = is_type_signed(type_left);
7945 bool const signed_right = is_type_signed(type_right);
7946 unsigned const rank_left = get_akind_rank(get_akind(type_left));
7947 unsigned const rank_right = get_akind_rank(get_akind(type_right));
7949 if (signed_left == signed_right)
7950 return rank_left >= rank_right ? type_left : type_right;
7954 atomic_type_kind_t s_akind;
7955 atomic_type_kind_t u_akind;
7960 u_type = type_right;
7962 s_type = type_right;
7965 s_akind = get_akind(s_type);
7966 u_akind = get_akind(u_type);
7967 s_rank = get_akind_rank(s_akind);
7968 u_rank = get_akind_rank(u_akind);
7970 if (u_rank >= s_rank)
7973 if (get_atomic_type_size(s_akind) > get_atomic_type_size(u_akind))
7977 case ATOMIC_TYPE_INT: return type_unsigned_int;
7978 case ATOMIC_TYPE_LONG: return type_unsigned_long;
7979 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
7981 default: panic("invalid atomic type");
7986 * Check the semantic restrictions for a binary expression.
7988 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
7990 expression_t *const left = expression->left;
7991 expression_t *const right = expression->right;
7992 type_t *const orig_type_left = left->base.type;
7993 type_t *const orig_type_right = right->base.type;
7994 type_t *const type_left = skip_typeref(orig_type_left);
7995 type_t *const type_right = skip_typeref(orig_type_right);
7997 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
7998 /* TODO: improve error message */
7999 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8000 errorf(&expression->base.source_position,
8001 "operation needs arithmetic types");
8006 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8007 expression->left = create_implicit_cast(left, arithmetic_type);
8008 expression->right = create_implicit_cast(right, arithmetic_type);
8009 expression->base.type = arithmetic_type;
8012 static void semantic_binexpr_integer(binary_expression_t *const expression)
8014 expression_t *const left = expression->left;
8015 expression_t *const right = expression->right;
8016 type_t *const orig_type_left = left->base.type;
8017 type_t *const orig_type_right = right->base.type;
8018 type_t *const type_left = skip_typeref(orig_type_left);
8019 type_t *const type_right = skip_typeref(orig_type_right);
8021 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8022 /* TODO: improve error message */
8023 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8024 errorf(&expression->base.source_position,
8025 "operation needs integer types");
8030 type_t *const result_type = semantic_arithmetic(type_left, type_right);
8031 expression->left = create_implicit_cast(left, result_type);
8032 expression->right = create_implicit_cast(right, result_type);
8033 expression->base.type = result_type;
8036 static void warn_div_by_zero(binary_expression_t const *const expression)
8038 if (!is_type_integer(expression->base.type))
8041 expression_t const *const right = expression->right;
8042 /* The type of the right operand can be different for /= */
8043 if (is_type_integer(right->base.type) &&
8044 is_constant_expression(right) == EXPR_CLASS_CONSTANT &&
8045 !fold_constant_to_bool(right)) {
8046 source_position_t const *const pos = &expression->base.source_position;
8047 warningf(WARN_DIV_BY_ZERO, pos, "division by zero");
8052 * Check the semantic restrictions for a div/mod expression.
8054 static void semantic_divmod_arithmetic(binary_expression_t *expression)
8056 semantic_binexpr_arithmetic(expression);
8057 warn_div_by_zero(expression);
8060 static void warn_addsub_in_shift(const expression_t *const expr)
8062 if (expr->base.parenthesized)
8066 switch (expr->kind) {
8067 case EXPR_BINARY_ADD: op = '+'; break;
8068 case EXPR_BINARY_SUB: op = '-'; break;
8072 source_position_t const *const pos = &expr->base.source_position;
8073 warningf(WARN_PARENTHESES, pos, "suggest parentheses around '%c' inside shift", op);
8076 static bool semantic_shift(binary_expression_t *expression)
8078 expression_t *const left = expression->left;
8079 expression_t *const right = expression->right;
8080 type_t *const orig_type_left = left->base.type;
8081 type_t *const orig_type_right = right->base.type;
8082 type_t * type_left = skip_typeref(orig_type_left);
8083 type_t * type_right = skip_typeref(orig_type_right);
8085 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8086 /* TODO: improve error message */
8087 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8088 errorf(&expression->base.source_position,
8089 "operands of shift operation must have integer types");
8094 type_left = promote_integer(type_left);
8096 if (is_constant_expression(right) == EXPR_CLASS_CONSTANT) {
8097 source_position_t const *const pos = &right->base.source_position;
8098 long const count = fold_constant_to_int(right);
8100 warningf(WARN_OTHER, pos, "shift count must be non-negative");
8101 } else if ((unsigned long)count >=
8102 get_atomic_type_size(type_left->atomic.akind) * 8) {
8103 warningf(WARN_OTHER, pos, "shift count must be less than type width");
8107 type_right = promote_integer(type_right);
8108 expression->right = create_implicit_cast(right, type_right);
8113 static void semantic_shift_op(binary_expression_t *expression)
8115 expression_t *const left = expression->left;
8116 expression_t *const right = expression->right;
8118 if (!semantic_shift(expression))
8121 warn_addsub_in_shift(left);
8122 warn_addsub_in_shift(right);
8124 type_t *const orig_type_left = left->base.type;
8125 type_t * type_left = skip_typeref(orig_type_left);
8127 type_left = promote_integer(type_left);
8128 expression->left = create_implicit_cast(left, type_left);
8129 expression->base.type = type_left;
8132 static void semantic_add(binary_expression_t *expression)
8134 expression_t *const left = expression->left;
8135 expression_t *const right = expression->right;
8136 type_t *const orig_type_left = left->base.type;
8137 type_t *const orig_type_right = right->base.type;
8138 type_t *const type_left = skip_typeref(orig_type_left);
8139 type_t *const type_right = skip_typeref(orig_type_right);
8142 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8143 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8144 expression->left = create_implicit_cast(left, arithmetic_type);
8145 expression->right = create_implicit_cast(right, arithmetic_type);
8146 expression->base.type = arithmetic_type;
8147 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8148 check_pointer_arithmetic(&expression->base.source_position,
8149 type_left, orig_type_left);
8150 expression->base.type = type_left;
8151 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8152 check_pointer_arithmetic(&expression->base.source_position,
8153 type_right, orig_type_right);
8154 expression->base.type = type_right;
8155 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8156 errorf(&expression->base.source_position,
8157 "invalid operands to binary + ('%T', '%T')",
8158 orig_type_left, orig_type_right);
8162 static void semantic_sub(binary_expression_t *expression)
8164 expression_t *const left = expression->left;
8165 expression_t *const right = expression->right;
8166 type_t *const orig_type_left = left->base.type;
8167 type_t *const orig_type_right = right->base.type;
8168 type_t *const type_left = skip_typeref(orig_type_left);
8169 type_t *const type_right = skip_typeref(orig_type_right);
8170 source_position_t const *const pos = &expression->base.source_position;
8173 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8174 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8175 expression->left = create_implicit_cast(left, arithmetic_type);
8176 expression->right = create_implicit_cast(right, arithmetic_type);
8177 expression->base.type = arithmetic_type;
8178 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8179 check_pointer_arithmetic(&expression->base.source_position,
8180 type_left, orig_type_left);
8181 expression->base.type = type_left;
8182 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8183 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
8184 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
8185 if (!types_compatible(unqual_left, unqual_right)) {
8187 "subtracting pointers to incompatible types '%T' and '%T'",
8188 orig_type_left, orig_type_right);
8189 } else if (!is_type_object(unqual_left)) {
8190 if (!is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
8191 errorf(pos, "subtracting pointers to non-object types '%T'",
8194 warningf(WARN_OTHER, pos, "subtracting pointers to void");
8197 expression->base.type = type_ptrdiff_t;
8198 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8199 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8200 orig_type_left, orig_type_right);
8204 static void warn_string_literal_address(expression_t const* expr)
8206 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8207 expr = expr->unary.value;
8208 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8210 expr = expr->unary.value;
8213 if (expr->kind == EXPR_STRING_LITERAL
8214 || expr->kind == EXPR_WIDE_STRING_LITERAL) {
8215 source_position_t const *const pos = &expr->base.source_position;
8216 warningf(WARN_ADDRESS, pos, "comparison with string literal results in unspecified behaviour");
8220 static bool maybe_negative(expression_t const *const expr)
8222 switch (is_constant_expression(expr)) {
8223 case EXPR_CLASS_ERROR: return false;
8224 case EXPR_CLASS_CONSTANT: return constant_is_negative(expr);
8225 default: return true;
8229 static void warn_comparison(source_position_t const *const pos, expression_t const *const expr, expression_t const *const other)
8231 warn_string_literal_address(expr);
8233 expression_t const* const ref = get_reference_address(expr);
8234 if (ref != NULL && is_null_pointer_constant(other)) {
8235 entity_t const *const ent = ref->reference.entity;
8236 warningf(WARN_ADDRESS, pos, "the address of '%N' will never be NULL", ent);
8239 if (!expr->base.parenthesized) {
8240 switch (expr->base.kind) {
8241 case EXPR_BINARY_LESS:
8242 case EXPR_BINARY_GREATER:
8243 case EXPR_BINARY_LESSEQUAL:
8244 case EXPR_BINARY_GREATEREQUAL:
8245 case EXPR_BINARY_NOTEQUAL:
8246 case EXPR_BINARY_EQUAL:
8247 warningf(WARN_PARENTHESES, pos, "comparisons like 'x <= y < z' do not have their mathematical meaning");
8256 * Check the semantics of comparison expressions.
8258 * @param expression The expression to check.
8260 static void semantic_comparison(binary_expression_t *expression)
8262 source_position_t const *const pos = &expression->base.source_position;
8263 expression_t *const left = expression->left;
8264 expression_t *const right = expression->right;
8266 warn_comparison(pos, left, right);
8267 warn_comparison(pos, right, left);
8269 type_t *orig_type_left = left->base.type;
8270 type_t *orig_type_right = right->base.type;
8271 type_t *type_left = skip_typeref(orig_type_left);
8272 type_t *type_right = skip_typeref(orig_type_right);
8274 /* TODO non-arithmetic types */
8275 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8276 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8278 /* test for signed vs unsigned compares */
8279 if (is_type_integer(arithmetic_type)) {
8280 bool const signed_left = is_type_signed(type_left);
8281 bool const signed_right = is_type_signed(type_right);
8282 if (signed_left != signed_right) {
8283 /* FIXME long long needs better const folding magic */
8284 /* TODO check whether constant value can be represented by other type */
8285 if ((signed_left && maybe_negative(left)) ||
8286 (signed_right && maybe_negative(right))) {
8287 warningf(WARN_SIGN_COMPARE, pos, "comparison between signed and unsigned");
8292 expression->left = create_implicit_cast(left, arithmetic_type);
8293 expression->right = create_implicit_cast(right, arithmetic_type);
8294 expression->base.type = arithmetic_type;
8295 if ((expression->base.kind == EXPR_BINARY_EQUAL ||
8296 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8297 is_type_float(arithmetic_type)) {
8298 warningf(WARN_FLOAT_EQUAL, pos, "comparing floating point with == or != is unsafe");
8300 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8301 /* TODO check compatibility */
8302 } else if (is_type_pointer(type_left)) {
8303 expression->right = create_implicit_cast(right, type_left);
8304 } else if (is_type_pointer(type_right)) {
8305 expression->left = create_implicit_cast(left, type_right);
8306 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8307 type_error_incompatible("invalid operands in comparison", pos, type_left, type_right);
8309 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8313 * Checks if a compound type has constant fields.
8315 static bool has_const_fields(const compound_type_t *type)
8317 compound_t *compound = type->compound;
8318 entity_t *entry = compound->members.entities;
8320 for (; entry != NULL; entry = entry->base.next) {
8321 if (!is_declaration(entry))
8324 const type_t *decl_type = skip_typeref(entry->declaration.type);
8325 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8332 static bool is_valid_assignment_lhs(expression_t const* const left)
8334 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8335 type_t *const type_left = skip_typeref(orig_type_left);
8337 if (!is_lvalue(left)) {
8338 errorf(&left->base.source_position, "left hand side '%E' of assignment is not an lvalue",
8343 if (left->kind == EXPR_REFERENCE
8344 && left->reference.entity->kind == ENTITY_FUNCTION) {
8345 errorf(&left->base.source_position, "cannot assign to function '%E'", left);
8349 if (is_type_array(type_left)) {
8350 errorf(&left->base.source_position, "cannot assign to array '%E'", left);
8353 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8354 errorf(&left->base.source_position, "assignment to read-only location '%E' (type '%T')", left,
8358 if (is_type_incomplete(type_left)) {
8359 errorf(&left->base.source_position, "left-hand side '%E' of assignment has incomplete type '%T'",
8360 left, orig_type_left);
8363 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8364 errorf(&left->base.source_position, "cannot assign to '%E' because compound type '%T' has read-only fields",
8365 left, orig_type_left);
8372 static void semantic_arithmetic_assign(binary_expression_t *expression)
8374 expression_t *left = expression->left;
8375 expression_t *right = expression->right;
8376 type_t *orig_type_left = left->base.type;
8377 type_t *orig_type_right = right->base.type;
8379 if (!is_valid_assignment_lhs(left))
8382 type_t *type_left = skip_typeref(orig_type_left);
8383 type_t *type_right = skip_typeref(orig_type_right);
8385 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8386 /* TODO: improve error message */
8387 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8388 errorf(&expression->base.source_position,
8389 "operation needs arithmetic types");
8394 /* combined instructions are tricky. We can't create an implicit cast on
8395 * the left side, because we need the uncasted form for the store.
8396 * The ast2firm pass has to know that left_type must be right_type
8397 * for the arithmetic operation and create a cast by itself */
8398 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8399 expression->right = create_implicit_cast(right, arithmetic_type);
8400 expression->base.type = type_left;
8403 static void semantic_divmod_assign(binary_expression_t *expression)
8405 semantic_arithmetic_assign(expression);
8406 warn_div_by_zero(expression);
8409 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8411 expression_t *const left = expression->left;
8412 expression_t *const right = expression->right;
8413 type_t *const orig_type_left = left->base.type;
8414 type_t *const orig_type_right = right->base.type;
8415 type_t *const type_left = skip_typeref(orig_type_left);
8416 type_t *const type_right = skip_typeref(orig_type_right);
8418 if (!is_valid_assignment_lhs(left))
8421 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8422 /* combined instructions are tricky. We can't create an implicit cast on
8423 * the left side, because we need the uncasted form for the store.
8424 * The ast2firm pass has to know that left_type must be right_type
8425 * for the arithmetic operation and create a cast by itself */
8426 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8427 expression->right = create_implicit_cast(right, arithmetic_type);
8428 expression->base.type = type_left;
8429 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8430 check_pointer_arithmetic(&expression->base.source_position,
8431 type_left, orig_type_left);
8432 expression->base.type = type_left;
8433 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8434 errorf(&expression->base.source_position,
8435 "incompatible types '%T' and '%T' in assignment",
8436 orig_type_left, orig_type_right);
8440 static void semantic_integer_assign(binary_expression_t *expression)
8442 expression_t *left = expression->left;
8443 expression_t *right = expression->right;
8444 type_t *orig_type_left = left->base.type;
8445 type_t *orig_type_right = right->base.type;
8447 if (!is_valid_assignment_lhs(left))
8450 type_t *type_left = skip_typeref(orig_type_left);
8451 type_t *type_right = skip_typeref(orig_type_right);
8453 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8454 /* TODO: improve error message */
8455 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8456 errorf(&expression->base.source_position,
8457 "operation needs integer types");
8462 /* combined instructions are tricky. We can't create an implicit cast on
8463 * the left side, because we need the uncasted form for the store.
8464 * The ast2firm pass has to know that left_type must be right_type
8465 * for the arithmetic operation and create a cast by itself */
8466 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8467 expression->right = create_implicit_cast(right, arithmetic_type);
8468 expression->base.type = type_left;
8471 static void semantic_shift_assign(binary_expression_t *expression)
8473 expression_t *left = expression->left;
8475 if (!is_valid_assignment_lhs(left))
8478 if (!semantic_shift(expression))
8481 expression->base.type = skip_typeref(left->base.type);
8484 static void warn_logical_and_within_or(const expression_t *const expr)
8486 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8488 if (expr->base.parenthesized)
8490 source_position_t const *const pos = &expr->base.source_position;
8491 warningf(WARN_PARENTHESES, pos, "suggest parentheses around && within ||");
8495 * Check the semantic restrictions of a logical expression.
8497 static void semantic_logical_op(binary_expression_t *expression)
8499 /* §6.5.13:2 Each of the operands shall have scalar type.
8500 * §6.5.14:2 Each of the operands shall have scalar type. */
8501 semantic_condition(expression->left, "left operand of logical operator");
8502 semantic_condition(expression->right, "right operand of logical operator");
8503 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR) {
8504 warn_logical_and_within_or(expression->left);
8505 warn_logical_and_within_or(expression->right);
8507 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8511 * Check the semantic restrictions of a binary assign expression.
8513 static void semantic_binexpr_assign(binary_expression_t *expression)
8515 expression_t *left = expression->left;
8516 type_t *orig_type_left = left->base.type;
8518 if (!is_valid_assignment_lhs(left))
8521 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8522 report_assign_error(error, orig_type_left, expression->right,
8523 "assignment", &left->base.source_position);
8524 expression->right = create_implicit_cast(expression->right, orig_type_left);
8525 expression->base.type = orig_type_left;
8529 * Determine if the outermost operation (or parts thereof) of the given
8530 * expression has no effect in order to generate a warning about this fact.
8531 * Therefore in some cases this only examines some of the operands of the
8532 * expression (see comments in the function and examples below).
8534 * f() + 23; // warning, because + has no effect
8535 * x || f(); // no warning, because x controls execution of f()
8536 * x ? y : f(); // warning, because y has no effect
8537 * (void)x; // no warning to be able to suppress the warning
8538 * This function can NOT be used for an "expression has definitely no effect"-
8540 static bool expression_has_effect(const expression_t *const expr)
8542 switch (expr->kind) {
8543 case EXPR_ERROR: return true; /* do NOT warn */
8544 case EXPR_REFERENCE: return false;
8545 case EXPR_REFERENCE_ENUM_VALUE: return false;
8546 case EXPR_LABEL_ADDRESS: return false;
8548 /* suppress the warning for microsoft __noop operations */
8549 case EXPR_LITERAL_MS_NOOP: return true;
8550 case EXPR_LITERAL_BOOLEAN:
8551 case EXPR_LITERAL_CHARACTER:
8552 case EXPR_LITERAL_WIDE_CHARACTER:
8553 case EXPR_LITERAL_INTEGER:
8554 case EXPR_LITERAL_INTEGER_OCTAL:
8555 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
8556 case EXPR_LITERAL_FLOATINGPOINT:
8557 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: return false;
8558 case EXPR_STRING_LITERAL: return false;
8559 case EXPR_WIDE_STRING_LITERAL: return false;
8562 const call_expression_t *const call = &expr->call;
8563 if (call->function->kind != EXPR_REFERENCE)
8566 switch (call->function->reference.entity->function.btk) {
8567 /* FIXME: which builtins have no effect? */
8568 default: return true;
8572 /* Generate the warning if either the left or right hand side of a
8573 * conditional expression has no effect */
8574 case EXPR_CONDITIONAL: {
8575 conditional_expression_t const *const cond = &expr->conditional;
8576 expression_t const *const t = cond->true_expression;
8578 (t == NULL || expression_has_effect(t)) &&
8579 expression_has_effect(cond->false_expression);
8582 case EXPR_SELECT: return false;
8583 case EXPR_ARRAY_ACCESS: return false;
8584 case EXPR_SIZEOF: return false;
8585 case EXPR_CLASSIFY_TYPE: return false;
8586 case EXPR_ALIGNOF: return false;
8588 case EXPR_FUNCNAME: return false;
8589 case EXPR_BUILTIN_CONSTANT_P: return false;
8590 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8591 case EXPR_OFFSETOF: return false;
8592 case EXPR_VA_START: return true;
8593 case EXPR_VA_ARG: return true;
8594 case EXPR_VA_COPY: return true;
8595 case EXPR_STATEMENT: return true; // TODO
8596 case EXPR_COMPOUND_LITERAL: return false;
8598 case EXPR_UNARY_NEGATE: return false;
8599 case EXPR_UNARY_PLUS: return false;
8600 case EXPR_UNARY_BITWISE_NEGATE: return false;
8601 case EXPR_UNARY_NOT: return false;
8602 case EXPR_UNARY_DEREFERENCE: return false;
8603 case EXPR_UNARY_TAKE_ADDRESS: return false;
8604 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8605 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8606 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8607 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8609 /* Treat void casts as if they have an effect in order to being able to
8610 * suppress the warning */
8611 case EXPR_UNARY_CAST: {
8612 type_t *const type = skip_typeref(expr->base.type);
8613 return is_type_atomic(type, ATOMIC_TYPE_VOID);
8616 case EXPR_UNARY_ASSUME: return true;
8617 case EXPR_UNARY_DELETE: return true;
8618 case EXPR_UNARY_DELETE_ARRAY: return true;
8619 case EXPR_UNARY_THROW: return true;
8621 case EXPR_BINARY_ADD: return false;
8622 case EXPR_BINARY_SUB: return false;
8623 case EXPR_BINARY_MUL: return false;
8624 case EXPR_BINARY_DIV: return false;
8625 case EXPR_BINARY_MOD: return false;
8626 case EXPR_BINARY_EQUAL: return false;
8627 case EXPR_BINARY_NOTEQUAL: return false;
8628 case EXPR_BINARY_LESS: return false;
8629 case EXPR_BINARY_LESSEQUAL: return false;
8630 case EXPR_BINARY_GREATER: return false;
8631 case EXPR_BINARY_GREATEREQUAL: return false;
8632 case EXPR_BINARY_BITWISE_AND: return false;
8633 case EXPR_BINARY_BITWISE_OR: return false;
8634 case EXPR_BINARY_BITWISE_XOR: return false;
8635 case EXPR_BINARY_SHIFTLEFT: return false;
8636 case EXPR_BINARY_SHIFTRIGHT: return false;
8637 case EXPR_BINARY_ASSIGN: return true;
8638 case EXPR_BINARY_MUL_ASSIGN: return true;
8639 case EXPR_BINARY_DIV_ASSIGN: return true;
8640 case EXPR_BINARY_MOD_ASSIGN: return true;
8641 case EXPR_BINARY_ADD_ASSIGN: return true;
8642 case EXPR_BINARY_SUB_ASSIGN: return true;
8643 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8644 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8645 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8646 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8647 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8649 /* Only examine the right hand side of && and ||, because the left hand
8650 * side already has the effect of controlling the execution of the right
8652 case EXPR_BINARY_LOGICAL_AND:
8653 case EXPR_BINARY_LOGICAL_OR:
8654 /* Only examine the right hand side of a comma expression, because the left
8655 * hand side has a separate warning */
8656 case EXPR_BINARY_COMMA:
8657 return expression_has_effect(expr->binary.right);
8659 case EXPR_BINARY_ISGREATER: return false;
8660 case EXPR_BINARY_ISGREATEREQUAL: return false;
8661 case EXPR_BINARY_ISLESS: return false;
8662 case EXPR_BINARY_ISLESSEQUAL: return false;
8663 case EXPR_BINARY_ISLESSGREATER: return false;
8664 case EXPR_BINARY_ISUNORDERED: return false;
8667 internal_errorf(HERE, "unexpected expression");
8670 static void semantic_comma(binary_expression_t *expression)
8672 const expression_t *const left = expression->left;
8673 if (!expression_has_effect(left)) {
8674 source_position_t const *const pos = &left->base.source_position;
8675 warningf(WARN_UNUSED_VALUE, pos, "left-hand operand of comma expression has no effect");
8677 expression->base.type = expression->right->base.type;
8681 * @param prec_r precedence of the right operand
8683 #define CREATE_BINEXPR_PARSER(token_kind, binexpression_type, prec_r, sfunc) \
8684 static expression_t *parse_##binexpression_type(expression_t *left) \
8686 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8687 binexpr->binary.left = left; \
8690 expression_t *right = parse_subexpression(prec_r); \
8692 binexpr->binary.right = right; \
8693 sfunc(&binexpr->binary); \
8698 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8699 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
8700 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
8701 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8702 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8703 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8704 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8705 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
8706 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
8707 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
8708 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
8709 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
8710 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
8711 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_integer)
8712 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_integer)
8713 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_integer)
8714 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8715 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8716 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
8717 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8718 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8719 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8720 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8721 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8722 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8723 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8724 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8725 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8726 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8727 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
8730 static expression_t *parse_subexpression(precedence_t precedence)
8732 if (token.kind < 0) {
8733 return expected_expression_error();
8736 expression_parser_function_t *parser
8737 = &expression_parsers[token.kind];
8740 if (parser->parser != NULL) {
8741 left = parser->parser();
8743 left = parse_primary_expression();
8745 assert(left != NULL);
8748 if (token.kind < 0) {
8749 return expected_expression_error();
8752 parser = &expression_parsers[token.kind];
8753 if (parser->infix_parser == NULL)
8755 if (parser->infix_precedence < precedence)
8758 left = parser->infix_parser(left);
8760 assert(left != NULL);
8767 * Parse an expression.
8769 static expression_t *parse_expression(void)
8771 return parse_subexpression(PREC_EXPRESSION);
8775 * Register a parser for a prefix-like operator.
8777 * @param parser the parser function
8778 * @param token_kind the token type of the prefix token
8780 static void register_expression_parser(parse_expression_function parser,
8783 expression_parser_function_t *entry = &expression_parsers[token_kind];
8785 if (entry->parser != NULL) {
8786 diagnosticf("for token '%k'\n", (token_kind_t)token_kind);
8787 panic("trying to register multiple expression parsers for a token");
8789 entry->parser = parser;
8793 * Register a parser for an infix operator with given precedence.
8795 * @param parser the parser function
8796 * @param token_kind the token type of the infix operator
8797 * @param precedence the precedence of the operator
8799 static void register_infix_parser(parse_expression_infix_function parser,
8800 int token_kind, precedence_t precedence)
8802 expression_parser_function_t *entry = &expression_parsers[token_kind];
8804 if (entry->infix_parser != NULL) {
8805 diagnosticf("for token '%k'\n", (token_kind_t)token_kind);
8806 panic("trying to register multiple infix expression parsers for a "
8809 entry->infix_parser = parser;
8810 entry->infix_precedence = precedence;
8814 * Initialize the expression parsers.
8816 static void init_expression_parsers(void)
8818 memset(&expression_parsers, 0, sizeof(expression_parsers));
8820 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
8821 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
8822 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
8823 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
8824 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
8825 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
8826 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
8827 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
8828 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
8829 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
8830 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
8831 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
8832 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
8833 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
8834 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
8835 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
8836 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
8837 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
8838 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
8839 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
8840 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
8841 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
8842 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
8843 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
8844 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
8845 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
8846 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
8847 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
8848 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
8849 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
8850 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
8851 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
8852 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
8853 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
8854 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
8855 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
8856 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
8858 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
8859 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
8860 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
8861 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
8862 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
8863 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
8864 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
8865 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
8866 register_expression_parser(parse_sizeof, T_sizeof);
8867 register_expression_parser(parse_alignof, T___alignof__);
8868 register_expression_parser(parse_extension, T___extension__);
8869 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
8870 register_expression_parser(parse_delete, T_delete);
8871 register_expression_parser(parse_throw, T_throw);
8875 * Parse a asm statement arguments specification.
8877 static asm_argument_t *parse_asm_arguments(bool is_out)
8879 asm_argument_t *result = NULL;
8880 asm_argument_t **anchor = &result;
8882 while (token.kind == T_STRING_LITERAL || token.kind == '[') {
8883 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
8884 memset(argument, 0, sizeof(argument[0]));
8887 if (token.kind != T_IDENTIFIER) {
8888 parse_error_expected("while parsing asm argument",
8889 T_IDENTIFIER, NULL);
8892 argument->symbol = token.identifier.symbol;
8894 expect(']', end_error);
8897 argument->constraints = parse_string_literals();
8898 expect('(', end_error);
8899 add_anchor_token(')');
8900 expression_t *expression = parse_expression();
8901 rem_anchor_token(')');
8903 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
8904 * change size or type representation (e.g. int -> long is ok, but
8905 * int -> float is not) */
8906 if (expression->kind == EXPR_UNARY_CAST) {
8907 type_t *const type = expression->base.type;
8908 type_kind_t const kind = type->kind;
8909 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
8912 if (kind == TYPE_ATOMIC) {
8913 atomic_type_kind_t const akind = type->atomic.akind;
8914 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8915 size = get_atomic_type_size(akind);
8917 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8918 size = get_type_size(type_void_ptr);
8922 expression_t *const value = expression->unary.value;
8923 type_t *const value_type = value->base.type;
8924 type_kind_t const value_kind = value_type->kind;
8926 unsigned value_flags;
8927 unsigned value_size;
8928 if (value_kind == TYPE_ATOMIC) {
8929 atomic_type_kind_t const value_akind = value_type->atomic.akind;
8930 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8931 value_size = get_atomic_type_size(value_akind);
8932 } else if (value_kind == TYPE_POINTER) {
8933 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8934 value_size = get_type_size(type_void_ptr);
8939 if (value_flags != flags || value_size != size)
8943 } while (expression->kind == EXPR_UNARY_CAST);
8947 if (!is_lvalue(expression)) {
8948 errorf(&expression->base.source_position,
8949 "asm output argument is not an lvalue");
8952 if (argument->constraints.begin[0] == '=')
8953 determine_lhs_ent(expression, NULL);
8955 mark_vars_read(expression, NULL);
8957 mark_vars_read(expression, NULL);
8959 argument->expression = expression;
8960 expect(')', end_error);
8962 set_address_taken(expression, true);
8965 anchor = &argument->next;
8977 * Parse a asm statement clobber specification.
8979 static asm_clobber_t *parse_asm_clobbers(void)
8981 asm_clobber_t *result = NULL;
8982 asm_clobber_t **anchor = &result;
8984 while (token.kind == T_STRING_LITERAL) {
8985 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
8986 clobber->clobber = parse_string_literals();
8989 anchor = &clobber->next;
8999 * Parse an asm statement.
9001 static statement_t *parse_asm_statement(void)
9003 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
9004 asm_statement_t *asm_statement = &statement->asms;
9008 if (next_if(T_volatile))
9009 asm_statement->is_volatile = true;
9011 expect('(', end_error);
9012 add_anchor_token(')');
9013 if (token.kind != T_STRING_LITERAL) {
9014 parse_error_expected("after asm(", T_STRING_LITERAL, NULL);
9017 asm_statement->asm_text = parse_string_literals();
9019 add_anchor_token(':');
9020 if (!next_if(':')) {
9021 rem_anchor_token(':');
9025 asm_statement->outputs = parse_asm_arguments(true);
9026 if (!next_if(':')) {
9027 rem_anchor_token(':');
9031 asm_statement->inputs = parse_asm_arguments(false);
9032 if (!next_if(':')) {
9033 rem_anchor_token(':');
9036 rem_anchor_token(':');
9038 asm_statement->clobbers = parse_asm_clobbers();
9041 rem_anchor_token(')');
9042 expect(')', end_error);
9043 expect(';', end_error);
9045 if (asm_statement->outputs == NULL) {
9046 /* GCC: An 'asm' instruction without any output operands will be treated
9047 * identically to a volatile 'asm' instruction. */
9048 asm_statement->is_volatile = true;
9053 return create_error_statement();
9056 static statement_t *parse_label_inner_statement(statement_t const *const label, char const *const label_kind)
9058 statement_t *inner_stmt;
9059 switch (token.kind) {
9061 errorf(&label->base.source_position, "%s at end of compound statement", label_kind);
9062 inner_stmt = create_error_statement();
9066 if (label->kind == STATEMENT_LABEL) {
9067 /* Eat an empty statement here, to avoid the warning about an empty
9068 * statement after a label. label:; is commonly used to have a label
9069 * before a closing brace. */
9070 inner_stmt = create_empty_statement();
9077 inner_stmt = parse_statement();
9078 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
9079 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
9080 if (inner_stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
9081 errorf(&inner_stmt->base.source_position, "declaration after %s", label_kind);
9089 * Parse a case statement.
9091 static statement_t *parse_case_statement(void)
9093 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9094 source_position_t *const pos = &statement->base.source_position;
9098 expression_t *expression = parse_expression();
9099 type_t *expression_type = expression->base.type;
9100 type_t *skipped = skip_typeref(expression_type);
9101 if (!is_type_integer(skipped) && is_type_valid(skipped)) {
9102 errorf(pos, "case expression '%E' must have integer type but has type '%T'",
9103 expression, expression_type);
9106 type_t *type = expression_type;
9107 if (current_switch != NULL) {
9108 type_t *switch_type = current_switch->expression->base.type;
9109 if (is_type_valid(switch_type)) {
9110 expression = create_implicit_cast(expression, switch_type);
9114 statement->case_label.expression = expression;
9115 expression_classification_t const expr_class = is_constant_expression(expression);
9116 if (expr_class != EXPR_CLASS_CONSTANT) {
9117 if (expr_class != EXPR_CLASS_ERROR) {
9118 errorf(pos, "case label does not reduce to an integer constant");
9120 statement->case_label.is_bad = true;
9122 long const val = fold_constant_to_int(expression);
9123 statement->case_label.first_case = val;
9124 statement->case_label.last_case = val;
9128 if (next_if(T_DOTDOTDOT)) {
9129 expression_t *end_range = parse_expression();
9130 expression_type = expression->base.type;
9131 skipped = skip_typeref(expression_type);
9132 if (!is_type_integer(skipped) && is_type_valid(skipped)) {
9133 errorf(pos, "case expression '%E' must have integer type but has type '%T'",
9134 expression, expression_type);
9137 end_range = create_implicit_cast(end_range, type);
9138 statement->case_label.end_range = end_range;
9139 expression_classification_t const end_class = is_constant_expression(end_range);
9140 if (end_class != EXPR_CLASS_CONSTANT) {
9141 if (end_class != EXPR_CLASS_ERROR) {
9142 errorf(pos, "case range does not reduce to an integer constant");
9144 statement->case_label.is_bad = true;
9146 long const val = fold_constant_to_int(end_range);
9147 statement->case_label.last_case = val;
9149 if (val < statement->case_label.first_case) {
9150 statement->case_label.is_empty_range = true;
9151 warningf(WARN_OTHER, pos, "empty range specified");
9157 PUSH_PARENT(statement);
9159 expect(':', end_error);
9162 if (current_switch != NULL) {
9163 if (! statement->case_label.is_bad) {
9164 /* Check for duplicate case values */
9165 case_label_statement_t *c = &statement->case_label;
9166 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9167 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9170 if (c->last_case < l->first_case || c->first_case > l->last_case)
9173 errorf(pos, "duplicate case value (previously used %P)",
9174 &l->base.source_position);
9178 /* link all cases into the switch statement */
9179 if (current_switch->last_case == NULL) {
9180 current_switch->first_case = &statement->case_label;
9182 current_switch->last_case->next = &statement->case_label;
9184 current_switch->last_case = &statement->case_label;
9186 errorf(pos, "case label not within a switch statement");
9189 statement->case_label.statement = parse_label_inner_statement(statement, "case label");
9196 * Parse a default statement.
9198 static statement_t *parse_default_statement(void)
9200 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9204 PUSH_PARENT(statement);
9206 expect(':', end_error);
9209 if (current_switch != NULL) {
9210 const case_label_statement_t *def_label = current_switch->default_label;
9211 if (def_label != NULL) {
9212 errorf(&statement->base.source_position, "multiple default labels in one switch (previous declared %P)", &def_label->base.source_position);
9214 current_switch->default_label = &statement->case_label;
9216 /* link all cases into the switch statement */
9217 if (current_switch->last_case == NULL) {
9218 current_switch->first_case = &statement->case_label;
9220 current_switch->last_case->next = &statement->case_label;
9222 current_switch->last_case = &statement->case_label;
9225 errorf(&statement->base.source_position,
9226 "'default' label not within a switch statement");
9229 statement->case_label.statement = parse_label_inner_statement(statement, "default label");
9236 * Parse a label statement.
9238 static statement_t *parse_label_statement(void)
9240 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9241 label_t *const label = get_label();
9242 statement->label.label = label;
9244 PUSH_PARENT(statement);
9246 /* if statement is already set then the label is defined twice,
9247 * otherwise it was just mentioned in a goto/local label declaration so far
9249 source_position_t const* const pos = &statement->base.source_position;
9250 if (label->statement != NULL) {
9251 errorf(pos, "duplicate '%N' (declared %P)", (entity_t const*)label, &label->base.source_position);
9253 label->base.source_position = *pos;
9254 label->statement = statement;
9259 if (token.kind == T___attribute__ && !(c_mode & _CXX)) {
9260 parse_attributes(NULL); // TODO process attributes
9263 statement->label.statement = parse_label_inner_statement(statement, "label");
9265 /* remember the labels in a list for later checking */
9266 *label_anchor = &statement->label;
9267 label_anchor = &statement->label.next;
9273 static statement_t *parse_inner_statement(void)
9275 statement_t *const stmt = parse_statement();
9276 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
9277 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
9278 if (stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
9279 errorf(&stmt->base.source_position, "declaration as inner statement, use {}");
9285 * Parse an if statement.
9287 static statement_t *parse_if(void)
9289 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9293 PUSH_PARENT(statement);
9295 add_anchor_token('{');
9297 expect('(', end_error);
9298 add_anchor_token(')');
9299 expression_t *const expr = parse_expression();
9300 statement->ifs.condition = expr;
9301 /* §6.8.4.1:1 The controlling expression of an if statement shall have
9303 semantic_condition(expr, "condition of 'if'-statment");
9304 mark_vars_read(expr, NULL);
9305 rem_anchor_token(')');
9306 expect(')', end_error);
9309 rem_anchor_token('{');
9311 add_anchor_token(T_else);
9312 statement_t *const true_stmt = parse_inner_statement();
9313 statement->ifs.true_statement = true_stmt;
9314 rem_anchor_token(T_else);
9316 if (true_stmt->kind == STATEMENT_EMPTY) {
9317 warningf(WARN_EMPTY_BODY, HERE,
9318 "suggest braces around empty body in an ‘if’ statement");
9321 if (next_if(T_else)) {
9322 statement->ifs.false_statement = parse_inner_statement();
9324 if (statement->ifs.false_statement->kind == STATEMENT_EMPTY) {
9325 warningf(WARN_EMPTY_BODY, HERE,
9326 "suggest braces around empty body in an ‘if’ statement");
9328 } else if (true_stmt->kind == STATEMENT_IF &&
9329 true_stmt->ifs.false_statement != NULL) {
9330 source_position_t const *const pos = &true_stmt->base.source_position;
9331 warningf(WARN_PARENTHESES, pos, "suggest explicit braces to avoid ambiguous 'else'");
9339 * Check that all enums are handled in a switch.
9341 * @param statement the switch statement to check
9343 static void check_enum_cases(const switch_statement_t *statement)
9345 if (!is_warn_on(WARN_SWITCH_ENUM))
9347 const type_t *type = skip_typeref(statement->expression->base.type);
9348 if (! is_type_enum(type))
9350 const enum_type_t *enumt = &type->enumt;
9352 /* if we have a default, no warnings */
9353 if (statement->default_label != NULL)
9356 /* FIXME: calculation of value should be done while parsing */
9357 /* TODO: quadratic algorithm here. Change to an n log n one */
9358 long last_value = -1;
9359 const entity_t *entry = enumt->enume->base.next;
9360 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9361 entry = entry->base.next) {
9362 const expression_t *expression = entry->enum_value.value;
9363 long value = expression != NULL ? fold_constant_to_int(expression) : last_value + 1;
9365 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9366 if (l->expression == NULL)
9368 if (l->first_case <= value && value <= l->last_case) {
9374 source_position_t const *const pos = &statement->base.source_position;
9375 warningf(WARN_SWITCH_ENUM, pos, "'%N' not handled in switch", entry);
9382 * Parse a switch statement.
9384 static statement_t *parse_switch(void)
9386 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9390 PUSH_PARENT(statement);
9392 expect('(', end_error);
9393 add_anchor_token(')');
9394 expression_t *const expr = parse_expression();
9395 mark_vars_read(expr, NULL);
9396 type_t * type = skip_typeref(expr->base.type);
9397 if (is_type_integer(type)) {
9398 type = promote_integer(type);
9399 if (get_akind_rank(get_akind(type)) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9400 warningf(WARN_TRADITIONAL, &expr->base.source_position, "'%T' switch expression not converted to '%T' in ISO C", type, type_int);
9402 } else if (is_type_valid(type)) {
9403 errorf(&expr->base.source_position,
9404 "switch quantity is not an integer, but '%T'", type);
9405 type = type_error_type;
9407 statement->switchs.expression = create_implicit_cast(expr, type);
9408 expect(')', end_error);
9409 rem_anchor_token(')');
9411 switch_statement_t *rem = current_switch;
9412 current_switch = &statement->switchs;
9413 statement->switchs.body = parse_inner_statement();
9414 current_switch = rem;
9416 if (statement->switchs.default_label == NULL) {
9417 warningf(WARN_SWITCH_DEFAULT, &statement->base.source_position, "switch has no default case");
9419 check_enum_cases(&statement->switchs);
9425 return create_error_statement();
9428 static statement_t *parse_loop_body(statement_t *const loop)
9430 statement_t *const rem = current_loop;
9431 current_loop = loop;
9433 statement_t *const body = parse_inner_statement();
9440 * Parse a while statement.
9442 static statement_t *parse_while(void)
9444 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9448 PUSH_PARENT(statement);
9450 expect('(', end_error);
9451 add_anchor_token(')');
9452 expression_t *const cond = parse_expression();
9453 statement->whiles.condition = cond;
9454 /* §6.8.5:2 The controlling expression of an iteration statement shall
9455 * have scalar type. */
9456 semantic_condition(cond, "condition of 'while'-statement");
9457 mark_vars_read(cond, NULL);
9458 rem_anchor_token(')');
9459 expect(')', end_error);
9461 statement->whiles.body = parse_loop_body(statement);
9467 return create_error_statement();
9471 * Parse a do statement.
9473 static statement_t *parse_do(void)
9475 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9479 PUSH_PARENT(statement);
9481 add_anchor_token(T_while);
9482 statement->do_while.body = parse_loop_body(statement);
9483 rem_anchor_token(T_while);
9485 expect(T_while, end_error);
9486 expect('(', end_error);
9487 add_anchor_token(')');
9488 expression_t *const cond = parse_expression();
9489 statement->do_while.condition = cond;
9490 /* §6.8.5:2 The controlling expression of an iteration statement shall
9491 * have scalar type. */
9492 semantic_condition(cond, "condition of 'do-while'-statement");
9493 mark_vars_read(cond, NULL);
9494 rem_anchor_token(')');
9495 expect(')', end_error);
9496 expect(';', end_error);
9502 return create_error_statement();
9506 * Parse a for statement.
9508 static statement_t *parse_for(void)
9510 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9514 expect('(', end_error1);
9515 add_anchor_token(')');
9517 PUSH_PARENT(statement);
9518 PUSH_SCOPE(&statement->fors.scope);
9523 } else if (is_declaration_specifier(&token)) {
9524 parse_declaration(record_entity, DECL_FLAGS_NONE);
9526 add_anchor_token(';');
9527 expression_t *const init = parse_expression();
9528 statement->fors.initialisation = init;
9529 mark_vars_read(init, ENT_ANY);
9530 if (!expression_has_effect(init)) {
9531 warningf(WARN_UNUSED_VALUE, &init->base.source_position, "initialisation of 'for'-statement has no effect");
9533 rem_anchor_token(';');
9534 expect(';', end_error2);
9539 if (token.kind != ';') {
9540 add_anchor_token(';');
9541 expression_t *const cond = parse_expression();
9542 statement->fors.condition = cond;
9543 /* §6.8.5:2 The controlling expression of an iteration statement
9544 * shall have scalar type. */
9545 semantic_condition(cond, "condition of 'for'-statement");
9546 mark_vars_read(cond, NULL);
9547 rem_anchor_token(';');
9549 expect(';', end_error2);
9550 if (token.kind != ')') {
9551 expression_t *const step = parse_expression();
9552 statement->fors.step = step;
9553 mark_vars_read(step, ENT_ANY);
9554 if (!expression_has_effect(step)) {
9555 warningf(WARN_UNUSED_VALUE, &step->base.source_position, "step of 'for'-statement has no effect");
9558 expect(')', end_error2);
9559 rem_anchor_token(')');
9560 statement->fors.body = parse_loop_body(statement);
9568 rem_anchor_token(')');
9573 return create_error_statement();
9577 * Parse a goto statement.
9579 static statement_t *parse_goto(void)
9581 statement_t *statement;
9582 if (GNU_MODE && look_ahead(1)->kind == '*') {
9583 statement = allocate_statement_zero(STATEMENT_COMPUTED_GOTO);
9587 expression_t *expression = parse_expression();
9588 mark_vars_read(expression, NULL);
9590 /* Argh: although documentation says the expression must be of type void*,
9591 * gcc accepts anything that can be casted into void* without error */
9592 type_t *type = expression->base.type;
9594 if (type != type_error_type) {
9595 if (!is_type_pointer(type) && !is_type_integer(type)) {
9596 errorf(&expression->base.source_position,
9597 "cannot convert to a pointer type");
9598 } else if (type != type_void_ptr) {
9599 warningf(WARN_OTHER, &expression->base.source_position, "type of computed goto expression should be 'void*' not '%T'", type);
9601 expression = create_implicit_cast(expression, type_void_ptr);
9604 statement->computed_goto.expression = expression;
9606 statement = allocate_statement_zero(STATEMENT_GOTO);
9608 if (token.kind == T_IDENTIFIER) {
9609 label_t *const label = get_label();
9611 statement->gotos.label = label;
9613 /* remember the goto's in a list for later checking */
9614 *goto_anchor = &statement->gotos;
9615 goto_anchor = &statement->gotos.next;
9618 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
9620 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
9622 return create_error_statement();
9626 expect(';', end_error);
9633 * Parse a continue statement.
9635 static statement_t *parse_continue(void)
9637 if (current_loop == NULL) {
9638 errorf(HERE, "continue statement not within loop");
9641 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9644 expect(';', end_error);
9651 * Parse a break statement.
9653 static statement_t *parse_break(void)
9655 if (current_switch == NULL && current_loop == NULL) {
9656 errorf(HERE, "break statement not within loop or switch");
9659 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9662 expect(';', end_error);
9669 * Parse a __leave statement.
9671 static statement_t *parse_leave_statement(void)
9673 if (current_try == NULL) {
9674 errorf(HERE, "__leave statement not within __try");
9677 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9680 expect(';', end_error);
9687 * Check if a given entity represents a local variable.
9689 static bool is_local_variable(const entity_t *entity)
9691 if (entity->kind != ENTITY_VARIABLE)
9694 switch ((storage_class_tag_t) entity->declaration.storage_class) {
9695 case STORAGE_CLASS_AUTO:
9696 case STORAGE_CLASS_REGISTER: {
9697 const type_t *type = skip_typeref(entity->declaration.type);
9698 if (is_type_function(type)) {
9710 * Check if a given expression represents a local variable.
9712 static bool expression_is_local_variable(const expression_t *expression)
9714 if (expression->base.kind != EXPR_REFERENCE) {
9717 const entity_t *entity = expression->reference.entity;
9718 return is_local_variable(entity);
9722 * Check if a given expression represents a local variable and
9723 * return its declaration then, else return NULL.
9725 entity_t *expression_is_variable(const expression_t *expression)
9727 if (expression->base.kind != EXPR_REFERENCE) {
9730 entity_t *entity = expression->reference.entity;
9731 if (entity->kind != ENTITY_VARIABLE)
9738 * Parse a return statement.
9740 static statement_t *parse_return(void)
9742 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9745 expression_t *return_value = NULL;
9746 if (token.kind != ';') {
9747 return_value = parse_expression();
9748 mark_vars_read(return_value, NULL);
9751 const type_t *const func_type = skip_typeref(current_function->base.type);
9752 assert(is_type_function(func_type));
9753 type_t *const return_type = skip_typeref(func_type->function.return_type);
9755 source_position_t const *const pos = &statement->base.source_position;
9756 if (return_value != NULL) {
9757 type_t *return_value_type = skip_typeref(return_value->base.type);
9759 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
9760 if (is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
9761 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
9762 /* Only warn in C mode, because GCC does the same */
9763 if (c_mode & _CXX || strict_mode) {
9765 "'return' with a value, in function returning 'void'");
9767 warningf(WARN_OTHER, pos, "'return' with a value, in function returning 'void'");
9769 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9770 /* Only warn in C mode, because GCC does the same */
9773 "'return' with expression in function returning 'void'");
9775 warningf(WARN_OTHER, pos, "'return' with expression in function returning 'void'");
9779 assign_error_t error = semantic_assign(return_type, return_value);
9780 report_assign_error(error, return_type, return_value, "'return'",
9783 return_value = create_implicit_cast(return_value, return_type);
9784 /* check for returning address of a local var */
9785 if (return_value != NULL && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
9786 const expression_t *expression = return_value->unary.value;
9787 if (expression_is_local_variable(expression)) {
9788 warningf(WARN_OTHER, pos, "function returns address of local variable");
9791 } else if (!is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
9792 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9793 if (c_mode & _CXX || strict_mode) {
9795 "'return' without value, in function returning non-void");
9797 warningf(WARN_OTHER, pos, "'return' without value, in function returning non-void");
9800 statement->returns.value = return_value;
9802 expect(';', end_error);
9809 * Parse a declaration statement.
9811 static statement_t *parse_declaration_statement(void)
9813 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9815 entity_t *before = current_scope->last_entity;
9817 parse_external_declaration();
9819 parse_declaration(record_entity, DECL_FLAGS_NONE);
9822 declaration_statement_t *const decl = &statement->declaration;
9823 entity_t *const begin =
9824 before != NULL ? before->base.next : current_scope->entities;
9825 decl->declarations_begin = begin;
9826 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
9832 * Parse an expression statement, ie. expr ';'.
9834 static statement_t *parse_expression_statement(void)
9836 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
9838 expression_t *const expr = parse_expression();
9839 statement->expression.expression = expr;
9840 mark_vars_read(expr, ENT_ANY);
9842 expect(';', end_error);
9849 * Parse a microsoft __try { } __finally { } or
9850 * __try{ } __except() { }
9852 static statement_t *parse_ms_try_statment(void)
9854 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
9857 PUSH_PARENT(statement);
9859 ms_try_statement_t *rem = current_try;
9860 current_try = &statement->ms_try;
9861 statement->ms_try.try_statement = parse_compound_statement(false);
9866 if (next_if(T___except)) {
9867 expect('(', end_error);
9868 add_anchor_token(')');
9869 expression_t *const expr = parse_expression();
9870 mark_vars_read(expr, NULL);
9871 type_t * type = skip_typeref(expr->base.type);
9872 if (is_type_integer(type)) {
9873 type = promote_integer(type);
9874 } else if (is_type_valid(type)) {
9875 errorf(&expr->base.source_position,
9876 "__expect expression is not an integer, but '%T'", type);
9877 type = type_error_type;
9879 statement->ms_try.except_expression = create_implicit_cast(expr, type);
9880 rem_anchor_token(')');
9881 expect(')', end_error);
9882 statement->ms_try.final_statement = parse_compound_statement(false);
9883 } else if (next_if(T__finally)) {
9884 statement->ms_try.final_statement = parse_compound_statement(false);
9886 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
9887 return create_error_statement();
9891 return create_error_statement();
9894 static statement_t *parse_empty_statement(void)
9896 warningf(WARN_EMPTY_STATEMENT, HERE, "statement is empty");
9897 statement_t *const statement = create_empty_statement();
9902 static statement_t *parse_local_label_declaration(void)
9904 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9908 entity_t *begin = NULL;
9909 entity_t *end = NULL;
9910 entity_t **anchor = &begin;
9912 if (token.kind != T_IDENTIFIER) {
9913 parse_error_expected("while parsing local label declaration",
9914 T_IDENTIFIER, NULL);
9917 symbol_t *symbol = token.identifier.symbol;
9918 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
9919 if (entity != NULL && entity->base.parent_scope == current_scope) {
9920 source_position_t const *const ppos = &entity->base.source_position;
9921 errorf(HERE, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
9923 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL, NAMESPACE_LABEL, symbol);
9924 entity->base.parent_scope = current_scope;
9925 entity->base.source_position = token.base.source_position;
9928 anchor = &entity->base.next;
9931 environment_push(entity);
9934 } while (next_if(','));
9935 expect(';', end_error);
9937 statement->declaration.declarations_begin = begin;
9938 statement->declaration.declarations_end = end;
9942 static void parse_namespace_definition(void)
9946 entity_t *entity = NULL;
9947 symbol_t *symbol = NULL;
9949 if (token.kind == T_IDENTIFIER) {
9950 symbol = token.identifier.symbol;
9953 entity = get_entity(symbol, NAMESPACE_NORMAL);
9955 && entity->kind != ENTITY_NAMESPACE
9956 && entity->base.parent_scope == current_scope) {
9957 if (is_entity_valid(entity)) {
9958 error_redefined_as_different_kind(&token.base.source_position,
9959 entity, ENTITY_NAMESPACE);
9965 if (entity == NULL) {
9966 entity = allocate_entity_zero(ENTITY_NAMESPACE, NAMESPACE_NORMAL, symbol);
9967 entity->base.source_position = token.base.source_position;
9968 entity->base.parent_scope = current_scope;
9971 if (token.kind == '=') {
9972 /* TODO: parse namespace alias */
9973 panic("namespace alias definition not supported yet");
9976 environment_push(entity);
9977 append_entity(current_scope, entity);
9979 PUSH_SCOPE(&entity->namespacee.members);
9981 entity_t *old_current_entity = current_entity;
9982 current_entity = entity;
9984 expect('{', end_error);
9986 expect('}', end_error);
9989 assert(current_entity == entity);
9990 current_entity = old_current_entity;
9995 * Parse a statement.
9996 * There's also parse_statement() which additionally checks for
9997 * "statement has no effect" warnings
9999 static statement_t *intern_parse_statement(void)
10001 statement_t *statement = NULL;
10003 /* declaration or statement */
10004 add_anchor_token(';');
10005 switch (token.kind) {
10006 case T_IDENTIFIER: {
10007 token_kind_t la1_type = (token_kind_t)look_ahead(1)->kind;
10008 if (la1_type == ':') {
10009 statement = parse_label_statement();
10010 } else if (is_typedef_symbol(token.identifier.symbol)) {
10011 statement = parse_declaration_statement();
10013 /* it's an identifier, the grammar says this must be an
10014 * expression statement. However it is common that users mistype
10015 * declaration types, so we guess a bit here to improve robustness
10016 * for incorrect programs */
10017 switch (la1_type) {
10020 if (get_entity(token.identifier.symbol, NAMESPACE_NORMAL) != NULL) {
10022 statement = parse_expression_statement();
10026 statement = parse_declaration_statement();
10034 case T___extension__: {
10035 /* This can be a prefix to a declaration or an expression statement.
10036 * We simply eat it now and parse the rest with tail recursion. */
10038 statement = intern_parse_statement();
10044 statement = parse_declaration_statement();
10048 statement = parse_local_label_declaration();
10051 case ';': statement = parse_empty_statement(); break;
10052 case '{': statement = parse_compound_statement(false); break;
10053 case T___leave: statement = parse_leave_statement(); break;
10054 case T___try: statement = parse_ms_try_statment(); break;
10055 case T_asm: statement = parse_asm_statement(); break;
10056 case T_break: statement = parse_break(); break;
10057 case T_case: statement = parse_case_statement(); break;
10058 case T_continue: statement = parse_continue(); break;
10059 case T_default: statement = parse_default_statement(); break;
10060 case T_do: statement = parse_do(); break;
10061 case T_for: statement = parse_for(); break;
10062 case T_goto: statement = parse_goto(); break;
10063 case T_if: statement = parse_if(); break;
10064 case T_return: statement = parse_return(); break;
10065 case T_switch: statement = parse_switch(); break;
10066 case T_while: statement = parse_while(); break;
10069 statement = parse_expression_statement();
10073 errorf(HERE, "unexpected token %K while parsing statement", &token);
10074 statement = create_error_statement();
10079 rem_anchor_token(';');
10081 assert(statement != NULL
10082 && statement->base.source_position.input_name != NULL);
10088 * parse a statement and emits "statement has no effect" warning if needed
10089 * (This is really a wrapper around intern_parse_statement with check for 1
10090 * single warning. It is needed, because for statement expressions we have
10091 * to avoid the warning on the last statement)
10093 static statement_t *parse_statement(void)
10095 statement_t *statement = intern_parse_statement();
10097 if (statement->kind == STATEMENT_EXPRESSION) {
10098 expression_t *expression = statement->expression.expression;
10099 if (!expression_has_effect(expression)) {
10100 warningf(WARN_UNUSED_VALUE, &expression->base.source_position, "statement has no effect");
10108 * Parse a compound statement.
10110 static statement_t *parse_compound_statement(bool inside_expression_statement)
10112 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
10114 PUSH_PARENT(statement);
10115 PUSH_SCOPE(&statement->compound.scope);
10118 add_anchor_token('}');
10119 /* tokens, which can start a statement */
10120 /* TODO MS, __builtin_FOO */
10121 add_anchor_token('!');
10122 add_anchor_token('&');
10123 add_anchor_token('(');
10124 add_anchor_token('*');
10125 add_anchor_token('+');
10126 add_anchor_token('-');
10127 add_anchor_token('{');
10128 add_anchor_token('~');
10129 add_anchor_token(T_CHARACTER_CONSTANT);
10130 add_anchor_token(T_COLONCOLON);
10131 add_anchor_token(T_FLOATINGPOINT);
10132 add_anchor_token(T_IDENTIFIER);
10133 add_anchor_token(T_INTEGER);
10134 add_anchor_token(T_MINUSMINUS);
10135 add_anchor_token(T_PLUSPLUS);
10136 add_anchor_token(T_STRING_LITERAL);
10137 add_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10138 add_anchor_token(T_WIDE_STRING_LITERAL);
10139 add_anchor_token(T__Bool);
10140 add_anchor_token(T__Complex);
10141 add_anchor_token(T__Imaginary);
10142 add_anchor_token(T___FUNCTION__);
10143 add_anchor_token(T___PRETTY_FUNCTION__);
10144 add_anchor_token(T___alignof__);
10145 add_anchor_token(T___attribute__);
10146 add_anchor_token(T___builtin_va_start);
10147 add_anchor_token(T___extension__);
10148 add_anchor_token(T___func__);
10149 add_anchor_token(T___imag__);
10150 add_anchor_token(T___label__);
10151 add_anchor_token(T___real__);
10152 add_anchor_token(T___thread);
10153 add_anchor_token(T_asm);
10154 add_anchor_token(T_auto);
10155 add_anchor_token(T_bool);
10156 add_anchor_token(T_break);
10157 add_anchor_token(T_case);
10158 add_anchor_token(T_char);
10159 add_anchor_token(T_class);
10160 add_anchor_token(T_const);
10161 add_anchor_token(T_const_cast);
10162 add_anchor_token(T_continue);
10163 add_anchor_token(T_default);
10164 add_anchor_token(T_delete);
10165 add_anchor_token(T_double);
10166 add_anchor_token(T_do);
10167 add_anchor_token(T_dynamic_cast);
10168 add_anchor_token(T_enum);
10169 add_anchor_token(T_extern);
10170 add_anchor_token(T_false);
10171 add_anchor_token(T_float);
10172 add_anchor_token(T_for);
10173 add_anchor_token(T_goto);
10174 add_anchor_token(T_if);
10175 add_anchor_token(T_inline);
10176 add_anchor_token(T_int);
10177 add_anchor_token(T_long);
10178 add_anchor_token(T_new);
10179 add_anchor_token(T_operator);
10180 add_anchor_token(T_register);
10181 add_anchor_token(T_reinterpret_cast);
10182 add_anchor_token(T_restrict);
10183 add_anchor_token(T_return);
10184 add_anchor_token(T_short);
10185 add_anchor_token(T_signed);
10186 add_anchor_token(T_sizeof);
10187 add_anchor_token(T_static);
10188 add_anchor_token(T_static_cast);
10189 add_anchor_token(T_struct);
10190 add_anchor_token(T_switch);
10191 add_anchor_token(T_template);
10192 add_anchor_token(T_this);
10193 add_anchor_token(T_throw);
10194 add_anchor_token(T_true);
10195 add_anchor_token(T_try);
10196 add_anchor_token(T_typedef);
10197 add_anchor_token(T_typeid);
10198 add_anchor_token(T_typename);
10199 add_anchor_token(T_typeof);
10200 add_anchor_token(T_union);
10201 add_anchor_token(T_unsigned);
10202 add_anchor_token(T_using);
10203 add_anchor_token(T_void);
10204 add_anchor_token(T_volatile);
10205 add_anchor_token(T_wchar_t);
10206 add_anchor_token(T_while);
10208 statement_t **anchor = &statement->compound.statements;
10209 bool only_decls_so_far = true;
10210 while (token.kind != '}') {
10211 if (token.kind == T_EOF) {
10212 errorf(&statement->base.source_position,
10213 "EOF while parsing compound statement");
10216 statement_t *sub_statement = intern_parse_statement();
10217 if (sub_statement->kind == STATEMENT_ERROR) {
10218 /* an error occurred. if we are at an anchor, return */
10224 if (sub_statement->kind != STATEMENT_DECLARATION) {
10225 only_decls_so_far = false;
10226 } else if (!only_decls_so_far) {
10227 source_position_t const *const pos = &sub_statement->base.source_position;
10228 warningf(WARN_DECLARATION_AFTER_STATEMENT, pos, "ISO C90 forbids mixed declarations and code");
10231 *anchor = sub_statement;
10233 while (sub_statement->base.next != NULL)
10234 sub_statement = sub_statement->base.next;
10236 anchor = &sub_statement->base.next;
10240 /* look over all statements again to produce no effect warnings */
10241 if (is_warn_on(WARN_UNUSED_VALUE)) {
10242 statement_t *sub_statement = statement->compound.statements;
10243 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
10244 if (sub_statement->kind != STATEMENT_EXPRESSION)
10246 /* don't emit a warning for the last expression in an expression
10247 * statement as it has always an effect */
10248 if (inside_expression_statement && sub_statement->base.next == NULL)
10251 expression_t *expression = sub_statement->expression.expression;
10252 if (!expression_has_effect(expression)) {
10253 warningf(WARN_UNUSED_VALUE, &expression->base.source_position, "statement has no effect");
10259 rem_anchor_token(T_while);
10260 rem_anchor_token(T_wchar_t);
10261 rem_anchor_token(T_volatile);
10262 rem_anchor_token(T_void);
10263 rem_anchor_token(T_using);
10264 rem_anchor_token(T_unsigned);
10265 rem_anchor_token(T_union);
10266 rem_anchor_token(T_typeof);
10267 rem_anchor_token(T_typename);
10268 rem_anchor_token(T_typeid);
10269 rem_anchor_token(T_typedef);
10270 rem_anchor_token(T_try);
10271 rem_anchor_token(T_true);
10272 rem_anchor_token(T_throw);
10273 rem_anchor_token(T_this);
10274 rem_anchor_token(T_template);
10275 rem_anchor_token(T_switch);
10276 rem_anchor_token(T_struct);
10277 rem_anchor_token(T_static_cast);
10278 rem_anchor_token(T_static);
10279 rem_anchor_token(T_sizeof);
10280 rem_anchor_token(T_signed);
10281 rem_anchor_token(T_short);
10282 rem_anchor_token(T_return);
10283 rem_anchor_token(T_restrict);
10284 rem_anchor_token(T_reinterpret_cast);
10285 rem_anchor_token(T_register);
10286 rem_anchor_token(T_operator);
10287 rem_anchor_token(T_new);
10288 rem_anchor_token(T_long);
10289 rem_anchor_token(T_int);
10290 rem_anchor_token(T_inline);
10291 rem_anchor_token(T_if);
10292 rem_anchor_token(T_goto);
10293 rem_anchor_token(T_for);
10294 rem_anchor_token(T_float);
10295 rem_anchor_token(T_false);
10296 rem_anchor_token(T_extern);
10297 rem_anchor_token(T_enum);
10298 rem_anchor_token(T_dynamic_cast);
10299 rem_anchor_token(T_do);
10300 rem_anchor_token(T_double);
10301 rem_anchor_token(T_delete);
10302 rem_anchor_token(T_default);
10303 rem_anchor_token(T_continue);
10304 rem_anchor_token(T_const_cast);
10305 rem_anchor_token(T_const);
10306 rem_anchor_token(T_class);
10307 rem_anchor_token(T_char);
10308 rem_anchor_token(T_case);
10309 rem_anchor_token(T_break);
10310 rem_anchor_token(T_bool);
10311 rem_anchor_token(T_auto);
10312 rem_anchor_token(T_asm);
10313 rem_anchor_token(T___thread);
10314 rem_anchor_token(T___real__);
10315 rem_anchor_token(T___label__);
10316 rem_anchor_token(T___imag__);
10317 rem_anchor_token(T___func__);
10318 rem_anchor_token(T___extension__);
10319 rem_anchor_token(T___builtin_va_start);
10320 rem_anchor_token(T___attribute__);
10321 rem_anchor_token(T___alignof__);
10322 rem_anchor_token(T___PRETTY_FUNCTION__);
10323 rem_anchor_token(T___FUNCTION__);
10324 rem_anchor_token(T__Imaginary);
10325 rem_anchor_token(T__Complex);
10326 rem_anchor_token(T__Bool);
10327 rem_anchor_token(T_WIDE_STRING_LITERAL);
10328 rem_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10329 rem_anchor_token(T_STRING_LITERAL);
10330 rem_anchor_token(T_PLUSPLUS);
10331 rem_anchor_token(T_MINUSMINUS);
10332 rem_anchor_token(T_INTEGER);
10333 rem_anchor_token(T_IDENTIFIER);
10334 rem_anchor_token(T_FLOATINGPOINT);
10335 rem_anchor_token(T_COLONCOLON);
10336 rem_anchor_token(T_CHARACTER_CONSTANT);
10337 rem_anchor_token('~');
10338 rem_anchor_token('{');
10339 rem_anchor_token('-');
10340 rem_anchor_token('+');
10341 rem_anchor_token('*');
10342 rem_anchor_token('(');
10343 rem_anchor_token('&');
10344 rem_anchor_token('!');
10345 rem_anchor_token('}');
10353 * Check for unused global static functions and variables
10355 static void check_unused_globals(void)
10357 if (!is_warn_on(WARN_UNUSED_FUNCTION) && !is_warn_on(WARN_UNUSED_VARIABLE))
10360 for (const entity_t *entity = file_scope->entities; entity != NULL;
10361 entity = entity->base.next) {
10362 if (!is_declaration(entity))
10365 const declaration_t *declaration = &entity->declaration;
10366 if (declaration->used ||
10367 declaration->modifiers & DM_UNUSED ||
10368 declaration->modifiers & DM_USED ||
10369 declaration->storage_class != STORAGE_CLASS_STATIC)
10374 if (entity->kind == ENTITY_FUNCTION) {
10375 /* inhibit warning for static inline functions */
10376 if (entity->function.is_inline)
10379 why = WARN_UNUSED_FUNCTION;
10380 s = entity->function.statement != NULL ? "defined" : "declared";
10382 why = WARN_UNUSED_VARIABLE;
10386 warningf(why, &declaration->base.source_position, "'%#N' %s but not used", entity, s);
10390 static void parse_global_asm(void)
10392 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10395 expect('(', end_error);
10397 statement->asms.asm_text = parse_string_literals();
10398 statement->base.next = unit->global_asm;
10399 unit->global_asm = statement;
10401 expect(')', end_error);
10402 expect(';', end_error);
10407 static void parse_linkage_specification(void)
10411 source_position_t const pos = *HERE;
10412 char const *const linkage = parse_string_literals().begin;
10414 linkage_kind_t old_linkage = current_linkage;
10415 linkage_kind_t new_linkage;
10416 if (streq(linkage, "C")) {
10417 new_linkage = LINKAGE_C;
10418 } else if (streq(linkage, "C++")) {
10419 new_linkage = LINKAGE_CXX;
10421 errorf(&pos, "linkage string \"%s\" not recognized", linkage);
10422 new_linkage = LINKAGE_C;
10424 current_linkage = new_linkage;
10426 if (next_if('{')) {
10428 expect('}', end_error);
10434 assert(current_linkage == new_linkage);
10435 current_linkage = old_linkage;
10438 static void parse_external(void)
10440 switch (token.kind) {
10442 if (look_ahead(1)->kind == T_STRING_LITERAL) {
10443 parse_linkage_specification();
10445 DECLARATION_START_NO_EXTERN
10447 case T___extension__:
10448 /* tokens below are for implicit int */
10449 case '&': /* & x; -> int& x; (and error later, because C++ has no
10451 case '*': /* * x; -> int* x; */
10452 case '(': /* (x); -> int (x); */
10454 parse_external_declaration();
10460 parse_global_asm();
10464 parse_namespace_definition();
10468 if (!strict_mode) {
10469 warningf(WARN_STRAY_SEMICOLON, HERE, "stray ';' outside of function");
10476 errorf(HERE, "stray %K outside of function", &token);
10477 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10478 eat_until_matching_token(token.kind);
10484 static void parse_externals(void)
10486 add_anchor_token('}');
10487 add_anchor_token(T_EOF);
10490 /* make a copy of the anchor set, so we can check if it is restored after parsing */
10491 unsigned short token_anchor_copy[T_LAST_TOKEN];
10492 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10495 while (token.kind != T_EOF && token.kind != '}') {
10497 for (int i = 0; i < T_LAST_TOKEN; ++i) {
10498 unsigned short count = token_anchor_set[i] - token_anchor_copy[i];
10500 /* the anchor set and its copy differs */
10501 internal_errorf(HERE, "Leaked anchor token %k %d times", i, count);
10504 if (in_gcc_extension) {
10505 /* an gcc extension scope was not closed */
10506 internal_errorf(HERE, "Leaked __extension__");
10513 rem_anchor_token(T_EOF);
10514 rem_anchor_token('}');
10518 * Parse a translation unit.
10520 static void parse_translation_unit(void)
10522 add_anchor_token(T_EOF);
10527 if (token.kind == T_EOF)
10530 errorf(HERE, "stray %K outside of function", &token);
10531 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10532 eat_until_matching_token(token.kind);
10537 void set_default_visibility(elf_visibility_tag_t visibility)
10539 default_visibility = visibility;
10545 * @return the translation unit or NULL if errors occurred.
10547 void start_parsing(void)
10549 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10550 label_stack = NEW_ARR_F(stack_entry_t, 0);
10551 diagnostic_count = 0;
10555 print_to_file(stderr);
10557 assert(unit == NULL);
10558 unit = allocate_ast_zero(sizeof(unit[0]));
10560 assert(file_scope == NULL);
10561 file_scope = &unit->scope;
10563 assert(current_scope == NULL);
10564 scope_push(&unit->scope);
10566 create_gnu_builtins();
10568 create_microsoft_intrinsics();
10571 translation_unit_t *finish_parsing(void)
10573 assert(current_scope == &unit->scope);
10576 assert(file_scope == &unit->scope);
10577 check_unused_globals();
10580 DEL_ARR_F(environment_stack);
10581 DEL_ARR_F(label_stack);
10583 translation_unit_t *result = unit;
10588 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
10589 * are given length one. */
10590 static void complete_incomplete_arrays(void)
10592 size_t n = ARR_LEN(incomplete_arrays);
10593 for (size_t i = 0; i != n; ++i) {
10594 declaration_t *const decl = incomplete_arrays[i];
10595 type_t *const type = skip_typeref(decl->type);
10597 if (!is_type_incomplete(type))
10600 source_position_t const *const pos = &decl->base.source_position;
10601 warningf(WARN_OTHER, pos, "array '%#N' assumed to have one element", (entity_t const*)decl);
10603 type_t *const new_type = duplicate_type(type);
10604 new_type->array.size_constant = true;
10605 new_type->array.has_implicit_size = true;
10606 new_type->array.size = 1;
10608 type_t *const result = identify_new_type(new_type);
10610 decl->type = result;
10614 void prepare_main_collect2(entity_t *entity)
10616 PUSH_SCOPE(&entity->function.statement->compound.scope);
10618 // create call to __main
10619 symbol_t *symbol = symbol_table_insert("__main");
10620 entity_t *subsubmain_ent
10621 = create_implicit_function(symbol, &builtin_source_position);
10623 expression_t *ref = allocate_expression_zero(EXPR_REFERENCE);
10624 type_t *ftype = subsubmain_ent->declaration.type;
10625 ref->base.source_position = builtin_source_position;
10626 ref->base.type = make_pointer_type(ftype, TYPE_QUALIFIER_NONE);
10627 ref->reference.entity = subsubmain_ent;
10629 expression_t *call = allocate_expression_zero(EXPR_CALL);
10630 call->base.source_position = builtin_source_position;
10631 call->base.type = type_void;
10632 call->call.function = ref;
10634 statement_t *expr_statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10635 expr_statement->base.source_position = builtin_source_position;
10636 expr_statement->expression.expression = call;
10638 statement_t *statement = entity->function.statement;
10639 assert(statement->kind == STATEMENT_COMPOUND);
10640 compound_statement_t *compounds = &statement->compound;
10642 expr_statement->base.next = compounds->statements;
10643 compounds->statements = expr_statement;
10650 lookahead_bufpos = 0;
10651 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10654 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
10655 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
10656 parse_translation_unit();
10657 complete_incomplete_arrays();
10658 DEL_ARR_F(incomplete_arrays);
10659 incomplete_arrays = NULL;
10663 * Initialize the parser.
10665 void init_parser(void)
10667 sym_anonymous = symbol_table_insert("<anonymous>");
10669 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10671 init_expression_parsers();
10672 obstack_init(&temp_obst);
10676 * Terminate the parser.
10678 void exit_parser(void)
10680 obstack_free(&temp_obst, NULL);