2 * This file is part of cparser.
3 * Copyright (C) 2007-2009 Matthias Braun <matze@braunis.de>
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * as published by the Free Software Foundation; either version 2
8 * of the License, or (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
27 #include "diagnostic.h"
28 #include "format_check.h"
34 #include "type_hash.h"
37 #include "attribute_t.h"
38 #include "lang_features.h"
42 #include "adt/bitfiddle.h"
43 #include "adt/error.h"
44 #include "adt/array.h"
46 //#define PRINT_TOKENS
47 #define MAX_LOOKAHEAD 1
52 entity_namespace_t namespc;
55 typedef struct declaration_specifiers_t declaration_specifiers_t;
56 struct declaration_specifiers_t {
57 source_position_t source_position;
58 storage_class_t storage_class;
59 unsigned char alignment; /**< Alignment, 0 if not set. */
61 bool thread_local : 1; /**< GCC __thread */
62 attribute_t *attributes; /**< list of attributes */
67 * An environment for parsing initializers (and compound literals).
69 typedef struct parse_initializer_env_t {
70 type_t *type; /**< the type of the initializer. In case of an
71 array type with unspecified size this gets
72 adjusted to the actual size. */
73 entity_t *entity; /**< the variable that is initialized if any */
74 bool must_be_constant;
75 } parse_initializer_env_t;
77 typedef entity_t* (*parsed_declaration_func) (entity_t *declaration, bool is_definition);
79 /** The current token. */
81 /** The lookahead ring-buffer. */
82 static token_t lookahead_buffer[MAX_LOOKAHEAD];
83 /** Position of the next token in the lookahead buffer. */
84 static size_t lookahead_bufpos;
85 static stack_entry_t *environment_stack = NULL;
86 static stack_entry_t *label_stack = NULL;
87 static scope_t *file_scope = NULL;
88 static scope_t *current_scope = NULL;
89 /** Point to the current function declaration if inside a function. */
90 static function_t *current_function = NULL;
91 static entity_t *current_entity = NULL;
92 static switch_statement_t *current_switch = NULL;
93 static statement_t *current_loop = NULL;
94 static statement_t *current_parent = NULL;
95 static ms_try_statement_t *current_try = NULL;
96 static linkage_kind_t current_linkage;
97 static goto_statement_t *goto_first = NULL;
98 static goto_statement_t **goto_anchor = NULL;
99 static label_statement_t *label_first = NULL;
100 static label_statement_t **label_anchor = NULL;
101 /** current translation unit. */
102 static translation_unit_t *unit = NULL;
103 /** true if we are in an __extension__ context. */
104 static bool in_gcc_extension = false;
105 static struct obstack temp_obst;
106 static entity_t *anonymous_entity;
107 static declaration_t **incomplete_arrays;
108 static elf_visibility_tag_t default_visibility = ELF_VISIBILITY_DEFAULT;
111 #define PUSH_PARENT(stmt) \
112 statement_t *const new_parent = (stmt); \
113 statement_t *const old_parent = current_parent; \
114 ((void)(current_parent = new_parent))
115 #define POP_PARENT() (assert(current_parent == new_parent), (void)(current_parent = old_parent))
117 #define PUSH_SCOPE(scope) \
118 size_t const top = environment_top(); \
119 scope_t *const new_scope = (scope); \
120 scope_t *const old_scope = scope_push(new_scope)
121 #define POP_SCOPE() (assert(current_scope == new_scope), scope_pop(old_scope), environment_pop_to(top))
123 #define PUSH_EXTENSION() \
125 bool const old_gcc_extension = in_gcc_extension; \
126 while (next_if(T___extension__)) { \
127 in_gcc_extension = true; \
130 #define POP_EXTENSION() \
131 ((void)(in_gcc_extension = old_gcc_extension))
133 /** special symbol used for anonymous entities. */
134 static symbol_t *sym_anonymous = NULL;
136 /** The token anchor set */
137 static unsigned short token_anchor_set[T_LAST_TOKEN];
139 /** The current source position. */
140 #define HERE (&token.base.source_position)
142 /** true if we are in GCC mode. */
143 #define GNU_MODE ((c_mode & _GNUC) || in_gcc_extension)
145 static statement_t *parse_compound_statement(bool inside_expression_statement);
146 static statement_t *parse_statement(void);
148 static expression_t *parse_subexpression(precedence_t);
149 static expression_t *parse_expression(void);
150 static type_t *parse_typename(void);
151 static void parse_externals(void);
152 static void parse_external(void);
154 static void parse_compound_type_entries(compound_t *compound_declaration);
156 static void check_call_argument(type_t *expected_type,
157 call_argument_t *argument, unsigned pos);
159 typedef enum declarator_flags_t {
161 DECL_MAY_BE_ABSTRACT = 1U << 0,
162 DECL_CREATE_COMPOUND_MEMBER = 1U << 1,
163 DECL_IS_PARAMETER = 1U << 2
164 } declarator_flags_t;
166 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
167 declarator_flags_t flags);
169 static void semantic_comparison(binary_expression_t *expression);
171 #define STORAGE_CLASSES \
172 STORAGE_CLASSES_NO_EXTERN \
175 #define STORAGE_CLASSES_NO_EXTERN \
182 #define TYPE_QUALIFIERS \
187 case T__forceinline: \
188 case T___attribute__:
190 #define COMPLEX_SPECIFIERS \
192 #define IMAGINARY_SPECIFIERS \
195 #define TYPE_SPECIFIERS \
197 case T___builtin_va_list: \
222 #define DECLARATION_START \
227 #define DECLARATION_START_NO_EXTERN \
228 STORAGE_CLASSES_NO_EXTERN \
232 #define EXPRESSION_START \
241 case T_CHARACTER_CONSTANT: \
242 case T_FLOATINGPOINT: \
243 case T_FLOATINGPOINT_HEXADECIMAL: \
245 case T_INTEGER_HEXADECIMAL: \
246 case T_INTEGER_OCTAL: \
249 case T_STRING_LITERAL: \
250 case T_WIDE_CHARACTER_CONSTANT: \
251 case T_WIDE_STRING_LITERAL: \
252 case T___FUNCDNAME__: \
253 case T___FUNCSIG__: \
254 case T___FUNCTION__: \
255 case T___PRETTY_FUNCTION__: \
256 case T___alignof__: \
257 case T___builtin_classify_type: \
258 case T___builtin_constant_p: \
259 case T___builtin_isgreater: \
260 case T___builtin_isgreaterequal: \
261 case T___builtin_isless: \
262 case T___builtin_islessequal: \
263 case T___builtin_islessgreater: \
264 case T___builtin_isunordered: \
265 case T___builtin_offsetof: \
266 case T___builtin_va_arg: \
267 case T___builtin_va_copy: \
268 case T___builtin_va_start: \
279 * Returns the size of a statement node.
281 * @param kind the statement kind
283 static size_t get_statement_struct_size(statement_kind_t kind)
285 static const size_t sizes[] = {
286 [STATEMENT_ERROR] = sizeof(statement_base_t),
287 [STATEMENT_EMPTY] = sizeof(statement_base_t),
288 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
289 [STATEMENT_RETURN] = sizeof(return_statement_t),
290 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
291 [STATEMENT_IF] = sizeof(if_statement_t),
292 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
293 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
294 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
295 [STATEMENT_BREAK] = sizeof(statement_base_t),
296 [STATEMENT_GOTO] = sizeof(goto_statement_t),
297 [STATEMENT_LABEL] = sizeof(label_statement_t),
298 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
299 [STATEMENT_WHILE] = sizeof(while_statement_t),
300 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
301 [STATEMENT_FOR] = sizeof(for_statement_t),
302 [STATEMENT_ASM] = sizeof(asm_statement_t),
303 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
304 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
306 assert((size_t)kind < lengthof(sizes));
307 assert(sizes[kind] != 0);
312 * Returns the size of an expression node.
314 * @param kind the expression kind
316 static size_t get_expression_struct_size(expression_kind_t kind)
318 static const size_t sizes[] = {
319 [EXPR_ERROR] = sizeof(expression_base_t),
320 [EXPR_REFERENCE] = sizeof(reference_expression_t),
321 [EXPR_REFERENCE_ENUM_VALUE] = sizeof(reference_expression_t),
322 [EXPR_LITERAL_BOOLEAN] = sizeof(literal_expression_t),
323 [EXPR_LITERAL_INTEGER] = sizeof(literal_expression_t),
324 [EXPR_LITERAL_INTEGER_OCTAL] = sizeof(literal_expression_t),
325 [EXPR_LITERAL_INTEGER_HEXADECIMAL]= sizeof(literal_expression_t),
326 [EXPR_LITERAL_FLOATINGPOINT] = sizeof(literal_expression_t),
327 [EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL] = sizeof(literal_expression_t),
328 [EXPR_LITERAL_CHARACTER] = sizeof(literal_expression_t),
329 [EXPR_LITERAL_WIDE_CHARACTER] = sizeof(literal_expression_t),
330 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
331 [EXPR_WIDE_STRING_LITERAL] = sizeof(string_literal_expression_t),
332 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
333 [EXPR_CALL] = sizeof(call_expression_t),
334 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
335 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
336 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
337 [EXPR_SELECT] = sizeof(select_expression_t),
338 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
339 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
340 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
341 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
342 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
343 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
344 [EXPR_BUILTIN_TYPES_COMPATIBLE_P] = sizeof(builtin_types_compatible_expression_t),
345 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
346 [EXPR_VA_START] = sizeof(va_start_expression_t),
347 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
348 [EXPR_VA_COPY] = sizeof(va_copy_expression_t),
349 [EXPR_STATEMENT] = sizeof(statement_expression_t),
350 [EXPR_LABEL_ADDRESS] = sizeof(label_address_expression_t),
352 if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
353 return sizes[EXPR_UNARY_FIRST];
355 if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
356 return sizes[EXPR_BINARY_FIRST];
358 assert((size_t)kind < lengthof(sizes));
359 assert(sizes[kind] != 0);
364 * Allocate a statement node of given kind and initialize all
365 * fields with zero. Sets its source position to the position
366 * of the current token.
368 static statement_t *allocate_statement_zero(statement_kind_t kind)
370 size_t size = get_statement_struct_size(kind);
371 statement_t *res = allocate_ast_zero(size);
373 res->base.kind = kind;
374 res->base.parent = current_parent;
375 res->base.source_position = token.base.source_position;
380 * Allocate an expression node of given kind and initialize all
383 * @param kind the kind of the expression to allocate
385 static expression_t *allocate_expression_zero(expression_kind_t kind)
387 size_t size = get_expression_struct_size(kind);
388 expression_t *res = allocate_ast_zero(size);
390 res->base.kind = kind;
391 res->base.type = type_error_type;
392 res->base.source_position = token.base.source_position;
397 * Creates a new invalid expression at the source position
398 * of the current token.
400 static expression_t *create_error_expression(void)
402 expression_t *expression = allocate_expression_zero(EXPR_ERROR);
403 expression->base.type = type_error_type;
408 * Creates a new invalid statement.
410 static statement_t *create_error_statement(void)
412 return allocate_statement_zero(STATEMENT_ERROR);
416 * Allocate a new empty statement.
418 static statement_t *create_empty_statement(void)
420 return allocate_statement_zero(STATEMENT_EMPTY);
424 * Returns the size of an initializer node.
426 * @param kind the initializer kind
428 static size_t get_initializer_size(initializer_kind_t kind)
430 static const size_t sizes[] = {
431 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
432 [INITIALIZER_STRING] = sizeof(initializer_string_t),
433 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
434 [INITIALIZER_LIST] = sizeof(initializer_list_t),
435 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
437 assert((size_t)kind < lengthof(sizes));
438 assert(sizes[kind] != 0);
443 * Allocate an initializer node of given kind and initialize all
446 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
448 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
455 * Returns the index of the top element of the environment stack.
457 static size_t environment_top(void)
459 return ARR_LEN(environment_stack);
463 * Returns the index of the top element of the global label stack.
465 static size_t label_top(void)
467 return ARR_LEN(label_stack);
471 * Return the next token.
473 static inline void next_token(void)
475 token = lookahead_buffer[lookahead_bufpos];
476 lookahead_buffer[lookahead_bufpos] = lexer_token;
479 lookahead_bufpos = (lookahead_bufpos + 1) % MAX_LOOKAHEAD;
482 print_token(stderr, &token);
483 fprintf(stderr, "\n");
487 static inline bool next_if(int const type)
489 if (token.kind == type) {
498 * Return the next token with a given lookahead.
500 static inline const token_t *look_ahead(size_t num)
502 assert(0 < num && num <= MAX_LOOKAHEAD);
503 size_t pos = (lookahead_bufpos + num - 1) % MAX_LOOKAHEAD;
504 return &lookahead_buffer[pos];
508 * Adds a token type to the token type anchor set (a multi-set).
510 static void add_anchor_token(int token_kind)
512 assert(0 <= token_kind && token_kind < T_LAST_TOKEN);
513 ++token_anchor_set[token_kind];
517 * Set the number of tokens types of the given type
518 * to zero and return the old count.
520 static int save_and_reset_anchor_state(int token_kind)
522 assert(0 <= token_kind && token_kind < T_LAST_TOKEN);
523 int count = token_anchor_set[token_kind];
524 token_anchor_set[token_kind] = 0;
529 * Restore the number of token types to the given count.
531 static void restore_anchor_state(int token_kind, int count)
533 assert(0 <= token_kind && token_kind < T_LAST_TOKEN);
534 token_anchor_set[token_kind] = count;
538 * Remove a token type from the token type anchor set (a multi-set).
540 static void rem_anchor_token(int token_kind)
542 assert(0 <= token_kind && token_kind < T_LAST_TOKEN);
543 assert(token_anchor_set[token_kind] != 0);
544 --token_anchor_set[token_kind];
548 * Return true if the token type of the current token is
551 static bool at_anchor(void)
555 return token_anchor_set[token.kind];
559 * Eat tokens until a matching token type is found.
561 static void eat_until_matching_token(int type)
565 case '(': end_token = ')'; break;
566 case '{': end_token = '}'; break;
567 case '[': end_token = ']'; break;
568 default: end_token = type; break;
571 unsigned parenthesis_count = 0;
572 unsigned brace_count = 0;
573 unsigned bracket_count = 0;
574 while (token.kind != end_token ||
575 parenthesis_count != 0 ||
577 bracket_count != 0) {
578 switch (token.kind) {
580 case '(': ++parenthesis_count; break;
581 case '{': ++brace_count; break;
582 case '[': ++bracket_count; break;
585 if (parenthesis_count > 0)
595 if (bracket_count > 0)
598 if (token.kind == end_token &&
599 parenthesis_count == 0 &&
613 * Eat input tokens until an anchor is found.
615 static void eat_until_anchor(void)
617 while (token_anchor_set[token.kind] == 0) {
618 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
619 eat_until_matching_token(token.kind);
625 * Eat a whole block from input tokens.
627 static void eat_block(void)
629 eat_until_matching_token('{');
633 #define eat(token_kind) (assert(token.kind == (token_kind)), next_token())
636 * Report a parse error because an expected token was not found.
639 #if defined __GNUC__ && __GNUC__ >= 4
640 __attribute__((sentinel))
642 void parse_error_expected(const char *message, ...)
644 if (message != NULL) {
645 errorf(HERE, "%s", message);
648 va_start(ap, message);
649 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
654 * Report an incompatible type.
656 static void type_error_incompatible(const char *msg,
657 const source_position_t *source_position, type_t *type1, type_t *type2)
659 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
664 * Expect the current token is the expected token.
665 * If not, generate an error, eat the current statement,
666 * and goto the error_label label.
668 #define expect(expected, error_label) \
670 if (UNLIKELY(token.kind != (expected))) { \
671 parse_error_expected(NULL, (expected), NULL); \
672 add_anchor_token(expected); \
673 eat_until_anchor(); \
674 rem_anchor_token(expected); \
675 if (token.kind != (expected)) \
682 * Push a given scope on the scope stack and make it the
685 static scope_t *scope_push(scope_t *new_scope)
687 if (current_scope != NULL) {
688 new_scope->depth = current_scope->depth + 1;
691 scope_t *old_scope = current_scope;
692 current_scope = new_scope;
697 * Pop the current scope from the scope stack.
699 static void scope_pop(scope_t *old_scope)
701 current_scope = old_scope;
705 * Search an entity by its symbol in a given namespace.
707 static entity_t *get_entity(const symbol_t *const symbol,
708 namespace_tag_t namespc)
710 entity_t *entity = symbol->entity;
711 for (; entity != NULL; entity = entity->base.symbol_next) {
712 if ((namespace_tag_t)entity->base.namespc == namespc)
719 /* §6.2.3:1 24) There is only one name space for tags even though three are
721 static entity_t *get_tag(symbol_t const *const symbol,
722 entity_kind_tag_t const kind)
724 entity_t *entity = get_entity(symbol, NAMESPACE_TAG);
725 if (entity != NULL && (entity_kind_tag_t)entity->kind != kind) {
727 "'%Y' defined as wrong kind of tag (previous definition %P)",
728 symbol, &entity->base.source_position);
735 * pushs an entity on the environment stack and links the corresponding symbol
738 static void stack_push(stack_entry_t **stack_ptr, entity_t *entity)
740 symbol_t *symbol = entity->base.symbol;
741 entity_namespace_t namespc = entity->base.namespc;
742 assert(namespc != 0);
744 /* replace/add entity into entity list of the symbol */
747 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
752 /* replace an entry? */
753 if (iter->base.namespc == namespc) {
754 entity->base.symbol_next = iter->base.symbol_next;
760 /* remember old declaration */
762 entry.symbol = symbol;
763 entry.old_entity = iter;
764 entry.namespc = namespc;
765 ARR_APP1(stack_entry_t, *stack_ptr, entry);
769 * Push an entity on the environment stack.
771 static void environment_push(entity_t *entity)
773 assert(entity->base.source_position.input_name != NULL);
774 assert(entity->base.parent_scope != NULL);
775 stack_push(&environment_stack, entity);
779 * Push a declaration on the global label stack.
781 * @param declaration the declaration
783 static void label_push(entity_t *label)
785 /* we abuse the parameters scope as parent for the labels */
786 label->base.parent_scope = ¤t_function->parameters;
787 stack_push(&label_stack, label);
791 * pops symbols from the environment stack until @p new_top is the top element
793 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
795 stack_entry_t *stack = *stack_ptr;
796 size_t top = ARR_LEN(stack);
799 assert(new_top <= top);
803 for (i = top; i > new_top; --i) {
804 stack_entry_t *entry = &stack[i - 1];
806 entity_t *old_entity = entry->old_entity;
807 symbol_t *symbol = entry->symbol;
808 entity_namespace_t namespc = entry->namespc;
810 /* replace with old_entity/remove */
813 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
815 assert(iter != NULL);
816 /* replace an entry? */
817 if (iter->base.namespc == namespc)
821 /* restore definition from outer scopes (if there was one) */
822 if (old_entity != NULL) {
823 old_entity->base.symbol_next = iter->base.symbol_next;
824 *anchor = old_entity;
826 /* remove entry from list */
827 *anchor = iter->base.symbol_next;
831 ARR_SHRINKLEN(*stack_ptr, new_top);
835 * Pop all entries from the environment stack until the new_top
838 * @param new_top the new stack top
840 static void environment_pop_to(size_t new_top)
842 stack_pop_to(&environment_stack, new_top);
846 * Pop all entries from the global label stack until the new_top
849 * @param new_top the new stack top
851 static void label_pop_to(size_t new_top)
853 stack_pop_to(&label_stack, new_top);
856 static int get_akind_rank(atomic_type_kind_t akind)
862 * Return the type rank for an atomic type.
864 static int get_rank(const type_t *type)
866 assert(!is_typeref(type));
867 if (type->kind == TYPE_ENUM)
868 return get_akind_rank(type->enumt.akind);
870 assert(type->kind == TYPE_ATOMIC);
871 return get_akind_rank(type->atomic.akind);
875 * §6.3.1.1:2 Do integer promotion for a given type.
877 * @param type the type to promote
878 * @return the promoted type
880 static type_t *promote_integer(type_t *type)
882 if (get_rank(type) < get_akind_rank(ATOMIC_TYPE_INT))
889 * Check if a given expression represents a null pointer constant.
891 * @param expression the expression to check
893 static bool is_null_pointer_constant(const expression_t *expression)
895 /* skip void* cast */
896 if (expression->kind == EXPR_UNARY_CAST) {
897 type_t *const type = skip_typeref(expression->base.type);
898 if (types_compatible(type, type_void_ptr))
899 expression = expression->unary.value;
902 type_t *const type = skip_typeref(expression->base.type);
903 if (!is_type_integer(type))
905 switch (is_constant_expression(expression)) {
906 case EXPR_CLASS_ERROR: return true;
907 case EXPR_CLASS_CONSTANT: return !fold_constant_to_bool(expression);
908 default: return false;
913 * Create an implicit cast expression.
915 * @param expression the expression to cast
916 * @param dest_type the destination type
918 static expression_t *create_implicit_cast(expression_t *expression,
921 type_t *const source_type = expression->base.type;
923 if (source_type == dest_type)
926 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
927 cast->unary.value = expression;
928 cast->base.type = dest_type;
929 cast->base.implicit = true;
934 typedef enum assign_error_t {
936 ASSIGN_ERROR_INCOMPATIBLE,
937 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
938 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
939 ASSIGN_WARNING_POINTER_FROM_INT,
940 ASSIGN_WARNING_INT_FROM_POINTER
943 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)
945 type_t *const orig_type_right = right->base.type;
946 type_t *const type_left = skip_typeref(orig_type_left);
947 type_t *const type_right = skip_typeref(orig_type_right);
952 case ASSIGN_ERROR_INCOMPATIBLE:
953 errorf(pos, "destination type '%T' in %s is incompatible with type '%T'", orig_type_left, context, orig_type_right);
956 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
957 type_t *points_to_left = skip_typeref(type_left->pointer.points_to);
958 type_t *points_to_right = skip_typeref(type_right->pointer.points_to);
960 /* the left type has all qualifiers from the right type */
961 unsigned missing_qualifiers = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
962 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);
966 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
967 warningf(WARN_OTHER, pos, "destination type '%T' in %s is incompatible with '%E' of type '%T'", orig_type_left, context, right, orig_type_right);
970 case ASSIGN_WARNING_POINTER_FROM_INT:
971 warningf(WARN_OTHER, pos, "%s makes pointer '%T' from integer '%T' without a cast", context, orig_type_left, orig_type_right);
974 case ASSIGN_WARNING_INT_FROM_POINTER:
975 warningf(WARN_OTHER, pos, "%s makes integer '%T' from pointer '%T' without a cast", context, orig_type_left, orig_type_right);
979 panic("invalid error value");
983 /** Implements the rules from §6.5.16.1 */
984 static assign_error_t semantic_assign(type_t *orig_type_left,
985 const expression_t *const right)
987 type_t *const orig_type_right = right->base.type;
988 type_t *const type_left = skip_typeref(orig_type_left);
989 type_t *const type_right = skip_typeref(orig_type_right);
991 if (is_type_pointer(type_left)) {
992 if (is_null_pointer_constant(right)) {
993 return ASSIGN_SUCCESS;
994 } else if (is_type_pointer(type_right)) {
995 type_t *points_to_left
996 = skip_typeref(type_left->pointer.points_to);
997 type_t *points_to_right
998 = skip_typeref(type_right->pointer.points_to);
999 assign_error_t res = ASSIGN_SUCCESS;
1001 /* the left type has all qualifiers from the right type */
1002 unsigned missing_qualifiers
1003 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1004 if (missing_qualifiers != 0) {
1005 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
1008 points_to_left = get_unqualified_type(points_to_left);
1009 points_to_right = get_unqualified_type(points_to_right);
1011 if (is_type_atomic(points_to_left, ATOMIC_TYPE_VOID))
1014 if (is_type_atomic(points_to_right, ATOMIC_TYPE_VOID)) {
1015 /* ISO/IEC 14882:1998(E) §C.1.2:6 */
1016 return c_mode & _CXX ? ASSIGN_ERROR_INCOMPATIBLE : res;
1019 if (!types_compatible(points_to_left, points_to_right)) {
1020 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
1024 } else if (is_type_integer(type_right)) {
1025 return ASSIGN_WARNING_POINTER_FROM_INT;
1027 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1028 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1029 && is_type_pointer(type_right))) {
1030 return ASSIGN_SUCCESS;
1031 } else if (is_type_compound(type_left) && is_type_compound(type_right)) {
1032 type_t *const unqual_type_left = get_unqualified_type(type_left);
1033 type_t *const unqual_type_right = get_unqualified_type(type_right);
1034 if (types_compatible(unqual_type_left, unqual_type_right)) {
1035 return ASSIGN_SUCCESS;
1037 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1038 return ASSIGN_WARNING_INT_FROM_POINTER;
1041 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1042 return ASSIGN_SUCCESS;
1044 return ASSIGN_ERROR_INCOMPATIBLE;
1047 static expression_t *parse_constant_expression(void)
1049 expression_t *result = parse_subexpression(PREC_CONDITIONAL);
1051 if (is_constant_expression(result) == EXPR_CLASS_VARIABLE) {
1052 errorf(&result->base.source_position,
1053 "expression '%E' is not constant", result);
1059 static expression_t *parse_assignment_expression(void)
1061 return parse_subexpression(PREC_ASSIGNMENT);
1064 static void warn_string_concat(const source_position_t *pos)
1066 warningf(WARN_TRADITIONAL, pos, "traditional C rejects string constant concatenation");
1069 static string_t parse_string_literals(void)
1071 assert(token.kind == T_STRING_LITERAL);
1072 string_t result = token.string.string;
1076 while (token.kind == T_STRING_LITERAL) {
1077 warn_string_concat(&token.base.source_position);
1078 result = concat_strings(&result, &token.string.string);
1086 * compare two string, ignoring double underscores on the second.
1088 static int strcmp_underscore(const char *s1, const char *s2)
1090 if (s2[0] == '_' && s2[1] == '_') {
1091 size_t len2 = strlen(s2);
1092 size_t len1 = strlen(s1);
1093 if (len1 == len2-4 && s2[len2-2] == '_' && s2[len2-1] == '_') {
1094 return strncmp(s1, s2+2, len2-4);
1098 return strcmp(s1, s2);
1101 static attribute_t *allocate_attribute_zero(attribute_kind_t kind)
1103 attribute_t *attribute = allocate_ast_zero(sizeof(*attribute));
1104 attribute->kind = kind;
1105 attribute->source_position = *HERE;
1110 * Parse (gcc) attribute argument. From gcc comments in gcc source:
1113 * __attribute__ ( ( attribute-list ) )
1117 * attribute_list , attrib
1122 * any-word ( identifier )
1123 * any-word ( identifier , nonempty-expr-list )
1124 * any-word ( expr-list )
1126 * where the "identifier" must not be declared as a type, and
1127 * "any-word" may be any identifier (including one declared as a
1128 * type), a reserved word storage class specifier, type specifier or
1129 * type qualifier. ??? This still leaves out most reserved keywords
1130 * (following the old parser), shouldn't we include them, and why not
1131 * allow identifiers declared as types to start the arguments?
1133 * Matze: this all looks confusing and little systematic, so we're even less
1134 * strict and parse any list of things which are identifiers or
1135 * (assignment-)expressions.
1137 static attribute_argument_t *parse_attribute_arguments(void)
1139 attribute_argument_t *first = NULL;
1140 attribute_argument_t **anchor = &first;
1141 if (token.kind != ')') do {
1142 attribute_argument_t *argument = allocate_ast_zero(sizeof(*argument));
1144 /* is it an identifier */
1145 if (token.kind == T_IDENTIFIER
1146 && (look_ahead(1)->kind == ',' || look_ahead(1)->kind == ')')) {
1147 symbol_t *symbol = token.identifier.symbol;
1148 argument->kind = ATTRIBUTE_ARGUMENT_SYMBOL;
1149 argument->v.symbol = symbol;
1152 /* must be an expression */
1153 expression_t *expression = parse_assignment_expression();
1155 argument->kind = ATTRIBUTE_ARGUMENT_EXPRESSION;
1156 argument->v.expression = expression;
1159 /* append argument */
1161 anchor = &argument->next;
1162 } while (next_if(','));
1163 expect(')', end_error);
1172 static attribute_t *parse_attribute_asm(void)
1174 attribute_t *attribute = allocate_attribute_zero(ATTRIBUTE_GNU_ASM);
1177 expect('(', end_error);
1178 attribute->a.arguments = parse_attribute_arguments();
1185 static symbol_t *get_symbol_from_token(void)
1187 switch(token.kind) {
1189 return token.identifier.symbol;
1218 /* maybe we need more tokens ... add them on demand */
1219 return get_token_kind_symbol(token.kind);
1225 static attribute_t *parse_attribute_gnu_single(void)
1227 /* parse "any-word" */
1228 symbol_t *symbol = get_symbol_from_token();
1229 if (symbol == NULL) {
1230 parse_error_expected("while parsing attribute((", T_IDENTIFIER, NULL);
1234 attribute_kind_t kind;
1235 char const *const name = symbol->string;
1236 for (kind = ATTRIBUTE_GNU_FIRST;; ++kind) {
1237 if (kind > ATTRIBUTE_GNU_LAST) {
1238 warningf(WARN_ATTRIBUTE, HERE, "unknown attribute '%s' ignored", name);
1239 /* TODO: we should still save the attribute in the list... */
1240 kind = ATTRIBUTE_UNKNOWN;
1244 const char *attribute_name = get_attribute_name(kind);
1245 if (attribute_name != NULL
1246 && strcmp_underscore(attribute_name, name) == 0)
1250 attribute_t *attribute = allocate_attribute_zero(kind);
1253 /* parse arguments */
1255 attribute->a.arguments = parse_attribute_arguments();
1260 static attribute_t *parse_attribute_gnu(void)
1262 attribute_t *first = NULL;
1263 attribute_t **anchor = &first;
1265 eat(T___attribute__);
1266 expect('(', end_error);
1267 expect('(', end_error);
1269 if (token.kind != ')') do {
1270 attribute_t *attribute = parse_attribute_gnu_single();
1271 if (attribute == NULL)
1274 *anchor = attribute;
1275 anchor = &attribute->next;
1276 } while (next_if(','));
1277 expect(')', end_error);
1278 expect(')', end_error);
1284 /** Parse attributes. */
1285 static attribute_t *parse_attributes(attribute_t *first)
1287 attribute_t **anchor = &first;
1289 while (*anchor != NULL)
1290 anchor = &(*anchor)->next;
1292 attribute_t *attribute;
1293 switch (token.kind) {
1294 case T___attribute__:
1295 attribute = parse_attribute_gnu();
1296 if (attribute == NULL)
1301 attribute = parse_attribute_asm();
1305 attribute = allocate_attribute_zero(ATTRIBUTE_MS_CDECL);
1310 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FASTCALL);
1314 case T__forceinline:
1315 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FORCEINLINE);
1316 eat(T__forceinline);
1320 attribute = allocate_attribute_zero(ATTRIBUTE_MS_STDCALL);
1325 /* TODO record modifier */
1326 warningf(WARN_OTHER, HERE, "Ignoring declaration modifier %K", &token);
1327 attribute = allocate_attribute_zero(ATTRIBUTE_MS_THISCALL);
1335 *anchor = attribute;
1336 anchor = &attribute->next;
1340 static void mark_vars_read(expression_t *expr, entity_t *lhs_ent);
1342 static entity_t *determine_lhs_ent(expression_t *const expr,
1345 switch (expr->kind) {
1346 case EXPR_REFERENCE: {
1347 entity_t *const entity = expr->reference.entity;
1348 /* we should only find variables as lvalues... */
1349 if (entity->base.kind != ENTITY_VARIABLE
1350 && entity->base.kind != ENTITY_PARAMETER)
1356 case EXPR_ARRAY_ACCESS: {
1357 expression_t *const ref = expr->array_access.array_ref;
1358 entity_t * ent = NULL;
1359 if (is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1360 ent = determine_lhs_ent(ref, lhs_ent);
1363 mark_vars_read(expr->select.compound, lhs_ent);
1365 mark_vars_read(expr->array_access.index, lhs_ent);
1370 if (is_type_compound(skip_typeref(expr->base.type))) {
1371 return determine_lhs_ent(expr->select.compound, lhs_ent);
1373 mark_vars_read(expr->select.compound, lhs_ent);
1378 case EXPR_UNARY_DEREFERENCE: {
1379 expression_t *const val = expr->unary.value;
1380 if (val->kind == EXPR_UNARY_TAKE_ADDRESS) {
1382 return determine_lhs_ent(val->unary.value, lhs_ent);
1384 mark_vars_read(val, NULL);
1390 mark_vars_read(expr, NULL);
1395 #define ENT_ANY ((entity_t*)-1)
1398 * Mark declarations, which are read. This is used to detect variables, which
1402 * x is not marked as "read", because it is only read to calculate its own new
1406 * x and y are not detected as "not read", because multiple variables are
1409 static void mark_vars_read(expression_t *const expr, entity_t *lhs_ent)
1411 switch (expr->kind) {
1412 case EXPR_REFERENCE: {
1413 entity_t *const entity = expr->reference.entity;
1414 if (entity->kind != ENTITY_VARIABLE
1415 && entity->kind != ENTITY_PARAMETER)
1418 if (lhs_ent != entity && lhs_ent != ENT_ANY) {
1419 if (entity->kind == ENTITY_VARIABLE) {
1420 entity->variable.read = true;
1422 entity->parameter.read = true;
1429 // TODO respect pure/const
1430 mark_vars_read(expr->call.function, NULL);
1431 for (call_argument_t *arg = expr->call.arguments; arg != NULL; arg = arg->next) {
1432 mark_vars_read(arg->expression, NULL);
1436 case EXPR_CONDITIONAL:
1437 // TODO lhs_decl should depend on whether true/false have an effect
1438 mark_vars_read(expr->conditional.condition, NULL);
1439 if (expr->conditional.true_expression != NULL)
1440 mark_vars_read(expr->conditional.true_expression, lhs_ent);
1441 mark_vars_read(expr->conditional.false_expression, lhs_ent);
1445 if (lhs_ent == ENT_ANY
1446 && !is_type_compound(skip_typeref(expr->base.type)))
1448 mark_vars_read(expr->select.compound, lhs_ent);
1451 case EXPR_ARRAY_ACCESS: {
1452 expression_t *const ref = expr->array_access.array_ref;
1453 mark_vars_read(ref, lhs_ent);
1454 lhs_ent = determine_lhs_ent(ref, lhs_ent);
1455 mark_vars_read(expr->array_access.index, lhs_ent);
1460 mark_vars_read(expr->va_arge.ap, lhs_ent);
1464 mark_vars_read(expr->va_copye.src, lhs_ent);
1467 case EXPR_UNARY_CAST:
1468 /* Special case: Use void cast to mark a variable as "read" */
1469 if (is_type_atomic(skip_typeref(expr->base.type), ATOMIC_TYPE_VOID))
1474 case EXPR_UNARY_THROW:
1475 if (expr->unary.value == NULL)
1478 case EXPR_UNARY_DEREFERENCE:
1479 case EXPR_UNARY_DELETE:
1480 case EXPR_UNARY_DELETE_ARRAY:
1481 if (lhs_ent == ENT_ANY)
1485 case EXPR_UNARY_NEGATE:
1486 case EXPR_UNARY_PLUS:
1487 case EXPR_UNARY_BITWISE_NEGATE:
1488 case EXPR_UNARY_NOT:
1489 case EXPR_UNARY_TAKE_ADDRESS:
1490 case EXPR_UNARY_POSTFIX_INCREMENT:
1491 case EXPR_UNARY_POSTFIX_DECREMENT:
1492 case EXPR_UNARY_PREFIX_INCREMENT:
1493 case EXPR_UNARY_PREFIX_DECREMENT:
1494 case EXPR_UNARY_ASSUME:
1496 mark_vars_read(expr->unary.value, lhs_ent);
1499 case EXPR_BINARY_ADD:
1500 case EXPR_BINARY_SUB:
1501 case EXPR_BINARY_MUL:
1502 case EXPR_BINARY_DIV:
1503 case EXPR_BINARY_MOD:
1504 case EXPR_BINARY_EQUAL:
1505 case EXPR_BINARY_NOTEQUAL:
1506 case EXPR_BINARY_LESS:
1507 case EXPR_BINARY_LESSEQUAL:
1508 case EXPR_BINARY_GREATER:
1509 case EXPR_BINARY_GREATEREQUAL:
1510 case EXPR_BINARY_BITWISE_AND:
1511 case EXPR_BINARY_BITWISE_OR:
1512 case EXPR_BINARY_BITWISE_XOR:
1513 case EXPR_BINARY_LOGICAL_AND:
1514 case EXPR_BINARY_LOGICAL_OR:
1515 case EXPR_BINARY_SHIFTLEFT:
1516 case EXPR_BINARY_SHIFTRIGHT:
1517 case EXPR_BINARY_COMMA:
1518 case EXPR_BINARY_ISGREATER:
1519 case EXPR_BINARY_ISGREATEREQUAL:
1520 case EXPR_BINARY_ISLESS:
1521 case EXPR_BINARY_ISLESSEQUAL:
1522 case EXPR_BINARY_ISLESSGREATER:
1523 case EXPR_BINARY_ISUNORDERED:
1524 mark_vars_read(expr->binary.left, lhs_ent);
1525 mark_vars_read(expr->binary.right, lhs_ent);
1528 case EXPR_BINARY_ASSIGN:
1529 case EXPR_BINARY_MUL_ASSIGN:
1530 case EXPR_BINARY_DIV_ASSIGN:
1531 case EXPR_BINARY_MOD_ASSIGN:
1532 case EXPR_BINARY_ADD_ASSIGN:
1533 case EXPR_BINARY_SUB_ASSIGN:
1534 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
1535 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
1536 case EXPR_BINARY_BITWISE_AND_ASSIGN:
1537 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
1538 case EXPR_BINARY_BITWISE_OR_ASSIGN: {
1539 if (lhs_ent == ENT_ANY)
1541 lhs_ent = determine_lhs_ent(expr->binary.left, lhs_ent);
1542 mark_vars_read(expr->binary.right, lhs_ent);
1547 determine_lhs_ent(expr->va_starte.ap, lhs_ent);
1552 case EXPR_STRING_LITERAL:
1553 case EXPR_WIDE_STRING_LITERAL:
1554 case EXPR_COMPOUND_LITERAL: // TODO init?
1556 case EXPR_CLASSIFY_TYPE:
1559 case EXPR_BUILTIN_CONSTANT_P:
1560 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
1562 case EXPR_STATEMENT: // TODO
1563 case EXPR_LABEL_ADDRESS:
1564 case EXPR_REFERENCE_ENUM_VALUE:
1568 panic("unhandled expression");
1571 static designator_t *parse_designation(void)
1573 designator_t *result = NULL;
1574 designator_t **anchor = &result;
1577 designator_t *designator;
1578 switch (token.kind) {
1580 designator = allocate_ast_zero(sizeof(designator[0]));
1581 designator->source_position = token.base.source_position;
1583 add_anchor_token(']');
1584 designator->array_index = parse_constant_expression();
1585 rem_anchor_token(']');
1586 expect(']', end_error);
1589 designator = allocate_ast_zero(sizeof(designator[0]));
1590 designator->source_position = token.base.source_position;
1592 if (token.kind != T_IDENTIFIER) {
1593 parse_error_expected("while parsing designator",
1594 T_IDENTIFIER, NULL);
1597 designator->symbol = token.identifier.symbol;
1601 expect('=', end_error);
1605 assert(designator != NULL);
1606 *anchor = designator;
1607 anchor = &designator->next;
1613 static initializer_t *initializer_from_string(array_type_t *const type,
1614 const string_t *const string)
1616 /* TODO: check len vs. size of array type */
1619 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
1620 initializer->string.string = *string;
1625 static initializer_t *initializer_from_wide_string(array_type_t *const type,
1626 const string_t *const string)
1628 /* TODO: check len vs. size of array type */
1631 initializer_t *const initializer =
1632 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
1633 initializer->wide_string.string = *string;
1639 * Build an initializer from a given expression.
1641 static initializer_t *initializer_from_expression(type_t *orig_type,
1642 expression_t *expression)
1644 /* TODO check that expression is a constant expression */
1646 /* §6.7.8.14/15 char array may be initialized by string literals */
1647 type_t *type = skip_typeref(orig_type);
1648 type_t *expr_type_orig = expression->base.type;
1649 type_t *expr_type = skip_typeref(expr_type_orig);
1651 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
1652 array_type_t *const array_type = &type->array;
1653 type_t *const element_type = skip_typeref(array_type->element_type);
1655 if (element_type->kind == TYPE_ATOMIC) {
1656 atomic_type_kind_t akind = element_type->atomic.akind;
1657 switch (expression->kind) {
1658 case EXPR_STRING_LITERAL:
1659 if (akind == ATOMIC_TYPE_CHAR
1660 || akind == ATOMIC_TYPE_SCHAR
1661 || akind == ATOMIC_TYPE_UCHAR) {
1662 return initializer_from_string(array_type,
1663 &expression->string_literal.value);
1667 case EXPR_WIDE_STRING_LITERAL: {
1668 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
1669 if (get_unqualified_type(element_type) == bare_wchar_type) {
1670 return initializer_from_wide_string(array_type,
1671 &expression->string_literal.value);
1682 assign_error_t error = semantic_assign(type, expression);
1683 if (error == ASSIGN_ERROR_INCOMPATIBLE)
1685 report_assign_error(error, type, expression, "initializer",
1686 &expression->base.source_position);
1688 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
1689 result->value.value = create_implicit_cast(expression, type);
1695 * Checks if a given expression can be used as a constant initializer.
1697 static bool is_initializer_constant(const expression_t *expression)
1699 return is_constant_expression(expression) != EXPR_CLASS_VARIABLE ||
1700 is_linker_constant(expression) != EXPR_CLASS_VARIABLE;
1704 * Parses an scalar initializer.
1706 * §6.7.8.11; eat {} without warning
1708 static initializer_t *parse_scalar_initializer(type_t *type,
1709 bool must_be_constant)
1711 /* there might be extra {} hierarchies */
1713 if (token.kind == '{') {
1714 warningf(WARN_OTHER, HERE, "extra curly braces around scalar initializer");
1718 } while (token.kind == '{');
1721 expression_t *expression = parse_assignment_expression();
1722 mark_vars_read(expression, NULL);
1723 if (must_be_constant && !is_initializer_constant(expression)) {
1724 errorf(&expression->base.source_position,
1725 "initialisation expression '%E' is not constant",
1729 initializer_t *initializer = initializer_from_expression(type, expression);
1731 if (initializer == NULL) {
1732 errorf(&expression->base.source_position,
1733 "expression '%E' (type '%T') doesn't match expected type '%T'",
1734 expression, expression->base.type, type);
1739 bool additional_warning_displayed = false;
1740 while (braces > 0) {
1742 if (token.kind != '}') {
1743 if (!additional_warning_displayed) {
1744 warningf(WARN_OTHER, HERE, "additional elements in scalar initializer");
1745 additional_warning_displayed = true;
1756 * An entry in the type path.
1758 typedef struct type_path_entry_t type_path_entry_t;
1759 struct type_path_entry_t {
1760 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
1762 size_t index; /**< For array types: the current index. */
1763 declaration_t *compound_entry; /**< For compound types: the current declaration. */
1768 * A type path expression a position inside compound or array types.
1770 typedef struct type_path_t type_path_t;
1771 struct type_path_t {
1772 type_path_entry_t *path; /**< An flexible array containing the current path. */
1773 type_t *top_type; /**< type of the element the path points */
1774 size_t max_index; /**< largest index in outermost array */
1778 * Prints a type path for debugging.
1780 static __attribute__((unused)) void debug_print_type_path(
1781 const type_path_t *path)
1783 size_t len = ARR_LEN(path->path);
1785 for (size_t i = 0; i < len; ++i) {
1786 const type_path_entry_t *entry = & path->path[i];
1788 type_t *type = skip_typeref(entry->type);
1789 if (is_type_compound(type)) {
1790 /* in gcc mode structs can have no members */
1791 if (entry->v.compound_entry == NULL) {
1795 fprintf(stderr, ".%s",
1796 entry->v.compound_entry->base.symbol->string);
1797 } else if (is_type_array(type)) {
1798 fprintf(stderr, "[%u]", (unsigned) entry->v.index);
1800 fprintf(stderr, "-INVALID-");
1803 if (path->top_type != NULL) {
1804 fprintf(stderr, " (");
1805 print_type(path->top_type);
1806 fprintf(stderr, ")");
1811 * Return the top type path entry, ie. in a path
1812 * (type).a.b returns the b.
1814 static type_path_entry_t *get_type_path_top(const type_path_t *path)
1816 size_t len = ARR_LEN(path->path);
1818 return &path->path[len-1];
1822 * Enlarge the type path by an (empty) element.
1824 static type_path_entry_t *append_to_type_path(type_path_t *path)
1826 size_t len = ARR_LEN(path->path);
1827 ARR_RESIZE(type_path_entry_t, path->path, len+1);
1829 type_path_entry_t *result = & path->path[len];
1830 memset(result, 0, sizeof(result[0]));
1835 * Descending into a sub-type. Enter the scope of the current top_type.
1837 static void descend_into_subtype(type_path_t *path)
1839 type_t *orig_top_type = path->top_type;
1840 type_t *top_type = skip_typeref(orig_top_type);
1842 type_path_entry_t *top = append_to_type_path(path);
1843 top->type = top_type;
1845 if (is_type_compound(top_type)) {
1846 compound_t *compound = top_type->compound.compound;
1847 entity_t *entry = compound->members.entities;
1849 if (entry != NULL) {
1850 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
1851 top->v.compound_entry = &entry->declaration;
1852 path->top_type = entry->declaration.type;
1854 path->top_type = NULL;
1856 } else if (is_type_array(top_type)) {
1858 path->top_type = top_type->array.element_type;
1860 assert(!is_type_valid(top_type));
1865 * Pop an entry from the given type path, ie. returning from
1866 * (type).a.b to (type).a
1868 static void ascend_from_subtype(type_path_t *path)
1870 type_path_entry_t *top = get_type_path_top(path);
1872 path->top_type = top->type;
1874 size_t len = ARR_LEN(path->path);
1875 ARR_RESIZE(type_path_entry_t, path->path, len-1);
1879 * Pop entries from the given type path until the given
1880 * path level is reached.
1882 static void ascend_to(type_path_t *path, size_t top_path_level)
1884 size_t len = ARR_LEN(path->path);
1886 while (len > top_path_level) {
1887 ascend_from_subtype(path);
1888 len = ARR_LEN(path->path);
1892 static bool walk_designator(type_path_t *path, const designator_t *designator,
1893 bool used_in_offsetof)
1895 for (; designator != NULL; designator = designator->next) {
1896 type_path_entry_t *top = get_type_path_top(path);
1897 type_t *orig_type = top->type;
1899 type_t *type = skip_typeref(orig_type);
1901 if (designator->symbol != NULL) {
1902 symbol_t *symbol = designator->symbol;
1903 if (!is_type_compound(type)) {
1904 if (is_type_valid(type)) {
1905 errorf(&designator->source_position,
1906 "'.%Y' designator used for non-compound type '%T'",
1910 top->type = type_error_type;
1911 top->v.compound_entry = NULL;
1912 orig_type = type_error_type;
1914 compound_t *compound = type->compound.compound;
1915 entity_t *iter = compound->members.entities;
1916 for (; iter != NULL; iter = iter->base.next) {
1917 if (iter->base.symbol == symbol) {
1922 errorf(&designator->source_position,
1923 "'%T' has no member named '%Y'", orig_type, symbol);
1926 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
1927 if (used_in_offsetof && iter->compound_member.bitfield) {
1928 errorf(&designator->source_position,
1929 "offsetof designator '%Y' must not specify bitfield",
1934 top->type = orig_type;
1935 top->v.compound_entry = &iter->declaration;
1936 orig_type = iter->declaration.type;
1939 expression_t *array_index = designator->array_index;
1940 assert(designator->array_index != NULL);
1942 if (!is_type_array(type)) {
1943 if (is_type_valid(type)) {
1944 errorf(&designator->source_position,
1945 "[%E] designator used for non-array type '%T'",
1946 array_index, orig_type);
1951 long index = fold_constant_to_int(array_index);
1952 if (!used_in_offsetof) {
1954 errorf(&designator->source_position,
1955 "array index [%E] must be positive", array_index);
1956 } else if (type->array.size_constant) {
1957 long array_size = type->array.size;
1958 if (index >= array_size) {
1959 errorf(&designator->source_position,
1960 "designator [%E] (%d) exceeds array size %d",
1961 array_index, index, array_size);
1966 top->type = orig_type;
1967 top->v.index = (size_t) index;
1968 orig_type = type->array.element_type;
1970 path->top_type = orig_type;
1972 if (designator->next != NULL) {
1973 descend_into_subtype(path);
1979 static void advance_current_object(type_path_t *path, size_t top_path_level)
1981 type_path_entry_t *top = get_type_path_top(path);
1983 type_t *type = skip_typeref(top->type);
1984 if (is_type_union(type)) {
1985 /* in unions only the first element is initialized */
1986 top->v.compound_entry = NULL;
1987 } else if (is_type_struct(type)) {
1988 declaration_t *entry = top->v.compound_entry;
1990 entity_t *next_entity = entry->base.next;
1991 if (next_entity != NULL) {
1992 assert(is_declaration(next_entity));
1993 entry = &next_entity->declaration;
1998 top->v.compound_entry = entry;
1999 if (entry != NULL) {
2000 path->top_type = entry->type;
2003 } else if (is_type_array(type)) {
2004 assert(is_type_array(type));
2008 if (!type->array.size_constant || top->v.index < type->array.size) {
2012 assert(!is_type_valid(type));
2016 /* we're past the last member of the current sub-aggregate, try if we
2017 * can ascend in the type hierarchy and continue with another subobject */
2018 size_t len = ARR_LEN(path->path);
2020 if (len > top_path_level) {
2021 ascend_from_subtype(path);
2022 advance_current_object(path, top_path_level);
2024 path->top_type = NULL;
2029 * skip any {...} blocks until a closing bracket is reached.
2031 static void skip_initializers(void)
2035 while (token.kind != '}') {
2036 if (token.kind == T_EOF)
2038 if (token.kind == '{') {
2046 static initializer_t *create_empty_initializer(void)
2048 static initializer_t empty_initializer
2049 = { .list = { { INITIALIZER_LIST }, 0 } };
2050 return &empty_initializer;
2054 * Parse a part of an initialiser for a struct or union,
2056 static initializer_t *parse_sub_initializer(type_path_t *path,
2057 type_t *outer_type, size_t top_path_level,
2058 parse_initializer_env_t *env)
2060 if (token.kind == '}') {
2061 /* empty initializer */
2062 return create_empty_initializer();
2065 type_t *orig_type = path->top_type;
2066 type_t *type = NULL;
2068 if (orig_type == NULL) {
2069 /* We are initializing an empty compound. */
2071 type = skip_typeref(orig_type);
2074 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2077 designator_t *designator = NULL;
2078 if (token.kind == '.' || token.kind == '[') {
2079 designator = parse_designation();
2080 goto finish_designator;
2081 } else if (token.kind == T_IDENTIFIER && look_ahead(1)->kind == ':') {
2082 /* GNU-style designator ("identifier: value") */
2083 designator = allocate_ast_zero(sizeof(designator[0]));
2084 designator->source_position = token.base.source_position;
2085 designator->symbol = token.identifier.symbol;
2090 /* reset path to toplevel, evaluate designator from there */
2091 ascend_to(path, top_path_level);
2092 if (!walk_designator(path, designator, false)) {
2093 /* can't continue after designation error */
2097 initializer_t *designator_initializer
2098 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2099 designator_initializer->designator.designator = designator;
2100 ARR_APP1(initializer_t*, initializers, designator_initializer);
2102 orig_type = path->top_type;
2103 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2108 if (token.kind == '{') {
2109 if (type != NULL && is_type_scalar(type)) {
2110 sub = parse_scalar_initializer(type, env->must_be_constant);
2113 if (env->entity != NULL) {
2115 "extra brace group at end of initializer for '%Y'",
2116 env->entity->base.symbol);
2118 errorf(HERE, "extra brace group at end of initializer");
2123 descend_into_subtype(path);
2126 add_anchor_token('}');
2127 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2129 rem_anchor_token('}');
2132 ascend_from_subtype(path);
2133 expect('}', end_error);
2135 expect('}', end_error);
2136 goto error_parse_next;
2140 /* must be an expression */
2141 expression_t *expression = parse_assignment_expression();
2142 mark_vars_read(expression, NULL);
2144 if (env->must_be_constant && !is_initializer_constant(expression)) {
2145 errorf(&expression->base.source_position,
2146 "Initialisation expression '%E' is not constant",
2151 /* we are already outside, ... */
2152 if (outer_type == NULL)
2153 goto error_parse_next;
2154 type_t *const outer_type_skip = skip_typeref(outer_type);
2155 if (is_type_compound(outer_type_skip) &&
2156 !outer_type_skip->compound.compound->complete) {
2157 goto error_parse_next;
2160 source_position_t const* const pos = &expression->base.source_position;
2161 if (env->entity != NULL) {
2162 warningf(WARN_OTHER, pos, "excess elements in initializer for '%Y'", env->entity->base.symbol);
2164 warningf(WARN_OTHER, pos, "excess elements in initializer");
2166 goto error_parse_next;
2169 /* handle { "string" } special case */
2170 if ((expression->kind == EXPR_STRING_LITERAL
2171 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2172 && outer_type != NULL) {
2173 sub = initializer_from_expression(outer_type, expression);
2176 if (token.kind != '}') {
2177 warningf(WARN_OTHER, HERE, "excessive elements in initializer for type '%T'", orig_type);
2179 /* TODO: eat , ... */
2184 /* descend into subtypes until expression matches type */
2186 orig_type = path->top_type;
2187 type = skip_typeref(orig_type);
2189 sub = initializer_from_expression(orig_type, expression);
2193 if (!is_type_valid(type)) {
2196 if (is_type_scalar(type)) {
2197 errorf(&expression->base.source_position,
2198 "expression '%E' doesn't match expected type '%T'",
2199 expression, orig_type);
2203 descend_into_subtype(path);
2207 /* update largest index of top array */
2208 const type_path_entry_t *first = &path->path[0];
2209 type_t *first_type = first->type;
2210 first_type = skip_typeref(first_type);
2211 if (is_type_array(first_type)) {
2212 size_t index = first->v.index;
2213 if (index > path->max_index)
2214 path->max_index = index;
2217 /* append to initializers list */
2218 ARR_APP1(initializer_t*, initializers, sub);
2221 if (token.kind == '}') {
2224 expect(',', end_error);
2225 if (token.kind == '}') {
2230 /* advance to the next declaration if we are not at the end */
2231 advance_current_object(path, top_path_level);
2232 orig_type = path->top_type;
2233 if (orig_type != NULL)
2234 type = skip_typeref(orig_type);
2240 size_t len = ARR_LEN(initializers);
2241 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2242 initializer_t *result = allocate_ast_zero(size);
2243 result->kind = INITIALIZER_LIST;
2244 result->list.len = len;
2245 memcpy(&result->list.initializers, initializers,
2246 len * sizeof(initializers[0]));
2248 DEL_ARR_F(initializers);
2249 ascend_to(path, top_path_level+1);
2254 skip_initializers();
2255 DEL_ARR_F(initializers);
2256 ascend_to(path, top_path_level+1);
2260 static expression_t *make_size_literal(size_t value)
2262 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_INTEGER);
2263 literal->base.type = type_size_t;
2266 snprintf(buf, sizeof(buf), "%u", (unsigned) value);
2267 literal->literal.value = make_string(buf);
2273 * Parses an initializer. Parsers either a compound literal
2274 * (env->declaration == NULL) or an initializer of a declaration.
2276 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2278 type_t *type = skip_typeref(env->type);
2279 size_t max_index = 0;
2280 initializer_t *result;
2282 if (is_type_scalar(type)) {
2283 result = parse_scalar_initializer(type, env->must_be_constant);
2284 } else if (token.kind == '{') {
2288 memset(&path, 0, sizeof(path));
2289 path.top_type = env->type;
2290 path.path = NEW_ARR_F(type_path_entry_t, 0);
2292 descend_into_subtype(&path);
2294 add_anchor_token('}');
2295 result = parse_sub_initializer(&path, env->type, 1, env);
2296 rem_anchor_token('}');
2298 max_index = path.max_index;
2299 DEL_ARR_F(path.path);
2301 expect('}', end_error);
2304 /* parse_scalar_initializer() also works in this case: we simply
2305 * have an expression without {} around it */
2306 result = parse_scalar_initializer(type, env->must_be_constant);
2309 /* §6.7.8:22 array initializers for arrays with unknown size determine
2310 * the array type size */
2311 if (is_type_array(type) && type->array.size_expression == NULL
2312 && result != NULL) {
2314 switch (result->kind) {
2315 case INITIALIZER_LIST:
2316 assert(max_index != 0xdeadbeaf);
2317 size = max_index + 1;
2320 case INITIALIZER_STRING:
2321 size = result->string.string.size;
2324 case INITIALIZER_WIDE_STRING:
2325 size = result->wide_string.string.size;
2328 case INITIALIZER_DESIGNATOR:
2329 case INITIALIZER_VALUE:
2330 /* can happen for parse errors */
2335 internal_errorf(HERE, "invalid initializer type");
2338 type_t *new_type = duplicate_type(type);
2340 new_type->array.size_expression = make_size_literal(size);
2341 new_type->array.size_constant = true;
2342 new_type->array.has_implicit_size = true;
2343 new_type->array.size = size;
2344 env->type = new_type;
2350 static void append_entity(scope_t *scope, entity_t *entity)
2352 if (scope->last_entity != NULL) {
2353 scope->last_entity->base.next = entity;
2355 scope->entities = entity;
2357 entity->base.parent_entity = current_entity;
2358 scope->last_entity = entity;
2362 static compound_t *parse_compound_type_specifier(bool is_struct)
2364 source_position_t const pos = *HERE;
2365 eat(is_struct ? T_struct : T_union);
2367 symbol_t *symbol = NULL;
2368 entity_t *entity = NULL;
2369 attribute_t *attributes = NULL;
2371 if (token.kind == T___attribute__) {
2372 attributes = parse_attributes(NULL);
2375 entity_kind_tag_t const kind = is_struct ? ENTITY_STRUCT : ENTITY_UNION;
2376 if (token.kind == T_IDENTIFIER) {
2377 /* the compound has a name, check if we have seen it already */
2378 symbol = token.identifier.symbol;
2379 entity = get_tag(symbol, kind);
2382 if (entity != NULL) {
2383 if (entity->base.parent_scope != current_scope &&
2384 (token.kind == '{' || token.kind == ';')) {
2385 /* we're in an inner scope and have a definition. Shadow
2386 * existing definition in outer scope */
2388 } else if (entity->compound.complete && token.kind == '{') {
2389 source_position_t const *const ppos = &entity->base.source_position;
2390 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2391 /* clear members in the hope to avoid further errors */
2392 entity->compound.members.entities = NULL;
2395 } else if (token.kind != '{') {
2396 char const *const msg =
2397 is_struct ? "while parsing struct type specifier" :
2398 "while parsing union type specifier";
2399 parse_error_expected(msg, T_IDENTIFIER, '{', NULL);
2404 if (entity == NULL) {
2405 entity = allocate_entity_zero(kind, NAMESPACE_TAG, symbol);
2406 entity->compound.alignment = 1;
2407 entity->base.source_position = pos;
2408 entity->base.parent_scope = current_scope;
2409 if (symbol != NULL) {
2410 environment_push(entity);
2412 append_entity(current_scope, entity);
2415 if (token.kind == '{') {
2416 parse_compound_type_entries(&entity->compound);
2418 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2419 if (symbol == NULL) {
2420 assert(anonymous_entity == NULL);
2421 anonymous_entity = entity;
2425 if (attributes != NULL) {
2426 handle_entity_attributes(attributes, entity);
2429 return &entity->compound;
2432 static void parse_enum_entries(type_t *const enum_type)
2436 if (token.kind == '}') {
2437 errorf(HERE, "empty enum not allowed");
2442 add_anchor_token('}');
2444 if (token.kind != T_IDENTIFIER) {
2445 parse_error_expected("while parsing enum entry", T_IDENTIFIER, NULL);
2447 rem_anchor_token('}');
2451 symbol_t *symbol = token.identifier.symbol;
2452 entity_t *const entity
2453 = allocate_entity_zero(ENTITY_ENUM_VALUE, NAMESPACE_NORMAL, symbol);
2454 entity->enum_value.enum_type = enum_type;
2455 entity->base.source_position = token.base.source_position;
2459 expression_t *value = parse_constant_expression();
2461 value = create_implicit_cast(value, enum_type);
2462 entity->enum_value.value = value;
2467 record_entity(entity, false);
2468 } while (next_if(',') && token.kind != '}');
2469 rem_anchor_token('}');
2471 expect('}', end_error);
2477 static type_t *parse_enum_specifier(void)
2479 source_position_t const pos = *HERE;
2484 switch (token.kind) {
2486 symbol = token.identifier.symbol;
2487 entity = get_tag(symbol, ENTITY_ENUM);
2490 if (entity != NULL) {
2491 if (entity->base.parent_scope != current_scope &&
2492 (token.kind == '{' || token.kind == ';')) {
2493 /* we're in an inner scope and have a definition. Shadow
2494 * existing definition in outer scope */
2496 } else if (entity->enume.complete && token.kind == '{') {
2497 source_position_t const *const ppos = &entity->base.source_position;
2498 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2509 parse_error_expected("while parsing enum type specifier",
2510 T_IDENTIFIER, '{', NULL);
2514 if (entity == NULL) {
2515 entity = allocate_entity_zero(ENTITY_ENUM, NAMESPACE_TAG, symbol);
2516 entity->base.source_position = pos;
2517 entity->base.parent_scope = current_scope;
2520 type_t *const type = allocate_type_zero(TYPE_ENUM);
2521 type->enumt.enume = &entity->enume;
2522 type->enumt.akind = ATOMIC_TYPE_INT;
2524 if (token.kind == '{') {
2525 if (symbol != NULL) {
2526 environment_push(entity);
2528 append_entity(current_scope, entity);
2529 entity->enume.complete = true;
2531 parse_enum_entries(type);
2532 parse_attributes(NULL);
2534 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2535 if (symbol == NULL) {
2536 assert(anonymous_entity == NULL);
2537 anonymous_entity = entity;
2539 } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
2540 errorf(HERE, "'%T' used before definition (incomplete enums are a GNU extension)", type);
2547 * if a symbol is a typedef to another type, return true
2549 static bool is_typedef_symbol(symbol_t *symbol)
2551 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
2552 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
2555 static type_t *parse_typeof(void)
2561 expect('(', end_error);
2562 add_anchor_token(')');
2564 expression_t *expression = NULL;
2566 switch (token.kind) {
2568 if (is_typedef_symbol(token.identifier.symbol)) {
2570 type = parse_typename();
2573 expression = parse_expression();
2574 type = revert_automatic_type_conversion(expression);
2579 rem_anchor_token(')');
2580 expect(')', end_error);
2582 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
2583 typeof_type->typeoft.expression = expression;
2584 typeof_type->typeoft.typeof_type = type;
2591 typedef enum specifiers_t {
2592 SPECIFIER_SIGNED = 1 << 0,
2593 SPECIFIER_UNSIGNED = 1 << 1,
2594 SPECIFIER_LONG = 1 << 2,
2595 SPECIFIER_INT = 1 << 3,
2596 SPECIFIER_DOUBLE = 1 << 4,
2597 SPECIFIER_CHAR = 1 << 5,
2598 SPECIFIER_WCHAR_T = 1 << 6,
2599 SPECIFIER_SHORT = 1 << 7,
2600 SPECIFIER_LONG_LONG = 1 << 8,
2601 SPECIFIER_FLOAT = 1 << 9,
2602 SPECIFIER_BOOL = 1 << 10,
2603 SPECIFIER_VOID = 1 << 11,
2604 SPECIFIER_INT8 = 1 << 12,
2605 SPECIFIER_INT16 = 1 << 13,
2606 SPECIFIER_INT32 = 1 << 14,
2607 SPECIFIER_INT64 = 1 << 15,
2608 SPECIFIER_INT128 = 1 << 16,
2609 SPECIFIER_COMPLEX = 1 << 17,
2610 SPECIFIER_IMAGINARY = 1 << 18,
2613 static type_t *get_typedef_type(symbol_t *symbol)
2615 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
2616 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
2619 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
2620 type->typedeft.typedefe = &entity->typedefe;
2625 static attribute_t *parse_attribute_ms_property(attribute_t *attribute)
2627 expect('(', end_error);
2629 attribute_property_argument_t *property
2630 = allocate_ast_zero(sizeof(*property));
2633 if (token.kind != T_IDENTIFIER) {
2634 parse_error_expected("while parsing property declspec",
2635 T_IDENTIFIER, NULL);
2640 symbol_t *symbol = token.identifier.symbol;
2641 if (strcmp(symbol->string, "put") == 0) {
2642 prop = &property->put_symbol;
2643 } else if (strcmp(symbol->string, "get") == 0) {
2644 prop = &property->get_symbol;
2646 errorf(HERE, "expected put or get in property declspec");
2650 expect('=', end_error);
2651 if (token.kind != T_IDENTIFIER) {
2652 parse_error_expected("while parsing property declspec",
2653 T_IDENTIFIER, NULL);
2657 *prop = token.identifier.symbol;
2659 } while (next_if(','));
2661 attribute->a.property = property;
2663 expect(')', end_error);
2669 static attribute_t *parse_microsoft_extended_decl_modifier_single(void)
2671 attribute_kind_t kind = ATTRIBUTE_UNKNOWN;
2672 if (next_if(T_restrict)) {
2673 kind = ATTRIBUTE_MS_RESTRICT;
2674 } else if (token.kind == T_IDENTIFIER) {
2675 const char *name = token.identifier.symbol->string;
2676 for (attribute_kind_t k = ATTRIBUTE_MS_FIRST; k <= ATTRIBUTE_MS_LAST;
2678 const char *attribute_name = get_attribute_name(k);
2679 if (attribute_name != NULL && strcmp(attribute_name, name) == 0) {
2685 if (kind == ATTRIBUTE_UNKNOWN) {
2686 warningf(WARN_ATTRIBUTE, HERE, "unknown __declspec '%s' ignored", name);
2689 parse_error_expected("while parsing __declspec", T_IDENTIFIER, NULL);
2693 attribute_t *attribute = allocate_attribute_zero(kind);
2696 if (kind == ATTRIBUTE_MS_PROPERTY) {
2697 return parse_attribute_ms_property(attribute);
2700 /* parse arguments */
2702 attribute->a.arguments = parse_attribute_arguments();
2707 static attribute_t *parse_microsoft_extended_decl_modifier(attribute_t *first)
2711 expect('(', end_error);
2716 add_anchor_token(')');
2718 attribute_t **anchor = &first;
2720 while (*anchor != NULL)
2721 anchor = &(*anchor)->next;
2723 attribute_t *attribute
2724 = parse_microsoft_extended_decl_modifier_single();
2725 if (attribute == NULL)
2728 *anchor = attribute;
2729 anchor = &attribute->next;
2730 } while (next_if(','));
2732 rem_anchor_token(')');
2733 expect(')', end_error);
2737 rem_anchor_token(')');
2741 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
2743 entity_t *const entity = allocate_entity_zero(kind, NAMESPACE_NORMAL, symbol);
2744 entity->base.source_position = *HERE;
2745 if (is_declaration(entity)) {
2746 entity->declaration.type = type_error_type;
2747 entity->declaration.implicit = true;
2748 } else if (kind == ENTITY_TYPEDEF) {
2749 entity->typedefe.type = type_error_type;
2750 entity->typedefe.builtin = true;
2752 if (kind != ENTITY_COMPOUND_MEMBER)
2753 record_entity(entity, false);
2757 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2759 type_t *type = NULL;
2760 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
2761 unsigned type_specifiers = 0;
2762 bool newtype = false;
2763 bool saw_error = false;
2765 memset(specifiers, 0, sizeof(*specifiers));
2766 specifiers->source_position = token.base.source_position;
2769 specifiers->attributes = parse_attributes(specifiers->attributes);
2771 switch (token.kind) {
2773 #define MATCH_STORAGE_CLASS(token, class) \
2775 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
2776 errorf(HERE, "multiple storage classes in declaration specifiers"); \
2778 specifiers->storage_class = class; \
2779 if (specifiers->thread_local) \
2780 goto check_thread_storage_class; \
2784 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
2785 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
2786 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
2787 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
2788 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
2791 specifiers->attributes
2792 = parse_microsoft_extended_decl_modifier(specifiers->attributes);
2796 if (specifiers->thread_local) {
2797 errorf(HERE, "duplicate '__thread'");
2799 specifiers->thread_local = true;
2800 check_thread_storage_class:
2801 switch (specifiers->storage_class) {
2802 case STORAGE_CLASS_EXTERN:
2803 case STORAGE_CLASS_NONE:
2804 case STORAGE_CLASS_STATIC:
2808 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_storage_class;
2809 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_storage_class;
2810 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_storage_class;
2811 wrong_thread_storage_class:
2812 errorf(HERE, "'__thread' used with '%s'", wrong);
2819 /* type qualifiers */
2820 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
2822 qualifiers |= qualifier; \
2826 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
2827 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
2828 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
2829 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
2830 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
2831 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
2832 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
2833 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
2835 /* type specifiers */
2836 #define MATCH_SPECIFIER(token, specifier, name) \
2838 if (type_specifiers & specifier) { \
2839 errorf(HERE, "multiple " name " type specifiers given"); \
2841 type_specifiers |= specifier; \
2846 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
2847 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
2848 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
2849 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
2850 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
2851 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
2852 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
2853 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
2854 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
2855 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
2856 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
2857 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
2858 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
2859 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
2860 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
2861 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
2862 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
2863 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
2867 specifiers->is_inline = true;
2871 case T__forceinline:
2873 specifiers->modifiers |= DM_FORCEINLINE;
2878 if (type_specifiers & SPECIFIER_LONG_LONG) {
2879 errorf(HERE, "too many long type specifiers given");
2880 } else if (type_specifiers & SPECIFIER_LONG) {
2881 type_specifiers |= SPECIFIER_LONG_LONG;
2883 type_specifiers |= SPECIFIER_LONG;
2888 #define CHECK_DOUBLE_TYPE() \
2889 (type != NULL ? errorf(HERE, "multiple types in declaration specifiers") : (void)0)
2892 CHECK_DOUBLE_TYPE();
2893 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
2895 type->compound.compound = parse_compound_type_specifier(true);
2898 CHECK_DOUBLE_TYPE();
2899 type = allocate_type_zero(TYPE_COMPOUND_UNION);
2900 type->compound.compound = parse_compound_type_specifier(false);
2903 CHECK_DOUBLE_TYPE();
2904 type = parse_enum_specifier();
2907 CHECK_DOUBLE_TYPE();
2908 type = parse_typeof();
2910 case T___builtin_va_list:
2911 CHECK_DOUBLE_TYPE();
2912 type = duplicate_type(type_valist);
2916 case T_IDENTIFIER: {
2917 /* only parse identifier if we haven't found a type yet */
2918 if (type != NULL || type_specifiers != 0) {
2919 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
2920 * declaration, so it doesn't generate errors about expecting '(' or
2922 switch (look_ahead(1)->kind) {
2929 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
2933 errorf(HERE, "discarding stray %K in declaration specifier", &token);
2938 goto finish_specifiers;
2942 type_t *const typedef_type = get_typedef_type(token.identifier.symbol);
2943 if (typedef_type == NULL) {
2944 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
2945 * declaration, so it doesn't generate 'implicit int' followed by more
2946 * errors later on. */
2947 token_kind_t const la1_type = (token_kind_t)look_ahead(1)->kind;
2953 errorf(HERE, "%K does not name a type", &token);
2955 symbol_t *symbol = token.identifier.symbol;
2957 = create_error_entity(symbol, ENTITY_TYPEDEF);
2959 type = allocate_type_zero(TYPE_TYPEDEF);
2960 type->typedeft.typedefe = &entity->typedefe;
2968 goto finish_specifiers;
2973 type = typedef_type;
2977 /* function specifier */
2979 goto finish_specifiers;
2984 specifiers->attributes = parse_attributes(specifiers->attributes);
2986 if (type == NULL || (saw_error && type_specifiers != 0)) {
2987 atomic_type_kind_t atomic_type;
2989 /* match valid basic types */
2990 switch (type_specifiers) {
2991 case SPECIFIER_VOID:
2992 atomic_type = ATOMIC_TYPE_VOID;
2994 case SPECIFIER_WCHAR_T:
2995 atomic_type = ATOMIC_TYPE_WCHAR_T;
2997 case SPECIFIER_CHAR:
2998 atomic_type = ATOMIC_TYPE_CHAR;
3000 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3001 atomic_type = ATOMIC_TYPE_SCHAR;
3003 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3004 atomic_type = ATOMIC_TYPE_UCHAR;
3006 case SPECIFIER_SHORT:
3007 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3008 case SPECIFIER_SHORT | SPECIFIER_INT:
3009 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3010 atomic_type = ATOMIC_TYPE_SHORT;
3012 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3013 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3014 atomic_type = ATOMIC_TYPE_USHORT;
3017 case SPECIFIER_SIGNED:
3018 case SPECIFIER_SIGNED | SPECIFIER_INT:
3019 atomic_type = ATOMIC_TYPE_INT;
3021 case SPECIFIER_UNSIGNED:
3022 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3023 atomic_type = ATOMIC_TYPE_UINT;
3025 case SPECIFIER_LONG:
3026 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3027 case SPECIFIER_LONG | SPECIFIER_INT:
3028 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3029 atomic_type = ATOMIC_TYPE_LONG;
3031 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3032 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3033 atomic_type = ATOMIC_TYPE_ULONG;
3036 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3037 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3038 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3039 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3041 atomic_type = ATOMIC_TYPE_LONGLONG;
3042 goto warn_about_long_long;
3044 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3045 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3047 atomic_type = ATOMIC_TYPE_ULONGLONG;
3048 warn_about_long_long:
3049 warningf(WARN_LONG_LONG, &specifiers->source_position, "ISO C90 does not support 'long long'");
3052 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3053 atomic_type = unsigned_int8_type_kind;
3056 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3057 atomic_type = unsigned_int16_type_kind;
3060 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3061 atomic_type = unsigned_int32_type_kind;
3064 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3065 atomic_type = unsigned_int64_type_kind;
3068 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3069 atomic_type = unsigned_int128_type_kind;
3072 case SPECIFIER_INT8:
3073 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3074 atomic_type = int8_type_kind;
3077 case SPECIFIER_INT16:
3078 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3079 atomic_type = int16_type_kind;
3082 case SPECIFIER_INT32:
3083 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3084 atomic_type = int32_type_kind;
3087 case SPECIFIER_INT64:
3088 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3089 atomic_type = int64_type_kind;
3092 case SPECIFIER_INT128:
3093 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3094 atomic_type = int128_type_kind;
3097 case SPECIFIER_FLOAT:
3098 atomic_type = ATOMIC_TYPE_FLOAT;
3100 case SPECIFIER_DOUBLE:
3101 atomic_type = ATOMIC_TYPE_DOUBLE;
3103 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3104 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3106 case SPECIFIER_BOOL:
3107 atomic_type = ATOMIC_TYPE_BOOL;
3109 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3110 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3111 atomic_type = ATOMIC_TYPE_FLOAT;
3113 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3114 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3115 atomic_type = ATOMIC_TYPE_DOUBLE;
3117 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3118 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3119 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3122 /* invalid specifier combination, give an error message */
3123 source_position_t const* const pos = &specifiers->source_position;
3124 if (type_specifiers == 0) {
3126 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
3127 if (!(c_mode & _CXX) && !strict_mode) {
3128 warningf(WARN_IMPLICIT_INT, pos, "no type specifiers in declaration, using 'int'");
3129 atomic_type = ATOMIC_TYPE_INT;
3132 errorf(pos, "no type specifiers given in declaration");
3135 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3136 (type_specifiers & SPECIFIER_UNSIGNED)) {
3137 errorf(pos, "signed and unsigned specifiers given");
3138 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3139 errorf(pos, "only integer types can be signed or unsigned");
3141 errorf(pos, "multiple datatypes in declaration");
3147 if (type_specifiers & SPECIFIER_COMPLEX) {
3148 type = allocate_type_zero(TYPE_COMPLEX);
3149 type->complex.akind = atomic_type;
3150 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3151 type = allocate_type_zero(TYPE_IMAGINARY);
3152 type->imaginary.akind = atomic_type;
3154 type = allocate_type_zero(TYPE_ATOMIC);
3155 type->atomic.akind = atomic_type;
3158 } else if (type_specifiers != 0) {
3159 errorf(&specifiers->source_position, "multiple datatypes in declaration");
3162 /* FIXME: check type qualifiers here */
3163 type->base.qualifiers = qualifiers;
3166 type = identify_new_type(type);
3168 type = typehash_insert(type);
3171 if (specifiers->attributes != NULL)
3172 type = handle_type_attributes(specifiers->attributes, type);
3173 specifiers->type = type;
3177 specifiers->type = type_error_type;
3180 static type_qualifiers_t parse_type_qualifiers(void)
3182 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3185 switch (token.kind) {
3186 /* type qualifiers */
3187 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3188 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3189 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3190 /* microsoft extended type modifiers */
3191 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3192 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3193 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3194 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3195 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3204 * Parses an K&R identifier list
3206 static void parse_identifier_list(scope_t *scope)
3208 assert(token.kind == T_IDENTIFIER);
3210 entity_t *const entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, token.identifier.symbol);
3211 entity->base.source_position = token.base.source_position;
3212 /* a K&R parameter has no type, yet */
3216 append_entity(scope, entity);
3217 } while (next_if(',') && token.kind == T_IDENTIFIER);
3220 static entity_t *parse_parameter(void)
3222 declaration_specifiers_t specifiers;
3223 parse_declaration_specifiers(&specifiers);
3225 entity_t *entity = parse_declarator(&specifiers,
3226 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
3227 anonymous_entity = NULL;
3231 static void semantic_parameter_incomplete(const entity_t *entity)
3233 assert(entity->kind == ENTITY_PARAMETER);
3235 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
3236 * list in a function declarator that is part of a
3237 * definition of that function shall not have
3238 * incomplete type. */
3239 type_t *type = skip_typeref(entity->declaration.type);
3240 if (is_type_incomplete(type)) {
3241 errorf(&entity->base.source_position, "'%N' has incomplete type", entity);
3245 static bool has_parameters(void)
3247 /* func(void) is not a parameter */
3248 if (token.kind == T_IDENTIFIER) {
3249 entity_t const *const entity
3250 = get_entity(token.identifier.symbol, NAMESPACE_NORMAL);
3253 if (entity->kind != ENTITY_TYPEDEF)
3255 if (skip_typeref(entity->typedefe.type) != type_void)
3257 } else if (token.kind != T_void) {
3260 if (look_ahead(1)->kind != ')')
3267 * Parses function type parameters (and optionally creates variable_t entities
3268 * for them in a scope)
3270 static void parse_parameters(function_type_t *type, scope_t *scope)
3273 add_anchor_token(')');
3274 int saved_comma_state = save_and_reset_anchor_state(',');
3276 if (token.kind == T_IDENTIFIER
3277 && !is_typedef_symbol(token.identifier.symbol)) {
3278 token_kind_t la1_type = (token_kind_t)look_ahead(1)->kind;
3279 if (la1_type == ',' || la1_type == ')') {
3280 type->kr_style_parameters = true;
3281 parse_identifier_list(scope);
3282 goto parameters_finished;
3286 if (token.kind == ')') {
3287 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
3288 if (!(c_mode & _CXX))
3289 type->unspecified_parameters = true;
3290 } else if (has_parameters()) {
3291 function_parameter_t **anchor = &type->parameters;
3293 switch (token.kind) {
3296 type->variadic = true;
3297 goto parameters_finished;
3302 entity_t *entity = parse_parameter();
3303 if (entity->kind == ENTITY_TYPEDEF) {
3304 errorf(&entity->base.source_position,
3305 "typedef not allowed as function parameter");
3308 assert(is_declaration(entity));
3310 semantic_parameter_incomplete(entity);
3312 function_parameter_t *const parameter =
3313 allocate_parameter(entity->declaration.type);
3315 if (scope != NULL) {
3316 append_entity(scope, entity);
3319 *anchor = parameter;
3320 anchor = ¶meter->next;
3325 goto parameters_finished;
3327 } while (next_if(','));
3330 parameters_finished:
3331 rem_anchor_token(')');
3332 expect(')', end_error);
3335 restore_anchor_state(',', saved_comma_state);
3338 typedef enum construct_type_kind_t {
3339 CONSTRUCT_POINTER = 1,
3340 CONSTRUCT_REFERENCE,
3343 } construct_type_kind_t;
3345 typedef union construct_type_t construct_type_t;
3347 typedef struct construct_type_base_t {
3348 construct_type_kind_t kind;
3349 source_position_t pos;
3350 construct_type_t *next;
3351 } construct_type_base_t;
3353 typedef struct parsed_pointer_t {
3354 construct_type_base_t base;
3355 type_qualifiers_t type_qualifiers;
3356 variable_t *base_variable; /**< MS __based extension. */
3359 typedef struct parsed_reference_t {
3360 construct_type_base_t base;
3361 } parsed_reference_t;
3363 typedef struct construct_function_type_t {
3364 construct_type_base_t base;
3365 type_t *function_type;
3366 } construct_function_type_t;
3368 typedef struct parsed_array_t {
3369 construct_type_base_t base;
3370 type_qualifiers_t type_qualifiers;
3376 union construct_type_t {
3377 construct_type_kind_t kind;
3378 construct_type_base_t base;
3379 parsed_pointer_t pointer;
3380 parsed_reference_t reference;
3381 construct_function_type_t function;
3382 parsed_array_t array;
3385 static construct_type_t *allocate_declarator_zero(construct_type_kind_t const kind, size_t const size)
3387 construct_type_t *const cons = obstack_alloc(&temp_obst, size);
3388 memset(cons, 0, size);
3390 cons->base.pos = *HERE;
3395 static construct_type_t *parse_pointer_declarator(void)
3397 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_POINTER, sizeof(parsed_pointer_t));
3399 cons->pointer.type_qualifiers = parse_type_qualifiers();
3400 //cons->pointer.base_variable = base_variable;
3405 /* ISO/IEC 14882:1998(E) §8.3.2 */
3406 static construct_type_t *parse_reference_declarator(void)
3408 if (!(c_mode & _CXX))
3409 errorf(HERE, "references are only available for C++");
3411 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_REFERENCE, sizeof(parsed_reference_t));
3418 static construct_type_t *parse_array_declarator(void)
3420 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_ARRAY, sizeof(parsed_array_t));
3421 parsed_array_t *const array = &cons->array;
3424 add_anchor_token(']');
3426 bool is_static = next_if(T_static);
3428 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3431 is_static = next_if(T_static);
3433 array->type_qualifiers = type_qualifiers;
3434 array->is_static = is_static;
3436 expression_t *size = NULL;
3437 if (token.kind == '*' && look_ahead(1)->kind == ']') {
3438 array->is_variable = true;
3440 } else if (token.kind != ']') {
3441 size = parse_assignment_expression();
3443 /* §6.7.5.2:1 Array size must have integer type */
3444 type_t *const orig_type = size->base.type;
3445 type_t *const type = skip_typeref(orig_type);
3446 if (!is_type_integer(type) && is_type_valid(type)) {
3447 errorf(&size->base.source_position,
3448 "array size '%E' must have integer type but has type '%T'",
3453 mark_vars_read(size, NULL);
3456 if (is_static && size == NULL)
3457 errorf(&array->base.pos, "static array parameters require a size");
3459 rem_anchor_token(']');
3460 expect(']', end_error);
3467 static construct_type_t *parse_function_declarator(scope_t *scope)
3469 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_FUNCTION, sizeof(construct_function_type_t));
3471 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3472 function_type_t *ftype = &type->function;
3474 ftype->linkage = current_linkage;
3475 ftype->calling_convention = CC_DEFAULT;
3477 parse_parameters(ftype, scope);
3479 cons->function.function_type = type;
3484 typedef struct parse_declarator_env_t {
3485 bool may_be_abstract : 1;
3486 bool must_be_abstract : 1;
3487 decl_modifiers_t modifiers;
3489 source_position_t source_position;
3491 attribute_t *attributes;
3492 } parse_declarator_env_t;
3495 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env)
3497 /* construct a single linked list of construct_type_t's which describe
3498 * how to construct the final declarator type */
3499 construct_type_t *first = NULL;
3500 construct_type_t **anchor = &first;
3502 env->attributes = parse_attributes(env->attributes);
3505 construct_type_t *type;
3506 //variable_t *based = NULL; /* MS __based extension */
3507 switch (token.kind) {
3509 type = parse_reference_declarator();
3513 panic("based not supported anymore");
3518 type = parse_pointer_declarator();
3522 goto ptr_operator_end;
3526 anchor = &type->base.next;
3528 /* TODO: find out if this is correct */
3529 env->attributes = parse_attributes(env->attributes);
3533 construct_type_t *inner_types = NULL;
3535 switch (token.kind) {
3537 if (env->must_be_abstract) {
3538 errorf(HERE, "no identifier expected in typename");
3540 env->symbol = token.identifier.symbol;
3541 env->source_position = token.base.source_position;
3547 /* Parenthesized declarator or function declarator? */
3548 token_t const *const la1 = look_ahead(1);
3549 switch (la1->kind) {
3551 if (is_typedef_symbol(la1->identifier.symbol)) {
3553 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
3554 * interpreted as ``function with no parameter specification'', rather
3555 * than redundant parentheses around the omitted identifier. */
3557 /* Function declarator. */
3558 if (!env->may_be_abstract) {
3559 errorf(HERE, "function declarator must have a name");
3566 case T___attribute__: /* FIXME __attribute__ might also introduce a parameter of a function declarator. */
3567 /* Paranthesized declarator. */
3569 add_anchor_token(')');
3570 inner_types = parse_inner_declarator(env);
3571 if (inner_types != NULL) {
3572 /* All later declarators only modify the return type */
3573 env->must_be_abstract = true;
3575 rem_anchor_token(')');
3576 expect(')', end_error);
3584 if (env->may_be_abstract)
3586 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3591 construct_type_t **const p = anchor;
3594 construct_type_t *type;
3595 switch (token.kind) {
3597 scope_t *scope = NULL;
3598 if (!env->must_be_abstract) {
3599 scope = &env->parameters;
3602 type = parse_function_declarator(scope);
3606 type = parse_array_declarator();
3609 goto declarator_finished;
3612 /* insert in the middle of the list (at p) */
3613 type->base.next = *p;
3616 anchor = &type->base.next;
3619 declarator_finished:
3620 /* append inner_types at the end of the list, we don't to set anchor anymore
3621 * as it's not needed anymore */
3622 *anchor = inner_types;
3629 static type_t *construct_declarator_type(construct_type_t *construct_list,
3632 construct_type_t *iter = construct_list;
3633 for (; iter != NULL; iter = iter->base.next) {
3634 source_position_t const* const pos = &iter->base.pos;
3635 switch (iter->kind) {
3636 case CONSTRUCT_FUNCTION: {
3637 construct_function_type_t *function = &iter->function;
3638 type_t *function_type = function->function_type;
3640 function_type->function.return_type = type;
3642 type_t *skipped_return_type = skip_typeref(type);
3644 if (is_type_function(skipped_return_type)) {
3645 errorf(pos, "function returning function is not allowed");
3646 } else if (is_type_array(skipped_return_type)) {
3647 errorf(pos, "function returning array is not allowed");
3649 if (skipped_return_type->base.qualifiers != 0) {
3650 warningf(WARN_IGNORED_QUALIFIERS, pos, "type qualifiers in return type of function type are meaningless");
3654 /* The function type was constructed earlier. Freeing it here will
3655 * destroy other types. */
3656 type = typehash_insert(function_type);
3660 case CONSTRUCT_POINTER: {
3661 if (is_type_reference(skip_typeref(type)))
3662 errorf(pos, "cannot declare a pointer to reference");
3664 parsed_pointer_t *pointer = &iter->pointer;
3665 type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
3669 case CONSTRUCT_REFERENCE:
3670 if (is_type_reference(skip_typeref(type)))
3671 errorf(pos, "cannot declare a reference to reference");
3673 type = make_reference_type(type);
3676 case CONSTRUCT_ARRAY: {
3677 if (is_type_reference(skip_typeref(type)))
3678 errorf(pos, "cannot declare an array of references");
3680 parsed_array_t *array = &iter->array;
3681 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
3683 expression_t *size_expression = array->size;
3684 if (size_expression != NULL) {
3686 = create_implicit_cast(size_expression, type_size_t);
3689 array_type->base.qualifiers = array->type_qualifiers;
3690 array_type->array.element_type = type;
3691 array_type->array.is_static = array->is_static;
3692 array_type->array.is_variable = array->is_variable;
3693 array_type->array.size_expression = size_expression;
3695 if (size_expression != NULL) {
3696 switch (is_constant_expression(size_expression)) {
3697 case EXPR_CLASS_CONSTANT: {
3698 long const size = fold_constant_to_int(size_expression);
3699 array_type->array.size = size;
3700 array_type->array.size_constant = true;
3701 /* §6.7.5.2:1 If the expression is a constant expression,
3702 * it shall have a value greater than zero. */
3704 errorf(&size_expression->base.source_position,
3705 "size of array must be greater than zero");
3706 } else if (size == 0 && !GNU_MODE) {
3707 errorf(&size_expression->base.source_position,
3708 "size of array must be greater than zero (zero length arrays are a GCC extension)");
3713 case EXPR_CLASS_VARIABLE:
3714 array_type->array.is_vla = true;
3717 case EXPR_CLASS_ERROR:
3722 type_t *skipped_type = skip_typeref(type);
3724 if (is_type_incomplete(skipped_type)) {
3725 errorf(pos, "array of incomplete type '%T' is not allowed", type);
3726 } else if (is_type_function(skipped_type)) {
3727 errorf(pos, "array of functions is not allowed");
3729 type = identify_new_type(array_type);
3733 internal_errorf(pos, "invalid type construction found");
3739 static type_t *automatic_type_conversion(type_t *orig_type);
3741 static type_t *semantic_parameter(const source_position_t *pos,
3743 const declaration_specifiers_t *specifiers,
3744 entity_t const *const param)
3746 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
3747 * shall be adjusted to ``qualified pointer to type'',
3749 * §6.7.5.3:8 A declaration of a parameter as ``function returning
3750 * type'' shall be adjusted to ``pointer to function
3751 * returning type'', as in 6.3.2.1. */
3752 type = automatic_type_conversion(type);
3754 if (specifiers->is_inline && is_type_valid(type)) {
3755 errorf(pos, "'%N' declared 'inline'", param);
3758 /* §6.9.1:6 The declarations in the declaration list shall contain
3759 * no storage-class specifier other than register and no
3760 * initializations. */
3761 if (specifiers->thread_local || (
3762 specifiers->storage_class != STORAGE_CLASS_NONE &&
3763 specifiers->storage_class != STORAGE_CLASS_REGISTER)
3765 errorf(pos, "invalid storage class for '%N'", param);
3768 /* delay test for incomplete type, because we might have (void)
3769 * which is legal but incomplete... */
3774 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
3775 declarator_flags_t flags)
3777 parse_declarator_env_t env;
3778 memset(&env, 0, sizeof(env));
3779 env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
3781 construct_type_t *construct_type = parse_inner_declarator(&env);
3783 construct_declarator_type(construct_type, specifiers->type);
3784 type_t *type = skip_typeref(orig_type);
3786 if (construct_type != NULL) {
3787 obstack_free(&temp_obst, construct_type);
3790 attribute_t *attributes = parse_attributes(env.attributes);
3791 /* append (shared) specifier attribute behind attributes of this
3793 attribute_t **anchor = &attributes;
3794 while (*anchor != NULL)
3795 anchor = &(*anchor)->next;
3796 *anchor = specifiers->attributes;
3799 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
3800 entity = allocate_entity_zero(ENTITY_TYPEDEF, NAMESPACE_NORMAL, env.symbol);
3801 entity->base.source_position = env.source_position;
3802 entity->typedefe.type = orig_type;
3804 if (anonymous_entity != NULL) {
3805 if (is_type_compound(type)) {
3806 assert(anonymous_entity->compound.alias == NULL);
3807 assert(anonymous_entity->kind == ENTITY_STRUCT ||
3808 anonymous_entity->kind == ENTITY_UNION);
3809 anonymous_entity->compound.alias = entity;
3810 anonymous_entity = NULL;
3811 } else if (is_type_enum(type)) {
3812 assert(anonymous_entity->enume.alias == NULL);
3813 assert(anonymous_entity->kind == ENTITY_ENUM);
3814 anonymous_entity->enume.alias = entity;
3815 anonymous_entity = NULL;
3819 /* create a declaration type entity */
3820 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
3821 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, env.symbol);
3823 if (env.symbol != NULL) {
3824 if (specifiers->is_inline && is_type_valid(type)) {
3825 errorf(&env.source_position,
3826 "compound member '%Y' declared 'inline'", env.symbol);
3829 if (specifiers->thread_local ||
3830 specifiers->storage_class != STORAGE_CLASS_NONE) {
3831 errorf(&env.source_position,
3832 "compound member '%Y' must have no storage class",
3836 } else if (flags & DECL_IS_PARAMETER) {
3837 entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, env.symbol);
3838 orig_type = semantic_parameter(&env.source_position, orig_type, specifiers, entity);
3839 } else if (is_type_function(type)) {
3840 entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, env.symbol);
3841 entity->function.is_inline = specifiers->is_inline;
3842 entity->function.elf_visibility = default_visibility;
3843 entity->function.parameters = env.parameters;
3845 if (env.symbol != NULL) {
3846 /* this needs fixes for C++ */
3847 bool in_function_scope = current_function != NULL;
3849 if (specifiers->thread_local || (
3850 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3851 specifiers->storage_class != STORAGE_CLASS_NONE &&
3852 (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
3854 errorf(&env.source_position, "invalid storage class for '%N'", entity);
3858 entity = allocate_entity_zero(ENTITY_VARIABLE, NAMESPACE_NORMAL, env.symbol);
3859 entity->variable.elf_visibility = default_visibility;
3860 entity->variable.thread_local = specifiers->thread_local;
3862 if (env.symbol != NULL) {
3863 if (specifiers->is_inline && is_type_valid(type)) {
3864 errorf(&env.source_position, "'%N' declared 'inline'", entity);
3867 bool invalid_storage_class = false;
3868 if (current_scope == file_scope) {
3869 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3870 specifiers->storage_class != STORAGE_CLASS_NONE &&
3871 specifiers->storage_class != STORAGE_CLASS_STATIC) {
3872 invalid_storage_class = true;
3875 if (specifiers->thread_local &&
3876 specifiers->storage_class == STORAGE_CLASS_NONE) {
3877 invalid_storage_class = true;
3880 if (invalid_storage_class) {
3881 errorf(&env.source_position, "invalid storage class for variable '%N'", entity);
3886 entity->base.source_position = env.symbol != NULL ? env.source_position : specifiers->source_position;
3887 entity->declaration.type = orig_type;
3888 entity->declaration.alignment = get_type_alignment(orig_type);
3889 entity->declaration.modifiers = env.modifiers;
3890 entity->declaration.attributes = attributes;
3892 storage_class_t storage_class = specifiers->storage_class;
3893 entity->declaration.declared_storage_class = storage_class;
3895 if (storage_class == STORAGE_CLASS_NONE && current_function != NULL)
3896 storage_class = STORAGE_CLASS_AUTO;
3897 entity->declaration.storage_class = storage_class;
3900 if (attributes != NULL) {
3901 handle_entity_attributes(attributes, entity);
3907 static type_t *parse_abstract_declarator(type_t *base_type)
3909 parse_declarator_env_t env;
3910 memset(&env, 0, sizeof(env));
3911 env.may_be_abstract = true;
3912 env.must_be_abstract = true;
3914 construct_type_t *construct_type = parse_inner_declarator(&env);
3916 type_t *result = construct_declarator_type(construct_type, base_type);
3917 if (construct_type != NULL) {
3918 obstack_free(&temp_obst, construct_type);
3920 result = handle_type_attributes(env.attributes, result);
3926 * Check if the declaration of main is suspicious. main should be a
3927 * function with external linkage, returning int, taking either zero
3928 * arguments, two, or three arguments of appropriate types, ie.
3930 * int main([ int argc, char **argv [, char **env ] ]).
3932 * @param decl the declaration to check
3933 * @param type the function type of the declaration
3935 static void check_main(const entity_t *entity)
3937 const source_position_t *pos = &entity->base.source_position;
3938 if (entity->kind != ENTITY_FUNCTION) {
3939 warningf(WARN_MAIN, pos, "'main' is not a function");
3943 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
3944 warningf(WARN_MAIN, pos, "'main' is normally a non-static function");
3947 type_t *type = skip_typeref(entity->declaration.type);
3948 assert(is_type_function(type));
3950 function_type_t const *const func_type = &type->function;
3951 type_t *const ret_type = func_type->return_type;
3952 if (!types_compatible(skip_typeref(ret_type), type_int)) {
3953 warningf(WARN_MAIN, pos, "return type of 'main' should be 'int', but is '%T'", ret_type);
3955 const function_parameter_t *parm = func_type->parameters;
3957 type_t *const first_type = skip_typeref(parm->type);
3958 type_t *const first_type_unqual = get_unqualified_type(first_type);
3959 if (!types_compatible(first_type_unqual, type_int)) {
3960 warningf(WARN_MAIN, pos, "first argument of 'main' should be 'int', but is '%T'", parm->type);
3964 type_t *const second_type = skip_typeref(parm->type);
3965 type_t *const second_type_unqual
3966 = get_unqualified_type(second_type);
3967 if (!types_compatible(second_type_unqual, type_char_ptr_ptr)) {
3968 warningf(WARN_MAIN, pos, "second argument of 'main' should be 'char**', but is '%T'", parm->type);
3972 type_t *const third_type = skip_typeref(parm->type);
3973 type_t *const third_type_unqual
3974 = get_unqualified_type(third_type);
3975 if (!types_compatible(third_type_unqual, type_char_ptr_ptr)) {
3976 warningf(WARN_MAIN, pos, "third argument of 'main' should be 'char**', but is '%T'", parm->type);
3980 goto warn_arg_count;
3984 warningf(WARN_MAIN, pos, "'main' takes only zero, two or three arguments");
3990 * Check if a symbol is the equal to "main".
3992 static bool is_sym_main(const symbol_t *const sym)
3994 return strcmp(sym->string, "main") == 0;
3997 static void error_redefined_as_different_kind(const source_position_t *pos,
3998 const entity_t *old, entity_kind_t new_kind)
4000 char const *const what = get_entity_kind_name(new_kind);
4001 source_position_t const *const ppos = &old->base.source_position;
4002 errorf(pos, "redeclaration of '%N' as %s (declared %P)", old, what, ppos);
4005 static bool is_entity_valid(entity_t *const ent)
4007 if (is_declaration(ent)) {
4008 return is_type_valid(skip_typeref(ent->declaration.type));
4009 } else if (ent->kind == ENTITY_TYPEDEF) {
4010 return is_type_valid(skip_typeref(ent->typedefe.type));
4015 static bool contains_attribute(const attribute_t *list, const attribute_t *attr)
4017 for (const attribute_t *tattr = list; tattr != NULL; tattr = tattr->next) {
4018 if (attributes_equal(tattr, attr))
4025 * test wether new_list contains any attributes not included in old_list
4027 static bool has_new_attributes(const attribute_t *old_list,
4028 const attribute_t *new_list)
4030 for (const attribute_t *attr = new_list; attr != NULL; attr = attr->next) {
4031 if (!contains_attribute(old_list, attr))
4038 * Merge in attributes from an attribute list (probably from a previous
4039 * declaration with the same name). Warning: destroys the old structure
4040 * of the attribute list - don't reuse attributes after this call.
4042 static void merge_in_attributes(declaration_t *decl, attribute_t *attributes)
4045 for (attribute_t *attr = attributes; attr != NULL; attr = next) {
4047 if (contains_attribute(decl->attributes, attr))
4050 /* move attribute to new declarations attributes list */
4051 attr->next = decl->attributes;
4052 decl->attributes = attr;
4057 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
4058 * for various problems that occur for multiple definitions
4060 entity_t *record_entity(entity_t *entity, const bool is_definition)
4062 const symbol_t *const symbol = entity->base.symbol;
4063 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
4064 const source_position_t *pos = &entity->base.source_position;
4066 /* can happen in error cases */
4070 entity_t *const previous_entity = get_entity(symbol, namespc);
4071 /* pushing the same entity twice will break the stack structure */
4072 assert(previous_entity != entity);
4074 if (entity->kind == ENTITY_FUNCTION) {
4075 type_t *const orig_type = entity->declaration.type;
4076 type_t *const type = skip_typeref(orig_type);
4078 assert(is_type_function(type));
4079 if (type->function.unspecified_parameters &&
4080 previous_entity == NULL &&
4081 !entity->declaration.implicit) {
4082 warningf(WARN_STRICT_PROTOTYPES, pos, "function declaration '%#N' is not a prototype", entity);
4085 if (current_scope == file_scope && is_sym_main(symbol)) {
4090 if (is_declaration(entity) &&
4091 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
4092 current_scope != file_scope &&
4093 !entity->declaration.implicit) {
4094 warningf(WARN_NESTED_EXTERNS, pos, "nested extern declaration of '%#N'", entity);
4097 if (previous_entity != NULL) {
4098 source_position_t const *const ppos = &previous_entity->base.source_position;
4100 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
4101 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
4102 assert(previous_entity->kind == ENTITY_PARAMETER);
4103 errorf(pos, "declaration of '%N' redeclares the '%N' (declared %P)", entity, previous_entity, ppos);
4107 if (previous_entity->base.parent_scope == current_scope) {
4108 if (previous_entity->kind != entity->kind) {
4109 if (is_entity_valid(previous_entity) && is_entity_valid(entity)) {
4110 error_redefined_as_different_kind(pos, previous_entity,
4115 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
4116 errorf(pos, "redeclaration of '%N' (declared %P)", entity, ppos);
4119 if (previous_entity->kind == ENTITY_TYPEDEF) {
4120 /* TODO: C++ allows this for exactly the same type */
4121 errorf(pos, "redefinition of '%N' (declared %P)", entity, ppos);
4125 /* at this point we should have only VARIABLES or FUNCTIONS */
4126 assert(is_declaration(previous_entity) && is_declaration(entity));
4128 declaration_t *const prev_decl = &previous_entity->declaration;
4129 declaration_t *const decl = &entity->declaration;
4131 /* can happen for K&R style declarations */
4132 if (prev_decl->type == NULL &&
4133 previous_entity->kind == ENTITY_PARAMETER &&
4134 entity->kind == ENTITY_PARAMETER) {
4135 prev_decl->type = decl->type;
4136 prev_decl->storage_class = decl->storage_class;
4137 prev_decl->declared_storage_class = decl->declared_storage_class;
4138 prev_decl->modifiers = decl->modifiers;
4139 return previous_entity;
4142 type_t *const type = skip_typeref(decl->type);
4143 type_t *const prev_type = skip_typeref(prev_decl->type);
4145 if (!types_compatible(type, prev_type)) {
4146 errorf(pos, "declaration '%#N' is incompatible with '%#N' (declared %P)", entity, previous_entity, ppos);
4148 unsigned old_storage_class = prev_decl->storage_class;
4150 if (is_definition &&
4152 !(prev_decl->modifiers & DM_USED) &&
4153 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4154 warningf(WARN_REDUNDANT_DECLS, ppos, "unnecessary static forward declaration for '%#N'", previous_entity);
4157 storage_class_t new_storage_class = decl->storage_class;
4159 /* pretend no storage class means extern for function
4160 * declarations (except if the previous declaration is neither
4161 * none nor extern) */
4162 if (entity->kind == ENTITY_FUNCTION) {
4163 /* the previous declaration could have unspecified parameters or
4164 * be a typedef, so use the new type */
4165 if (prev_type->function.unspecified_parameters || is_definition)
4166 prev_decl->type = type;
4168 switch (old_storage_class) {
4169 case STORAGE_CLASS_NONE:
4170 old_storage_class = STORAGE_CLASS_EXTERN;
4173 case STORAGE_CLASS_EXTERN:
4174 if (is_definition) {
4175 if (prev_type->function.unspecified_parameters && !is_sym_main(symbol)) {
4176 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4178 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4179 new_storage_class = STORAGE_CLASS_EXTERN;
4186 } else if (is_type_incomplete(prev_type)) {
4187 prev_decl->type = type;
4190 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4191 new_storage_class == STORAGE_CLASS_EXTERN) {
4193 warn_redundant_declaration: ;
4195 = has_new_attributes(prev_decl->attributes,
4197 if (has_new_attrs) {
4198 merge_in_attributes(decl, prev_decl->attributes);
4199 } else if (!is_definition &&
4200 is_type_valid(prev_type) &&
4201 strcmp(ppos->input_name, "<builtin>") != 0) {
4202 warningf(WARN_REDUNDANT_DECLS, pos, "redundant declaration for '%Y' (declared %P)", symbol, ppos);
4204 } else if (current_function == NULL) {
4205 if (old_storage_class != STORAGE_CLASS_STATIC &&
4206 new_storage_class == STORAGE_CLASS_STATIC) {
4207 errorf(pos, "static declaration of '%Y' follows non-static declaration (declared %P)", symbol, ppos);
4208 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4209 prev_decl->storage_class = STORAGE_CLASS_NONE;
4210 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4212 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4214 goto error_redeclaration;
4215 goto warn_redundant_declaration;
4217 } else if (is_type_valid(prev_type)) {
4218 if (old_storage_class == new_storage_class) {
4219 error_redeclaration:
4220 errorf(pos, "redeclaration of '%Y' (declared %P)", symbol, ppos);
4222 errorf(pos, "redeclaration of '%Y' with different linkage (declared %P)", symbol, ppos);
4227 prev_decl->modifiers |= decl->modifiers;
4228 if (entity->kind == ENTITY_FUNCTION) {
4229 previous_entity->function.is_inline |= entity->function.is_inline;
4231 return previous_entity;
4235 if (is_warn_on(why = WARN_SHADOW) ||
4236 (is_warn_on(why = WARN_SHADOW_LOCAL) && previous_entity->base.parent_scope != file_scope)) {
4237 char const *const what = get_entity_kind_name(previous_entity->kind);
4238 warningf(why, pos, "'%N' shadows %s (declared %P)", entity, what, ppos);
4242 if (entity->kind == ENTITY_FUNCTION) {
4243 if (is_definition &&
4244 entity->declaration.storage_class != STORAGE_CLASS_STATIC &&
4245 !is_sym_main(symbol)) {
4246 if (is_warn_on(WARN_MISSING_PROTOTYPES)) {
4247 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4249 goto warn_missing_declaration;
4252 } else if (entity->kind == ENTITY_VARIABLE) {
4253 if (current_scope == file_scope &&
4254 entity->declaration.storage_class == STORAGE_CLASS_NONE &&
4255 !entity->declaration.implicit) {
4256 warn_missing_declaration:
4257 warningf(WARN_MISSING_DECLARATIONS, pos, "no previous declaration for '%#N'", entity);
4262 assert(entity->base.parent_scope == NULL);
4263 assert(current_scope != NULL);
4265 entity->base.parent_scope = current_scope;
4266 environment_push(entity);
4267 append_entity(current_scope, entity);
4272 static void parser_error_multiple_definition(entity_t *entity,
4273 const source_position_t *source_position)
4275 errorf(source_position, "multiple definition of '%Y' (declared %P)",
4276 entity->base.symbol, &entity->base.source_position);
4279 static bool is_declaration_specifier(const token_t *token)
4281 switch (token->kind) {
4285 return is_typedef_symbol(token->identifier.symbol);
4292 static void parse_init_declarator_rest(entity_t *entity)
4294 type_t *orig_type = type_error_type;
4296 if (entity->base.kind == ENTITY_TYPEDEF) {
4297 source_position_t const *const pos = &entity->base.source_position;
4298 errorf(pos, "'%N' is initialized (use __typeof__ instead)", entity);
4300 assert(is_declaration(entity));
4301 orig_type = entity->declaration.type;
4304 type_t *type = skip_typeref(orig_type);
4306 if (entity->kind == ENTITY_VARIABLE
4307 && entity->variable.initializer != NULL) {
4308 parser_error_multiple_definition(entity, HERE);
4312 declaration_t *const declaration = &entity->declaration;
4313 bool must_be_constant = false;
4314 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4315 entity->base.parent_scope == file_scope) {
4316 must_be_constant = true;
4319 if (is_type_function(type)) {
4320 source_position_t const *const pos = &entity->base.source_position;
4321 errorf(pos, "'%N' is initialized like a variable", entity);
4322 orig_type = type_error_type;
4325 parse_initializer_env_t env;
4326 env.type = orig_type;
4327 env.must_be_constant = must_be_constant;
4328 env.entity = entity;
4330 initializer_t *initializer = parse_initializer(&env);
4332 if (entity->kind == ENTITY_VARIABLE) {
4333 /* §6.7.5:22 array initializers for arrays with unknown size
4334 * determine the array type size */
4335 declaration->type = env.type;
4336 entity->variable.initializer = initializer;
4340 /* parse rest of a declaration without any declarator */
4341 static void parse_anonymous_declaration_rest(
4342 const declaration_specifiers_t *specifiers)
4345 anonymous_entity = NULL;
4347 source_position_t const *const pos = &specifiers->source_position;
4348 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4349 specifiers->thread_local) {
4350 warningf(WARN_OTHER, pos, "useless storage class in empty declaration");
4353 type_t *type = specifiers->type;
4354 switch (type->kind) {
4355 case TYPE_COMPOUND_STRUCT:
4356 case TYPE_COMPOUND_UNION: {
4357 if (type->compound.compound->base.symbol == NULL) {
4358 warningf(WARN_OTHER, pos, "unnamed struct/union that defines no instances");
4367 warningf(WARN_OTHER, pos, "empty declaration");
4372 static void check_variable_type_complete(entity_t *ent)
4374 if (ent->kind != ENTITY_VARIABLE)
4377 /* §6.7:7 If an identifier for an object is declared with no linkage, the
4378 * type for the object shall be complete [...] */
4379 declaration_t *decl = &ent->declaration;
4380 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4381 decl->storage_class == STORAGE_CLASS_STATIC)
4384 type_t *const type = skip_typeref(decl->type);
4385 if (!is_type_incomplete(type))
4388 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4389 * are given length one. */
4390 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4391 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4395 errorf(&ent->base.source_position, "variable '%#N' has incomplete type", ent);
4399 static void parse_declaration_rest(entity_t *ndeclaration,
4400 const declaration_specifiers_t *specifiers,
4401 parsed_declaration_func finished_declaration,
4402 declarator_flags_t flags)
4404 add_anchor_token(';');
4405 add_anchor_token(',');
4407 entity_t *entity = finished_declaration(ndeclaration, token.kind == '=');
4409 if (token.kind == '=') {
4410 parse_init_declarator_rest(entity);
4411 } else if (entity->kind == ENTITY_VARIABLE) {
4412 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
4413 * [...] where the extern specifier is explicitly used. */
4414 declaration_t *decl = &entity->declaration;
4415 if (decl->storage_class != STORAGE_CLASS_EXTERN) {
4416 type_t *type = decl->type;
4417 if (is_type_reference(skip_typeref(type))) {
4418 source_position_t const *const pos = &entity->base.source_position;
4419 errorf(pos, "reference '%#N' must be initialized", entity);
4424 check_variable_type_complete(entity);
4429 add_anchor_token('=');
4430 ndeclaration = parse_declarator(specifiers, flags);
4431 rem_anchor_token('=');
4433 expect(';', end_error);
4436 anonymous_entity = NULL;
4437 rem_anchor_token(';');
4438 rem_anchor_token(',');
4441 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4443 symbol_t *symbol = entity->base.symbol;
4447 assert(entity->base.namespc == NAMESPACE_NORMAL);
4448 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4449 if (previous_entity == NULL
4450 || previous_entity->base.parent_scope != current_scope) {
4451 errorf(&entity->base.source_position, "expected declaration of a function parameter, found '%Y'",
4456 if (is_definition) {
4457 errorf(HERE, "'%N' is initialised", entity);
4460 return record_entity(entity, false);
4463 static void parse_declaration(parsed_declaration_func finished_declaration,
4464 declarator_flags_t flags)
4466 add_anchor_token(';');
4467 declaration_specifiers_t specifiers;
4468 parse_declaration_specifiers(&specifiers);
4469 rem_anchor_token(';');
4471 if (token.kind == ';') {
4472 parse_anonymous_declaration_rest(&specifiers);
4474 entity_t *entity = parse_declarator(&specifiers, flags);
4475 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4480 static type_t *get_default_promoted_type(type_t *orig_type)
4482 type_t *result = orig_type;
4484 type_t *type = skip_typeref(orig_type);
4485 if (is_type_integer(type)) {
4486 result = promote_integer(type);
4487 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4488 result = type_double;
4494 static void parse_kr_declaration_list(entity_t *entity)
4496 if (entity->kind != ENTITY_FUNCTION)
4499 type_t *type = skip_typeref(entity->declaration.type);
4500 assert(is_type_function(type));
4501 if (!type->function.kr_style_parameters)
4504 add_anchor_token('{');
4506 PUSH_SCOPE(&entity->function.parameters);
4508 entity_t *parameter = entity->function.parameters.entities;
4509 for ( ; parameter != NULL; parameter = parameter->base.next) {
4510 assert(parameter->base.parent_scope == NULL);
4511 parameter->base.parent_scope = current_scope;
4512 environment_push(parameter);
4515 /* parse declaration list */
4517 switch (token.kind) {
4519 /* This covers symbols, which are no type, too, and results in
4520 * better error messages. The typical cases are misspelled type
4521 * names and missing includes. */
4523 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4533 /* update function type */
4534 type_t *new_type = duplicate_type(type);
4536 function_parameter_t *parameters = NULL;
4537 function_parameter_t **anchor = ¶meters;
4539 /* did we have an earlier prototype? */
4540 entity_t *proto_type = get_entity(entity->base.symbol, NAMESPACE_NORMAL);
4541 if (proto_type != NULL && proto_type->kind != ENTITY_FUNCTION)
4544 function_parameter_t *proto_parameter = NULL;
4545 if (proto_type != NULL) {
4546 type_t *proto_type_type = proto_type->declaration.type;
4547 proto_parameter = proto_type_type->function.parameters;
4548 /* If a K&R function definition has a variadic prototype earlier, then
4549 * make the function definition variadic, too. This should conform to
4550 * §6.7.5.3:15 and §6.9.1:8. */
4551 new_type->function.variadic = proto_type_type->function.variadic;
4553 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
4555 new_type->function.unspecified_parameters = true;
4558 bool need_incompatible_warning = false;
4559 parameter = entity->function.parameters.entities;
4560 for (; parameter != NULL; parameter = parameter->base.next,
4562 proto_parameter == NULL ? NULL : proto_parameter->next) {
4563 if (parameter->kind != ENTITY_PARAMETER)
4566 type_t *parameter_type = parameter->declaration.type;
4567 if (parameter_type == NULL) {
4568 source_position_t const* const pos = ¶meter->base.source_position;
4570 errorf(pos, "no type specified for function '%N'", parameter);
4571 parameter_type = type_error_type;
4573 warningf(WARN_IMPLICIT_INT, pos, "no type specified for function parameter '%N', using 'int'", parameter);
4574 parameter_type = type_int;
4576 parameter->declaration.type = parameter_type;
4579 semantic_parameter_incomplete(parameter);
4581 /* we need the default promoted types for the function type */
4582 type_t *not_promoted = parameter_type;
4583 parameter_type = get_default_promoted_type(parameter_type);
4585 /* gcc special: if the type of the prototype matches the unpromoted
4586 * type don't promote */
4587 if (!strict_mode && proto_parameter != NULL) {
4588 type_t *proto_p_type = skip_typeref(proto_parameter->type);
4589 type_t *promo_skip = skip_typeref(parameter_type);
4590 type_t *param_skip = skip_typeref(not_promoted);
4591 if (!types_compatible(proto_p_type, promo_skip)
4592 && types_compatible(proto_p_type, param_skip)) {
4594 need_incompatible_warning = true;
4595 parameter_type = not_promoted;
4598 function_parameter_t *const function_parameter
4599 = allocate_parameter(parameter_type);
4601 *anchor = function_parameter;
4602 anchor = &function_parameter->next;
4605 new_type->function.parameters = parameters;
4606 new_type = identify_new_type(new_type);
4608 if (need_incompatible_warning) {
4609 symbol_t const *const sym = entity->base.symbol;
4610 source_position_t const *const pos = &entity->base.source_position;
4611 source_position_t const *const ppos = &proto_type->base.source_position;
4612 warningf(WARN_OTHER, pos, "declaration '%#N' is incompatible with '%#T' (declared %P)", proto_type, new_type, sym, ppos);
4614 entity->declaration.type = new_type;
4616 rem_anchor_token('{');
4619 static bool first_err = true;
4622 * When called with first_err set, prints the name of the current function,
4625 static void print_in_function(void)
4629 char const *const file = current_function->base.base.source_position.input_name;
4630 diagnosticf("%s: In '%N':\n", file, (entity_t const*)current_function);
4635 * Check if all labels are defined in the current function.
4636 * Check if all labels are used in the current function.
4638 static void check_labels(void)
4640 for (const goto_statement_t *goto_statement = goto_first;
4641 goto_statement != NULL;
4642 goto_statement = goto_statement->next) {
4643 /* skip computed gotos */
4644 if (goto_statement->expression != NULL)
4647 label_t *label = goto_statement->label;
4648 if (label->base.source_position.input_name == NULL) {
4649 print_in_function();
4650 source_position_t const *const pos = &goto_statement->base.source_position;
4651 errorf(pos, "'%N' used but not defined", (entity_t const*)label);
4655 if (is_warn_on(WARN_UNUSED_LABEL)) {
4656 for (const label_statement_t *label_statement = label_first;
4657 label_statement != NULL;
4658 label_statement = label_statement->next) {
4659 label_t *label = label_statement->label;
4661 if (! label->used) {
4662 print_in_function();
4663 source_position_t const *const pos = &label_statement->base.source_position;
4664 warningf(WARN_UNUSED_LABEL, pos, "'%N' defined but not used", (entity_t const*)label);
4670 static void warn_unused_entity(warning_t const why, entity_t *entity, entity_t *const last)
4672 entity_t const *const end = last != NULL ? last->base.next : NULL;
4673 for (; entity != end; entity = entity->base.next) {
4674 if (!is_declaration(entity))
4677 declaration_t *declaration = &entity->declaration;
4678 if (declaration->implicit)
4681 if (!declaration->used) {
4682 print_in_function();
4683 warningf(why, &entity->base.source_position, "'%N' is unused", entity);
4684 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
4685 print_in_function();
4686 warningf(why, &entity->base.source_position, "'%N' is never read", entity);
4691 static void check_unused_variables(statement_t *const stmt, void *const env)
4695 switch (stmt->kind) {
4696 case STATEMENT_DECLARATION: {
4697 declaration_statement_t const *const decls = &stmt->declaration;
4698 warn_unused_entity(WARN_UNUSED_VARIABLE, decls->declarations_begin, decls->declarations_end);
4703 warn_unused_entity(WARN_UNUSED_VARIABLE, stmt->fors.scope.entities, NULL);
4712 * Check declarations of current_function for unused entities.
4714 static void check_declarations(void)
4716 if (is_warn_on(WARN_UNUSED_PARAMETER)) {
4717 const scope_t *scope = ¤t_function->parameters;
4719 /* do not issue unused warnings for main */
4720 if (!is_sym_main(current_function->base.base.symbol)) {
4721 warn_unused_entity(WARN_UNUSED_PARAMETER, scope->entities, NULL);
4724 if (is_warn_on(WARN_UNUSED_VARIABLE)) {
4725 walk_statements(current_function->statement, check_unused_variables,
4730 static int determine_truth(expression_t const* const cond)
4733 is_constant_expression(cond) != EXPR_CLASS_CONSTANT ? 0 :
4734 fold_constant_to_bool(cond) ? 1 :
4738 static void check_reachable(statement_t *);
4739 static bool reaches_end;
4741 static bool expression_returns(expression_t const *const expr)
4743 switch (expr->kind) {
4745 expression_t const *const func = expr->call.function;
4746 if (func->kind == EXPR_REFERENCE) {
4747 entity_t *entity = func->reference.entity;
4748 if (entity->kind == ENTITY_FUNCTION
4749 && entity->declaration.modifiers & DM_NORETURN)
4753 if (!expression_returns(func))
4756 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
4757 if (!expression_returns(arg->expression))
4764 case EXPR_REFERENCE:
4765 case EXPR_REFERENCE_ENUM_VALUE:
4767 case EXPR_STRING_LITERAL:
4768 case EXPR_WIDE_STRING_LITERAL:
4769 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
4770 case EXPR_LABEL_ADDRESS:
4771 case EXPR_CLASSIFY_TYPE:
4772 case EXPR_SIZEOF: // TODO handle obscure VLA case
4775 case EXPR_BUILTIN_CONSTANT_P:
4776 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
4781 case EXPR_STATEMENT: {
4782 bool old_reaches_end = reaches_end;
4783 reaches_end = false;
4784 check_reachable(expr->statement.statement);
4785 bool returns = reaches_end;
4786 reaches_end = old_reaches_end;
4790 case EXPR_CONDITIONAL:
4791 // TODO handle constant expression
4793 if (!expression_returns(expr->conditional.condition))
4796 if (expr->conditional.true_expression != NULL
4797 && expression_returns(expr->conditional.true_expression))
4800 return expression_returns(expr->conditional.false_expression);
4803 return expression_returns(expr->select.compound);
4805 case EXPR_ARRAY_ACCESS:
4807 expression_returns(expr->array_access.array_ref) &&
4808 expression_returns(expr->array_access.index);
4811 return expression_returns(expr->va_starte.ap);
4814 return expression_returns(expr->va_arge.ap);
4817 return expression_returns(expr->va_copye.src);
4819 EXPR_UNARY_CASES_MANDATORY
4820 return expression_returns(expr->unary.value);
4822 case EXPR_UNARY_THROW:
4826 // TODO handle constant lhs of && and ||
4828 expression_returns(expr->binary.left) &&
4829 expression_returns(expr->binary.right);
4832 panic("unhandled expression");
4835 static bool initializer_returns(initializer_t const *const init)
4837 switch (init->kind) {
4838 case INITIALIZER_VALUE:
4839 return expression_returns(init->value.value);
4841 case INITIALIZER_LIST: {
4842 initializer_t * const* i = init->list.initializers;
4843 initializer_t * const* const end = i + init->list.len;
4844 bool returns = true;
4845 for (; i != end; ++i) {
4846 if (!initializer_returns(*i))
4852 case INITIALIZER_STRING:
4853 case INITIALIZER_WIDE_STRING:
4854 case INITIALIZER_DESIGNATOR: // designators have no payload
4857 panic("unhandled initializer");
4860 static bool noreturn_candidate;
4862 static void check_reachable(statement_t *const stmt)
4864 if (stmt->base.reachable)
4866 if (stmt->kind != STATEMENT_DO_WHILE)
4867 stmt->base.reachable = true;
4869 statement_t *last = stmt;
4871 switch (stmt->kind) {
4872 case STATEMENT_ERROR:
4873 case STATEMENT_EMPTY:
4875 next = stmt->base.next;
4878 case STATEMENT_DECLARATION: {
4879 declaration_statement_t const *const decl = &stmt->declaration;
4880 entity_t const * ent = decl->declarations_begin;
4881 entity_t const *const last_decl = decl->declarations_end;
4883 for (;; ent = ent->base.next) {
4884 if (ent->kind == ENTITY_VARIABLE &&
4885 ent->variable.initializer != NULL &&
4886 !initializer_returns(ent->variable.initializer)) {
4889 if (ent == last_decl)
4893 next = stmt->base.next;
4897 case STATEMENT_COMPOUND:
4898 next = stmt->compound.statements;
4900 next = stmt->base.next;
4903 case STATEMENT_RETURN: {
4904 expression_t const *const val = stmt->returns.value;
4905 if (val == NULL || expression_returns(val))
4906 noreturn_candidate = false;
4910 case STATEMENT_IF: {
4911 if_statement_t const *const ifs = &stmt->ifs;
4912 expression_t const *const cond = ifs->condition;
4914 if (!expression_returns(cond))
4917 int const val = determine_truth(cond);
4920 check_reachable(ifs->true_statement);
4925 if (ifs->false_statement != NULL) {
4926 check_reachable(ifs->false_statement);
4930 next = stmt->base.next;
4934 case STATEMENT_SWITCH: {
4935 switch_statement_t const *const switchs = &stmt->switchs;
4936 expression_t const *const expr = switchs->expression;
4938 if (!expression_returns(expr))
4941 if (is_constant_expression(expr) == EXPR_CLASS_CONSTANT) {
4942 long const val = fold_constant_to_int(expr);
4943 case_label_statement_t * defaults = NULL;
4944 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4945 if (i->expression == NULL) {
4950 if (i->first_case <= val && val <= i->last_case) {
4951 check_reachable((statement_t*)i);
4956 if (defaults != NULL) {
4957 check_reachable((statement_t*)defaults);
4961 bool has_default = false;
4962 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4963 if (i->expression == NULL)
4966 check_reachable((statement_t*)i);
4973 next = stmt->base.next;
4977 case STATEMENT_EXPRESSION: {
4978 /* Check for noreturn function call */
4979 expression_t const *const expr = stmt->expression.expression;
4980 if (!expression_returns(expr))
4983 next = stmt->base.next;
4987 case STATEMENT_CONTINUE:
4988 for (statement_t *parent = stmt;;) {
4989 parent = parent->base.parent;
4990 if (parent == NULL) /* continue not within loop */
4994 switch (parent->kind) {
4995 case STATEMENT_WHILE: goto continue_while;
4996 case STATEMENT_DO_WHILE: goto continue_do_while;
4997 case STATEMENT_FOR: goto continue_for;
5003 case STATEMENT_BREAK:
5004 for (statement_t *parent = stmt;;) {
5005 parent = parent->base.parent;
5006 if (parent == NULL) /* break not within loop/switch */
5009 switch (parent->kind) {
5010 case STATEMENT_SWITCH:
5011 case STATEMENT_WHILE:
5012 case STATEMENT_DO_WHILE:
5015 next = parent->base.next;
5016 goto found_break_parent;
5024 case STATEMENT_GOTO:
5025 if (stmt->gotos.expression) {
5026 if (!expression_returns(stmt->gotos.expression))
5029 statement_t *parent = stmt->base.parent;
5030 if (parent == NULL) /* top level goto */
5034 next = stmt->gotos.label->statement;
5035 if (next == NULL) /* missing label */
5040 case STATEMENT_LABEL:
5041 next = stmt->label.statement;
5044 case STATEMENT_CASE_LABEL:
5045 next = stmt->case_label.statement;
5048 case STATEMENT_WHILE: {
5049 while_statement_t const *const whiles = &stmt->whiles;
5050 expression_t const *const cond = whiles->condition;
5052 if (!expression_returns(cond))
5055 int const val = determine_truth(cond);
5058 check_reachable(whiles->body);
5063 next = stmt->base.next;
5067 case STATEMENT_DO_WHILE:
5068 next = stmt->do_while.body;
5071 case STATEMENT_FOR: {
5072 for_statement_t *const fors = &stmt->fors;
5074 if (fors->condition_reachable)
5076 fors->condition_reachable = true;
5078 expression_t const *const cond = fors->condition;
5083 } else if (expression_returns(cond)) {
5084 val = determine_truth(cond);
5090 check_reachable(fors->body);
5095 next = stmt->base.next;
5099 case STATEMENT_MS_TRY: {
5100 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5101 check_reachable(ms_try->try_statement);
5102 next = ms_try->final_statement;
5106 case STATEMENT_LEAVE: {
5107 statement_t *parent = stmt;
5109 parent = parent->base.parent;
5110 if (parent == NULL) /* __leave not within __try */
5113 if (parent->kind == STATEMENT_MS_TRY) {
5115 next = parent->ms_try.final_statement;
5123 panic("invalid statement kind");
5126 while (next == NULL) {
5127 next = last->base.parent;
5129 noreturn_candidate = false;
5131 type_t *const type = skip_typeref(current_function->base.type);
5132 assert(is_type_function(type));
5133 type_t *const ret = skip_typeref(type->function.return_type);
5134 if (!is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
5135 is_type_valid(ret) &&
5136 !is_sym_main(current_function->base.base.symbol)) {
5137 source_position_t const *const pos = &stmt->base.source_position;
5138 warningf(WARN_RETURN_TYPE, pos, "control reaches end of non-void function");
5143 switch (next->kind) {
5144 case STATEMENT_ERROR:
5145 case STATEMENT_EMPTY:
5146 case STATEMENT_DECLARATION:
5147 case STATEMENT_EXPRESSION:
5149 case STATEMENT_RETURN:
5150 case STATEMENT_CONTINUE:
5151 case STATEMENT_BREAK:
5152 case STATEMENT_GOTO:
5153 case STATEMENT_LEAVE:
5154 panic("invalid control flow in function");
5156 case STATEMENT_COMPOUND:
5157 if (next->compound.stmt_expr) {
5163 case STATEMENT_SWITCH:
5164 case STATEMENT_LABEL:
5165 case STATEMENT_CASE_LABEL:
5167 next = next->base.next;
5170 case STATEMENT_WHILE: {
5172 if (next->base.reachable)
5174 next->base.reachable = true;
5176 while_statement_t const *const whiles = &next->whiles;
5177 expression_t const *const cond = whiles->condition;
5179 if (!expression_returns(cond))
5182 int const val = determine_truth(cond);
5185 check_reachable(whiles->body);
5191 next = next->base.next;
5195 case STATEMENT_DO_WHILE: {
5197 if (next->base.reachable)
5199 next->base.reachable = true;
5201 do_while_statement_t const *const dw = &next->do_while;
5202 expression_t const *const cond = dw->condition;
5204 if (!expression_returns(cond))
5207 int const val = determine_truth(cond);
5210 check_reachable(dw->body);
5216 next = next->base.next;
5220 case STATEMENT_FOR: {
5222 for_statement_t *const fors = &next->fors;
5224 fors->step_reachable = true;
5226 if (fors->condition_reachable)
5228 fors->condition_reachable = true;
5230 expression_t const *const cond = fors->condition;
5235 } else if (expression_returns(cond)) {
5236 val = determine_truth(cond);
5242 check_reachable(fors->body);
5248 next = next->base.next;
5252 case STATEMENT_MS_TRY:
5254 next = next->ms_try.final_statement;
5259 check_reachable(next);
5262 static void check_unreachable(statement_t* const stmt, void *const env)
5266 switch (stmt->kind) {
5267 case STATEMENT_DO_WHILE:
5268 if (!stmt->base.reachable) {
5269 expression_t const *const cond = stmt->do_while.condition;
5270 if (determine_truth(cond) >= 0) {
5271 source_position_t const *const pos = &cond->base.source_position;
5272 warningf(WARN_UNREACHABLE_CODE, pos, "condition of do-while-loop is unreachable");
5277 case STATEMENT_FOR: {
5278 for_statement_t const* const fors = &stmt->fors;
5280 // if init and step are unreachable, cond is unreachable, too
5281 if (!stmt->base.reachable && !fors->step_reachable) {
5282 goto warn_unreachable;
5284 if (!stmt->base.reachable && fors->initialisation != NULL) {
5285 source_position_t const *const pos = &fors->initialisation->base.source_position;
5286 warningf(WARN_UNREACHABLE_CODE, pos, "initialisation of for-statement is unreachable");
5289 if (!fors->condition_reachable && fors->condition != NULL) {
5290 source_position_t const *const pos = &fors->condition->base.source_position;
5291 warningf(WARN_UNREACHABLE_CODE, pos, "condition of for-statement is unreachable");
5294 if (!fors->step_reachable && fors->step != NULL) {
5295 source_position_t const *const pos = &fors->step->base.source_position;
5296 warningf(WARN_UNREACHABLE_CODE, pos, "step of for-statement is unreachable");
5302 case STATEMENT_COMPOUND:
5303 if (stmt->compound.statements != NULL)
5305 goto warn_unreachable;
5307 case STATEMENT_DECLARATION: {
5308 /* Only warn if there is at least one declarator with an initializer.
5309 * This typically occurs in switch statements. */
5310 declaration_statement_t const *const decl = &stmt->declaration;
5311 entity_t const * ent = decl->declarations_begin;
5312 entity_t const *const last = decl->declarations_end;
5314 for (;; ent = ent->base.next) {
5315 if (ent->kind == ENTITY_VARIABLE &&
5316 ent->variable.initializer != NULL) {
5317 goto warn_unreachable;
5327 if (!stmt->base.reachable) {
5328 source_position_t const *const pos = &stmt->base.source_position;
5329 warningf(WARN_UNREACHABLE_CODE, pos, "statement is unreachable");
5335 static void parse_external_declaration(void)
5337 /* function-definitions and declarations both start with declaration
5339 add_anchor_token(';');
5340 declaration_specifiers_t specifiers;
5341 parse_declaration_specifiers(&specifiers);
5342 rem_anchor_token(';');
5344 /* must be a declaration */
5345 if (token.kind == ';') {
5346 parse_anonymous_declaration_rest(&specifiers);
5350 add_anchor_token(',');
5351 add_anchor_token('=');
5352 add_anchor_token(';');
5353 add_anchor_token('{');
5355 /* declarator is common to both function-definitions and declarations */
5356 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
5358 rem_anchor_token('{');
5359 rem_anchor_token(';');
5360 rem_anchor_token('=');
5361 rem_anchor_token(',');
5363 /* must be a declaration */
5364 switch (token.kind) {
5368 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
5373 /* must be a function definition */
5374 parse_kr_declaration_list(ndeclaration);
5376 if (token.kind != '{') {
5377 parse_error_expected("while parsing function definition", '{', NULL);
5378 eat_until_matching_token(';');
5382 assert(is_declaration(ndeclaration));
5383 type_t *const orig_type = ndeclaration->declaration.type;
5384 type_t * type = skip_typeref(orig_type);
5386 if (!is_type_function(type)) {
5387 if (is_type_valid(type)) {
5388 errorf(HERE, "declarator '%#N' has a body but is not a function type", ndeclaration);
5394 source_position_t const *const pos = &ndeclaration->base.source_position;
5395 if (is_typeref(orig_type)) {
5397 errorf(pos, "type of function definition '%#N' is a typedef", ndeclaration);
5400 if (is_type_compound(skip_typeref(type->function.return_type))) {
5401 warningf(WARN_AGGREGATE_RETURN, pos, "'%N' returns an aggregate", ndeclaration);
5403 if (type->function.unspecified_parameters) {
5404 warningf(WARN_OLD_STYLE_DEFINITION, pos, "old-style definition of '%N'", ndeclaration);
5406 warningf(WARN_TRADITIONAL, pos, "traditional C rejects ISO C style definition of '%N'", ndeclaration);
5409 /* §6.7.5.3:14 a function definition with () means no
5410 * parameters (and not unspecified parameters) */
5411 if (type->function.unspecified_parameters &&
5412 type->function.parameters == NULL) {
5413 type_t *copy = duplicate_type(type);
5414 copy->function.unspecified_parameters = false;
5415 type = identify_new_type(copy);
5417 ndeclaration->declaration.type = type;
5420 entity_t *const entity = record_entity(ndeclaration, true);
5421 assert(entity->kind == ENTITY_FUNCTION);
5422 assert(ndeclaration->kind == ENTITY_FUNCTION);
5424 function_t *const function = &entity->function;
5425 if (ndeclaration != entity) {
5426 function->parameters = ndeclaration->function.parameters;
5428 assert(is_declaration(entity));
5429 type = skip_typeref(entity->declaration.type);
5431 PUSH_SCOPE(&function->parameters);
5433 entity_t *parameter = function->parameters.entities;
5434 for (; parameter != NULL; parameter = parameter->base.next) {
5435 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5436 parameter->base.parent_scope = current_scope;
5438 assert(parameter->base.parent_scope == NULL
5439 || parameter->base.parent_scope == current_scope);
5440 parameter->base.parent_scope = current_scope;
5441 if (parameter->base.symbol == NULL) {
5442 errorf(¶meter->base.source_position, "parameter name omitted");
5445 environment_push(parameter);
5448 if (function->statement != NULL) {
5449 parser_error_multiple_definition(entity, HERE);
5452 /* parse function body */
5453 int label_stack_top = label_top();
5454 function_t *old_current_function = current_function;
5455 entity_t *old_current_entity = current_entity;
5456 current_function = function;
5457 current_entity = entity;
5461 goto_anchor = &goto_first;
5463 label_anchor = &label_first;
5465 statement_t *const body = parse_compound_statement(false);
5466 function->statement = body;
5469 check_declarations();
5470 if (is_warn_on(WARN_RETURN_TYPE) ||
5471 is_warn_on(WARN_UNREACHABLE_CODE) ||
5472 (is_warn_on(WARN_MISSING_NORETURN) && !(function->base.modifiers & DM_NORETURN))) {
5473 noreturn_candidate = true;
5474 check_reachable(body);
5475 if (is_warn_on(WARN_UNREACHABLE_CODE))
5476 walk_statements(body, check_unreachable, NULL);
5477 if (noreturn_candidate &&
5478 !(function->base.modifiers & DM_NORETURN)) {
5479 source_position_t const *const pos = &body->base.source_position;
5480 warningf(WARN_MISSING_NORETURN, pos, "function '%#N' is candidate for attribute 'noreturn'", entity);
5485 assert(current_function == function);
5486 assert(current_entity == entity);
5487 current_entity = old_current_entity;
5488 current_function = old_current_function;
5489 label_pop_to(label_stack_top);
5495 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
5497 entity_t *iter = compound->members.entities;
5498 for (; iter != NULL; iter = iter->base.next) {
5499 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5502 if (iter->base.symbol == symbol) {
5504 } else if (iter->base.symbol == NULL) {
5505 /* search in anonymous structs and unions */
5506 type_t *type = skip_typeref(iter->declaration.type);
5507 if (is_type_compound(type)) {
5508 if (find_compound_entry(type->compound.compound, symbol)
5519 static void check_deprecated(const source_position_t *source_position,
5520 const entity_t *entity)
5522 if (!is_declaration(entity))
5524 if ((entity->declaration.modifiers & DM_DEPRECATED) == 0)
5527 source_position_t const *const epos = &entity->base.source_position;
5528 char const *const msg = get_deprecated_string(entity->declaration.attributes);
5530 warningf(WARN_DEPRECATED_DECLARATIONS, source_position, "'%N' is deprecated (declared %P): \"%s\"", entity, epos, msg);
5532 warningf(WARN_DEPRECATED_DECLARATIONS, source_position, "'%N' is deprecated (declared %P)", entity, epos);
5537 static expression_t *create_select(const source_position_t *pos,
5539 type_qualifiers_t qualifiers,
5542 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
5544 check_deprecated(pos, entry);
5546 expression_t *select = allocate_expression_zero(EXPR_SELECT);
5547 select->select.compound = addr;
5548 select->select.compound_entry = entry;
5550 type_t *entry_type = entry->declaration.type;
5551 type_t *res_type = get_qualified_type(entry_type, qualifiers);
5553 /* bitfields need special treatment */
5554 if (entry->compound_member.bitfield) {
5555 unsigned bit_size = entry->compound_member.bit_size;
5556 /* if fewer bits than an int, convert to int (see §6.3.1.1) */
5557 if (bit_size < get_atomic_type_size(ATOMIC_TYPE_INT) * BITS_PER_BYTE) {
5558 res_type = type_int;
5562 /* we always do the auto-type conversions; the & and sizeof parser contains
5563 * code to revert this! */
5564 select->base.type = automatic_type_conversion(res_type);
5571 * Find entry with symbol in compound. Search anonymous structs and unions and
5572 * creates implicit select expressions for them.
5573 * Returns the adress for the innermost compound.
5575 static expression_t *find_create_select(const source_position_t *pos,
5577 type_qualifiers_t qualifiers,
5578 compound_t *compound, symbol_t *symbol)
5580 entity_t *iter = compound->members.entities;
5581 for (; iter != NULL; iter = iter->base.next) {
5582 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5585 symbol_t *iter_symbol = iter->base.symbol;
5586 if (iter_symbol == NULL) {
5587 type_t *type = iter->declaration.type;
5588 if (type->kind != TYPE_COMPOUND_STRUCT
5589 && type->kind != TYPE_COMPOUND_UNION)
5592 compound_t *sub_compound = type->compound.compound;
5594 if (find_compound_entry(sub_compound, symbol) == NULL)
5597 expression_t *sub_addr = create_select(pos, addr, qualifiers, iter);
5598 sub_addr->base.source_position = *pos;
5599 sub_addr->base.implicit = true;
5600 return find_create_select(pos, sub_addr, qualifiers, sub_compound,
5604 if (iter_symbol == symbol) {
5605 return create_select(pos, addr, qualifiers, iter);
5612 static void parse_bitfield_member(entity_t *entity)
5616 expression_t *size = parse_constant_expression();
5619 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5620 type_t *type = entity->declaration.type;
5621 if (!is_type_integer(skip_typeref(type))) {
5622 errorf(HERE, "bitfield base type '%T' is not an integer type",
5626 if (is_constant_expression(size) != EXPR_CLASS_CONSTANT) {
5627 /* error already reported by parse_constant_expression */
5628 size_long = get_type_size(type) * 8;
5630 size_long = fold_constant_to_int(size);
5632 const symbol_t *symbol = entity->base.symbol;
5633 const symbol_t *user_symbol
5634 = symbol == NULL ? sym_anonymous : symbol;
5635 unsigned bit_size = get_type_size(type) * 8;
5636 if (size_long < 0) {
5637 errorf(HERE, "negative width in bit-field '%Y'", user_symbol);
5638 } else if (size_long == 0 && symbol != NULL) {
5639 errorf(HERE, "zero width for bit-field '%Y'", user_symbol);
5640 } else if (bit_size > 0 && (unsigned)size_long > bit_size) {
5641 errorf(HERE, "width of bitfield '%Y' exceeds its type",
5644 /* hope that people don't invent crazy types with more bits
5645 * than our struct can hold */
5647 (1 << sizeof(entity->compound_member.bit_size)*8));
5651 entity->compound_member.bitfield = true;
5652 entity->compound_member.bit_size = (unsigned char)size_long;
5655 static void parse_compound_declarators(compound_t *compound,
5656 const declaration_specifiers_t *specifiers)
5661 if (token.kind == ':') {
5662 /* anonymous bitfield */
5663 type_t *type = specifiers->type;
5664 entity_t *entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER,
5665 NAMESPACE_NORMAL, NULL);
5666 entity->base.source_position = *HERE;
5667 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
5668 entity->declaration.storage_class = STORAGE_CLASS_NONE;
5669 entity->declaration.type = type;
5671 parse_bitfield_member(entity);
5673 attribute_t *attributes = parse_attributes(NULL);
5674 attribute_t **anchor = &attributes;
5675 while (*anchor != NULL)
5676 anchor = &(*anchor)->next;
5677 *anchor = specifiers->attributes;
5678 if (attributes != NULL) {
5679 handle_entity_attributes(attributes, entity);
5681 entity->declaration.attributes = attributes;
5683 append_entity(&compound->members, entity);
5685 entity = parse_declarator(specifiers,
5686 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
5687 source_position_t const *const pos = &entity->base.source_position;
5688 if (entity->kind == ENTITY_TYPEDEF) {
5689 errorf(pos, "typedef not allowed as compound member");
5691 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5693 /* make sure we don't define a symbol multiple times */
5694 symbol_t *symbol = entity->base.symbol;
5695 if (symbol != NULL) {
5696 entity_t *prev = find_compound_entry(compound, symbol);
5698 source_position_t const *const ppos = &prev->base.source_position;
5699 errorf(pos, "multiple declarations of symbol '%Y' (declared %P)", symbol, ppos);
5703 if (token.kind == ':') {
5704 parse_bitfield_member(entity);
5706 attribute_t *attributes = parse_attributes(NULL);
5707 handle_entity_attributes(attributes, entity);
5709 type_t *orig_type = entity->declaration.type;
5710 type_t *type = skip_typeref(orig_type);
5711 if (is_type_function(type)) {
5712 errorf(pos, "'%N' must not have function type '%T'", entity, orig_type);
5713 } else if (is_type_incomplete(type)) {
5714 /* §6.7.2.1:16 flexible array member */
5715 if (!is_type_array(type) ||
5716 token.kind != ';' ||
5717 look_ahead(1)->kind != '}') {
5718 errorf(pos, "'%N' has incomplete type '%T'", entity, orig_type);
5723 append_entity(&compound->members, entity);
5726 } while (next_if(','));
5727 expect(';', end_error);
5730 anonymous_entity = NULL;
5733 static void parse_compound_type_entries(compound_t *compound)
5736 add_anchor_token('}');
5739 switch (token.kind) {
5741 case T___extension__:
5742 case T_IDENTIFIER: {
5744 declaration_specifiers_t specifiers;
5745 parse_declaration_specifiers(&specifiers);
5746 parse_compound_declarators(compound, &specifiers);
5752 rem_anchor_token('}');
5753 expect('}', end_error);
5756 compound->complete = true;
5762 static type_t *parse_typename(void)
5764 declaration_specifiers_t specifiers;
5765 parse_declaration_specifiers(&specifiers);
5766 if (specifiers.storage_class != STORAGE_CLASS_NONE
5767 || specifiers.thread_local) {
5768 /* TODO: improve error message, user does probably not know what a
5769 * storage class is...
5771 errorf(&specifiers.source_position, "typename must not have a storage class");
5774 type_t *result = parse_abstract_declarator(specifiers.type);
5782 typedef expression_t* (*parse_expression_function)(void);
5783 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
5785 typedef struct expression_parser_function_t expression_parser_function_t;
5786 struct expression_parser_function_t {
5787 parse_expression_function parser;
5788 precedence_t infix_precedence;
5789 parse_expression_infix_function infix_parser;
5792 static expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5795 * Prints an error message if an expression was expected but not read
5797 static expression_t *expected_expression_error(void)
5799 /* skip the error message if the error token was read */
5800 if (token.kind != T_ERROR) {
5801 errorf(HERE, "expected expression, got token %K", &token);
5805 return create_error_expression();
5808 static type_t *get_string_type(void)
5810 return is_warn_on(WARN_WRITE_STRINGS) ? type_const_char_ptr : type_char_ptr;
5813 static type_t *get_wide_string_type(void)
5815 return is_warn_on(WARN_WRITE_STRINGS) ? type_const_wchar_t_ptr : type_wchar_t_ptr;
5819 * Parse a string constant.
5821 static expression_t *parse_string_literal(void)
5823 source_position_t begin = token.base.source_position;
5824 string_t res = token.string.string;
5825 bool is_wide = (token.kind == T_WIDE_STRING_LITERAL);
5828 while (token.kind == T_STRING_LITERAL
5829 || token.kind == T_WIDE_STRING_LITERAL) {
5830 warn_string_concat(&token.base.source_position);
5831 res = concat_strings(&res, &token.string.string);
5833 is_wide |= token.kind == T_WIDE_STRING_LITERAL;
5836 expression_t *literal;
5838 literal = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
5839 literal->base.type = get_wide_string_type();
5841 literal = allocate_expression_zero(EXPR_STRING_LITERAL);
5842 literal->base.type = get_string_type();
5844 literal->base.source_position = begin;
5845 literal->literal.value = res;
5851 * Parse a boolean constant.
5853 static expression_t *parse_boolean_literal(bool value)
5855 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_BOOLEAN);
5856 literal->base.type = type_bool;
5857 literal->literal.value.begin = value ? "true" : "false";
5858 literal->literal.value.size = value ? 4 : 5;
5864 static void warn_traditional_suffix(void)
5866 warningf(WARN_TRADITIONAL, HERE, "traditional C rejects the '%S' suffix",
5867 &token.number.suffix);
5870 static void check_integer_suffix(void)
5872 const string_t *suffix = &token.number.suffix;
5873 if (suffix->size == 0)
5876 bool not_traditional = false;
5877 const char *c = suffix->begin;
5878 if (*c == 'l' || *c == 'L') {
5881 not_traditional = true;
5883 if (*c == 'u' || *c == 'U') {
5886 } else if (*c == 'u' || *c == 'U') {
5887 not_traditional = true;
5890 } else if (*c == 'u' || *c == 'U') {
5891 not_traditional = true;
5893 if (*c == 'l' || *c == 'L') {
5901 errorf(&token.base.source_position,
5902 "invalid suffix '%S' on integer constant", suffix);
5903 } else if (not_traditional) {
5904 warn_traditional_suffix();
5908 static type_t *check_floatingpoint_suffix(void)
5910 const string_t *suffix = &token.number.suffix;
5911 type_t *type = type_double;
5912 if (suffix->size == 0)
5915 bool not_traditional = false;
5916 const char *c = suffix->begin;
5917 if (*c == 'f' || *c == 'F') {
5920 } else if (*c == 'l' || *c == 'L') {
5922 type = type_long_double;
5925 errorf(&token.base.source_position,
5926 "invalid suffix '%S' on floatingpoint constant", suffix);
5927 } else if (not_traditional) {
5928 warn_traditional_suffix();
5935 * Parse an integer constant.
5937 static expression_t *parse_number_literal(void)
5939 expression_kind_t kind;
5942 switch (token.kind) {
5944 kind = EXPR_LITERAL_INTEGER;
5945 check_integer_suffix();
5948 case T_INTEGER_OCTAL:
5949 kind = EXPR_LITERAL_INTEGER_OCTAL;
5950 check_integer_suffix();
5953 case T_INTEGER_HEXADECIMAL:
5954 kind = EXPR_LITERAL_INTEGER_HEXADECIMAL;
5955 check_integer_suffix();
5958 case T_FLOATINGPOINT:
5959 kind = EXPR_LITERAL_FLOATINGPOINT;
5960 type = check_floatingpoint_suffix();
5962 case T_FLOATINGPOINT_HEXADECIMAL:
5963 kind = EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL;
5964 type = check_floatingpoint_suffix();
5967 panic("unexpected token type in parse_number_literal");
5970 expression_t *literal = allocate_expression_zero(kind);
5971 literal->base.type = type;
5972 literal->literal.value = token.number.number;
5973 literal->literal.suffix = token.number.suffix;
5976 /* integer type depends on the size of the number and the size
5977 * representable by the types. The backend/codegeneration has to determine
5980 determine_literal_type(&literal->literal);
5985 * Parse a character constant.
5987 static expression_t *parse_character_constant(void)
5989 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_CHARACTER);
5990 literal->base.type = c_mode & _CXX ? type_char : type_int;
5991 literal->literal.value = token.string.string;
5993 size_t len = literal->literal.value.size;
5995 if (!GNU_MODE && !(c_mode & _C99)) {
5996 errorf(HERE, "more than 1 character in character constant");
5998 literal->base.type = type_int;
5999 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
6008 * Parse a wide character constant.
6010 static expression_t *parse_wide_character_constant(void)
6012 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_WIDE_CHARACTER);
6013 literal->base.type = type_int;
6014 literal->literal.value = token.string.string;
6016 size_t len = wstrlen(&literal->literal.value);
6018 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
6025 static entity_t *create_implicit_function(symbol_t *symbol,
6026 const source_position_t *source_position)
6028 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
6029 ntype->function.return_type = type_int;
6030 ntype->function.unspecified_parameters = true;
6031 ntype->function.linkage = LINKAGE_C;
6032 type_t *type = identify_new_type(ntype);
6034 entity_t *const entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, symbol);
6035 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
6036 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
6037 entity->declaration.type = type;
6038 entity->declaration.implicit = true;
6039 entity->base.source_position = *source_position;
6041 if (current_scope != NULL)
6042 record_entity(entity, false);
6048 * Performs automatic type cast as described in §6.3.2.1.
6050 * @param orig_type the original type
6052 static type_t *automatic_type_conversion(type_t *orig_type)
6054 type_t *type = skip_typeref(orig_type);
6055 if (is_type_array(type)) {
6056 array_type_t *array_type = &type->array;
6057 type_t *element_type = array_type->element_type;
6058 unsigned qualifiers = array_type->base.qualifiers;
6060 return make_pointer_type(element_type, qualifiers);
6063 if (is_type_function(type)) {
6064 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6071 * reverts the automatic casts of array to pointer types and function
6072 * to function-pointer types as defined §6.3.2.1
6074 type_t *revert_automatic_type_conversion(const expression_t *expression)
6076 switch (expression->kind) {
6077 case EXPR_REFERENCE: {
6078 entity_t *entity = expression->reference.entity;
6079 if (is_declaration(entity)) {
6080 return entity->declaration.type;
6081 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6082 return entity->enum_value.enum_type;
6084 panic("no declaration or enum in reference");
6089 entity_t *entity = expression->select.compound_entry;
6090 assert(is_declaration(entity));
6091 type_t *type = entity->declaration.type;
6092 return get_qualified_type(type, expression->base.type->base.qualifiers);
6095 case EXPR_UNARY_DEREFERENCE: {
6096 const expression_t *const value = expression->unary.value;
6097 type_t *const type = skip_typeref(value->base.type);
6098 if (!is_type_pointer(type))
6099 return type_error_type;
6100 return type->pointer.points_to;
6103 case EXPR_ARRAY_ACCESS: {
6104 const expression_t *array_ref = expression->array_access.array_ref;
6105 type_t *type_left = skip_typeref(array_ref->base.type);
6106 if (!is_type_pointer(type_left))
6107 return type_error_type;
6108 return type_left->pointer.points_to;
6111 case EXPR_STRING_LITERAL: {
6112 size_t size = expression->string_literal.value.size;
6113 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6116 case EXPR_WIDE_STRING_LITERAL: {
6117 size_t size = wstrlen(&expression->string_literal.value);
6118 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6121 case EXPR_COMPOUND_LITERAL:
6122 return expression->compound_literal.type;
6127 return expression->base.type;
6131 * Find an entity matching a symbol in a scope.
6132 * Uses current scope if scope is NULL
6134 static entity_t *lookup_entity(const scope_t *scope, symbol_t *symbol,
6135 namespace_tag_t namespc)
6137 if (scope == NULL) {
6138 return get_entity(symbol, namespc);
6141 /* we should optimize here, if scope grows above a certain size we should
6142 construct a hashmap here... */
6143 entity_t *entity = scope->entities;
6144 for ( ; entity != NULL; entity = entity->base.next) {
6145 if (entity->base.symbol == symbol
6146 && (namespace_tag_t)entity->base.namespc == namespc)
6153 static entity_t *parse_qualified_identifier(void)
6155 /* namespace containing the symbol */
6157 source_position_t pos;
6158 const scope_t *lookup_scope = NULL;
6160 if (next_if(T_COLONCOLON))
6161 lookup_scope = &unit->scope;
6165 if (token.kind != T_IDENTIFIER) {
6166 parse_error_expected("while parsing identifier", T_IDENTIFIER, NULL);
6167 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6169 symbol = token.identifier.symbol;
6174 entity = lookup_entity(lookup_scope, symbol, NAMESPACE_NORMAL);
6176 if (!next_if(T_COLONCOLON))
6179 switch (entity->kind) {
6180 case ENTITY_NAMESPACE:
6181 lookup_scope = &entity->namespacee.members;
6186 lookup_scope = &entity->compound.members;
6189 errorf(&pos, "'%Y' must be a namespace, class, struct or union (but is a %s)",
6190 symbol, get_entity_kind_name(entity->kind));
6192 /* skip further qualifications */
6193 while (next_if(T_IDENTIFIER) && next_if(T_COLONCOLON)) {}
6195 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6199 if (entity == NULL) {
6200 if (!strict_mode && token.kind == '(') {
6201 /* an implicitly declared function */
6202 warningf(WARN_IMPLICIT_FUNCTION_DECLARATION, &pos, "implicit declaration of function '%Y'", symbol);
6203 entity = create_implicit_function(symbol, &pos);
6205 errorf(&pos, "unknown identifier '%Y' found.", symbol);
6206 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6213 static expression_t *parse_reference(void)
6215 source_position_t const pos = token.base.source_position;
6216 entity_t *const entity = parse_qualified_identifier();
6219 if (is_declaration(entity)) {
6220 orig_type = entity->declaration.type;
6221 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6222 orig_type = entity->enum_value.enum_type;
6224 panic("expected declaration or enum value in reference");
6227 /* we always do the auto-type conversions; the & and sizeof parser contains
6228 * code to revert this! */
6229 type_t *type = automatic_type_conversion(orig_type);
6231 expression_kind_t kind = EXPR_REFERENCE;
6232 if (entity->kind == ENTITY_ENUM_VALUE)
6233 kind = EXPR_REFERENCE_ENUM_VALUE;
6235 expression_t *expression = allocate_expression_zero(kind);
6236 expression->base.source_position = pos;
6237 expression->base.type = type;
6238 expression->reference.entity = entity;
6240 /* this declaration is used */
6241 if (is_declaration(entity)) {
6242 entity->declaration.used = true;
6245 if (entity->base.parent_scope != file_scope
6246 && (current_function != NULL
6247 && entity->base.parent_scope->depth < current_function->parameters.depth)
6248 && (entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER)) {
6249 if (entity->kind == ENTITY_VARIABLE) {
6250 /* access of a variable from an outer function */
6251 entity->variable.address_taken = true;
6252 } else if (entity->kind == ENTITY_PARAMETER) {
6253 entity->parameter.address_taken = true;
6255 current_function->need_closure = true;
6258 check_deprecated(&pos, entity);
6263 static bool semantic_cast(expression_t *cast)
6265 expression_t *expression = cast->unary.value;
6266 type_t *orig_dest_type = cast->base.type;
6267 type_t *orig_type_right = expression->base.type;
6268 type_t const *dst_type = skip_typeref(orig_dest_type);
6269 type_t const *src_type = skip_typeref(orig_type_right);
6270 source_position_t const *pos = &cast->base.source_position;
6272 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6273 if (dst_type == type_void)
6276 /* only integer and pointer can be casted to pointer */
6277 if (is_type_pointer(dst_type) &&
6278 !is_type_pointer(src_type) &&
6279 !is_type_integer(src_type) &&
6280 is_type_valid(src_type)) {
6281 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6285 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6286 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6290 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6291 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6295 if (is_type_pointer(src_type) && is_type_pointer(dst_type)) {
6296 type_t *src = skip_typeref(src_type->pointer.points_to);
6297 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6298 unsigned missing_qualifiers =
6299 src->base.qualifiers & ~dst->base.qualifiers;
6300 if (missing_qualifiers != 0) {
6301 warningf(WARN_CAST_QUAL, pos, "cast discards qualifiers '%Q' in pointer target type of '%T'", missing_qualifiers, orig_type_right);
6307 static expression_t *parse_compound_literal(source_position_t const *const pos, type_t *type)
6309 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6310 expression->base.source_position = *pos;
6312 parse_initializer_env_t env;
6315 env.must_be_constant = false;
6316 initializer_t *initializer = parse_initializer(&env);
6319 expression->compound_literal.initializer = initializer;
6320 expression->compound_literal.type = type;
6321 expression->base.type = automatic_type_conversion(type);
6327 * Parse a cast expression.
6329 static expression_t *parse_cast(void)
6331 source_position_t const pos = *HERE;
6334 add_anchor_token(')');
6336 type_t *type = parse_typename();
6338 rem_anchor_token(')');
6339 expect(')', end_error);
6341 if (token.kind == '{') {
6342 return parse_compound_literal(&pos, type);
6345 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6346 cast->base.source_position = pos;
6348 expression_t *value = parse_subexpression(PREC_CAST);
6349 cast->base.type = type;
6350 cast->unary.value = value;
6352 if (! semantic_cast(cast)) {
6353 /* TODO: record the error in the AST. else it is impossible to detect it */
6358 return create_error_expression();
6362 * Parse a statement expression.
6364 static expression_t *parse_statement_expression(void)
6366 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6369 add_anchor_token(')');
6371 statement_t *statement = parse_compound_statement(true);
6372 statement->compound.stmt_expr = true;
6373 expression->statement.statement = statement;
6375 /* find last statement and use its type */
6376 type_t *type = type_void;
6377 const statement_t *stmt = statement->compound.statements;
6379 while (stmt->base.next != NULL)
6380 stmt = stmt->base.next;
6382 if (stmt->kind == STATEMENT_EXPRESSION) {
6383 type = stmt->expression.expression->base.type;
6386 source_position_t const *const pos = &expression->base.source_position;
6387 warningf(WARN_OTHER, pos, "empty statement expression ({})");
6389 expression->base.type = type;
6391 rem_anchor_token(')');
6392 expect(')', end_error);
6399 * Parse a parenthesized expression.
6401 static expression_t *parse_parenthesized_expression(void)
6403 token_t const* const la1 = look_ahead(1);
6404 switch (la1->kind) {
6406 /* gcc extension: a statement expression */
6407 return parse_statement_expression();
6410 if (is_typedef_symbol(la1->identifier.symbol)) {
6412 return parse_cast();
6417 add_anchor_token(')');
6418 expression_t *result = parse_expression();
6419 result->base.parenthesized = true;
6420 rem_anchor_token(')');
6421 expect(')', end_error);
6427 static expression_t *parse_function_keyword(void)
6431 if (current_function == NULL) {
6432 errorf(HERE, "'__func__' used outside of a function");
6435 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6436 expression->base.type = type_char_ptr;
6437 expression->funcname.kind = FUNCNAME_FUNCTION;
6444 static expression_t *parse_pretty_function_keyword(void)
6446 if (current_function == NULL) {
6447 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6450 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6451 expression->base.type = type_char_ptr;
6452 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6454 eat(T___PRETTY_FUNCTION__);
6459 static expression_t *parse_funcsig_keyword(void)
6461 if (current_function == NULL) {
6462 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6465 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6466 expression->base.type = type_char_ptr;
6467 expression->funcname.kind = FUNCNAME_FUNCSIG;
6474 static expression_t *parse_funcdname_keyword(void)
6476 if (current_function == NULL) {
6477 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6480 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6481 expression->base.type = type_char_ptr;
6482 expression->funcname.kind = FUNCNAME_FUNCDNAME;
6484 eat(T___FUNCDNAME__);
6489 static designator_t *parse_designator(void)
6491 designator_t *result = allocate_ast_zero(sizeof(result[0]));
6492 result->source_position = *HERE;
6494 if (token.kind != T_IDENTIFIER) {
6495 parse_error_expected("while parsing member designator",
6496 T_IDENTIFIER, NULL);
6499 result->symbol = token.identifier.symbol;
6502 designator_t *last_designator = result;
6505 if (token.kind != T_IDENTIFIER) {
6506 parse_error_expected("while parsing member designator",
6507 T_IDENTIFIER, NULL);
6510 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6511 designator->source_position = *HERE;
6512 designator->symbol = token.identifier.symbol;
6515 last_designator->next = designator;
6516 last_designator = designator;
6520 add_anchor_token(']');
6521 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6522 designator->source_position = *HERE;
6523 designator->array_index = parse_expression();
6524 rem_anchor_token(']');
6525 expect(']', end_error);
6526 if (designator->array_index == NULL) {
6530 last_designator->next = designator;
6531 last_designator = designator;
6543 * Parse the __builtin_offsetof() expression.
6545 static expression_t *parse_offsetof(void)
6547 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6548 expression->base.type = type_size_t;
6550 eat(T___builtin_offsetof);
6552 expect('(', end_error);
6553 add_anchor_token(',');
6554 type_t *type = parse_typename();
6555 rem_anchor_token(',');
6556 expect(',', end_error);
6557 add_anchor_token(')');
6558 designator_t *designator = parse_designator();
6559 rem_anchor_token(')');
6560 expect(')', end_error);
6562 expression->offsetofe.type = type;
6563 expression->offsetofe.designator = designator;
6566 memset(&path, 0, sizeof(path));
6567 path.top_type = type;
6568 path.path = NEW_ARR_F(type_path_entry_t, 0);
6570 descend_into_subtype(&path);
6572 if (!walk_designator(&path, designator, true)) {
6573 return create_error_expression();
6576 DEL_ARR_F(path.path);
6580 return create_error_expression();
6584 * Parses a _builtin_va_start() expression.
6586 static expression_t *parse_va_start(void)
6588 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6590 eat(T___builtin_va_start);
6592 expect('(', end_error);
6593 add_anchor_token(',');
6594 expression->va_starte.ap = parse_assignment_expression();
6595 rem_anchor_token(',');
6596 expect(',', end_error);
6597 expression_t *const expr = parse_assignment_expression();
6598 if (expr->kind == EXPR_REFERENCE) {
6599 entity_t *const entity = expr->reference.entity;
6600 if (!current_function->base.type->function.variadic) {
6601 errorf(&expr->base.source_position,
6602 "'va_start' used in non-variadic function");
6603 } else if (entity->base.parent_scope != ¤t_function->parameters ||
6604 entity->base.next != NULL ||
6605 entity->kind != ENTITY_PARAMETER) {
6606 errorf(&expr->base.source_position,
6607 "second argument of 'va_start' must be last parameter of the current function");
6609 expression->va_starte.parameter = &entity->variable;
6611 expect(')', end_error);
6614 expect(')', end_error);
6616 return create_error_expression();
6620 * Parses a __builtin_va_arg() expression.
6622 static expression_t *parse_va_arg(void)
6624 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6626 eat(T___builtin_va_arg);
6628 expect('(', end_error);
6630 ap.expression = parse_assignment_expression();
6631 expression->va_arge.ap = ap.expression;
6632 check_call_argument(type_valist, &ap, 1);
6634 expect(',', end_error);
6635 expression->base.type = parse_typename();
6636 expect(')', end_error);
6640 return create_error_expression();
6644 * Parses a __builtin_va_copy() expression.
6646 static expression_t *parse_va_copy(void)
6648 expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
6650 eat(T___builtin_va_copy);
6652 expect('(', end_error);
6653 expression_t *dst = parse_assignment_expression();
6654 assign_error_t error = semantic_assign(type_valist, dst);
6655 report_assign_error(error, type_valist, dst, "call argument 1",
6656 &dst->base.source_position);
6657 expression->va_copye.dst = dst;
6659 expect(',', end_error);
6661 call_argument_t src;
6662 src.expression = parse_assignment_expression();
6663 check_call_argument(type_valist, &src, 2);
6664 expression->va_copye.src = src.expression;
6665 expect(')', end_error);
6669 return create_error_expression();
6673 * Parses a __builtin_constant_p() expression.
6675 static expression_t *parse_builtin_constant(void)
6677 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6679 eat(T___builtin_constant_p);
6681 expect('(', end_error);
6682 add_anchor_token(')');
6683 expression->builtin_constant.value = parse_assignment_expression();
6684 rem_anchor_token(')');
6685 expect(')', end_error);
6686 expression->base.type = type_int;
6690 return create_error_expression();
6694 * Parses a __builtin_types_compatible_p() expression.
6696 static expression_t *parse_builtin_types_compatible(void)
6698 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
6700 eat(T___builtin_types_compatible_p);
6702 expect('(', end_error);
6703 add_anchor_token(')');
6704 add_anchor_token(',');
6705 expression->builtin_types_compatible.left = parse_typename();
6706 rem_anchor_token(',');
6707 expect(',', end_error);
6708 expression->builtin_types_compatible.right = parse_typename();
6709 rem_anchor_token(')');
6710 expect(')', end_error);
6711 expression->base.type = type_int;
6715 return create_error_expression();
6719 * Parses a __builtin_is_*() compare expression.
6721 static expression_t *parse_compare_builtin(void)
6723 expression_t *expression;
6725 switch (token.kind) {
6726 case T___builtin_isgreater:
6727 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
6729 case T___builtin_isgreaterequal:
6730 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
6732 case T___builtin_isless:
6733 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
6735 case T___builtin_islessequal:
6736 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
6738 case T___builtin_islessgreater:
6739 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
6741 case T___builtin_isunordered:
6742 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
6745 internal_errorf(HERE, "invalid compare builtin found");
6747 expression->base.source_position = *HERE;
6750 expect('(', end_error);
6751 expression->binary.left = parse_assignment_expression();
6752 expect(',', end_error);
6753 expression->binary.right = parse_assignment_expression();
6754 expect(')', end_error);
6756 type_t *const orig_type_left = expression->binary.left->base.type;
6757 type_t *const orig_type_right = expression->binary.right->base.type;
6759 type_t *const type_left = skip_typeref(orig_type_left);
6760 type_t *const type_right = skip_typeref(orig_type_right);
6761 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6762 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6763 type_error_incompatible("invalid operands in comparison",
6764 &expression->base.source_position, orig_type_left, orig_type_right);
6767 semantic_comparison(&expression->binary);
6772 return create_error_expression();
6776 * Parses a MS assume() expression.
6778 static expression_t *parse_assume(void)
6780 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
6784 expect('(', end_error);
6785 add_anchor_token(')');
6786 expression->unary.value = parse_assignment_expression();
6787 rem_anchor_token(')');
6788 expect(')', end_error);
6790 expression->base.type = type_void;
6793 return create_error_expression();
6797 * Return the label for the current symbol or create a new one.
6799 static label_t *get_label(void)
6801 assert(token.kind == T_IDENTIFIER);
6802 assert(current_function != NULL);
6804 entity_t *label = get_entity(token.identifier.symbol, NAMESPACE_LABEL);
6805 /* If we find a local label, we already created the declaration. */
6806 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
6807 if (label->base.parent_scope != current_scope) {
6808 assert(label->base.parent_scope->depth < current_scope->depth);
6809 current_function->goto_to_outer = true;
6811 } else if (label == NULL || label->base.parent_scope != ¤t_function->parameters) {
6812 /* There is no matching label in the same function, so create a new one. */
6813 label = allocate_entity_zero(ENTITY_LABEL, NAMESPACE_LABEL, token.identifier.symbol);
6818 return &label->label;
6822 * Parses a GNU && label address expression.
6824 static expression_t *parse_label_address(void)
6826 source_position_t source_position = token.base.source_position;
6828 if (token.kind != T_IDENTIFIER) {
6829 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
6830 return create_error_expression();
6833 label_t *const label = get_label();
6835 label->address_taken = true;
6837 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
6838 expression->base.source_position = source_position;
6840 /* label address is treated as a void pointer */
6841 expression->base.type = type_void_ptr;
6842 expression->label_address.label = label;
6847 * Parse a microsoft __noop expression.
6849 static expression_t *parse_noop_expression(void)
6851 /* the result is a (int)0 */
6852 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_MS_NOOP);
6853 literal->base.type = type_int;
6854 literal->literal.value.begin = "__noop";
6855 literal->literal.value.size = 6;
6859 if (token.kind == '(') {
6860 /* parse arguments */
6862 add_anchor_token(')');
6863 add_anchor_token(',');
6865 if (token.kind != ')') do {
6866 (void)parse_assignment_expression();
6867 } while (next_if(','));
6869 rem_anchor_token(',');
6870 rem_anchor_token(')');
6871 expect(')', end_error);
6878 * Parses a primary expression.
6880 static expression_t *parse_primary_expression(void)
6882 switch (token.kind) {
6883 case T_false: return parse_boolean_literal(false);
6884 case T_true: return parse_boolean_literal(true);
6886 case T_INTEGER_OCTAL:
6887 case T_INTEGER_HEXADECIMAL:
6888 case T_FLOATINGPOINT:
6889 case T_FLOATINGPOINT_HEXADECIMAL: return parse_number_literal();
6890 case T_CHARACTER_CONSTANT: return parse_character_constant();
6891 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
6892 case T_STRING_LITERAL:
6893 case T_WIDE_STRING_LITERAL: return parse_string_literal();
6894 case T___FUNCTION__:
6895 case T___func__: return parse_function_keyword();
6896 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
6897 case T___FUNCSIG__: return parse_funcsig_keyword();
6898 case T___FUNCDNAME__: return parse_funcdname_keyword();
6899 case T___builtin_offsetof: return parse_offsetof();
6900 case T___builtin_va_start: return parse_va_start();
6901 case T___builtin_va_arg: return parse_va_arg();
6902 case T___builtin_va_copy: return parse_va_copy();
6903 case T___builtin_isgreater:
6904 case T___builtin_isgreaterequal:
6905 case T___builtin_isless:
6906 case T___builtin_islessequal:
6907 case T___builtin_islessgreater:
6908 case T___builtin_isunordered: return parse_compare_builtin();
6909 case T___builtin_constant_p: return parse_builtin_constant();
6910 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
6911 case T__assume: return parse_assume();
6914 return parse_label_address();
6917 case '(': return parse_parenthesized_expression();
6918 case T___noop: return parse_noop_expression();
6920 /* Gracefully handle type names while parsing expressions. */
6922 return parse_reference();
6924 if (!is_typedef_symbol(token.identifier.symbol)) {
6925 return parse_reference();
6929 source_position_t const pos = *HERE;
6930 declaration_specifiers_t specifiers;
6931 parse_declaration_specifiers(&specifiers);
6932 type_t const *const type = parse_abstract_declarator(specifiers.type);
6933 errorf(&pos, "encountered type '%T' while parsing expression", type);
6934 return create_error_expression();
6938 errorf(HERE, "unexpected token %K, expected an expression", &token);
6940 return create_error_expression();
6943 static expression_t *parse_array_expression(expression_t *left)
6945 expression_t *const expr = allocate_expression_zero(EXPR_ARRAY_ACCESS);
6946 array_access_expression_t *const arr = &expr->array_access;
6949 add_anchor_token(']');
6951 expression_t *const inside = parse_expression();
6953 type_t *const orig_type_left = left->base.type;
6954 type_t *const orig_type_inside = inside->base.type;
6956 type_t *const type_left = skip_typeref(orig_type_left);
6957 type_t *const type_inside = skip_typeref(orig_type_inside);
6963 if (is_type_pointer(type_left)) {
6966 idx_type = type_inside;
6967 res_type = type_left->pointer.points_to;
6969 } else if (is_type_pointer(type_inside)) {
6970 arr->flipped = true;
6973 idx_type = type_left;
6974 res_type = type_inside->pointer.points_to;
6976 res_type = automatic_type_conversion(res_type);
6977 if (!is_type_integer(idx_type)) {
6978 errorf(&idx->base.source_position, "array subscript must have integer type");
6979 } else if (is_type_atomic(idx_type, ATOMIC_TYPE_CHAR)) {
6980 source_position_t const *const pos = &idx->base.source_position;
6981 warningf(WARN_CHAR_SUBSCRIPTS, pos, "array subscript has char type");
6984 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
6985 errorf(&expr->base.source_position, "invalid types '%T[%T]' for array access", orig_type_left, orig_type_inside);
6987 res_type = type_error_type;
6992 arr->array_ref = ref;
6994 arr->base.type = res_type;
6996 rem_anchor_token(']');
6997 expect(']', end_error);
7002 static bool is_bitfield(const expression_t *expression)
7004 return expression->kind == EXPR_SELECT
7005 && expression->select.compound_entry->compound_member.bitfield;
7008 static expression_t *parse_typeprop(expression_kind_t const kind)
7010 expression_t *tp_expression = allocate_expression_zero(kind);
7011 tp_expression->base.type = type_size_t;
7013 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
7016 expression_t *expression;
7017 if (token.kind == '(' && is_declaration_specifier(look_ahead(1))) {
7018 source_position_t const pos = *HERE;
7020 add_anchor_token(')');
7021 orig_type = parse_typename();
7022 rem_anchor_token(')');
7023 expect(')', end_error);
7025 if (token.kind == '{') {
7026 /* It was not sizeof(type) after all. It is sizeof of an expression
7027 * starting with a compound literal */
7028 expression = parse_compound_literal(&pos, orig_type);
7029 goto typeprop_expression;
7032 expression = parse_subexpression(PREC_UNARY);
7034 typeprop_expression:
7035 if (is_bitfield(expression)) {
7036 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7037 errorf(&tp_expression->base.source_position,
7038 "operand of %s expression must not be a bitfield", what);
7041 tp_expression->typeprop.tp_expression = expression;
7043 orig_type = revert_automatic_type_conversion(expression);
7044 expression->base.type = orig_type;
7047 tp_expression->typeprop.type = orig_type;
7048 type_t const* const type = skip_typeref(orig_type);
7049 char const* wrong_type = NULL;
7050 if (is_type_incomplete(type)) {
7051 if (!is_type_atomic(type, ATOMIC_TYPE_VOID) || !GNU_MODE)
7052 wrong_type = "incomplete";
7053 } else if (type->kind == TYPE_FUNCTION) {
7055 /* function types are allowed (and return 1) */
7056 source_position_t const *const pos = &tp_expression->base.source_position;
7057 char const *const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7058 warningf(WARN_OTHER, pos, "%s expression with function argument returns invalid result", what);
7060 wrong_type = "function";
7064 if (wrong_type != NULL) {
7065 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7066 errorf(&tp_expression->base.source_position,
7067 "operand of %s expression must not be of %s type '%T'",
7068 what, wrong_type, orig_type);
7072 return tp_expression;
7075 static expression_t *parse_sizeof(void)
7077 return parse_typeprop(EXPR_SIZEOF);
7080 static expression_t *parse_alignof(void)
7082 return parse_typeprop(EXPR_ALIGNOF);
7085 static expression_t *parse_select_expression(expression_t *addr)
7087 assert(token.kind == '.' || token.kind == T_MINUSGREATER);
7088 bool select_left_arrow = (token.kind == T_MINUSGREATER);
7089 source_position_t const pos = *HERE;
7092 if (token.kind != T_IDENTIFIER) {
7093 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
7094 return create_error_expression();
7096 symbol_t *symbol = token.identifier.symbol;
7099 type_t *const orig_type = addr->base.type;
7100 type_t *const type = skip_typeref(orig_type);
7103 bool saw_error = false;
7104 if (is_type_pointer(type)) {
7105 if (!select_left_arrow) {
7107 "request for member '%Y' in something not a struct or union, but '%T'",
7111 type_left = skip_typeref(type->pointer.points_to);
7113 if (select_left_arrow && is_type_valid(type)) {
7114 errorf(&pos, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7120 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
7121 type_left->kind != TYPE_COMPOUND_UNION) {
7123 if (is_type_valid(type_left) && !saw_error) {
7125 "request for member '%Y' in something not a struct or union, but '%T'",
7128 return create_error_expression();
7131 compound_t *compound = type_left->compound.compound;
7132 if (!compound->complete) {
7133 errorf(&pos, "request for member '%Y' in incomplete type '%T'",
7135 return create_error_expression();
7138 type_qualifiers_t qualifiers = type_left->base.qualifiers;
7139 expression_t *result =
7140 find_create_select(&pos, addr, qualifiers, compound, symbol);
7142 if (result == NULL) {
7143 errorf(&pos, "'%T' has no member named '%Y'", orig_type, symbol);
7144 return create_error_expression();
7150 static void check_call_argument(type_t *expected_type,
7151 call_argument_t *argument, unsigned pos)
7153 type_t *expected_type_skip = skip_typeref(expected_type);
7154 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
7155 expression_t *arg_expr = argument->expression;
7156 type_t *arg_type = skip_typeref(arg_expr->base.type);
7158 /* handle transparent union gnu extension */
7159 if (is_type_union(expected_type_skip)
7160 && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
7161 compound_t *union_decl = expected_type_skip->compound.compound;
7162 type_t *best_type = NULL;
7163 entity_t *entry = union_decl->members.entities;
7164 for ( ; entry != NULL; entry = entry->base.next) {
7165 assert(is_declaration(entry));
7166 type_t *decl_type = entry->declaration.type;
7167 error = semantic_assign(decl_type, arg_expr);
7168 if (error == ASSIGN_ERROR_INCOMPATIBLE
7169 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
7172 if (error == ASSIGN_SUCCESS) {
7173 best_type = decl_type;
7174 } else if (best_type == NULL) {
7175 best_type = decl_type;
7179 if (best_type != NULL) {
7180 expected_type = best_type;
7184 error = semantic_assign(expected_type, arg_expr);
7185 argument->expression = create_implicit_cast(arg_expr, expected_type);
7187 if (error != ASSIGN_SUCCESS) {
7188 /* report exact scope in error messages (like "in argument 3") */
7190 snprintf(buf, sizeof(buf), "call argument %u", pos);
7191 report_assign_error(error, expected_type, arg_expr, buf,
7192 &arg_expr->base.source_position);
7194 type_t *const promoted_type = get_default_promoted_type(arg_type);
7195 if (!types_compatible(expected_type_skip, promoted_type) &&
7196 !types_compatible(expected_type_skip, type_void_ptr) &&
7197 !types_compatible(type_void_ptr, promoted_type)) {
7198 /* Deliberately show the skipped types in this warning */
7199 source_position_t const *const apos = &arg_expr->base.source_position;
7200 warningf(WARN_TRADITIONAL, apos, "passing call argument %u as '%T' rather than '%T' due to prototype", pos, expected_type_skip, promoted_type);
7206 * Handle the semantic restrictions of builtin calls
7208 static void handle_builtin_argument_restrictions(call_expression_t *call) {
7209 switch (call->function->reference.entity->function.btk) {
7210 case bk_gnu_builtin_return_address:
7211 case bk_gnu_builtin_frame_address: {
7212 /* argument must be constant */
7213 call_argument_t *argument = call->arguments;
7215 if (is_constant_expression(argument->expression) == EXPR_CLASS_VARIABLE) {
7216 errorf(&call->base.source_position,
7217 "argument of '%Y' must be a constant expression",
7218 call->function->reference.entity->base.symbol);
7222 case bk_gnu_builtin_object_size:
7223 if (call->arguments == NULL)
7226 call_argument_t *arg = call->arguments->next;
7227 if (arg != NULL && is_constant_expression(arg->expression) == EXPR_CLASS_VARIABLE) {
7228 errorf(&call->base.source_position,
7229 "second argument of '%Y' must be a constant expression",
7230 call->function->reference.entity->base.symbol);
7233 case bk_gnu_builtin_prefetch:
7234 /* second and third argument must be constant if existent */
7235 if (call->arguments == NULL)
7237 call_argument_t *rw = call->arguments->next;
7238 call_argument_t *locality = NULL;
7241 if (is_constant_expression(rw->expression) == EXPR_CLASS_VARIABLE) {
7242 errorf(&call->base.source_position,
7243 "second argument of '%Y' must be a constant expression",
7244 call->function->reference.entity->base.symbol);
7246 locality = rw->next;
7248 if (locality != NULL) {
7249 if (is_constant_expression(locality->expression) == EXPR_CLASS_VARIABLE) {
7250 errorf(&call->base.source_position,
7251 "third argument of '%Y' must be a constant expression",
7252 call->function->reference.entity->base.symbol);
7254 locality = rw->next;
7263 * Parse a call expression, ie. expression '( ... )'.
7265 * @param expression the function address
7267 static expression_t *parse_call_expression(expression_t *expression)
7269 expression_t *result = allocate_expression_zero(EXPR_CALL);
7270 call_expression_t *call = &result->call;
7271 call->function = expression;
7273 type_t *const orig_type = expression->base.type;
7274 type_t *const type = skip_typeref(orig_type);
7276 function_type_t *function_type = NULL;
7277 if (is_type_pointer(type)) {
7278 type_t *const to_type = skip_typeref(type->pointer.points_to);
7280 if (is_type_function(to_type)) {
7281 function_type = &to_type->function;
7282 call->base.type = function_type->return_type;
7286 if (function_type == NULL && is_type_valid(type)) {
7288 "called object '%E' (type '%T') is not a pointer to a function",
7289 expression, orig_type);
7292 /* parse arguments */
7294 add_anchor_token(')');
7295 add_anchor_token(',');
7297 if (token.kind != ')') {
7298 call_argument_t **anchor = &call->arguments;
7300 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7301 argument->expression = parse_assignment_expression();
7304 anchor = &argument->next;
7305 } while (next_if(','));
7307 rem_anchor_token(',');
7308 rem_anchor_token(')');
7309 expect(')', end_error);
7311 if (function_type == NULL)
7314 /* check type and count of call arguments */
7315 function_parameter_t *parameter = function_type->parameters;
7316 call_argument_t *argument = call->arguments;
7317 if (!function_type->unspecified_parameters) {
7318 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7319 parameter = parameter->next, argument = argument->next) {
7320 check_call_argument(parameter->type, argument, ++pos);
7323 if (parameter != NULL) {
7324 errorf(&expression->base.source_position, "too few arguments to function '%E'", expression);
7325 } else if (argument != NULL && !function_type->variadic) {
7326 errorf(&argument->expression->base.source_position, "too many arguments to function '%E'", expression);
7330 /* do default promotion for other arguments */
7331 for (; argument != NULL; argument = argument->next) {
7332 type_t *argument_type = argument->expression->base.type;
7333 if (!is_type_object(skip_typeref(argument_type))) {
7334 errorf(&argument->expression->base.source_position,
7335 "call argument '%E' must not be void", argument->expression);
7338 argument_type = get_default_promoted_type(argument_type);
7340 argument->expression
7341 = create_implicit_cast(argument->expression, argument_type);
7346 if (is_type_compound(skip_typeref(function_type->return_type))) {
7347 source_position_t const *const pos = &expression->base.source_position;
7348 warningf(WARN_AGGREGATE_RETURN, pos, "function call has aggregate value");
7351 if (expression->kind == EXPR_REFERENCE) {
7352 reference_expression_t *reference = &expression->reference;
7353 if (reference->entity->kind == ENTITY_FUNCTION &&
7354 reference->entity->function.btk != bk_none)
7355 handle_builtin_argument_restrictions(call);
7362 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7364 static bool same_compound_type(const type_t *type1, const type_t *type2)
7367 is_type_compound(type1) &&
7368 type1->kind == type2->kind &&
7369 type1->compound.compound == type2->compound.compound;
7372 static expression_t const *get_reference_address(expression_t const *expr)
7374 bool regular_take_address = true;
7376 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7377 expr = expr->unary.value;
7379 regular_take_address = false;
7382 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7385 expr = expr->unary.value;
7388 if (expr->kind != EXPR_REFERENCE)
7391 /* special case for functions which are automatically converted to a
7392 * pointer to function without an extra TAKE_ADDRESS operation */
7393 if (!regular_take_address &&
7394 expr->reference.entity->kind != ENTITY_FUNCTION) {
7401 static void warn_reference_address_as_bool(expression_t const* expr)
7403 expr = get_reference_address(expr);
7405 source_position_t const *const pos = &expr->base.source_position;
7406 entity_t const *const ent = expr->reference.entity;
7407 warningf(WARN_ADDRESS, pos, "the address of '%N' will always evaluate as 'true'", ent);
7411 static void warn_assignment_in_condition(const expression_t *const expr)
7413 if (expr->base.kind != EXPR_BINARY_ASSIGN)
7415 if (expr->base.parenthesized)
7417 source_position_t const *const pos = &expr->base.source_position;
7418 warningf(WARN_PARENTHESES, pos, "suggest parentheses around assignment used as truth value");
7421 static void semantic_condition(expression_t const *const expr,
7422 char const *const context)
7424 type_t *const type = skip_typeref(expr->base.type);
7425 if (is_type_scalar(type)) {
7426 warn_reference_address_as_bool(expr);
7427 warn_assignment_in_condition(expr);
7428 } else if (is_type_valid(type)) {
7429 errorf(&expr->base.source_position,
7430 "%s must have scalar type", context);
7435 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7437 * @param expression the conditional expression
7439 static expression_t *parse_conditional_expression(expression_t *expression)
7441 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7443 conditional_expression_t *conditional = &result->conditional;
7444 conditional->condition = expression;
7447 add_anchor_token(':');
7449 /* §6.5.15:2 The first operand shall have scalar type. */
7450 semantic_condition(expression, "condition of conditional operator");
7452 expression_t *true_expression = expression;
7453 bool gnu_cond = false;
7454 if (GNU_MODE && token.kind == ':') {
7457 true_expression = parse_expression();
7459 rem_anchor_token(':');
7460 expect(':', end_error);
7462 expression_t *false_expression =
7463 parse_subexpression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7465 type_t *const orig_true_type = true_expression->base.type;
7466 type_t *const orig_false_type = false_expression->base.type;
7467 type_t *const true_type = skip_typeref(orig_true_type);
7468 type_t *const false_type = skip_typeref(orig_false_type);
7471 source_position_t const *const pos = &conditional->base.source_position;
7472 type_t *result_type;
7473 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7474 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7475 /* ISO/IEC 14882:1998(E) §5.16:2 */
7476 if (true_expression->kind == EXPR_UNARY_THROW) {
7477 result_type = false_type;
7478 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7479 result_type = true_type;
7481 if (!is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7482 !is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7483 warningf(WARN_OTHER, pos, "ISO C forbids conditional expression with only one void side");
7485 result_type = type_void;
7487 } else if (is_type_arithmetic(true_type)
7488 && is_type_arithmetic(false_type)) {
7489 result_type = semantic_arithmetic(true_type, false_type);
7490 } else if (same_compound_type(true_type, false_type)) {
7491 /* just take 1 of the 2 types */
7492 result_type = true_type;
7493 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7494 type_t *pointer_type;
7496 expression_t *other_expression;
7497 if (is_type_pointer(true_type) &&
7498 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7499 pointer_type = true_type;
7500 other_type = false_type;
7501 other_expression = false_expression;
7503 pointer_type = false_type;
7504 other_type = true_type;
7505 other_expression = true_expression;
7508 if (is_null_pointer_constant(other_expression)) {
7509 result_type = pointer_type;
7510 } else if (is_type_pointer(other_type)) {
7511 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7512 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7515 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
7516 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
7518 } else if (types_compatible(get_unqualified_type(to1),
7519 get_unqualified_type(to2))) {
7522 warningf(WARN_OTHER, pos, "pointer types '%T' and '%T' in conditional expression are incompatible", true_type, false_type);
7526 type_t *const type =
7527 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7528 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7529 } else if (is_type_integer(other_type)) {
7530 warningf(WARN_OTHER, pos, "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7531 result_type = pointer_type;
7533 goto types_incompatible;
7537 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7538 type_error_incompatible("while parsing conditional", pos, true_type, false_type);
7540 result_type = type_error_type;
7543 conditional->true_expression
7544 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7545 conditional->false_expression
7546 = create_implicit_cast(false_expression, result_type);
7547 conditional->base.type = result_type;
7552 * Parse an extension expression.
7554 static expression_t *parse_extension(void)
7557 expression_t *expression = parse_subexpression(PREC_UNARY);
7563 * Parse a __builtin_classify_type() expression.
7565 static expression_t *parse_builtin_classify_type(void)
7567 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7568 result->base.type = type_int;
7570 eat(T___builtin_classify_type);
7572 expect('(', end_error);
7573 add_anchor_token(')');
7574 expression_t *expression = parse_expression();
7575 rem_anchor_token(')');
7576 expect(')', end_error);
7577 result->classify_type.type_expression = expression;
7581 return create_error_expression();
7585 * Parse a delete expression
7586 * ISO/IEC 14882:1998(E) §5.3.5
7588 static expression_t *parse_delete(void)
7590 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7591 result->base.type = type_void;
7596 result->kind = EXPR_UNARY_DELETE_ARRAY;
7597 expect(']', end_error);
7601 expression_t *const value = parse_subexpression(PREC_CAST);
7602 result->unary.value = value;
7604 type_t *const type = skip_typeref(value->base.type);
7605 if (!is_type_pointer(type)) {
7606 if (is_type_valid(type)) {
7607 errorf(&value->base.source_position,
7608 "operand of delete must have pointer type");
7610 } else if (is_type_atomic(skip_typeref(type->pointer.points_to), ATOMIC_TYPE_VOID)) {
7611 source_position_t const *const pos = &value->base.source_position;
7612 warningf(WARN_OTHER, pos, "deleting 'void*' is undefined");
7619 * Parse a throw expression
7620 * ISO/IEC 14882:1998(E) §15:1
7622 static expression_t *parse_throw(void)
7624 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7625 result->base.type = type_void;
7629 expression_t *value = NULL;
7630 switch (token.kind) {
7632 value = parse_assignment_expression();
7633 /* ISO/IEC 14882:1998(E) §15.1:3 */
7634 type_t *const orig_type = value->base.type;
7635 type_t *const type = skip_typeref(orig_type);
7636 if (is_type_incomplete(type)) {
7637 errorf(&value->base.source_position,
7638 "cannot throw object of incomplete type '%T'", orig_type);
7639 } else if (is_type_pointer(type)) {
7640 type_t *const points_to = skip_typeref(type->pointer.points_to);
7641 if (is_type_incomplete(points_to) &&
7642 !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7643 errorf(&value->base.source_position,
7644 "cannot throw pointer to incomplete type '%T'", orig_type);
7652 result->unary.value = value;
7657 static bool check_pointer_arithmetic(const source_position_t *source_position,
7658 type_t *pointer_type,
7659 type_t *orig_pointer_type)
7661 type_t *points_to = pointer_type->pointer.points_to;
7662 points_to = skip_typeref(points_to);
7664 if (is_type_incomplete(points_to)) {
7665 if (!GNU_MODE || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7666 errorf(source_position,
7667 "arithmetic with pointer to incomplete type '%T' not allowed",
7671 warningf(WARN_POINTER_ARITH, source_position, "pointer of type '%T' used in arithmetic", orig_pointer_type);
7673 } else if (is_type_function(points_to)) {
7675 errorf(source_position,
7676 "arithmetic with pointer to function type '%T' not allowed",
7680 warningf(WARN_POINTER_ARITH, source_position, "pointer to a function '%T' used in arithmetic", orig_pointer_type);
7686 static bool is_lvalue(const expression_t *expression)
7688 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
7689 switch (expression->kind) {
7690 case EXPR_ARRAY_ACCESS:
7691 case EXPR_COMPOUND_LITERAL:
7692 case EXPR_REFERENCE:
7694 case EXPR_UNARY_DEREFERENCE:
7698 type_t *type = skip_typeref(expression->base.type);
7700 /* ISO/IEC 14882:1998(E) §3.10:3 */
7701 is_type_reference(type) ||
7702 /* Claim it is an lvalue, if the type is invalid. There was a parse
7703 * error before, which maybe prevented properly recognizing it as
7705 !is_type_valid(type);
7710 static void semantic_incdec(unary_expression_t *expression)
7712 type_t *const orig_type = expression->value->base.type;
7713 type_t *const type = skip_typeref(orig_type);
7714 if (is_type_pointer(type)) {
7715 if (!check_pointer_arithmetic(&expression->base.source_position,
7719 } else if (!is_type_real(type) && is_type_valid(type)) {
7720 /* TODO: improve error message */
7721 errorf(&expression->base.source_position,
7722 "operation needs an arithmetic or pointer type");
7725 if (!is_lvalue(expression->value)) {
7726 /* TODO: improve error message */
7727 errorf(&expression->base.source_position, "lvalue required as operand");
7729 expression->base.type = orig_type;
7732 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
7734 type_t *const orig_type = expression->value->base.type;
7735 type_t *const type = skip_typeref(orig_type);
7736 if (!is_type_arithmetic(type)) {
7737 if (is_type_valid(type)) {
7738 /* TODO: improve error message */
7739 errorf(&expression->base.source_position,
7740 "operation needs an arithmetic type");
7745 expression->base.type = orig_type;
7748 static void semantic_unexpr_plus(unary_expression_t *expression)
7750 semantic_unexpr_arithmetic(expression);
7751 source_position_t const *const pos = &expression->base.source_position;
7752 warningf(WARN_TRADITIONAL, pos, "traditional C rejects the unary plus operator");
7755 static void semantic_not(unary_expression_t *expression)
7757 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
7758 semantic_condition(expression->value, "operand of !");
7759 expression->base.type = c_mode & _CXX ? type_bool : type_int;
7762 static void semantic_unexpr_integer(unary_expression_t *expression)
7764 type_t *const orig_type = expression->value->base.type;
7765 type_t *const type = skip_typeref(orig_type);
7766 if (!is_type_integer(type)) {
7767 if (is_type_valid(type)) {
7768 errorf(&expression->base.source_position,
7769 "operand of ~ must be of integer type");
7774 expression->base.type = orig_type;
7777 static void semantic_dereference(unary_expression_t *expression)
7779 type_t *const orig_type = expression->value->base.type;
7780 type_t *const type = skip_typeref(orig_type);
7781 if (!is_type_pointer(type)) {
7782 if (is_type_valid(type)) {
7783 errorf(&expression->base.source_position,
7784 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
7789 type_t *result_type = type->pointer.points_to;
7790 result_type = automatic_type_conversion(result_type);
7791 expression->base.type = result_type;
7795 * Record that an address is taken (expression represents an lvalue).
7797 * @param expression the expression
7798 * @param may_be_register if true, the expression might be an register
7800 static void set_address_taken(expression_t *expression, bool may_be_register)
7802 if (expression->kind != EXPR_REFERENCE)
7805 entity_t *const entity = expression->reference.entity;
7807 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
7810 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
7811 && !may_be_register) {
7812 source_position_t const *const pos = &expression->base.source_position;
7813 errorf(pos, "address of register '%N' requested", entity);
7816 if (entity->kind == ENTITY_VARIABLE) {
7817 entity->variable.address_taken = true;
7819 assert(entity->kind == ENTITY_PARAMETER);
7820 entity->parameter.address_taken = true;
7825 * Check the semantic of the address taken expression.
7827 static void semantic_take_addr(unary_expression_t *expression)
7829 expression_t *value = expression->value;
7830 value->base.type = revert_automatic_type_conversion(value);
7832 type_t *orig_type = value->base.type;
7833 type_t *type = skip_typeref(orig_type);
7834 if (!is_type_valid(type))
7838 if (!is_lvalue(value)) {
7839 errorf(&expression->base.source_position, "'&' requires an lvalue");
7841 if (is_bitfield(value)) {
7842 errorf(&expression->base.source_position,
7843 "'&' not allowed on bitfield");
7846 set_address_taken(value, false);
7848 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
7851 #define CREATE_UNARY_EXPRESSION_PARSER(token_kind, unexpression_type, sfunc) \
7852 static expression_t *parse_##unexpression_type(void) \
7854 expression_t *unary_expression \
7855 = allocate_expression_zero(unexpression_type); \
7857 unary_expression->unary.value = parse_subexpression(PREC_UNARY); \
7859 sfunc(&unary_expression->unary); \
7861 return unary_expression; \
7864 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
7865 semantic_unexpr_arithmetic)
7866 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
7867 semantic_unexpr_plus)
7868 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
7870 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
7871 semantic_dereference)
7872 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
7874 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
7875 semantic_unexpr_integer)
7876 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
7878 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
7881 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_kind, unexpression_type, \
7883 static expression_t *parse_##unexpression_type(expression_t *left) \
7885 expression_t *unary_expression \
7886 = allocate_expression_zero(unexpression_type); \
7888 unary_expression->unary.value = left; \
7890 sfunc(&unary_expression->unary); \
7892 return unary_expression; \
7895 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
7896 EXPR_UNARY_POSTFIX_INCREMENT,
7898 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
7899 EXPR_UNARY_POSTFIX_DECREMENT,
7902 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
7904 /* TODO: handle complex + imaginary types */
7906 type_left = get_unqualified_type(type_left);
7907 type_right = get_unqualified_type(type_right);
7909 /* §6.3.1.8 Usual arithmetic conversions */
7910 if (type_left == type_long_double || type_right == type_long_double) {
7911 return type_long_double;
7912 } else if (type_left == type_double || type_right == type_double) {
7914 } else if (type_left == type_float || type_right == type_float) {
7918 type_left = promote_integer(type_left);
7919 type_right = promote_integer(type_right);
7921 if (type_left == type_right)
7924 bool const signed_left = is_type_signed(type_left);
7925 bool const signed_right = is_type_signed(type_right);
7926 int const rank_left = get_rank(type_left);
7927 int const rank_right = get_rank(type_right);
7929 if (signed_left == signed_right)
7930 return rank_left >= rank_right ? type_left : type_right;
7939 u_rank = rank_right;
7940 u_type = type_right;
7942 s_rank = rank_right;
7943 s_type = type_right;
7948 if (u_rank >= s_rank)
7951 /* casting rank to atomic_type_kind is a bit hacky, but makes things
7953 if (get_atomic_type_size((atomic_type_kind_t) s_rank)
7954 > get_atomic_type_size((atomic_type_kind_t) u_rank))
7958 case ATOMIC_TYPE_INT: return type_unsigned_int;
7959 case ATOMIC_TYPE_LONG: return type_unsigned_long;
7960 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
7962 default: panic("invalid atomic type");
7967 * Check the semantic restrictions for a binary expression.
7969 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
7971 expression_t *const left = expression->left;
7972 expression_t *const right = expression->right;
7973 type_t *const orig_type_left = left->base.type;
7974 type_t *const orig_type_right = right->base.type;
7975 type_t *const type_left = skip_typeref(orig_type_left);
7976 type_t *const type_right = skip_typeref(orig_type_right);
7978 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
7979 /* TODO: improve error message */
7980 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7981 errorf(&expression->base.source_position,
7982 "operation needs arithmetic types");
7987 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7988 expression->left = create_implicit_cast(left, arithmetic_type);
7989 expression->right = create_implicit_cast(right, arithmetic_type);
7990 expression->base.type = arithmetic_type;
7993 static void semantic_binexpr_integer(binary_expression_t *const expression)
7995 expression_t *const left = expression->left;
7996 expression_t *const right = expression->right;
7997 type_t *const orig_type_left = left->base.type;
7998 type_t *const orig_type_right = right->base.type;
7999 type_t *const type_left = skip_typeref(orig_type_left);
8000 type_t *const type_right = skip_typeref(orig_type_right);
8002 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8003 /* TODO: improve error message */
8004 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8005 errorf(&expression->base.source_position,
8006 "operation needs integer types");
8011 type_t *const result_type = semantic_arithmetic(type_left, type_right);
8012 expression->left = create_implicit_cast(left, result_type);
8013 expression->right = create_implicit_cast(right, result_type);
8014 expression->base.type = result_type;
8017 static void warn_div_by_zero(binary_expression_t const *const expression)
8019 if (!is_type_integer(expression->base.type))
8022 expression_t const *const right = expression->right;
8023 /* The type of the right operand can be different for /= */
8024 if (is_type_integer(right->base.type) &&
8025 is_constant_expression(right) == EXPR_CLASS_CONSTANT &&
8026 !fold_constant_to_bool(right)) {
8027 source_position_t const *const pos = &expression->base.source_position;
8028 warningf(WARN_DIV_BY_ZERO, pos, "division by zero");
8033 * Check the semantic restrictions for a div/mod expression.
8035 static void semantic_divmod_arithmetic(binary_expression_t *expression)
8037 semantic_binexpr_arithmetic(expression);
8038 warn_div_by_zero(expression);
8041 static void warn_addsub_in_shift(const expression_t *const expr)
8043 if (expr->base.parenthesized)
8047 switch (expr->kind) {
8048 case EXPR_BINARY_ADD: op = '+'; break;
8049 case EXPR_BINARY_SUB: op = '-'; break;
8053 source_position_t const *const pos = &expr->base.source_position;
8054 warningf(WARN_PARENTHESES, pos, "suggest parentheses around '%c' inside shift", op);
8057 static bool semantic_shift(binary_expression_t *expression)
8059 expression_t *const left = expression->left;
8060 expression_t *const right = expression->right;
8061 type_t *const orig_type_left = left->base.type;
8062 type_t *const orig_type_right = right->base.type;
8063 type_t * type_left = skip_typeref(orig_type_left);
8064 type_t * type_right = skip_typeref(orig_type_right);
8066 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8067 /* TODO: improve error message */
8068 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8069 errorf(&expression->base.source_position,
8070 "operands of shift operation must have integer types");
8075 type_left = promote_integer(type_left);
8077 if (is_constant_expression(right) == EXPR_CLASS_CONSTANT) {
8078 source_position_t const *const pos = &right->base.source_position;
8079 long const count = fold_constant_to_int(right);
8081 warningf(WARN_OTHER, pos, "shift count must be non-negative");
8082 } else if ((unsigned long)count >=
8083 get_atomic_type_size(type_left->atomic.akind) * 8) {
8084 warningf(WARN_OTHER, pos, "shift count must be less than type width");
8088 type_right = promote_integer(type_right);
8089 expression->right = create_implicit_cast(right, type_right);
8094 static void semantic_shift_op(binary_expression_t *expression)
8096 expression_t *const left = expression->left;
8097 expression_t *const right = expression->right;
8099 if (!semantic_shift(expression))
8102 warn_addsub_in_shift(left);
8103 warn_addsub_in_shift(right);
8105 type_t *const orig_type_left = left->base.type;
8106 type_t * type_left = skip_typeref(orig_type_left);
8108 type_left = promote_integer(type_left);
8109 expression->left = create_implicit_cast(left, type_left);
8110 expression->base.type = type_left;
8113 static void semantic_add(binary_expression_t *expression)
8115 expression_t *const left = expression->left;
8116 expression_t *const right = expression->right;
8117 type_t *const orig_type_left = left->base.type;
8118 type_t *const orig_type_right = right->base.type;
8119 type_t *const type_left = skip_typeref(orig_type_left);
8120 type_t *const type_right = skip_typeref(orig_type_right);
8123 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8124 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8125 expression->left = create_implicit_cast(left, arithmetic_type);
8126 expression->right = create_implicit_cast(right, arithmetic_type);
8127 expression->base.type = arithmetic_type;
8128 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8129 check_pointer_arithmetic(&expression->base.source_position,
8130 type_left, orig_type_left);
8131 expression->base.type = type_left;
8132 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8133 check_pointer_arithmetic(&expression->base.source_position,
8134 type_right, orig_type_right);
8135 expression->base.type = type_right;
8136 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8137 errorf(&expression->base.source_position,
8138 "invalid operands to binary + ('%T', '%T')",
8139 orig_type_left, orig_type_right);
8143 static void semantic_sub(binary_expression_t *expression)
8145 expression_t *const left = expression->left;
8146 expression_t *const right = expression->right;
8147 type_t *const orig_type_left = left->base.type;
8148 type_t *const orig_type_right = right->base.type;
8149 type_t *const type_left = skip_typeref(orig_type_left);
8150 type_t *const type_right = skip_typeref(orig_type_right);
8151 source_position_t const *const pos = &expression->base.source_position;
8154 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8155 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8156 expression->left = create_implicit_cast(left, arithmetic_type);
8157 expression->right = create_implicit_cast(right, arithmetic_type);
8158 expression->base.type = arithmetic_type;
8159 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8160 check_pointer_arithmetic(&expression->base.source_position,
8161 type_left, orig_type_left);
8162 expression->base.type = type_left;
8163 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8164 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
8165 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
8166 if (!types_compatible(unqual_left, unqual_right)) {
8168 "subtracting pointers to incompatible types '%T' and '%T'",
8169 orig_type_left, orig_type_right);
8170 } else if (!is_type_object(unqual_left)) {
8171 if (!is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
8172 errorf(pos, "subtracting pointers to non-object types '%T'",
8175 warningf(WARN_OTHER, pos, "subtracting pointers to void");
8178 expression->base.type = type_ptrdiff_t;
8179 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8180 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8181 orig_type_left, orig_type_right);
8185 static void warn_string_literal_address(expression_t const* expr)
8187 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8188 expr = expr->unary.value;
8189 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8191 expr = expr->unary.value;
8194 if (expr->kind == EXPR_STRING_LITERAL
8195 || expr->kind == EXPR_WIDE_STRING_LITERAL) {
8196 source_position_t const *const pos = &expr->base.source_position;
8197 warningf(WARN_ADDRESS, pos, "comparison with string literal results in unspecified behaviour");
8201 static bool maybe_negative(expression_t const *const expr)
8203 switch (is_constant_expression(expr)) {
8204 case EXPR_CLASS_ERROR: return false;
8205 case EXPR_CLASS_CONSTANT: return constant_is_negative(expr);
8206 default: return true;
8210 static void warn_comparison(source_position_t const *const pos, expression_t const *const expr, expression_t const *const other)
8212 warn_string_literal_address(expr);
8214 expression_t const* const ref = get_reference_address(expr);
8215 if (ref != NULL && is_null_pointer_constant(other)) {
8216 entity_t const *const ent = ref->reference.entity;
8217 warningf(WARN_ADDRESS, pos, "the address of '%N' will never be NULL", ent);
8220 if (!expr->base.parenthesized) {
8221 switch (expr->base.kind) {
8222 case EXPR_BINARY_LESS:
8223 case EXPR_BINARY_GREATER:
8224 case EXPR_BINARY_LESSEQUAL:
8225 case EXPR_BINARY_GREATEREQUAL:
8226 case EXPR_BINARY_NOTEQUAL:
8227 case EXPR_BINARY_EQUAL:
8228 warningf(WARN_PARENTHESES, pos, "comparisons like 'x <= y < z' do not have their mathematical meaning");
8237 * Check the semantics of comparison expressions.
8239 * @param expression The expression to check.
8241 static void semantic_comparison(binary_expression_t *expression)
8243 source_position_t const *const pos = &expression->base.source_position;
8244 expression_t *const left = expression->left;
8245 expression_t *const right = expression->right;
8247 warn_comparison(pos, left, right);
8248 warn_comparison(pos, right, left);
8250 type_t *orig_type_left = left->base.type;
8251 type_t *orig_type_right = right->base.type;
8252 type_t *type_left = skip_typeref(orig_type_left);
8253 type_t *type_right = skip_typeref(orig_type_right);
8255 /* TODO non-arithmetic types */
8256 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8257 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8259 /* test for signed vs unsigned compares */
8260 if (is_type_integer(arithmetic_type)) {
8261 bool const signed_left = is_type_signed(type_left);
8262 bool const signed_right = is_type_signed(type_right);
8263 if (signed_left != signed_right) {
8264 /* FIXME long long needs better const folding magic */
8265 /* TODO check whether constant value can be represented by other type */
8266 if ((signed_left && maybe_negative(left)) ||
8267 (signed_right && maybe_negative(right))) {
8268 warningf(WARN_SIGN_COMPARE, pos, "comparison between signed and unsigned");
8273 expression->left = create_implicit_cast(left, arithmetic_type);
8274 expression->right = create_implicit_cast(right, arithmetic_type);
8275 expression->base.type = arithmetic_type;
8276 if ((expression->base.kind == EXPR_BINARY_EQUAL ||
8277 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8278 is_type_float(arithmetic_type)) {
8279 warningf(WARN_FLOAT_EQUAL, pos, "comparing floating point with == or != is unsafe");
8281 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8282 /* TODO check compatibility */
8283 } else if (is_type_pointer(type_left)) {
8284 expression->right = create_implicit_cast(right, type_left);
8285 } else if (is_type_pointer(type_right)) {
8286 expression->left = create_implicit_cast(left, type_right);
8287 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8288 type_error_incompatible("invalid operands in comparison", pos, type_left, type_right);
8290 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8294 * Checks if a compound type has constant fields.
8296 static bool has_const_fields(const compound_type_t *type)
8298 compound_t *compound = type->compound;
8299 entity_t *entry = compound->members.entities;
8301 for (; entry != NULL; entry = entry->base.next) {
8302 if (!is_declaration(entry))
8305 const type_t *decl_type = skip_typeref(entry->declaration.type);
8306 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8313 static bool is_valid_assignment_lhs(expression_t const* const left)
8315 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8316 type_t *const type_left = skip_typeref(orig_type_left);
8318 if (!is_lvalue(left)) {
8319 errorf(&left->base.source_position, "left hand side '%E' of assignment is not an lvalue",
8324 if (left->kind == EXPR_REFERENCE
8325 && left->reference.entity->kind == ENTITY_FUNCTION) {
8326 errorf(&left->base.source_position, "cannot assign to function '%E'", left);
8330 if (is_type_array(type_left)) {
8331 errorf(&left->base.source_position, "cannot assign to array '%E'", left);
8334 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8335 errorf(&left->base.source_position, "assignment to read-only location '%E' (type '%T')", left,
8339 if (is_type_incomplete(type_left)) {
8340 errorf(&left->base.source_position, "left-hand side '%E' of assignment has incomplete type '%T'",
8341 left, orig_type_left);
8344 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8345 errorf(&left->base.source_position, "cannot assign to '%E' because compound type '%T' has read-only fields",
8346 left, orig_type_left);
8353 static void semantic_arithmetic_assign(binary_expression_t *expression)
8355 expression_t *left = expression->left;
8356 expression_t *right = expression->right;
8357 type_t *orig_type_left = left->base.type;
8358 type_t *orig_type_right = right->base.type;
8360 if (!is_valid_assignment_lhs(left))
8363 type_t *type_left = skip_typeref(orig_type_left);
8364 type_t *type_right = skip_typeref(orig_type_right);
8366 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8367 /* TODO: improve error message */
8368 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8369 errorf(&expression->base.source_position,
8370 "operation needs arithmetic types");
8375 /* combined instructions are tricky. We can't create an implicit cast on
8376 * the left side, because we need the uncasted form for the store.
8377 * The ast2firm pass has to know that left_type must be right_type
8378 * for the arithmetic operation and create a cast by itself */
8379 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8380 expression->right = create_implicit_cast(right, arithmetic_type);
8381 expression->base.type = type_left;
8384 static void semantic_divmod_assign(binary_expression_t *expression)
8386 semantic_arithmetic_assign(expression);
8387 warn_div_by_zero(expression);
8390 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8392 expression_t *const left = expression->left;
8393 expression_t *const right = expression->right;
8394 type_t *const orig_type_left = left->base.type;
8395 type_t *const orig_type_right = right->base.type;
8396 type_t *const type_left = skip_typeref(orig_type_left);
8397 type_t *const type_right = skip_typeref(orig_type_right);
8399 if (!is_valid_assignment_lhs(left))
8402 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8403 /* combined instructions are tricky. We can't create an implicit cast on
8404 * the left side, because we need the uncasted form for the store.
8405 * The ast2firm pass has to know that left_type must be right_type
8406 * for the arithmetic operation and create a cast by itself */
8407 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8408 expression->right = create_implicit_cast(right, arithmetic_type);
8409 expression->base.type = type_left;
8410 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8411 check_pointer_arithmetic(&expression->base.source_position,
8412 type_left, orig_type_left);
8413 expression->base.type = type_left;
8414 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8415 errorf(&expression->base.source_position,
8416 "incompatible types '%T' and '%T' in assignment",
8417 orig_type_left, orig_type_right);
8421 static void semantic_integer_assign(binary_expression_t *expression)
8423 expression_t *left = expression->left;
8424 expression_t *right = expression->right;
8425 type_t *orig_type_left = left->base.type;
8426 type_t *orig_type_right = right->base.type;
8428 if (!is_valid_assignment_lhs(left))
8431 type_t *type_left = skip_typeref(orig_type_left);
8432 type_t *type_right = skip_typeref(orig_type_right);
8434 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8435 /* TODO: improve error message */
8436 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8437 errorf(&expression->base.source_position,
8438 "operation needs integer types");
8443 /* combined instructions are tricky. We can't create an implicit cast on
8444 * the left side, because we need the uncasted form for the store.
8445 * The ast2firm pass has to know that left_type must be right_type
8446 * for the arithmetic operation and create a cast by itself */
8447 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8448 expression->right = create_implicit_cast(right, arithmetic_type);
8449 expression->base.type = type_left;
8452 static void semantic_shift_assign(binary_expression_t *expression)
8454 expression_t *left = expression->left;
8456 if (!is_valid_assignment_lhs(left))
8459 if (!semantic_shift(expression))
8462 expression->base.type = skip_typeref(left->base.type);
8465 static void warn_logical_and_within_or(const expression_t *const expr)
8467 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8469 if (expr->base.parenthesized)
8471 source_position_t const *const pos = &expr->base.source_position;
8472 warningf(WARN_PARENTHESES, pos, "suggest parentheses around && within ||");
8476 * Check the semantic restrictions of a logical expression.
8478 static void semantic_logical_op(binary_expression_t *expression)
8480 /* §6.5.13:2 Each of the operands shall have scalar type.
8481 * §6.5.14:2 Each of the operands shall have scalar type. */
8482 semantic_condition(expression->left, "left operand of logical operator");
8483 semantic_condition(expression->right, "right operand of logical operator");
8484 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR) {
8485 warn_logical_and_within_or(expression->left);
8486 warn_logical_and_within_or(expression->right);
8488 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8492 * Check the semantic restrictions of a binary assign expression.
8494 static void semantic_binexpr_assign(binary_expression_t *expression)
8496 expression_t *left = expression->left;
8497 type_t *orig_type_left = left->base.type;
8499 if (!is_valid_assignment_lhs(left))
8502 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8503 report_assign_error(error, orig_type_left, expression->right,
8504 "assignment", &left->base.source_position);
8505 expression->right = create_implicit_cast(expression->right, orig_type_left);
8506 expression->base.type = orig_type_left;
8510 * Determine if the outermost operation (or parts thereof) of the given
8511 * expression has no effect in order to generate a warning about this fact.
8512 * Therefore in some cases this only examines some of the operands of the
8513 * expression (see comments in the function and examples below).
8515 * f() + 23; // warning, because + has no effect
8516 * x || f(); // no warning, because x controls execution of f()
8517 * x ? y : f(); // warning, because y has no effect
8518 * (void)x; // no warning to be able to suppress the warning
8519 * This function can NOT be used for an "expression has definitely no effect"-
8521 static bool expression_has_effect(const expression_t *const expr)
8523 switch (expr->kind) {
8524 case EXPR_ERROR: return true; /* do NOT warn */
8525 case EXPR_REFERENCE: return false;
8526 case EXPR_REFERENCE_ENUM_VALUE: return false;
8527 case EXPR_LABEL_ADDRESS: return false;
8529 /* suppress the warning for microsoft __noop operations */
8530 case EXPR_LITERAL_MS_NOOP: return true;
8531 case EXPR_LITERAL_BOOLEAN:
8532 case EXPR_LITERAL_CHARACTER:
8533 case EXPR_LITERAL_WIDE_CHARACTER:
8534 case EXPR_LITERAL_INTEGER:
8535 case EXPR_LITERAL_INTEGER_OCTAL:
8536 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
8537 case EXPR_LITERAL_FLOATINGPOINT:
8538 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: return false;
8539 case EXPR_STRING_LITERAL: return false;
8540 case EXPR_WIDE_STRING_LITERAL: return false;
8543 const call_expression_t *const call = &expr->call;
8544 if (call->function->kind != EXPR_REFERENCE)
8547 switch (call->function->reference.entity->function.btk) {
8548 /* FIXME: which builtins have no effect? */
8549 default: return true;
8553 /* Generate the warning if either the left or right hand side of a
8554 * conditional expression has no effect */
8555 case EXPR_CONDITIONAL: {
8556 conditional_expression_t const *const cond = &expr->conditional;
8557 expression_t const *const t = cond->true_expression;
8559 (t == NULL || expression_has_effect(t)) &&
8560 expression_has_effect(cond->false_expression);
8563 case EXPR_SELECT: return false;
8564 case EXPR_ARRAY_ACCESS: return false;
8565 case EXPR_SIZEOF: return false;
8566 case EXPR_CLASSIFY_TYPE: return false;
8567 case EXPR_ALIGNOF: return false;
8569 case EXPR_FUNCNAME: return false;
8570 case EXPR_BUILTIN_CONSTANT_P: return false;
8571 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8572 case EXPR_OFFSETOF: return false;
8573 case EXPR_VA_START: return true;
8574 case EXPR_VA_ARG: return true;
8575 case EXPR_VA_COPY: return true;
8576 case EXPR_STATEMENT: return true; // TODO
8577 case EXPR_COMPOUND_LITERAL: return false;
8579 case EXPR_UNARY_NEGATE: return false;
8580 case EXPR_UNARY_PLUS: return false;
8581 case EXPR_UNARY_BITWISE_NEGATE: return false;
8582 case EXPR_UNARY_NOT: return false;
8583 case EXPR_UNARY_DEREFERENCE: return false;
8584 case EXPR_UNARY_TAKE_ADDRESS: return false;
8585 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8586 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8587 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8588 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8590 /* Treat void casts as if they have an effect in order to being able to
8591 * suppress the warning */
8592 case EXPR_UNARY_CAST: {
8593 type_t *const type = skip_typeref(expr->base.type);
8594 return is_type_atomic(type, ATOMIC_TYPE_VOID);
8597 case EXPR_UNARY_ASSUME: return true;
8598 case EXPR_UNARY_DELETE: return true;
8599 case EXPR_UNARY_DELETE_ARRAY: return true;
8600 case EXPR_UNARY_THROW: return true;
8602 case EXPR_BINARY_ADD: return false;
8603 case EXPR_BINARY_SUB: return false;
8604 case EXPR_BINARY_MUL: return false;
8605 case EXPR_BINARY_DIV: return false;
8606 case EXPR_BINARY_MOD: return false;
8607 case EXPR_BINARY_EQUAL: return false;
8608 case EXPR_BINARY_NOTEQUAL: return false;
8609 case EXPR_BINARY_LESS: return false;
8610 case EXPR_BINARY_LESSEQUAL: return false;
8611 case EXPR_BINARY_GREATER: return false;
8612 case EXPR_BINARY_GREATEREQUAL: return false;
8613 case EXPR_BINARY_BITWISE_AND: return false;
8614 case EXPR_BINARY_BITWISE_OR: return false;
8615 case EXPR_BINARY_BITWISE_XOR: return false;
8616 case EXPR_BINARY_SHIFTLEFT: return false;
8617 case EXPR_BINARY_SHIFTRIGHT: return false;
8618 case EXPR_BINARY_ASSIGN: return true;
8619 case EXPR_BINARY_MUL_ASSIGN: return true;
8620 case EXPR_BINARY_DIV_ASSIGN: return true;
8621 case EXPR_BINARY_MOD_ASSIGN: return true;
8622 case EXPR_BINARY_ADD_ASSIGN: return true;
8623 case EXPR_BINARY_SUB_ASSIGN: return true;
8624 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8625 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8626 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8627 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8628 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8630 /* Only examine the right hand side of && and ||, because the left hand
8631 * side already has the effect of controlling the execution of the right
8633 case EXPR_BINARY_LOGICAL_AND:
8634 case EXPR_BINARY_LOGICAL_OR:
8635 /* Only examine the right hand side of a comma expression, because the left
8636 * hand side has a separate warning */
8637 case EXPR_BINARY_COMMA:
8638 return expression_has_effect(expr->binary.right);
8640 case EXPR_BINARY_ISGREATER: return false;
8641 case EXPR_BINARY_ISGREATEREQUAL: return false;
8642 case EXPR_BINARY_ISLESS: return false;
8643 case EXPR_BINARY_ISLESSEQUAL: return false;
8644 case EXPR_BINARY_ISLESSGREATER: return false;
8645 case EXPR_BINARY_ISUNORDERED: return false;
8648 internal_errorf(HERE, "unexpected expression");
8651 static void semantic_comma(binary_expression_t *expression)
8653 const expression_t *const left = expression->left;
8654 if (!expression_has_effect(left)) {
8655 source_position_t const *const pos = &left->base.source_position;
8656 warningf(WARN_UNUSED_VALUE, pos, "left-hand operand of comma expression has no effect");
8658 expression->base.type = expression->right->base.type;
8662 * @param prec_r precedence of the right operand
8664 #define CREATE_BINEXPR_PARSER(token_kind, binexpression_type, prec_r, sfunc) \
8665 static expression_t *parse_##binexpression_type(expression_t *left) \
8667 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8668 binexpr->binary.left = left; \
8671 expression_t *right = parse_subexpression(prec_r); \
8673 binexpr->binary.right = right; \
8674 sfunc(&binexpr->binary); \
8679 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8680 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
8681 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
8682 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8683 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8684 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8685 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8686 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
8687 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
8688 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
8689 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
8690 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
8691 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
8692 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_integer)
8693 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_integer)
8694 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_integer)
8695 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8696 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8697 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
8698 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8699 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8700 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8701 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8702 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8703 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8704 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8705 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8706 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8707 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8708 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
8711 static expression_t *parse_subexpression(precedence_t precedence)
8713 if (token.kind < 0) {
8714 return expected_expression_error();
8717 expression_parser_function_t *parser
8718 = &expression_parsers[token.kind];
8721 if (parser->parser != NULL) {
8722 left = parser->parser();
8724 left = parse_primary_expression();
8726 assert(left != NULL);
8729 if (token.kind < 0) {
8730 return expected_expression_error();
8733 parser = &expression_parsers[token.kind];
8734 if (parser->infix_parser == NULL)
8736 if (parser->infix_precedence < precedence)
8739 left = parser->infix_parser(left);
8741 assert(left != NULL);
8748 * Parse an expression.
8750 static expression_t *parse_expression(void)
8752 return parse_subexpression(PREC_EXPRESSION);
8756 * Register a parser for a prefix-like operator.
8758 * @param parser the parser function
8759 * @param token_kind the token type of the prefix token
8761 static void register_expression_parser(parse_expression_function parser,
8764 expression_parser_function_t *entry = &expression_parsers[token_kind];
8766 if (entry->parser != NULL) {
8767 diagnosticf("for token '%k'\n", (token_kind_t)token_kind);
8768 panic("trying to register multiple expression parsers for a token");
8770 entry->parser = parser;
8774 * Register a parser for an infix operator with given precedence.
8776 * @param parser the parser function
8777 * @param token_kind the token type of the infix operator
8778 * @param precedence the precedence of the operator
8780 static void register_infix_parser(parse_expression_infix_function parser,
8781 int token_kind, precedence_t precedence)
8783 expression_parser_function_t *entry = &expression_parsers[token_kind];
8785 if (entry->infix_parser != NULL) {
8786 diagnosticf("for token '%k'\n", (token_kind_t)token_kind);
8787 panic("trying to register multiple infix expression parsers for a "
8790 entry->infix_parser = parser;
8791 entry->infix_precedence = precedence;
8795 * Initialize the expression parsers.
8797 static void init_expression_parsers(void)
8799 memset(&expression_parsers, 0, sizeof(expression_parsers));
8801 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
8802 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
8803 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
8804 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
8805 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
8806 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
8807 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
8808 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
8809 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
8810 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
8811 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
8812 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
8813 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
8814 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
8815 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
8816 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
8817 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
8818 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
8819 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
8820 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
8821 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
8822 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
8823 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
8824 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
8825 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
8826 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
8827 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
8828 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
8829 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
8830 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
8831 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
8832 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
8833 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
8834 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
8835 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
8836 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
8837 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
8839 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
8840 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
8841 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
8842 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
8843 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
8844 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
8845 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
8846 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
8847 register_expression_parser(parse_sizeof, T_sizeof);
8848 register_expression_parser(parse_alignof, T___alignof__);
8849 register_expression_parser(parse_extension, T___extension__);
8850 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
8851 register_expression_parser(parse_delete, T_delete);
8852 register_expression_parser(parse_throw, T_throw);
8856 * Parse a asm statement arguments specification.
8858 static asm_argument_t *parse_asm_arguments(bool is_out)
8860 asm_argument_t *result = NULL;
8861 asm_argument_t **anchor = &result;
8863 while (token.kind == T_STRING_LITERAL || token.kind == '[') {
8864 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
8865 memset(argument, 0, sizeof(argument[0]));
8868 if (token.kind != T_IDENTIFIER) {
8869 parse_error_expected("while parsing asm argument",
8870 T_IDENTIFIER, NULL);
8873 argument->symbol = token.identifier.symbol;
8875 expect(']', end_error);
8878 argument->constraints = parse_string_literals();
8879 expect('(', end_error);
8880 add_anchor_token(')');
8881 expression_t *expression = parse_expression();
8882 rem_anchor_token(')');
8884 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
8885 * change size or type representation (e.g. int -> long is ok, but
8886 * int -> float is not) */
8887 if (expression->kind == EXPR_UNARY_CAST) {
8888 type_t *const type = expression->base.type;
8889 type_kind_t const kind = type->kind;
8890 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
8893 if (kind == TYPE_ATOMIC) {
8894 atomic_type_kind_t const akind = type->atomic.akind;
8895 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8896 size = get_atomic_type_size(akind);
8898 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8899 size = get_type_size(type_void_ptr);
8903 expression_t *const value = expression->unary.value;
8904 type_t *const value_type = value->base.type;
8905 type_kind_t const value_kind = value_type->kind;
8907 unsigned value_flags;
8908 unsigned value_size;
8909 if (value_kind == TYPE_ATOMIC) {
8910 atomic_type_kind_t const value_akind = value_type->atomic.akind;
8911 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8912 value_size = get_atomic_type_size(value_akind);
8913 } else if (value_kind == TYPE_POINTER) {
8914 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8915 value_size = get_type_size(type_void_ptr);
8920 if (value_flags != flags || value_size != size)
8924 } while (expression->kind == EXPR_UNARY_CAST);
8928 if (!is_lvalue(expression)) {
8929 errorf(&expression->base.source_position,
8930 "asm output argument is not an lvalue");
8933 if (argument->constraints.begin[0] == '=')
8934 determine_lhs_ent(expression, NULL);
8936 mark_vars_read(expression, NULL);
8938 mark_vars_read(expression, NULL);
8940 argument->expression = expression;
8941 expect(')', end_error);
8943 set_address_taken(expression, true);
8946 anchor = &argument->next;
8958 * Parse a asm statement clobber specification.
8960 static asm_clobber_t *parse_asm_clobbers(void)
8962 asm_clobber_t *result = NULL;
8963 asm_clobber_t **anchor = &result;
8965 while (token.kind == T_STRING_LITERAL) {
8966 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
8967 clobber->clobber = parse_string_literals();
8970 anchor = &clobber->next;
8980 * Parse an asm statement.
8982 static statement_t *parse_asm_statement(void)
8984 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
8985 asm_statement_t *asm_statement = &statement->asms;
8989 if (next_if(T_volatile))
8990 asm_statement->is_volatile = true;
8992 expect('(', end_error);
8993 add_anchor_token(')');
8994 if (token.kind != T_STRING_LITERAL) {
8995 parse_error_expected("after asm(", T_STRING_LITERAL, NULL);
8998 asm_statement->asm_text = parse_string_literals();
9000 add_anchor_token(':');
9001 if (!next_if(':')) {
9002 rem_anchor_token(':');
9006 asm_statement->outputs = parse_asm_arguments(true);
9007 if (!next_if(':')) {
9008 rem_anchor_token(':');
9012 asm_statement->inputs = parse_asm_arguments(false);
9013 if (!next_if(':')) {
9014 rem_anchor_token(':');
9017 rem_anchor_token(':');
9019 asm_statement->clobbers = parse_asm_clobbers();
9022 rem_anchor_token(')');
9023 expect(')', end_error);
9024 expect(';', end_error);
9026 if (asm_statement->outputs == NULL) {
9027 /* GCC: An 'asm' instruction without any output operands will be treated
9028 * identically to a volatile 'asm' instruction. */
9029 asm_statement->is_volatile = true;
9034 return create_error_statement();
9037 static statement_t *parse_label_inner_statement(statement_t const *const label, char const *const label_kind)
9039 statement_t *inner_stmt;
9040 switch (token.kind) {
9042 errorf(&label->base.source_position, "%s at end of compound statement", label_kind);
9043 inner_stmt = create_error_statement();
9047 if (label->kind == STATEMENT_LABEL) {
9048 /* Eat an empty statement here, to avoid the warning about an empty
9049 * statement after a label. label:; is commonly used to have a label
9050 * before a closing brace. */
9051 inner_stmt = create_empty_statement();
9058 inner_stmt = parse_statement();
9059 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
9060 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
9061 if (inner_stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
9062 errorf(&inner_stmt->base.source_position, "declaration after %s", label_kind);
9070 * Parse a case statement.
9072 static statement_t *parse_case_statement(void)
9074 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9075 source_position_t *const pos = &statement->base.source_position;
9079 expression_t *const expression = parse_expression();
9080 statement->case_label.expression = expression;
9081 expression_classification_t const expr_class = is_constant_expression(expression);
9082 if (expr_class != EXPR_CLASS_CONSTANT) {
9083 if (expr_class != EXPR_CLASS_ERROR) {
9084 errorf(pos, "case label does not reduce to an integer constant");
9086 statement->case_label.is_bad = true;
9088 long const val = fold_constant_to_int(expression);
9089 statement->case_label.first_case = val;
9090 statement->case_label.last_case = val;
9094 if (next_if(T_DOTDOTDOT)) {
9095 expression_t *const end_range = parse_expression();
9096 statement->case_label.end_range = end_range;
9097 expression_classification_t const end_class = is_constant_expression(end_range);
9098 if (end_class != EXPR_CLASS_CONSTANT) {
9099 if (end_class != EXPR_CLASS_ERROR) {
9100 errorf(pos, "case range does not reduce to an integer constant");
9102 statement->case_label.is_bad = true;
9104 long const val = fold_constant_to_int(end_range);
9105 statement->case_label.last_case = val;
9107 if (val < statement->case_label.first_case) {
9108 statement->case_label.is_empty_range = true;
9109 warningf(WARN_OTHER, pos, "empty range specified");
9115 PUSH_PARENT(statement);
9117 expect(':', end_error);
9120 if (current_switch != NULL) {
9121 if (! statement->case_label.is_bad) {
9122 /* Check for duplicate case values */
9123 case_label_statement_t *c = &statement->case_label;
9124 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9125 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9128 if (c->last_case < l->first_case || c->first_case > l->last_case)
9131 errorf(pos, "duplicate case value (previously used %P)",
9132 &l->base.source_position);
9136 /* link all cases into the switch statement */
9137 if (current_switch->last_case == NULL) {
9138 current_switch->first_case = &statement->case_label;
9140 current_switch->last_case->next = &statement->case_label;
9142 current_switch->last_case = &statement->case_label;
9144 errorf(pos, "case label not within a switch statement");
9147 statement->case_label.statement = parse_label_inner_statement(statement, "case label");
9154 * Parse a default statement.
9156 static statement_t *parse_default_statement(void)
9158 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9162 PUSH_PARENT(statement);
9164 expect(':', end_error);
9167 if (current_switch != NULL) {
9168 const case_label_statement_t *def_label = current_switch->default_label;
9169 if (def_label != NULL) {
9170 errorf(&statement->base.source_position, "multiple default labels in one switch (previous declared %P)", &def_label->base.source_position);
9172 current_switch->default_label = &statement->case_label;
9174 /* link all cases into the switch statement */
9175 if (current_switch->last_case == NULL) {
9176 current_switch->first_case = &statement->case_label;
9178 current_switch->last_case->next = &statement->case_label;
9180 current_switch->last_case = &statement->case_label;
9183 errorf(&statement->base.source_position,
9184 "'default' label not within a switch statement");
9187 statement->case_label.statement = parse_label_inner_statement(statement, "default label");
9194 * Parse a label statement.
9196 static statement_t *parse_label_statement(void)
9198 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9199 label_t *const label = get_label();
9200 statement->label.label = label;
9202 PUSH_PARENT(statement);
9204 /* if statement is already set then the label is defined twice,
9205 * otherwise it was just mentioned in a goto/local label declaration so far
9207 source_position_t const* const pos = &statement->base.source_position;
9208 if (label->statement != NULL) {
9209 errorf(pos, "duplicate '%N' (declared %P)", (entity_t const*)label, &label->base.source_position);
9211 label->base.source_position = *pos;
9212 label->statement = statement;
9217 if (token.kind == T___attribute__ && !(c_mode & _CXX)) {
9218 parse_attributes(NULL); // TODO process attributes
9221 statement->label.statement = parse_label_inner_statement(statement, "label");
9223 /* remember the labels in a list for later checking */
9224 *label_anchor = &statement->label;
9225 label_anchor = &statement->label.next;
9231 static statement_t *parse_inner_statement(void)
9233 statement_t *const stmt = parse_statement();
9234 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
9235 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
9236 if (stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
9237 errorf(&stmt->base.source_position, "declaration as inner statement, use {}");
9243 * Parse an if statement.
9245 static statement_t *parse_if(void)
9247 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9251 PUSH_PARENT(statement);
9253 add_anchor_token('{');
9255 expect('(', end_error);
9256 add_anchor_token(')');
9257 expression_t *const expr = parse_expression();
9258 statement->ifs.condition = expr;
9259 /* §6.8.4.1:1 The controlling expression of an if statement shall have
9261 semantic_condition(expr, "condition of 'if'-statment");
9262 mark_vars_read(expr, NULL);
9263 rem_anchor_token(')');
9264 expect(')', end_error);
9267 rem_anchor_token('{');
9269 add_anchor_token(T_else);
9270 statement_t *const true_stmt = parse_inner_statement();
9271 statement->ifs.true_statement = true_stmt;
9272 rem_anchor_token(T_else);
9274 if (true_stmt->kind == STATEMENT_EMPTY) {
9275 warningf(WARN_EMPTY_BODY, HERE,
9276 "suggest braces around empty body in an ‘if’ statement");
9279 if (next_if(T_else)) {
9280 statement->ifs.false_statement = parse_inner_statement();
9282 if (statement->ifs.false_statement->kind == STATEMENT_EMPTY) {
9283 warningf(WARN_EMPTY_BODY, HERE,
9284 "suggest braces around empty body in an ‘if’ statement");
9286 } else if (true_stmt->kind == STATEMENT_IF &&
9287 true_stmt->ifs.false_statement != NULL) {
9288 source_position_t const *const pos = &true_stmt->base.source_position;
9289 warningf(WARN_PARENTHESES, pos, "suggest explicit braces to avoid ambiguous 'else'");
9297 * Check that all enums are handled in a switch.
9299 * @param statement the switch statement to check
9301 static void check_enum_cases(const switch_statement_t *statement)
9303 if (!is_warn_on(WARN_SWITCH_ENUM))
9305 const type_t *type = skip_typeref(statement->expression->base.type);
9306 if (! is_type_enum(type))
9308 const enum_type_t *enumt = &type->enumt;
9310 /* if we have a default, no warnings */
9311 if (statement->default_label != NULL)
9314 /* FIXME: calculation of value should be done while parsing */
9315 /* TODO: quadratic algorithm here. Change to an n log n one */
9316 long last_value = -1;
9317 const entity_t *entry = enumt->enume->base.next;
9318 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9319 entry = entry->base.next) {
9320 const expression_t *expression = entry->enum_value.value;
9321 long value = expression != NULL ? fold_constant_to_int(expression) : last_value + 1;
9323 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9324 if (l->expression == NULL)
9326 if (l->first_case <= value && value <= l->last_case) {
9332 source_position_t const *const pos = &statement->base.source_position;
9333 warningf(WARN_SWITCH_ENUM, pos, "'%N' not handled in switch", entry);
9340 * Parse a switch statement.
9342 static statement_t *parse_switch(void)
9344 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9348 PUSH_PARENT(statement);
9350 expect('(', end_error);
9351 add_anchor_token(')');
9352 expression_t *const expr = parse_expression();
9353 mark_vars_read(expr, NULL);
9354 type_t * type = skip_typeref(expr->base.type);
9355 if (is_type_integer(type)) {
9356 type = promote_integer(type);
9357 if (get_rank(type) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9358 warningf(WARN_TRADITIONAL, &expr->base.source_position, "'%T' switch expression not converted to '%T' in ISO C", type, type_int);
9360 } else if (is_type_valid(type)) {
9361 errorf(&expr->base.source_position,
9362 "switch quantity is not an integer, but '%T'", type);
9363 type = type_error_type;
9365 statement->switchs.expression = create_implicit_cast(expr, type);
9366 expect(')', end_error);
9367 rem_anchor_token(')');
9369 switch_statement_t *rem = current_switch;
9370 current_switch = &statement->switchs;
9371 statement->switchs.body = parse_inner_statement();
9372 current_switch = rem;
9374 if (statement->switchs.default_label == NULL) {
9375 warningf(WARN_SWITCH_DEFAULT, &statement->base.source_position, "switch has no default case");
9377 check_enum_cases(&statement->switchs);
9383 return create_error_statement();
9386 static statement_t *parse_loop_body(statement_t *const loop)
9388 statement_t *const rem = current_loop;
9389 current_loop = loop;
9391 statement_t *const body = parse_inner_statement();
9398 * Parse a while statement.
9400 static statement_t *parse_while(void)
9402 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9406 PUSH_PARENT(statement);
9408 expect('(', end_error);
9409 add_anchor_token(')');
9410 expression_t *const cond = parse_expression();
9411 statement->whiles.condition = cond;
9412 /* §6.8.5:2 The controlling expression of an iteration statement shall
9413 * have scalar type. */
9414 semantic_condition(cond, "condition of 'while'-statement");
9415 mark_vars_read(cond, NULL);
9416 rem_anchor_token(')');
9417 expect(')', end_error);
9419 statement->whiles.body = parse_loop_body(statement);
9425 return create_error_statement();
9429 * Parse a do statement.
9431 static statement_t *parse_do(void)
9433 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9437 PUSH_PARENT(statement);
9439 add_anchor_token(T_while);
9440 statement->do_while.body = parse_loop_body(statement);
9441 rem_anchor_token(T_while);
9443 expect(T_while, end_error);
9444 expect('(', end_error);
9445 add_anchor_token(')');
9446 expression_t *const cond = parse_expression();
9447 statement->do_while.condition = cond;
9448 /* §6.8.5:2 The controlling expression of an iteration statement shall
9449 * have scalar type. */
9450 semantic_condition(cond, "condition of 'do-while'-statement");
9451 mark_vars_read(cond, NULL);
9452 rem_anchor_token(')');
9453 expect(')', end_error);
9454 expect(';', end_error);
9460 return create_error_statement();
9464 * Parse a for statement.
9466 static statement_t *parse_for(void)
9468 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9472 expect('(', end_error1);
9473 add_anchor_token(')');
9475 PUSH_PARENT(statement);
9476 PUSH_SCOPE(&statement->fors.scope);
9481 } else if (is_declaration_specifier(&token)) {
9482 parse_declaration(record_entity, DECL_FLAGS_NONE);
9484 add_anchor_token(';');
9485 expression_t *const init = parse_expression();
9486 statement->fors.initialisation = init;
9487 mark_vars_read(init, ENT_ANY);
9488 if (!expression_has_effect(init)) {
9489 warningf(WARN_UNUSED_VALUE, &init->base.source_position, "initialisation of 'for'-statement has no effect");
9491 rem_anchor_token(';');
9492 expect(';', end_error2);
9497 if (token.kind != ';') {
9498 add_anchor_token(';');
9499 expression_t *const cond = parse_expression();
9500 statement->fors.condition = cond;
9501 /* §6.8.5:2 The controlling expression of an iteration statement
9502 * shall have scalar type. */
9503 semantic_condition(cond, "condition of 'for'-statement");
9504 mark_vars_read(cond, NULL);
9505 rem_anchor_token(';');
9507 expect(';', end_error2);
9508 if (token.kind != ')') {
9509 expression_t *const step = parse_expression();
9510 statement->fors.step = step;
9511 mark_vars_read(step, ENT_ANY);
9512 if (!expression_has_effect(step)) {
9513 warningf(WARN_UNUSED_VALUE, &step->base.source_position, "step of 'for'-statement has no effect");
9516 expect(')', end_error2);
9517 rem_anchor_token(')');
9518 statement->fors.body = parse_loop_body(statement);
9526 rem_anchor_token(')');
9531 return create_error_statement();
9535 * Parse a goto statement.
9537 static statement_t *parse_goto(void)
9539 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
9542 if (GNU_MODE && next_if('*')) {
9543 expression_t *expression = parse_expression();
9544 mark_vars_read(expression, NULL);
9546 /* Argh: although documentation says the expression must be of type void*,
9547 * gcc accepts anything that can be casted into void* without error */
9548 type_t *type = expression->base.type;
9550 if (type != type_error_type) {
9551 if (!is_type_pointer(type) && !is_type_integer(type)) {
9552 errorf(&expression->base.source_position,
9553 "cannot convert to a pointer type");
9554 } else if (type != type_void_ptr) {
9555 warningf(WARN_OTHER, &expression->base.source_position, "type of computed goto expression should be 'void*' not '%T'", type);
9557 expression = create_implicit_cast(expression, type_void_ptr);
9560 statement->gotos.expression = expression;
9561 } else if (token.kind == T_IDENTIFIER) {
9562 label_t *const label = get_label();
9564 statement->gotos.label = label;
9567 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
9569 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
9571 return create_error_statement();
9574 /* remember the goto's in a list for later checking */
9575 *goto_anchor = &statement->gotos;
9576 goto_anchor = &statement->gotos.next;
9578 expect(';', end_error);
9585 * Parse a continue statement.
9587 static statement_t *parse_continue(void)
9589 if (current_loop == NULL) {
9590 errorf(HERE, "continue statement not within loop");
9593 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9596 expect(';', end_error);
9603 * Parse a break statement.
9605 static statement_t *parse_break(void)
9607 if (current_switch == NULL && current_loop == NULL) {
9608 errorf(HERE, "break statement not within loop or switch");
9611 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9614 expect(';', end_error);
9621 * Parse a __leave statement.
9623 static statement_t *parse_leave_statement(void)
9625 if (current_try == NULL) {
9626 errorf(HERE, "__leave statement not within __try");
9629 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9632 expect(';', end_error);
9639 * Check if a given entity represents a local variable.
9641 static bool is_local_variable(const entity_t *entity)
9643 if (entity->kind != ENTITY_VARIABLE)
9646 switch ((storage_class_tag_t) entity->declaration.storage_class) {
9647 case STORAGE_CLASS_AUTO:
9648 case STORAGE_CLASS_REGISTER: {
9649 const type_t *type = skip_typeref(entity->declaration.type);
9650 if (is_type_function(type)) {
9662 * Check if a given expression represents a local variable.
9664 static bool expression_is_local_variable(const expression_t *expression)
9666 if (expression->base.kind != EXPR_REFERENCE) {
9669 const entity_t *entity = expression->reference.entity;
9670 return is_local_variable(entity);
9674 * Check if a given expression represents a local variable and
9675 * return its declaration then, else return NULL.
9677 entity_t *expression_is_variable(const expression_t *expression)
9679 if (expression->base.kind != EXPR_REFERENCE) {
9682 entity_t *entity = expression->reference.entity;
9683 if (entity->kind != ENTITY_VARIABLE)
9690 * Parse a return statement.
9692 static statement_t *parse_return(void)
9694 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9697 expression_t *return_value = NULL;
9698 if (token.kind != ';') {
9699 return_value = parse_expression();
9700 mark_vars_read(return_value, NULL);
9703 const type_t *const func_type = skip_typeref(current_function->base.type);
9704 assert(is_type_function(func_type));
9705 type_t *const return_type = skip_typeref(func_type->function.return_type);
9707 source_position_t const *const pos = &statement->base.source_position;
9708 if (return_value != NULL) {
9709 type_t *return_value_type = skip_typeref(return_value->base.type);
9711 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
9712 if (is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
9713 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
9714 /* Only warn in C mode, because GCC does the same */
9715 if (c_mode & _CXX || strict_mode) {
9717 "'return' with a value, in function returning 'void'");
9719 warningf(WARN_OTHER, pos, "'return' with a value, in function returning 'void'");
9721 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9722 /* Only warn in C mode, because GCC does the same */
9725 "'return' with expression in function returning 'void'");
9727 warningf(WARN_OTHER, pos, "'return' with expression in function returning 'void'");
9731 assign_error_t error = semantic_assign(return_type, return_value);
9732 report_assign_error(error, return_type, return_value, "'return'",
9735 return_value = create_implicit_cast(return_value, return_type);
9736 /* check for returning address of a local var */
9737 if (return_value != NULL && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
9738 const expression_t *expression = return_value->unary.value;
9739 if (expression_is_local_variable(expression)) {
9740 warningf(WARN_OTHER, pos, "function returns address of local variable");
9743 } else if (!is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
9744 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9745 if (c_mode & _CXX || strict_mode) {
9747 "'return' without value, in function returning non-void");
9749 warningf(WARN_OTHER, pos, "'return' without value, in function returning non-void");
9752 statement->returns.value = return_value;
9754 expect(';', end_error);
9761 * Parse a declaration statement.
9763 static statement_t *parse_declaration_statement(void)
9765 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9767 entity_t *before = current_scope->last_entity;
9769 parse_external_declaration();
9771 parse_declaration(record_entity, DECL_FLAGS_NONE);
9774 declaration_statement_t *const decl = &statement->declaration;
9775 entity_t *const begin =
9776 before != NULL ? before->base.next : current_scope->entities;
9777 decl->declarations_begin = begin;
9778 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
9784 * Parse an expression statement, ie. expr ';'.
9786 static statement_t *parse_expression_statement(void)
9788 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
9790 expression_t *const expr = parse_expression();
9791 statement->expression.expression = expr;
9792 mark_vars_read(expr, ENT_ANY);
9794 expect(';', end_error);
9801 * Parse a microsoft __try { } __finally { } or
9802 * __try{ } __except() { }
9804 static statement_t *parse_ms_try_statment(void)
9806 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
9809 PUSH_PARENT(statement);
9811 ms_try_statement_t *rem = current_try;
9812 current_try = &statement->ms_try;
9813 statement->ms_try.try_statement = parse_compound_statement(false);
9818 if (next_if(T___except)) {
9819 expect('(', end_error);
9820 add_anchor_token(')');
9821 expression_t *const expr = parse_expression();
9822 mark_vars_read(expr, NULL);
9823 type_t * type = skip_typeref(expr->base.type);
9824 if (is_type_integer(type)) {
9825 type = promote_integer(type);
9826 } else if (is_type_valid(type)) {
9827 errorf(&expr->base.source_position,
9828 "__expect expression is not an integer, but '%T'", type);
9829 type = type_error_type;
9831 statement->ms_try.except_expression = create_implicit_cast(expr, type);
9832 rem_anchor_token(')');
9833 expect(')', end_error);
9834 statement->ms_try.final_statement = parse_compound_statement(false);
9835 } else if (next_if(T__finally)) {
9836 statement->ms_try.final_statement = parse_compound_statement(false);
9838 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
9839 return create_error_statement();
9843 return create_error_statement();
9846 static statement_t *parse_empty_statement(void)
9848 warningf(WARN_EMPTY_STATEMENT, HERE, "statement is empty");
9849 statement_t *const statement = create_empty_statement();
9854 static statement_t *parse_local_label_declaration(void)
9856 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9860 entity_t *begin = NULL;
9861 entity_t *end = NULL;
9862 entity_t **anchor = &begin;
9864 if (token.kind != T_IDENTIFIER) {
9865 parse_error_expected("while parsing local label declaration",
9866 T_IDENTIFIER, NULL);
9869 symbol_t *symbol = token.identifier.symbol;
9870 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
9871 if (entity != NULL && entity->base.parent_scope == current_scope) {
9872 source_position_t const *const ppos = &entity->base.source_position;
9873 errorf(HERE, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
9875 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL, NAMESPACE_LABEL, symbol);
9876 entity->base.parent_scope = current_scope;
9877 entity->base.source_position = token.base.source_position;
9880 anchor = &entity->base.next;
9883 environment_push(entity);
9886 } while (next_if(','));
9887 expect(';', end_error);
9889 statement->declaration.declarations_begin = begin;
9890 statement->declaration.declarations_end = end;
9894 static void parse_namespace_definition(void)
9898 entity_t *entity = NULL;
9899 symbol_t *symbol = NULL;
9901 if (token.kind == T_IDENTIFIER) {
9902 symbol = token.identifier.symbol;
9905 entity = get_entity(symbol, NAMESPACE_NORMAL);
9907 && entity->kind != ENTITY_NAMESPACE
9908 && entity->base.parent_scope == current_scope) {
9909 if (is_entity_valid(entity)) {
9910 error_redefined_as_different_kind(&token.base.source_position,
9911 entity, ENTITY_NAMESPACE);
9917 if (entity == NULL) {
9918 entity = allocate_entity_zero(ENTITY_NAMESPACE, NAMESPACE_NORMAL, symbol);
9919 entity->base.source_position = token.base.source_position;
9920 entity->base.parent_scope = current_scope;
9923 if (token.kind == '=') {
9924 /* TODO: parse namespace alias */
9925 panic("namespace alias definition not supported yet");
9928 environment_push(entity);
9929 append_entity(current_scope, entity);
9931 PUSH_SCOPE(&entity->namespacee.members);
9933 entity_t *old_current_entity = current_entity;
9934 current_entity = entity;
9936 expect('{', end_error);
9938 expect('}', end_error);
9941 assert(current_entity == entity);
9942 current_entity = old_current_entity;
9947 * Parse a statement.
9948 * There's also parse_statement() which additionally checks for
9949 * "statement has no effect" warnings
9951 static statement_t *intern_parse_statement(void)
9953 statement_t *statement = NULL;
9955 /* declaration or statement */
9956 add_anchor_token(';');
9957 switch (token.kind) {
9958 case T_IDENTIFIER: {
9959 token_kind_t la1_type = (token_kind_t)look_ahead(1)->kind;
9960 if (la1_type == ':') {
9961 statement = parse_label_statement();
9962 } else if (is_typedef_symbol(token.identifier.symbol)) {
9963 statement = parse_declaration_statement();
9965 /* it's an identifier, the grammar says this must be an
9966 * expression statement. However it is common that users mistype
9967 * declaration types, so we guess a bit here to improve robustness
9968 * for incorrect programs */
9972 if (get_entity(token.identifier.symbol, NAMESPACE_NORMAL) != NULL) {
9974 statement = parse_expression_statement();
9978 statement = parse_declaration_statement();
9986 case T___extension__: {
9987 /* This can be a prefix to a declaration or an expression statement.
9988 * We simply eat it now and parse the rest with tail recursion. */
9990 statement = intern_parse_statement();
9996 statement = parse_declaration_statement();
10000 statement = parse_local_label_declaration();
10003 case ';': statement = parse_empty_statement(); break;
10004 case '{': statement = parse_compound_statement(false); break;
10005 case T___leave: statement = parse_leave_statement(); break;
10006 case T___try: statement = parse_ms_try_statment(); break;
10007 case T_asm: statement = parse_asm_statement(); break;
10008 case T_break: statement = parse_break(); break;
10009 case T_case: statement = parse_case_statement(); break;
10010 case T_continue: statement = parse_continue(); break;
10011 case T_default: statement = parse_default_statement(); break;
10012 case T_do: statement = parse_do(); break;
10013 case T_for: statement = parse_for(); break;
10014 case T_goto: statement = parse_goto(); break;
10015 case T_if: statement = parse_if(); break;
10016 case T_return: statement = parse_return(); break;
10017 case T_switch: statement = parse_switch(); break;
10018 case T_while: statement = parse_while(); break;
10021 statement = parse_expression_statement();
10025 errorf(HERE, "unexpected token %K while parsing statement", &token);
10026 statement = create_error_statement();
10031 rem_anchor_token(';');
10033 assert(statement != NULL
10034 && statement->base.source_position.input_name != NULL);
10040 * parse a statement and emits "statement has no effect" warning if needed
10041 * (This is really a wrapper around intern_parse_statement with check for 1
10042 * single warning. It is needed, because for statement expressions we have
10043 * to avoid the warning on the last statement)
10045 static statement_t *parse_statement(void)
10047 statement_t *statement = intern_parse_statement();
10049 if (statement->kind == STATEMENT_EXPRESSION) {
10050 expression_t *expression = statement->expression.expression;
10051 if (!expression_has_effect(expression)) {
10052 warningf(WARN_UNUSED_VALUE, &expression->base.source_position, "statement has no effect");
10060 * Parse a compound statement.
10062 static statement_t *parse_compound_statement(bool inside_expression_statement)
10064 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
10066 PUSH_PARENT(statement);
10067 PUSH_SCOPE(&statement->compound.scope);
10070 add_anchor_token('}');
10071 /* tokens, which can start a statement */
10072 /* TODO MS, __builtin_FOO */
10073 add_anchor_token('!');
10074 add_anchor_token('&');
10075 add_anchor_token('(');
10076 add_anchor_token('*');
10077 add_anchor_token('+');
10078 add_anchor_token('-');
10079 add_anchor_token('{');
10080 add_anchor_token('~');
10081 add_anchor_token(T_CHARACTER_CONSTANT);
10082 add_anchor_token(T_COLONCOLON);
10083 add_anchor_token(T_FLOATINGPOINT);
10084 add_anchor_token(T_IDENTIFIER);
10085 add_anchor_token(T_INTEGER);
10086 add_anchor_token(T_MINUSMINUS);
10087 add_anchor_token(T_PLUSPLUS);
10088 add_anchor_token(T_STRING_LITERAL);
10089 add_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10090 add_anchor_token(T_WIDE_STRING_LITERAL);
10091 add_anchor_token(T__Bool);
10092 add_anchor_token(T__Complex);
10093 add_anchor_token(T__Imaginary);
10094 add_anchor_token(T___FUNCTION__);
10095 add_anchor_token(T___PRETTY_FUNCTION__);
10096 add_anchor_token(T___alignof__);
10097 add_anchor_token(T___attribute__);
10098 add_anchor_token(T___builtin_va_start);
10099 add_anchor_token(T___extension__);
10100 add_anchor_token(T___func__);
10101 add_anchor_token(T___imag__);
10102 add_anchor_token(T___label__);
10103 add_anchor_token(T___real__);
10104 add_anchor_token(T___thread);
10105 add_anchor_token(T_asm);
10106 add_anchor_token(T_auto);
10107 add_anchor_token(T_bool);
10108 add_anchor_token(T_break);
10109 add_anchor_token(T_case);
10110 add_anchor_token(T_char);
10111 add_anchor_token(T_class);
10112 add_anchor_token(T_const);
10113 add_anchor_token(T_const_cast);
10114 add_anchor_token(T_continue);
10115 add_anchor_token(T_default);
10116 add_anchor_token(T_delete);
10117 add_anchor_token(T_double);
10118 add_anchor_token(T_do);
10119 add_anchor_token(T_dynamic_cast);
10120 add_anchor_token(T_enum);
10121 add_anchor_token(T_extern);
10122 add_anchor_token(T_false);
10123 add_anchor_token(T_float);
10124 add_anchor_token(T_for);
10125 add_anchor_token(T_goto);
10126 add_anchor_token(T_if);
10127 add_anchor_token(T_inline);
10128 add_anchor_token(T_int);
10129 add_anchor_token(T_long);
10130 add_anchor_token(T_new);
10131 add_anchor_token(T_operator);
10132 add_anchor_token(T_register);
10133 add_anchor_token(T_reinterpret_cast);
10134 add_anchor_token(T_restrict);
10135 add_anchor_token(T_return);
10136 add_anchor_token(T_short);
10137 add_anchor_token(T_signed);
10138 add_anchor_token(T_sizeof);
10139 add_anchor_token(T_static);
10140 add_anchor_token(T_static_cast);
10141 add_anchor_token(T_struct);
10142 add_anchor_token(T_switch);
10143 add_anchor_token(T_template);
10144 add_anchor_token(T_this);
10145 add_anchor_token(T_throw);
10146 add_anchor_token(T_true);
10147 add_anchor_token(T_try);
10148 add_anchor_token(T_typedef);
10149 add_anchor_token(T_typeid);
10150 add_anchor_token(T_typename);
10151 add_anchor_token(T_typeof);
10152 add_anchor_token(T_union);
10153 add_anchor_token(T_unsigned);
10154 add_anchor_token(T_using);
10155 add_anchor_token(T_void);
10156 add_anchor_token(T_volatile);
10157 add_anchor_token(T_wchar_t);
10158 add_anchor_token(T_while);
10160 statement_t **anchor = &statement->compound.statements;
10161 bool only_decls_so_far = true;
10162 while (token.kind != '}') {
10163 if (token.kind == T_EOF) {
10164 errorf(&statement->base.source_position,
10165 "EOF while parsing compound statement");
10168 statement_t *sub_statement = intern_parse_statement();
10169 if (sub_statement->kind == STATEMENT_ERROR) {
10170 /* an error occurred. if we are at an anchor, return */
10176 if (sub_statement->kind != STATEMENT_DECLARATION) {
10177 only_decls_so_far = false;
10178 } else if (!only_decls_so_far) {
10179 source_position_t const *const pos = &sub_statement->base.source_position;
10180 warningf(WARN_DECLARATION_AFTER_STATEMENT, pos, "ISO C90 forbids mixed declarations and code");
10183 *anchor = sub_statement;
10185 while (sub_statement->base.next != NULL)
10186 sub_statement = sub_statement->base.next;
10188 anchor = &sub_statement->base.next;
10192 /* look over all statements again to produce no effect warnings */
10193 if (is_warn_on(WARN_UNUSED_VALUE)) {
10194 statement_t *sub_statement = statement->compound.statements;
10195 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
10196 if (sub_statement->kind != STATEMENT_EXPRESSION)
10198 /* don't emit a warning for the last expression in an expression
10199 * statement as it has always an effect */
10200 if (inside_expression_statement && sub_statement->base.next == NULL)
10203 expression_t *expression = sub_statement->expression.expression;
10204 if (!expression_has_effect(expression)) {
10205 warningf(WARN_UNUSED_VALUE, &expression->base.source_position, "statement has no effect");
10211 rem_anchor_token(T_while);
10212 rem_anchor_token(T_wchar_t);
10213 rem_anchor_token(T_volatile);
10214 rem_anchor_token(T_void);
10215 rem_anchor_token(T_using);
10216 rem_anchor_token(T_unsigned);
10217 rem_anchor_token(T_union);
10218 rem_anchor_token(T_typeof);
10219 rem_anchor_token(T_typename);
10220 rem_anchor_token(T_typeid);
10221 rem_anchor_token(T_typedef);
10222 rem_anchor_token(T_try);
10223 rem_anchor_token(T_true);
10224 rem_anchor_token(T_throw);
10225 rem_anchor_token(T_this);
10226 rem_anchor_token(T_template);
10227 rem_anchor_token(T_switch);
10228 rem_anchor_token(T_struct);
10229 rem_anchor_token(T_static_cast);
10230 rem_anchor_token(T_static);
10231 rem_anchor_token(T_sizeof);
10232 rem_anchor_token(T_signed);
10233 rem_anchor_token(T_short);
10234 rem_anchor_token(T_return);
10235 rem_anchor_token(T_restrict);
10236 rem_anchor_token(T_reinterpret_cast);
10237 rem_anchor_token(T_register);
10238 rem_anchor_token(T_operator);
10239 rem_anchor_token(T_new);
10240 rem_anchor_token(T_long);
10241 rem_anchor_token(T_int);
10242 rem_anchor_token(T_inline);
10243 rem_anchor_token(T_if);
10244 rem_anchor_token(T_goto);
10245 rem_anchor_token(T_for);
10246 rem_anchor_token(T_float);
10247 rem_anchor_token(T_false);
10248 rem_anchor_token(T_extern);
10249 rem_anchor_token(T_enum);
10250 rem_anchor_token(T_dynamic_cast);
10251 rem_anchor_token(T_do);
10252 rem_anchor_token(T_double);
10253 rem_anchor_token(T_delete);
10254 rem_anchor_token(T_default);
10255 rem_anchor_token(T_continue);
10256 rem_anchor_token(T_const_cast);
10257 rem_anchor_token(T_const);
10258 rem_anchor_token(T_class);
10259 rem_anchor_token(T_char);
10260 rem_anchor_token(T_case);
10261 rem_anchor_token(T_break);
10262 rem_anchor_token(T_bool);
10263 rem_anchor_token(T_auto);
10264 rem_anchor_token(T_asm);
10265 rem_anchor_token(T___thread);
10266 rem_anchor_token(T___real__);
10267 rem_anchor_token(T___label__);
10268 rem_anchor_token(T___imag__);
10269 rem_anchor_token(T___func__);
10270 rem_anchor_token(T___extension__);
10271 rem_anchor_token(T___builtin_va_start);
10272 rem_anchor_token(T___attribute__);
10273 rem_anchor_token(T___alignof__);
10274 rem_anchor_token(T___PRETTY_FUNCTION__);
10275 rem_anchor_token(T___FUNCTION__);
10276 rem_anchor_token(T__Imaginary);
10277 rem_anchor_token(T__Complex);
10278 rem_anchor_token(T__Bool);
10279 rem_anchor_token(T_WIDE_STRING_LITERAL);
10280 rem_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10281 rem_anchor_token(T_STRING_LITERAL);
10282 rem_anchor_token(T_PLUSPLUS);
10283 rem_anchor_token(T_MINUSMINUS);
10284 rem_anchor_token(T_INTEGER);
10285 rem_anchor_token(T_IDENTIFIER);
10286 rem_anchor_token(T_FLOATINGPOINT);
10287 rem_anchor_token(T_COLONCOLON);
10288 rem_anchor_token(T_CHARACTER_CONSTANT);
10289 rem_anchor_token('~');
10290 rem_anchor_token('{');
10291 rem_anchor_token('-');
10292 rem_anchor_token('+');
10293 rem_anchor_token('*');
10294 rem_anchor_token('(');
10295 rem_anchor_token('&');
10296 rem_anchor_token('!');
10297 rem_anchor_token('}');
10305 * Check for unused global static functions and variables
10307 static void check_unused_globals(void)
10309 if (!is_warn_on(WARN_UNUSED_FUNCTION) && !is_warn_on(WARN_UNUSED_VARIABLE))
10312 for (const entity_t *entity = file_scope->entities; entity != NULL;
10313 entity = entity->base.next) {
10314 if (!is_declaration(entity))
10317 const declaration_t *declaration = &entity->declaration;
10318 if (declaration->used ||
10319 declaration->modifiers & DM_UNUSED ||
10320 declaration->modifiers & DM_USED ||
10321 declaration->storage_class != STORAGE_CLASS_STATIC)
10326 if (entity->kind == ENTITY_FUNCTION) {
10327 /* inhibit warning for static inline functions */
10328 if (entity->function.is_inline)
10331 why = WARN_UNUSED_FUNCTION;
10332 s = entity->function.statement != NULL ? "defined" : "declared";
10334 why = WARN_UNUSED_VARIABLE;
10338 warningf(why, &declaration->base.source_position, "'%#N' %s but not used", entity, s);
10342 static void parse_global_asm(void)
10344 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10347 expect('(', end_error);
10349 statement->asms.asm_text = parse_string_literals();
10350 statement->base.next = unit->global_asm;
10351 unit->global_asm = statement;
10353 expect(')', end_error);
10354 expect(';', end_error);
10359 static void parse_linkage_specification(void)
10363 source_position_t const pos = *HERE;
10364 char const *const linkage = parse_string_literals().begin;
10366 linkage_kind_t old_linkage = current_linkage;
10367 linkage_kind_t new_linkage;
10368 if (strcmp(linkage, "C") == 0) {
10369 new_linkage = LINKAGE_C;
10370 } else if (strcmp(linkage, "C++") == 0) {
10371 new_linkage = LINKAGE_CXX;
10373 errorf(&pos, "linkage string \"%s\" not recognized", linkage);
10374 new_linkage = LINKAGE_C;
10376 current_linkage = new_linkage;
10378 if (next_if('{')) {
10380 expect('}', end_error);
10386 assert(current_linkage == new_linkage);
10387 current_linkage = old_linkage;
10390 static void parse_external(void)
10392 switch (token.kind) {
10394 if (look_ahead(1)->kind == T_STRING_LITERAL) {
10395 parse_linkage_specification();
10397 DECLARATION_START_NO_EXTERN
10399 case T___extension__:
10400 /* tokens below are for implicit int */
10401 case '&': /* & x; -> int& x; (and error later, because C++ has no
10403 case '*': /* * x; -> int* x; */
10404 case '(': /* (x); -> int (x); */
10406 parse_external_declaration();
10412 parse_global_asm();
10416 parse_namespace_definition();
10420 if (!strict_mode) {
10421 warningf(WARN_STRAY_SEMICOLON, HERE, "stray ';' outside of function");
10428 errorf(HERE, "stray %K outside of function", &token);
10429 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10430 eat_until_matching_token(token.kind);
10436 static void parse_externals(void)
10438 add_anchor_token('}');
10439 add_anchor_token(T_EOF);
10442 /* make a copy of the anchor set, so we can check if it is restored after parsing */
10443 unsigned short token_anchor_copy[T_LAST_TOKEN];
10444 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10447 while (token.kind != T_EOF && token.kind != '}') {
10449 for (int i = 0; i < T_LAST_TOKEN; ++i) {
10450 unsigned short count = token_anchor_set[i] - token_anchor_copy[i];
10452 /* the anchor set and its copy differs */
10453 internal_errorf(HERE, "Leaked anchor token %k %d times", i, count);
10456 if (in_gcc_extension) {
10457 /* an gcc extension scope was not closed */
10458 internal_errorf(HERE, "Leaked __extension__");
10465 rem_anchor_token(T_EOF);
10466 rem_anchor_token('}');
10470 * Parse a translation unit.
10472 static void parse_translation_unit(void)
10474 add_anchor_token(T_EOF);
10479 if (token.kind == T_EOF)
10482 errorf(HERE, "stray %K outside of function", &token);
10483 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10484 eat_until_matching_token(token.kind);
10489 void set_default_visibility(elf_visibility_tag_t visibility)
10491 default_visibility = visibility;
10497 * @return the translation unit or NULL if errors occurred.
10499 void start_parsing(void)
10501 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10502 label_stack = NEW_ARR_F(stack_entry_t, 0);
10503 diagnostic_count = 0;
10507 print_to_file(stderr);
10509 assert(unit == NULL);
10510 unit = allocate_ast_zero(sizeof(unit[0]));
10512 assert(file_scope == NULL);
10513 file_scope = &unit->scope;
10515 assert(current_scope == NULL);
10516 scope_push(&unit->scope);
10518 create_gnu_builtins();
10520 create_microsoft_intrinsics();
10523 translation_unit_t *finish_parsing(void)
10525 assert(current_scope == &unit->scope);
10528 assert(file_scope == &unit->scope);
10529 check_unused_globals();
10532 DEL_ARR_F(environment_stack);
10533 DEL_ARR_F(label_stack);
10535 translation_unit_t *result = unit;
10540 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
10541 * are given length one. */
10542 static void complete_incomplete_arrays(void)
10544 size_t n = ARR_LEN(incomplete_arrays);
10545 for (size_t i = 0; i != n; ++i) {
10546 declaration_t *const decl = incomplete_arrays[i];
10547 type_t *const type = skip_typeref(decl->type);
10549 if (!is_type_incomplete(type))
10552 source_position_t const *const pos = &decl->base.source_position;
10553 warningf(WARN_OTHER, pos, "array '%#N' assumed to have one element", (entity_t const*)decl);
10555 type_t *const new_type = duplicate_type(type);
10556 new_type->array.size_constant = true;
10557 new_type->array.has_implicit_size = true;
10558 new_type->array.size = 1;
10560 type_t *const result = identify_new_type(new_type);
10562 decl->type = result;
10566 void prepare_main_collect2(entity_t *entity)
10568 // create call to __main
10569 symbol_t *symbol = symbol_table_insert("__main");
10570 entity_t *subsubmain_ent
10571 = create_implicit_function(symbol, &builtin_source_position);
10573 expression_t *ref = allocate_expression_zero(EXPR_REFERENCE);
10574 type_t *ftype = subsubmain_ent->declaration.type;
10575 ref->base.source_position = builtin_source_position;
10576 ref->base.type = make_pointer_type(ftype, TYPE_QUALIFIER_NONE);
10577 ref->reference.entity = subsubmain_ent;
10579 expression_t *call = allocate_expression_zero(EXPR_CALL);
10580 call->base.source_position = builtin_source_position;
10581 call->base.type = type_void;
10582 call->call.function = ref;
10584 statement_t *expr_statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10585 expr_statement->base.source_position = builtin_source_position;
10586 expr_statement->expression.expression = call;
10588 statement_t *statement = entity->function.statement;
10589 assert(statement->kind == STATEMENT_COMPOUND);
10590 compound_statement_t *compounds = &statement->compound;
10592 expr_statement->base.next = compounds->statements;
10593 compounds->statements = expr_statement;
10598 lookahead_bufpos = 0;
10599 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10602 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
10603 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
10604 parse_translation_unit();
10605 complete_incomplete_arrays();
10606 DEL_ARR_F(incomplete_arrays);
10607 incomplete_arrays = NULL;
10611 * Initialize the parser.
10613 void init_parser(void)
10615 sym_anonymous = symbol_table_insert("<anonymous>");
10617 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10619 init_expression_parsers();
10620 obstack_init(&temp_obst);
10624 * Terminate the parser.
10626 void exit_parser(void)
10628 obstack_free(&temp_obst, NULL);