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_ENUM_CONSTANT] = 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_void(points_to_left))
1005 if (is_type_void(points_to_right)) {
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_void(skip_typeref(expr->base.type)))
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_ENUM_CONSTANT:
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 (look_ahead(1)->kind != ')')
3213 if (token.kind == T_IDENTIFIER) {
3214 entity_t const *const entity
3215 = get_entity(token.identifier.symbol, NAMESPACE_NORMAL);
3218 if (entity->kind != ENTITY_TYPEDEF)
3220 type_t const *const type = skip_typeref(entity->typedefe.type);
3221 if (!is_type_void(type))
3223 if (type->base.qualifiers != TYPE_QUALIFIER_NONE) {
3224 /* §6.7.5.3:10 Qualification is not allowed here. */
3225 errorf(HERE, "'void' as parameter must not have type qualifiers");
3227 } else if (token.kind != T_void) {
3235 * Parses function type parameters (and optionally creates variable_t entities
3236 * for them in a scope)
3238 static void parse_parameters(function_type_t *type, scope_t *scope)
3241 add_anchor_token(')');
3242 int saved_comma_state = save_and_reset_anchor_state(',');
3244 if (token.kind == T_IDENTIFIER
3245 && !is_typedef_symbol(token.identifier.symbol)) {
3246 token_kind_t la1_type = (token_kind_t)look_ahead(1)->kind;
3247 if (la1_type == ',' || la1_type == ')') {
3248 type->kr_style_parameters = true;
3249 parse_identifier_list(scope);
3250 goto parameters_finished;
3254 if (token.kind == ')') {
3255 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
3256 if (!(c_mode & _CXX))
3257 type->unspecified_parameters = true;
3258 } else if (has_parameters()) {
3259 function_parameter_t **anchor = &type->parameters;
3261 switch (token.kind) {
3264 type->variadic = true;
3265 goto parameters_finished;
3270 entity_t *entity = parse_parameter();
3271 if (entity->kind == ENTITY_TYPEDEF) {
3272 errorf(&entity->base.source_position,
3273 "typedef not allowed as function parameter");
3276 assert(is_declaration(entity));
3278 semantic_parameter_incomplete(entity);
3280 function_parameter_t *const parameter =
3281 allocate_parameter(entity->declaration.type);
3283 if (scope != NULL) {
3284 append_entity(scope, entity);
3287 *anchor = parameter;
3288 anchor = ¶meter->next;
3293 goto parameters_finished;
3295 } while (next_if(','));
3298 parameters_finished:
3299 rem_anchor_token(')');
3300 expect(')', end_error);
3303 restore_anchor_state(',', saved_comma_state);
3306 typedef enum construct_type_kind_t {
3307 CONSTRUCT_POINTER = 1,
3308 CONSTRUCT_REFERENCE,
3311 } construct_type_kind_t;
3313 typedef union construct_type_t construct_type_t;
3315 typedef struct construct_type_base_t {
3316 construct_type_kind_t kind;
3317 source_position_t pos;
3318 construct_type_t *next;
3319 } construct_type_base_t;
3321 typedef struct parsed_pointer_t {
3322 construct_type_base_t base;
3323 type_qualifiers_t type_qualifiers;
3324 variable_t *base_variable; /**< MS __based extension. */
3327 typedef struct parsed_reference_t {
3328 construct_type_base_t base;
3329 } parsed_reference_t;
3331 typedef struct construct_function_type_t {
3332 construct_type_base_t base;
3333 type_t *function_type;
3334 } construct_function_type_t;
3336 typedef struct parsed_array_t {
3337 construct_type_base_t base;
3338 type_qualifiers_t type_qualifiers;
3344 union construct_type_t {
3345 construct_type_kind_t kind;
3346 construct_type_base_t base;
3347 parsed_pointer_t pointer;
3348 parsed_reference_t reference;
3349 construct_function_type_t function;
3350 parsed_array_t array;
3353 static construct_type_t *allocate_declarator_zero(construct_type_kind_t const kind, size_t const size)
3355 construct_type_t *const cons = obstack_alloc(&temp_obst, size);
3356 memset(cons, 0, size);
3358 cons->base.pos = *HERE;
3363 static construct_type_t *parse_pointer_declarator(void)
3365 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_POINTER, sizeof(parsed_pointer_t));
3367 cons->pointer.type_qualifiers = parse_type_qualifiers();
3368 //cons->pointer.base_variable = base_variable;
3373 /* ISO/IEC 14882:1998(E) §8.3.2 */
3374 static construct_type_t *parse_reference_declarator(void)
3376 if (!(c_mode & _CXX))
3377 errorf(HERE, "references are only available for C++");
3379 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_REFERENCE, sizeof(parsed_reference_t));
3386 static construct_type_t *parse_array_declarator(void)
3388 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_ARRAY, sizeof(parsed_array_t));
3389 parsed_array_t *const array = &cons->array;
3392 add_anchor_token(']');
3394 bool is_static = next_if(T_static);
3396 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3399 is_static = next_if(T_static);
3401 array->type_qualifiers = type_qualifiers;
3402 array->is_static = is_static;
3404 expression_t *size = NULL;
3405 if (token.kind == '*' && look_ahead(1)->kind == ']') {
3406 array->is_variable = true;
3408 } else if (token.kind != ']') {
3409 size = parse_assignment_expression();
3411 /* §6.7.5.2:1 Array size must have integer type */
3412 type_t *const orig_type = size->base.type;
3413 type_t *const type = skip_typeref(orig_type);
3414 if (!is_type_integer(type) && is_type_valid(type)) {
3415 errorf(&size->base.source_position,
3416 "array size '%E' must have integer type but has type '%T'",
3421 mark_vars_read(size, NULL);
3424 if (is_static && size == NULL)
3425 errorf(&array->base.pos, "static array parameters require a size");
3427 rem_anchor_token(']');
3428 expect(']', end_error);
3435 static construct_type_t *parse_function_declarator(scope_t *scope)
3437 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_FUNCTION, sizeof(construct_function_type_t));
3439 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3440 function_type_t *ftype = &type->function;
3442 ftype->linkage = current_linkage;
3443 ftype->calling_convention = CC_DEFAULT;
3445 parse_parameters(ftype, scope);
3447 cons->function.function_type = type;
3452 typedef struct parse_declarator_env_t {
3453 bool may_be_abstract : 1;
3454 bool must_be_abstract : 1;
3455 decl_modifiers_t modifiers;
3457 source_position_t source_position;
3459 attribute_t *attributes;
3460 } parse_declarator_env_t;
3463 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env)
3465 /* construct a single linked list of construct_type_t's which describe
3466 * how to construct the final declarator type */
3467 construct_type_t *first = NULL;
3468 construct_type_t **anchor = &first;
3470 env->attributes = parse_attributes(env->attributes);
3473 construct_type_t *type;
3474 //variable_t *based = NULL; /* MS __based extension */
3475 switch (token.kind) {
3477 type = parse_reference_declarator();
3481 panic("based not supported anymore");
3486 type = parse_pointer_declarator();
3490 goto ptr_operator_end;
3494 anchor = &type->base.next;
3496 /* TODO: find out if this is correct */
3497 env->attributes = parse_attributes(env->attributes);
3501 construct_type_t *inner_types = NULL;
3503 switch (token.kind) {
3505 if (env->must_be_abstract) {
3506 errorf(HERE, "no identifier expected in typename");
3508 env->symbol = token.identifier.symbol;
3509 env->source_position = token.base.source_position;
3515 /* Parenthesized declarator or function declarator? */
3516 token_t const *const la1 = look_ahead(1);
3517 switch (la1->kind) {
3519 if (is_typedef_symbol(la1->identifier.symbol)) {
3521 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
3522 * interpreted as ``function with no parameter specification'', rather
3523 * than redundant parentheses around the omitted identifier. */
3525 /* Function declarator. */
3526 if (!env->may_be_abstract) {
3527 errorf(HERE, "function declarator must have a name");
3534 case T___attribute__: /* FIXME __attribute__ might also introduce a parameter of a function declarator. */
3535 /* Paranthesized declarator. */
3537 add_anchor_token(')');
3538 inner_types = parse_inner_declarator(env);
3539 if (inner_types != NULL) {
3540 /* All later declarators only modify the return type */
3541 env->must_be_abstract = true;
3543 rem_anchor_token(')');
3544 expect(')', end_error);
3552 if (env->may_be_abstract)
3554 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3559 construct_type_t **const p = anchor;
3562 construct_type_t *type;
3563 switch (token.kind) {
3565 scope_t *scope = NULL;
3566 if (!env->must_be_abstract) {
3567 scope = &env->parameters;
3570 type = parse_function_declarator(scope);
3574 type = parse_array_declarator();
3577 goto declarator_finished;
3580 /* insert in the middle of the list (at p) */
3581 type->base.next = *p;
3584 anchor = &type->base.next;
3587 declarator_finished:
3588 /* append inner_types at the end of the list, we don't to set anchor anymore
3589 * as it's not needed anymore */
3590 *anchor = inner_types;
3597 static type_t *construct_declarator_type(construct_type_t *construct_list,
3600 construct_type_t *iter = construct_list;
3601 for (; iter != NULL; iter = iter->base.next) {
3602 source_position_t const* const pos = &iter->base.pos;
3603 switch (iter->kind) {
3604 case CONSTRUCT_FUNCTION: {
3605 construct_function_type_t *function = &iter->function;
3606 type_t *function_type = function->function_type;
3608 function_type->function.return_type = type;
3610 type_t *skipped_return_type = skip_typeref(type);
3612 if (is_type_function(skipped_return_type)) {
3613 errorf(pos, "function returning function is not allowed");
3614 } else if (is_type_array(skipped_return_type)) {
3615 errorf(pos, "function returning array is not allowed");
3617 if (skipped_return_type->base.qualifiers != 0) {
3618 warningf(WARN_IGNORED_QUALIFIERS, pos, "type qualifiers in return type of function type are meaningless");
3622 /* The function type was constructed earlier. Freeing it here will
3623 * destroy other types. */
3624 type = typehash_insert(function_type);
3628 case CONSTRUCT_POINTER: {
3629 if (is_type_reference(skip_typeref(type)))
3630 errorf(pos, "cannot declare a pointer to reference");
3632 parsed_pointer_t *pointer = &iter->pointer;
3633 type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
3637 case CONSTRUCT_REFERENCE:
3638 if (is_type_reference(skip_typeref(type)))
3639 errorf(pos, "cannot declare a reference to reference");
3641 type = make_reference_type(type);
3644 case CONSTRUCT_ARRAY: {
3645 if (is_type_reference(skip_typeref(type)))
3646 errorf(pos, "cannot declare an array of references");
3648 parsed_array_t *array = &iter->array;
3649 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
3651 expression_t *size_expression = array->size;
3652 if (size_expression != NULL) {
3654 = create_implicit_cast(size_expression, type_size_t);
3657 array_type->base.qualifiers = array->type_qualifiers;
3658 array_type->array.element_type = type;
3659 array_type->array.is_static = array->is_static;
3660 array_type->array.is_variable = array->is_variable;
3661 array_type->array.size_expression = size_expression;
3663 if (size_expression != NULL) {
3664 switch (is_constant_expression(size_expression)) {
3665 case EXPR_CLASS_CONSTANT: {
3666 long const size = fold_constant_to_int(size_expression);
3667 array_type->array.size = size;
3668 array_type->array.size_constant = true;
3669 /* §6.7.5.2:1 If the expression is a constant expression,
3670 * it shall have a value greater than zero. */
3672 errorf(&size_expression->base.source_position,
3673 "size of array must be greater than zero");
3674 } else if (size == 0 && !GNU_MODE) {
3675 errorf(&size_expression->base.source_position,
3676 "size of array must be greater than zero (zero length arrays are a GCC extension)");
3681 case EXPR_CLASS_VARIABLE:
3682 array_type->array.is_vla = true;
3685 case EXPR_CLASS_ERROR:
3690 type_t *skipped_type = skip_typeref(type);
3692 if (is_type_incomplete(skipped_type)) {
3693 errorf(pos, "array of incomplete type '%T' is not allowed", type);
3694 } else if (is_type_function(skipped_type)) {
3695 errorf(pos, "array of functions is not allowed");
3697 type = identify_new_type(array_type);
3701 internal_errorf(pos, "invalid type construction found");
3707 static type_t *automatic_type_conversion(type_t *orig_type);
3709 static type_t *semantic_parameter(const source_position_t *pos,
3711 const declaration_specifiers_t *specifiers,
3712 entity_t const *const param)
3714 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
3715 * shall be adjusted to ``qualified pointer to type'',
3717 * §6.7.5.3:8 A declaration of a parameter as ``function returning
3718 * type'' shall be adjusted to ``pointer to function
3719 * returning type'', as in 6.3.2.1. */
3720 type = automatic_type_conversion(type);
3722 if (specifiers->is_inline && is_type_valid(type)) {
3723 errorf(pos, "'%N' declared 'inline'", param);
3726 /* §6.9.1:6 The declarations in the declaration list shall contain
3727 * no storage-class specifier other than register and no
3728 * initializations. */
3729 if (specifiers->thread_local || (
3730 specifiers->storage_class != STORAGE_CLASS_NONE &&
3731 specifiers->storage_class != STORAGE_CLASS_REGISTER)
3733 errorf(pos, "invalid storage class for '%N'", param);
3736 /* delay test for incomplete type, because we might have (void)
3737 * which is legal but incomplete... */
3742 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
3743 declarator_flags_t flags)
3745 parse_declarator_env_t env;
3746 memset(&env, 0, sizeof(env));
3747 env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
3749 construct_type_t *construct_type = parse_inner_declarator(&env);
3751 construct_declarator_type(construct_type, specifiers->type);
3752 type_t *type = skip_typeref(orig_type);
3754 if (construct_type != NULL) {
3755 obstack_free(&temp_obst, construct_type);
3758 attribute_t *attributes = parse_attributes(env.attributes);
3759 /* append (shared) specifier attribute behind attributes of this
3761 attribute_t **anchor = &attributes;
3762 while (*anchor != NULL)
3763 anchor = &(*anchor)->next;
3764 *anchor = specifiers->attributes;
3767 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
3768 entity = allocate_entity_zero(ENTITY_TYPEDEF, NAMESPACE_NORMAL, env.symbol);
3769 entity->base.source_position = env.source_position;
3770 entity->typedefe.type = orig_type;
3772 if (anonymous_entity != NULL) {
3773 if (is_type_compound(type)) {
3774 assert(anonymous_entity->compound.alias == NULL);
3775 assert(anonymous_entity->kind == ENTITY_STRUCT ||
3776 anonymous_entity->kind == ENTITY_UNION);
3777 anonymous_entity->compound.alias = entity;
3778 anonymous_entity = NULL;
3779 } else if (is_type_enum(type)) {
3780 assert(anonymous_entity->enume.alias == NULL);
3781 assert(anonymous_entity->kind == ENTITY_ENUM);
3782 anonymous_entity->enume.alias = entity;
3783 anonymous_entity = NULL;
3787 /* create a declaration type entity */
3788 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
3789 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, env.symbol);
3791 if (env.symbol != NULL) {
3792 if (specifiers->is_inline && is_type_valid(type)) {
3793 errorf(&env.source_position,
3794 "compound member '%Y' declared 'inline'", env.symbol);
3797 if (specifiers->thread_local ||
3798 specifiers->storage_class != STORAGE_CLASS_NONE) {
3799 errorf(&env.source_position,
3800 "compound member '%Y' must have no storage class",
3804 } else if (flags & DECL_IS_PARAMETER) {
3805 entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, env.symbol);
3806 orig_type = semantic_parameter(&env.source_position, orig_type, specifiers, entity);
3807 } else if (is_type_function(type)) {
3808 entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, env.symbol);
3809 entity->function.is_inline = specifiers->is_inline;
3810 entity->function.elf_visibility = default_visibility;
3811 entity->function.parameters = env.parameters;
3813 if (env.symbol != NULL) {
3814 /* this needs fixes for C++ */
3815 bool in_function_scope = current_function != NULL;
3817 if (specifiers->thread_local || (
3818 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3819 specifiers->storage_class != STORAGE_CLASS_NONE &&
3820 (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
3822 errorf(&env.source_position, "invalid storage class for '%N'", entity);
3826 entity = allocate_entity_zero(ENTITY_VARIABLE, NAMESPACE_NORMAL, env.symbol);
3827 entity->variable.elf_visibility = default_visibility;
3828 entity->variable.thread_local = specifiers->thread_local;
3830 if (env.symbol != NULL) {
3831 if (specifiers->is_inline && is_type_valid(type)) {
3832 errorf(&env.source_position, "'%N' declared 'inline'", entity);
3835 bool invalid_storage_class = false;
3836 if (current_scope == file_scope) {
3837 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3838 specifiers->storage_class != STORAGE_CLASS_NONE &&
3839 specifiers->storage_class != STORAGE_CLASS_STATIC) {
3840 invalid_storage_class = true;
3843 if (specifiers->thread_local &&
3844 specifiers->storage_class == STORAGE_CLASS_NONE) {
3845 invalid_storage_class = true;
3848 if (invalid_storage_class) {
3849 errorf(&env.source_position, "invalid storage class for variable '%N'", entity);
3854 entity->base.source_position = env.symbol != NULL ? env.source_position : specifiers->source_position;
3855 entity->declaration.type = orig_type;
3856 entity->declaration.alignment = get_type_alignment(orig_type);
3857 entity->declaration.modifiers = env.modifiers;
3858 entity->declaration.attributes = attributes;
3860 storage_class_t storage_class = specifiers->storage_class;
3861 entity->declaration.declared_storage_class = storage_class;
3863 if (storage_class == STORAGE_CLASS_NONE && current_function != NULL)
3864 storage_class = STORAGE_CLASS_AUTO;
3865 entity->declaration.storage_class = storage_class;
3868 if (attributes != NULL) {
3869 handle_entity_attributes(attributes, entity);
3872 if (entity->kind == ENTITY_FUNCTION && !freestanding) {
3873 adapt_special_functions(&entity->function);
3879 static type_t *parse_abstract_declarator(type_t *base_type)
3881 parse_declarator_env_t env;
3882 memset(&env, 0, sizeof(env));
3883 env.may_be_abstract = true;
3884 env.must_be_abstract = true;
3886 construct_type_t *construct_type = parse_inner_declarator(&env);
3888 type_t *result = construct_declarator_type(construct_type, base_type);
3889 if (construct_type != NULL) {
3890 obstack_free(&temp_obst, construct_type);
3892 result = handle_type_attributes(env.attributes, result);
3898 * Check if the declaration of main is suspicious. main should be a
3899 * function with external linkage, returning int, taking either zero
3900 * arguments, two, or three arguments of appropriate types, ie.
3902 * int main([ int argc, char **argv [, char **env ] ]).
3904 * @param decl the declaration to check
3905 * @param type the function type of the declaration
3907 static void check_main(const entity_t *entity)
3909 const source_position_t *pos = &entity->base.source_position;
3910 if (entity->kind != ENTITY_FUNCTION) {
3911 warningf(WARN_MAIN, pos, "'main' is not a function");
3915 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
3916 warningf(WARN_MAIN, pos, "'main' is normally a non-static function");
3919 type_t *type = skip_typeref(entity->declaration.type);
3920 assert(is_type_function(type));
3922 function_type_t const *const func_type = &type->function;
3923 type_t *const ret_type = func_type->return_type;
3924 if (!types_compatible(skip_typeref(ret_type), type_int)) {
3925 warningf(WARN_MAIN, pos, "return type of 'main' should be 'int', but is '%T'", ret_type);
3927 const function_parameter_t *parm = func_type->parameters;
3929 type_t *const first_type = skip_typeref(parm->type);
3930 type_t *const first_type_unqual = get_unqualified_type(first_type);
3931 if (!types_compatible(first_type_unqual, type_int)) {
3932 warningf(WARN_MAIN, pos, "first argument of 'main' should be 'int', but is '%T'", parm->type);
3936 type_t *const second_type = skip_typeref(parm->type);
3937 type_t *const second_type_unqual
3938 = get_unqualified_type(second_type);
3939 if (!types_compatible(second_type_unqual, type_char_ptr_ptr)) {
3940 warningf(WARN_MAIN, pos, "second argument of 'main' should be 'char**', but is '%T'", parm->type);
3944 type_t *const third_type = skip_typeref(parm->type);
3945 type_t *const third_type_unqual
3946 = get_unqualified_type(third_type);
3947 if (!types_compatible(third_type_unqual, type_char_ptr_ptr)) {
3948 warningf(WARN_MAIN, pos, "third argument of 'main' should be 'char**', but is '%T'", parm->type);
3952 goto warn_arg_count;
3956 warningf(WARN_MAIN, pos, "'main' takes only zero, two or three arguments");
3962 * Check if a symbol is the equal to "main".
3964 static bool is_sym_main(const symbol_t *const sym)
3966 return streq(sym->string, "main");
3969 static void error_redefined_as_different_kind(const source_position_t *pos,
3970 const entity_t *old, entity_kind_t new_kind)
3972 char const *const what = get_entity_kind_name(new_kind);
3973 source_position_t const *const ppos = &old->base.source_position;
3974 errorf(pos, "redeclaration of '%N' as %s (declared %P)", old, what, ppos);
3977 static bool is_entity_valid(entity_t *const ent)
3979 if (is_declaration(ent)) {
3980 return is_type_valid(skip_typeref(ent->declaration.type));
3981 } else if (ent->kind == ENTITY_TYPEDEF) {
3982 return is_type_valid(skip_typeref(ent->typedefe.type));
3987 static bool contains_attribute(const attribute_t *list, const attribute_t *attr)
3989 for (const attribute_t *tattr = list; tattr != NULL; tattr = tattr->next) {
3990 if (attributes_equal(tattr, attr))
3997 * test wether new_list contains any attributes not included in old_list
3999 static bool has_new_attributes(const attribute_t *old_list,
4000 const attribute_t *new_list)
4002 for (const attribute_t *attr = new_list; attr != NULL; attr = attr->next) {
4003 if (!contains_attribute(old_list, attr))
4010 * Merge in attributes from an attribute list (probably from a previous
4011 * declaration with the same name). Warning: destroys the old structure
4012 * of the attribute list - don't reuse attributes after this call.
4014 static void merge_in_attributes(declaration_t *decl, attribute_t *attributes)
4017 for (attribute_t *attr = attributes; attr != NULL; attr = next) {
4019 if (contains_attribute(decl->attributes, attr))
4022 /* move attribute to new declarations attributes list */
4023 attr->next = decl->attributes;
4024 decl->attributes = attr;
4029 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
4030 * for various problems that occur for multiple definitions
4032 entity_t *record_entity(entity_t *entity, const bool is_definition)
4034 const symbol_t *const symbol = entity->base.symbol;
4035 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
4036 const source_position_t *pos = &entity->base.source_position;
4038 /* can happen in error cases */
4042 entity_t *const previous_entity = get_entity(symbol, namespc);
4043 /* pushing the same entity twice will break the stack structure */
4044 assert(previous_entity != entity);
4046 if (entity->kind == ENTITY_FUNCTION) {
4047 type_t *const orig_type = entity->declaration.type;
4048 type_t *const type = skip_typeref(orig_type);
4050 assert(is_type_function(type));
4051 if (type->function.unspecified_parameters &&
4052 previous_entity == NULL &&
4053 !entity->declaration.implicit) {
4054 warningf(WARN_STRICT_PROTOTYPES, pos, "function declaration '%#N' is not a prototype", entity);
4057 if (current_scope == file_scope && is_sym_main(symbol)) {
4062 if (is_declaration(entity) &&
4063 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
4064 current_scope != file_scope &&
4065 !entity->declaration.implicit) {
4066 warningf(WARN_NESTED_EXTERNS, pos, "nested extern declaration of '%#N'", entity);
4069 if (previous_entity != NULL) {
4070 source_position_t const *const ppos = &previous_entity->base.source_position;
4072 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
4073 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
4074 assert(previous_entity->kind == ENTITY_PARAMETER);
4075 errorf(pos, "declaration of '%N' redeclares the '%N' (declared %P)", entity, previous_entity, ppos);
4079 if (previous_entity->base.parent_scope == current_scope) {
4080 if (previous_entity->kind != entity->kind) {
4081 if (is_entity_valid(previous_entity) && is_entity_valid(entity)) {
4082 error_redefined_as_different_kind(pos, previous_entity,
4087 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
4088 errorf(pos, "redeclaration of '%N' (declared %P)", entity, ppos);
4091 if (previous_entity->kind == ENTITY_TYPEDEF) {
4092 type_t *const type = skip_typeref(entity->typedefe.type);
4093 type_t *const prev_type
4094 = skip_typeref(previous_entity->typedefe.type);
4095 if (c_mode & _CXX) {
4096 /* C++ allows double typedef if they are identical
4097 * (after skipping typedefs) */
4098 if (type == prev_type)
4101 /* GCC extension: redef in system headers is allowed */
4102 if ((pos->is_system_header || ppos->is_system_header) &&
4103 types_compatible(type, prev_type))
4106 errorf(pos, "redefinition of '%N' (declared %P)",
4111 /* at this point we should have only VARIABLES or FUNCTIONS */
4112 assert(is_declaration(previous_entity) && is_declaration(entity));
4114 declaration_t *const prev_decl = &previous_entity->declaration;
4115 declaration_t *const decl = &entity->declaration;
4117 /* can happen for K&R style declarations */
4118 if (prev_decl->type == NULL &&
4119 previous_entity->kind == ENTITY_PARAMETER &&
4120 entity->kind == ENTITY_PARAMETER) {
4121 prev_decl->type = decl->type;
4122 prev_decl->storage_class = decl->storage_class;
4123 prev_decl->declared_storage_class = decl->declared_storage_class;
4124 prev_decl->modifiers = decl->modifiers;
4125 return previous_entity;
4128 type_t *const type = skip_typeref(decl->type);
4129 type_t *const prev_type = skip_typeref(prev_decl->type);
4131 if (!types_compatible(type, prev_type)) {
4132 errorf(pos, "declaration '%#N' is incompatible with '%#N' (declared %P)", entity, previous_entity, ppos);
4134 unsigned old_storage_class = prev_decl->storage_class;
4136 if (is_definition &&
4138 !(prev_decl->modifiers & DM_USED) &&
4139 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4140 warningf(WARN_REDUNDANT_DECLS, ppos, "unnecessary static forward declaration for '%#N'", previous_entity);
4143 storage_class_t new_storage_class = decl->storage_class;
4145 /* pretend no storage class means extern for function
4146 * declarations (except if the previous declaration is neither
4147 * none nor extern) */
4148 if (entity->kind == ENTITY_FUNCTION) {
4149 /* the previous declaration could have unspecified parameters or
4150 * be a typedef, so use the new type */
4151 if (prev_type->function.unspecified_parameters || is_definition)
4152 prev_decl->type = type;
4154 switch (old_storage_class) {
4155 case STORAGE_CLASS_NONE:
4156 old_storage_class = STORAGE_CLASS_EXTERN;
4159 case STORAGE_CLASS_EXTERN:
4160 if (is_definition) {
4161 if (prev_type->function.unspecified_parameters && !is_sym_main(symbol)) {
4162 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4164 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4165 new_storage_class = STORAGE_CLASS_EXTERN;
4172 } else if (is_type_incomplete(prev_type)) {
4173 prev_decl->type = type;
4176 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4177 new_storage_class == STORAGE_CLASS_EXTERN) {
4179 warn_redundant_declaration: ;
4181 = has_new_attributes(prev_decl->attributes,
4183 if (has_new_attrs) {
4184 merge_in_attributes(decl, prev_decl->attributes);
4185 } else if (!is_definition &&
4186 is_type_valid(prev_type) &&
4187 !pos->is_system_header) {
4188 warningf(WARN_REDUNDANT_DECLS, pos, "redundant declaration for '%Y' (declared %P)", symbol, ppos);
4190 } else if (current_function == NULL) {
4191 if (old_storage_class != STORAGE_CLASS_STATIC &&
4192 new_storage_class == STORAGE_CLASS_STATIC) {
4193 errorf(pos, "static declaration of '%Y' follows non-static declaration (declared %P)", symbol, ppos);
4194 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4195 prev_decl->storage_class = STORAGE_CLASS_NONE;
4196 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4198 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4200 goto error_redeclaration;
4201 goto warn_redundant_declaration;
4203 } else if (is_type_valid(prev_type)) {
4204 if (old_storage_class == new_storage_class) {
4205 error_redeclaration:
4206 errorf(pos, "redeclaration of '%Y' (declared %P)", symbol, ppos);
4208 errorf(pos, "redeclaration of '%Y' with different linkage (declared %P)", symbol, ppos);
4213 prev_decl->modifiers |= decl->modifiers;
4214 if (entity->kind == ENTITY_FUNCTION) {
4215 previous_entity->function.is_inline |= entity->function.is_inline;
4217 return previous_entity;
4221 if (is_warn_on(why = WARN_SHADOW) ||
4222 (is_warn_on(why = WARN_SHADOW_LOCAL) && previous_entity->base.parent_scope != file_scope)) {
4223 char const *const what = get_entity_kind_name(previous_entity->kind);
4224 warningf(why, pos, "'%N' shadows %s (declared %P)", entity, what, ppos);
4228 if (entity->kind == ENTITY_FUNCTION) {
4229 if (is_definition &&
4230 entity->declaration.storage_class != STORAGE_CLASS_STATIC &&
4231 !is_sym_main(symbol)) {
4232 if (is_warn_on(WARN_MISSING_PROTOTYPES)) {
4233 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4235 goto warn_missing_declaration;
4238 } else if (entity->kind == ENTITY_VARIABLE) {
4239 if (current_scope == file_scope &&
4240 entity->declaration.storage_class == STORAGE_CLASS_NONE &&
4241 !entity->declaration.implicit) {
4242 warn_missing_declaration:
4243 warningf(WARN_MISSING_DECLARATIONS, pos, "no previous declaration for '%#N'", entity);
4248 assert(entity->base.parent_scope == NULL);
4249 assert(current_scope != NULL);
4251 entity->base.parent_scope = current_scope;
4252 environment_push(entity);
4253 append_entity(current_scope, entity);
4258 static void parser_error_multiple_definition(entity_t *entity,
4259 const source_position_t *source_position)
4261 errorf(source_position, "multiple definition of '%Y' (declared %P)",
4262 entity->base.symbol, &entity->base.source_position);
4265 static bool is_declaration_specifier(const token_t *token)
4267 switch (token->kind) {
4271 return is_typedef_symbol(token->identifier.symbol);
4278 static void parse_init_declarator_rest(entity_t *entity)
4280 type_t *orig_type = type_error_type;
4282 if (entity->base.kind == ENTITY_TYPEDEF) {
4283 source_position_t const *const pos = &entity->base.source_position;
4284 errorf(pos, "'%N' is initialized (use __typeof__ instead)", entity);
4286 assert(is_declaration(entity));
4287 orig_type = entity->declaration.type;
4290 type_t *type = skip_typeref(orig_type);
4292 if (entity->kind == ENTITY_VARIABLE
4293 && entity->variable.initializer != NULL) {
4294 parser_error_multiple_definition(entity, HERE);
4298 declaration_t *const declaration = &entity->declaration;
4299 bool must_be_constant = false;
4300 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4301 entity->base.parent_scope == file_scope) {
4302 must_be_constant = true;
4305 if (is_type_function(type)) {
4306 source_position_t const *const pos = &entity->base.source_position;
4307 errorf(pos, "'%N' is initialized like a variable", entity);
4308 orig_type = type_error_type;
4311 parse_initializer_env_t env;
4312 env.type = orig_type;
4313 env.must_be_constant = must_be_constant;
4314 env.entity = entity;
4316 initializer_t *initializer = parse_initializer(&env);
4318 if (entity->kind == ENTITY_VARIABLE) {
4319 /* §6.7.5:22 array initializers for arrays with unknown size
4320 * determine the array type size */
4321 declaration->type = env.type;
4322 entity->variable.initializer = initializer;
4326 /* parse rest of a declaration without any declarator */
4327 static void parse_anonymous_declaration_rest(
4328 const declaration_specifiers_t *specifiers)
4331 anonymous_entity = NULL;
4333 source_position_t const *const pos = &specifiers->source_position;
4334 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4335 specifiers->thread_local) {
4336 warningf(WARN_OTHER, pos, "useless storage class in empty declaration");
4339 type_t *type = specifiers->type;
4340 switch (type->kind) {
4341 case TYPE_COMPOUND_STRUCT:
4342 case TYPE_COMPOUND_UNION: {
4343 if (type->compound.compound->base.symbol == NULL) {
4344 warningf(WARN_OTHER, pos, "unnamed struct/union that defines no instances");
4353 warningf(WARN_OTHER, pos, "empty declaration");
4358 static void check_variable_type_complete(entity_t *ent)
4360 if (ent->kind != ENTITY_VARIABLE)
4363 /* §6.7:7 If an identifier for an object is declared with no linkage, the
4364 * type for the object shall be complete [...] */
4365 declaration_t *decl = &ent->declaration;
4366 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4367 decl->storage_class == STORAGE_CLASS_STATIC)
4370 type_t *const type = skip_typeref(decl->type);
4371 if (!is_type_incomplete(type))
4374 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4375 * are given length one. */
4376 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4377 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4381 errorf(&ent->base.source_position, "variable '%#N' has incomplete type", ent);
4385 static void parse_declaration_rest(entity_t *ndeclaration,
4386 const declaration_specifiers_t *specifiers,
4387 parsed_declaration_func finished_declaration,
4388 declarator_flags_t flags)
4390 add_anchor_token(';');
4391 add_anchor_token(',');
4393 entity_t *entity = finished_declaration(ndeclaration, token.kind == '=');
4395 if (token.kind == '=') {
4396 parse_init_declarator_rest(entity);
4397 } else if (entity->kind == ENTITY_VARIABLE) {
4398 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
4399 * [...] where the extern specifier is explicitly used. */
4400 declaration_t *decl = &entity->declaration;
4401 if (decl->storage_class != STORAGE_CLASS_EXTERN) {
4402 type_t *type = decl->type;
4403 if (is_type_reference(skip_typeref(type))) {
4404 source_position_t const *const pos = &entity->base.source_position;
4405 errorf(pos, "reference '%#N' must be initialized", entity);
4410 check_variable_type_complete(entity);
4415 add_anchor_token('=');
4416 ndeclaration = parse_declarator(specifiers, flags);
4417 rem_anchor_token('=');
4419 expect(';', end_error);
4422 anonymous_entity = NULL;
4423 rem_anchor_token(';');
4424 rem_anchor_token(',');
4427 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4429 symbol_t *symbol = entity->base.symbol;
4433 assert(entity->base.namespc == NAMESPACE_NORMAL);
4434 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4435 if (previous_entity == NULL
4436 || previous_entity->base.parent_scope != current_scope) {
4437 errorf(&entity->base.source_position, "expected declaration of a function parameter, found '%Y'",
4442 if (is_definition) {
4443 errorf(HERE, "'%N' is initialised", entity);
4446 return record_entity(entity, false);
4449 static void parse_declaration(parsed_declaration_func finished_declaration,
4450 declarator_flags_t flags)
4452 add_anchor_token(';');
4453 declaration_specifiers_t specifiers;
4454 parse_declaration_specifiers(&specifiers);
4455 rem_anchor_token(';');
4457 if (token.kind == ';') {
4458 parse_anonymous_declaration_rest(&specifiers);
4460 entity_t *entity = parse_declarator(&specifiers, flags);
4461 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4466 static type_t *get_default_promoted_type(type_t *orig_type)
4468 type_t *result = orig_type;
4470 type_t *type = skip_typeref(orig_type);
4471 if (is_type_integer(type)) {
4472 result = promote_integer(type);
4473 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4474 result = type_double;
4480 static void parse_kr_declaration_list(entity_t *entity)
4482 if (entity->kind != ENTITY_FUNCTION)
4485 type_t *type = skip_typeref(entity->declaration.type);
4486 assert(is_type_function(type));
4487 if (!type->function.kr_style_parameters)
4490 add_anchor_token('{');
4492 PUSH_SCOPE(&entity->function.parameters);
4494 entity_t *parameter = entity->function.parameters.entities;
4495 for ( ; parameter != NULL; parameter = parameter->base.next) {
4496 assert(parameter->base.parent_scope == NULL);
4497 parameter->base.parent_scope = current_scope;
4498 environment_push(parameter);
4501 /* parse declaration list */
4503 switch (token.kind) {
4505 /* This covers symbols, which are no type, too, and results in
4506 * better error messages. The typical cases are misspelled type
4507 * names and missing includes. */
4509 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4519 /* update function type */
4520 type_t *new_type = duplicate_type(type);
4522 function_parameter_t *parameters = NULL;
4523 function_parameter_t **anchor = ¶meters;
4525 /* did we have an earlier prototype? */
4526 entity_t *proto_type = get_entity(entity->base.symbol, NAMESPACE_NORMAL);
4527 if (proto_type != NULL && proto_type->kind != ENTITY_FUNCTION)
4530 function_parameter_t *proto_parameter = NULL;
4531 if (proto_type != NULL) {
4532 type_t *proto_type_type = proto_type->declaration.type;
4533 proto_parameter = proto_type_type->function.parameters;
4534 /* If a K&R function definition has a variadic prototype earlier, then
4535 * make the function definition variadic, too. This should conform to
4536 * §6.7.5.3:15 and §6.9.1:8. */
4537 new_type->function.variadic = proto_type_type->function.variadic;
4539 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
4541 new_type->function.unspecified_parameters = true;
4544 bool need_incompatible_warning = false;
4545 parameter = entity->function.parameters.entities;
4546 for (; parameter != NULL; parameter = parameter->base.next,
4548 proto_parameter == NULL ? NULL : proto_parameter->next) {
4549 if (parameter->kind != ENTITY_PARAMETER)
4552 type_t *parameter_type = parameter->declaration.type;
4553 if (parameter_type == NULL) {
4554 source_position_t const* const pos = ¶meter->base.source_position;
4556 errorf(pos, "no type specified for function '%N'", parameter);
4557 parameter_type = type_error_type;
4559 warningf(WARN_IMPLICIT_INT, pos, "no type specified for function parameter '%N', using 'int'", parameter);
4560 parameter_type = type_int;
4562 parameter->declaration.type = parameter_type;
4565 semantic_parameter_incomplete(parameter);
4567 /* we need the default promoted types for the function type */
4568 type_t *not_promoted = parameter_type;
4569 parameter_type = get_default_promoted_type(parameter_type);
4571 /* gcc special: if the type of the prototype matches the unpromoted
4572 * type don't promote */
4573 if (!strict_mode && proto_parameter != NULL) {
4574 type_t *proto_p_type = skip_typeref(proto_parameter->type);
4575 type_t *promo_skip = skip_typeref(parameter_type);
4576 type_t *param_skip = skip_typeref(not_promoted);
4577 if (!types_compatible(proto_p_type, promo_skip)
4578 && types_compatible(proto_p_type, param_skip)) {
4580 need_incompatible_warning = true;
4581 parameter_type = not_promoted;
4584 function_parameter_t *const function_parameter
4585 = allocate_parameter(parameter_type);
4587 *anchor = function_parameter;
4588 anchor = &function_parameter->next;
4591 new_type->function.parameters = parameters;
4592 new_type = identify_new_type(new_type);
4594 if (need_incompatible_warning) {
4595 symbol_t const *const sym = entity->base.symbol;
4596 source_position_t const *const pos = &entity->base.source_position;
4597 source_position_t const *const ppos = &proto_type->base.source_position;
4598 warningf(WARN_OTHER, pos, "declaration '%#N' is incompatible with '%#T' (declared %P)", proto_type, new_type, sym, ppos);
4600 entity->declaration.type = new_type;
4602 rem_anchor_token('{');
4605 static bool first_err = true;
4608 * When called with first_err set, prints the name of the current function,
4611 static void print_in_function(void)
4615 char const *const file = current_function->base.base.source_position.input_name;
4616 diagnosticf("%s: In '%N':\n", file, (entity_t const*)current_function);
4621 * Check if all labels are defined in the current function.
4622 * Check if all labels are used in the current function.
4624 static void check_labels(void)
4626 for (const goto_statement_t *goto_statement = goto_first;
4627 goto_statement != NULL;
4628 goto_statement = goto_statement->next) {
4629 label_t *label = goto_statement->label;
4630 if (label->base.source_position.input_name == NULL) {
4631 print_in_function();
4632 source_position_t const *const pos = &goto_statement->base.source_position;
4633 errorf(pos, "'%N' used but not defined", (entity_t const*)label);
4637 if (is_warn_on(WARN_UNUSED_LABEL)) {
4638 for (const label_statement_t *label_statement = label_first;
4639 label_statement != NULL;
4640 label_statement = label_statement->next) {
4641 label_t *label = label_statement->label;
4643 if (! label->used) {
4644 print_in_function();
4645 source_position_t const *const pos = &label_statement->base.source_position;
4646 warningf(WARN_UNUSED_LABEL, pos, "'%N' defined but not used", (entity_t const*)label);
4652 static void warn_unused_entity(warning_t const why, entity_t *entity, entity_t *const last)
4654 entity_t const *const end = last != NULL ? last->base.next : NULL;
4655 for (; entity != end; entity = entity->base.next) {
4656 if (!is_declaration(entity))
4659 declaration_t *declaration = &entity->declaration;
4660 if (declaration->implicit)
4663 if (!declaration->used) {
4664 print_in_function();
4665 warningf(why, &entity->base.source_position, "'%N' is unused", entity);
4666 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
4667 print_in_function();
4668 warningf(why, &entity->base.source_position, "'%N' is never read", entity);
4673 static void check_unused_variables(statement_t *const stmt, void *const env)
4677 switch (stmt->kind) {
4678 case STATEMENT_DECLARATION: {
4679 declaration_statement_t const *const decls = &stmt->declaration;
4680 warn_unused_entity(WARN_UNUSED_VARIABLE, decls->declarations_begin, decls->declarations_end);
4685 warn_unused_entity(WARN_UNUSED_VARIABLE, stmt->fors.scope.entities, NULL);
4694 * Check declarations of current_function for unused entities.
4696 static void check_declarations(void)
4698 if (is_warn_on(WARN_UNUSED_PARAMETER)) {
4699 const scope_t *scope = ¤t_function->parameters;
4701 /* do not issue unused warnings for main */
4702 if (!is_sym_main(current_function->base.base.symbol)) {
4703 warn_unused_entity(WARN_UNUSED_PARAMETER, scope->entities, NULL);
4706 if (is_warn_on(WARN_UNUSED_VARIABLE)) {
4707 walk_statements(current_function->statement, check_unused_variables,
4712 static int determine_truth(expression_t const* const cond)
4715 is_constant_expression(cond) != EXPR_CLASS_CONSTANT ? 0 :
4716 fold_constant_to_bool(cond) ? 1 :
4720 static void check_reachable(statement_t *);
4721 static bool reaches_end;
4723 static bool expression_returns(expression_t const *const expr)
4725 switch (expr->kind) {
4727 expression_t const *const func = expr->call.function;
4728 type_t const *const type = skip_typeref(func->base.type);
4729 if (type->kind == TYPE_POINTER) {
4730 type_t const *const points_to
4731 = skip_typeref(type->pointer.points_to);
4732 if (points_to->kind == TYPE_FUNCTION
4733 && points_to->function.modifiers & DM_NORETURN)
4737 if (!expression_returns(func))
4740 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
4741 if (!expression_returns(arg->expression))
4748 case EXPR_REFERENCE:
4749 case EXPR_ENUM_CONSTANT:
4750 case EXPR_LITERAL_CASES:
4751 case EXPR_STRING_LITERAL:
4752 case EXPR_WIDE_STRING_LITERAL:
4753 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
4754 case EXPR_LABEL_ADDRESS:
4755 case EXPR_CLASSIFY_TYPE:
4756 case EXPR_SIZEOF: // TODO handle obscure VLA case
4759 case EXPR_BUILTIN_CONSTANT_P:
4760 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
4765 case EXPR_STATEMENT: {
4766 bool old_reaches_end = reaches_end;
4767 reaches_end = false;
4768 check_reachable(expr->statement.statement);
4769 bool returns = reaches_end;
4770 reaches_end = old_reaches_end;
4774 case EXPR_CONDITIONAL:
4775 // TODO handle constant expression
4777 if (!expression_returns(expr->conditional.condition))
4780 if (expr->conditional.true_expression != NULL
4781 && expression_returns(expr->conditional.true_expression))
4784 return expression_returns(expr->conditional.false_expression);
4787 return expression_returns(expr->select.compound);
4789 case EXPR_ARRAY_ACCESS:
4791 expression_returns(expr->array_access.array_ref) &&
4792 expression_returns(expr->array_access.index);
4795 return expression_returns(expr->va_starte.ap);
4798 return expression_returns(expr->va_arge.ap);
4801 return expression_returns(expr->va_copye.src);
4803 case EXPR_UNARY_CASES_MANDATORY:
4804 return expression_returns(expr->unary.value);
4806 case EXPR_UNARY_THROW:
4809 case EXPR_BINARY_CASES:
4810 // TODO handle constant lhs of && and ||
4812 expression_returns(expr->binary.left) &&
4813 expression_returns(expr->binary.right);
4816 panic("unhandled expression");
4819 static bool initializer_returns(initializer_t const *const init)
4821 switch (init->kind) {
4822 case INITIALIZER_VALUE:
4823 return expression_returns(init->value.value);
4825 case INITIALIZER_LIST: {
4826 initializer_t * const* i = init->list.initializers;
4827 initializer_t * const* const end = i + init->list.len;
4828 bool returns = true;
4829 for (; i != end; ++i) {
4830 if (!initializer_returns(*i))
4836 case INITIALIZER_STRING:
4837 case INITIALIZER_WIDE_STRING:
4838 case INITIALIZER_DESIGNATOR: // designators have no payload
4841 panic("unhandled initializer");
4844 static bool noreturn_candidate;
4846 static void check_reachable(statement_t *const stmt)
4848 if (stmt->base.reachable)
4850 if (stmt->kind != STATEMENT_DO_WHILE)
4851 stmt->base.reachable = true;
4853 statement_t *last = stmt;
4855 switch (stmt->kind) {
4856 case STATEMENT_ERROR:
4857 case STATEMENT_EMPTY:
4859 next = stmt->base.next;
4862 case STATEMENT_DECLARATION: {
4863 declaration_statement_t const *const decl = &stmt->declaration;
4864 entity_t const * ent = decl->declarations_begin;
4865 entity_t const *const last_decl = decl->declarations_end;
4867 for (;; ent = ent->base.next) {
4868 if (ent->kind == ENTITY_VARIABLE &&
4869 ent->variable.initializer != NULL &&
4870 !initializer_returns(ent->variable.initializer)) {
4873 if (ent == last_decl)
4877 next = stmt->base.next;
4881 case STATEMENT_COMPOUND:
4882 next = stmt->compound.statements;
4884 next = stmt->base.next;
4887 case STATEMENT_RETURN: {
4888 expression_t const *const val = stmt->returns.value;
4889 if (val == NULL || expression_returns(val))
4890 noreturn_candidate = false;
4894 case STATEMENT_IF: {
4895 if_statement_t const *const ifs = &stmt->ifs;
4896 expression_t const *const cond = ifs->condition;
4898 if (!expression_returns(cond))
4901 int const val = determine_truth(cond);
4904 check_reachable(ifs->true_statement);
4909 if (ifs->false_statement != NULL) {
4910 check_reachable(ifs->false_statement);
4914 next = stmt->base.next;
4918 case STATEMENT_SWITCH: {
4919 switch_statement_t const *const switchs = &stmt->switchs;
4920 expression_t const *const expr = switchs->expression;
4922 if (!expression_returns(expr))
4925 if (is_constant_expression(expr) == EXPR_CLASS_CONSTANT) {
4926 long const val = fold_constant_to_int(expr);
4927 case_label_statement_t * defaults = NULL;
4928 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4929 if (i->expression == NULL) {
4934 if (i->first_case <= val && val <= i->last_case) {
4935 check_reachable((statement_t*)i);
4940 if (defaults != NULL) {
4941 check_reachable((statement_t*)defaults);
4945 bool has_default = false;
4946 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4947 if (i->expression == NULL)
4950 check_reachable((statement_t*)i);
4957 next = stmt->base.next;
4961 case STATEMENT_EXPRESSION: {
4962 /* Check for noreturn function call */
4963 expression_t const *const expr = stmt->expression.expression;
4964 if (!expression_returns(expr))
4967 next = stmt->base.next;
4971 case STATEMENT_CONTINUE:
4972 for (statement_t *parent = stmt;;) {
4973 parent = parent->base.parent;
4974 if (parent == NULL) /* continue not within loop */
4978 switch (parent->kind) {
4979 case STATEMENT_WHILE: goto continue_while;
4980 case STATEMENT_DO_WHILE: goto continue_do_while;
4981 case STATEMENT_FOR: goto continue_for;
4987 case STATEMENT_BREAK:
4988 for (statement_t *parent = stmt;;) {
4989 parent = parent->base.parent;
4990 if (parent == NULL) /* break not within loop/switch */
4993 switch (parent->kind) {
4994 case STATEMENT_SWITCH:
4995 case STATEMENT_WHILE:
4996 case STATEMENT_DO_WHILE:
4999 next = parent->base.next;
5000 goto found_break_parent;
5008 case STATEMENT_COMPUTED_GOTO: {
5009 if (!expression_returns(stmt->computed_goto.expression))
5012 statement_t *parent = stmt->base.parent;
5013 if (parent == NULL) /* top level goto */
5019 case STATEMENT_GOTO:
5020 next = stmt->gotos.label->statement;
5021 if (next == NULL) /* missing label */
5025 case STATEMENT_LABEL:
5026 next = stmt->label.statement;
5029 case STATEMENT_CASE_LABEL:
5030 next = stmt->case_label.statement;
5033 case STATEMENT_WHILE: {
5034 while_statement_t const *const whiles = &stmt->whiles;
5035 expression_t const *const cond = whiles->condition;
5037 if (!expression_returns(cond))
5040 int const val = determine_truth(cond);
5043 check_reachable(whiles->body);
5048 next = stmt->base.next;
5052 case STATEMENT_DO_WHILE:
5053 next = stmt->do_while.body;
5056 case STATEMENT_FOR: {
5057 for_statement_t *const fors = &stmt->fors;
5059 if (fors->condition_reachable)
5061 fors->condition_reachable = true;
5063 expression_t const *const cond = fors->condition;
5068 } else if (expression_returns(cond)) {
5069 val = determine_truth(cond);
5075 check_reachable(fors->body);
5080 next = stmt->base.next;
5084 case STATEMENT_MS_TRY: {
5085 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5086 check_reachable(ms_try->try_statement);
5087 next = ms_try->final_statement;
5091 case STATEMENT_LEAVE: {
5092 statement_t *parent = stmt;
5094 parent = parent->base.parent;
5095 if (parent == NULL) /* __leave not within __try */
5098 if (parent->kind == STATEMENT_MS_TRY) {
5100 next = parent->ms_try.final_statement;
5108 panic("invalid statement kind");
5111 while (next == NULL) {
5112 next = last->base.parent;
5114 noreturn_candidate = false;
5116 type_t *const type = skip_typeref(current_function->base.type);
5117 assert(is_type_function(type));
5118 type_t *const ret = skip_typeref(type->function.return_type);
5119 if (!is_type_void(ret) &&
5120 is_type_valid(ret) &&
5121 !is_sym_main(current_function->base.base.symbol)) {
5122 source_position_t const *const pos = &stmt->base.source_position;
5123 warningf(WARN_RETURN_TYPE, pos, "control reaches end of non-void function");
5128 switch (next->kind) {
5129 case STATEMENT_ERROR:
5130 case STATEMENT_EMPTY:
5131 case STATEMENT_DECLARATION:
5132 case STATEMENT_EXPRESSION:
5134 case STATEMENT_RETURN:
5135 case STATEMENT_CONTINUE:
5136 case STATEMENT_BREAK:
5137 case STATEMENT_COMPUTED_GOTO:
5138 case STATEMENT_GOTO:
5139 case STATEMENT_LEAVE:
5140 panic("invalid control flow in function");
5142 case STATEMENT_COMPOUND:
5143 if (next->compound.stmt_expr) {
5149 case STATEMENT_SWITCH:
5150 case STATEMENT_LABEL:
5151 case STATEMENT_CASE_LABEL:
5153 next = next->base.next;
5156 case STATEMENT_WHILE: {
5158 if (next->base.reachable)
5160 next->base.reachable = true;
5162 while_statement_t const *const whiles = &next->whiles;
5163 expression_t const *const cond = whiles->condition;
5165 if (!expression_returns(cond))
5168 int const val = determine_truth(cond);
5171 check_reachable(whiles->body);
5177 next = next->base.next;
5181 case STATEMENT_DO_WHILE: {
5183 if (next->base.reachable)
5185 next->base.reachable = true;
5187 do_while_statement_t const *const dw = &next->do_while;
5188 expression_t const *const cond = dw->condition;
5190 if (!expression_returns(cond))
5193 int const val = determine_truth(cond);
5196 check_reachable(dw->body);
5202 next = next->base.next;
5206 case STATEMENT_FOR: {
5208 for_statement_t *const fors = &next->fors;
5210 fors->step_reachable = true;
5212 if (fors->condition_reachable)
5214 fors->condition_reachable = true;
5216 expression_t const *const cond = fors->condition;
5221 } else if (expression_returns(cond)) {
5222 val = determine_truth(cond);
5228 check_reachable(fors->body);
5234 next = next->base.next;
5238 case STATEMENT_MS_TRY:
5240 next = next->ms_try.final_statement;
5245 check_reachable(next);
5248 static void check_unreachable(statement_t* const stmt, void *const env)
5252 switch (stmt->kind) {
5253 case STATEMENT_DO_WHILE:
5254 if (!stmt->base.reachable) {
5255 expression_t const *const cond = stmt->do_while.condition;
5256 if (determine_truth(cond) >= 0) {
5257 source_position_t const *const pos = &cond->base.source_position;
5258 warningf(WARN_UNREACHABLE_CODE, pos, "condition of do-while-loop is unreachable");
5263 case STATEMENT_FOR: {
5264 for_statement_t const* const fors = &stmt->fors;
5266 // if init and step are unreachable, cond is unreachable, too
5267 if (!stmt->base.reachable && !fors->step_reachable) {
5268 goto warn_unreachable;
5270 if (!stmt->base.reachable && fors->initialisation != NULL) {
5271 source_position_t const *const pos = &fors->initialisation->base.source_position;
5272 warningf(WARN_UNREACHABLE_CODE, pos, "initialisation of for-statement is unreachable");
5275 if (!fors->condition_reachable && fors->condition != NULL) {
5276 source_position_t const *const pos = &fors->condition->base.source_position;
5277 warningf(WARN_UNREACHABLE_CODE, pos, "condition of for-statement is unreachable");
5280 if (!fors->step_reachable && fors->step != NULL) {
5281 source_position_t const *const pos = &fors->step->base.source_position;
5282 warningf(WARN_UNREACHABLE_CODE, pos, "step of for-statement is unreachable");
5288 case STATEMENT_COMPOUND:
5289 if (stmt->compound.statements != NULL)
5291 goto warn_unreachable;
5293 case STATEMENT_DECLARATION: {
5294 /* Only warn if there is at least one declarator with an initializer.
5295 * This typically occurs in switch statements. */
5296 declaration_statement_t const *const decl = &stmt->declaration;
5297 entity_t const * ent = decl->declarations_begin;
5298 entity_t const *const last = decl->declarations_end;
5300 for (;; ent = ent->base.next) {
5301 if (ent->kind == ENTITY_VARIABLE &&
5302 ent->variable.initializer != NULL) {
5303 goto warn_unreachable;
5313 if (!stmt->base.reachable) {
5314 source_position_t const *const pos = &stmt->base.source_position;
5315 warningf(WARN_UNREACHABLE_CODE, pos, "statement is unreachable");
5321 static bool is_main(entity_t *entity)
5323 static symbol_t *sym_main = NULL;
5324 if (sym_main == NULL) {
5325 sym_main = symbol_table_insert("main");
5328 if (entity->base.symbol != sym_main)
5330 /* must be in outermost scope */
5331 if (entity->base.parent_scope != file_scope)
5337 static void parse_external_declaration(void)
5339 /* function-definitions and declarations both start with declaration
5341 add_anchor_token(';');
5342 declaration_specifiers_t specifiers;
5343 parse_declaration_specifiers(&specifiers);
5344 rem_anchor_token(';');
5346 /* must be a declaration */
5347 if (token.kind == ';') {
5348 parse_anonymous_declaration_rest(&specifiers);
5352 add_anchor_token(',');
5353 add_anchor_token('=');
5354 add_anchor_token(';');
5355 add_anchor_token('{');
5357 /* declarator is common to both function-definitions and declarations */
5358 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
5360 rem_anchor_token('{');
5361 rem_anchor_token(';');
5362 rem_anchor_token('=');
5363 rem_anchor_token(',');
5365 /* must be a declaration */
5366 switch (token.kind) {
5370 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
5375 /* must be a function definition */
5376 parse_kr_declaration_list(ndeclaration);
5378 if (token.kind != '{') {
5379 parse_error_expected("while parsing function definition", '{', NULL);
5380 eat_until_matching_token(';');
5384 assert(is_declaration(ndeclaration));
5385 type_t *const orig_type = ndeclaration->declaration.type;
5386 type_t * type = skip_typeref(orig_type);
5388 if (!is_type_function(type)) {
5389 if (is_type_valid(type)) {
5390 errorf(HERE, "declarator '%#N' has a body but is not a function type", ndeclaration);
5396 source_position_t const *const pos = &ndeclaration->base.source_position;
5397 if (is_typeref(orig_type)) {
5399 errorf(pos, "type of function definition '%#N' is a typedef", ndeclaration);
5402 if (is_type_compound(skip_typeref(type->function.return_type))) {
5403 warningf(WARN_AGGREGATE_RETURN, pos, "'%N' returns an aggregate", ndeclaration);
5405 if (type->function.unspecified_parameters) {
5406 warningf(WARN_OLD_STYLE_DEFINITION, pos, "old-style definition of '%N'", ndeclaration);
5408 warningf(WARN_TRADITIONAL, pos, "traditional C rejects ISO C style definition of '%N'", ndeclaration);
5411 /* §6.7.5.3:14 a function definition with () means no
5412 * parameters (and not unspecified parameters) */
5413 if (type->function.unspecified_parameters &&
5414 type->function.parameters == NULL) {
5415 type_t *copy = duplicate_type(type);
5416 copy->function.unspecified_parameters = false;
5417 type = identify_new_type(copy);
5419 ndeclaration->declaration.type = type;
5422 entity_t *const entity = record_entity(ndeclaration, true);
5423 assert(entity->kind == ENTITY_FUNCTION);
5424 assert(ndeclaration->kind == ENTITY_FUNCTION);
5426 function_t *const function = &entity->function;
5427 if (ndeclaration != entity) {
5428 function->parameters = ndeclaration->function.parameters;
5430 assert(is_declaration(entity));
5431 type = skip_typeref(entity->declaration.type);
5433 PUSH_SCOPE(&function->parameters);
5435 entity_t *parameter = function->parameters.entities;
5436 for (; parameter != NULL; parameter = parameter->base.next) {
5437 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5438 parameter->base.parent_scope = current_scope;
5440 assert(parameter->base.parent_scope == NULL
5441 || parameter->base.parent_scope == current_scope);
5442 parameter->base.parent_scope = current_scope;
5443 if (parameter->base.symbol == NULL) {
5444 errorf(¶meter->base.source_position, "parameter name omitted");
5447 environment_push(parameter);
5450 if (function->statement != NULL) {
5451 parser_error_multiple_definition(entity, HERE);
5454 /* parse function body */
5455 int label_stack_top = label_top();
5456 function_t *old_current_function = current_function;
5457 entity_t *old_current_entity = current_entity;
5458 current_function = function;
5459 current_entity = entity;
5463 goto_anchor = &goto_first;
5465 label_anchor = &label_first;
5467 statement_t *const body = parse_compound_statement(false);
5468 function->statement = body;
5471 check_declarations();
5472 if (is_warn_on(WARN_RETURN_TYPE) ||
5473 is_warn_on(WARN_UNREACHABLE_CODE) ||
5474 (is_warn_on(WARN_MISSING_NORETURN) && !(function->base.modifiers & DM_NORETURN))) {
5475 noreturn_candidate = true;
5476 check_reachable(body);
5477 if (is_warn_on(WARN_UNREACHABLE_CODE))
5478 walk_statements(body, check_unreachable, NULL);
5479 if (noreturn_candidate &&
5480 !(function->base.modifiers & DM_NORETURN)) {
5481 source_position_t const *const pos = &body->base.source_position;
5482 warningf(WARN_MISSING_NORETURN, pos, "function '%#N' is candidate for attribute 'noreturn'", entity);
5486 if (is_main(entity) && enable_main_collect2_hack)
5487 prepare_main_collect2(entity);
5490 assert(current_function == function);
5491 assert(current_entity == entity);
5492 current_entity = old_current_entity;
5493 current_function = old_current_function;
5494 label_pop_to(label_stack_top);
5500 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
5502 entity_t *iter = compound->members.entities;
5503 for (; iter != NULL; iter = iter->base.next) {
5504 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5507 if (iter->base.symbol == symbol) {
5509 } else if (iter->base.symbol == NULL) {
5510 /* search in anonymous structs and unions */
5511 type_t *type = skip_typeref(iter->declaration.type);
5512 if (is_type_compound(type)) {
5513 if (find_compound_entry(type->compound.compound, symbol)
5524 static void check_deprecated(const source_position_t *source_position,
5525 const entity_t *entity)
5527 if (!is_declaration(entity))
5529 if ((entity->declaration.modifiers & DM_DEPRECATED) == 0)
5532 source_position_t const *const epos = &entity->base.source_position;
5533 char const *const msg = get_deprecated_string(entity->declaration.attributes);
5535 warningf(WARN_DEPRECATED_DECLARATIONS, source_position, "'%N' is deprecated (declared %P): \"%s\"", entity, epos, msg);
5537 warningf(WARN_DEPRECATED_DECLARATIONS, source_position, "'%N' is deprecated (declared %P)", entity, epos);
5542 static expression_t *create_select(const source_position_t *pos,
5544 type_qualifiers_t qualifiers,
5547 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
5549 check_deprecated(pos, entry);
5551 expression_t *select = allocate_expression_zero(EXPR_SELECT);
5552 select->select.compound = addr;
5553 select->select.compound_entry = entry;
5555 type_t *entry_type = entry->declaration.type;
5556 type_t *res_type = get_qualified_type(entry_type, qualifiers);
5558 /* bitfields need special treatment */
5559 if (entry->compound_member.bitfield) {
5560 unsigned bit_size = entry->compound_member.bit_size;
5561 /* if fewer bits than an int, convert to int (see §6.3.1.1) */
5562 if (bit_size < get_atomic_type_size(ATOMIC_TYPE_INT) * BITS_PER_BYTE) {
5563 res_type = type_int;
5567 /* we always do the auto-type conversions; the & and sizeof parser contains
5568 * code to revert this! */
5569 select->base.type = automatic_type_conversion(res_type);
5576 * Find entry with symbol in compound. Search anonymous structs and unions and
5577 * creates implicit select expressions for them.
5578 * Returns the adress for the innermost compound.
5580 static expression_t *find_create_select(const source_position_t *pos,
5582 type_qualifiers_t qualifiers,
5583 compound_t *compound, symbol_t *symbol)
5585 entity_t *iter = compound->members.entities;
5586 for (; iter != NULL; iter = iter->base.next) {
5587 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5590 symbol_t *iter_symbol = iter->base.symbol;
5591 if (iter_symbol == NULL) {
5592 type_t *type = iter->declaration.type;
5593 if (type->kind != TYPE_COMPOUND_STRUCT
5594 && type->kind != TYPE_COMPOUND_UNION)
5597 compound_t *sub_compound = type->compound.compound;
5599 if (find_compound_entry(sub_compound, symbol) == NULL)
5602 expression_t *sub_addr = create_select(pos, addr, qualifiers, iter);
5603 sub_addr->base.source_position = *pos;
5604 sub_addr->base.implicit = true;
5605 return find_create_select(pos, sub_addr, qualifiers, sub_compound,
5609 if (iter_symbol == symbol) {
5610 return create_select(pos, addr, qualifiers, iter);
5617 static void parse_bitfield_member(entity_t *entity)
5621 expression_t *size = parse_constant_expression();
5624 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5625 type_t *type = entity->declaration.type;
5626 if (!is_type_integer(skip_typeref(type))) {
5627 errorf(HERE, "bitfield base type '%T' is not an integer type",
5631 if (is_constant_expression(size) != EXPR_CLASS_CONSTANT) {
5632 /* error already reported by parse_constant_expression */
5633 size_long = get_type_size(type) * 8;
5635 size_long = fold_constant_to_int(size);
5637 const symbol_t *symbol = entity->base.symbol;
5638 const symbol_t *user_symbol
5639 = symbol == NULL ? sym_anonymous : symbol;
5640 unsigned bit_size = get_type_size(type) * 8;
5641 if (size_long < 0) {
5642 errorf(HERE, "negative width in bit-field '%Y'", user_symbol);
5643 } else if (size_long == 0 && symbol != NULL) {
5644 errorf(HERE, "zero width for bit-field '%Y'", user_symbol);
5645 } else if (bit_size > 0 && (unsigned)size_long > bit_size) {
5646 errorf(HERE, "width of bitfield '%Y' exceeds its type",
5649 /* hope that people don't invent crazy types with more bits
5650 * than our struct can hold */
5652 (1 << sizeof(entity->compound_member.bit_size)*8));
5656 entity->compound_member.bitfield = true;
5657 entity->compound_member.bit_size = (unsigned char)size_long;
5660 static void parse_compound_declarators(compound_t *compound,
5661 const declaration_specifiers_t *specifiers)
5666 if (token.kind == ':') {
5667 /* anonymous bitfield */
5668 type_t *type = specifiers->type;
5669 entity_t *entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER,
5670 NAMESPACE_NORMAL, NULL);
5671 entity->base.source_position = *HERE;
5672 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
5673 entity->declaration.storage_class = STORAGE_CLASS_NONE;
5674 entity->declaration.type = type;
5676 parse_bitfield_member(entity);
5678 attribute_t *attributes = parse_attributes(NULL);
5679 attribute_t **anchor = &attributes;
5680 while (*anchor != NULL)
5681 anchor = &(*anchor)->next;
5682 *anchor = specifiers->attributes;
5683 if (attributes != NULL) {
5684 handle_entity_attributes(attributes, entity);
5686 entity->declaration.attributes = attributes;
5688 append_entity(&compound->members, entity);
5690 entity = parse_declarator(specifiers,
5691 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
5692 source_position_t const *const pos = &entity->base.source_position;
5693 if (entity->kind == ENTITY_TYPEDEF) {
5694 errorf(pos, "typedef not allowed as compound member");
5696 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5698 /* make sure we don't define a symbol multiple times */
5699 symbol_t *symbol = entity->base.symbol;
5700 if (symbol != NULL) {
5701 entity_t *prev = find_compound_entry(compound, symbol);
5703 source_position_t const *const ppos = &prev->base.source_position;
5704 errorf(pos, "multiple declarations of symbol '%Y' (declared %P)", symbol, ppos);
5708 if (token.kind == ':') {
5709 parse_bitfield_member(entity);
5711 attribute_t *attributes = parse_attributes(NULL);
5712 handle_entity_attributes(attributes, entity);
5714 type_t *orig_type = entity->declaration.type;
5715 type_t *type = skip_typeref(orig_type);
5716 if (is_type_function(type)) {
5717 errorf(pos, "'%N' must not have function type '%T'", entity, orig_type);
5718 } else if (is_type_incomplete(type)) {
5719 /* §6.7.2.1:16 flexible array member */
5720 if (!is_type_array(type) ||
5721 token.kind != ';' ||
5722 look_ahead(1)->kind != '}') {
5723 errorf(pos, "'%N' has incomplete type '%T'", entity, orig_type);
5724 } else if (compound->members.entities == NULL) {
5725 errorf(pos, "flexible array member in otherwise empty struct");
5730 append_entity(&compound->members, entity);
5733 } while (next_if(','));
5734 expect(';', end_error);
5737 anonymous_entity = NULL;
5740 static void parse_compound_type_entries(compound_t *compound)
5743 add_anchor_token('}');
5746 switch (token.kind) {
5748 case T___extension__:
5749 case T_IDENTIFIER: {
5751 declaration_specifiers_t specifiers;
5752 parse_declaration_specifiers(&specifiers);
5753 parse_compound_declarators(compound, &specifiers);
5759 rem_anchor_token('}');
5760 expect('}', end_error);
5763 compound->complete = true;
5769 static type_t *parse_typename(void)
5771 declaration_specifiers_t specifiers;
5772 parse_declaration_specifiers(&specifiers);
5773 if (specifiers.storage_class != STORAGE_CLASS_NONE
5774 || specifiers.thread_local) {
5775 /* TODO: improve error message, user does probably not know what a
5776 * storage class is...
5778 errorf(&specifiers.source_position, "typename must not have a storage class");
5781 type_t *result = parse_abstract_declarator(specifiers.type);
5789 typedef expression_t* (*parse_expression_function)(void);
5790 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
5792 typedef struct expression_parser_function_t expression_parser_function_t;
5793 struct expression_parser_function_t {
5794 parse_expression_function parser;
5795 precedence_t infix_precedence;
5796 parse_expression_infix_function infix_parser;
5799 static expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5802 * Prints an error message if an expression was expected but not read
5804 static expression_t *expected_expression_error(void)
5806 /* skip the error message if the error token was read */
5807 if (token.kind != T_ERROR) {
5808 errorf(HERE, "expected expression, got token %K", &token);
5812 return create_error_expression();
5815 static type_t *get_string_type(void)
5817 return is_warn_on(WARN_WRITE_STRINGS) ? type_const_char_ptr : type_char_ptr;
5820 static type_t *get_wide_string_type(void)
5822 return is_warn_on(WARN_WRITE_STRINGS) ? type_const_wchar_t_ptr : type_wchar_t_ptr;
5826 * Parse a string constant.
5828 static expression_t *parse_string_literal(void)
5830 source_position_t begin = token.base.source_position;
5831 string_t res = token.string.string;
5832 bool is_wide = (token.kind == T_WIDE_STRING_LITERAL);
5835 while (token.kind == T_STRING_LITERAL
5836 || token.kind == T_WIDE_STRING_LITERAL) {
5837 warn_string_concat(&token.base.source_position);
5838 res = concat_strings(&res, &token.string.string);
5840 is_wide |= token.kind == T_WIDE_STRING_LITERAL;
5843 expression_t *literal;
5845 literal = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
5846 literal->base.type = get_wide_string_type();
5848 literal = allocate_expression_zero(EXPR_STRING_LITERAL);
5849 literal->base.type = get_string_type();
5851 literal->base.source_position = begin;
5852 literal->literal.value = res;
5858 * Parse a boolean constant.
5860 static expression_t *parse_boolean_literal(bool value)
5862 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_BOOLEAN);
5863 literal->base.type = type_bool;
5864 literal->literal.value.begin = value ? "true" : "false";
5865 literal->literal.value.size = value ? 4 : 5;
5871 static void warn_traditional_suffix(void)
5873 warningf(WARN_TRADITIONAL, HERE, "traditional C rejects the '%S' suffix",
5874 &token.number.suffix);
5877 static void check_integer_suffix(void)
5879 const string_t *suffix = &token.number.suffix;
5880 if (suffix->size == 0)
5883 bool not_traditional = false;
5884 const char *c = suffix->begin;
5885 if (*c == 'l' || *c == 'L') {
5888 not_traditional = true;
5890 if (*c == 'u' || *c == 'U') {
5893 } else if (*c == 'u' || *c == 'U') {
5894 not_traditional = true;
5897 } else if (*c == 'u' || *c == 'U') {
5898 not_traditional = true;
5900 if (*c == 'l' || *c == 'L') {
5908 errorf(&token.base.source_position,
5909 "invalid suffix '%S' on integer constant", suffix);
5910 } else if (not_traditional) {
5911 warn_traditional_suffix();
5915 static type_t *check_floatingpoint_suffix(void)
5917 const string_t *suffix = &token.number.suffix;
5918 type_t *type = type_double;
5919 if (suffix->size == 0)
5922 bool not_traditional = false;
5923 const char *c = suffix->begin;
5924 if (*c == 'f' || *c == 'F') {
5927 } else if (*c == 'l' || *c == 'L') {
5929 type = type_long_double;
5932 errorf(&token.base.source_position,
5933 "invalid suffix '%S' on floatingpoint constant", suffix);
5934 } else if (not_traditional) {
5935 warn_traditional_suffix();
5942 * Parse an integer constant.
5944 static expression_t *parse_number_literal(void)
5946 expression_kind_t kind;
5949 switch (token.kind) {
5951 kind = EXPR_LITERAL_INTEGER;
5952 check_integer_suffix();
5955 case T_INTEGER_OCTAL:
5956 kind = EXPR_LITERAL_INTEGER_OCTAL;
5957 check_integer_suffix();
5960 case T_INTEGER_HEXADECIMAL:
5961 kind = EXPR_LITERAL_INTEGER_HEXADECIMAL;
5962 check_integer_suffix();
5965 case T_FLOATINGPOINT:
5966 kind = EXPR_LITERAL_FLOATINGPOINT;
5967 type = check_floatingpoint_suffix();
5969 case T_FLOATINGPOINT_HEXADECIMAL:
5970 kind = EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL;
5971 type = check_floatingpoint_suffix();
5974 panic("unexpected token type in parse_number_literal");
5977 expression_t *literal = allocate_expression_zero(kind);
5978 literal->base.type = type;
5979 literal->literal.value = token.number.number;
5980 literal->literal.suffix = token.number.suffix;
5983 /* integer type depends on the size of the number and the size
5984 * representable by the types. The backend/codegeneration has to determine
5987 determine_literal_type(&literal->literal);
5992 * Parse a character constant.
5994 static expression_t *parse_character_constant(void)
5996 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_CHARACTER);
5997 literal->base.type = c_mode & _CXX ? type_char : type_int;
5998 literal->literal.value = token.string.string;
6000 size_t len = literal->literal.value.size;
6002 if (!GNU_MODE && !(c_mode & _C99)) {
6003 errorf(HERE, "more than 1 character in character constant");
6005 literal->base.type = type_int;
6006 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
6015 * Parse a wide character constant.
6017 static expression_t *parse_wide_character_constant(void)
6019 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_WIDE_CHARACTER);
6020 literal->base.type = type_int;
6021 literal->literal.value = token.string.string;
6023 size_t len = wstrlen(&literal->literal.value);
6025 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
6032 static entity_t *create_implicit_function(symbol_t *symbol,
6033 const source_position_t *source_position)
6035 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
6036 ntype->function.return_type = type_int;
6037 ntype->function.unspecified_parameters = true;
6038 ntype->function.linkage = LINKAGE_C;
6039 type_t *type = identify_new_type(ntype);
6041 entity_t *const entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, symbol);
6042 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
6043 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
6044 entity->declaration.type = type;
6045 entity->declaration.implicit = true;
6046 entity->base.source_position = *source_position;
6048 if (current_scope != NULL)
6049 record_entity(entity, false);
6055 * Performs automatic type cast as described in §6.3.2.1.
6057 * @param orig_type the original type
6059 static type_t *automatic_type_conversion(type_t *orig_type)
6061 type_t *type = skip_typeref(orig_type);
6062 if (is_type_array(type)) {
6063 array_type_t *array_type = &type->array;
6064 type_t *element_type = array_type->element_type;
6065 unsigned qualifiers = array_type->base.qualifiers;
6067 return make_pointer_type(element_type, qualifiers);
6070 if (is_type_function(type)) {
6071 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6078 * reverts the automatic casts of array to pointer types and function
6079 * to function-pointer types as defined §6.3.2.1
6081 type_t *revert_automatic_type_conversion(const expression_t *expression)
6083 switch (expression->kind) {
6084 case EXPR_REFERENCE: {
6085 entity_t *entity = expression->reference.entity;
6086 if (is_declaration(entity)) {
6087 return entity->declaration.type;
6088 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6089 return entity->enum_value.enum_type;
6091 panic("no declaration or enum in reference");
6096 entity_t *entity = expression->select.compound_entry;
6097 assert(is_declaration(entity));
6098 type_t *type = entity->declaration.type;
6099 return get_qualified_type(type, expression->base.type->base.qualifiers);
6102 case EXPR_UNARY_DEREFERENCE: {
6103 const expression_t *const value = expression->unary.value;
6104 type_t *const type = skip_typeref(value->base.type);
6105 if (!is_type_pointer(type))
6106 return type_error_type;
6107 return type->pointer.points_to;
6110 case EXPR_ARRAY_ACCESS: {
6111 const expression_t *array_ref = expression->array_access.array_ref;
6112 type_t *type_left = skip_typeref(array_ref->base.type);
6113 if (!is_type_pointer(type_left))
6114 return type_error_type;
6115 return type_left->pointer.points_to;
6118 case EXPR_STRING_LITERAL: {
6119 size_t size = expression->string_literal.value.size;
6120 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6123 case EXPR_WIDE_STRING_LITERAL: {
6124 size_t size = wstrlen(&expression->string_literal.value);
6125 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6128 case EXPR_COMPOUND_LITERAL:
6129 return expression->compound_literal.type;
6134 return expression->base.type;
6138 * Find an entity matching a symbol in a scope.
6139 * Uses current scope if scope is NULL
6141 static entity_t *lookup_entity(const scope_t *scope, symbol_t *symbol,
6142 namespace_tag_t namespc)
6144 if (scope == NULL) {
6145 return get_entity(symbol, namespc);
6148 /* we should optimize here, if scope grows above a certain size we should
6149 construct a hashmap here... */
6150 entity_t *entity = scope->entities;
6151 for ( ; entity != NULL; entity = entity->base.next) {
6152 if (entity->base.symbol == symbol
6153 && (namespace_tag_t)entity->base.namespc == namespc)
6160 static entity_t *parse_qualified_identifier(void)
6162 /* namespace containing the symbol */
6164 source_position_t pos;
6165 const scope_t *lookup_scope = NULL;
6167 if (next_if(T_COLONCOLON))
6168 lookup_scope = &unit->scope;
6172 if (token.kind != T_IDENTIFIER) {
6173 parse_error_expected("while parsing identifier", T_IDENTIFIER, NULL);
6174 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6176 symbol = token.identifier.symbol;
6181 entity = lookup_entity(lookup_scope, symbol, NAMESPACE_NORMAL);
6183 if (!next_if(T_COLONCOLON))
6186 switch (entity->kind) {
6187 case ENTITY_NAMESPACE:
6188 lookup_scope = &entity->namespacee.members;
6193 lookup_scope = &entity->compound.members;
6196 errorf(&pos, "'%Y' must be a namespace, class, struct or union (but is a %s)",
6197 symbol, get_entity_kind_name(entity->kind));
6199 /* skip further qualifications */
6200 while (next_if(T_IDENTIFIER) && next_if(T_COLONCOLON)) {}
6202 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6206 if (entity == NULL) {
6207 if (!strict_mode && token.kind == '(') {
6208 /* an implicitly declared function */
6209 warningf(WARN_IMPLICIT_FUNCTION_DECLARATION, &pos,
6210 "implicit declaration of function '%Y'", symbol);
6211 entity = create_implicit_function(symbol, &pos);
6213 errorf(&pos, "unknown identifier '%Y' found.", symbol);
6214 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6221 static expression_t *parse_reference(void)
6223 source_position_t const pos = token.base.source_position;
6224 entity_t *const entity = parse_qualified_identifier();
6227 if (is_declaration(entity)) {
6228 orig_type = entity->declaration.type;
6229 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6230 orig_type = entity->enum_value.enum_type;
6232 panic("expected declaration or enum value in reference");
6235 /* we always do the auto-type conversions; the & and sizeof parser contains
6236 * code to revert this! */
6237 type_t *type = automatic_type_conversion(orig_type);
6239 expression_kind_t kind = EXPR_REFERENCE;
6240 if (entity->kind == ENTITY_ENUM_VALUE)
6241 kind = EXPR_ENUM_CONSTANT;
6243 expression_t *expression = allocate_expression_zero(kind);
6244 expression->base.source_position = pos;
6245 expression->base.type = type;
6246 expression->reference.entity = entity;
6248 /* this declaration is used */
6249 if (is_declaration(entity)) {
6250 entity->declaration.used = true;
6253 if (entity->base.parent_scope != file_scope
6254 && (current_function != NULL
6255 && entity->base.parent_scope->depth < current_function->parameters.depth)
6256 && (entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER)) {
6257 if (entity->kind == ENTITY_VARIABLE) {
6258 /* access of a variable from an outer function */
6259 entity->variable.address_taken = true;
6260 } else if (entity->kind == ENTITY_PARAMETER) {
6261 entity->parameter.address_taken = true;
6263 current_function->need_closure = true;
6266 check_deprecated(&pos, entity);
6271 static bool semantic_cast(expression_t *cast)
6273 expression_t *expression = cast->unary.value;
6274 type_t *orig_dest_type = cast->base.type;
6275 type_t *orig_type_right = expression->base.type;
6276 type_t const *dst_type = skip_typeref(orig_dest_type);
6277 type_t const *src_type = skip_typeref(orig_type_right);
6278 source_position_t const *pos = &cast->base.source_position;
6280 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6281 if (dst_type == type_void)
6284 /* only integer and pointer can be casted to pointer */
6285 if (is_type_pointer(dst_type) &&
6286 !is_type_pointer(src_type) &&
6287 !is_type_integer(src_type) &&
6288 is_type_valid(src_type)) {
6289 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6293 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6294 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6298 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6299 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6303 if (is_type_pointer(src_type) && is_type_pointer(dst_type)) {
6304 type_t *src = skip_typeref(src_type->pointer.points_to);
6305 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6306 unsigned missing_qualifiers =
6307 src->base.qualifiers & ~dst->base.qualifiers;
6308 if (missing_qualifiers != 0) {
6309 warningf(WARN_CAST_QUAL, pos, "cast discards qualifiers '%Q' in pointer target type of '%T'", missing_qualifiers, orig_type_right);
6315 static expression_t *parse_compound_literal(source_position_t const *const pos, type_t *type)
6317 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6318 expression->base.source_position = *pos;
6320 parse_initializer_env_t env;
6323 env.must_be_constant = false;
6324 initializer_t *initializer = parse_initializer(&env);
6327 expression->compound_literal.initializer = initializer;
6328 expression->compound_literal.type = type;
6329 expression->base.type = automatic_type_conversion(type);
6335 * Parse a cast expression.
6337 static expression_t *parse_cast(void)
6339 source_position_t const pos = *HERE;
6342 add_anchor_token(')');
6344 type_t *type = parse_typename();
6346 rem_anchor_token(')');
6347 expect(')', end_error);
6349 if (token.kind == '{') {
6350 return parse_compound_literal(&pos, type);
6353 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6354 cast->base.source_position = pos;
6356 expression_t *value = parse_subexpression(PREC_CAST);
6357 cast->base.type = type;
6358 cast->unary.value = value;
6360 if (! semantic_cast(cast)) {
6361 /* TODO: record the error in the AST. else it is impossible to detect it */
6366 return create_error_expression();
6370 * Parse a statement expression.
6372 static expression_t *parse_statement_expression(void)
6374 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6377 add_anchor_token(')');
6379 statement_t *statement = parse_compound_statement(true);
6380 statement->compound.stmt_expr = true;
6381 expression->statement.statement = statement;
6383 /* find last statement and use its type */
6384 type_t *type = type_void;
6385 const statement_t *stmt = statement->compound.statements;
6387 while (stmt->base.next != NULL)
6388 stmt = stmt->base.next;
6390 if (stmt->kind == STATEMENT_EXPRESSION) {
6391 type = stmt->expression.expression->base.type;
6394 source_position_t const *const pos = &expression->base.source_position;
6395 warningf(WARN_OTHER, pos, "empty statement expression ({})");
6397 expression->base.type = type;
6399 rem_anchor_token(')');
6400 expect(')', end_error);
6407 * Parse a parenthesized expression.
6409 static expression_t *parse_parenthesized_expression(void)
6411 token_t const* const la1 = look_ahead(1);
6412 switch (la1->kind) {
6414 /* gcc extension: a statement expression */
6415 return parse_statement_expression();
6418 if (is_typedef_symbol(la1->identifier.symbol)) {
6420 return parse_cast();
6425 add_anchor_token(')');
6426 expression_t *result = parse_expression();
6427 result->base.parenthesized = true;
6428 rem_anchor_token(')');
6429 expect(')', end_error);
6435 static expression_t *parse_function_keyword(void)
6439 if (current_function == NULL) {
6440 errorf(HERE, "'__func__' used outside of a function");
6443 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6444 expression->base.type = type_char_ptr;
6445 expression->funcname.kind = FUNCNAME_FUNCTION;
6452 static expression_t *parse_pretty_function_keyword(void)
6454 if (current_function == NULL) {
6455 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6458 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6459 expression->base.type = type_char_ptr;
6460 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6462 eat(T___PRETTY_FUNCTION__);
6467 static expression_t *parse_funcsig_keyword(void)
6469 if (current_function == NULL) {
6470 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6473 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6474 expression->base.type = type_char_ptr;
6475 expression->funcname.kind = FUNCNAME_FUNCSIG;
6482 static expression_t *parse_funcdname_keyword(void)
6484 if (current_function == NULL) {
6485 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6488 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6489 expression->base.type = type_char_ptr;
6490 expression->funcname.kind = FUNCNAME_FUNCDNAME;
6492 eat(T___FUNCDNAME__);
6497 static designator_t *parse_designator(void)
6499 designator_t *result = allocate_ast_zero(sizeof(result[0]));
6500 result->source_position = *HERE;
6502 if (token.kind != T_IDENTIFIER) {
6503 parse_error_expected("while parsing member designator",
6504 T_IDENTIFIER, NULL);
6507 result->symbol = token.identifier.symbol;
6510 designator_t *last_designator = result;
6513 if (token.kind != T_IDENTIFIER) {
6514 parse_error_expected("while parsing member designator",
6515 T_IDENTIFIER, NULL);
6518 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6519 designator->source_position = *HERE;
6520 designator->symbol = token.identifier.symbol;
6523 last_designator->next = designator;
6524 last_designator = designator;
6528 add_anchor_token(']');
6529 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6530 designator->source_position = *HERE;
6531 designator->array_index = parse_expression();
6532 rem_anchor_token(']');
6533 expect(']', end_error);
6534 if (designator->array_index == NULL) {
6538 last_designator->next = designator;
6539 last_designator = designator;
6551 * Parse the __builtin_offsetof() expression.
6553 static expression_t *parse_offsetof(void)
6555 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6556 expression->base.type = type_size_t;
6558 eat(T___builtin_offsetof);
6560 expect('(', end_error);
6561 add_anchor_token(',');
6562 type_t *type = parse_typename();
6563 rem_anchor_token(',');
6564 expect(',', end_error);
6565 add_anchor_token(')');
6566 designator_t *designator = parse_designator();
6567 rem_anchor_token(')');
6568 expect(')', end_error);
6570 expression->offsetofe.type = type;
6571 expression->offsetofe.designator = designator;
6574 memset(&path, 0, sizeof(path));
6575 path.top_type = type;
6576 path.path = NEW_ARR_F(type_path_entry_t, 0);
6578 descend_into_subtype(&path);
6580 if (!walk_designator(&path, designator, true)) {
6581 return create_error_expression();
6584 DEL_ARR_F(path.path);
6588 return create_error_expression();
6592 * Parses a _builtin_va_start() expression.
6594 static expression_t *parse_va_start(void)
6596 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6598 eat(T___builtin_va_start);
6600 expect('(', end_error);
6601 add_anchor_token(',');
6602 expression->va_starte.ap = parse_assignment_expression();
6603 rem_anchor_token(',');
6604 expect(',', end_error);
6605 expression_t *const expr = parse_assignment_expression();
6606 if (expr->kind == EXPR_REFERENCE) {
6607 entity_t *const entity = expr->reference.entity;
6608 if (!current_function->base.type->function.variadic) {
6609 errorf(&expr->base.source_position,
6610 "'va_start' used in non-variadic function");
6611 } else if (entity->base.parent_scope != ¤t_function->parameters ||
6612 entity->base.next != NULL ||
6613 entity->kind != ENTITY_PARAMETER) {
6614 errorf(&expr->base.source_position,
6615 "second argument of 'va_start' must be last parameter of the current function");
6617 expression->va_starte.parameter = &entity->variable;
6619 expect(')', end_error);
6622 expect(')', end_error);
6624 return create_error_expression();
6628 * Parses a __builtin_va_arg() expression.
6630 static expression_t *parse_va_arg(void)
6632 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6634 eat(T___builtin_va_arg);
6636 expect('(', end_error);
6638 ap.expression = parse_assignment_expression();
6639 expression->va_arge.ap = ap.expression;
6640 check_call_argument(type_valist, &ap, 1);
6642 expect(',', end_error);
6643 expression->base.type = parse_typename();
6644 expect(')', end_error);
6648 return create_error_expression();
6652 * Parses a __builtin_va_copy() expression.
6654 static expression_t *parse_va_copy(void)
6656 expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
6658 eat(T___builtin_va_copy);
6660 expect('(', end_error);
6661 expression_t *dst = parse_assignment_expression();
6662 assign_error_t error = semantic_assign(type_valist, dst);
6663 report_assign_error(error, type_valist, dst, "call argument 1",
6664 &dst->base.source_position);
6665 expression->va_copye.dst = dst;
6667 expect(',', end_error);
6669 call_argument_t src;
6670 src.expression = parse_assignment_expression();
6671 check_call_argument(type_valist, &src, 2);
6672 expression->va_copye.src = src.expression;
6673 expect(')', end_error);
6677 return create_error_expression();
6681 * Parses a __builtin_constant_p() expression.
6683 static expression_t *parse_builtin_constant(void)
6685 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6687 eat(T___builtin_constant_p);
6689 expect('(', end_error);
6690 add_anchor_token(')');
6691 expression->builtin_constant.value = parse_assignment_expression();
6692 rem_anchor_token(')');
6693 expect(')', end_error);
6694 expression->base.type = type_int;
6698 return create_error_expression();
6702 * Parses a __builtin_types_compatible_p() expression.
6704 static expression_t *parse_builtin_types_compatible(void)
6706 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
6708 eat(T___builtin_types_compatible_p);
6710 expect('(', end_error);
6711 add_anchor_token(')');
6712 add_anchor_token(',');
6713 expression->builtin_types_compatible.left = parse_typename();
6714 rem_anchor_token(',');
6715 expect(',', end_error);
6716 expression->builtin_types_compatible.right = parse_typename();
6717 rem_anchor_token(')');
6718 expect(')', end_error);
6719 expression->base.type = type_int;
6723 return create_error_expression();
6727 * Parses a __builtin_is_*() compare expression.
6729 static expression_t *parse_compare_builtin(void)
6731 expression_t *expression;
6733 switch (token.kind) {
6734 case T___builtin_isgreater:
6735 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
6737 case T___builtin_isgreaterequal:
6738 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
6740 case T___builtin_isless:
6741 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
6743 case T___builtin_islessequal:
6744 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
6746 case T___builtin_islessgreater:
6747 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
6749 case T___builtin_isunordered:
6750 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
6753 internal_errorf(HERE, "invalid compare builtin found");
6755 expression->base.source_position = *HERE;
6758 expect('(', end_error);
6759 expression->binary.left = parse_assignment_expression();
6760 expect(',', end_error);
6761 expression->binary.right = parse_assignment_expression();
6762 expect(')', end_error);
6764 type_t *const orig_type_left = expression->binary.left->base.type;
6765 type_t *const orig_type_right = expression->binary.right->base.type;
6767 type_t *const type_left = skip_typeref(orig_type_left);
6768 type_t *const type_right = skip_typeref(orig_type_right);
6769 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6770 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6771 type_error_incompatible("invalid operands in comparison",
6772 &expression->base.source_position, orig_type_left, orig_type_right);
6775 semantic_comparison(&expression->binary);
6780 return create_error_expression();
6784 * Parses a MS assume() expression.
6786 static expression_t *parse_assume(void)
6788 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
6792 expect('(', end_error);
6793 add_anchor_token(')');
6794 expression->unary.value = parse_assignment_expression();
6795 rem_anchor_token(')');
6796 expect(')', end_error);
6798 expression->base.type = type_void;
6801 return create_error_expression();
6805 * Return the label for the current symbol or create a new one.
6807 static label_t *get_label(void)
6809 assert(token.kind == T_IDENTIFIER);
6810 assert(current_function != NULL);
6812 entity_t *label = get_entity(token.identifier.symbol, NAMESPACE_LABEL);
6813 /* If we find a local label, we already created the declaration. */
6814 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
6815 if (label->base.parent_scope != current_scope) {
6816 assert(label->base.parent_scope->depth < current_scope->depth);
6817 current_function->goto_to_outer = true;
6819 } else if (label == NULL || label->base.parent_scope != ¤t_function->parameters) {
6820 /* There is no matching label in the same function, so create a new one. */
6821 label = allocate_entity_zero(ENTITY_LABEL, NAMESPACE_LABEL, token.identifier.symbol);
6826 return &label->label;
6830 * Parses a GNU && label address expression.
6832 static expression_t *parse_label_address(void)
6834 source_position_t source_position = token.base.source_position;
6836 if (token.kind != T_IDENTIFIER) {
6837 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
6838 return create_error_expression();
6841 label_t *const label = get_label();
6843 label->address_taken = true;
6845 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
6846 expression->base.source_position = source_position;
6848 /* label address is treated as a void pointer */
6849 expression->base.type = type_void_ptr;
6850 expression->label_address.label = label;
6855 * Parse a microsoft __noop expression.
6857 static expression_t *parse_noop_expression(void)
6859 /* the result is a (int)0 */
6860 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_MS_NOOP);
6861 literal->base.type = type_int;
6862 literal->literal.value.begin = "__noop";
6863 literal->literal.value.size = 6;
6867 if (token.kind == '(') {
6868 /* parse arguments */
6870 add_anchor_token(')');
6871 add_anchor_token(',');
6873 if (token.kind != ')') do {
6874 (void)parse_assignment_expression();
6875 } while (next_if(','));
6877 rem_anchor_token(',');
6878 rem_anchor_token(')');
6880 expect(')', end_error);
6887 * Parses a primary expression.
6889 static expression_t *parse_primary_expression(void)
6891 switch (token.kind) {
6892 case T_false: return parse_boolean_literal(false);
6893 case T_true: return parse_boolean_literal(true);
6895 case T_INTEGER_OCTAL:
6896 case T_INTEGER_HEXADECIMAL:
6897 case T_FLOATINGPOINT:
6898 case T_FLOATINGPOINT_HEXADECIMAL: return parse_number_literal();
6899 case T_CHARACTER_CONSTANT: return parse_character_constant();
6900 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
6901 case T_STRING_LITERAL:
6902 case T_WIDE_STRING_LITERAL: return parse_string_literal();
6903 case T___FUNCTION__:
6904 case T___func__: return parse_function_keyword();
6905 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
6906 case T___FUNCSIG__: return parse_funcsig_keyword();
6907 case T___FUNCDNAME__: return parse_funcdname_keyword();
6908 case T___builtin_offsetof: return parse_offsetof();
6909 case T___builtin_va_start: return parse_va_start();
6910 case T___builtin_va_arg: return parse_va_arg();
6911 case T___builtin_va_copy: return parse_va_copy();
6912 case T___builtin_isgreater:
6913 case T___builtin_isgreaterequal:
6914 case T___builtin_isless:
6915 case T___builtin_islessequal:
6916 case T___builtin_islessgreater:
6917 case T___builtin_isunordered: return parse_compare_builtin();
6918 case T___builtin_constant_p: return parse_builtin_constant();
6919 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
6920 case T__assume: return parse_assume();
6923 return parse_label_address();
6926 case '(': return parse_parenthesized_expression();
6927 case T___noop: return parse_noop_expression();
6929 /* Gracefully handle type names while parsing expressions. */
6931 return parse_reference();
6933 if (!is_typedef_symbol(token.identifier.symbol)) {
6934 return parse_reference();
6938 source_position_t const pos = *HERE;
6939 declaration_specifiers_t specifiers;
6940 parse_declaration_specifiers(&specifiers);
6941 type_t const *const type = parse_abstract_declarator(specifiers.type);
6942 errorf(&pos, "encountered type '%T' while parsing expression", type);
6943 return create_error_expression();
6947 errorf(HERE, "unexpected token %K, expected an expression", &token);
6949 return create_error_expression();
6952 static expression_t *parse_array_expression(expression_t *left)
6954 expression_t *const expr = allocate_expression_zero(EXPR_ARRAY_ACCESS);
6955 array_access_expression_t *const arr = &expr->array_access;
6958 add_anchor_token(']');
6960 expression_t *const inside = parse_expression();
6962 type_t *const orig_type_left = left->base.type;
6963 type_t *const orig_type_inside = inside->base.type;
6965 type_t *const type_left = skip_typeref(orig_type_left);
6966 type_t *const type_inside = skip_typeref(orig_type_inside);
6972 if (is_type_pointer(type_left)) {
6975 idx_type = type_inside;
6976 res_type = type_left->pointer.points_to;
6978 } else if (is_type_pointer(type_inside)) {
6979 arr->flipped = true;
6982 idx_type = type_left;
6983 res_type = type_inside->pointer.points_to;
6985 res_type = automatic_type_conversion(res_type);
6986 if (!is_type_integer(idx_type)) {
6987 errorf(&idx->base.source_position, "array subscript must have integer type");
6988 } else if (is_type_atomic(idx_type, ATOMIC_TYPE_CHAR)) {
6989 source_position_t const *const pos = &idx->base.source_position;
6990 warningf(WARN_CHAR_SUBSCRIPTS, pos, "array subscript has char type");
6993 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
6994 errorf(&expr->base.source_position, "invalid types '%T[%T]' for array access", orig_type_left, orig_type_inside);
6996 res_type = type_error_type;
7001 arr->array_ref = ref;
7003 arr->base.type = res_type;
7005 rem_anchor_token(']');
7006 expect(']', end_error);
7011 static bool is_bitfield(const expression_t *expression)
7013 return expression->kind == EXPR_SELECT
7014 && expression->select.compound_entry->compound_member.bitfield;
7017 static expression_t *parse_typeprop(expression_kind_t const kind)
7019 expression_t *tp_expression = allocate_expression_zero(kind);
7020 tp_expression->base.type = type_size_t;
7022 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
7025 expression_t *expression;
7026 if (token.kind == '(' && is_declaration_specifier(look_ahead(1))) {
7027 source_position_t const pos = *HERE;
7029 add_anchor_token(')');
7030 orig_type = parse_typename();
7031 rem_anchor_token(')');
7032 expect(')', end_error);
7034 if (token.kind == '{') {
7035 /* It was not sizeof(type) after all. It is sizeof of an expression
7036 * starting with a compound literal */
7037 expression = parse_compound_literal(&pos, orig_type);
7038 goto typeprop_expression;
7041 expression = parse_subexpression(PREC_UNARY);
7043 typeprop_expression:
7044 if (is_bitfield(expression)) {
7045 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7046 errorf(&tp_expression->base.source_position,
7047 "operand of %s expression must not be a bitfield", what);
7050 tp_expression->typeprop.tp_expression = expression;
7052 orig_type = revert_automatic_type_conversion(expression);
7053 expression->base.type = orig_type;
7056 tp_expression->typeprop.type = orig_type;
7057 type_t const* const type = skip_typeref(orig_type);
7058 char const* wrong_type = NULL;
7059 if (is_type_incomplete(type)) {
7060 if (!is_type_void(type) || !GNU_MODE)
7061 wrong_type = "incomplete";
7062 } else if (type->kind == TYPE_FUNCTION) {
7064 /* function types are allowed (and return 1) */
7065 source_position_t const *const pos = &tp_expression->base.source_position;
7066 char const *const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7067 warningf(WARN_OTHER, pos, "%s expression with function argument returns invalid result", what);
7069 wrong_type = "function";
7073 if (wrong_type != NULL) {
7074 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7075 errorf(&tp_expression->base.source_position,
7076 "operand of %s expression must not be of %s type '%T'",
7077 what, wrong_type, orig_type);
7081 return tp_expression;
7084 static expression_t *parse_sizeof(void)
7086 return parse_typeprop(EXPR_SIZEOF);
7089 static expression_t *parse_alignof(void)
7091 return parse_typeprop(EXPR_ALIGNOF);
7094 static expression_t *parse_select_expression(expression_t *addr)
7096 assert(token.kind == '.' || token.kind == T_MINUSGREATER);
7097 bool select_left_arrow = (token.kind == T_MINUSGREATER);
7098 source_position_t const pos = *HERE;
7101 if (token.kind != T_IDENTIFIER) {
7102 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
7103 return create_error_expression();
7105 symbol_t *symbol = token.identifier.symbol;
7108 type_t *const orig_type = addr->base.type;
7109 type_t *const type = skip_typeref(orig_type);
7112 bool saw_error = false;
7113 if (is_type_pointer(type)) {
7114 if (!select_left_arrow) {
7116 "request for member '%Y' in something not a struct or union, but '%T'",
7120 type_left = skip_typeref(type->pointer.points_to);
7122 if (select_left_arrow && is_type_valid(type)) {
7123 errorf(&pos, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7129 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
7130 type_left->kind != TYPE_COMPOUND_UNION) {
7132 if (is_type_valid(type_left) && !saw_error) {
7134 "request for member '%Y' in something not a struct or union, but '%T'",
7137 return create_error_expression();
7140 compound_t *compound = type_left->compound.compound;
7141 if (!compound->complete) {
7142 errorf(&pos, "request for member '%Y' in incomplete type '%T'",
7144 return create_error_expression();
7147 type_qualifiers_t qualifiers = type_left->base.qualifiers;
7148 expression_t *result =
7149 find_create_select(&pos, addr, qualifiers, compound, symbol);
7151 if (result == NULL) {
7152 errorf(&pos, "'%T' has no member named '%Y'", orig_type, symbol);
7153 return create_error_expression();
7159 static void check_call_argument(type_t *expected_type,
7160 call_argument_t *argument, unsigned pos)
7162 type_t *expected_type_skip = skip_typeref(expected_type);
7163 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
7164 expression_t *arg_expr = argument->expression;
7165 type_t *arg_type = skip_typeref(arg_expr->base.type);
7167 /* handle transparent union gnu extension */
7168 if (is_type_union(expected_type_skip)
7169 && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
7170 compound_t *union_decl = expected_type_skip->compound.compound;
7171 type_t *best_type = NULL;
7172 entity_t *entry = union_decl->members.entities;
7173 for ( ; entry != NULL; entry = entry->base.next) {
7174 assert(is_declaration(entry));
7175 type_t *decl_type = entry->declaration.type;
7176 error = semantic_assign(decl_type, arg_expr);
7177 if (error == ASSIGN_ERROR_INCOMPATIBLE
7178 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
7181 if (error == ASSIGN_SUCCESS) {
7182 best_type = decl_type;
7183 } else if (best_type == NULL) {
7184 best_type = decl_type;
7188 if (best_type != NULL) {
7189 expected_type = best_type;
7193 error = semantic_assign(expected_type, arg_expr);
7194 argument->expression = create_implicit_cast(arg_expr, expected_type);
7196 if (error != ASSIGN_SUCCESS) {
7197 /* report exact scope in error messages (like "in argument 3") */
7199 snprintf(buf, sizeof(buf), "call argument %u", pos);
7200 report_assign_error(error, expected_type, arg_expr, buf,
7201 &arg_expr->base.source_position);
7203 type_t *const promoted_type = get_default_promoted_type(arg_type);
7204 if (!types_compatible(expected_type_skip, promoted_type) &&
7205 !types_compatible(expected_type_skip, type_void_ptr) &&
7206 !types_compatible(type_void_ptr, promoted_type)) {
7207 /* Deliberately show the skipped types in this warning */
7208 source_position_t const *const apos = &arg_expr->base.source_position;
7209 warningf(WARN_TRADITIONAL, apos, "passing call argument %u as '%T' rather than '%T' due to prototype", pos, expected_type_skip, promoted_type);
7215 * Handle the semantic restrictions of builtin calls
7217 static void handle_builtin_argument_restrictions(call_expression_t *call)
7219 entity_t *entity = call->function->reference.entity;
7220 switch (entity->function.btk) {
7222 switch (entity->function.b.firm_builtin_kind) {
7223 case ir_bk_return_address:
7224 case ir_bk_frame_address: {
7225 /* argument must be constant */
7226 call_argument_t *argument = call->arguments;
7228 if (is_constant_expression(argument->expression) == EXPR_CLASS_VARIABLE) {
7229 errorf(&call->base.source_position,
7230 "argument of '%Y' must be a constant expression",
7231 call->function->reference.entity->base.symbol);
7235 case ir_bk_prefetch:
7236 /* second and third argument must be constant if existent */
7237 if (call->arguments == NULL)
7239 call_argument_t *rw = call->arguments->next;
7240 call_argument_t *locality = NULL;
7243 if (is_constant_expression(rw->expression) == EXPR_CLASS_VARIABLE) {
7244 errorf(&call->base.source_position,
7245 "second argument of '%Y' must be a constant expression",
7246 call->function->reference.entity->base.symbol);
7248 locality = rw->next;
7250 if (locality != NULL) {
7251 if (is_constant_expression(locality->expression) == EXPR_CLASS_VARIABLE) {
7252 errorf(&call->base.source_position,
7253 "third argument of '%Y' must be a constant expression",
7254 call->function->reference.entity->base.symbol);
7256 locality = rw->next;
7263 case BUILTIN_OBJECT_SIZE:
7264 if (call->arguments == NULL)
7267 call_argument_t *arg = call->arguments->next;
7268 if (arg != NULL && is_constant_expression(arg->expression) == EXPR_CLASS_VARIABLE) {
7269 errorf(&call->base.source_position,
7270 "second argument of '%Y' must be a constant expression",
7271 call->function->reference.entity->base.symbol);
7280 * Parse a call expression, ie. expression '( ... )'.
7282 * @param expression the function address
7284 static expression_t *parse_call_expression(expression_t *expression)
7286 expression_t *result = allocate_expression_zero(EXPR_CALL);
7287 call_expression_t *call = &result->call;
7288 call->function = expression;
7290 type_t *const orig_type = expression->base.type;
7291 type_t *const type = skip_typeref(orig_type);
7293 function_type_t *function_type = NULL;
7294 if (is_type_pointer(type)) {
7295 type_t *const to_type = skip_typeref(type->pointer.points_to);
7297 if (is_type_function(to_type)) {
7298 function_type = &to_type->function;
7299 call->base.type = function_type->return_type;
7303 if (function_type == NULL && is_type_valid(type)) {
7305 "called object '%E' (type '%T') is not a pointer to a function",
7306 expression, orig_type);
7309 /* parse arguments */
7311 add_anchor_token(')');
7312 add_anchor_token(',');
7314 if (token.kind != ')') {
7315 call_argument_t **anchor = &call->arguments;
7317 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7318 argument->expression = parse_assignment_expression();
7321 anchor = &argument->next;
7322 } while (next_if(','));
7324 rem_anchor_token(',');
7325 rem_anchor_token(')');
7326 expect(')', end_error);
7328 if (function_type == NULL)
7331 /* check type and count of call arguments */
7332 function_parameter_t *parameter = function_type->parameters;
7333 call_argument_t *argument = call->arguments;
7334 if (!function_type->unspecified_parameters) {
7335 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7336 parameter = parameter->next, argument = argument->next) {
7337 check_call_argument(parameter->type, argument, ++pos);
7340 if (parameter != NULL) {
7341 errorf(&expression->base.source_position, "too few arguments to function '%E'", expression);
7342 } else if (argument != NULL && !function_type->variadic) {
7343 errorf(&argument->expression->base.source_position, "too many arguments to function '%E'", expression);
7347 /* do default promotion for other arguments */
7348 for (; argument != NULL; argument = argument->next) {
7349 type_t *argument_type = argument->expression->base.type;
7350 if (!is_type_object(skip_typeref(argument_type))) {
7351 errorf(&argument->expression->base.source_position,
7352 "call argument '%E' must not be void", argument->expression);
7355 argument_type = get_default_promoted_type(argument_type);
7357 argument->expression
7358 = create_implicit_cast(argument->expression, argument_type);
7363 if (is_type_compound(skip_typeref(function_type->return_type))) {
7364 source_position_t const *const pos = &expression->base.source_position;
7365 warningf(WARN_AGGREGATE_RETURN, pos, "function call has aggregate value");
7368 if (expression->kind == EXPR_REFERENCE) {
7369 reference_expression_t *reference = &expression->reference;
7370 if (reference->entity->kind == ENTITY_FUNCTION &&
7371 reference->entity->function.btk != BUILTIN_NONE)
7372 handle_builtin_argument_restrictions(call);
7379 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7381 static bool same_compound_type(const type_t *type1, const type_t *type2)
7384 is_type_compound(type1) &&
7385 type1->kind == type2->kind &&
7386 type1->compound.compound == type2->compound.compound;
7389 static expression_t const *get_reference_address(expression_t const *expr)
7391 bool regular_take_address = true;
7393 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7394 expr = expr->unary.value;
7396 regular_take_address = false;
7399 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7402 expr = expr->unary.value;
7405 if (expr->kind != EXPR_REFERENCE)
7408 /* special case for functions which are automatically converted to a
7409 * pointer to function without an extra TAKE_ADDRESS operation */
7410 if (!regular_take_address &&
7411 expr->reference.entity->kind != ENTITY_FUNCTION) {
7418 static void warn_reference_address_as_bool(expression_t const* expr)
7420 expr = get_reference_address(expr);
7422 source_position_t const *const pos = &expr->base.source_position;
7423 entity_t const *const ent = expr->reference.entity;
7424 warningf(WARN_ADDRESS, pos, "the address of '%N' will always evaluate as 'true'", ent);
7428 static void warn_assignment_in_condition(const expression_t *const expr)
7430 if (expr->base.kind != EXPR_BINARY_ASSIGN)
7432 if (expr->base.parenthesized)
7434 source_position_t const *const pos = &expr->base.source_position;
7435 warningf(WARN_PARENTHESES, pos, "suggest parentheses around assignment used as truth value");
7438 static void semantic_condition(expression_t const *const expr,
7439 char const *const context)
7441 type_t *const type = skip_typeref(expr->base.type);
7442 if (is_type_scalar(type)) {
7443 warn_reference_address_as_bool(expr);
7444 warn_assignment_in_condition(expr);
7445 } else if (is_type_valid(type)) {
7446 errorf(&expr->base.source_position,
7447 "%s must have scalar type", context);
7452 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7454 * @param expression the conditional expression
7456 static expression_t *parse_conditional_expression(expression_t *expression)
7458 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7460 conditional_expression_t *conditional = &result->conditional;
7461 conditional->condition = expression;
7464 add_anchor_token(':');
7466 /* §6.5.15:2 The first operand shall have scalar type. */
7467 semantic_condition(expression, "condition of conditional operator");
7469 expression_t *true_expression = expression;
7470 bool gnu_cond = false;
7471 if (GNU_MODE && token.kind == ':') {
7474 true_expression = parse_expression();
7476 rem_anchor_token(':');
7477 expect(':', end_error);
7479 expression_t *false_expression =
7480 parse_subexpression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7482 type_t *const orig_true_type = true_expression->base.type;
7483 type_t *const orig_false_type = false_expression->base.type;
7484 type_t *const true_type = skip_typeref(orig_true_type);
7485 type_t *const false_type = skip_typeref(orig_false_type);
7488 source_position_t const *const pos = &conditional->base.source_position;
7489 type_t *result_type;
7490 if (is_type_void(true_type) || is_type_void(false_type)) {
7491 /* ISO/IEC 14882:1998(E) §5.16:2 */
7492 if (true_expression->kind == EXPR_UNARY_THROW) {
7493 result_type = false_type;
7494 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7495 result_type = true_type;
7497 if (!is_type_void(true_type) || !is_type_void(false_type)) {
7498 warningf(WARN_OTHER, pos, "ISO C forbids conditional expression with only one void side");
7500 result_type = type_void;
7502 } else if (is_type_arithmetic(true_type)
7503 && is_type_arithmetic(false_type)) {
7504 result_type = semantic_arithmetic(true_type, false_type);
7505 } else if (same_compound_type(true_type, false_type)) {
7506 /* just take 1 of the 2 types */
7507 result_type = true_type;
7508 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7509 type_t *pointer_type;
7511 expression_t *other_expression;
7512 if (is_type_pointer(true_type) &&
7513 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7514 pointer_type = true_type;
7515 other_type = false_type;
7516 other_expression = false_expression;
7518 pointer_type = false_type;
7519 other_type = true_type;
7520 other_expression = true_expression;
7523 if (is_null_pointer_constant(other_expression)) {
7524 result_type = pointer_type;
7525 } else if (is_type_pointer(other_type)) {
7526 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7527 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7530 if (is_type_void(to1) || is_type_void(to2)) {
7532 } else if (types_compatible(get_unqualified_type(to1),
7533 get_unqualified_type(to2))) {
7536 warningf(WARN_OTHER, pos, "pointer types '%T' and '%T' in conditional expression are incompatible", true_type, false_type);
7540 type_t *const type =
7541 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7542 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7543 } else if (is_type_integer(other_type)) {
7544 warningf(WARN_OTHER, pos, "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7545 result_type = pointer_type;
7547 goto types_incompatible;
7551 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7552 type_error_incompatible("while parsing conditional", pos, true_type, false_type);
7554 result_type = type_error_type;
7557 conditional->true_expression
7558 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7559 conditional->false_expression
7560 = create_implicit_cast(false_expression, result_type);
7561 conditional->base.type = result_type;
7566 * Parse an extension expression.
7568 static expression_t *parse_extension(void)
7571 expression_t *expression = parse_subexpression(PREC_UNARY);
7577 * Parse a __builtin_classify_type() expression.
7579 static expression_t *parse_builtin_classify_type(void)
7581 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7582 result->base.type = type_int;
7584 eat(T___builtin_classify_type);
7586 expect('(', end_error);
7587 add_anchor_token(')');
7588 expression_t *expression = parse_expression();
7589 rem_anchor_token(')');
7590 expect(')', end_error);
7591 result->classify_type.type_expression = expression;
7595 return create_error_expression();
7599 * Parse a delete expression
7600 * ISO/IEC 14882:1998(E) §5.3.5
7602 static expression_t *parse_delete(void)
7604 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7605 result->base.type = type_void;
7610 result->kind = EXPR_UNARY_DELETE_ARRAY;
7611 expect(']', end_error);
7615 expression_t *const value = parse_subexpression(PREC_CAST);
7616 result->unary.value = value;
7618 type_t *const type = skip_typeref(value->base.type);
7619 if (!is_type_pointer(type)) {
7620 if (is_type_valid(type)) {
7621 errorf(&value->base.source_position,
7622 "operand of delete must have pointer type");
7624 } else if (is_type_void(skip_typeref(type->pointer.points_to))) {
7625 source_position_t const *const pos = &value->base.source_position;
7626 warningf(WARN_OTHER, pos, "deleting 'void*' is undefined");
7633 * Parse a throw expression
7634 * ISO/IEC 14882:1998(E) §15:1
7636 static expression_t *parse_throw(void)
7638 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7639 result->base.type = type_void;
7643 expression_t *value = NULL;
7644 switch (token.kind) {
7646 value = parse_assignment_expression();
7647 /* ISO/IEC 14882:1998(E) §15.1:3 */
7648 type_t *const orig_type = value->base.type;
7649 type_t *const type = skip_typeref(orig_type);
7650 if (is_type_incomplete(type)) {
7651 errorf(&value->base.source_position,
7652 "cannot throw object of incomplete type '%T'", orig_type);
7653 } else if (is_type_pointer(type)) {
7654 type_t *const points_to = skip_typeref(type->pointer.points_to);
7655 if (is_type_incomplete(points_to) && !is_type_void(points_to)) {
7656 errorf(&value->base.source_position,
7657 "cannot throw pointer to incomplete type '%T'", orig_type);
7665 result->unary.value = value;
7670 static bool check_pointer_arithmetic(const source_position_t *source_position,
7671 type_t *pointer_type,
7672 type_t *orig_pointer_type)
7674 type_t *points_to = pointer_type->pointer.points_to;
7675 points_to = skip_typeref(points_to);
7677 if (is_type_incomplete(points_to)) {
7678 if (!GNU_MODE || !is_type_void(points_to)) {
7679 errorf(source_position,
7680 "arithmetic with pointer to incomplete type '%T' not allowed",
7684 warningf(WARN_POINTER_ARITH, source_position, "pointer of type '%T' used in arithmetic", orig_pointer_type);
7686 } else if (is_type_function(points_to)) {
7688 errorf(source_position,
7689 "arithmetic with pointer to function type '%T' not allowed",
7693 warningf(WARN_POINTER_ARITH, source_position, "pointer to a function '%T' used in arithmetic", orig_pointer_type);
7699 static bool is_lvalue(const expression_t *expression)
7701 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
7702 switch (expression->kind) {
7703 case EXPR_ARRAY_ACCESS:
7704 case EXPR_COMPOUND_LITERAL:
7705 case EXPR_REFERENCE:
7707 case EXPR_UNARY_DEREFERENCE:
7711 type_t *type = skip_typeref(expression->base.type);
7713 /* ISO/IEC 14882:1998(E) §3.10:3 */
7714 is_type_reference(type) ||
7715 /* Claim it is an lvalue, if the type is invalid. There was a parse
7716 * error before, which maybe prevented properly recognizing it as
7718 !is_type_valid(type);
7723 static void semantic_incdec(unary_expression_t *expression)
7725 type_t *const orig_type = expression->value->base.type;
7726 type_t *const type = skip_typeref(orig_type);
7727 if (is_type_pointer(type)) {
7728 if (!check_pointer_arithmetic(&expression->base.source_position,
7732 } else if (!is_type_real(type) && is_type_valid(type)) {
7733 /* TODO: improve error message */
7734 errorf(&expression->base.source_position,
7735 "operation needs an arithmetic or pointer type");
7738 if (!is_lvalue(expression->value)) {
7739 /* TODO: improve error message */
7740 errorf(&expression->base.source_position, "lvalue required as operand");
7742 expression->base.type = orig_type;
7745 static void promote_unary_int_expr(unary_expression_t *const expr, type_t *const type)
7747 type_t *const res_type = promote_integer(type);
7748 expr->base.type = res_type;
7749 expr->value = create_implicit_cast(expr->value, res_type);
7752 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
7754 type_t *const orig_type = expression->value->base.type;
7755 type_t *const type = skip_typeref(orig_type);
7756 if (!is_type_arithmetic(type)) {
7757 if (is_type_valid(type)) {
7758 /* TODO: improve error message */
7759 errorf(&expression->base.source_position,
7760 "operation needs an arithmetic type");
7763 } else if (is_type_integer(type)) {
7764 promote_unary_int_expr(expression, type);
7766 expression->base.type = orig_type;
7770 static void semantic_unexpr_plus(unary_expression_t *expression)
7772 semantic_unexpr_arithmetic(expression);
7773 source_position_t const *const pos = &expression->base.source_position;
7774 warningf(WARN_TRADITIONAL, pos, "traditional C rejects the unary plus operator");
7777 static void semantic_not(unary_expression_t *expression)
7779 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
7780 semantic_condition(expression->value, "operand of !");
7781 expression->base.type = c_mode & _CXX ? type_bool : type_int;
7784 static void semantic_unexpr_integer(unary_expression_t *expression)
7786 type_t *const orig_type = expression->value->base.type;
7787 type_t *const type = skip_typeref(orig_type);
7788 if (!is_type_integer(type)) {
7789 if (is_type_valid(type)) {
7790 errorf(&expression->base.source_position,
7791 "operand of ~ must be of integer type");
7796 promote_unary_int_expr(expression, type);
7799 static void semantic_dereference(unary_expression_t *expression)
7801 type_t *const orig_type = expression->value->base.type;
7802 type_t *const type = skip_typeref(orig_type);
7803 if (!is_type_pointer(type)) {
7804 if (is_type_valid(type)) {
7805 errorf(&expression->base.source_position,
7806 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
7811 type_t *result_type = type->pointer.points_to;
7812 result_type = automatic_type_conversion(result_type);
7813 expression->base.type = result_type;
7817 * Record that an address is taken (expression represents an lvalue).
7819 * @param expression the expression
7820 * @param may_be_register if true, the expression might be an register
7822 static void set_address_taken(expression_t *expression, bool may_be_register)
7824 if (expression->kind != EXPR_REFERENCE)
7827 entity_t *const entity = expression->reference.entity;
7829 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
7832 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
7833 && !may_be_register) {
7834 source_position_t const *const pos = &expression->base.source_position;
7835 errorf(pos, "address of register '%N' requested", entity);
7838 if (entity->kind == ENTITY_VARIABLE) {
7839 entity->variable.address_taken = true;
7841 assert(entity->kind == ENTITY_PARAMETER);
7842 entity->parameter.address_taken = true;
7847 * Check the semantic of the address taken expression.
7849 static void semantic_take_addr(unary_expression_t *expression)
7851 expression_t *value = expression->value;
7852 value->base.type = revert_automatic_type_conversion(value);
7854 type_t *orig_type = value->base.type;
7855 type_t *type = skip_typeref(orig_type);
7856 if (!is_type_valid(type))
7860 if (!is_lvalue(value)) {
7861 errorf(&expression->base.source_position, "'&' requires an lvalue");
7863 if (is_bitfield(value)) {
7864 errorf(&expression->base.source_position,
7865 "'&' not allowed on bitfield");
7868 set_address_taken(value, false);
7870 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
7873 #define CREATE_UNARY_EXPRESSION_PARSER(token_kind, unexpression_type, sfunc) \
7874 static expression_t *parse_##unexpression_type(void) \
7876 expression_t *unary_expression \
7877 = allocate_expression_zero(unexpression_type); \
7879 unary_expression->unary.value = parse_subexpression(PREC_UNARY); \
7881 sfunc(&unary_expression->unary); \
7883 return unary_expression; \
7886 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
7887 semantic_unexpr_arithmetic)
7888 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
7889 semantic_unexpr_plus)
7890 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
7892 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
7893 semantic_dereference)
7894 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
7896 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
7897 semantic_unexpr_integer)
7898 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
7900 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
7903 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_kind, unexpression_type, \
7905 static expression_t *parse_##unexpression_type(expression_t *left) \
7907 expression_t *unary_expression \
7908 = allocate_expression_zero(unexpression_type); \
7910 unary_expression->unary.value = left; \
7912 sfunc(&unary_expression->unary); \
7914 return unary_expression; \
7917 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
7918 EXPR_UNARY_POSTFIX_INCREMENT,
7920 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
7921 EXPR_UNARY_POSTFIX_DECREMENT,
7924 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
7926 /* TODO: handle complex + imaginary types */
7928 type_left = get_unqualified_type(type_left);
7929 type_right = get_unqualified_type(type_right);
7931 /* §6.3.1.8 Usual arithmetic conversions */
7932 if (type_left == type_long_double || type_right == type_long_double) {
7933 return type_long_double;
7934 } else if (type_left == type_double || type_right == type_double) {
7936 } else if (type_left == type_float || type_right == type_float) {
7940 type_left = promote_integer(type_left);
7941 type_right = promote_integer(type_right);
7943 if (type_left == type_right)
7946 bool const signed_left = is_type_signed(type_left);
7947 bool const signed_right = is_type_signed(type_right);
7948 unsigned const rank_left = get_akind_rank(get_akind(type_left));
7949 unsigned const rank_right = get_akind_rank(get_akind(type_right));
7951 if (signed_left == signed_right)
7952 return rank_left >= rank_right ? type_left : type_right;
7956 atomic_type_kind_t s_akind;
7957 atomic_type_kind_t u_akind;
7962 u_type = type_right;
7964 s_type = type_right;
7967 s_akind = get_akind(s_type);
7968 u_akind = get_akind(u_type);
7969 s_rank = get_akind_rank(s_akind);
7970 u_rank = get_akind_rank(u_akind);
7972 if (u_rank >= s_rank)
7975 if (get_atomic_type_size(s_akind) > get_atomic_type_size(u_akind))
7979 case ATOMIC_TYPE_INT: return type_unsigned_int;
7980 case ATOMIC_TYPE_LONG: return type_unsigned_long;
7981 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
7983 default: panic("invalid atomic type");
7988 * Check the semantic restrictions for a binary expression.
7990 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
7992 expression_t *const left = expression->left;
7993 expression_t *const right = expression->right;
7994 type_t *const orig_type_left = left->base.type;
7995 type_t *const orig_type_right = right->base.type;
7996 type_t *const type_left = skip_typeref(orig_type_left);
7997 type_t *const type_right = skip_typeref(orig_type_right);
7999 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8000 /* TODO: improve error message */
8001 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8002 errorf(&expression->base.source_position,
8003 "operation needs arithmetic types");
8008 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8009 expression->left = create_implicit_cast(left, arithmetic_type);
8010 expression->right = create_implicit_cast(right, arithmetic_type);
8011 expression->base.type = arithmetic_type;
8014 static void semantic_binexpr_integer(binary_expression_t *const expression)
8016 expression_t *const left = expression->left;
8017 expression_t *const right = expression->right;
8018 type_t *const orig_type_left = left->base.type;
8019 type_t *const orig_type_right = right->base.type;
8020 type_t *const type_left = skip_typeref(orig_type_left);
8021 type_t *const type_right = skip_typeref(orig_type_right);
8023 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8024 /* TODO: improve error message */
8025 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8026 errorf(&expression->base.source_position,
8027 "operation needs integer types");
8032 type_t *const result_type = semantic_arithmetic(type_left, type_right);
8033 expression->left = create_implicit_cast(left, result_type);
8034 expression->right = create_implicit_cast(right, result_type);
8035 expression->base.type = result_type;
8038 static void warn_div_by_zero(binary_expression_t const *const expression)
8040 if (!is_type_integer(expression->base.type))
8043 expression_t const *const right = expression->right;
8044 /* The type of the right operand can be different for /= */
8045 if (is_type_integer(right->base.type) &&
8046 is_constant_expression(right) == EXPR_CLASS_CONSTANT &&
8047 !fold_constant_to_bool(right)) {
8048 source_position_t const *const pos = &expression->base.source_position;
8049 warningf(WARN_DIV_BY_ZERO, pos, "division by zero");
8054 * Check the semantic restrictions for a div/mod expression.
8056 static void semantic_divmod_arithmetic(binary_expression_t *expression)
8058 semantic_binexpr_arithmetic(expression);
8059 warn_div_by_zero(expression);
8062 static void warn_addsub_in_shift(const expression_t *const expr)
8064 if (expr->base.parenthesized)
8068 switch (expr->kind) {
8069 case EXPR_BINARY_ADD: op = '+'; break;
8070 case EXPR_BINARY_SUB: op = '-'; break;
8074 source_position_t const *const pos = &expr->base.source_position;
8075 warningf(WARN_PARENTHESES, pos, "suggest parentheses around '%c' inside shift", op);
8078 static bool semantic_shift(binary_expression_t *expression)
8080 expression_t *const left = expression->left;
8081 expression_t *const right = expression->right;
8082 type_t *const orig_type_left = left->base.type;
8083 type_t *const orig_type_right = right->base.type;
8084 type_t * type_left = skip_typeref(orig_type_left);
8085 type_t * type_right = skip_typeref(orig_type_right);
8087 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8088 /* TODO: improve error message */
8089 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8090 errorf(&expression->base.source_position,
8091 "operands of shift operation must have integer types");
8096 type_left = promote_integer(type_left);
8098 if (is_constant_expression(right) == EXPR_CLASS_CONSTANT) {
8099 source_position_t const *const pos = &right->base.source_position;
8100 long const count = fold_constant_to_int(right);
8102 warningf(WARN_OTHER, pos, "shift count must be non-negative");
8103 } else if ((unsigned long)count >=
8104 get_atomic_type_size(type_left->atomic.akind) * 8) {
8105 warningf(WARN_OTHER, pos, "shift count must be less than type width");
8109 type_right = promote_integer(type_right);
8110 expression->right = create_implicit_cast(right, type_right);
8115 static void semantic_shift_op(binary_expression_t *expression)
8117 expression_t *const left = expression->left;
8118 expression_t *const right = expression->right;
8120 if (!semantic_shift(expression))
8123 warn_addsub_in_shift(left);
8124 warn_addsub_in_shift(right);
8126 type_t *const orig_type_left = left->base.type;
8127 type_t * type_left = skip_typeref(orig_type_left);
8129 type_left = promote_integer(type_left);
8130 expression->left = create_implicit_cast(left, type_left);
8131 expression->base.type = type_left;
8134 static void semantic_add(binary_expression_t *expression)
8136 expression_t *const left = expression->left;
8137 expression_t *const right = expression->right;
8138 type_t *const orig_type_left = left->base.type;
8139 type_t *const orig_type_right = right->base.type;
8140 type_t *const type_left = skip_typeref(orig_type_left);
8141 type_t *const type_right = skip_typeref(orig_type_right);
8144 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8145 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8146 expression->left = create_implicit_cast(left, arithmetic_type);
8147 expression->right = create_implicit_cast(right, arithmetic_type);
8148 expression->base.type = arithmetic_type;
8149 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8150 check_pointer_arithmetic(&expression->base.source_position,
8151 type_left, orig_type_left);
8152 expression->base.type = type_left;
8153 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8154 check_pointer_arithmetic(&expression->base.source_position,
8155 type_right, orig_type_right);
8156 expression->base.type = type_right;
8157 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8158 errorf(&expression->base.source_position,
8159 "invalid operands to binary + ('%T', '%T')",
8160 orig_type_left, orig_type_right);
8164 static void semantic_sub(binary_expression_t *expression)
8166 expression_t *const left = expression->left;
8167 expression_t *const right = expression->right;
8168 type_t *const orig_type_left = left->base.type;
8169 type_t *const orig_type_right = right->base.type;
8170 type_t *const type_left = skip_typeref(orig_type_left);
8171 type_t *const type_right = skip_typeref(orig_type_right);
8172 source_position_t const *const pos = &expression->base.source_position;
8175 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8176 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8177 expression->left = create_implicit_cast(left, arithmetic_type);
8178 expression->right = create_implicit_cast(right, arithmetic_type);
8179 expression->base.type = arithmetic_type;
8180 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8181 check_pointer_arithmetic(&expression->base.source_position,
8182 type_left, orig_type_left);
8183 expression->base.type = type_left;
8184 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8185 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
8186 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
8187 if (!types_compatible(unqual_left, unqual_right)) {
8189 "subtracting pointers to incompatible types '%T' and '%T'",
8190 orig_type_left, orig_type_right);
8191 } else if (!is_type_object(unqual_left)) {
8192 if (!is_type_void(unqual_left)) {
8193 errorf(pos, "subtracting pointers to non-object types '%T'",
8196 warningf(WARN_OTHER, pos, "subtracting pointers to void");
8199 expression->base.type = type_ptrdiff_t;
8200 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8201 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8202 orig_type_left, orig_type_right);
8206 static void warn_string_literal_address(expression_t const* expr)
8208 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8209 expr = expr->unary.value;
8210 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8212 expr = expr->unary.value;
8215 if (expr->kind == EXPR_STRING_LITERAL
8216 || expr->kind == EXPR_WIDE_STRING_LITERAL) {
8217 source_position_t const *const pos = &expr->base.source_position;
8218 warningf(WARN_ADDRESS, pos, "comparison with string literal results in unspecified behaviour");
8222 static bool maybe_negative(expression_t const *const expr)
8224 switch (is_constant_expression(expr)) {
8225 case EXPR_CLASS_ERROR: return false;
8226 case EXPR_CLASS_CONSTANT: return constant_is_negative(expr);
8227 default: return true;
8231 static void warn_comparison(source_position_t const *const pos, expression_t const *const expr, expression_t const *const other)
8233 warn_string_literal_address(expr);
8235 expression_t const* const ref = get_reference_address(expr);
8236 if (ref != NULL && is_null_pointer_constant(other)) {
8237 entity_t const *const ent = ref->reference.entity;
8238 warningf(WARN_ADDRESS, pos, "the address of '%N' will never be NULL", ent);
8241 if (!expr->base.parenthesized) {
8242 switch (expr->base.kind) {
8243 case EXPR_BINARY_LESS:
8244 case EXPR_BINARY_GREATER:
8245 case EXPR_BINARY_LESSEQUAL:
8246 case EXPR_BINARY_GREATEREQUAL:
8247 case EXPR_BINARY_NOTEQUAL:
8248 case EXPR_BINARY_EQUAL:
8249 warningf(WARN_PARENTHESES, pos, "comparisons like 'x <= y < z' do not have their mathematical meaning");
8258 * Check the semantics of comparison expressions.
8260 * @param expression The expression to check.
8262 static void semantic_comparison(binary_expression_t *expression)
8264 source_position_t const *const pos = &expression->base.source_position;
8265 expression_t *const left = expression->left;
8266 expression_t *const right = expression->right;
8268 warn_comparison(pos, left, right);
8269 warn_comparison(pos, right, left);
8271 type_t *orig_type_left = left->base.type;
8272 type_t *orig_type_right = right->base.type;
8273 type_t *type_left = skip_typeref(orig_type_left);
8274 type_t *type_right = skip_typeref(orig_type_right);
8276 /* TODO non-arithmetic types */
8277 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8278 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8280 /* test for signed vs unsigned compares */
8281 if (is_type_integer(arithmetic_type)) {
8282 bool const signed_left = is_type_signed(type_left);
8283 bool const signed_right = is_type_signed(type_right);
8284 if (signed_left != signed_right) {
8285 /* FIXME long long needs better const folding magic */
8286 /* TODO check whether constant value can be represented by other type */
8287 if ((signed_left && maybe_negative(left)) ||
8288 (signed_right && maybe_negative(right))) {
8289 warningf(WARN_SIGN_COMPARE, pos, "comparison between signed and unsigned");
8294 expression->left = create_implicit_cast(left, arithmetic_type);
8295 expression->right = create_implicit_cast(right, arithmetic_type);
8296 expression->base.type = arithmetic_type;
8297 if ((expression->base.kind == EXPR_BINARY_EQUAL ||
8298 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8299 is_type_float(arithmetic_type)) {
8300 warningf(WARN_FLOAT_EQUAL, pos, "comparing floating point with == or != is unsafe");
8302 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8303 /* TODO check compatibility */
8304 } else if (is_type_pointer(type_left)) {
8305 expression->right = create_implicit_cast(right, type_left);
8306 } else if (is_type_pointer(type_right)) {
8307 expression->left = create_implicit_cast(left, type_right);
8308 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8309 type_error_incompatible("invalid operands in comparison", pos, type_left, type_right);
8311 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8315 * Checks if a compound type has constant fields.
8317 static bool has_const_fields(const compound_type_t *type)
8319 compound_t *compound = type->compound;
8320 entity_t *entry = compound->members.entities;
8322 for (; entry != NULL; entry = entry->base.next) {
8323 if (!is_declaration(entry))
8326 const type_t *decl_type = skip_typeref(entry->declaration.type);
8327 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8334 static bool is_valid_assignment_lhs(expression_t const* const left)
8336 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8337 type_t *const type_left = skip_typeref(orig_type_left);
8339 if (!is_lvalue(left)) {
8340 errorf(&left->base.source_position, "left hand side '%E' of assignment is not an lvalue",
8345 if (left->kind == EXPR_REFERENCE
8346 && left->reference.entity->kind == ENTITY_FUNCTION) {
8347 errorf(&left->base.source_position, "cannot assign to function '%E'", left);
8351 if (is_type_array(type_left)) {
8352 errorf(&left->base.source_position, "cannot assign to array '%E'", left);
8355 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8356 errorf(&left->base.source_position, "assignment to read-only location '%E' (type '%T')", left,
8360 if (is_type_incomplete(type_left)) {
8361 errorf(&left->base.source_position, "left-hand side '%E' of assignment has incomplete type '%T'",
8362 left, orig_type_left);
8365 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8366 errorf(&left->base.source_position, "cannot assign to '%E' because compound type '%T' has read-only fields",
8367 left, orig_type_left);
8374 static void semantic_arithmetic_assign(binary_expression_t *expression)
8376 expression_t *left = expression->left;
8377 expression_t *right = expression->right;
8378 type_t *orig_type_left = left->base.type;
8379 type_t *orig_type_right = right->base.type;
8381 if (!is_valid_assignment_lhs(left))
8384 type_t *type_left = skip_typeref(orig_type_left);
8385 type_t *type_right = skip_typeref(orig_type_right);
8387 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8388 /* TODO: improve error message */
8389 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8390 errorf(&expression->base.source_position,
8391 "operation needs arithmetic types");
8396 /* combined instructions are tricky. We can't create an implicit cast on
8397 * the left side, because we need the uncasted form for the store.
8398 * The ast2firm pass has to know that left_type must be right_type
8399 * for the arithmetic operation and create a cast by itself */
8400 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8401 expression->right = create_implicit_cast(right, arithmetic_type);
8402 expression->base.type = type_left;
8405 static void semantic_divmod_assign(binary_expression_t *expression)
8407 semantic_arithmetic_assign(expression);
8408 warn_div_by_zero(expression);
8411 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8413 expression_t *const left = expression->left;
8414 expression_t *const right = expression->right;
8415 type_t *const orig_type_left = left->base.type;
8416 type_t *const orig_type_right = right->base.type;
8417 type_t *const type_left = skip_typeref(orig_type_left);
8418 type_t *const type_right = skip_typeref(orig_type_right);
8420 if (!is_valid_assignment_lhs(left))
8423 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8424 /* combined instructions are tricky. We can't create an implicit cast on
8425 * the left side, because we need the uncasted form for the store.
8426 * The ast2firm pass has to know that left_type must be right_type
8427 * for the arithmetic operation and create a cast by itself */
8428 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8429 expression->right = create_implicit_cast(right, arithmetic_type);
8430 expression->base.type = type_left;
8431 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8432 check_pointer_arithmetic(&expression->base.source_position,
8433 type_left, orig_type_left);
8434 expression->base.type = type_left;
8435 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8436 errorf(&expression->base.source_position,
8437 "incompatible types '%T' and '%T' in assignment",
8438 orig_type_left, orig_type_right);
8442 static void semantic_integer_assign(binary_expression_t *expression)
8444 expression_t *left = expression->left;
8445 expression_t *right = expression->right;
8446 type_t *orig_type_left = left->base.type;
8447 type_t *orig_type_right = right->base.type;
8449 if (!is_valid_assignment_lhs(left))
8452 type_t *type_left = skip_typeref(orig_type_left);
8453 type_t *type_right = skip_typeref(orig_type_right);
8455 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8456 /* TODO: improve error message */
8457 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8458 errorf(&expression->base.source_position,
8459 "operation needs integer types");
8464 /* combined instructions are tricky. We can't create an implicit cast on
8465 * the left side, because we need the uncasted form for the store.
8466 * The ast2firm pass has to know that left_type must be right_type
8467 * for the arithmetic operation and create a cast by itself */
8468 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8469 expression->right = create_implicit_cast(right, arithmetic_type);
8470 expression->base.type = type_left;
8473 static void semantic_shift_assign(binary_expression_t *expression)
8475 expression_t *left = expression->left;
8477 if (!is_valid_assignment_lhs(left))
8480 if (!semantic_shift(expression))
8483 expression->base.type = skip_typeref(left->base.type);
8486 static void warn_logical_and_within_or(const expression_t *const expr)
8488 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8490 if (expr->base.parenthesized)
8492 source_position_t const *const pos = &expr->base.source_position;
8493 warningf(WARN_PARENTHESES, pos, "suggest parentheses around && within ||");
8497 * Check the semantic restrictions of a logical expression.
8499 static void semantic_logical_op(binary_expression_t *expression)
8501 /* §6.5.13:2 Each of the operands shall have scalar type.
8502 * §6.5.14:2 Each of the operands shall have scalar type. */
8503 semantic_condition(expression->left, "left operand of logical operator");
8504 semantic_condition(expression->right, "right operand of logical operator");
8505 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR) {
8506 warn_logical_and_within_or(expression->left);
8507 warn_logical_and_within_or(expression->right);
8509 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8513 * Check the semantic restrictions of a binary assign expression.
8515 static void semantic_binexpr_assign(binary_expression_t *expression)
8517 expression_t *left = expression->left;
8518 type_t *orig_type_left = left->base.type;
8520 if (!is_valid_assignment_lhs(left))
8523 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8524 report_assign_error(error, orig_type_left, expression->right,
8525 "assignment", &left->base.source_position);
8526 expression->right = create_implicit_cast(expression->right, orig_type_left);
8527 expression->base.type = orig_type_left;
8531 * Determine if the outermost operation (or parts thereof) of the given
8532 * expression has no effect in order to generate a warning about this fact.
8533 * Therefore in some cases this only examines some of the operands of the
8534 * expression (see comments in the function and examples below).
8536 * f() + 23; // warning, because + has no effect
8537 * x || f(); // no warning, because x controls execution of f()
8538 * x ? y : f(); // warning, because y has no effect
8539 * (void)x; // no warning to be able to suppress the warning
8540 * This function can NOT be used for an "expression has definitely no effect"-
8542 static bool expression_has_effect(const expression_t *const expr)
8544 switch (expr->kind) {
8545 case EXPR_ERROR: return true; /* do NOT warn */
8546 case EXPR_REFERENCE: return false;
8547 case EXPR_ENUM_CONSTANT: return false;
8548 case EXPR_LABEL_ADDRESS: return false;
8550 /* suppress the warning for microsoft __noop operations */
8551 case EXPR_LITERAL_MS_NOOP: return true;
8552 case EXPR_LITERAL_BOOLEAN:
8553 case EXPR_LITERAL_CHARACTER:
8554 case EXPR_LITERAL_WIDE_CHARACTER:
8555 case EXPR_LITERAL_INTEGER:
8556 case EXPR_LITERAL_INTEGER_OCTAL:
8557 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
8558 case EXPR_LITERAL_FLOATINGPOINT:
8559 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: return false;
8560 case EXPR_STRING_LITERAL: return false;
8561 case EXPR_WIDE_STRING_LITERAL: return false;
8564 const call_expression_t *const call = &expr->call;
8565 if (call->function->kind != EXPR_REFERENCE)
8568 switch (call->function->reference.entity->function.btk) {
8569 /* FIXME: which builtins have no effect? */
8570 default: return true;
8574 /* Generate the warning if either the left or right hand side of a
8575 * conditional expression has no effect */
8576 case EXPR_CONDITIONAL: {
8577 conditional_expression_t const *const cond = &expr->conditional;
8578 expression_t const *const t = cond->true_expression;
8580 (t == NULL || expression_has_effect(t)) &&
8581 expression_has_effect(cond->false_expression);
8584 case EXPR_SELECT: return false;
8585 case EXPR_ARRAY_ACCESS: return false;
8586 case EXPR_SIZEOF: return false;
8587 case EXPR_CLASSIFY_TYPE: return false;
8588 case EXPR_ALIGNOF: return false;
8590 case EXPR_FUNCNAME: return false;
8591 case EXPR_BUILTIN_CONSTANT_P: return false;
8592 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8593 case EXPR_OFFSETOF: return false;
8594 case EXPR_VA_START: return true;
8595 case EXPR_VA_ARG: return true;
8596 case EXPR_VA_COPY: return true;
8597 case EXPR_STATEMENT: return true; // TODO
8598 case EXPR_COMPOUND_LITERAL: return false;
8600 case EXPR_UNARY_NEGATE: return false;
8601 case EXPR_UNARY_PLUS: return false;
8602 case EXPR_UNARY_BITWISE_NEGATE: return false;
8603 case EXPR_UNARY_NOT: return false;
8604 case EXPR_UNARY_DEREFERENCE: return false;
8605 case EXPR_UNARY_TAKE_ADDRESS: return false;
8606 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8607 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8608 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8609 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8611 /* Treat void casts as if they have an effect in order to being able to
8612 * suppress the warning */
8613 case EXPR_UNARY_CAST: {
8614 type_t *const type = skip_typeref(expr->base.type);
8615 return is_type_void(type);
8618 case EXPR_UNARY_ASSUME: return true;
8619 case EXPR_UNARY_DELETE: return true;
8620 case EXPR_UNARY_DELETE_ARRAY: return true;
8621 case EXPR_UNARY_THROW: return true;
8623 case EXPR_BINARY_ADD: return false;
8624 case EXPR_BINARY_SUB: return false;
8625 case EXPR_BINARY_MUL: return false;
8626 case EXPR_BINARY_DIV: return false;
8627 case EXPR_BINARY_MOD: return false;
8628 case EXPR_BINARY_EQUAL: return false;
8629 case EXPR_BINARY_NOTEQUAL: return false;
8630 case EXPR_BINARY_LESS: return false;
8631 case EXPR_BINARY_LESSEQUAL: return false;
8632 case EXPR_BINARY_GREATER: return false;
8633 case EXPR_BINARY_GREATEREQUAL: return false;
8634 case EXPR_BINARY_BITWISE_AND: return false;
8635 case EXPR_BINARY_BITWISE_OR: return false;
8636 case EXPR_BINARY_BITWISE_XOR: return false;
8637 case EXPR_BINARY_SHIFTLEFT: return false;
8638 case EXPR_BINARY_SHIFTRIGHT: return false;
8639 case EXPR_BINARY_ASSIGN: return true;
8640 case EXPR_BINARY_MUL_ASSIGN: return true;
8641 case EXPR_BINARY_DIV_ASSIGN: return true;
8642 case EXPR_BINARY_MOD_ASSIGN: return true;
8643 case EXPR_BINARY_ADD_ASSIGN: return true;
8644 case EXPR_BINARY_SUB_ASSIGN: return true;
8645 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8646 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8647 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8648 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8649 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8651 /* Only examine the right hand side of && and ||, because the left hand
8652 * side already has the effect of controlling the execution of the right
8654 case EXPR_BINARY_LOGICAL_AND:
8655 case EXPR_BINARY_LOGICAL_OR:
8656 /* Only examine the right hand side of a comma expression, because the left
8657 * hand side has a separate warning */
8658 case EXPR_BINARY_COMMA:
8659 return expression_has_effect(expr->binary.right);
8661 case EXPR_BINARY_ISGREATER: return false;
8662 case EXPR_BINARY_ISGREATEREQUAL: return false;
8663 case EXPR_BINARY_ISLESS: return false;
8664 case EXPR_BINARY_ISLESSEQUAL: return false;
8665 case EXPR_BINARY_ISLESSGREATER: return false;
8666 case EXPR_BINARY_ISUNORDERED: return false;
8669 internal_errorf(HERE, "unexpected expression");
8672 static void semantic_comma(binary_expression_t *expression)
8674 const expression_t *const left = expression->left;
8675 if (!expression_has_effect(left)) {
8676 source_position_t const *const pos = &left->base.source_position;
8677 warningf(WARN_UNUSED_VALUE, pos, "left-hand operand of comma expression has no effect");
8679 expression->base.type = expression->right->base.type;
8683 * @param prec_r precedence of the right operand
8685 #define CREATE_BINEXPR_PARSER(token_kind, binexpression_type, prec_r, sfunc) \
8686 static expression_t *parse_##binexpression_type(expression_t *left) \
8688 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8689 binexpr->binary.left = left; \
8692 expression_t *right = parse_subexpression(prec_r); \
8694 binexpr->binary.right = right; \
8695 sfunc(&binexpr->binary); \
8700 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8701 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
8702 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
8703 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8704 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8705 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8706 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8707 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
8708 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
8709 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
8710 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
8711 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
8712 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
8713 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_integer)
8714 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_integer)
8715 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_integer)
8716 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8717 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8718 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
8719 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8720 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8721 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8722 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8723 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8724 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8725 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8726 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8727 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8728 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8729 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
8732 static expression_t *parse_subexpression(precedence_t precedence)
8734 if (token.kind < 0) {
8735 return expected_expression_error();
8738 expression_parser_function_t *parser
8739 = &expression_parsers[token.kind];
8742 if (parser->parser != NULL) {
8743 left = parser->parser();
8745 left = parse_primary_expression();
8747 assert(left != NULL);
8750 if (token.kind < 0) {
8751 return expected_expression_error();
8754 parser = &expression_parsers[token.kind];
8755 if (parser->infix_parser == NULL)
8757 if (parser->infix_precedence < precedence)
8760 left = parser->infix_parser(left);
8762 assert(left != NULL);
8769 * Parse an expression.
8771 static expression_t *parse_expression(void)
8773 return parse_subexpression(PREC_EXPRESSION);
8777 * Register a parser for a prefix-like operator.
8779 * @param parser the parser function
8780 * @param token_kind the token type of the prefix token
8782 static void register_expression_parser(parse_expression_function parser,
8785 expression_parser_function_t *entry = &expression_parsers[token_kind];
8787 if (entry->parser != NULL) {
8788 diagnosticf("for token '%k'\n", (token_kind_t)token_kind);
8789 panic("trying to register multiple expression parsers for a token");
8791 entry->parser = parser;
8795 * Register a parser for an infix operator with given precedence.
8797 * @param parser the parser function
8798 * @param token_kind the token type of the infix operator
8799 * @param precedence the precedence of the operator
8801 static void register_infix_parser(parse_expression_infix_function parser,
8802 int token_kind, precedence_t precedence)
8804 expression_parser_function_t *entry = &expression_parsers[token_kind];
8806 if (entry->infix_parser != NULL) {
8807 diagnosticf("for token '%k'\n", (token_kind_t)token_kind);
8808 panic("trying to register multiple infix expression parsers for a "
8811 entry->infix_parser = parser;
8812 entry->infix_precedence = precedence;
8816 * Initialize the expression parsers.
8818 static void init_expression_parsers(void)
8820 memset(&expression_parsers, 0, sizeof(expression_parsers));
8822 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
8823 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
8824 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
8825 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
8826 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
8827 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
8828 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
8829 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
8830 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
8831 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
8832 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
8833 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
8834 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
8835 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
8836 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
8837 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
8838 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
8839 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
8840 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
8841 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
8842 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
8843 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
8844 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
8845 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
8846 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
8847 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
8848 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
8849 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
8850 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
8851 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
8852 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
8853 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
8854 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
8855 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
8856 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
8857 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
8858 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
8860 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
8861 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
8862 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
8863 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
8864 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
8865 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
8866 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
8867 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
8868 register_expression_parser(parse_sizeof, T_sizeof);
8869 register_expression_parser(parse_alignof, T___alignof__);
8870 register_expression_parser(parse_extension, T___extension__);
8871 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
8872 register_expression_parser(parse_delete, T_delete);
8873 register_expression_parser(parse_throw, T_throw);
8877 * Parse a asm statement arguments specification.
8879 static asm_argument_t *parse_asm_arguments(bool is_out)
8881 asm_argument_t *result = NULL;
8882 asm_argument_t **anchor = &result;
8884 while (token.kind == T_STRING_LITERAL || token.kind == '[') {
8885 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
8886 memset(argument, 0, sizeof(argument[0]));
8889 if (token.kind != T_IDENTIFIER) {
8890 parse_error_expected("while parsing asm argument",
8891 T_IDENTIFIER, NULL);
8894 argument->symbol = token.identifier.symbol;
8896 expect(']', end_error);
8899 argument->constraints = parse_string_literals();
8900 expect('(', end_error);
8901 add_anchor_token(')');
8902 expression_t *expression = parse_expression();
8903 rem_anchor_token(')');
8905 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
8906 * change size or type representation (e.g. int -> long is ok, but
8907 * int -> float is not) */
8908 if (expression->kind == EXPR_UNARY_CAST) {
8909 type_t *const type = expression->base.type;
8910 type_kind_t const kind = type->kind;
8911 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
8914 if (kind == TYPE_ATOMIC) {
8915 atomic_type_kind_t const akind = type->atomic.akind;
8916 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8917 size = get_atomic_type_size(akind);
8919 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8920 size = get_type_size(type_void_ptr);
8924 expression_t *const value = expression->unary.value;
8925 type_t *const value_type = value->base.type;
8926 type_kind_t const value_kind = value_type->kind;
8928 unsigned value_flags;
8929 unsigned value_size;
8930 if (value_kind == TYPE_ATOMIC) {
8931 atomic_type_kind_t const value_akind = value_type->atomic.akind;
8932 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8933 value_size = get_atomic_type_size(value_akind);
8934 } else if (value_kind == TYPE_POINTER) {
8935 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8936 value_size = get_type_size(type_void_ptr);
8941 if (value_flags != flags || value_size != size)
8945 } while (expression->kind == EXPR_UNARY_CAST);
8949 if (!is_lvalue(expression)) {
8950 errorf(&expression->base.source_position,
8951 "asm output argument is not an lvalue");
8954 if (argument->constraints.begin[0] == '=')
8955 determine_lhs_ent(expression, NULL);
8957 mark_vars_read(expression, NULL);
8959 mark_vars_read(expression, NULL);
8961 argument->expression = expression;
8962 expect(')', end_error);
8964 set_address_taken(expression, true);
8967 anchor = &argument->next;
8979 * Parse a asm statement clobber specification.
8981 static asm_clobber_t *parse_asm_clobbers(void)
8983 asm_clobber_t *result = NULL;
8984 asm_clobber_t **anchor = &result;
8986 while (token.kind == T_STRING_LITERAL) {
8987 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
8988 clobber->clobber = parse_string_literals();
8991 anchor = &clobber->next;
9001 * Parse an asm statement.
9003 static statement_t *parse_asm_statement(void)
9005 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
9006 asm_statement_t *asm_statement = &statement->asms;
9010 if (next_if(T_volatile))
9011 asm_statement->is_volatile = true;
9013 expect('(', end_error);
9014 add_anchor_token(')');
9015 if (token.kind != T_STRING_LITERAL) {
9016 parse_error_expected("after asm(", T_STRING_LITERAL, NULL);
9019 asm_statement->asm_text = parse_string_literals();
9021 add_anchor_token(':');
9022 if (!next_if(':')) {
9023 rem_anchor_token(':');
9027 asm_statement->outputs = parse_asm_arguments(true);
9028 if (!next_if(':')) {
9029 rem_anchor_token(':');
9033 asm_statement->inputs = parse_asm_arguments(false);
9034 if (!next_if(':')) {
9035 rem_anchor_token(':');
9038 rem_anchor_token(':');
9040 asm_statement->clobbers = parse_asm_clobbers();
9043 rem_anchor_token(')');
9044 expect(')', end_error);
9045 expect(';', end_error);
9047 if (asm_statement->outputs == NULL) {
9048 /* GCC: An 'asm' instruction without any output operands will be treated
9049 * identically to a volatile 'asm' instruction. */
9050 asm_statement->is_volatile = true;
9055 return create_error_statement();
9058 static statement_t *parse_label_inner_statement(statement_t const *const label, char const *const label_kind)
9060 statement_t *inner_stmt;
9061 switch (token.kind) {
9063 errorf(&label->base.source_position, "%s at end of compound statement", label_kind);
9064 inner_stmt = create_error_statement();
9068 if (label->kind == STATEMENT_LABEL) {
9069 /* Eat an empty statement here, to avoid the warning about an empty
9070 * statement after a label. label:; is commonly used to have a label
9071 * before a closing brace. */
9072 inner_stmt = create_empty_statement();
9079 inner_stmt = parse_statement();
9080 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
9081 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
9082 if (inner_stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
9083 errorf(&inner_stmt->base.source_position, "declaration after %s", label_kind);
9091 * Parse a case statement.
9093 static statement_t *parse_case_statement(void)
9095 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9096 source_position_t *const pos = &statement->base.source_position;
9100 expression_t *expression = parse_expression();
9101 type_t *expression_type = expression->base.type;
9102 type_t *skipped = skip_typeref(expression_type);
9103 if (!is_type_integer(skipped) && is_type_valid(skipped)) {
9104 errorf(pos, "case expression '%E' must have integer type but has type '%T'",
9105 expression, expression_type);
9108 type_t *type = expression_type;
9109 if (current_switch != NULL) {
9110 type_t *switch_type = current_switch->expression->base.type;
9111 if (is_type_valid(switch_type)) {
9112 expression = create_implicit_cast(expression, switch_type);
9116 statement->case_label.expression = expression;
9117 expression_classification_t const expr_class = is_constant_expression(expression);
9118 if (expr_class != EXPR_CLASS_CONSTANT) {
9119 if (expr_class != EXPR_CLASS_ERROR) {
9120 errorf(pos, "case label does not reduce to an integer constant");
9122 statement->case_label.is_bad = true;
9124 long const val = fold_constant_to_int(expression);
9125 statement->case_label.first_case = val;
9126 statement->case_label.last_case = val;
9130 if (next_if(T_DOTDOTDOT)) {
9131 expression_t *end_range = parse_expression();
9132 expression_type = expression->base.type;
9133 skipped = skip_typeref(expression_type);
9134 if (!is_type_integer(skipped) && is_type_valid(skipped)) {
9135 errorf(pos, "case expression '%E' must have integer type but has type '%T'",
9136 expression, expression_type);
9139 end_range = create_implicit_cast(end_range, type);
9140 statement->case_label.end_range = end_range;
9141 expression_classification_t const end_class = is_constant_expression(end_range);
9142 if (end_class != EXPR_CLASS_CONSTANT) {
9143 if (end_class != EXPR_CLASS_ERROR) {
9144 errorf(pos, "case range does not reduce to an integer constant");
9146 statement->case_label.is_bad = true;
9148 long const val = fold_constant_to_int(end_range);
9149 statement->case_label.last_case = val;
9151 if (val < statement->case_label.first_case) {
9152 statement->case_label.is_empty_range = true;
9153 warningf(WARN_OTHER, pos, "empty range specified");
9159 PUSH_PARENT(statement);
9161 expect(':', end_error);
9164 if (current_switch != NULL) {
9165 if (! statement->case_label.is_bad) {
9166 /* Check for duplicate case values */
9167 case_label_statement_t *c = &statement->case_label;
9168 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9169 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9172 if (c->last_case < l->first_case || c->first_case > l->last_case)
9175 errorf(pos, "duplicate case value (previously used %P)",
9176 &l->base.source_position);
9180 /* link all cases into the switch statement */
9181 if (current_switch->last_case == NULL) {
9182 current_switch->first_case = &statement->case_label;
9184 current_switch->last_case->next = &statement->case_label;
9186 current_switch->last_case = &statement->case_label;
9188 errorf(pos, "case label not within a switch statement");
9191 statement->case_label.statement = parse_label_inner_statement(statement, "case label");
9198 * Parse a default statement.
9200 static statement_t *parse_default_statement(void)
9202 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9206 PUSH_PARENT(statement);
9208 expect(':', end_error);
9211 if (current_switch != NULL) {
9212 const case_label_statement_t *def_label = current_switch->default_label;
9213 if (def_label != NULL) {
9214 errorf(&statement->base.source_position, "multiple default labels in one switch (previous declared %P)", &def_label->base.source_position);
9216 current_switch->default_label = &statement->case_label;
9218 /* link all cases into the switch statement */
9219 if (current_switch->last_case == NULL) {
9220 current_switch->first_case = &statement->case_label;
9222 current_switch->last_case->next = &statement->case_label;
9224 current_switch->last_case = &statement->case_label;
9227 errorf(&statement->base.source_position,
9228 "'default' label not within a switch statement");
9231 statement->case_label.statement = parse_label_inner_statement(statement, "default label");
9238 * Parse a label statement.
9240 static statement_t *parse_label_statement(void)
9242 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9243 label_t *const label = get_label();
9244 statement->label.label = label;
9246 PUSH_PARENT(statement);
9248 /* if statement is already set then the label is defined twice,
9249 * otherwise it was just mentioned in a goto/local label declaration so far
9251 source_position_t const* const pos = &statement->base.source_position;
9252 if (label->statement != NULL) {
9253 errorf(pos, "duplicate '%N' (declared %P)", (entity_t const*)label, &label->base.source_position);
9255 label->base.source_position = *pos;
9256 label->statement = statement;
9261 if (token.kind == T___attribute__ && !(c_mode & _CXX)) {
9262 parse_attributes(NULL); // TODO process attributes
9265 statement->label.statement = parse_label_inner_statement(statement, "label");
9267 /* remember the labels in a list for later checking */
9268 *label_anchor = &statement->label;
9269 label_anchor = &statement->label.next;
9275 static statement_t *parse_inner_statement(void)
9277 statement_t *const stmt = parse_statement();
9278 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
9279 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
9280 if (stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
9281 errorf(&stmt->base.source_position, "declaration as inner statement, use {}");
9287 * Parse an if statement.
9289 static statement_t *parse_if(void)
9291 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9295 PUSH_PARENT(statement);
9297 add_anchor_token('{');
9299 expect('(', end_error);
9300 add_anchor_token(')');
9301 expression_t *const expr = parse_expression();
9302 statement->ifs.condition = expr;
9303 /* §6.8.4.1:1 The controlling expression of an if statement shall have
9305 semantic_condition(expr, "condition of 'if'-statment");
9306 mark_vars_read(expr, NULL);
9307 rem_anchor_token(')');
9308 expect(')', end_error);
9311 rem_anchor_token('{');
9313 add_anchor_token(T_else);
9314 statement_t *const true_stmt = parse_inner_statement();
9315 statement->ifs.true_statement = true_stmt;
9316 rem_anchor_token(T_else);
9318 if (true_stmt->kind == STATEMENT_EMPTY) {
9319 warningf(WARN_EMPTY_BODY, HERE,
9320 "suggest braces around empty body in an ‘if’ statement");
9323 if (next_if(T_else)) {
9324 statement->ifs.false_statement = parse_inner_statement();
9326 if (statement->ifs.false_statement->kind == STATEMENT_EMPTY) {
9327 warningf(WARN_EMPTY_BODY, HERE,
9328 "suggest braces around empty body in an ‘if’ statement");
9330 } else if (true_stmt->kind == STATEMENT_IF &&
9331 true_stmt->ifs.false_statement != NULL) {
9332 source_position_t const *const pos = &true_stmt->base.source_position;
9333 warningf(WARN_PARENTHESES, pos, "suggest explicit braces to avoid ambiguous 'else'");
9341 * Check that all enums are handled in a switch.
9343 * @param statement the switch statement to check
9345 static void check_enum_cases(const switch_statement_t *statement)
9347 if (!is_warn_on(WARN_SWITCH_ENUM))
9349 const type_t *type = skip_typeref(statement->expression->base.type);
9350 if (! is_type_enum(type))
9352 const enum_type_t *enumt = &type->enumt;
9354 /* if we have a default, no warnings */
9355 if (statement->default_label != NULL)
9358 /* FIXME: calculation of value should be done while parsing */
9359 /* TODO: quadratic algorithm here. Change to an n log n one */
9360 long last_value = -1;
9361 const entity_t *entry = enumt->enume->base.next;
9362 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9363 entry = entry->base.next) {
9364 const expression_t *expression = entry->enum_value.value;
9365 long value = expression != NULL ? fold_constant_to_int(expression) : last_value + 1;
9367 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9368 if (l->expression == NULL)
9370 if (l->first_case <= value && value <= l->last_case) {
9376 source_position_t const *const pos = &statement->base.source_position;
9377 warningf(WARN_SWITCH_ENUM, pos, "'%N' not handled in switch", entry);
9384 * Parse a switch statement.
9386 static statement_t *parse_switch(void)
9388 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9392 PUSH_PARENT(statement);
9394 expect('(', end_error);
9395 add_anchor_token(')');
9396 expression_t *const expr = parse_expression();
9397 mark_vars_read(expr, NULL);
9398 type_t * type = skip_typeref(expr->base.type);
9399 if (is_type_integer(type)) {
9400 type = promote_integer(type);
9401 if (get_akind_rank(get_akind(type)) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9402 warningf(WARN_TRADITIONAL, &expr->base.source_position, "'%T' switch expression not converted to '%T' in ISO C", type, type_int);
9404 } else if (is_type_valid(type)) {
9405 errorf(&expr->base.source_position,
9406 "switch quantity is not an integer, but '%T'", type);
9407 type = type_error_type;
9409 statement->switchs.expression = create_implicit_cast(expr, type);
9410 expect(')', end_error);
9411 rem_anchor_token(')');
9413 switch_statement_t *rem = current_switch;
9414 current_switch = &statement->switchs;
9415 statement->switchs.body = parse_inner_statement();
9416 current_switch = rem;
9418 if (statement->switchs.default_label == NULL) {
9419 warningf(WARN_SWITCH_DEFAULT, &statement->base.source_position, "switch has no default case");
9421 check_enum_cases(&statement->switchs);
9427 return create_error_statement();
9430 static statement_t *parse_loop_body(statement_t *const loop)
9432 statement_t *const rem = current_loop;
9433 current_loop = loop;
9435 statement_t *const body = parse_inner_statement();
9442 * Parse a while statement.
9444 static statement_t *parse_while(void)
9446 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9450 PUSH_PARENT(statement);
9452 expect('(', end_error);
9453 add_anchor_token(')');
9454 expression_t *const cond = parse_expression();
9455 statement->whiles.condition = cond;
9456 /* §6.8.5:2 The controlling expression of an iteration statement shall
9457 * have scalar type. */
9458 semantic_condition(cond, "condition of 'while'-statement");
9459 mark_vars_read(cond, NULL);
9460 rem_anchor_token(')');
9461 expect(')', end_error);
9463 statement->whiles.body = parse_loop_body(statement);
9469 return create_error_statement();
9473 * Parse a do statement.
9475 static statement_t *parse_do(void)
9477 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9481 PUSH_PARENT(statement);
9483 add_anchor_token(T_while);
9484 statement->do_while.body = parse_loop_body(statement);
9485 rem_anchor_token(T_while);
9487 expect(T_while, end_error);
9488 expect('(', end_error);
9489 add_anchor_token(')');
9490 expression_t *const cond = parse_expression();
9491 statement->do_while.condition = cond;
9492 /* §6.8.5:2 The controlling expression of an iteration statement shall
9493 * have scalar type. */
9494 semantic_condition(cond, "condition of 'do-while'-statement");
9495 mark_vars_read(cond, NULL);
9496 rem_anchor_token(')');
9497 expect(')', end_error);
9498 expect(';', end_error);
9504 return create_error_statement();
9508 * Parse a for statement.
9510 static statement_t *parse_for(void)
9512 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9516 expect('(', end_error1);
9517 add_anchor_token(')');
9519 PUSH_PARENT(statement);
9520 PUSH_SCOPE(&statement->fors.scope);
9525 } else if (is_declaration_specifier(&token)) {
9526 parse_declaration(record_entity, DECL_FLAGS_NONE);
9528 add_anchor_token(';');
9529 expression_t *const init = parse_expression();
9530 statement->fors.initialisation = init;
9531 mark_vars_read(init, ENT_ANY);
9532 if (!expression_has_effect(init)) {
9533 warningf(WARN_UNUSED_VALUE, &init->base.source_position, "initialisation of 'for'-statement has no effect");
9535 rem_anchor_token(';');
9536 expect(';', end_error2);
9541 if (token.kind != ';') {
9542 add_anchor_token(';');
9543 expression_t *const cond = parse_expression();
9544 statement->fors.condition = cond;
9545 /* §6.8.5:2 The controlling expression of an iteration statement
9546 * shall have scalar type. */
9547 semantic_condition(cond, "condition of 'for'-statement");
9548 mark_vars_read(cond, NULL);
9549 rem_anchor_token(';');
9551 expect(';', end_error2);
9552 if (token.kind != ')') {
9553 expression_t *const step = parse_expression();
9554 statement->fors.step = step;
9555 mark_vars_read(step, ENT_ANY);
9556 if (!expression_has_effect(step)) {
9557 warningf(WARN_UNUSED_VALUE, &step->base.source_position, "step of 'for'-statement has no effect");
9560 expect(')', end_error2);
9561 rem_anchor_token(')');
9562 statement->fors.body = parse_loop_body(statement);
9570 rem_anchor_token(')');
9575 return create_error_statement();
9579 * Parse a goto statement.
9581 static statement_t *parse_goto(void)
9583 statement_t *statement;
9584 if (GNU_MODE && look_ahead(1)->kind == '*') {
9585 statement = allocate_statement_zero(STATEMENT_COMPUTED_GOTO);
9589 expression_t *expression = parse_expression();
9590 mark_vars_read(expression, NULL);
9592 /* Argh: although documentation says the expression must be of type void*,
9593 * gcc accepts anything that can be casted into void* without error */
9594 type_t *type = expression->base.type;
9596 if (type != type_error_type) {
9597 if (!is_type_pointer(type) && !is_type_integer(type)) {
9598 errorf(&expression->base.source_position,
9599 "cannot convert to a pointer type");
9600 } else if (type != type_void_ptr) {
9601 warningf(WARN_OTHER, &expression->base.source_position, "type of computed goto expression should be 'void*' not '%T'", type);
9603 expression = create_implicit_cast(expression, type_void_ptr);
9606 statement->computed_goto.expression = expression;
9608 statement = allocate_statement_zero(STATEMENT_GOTO);
9610 if (token.kind == T_IDENTIFIER) {
9611 label_t *const label = get_label();
9613 statement->gotos.label = label;
9615 /* remember the goto's in a list for later checking */
9616 *goto_anchor = &statement->gotos;
9617 goto_anchor = &statement->gotos.next;
9620 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
9622 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
9624 return create_error_statement();
9628 expect(';', end_error);
9635 * Parse a continue statement.
9637 static statement_t *parse_continue(void)
9639 if (current_loop == NULL) {
9640 errorf(HERE, "continue statement not within loop");
9643 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9646 expect(';', end_error);
9653 * Parse a break statement.
9655 static statement_t *parse_break(void)
9657 if (current_switch == NULL && current_loop == NULL) {
9658 errorf(HERE, "break statement not within loop or switch");
9661 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9664 expect(';', end_error);
9671 * Parse a __leave statement.
9673 static statement_t *parse_leave_statement(void)
9675 if (current_try == NULL) {
9676 errorf(HERE, "__leave statement not within __try");
9679 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9682 expect(';', end_error);
9689 * Check if a given entity represents a local variable.
9691 static bool is_local_variable(const entity_t *entity)
9693 if (entity->kind != ENTITY_VARIABLE)
9696 switch ((storage_class_tag_t) entity->declaration.storage_class) {
9697 case STORAGE_CLASS_AUTO:
9698 case STORAGE_CLASS_REGISTER: {
9699 const type_t *type = skip_typeref(entity->declaration.type);
9700 if (is_type_function(type)) {
9712 * Check if a given expression represents a local variable.
9714 static bool expression_is_local_variable(const expression_t *expression)
9716 if (expression->base.kind != EXPR_REFERENCE) {
9719 const entity_t *entity = expression->reference.entity;
9720 return is_local_variable(entity);
9724 * Check if a given expression represents a local variable and
9725 * return its declaration then, else return NULL.
9727 entity_t *expression_is_variable(const expression_t *expression)
9729 if (expression->base.kind != EXPR_REFERENCE) {
9732 entity_t *entity = expression->reference.entity;
9733 if (entity->kind != ENTITY_VARIABLE)
9739 static void err_or_warn(source_position_t const *const pos, char const *const msg)
9741 if (c_mode & _CXX || strict_mode) {
9744 warningf(WARN_OTHER, pos, msg);
9749 * Parse a return statement.
9751 static statement_t *parse_return(void)
9753 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9756 expression_t *return_value = NULL;
9757 if (token.kind != ';') {
9758 return_value = parse_expression();
9759 mark_vars_read(return_value, NULL);
9762 const type_t *const func_type = skip_typeref(current_function->base.type);
9763 assert(is_type_function(func_type));
9764 type_t *const return_type = skip_typeref(func_type->function.return_type);
9766 source_position_t const *const pos = &statement->base.source_position;
9767 if (return_value != NULL) {
9768 type_t *return_value_type = skip_typeref(return_value->base.type);
9770 if (is_type_void(return_type)) {
9771 if (!is_type_void(return_value_type)) {
9772 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
9773 /* Only warn in C mode, because GCC does the same */
9774 err_or_warn(pos, "'return' with a value, in function returning 'void'");
9775 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9776 /* Only warn in C mode, because GCC does the same */
9777 err_or_warn(pos, "'return' with expression in function returning 'void'");
9780 assign_error_t error = semantic_assign(return_type, return_value);
9781 report_assign_error(error, return_type, return_value, "'return'",
9784 return_value = create_implicit_cast(return_value, return_type);
9785 /* check for returning address of a local var */
9786 if (return_value != NULL && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
9787 const expression_t *expression = return_value->unary.value;
9788 if (expression_is_local_variable(expression)) {
9789 warningf(WARN_OTHER, pos, "function returns address of local variable");
9792 } else if (!is_type_void(return_type)) {
9793 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9794 err_or_warn(pos, "'return' without value, in function returning non-void");
9796 statement->returns.value = return_value;
9798 expect(';', end_error);
9805 * Parse a declaration statement.
9807 static statement_t *parse_declaration_statement(void)
9809 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9811 entity_t *before = current_scope->last_entity;
9813 parse_external_declaration();
9815 parse_declaration(record_entity, DECL_FLAGS_NONE);
9818 declaration_statement_t *const decl = &statement->declaration;
9819 entity_t *const begin =
9820 before != NULL ? before->base.next : current_scope->entities;
9821 decl->declarations_begin = begin;
9822 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
9828 * Parse an expression statement, ie. expr ';'.
9830 static statement_t *parse_expression_statement(void)
9832 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
9834 expression_t *const expr = parse_expression();
9835 statement->expression.expression = expr;
9836 mark_vars_read(expr, ENT_ANY);
9838 expect(';', end_error);
9845 * Parse a microsoft __try { } __finally { } or
9846 * __try{ } __except() { }
9848 static statement_t *parse_ms_try_statment(void)
9850 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
9853 PUSH_PARENT(statement);
9855 ms_try_statement_t *rem = current_try;
9856 current_try = &statement->ms_try;
9857 statement->ms_try.try_statement = parse_compound_statement(false);
9862 if (next_if(T___except)) {
9863 expect('(', end_error);
9864 add_anchor_token(')');
9865 expression_t *const expr = parse_expression();
9866 mark_vars_read(expr, NULL);
9867 type_t * type = skip_typeref(expr->base.type);
9868 if (is_type_integer(type)) {
9869 type = promote_integer(type);
9870 } else if (is_type_valid(type)) {
9871 errorf(&expr->base.source_position,
9872 "__expect expression is not an integer, but '%T'", type);
9873 type = type_error_type;
9875 statement->ms_try.except_expression = create_implicit_cast(expr, type);
9876 rem_anchor_token(')');
9877 expect(')', end_error);
9878 statement->ms_try.final_statement = parse_compound_statement(false);
9879 } else if (next_if(T__finally)) {
9880 statement->ms_try.final_statement = parse_compound_statement(false);
9882 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
9883 return create_error_statement();
9887 return create_error_statement();
9890 static statement_t *parse_empty_statement(void)
9892 warningf(WARN_EMPTY_STATEMENT, HERE, "statement is empty");
9893 statement_t *const statement = create_empty_statement();
9898 static statement_t *parse_local_label_declaration(void)
9900 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9904 entity_t *begin = NULL;
9905 entity_t *end = NULL;
9906 entity_t **anchor = &begin;
9908 if (token.kind != T_IDENTIFIER) {
9909 parse_error_expected("while parsing local label declaration",
9910 T_IDENTIFIER, NULL);
9913 symbol_t *symbol = token.identifier.symbol;
9914 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
9915 if (entity != NULL && entity->base.parent_scope == current_scope) {
9916 source_position_t const *const ppos = &entity->base.source_position;
9917 errorf(HERE, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
9919 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL, NAMESPACE_LABEL, symbol);
9920 entity->base.parent_scope = current_scope;
9921 entity->base.source_position = token.base.source_position;
9924 anchor = &entity->base.next;
9927 environment_push(entity);
9930 } while (next_if(','));
9931 expect(';', end_error);
9933 statement->declaration.declarations_begin = begin;
9934 statement->declaration.declarations_end = end;
9938 static void parse_namespace_definition(void)
9942 entity_t *entity = NULL;
9943 symbol_t *symbol = NULL;
9945 if (token.kind == T_IDENTIFIER) {
9946 symbol = token.identifier.symbol;
9949 entity = get_entity(symbol, NAMESPACE_NORMAL);
9951 && entity->kind != ENTITY_NAMESPACE
9952 && entity->base.parent_scope == current_scope) {
9953 if (is_entity_valid(entity)) {
9954 error_redefined_as_different_kind(&token.base.source_position,
9955 entity, ENTITY_NAMESPACE);
9961 if (entity == NULL) {
9962 entity = allocate_entity_zero(ENTITY_NAMESPACE, NAMESPACE_NORMAL, symbol);
9963 entity->base.source_position = token.base.source_position;
9964 entity->base.parent_scope = current_scope;
9967 if (token.kind == '=') {
9968 /* TODO: parse namespace alias */
9969 panic("namespace alias definition not supported yet");
9972 environment_push(entity);
9973 append_entity(current_scope, entity);
9975 PUSH_SCOPE(&entity->namespacee.members);
9977 entity_t *old_current_entity = current_entity;
9978 current_entity = entity;
9980 expect('{', end_error);
9982 expect('}', end_error);
9985 assert(current_entity == entity);
9986 current_entity = old_current_entity;
9991 * Parse a statement.
9992 * There's also parse_statement() which additionally checks for
9993 * "statement has no effect" warnings
9995 static statement_t *intern_parse_statement(void)
9997 statement_t *statement = NULL;
9999 /* declaration or statement */
10000 add_anchor_token(';');
10001 switch (token.kind) {
10002 case T_IDENTIFIER: {
10003 token_kind_t la1_type = (token_kind_t)look_ahead(1)->kind;
10004 if (la1_type == ':') {
10005 statement = parse_label_statement();
10006 } else if (is_typedef_symbol(token.identifier.symbol)) {
10007 statement = parse_declaration_statement();
10009 /* it's an identifier, the grammar says this must be an
10010 * expression statement. However it is common that users mistype
10011 * declaration types, so we guess a bit here to improve robustness
10012 * for incorrect programs */
10013 switch (la1_type) {
10016 if (get_entity(token.identifier.symbol, NAMESPACE_NORMAL) != NULL) {
10018 statement = parse_expression_statement();
10022 statement = parse_declaration_statement();
10030 case T___extension__: {
10031 /* This can be a prefix to a declaration or an expression statement.
10032 * We simply eat it now and parse the rest with tail recursion. */
10034 statement = intern_parse_statement();
10040 statement = parse_declaration_statement();
10044 statement = parse_local_label_declaration();
10047 case ';': statement = parse_empty_statement(); break;
10048 case '{': statement = parse_compound_statement(false); break;
10049 case T___leave: statement = parse_leave_statement(); break;
10050 case T___try: statement = parse_ms_try_statment(); break;
10051 case T_asm: statement = parse_asm_statement(); break;
10052 case T_break: statement = parse_break(); break;
10053 case T_case: statement = parse_case_statement(); break;
10054 case T_continue: statement = parse_continue(); break;
10055 case T_default: statement = parse_default_statement(); break;
10056 case T_do: statement = parse_do(); break;
10057 case T_for: statement = parse_for(); break;
10058 case T_goto: statement = parse_goto(); break;
10059 case T_if: statement = parse_if(); break;
10060 case T_return: statement = parse_return(); break;
10061 case T_switch: statement = parse_switch(); break;
10062 case T_while: statement = parse_while(); break;
10065 statement = parse_expression_statement();
10069 errorf(HERE, "unexpected token %K while parsing statement", &token);
10070 statement = create_error_statement();
10075 rem_anchor_token(';');
10077 assert(statement != NULL
10078 && statement->base.source_position.input_name != NULL);
10084 * parse a statement and emits "statement has no effect" warning if needed
10085 * (This is really a wrapper around intern_parse_statement with check for 1
10086 * single warning. It is needed, because for statement expressions we have
10087 * to avoid the warning on the last statement)
10089 static statement_t *parse_statement(void)
10091 statement_t *statement = intern_parse_statement();
10093 if (statement->kind == STATEMENT_EXPRESSION) {
10094 expression_t *expression = statement->expression.expression;
10095 if (!expression_has_effect(expression)) {
10096 warningf(WARN_UNUSED_VALUE, &expression->base.source_position, "statement has no effect");
10104 * Parse a compound statement.
10106 static statement_t *parse_compound_statement(bool inside_expression_statement)
10108 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
10110 PUSH_PARENT(statement);
10111 PUSH_SCOPE(&statement->compound.scope);
10114 add_anchor_token('}');
10115 /* tokens, which can start a statement */
10116 /* TODO MS, __builtin_FOO */
10117 add_anchor_token('!');
10118 add_anchor_token('&');
10119 add_anchor_token('(');
10120 add_anchor_token('*');
10121 add_anchor_token('+');
10122 add_anchor_token('-');
10123 add_anchor_token('{');
10124 add_anchor_token('~');
10125 add_anchor_token(T_CHARACTER_CONSTANT);
10126 add_anchor_token(T_COLONCOLON);
10127 add_anchor_token(T_FLOATINGPOINT);
10128 add_anchor_token(T_IDENTIFIER);
10129 add_anchor_token(T_INTEGER);
10130 add_anchor_token(T_MINUSMINUS);
10131 add_anchor_token(T_PLUSPLUS);
10132 add_anchor_token(T_STRING_LITERAL);
10133 add_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10134 add_anchor_token(T_WIDE_STRING_LITERAL);
10135 add_anchor_token(T__Bool);
10136 add_anchor_token(T__Complex);
10137 add_anchor_token(T__Imaginary);
10138 add_anchor_token(T___FUNCTION__);
10139 add_anchor_token(T___PRETTY_FUNCTION__);
10140 add_anchor_token(T___alignof__);
10141 add_anchor_token(T___attribute__);
10142 add_anchor_token(T___builtin_va_start);
10143 add_anchor_token(T___extension__);
10144 add_anchor_token(T___func__);
10145 add_anchor_token(T___imag__);
10146 add_anchor_token(T___label__);
10147 add_anchor_token(T___real__);
10148 add_anchor_token(T___thread);
10149 add_anchor_token(T_asm);
10150 add_anchor_token(T_auto);
10151 add_anchor_token(T_bool);
10152 add_anchor_token(T_break);
10153 add_anchor_token(T_case);
10154 add_anchor_token(T_char);
10155 add_anchor_token(T_class);
10156 add_anchor_token(T_const);
10157 add_anchor_token(T_const_cast);
10158 add_anchor_token(T_continue);
10159 add_anchor_token(T_default);
10160 add_anchor_token(T_delete);
10161 add_anchor_token(T_double);
10162 add_anchor_token(T_do);
10163 add_anchor_token(T_dynamic_cast);
10164 add_anchor_token(T_enum);
10165 add_anchor_token(T_extern);
10166 add_anchor_token(T_false);
10167 add_anchor_token(T_float);
10168 add_anchor_token(T_for);
10169 add_anchor_token(T_goto);
10170 add_anchor_token(T_if);
10171 add_anchor_token(T_inline);
10172 add_anchor_token(T_int);
10173 add_anchor_token(T_long);
10174 add_anchor_token(T_new);
10175 add_anchor_token(T_operator);
10176 add_anchor_token(T_register);
10177 add_anchor_token(T_reinterpret_cast);
10178 add_anchor_token(T_restrict);
10179 add_anchor_token(T_return);
10180 add_anchor_token(T_short);
10181 add_anchor_token(T_signed);
10182 add_anchor_token(T_sizeof);
10183 add_anchor_token(T_static);
10184 add_anchor_token(T_static_cast);
10185 add_anchor_token(T_struct);
10186 add_anchor_token(T_switch);
10187 add_anchor_token(T_template);
10188 add_anchor_token(T_this);
10189 add_anchor_token(T_throw);
10190 add_anchor_token(T_true);
10191 add_anchor_token(T_try);
10192 add_anchor_token(T_typedef);
10193 add_anchor_token(T_typeid);
10194 add_anchor_token(T_typename);
10195 add_anchor_token(T_typeof);
10196 add_anchor_token(T_union);
10197 add_anchor_token(T_unsigned);
10198 add_anchor_token(T_using);
10199 add_anchor_token(T_void);
10200 add_anchor_token(T_volatile);
10201 add_anchor_token(T_wchar_t);
10202 add_anchor_token(T_while);
10204 statement_t **anchor = &statement->compound.statements;
10205 bool only_decls_so_far = true;
10206 while (token.kind != '}') {
10207 if (token.kind == T_EOF) {
10208 errorf(&statement->base.source_position,
10209 "EOF while parsing compound statement");
10212 statement_t *sub_statement = intern_parse_statement();
10213 if (sub_statement->kind == STATEMENT_ERROR) {
10214 /* an error occurred. if we are at an anchor, return */
10220 if (sub_statement->kind != STATEMENT_DECLARATION) {
10221 only_decls_so_far = false;
10222 } else if (!only_decls_so_far) {
10223 source_position_t const *const pos = &sub_statement->base.source_position;
10224 warningf(WARN_DECLARATION_AFTER_STATEMENT, pos, "ISO C90 forbids mixed declarations and code");
10227 *anchor = sub_statement;
10229 while (sub_statement->base.next != NULL)
10230 sub_statement = sub_statement->base.next;
10232 anchor = &sub_statement->base.next;
10236 /* look over all statements again to produce no effect warnings */
10237 if (is_warn_on(WARN_UNUSED_VALUE)) {
10238 statement_t *sub_statement = statement->compound.statements;
10239 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
10240 if (sub_statement->kind != STATEMENT_EXPRESSION)
10242 /* don't emit a warning for the last expression in an expression
10243 * statement as it has always an effect */
10244 if (inside_expression_statement && sub_statement->base.next == NULL)
10247 expression_t *expression = sub_statement->expression.expression;
10248 if (!expression_has_effect(expression)) {
10249 warningf(WARN_UNUSED_VALUE, &expression->base.source_position, "statement has no effect");
10255 rem_anchor_token(T_while);
10256 rem_anchor_token(T_wchar_t);
10257 rem_anchor_token(T_volatile);
10258 rem_anchor_token(T_void);
10259 rem_anchor_token(T_using);
10260 rem_anchor_token(T_unsigned);
10261 rem_anchor_token(T_union);
10262 rem_anchor_token(T_typeof);
10263 rem_anchor_token(T_typename);
10264 rem_anchor_token(T_typeid);
10265 rem_anchor_token(T_typedef);
10266 rem_anchor_token(T_try);
10267 rem_anchor_token(T_true);
10268 rem_anchor_token(T_throw);
10269 rem_anchor_token(T_this);
10270 rem_anchor_token(T_template);
10271 rem_anchor_token(T_switch);
10272 rem_anchor_token(T_struct);
10273 rem_anchor_token(T_static_cast);
10274 rem_anchor_token(T_static);
10275 rem_anchor_token(T_sizeof);
10276 rem_anchor_token(T_signed);
10277 rem_anchor_token(T_short);
10278 rem_anchor_token(T_return);
10279 rem_anchor_token(T_restrict);
10280 rem_anchor_token(T_reinterpret_cast);
10281 rem_anchor_token(T_register);
10282 rem_anchor_token(T_operator);
10283 rem_anchor_token(T_new);
10284 rem_anchor_token(T_long);
10285 rem_anchor_token(T_int);
10286 rem_anchor_token(T_inline);
10287 rem_anchor_token(T_if);
10288 rem_anchor_token(T_goto);
10289 rem_anchor_token(T_for);
10290 rem_anchor_token(T_float);
10291 rem_anchor_token(T_false);
10292 rem_anchor_token(T_extern);
10293 rem_anchor_token(T_enum);
10294 rem_anchor_token(T_dynamic_cast);
10295 rem_anchor_token(T_do);
10296 rem_anchor_token(T_double);
10297 rem_anchor_token(T_delete);
10298 rem_anchor_token(T_default);
10299 rem_anchor_token(T_continue);
10300 rem_anchor_token(T_const_cast);
10301 rem_anchor_token(T_const);
10302 rem_anchor_token(T_class);
10303 rem_anchor_token(T_char);
10304 rem_anchor_token(T_case);
10305 rem_anchor_token(T_break);
10306 rem_anchor_token(T_bool);
10307 rem_anchor_token(T_auto);
10308 rem_anchor_token(T_asm);
10309 rem_anchor_token(T___thread);
10310 rem_anchor_token(T___real__);
10311 rem_anchor_token(T___label__);
10312 rem_anchor_token(T___imag__);
10313 rem_anchor_token(T___func__);
10314 rem_anchor_token(T___extension__);
10315 rem_anchor_token(T___builtin_va_start);
10316 rem_anchor_token(T___attribute__);
10317 rem_anchor_token(T___alignof__);
10318 rem_anchor_token(T___PRETTY_FUNCTION__);
10319 rem_anchor_token(T___FUNCTION__);
10320 rem_anchor_token(T__Imaginary);
10321 rem_anchor_token(T__Complex);
10322 rem_anchor_token(T__Bool);
10323 rem_anchor_token(T_WIDE_STRING_LITERAL);
10324 rem_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10325 rem_anchor_token(T_STRING_LITERAL);
10326 rem_anchor_token(T_PLUSPLUS);
10327 rem_anchor_token(T_MINUSMINUS);
10328 rem_anchor_token(T_INTEGER);
10329 rem_anchor_token(T_IDENTIFIER);
10330 rem_anchor_token(T_FLOATINGPOINT);
10331 rem_anchor_token(T_COLONCOLON);
10332 rem_anchor_token(T_CHARACTER_CONSTANT);
10333 rem_anchor_token('~');
10334 rem_anchor_token('{');
10335 rem_anchor_token('-');
10336 rem_anchor_token('+');
10337 rem_anchor_token('*');
10338 rem_anchor_token('(');
10339 rem_anchor_token('&');
10340 rem_anchor_token('!');
10341 rem_anchor_token('}');
10349 * Check for unused global static functions and variables
10351 static void check_unused_globals(void)
10353 if (!is_warn_on(WARN_UNUSED_FUNCTION) && !is_warn_on(WARN_UNUSED_VARIABLE))
10356 for (const entity_t *entity = file_scope->entities; entity != NULL;
10357 entity = entity->base.next) {
10358 if (!is_declaration(entity))
10361 const declaration_t *declaration = &entity->declaration;
10362 if (declaration->used ||
10363 declaration->modifiers & DM_UNUSED ||
10364 declaration->modifiers & DM_USED ||
10365 declaration->storage_class != STORAGE_CLASS_STATIC)
10370 if (entity->kind == ENTITY_FUNCTION) {
10371 /* inhibit warning for static inline functions */
10372 if (entity->function.is_inline)
10375 why = WARN_UNUSED_FUNCTION;
10376 s = entity->function.statement != NULL ? "defined" : "declared";
10378 why = WARN_UNUSED_VARIABLE;
10382 warningf(why, &declaration->base.source_position, "'%#N' %s but not used", entity, s);
10386 static void parse_global_asm(void)
10388 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10391 expect('(', end_error);
10393 statement->asms.asm_text = parse_string_literals();
10394 statement->base.next = unit->global_asm;
10395 unit->global_asm = statement;
10397 expect(')', end_error);
10398 expect(';', end_error);
10403 static void parse_linkage_specification(void)
10407 source_position_t const pos = *HERE;
10408 char const *const linkage = parse_string_literals().begin;
10410 linkage_kind_t old_linkage = current_linkage;
10411 linkage_kind_t new_linkage;
10412 if (streq(linkage, "C")) {
10413 new_linkage = LINKAGE_C;
10414 } else if (streq(linkage, "C++")) {
10415 new_linkage = LINKAGE_CXX;
10417 errorf(&pos, "linkage string \"%s\" not recognized", linkage);
10418 new_linkage = LINKAGE_C;
10420 current_linkage = new_linkage;
10422 if (next_if('{')) {
10424 expect('}', end_error);
10430 assert(current_linkage == new_linkage);
10431 current_linkage = old_linkage;
10434 static void parse_external(void)
10436 switch (token.kind) {
10438 if (look_ahead(1)->kind == T_STRING_LITERAL) {
10439 parse_linkage_specification();
10441 DECLARATION_START_NO_EXTERN
10443 case T___extension__:
10444 /* tokens below are for implicit int */
10445 case '&': /* & x; -> int& x; (and error later, because C++ has no
10447 case '*': /* * x; -> int* x; */
10448 case '(': /* (x); -> int (x); */
10450 parse_external_declaration();
10456 parse_global_asm();
10460 parse_namespace_definition();
10464 if (!strict_mode) {
10465 warningf(WARN_STRAY_SEMICOLON, HERE, "stray ';' outside of function");
10472 errorf(HERE, "stray %K outside of function", &token);
10473 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10474 eat_until_matching_token(token.kind);
10480 static void parse_externals(void)
10482 add_anchor_token('}');
10483 add_anchor_token(T_EOF);
10486 /* make a copy of the anchor set, so we can check if it is restored after parsing */
10487 unsigned short token_anchor_copy[T_LAST_TOKEN];
10488 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10491 while (token.kind != T_EOF && token.kind != '}') {
10493 for (int i = 0; i < T_LAST_TOKEN; ++i) {
10494 unsigned short count = token_anchor_set[i] - token_anchor_copy[i];
10496 /* the anchor set and its copy differs */
10497 internal_errorf(HERE, "Leaked anchor token %k %d times", i, count);
10500 if (in_gcc_extension) {
10501 /* an gcc extension scope was not closed */
10502 internal_errorf(HERE, "Leaked __extension__");
10509 rem_anchor_token(T_EOF);
10510 rem_anchor_token('}');
10514 * Parse a translation unit.
10516 static void parse_translation_unit(void)
10518 add_anchor_token(T_EOF);
10523 if (token.kind == T_EOF)
10526 errorf(HERE, "stray %K outside of function", &token);
10527 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10528 eat_until_matching_token(token.kind);
10533 void set_default_visibility(elf_visibility_tag_t visibility)
10535 default_visibility = visibility;
10541 * @return the translation unit or NULL if errors occurred.
10543 void start_parsing(void)
10545 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10546 label_stack = NEW_ARR_F(stack_entry_t, 0);
10547 diagnostic_count = 0;
10551 print_to_file(stderr);
10553 assert(unit == NULL);
10554 unit = allocate_ast_zero(sizeof(unit[0]));
10556 assert(file_scope == NULL);
10557 file_scope = &unit->scope;
10559 assert(current_scope == NULL);
10560 scope_push(&unit->scope);
10562 create_gnu_builtins();
10564 create_microsoft_intrinsics();
10567 translation_unit_t *finish_parsing(void)
10569 assert(current_scope == &unit->scope);
10572 assert(file_scope == &unit->scope);
10573 check_unused_globals();
10576 DEL_ARR_F(environment_stack);
10577 DEL_ARR_F(label_stack);
10579 translation_unit_t *result = unit;
10584 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
10585 * are given length one. */
10586 static void complete_incomplete_arrays(void)
10588 size_t n = ARR_LEN(incomplete_arrays);
10589 for (size_t i = 0; i != n; ++i) {
10590 declaration_t *const decl = incomplete_arrays[i];
10591 type_t *const type = skip_typeref(decl->type);
10593 if (!is_type_incomplete(type))
10596 source_position_t const *const pos = &decl->base.source_position;
10597 warningf(WARN_OTHER, pos, "array '%#N' assumed to have one element", (entity_t const*)decl);
10599 type_t *const new_type = duplicate_type(type);
10600 new_type->array.size_constant = true;
10601 new_type->array.has_implicit_size = true;
10602 new_type->array.size = 1;
10604 type_t *const result = identify_new_type(new_type);
10606 decl->type = result;
10610 void prepare_main_collect2(entity_t *entity)
10612 PUSH_SCOPE(&entity->function.statement->compound.scope);
10614 // create call to __main
10615 symbol_t *symbol = symbol_table_insert("__main");
10616 entity_t *subsubmain_ent
10617 = create_implicit_function(symbol, &builtin_source_position);
10619 expression_t *ref = allocate_expression_zero(EXPR_REFERENCE);
10620 type_t *ftype = subsubmain_ent->declaration.type;
10621 ref->base.source_position = builtin_source_position;
10622 ref->base.type = make_pointer_type(ftype, TYPE_QUALIFIER_NONE);
10623 ref->reference.entity = subsubmain_ent;
10625 expression_t *call = allocate_expression_zero(EXPR_CALL);
10626 call->base.source_position = builtin_source_position;
10627 call->base.type = type_void;
10628 call->call.function = ref;
10630 statement_t *expr_statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10631 expr_statement->base.source_position = builtin_source_position;
10632 expr_statement->expression.expression = call;
10634 statement_t *statement = entity->function.statement;
10635 assert(statement->kind == STATEMENT_COMPOUND);
10636 compound_statement_t *compounds = &statement->compound;
10638 expr_statement->base.next = compounds->statements;
10639 compounds->statements = expr_statement;
10646 lookahead_bufpos = 0;
10647 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10650 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
10651 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
10652 parse_translation_unit();
10653 complete_incomplete_arrays();
10654 DEL_ARR_F(incomplete_arrays);
10655 incomplete_arrays = NULL;
10659 * Initialize the parser.
10661 void init_parser(void)
10663 sym_anonymous = symbol_table_insert("<anonymous>");
10665 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10667 init_expression_parsers();
10668 obstack_init(&temp_obst);
10672 * Terminate the parser.
10674 void exit_parser(void)
10676 obstack_free(&temp_obst, NULL);