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 atomic_type_kind_t get_akind(const type_t *type)
858 assert(type->kind == TYPE_ATOMIC || type->kind == TYPE_COMPLEX
859 || type->kind == TYPE_IMAGINARY || type->kind == TYPE_ENUM);
860 return type->atomic.akind;
864 * §6.3.1.1:2 Do integer promotion for a given type.
866 * @param type the type to promote
867 * @return the promoted type
869 static type_t *promote_integer(type_t *type)
871 if (get_akind_rank(get_akind(type)) < get_akind_rank(ATOMIC_TYPE_INT))
878 * Check if a given expression represents a null pointer constant.
880 * @param expression the expression to check
882 static bool is_null_pointer_constant(const expression_t *expression)
884 /* skip void* cast */
885 if (expression->kind == EXPR_UNARY_CAST) {
886 type_t *const type = skip_typeref(expression->base.type);
887 if (types_compatible(type, type_void_ptr))
888 expression = expression->unary.value;
891 type_t *const type = skip_typeref(expression->base.type);
892 if (!is_type_integer(type))
894 switch (is_constant_expression(expression)) {
895 case EXPR_CLASS_ERROR: return true;
896 case EXPR_CLASS_CONSTANT: return !fold_constant_to_bool(expression);
897 default: return false;
902 * Create an implicit cast expression.
904 * @param expression the expression to cast
905 * @param dest_type the destination type
907 static expression_t *create_implicit_cast(expression_t *expression,
910 type_t *const source_type = expression->base.type;
912 if (source_type == dest_type)
915 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
916 cast->unary.value = expression;
917 cast->base.type = dest_type;
918 cast->base.implicit = true;
923 typedef enum assign_error_t {
925 ASSIGN_ERROR_INCOMPATIBLE,
926 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
927 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
928 ASSIGN_WARNING_POINTER_FROM_INT,
929 ASSIGN_WARNING_INT_FROM_POINTER
932 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)
934 type_t *const orig_type_right = right->base.type;
935 type_t *const type_left = skip_typeref(orig_type_left);
936 type_t *const type_right = skip_typeref(orig_type_right);
941 case ASSIGN_ERROR_INCOMPATIBLE:
942 errorf(pos, "destination type '%T' in %s is incompatible with type '%T'", orig_type_left, context, orig_type_right);
945 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
946 type_t *points_to_left = skip_typeref(type_left->pointer.points_to);
947 type_t *points_to_right = skip_typeref(type_right->pointer.points_to);
949 /* the left type has all qualifiers from the right type */
950 unsigned missing_qualifiers = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
951 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);
955 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
956 warningf(WARN_OTHER, pos, "destination type '%T' in %s is incompatible with '%E' of type '%T'", orig_type_left, context, right, orig_type_right);
959 case ASSIGN_WARNING_POINTER_FROM_INT:
960 warningf(WARN_OTHER, pos, "%s makes pointer '%T' from integer '%T' without a cast", context, orig_type_left, orig_type_right);
963 case ASSIGN_WARNING_INT_FROM_POINTER:
964 warningf(WARN_OTHER, pos, "%s makes integer '%T' from pointer '%T' without a cast", context, orig_type_left, orig_type_right);
968 panic("invalid error value");
972 /** Implements the rules from §6.5.16.1 */
973 static assign_error_t semantic_assign(type_t *orig_type_left,
974 const expression_t *const right)
976 type_t *const orig_type_right = right->base.type;
977 type_t *const type_left = skip_typeref(orig_type_left);
978 type_t *const type_right = skip_typeref(orig_type_right);
980 if (is_type_pointer(type_left)) {
981 if (is_null_pointer_constant(right)) {
982 return ASSIGN_SUCCESS;
983 } else if (is_type_pointer(type_right)) {
984 type_t *points_to_left
985 = skip_typeref(type_left->pointer.points_to);
986 type_t *points_to_right
987 = skip_typeref(type_right->pointer.points_to);
988 assign_error_t res = ASSIGN_SUCCESS;
990 /* the left type has all qualifiers from the right type */
991 unsigned missing_qualifiers
992 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
993 if (missing_qualifiers != 0) {
994 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
997 points_to_left = get_unqualified_type(points_to_left);
998 points_to_right = get_unqualified_type(points_to_right);
1000 if (is_type_atomic(points_to_left, ATOMIC_TYPE_VOID))
1003 if (is_type_atomic(points_to_right, ATOMIC_TYPE_VOID)) {
1004 /* ISO/IEC 14882:1998(E) §C.1.2:6 */
1005 return c_mode & _CXX ? ASSIGN_ERROR_INCOMPATIBLE : res;
1008 if (!types_compatible(points_to_left, points_to_right)) {
1009 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
1013 } else if (is_type_integer(type_right)) {
1014 return ASSIGN_WARNING_POINTER_FROM_INT;
1016 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1017 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1018 && is_type_pointer(type_right))) {
1019 return ASSIGN_SUCCESS;
1020 } else if (is_type_compound(type_left) && is_type_compound(type_right)) {
1021 type_t *const unqual_type_left = get_unqualified_type(type_left);
1022 type_t *const unqual_type_right = get_unqualified_type(type_right);
1023 if (types_compatible(unqual_type_left, unqual_type_right)) {
1024 return ASSIGN_SUCCESS;
1026 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1027 return ASSIGN_WARNING_INT_FROM_POINTER;
1030 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1031 return ASSIGN_SUCCESS;
1033 return ASSIGN_ERROR_INCOMPATIBLE;
1036 static expression_t *parse_constant_expression(void)
1038 expression_t *result = parse_subexpression(PREC_CONDITIONAL);
1040 if (is_constant_expression(result) == EXPR_CLASS_VARIABLE) {
1041 errorf(&result->base.source_position,
1042 "expression '%E' is not constant", result);
1048 static expression_t *parse_assignment_expression(void)
1050 return parse_subexpression(PREC_ASSIGNMENT);
1053 static void warn_string_concat(const source_position_t *pos)
1055 warningf(WARN_TRADITIONAL, pos, "traditional C rejects string constant concatenation");
1058 static string_t parse_string_literals(void)
1060 assert(token.kind == T_STRING_LITERAL);
1061 string_t result = token.string.string;
1065 while (token.kind == T_STRING_LITERAL) {
1066 warn_string_concat(&token.base.source_position);
1067 result = concat_strings(&result, &token.string.string);
1075 * compare two string, ignoring double underscores on the second.
1077 static int strcmp_underscore(const char *s1, const char *s2)
1079 if (s2[0] == '_' && s2[1] == '_') {
1080 size_t len2 = strlen(s2);
1081 size_t len1 = strlen(s1);
1082 if (len1 == len2-4 && s2[len2-2] == '_' && s2[len2-1] == '_') {
1083 return strncmp(s1, s2+2, len2-4);
1087 return strcmp(s1, s2);
1090 static attribute_t *allocate_attribute_zero(attribute_kind_t kind)
1092 attribute_t *attribute = allocate_ast_zero(sizeof(*attribute));
1093 attribute->kind = kind;
1094 attribute->source_position = *HERE;
1099 * Parse (gcc) attribute argument. From gcc comments in gcc source:
1102 * __attribute__ ( ( attribute-list ) )
1106 * attribute_list , attrib
1111 * any-word ( identifier )
1112 * any-word ( identifier , nonempty-expr-list )
1113 * any-word ( expr-list )
1115 * where the "identifier" must not be declared as a type, and
1116 * "any-word" may be any identifier (including one declared as a
1117 * type), a reserved word storage class specifier, type specifier or
1118 * type qualifier. ??? This still leaves out most reserved keywords
1119 * (following the old parser), shouldn't we include them, and why not
1120 * allow identifiers declared as types to start the arguments?
1122 * Matze: this all looks confusing and little systematic, so we're even less
1123 * strict and parse any list of things which are identifiers or
1124 * (assignment-)expressions.
1126 static attribute_argument_t *parse_attribute_arguments(void)
1128 attribute_argument_t *first = NULL;
1129 attribute_argument_t **anchor = &first;
1130 if (token.kind != ')') do {
1131 attribute_argument_t *argument = allocate_ast_zero(sizeof(*argument));
1133 /* is it an identifier */
1134 if (token.kind == T_IDENTIFIER
1135 && (look_ahead(1)->kind == ',' || look_ahead(1)->kind == ')')) {
1136 symbol_t *symbol = token.identifier.symbol;
1137 argument->kind = ATTRIBUTE_ARGUMENT_SYMBOL;
1138 argument->v.symbol = symbol;
1141 /* must be an expression */
1142 expression_t *expression = parse_assignment_expression();
1144 argument->kind = ATTRIBUTE_ARGUMENT_EXPRESSION;
1145 argument->v.expression = expression;
1148 /* append argument */
1150 anchor = &argument->next;
1151 } while (next_if(','));
1152 expect(')', end_error);
1161 static attribute_t *parse_attribute_asm(void)
1163 attribute_t *attribute = allocate_attribute_zero(ATTRIBUTE_GNU_ASM);
1166 expect('(', end_error);
1167 attribute->a.arguments = parse_attribute_arguments();
1174 static symbol_t *get_symbol_from_token(void)
1176 switch(token.kind) {
1178 return token.identifier.symbol;
1207 /* maybe we need more tokens ... add them on demand */
1208 return get_token_kind_symbol(token.kind);
1214 static attribute_t *parse_attribute_gnu_single(void)
1216 /* parse "any-word" */
1217 symbol_t *symbol = get_symbol_from_token();
1218 if (symbol == NULL) {
1219 parse_error_expected("while parsing attribute((", T_IDENTIFIER, NULL);
1223 attribute_kind_t kind;
1224 char const *const name = symbol->string;
1225 for (kind = ATTRIBUTE_GNU_FIRST;; ++kind) {
1226 if (kind > ATTRIBUTE_GNU_LAST) {
1227 warningf(WARN_ATTRIBUTE, HERE, "unknown attribute '%s' ignored", name);
1228 /* TODO: we should still save the attribute in the list... */
1229 kind = ATTRIBUTE_UNKNOWN;
1233 const char *attribute_name = get_attribute_name(kind);
1234 if (attribute_name != NULL
1235 && strcmp_underscore(attribute_name, name) == 0)
1239 attribute_t *attribute = allocate_attribute_zero(kind);
1242 /* parse arguments */
1244 attribute->a.arguments = parse_attribute_arguments();
1249 static attribute_t *parse_attribute_gnu(void)
1251 attribute_t *first = NULL;
1252 attribute_t **anchor = &first;
1254 eat(T___attribute__);
1255 expect('(', end_error);
1256 expect('(', end_error);
1258 if (token.kind != ')') do {
1259 attribute_t *attribute = parse_attribute_gnu_single();
1260 if (attribute == NULL)
1263 *anchor = attribute;
1264 anchor = &attribute->next;
1265 } while (next_if(','));
1266 expect(')', end_error);
1267 expect(')', end_error);
1273 /** Parse attributes. */
1274 static attribute_t *parse_attributes(attribute_t *first)
1276 attribute_t **anchor = &first;
1278 while (*anchor != NULL)
1279 anchor = &(*anchor)->next;
1281 attribute_t *attribute;
1282 switch (token.kind) {
1283 case T___attribute__:
1284 attribute = parse_attribute_gnu();
1285 if (attribute == NULL)
1290 attribute = parse_attribute_asm();
1294 attribute = allocate_attribute_zero(ATTRIBUTE_MS_CDECL);
1299 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FASTCALL);
1303 case T__forceinline:
1304 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FORCEINLINE);
1305 eat(T__forceinline);
1309 attribute = allocate_attribute_zero(ATTRIBUTE_MS_STDCALL);
1314 /* TODO record modifier */
1315 warningf(WARN_OTHER, HERE, "Ignoring declaration modifier %K", &token);
1316 attribute = allocate_attribute_zero(ATTRIBUTE_MS_THISCALL);
1324 *anchor = attribute;
1325 anchor = &attribute->next;
1329 static void mark_vars_read(expression_t *expr, entity_t *lhs_ent);
1331 static entity_t *determine_lhs_ent(expression_t *const expr,
1334 switch (expr->kind) {
1335 case EXPR_REFERENCE: {
1336 entity_t *const entity = expr->reference.entity;
1337 /* we should only find variables as lvalues... */
1338 if (entity->base.kind != ENTITY_VARIABLE
1339 && entity->base.kind != ENTITY_PARAMETER)
1345 case EXPR_ARRAY_ACCESS: {
1346 expression_t *const ref = expr->array_access.array_ref;
1347 entity_t * ent = NULL;
1348 if (is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1349 ent = determine_lhs_ent(ref, lhs_ent);
1352 mark_vars_read(ref, lhs_ent);
1354 mark_vars_read(expr->array_access.index, lhs_ent);
1359 mark_vars_read(expr->select.compound, lhs_ent);
1360 if (is_type_compound(skip_typeref(expr->base.type)))
1361 return determine_lhs_ent(expr->select.compound, lhs_ent);
1365 case EXPR_UNARY_DEREFERENCE: {
1366 expression_t *const val = expr->unary.value;
1367 if (val->kind == EXPR_UNARY_TAKE_ADDRESS) {
1369 return determine_lhs_ent(val->unary.value, lhs_ent);
1371 mark_vars_read(val, NULL);
1377 mark_vars_read(expr, NULL);
1382 #define ENT_ANY ((entity_t*)-1)
1385 * Mark declarations, which are read. This is used to detect variables, which
1389 * x is not marked as "read", because it is only read to calculate its own new
1393 * x and y are not detected as "not read", because multiple variables are
1396 static void mark_vars_read(expression_t *const expr, entity_t *lhs_ent)
1398 switch (expr->kind) {
1399 case EXPR_REFERENCE: {
1400 entity_t *const entity = expr->reference.entity;
1401 if (entity->kind != ENTITY_VARIABLE
1402 && entity->kind != ENTITY_PARAMETER)
1405 if (lhs_ent != entity && lhs_ent != ENT_ANY) {
1406 if (entity->kind == ENTITY_VARIABLE) {
1407 entity->variable.read = true;
1409 entity->parameter.read = true;
1416 // TODO respect pure/const
1417 mark_vars_read(expr->call.function, NULL);
1418 for (call_argument_t *arg = expr->call.arguments; arg != NULL; arg = arg->next) {
1419 mark_vars_read(arg->expression, NULL);
1423 case EXPR_CONDITIONAL:
1424 // TODO lhs_decl should depend on whether true/false have an effect
1425 mark_vars_read(expr->conditional.condition, NULL);
1426 if (expr->conditional.true_expression != NULL)
1427 mark_vars_read(expr->conditional.true_expression, lhs_ent);
1428 mark_vars_read(expr->conditional.false_expression, lhs_ent);
1432 if (lhs_ent == ENT_ANY
1433 && !is_type_compound(skip_typeref(expr->base.type)))
1435 mark_vars_read(expr->select.compound, lhs_ent);
1438 case EXPR_ARRAY_ACCESS: {
1439 mark_vars_read(expr->array_access.index, lhs_ent);
1440 expression_t *const ref = expr->array_access.array_ref;
1441 if (!is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1442 if (lhs_ent == ENT_ANY)
1445 mark_vars_read(ref, lhs_ent);
1450 mark_vars_read(expr->va_arge.ap, lhs_ent);
1454 mark_vars_read(expr->va_copye.src, lhs_ent);
1457 case EXPR_UNARY_CAST:
1458 /* Special case: Use void cast to mark a variable as "read" */
1459 if (is_type_atomic(skip_typeref(expr->base.type), ATOMIC_TYPE_VOID))
1464 case EXPR_UNARY_THROW:
1465 if (expr->unary.value == NULL)
1468 case EXPR_UNARY_DEREFERENCE:
1469 case EXPR_UNARY_DELETE:
1470 case EXPR_UNARY_DELETE_ARRAY:
1471 if (lhs_ent == ENT_ANY)
1475 case EXPR_UNARY_NEGATE:
1476 case EXPR_UNARY_PLUS:
1477 case EXPR_UNARY_BITWISE_NEGATE:
1478 case EXPR_UNARY_NOT:
1479 case EXPR_UNARY_TAKE_ADDRESS:
1480 case EXPR_UNARY_POSTFIX_INCREMENT:
1481 case EXPR_UNARY_POSTFIX_DECREMENT:
1482 case EXPR_UNARY_PREFIX_INCREMENT:
1483 case EXPR_UNARY_PREFIX_DECREMENT:
1484 case EXPR_UNARY_ASSUME:
1486 mark_vars_read(expr->unary.value, lhs_ent);
1489 case EXPR_BINARY_ADD:
1490 case EXPR_BINARY_SUB:
1491 case EXPR_BINARY_MUL:
1492 case EXPR_BINARY_DIV:
1493 case EXPR_BINARY_MOD:
1494 case EXPR_BINARY_EQUAL:
1495 case EXPR_BINARY_NOTEQUAL:
1496 case EXPR_BINARY_LESS:
1497 case EXPR_BINARY_LESSEQUAL:
1498 case EXPR_BINARY_GREATER:
1499 case EXPR_BINARY_GREATEREQUAL:
1500 case EXPR_BINARY_BITWISE_AND:
1501 case EXPR_BINARY_BITWISE_OR:
1502 case EXPR_BINARY_BITWISE_XOR:
1503 case EXPR_BINARY_LOGICAL_AND:
1504 case EXPR_BINARY_LOGICAL_OR:
1505 case EXPR_BINARY_SHIFTLEFT:
1506 case EXPR_BINARY_SHIFTRIGHT:
1507 case EXPR_BINARY_COMMA:
1508 case EXPR_BINARY_ISGREATER:
1509 case EXPR_BINARY_ISGREATEREQUAL:
1510 case EXPR_BINARY_ISLESS:
1511 case EXPR_BINARY_ISLESSEQUAL:
1512 case EXPR_BINARY_ISLESSGREATER:
1513 case EXPR_BINARY_ISUNORDERED:
1514 mark_vars_read(expr->binary.left, lhs_ent);
1515 mark_vars_read(expr->binary.right, lhs_ent);
1518 case EXPR_BINARY_ASSIGN:
1519 case EXPR_BINARY_MUL_ASSIGN:
1520 case EXPR_BINARY_DIV_ASSIGN:
1521 case EXPR_BINARY_MOD_ASSIGN:
1522 case EXPR_BINARY_ADD_ASSIGN:
1523 case EXPR_BINARY_SUB_ASSIGN:
1524 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
1525 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
1526 case EXPR_BINARY_BITWISE_AND_ASSIGN:
1527 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
1528 case EXPR_BINARY_BITWISE_OR_ASSIGN: {
1529 if (lhs_ent == ENT_ANY)
1531 lhs_ent = determine_lhs_ent(expr->binary.left, lhs_ent);
1532 mark_vars_read(expr->binary.right, lhs_ent);
1537 determine_lhs_ent(expr->va_starte.ap, lhs_ent);
1542 case EXPR_STRING_LITERAL:
1543 case EXPR_WIDE_STRING_LITERAL:
1544 case EXPR_COMPOUND_LITERAL: // TODO init?
1546 case EXPR_CLASSIFY_TYPE:
1549 case EXPR_BUILTIN_CONSTANT_P:
1550 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
1552 case EXPR_STATEMENT: // TODO
1553 case EXPR_LABEL_ADDRESS:
1554 case EXPR_REFERENCE_ENUM_VALUE:
1558 panic("unhandled expression");
1561 static designator_t *parse_designation(void)
1563 designator_t *result = NULL;
1564 designator_t **anchor = &result;
1567 designator_t *designator;
1568 switch (token.kind) {
1570 designator = allocate_ast_zero(sizeof(designator[0]));
1571 designator->source_position = token.base.source_position;
1573 add_anchor_token(']');
1574 designator->array_index = parse_constant_expression();
1575 rem_anchor_token(']');
1576 expect(']', end_error);
1579 designator = allocate_ast_zero(sizeof(designator[0]));
1580 designator->source_position = token.base.source_position;
1582 if (token.kind != T_IDENTIFIER) {
1583 parse_error_expected("while parsing designator",
1584 T_IDENTIFIER, NULL);
1587 designator->symbol = token.identifier.symbol;
1591 expect('=', end_error);
1595 assert(designator != NULL);
1596 *anchor = designator;
1597 anchor = &designator->next;
1603 static initializer_t *initializer_from_string(array_type_t *const type,
1604 const string_t *const string)
1606 /* TODO: check len vs. size of array type */
1609 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
1610 initializer->string.string = *string;
1615 static initializer_t *initializer_from_wide_string(array_type_t *const type,
1616 const string_t *const string)
1618 /* TODO: check len vs. size of array type */
1621 initializer_t *const initializer =
1622 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
1623 initializer->wide_string.string = *string;
1629 * Build an initializer from a given expression.
1631 static initializer_t *initializer_from_expression(type_t *orig_type,
1632 expression_t *expression)
1634 /* TODO check that expression is a constant expression */
1636 /* §6.7.8.14/15 char array may be initialized by string literals */
1637 type_t *type = skip_typeref(orig_type);
1638 type_t *expr_type_orig = expression->base.type;
1639 type_t *expr_type = skip_typeref(expr_type_orig);
1641 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
1642 array_type_t *const array_type = &type->array;
1643 type_t *const element_type = skip_typeref(array_type->element_type);
1645 if (element_type->kind == TYPE_ATOMIC) {
1646 atomic_type_kind_t akind = element_type->atomic.akind;
1647 switch (expression->kind) {
1648 case EXPR_STRING_LITERAL:
1649 if (akind == ATOMIC_TYPE_CHAR
1650 || akind == ATOMIC_TYPE_SCHAR
1651 || akind == ATOMIC_TYPE_UCHAR) {
1652 return initializer_from_string(array_type,
1653 &expression->string_literal.value);
1657 case EXPR_WIDE_STRING_LITERAL: {
1658 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
1659 if (get_unqualified_type(element_type) == bare_wchar_type) {
1660 return initializer_from_wide_string(array_type,
1661 &expression->string_literal.value);
1672 assign_error_t error = semantic_assign(type, expression);
1673 if (error == ASSIGN_ERROR_INCOMPATIBLE)
1675 report_assign_error(error, type, expression, "initializer",
1676 &expression->base.source_position);
1678 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
1679 result->value.value = create_implicit_cast(expression, type);
1685 * Checks if a given expression can be used as a constant initializer.
1687 static bool is_initializer_constant(const expression_t *expression)
1689 return is_constant_expression(expression) != EXPR_CLASS_VARIABLE ||
1690 is_linker_constant(expression) != EXPR_CLASS_VARIABLE;
1694 * Parses an scalar initializer.
1696 * §6.7.8.11; eat {} without warning
1698 static initializer_t *parse_scalar_initializer(type_t *type,
1699 bool must_be_constant)
1701 /* there might be extra {} hierarchies */
1703 if (token.kind == '{') {
1704 warningf(WARN_OTHER, HERE, "extra curly braces around scalar initializer");
1708 } while (token.kind == '{');
1711 expression_t *expression = parse_assignment_expression();
1712 mark_vars_read(expression, NULL);
1713 if (must_be_constant && !is_initializer_constant(expression)) {
1714 errorf(&expression->base.source_position,
1715 "initialisation expression '%E' is not constant",
1719 initializer_t *initializer = initializer_from_expression(type, expression);
1721 if (initializer == NULL) {
1722 errorf(&expression->base.source_position,
1723 "expression '%E' (type '%T') doesn't match expected type '%T'",
1724 expression, expression->base.type, type);
1729 bool additional_warning_displayed = false;
1730 while (braces > 0) {
1732 if (token.kind != '}') {
1733 if (!additional_warning_displayed) {
1734 warningf(WARN_OTHER, HERE, "additional elements in scalar initializer");
1735 additional_warning_displayed = true;
1746 * An entry in the type path.
1748 typedef struct type_path_entry_t type_path_entry_t;
1749 struct type_path_entry_t {
1750 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
1752 size_t index; /**< For array types: the current index. */
1753 declaration_t *compound_entry; /**< For compound types: the current declaration. */
1758 * A type path expression a position inside compound or array types.
1760 typedef struct type_path_t type_path_t;
1761 struct type_path_t {
1762 type_path_entry_t *path; /**< An flexible array containing the current path. */
1763 type_t *top_type; /**< type of the element the path points */
1764 size_t max_index; /**< largest index in outermost array */
1768 * Prints a type path for debugging.
1770 static __attribute__((unused)) void debug_print_type_path(
1771 const type_path_t *path)
1773 size_t len = ARR_LEN(path->path);
1775 for (size_t i = 0; i < len; ++i) {
1776 const type_path_entry_t *entry = & path->path[i];
1778 type_t *type = skip_typeref(entry->type);
1779 if (is_type_compound(type)) {
1780 /* in gcc mode structs can have no members */
1781 if (entry->v.compound_entry == NULL) {
1785 fprintf(stderr, ".%s",
1786 entry->v.compound_entry->base.symbol->string);
1787 } else if (is_type_array(type)) {
1788 fprintf(stderr, "[%u]", (unsigned) entry->v.index);
1790 fprintf(stderr, "-INVALID-");
1793 if (path->top_type != NULL) {
1794 fprintf(stderr, " (");
1795 print_type(path->top_type);
1796 fprintf(stderr, ")");
1801 * Return the top type path entry, ie. in a path
1802 * (type).a.b returns the b.
1804 static type_path_entry_t *get_type_path_top(const type_path_t *path)
1806 size_t len = ARR_LEN(path->path);
1808 return &path->path[len-1];
1812 * Enlarge the type path by an (empty) element.
1814 static type_path_entry_t *append_to_type_path(type_path_t *path)
1816 size_t len = ARR_LEN(path->path);
1817 ARR_RESIZE(type_path_entry_t, path->path, len+1);
1819 type_path_entry_t *result = & path->path[len];
1820 memset(result, 0, sizeof(result[0]));
1824 static entity_t *skip_unnamed_bitfields(entity_t *entry)
1826 for (; entry != NULL; entry = entry->base.next) {
1827 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
1828 if (!entry->compound_member.bitfield || entry->base.symbol != NULL)
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 *const compound = top_type->compound.compound;
1847 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
1849 if (entry != NULL) {
1850 top->v.compound_entry = &entry->declaration;
1851 path->top_type = entry->declaration.type;
1853 path->top_type = NULL;
1855 } else if (is_type_array(top_type)) {
1857 path->top_type = top_type->array.element_type;
1859 assert(!is_type_valid(top_type));
1864 * Pop an entry from the given type path, ie. returning from
1865 * (type).a.b to (type).a
1867 static void ascend_from_subtype(type_path_t *path)
1869 type_path_entry_t *top = get_type_path_top(path);
1871 path->top_type = top->type;
1873 size_t len = ARR_LEN(path->path);
1874 ARR_RESIZE(type_path_entry_t, path->path, len-1);
1878 * Pop entries from the given type path until the given
1879 * path level is reached.
1881 static void ascend_to(type_path_t *path, size_t top_path_level)
1883 size_t len = ARR_LEN(path->path);
1885 while (len > top_path_level) {
1886 ascend_from_subtype(path);
1887 len = ARR_LEN(path->path);
1891 static bool walk_designator(type_path_t *path, const designator_t *designator,
1892 bool used_in_offsetof)
1894 for (; designator != NULL; designator = designator->next) {
1895 type_path_entry_t *top = get_type_path_top(path);
1896 type_t *orig_type = top->type;
1898 type_t *type = skip_typeref(orig_type);
1900 if (designator->symbol != NULL) {
1901 symbol_t *symbol = designator->symbol;
1902 if (!is_type_compound(type)) {
1903 if (is_type_valid(type)) {
1904 errorf(&designator->source_position,
1905 "'.%Y' designator used for non-compound type '%T'",
1909 top->type = type_error_type;
1910 top->v.compound_entry = NULL;
1911 orig_type = type_error_type;
1913 compound_t *compound = type->compound.compound;
1914 entity_t *iter = compound->members.entities;
1915 for (; iter != NULL; iter = iter->base.next) {
1916 if (iter->base.symbol == symbol) {
1921 errorf(&designator->source_position,
1922 "'%T' has no member named '%Y'", orig_type, symbol);
1925 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
1926 if (used_in_offsetof && iter->compound_member.bitfield) {
1927 errorf(&designator->source_position,
1928 "offsetof designator '%Y' must not specify bitfield",
1933 top->type = orig_type;
1934 top->v.compound_entry = &iter->declaration;
1935 orig_type = iter->declaration.type;
1938 expression_t *array_index = designator->array_index;
1939 assert(designator->array_index != NULL);
1941 if (!is_type_array(type)) {
1942 if (is_type_valid(type)) {
1943 errorf(&designator->source_position,
1944 "[%E] designator used for non-array type '%T'",
1945 array_index, orig_type);
1950 long index = fold_constant_to_int(array_index);
1951 if (!used_in_offsetof) {
1953 errorf(&designator->source_position,
1954 "array index [%E] must be positive", array_index);
1955 } else if (type->array.size_constant) {
1956 long array_size = type->array.size;
1957 if (index >= array_size) {
1958 errorf(&designator->source_position,
1959 "designator [%E] (%d) exceeds array size %d",
1960 array_index, index, array_size);
1965 top->type = orig_type;
1966 top->v.index = (size_t) index;
1967 orig_type = type->array.element_type;
1969 path->top_type = orig_type;
1971 if (designator->next != NULL) {
1972 descend_into_subtype(path);
1978 static void advance_current_object(type_path_t *path, size_t top_path_level)
1980 type_path_entry_t *top = get_type_path_top(path);
1982 type_t *type = skip_typeref(top->type);
1983 if (is_type_union(type)) {
1984 /* in unions only the first element is initialized */
1985 top->v.compound_entry = NULL;
1986 } else if (is_type_struct(type)) {
1987 declaration_t *entry = top->v.compound_entry;
1989 entity_t *const next_entity = skip_unnamed_bitfields(entry->base.next);
1990 if (next_entity != NULL) {
1991 assert(is_declaration(next_entity));
1992 entry = &next_entity->declaration;
1997 top->v.compound_entry = entry;
1998 if (entry != NULL) {
1999 path->top_type = entry->type;
2002 } else if (is_type_array(type)) {
2003 assert(is_type_array(type));
2007 if (!type->array.size_constant || top->v.index < type->array.size) {
2011 assert(!is_type_valid(type));
2015 /* we're past the last member of the current sub-aggregate, try if we
2016 * can ascend in the type hierarchy and continue with another subobject */
2017 size_t len = ARR_LEN(path->path);
2019 if (len > top_path_level) {
2020 ascend_from_subtype(path);
2021 advance_current_object(path, top_path_level);
2023 path->top_type = NULL;
2028 * skip any {...} blocks until a closing bracket is reached.
2030 static void skip_initializers(void)
2034 while (token.kind != '}') {
2035 if (token.kind == T_EOF)
2037 if (token.kind == '{') {
2045 static initializer_t *create_empty_initializer(void)
2047 static initializer_t empty_initializer
2048 = { .list = { { INITIALIZER_LIST }, 0 } };
2049 return &empty_initializer;
2053 * Parse a part of an initialiser for a struct or union,
2055 static initializer_t *parse_sub_initializer(type_path_t *path,
2056 type_t *outer_type, size_t top_path_level,
2057 parse_initializer_env_t *env)
2059 if (token.kind == '}') {
2060 /* empty initializer */
2061 return create_empty_initializer();
2064 type_t *orig_type = path->top_type;
2065 type_t *type = NULL;
2067 if (orig_type == NULL) {
2068 /* We are initializing an empty compound. */
2070 type = skip_typeref(orig_type);
2073 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2076 designator_t *designator = NULL;
2077 if (token.kind == '.' || token.kind == '[') {
2078 designator = parse_designation();
2079 goto finish_designator;
2080 } else if (token.kind == T_IDENTIFIER && look_ahead(1)->kind == ':') {
2081 /* GNU-style designator ("identifier: value") */
2082 designator = allocate_ast_zero(sizeof(designator[0]));
2083 designator->source_position = token.base.source_position;
2084 designator->symbol = token.identifier.symbol;
2089 /* reset path to toplevel, evaluate designator from there */
2090 ascend_to(path, top_path_level);
2091 if (!walk_designator(path, designator, false)) {
2092 /* can't continue after designation error */
2096 initializer_t *designator_initializer
2097 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2098 designator_initializer->designator.designator = designator;
2099 ARR_APP1(initializer_t*, initializers, designator_initializer);
2101 orig_type = path->top_type;
2102 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2107 if (token.kind == '{') {
2108 if (type != NULL && is_type_scalar(type)) {
2109 sub = parse_scalar_initializer(type, env->must_be_constant);
2112 if (env->entity != NULL) {
2114 "extra brace group at end of initializer for '%Y'",
2115 env->entity->base.symbol);
2117 errorf(HERE, "extra brace group at end of initializer");
2122 descend_into_subtype(path);
2125 add_anchor_token('}');
2126 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2128 rem_anchor_token('}');
2131 ascend_from_subtype(path);
2132 expect('}', end_error);
2134 expect('}', end_error);
2135 goto error_parse_next;
2139 /* must be an expression */
2140 expression_t *expression = parse_assignment_expression();
2141 mark_vars_read(expression, NULL);
2143 if (env->must_be_constant && !is_initializer_constant(expression)) {
2144 errorf(&expression->base.source_position,
2145 "Initialisation expression '%E' is not constant",
2150 /* we are already outside, ... */
2151 if (outer_type == NULL)
2152 goto error_parse_next;
2153 type_t *const outer_type_skip = skip_typeref(outer_type);
2154 if (is_type_compound(outer_type_skip) &&
2155 !outer_type_skip->compound.compound->complete) {
2156 goto error_parse_next;
2159 source_position_t const* const pos = &expression->base.source_position;
2160 if (env->entity != NULL) {
2161 warningf(WARN_OTHER, pos, "excess elements in initializer for '%Y'", env->entity->base.symbol);
2163 warningf(WARN_OTHER, pos, "excess elements in initializer");
2165 goto error_parse_next;
2168 /* handle { "string" } special case */
2169 if ((expression->kind == EXPR_STRING_LITERAL
2170 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2171 && outer_type != NULL) {
2172 sub = initializer_from_expression(outer_type, expression);
2175 if (token.kind != '}') {
2176 warningf(WARN_OTHER, HERE, "excessive elements in initializer for type '%T'", orig_type);
2178 /* TODO: eat , ... */
2183 /* descend into subtypes until expression matches type */
2185 orig_type = path->top_type;
2186 type = skip_typeref(orig_type);
2188 sub = initializer_from_expression(orig_type, expression);
2192 if (!is_type_valid(type)) {
2195 if (is_type_scalar(type)) {
2196 errorf(&expression->base.source_position,
2197 "expression '%E' doesn't match expected type '%T'",
2198 expression, orig_type);
2202 descend_into_subtype(path);
2206 /* update largest index of top array */
2207 const type_path_entry_t *first = &path->path[0];
2208 type_t *first_type = first->type;
2209 first_type = skip_typeref(first_type);
2210 if (is_type_array(first_type)) {
2211 size_t index = first->v.index;
2212 if (index > path->max_index)
2213 path->max_index = index;
2216 /* append to initializers list */
2217 ARR_APP1(initializer_t*, initializers, sub);
2220 if (token.kind == '}') {
2223 expect(',', end_error);
2224 if (token.kind == '}') {
2229 /* advance to the next declaration if we are not at the end */
2230 advance_current_object(path, top_path_level);
2231 orig_type = path->top_type;
2232 if (orig_type != NULL)
2233 type = skip_typeref(orig_type);
2239 size_t len = ARR_LEN(initializers);
2240 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2241 initializer_t *result = allocate_ast_zero(size);
2242 result->kind = INITIALIZER_LIST;
2243 result->list.len = len;
2244 memcpy(&result->list.initializers, initializers,
2245 len * sizeof(initializers[0]));
2247 DEL_ARR_F(initializers);
2248 ascend_to(path, top_path_level+1);
2253 skip_initializers();
2254 DEL_ARR_F(initializers);
2255 ascend_to(path, top_path_level+1);
2259 static expression_t *make_size_literal(size_t value)
2261 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_INTEGER);
2262 literal->base.type = type_size_t;
2265 snprintf(buf, sizeof(buf), "%u", (unsigned) value);
2266 literal->literal.value = make_string(buf);
2272 * Parses an initializer. Parsers either a compound literal
2273 * (env->declaration == NULL) or an initializer of a declaration.
2275 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2277 type_t *type = skip_typeref(env->type);
2278 size_t max_index = 0;
2279 initializer_t *result;
2281 if (is_type_scalar(type)) {
2282 result = parse_scalar_initializer(type, env->must_be_constant);
2283 } else if (token.kind == '{') {
2287 memset(&path, 0, sizeof(path));
2288 path.top_type = env->type;
2289 path.path = NEW_ARR_F(type_path_entry_t, 0);
2291 descend_into_subtype(&path);
2293 add_anchor_token('}');
2294 result = parse_sub_initializer(&path, env->type, 1, env);
2295 rem_anchor_token('}');
2297 max_index = path.max_index;
2298 DEL_ARR_F(path.path);
2300 expect('}', end_error);
2303 /* parse_scalar_initializer() also works in this case: we simply
2304 * have an expression without {} around it */
2305 result = parse_scalar_initializer(type, env->must_be_constant);
2308 /* §6.7.8:22 array initializers for arrays with unknown size determine
2309 * the array type size */
2310 if (is_type_array(type) && type->array.size_expression == NULL
2311 && result != NULL) {
2313 switch (result->kind) {
2314 case INITIALIZER_LIST:
2315 assert(max_index != 0xdeadbeaf);
2316 size = max_index + 1;
2319 case INITIALIZER_STRING:
2320 size = result->string.string.size;
2323 case INITIALIZER_WIDE_STRING:
2324 size = result->wide_string.string.size;
2327 case INITIALIZER_DESIGNATOR:
2328 case INITIALIZER_VALUE:
2329 /* can happen for parse errors */
2334 internal_errorf(HERE, "invalid initializer type");
2337 type_t *new_type = duplicate_type(type);
2339 new_type->array.size_expression = make_size_literal(size);
2340 new_type->array.size_constant = true;
2341 new_type->array.has_implicit_size = true;
2342 new_type->array.size = size;
2343 env->type = new_type;
2349 static void append_entity(scope_t *scope, entity_t *entity)
2351 if (scope->last_entity != NULL) {
2352 scope->last_entity->base.next = entity;
2354 scope->entities = entity;
2356 entity->base.parent_entity = current_entity;
2357 scope->last_entity = entity;
2361 static compound_t *parse_compound_type_specifier(bool is_struct)
2363 source_position_t const pos = *HERE;
2364 eat(is_struct ? T_struct : T_union);
2366 symbol_t *symbol = NULL;
2367 entity_t *entity = NULL;
2368 attribute_t *attributes = NULL;
2370 if (token.kind == T___attribute__) {
2371 attributes = parse_attributes(NULL);
2374 entity_kind_tag_t const kind = is_struct ? ENTITY_STRUCT : ENTITY_UNION;
2375 if (token.kind == T_IDENTIFIER) {
2376 /* the compound has a name, check if we have seen it already */
2377 symbol = token.identifier.symbol;
2378 entity = get_tag(symbol, kind);
2381 if (entity != NULL) {
2382 if (entity->base.parent_scope != current_scope &&
2383 (token.kind == '{' || token.kind == ';')) {
2384 /* we're in an inner scope and have a definition. Shadow
2385 * existing definition in outer scope */
2387 } else if (entity->compound.complete && token.kind == '{') {
2388 source_position_t const *const ppos = &entity->base.source_position;
2389 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2390 /* clear members in the hope to avoid further errors */
2391 entity->compound.members.entities = NULL;
2394 } else if (token.kind != '{') {
2395 char const *const msg =
2396 is_struct ? "while parsing struct type specifier" :
2397 "while parsing union type specifier";
2398 parse_error_expected(msg, T_IDENTIFIER, '{', NULL);
2403 if (entity == NULL) {
2404 entity = allocate_entity_zero(kind, NAMESPACE_TAG, symbol);
2405 entity->compound.alignment = 1;
2406 entity->base.source_position = pos;
2407 entity->base.parent_scope = current_scope;
2408 if (symbol != NULL) {
2409 environment_push(entity);
2411 append_entity(current_scope, entity);
2414 if (token.kind == '{') {
2415 parse_compound_type_entries(&entity->compound);
2417 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2418 if (symbol == NULL) {
2419 assert(anonymous_entity == NULL);
2420 anonymous_entity = entity;
2424 if (attributes != NULL) {
2425 handle_entity_attributes(attributes, entity);
2428 return &entity->compound;
2431 static void parse_enum_entries(type_t *const enum_type)
2435 if (token.kind == '}') {
2436 errorf(HERE, "empty enum not allowed");
2441 add_anchor_token('}');
2443 if (token.kind != T_IDENTIFIER) {
2444 parse_error_expected("while parsing enum entry", T_IDENTIFIER, NULL);
2446 rem_anchor_token('}');
2450 symbol_t *symbol = token.identifier.symbol;
2451 entity_t *const entity
2452 = allocate_entity_zero(ENTITY_ENUM_VALUE, NAMESPACE_NORMAL, symbol);
2453 entity->enum_value.enum_type = enum_type;
2454 entity->base.source_position = token.base.source_position;
2458 expression_t *value = parse_constant_expression();
2460 value = create_implicit_cast(value, enum_type);
2461 entity->enum_value.value = value;
2466 record_entity(entity, false);
2467 } while (next_if(',') && token.kind != '}');
2468 rem_anchor_token('}');
2470 expect('}', end_error);
2476 static type_t *parse_enum_specifier(void)
2478 source_position_t const pos = *HERE;
2483 switch (token.kind) {
2485 symbol = token.identifier.symbol;
2486 entity = get_tag(symbol, ENTITY_ENUM);
2489 if (entity != NULL) {
2490 if (entity->base.parent_scope != current_scope &&
2491 (token.kind == '{' || token.kind == ';')) {
2492 /* we're in an inner scope and have a definition. Shadow
2493 * existing definition in outer scope */
2495 } else if (entity->enume.complete && token.kind == '{') {
2496 source_position_t const *const ppos = &entity->base.source_position;
2497 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2508 parse_error_expected("while parsing enum type specifier",
2509 T_IDENTIFIER, '{', NULL);
2513 if (entity == NULL) {
2514 entity = allocate_entity_zero(ENTITY_ENUM, NAMESPACE_TAG, symbol);
2515 entity->base.source_position = pos;
2516 entity->base.parent_scope = current_scope;
2519 type_t *const type = allocate_type_zero(TYPE_ENUM);
2520 type->enumt.enume = &entity->enume;
2521 type->enumt.base.akind = ATOMIC_TYPE_INT;
2523 if (token.kind == '{') {
2524 if (symbol != NULL) {
2525 environment_push(entity);
2527 append_entity(current_scope, entity);
2528 entity->enume.complete = true;
2530 parse_enum_entries(type);
2531 parse_attributes(NULL);
2533 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2534 if (symbol == NULL) {
2535 assert(anonymous_entity == NULL);
2536 anonymous_entity = entity;
2538 } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
2539 errorf(HERE, "'%T' used before definition (incomplete enums are a GNU extension)", type);
2546 * if a symbol is a typedef to another type, return true
2548 static bool is_typedef_symbol(symbol_t *symbol)
2550 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
2551 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
2554 static type_t *parse_typeof(void)
2560 expect('(', end_error);
2561 add_anchor_token(')');
2563 expression_t *expression = NULL;
2565 switch (token.kind) {
2567 if (is_typedef_symbol(token.identifier.symbol)) {
2569 type = parse_typename();
2572 expression = parse_expression();
2573 type = revert_automatic_type_conversion(expression);
2578 rem_anchor_token(')');
2579 expect(')', end_error);
2581 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
2582 typeof_type->typeoft.expression = expression;
2583 typeof_type->typeoft.typeof_type = type;
2590 typedef enum specifiers_t {
2591 SPECIFIER_SIGNED = 1 << 0,
2592 SPECIFIER_UNSIGNED = 1 << 1,
2593 SPECIFIER_LONG = 1 << 2,
2594 SPECIFIER_INT = 1 << 3,
2595 SPECIFIER_DOUBLE = 1 << 4,
2596 SPECIFIER_CHAR = 1 << 5,
2597 SPECIFIER_WCHAR_T = 1 << 6,
2598 SPECIFIER_SHORT = 1 << 7,
2599 SPECIFIER_LONG_LONG = 1 << 8,
2600 SPECIFIER_FLOAT = 1 << 9,
2601 SPECIFIER_BOOL = 1 << 10,
2602 SPECIFIER_VOID = 1 << 11,
2603 SPECIFIER_INT8 = 1 << 12,
2604 SPECIFIER_INT16 = 1 << 13,
2605 SPECIFIER_INT32 = 1 << 14,
2606 SPECIFIER_INT64 = 1 << 15,
2607 SPECIFIER_INT128 = 1 << 16,
2608 SPECIFIER_COMPLEX = 1 << 17,
2609 SPECIFIER_IMAGINARY = 1 << 18,
2612 static type_t *get_typedef_type(symbol_t *symbol)
2614 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
2615 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
2618 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
2619 type->typedeft.typedefe = &entity->typedefe;
2624 static attribute_t *parse_attribute_ms_property(attribute_t *attribute)
2626 expect('(', end_error);
2628 attribute_property_argument_t *property
2629 = allocate_ast_zero(sizeof(*property));
2632 if (token.kind != T_IDENTIFIER) {
2633 parse_error_expected("while parsing property declspec",
2634 T_IDENTIFIER, NULL);
2639 symbol_t *symbol = token.identifier.symbol;
2640 if (strcmp(symbol->string, "put") == 0) {
2641 prop = &property->put_symbol;
2642 } else if (strcmp(symbol->string, "get") == 0) {
2643 prop = &property->get_symbol;
2645 errorf(HERE, "expected put or get in property declspec");
2649 expect('=', end_error);
2650 if (token.kind != T_IDENTIFIER) {
2651 parse_error_expected("while parsing property declspec",
2652 T_IDENTIFIER, NULL);
2656 *prop = token.identifier.symbol;
2658 } while (next_if(','));
2660 attribute->a.property = property;
2662 expect(')', end_error);
2668 static attribute_t *parse_microsoft_extended_decl_modifier_single(void)
2670 attribute_kind_t kind = ATTRIBUTE_UNKNOWN;
2671 if (next_if(T_restrict)) {
2672 kind = ATTRIBUTE_MS_RESTRICT;
2673 } else if (token.kind == T_IDENTIFIER) {
2674 const char *name = token.identifier.symbol->string;
2675 for (attribute_kind_t k = ATTRIBUTE_MS_FIRST; k <= ATTRIBUTE_MS_LAST;
2677 const char *attribute_name = get_attribute_name(k);
2678 if (attribute_name != NULL && strcmp(attribute_name, name) == 0) {
2684 if (kind == ATTRIBUTE_UNKNOWN) {
2685 warningf(WARN_ATTRIBUTE, HERE, "unknown __declspec '%s' ignored", name);
2688 parse_error_expected("while parsing __declspec", T_IDENTIFIER, NULL);
2692 attribute_t *attribute = allocate_attribute_zero(kind);
2695 if (kind == ATTRIBUTE_MS_PROPERTY) {
2696 return parse_attribute_ms_property(attribute);
2699 /* parse arguments */
2701 attribute->a.arguments = parse_attribute_arguments();
2706 static attribute_t *parse_microsoft_extended_decl_modifier(attribute_t *first)
2710 expect('(', end_error);
2715 add_anchor_token(')');
2717 attribute_t **anchor = &first;
2719 while (*anchor != NULL)
2720 anchor = &(*anchor)->next;
2722 attribute_t *attribute
2723 = parse_microsoft_extended_decl_modifier_single();
2724 if (attribute == NULL)
2727 *anchor = attribute;
2728 anchor = &attribute->next;
2729 } while (next_if(','));
2731 rem_anchor_token(')');
2732 expect(')', end_error);
2736 rem_anchor_token(')');
2740 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
2742 entity_t *const entity = allocate_entity_zero(kind, NAMESPACE_NORMAL, symbol);
2743 entity->base.source_position = *HERE;
2744 if (is_declaration(entity)) {
2745 entity->declaration.type = type_error_type;
2746 entity->declaration.implicit = true;
2747 } else if (kind == ENTITY_TYPEDEF) {
2748 entity->typedefe.type = type_error_type;
2749 entity->typedefe.builtin = true;
2751 if (kind != ENTITY_COMPOUND_MEMBER)
2752 record_entity(entity, false);
2756 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2758 type_t *type = NULL;
2759 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
2760 unsigned type_specifiers = 0;
2761 bool newtype = false;
2762 bool saw_error = false;
2764 memset(specifiers, 0, sizeof(*specifiers));
2765 specifiers->source_position = token.base.source_position;
2768 specifiers->attributes = parse_attributes(specifiers->attributes);
2770 switch (token.kind) {
2772 #define MATCH_STORAGE_CLASS(token, class) \
2774 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
2775 errorf(HERE, "multiple storage classes in declaration specifiers"); \
2777 specifiers->storage_class = class; \
2778 if (specifiers->thread_local) \
2779 goto check_thread_storage_class; \
2783 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
2784 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
2785 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
2786 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
2787 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
2790 specifiers->attributes
2791 = parse_microsoft_extended_decl_modifier(specifiers->attributes);
2795 if (specifiers->thread_local) {
2796 errorf(HERE, "duplicate '__thread'");
2798 specifiers->thread_local = true;
2799 check_thread_storage_class:
2800 switch (specifiers->storage_class) {
2801 case STORAGE_CLASS_EXTERN:
2802 case STORAGE_CLASS_NONE:
2803 case STORAGE_CLASS_STATIC:
2807 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_storage_class;
2808 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_storage_class;
2809 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_storage_class;
2810 wrong_thread_storage_class:
2811 errorf(HERE, "'__thread' used with '%s'", wrong);
2818 /* type qualifiers */
2819 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
2821 qualifiers |= qualifier; \
2825 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
2826 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
2827 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
2828 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
2829 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
2830 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
2831 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
2832 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
2834 /* type specifiers */
2835 #define MATCH_SPECIFIER(token, specifier, name) \
2837 if (type_specifiers & specifier) { \
2838 errorf(HERE, "multiple " name " type specifiers given"); \
2840 type_specifiers |= specifier; \
2845 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
2846 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
2847 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
2848 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
2849 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
2850 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
2851 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
2852 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
2853 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
2854 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
2855 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
2856 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
2857 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
2858 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
2859 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
2860 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
2861 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
2862 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
2866 specifiers->is_inline = true;
2870 case T__forceinline:
2872 specifiers->modifiers |= DM_FORCEINLINE;
2877 if (type_specifiers & SPECIFIER_LONG_LONG) {
2878 errorf(HERE, "too many long type specifiers given");
2879 } else if (type_specifiers & SPECIFIER_LONG) {
2880 type_specifiers |= SPECIFIER_LONG_LONG;
2882 type_specifiers |= SPECIFIER_LONG;
2887 #define CHECK_DOUBLE_TYPE() \
2888 (type != NULL ? errorf(HERE, "multiple types in declaration specifiers") : (void)0)
2891 CHECK_DOUBLE_TYPE();
2892 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
2894 type->compound.compound = parse_compound_type_specifier(true);
2897 CHECK_DOUBLE_TYPE();
2898 type = allocate_type_zero(TYPE_COMPOUND_UNION);
2899 type->compound.compound = parse_compound_type_specifier(false);
2902 CHECK_DOUBLE_TYPE();
2903 type = parse_enum_specifier();
2906 CHECK_DOUBLE_TYPE();
2907 type = parse_typeof();
2909 case T___builtin_va_list:
2910 CHECK_DOUBLE_TYPE();
2911 type = duplicate_type(type_valist);
2915 case T_IDENTIFIER: {
2916 /* only parse identifier if we haven't found a type yet */
2917 if (type != NULL || type_specifiers != 0) {
2918 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
2919 * declaration, so it doesn't generate errors about expecting '(' or
2921 switch (look_ahead(1)->kind) {
2928 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
2932 errorf(HERE, "discarding stray %K in declaration specifier", &token);
2937 goto finish_specifiers;
2941 type_t *const typedef_type = get_typedef_type(token.identifier.symbol);
2942 if (typedef_type == NULL) {
2943 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
2944 * declaration, so it doesn't generate 'implicit int' followed by more
2945 * errors later on. */
2946 token_kind_t const la1_type = (token_kind_t)look_ahead(1)->kind;
2952 errorf(HERE, "%K does not name a type", &token);
2954 symbol_t *symbol = token.identifier.symbol;
2956 = create_error_entity(symbol, ENTITY_TYPEDEF);
2958 type = allocate_type_zero(TYPE_TYPEDEF);
2959 type->typedeft.typedefe = &entity->typedefe;
2967 goto finish_specifiers;
2972 type = typedef_type;
2976 /* function specifier */
2978 goto finish_specifiers;
2983 specifiers->attributes = parse_attributes(specifiers->attributes);
2985 if (type == NULL || (saw_error && type_specifiers != 0)) {
2986 atomic_type_kind_t atomic_type;
2988 /* match valid basic types */
2989 switch (type_specifiers) {
2990 case SPECIFIER_VOID:
2991 atomic_type = ATOMIC_TYPE_VOID;
2993 case SPECIFIER_WCHAR_T:
2994 atomic_type = ATOMIC_TYPE_WCHAR_T;
2996 case SPECIFIER_CHAR:
2997 atomic_type = ATOMIC_TYPE_CHAR;
2999 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3000 atomic_type = ATOMIC_TYPE_SCHAR;
3002 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3003 atomic_type = ATOMIC_TYPE_UCHAR;
3005 case SPECIFIER_SHORT:
3006 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3007 case SPECIFIER_SHORT | SPECIFIER_INT:
3008 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3009 atomic_type = ATOMIC_TYPE_SHORT;
3011 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3012 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3013 atomic_type = ATOMIC_TYPE_USHORT;
3016 case SPECIFIER_SIGNED:
3017 case SPECIFIER_SIGNED | SPECIFIER_INT:
3018 atomic_type = ATOMIC_TYPE_INT;
3020 case SPECIFIER_UNSIGNED:
3021 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3022 atomic_type = ATOMIC_TYPE_UINT;
3024 case SPECIFIER_LONG:
3025 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3026 case SPECIFIER_LONG | SPECIFIER_INT:
3027 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3028 atomic_type = ATOMIC_TYPE_LONG;
3030 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3031 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3032 atomic_type = ATOMIC_TYPE_ULONG;
3035 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3036 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3037 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3038 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3040 atomic_type = ATOMIC_TYPE_LONGLONG;
3041 goto warn_about_long_long;
3043 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3044 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3046 atomic_type = ATOMIC_TYPE_ULONGLONG;
3047 warn_about_long_long:
3048 warningf(WARN_LONG_LONG, &specifiers->source_position, "ISO C90 does not support 'long long'");
3051 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3052 atomic_type = unsigned_int8_type_kind;
3055 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3056 atomic_type = unsigned_int16_type_kind;
3059 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3060 atomic_type = unsigned_int32_type_kind;
3063 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3064 atomic_type = unsigned_int64_type_kind;
3067 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3068 atomic_type = unsigned_int128_type_kind;
3071 case SPECIFIER_INT8:
3072 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3073 atomic_type = int8_type_kind;
3076 case SPECIFIER_INT16:
3077 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3078 atomic_type = int16_type_kind;
3081 case SPECIFIER_INT32:
3082 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3083 atomic_type = int32_type_kind;
3086 case SPECIFIER_INT64:
3087 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3088 atomic_type = int64_type_kind;
3091 case SPECIFIER_INT128:
3092 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3093 atomic_type = int128_type_kind;
3096 case SPECIFIER_FLOAT:
3097 atomic_type = ATOMIC_TYPE_FLOAT;
3099 case SPECIFIER_DOUBLE:
3100 atomic_type = ATOMIC_TYPE_DOUBLE;
3102 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3103 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3105 case SPECIFIER_BOOL:
3106 atomic_type = ATOMIC_TYPE_BOOL;
3108 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3109 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3110 atomic_type = ATOMIC_TYPE_FLOAT;
3112 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3113 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3114 atomic_type = ATOMIC_TYPE_DOUBLE;
3116 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3117 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3118 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3121 /* invalid specifier combination, give an error message */
3122 source_position_t const* const pos = &specifiers->source_position;
3123 if (type_specifiers == 0) {
3125 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
3126 if (!(c_mode & _CXX) && !strict_mode) {
3127 warningf(WARN_IMPLICIT_INT, pos, "no type specifiers in declaration, using 'int'");
3128 atomic_type = ATOMIC_TYPE_INT;
3131 errorf(pos, "no type specifiers given in declaration");
3134 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3135 (type_specifiers & SPECIFIER_UNSIGNED)) {
3136 errorf(pos, "signed and unsigned specifiers given");
3137 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3138 errorf(pos, "only integer types can be signed or unsigned");
3140 errorf(pos, "multiple datatypes in declaration");
3146 if (type_specifiers & SPECIFIER_COMPLEX) {
3147 type = allocate_type_zero(TYPE_COMPLEX);
3148 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3149 type = allocate_type_zero(TYPE_IMAGINARY);
3151 type = allocate_type_zero(TYPE_ATOMIC);
3153 type->atomic.akind = atomic_type;
3155 } else if (type_specifiers != 0) {
3156 errorf(&specifiers->source_position, "multiple datatypes in declaration");
3159 /* FIXME: check type qualifiers here */
3160 type->base.qualifiers = qualifiers;
3163 type = identify_new_type(type);
3165 type = typehash_insert(type);
3168 if (specifiers->attributes != NULL)
3169 type = handle_type_attributes(specifiers->attributes, type);
3170 specifiers->type = type;
3174 specifiers->type = type_error_type;
3177 static type_qualifiers_t parse_type_qualifiers(void)
3179 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3182 switch (token.kind) {
3183 /* type qualifiers */
3184 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3185 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3186 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3187 /* microsoft extended type modifiers */
3188 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3189 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3190 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3191 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3192 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3201 * Parses an K&R identifier list
3203 static void parse_identifier_list(scope_t *scope)
3205 assert(token.kind == T_IDENTIFIER);
3207 entity_t *const entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, token.identifier.symbol);
3208 entity->base.source_position = token.base.source_position;
3209 /* a K&R parameter has no type, yet */
3213 append_entity(scope, entity);
3214 } while (next_if(',') && token.kind == T_IDENTIFIER);
3217 static entity_t *parse_parameter(void)
3219 declaration_specifiers_t specifiers;
3220 parse_declaration_specifiers(&specifiers);
3222 entity_t *entity = parse_declarator(&specifiers,
3223 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
3224 anonymous_entity = NULL;
3228 static void semantic_parameter_incomplete(const entity_t *entity)
3230 assert(entity->kind == ENTITY_PARAMETER);
3232 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
3233 * list in a function declarator that is part of a
3234 * definition of that function shall not have
3235 * incomplete type. */
3236 type_t *type = skip_typeref(entity->declaration.type);
3237 if (is_type_incomplete(type)) {
3238 errorf(&entity->base.source_position, "'%N' has incomplete type", entity);
3242 static bool has_parameters(void)
3244 /* func(void) is not a parameter */
3245 if (token.kind == T_IDENTIFIER) {
3246 entity_t const *const entity
3247 = get_entity(token.identifier.symbol, NAMESPACE_NORMAL);
3250 if (entity->kind != ENTITY_TYPEDEF)
3252 if (skip_typeref(entity->typedefe.type) != type_void)
3254 } else if (token.kind != T_void) {
3257 if (look_ahead(1)->kind != ')')
3264 * Parses function type parameters (and optionally creates variable_t entities
3265 * for them in a scope)
3267 static void parse_parameters(function_type_t *type, scope_t *scope)
3270 add_anchor_token(')');
3271 int saved_comma_state = save_and_reset_anchor_state(',');
3273 if (token.kind == T_IDENTIFIER
3274 && !is_typedef_symbol(token.identifier.symbol)) {
3275 token_kind_t la1_type = (token_kind_t)look_ahead(1)->kind;
3276 if (la1_type == ',' || la1_type == ')') {
3277 type->kr_style_parameters = true;
3278 parse_identifier_list(scope);
3279 goto parameters_finished;
3283 if (token.kind == ')') {
3284 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
3285 if (!(c_mode & _CXX))
3286 type->unspecified_parameters = true;
3287 } else if (has_parameters()) {
3288 function_parameter_t **anchor = &type->parameters;
3290 switch (token.kind) {
3293 type->variadic = true;
3294 goto parameters_finished;
3299 entity_t *entity = parse_parameter();
3300 if (entity->kind == ENTITY_TYPEDEF) {
3301 errorf(&entity->base.source_position,
3302 "typedef not allowed as function parameter");
3305 assert(is_declaration(entity));
3307 semantic_parameter_incomplete(entity);
3309 function_parameter_t *const parameter =
3310 allocate_parameter(entity->declaration.type);
3312 if (scope != NULL) {
3313 append_entity(scope, entity);
3316 *anchor = parameter;
3317 anchor = ¶meter->next;
3322 goto parameters_finished;
3324 } while (next_if(','));
3327 parameters_finished:
3328 rem_anchor_token(')');
3329 expect(')', end_error);
3332 restore_anchor_state(',', saved_comma_state);
3335 typedef enum construct_type_kind_t {
3336 CONSTRUCT_POINTER = 1,
3337 CONSTRUCT_REFERENCE,
3340 } construct_type_kind_t;
3342 typedef union construct_type_t construct_type_t;
3344 typedef struct construct_type_base_t {
3345 construct_type_kind_t kind;
3346 source_position_t pos;
3347 construct_type_t *next;
3348 } construct_type_base_t;
3350 typedef struct parsed_pointer_t {
3351 construct_type_base_t base;
3352 type_qualifiers_t type_qualifiers;
3353 variable_t *base_variable; /**< MS __based extension. */
3356 typedef struct parsed_reference_t {
3357 construct_type_base_t base;
3358 } parsed_reference_t;
3360 typedef struct construct_function_type_t {
3361 construct_type_base_t base;
3362 type_t *function_type;
3363 } construct_function_type_t;
3365 typedef struct parsed_array_t {
3366 construct_type_base_t base;
3367 type_qualifiers_t type_qualifiers;
3373 union construct_type_t {
3374 construct_type_kind_t kind;
3375 construct_type_base_t base;
3376 parsed_pointer_t pointer;
3377 parsed_reference_t reference;
3378 construct_function_type_t function;
3379 parsed_array_t array;
3382 static construct_type_t *allocate_declarator_zero(construct_type_kind_t const kind, size_t const size)
3384 construct_type_t *const cons = obstack_alloc(&temp_obst, size);
3385 memset(cons, 0, size);
3387 cons->base.pos = *HERE;
3392 static construct_type_t *parse_pointer_declarator(void)
3394 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_POINTER, sizeof(parsed_pointer_t));
3396 cons->pointer.type_qualifiers = parse_type_qualifiers();
3397 //cons->pointer.base_variable = base_variable;
3402 /* ISO/IEC 14882:1998(E) §8.3.2 */
3403 static construct_type_t *parse_reference_declarator(void)
3405 if (!(c_mode & _CXX))
3406 errorf(HERE, "references are only available for C++");
3408 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_REFERENCE, sizeof(parsed_reference_t));
3415 static construct_type_t *parse_array_declarator(void)
3417 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_ARRAY, sizeof(parsed_array_t));
3418 parsed_array_t *const array = &cons->array;
3421 add_anchor_token(']');
3423 bool is_static = next_if(T_static);
3425 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3428 is_static = next_if(T_static);
3430 array->type_qualifiers = type_qualifiers;
3431 array->is_static = is_static;
3433 expression_t *size = NULL;
3434 if (token.kind == '*' && look_ahead(1)->kind == ']') {
3435 array->is_variable = true;
3437 } else if (token.kind != ']') {
3438 size = parse_assignment_expression();
3440 /* §6.7.5.2:1 Array size must have integer type */
3441 type_t *const orig_type = size->base.type;
3442 type_t *const type = skip_typeref(orig_type);
3443 if (!is_type_integer(type) && is_type_valid(type)) {
3444 errorf(&size->base.source_position,
3445 "array size '%E' must have integer type but has type '%T'",
3450 mark_vars_read(size, NULL);
3453 if (is_static && size == NULL)
3454 errorf(&array->base.pos, "static array parameters require a size");
3456 rem_anchor_token(']');
3457 expect(']', end_error);
3464 static construct_type_t *parse_function_declarator(scope_t *scope)
3466 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_FUNCTION, sizeof(construct_function_type_t));
3468 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3469 function_type_t *ftype = &type->function;
3471 ftype->linkage = current_linkage;
3472 ftype->calling_convention = CC_DEFAULT;
3474 parse_parameters(ftype, scope);
3476 cons->function.function_type = type;
3481 typedef struct parse_declarator_env_t {
3482 bool may_be_abstract : 1;
3483 bool must_be_abstract : 1;
3484 decl_modifiers_t modifiers;
3486 source_position_t source_position;
3488 attribute_t *attributes;
3489 } parse_declarator_env_t;
3492 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env)
3494 /* construct a single linked list of construct_type_t's which describe
3495 * how to construct the final declarator type */
3496 construct_type_t *first = NULL;
3497 construct_type_t **anchor = &first;
3499 env->attributes = parse_attributes(env->attributes);
3502 construct_type_t *type;
3503 //variable_t *based = NULL; /* MS __based extension */
3504 switch (token.kind) {
3506 type = parse_reference_declarator();
3510 panic("based not supported anymore");
3515 type = parse_pointer_declarator();
3519 goto ptr_operator_end;
3523 anchor = &type->base.next;
3525 /* TODO: find out if this is correct */
3526 env->attributes = parse_attributes(env->attributes);
3530 construct_type_t *inner_types = NULL;
3532 switch (token.kind) {
3534 if (env->must_be_abstract) {
3535 errorf(HERE, "no identifier expected in typename");
3537 env->symbol = token.identifier.symbol;
3538 env->source_position = token.base.source_position;
3544 /* Parenthesized declarator or function declarator? */
3545 token_t const *const la1 = look_ahead(1);
3546 switch (la1->kind) {
3548 if (is_typedef_symbol(la1->identifier.symbol)) {
3550 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
3551 * interpreted as ``function with no parameter specification'', rather
3552 * than redundant parentheses around the omitted identifier. */
3554 /* Function declarator. */
3555 if (!env->may_be_abstract) {
3556 errorf(HERE, "function declarator must have a name");
3563 case T___attribute__: /* FIXME __attribute__ might also introduce a parameter of a function declarator. */
3564 /* Paranthesized declarator. */
3566 add_anchor_token(')');
3567 inner_types = parse_inner_declarator(env);
3568 if (inner_types != NULL) {
3569 /* All later declarators only modify the return type */
3570 env->must_be_abstract = true;
3572 rem_anchor_token(')');
3573 expect(')', end_error);
3581 if (env->may_be_abstract)
3583 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3588 construct_type_t **const p = anchor;
3591 construct_type_t *type;
3592 switch (token.kind) {
3594 scope_t *scope = NULL;
3595 if (!env->must_be_abstract) {
3596 scope = &env->parameters;
3599 type = parse_function_declarator(scope);
3603 type = parse_array_declarator();
3606 goto declarator_finished;
3609 /* insert in the middle of the list (at p) */
3610 type->base.next = *p;
3613 anchor = &type->base.next;
3616 declarator_finished:
3617 /* append inner_types at the end of the list, we don't to set anchor anymore
3618 * as it's not needed anymore */
3619 *anchor = inner_types;
3626 static type_t *construct_declarator_type(construct_type_t *construct_list,
3629 construct_type_t *iter = construct_list;
3630 for (; iter != NULL; iter = iter->base.next) {
3631 source_position_t const* const pos = &iter->base.pos;
3632 switch (iter->kind) {
3633 case CONSTRUCT_FUNCTION: {
3634 construct_function_type_t *function = &iter->function;
3635 type_t *function_type = function->function_type;
3637 function_type->function.return_type = type;
3639 type_t *skipped_return_type = skip_typeref(type);
3641 if (is_type_function(skipped_return_type)) {
3642 errorf(pos, "function returning function is not allowed");
3643 } else if (is_type_array(skipped_return_type)) {
3644 errorf(pos, "function returning array is not allowed");
3646 if (skipped_return_type->base.qualifiers != 0) {
3647 warningf(WARN_IGNORED_QUALIFIERS, pos, "type qualifiers in return type of function type are meaningless");
3651 /* The function type was constructed earlier. Freeing it here will
3652 * destroy other types. */
3653 type = typehash_insert(function_type);
3657 case CONSTRUCT_POINTER: {
3658 if (is_type_reference(skip_typeref(type)))
3659 errorf(pos, "cannot declare a pointer to reference");
3661 parsed_pointer_t *pointer = &iter->pointer;
3662 type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
3666 case CONSTRUCT_REFERENCE:
3667 if (is_type_reference(skip_typeref(type)))
3668 errorf(pos, "cannot declare a reference to reference");
3670 type = make_reference_type(type);
3673 case CONSTRUCT_ARRAY: {
3674 if (is_type_reference(skip_typeref(type)))
3675 errorf(pos, "cannot declare an array of references");
3677 parsed_array_t *array = &iter->array;
3678 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
3680 expression_t *size_expression = array->size;
3681 if (size_expression != NULL) {
3683 = create_implicit_cast(size_expression, type_size_t);
3686 array_type->base.qualifiers = array->type_qualifiers;
3687 array_type->array.element_type = type;
3688 array_type->array.is_static = array->is_static;
3689 array_type->array.is_variable = array->is_variable;
3690 array_type->array.size_expression = size_expression;
3692 if (size_expression != NULL) {
3693 switch (is_constant_expression(size_expression)) {
3694 case EXPR_CLASS_CONSTANT: {
3695 long const size = fold_constant_to_int(size_expression);
3696 array_type->array.size = size;
3697 array_type->array.size_constant = true;
3698 /* §6.7.5.2:1 If the expression is a constant expression,
3699 * it shall have a value greater than zero. */
3701 errorf(&size_expression->base.source_position,
3702 "size of array must be greater than zero");
3703 } else if (size == 0 && !GNU_MODE) {
3704 errorf(&size_expression->base.source_position,
3705 "size of array must be greater than zero (zero length arrays are a GCC extension)");
3710 case EXPR_CLASS_VARIABLE:
3711 array_type->array.is_vla = true;
3714 case EXPR_CLASS_ERROR:
3719 type_t *skipped_type = skip_typeref(type);
3721 if (is_type_incomplete(skipped_type)) {
3722 errorf(pos, "array of incomplete type '%T' is not allowed", type);
3723 } else if (is_type_function(skipped_type)) {
3724 errorf(pos, "array of functions is not allowed");
3726 type = identify_new_type(array_type);
3730 internal_errorf(pos, "invalid type construction found");
3736 static type_t *automatic_type_conversion(type_t *orig_type);
3738 static type_t *semantic_parameter(const source_position_t *pos,
3740 const declaration_specifiers_t *specifiers,
3741 entity_t const *const param)
3743 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
3744 * shall be adjusted to ``qualified pointer to type'',
3746 * §6.7.5.3:8 A declaration of a parameter as ``function returning
3747 * type'' shall be adjusted to ``pointer to function
3748 * returning type'', as in 6.3.2.1. */
3749 type = automatic_type_conversion(type);
3751 if (specifiers->is_inline && is_type_valid(type)) {
3752 errorf(pos, "'%N' declared 'inline'", param);
3755 /* §6.9.1:6 The declarations in the declaration list shall contain
3756 * no storage-class specifier other than register and no
3757 * initializations. */
3758 if (specifiers->thread_local || (
3759 specifiers->storage_class != STORAGE_CLASS_NONE &&
3760 specifiers->storage_class != STORAGE_CLASS_REGISTER)
3762 errorf(pos, "invalid storage class for '%N'", param);
3765 /* delay test for incomplete type, because we might have (void)
3766 * which is legal but incomplete... */
3771 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
3772 declarator_flags_t flags)
3774 parse_declarator_env_t env;
3775 memset(&env, 0, sizeof(env));
3776 env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
3778 construct_type_t *construct_type = parse_inner_declarator(&env);
3780 construct_declarator_type(construct_type, specifiers->type);
3781 type_t *type = skip_typeref(orig_type);
3783 if (construct_type != NULL) {
3784 obstack_free(&temp_obst, construct_type);
3787 attribute_t *attributes = parse_attributes(env.attributes);
3788 /* append (shared) specifier attribute behind attributes of this
3790 attribute_t **anchor = &attributes;
3791 while (*anchor != NULL)
3792 anchor = &(*anchor)->next;
3793 *anchor = specifiers->attributes;
3796 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
3797 entity = allocate_entity_zero(ENTITY_TYPEDEF, NAMESPACE_NORMAL, env.symbol);
3798 entity->base.source_position = env.source_position;
3799 entity->typedefe.type = orig_type;
3801 if (anonymous_entity != NULL) {
3802 if (is_type_compound(type)) {
3803 assert(anonymous_entity->compound.alias == NULL);
3804 assert(anonymous_entity->kind == ENTITY_STRUCT ||
3805 anonymous_entity->kind == ENTITY_UNION);
3806 anonymous_entity->compound.alias = entity;
3807 anonymous_entity = NULL;
3808 } else if (is_type_enum(type)) {
3809 assert(anonymous_entity->enume.alias == NULL);
3810 assert(anonymous_entity->kind == ENTITY_ENUM);
3811 anonymous_entity->enume.alias = entity;
3812 anonymous_entity = NULL;
3816 /* create a declaration type entity */
3817 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
3818 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, env.symbol);
3820 if (env.symbol != NULL) {
3821 if (specifiers->is_inline && is_type_valid(type)) {
3822 errorf(&env.source_position,
3823 "compound member '%Y' declared 'inline'", env.symbol);
3826 if (specifiers->thread_local ||
3827 specifiers->storage_class != STORAGE_CLASS_NONE) {
3828 errorf(&env.source_position,
3829 "compound member '%Y' must have no storage class",
3833 } else if (flags & DECL_IS_PARAMETER) {
3834 entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, env.symbol);
3835 orig_type = semantic_parameter(&env.source_position, orig_type, specifiers, entity);
3836 } else if (is_type_function(type)) {
3837 entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, env.symbol);
3838 entity->function.is_inline = specifiers->is_inline;
3839 entity->function.elf_visibility = default_visibility;
3840 entity->function.parameters = env.parameters;
3842 if (env.symbol != NULL) {
3843 /* this needs fixes for C++ */
3844 bool in_function_scope = current_function != NULL;
3846 if (specifiers->thread_local || (
3847 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3848 specifiers->storage_class != STORAGE_CLASS_NONE &&
3849 (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
3851 errorf(&env.source_position, "invalid storage class for '%N'", entity);
3855 entity = allocate_entity_zero(ENTITY_VARIABLE, NAMESPACE_NORMAL, env.symbol);
3856 entity->variable.elf_visibility = default_visibility;
3857 entity->variable.thread_local = specifiers->thread_local;
3859 if (env.symbol != NULL) {
3860 if (specifiers->is_inline && is_type_valid(type)) {
3861 errorf(&env.source_position, "'%N' declared 'inline'", entity);
3864 bool invalid_storage_class = false;
3865 if (current_scope == file_scope) {
3866 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3867 specifiers->storage_class != STORAGE_CLASS_NONE &&
3868 specifiers->storage_class != STORAGE_CLASS_STATIC) {
3869 invalid_storage_class = true;
3872 if (specifiers->thread_local &&
3873 specifiers->storage_class == STORAGE_CLASS_NONE) {
3874 invalid_storage_class = true;
3877 if (invalid_storage_class) {
3878 errorf(&env.source_position, "invalid storage class for variable '%N'", entity);
3883 entity->base.source_position = env.symbol != NULL ? env.source_position : specifiers->source_position;
3884 entity->declaration.type = orig_type;
3885 entity->declaration.alignment = get_type_alignment(orig_type);
3886 entity->declaration.modifiers = env.modifiers;
3887 entity->declaration.attributes = attributes;
3889 storage_class_t storage_class = specifiers->storage_class;
3890 entity->declaration.declared_storage_class = storage_class;
3892 if (storage_class == STORAGE_CLASS_NONE && current_function != NULL)
3893 storage_class = STORAGE_CLASS_AUTO;
3894 entity->declaration.storage_class = storage_class;
3897 if (attributes != NULL) {
3898 handle_entity_attributes(attributes, entity);
3904 static type_t *parse_abstract_declarator(type_t *base_type)
3906 parse_declarator_env_t env;
3907 memset(&env, 0, sizeof(env));
3908 env.may_be_abstract = true;
3909 env.must_be_abstract = true;
3911 construct_type_t *construct_type = parse_inner_declarator(&env);
3913 type_t *result = construct_declarator_type(construct_type, base_type);
3914 if (construct_type != NULL) {
3915 obstack_free(&temp_obst, construct_type);
3917 result = handle_type_attributes(env.attributes, result);
3923 * Check if the declaration of main is suspicious. main should be a
3924 * function with external linkage, returning int, taking either zero
3925 * arguments, two, or three arguments of appropriate types, ie.
3927 * int main([ int argc, char **argv [, char **env ] ]).
3929 * @param decl the declaration to check
3930 * @param type the function type of the declaration
3932 static void check_main(const entity_t *entity)
3934 const source_position_t *pos = &entity->base.source_position;
3935 if (entity->kind != ENTITY_FUNCTION) {
3936 warningf(WARN_MAIN, pos, "'main' is not a function");
3940 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
3941 warningf(WARN_MAIN, pos, "'main' is normally a non-static function");
3944 type_t *type = skip_typeref(entity->declaration.type);
3945 assert(is_type_function(type));
3947 function_type_t const *const func_type = &type->function;
3948 type_t *const ret_type = func_type->return_type;
3949 if (!types_compatible(skip_typeref(ret_type), type_int)) {
3950 warningf(WARN_MAIN, pos, "return type of 'main' should be 'int', but is '%T'", ret_type);
3952 const function_parameter_t *parm = func_type->parameters;
3954 type_t *const first_type = skip_typeref(parm->type);
3955 type_t *const first_type_unqual = get_unqualified_type(first_type);
3956 if (!types_compatible(first_type_unqual, type_int)) {
3957 warningf(WARN_MAIN, pos, "first argument of 'main' should be 'int', but is '%T'", parm->type);
3961 type_t *const second_type = skip_typeref(parm->type);
3962 type_t *const second_type_unqual
3963 = get_unqualified_type(second_type);
3964 if (!types_compatible(second_type_unqual, type_char_ptr_ptr)) {
3965 warningf(WARN_MAIN, pos, "second argument of 'main' should be 'char**', but is '%T'", parm->type);
3969 type_t *const third_type = skip_typeref(parm->type);
3970 type_t *const third_type_unqual
3971 = get_unqualified_type(third_type);
3972 if (!types_compatible(third_type_unqual, type_char_ptr_ptr)) {
3973 warningf(WARN_MAIN, pos, "third argument of 'main' should be 'char**', but is '%T'", parm->type);
3977 goto warn_arg_count;
3981 warningf(WARN_MAIN, pos, "'main' takes only zero, two or three arguments");
3987 * Check if a symbol is the equal to "main".
3989 static bool is_sym_main(const symbol_t *const sym)
3991 return strcmp(sym->string, "main") == 0;
3994 static void error_redefined_as_different_kind(const source_position_t *pos,
3995 const entity_t *old, entity_kind_t new_kind)
3997 char const *const what = get_entity_kind_name(new_kind);
3998 source_position_t const *const ppos = &old->base.source_position;
3999 errorf(pos, "redeclaration of '%N' as %s (declared %P)", old, what, ppos);
4002 static bool is_entity_valid(entity_t *const ent)
4004 if (is_declaration(ent)) {
4005 return is_type_valid(skip_typeref(ent->declaration.type));
4006 } else if (ent->kind == ENTITY_TYPEDEF) {
4007 return is_type_valid(skip_typeref(ent->typedefe.type));
4012 static bool contains_attribute(const attribute_t *list, const attribute_t *attr)
4014 for (const attribute_t *tattr = list; tattr != NULL; tattr = tattr->next) {
4015 if (attributes_equal(tattr, attr))
4022 * test wether new_list contains any attributes not included in old_list
4024 static bool has_new_attributes(const attribute_t *old_list,
4025 const attribute_t *new_list)
4027 for (const attribute_t *attr = new_list; attr != NULL; attr = attr->next) {
4028 if (!contains_attribute(old_list, attr))
4035 * Merge in attributes from an attribute list (probably from a previous
4036 * declaration with the same name). Warning: destroys the old structure
4037 * of the attribute list - don't reuse attributes after this call.
4039 static void merge_in_attributes(declaration_t *decl, attribute_t *attributes)
4042 for (attribute_t *attr = attributes; attr != NULL; attr = next) {
4044 if (contains_attribute(decl->attributes, attr))
4047 /* move attribute to new declarations attributes list */
4048 attr->next = decl->attributes;
4049 decl->attributes = attr;
4054 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
4055 * for various problems that occur for multiple definitions
4057 entity_t *record_entity(entity_t *entity, const bool is_definition)
4059 const symbol_t *const symbol = entity->base.symbol;
4060 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
4061 const source_position_t *pos = &entity->base.source_position;
4063 /* can happen in error cases */
4067 entity_t *const previous_entity = get_entity(symbol, namespc);
4068 /* pushing the same entity twice will break the stack structure */
4069 assert(previous_entity != entity);
4071 if (entity->kind == ENTITY_FUNCTION) {
4072 type_t *const orig_type = entity->declaration.type;
4073 type_t *const type = skip_typeref(orig_type);
4075 assert(is_type_function(type));
4076 if (type->function.unspecified_parameters &&
4077 previous_entity == NULL &&
4078 !entity->declaration.implicit) {
4079 warningf(WARN_STRICT_PROTOTYPES, pos, "function declaration '%#N' is not a prototype", entity);
4082 if (current_scope == file_scope && is_sym_main(symbol)) {
4087 if (is_declaration(entity) &&
4088 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
4089 current_scope != file_scope &&
4090 !entity->declaration.implicit) {
4091 warningf(WARN_NESTED_EXTERNS, pos, "nested extern declaration of '%#N'", entity);
4094 if (previous_entity != NULL) {
4095 source_position_t const *const ppos = &previous_entity->base.source_position;
4097 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
4098 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
4099 assert(previous_entity->kind == ENTITY_PARAMETER);
4100 errorf(pos, "declaration of '%N' redeclares the '%N' (declared %P)", entity, previous_entity, ppos);
4104 if (previous_entity->base.parent_scope == current_scope) {
4105 if (previous_entity->kind != entity->kind) {
4106 if (is_entity_valid(previous_entity) && is_entity_valid(entity)) {
4107 error_redefined_as_different_kind(pos, previous_entity,
4112 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
4113 errorf(pos, "redeclaration of '%N' (declared %P)", entity, ppos);
4116 if (previous_entity->kind == ENTITY_TYPEDEF) {
4117 /* TODO: C++ allows this for exactly the same type */
4118 errorf(pos, "redefinition of '%N' (declared %P)", entity, ppos);
4122 /* at this point we should have only VARIABLES or FUNCTIONS */
4123 assert(is_declaration(previous_entity) && is_declaration(entity));
4125 declaration_t *const prev_decl = &previous_entity->declaration;
4126 declaration_t *const decl = &entity->declaration;
4128 /* can happen for K&R style declarations */
4129 if (prev_decl->type == NULL &&
4130 previous_entity->kind == ENTITY_PARAMETER &&
4131 entity->kind == ENTITY_PARAMETER) {
4132 prev_decl->type = decl->type;
4133 prev_decl->storage_class = decl->storage_class;
4134 prev_decl->declared_storage_class = decl->declared_storage_class;
4135 prev_decl->modifiers = decl->modifiers;
4136 return previous_entity;
4139 type_t *const type = skip_typeref(decl->type);
4140 type_t *const prev_type = skip_typeref(prev_decl->type);
4142 if (!types_compatible(type, prev_type)) {
4143 errorf(pos, "declaration '%#N' is incompatible with '%#N' (declared %P)", entity, previous_entity, ppos);
4145 unsigned old_storage_class = prev_decl->storage_class;
4147 if (is_definition &&
4149 !(prev_decl->modifiers & DM_USED) &&
4150 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4151 warningf(WARN_REDUNDANT_DECLS, ppos, "unnecessary static forward declaration for '%#N'", previous_entity);
4154 storage_class_t new_storage_class = decl->storage_class;
4156 /* pretend no storage class means extern for function
4157 * declarations (except if the previous declaration is neither
4158 * none nor extern) */
4159 if (entity->kind == ENTITY_FUNCTION) {
4160 /* the previous declaration could have unspecified parameters or
4161 * be a typedef, so use the new type */
4162 if (prev_type->function.unspecified_parameters || is_definition)
4163 prev_decl->type = type;
4165 switch (old_storage_class) {
4166 case STORAGE_CLASS_NONE:
4167 old_storage_class = STORAGE_CLASS_EXTERN;
4170 case STORAGE_CLASS_EXTERN:
4171 if (is_definition) {
4172 if (prev_type->function.unspecified_parameters && !is_sym_main(symbol)) {
4173 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4175 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4176 new_storage_class = STORAGE_CLASS_EXTERN;
4183 } else if (is_type_incomplete(prev_type)) {
4184 prev_decl->type = type;
4187 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4188 new_storage_class == STORAGE_CLASS_EXTERN) {
4190 warn_redundant_declaration: ;
4192 = has_new_attributes(prev_decl->attributes,
4194 if (has_new_attrs) {
4195 merge_in_attributes(decl, prev_decl->attributes);
4196 } else if (!is_definition &&
4197 is_type_valid(prev_type) &&
4198 strcmp(ppos->input_name, "<builtin>") != 0) {
4199 warningf(WARN_REDUNDANT_DECLS, pos, "redundant declaration for '%Y' (declared %P)", symbol, ppos);
4201 } else if (current_function == NULL) {
4202 if (old_storage_class != STORAGE_CLASS_STATIC &&
4203 new_storage_class == STORAGE_CLASS_STATIC) {
4204 errorf(pos, "static declaration of '%Y' follows non-static declaration (declared %P)", symbol, ppos);
4205 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4206 prev_decl->storage_class = STORAGE_CLASS_NONE;
4207 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4209 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4211 goto error_redeclaration;
4212 goto warn_redundant_declaration;
4214 } else if (is_type_valid(prev_type)) {
4215 if (old_storage_class == new_storage_class) {
4216 error_redeclaration:
4217 errorf(pos, "redeclaration of '%Y' (declared %P)", symbol, ppos);
4219 errorf(pos, "redeclaration of '%Y' with different linkage (declared %P)", symbol, ppos);
4224 prev_decl->modifiers |= decl->modifiers;
4225 if (entity->kind == ENTITY_FUNCTION) {
4226 previous_entity->function.is_inline |= entity->function.is_inline;
4228 return previous_entity;
4232 if (is_warn_on(why = WARN_SHADOW) ||
4233 (is_warn_on(why = WARN_SHADOW_LOCAL) && previous_entity->base.parent_scope != file_scope)) {
4234 char const *const what = get_entity_kind_name(previous_entity->kind);
4235 warningf(why, pos, "'%N' shadows %s (declared %P)", entity, what, ppos);
4239 if (entity->kind == ENTITY_FUNCTION) {
4240 if (is_definition &&
4241 entity->declaration.storage_class != STORAGE_CLASS_STATIC &&
4242 !is_sym_main(symbol)) {
4243 if (is_warn_on(WARN_MISSING_PROTOTYPES)) {
4244 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4246 goto warn_missing_declaration;
4249 } else if (entity->kind == ENTITY_VARIABLE) {
4250 if (current_scope == file_scope &&
4251 entity->declaration.storage_class == STORAGE_CLASS_NONE &&
4252 !entity->declaration.implicit) {
4253 warn_missing_declaration:
4254 warningf(WARN_MISSING_DECLARATIONS, pos, "no previous declaration for '%#N'", entity);
4259 assert(entity->base.parent_scope == NULL);
4260 assert(current_scope != NULL);
4262 entity->base.parent_scope = current_scope;
4263 environment_push(entity);
4264 append_entity(current_scope, entity);
4269 static void parser_error_multiple_definition(entity_t *entity,
4270 const source_position_t *source_position)
4272 errorf(source_position, "multiple definition of '%Y' (declared %P)",
4273 entity->base.symbol, &entity->base.source_position);
4276 static bool is_declaration_specifier(const token_t *token)
4278 switch (token->kind) {
4282 return is_typedef_symbol(token->identifier.symbol);
4289 static void parse_init_declarator_rest(entity_t *entity)
4291 type_t *orig_type = type_error_type;
4293 if (entity->base.kind == ENTITY_TYPEDEF) {
4294 source_position_t const *const pos = &entity->base.source_position;
4295 errorf(pos, "'%N' is initialized (use __typeof__ instead)", entity);
4297 assert(is_declaration(entity));
4298 orig_type = entity->declaration.type;
4301 type_t *type = skip_typeref(orig_type);
4303 if (entity->kind == ENTITY_VARIABLE
4304 && entity->variable.initializer != NULL) {
4305 parser_error_multiple_definition(entity, HERE);
4309 declaration_t *const declaration = &entity->declaration;
4310 bool must_be_constant = false;
4311 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4312 entity->base.parent_scope == file_scope) {
4313 must_be_constant = true;
4316 if (is_type_function(type)) {
4317 source_position_t const *const pos = &entity->base.source_position;
4318 errorf(pos, "'%N' is initialized like a variable", entity);
4319 orig_type = type_error_type;
4322 parse_initializer_env_t env;
4323 env.type = orig_type;
4324 env.must_be_constant = must_be_constant;
4325 env.entity = entity;
4327 initializer_t *initializer = parse_initializer(&env);
4329 if (entity->kind == ENTITY_VARIABLE) {
4330 /* §6.7.5:22 array initializers for arrays with unknown size
4331 * determine the array type size */
4332 declaration->type = env.type;
4333 entity->variable.initializer = initializer;
4337 /* parse rest of a declaration without any declarator */
4338 static void parse_anonymous_declaration_rest(
4339 const declaration_specifiers_t *specifiers)
4342 anonymous_entity = NULL;
4344 source_position_t const *const pos = &specifiers->source_position;
4345 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4346 specifiers->thread_local) {
4347 warningf(WARN_OTHER, pos, "useless storage class in empty declaration");
4350 type_t *type = specifiers->type;
4351 switch (type->kind) {
4352 case TYPE_COMPOUND_STRUCT:
4353 case TYPE_COMPOUND_UNION: {
4354 if (type->compound.compound->base.symbol == NULL) {
4355 warningf(WARN_OTHER, pos, "unnamed struct/union that defines no instances");
4364 warningf(WARN_OTHER, pos, "empty declaration");
4369 static void check_variable_type_complete(entity_t *ent)
4371 if (ent->kind != ENTITY_VARIABLE)
4374 /* §6.7:7 If an identifier for an object is declared with no linkage, the
4375 * type for the object shall be complete [...] */
4376 declaration_t *decl = &ent->declaration;
4377 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4378 decl->storage_class == STORAGE_CLASS_STATIC)
4381 type_t *const type = skip_typeref(decl->type);
4382 if (!is_type_incomplete(type))
4385 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4386 * are given length one. */
4387 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4388 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4392 errorf(&ent->base.source_position, "variable '%#N' has incomplete type", ent);
4396 static void parse_declaration_rest(entity_t *ndeclaration,
4397 const declaration_specifiers_t *specifiers,
4398 parsed_declaration_func finished_declaration,
4399 declarator_flags_t flags)
4401 add_anchor_token(';');
4402 add_anchor_token(',');
4404 entity_t *entity = finished_declaration(ndeclaration, token.kind == '=');
4406 if (token.kind == '=') {
4407 parse_init_declarator_rest(entity);
4408 } else if (entity->kind == ENTITY_VARIABLE) {
4409 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
4410 * [...] where the extern specifier is explicitly used. */
4411 declaration_t *decl = &entity->declaration;
4412 if (decl->storage_class != STORAGE_CLASS_EXTERN) {
4413 type_t *type = decl->type;
4414 if (is_type_reference(skip_typeref(type))) {
4415 source_position_t const *const pos = &entity->base.source_position;
4416 errorf(pos, "reference '%#N' must be initialized", entity);
4421 check_variable_type_complete(entity);
4426 add_anchor_token('=');
4427 ndeclaration = parse_declarator(specifiers, flags);
4428 rem_anchor_token('=');
4430 expect(';', end_error);
4433 anonymous_entity = NULL;
4434 rem_anchor_token(';');
4435 rem_anchor_token(',');
4438 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4440 symbol_t *symbol = entity->base.symbol;
4444 assert(entity->base.namespc == NAMESPACE_NORMAL);
4445 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4446 if (previous_entity == NULL
4447 || previous_entity->base.parent_scope != current_scope) {
4448 errorf(&entity->base.source_position, "expected declaration of a function parameter, found '%Y'",
4453 if (is_definition) {
4454 errorf(HERE, "'%N' is initialised", entity);
4457 return record_entity(entity, false);
4460 static void parse_declaration(parsed_declaration_func finished_declaration,
4461 declarator_flags_t flags)
4463 add_anchor_token(';');
4464 declaration_specifiers_t specifiers;
4465 parse_declaration_specifiers(&specifiers);
4466 rem_anchor_token(';');
4468 if (token.kind == ';') {
4469 parse_anonymous_declaration_rest(&specifiers);
4471 entity_t *entity = parse_declarator(&specifiers, flags);
4472 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4477 static type_t *get_default_promoted_type(type_t *orig_type)
4479 type_t *result = orig_type;
4481 type_t *type = skip_typeref(orig_type);
4482 if (is_type_integer(type)) {
4483 result = promote_integer(type);
4484 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4485 result = type_double;
4491 static void parse_kr_declaration_list(entity_t *entity)
4493 if (entity->kind != ENTITY_FUNCTION)
4496 type_t *type = skip_typeref(entity->declaration.type);
4497 assert(is_type_function(type));
4498 if (!type->function.kr_style_parameters)
4501 add_anchor_token('{');
4503 PUSH_SCOPE(&entity->function.parameters);
4505 entity_t *parameter = entity->function.parameters.entities;
4506 for ( ; parameter != NULL; parameter = parameter->base.next) {
4507 assert(parameter->base.parent_scope == NULL);
4508 parameter->base.parent_scope = current_scope;
4509 environment_push(parameter);
4512 /* parse declaration list */
4514 switch (token.kind) {
4516 /* This covers symbols, which are no type, too, and results in
4517 * better error messages. The typical cases are misspelled type
4518 * names and missing includes. */
4520 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4530 /* update function type */
4531 type_t *new_type = duplicate_type(type);
4533 function_parameter_t *parameters = NULL;
4534 function_parameter_t **anchor = ¶meters;
4536 /* did we have an earlier prototype? */
4537 entity_t *proto_type = get_entity(entity->base.symbol, NAMESPACE_NORMAL);
4538 if (proto_type != NULL && proto_type->kind != ENTITY_FUNCTION)
4541 function_parameter_t *proto_parameter = NULL;
4542 if (proto_type != NULL) {
4543 type_t *proto_type_type = proto_type->declaration.type;
4544 proto_parameter = proto_type_type->function.parameters;
4545 /* If a K&R function definition has a variadic prototype earlier, then
4546 * make the function definition variadic, too. This should conform to
4547 * §6.7.5.3:15 and §6.9.1:8. */
4548 new_type->function.variadic = proto_type_type->function.variadic;
4550 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
4552 new_type->function.unspecified_parameters = true;
4555 bool need_incompatible_warning = false;
4556 parameter = entity->function.parameters.entities;
4557 for (; parameter != NULL; parameter = parameter->base.next,
4559 proto_parameter == NULL ? NULL : proto_parameter->next) {
4560 if (parameter->kind != ENTITY_PARAMETER)
4563 type_t *parameter_type = parameter->declaration.type;
4564 if (parameter_type == NULL) {
4565 source_position_t const* const pos = ¶meter->base.source_position;
4567 errorf(pos, "no type specified for function '%N'", parameter);
4568 parameter_type = type_error_type;
4570 warningf(WARN_IMPLICIT_INT, pos, "no type specified for function parameter '%N', using 'int'", parameter);
4571 parameter_type = type_int;
4573 parameter->declaration.type = parameter_type;
4576 semantic_parameter_incomplete(parameter);
4578 /* we need the default promoted types for the function type */
4579 type_t *not_promoted = parameter_type;
4580 parameter_type = get_default_promoted_type(parameter_type);
4582 /* gcc special: if the type of the prototype matches the unpromoted
4583 * type don't promote */
4584 if (!strict_mode && proto_parameter != NULL) {
4585 type_t *proto_p_type = skip_typeref(proto_parameter->type);
4586 type_t *promo_skip = skip_typeref(parameter_type);
4587 type_t *param_skip = skip_typeref(not_promoted);
4588 if (!types_compatible(proto_p_type, promo_skip)
4589 && types_compatible(proto_p_type, param_skip)) {
4591 need_incompatible_warning = true;
4592 parameter_type = not_promoted;
4595 function_parameter_t *const function_parameter
4596 = allocate_parameter(parameter_type);
4598 *anchor = function_parameter;
4599 anchor = &function_parameter->next;
4602 new_type->function.parameters = parameters;
4603 new_type = identify_new_type(new_type);
4605 if (need_incompatible_warning) {
4606 symbol_t const *const sym = entity->base.symbol;
4607 source_position_t const *const pos = &entity->base.source_position;
4608 source_position_t const *const ppos = &proto_type->base.source_position;
4609 warningf(WARN_OTHER, pos, "declaration '%#N' is incompatible with '%#T' (declared %P)", proto_type, new_type, sym, ppos);
4611 entity->declaration.type = new_type;
4613 rem_anchor_token('{');
4616 static bool first_err = true;
4619 * When called with first_err set, prints the name of the current function,
4622 static void print_in_function(void)
4626 char const *const file = current_function->base.base.source_position.input_name;
4627 diagnosticf("%s: In '%N':\n", file, (entity_t const*)current_function);
4632 * Check if all labels are defined in the current function.
4633 * Check if all labels are used in the current function.
4635 static void check_labels(void)
4637 for (const goto_statement_t *goto_statement = goto_first;
4638 goto_statement != NULL;
4639 goto_statement = goto_statement->next) {
4640 /* skip computed gotos */
4641 if (goto_statement->expression != NULL)
4644 label_t *label = goto_statement->label;
4645 if (label->base.source_position.input_name == NULL) {
4646 print_in_function();
4647 source_position_t const *const pos = &goto_statement->base.source_position;
4648 errorf(pos, "'%N' used but not defined", (entity_t const*)label);
4652 if (is_warn_on(WARN_UNUSED_LABEL)) {
4653 for (const label_statement_t *label_statement = label_first;
4654 label_statement != NULL;
4655 label_statement = label_statement->next) {
4656 label_t *label = label_statement->label;
4658 if (! label->used) {
4659 print_in_function();
4660 source_position_t const *const pos = &label_statement->base.source_position;
4661 warningf(WARN_UNUSED_LABEL, pos, "'%N' defined but not used", (entity_t const*)label);
4667 static void warn_unused_entity(warning_t const why, entity_t *entity, entity_t *const last)
4669 entity_t const *const end = last != NULL ? last->base.next : NULL;
4670 for (; entity != end; entity = entity->base.next) {
4671 if (!is_declaration(entity))
4674 declaration_t *declaration = &entity->declaration;
4675 if (declaration->implicit)
4678 if (!declaration->used) {
4679 print_in_function();
4680 warningf(why, &entity->base.source_position, "'%N' is unused", entity);
4681 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
4682 print_in_function();
4683 warningf(why, &entity->base.source_position, "'%N' is never read", entity);
4688 static void check_unused_variables(statement_t *const stmt, void *const env)
4692 switch (stmt->kind) {
4693 case STATEMENT_DECLARATION: {
4694 declaration_statement_t const *const decls = &stmt->declaration;
4695 warn_unused_entity(WARN_UNUSED_VARIABLE, decls->declarations_begin, decls->declarations_end);
4700 warn_unused_entity(WARN_UNUSED_VARIABLE, stmt->fors.scope.entities, NULL);
4709 * Check declarations of current_function for unused entities.
4711 static void check_declarations(void)
4713 if (is_warn_on(WARN_UNUSED_PARAMETER)) {
4714 const scope_t *scope = ¤t_function->parameters;
4716 /* do not issue unused warnings for main */
4717 if (!is_sym_main(current_function->base.base.symbol)) {
4718 warn_unused_entity(WARN_UNUSED_PARAMETER, scope->entities, NULL);
4721 if (is_warn_on(WARN_UNUSED_VARIABLE)) {
4722 walk_statements(current_function->statement, check_unused_variables,
4727 static int determine_truth(expression_t const* const cond)
4730 is_constant_expression(cond) != EXPR_CLASS_CONSTANT ? 0 :
4731 fold_constant_to_bool(cond) ? 1 :
4735 static void check_reachable(statement_t *);
4736 static bool reaches_end;
4738 static bool expression_returns(expression_t const *const expr)
4740 switch (expr->kind) {
4742 expression_t const *const func = expr->call.function;
4743 if (func->kind == EXPR_REFERENCE) {
4744 entity_t *entity = func->reference.entity;
4745 if (entity->kind == ENTITY_FUNCTION
4746 && entity->declaration.modifiers & DM_NORETURN)
4750 if (!expression_returns(func))
4753 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
4754 if (!expression_returns(arg->expression))
4761 case EXPR_REFERENCE:
4762 case EXPR_REFERENCE_ENUM_VALUE:
4764 case EXPR_STRING_LITERAL:
4765 case EXPR_WIDE_STRING_LITERAL:
4766 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
4767 case EXPR_LABEL_ADDRESS:
4768 case EXPR_CLASSIFY_TYPE:
4769 case EXPR_SIZEOF: // TODO handle obscure VLA case
4772 case EXPR_BUILTIN_CONSTANT_P:
4773 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
4778 case EXPR_STATEMENT: {
4779 bool old_reaches_end = reaches_end;
4780 reaches_end = false;
4781 check_reachable(expr->statement.statement);
4782 bool returns = reaches_end;
4783 reaches_end = old_reaches_end;
4787 case EXPR_CONDITIONAL:
4788 // TODO handle constant expression
4790 if (!expression_returns(expr->conditional.condition))
4793 if (expr->conditional.true_expression != NULL
4794 && expression_returns(expr->conditional.true_expression))
4797 return expression_returns(expr->conditional.false_expression);
4800 return expression_returns(expr->select.compound);
4802 case EXPR_ARRAY_ACCESS:
4804 expression_returns(expr->array_access.array_ref) &&
4805 expression_returns(expr->array_access.index);
4808 return expression_returns(expr->va_starte.ap);
4811 return expression_returns(expr->va_arge.ap);
4814 return expression_returns(expr->va_copye.src);
4816 EXPR_UNARY_CASES_MANDATORY
4817 return expression_returns(expr->unary.value);
4819 case EXPR_UNARY_THROW:
4823 // TODO handle constant lhs of && and ||
4825 expression_returns(expr->binary.left) &&
4826 expression_returns(expr->binary.right);
4829 panic("unhandled expression");
4832 static bool initializer_returns(initializer_t const *const init)
4834 switch (init->kind) {
4835 case INITIALIZER_VALUE:
4836 return expression_returns(init->value.value);
4838 case INITIALIZER_LIST: {
4839 initializer_t * const* i = init->list.initializers;
4840 initializer_t * const* const end = i + init->list.len;
4841 bool returns = true;
4842 for (; i != end; ++i) {
4843 if (!initializer_returns(*i))
4849 case INITIALIZER_STRING:
4850 case INITIALIZER_WIDE_STRING:
4851 case INITIALIZER_DESIGNATOR: // designators have no payload
4854 panic("unhandled initializer");
4857 static bool noreturn_candidate;
4859 static void check_reachable(statement_t *const stmt)
4861 if (stmt->base.reachable)
4863 if (stmt->kind != STATEMENT_DO_WHILE)
4864 stmt->base.reachable = true;
4866 statement_t *last = stmt;
4868 switch (stmt->kind) {
4869 case STATEMENT_ERROR:
4870 case STATEMENT_EMPTY:
4872 next = stmt->base.next;
4875 case STATEMENT_DECLARATION: {
4876 declaration_statement_t const *const decl = &stmt->declaration;
4877 entity_t const * ent = decl->declarations_begin;
4878 entity_t const *const last_decl = decl->declarations_end;
4880 for (;; ent = ent->base.next) {
4881 if (ent->kind == ENTITY_VARIABLE &&
4882 ent->variable.initializer != NULL &&
4883 !initializer_returns(ent->variable.initializer)) {
4886 if (ent == last_decl)
4890 next = stmt->base.next;
4894 case STATEMENT_COMPOUND:
4895 next = stmt->compound.statements;
4897 next = stmt->base.next;
4900 case STATEMENT_RETURN: {
4901 expression_t const *const val = stmt->returns.value;
4902 if (val == NULL || expression_returns(val))
4903 noreturn_candidate = false;
4907 case STATEMENT_IF: {
4908 if_statement_t const *const ifs = &stmt->ifs;
4909 expression_t const *const cond = ifs->condition;
4911 if (!expression_returns(cond))
4914 int const val = determine_truth(cond);
4917 check_reachable(ifs->true_statement);
4922 if (ifs->false_statement != NULL) {
4923 check_reachable(ifs->false_statement);
4927 next = stmt->base.next;
4931 case STATEMENT_SWITCH: {
4932 switch_statement_t const *const switchs = &stmt->switchs;
4933 expression_t const *const expr = switchs->expression;
4935 if (!expression_returns(expr))
4938 if (is_constant_expression(expr) == EXPR_CLASS_CONSTANT) {
4939 long const val = fold_constant_to_int(expr);
4940 case_label_statement_t * defaults = NULL;
4941 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4942 if (i->expression == NULL) {
4947 if (i->first_case <= val && val <= i->last_case) {
4948 check_reachable((statement_t*)i);
4953 if (defaults != NULL) {
4954 check_reachable((statement_t*)defaults);
4958 bool has_default = false;
4959 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4960 if (i->expression == NULL)
4963 check_reachable((statement_t*)i);
4970 next = stmt->base.next;
4974 case STATEMENT_EXPRESSION: {
4975 /* Check for noreturn function call */
4976 expression_t const *const expr = stmt->expression.expression;
4977 if (!expression_returns(expr))
4980 next = stmt->base.next;
4984 case STATEMENT_CONTINUE:
4985 for (statement_t *parent = stmt;;) {
4986 parent = parent->base.parent;
4987 if (parent == NULL) /* continue not within loop */
4991 switch (parent->kind) {
4992 case STATEMENT_WHILE: goto continue_while;
4993 case STATEMENT_DO_WHILE: goto continue_do_while;
4994 case STATEMENT_FOR: goto continue_for;
5000 case STATEMENT_BREAK:
5001 for (statement_t *parent = stmt;;) {
5002 parent = parent->base.parent;
5003 if (parent == NULL) /* break not within loop/switch */
5006 switch (parent->kind) {
5007 case STATEMENT_SWITCH:
5008 case STATEMENT_WHILE:
5009 case STATEMENT_DO_WHILE:
5012 next = parent->base.next;
5013 goto found_break_parent;
5021 case STATEMENT_GOTO:
5022 if (stmt->gotos.expression) {
5023 if (!expression_returns(stmt->gotos.expression))
5026 statement_t *parent = stmt->base.parent;
5027 if (parent == NULL) /* top level goto */
5031 next = stmt->gotos.label->statement;
5032 if (next == NULL) /* missing label */
5037 case STATEMENT_LABEL:
5038 next = stmt->label.statement;
5041 case STATEMENT_CASE_LABEL:
5042 next = stmt->case_label.statement;
5045 case STATEMENT_WHILE: {
5046 while_statement_t const *const whiles = &stmt->whiles;
5047 expression_t const *const cond = whiles->condition;
5049 if (!expression_returns(cond))
5052 int const val = determine_truth(cond);
5055 check_reachable(whiles->body);
5060 next = stmt->base.next;
5064 case STATEMENT_DO_WHILE:
5065 next = stmt->do_while.body;
5068 case STATEMENT_FOR: {
5069 for_statement_t *const fors = &stmt->fors;
5071 if (fors->condition_reachable)
5073 fors->condition_reachable = true;
5075 expression_t const *const cond = fors->condition;
5080 } else if (expression_returns(cond)) {
5081 val = determine_truth(cond);
5087 check_reachable(fors->body);
5092 next = stmt->base.next;
5096 case STATEMENT_MS_TRY: {
5097 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5098 check_reachable(ms_try->try_statement);
5099 next = ms_try->final_statement;
5103 case STATEMENT_LEAVE: {
5104 statement_t *parent = stmt;
5106 parent = parent->base.parent;
5107 if (parent == NULL) /* __leave not within __try */
5110 if (parent->kind == STATEMENT_MS_TRY) {
5112 next = parent->ms_try.final_statement;
5120 panic("invalid statement kind");
5123 while (next == NULL) {
5124 next = last->base.parent;
5126 noreturn_candidate = false;
5128 type_t *const type = skip_typeref(current_function->base.type);
5129 assert(is_type_function(type));
5130 type_t *const ret = skip_typeref(type->function.return_type);
5131 if (!is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
5132 is_type_valid(ret) &&
5133 !is_sym_main(current_function->base.base.symbol)) {
5134 source_position_t const *const pos = &stmt->base.source_position;
5135 warningf(WARN_RETURN_TYPE, pos, "control reaches end of non-void function");
5140 switch (next->kind) {
5141 case STATEMENT_ERROR:
5142 case STATEMENT_EMPTY:
5143 case STATEMENT_DECLARATION:
5144 case STATEMENT_EXPRESSION:
5146 case STATEMENT_RETURN:
5147 case STATEMENT_CONTINUE:
5148 case STATEMENT_BREAK:
5149 case STATEMENT_GOTO:
5150 case STATEMENT_LEAVE:
5151 panic("invalid control flow in function");
5153 case STATEMENT_COMPOUND:
5154 if (next->compound.stmt_expr) {
5160 case STATEMENT_SWITCH:
5161 case STATEMENT_LABEL:
5162 case STATEMENT_CASE_LABEL:
5164 next = next->base.next;
5167 case STATEMENT_WHILE: {
5169 if (next->base.reachable)
5171 next->base.reachable = true;
5173 while_statement_t const *const whiles = &next->whiles;
5174 expression_t const *const cond = whiles->condition;
5176 if (!expression_returns(cond))
5179 int const val = determine_truth(cond);
5182 check_reachable(whiles->body);
5188 next = next->base.next;
5192 case STATEMENT_DO_WHILE: {
5194 if (next->base.reachable)
5196 next->base.reachable = true;
5198 do_while_statement_t const *const dw = &next->do_while;
5199 expression_t const *const cond = dw->condition;
5201 if (!expression_returns(cond))
5204 int const val = determine_truth(cond);
5207 check_reachable(dw->body);
5213 next = next->base.next;
5217 case STATEMENT_FOR: {
5219 for_statement_t *const fors = &next->fors;
5221 fors->step_reachable = true;
5223 if (fors->condition_reachable)
5225 fors->condition_reachable = true;
5227 expression_t const *const cond = fors->condition;
5232 } else if (expression_returns(cond)) {
5233 val = determine_truth(cond);
5239 check_reachable(fors->body);
5245 next = next->base.next;
5249 case STATEMENT_MS_TRY:
5251 next = next->ms_try.final_statement;
5256 check_reachable(next);
5259 static void check_unreachable(statement_t* const stmt, void *const env)
5263 switch (stmt->kind) {
5264 case STATEMENT_DO_WHILE:
5265 if (!stmt->base.reachable) {
5266 expression_t const *const cond = stmt->do_while.condition;
5267 if (determine_truth(cond) >= 0) {
5268 source_position_t const *const pos = &cond->base.source_position;
5269 warningf(WARN_UNREACHABLE_CODE, pos, "condition of do-while-loop is unreachable");
5274 case STATEMENT_FOR: {
5275 for_statement_t const* const fors = &stmt->fors;
5277 // if init and step are unreachable, cond is unreachable, too
5278 if (!stmt->base.reachable && !fors->step_reachable) {
5279 goto warn_unreachable;
5281 if (!stmt->base.reachable && fors->initialisation != NULL) {
5282 source_position_t const *const pos = &fors->initialisation->base.source_position;
5283 warningf(WARN_UNREACHABLE_CODE, pos, "initialisation of for-statement is unreachable");
5286 if (!fors->condition_reachable && fors->condition != NULL) {
5287 source_position_t const *const pos = &fors->condition->base.source_position;
5288 warningf(WARN_UNREACHABLE_CODE, pos, "condition of for-statement is unreachable");
5291 if (!fors->step_reachable && fors->step != NULL) {
5292 source_position_t const *const pos = &fors->step->base.source_position;
5293 warningf(WARN_UNREACHABLE_CODE, pos, "step of for-statement is unreachable");
5299 case STATEMENT_COMPOUND:
5300 if (stmt->compound.statements != NULL)
5302 goto warn_unreachable;
5304 case STATEMENT_DECLARATION: {
5305 /* Only warn if there is at least one declarator with an initializer.
5306 * This typically occurs in switch statements. */
5307 declaration_statement_t const *const decl = &stmt->declaration;
5308 entity_t const * ent = decl->declarations_begin;
5309 entity_t const *const last = decl->declarations_end;
5311 for (;; ent = ent->base.next) {
5312 if (ent->kind == ENTITY_VARIABLE &&
5313 ent->variable.initializer != NULL) {
5314 goto warn_unreachable;
5324 if (!stmt->base.reachable) {
5325 source_position_t const *const pos = &stmt->base.source_position;
5326 warningf(WARN_UNREACHABLE_CODE, pos, "statement is unreachable");
5332 static void parse_external_declaration(void)
5334 /* function-definitions and declarations both start with declaration
5336 add_anchor_token(';');
5337 declaration_specifiers_t specifiers;
5338 parse_declaration_specifiers(&specifiers);
5339 rem_anchor_token(';');
5341 /* must be a declaration */
5342 if (token.kind == ';') {
5343 parse_anonymous_declaration_rest(&specifiers);
5347 add_anchor_token(',');
5348 add_anchor_token('=');
5349 add_anchor_token(';');
5350 add_anchor_token('{');
5352 /* declarator is common to both function-definitions and declarations */
5353 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
5355 rem_anchor_token('{');
5356 rem_anchor_token(';');
5357 rem_anchor_token('=');
5358 rem_anchor_token(',');
5360 /* must be a declaration */
5361 switch (token.kind) {
5365 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
5370 /* must be a function definition */
5371 parse_kr_declaration_list(ndeclaration);
5373 if (token.kind != '{') {
5374 parse_error_expected("while parsing function definition", '{', NULL);
5375 eat_until_matching_token(';');
5379 assert(is_declaration(ndeclaration));
5380 type_t *const orig_type = ndeclaration->declaration.type;
5381 type_t * type = skip_typeref(orig_type);
5383 if (!is_type_function(type)) {
5384 if (is_type_valid(type)) {
5385 errorf(HERE, "declarator '%#N' has a body but is not a function type", ndeclaration);
5391 source_position_t const *const pos = &ndeclaration->base.source_position;
5392 if (is_typeref(orig_type)) {
5394 errorf(pos, "type of function definition '%#N' is a typedef", ndeclaration);
5397 if (is_type_compound(skip_typeref(type->function.return_type))) {
5398 warningf(WARN_AGGREGATE_RETURN, pos, "'%N' returns an aggregate", ndeclaration);
5400 if (type->function.unspecified_parameters) {
5401 warningf(WARN_OLD_STYLE_DEFINITION, pos, "old-style definition of '%N'", ndeclaration);
5403 warningf(WARN_TRADITIONAL, pos, "traditional C rejects ISO C style definition of '%N'", ndeclaration);
5406 /* §6.7.5.3:14 a function definition with () means no
5407 * parameters (and not unspecified parameters) */
5408 if (type->function.unspecified_parameters &&
5409 type->function.parameters == NULL) {
5410 type_t *copy = duplicate_type(type);
5411 copy->function.unspecified_parameters = false;
5412 type = identify_new_type(copy);
5414 ndeclaration->declaration.type = type;
5417 entity_t *const entity = record_entity(ndeclaration, true);
5418 assert(entity->kind == ENTITY_FUNCTION);
5419 assert(ndeclaration->kind == ENTITY_FUNCTION);
5421 function_t *const function = &entity->function;
5422 if (ndeclaration != entity) {
5423 function->parameters = ndeclaration->function.parameters;
5425 assert(is_declaration(entity));
5426 type = skip_typeref(entity->declaration.type);
5428 PUSH_SCOPE(&function->parameters);
5430 entity_t *parameter = function->parameters.entities;
5431 for (; parameter != NULL; parameter = parameter->base.next) {
5432 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5433 parameter->base.parent_scope = current_scope;
5435 assert(parameter->base.parent_scope == NULL
5436 || parameter->base.parent_scope == current_scope);
5437 parameter->base.parent_scope = current_scope;
5438 if (parameter->base.symbol == NULL) {
5439 errorf(¶meter->base.source_position, "parameter name omitted");
5442 environment_push(parameter);
5445 if (function->statement != NULL) {
5446 parser_error_multiple_definition(entity, HERE);
5449 /* parse function body */
5450 int label_stack_top = label_top();
5451 function_t *old_current_function = current_function;
5452 entity_t *old_current_entity = current_entity;
5453 current_function = function;
5454 current_entity = entity;
5458 goto_anchor = &goto_first;
5460 label_anchor = &label_first;
5462 statement_t *const body = parse_compound_statement(false);
5463 function->statement = body;
5466 check_declarations();
5467 if (is_warn_on(WARN_RETURN_TYPE) ||
5468 is_warn_on(WARN_UNREACHABLE_CODE) ||
5469 (is_warn_on(WARN_MISSING_NORETURN) && !(function->base.modifiers & DM_NORETURN))) {
5470 noreturn_candidate = true;
5471 check_reachable(body);
5472 if (is_warn_on(WARN_UNREACHABLE_CODE))
5473 walk_statements(body, check_unreachable, NULL);
5474 if (noreturn_candidate &&
5475 !(function->base.modifiers & DM_NORETURN)) {
5476 source_position_t const *const pos = &body->base.source_position;
5477 warningf(WARN_MISSING_NORETURN, pos, "function '%#N' is candidate for attribute 'noreturn'", entity);
5482 assert(current_function == function);
5483 assert(current_entity == entity);
5484 current_entity = old_current_entity;
5485 current_function = old_current_function;
5486 label_pop_to(label_stack_top);
5492 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
5494 entity_t *iter = compound->members.entities;
5495 for (; iter != NULL; iter = iter->base.next) {
5496 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5499 if (iter->base.symbol == symbol) {
5501 } else if (iter->base.symbol == NULL) {
5502 /* search in anonymous structs and unions */
5503 type_t *type = skip_typeref(iter->declaration.type);
5504 if (is_type_compound(type)) {
5505 if (find_compound_entry(type->compound.compound, symbol)
5516 static void check_deprecated(const source_position_t *source_position,
5517 const entity_t *entity)
5519 if (!is_declaration(entity))
5521 if ((entity->declaration.modifiers & DM_DEPRECATED) == 0)
5524 source_position_t const *const epos = &entity->base.source_position;
5525 char const *const msg = get_deprecated_string(entity->declaration.attributes);
5527 warningf(WARN_DEPRECATED_DECLARATIONS, source_position, "'%N' is deprecated (declared %P): \"%s\"", entity, epos, msg);
5529 warningf(WARN_DEPRECATED_DECLARATIONS, source_position, "'%N' is deprecated (declared %P)", entity, epos);
5534 static expression_t *create_select(const source_position_t *pos,
5536 type_qualifiers_t qualifiers,
5539 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
5541 check_deprecated(pos, entry);
5543 expression_t *select = allocate_expression_zero(EXPR_SELECT);
5544 select->select.compound = addr;
5545 select->select.compound_entry = entry;
5547 type_t *entry_type = entry->declaration.type;
5548 type_t *res_type = get_qualified_type(entry_type, qualifiers);
5550 /* bitfields need special treatment */
5551 if (entry->compound_member.bitfield) {
5552 unsigned bit_size = entry->compound_member.bit_size;
5553 /* if fewer bits than an int, convert to int (see §6.3.1.1) */
5554 if (bit_size < get_atomic_type_size(ATOMIC_TYPE_INT) * BITS_PER_BYTE) {
5555 res_type = type_int;
5559 /* we always do the auto-type conversions; the & and sizeof parser contains
5560 * code to revert this! */
5561 select->base.type = automatic_type_conversion(res_type);
5568 * Find entry with symbol in compound. Search anonymous structs and unions and
5569 * creates implicit select expressions for them.
5570 * Returns the adress for the innermost compound.
5572 static expression_t *find_create_select(const source_position_t *pos,
5574 type_qualifiers_t qualifiers,
5575 compound_t *compound, symbol_t *symbol)
5577 entity_t *iter = compound->members.entities;
5578 for (; iter != NULL; iter = iter->base.next) {
5579 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5582 symbol_t *iter_symbol = iter->base.symbol;
5583 if (iter_symbol == NULL) {
5584 type_t *type = iter->declaration.type;
5585 if (type->kind != TYPE_COMPOUND_STRUCT
5586 && type->kind != TYPE_COMPOUND_UNION)
5589 compound_t *sub_compound = type->compound.compound;
5591 if (find_compound_entry(sub_compound, symbol) == NULL)
5594 expression_t *sub_addr = create_select(pos, addr, qualifiers, iter);
5595 sub_addr->base.source_position = *pos;
5596 sub_addr->base.implicit = true;
5597 return find_create_select(pos, sub_addr, qualifiers, sub_compound,
5601 if (iter_symbol == symbol) {
5602 return create_select(pos, addr, qualifiers, iter);
5609 static void parse_bitfield_member(entity_t *entity)
5613 expression_t *size = parse_constant_expression();
5616 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5617 type_t *type = entity->declaration.type;
5618 if (!is_type_integer(skip_typeref(type))) {
5619 errorf(HERE, "bitfield base type '%T' is not an integer type",
5623 if (is_constant_expression(size) != EXPR_CLASS_CONSTANT) {
5624 /* error already reported by parse_constant_expression */
5625 size_long = get_type_size(type) * 8;
5627 size_long = fold_constant_to_int(size);
5629 const symbol_t *symbol = entity->base.symbol;
5630 const symbol_t *user_symbol
5631 = symbol == NULL ? sym_anonymous : symbol;
5632 unsigned bit_size = get_type_size(type) * 8;
5633 if (size_long < 0) {
5634 errorf(HERE, "negative width in bit-field '%Y'", user_symbol);
5635 } else if (size_long == 0 && symbol != NULL) {
5636 errorf(HERE, "zero width for bit-field '%Y'", user_symbol);
5637 } else if (bit_size > 0 && (unsigned)size_long > bit_size) {
5638 errorf(HERE, "width of bitfield '%Y' exceeds its type",
5641 /* hope that people don't invent crazy types with more bits
5642 * than our struct can hold */
5644 (1 << sizeof(entity->compound_member.bit_size)*8));
5648 entity->compound_member.bitfield = true;
5649 entity->compound_member.bit_size = (unsigned char)size_long;
5652 static void parse_compound_declarators(compound_t *compound,
5653 const declaration_specifiers_t *specifiers)
5658 if (token.kind == ':') {
5659 /* anonymous bitfield */
5660 type_t *type = specifiers->type;
5661 entity_t *entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER,
5662 NAMESPACE_NORMAL, NULL);
5663 entity->base.source_position = *HERE;
5664 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
5665 entity->declaration.storage_class = STORAGE_CLASS_NONE;
5666 entity->declaration.type = type;
5668 parse_bitfield_member(entity);
5670 attribute_t *attributes = parse_attributes(NULL);
5671 attribute_t **anchor = &attributes;
5672 while (*anchor != NULL)
5673 anchor = &(*anchor)->next;
5674 *anchor = specifiers->attributes;
5675 if (attributes != NULL) {
5676 handle_entity_attributes(attributes, entity);
5678 entity->declaration.attributes = attributes;
5680 append_entity(&compound->members, entity);
5682 entity = parse_declarator(specifiers,
5683 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
5684 source_position_t const *const pos = &entity->base.source_position;
5685 if (entity->kind == ENTITY_TYPEDEF) {
5686 errorf(pos, "typedef not allowed as compound member");
5688 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5690 /* make sure we don't define a symbol multiple times */
5691 symbol_t *symbol = entity->base.symbol;
5692 if (symbol != NULL) {
5693 entity_t *prev = find_compound_entry(compound, symbol);
5695 source_position_t const *const ppos = &prev->base.source_position;
5696 errorf(pos, "multiple declarations of symbol '%Y' (declared %P)", symbol, ppos);
5700 if (token.kind == ':') {
5701 parse_bitfield_member(entity);
5703 attribute_t *attributes = parse_attributes(NULL);
5704 handle_entity_attributes(attributes, entity);
5706 type_t *orig_type = entity->declaration.type;
5707 type_t *type = skip_typeref(orig_type);
5708 if (is_type_function(type)) {
5709 errorf(pos, "'%N' must not have function type '%T'", entity, orig_type);
5710 } else if (is_type_incomplete(type)) {
5711 /* §6.7.2.1:16 flexible array member */
5712 if (!is_type_array(type) ||
5713 token.kind != ';' ||
5714 look_ahead(1)->kind != '}') {
5715 errorf(pos, "'%N' has incomplete type '%T'", entity, orig_type);
5720 append_entity(&compound->members, entity);
5723 } while (next_if(','));
5724 expect(';', end_error);
5727 anonymous_entity = NULL;
5730 static void parse_compound_type_entries(compound_t *compound)
5733 add_anchor_token('}');
5736 switch (token.kind) {
5738 case T___extension__:
5739 case T_IDENTIFIER: {
5741 declaration_specifiers_t specifiers;
5742 parse_declaration_specifiers(&specifiers);
5743 parse_compound_declarators(compound, &specifiers);
5749 rem_anchor_token('}');
5750 expect('}', end_error);
5753 compound->complete = true;
5759 static type_t *parse_typename(void)
5761 declaration_specifiers_t specifiers;
5762 parse_declaration_specifiers(&specifiers);
5763 if (specifiers.storage_class != STORAGE_CLASS_NONE
5764 || specifiers.thread_local) {
5765 /* TODO: improve error message, user does probably not know what a
5766 * storage class is...
5768 errorf(&specifiers.source_position, "typename must not have a storage class");
5771 type_t *result = parse_abstract_declarator(specifiers.type);
5779 typedef expression_t* (*parse_expression_function)(void);
5780 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
5782 typedef struct expression_parser_function_t expression_parser_function_t;
5783 struct expression_parser_function_t {
5784 parse_expression_function parser;
5785 precedence_t infix_precedence;
5786 parse_expression_infix_function infix_parser;
5789 static expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5792 * Prints an error message if an expression was expected but not read
5794 static expression_t *expected_expression_error(void)
5796 /* skip the error message if the error token was read */
5797 if (token.kind != T_ERROR) {
5798 errorf(HERE, "expected expression, got token %K", &token);
5802 return create_error_expression();
5805 static type_t *get_string_type(void)
5807 return is_warn_on(WARN_WRITE_STRINGS) ? type_const_char_ptr : type_char_ptr;
5810 static type_t *get_wide_string_type(void)
5812 return is_warn_on(WARN_WRITE_STRINGS) ? type_const_wchar_t_ptr : type_wchar_t_ptr;
5816 * Parse a string constant.
5818 static expression_t *parse_string_literal(void)
5820 source_position_t begin = token.base.source_position;
5821 string_t res = token.string.string;
5822 bool is_wide = (token.kind == T_WIDE_STRING_LITERAL);
5825 while (token.kind == T_STRING_LITERAL
5826 || token.kind == T_WIDE_STRING_LITERAL) {
5827 warn_string_concat(&token.base.source_position);
5828 res = concat_strings(&res, &token.string.string);
5830 is_wide |= token.kind == T_WIDE_STRING_LITERAL;
5833 expression_t *literal;
5835 literal = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
5836 literal->base.type = get_wide_string_type();
5838 literal = allocate_expression_zero(EXPR_STRING_LITERAL);
5839 literal->base.type = get_string_type();
5841 literal->base.source_position = begin;
5842 literal->literal.value = res;
5848 * Parse a boolean constant.
5850 static expression_t *parse_boolean_literal(bool value)
5852 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_BOOLEAN);
5853 literal->base.type = type_bool;
5854 literal->literal.value.begin = value ? "true" : "false";
5855 literal->literal.value.size = value ? 4 : 5;
5861 static void warn_traditional_suffix(void)
5863 warningf(WARN_TRADITIONAL, HERE, "traditional C rejects the '%S' suffix",
5864 &token.number.suffix);
5867 static void check_integer_suffix(void)
5869 const string_t *suffix = &token.number.suffix;
5870 if (suffix->size == 0)
5873 bool not_traditional = false;
5874 const char *c = suffix->begin;
5875 if (*c == 'l' || *c == 'L') {
5878 not_traditional = true;
5880 if (*c == 'u' || *c == 'U') {
5883 } else if (*c == 'u' || *c == 'U') {
5884 not_traditional = true;
5887 } else if (*c == 'u' || *c == 'U') {
5888 not_traditional = true;
5890 if (*c == 'l' || *c == 'L') {
5898 errorf(&token.base.source_position,
5899 "invalid suffix '%S' on integer constant", suffix);
5900 } else if (not_traditional) {
5901 warn_traditional_suffix();
5905 static type_t *check_floatingpoint_suffix(void)
5907 const string_t *suffix = &token.number.suffix;
5908 type_t *type = type_double;
5909 if (suffix->size == 0)
5912 bool not_traditional = false;
5913 const char *c = suffix->begin;
5914 if (*c == 'f' || *c == 'F') {
5917 } else if (*c == 'l' || *c == 'L') {
5919 type = type_long_double;
5922 errorf(&token.base.source_position,
5923 "invalid suffix '%S' on floatingpoint constant", suffix);
5924 } else if (not_traditional) {
5925 warn_traditional_suffix();
5932 * Parse an integer constant.
5934 static expression_t *parse_number_literal(void)
5936 expression_kind_t kind;
5939 switch (token.kind) {
5941 kind = EXPR_LITERAL_INTEGER;
5942 check_integer_suffix();
5945 case T_INTEGER_OCTAL:
5946 kind = EXPR_LITERAL_INTEGER_OCTAL;
5947 check_integer_suffix();
5950 case T_INTEGER_HEXADECIMAL:
5951 kind = EXPR_LITERAL_INTEGER_HEXADECIMAL;
5952 check_integer_suffix();
5955 case T_FLOATINGPOINT:
5956 kind = EXPR_LITERAL_FLOATINGPOINT;
5957 type = check_floatingpoint_suffix();
5959 case T_FLOATINGPOINT_HEXADECIMAL:
5960 kind = EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL;
5961 type = check_floatingpoint_suffix();
5964 panic("unexpected token type in parse_number_literal");
5967 expression_t *literal = allocate_expression_zero(kind);
5968 literal->base.type = type;
5969 literal->literal.value = token.number.number;
5970 literal->literal.suffix = token.number.suffix;
5973 /* integer type depends on the size of the number and the size
5974 * representable by the types. The backend/codegeneration has to determine
5977 determine_literal_type(&literal->literal);
5982 * Parse a character constant.
5984 static expression_t *parse_character_constant(void)
5986 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_CHARACTER);
5987 literal->base.type = c_mode & _CXX ? type_char : type_int;
5988 literal->literal.value = token.string.string;
5990 size_t len = literal->literal.value.size;
5992 if (!GNU_MODE && !(c_mode & _C99)) {
5993 errorf(HERE, "more than 1 character in character constant");
5995 literal->base.type = type_int;
5996 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
6005 * Parse a wide character constant.
6007 static expression_t *parse_wide_character_constant(void)
6009 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_WIDE_CHARACTER);
6010 literal->base.type = type_int;
6011 literal->literal.value = token.string.string;
6013 size_t len = wstrlen(&literal->literal.value);
6015 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
6022 static entity_t *create_implicit_function(symbol_t *symbol,
6023 const source_position_t *source_position)
6025 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
6026 ntype->function.return_type = type_int;
6027 ntype->function.unspecified_parameters = true;
6028 ntype->function.linkage = LINKAGE_C;
6029 type_t *type = identify_new_type(ntype);
6031 entity_t *const entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, symbol);
6032 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
6033 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
6034 entity->declaration.type = type;
6035 entity->declaration.implicit = true;
6036 entity->base.source_position = *source_position;
6038 if (current_scope != NULL)
6039 record_entity(entity, false);
6045 * Performs automatic type cast as described in §6.3.2.1.
6047 * @param orig_type the original type
6049 static type_t *automatic_type_conversion(type_t *orig_type)
6051 type_t *type = skip_typeref(orig_type);
6052 if (is_type_array(type)) {
6053 array_type_t *array_type = &type->array;
6054 type_t *element_type = array_type->element_type;
6055 unsigned qualifiers = array_type->base.qualifiers;
6057 return make_pointer_type(element_type, qualifiers);
6060 if (is_type_function(type)) {
6061 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6068 * reverts the automatic casts of array to pointer types and function
6069 * to function-pointer types as defined §6.3.2.1
6071 type_t *revert_automatic_type_conversion(const expression_t *expression)
6073 switch (expression->kind) {
6074 case EXPR_REFERENCE: {
6075 entity_t *entity = expression->reference.entity;
6076 if (is_declaration(entity)) {
6077 return entity->declaration.type;
6078 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6079 return entity->enum_value.enum_type;
6081 panic("no declaration or enum in reference");
6086 entity_t *entity = expression->select.compound_entry;
6087 assert(is_declaration(entity));
6088 type_t *type = entity->declaration.type;
6089 return get_qualified_type(type, expression->base.type->base.qualifiers);
6092 case EXPR_UNARY_DEREFERENCE: {
6093 const expression_t *const value = expression->unary.value;
6094 type_t *const type = skip_typeref(value->base.type);
6095 if (!is_type_pointer(type))
6096 return type_error_type;
6097 return type->pointer.points_to;
6100 case EXPR_ARRAY_ACCESS: {
6101 const expression_t *array_ref = expression->array_access.array_ref;
6102 type_t *type_left = skip_typeref(array_ref->base.type);
6103 if (!is_type_pointer(type_left))
6104 return type_error_type;
6105 return type_left->pointer.points_to;
6108 case EXPR_STRING_LITERAL: {
6109 size_t size = expression->string_literal.value.size;
6110 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6113 case EXPR_WIDE_STRING_LITERAL: {
6114 size_t size = wstrlen(&expression->string_literal.value);
6115 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6118 case EXPR_COMPOUND_LITERAL:
6119 return expression->compound_literal.type;
6124 return expression->base.type;
6128 * Find an entity matching a symbol in a scope.
6129 * Uses current scope if scope is NULL
6131 static entity_t *lookup_entity(const scope_t *scope, symbol_t *symbol,
6132 namespace_tag_t namespc)
6134 if (scope == NULL) {
6135 return get_entity(symbol, namespc);
6138 /* we should optimize here, if scope grows above a certain size we should
6139 construct a hashmap here... */
6140 entity_t *entity = scope->entities;
6141 for ( ; entity != NULL; entity = entity->base.next) {
6142 if (entity->base.symbol == symbol
6143 && (namespace_tag_t)entity->base.namespc == namespc)
6150 static entity_t *parse_qualified_identifier(void)
6152 /* namespace containing the symbol */
6154 source_position_t pos;
6155 const scope_t *lookup_scope = NULL;
6157 if (next_if(T_COLONCOLON))
6158 lookup_scope = &unit->scope;
6162 if (token.kind != T_IDENTIFIER) {
6163 parse_error_expected("while parsing identifier", T_IDENTIFIER, NULL);
6164 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6166 symbol = token.identifier.symbol;
6171 entity = lookup_entity(lookup_scope, symbol, NAMESPACE_NORMAL);
6173 if (!next_if(T_COLONCOLON))
6176 switch (entity->kind) {
6177 case ENTITY_NAMESPACE:
6178 lookup_scope = &entity->namespacee.members;
6183 lookup_scope = &entity->compound.members;
6186 errorf(&pos, "'%Y' must be a namespace, class, struct or union (but is a %s)",
6187 symbol, get_entity_kind_name(entity->kind));
6189 /* skip further qualifications */
6190 while (next_if(T_IDENTIFIER) && next_if(T_COLONCOLON)) {}
6192 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6196 if (entity == NULL) {
6197 if (!strict_mode && token.kind == '(') {
6198 /* an implicitly declared function */
6199 warningf(WARN_IMPLICIT_FUNCTION_DECLARATION, &pos,
6200 "implicit declaration of function '%Y'", symbol);
6201 entity = create_implicit_function(symbol, &pos);
6203 errorf(&pos, "unknown identifier '%Y' found.", symbol);
6204 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6211 static expression_t *parse_reference(void)
6213 source_position_t const pos = token.base.source_position;
6214 entity_t *const entity = parse_qualified_identifier();
6217 if (is_declaration(entity)) {
6218 orig_type = entity->declaration.type;
6219 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6220 orig_type = entity->enum_value.enum_type;
6222 panic("expected declaration or enum value in reference");
6225 /* we always do the auto-type conversions; the & and sizeof parser contains
6226 * code to revert this! */
6227 type_t *type = automatic_type_conversion(orig_type);
6229 expression_kind_t kind = EXPR_REFERENCE;
6230 if (entity->kind == ENTITY_ENUM_VALUE)
6231 kind = EXPR_REFERENCE_ENUM_VALUE;
6233 expression_t *expression = allocate_expression_zero(kind);
6234 expression->base.source_position = pos;
6235 expression->base.type = type;
6236 expression->reference.entity = entity;
6238 /* this declaration is used */
6239 if (is_declaration(entity)) {
6240 entity->declaration.used = true;
6243 if (entity->base.parent_scope != file_scope
6244 && (current_function != NULL
6245 && entity->base.parent_scope->depth < current_function->parameters.depth)
6246 && (entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER)) {
6247 if (entity->kind == ENTITY_VARIABLE) {
6248 /* access of a variable from an outer function */
6249 entity->variable.address_taken = true;
6250 } else if (entity->kind == ENTITY_PARAMETER) {
6251 entity->parameter.address_taken = true;
6253 current_function->need_closure = true;
6256 check_deprecated(&pos, entity);
6261 static bool semantic_cast(expression_t *cast)
6263 expression_t *expression = cast->unary.value;
6264 type_t *orig_dest_type = cast->base.type;
6265 type_t *orig_type_right = expression->base.type;
6266 type_t const *dst_type = skip_typeref(orig_dest_type);
6267 type_t const *src_type = skip_typeref(orig_type_right);
6268 source_position_t const *pos = &cast->base.source_position;
6270 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6271 if (dst_type == type_void)
6274 /* only integer and pointer can be casted to pointer */
6275 if (is_type_pointer(dst_type) &&
6276 !is_type_pointer(src_type) &&
6277 !is_type_integer(src_type) &&
6278 is_type_valid(src_type)) {
6279 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6283 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6284 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6288 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6289 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6293 if (is_type_pointer(src_type) && is_type_pointer(dst_type)) {
6294 type_t *src = skip_typeref(src_type->pointer.points_to);
6295 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6296 unsigned missing_qualifiers =
6297 src->base.qualifiers & ~dst->base.qualifiers;
6298 if (missing_qualifiers != 0) {
6299 warningf(WARN_CAST_QUAL, pos, "cast discards qualifiers '%Q' in pointer target type of '%T'", missing_qualifiers, orig_type_right);
6305 static expression_t *parse_compound_literal(source_position_t const *const pos, type_t *type)
6307 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6308 expression->base.source_position = *pos;
6310 parse_initializer_env_t env;
6313 env.must_be_constant = false;
6314 initializer_t *initializer = parse_initializer(&env);
6317 expression->compound_literal.initializer = initializer;
6318 expression->compound_literal.type = type;
6319 expression->base.type = automatic_type_conversion(type);
6325 * Parse a cast expression.
6327 static expression_t *parse_cast(void)
6329 source_position_t const pos = *HERE;
6332 add_anchor_token(')');
6334 type_t *type = parse_typename();
6336 rem_anchor_token(')');
6337 expect(')', end_error);
6339 if (token.kind == '{') {
6340 return parse_compound_literal(&pos, type);
6343 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6344 cast->base.source_position = pos;
6346 expression_t *value = parse_subexpression(PREC_CAST);
6347 cast->base.type = type;
6348 cast->unary.value = value;
6350 if (! semantic_cast(cast)) {
6351 /* TODO: record the error in the AST. else it is impossible to detect it */
6356 return create_error_expression();
6360 * Parse a statement expression.
6362 static expression_t *parse_statement_expression(void)
6364 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6367 add_anchor_token(')');
6369 statement_t *statement = parse_compound_statement(true);
6370 statement->compound.stmt_expr = true;
6371 expression->statement.statement = statement;
6373 /* find last statement and use its type */
6374 type_t *type = type_void;
6375 const statement_t *stmt = statement->compound.statements;
6377 while (stmt->base.next != NULL)
6378 stmt = stmt->base.next;
6380 if (stmt->kind == STATEMENT_EXPRESSION) {
6381 type = stmt->expression.expression->base.type;
6384 source_position_t const *const pos = &expression->base.source_position;
6385 warningf(WARN_OTHER, pos, "empty statement expression ({})");
6387 expression->base.type = type;
6389 rem_anchor_token(')');
6390 expect(')', end_error);
6397 * Parse a parenthesized expression.
6399 static expression_t *parse_parenthesized_expression(void)
6401 token_t const* const la1 = look_ahead(1);
6402 switch (la1->kind) {
6404 /* gcc extension: a statement expression */
6405 return parse_statement_expression();
6408 if (is_typedef_symbol(la1->identifier.symbol)) {
6410 return parse_cast();
6415 add_anchor_token(')');
6416 expression_t *result = parse_expression();
6417 result->base.parenthesized = true;
6418 rem_anchor_token(')');
6419 expect(')', end_error);
6425 static expression_t *parse_function_keyword(void)
6429 if (current_function == NULL) {
6430 errorf(HERE, "'__func__' used outside of a function");
6433 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6434 expression->base.type = type_char_ptr;
6435 expression->funcname.kind = FUNCNAME_FUNCTION;
6442 static expression_t *parse_pretty_function_keyword(void)
6444 if (current_function == NULL) {
6445 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6448 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6449 expression->base.type = type_char_ptr;
6450 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6452 eat(T___PRETTY_FUNCTION__);
6457 static expression_t *parse_funcsig_keyword(void)
6459 if (current_function == NULL) {
6460 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6463 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6464 expression->base.type = type_char_ptr;
6465 expression->funcname.kind = FUNCNAME_FUNCSIG;
6472 static expression_t *parse_funcdname_keyword(void)
6474 if (current_function == NULL) {
6475 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6478 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6479 expression->base.type = type_char_ptr;
6480 expression->funcname.kind = FUNCNAME_FUNCDNAME;
6482 eat(T___FUNCDNAME__);
6487 static designator_t *parse_designator(void)
6489 designator_t *result = allocate_ast_zero(sizeof(result[0]));
6490 result->source_position = *HERE;
6492 if (token.kind != T_IDENTIFIER) {
6493 parse_error_expected("while parsing member designator",
6494 T_IDENTIFIER, NULL);
6497 result->symbol = token.identifier.symbol;
6500 designator_t *last_designator = result;
6503 if (token.kind != T_IDENTIFIER) {
6504 parse_error_expected("while parsing member designator",
6505 T_IDENTIFIER, NULL);
6508 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6509 designator->source_position = *HERE;
6510 designator->symbol = token.identifier.symbol;
6513 last_designator->next = designator;
6514 last_designator = designator;
6518 add_anchor_token(']');
6519 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6520 designator->source_position = *HERE;
6521 designator->array_index = parse_expression();
6522 rem_anchor_token(']');
6523 expect(']', end_error);
6524 if (designator->array_index == NULL) {
6528 last_designator->next = designator;
6529 last_designator = designator;
6541 * Parse the __builtin_offsetof() expression.
6543 static expression_t *parse_offsetof(void)
6545 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6546 expression->base.type = type_size_t;
6548 eat(T___builtin_offsetof);
6550 expect('(', end_error);
6551 add_anchor_token(',');
6552 type_t *type = parse_typename();
6553 rem_anchor_token(',');
6554 expect(',', end_error);
6555 add_anchor_token(')');
6556 designator_t *designator = parse_designator();
6557 rem_anchor_token(')');
6558 expect(')', end_error);
6560 expression->offsetofe.type = type;
6561 expression->offsetofe.designator = designator;
6564 memset(&path, 0, sizeof(path));
6565 path.top_type = type;
6566 path.path = NEW_ARR_F(type_path_entry_t, 0);
6568 descend_into_subtype(&path);
6570 if (!walk_designator(&path, designator, true)) {
6571 return create_error_expression();
6574 DEL_ARR_F(path.path);
6578 return create_error_expression();
6582 * Parses a _builtin_va_start() expression.
6584 static expression_t *parse_va_start(void)
6586 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6588 eat(T___builtin_va_start);
6590 expect('(', end_error);
6591 add_anchor_token(',');
6592 expression->va_starte.ap = parse_assignment_expression();
6593 rem_anchor_token(',');
6594 expect(',', end_error);
6595 expression_t *const expr = parse_assignment_expression();
6596 if (expr->kind == EXPR_REFERENCE) {
6597 entity_t *const entity = expr->reference.entity;
6598 if (!current_function->base.type->function.variadic) {
6599 errorf(&expr->base.source_position,
6600 "'va_start' used in non-variadic function");
6601 } else if (entity->base.parent_scope != ¤t_function->parameters ||
6602 entity->base.next != NULL ||
6603 entity->kind != ENTITY_PARAMETER) {
6604 errorf(&expr->base.source_position,
6605 "second argument of 'va_start' must be last parameter of the current function");
6607 expression->va_starte.parameter = &entity->variable;
6609 expect(')', end_error);
6612 expect(')', end_error);
6614 return create_error_expression();
6618 * Parses a __builtin_va_arg() expression.
6620 static expression_t *parse_va_arg(void)
6622 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6624 eat(T___builtin_va_arg);
6626 expect('(', end_error);
6628 ap.expression = parse_assignment_expression();
6629 expression->va_arge.ap = ap.expression;
6630 check_call_argument(type_valist, &ap, 1);
6632 expect(',', end_error);
6633 expression->base.type = parse_typename();
6634 expect(')', end_error);
6638 return create_error_expression();
6642 * Parses a __builtin_va_copy() expression.
6644 static expression_t *parse_va_copy(void)
6646 expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
6648 eat(T___builtin_va_copy);
6650 expect('(', end_error);
6651 expression_t *dst = parse_assignment_expression();
6652 assign_error_t error = semantic_assign(type_valist, dst);
6653 report_assign_error(error, type_valist, dst, "call argument 1",
6654 &dst->base.source_position);
6655 expression->va_copye.dst = dst;
6657 expect(',', end_error);
6659 call_argument_t src;
6660 src.expression = parse_assignment_expression();
6661 check_call_argument(type_valist, &src, 2);
6662 expression->va_copye.src = src.expression;
6663 expect(')', end_error);
6667 return create_error_expression();
6671 * Parses a __builtin_constant_p() expression.
6673 static expression_t *parse_builtin_constant(void)
6675 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6677 eat(T___builtin_constant_p);
6679 expect('(', end_error);
6680 add_anchor_token(')');
6681 expression->builtin_constant.value = parse_assignment_expression();
6682 rem_anchor_token(')');
6683 expect(')', end_error);
6684 expression->base.type = type_int;
6688 return create_error_expression();
6692 * Parses a __builtin_types_compatible_p() expression.
6694 static expression_t *parse_builtin_types_compatible(void)
6696 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
6698 eat(T___builtin_types_compatible_p);
6700 expect('(', end_error);
6701 add_anchor_token(')');
6702 add_anchor_token(',');
6703 expression->builtin_types_compatible.left = parse_typename();
6704 rem_anchor_token(',');
6705 expect(',', end_error);
6706 expression->builtin_types_compatible.right = parse_typename();
6707 rem_anchor_token(')');
6708 expect(')', end_error);
6709 expression->base.type = type_int;
6713 return create_error_expression();
6717 * Parses a __builtin_is_*() compare expression.
6719 static expression_t *parse_compare_builtin(void)
6721 expression_t *expression;
6723 switch (token.kind) {
6724 case T___builtin_isgreater:
6725 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
6727 case T___builtin_isgreaterequal:
6728 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
6730 case T___builtin_isless:
6731 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
6733 case T___builtin_islessequal:
6734 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
6736 case T___builtin_islessgreater:
6737 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
6739 case T___builtin_isunordered:
6740 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
6743 internal_errorf(HERE, "invalid compare builtin found");
6745 expression->base.source_position = *HERE;
6748 expect('(', end_error);
6749 expression->binary.left = parse_assignment_expression();
6750 expect(',', end_error);
6751 expression->binary.right = parse_assignment_expression();
6752 expect(')', end_error);
6754 type_t *const orig_type_left = expression->binary.left->base.type;
6755 type_t *const orig_type_right = expression->binary.right->base.type;
6757 type_t *const type_left = skip_typeref(orig_type_left);
6758 type_t *const type_right = skip_typeref(orig_type_right);
6759 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6760 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6761 type_error_incompatible("invalid operands in comparison",
6762 &expression->base.source_position, orig_type_left, orig_type_right);
6765 semantic_comparison(&expression->binary);
6770 return create_error_expression();
6774 * Parses a MS assume() expression.
6776 static expression_t *parse_assume(void)
6778 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
6782 expect('(', end_error);
6783 add_anchor_token(')');
6784 expression->unary.value = parse_assignment_expression();
6785 rem_anchor_token(')');
6786 expect(')', end_error);
6788 expression->base.type = type_void;
6791 return create_error_expression();
6795 * Return the label for the current symbol or create a new one.
6797 static label_t *get_label(void)
6799 assert(token.kind == T_IDENTIFIER);
6800 assert(current_function != NULL);
6802 entity_t *label = get_entity(token.identifier.symbol, NAMESPACE_LABEL);
6803 /* If we find a local label, we already created the declaration. */
6804 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
6805 if (label->base.parent_scope != current_scope) {
6806 assert(label->base.parent_scope->depth < current_scope->depth);
6807 current_function->goto_to_outer = true;
6809 } else if (label == NULL || label->base.parent_scope != ¤t_function->parameters) {
6810 /* There is no matching label in the same function, so create a new one. */
6811 label = allocate_entity_zero(ENTITY_LABEL, NAMESPACE_LABEL, token.identifier.symbol);
6816 return &label->label;
6820 * Parses a GNU && label address expression.
6822 static expression_t *parse_label_address(void)
6824 source_position_t source_position = token.base.source_position;
6826 if (token.kind != T_IDENTIFIER) {
6827 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
6828 return create_error_expression();
6831 label_t *const label = get_label();
6833 label->address_taken = true;
6835 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
6836 expression->base.source_position = source_position;
6838 /* label address is treated as a void pointer */
6839 expression->base.type = type_void_ptr;
6840 expression->label_address.label = label;
6845 * Parse a microsoft __noop expression.
6847 static expression_t *parse_noop_expression(void)
6849 /* the result is a (int)0 */
6850 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_MS_NOOP);
6851 literal->base.type = type_int;
6852 literal->literal.value.begin = "__noop";
6853 literal->literal.value.size = 6;
6857 if (token.kind == '(') {
6858 /* parse arguments */
6860 add_anchor_token(')');
6861 add_anchor_token(',');
6863 if (token.kind != ')') do {
6864 (void)parse_assignment_expression();
6865 } while (next_if(','));
6867 rem_anchor_token(',');
6868 rem_anchor_token(')');
6869 expect(')', end_error);
6876 * Parses a primary expression.
6878 static expression_t *parse_primary_expression(void)
6880 switch (token.kind) {
6881 case T_false: return parse_boolean_literal(false);
6882 case T_true: return parse_boolean_literal(true);
6884 case T_INTEGER_OCTAL:
6885 case T_INTEGER_HEXADECIMAL:
6886 case T_FLOATINGPOINT:
6887 case T_FLOATINGPOINT_HEXADECIMAL: return parse_number_literal();
6888 case T_CHARACTER_CONSTANT: return parse_character_constant();
6889 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
6890 case T_STRING_LITERAL:
6891 case T_WIDE_STRING_LITERAL: return parse_string_literal();
6892 case T___FUNCTION__:
6893 case T___func__: return parse_function_keyword();
6894 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
6895 case T___FUNCSIG__: return parse_funcsig_keyword();
6896 case T___FUNCDNAME__: return parse_funcdname_keyword();
6897 case T___builtin_offsetof: return parse_offsetof();
6898 case T___builtin_va_start: return parse_va_start();
6899 case T___builtin_va_arg: return parse_va_arg();
6900 case T___builtin_va_copy: return parse_va_copy();
6901 case T___builtin_isgreater:
6902 case T___builtin_isgreaterequal:
6903 case T___builtin_isless:
6904 case T___builtin_islessequal:
6905 case T___builtin_islessgreater:
6906 case T___builtin_isunordered: return parse_compare_builtin();
6907 case T___builtin_constant_p: return parse_builtin_constant();
6908 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
6909 case T__assume: return parse_assume();
6912 return parse_label_address();
6915 case '(': return parse_parenthesized_expression();
6916 case T___noop: return parse_noop_expression();
6918 /* Gracefully handle type names while parsing expressions. */
6920 return parse_reference();
6922 if (!is_typedef_symbol(token.identifier.symbol)) {
6923 return parse_reference();
6927 source_position_t const pos = *HERE;
6928 declaration_specifiers_t specifiers;
6929 parse_declaration_specifiers(&specifiers);
6930 type_t const *const type = parse_abstract_declarator(specifiers.type);
6931 errorf(&pos, "encountered type '%T' while parsing expression", type);
6932 return create_error_expression();
6936 errorf(HERE, "unexpected token %K, expected an expression", &token);
6938 return create_error_expression();
6941 static expression_t *parse_array_expression(expression_t *left)
6943 expression_t *const expr = allocate_expression_zero(EXPR_ARRAY_ACCESS);
6944 array_access_expression_t *const arr = &expr->array_access;
6947 add_anchor_token(']');
6949 expression_t *const inside = parse_expression();
6951 type_t *const orig_type_left = left->base.type;
6952 type_t *const orig_type_inside = inside->base.type;
6954 type_t *const type_left = skip_typeref(orig_type_left);
6955 type_t *const type_inside = skip_typeref(orig_type_inside);
6961 if (is_type_pointer(type_left)) {
6964 idx_type = type_inside;
6965 res_type = type_left->pointer.points_to;
6967 } else if (is_type_pointer(type_inside)) {
6968 arr->flipped = true;
6971 idx_type = type_left;
6972 res_type = type_inside->pointer.points_to;
6974 res_type = automatic_type_conversion(res_type);
6975 if (!is_type_integer(idx_type)) {
6976 errorf(&idx->base.source_position, "array subscript must have integer type");
6977 } else if (is_type_atomic(idx_type, ATOMIC_TYPE_CHAR)) {
6978 source_position_t const *const pos = &idx->base.source_position;
6979 warningf(WARN_CHAR_SUBSCRIPTS, pos, "array subscript has char type");
6982 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
6983 errorf(&expr->base.source_position, "invalid types '%T[%T]' for array access", orig_type_left, orig_type_inside);
6985 res_type = type_error_type;
6990 arr->array_ref = ref;
6992 arr->base.type = res_type;
6994 rem_anchor_token(']');
6995 expect(']', end_error);
7000 static bool is_bitfield(const expression_t *expression)
7002 return expression->kind == EXPR_SELECT
7003 && expression->select.compound_entry->compound_member.bitfield;
7006 static expression_t *parse_typeprop(expression_kind_t const kind)
7008 expression_t *tp_expression = allocate_expression_zero(kind);
7009 tp_expression->base.type = type_size_t;
7011 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
7014 expression_t *expression;
7015 if (token.kind == '(' && is_declaration_specifier(look_ahead(1))) {
7016 source_position_t const pos = *HERE;
7018 add_anchor_token(')');
7019 orig_type = parse_typename();
7020 rem_anchor_token(')');
7021 expect(')', end_error);
7023 if (token.kind == '{') {
7024 /* It was not sizeof(type) after all. It is sizeof of an expression
7025 * starting with a compound literal */
7026 expression = parse_compound_literal(&pos, orig_type);
7027 goto typeprop_expression;
7030 expression = parse_subexpression(PREC_UNARY);
7032 typeprop_expression:
7033 if (is_bitfield(expression)) {
7034 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7035 errorf(&tp_expression->base.source_position,
7036 "operand of %s expression must not be a bitfield", what);
7039 tp_expression->typeprop.tp_expression = expression;
7041 orig_type = revert_automatic_type_conversion(expression);
7042 expression->base.type = orig_type;
7045 tp_expression->typeprop.type = orig_type;
7046 type_t const* const type = skip_typeref(orig_type);
7047 char const* wrong_type = NULL;
7048 if (is_type_incomplete(type)) {
7049 if (!is_type_atomic(type, ATOMIC_TYPE_VOID) || !GNU_MODE)
7050 wrong_type = "incomplete";
7051 } else if (type->kind == TYPE_FUNCTION) {
7053 /* function types are allowed (and return 1) */
7054 source_position_t const *const pos = &tp_expression->base.source_position;
7055 char const *const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7056 warningf(WARN_OTHER, pos, "%s expression with function argument returns invalid result", what);
7058 wrong_type = "function";
7062 if (wrong_type != NULL) {
7063 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7064 errorf(&tp_expression->base.source_position,
7065 "operand of %s expression must not be of %s type '%T'",
7066 what, wrong_type, orig_type);
7070 return tp_expression;
7073 static expression_t *parse_sizeof(void)
7075 return parse_typeprop(EXPR_SIZEOF);
7078 static expression_t *parse_alignof(void)
7080 return parse_typeprop(EXPR_ALIGNOF);
7083 static expression_t *parse_select_expression(expression_t *addr)
7085 assert(token.kind == '.' || token.kind == T_MINUSGREATER);
7086 bool select_left_arrow = (token.kind == T_MINUSGREATER);
7087 source_position_t const pos = *HERE;
7090 if (token.kind != T_IDENTIFIER) {
7091 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
7092 return create_error_expression();
7094 symbol_t *symbol = token.identifier.symbol;
7097 type_t *const orig_type = addr->base.type;
7098 type_t *const type = skip_typeref(orig_type);
7101 bool saw_error = false;
7102 if (is_type_pointer(type)) {
7103 if (!select_left_arrow) {
7105 "request for member '%Y' in something not a struct or union, but '%T'",
7109 type_left = skip_typeref(type->pointer.points_to);
7111 if (select_left_arrow && is_type_valid(type)) {
7112 errorf(&pos, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7118 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
7119 type_left->kind != TYPE_COMPOUND_UNION) {
7121 if (is_type_valid(type_left) && !saw_error) {
7123 "request for member '%Y' in something not a struct or union, but '%T'",
7126 return create_error_expression();
7129 compound_t *compound = type_left->compound.compound;
7130 if (!compound->complete) {
7131 errorf(&pos, "request for member '%Y' in incomplete type '%T'",
7133 return create_error_expression();
7136 type_qualifiers_t qualifiers = type_left->base.qualifiers;
7137 expression_t *result =
7138 find_create_select(&pos, addr, qualifiers, compound, symbol);
7140 if (result == NULL) {
7141 errorf(&pos, "'%T' has no member named '%Y'", orig_type, symbol);
7142 return create_error_expression();
7148 static void check_call_argument(type_t *expected_type,
7149 call_argument_t *argument, unsigned pos)
7151 type_t *expected_type_skip = skip_typeref(expected_type);
7152 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
7153 expression_t *arg_expr = argument->expression;
7154 type_t *arg_type = skip_typeref(arg_expr->base.type);
7156 /* handle transparent union gnu extension */
7157 if (is_type_union(expected_type_skip)
7158 && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
7159 compound_t *union_decl = expected_type_skip->compound.compound;
7160 type_t *best_type = NULL;
7161 entity_t *entry = union_decl->members.entities;
7162 for ( ; entry != NULL; entry = entry->base.next) {
7163 assert(is_declaration(entry));
7164 type_t *decl_type = entry->declaration.type;
7165 error = semantic_assign(decl_type, arg_expr);
7166 if (error == ASSIGN_ERROR_INCOMPATIBLE
7167 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
7170 if (error == ASSIGN_SUCCESS) {
7171 best_type = decl_type;
7172 } else if (best_type == NULL) {
7173 best_type = decl_type;
7177 if (best_type != NULL) {
7178 expected_type = best_type;
7182 error = semantic_assign(expected_type, arg_expr);
7183 argument->expression = create_implicit_cast(arg_expr, expected_type);
7185 if (error != ASSIGN_SUCCESS) {
7186 /* report exact scope in error messages (like "in argument 3") */
7188 snprintf(buf, sizeof(buf), "call argument %u", pos);
7189 report_assign_error(error, expected_type, arg_expr, buf,
7190 &arg_expr->base.source_position);
7192 type_t *const promoted_type = get_default_promoted_type(arg_type);
7193 if (!types_compatible(expected_type_skip, promoted_type) &&
7194 !types_compatible(expected_type_skip, type_void_ptr) &&
7195 !types_compatible(type_void_ptr, promoted_type)) {
7196 /* Deliberately show the skipped types in this warning */
7197 source_position_t const *const apos = &arg_expr->base.source_position;
7198 warningf(WARN_TRADITIONAL, apos, "passing call argument %u as '%T' rather than '%T' due to prototype", pos, expected_type_skip, promoted_type);
7204 * Handle the semantic restrictions of builtin calls
7206 static void handle_builtin_argument_restrictions(call_expression_t *call)
7208 entity_t *entity = call->function->reference.entity;
7209 switch (entity->function.btk) {
7211 switch (entity->function.b.firm_builtin_kind) {
7212 case ir_bk_return_address:
7213 case ir_bk_frame_address: {
7214 /* argument must be constant */
7215 call_argument_t *argument = call->arguments;
7217 if (is_constant_expression(argument->expression) == EXPR_CLASS_VARIABLE) {
7218 errorf(&call->base.source_position,
7219 "argument of '%Y' must be a constant expression",
7220 call->function->reference.entity->base.symbol);
7224 case ir_bk_prefetch:
7225 /* second and third argument must be constant if existent */
7226 if (call->arguments == NULL)
7228 call_argument_t *rw = call->arguments->next;
7229 call_argument_t *locality = NULL;
7232 if (is_constant_expression(rw->expression) == EXPR_CLASS_VARIABLE) {
7233 errorf(&call->base.source_position,
7234 "second argument of '%Y' must be a constant expression",
7235 call->function->reference.entity->base.symbol);
7237 locality = rw->next;
7239 if (locality != NULL) {
7240 if (is_constant_expression(locality->expression) == EXPR_CLASS_VARIABLE) {
7241 errorf(&call->base.source_position,
7242 "third argument of '%Y' must be a constant expression",
7243 call->function->reference.entity->base.symbol);
7245 locality = rw->next;
7252 case BUILTIN_OBJECT_SIZE:
7253 if (call->arguments == NULL)
7256 call_argument_t *arg = call->arguments->next;
7257 if (arg != NULL && is_constant_expression(arg->expression) == EXPR_CLASS_VARIABLE) {
7258 errorf(&call->base.source_position,
7259 "second argument of '%Y' must be a constant expression",
7260 call->function->reference.entity->base.symbol);
7269 * Parse a call expression, ie. expression '( ... )'.
7271 * @param expression the function address
7273 static expression_t *parse_call_expression(expression_t *expression)
7275 expression_t *result = allocate_expression_zero(EXPR_CALL);
7276 call_expression_t *call = &result->call;
7277 call->function = expression;
7279 type_t *const orig_type = expression->base.type;
7280 type_t *const type = skip_typeref(orig_type);
7282 function_type_t *function_type = NULL;
7283 if (is_type_pointer(type)) {
7284 type_t *const to_type = skip_typeref(type->pointer.points_to);
7286 if (is_type_function(to_type)) {
7287 function_type = &to_type->function;
7288 call->base.type = function_type->return_type;
7292 if (function_type == NULL && is_type_valid(type)) {
7294 "called object '%E' (type '%T') is not a pointer to a function",
7295 expression, orig_type);
7298 /* parse arguments */
7300 add_anchor_token(')');
7301 add_anchor_token(',');
7303 if (token.kind != ')') {
7304 call_argument_t **anchor = &call->arguments;
7306 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7307 argument->expression = parse_assignment_expression();
7310 anchor = &argument->next;
7311 } while (next_if(','));
7313 rem_anchor_token(',');
7314 rem_anchor_token(')');
7315 expect(')', end_error);
7317 if (function_type == NULL)
7320 /* check type and count of call arguments */
7321 function_parameter_t *parameter = function_type->parameters;
7322 call_argument_t *argument = call->arguments;
7323 if (!function_type->unspecified_parameters) {
7324 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7325 parameter = parameter->next, argument = argument->next) {
7326 check_call_argument(parameter->type, argument, ++pos);
7329 if (parameter != NULL) {
7330 errorf(&expression->base.source_position, "too few arguments to function '%E'", expression);
7331 } else if (argument != NULL && !function_type->variadic) {
7332 errorf(&argument->expression->base.source_position, "too many arguments to function '%E'", expression);
7336 /* do default promotion for other arguments */
7337 for (; argument != NULL; argument = argument->next) {
7338 type_t *argument_type = argument->expression->base.type;
7339 if (!is_type_object(skip_typeref(argument_type))) {
7340 errorf(&argument->expression->base.source_position,
7341 "call argument '%E' must not be void", argument->expression);
7344 argument_type = get_default_promoted_type(argument_type);
7346 argument->expression
7347 = create_implicit_cast(argument->expression, argument_type);
7352 if (is_type_compound(skip_typeref(function_type->return_type))) {
7353 source_position_t const *const pos = &expression->base.source_position;
7354 warningf(WARN_AGGREGATE_RETURN, pos, "function call has aggregate value");
7357 if (expression->kind == EXPR_REFERENCE) {
7358 reference_expression_t *reference = &expression->reference;
7359 if (reference->entity->kind == ENTITY_FUNCTION &&
7360 reference->entity->function.btk != BUILTIN_NONE)
7361 handle_builtin_argument_restrictions(call);
7368 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7370 static bool same_compound_type(const type_t *type1, const type_t *type2)
7373 is_type_compound(type1) &&
7374 type1->kind == type2->kind &&
7375 type1->compound.compound == type2->compound.compound;
7378 static expression_t const *get_reference_address(expression_t const *expr)
7380 bool regular_take_address = true;
7382 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7383 expr = expr->unary.value;
7385 regular_take_address = false;
7388 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7391 expr = expr->unary.value;
7394 if (expr->kind != EXPR_REFERENCE)
7397 /* special case for functions which are automatically converted to a
7398 * pointer to function without an extra TAKE_ADDRESS operation */
7399 if (!regular_take_address &&
7400 expr->reference.entity->kind != ENTITY_FUNCTION) {
7407 static void warn_reference_address_as_bool(expression_t const* expr)
7409 expr = get_reference_address(expr);
7411 source_position_t const *const pos = &expr->base.source_position;
7412 entity_t const *const ent = expr->reference.entity;
7413 warningf(WARN_ADDRESS, pos, "the address of '%N' will always evaluate as 'true'", ent);
7417 static void warn_assignment_in_condition(const expression_t *const expr)
7419 if (expr->base.kind != EXPR_BINARY_ASSIGN)
7421 if (expr->base.parenthesized)
7423 source_position_t const *const pos = &expr->base.source_position;
7424 warningf(WARN_PARENTHESES, pos, "suggest parentheses around assignment used as truth value");
7427 static void semantic_condition(expression_t const *const expr,
7428 char const *const context)
7430 type_t *const type = skip_typeref(expr->base.type);
7431 if (is_type_scalar(type)) {
7432 warn_reference_address_as_bool(expr);
7433 warn_assignment_in_condition(expr);
7434 } else if (is_type_valid(type)) {
7435 errorf(&expr->base.source_position,
7436 "%s must have scalar type", context);
7441 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7443 * @param expression the conditional expression
7445 static expression_t *parse_conditional_expression(expression_t *expression)
7447 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7449 conditional_expression_t *conditional = &result->conditional;
7450 conditional->condition = expression;
7453 add_anchor_token(':');
7455 /* §6.5.15:2 The first operand shall have scalar type. */
7456 semantic_condition(expression, "condition of conditional operator");
7458 expression_t *true_expression = expression;
7459 bool gnu_cond = false;
7460 if (GNU_MODE && token.kind == ':') {
7463 true_expression = parse_expression();
7465 rem_anchor_token(':');
7466 expect(':', end_error);
7468 expression_t *false_expression =
7469 parse_subexpression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7471 type_t *const orig_true_type = true_expression->base.type;
7472 type_t *const orig_false_type = false_expression->base.type;
7473 type_t *const true_type = skip_typeref(orig_true_type);
7474 type_t *const false_type = skip_typeref(orig_false_type);
7477 source_position_t const *const pos = &conditional->base.source_position;
7478 type_t *result_type;
7479 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7480 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7481 /* ISO/IEC 14882:1998(E) §5.16:2 */
7482 if (true_expression->kind == EXPR_UNARY_THROW) {
7483 result_type = false_type;
7484 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7485 result_type = true_type;
7487 if (!is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7488 !is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7489 warningf(WARN_OTHER, pos, "ISO C forbids conditional expression with only one void side");
7491 result_type = type_void;
7493 } else if (is_type_arithmetic(true_type)
7494 && is_type_arithmetic(false_type)) {
7495 result_type = semantic_arithmetic(true_type, false_type);
7496 } else if (same_compound_type(true_type, false_type)) {
7497 /* just take 1 of the 2 types */
7498 result_type = true_type;
7499 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7500 type_t *pointer_type;
7502 expression_t *other_expression;
7503 if (is_type_pointer(true_type) &&
7504 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7505 pointer_type = true_type;
7506 other_type = false_type;
7507 other_expression = false_expression;
7509 pointer_type = false_type;
7510 other_type = true_type;
7511 other_expression = true_expression;
7514 if (is_null_pointer_constant(other_expression)) {
7515 result_type = pointer_type;
7516 } else if (is_type_pointer(other_type)) {
7517 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7518 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7521 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
7522 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
7524 } else if (types_compatible(get_unqualified_type(to1),
7525 get_unqualified_type(to2))) {
7528 warningf(WARN_OTHER, pos, "pointer types '%T' and '%T' in conditional expression are incompatible", true_type, false_type);
7532 type_t *const type =
7533 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7534 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7535 } else if (is_type_integer(other_type)) {
7536 warningf(WARN_OTHER, pos, "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7537 result_type = pointer_type;
7539 goto types_incompatible;
7543 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7544 type_error_incompatible("while parsing conditional", pos, true_type, false_type);
7546 result_type = type_error_type;
7549 conditional->true_expression
7550 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7551 conditional->false_expression
7552 = create_implicit_cast(false_expression, result_type);
7553 conditional->base.type = result_type;
7558 * Parse an extension expression.
7560 static expression_t *parse_extension(void)
7563 expression_t *expression = parse_subexpression(PREC_UNARY);
7569 * Parse a __builtin_classify_type() expression.
7571 static expression_t *parse_builtin_classify_type(void)
7573 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7574 result->base.type = type_int;
7576 eat(T___builtin_classify_type);
7578 expect('(', end_error);
7579 add_anchor_token(')');
7580 expression_t *expression = parse_expression();
7581 rem_anchor_token(')');
7582 expect(')', end_error);
7583 result->classify_type.type_expression = expression;
7587 return create_error_expression();
7591 * Parse a delete expression
7592 * ISO/IEC 14882:1998(E) §5.3.5
7594 static expression_t *parse_delete(void)
7596 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7597 result->base.type = type_void;
7602 result->kind = EXPR_UNARY_DELETE_ARRAY;
7603 expect(']', end_error);
7607 expression_t *const value = parse_subexpression(PREC_CAST);
7608 result->unary.value = value;
7610 type_t *const type = skip_typeref(value->base.type);
7611 if (!is_type_pointer(type)) {
7612 if (is_type_valid(type)) {
7613 errorf(&value->base.source_position,
7614 "operand of delete must have pointer type");
7616 } else if (is_type_atomic(skip_typeref(type->pointer.points_to), ATOMIC_TYPE_VOID)) {
7617 source_position_t const *const pos = &value->base.source_position;
7618 warningf(WARN_OTHER, pos, "deleting 'void*' is undefined");
7625 * Parse a throw expression
7626 * ISO/IEC 14882:1998(E) §15:1
7628 static expression_t *parse_throw(void)
7630 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7631 result->base.type = type_void;
7635 expression_t *value = NULL;
7636 switch (token.kind) {
7638 value = parse_assignment_expression();
7639 /* ISO/IEC 14882:1998(E) §15.1:3 */
7640 type_t *const orig_type = value->base.type;
7641 type_t *const type = skip_typeref(orig_type);
7642 if (is_type_incomplete(type)) {
7643 errorf(&value->base.source_position,
7644 "cannot throw object of incomplete type '%T'", orig_type);
7645 } else if (is_type_pointer(type)) {
7646 type_t *const points_to = skip_typeref(type->pointer.points_to);
7647 if (is_type_incomplete(points_to) &&
7648 !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7649 errorf(&value->base.source_position,
7650 "cannot throw pointer to incomplete type '%T'", orig_type);
7658 result->unary.value = value;
7663 static bool check_pointer_arithmetic(const source_position_t *source_position,
7664 type_t *pointer_type,
7665 type_t *orig_pointer_type)
7667 type_t *points_to = pointer_type->pointer.points_to;
7668 points_to = skip_typeref(points_to);
7670 if (is_type_incomplete(points_to)) {
7671 if (!GNU_MODE || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7672 errorf(source_position,
7673 "arithmetic with pointer to incomplete type '%T' not allowed",
7677 warningf(WARN_POINTER_ARITH, source_position, "pointer of type '%T' used in arithmetic", orig_pointer_type);
7679 } else if (is_type_function(points_to)) {
7681 errorf(source_position,
7682 "arithmetic with pointer to function type '%T' not allowed",
7686 warningf(WARN_POINTER_ARITH, source_position, "pointer to a function '%T' used in arithmetic", orig_pointer_type);
7692 static bool is_lvalue(const expression_t *expression)
7694 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
7695 switch (expression->kind) {
7696 case EXPR_ARRAY_ACCESS:
7697 case EXPR_COMPOUND_LITERAL:
7698 case EXPR_REFERENCE:
7700 case EXPR_UNARY_DEREFERENCE:
7704 type_t *type = skip_typeref(expression->base.type);
7706 /* ISO/IEC 14882:1998(E) §3.10:3 */
7707 is_type_reference(type) ||
7708 /* Claim it is an lvalue, if the type is invalid. There was a parse
7709 * error before, which maybe prevented properly recognizing it as
7711 !is_type_valid(type);
7716 static void semantic_incdec(unary_expression_t *expression)
7718 type_t *const orig_type = expression->value->base.type;
7719 type_t *const type = skip_typeref(orig_type);
7720 if (is_type_pointer(type)) {
7721 if (!check_pointer_arithmetic(&expression->base.source_position,
7725 } else if (!is_type_real(type) && is_type_valid(type)) {
7726 /* TODO: improve error message */
7727 errorf(&expression->base.source_position,
7728 "operation needs an arithmetic or pointer type");
7731 if (!is_lvalue(expression->value)) {
7732 /* TODO: improve error message */
7733 errorf(&expression->base.source_position, "lvalue required as operand");
7735 expression->base.type = orig_type;
7738 static void promote_unary_int_expr(unary_expression_t *const expr, type_t *const type)
7740 type_t *const res_type = promote_integer(type);
7741 expr->base.type = res_type;
7742 expr->value = create_implicit_cast(expr->value, res_type);
7745 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
7747 type_t *const orig_type = expression->value->base.type;
7748 type_t *const type = skip_typeref(orig_type);
7749 if (!is_type_arithmetic(type)) {
7750 if (is_type_valid(type)) {
7751 /* TODO: improve error message */
7752 errorf(&expression->base.source_position,
7753 "operation needs an arithmetic type");
7756 } else if (is_type_integer(type)) {
7757 promote_unary_int_expr(expression, type);
7759 expression->base.type = orig_type;
7763 static void semantic_unexpr_plus(unary_expression_t *expression)
7765 semantic_unexpr_arithmetic(expression);
7766 source_position_t const *const pos = &expression->base.source_position;
7767 warningf(WARN_TRADITIONAL, pos, "traditional C rejects the unary plus operator");
7770 static void semantic_not(unary_expression_t *expression)
7772 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
7773 semantic_condition(expression->value, "operand of !");
7774 expression->base.type = c_mode & _CXX ? type_bool : type_int;
7777 static void semantic_unexpr_integer(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_integer(type)) {
7782 if (is_type_valid(type)) {
7783 errorf(&expression->base.source_position,
7784 "operand of ~ must be of integer type");
7789 promote_unary_int_expr(expression, type);
7792 static void semantic_dereference(unary_expression_t *expression)
7794 type_t *const orig_type = expression->value->base.type;
7795 type_t *const type = skip_typeref(orig_type);
7796 if (!is_type_pointer(type)) {
7797 if (is_type_valid(type)) {
7798 errorf(&expression->base.source_position,
7799 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
7804 type_t *result_type = type->pointer.points_to;
7805 result_type = automatic_type_conversion(result_type);
7806 expression->base.type = result_type;
7810 * Record that an address is taken (expression represents an lvalue).
7812 * @param expression the expression
7813 * @param may_be_register if true, the expression might be an register
7815 static void set_address_taken(expression_t *expression, bool may_be_register)
7817 if (expression->kind != EXPR_REFERENCE)
7820 entity_t *const entity = expression->reference.entity;
7822 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
7825 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
7826 && !may_be_register) {
7827 source_position_t const *const pos = &expression->base.source_position;
7828 errorf(pos, "address of register '%N' requested", entity);
7831 if (entity->kind == ENTITY_VARIABLE) {
7832 entity->variable.address_taken = true;
7834 assert(entity->kind == ENTITY_PARAMETER);
7835 entity->parameter.address_taken = true;
7840 * Check the semantic of the address taken expression.
7842 static void semantic_take_addr(unary_expression_t *expression)
7844 expression_t *value = expression->value;
7845 value->base.type = revert_automatic_type_conversion(value);
7847 type_t *orig_type = value->base.type;
7848 type_t *type = skip_typeref(orig_type);
7849 if (!is_type_valid(type))
7853 if (!is_lvalue(value)) {
7854 errorf(&expression->base.source_position, "'&' requires an lvalue");
7856 if (is_bitfield(value)) {
7857 errorf(&expression->base.source_position,
7858 "'&' not allowed on bitfield");
7861 set_address_taken(value, false);
7863 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
7866 #define CREATE_UNARY_EXPRESSION_PARSER(token_kind, unexpression_type, sfunc) \
7867 static expression_t *parse_##unexpression_type(void) \
7869 expression_t *unary_expression \
7870 = allocate_expression_zero(unexpression_type); \
7872 unary_expression->unary.value = parse_subexpression(PREC_UNARY); \
7874 sfunc(&unary_expression->unary); \
7876 return unary_expression; \
7879 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
7880 semantic_unexpr_arithmetic)
7881 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
7882 semantic_unexpr_plus)
7883 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
7885 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
7886 semantic_dereference)
7887 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
7889 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
7890 semantic_unexpr_integer)
7891 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
7893 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
7896 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_kind, unexpression_type, \
7898 static expression_t *parse_##unexpression_type(expression_t *left) \
7900 expression_t *unary_expression \
7901 = allocate_expression_zero(unexpression_type); \
7903 unary_expression->unary.value = left; \
7905 sfunc(&unary_expression->unary); \
7907 return unary_expression; \
7910 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
7911 EXPR_UNARY_POSTFIX_INCREMENT,
7913 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
7914 EXPR_UNARY_POSTFIX_DECREMENT,
7917 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
7919 /* TODO: handle complex + imaginary types */
7921 type_left = get_unqualified_type(type_left);
7922 type_right = get_unqualified_type(type_right);
7924 /* §6.3.1.8 Usual arithmetic conversions */
7925 if (type_left == type_long_double || type_right == type_long_double) {
7926 return type_long_double;
7927 } else if (type_left == type_double || type_right == type_double) {
7929 } else if (type_left == type_float || type_right == type_float) {
7933 type_left = promote_integer(type_left);
7934 type_right = promote_integer(type_right);
7936 if (type_left == type_right)
7939 bool const signed_left = is_type_signed(type_left);
7940 bool const signed_right = is_type_signed(type_right);
7941 unsigned const rank_left = get_akind_rank(get_akind(type_left));
7942 unsigned const rank_right = get_akind_rank(get_akind(type_right));
7944 if (signed_left == signed_right)
7945 return rank_left >= rank_right ? type_left : type_right;
7949 atomic_type_kind_t s_akind;
7950 atomic_type_kind_t u_akind;
7955 u_type = type_right;
7957 s_type = type_right;
7960 s_akind = get_akind(s_type);
7961 u_akind = get_akind(u_type);
7962 s_rank = get_akind_rank(s_akind);
7963 u_rank = get_akind_rank(u_akind);
7965 if (u_rank >= s_rank)
7968 if (get_atomic_type_size(s_akind) > get_atomic_type_size(u_akind))
7972 case ATOMIC_TYPE_INT: return type_unsigned_int;
7973 case ATOMIC_TYPE_LONG: return type_unsigned_long;
7974 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
7976 default: panic("invalid atomic type");
7981 * Check the semantic restrictions for a binary expression.
7983 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
7985 expression_t *const left = expression->left;
7986 expression_t *const right = expression->right;
7987 type_t *const orig_type_left = left->base.type;
7988 type_t *const orig_type_right = right->base.type;
7989 type_t *const type_left = skip_typeref(orig_type_left);
7990 type_t *const type_right = skip_typeref(orig_type_right);
7992 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
7993 /* TODO: improve error message */
7994 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7995 errorf(&expression->base.source_position,
7996 "operation needs arithmetic types");
8001 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8002 expression->left = create_implicit_cast(left, arithmetic_type);
8003 expression->right = create_implicit_cast(right, arithmetic_type);
8004 expression->base.type = arithmetic_type;
8007 static void semantic_binexpr_integer(binary_expression_t *const expression)
8009 expression_t *const left = expression->left;
8010 expression_t *const right = expression->right;
8011 type_t *const orig_type_left = left->base.type;
8012 type_t *const orig_type_right = right->base.type;
8013 type_t *const type_left = skip_typeref(orig_type_left);
8014 type_t *const type_right = skip_typeref(orig_type_right);
8016 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8017 /* TODO: improve error message */
8018 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8019 errorf(&expression->base.source_position,
8020 "operation needs integer types");
8025 type_t *const result_type = semantic_arithmetic(type_left, type_right);
8026 expression->left = create_implicit_cast(left, result_type);
8027 expression->right = create_implicit_cast(right, result_type);
8028 expression->base.type = result_type;
8031 static void warn_div_by_zero(binary_expression_t const *const expression)
8033 if (!is_type_integer(expression->base.type))
8036 expression_t const *const right = expression->right;
8037 /* The type of the right operand can be different for /= */
8038 if (is_type_integer(right->base.type) &&
8039 is_constant_expression(right) == EXPR_CLASS_CONSTANT &&
8040 !fold_constant_to_bool(right)) {
8041 source_position_t const *const pos = &expression->base.source_position;
8042 warningf(WARN_DIV_BY_ZERO, pos, "division by zero");
8047 * Check the semantic restrictions for a div/mod expression.
8049 static void semantic_divmod_arithmetic(binary_expression_t *expression)
8051 semantic_binexpr_arithmetic(expression);
8052 warn_div_by_zero(expression);
8055 static void warn_addsub_in_shift(const expression_t *const expr)
8057 if (expr->base.parenthesized)
8061 switch (expr->kind) {
8062 case EXPR_BINARY_ADD: op = '+'; break;
8063 case EXPR_BINARY_SUB: op = '-'; break;
8067 source_position_t const *const pos = &expr->base.source_position;
8068 warningf(WARN_PARENTHESES, pos, "suggest parentheses around '%c' inside shift", op);
8071 static bool semantic_shift(binary_expression_t *expression)
8073 expression_t *const left = expression->left;
8074 expression_t *const right = expression->right;
8075 type_t *const orig_type_left = left->base.type;
8076 type_t *const orig_type_right = right->base.type;
8077 type_t * type_left = skip_typeref(orig_type_left);
8078 type_t * type_right = skip_typeref(orig_type_right);
8080 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8081 /* TODO: improve error message */
8082 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8083 errorf(&expression->base.source_position,
8084 "operands of shift operation must have integer types");
8089 type_left = promote_integer(type_left);
8091 if (is_constant_expression(right) == EXPR_CLASS_CONSTANT) {
8092 source_position_t const *const pos = &right->base.source_position;
8093 long const count = fold_constant_to_int(right);
8095 warningf(WARN_OTHER, pos, "shift count must be non-negative");
8096 } else if ((unsigned long)count >=
8097 get_atomic_type_size(type_left->atomic.akind) * 8) {
8098 warningf(WARN_OTHER, pos, "shift count must be less than type width");
8102 type_right = promote_integer(type_right);
8103 expression->right = create_implicit_cast(right, type_right);
8108 static void semantic_shift_op(binary_expression_t *expression)
8110 expression_t *const left = expression->left;
8111 expression_t *const right = expression->right;
8113 if (!semantic_shift(expression))
8116 warn_addsub_in_shift(left);
8117 warn_addsub_in_shift(right);
8119 type_t *const orig_type_left = left->base.type;
8120 type_t * type_left = skip_typeref(orig_type_left);
8122 type_left = promote_integer(type_left);
8123 expression->left = create_implicit_cast(left, type_left);
8124 expression->base.type = type_left;
8127 static void semantic_add(binary_expression_t *expression)
8129 expression_t *const left = expression->left;
8130 expression_t *const right = expression->right;
8131 type_t *const orig_type_left = left->base.type;
8132 type_t *const orig_type_right = right->base.type;
8133 type_t *const type_left = skip_typeref(orig_type_left);
8134 type_t *const type_right = skip_typeref(orig_type_right);
8137 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8138 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8139 expression->left = create_implicit_cast(left, arithmetic_type);
8140 expression->right = create_implicit_cast(right, arithmetic_type);
8141 expression->base.type = arithmetic_type;
8142 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8143 check_pointer_arithmetic(&expression->base.source_position,
8144 type_left, orig_type_left);
8145 expression->base.type = type_left;
8146 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8147 check_pointer_arithmetic(&expression->base.source_position,
8148 type_right, orig_type_right);
8149 expression->base.type = type_right;
8150 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8151 errorf(&expression->base.source_position,
8152 "invalid operands to binary + ('%T', '%T')",
8153 orig_type_left, orig_type_right);
8157 static void semantic_sub(binary_expression_t *expression)
8159 expression_t *const left = expression->left;
8160 expression_t *const right = expression->right;
8161 type_t *const orig_type_left = left->base.type;
8162 type_t *const orig_type_right = right->base.type;
8163 type_t *const type_left = skip_typeref(orig_type_left);
8164 type_t *const type_right = skip_typeref(orig_type_right);
8165 source_position_t const *const pos = &expression->base.source_position;
8168 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8169 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8170 expression->left = create_implicit_cast(left, arithmetic_type);
8171 expression->right = create_implicit_cast(right, arithmetic_type);
8172 expression->base.type = arithmetic_type;
8173 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8174 check_pointer_arithmetic(&expression->base.source_position,
8175 type_left, orig_type_left);
8176 expression->base.type = type_left;
8177 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8178 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
8179 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
8180 if (!types_compatible(unqual_left, unqual_right)) {
8182 "subtracting pointers to incompatible types '%T' and '%T'",
8183 orig_type_left, orig_type_right);
8184 } else if (!is_type_object(unqual_left)) {
8185 if (!is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
8186 errorf(pos, "subtracting pointers to non-object types '%T'",
8189 warningf(WARN_OTHER, pos, "subtracting pointers to void");
8192 expression->base.type = type_ptrdiff_t;
8193 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8194 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8195 orig_type_left, orig_type_right);
8199 static void warn_string_literal_address(expression_t const* expr)
8201 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8202 expr = expr->unary.value;
8203 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8205 expr = expr->unary.value;
8208 if (expr->kind == EXPR_STRING_LITERAL
8209 || expr->kind == EXPR_WIDE_STRING_LITERAL) {
8210 source_position_t const *const pos = &expr->base.source_position;
8211 warningf(WARN_ADDRESS, pos, "comparison with string literal results in unspecified behaviour");
8215 static bool maybe_negative(expression_t const *const expr)
8217 switch (is_constant_expression(expr)) {
8218 case EXPR_CLASS_ERROR: return false;
8219 case EXPR_CLASS_CONSTANT: return constant_is_negative(expr);
8220 default: return true;
8224 static void warn_comparison(source_position_t const *const pos, expression_t const *const expr, expression_t const *const other)
8226 warn_string_literal_address(expr);
8228 expression_t const* const ref = get_reference_address(expr);
8229 if (ref != NULL && is_null_pointer_constant(other)) {
8230 entity_t const *const ent = ref->reference.entity;
8231 warningf(WARN_ADDRESS, pos, "the address of '%N' will never be NULL", ent);
8234 if (!expr->base.parenthesized) {
8235 switch (expr->base.kind) {
8236 case EXPR_BINARY_LESS:
8237 case EXPR_BINARY_GREATER:
8238 case EXPR_BINARY_LESSEQUAL:
8239 case EXPR_BINARY_GREATEREQUAL:
8240 case EXPR_BINARY_NOTEQUAL:
8241 case EXPR_BINARY_EQUAL:
8242 warningf(WARN_PARENTHESES, pos, "comparisons like 'x <= y < z' do not have their mathematical meaning");
8251 * Check the semantics of comparison expressions.
8253 * @param expression The expression to check.
8255 static void semantic_comparison(binary_expression_t *expression)
8257 source_position_t const *const pos = &expression->base.source_position;
8258 expression_t *const left = expression->left;
8259 expression_t *const right = expression->right;
8261 warn_comparison(pos, left, right);
8262 warn_comparison(pos, right, left);
8264 type_t *orig_type_left = left->base.type;
8265 type_t *orig_type_right = right->base.type;
8266 type_t *type_left = skip_typeref(orig_type_left);
8267 type_t *type_right = skip_typeref(orig_type_right);
8269 /* TODO non-arithmetic types */
8270 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8271 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8273 /* test for signed vs unsigned compares */
8274 if (is_type_integer(arithmetic_type)) {
8275 bool const signed_left = is_type_signed(type_left);
8276 bool const signed_right = is_type_signed(type_right);
8277 if (signed_left != signed_right) {
8278 /* FIXME long long needs better const folding magic */
8279 /* TODO check whether constant value can be represented by other type */
8280 if ((signed_left && maybe_negative(left)) ||
8281 (signed_right && maybe_negative(right))) {
8282 warningf(WARN_SIGN_COMPARE, pos, "comparison between signed and unsigned");
8287 expression->left = create_implicit_cast(left, arithmetic_type);
8288 expression->right = create_implicit_cast(right, arithmetic_type);
8289 expression->base.type = arithmetic_type;
8290 if ((expression->base.kind == EXPR_BINARY_EQUAL ||
8291 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8292 is_type_float(arithmetic_type)) {
8293 warningf(WARN_FLOAT_EQUAL, pos, "comparing floating point with == or != is unsafe");
8295 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8296 /* TODO check compatibility */
8297 } else if (is_type_pointer(type_left)) {
8298 expression->right = create_implicit_cast(right, type_left);
8299 } else if (is_type_pointer(type_right)) {
8300 expression->left = create_implicit_cast(left, type_right);
8301 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8302 type_error_incompatible("invalid operands in comparison", pos, type_left, type_right);
8304 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8308 * Checks if a compound type has constant fields.
8310 static bool has_const_fields(const compound_type_t *type)
8312 compound_t *compound = type->compound;
8313 entity_t *entry = compound->members.entities;
8315 for (; entry != NULL; entry = entry->base.next) {
8316 if (!is_declaration(entry))
8319 const type_t *decl_type = skip_typeref(entry->declaration.type);
8320 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8327 static bool is_valid_assignment_lhs(expression_t const* const left)
8329 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8330 type_t *const type_left = skip_typeref(orig_type_left);
8332 if (!is_lvalue(left)) {
8333 errorf(&left->base.source_position, "left hand side '%E' of assignment is not an lvalue",
8338 if (left->kind == EXPR_REFERENCE
8339 && left->reference.entity->kind == ENTITY_FUNCTION) {
8340 errorf(&left->base.source_position, "cannot assign to function '%E'", left);
8344 if (is_type_array(type_left)) {
8345 errorf(&left->base.source_position, "cannot assign to array '%E'", left);
8348 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8349 errorf(&left->base.source_position, "assignment to read-only location '%E' (type '%T')", left,
8353 if (is_type_incomplete(type_left)) {
8354 errorf(&left->base.source_position, "left-hand side '%E' of assignment has incomplete type '%T'",
8355 left, orig_type_left);
8358 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8359 errorf(&left->base.source_position, "cannot assign to '%E' because compound type '%T' has read-only fields",
8360 left, orig_type_left);
8367 static void semantic_arithmetic_assign(binary_expression_t *expression)
8369 expression_t *left = expression->left;
8370 expression_t *right = expression->right;
8371 type_t *orig_type_left = left->base.type;
8372 type_t *orig_type_right = right->base.type;
8374 if (!is_valid_assignment_lhs(left))
8377 type_t *type_left = skip_typeref(orig_type_left);
8378 type_t *type_right = skip_typeref(orig_type_right);
8380 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8381 /* TODO: improve error message */
8382 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8383 errorf(&expression->base.source_position,
8384 "operation needs arithmetic types");
8389 /* combined instructions are tricky. We can't create an implicit cast on
8390 * the left side, because we need the uncasted form for the store.
8391 * The ast2firm pass has to know that left_type must be right_type
8392 * for the arithmetic operation and create a cast by itself */
8393 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8394 expression->right = create_implicit_cast(right, arithmetic_type);
8395 expression->base.type = type_left;
8398 static void semantic_divmod_assign(binary_expression_t *expression)
8400 semantic_arithmetic_assign(expression);
8401 warn_div_by_zero(expression);
8404 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8406 expression_t *const left = expression->left;
8407 expression_t *const right = expression->right;
8408 type_t *const orig_type_left = left->base.type;
8409 type_t *const orig_type_right = right->base.type;
8410 type_t *const type_left = skip_typeref(orig_type_left);
8411 type_t *const type_right = skip_typeref(orig_type_right);
8413 if (!is_valid_assignment_lhs(left))
8416 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8417 /* combined instructions are tricky. We can't create an implicit cast on
8418 * the left side, because we need the uncasted form for the store.
8419 * The ast2firm pass has to know that left_type must be right_type
8420 * for the arithmetic operation and create a cast by itself */
8421 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8422 expression->right = create_implicit_cast(right, arithmetic_type);
8423 expression->base.type = type_left;
8424 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8425 check_pointer_arithmetic(&expression->base.source_position,
8426 type_left, orig_type_left);
8427 expression->base.type = type_left;
8428 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8429 errorf(&expression->base.source_position,
8430 "incompatible types '%T' and '%T' in assignment",
8431 orig_type_left, orig_type_right);
8435 static void semantic_integer_assign(binary_expression_t *expression)
8437 expression_t *left = expression->left;
8438 expression_t *right = expression->right;
8439 type_t *orig_type_left = left->base.type;
8440 type_t *orig_type_right = right->base.type;
8442 if (!is_valid_assignment_lhs(left))
8445 type_t *type_left = skip_typeref(orig_type_left);
8446 type_t *type_right = skip_typeref(orig_type_right);
8448 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8449 /* TODO: improve error message */
8450 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8451 errorf(&expression->base.source_position,
8452 "operation needs integer types");
8457 /* combined instructions are tricky. We can't create an implicit cast on
8458 * the left side, because we need the uncasted form for the store.
8459 * The ast2firm pass has to know that left_type must be right_type
8460 * for the arithmetic operation and create a cast by itself */
8461 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8462 expression->right = create_implicit_cast(right, arithmetic_type);
8463 expression->base.type = type_left;
8466 static void semantic_shift_assign(binary_expression_t *expression)
8468 expression_t *left = expression->left;
8470 if (!is_valid_assignment_lhs(left))
8473 if (!semantic_shift(expression))
8476 expression->base.type = skip_typeref(left->base.type);
8479 static void warn_logical_and_within_or(const expression_t *const expr)
8481 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8483 if (expr->base.parenthesized)
8485 source_position_t const *const pos = &expr->base.source_position;
8486 warningf(WARN_PARENTHESES, pos, "suggest parentheses around && within ||");
8490 * Check the semantic restrictions of a logical expression.
8492 static void semantic_logical_op(binary_expression_t *expression)
8494 /* §6.5.13:2 Each of the operands shall have scalar type.
8495 * §6.5.14:2 Each of the operands shall have scalar type. */
8496 semantic_condition(expression->left, "left operand of logical operator");
8497 semantic_condition(expression->right, "right operand of logical operator");
8498 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR) {
8499 warn_logical_and_within_or(expression->left);
8500 warn_logical_and_within_or(expression->right);
8502 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8506 * Check the semantic restrictions of a binary assign expression.
8508 static void semantic_binexpr_assign(binary_expression_t *expression)
8510 expression_t *left = expression->left;
8511 type_t *orig_type_left = left->base.type;
8513 if (!is_valid_assignment_lhs(left))
8516 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8517 report_assign_error(error, orig_type_left, expression->right,
8518 "assignment", &left->base.source_position);
8519 expression->right = create_implicit_cast(expression->right, orig_type_left);
8520 expression->base.type = orig_type_left;
8524 * Determine if the outermost operation (or parts thereof) of the given
8525 * expression has no effect in order to generate a warning about this fact.
8526 * Therefore in some cases this only examines some of the operands of the
8527 * expression (see comments in the function and examples below).
8529 * f() + 23; // warning, because + has no effect
8530 * x || f(); // no warning, because x controls execution of f()
8531 * x ? y : f(); // warning, because y has no effect
8532 * (void)x; // no warning to be able to suppress the warning
8533 * This function can NOT be used for an "expression has definitely no effect"-
8535 static bool expression_has_effect(const expression_t *const expr)
8537 switch (expr->kind) {
8538 case EXPR_ERROR: return true; /* do NOT warn */
8539 case EXPR_REFERENCE: return false;
8540 case EXPR_REFERENCE_ENUM_VALUE: return false;
8541 case EXPR_LABEL_ADDRESS: return false;
8543 /* suppress the warning for microsoft __noop operations */
8544 case EXPR_LITERAL_MS_NOOP: return true;
8545 case EXPR_LITERAL_BOOLEAN:
8546 case EXPR_LITERAL_CHARACTER:
8547 case EXPR_LITERAL_WIDE_CHARACTER:
8548 case EXPR_LITERAL_INTEGER:
8549 case EXPR_LITERAL_INTEGER_OCTAL:
8550 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
8551 case EXPR_LITERAL_FLOATINGPOINT:
8552 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: return false;
8553 case EXPR_STRING_LITERAL: return false;
8554 case EXPR_WIDE_STRING_LITERAL: return false;
8557 const call_expression_t *const call = &expr->call;
8558 if (call->function->kind != EXPR_REFERENCE)
8561 switch (call->function->reference.entity->function.btk) {
8562 /* FIXME: which builtins have no effect? */
8563 default: return true;
8567 /* Generate the warning if either the left or right hand side of a
8568 * conditional expression has no effect */
8569 case EXPR_CONDITIONAL: {
8570 conditional_expression_t const *const cond = &expr->conditional;
8571 expression_t const *const t = cond->true_expression;
8573 (t == NULL || expression_has_effect(t)) &&
8574 expression_has_effect(cond->false_expression);
8577 case EXPR_SELECT: return false;
8578 case EXPR_ARRAY_ACCESS: return false;
8579 case EXPR_SIZEOF: return false;
8580 case EXPR_CLASSIFY_TYPE: return false;
8581 case EXPR_ALIGNOF: return false;
8583 case EXPR_FUNCNAME: return false;
8584 case EXPR_BUILTIN_CONSTANT_P: return false;
8585 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8586 case EXPR_OFFSETOF: return false;
8587 case EXPR_VA_START: return true;
8588 case EXPR_VA_ARG: return true;
8589 case EXPR_VA_COPY: return true;
8590 case EXPR_STATEMENT: return true; // TODO
8591 case EXPR_COMPOUND_LITERAL: return false;
8593 case EXPR_UNARY_NEGATE: return false;
8594 case EXPR_UNARY_PLUS: return false;
8595 case EXPR_UNARY_BITWISE_NEGATE: return false;
8596 case EXPR_UNARY_NOT: return false;
8597 case EXPR_UNARY_DEREFERENCE: return false;
8598 case EXPR_UNARY_TAKE_ADDRESS: return false;
8599 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8600 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8601 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8602 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8604 /* Treat void casts as if they have an effect in order to being able to
8605 * suppress the warning */
8606 case EXPR_UNARY_CAST: {
8607 type_t *const type = skip_typeref(expr->base.type);
8608 return is_type_atomic(type, ATOMIC_TYPE_VOID);
8611 case EXPR_UNARY_ASSUME: return true;
8612 case EXPR_UNARY_DELETE: return true;
8613 case EXPR_UNARY_DELETE_ARRAY: return true;
8614 case EXPR_UNARY_THROW: return true;
8616 case EXPR_BINARY_ADD: return false;
8617 case EXPR_BINARY_SUB: return false;
8618 case EXPR_BINARY_MUL: return false;
8619 case EXPR_BINARY_DIV: return false;
8620 case EXPR_BINARY_MOD: return false;
8621 case EXPR_BINARY_EQUAL: return false;
8622 case EXPR_BINARY_NOTEQUAL: return false;
8623 case EXPR_BINARY_LESS: return false;
8624 case EXPR_BINARY_LESSEQUAL: return false;
8625 case EXPR_BINARY_GREATER: return false;
8626 case EXPR_BINARY_GREATEREQUAL: return false;
8627 case EXPR_BINARY_BITWISE_AND: return false;
8628 case EXPR_BINARY_BITWISE_OR: return false;
8629 case EXPR_BINARY_BITWISE_XOR: return false;
8630 case EXPR_BINARY_SHIFTLEFT: return false;
8631 case EXPR_BINARY_SHIFTRIGHT: return false;
8632 case EXPR_BINARY_ASSIGN: return true;
8633 case EXPR_BINARY_MUL_ASSIGN: return true;
8634 case EXPR_BINARY_DIV_ASSIGN: return true;
8635 case EXPR_BINARY_MOD_ASSIGN: return true;
8636 case EXPR_BINARY_ADD_ASSIGN: return true;
8637 case EXPR_BINARY_SUB_ASSIGN: return true;
8638 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8639 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8640 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8641 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8642 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8644 /* Only examine the right hand side of && and ||, because the left hand
8645 * side already has the effect of controlling the execution of the right
8647 case EXPR_BINARY_LOGICAL_AND:
8648 case EXPR_BINARY_LOGICAL_OR:
8649 /* Only examine the right hand side of a comma expression, because the left
8650 * hand side has a separate warning */
8651 case EXPR_BINARY_COMMA:
8652 return expression_has_effect(expr->binary.right);
8654 case EXPR_BINARY_ISGREATER: return false;
8655 case EXPR_BINARY_ISGREATEREQUAL: return false;
8656 case EXPR_BINARY_ISLESS: return false;
8657 case EXPR_BINARY_ISLESSEQUAL: return false;
8658 case EXPR_BINARY_ISLESSGREATER: return false;
8659 case EXPR_BINARY_ISUNORDERED: return false;
8662 internal_errorf(HERE, "unexpected expression");
8665 static void semantic_comma(binary_expression_t *expression)
8667 const expression_t *const left = expression->left;
8668 if (!expression_has_effect(left)) {
8669 source_position_t const *const pos = &left->base.source_position;
8670 warningf(WARN_UNUSED_VALUE, pos, "left-hand operand of comma expression has no effect");
8672 expression->base.type = expression->right->base.type;
8676 * @param prec_r precedence of the right operand
8678 #define CREATE_BINEXPR_PARSER(token_kind, binexpression_type, prec_r, sfunc) \
8679 static expression_t *parse_##binexpression_type(expression_t *left) \
8681 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8682 binexpr->binary.left = left; \
8685 expression_t *right = parse_subexpression(prec_r); \
8687 binexpr->binary.right = right; \
8688 sfunc(&binexpr->binary); \
8693 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8694 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
8695 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
8696 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8697 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8698 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8699 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8700 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
8701 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
8702 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
8703 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
8704 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
8705 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
8706 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_integer)
8707 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_integer)
8708 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_integer)
8709 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8710 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8711 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
8712 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8713 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8714 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8715 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8716 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8717 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8718 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8719 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8720 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8721 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8722 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
8725 static expression_t *parse_subexpression(precedence_t precedence)
8727 if (token.kind < 0) {
8728 return expected_expression_error();
8731 expression_parser_function_t *parser
8732 = &expression_parsers[token.kind];
8735 if (parser->parser != NULL) {
8736 left = parser->parser();
8738 left = parse_primary_expression();
8740 assert(left != NULL);
8743 if (token.kind < 0) {
8744 return expected_expression_error();
8747 parser = &expression_parsers[token.kind];
8748 if (parser->infix_parser == NULL)
8750 if (parser->infix_precedence < precedence)
8753 left = parser->infix_parser(left);
8755 assert(left != NULL);
8762 * Parse an expression.
8764 static expression_t *parse_expression(void)
8766 return parse_subexpression(PREC_EXPRESSION);
8770 * Register a parser for a prefix-like operator.
8772 * @param parser the parser function
8773 * @param token_kind the token type of the prefix token
8775 static void register_expression_parser(parse_expression_function parser,
8778 expression_parser_function_t *entry = &expression_parsers[token_kind];
8780 if (entry->parser != NULL) {
8781 diagnosticf("for token '%k'\n", (token_kind_t)token_kind);
8782 panic("trying to register multiple expression parsers for a token");
8784 entry->parser = parser;
8788 * Register a parser for an infix operator with given precedence.
8790 * @param parser the parser function
8791 * @param token_kind the token type of the infix operator
8792 * @param precedence the precedence of the operator
8794 static void register_infix_parser(parse_expression_infix_function parser,
8795 int token_kind, precedence_t precedence)
8797 expression_parser_function_t *entry = &expression_parsers[token_kind];
8799 if (entry->infix_parser != NULL) {
8800 diagnosticf("for token '%k'\n", (token_kind_t)token_kind);
8801 panic("trying to register multiple infix expression parsers for a "
8804 entry->infix_parser = parser;
8805 entry->infix_precedence = precedence;
8809 * Initialize the expression parsers.
8811 static void init_expression_parsers(void)
8813 memset(&expression_parsers, 0, sizeof(expression_parsers));
8815 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
8816 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
8817 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
8818 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
8819 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
8820 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
8821 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
8822 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
8823 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
8824 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
8825 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
8826 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
8827 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
8828 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
8829 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
8830 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
8831 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
8832 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
8833 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
8834 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
8835 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
8836 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
8837 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
8838 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
8839 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
8840 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
8841 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
8842 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
8843 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
8844 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
8845 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
8846 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
8847 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
8848 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
8849 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
8850 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
8851 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
8853 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
8854 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
8855 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
8856 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
8857 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
8858 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
8859 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
8860 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
8861 register_expression_parser(parse_sizeof, T_sizeof);
8862 register_expression_parser(parse_alignof, T___alignof__);
8863 register_expression_parser(parse_extension, T___extension__);
8864 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
8865 register_expression_parser(parse_delete, T_delete);
8866 register_expression_parser(parse_throw, T_throw);
8870 * Parse a asm statement arguments specification.
8872 static asm_argument_t *parse_asm_arguments(bool is_out)
8874 asm_argument_t *result = NULL;
8875 asm_argument_t **anchor = &result;
8877 while (token.kind == T_STRING_LITERAL || token.kind == '[') {
8878 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
8879 memset(argument, 0, sizeof(argument[0]));
8882 if (token.kind != T_IDENTIFIER) {
8883 parse_error_expected("while parsing asm argument",
8884 T_IDENTIFIER, NULL);
8887 argument->symbol = token.identifier.symbol;
8889 expect(']', end_error);
8892 argument->constraints = parse_string_literals();
8893 expect('(', end_error);
8894 add_anchor_token(')');
8895 expression_t *expression = parse_expression();
8896 rem_anchor_token(')');
8898 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
8899 * change size or type representation (e.g. int -> long is ok, but
8900 * int -> float is not) */
8901 if (expression->kind == EXPR_UNARY_CAST) {
8902 type_t *const type = expression->base.type;
8903 type_kind_t const kind = type->kind;
8904 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
8907 if (kind == TYPE_ATOMIC) {
8908 atomic_type_kind_t const akind = type->atomic.akind;
8909 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8910 size = get_atomic_type_size(akind);
8912 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8913 size = get_type_size(type_void_ptr);
8917 expression_t *const value = expression->unary.value;
8918 type_t *const value_type = value->base.type;
8919 type_kind_t const value_kind = value_type->kind;
8921 unsigned value_flags;
8922 unsigned value_size;
8923 if (value_kind == TYPE_ATOMIC) {
8924 atomic_type_kind_t const value_akind = value_type->atomic.akind;
8925 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8926 value_size = get_atomic_type_size(value_akind);
8927 } else if (value_kind == TYPE_POINTER) {
8928 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8929 value_size = get_type_size(type_void_ptr);
8934 if (value_flags != flags || value_size != size)
8938 } while (expression->kind == EXPR_UNARY_CAST);
8942 if (!is_lvalue(expression)) {
8943 errorf(&expression->base.source_position,
8944 "asm output argument is not an lvalue");
8947 if (argument->constraints.begin[0] == '=')
8948 determine_lhs_ent(expression, NULL);
8950 mark_vars_read(expression, NULL);
8952 mark_vars_read(expression, NULL);
8954 argument->expression = expression;
8955 expect(')', end_error);
8957 set_address_taken(expression, true);
8960 anchor = &argument->next;
8972 * Parse a asm statement clobber specification.
8974 static asm_clobber_t *parse_asm_clobbers(void)
8976 asm_clobber_t *result = NULL;
8977 asm_clobber_t **anchor = &result;
8979 while (token.kind == T_STRING_LITERAL) {
8980 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
8981 clobber->clobber = parse_string_literals();
8984 anchor = &clobber->next;
8994 * Parse an asm statement.
8996 static statement_t *parse_asm_statement(void)
8998 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
8999 asm_statement_t *asm_statement = &statement->asms;
9003 if (next_if(T_volatile))
9004 asm_statement->is_volatile = true;
9006 expect('(', end_error);
9007 add_anchor_token(')');
9008 if (token.kind != T_STRING_LITERAL) {
9009 parse_error_expected("after asm(", T_STRING_LITERAL, NULL);
9012 asm_statement->asm_text = parse_string_literals();
9014 add_anchor_token(':');
9015 if (!next_if(':')) {
9016 rem_anchor_token(':');
9020 asm_statement->outputs = parse_asm_arguments(true);
9021 if (!next_if(':')) {
9022 rem_anchor_token(':');
9026 asm_statement->inputs = parse_asm_arguments(false);
9027 if (!next_if(':')) {
9028 rem_anchor_token(':');
9031 rem_anchor_token(':');
9033 asm_statement->clobbers = parse_asm_clobbers();
9036 rem_anchor_token(')');
9037 expect(')', end_error);
9038 expect(';', end_error);
9040 if (asm_statement->outputs == NULL) {
9041 /* GCC: An 'asm' instruction without any output operands will be treated
9042 * identically to a volatile 'asm' instruction. */
9043 asm_statement->is_volatile = true;
9048 return create_error_statement();
9051 static statement_t *parse_label_inner_statement(statement_t const *const label, char const *const label_kind)
9053 statement_t *inner_stmt;
9054 switch (token.kind) {
9056 errorf(&label->base.source_position, "%s at end of compound statement", label_kind);
9057 inner_stmt = create_error_statement();
9061 if (label->kind == STATEMENT_LABEL) {
9062 /* Eat an empty statement here, to avoid the warning about an empty
9063 * statement after a label. label:; is commonly used to have a label
9064 * before a closing brace. */
9065 inner_stmt = create_empty_statement();
9072 inner_stmt = parse_statement();
9073 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
9074 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
9075 if (inner_stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
9076 errorf(&inner_stmt->base.source_position, "declaration after %s", label_kind);
9084 * Parse a case statement.
9086 static statement_t *parse_case_statement(void)
9088 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9089 source_position_t *const pos = &statement->base.source_position;
9093 expression_t *const expression = parse_expression();
9094 statement->case_label.expression = expression;
9095 expression_classification_t const expr_class = is_constant_expression(expression);
9096 if (expr_class != EXPR_CLASS_CONSTANT) {
9097 if (expr_class != EXPR_CLASS_ERROR) {
9098 errorf(pos, "case label does not reduce to an integer constant");
9100 statement->case_label.is_bad = true;
9102 long const val = fold_constant_to_int(expression);
9103 statement->case_label.first_case = val;
9104 statement->case_label.last_case = val;
9108 if (next_if(T_DOTDOTDOT)) {
9109 expression_t *const end_range = parse_expression();
9110 statement->case_label.end_range = end_range;
9111 expression_classification_t const end_class = is_constant_expression(end_range);
9112 if (end_class != EXPR_CLASS_CONSTANT) {
9113 if (end_class != EXPR_CLASS_ERROR) {
9114 errorf(pos, "case range does not reduce to an integer constant");
9116 statement->case_label.is_bad = true;
9118 long const val = fold_constant_to_int(end_range);
9119 statement->case_label.last_case = val;
9121 if (val < statement->case_label.first_case) {
9122 statement->case_label.is_empty_range = true;
9123 warningf(WARN_OTHER, pos, "empty range specified");
9129 PUSH_PARENT(statement);
9131 expect(':', end_error);
9134 if (current_switch != NULL) {
9135 if (! statement->case_label.is_bad) {
9136 /* Check for duplicate case values */
9137 case_label_statement_t *c = &statement->case_label;
9138 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9139 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9142 if (c->last_case < l->first_case || c->first_case > l->last_case)
9145 errorf(pos, "duplicate case value (previously used %P)",
9146 &l->base.source_position);
9150 /* link all cases into the switch statement */
9151 if (current_switch->last_case == NULL) {
9152 current_switch->first_case = &statement->case_label;
9154 current_switch->last_case->next = &statement->case_label;
9156 current_switch->last_case = &statement->case_label;
9158 errorf(pos, "case label not within a switch statement");
9161 statement->case_label.statement = parse_label_inner_statement(statement, "case label");
9168 * Parse a default statement.
9170 static statement_t *parse_default_statement(void)
9172 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9176 PUSH_PARENT(statement);
9178 expect(':', end_error);
9181 if (current_switch != NULL) {
9182 const case_label_statement_t *def_label = current_switch->default_label;
9183 if (def_label != NULL) {
9184 errorf(&statement->base.source_position, "multiple default labels in one switch (previous declared %P)", &def_label->base.source_position);
9186 current_switch->default_label = &statement->case_label;
9188 /* link all cases into the switch statement */
9189 if (current_switch->last_case == NULL) {
9190 current_switch->first_case = &statement->case_label;
9192 current_switch->last_case->next = &statement->case_label;
9194 current_switch->last_case = &statement->case_label;
9197 errorf(&statement->base.source_position,
9198 "'default' label not within a switch statement");
9201 statement->case_label.statement = parse_label_inner_statement(statement, "default label");
9208 * Parse a label statement.
9210 static statement_t *parse_label_statement(void)
9212 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9213 label_t *const label = get_label();
9214 statement->label.label = label;
9216 PUSH_PARENT(statement);
9218 /* if statement is already set then the label is defined twice,
9219 * otherwise it was just mentioned in a goto/local label declaration so far
9221 source_position_t const* const pos = &statement->base.source_position;
9222 if (label->statement != NULL) {
9223 errorf(pos, "duplicate '%N' (declared %P)", (entity_t const*)label, &label->base.source_position);
9225 label->base.source_position = *pos;
9226 label->statement = statement;
9231 if (token.kind == T___attribute__ && !(c_mode & _CXX)) {
9232 parse_attributes(NULL); // TODO process attributes
9235 statement->label.statement = parse_label_inner_statement(statement, "label");
9237 /* remember the labels in a list for later checking */
9238 *label_anchor = &statement->label;
9239 label_anchor = &statement->label.next;
9245 static statement_t *parse_inner_statement(void)
9247 statement_t *const stmt = parse_statement();
9248 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
9249 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
9250 if (stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
9251 errorf(&stmt->base.source_position, "declaration as inner statement, use {}");
9257 * Parse an if statement.
9259 static statement_t *parse_if(void)
9261 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9265 PUSH_PARENT(statement);
9267 add_anchor_token('{');
9269 expect('(', end_error);
9270 add_anchor_token(')');
9271 expression_t *const expr = parse_expression();
9272 statement->ifs.condition = expr;
9273 /* §6.8.4.1:1 The controlling expression of an if statement shall have
9275 semantic_condition(expr, "condition of 'if'-statment");
9276 mark_vars_read(expr, NULL);
9277 rem_anchor_token(')');
9278 expect(')', end_error);
9281 rem_anchor_token('{');
9283 add_anchor_token(T_else);
9284 statement_t *const true_stmt = parse_inner_statement();
9285 statement->ifs.true_statement = true_stmt;
9286 rem_anchor_token(T_else);
9288 if (true_stmt->kind == STATEMENT_EMPTY) {
9289 warningf(WARN_EMPTY_BODY, HERE,
9290 "suggest braces around empty body in an ‘if’ statement");
9293 if (next_if(T_else)) {
9294 statement->ifs.false_statement = parse_inner_statement();
9296 if (statement->ifs.false_statement->kind == STATEMENT_EMPTY) {
9297 warningf(WARN_EMPTY_BODY, HERE,
9298 "suggest braces around empty body in an ‘if’ statement");
9300 } else if (true_stmt->kind == STATEMENT_IF &&
9301 true_stmt->ifs.false_statement != NULL) {
9302 source_position_t const *const pos = &true_stmt->base.source_position;
9303 warningf(WARN_PARENTHESES, pos, "suggest explicit braces to avoid ambiguous 'else'");
9311 * Check that all enums are handled in a switch.
9313 * @param statement the switch statement to check
9315 static void check_enum_cases(const switch_statement_t *statement)
9317 if (!is_warn_on(WARN_SWITCH_ENUM))
9319 const type_t *type = skip_typeref(statement->expression->base.type);
9320 if (! is_type_enum(type))
9322 const enum_type_t *enumt = &type->enumt;
9324 /* if we have a default, no warnings */
9325 if (statement->default_label != NULL)
9328 /* FIXME: calculation of value should be done while parsing */
9329 /* TODO: quadratic algorithm here. Change to an n log n one */
9330 long last_value = -1;
9331 const entity_t *entry = enumt->enume->base.next;
9332 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9333 entry = entry->base.next) {
9334 const expression_t *expression = entry->enum_value.value;
9335 long value = expression != NULL ? fold_constant_to_int(expression) : last_value + 1;
9337 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9338 if (l->expression == NULL)
9340 if (l->first_case <= value && value <= l->last_case) {
9346 source_position_t const *const pos = &statement->base.source_position;
9347 warningf(WARN_SWITCH_ENUM, pos, "'%N' not handled in switch", entry);
9354 * Parse a switch statement.
9356 static statement_t *parse_switch(void)
9358 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9362 PUSH_PARENT(statement);
9364 expect('(', end_error);
9365 add_anchor_token(')');
9366 expression_t *const expr = parse_expression();
9367 mark_vars_read(expr, NULL);
9368 type_t * type = skip_typeref(expr->base.type);
9369 if (is_type_integer(type)) {
9370 type = promote_integer(type);
9371 if (get_akind_rank(get_akind(type)) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9372 warningf(WARN_TRADITIONAL, &expr->base.source_position, "'%T' switch expression not converted to '%T' in ISO C", type, type_int);
9374 } else if (is_type_valid(type)) {
9375 errorf(&expr->base.source_position,
9376 "switch quantity is not an integer, but '%T'", type);
9377 type = type_error_type;
9379 statement->switchs.expression = create_implicit_cast(expr, type);
9380 expect(')', end_error);
9381 rem_anchor_token(')');
9383 switch_statement_t *rem = current_switch;
9384 current_switch = &statement->switchs;
9385 statement->switchs.body = parse_inner_statement();
9386 current_switch = rem;
9388 if (statement->switchs.default_label == NULL) {
9389 warningf(WARN_SWITCH_DEFAULT, &statement->base.source_position, "switch has no default case");
9391 check_enum_cases(&statement->switchs);
9397 return create_error_statement();
9400 static statement_t *parse_loop_body(statement_t *const loop)
9402 statement_t *const rem = current_loop;
9403 current_loop = loop;
9405 statement_t *const body = parse_inner_statement();
9412 * Parse a while statement.
9414 static statement_t *parse_while(void)
9416 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9420 PUSH_PARENT(statement);
9422 expect('(', end_error);
9423 add_anchor_token(')');
9424 expression_t *const cond = parse_expression();
9425 statement->whiles.condition = cond;
9426 /* §6.8.5:2 The controlling expression of an iteration statement shall
9427 * have scalar type. */
9428 semantic_condition(cond, "condition of 'while'-statement");
9429 mark_vars_read(cond, NULL);
9430 rem_anchor_token(')');
9431 expect(')', end_error);
9433 statement->whiles.body = parse_loop_body(statement);
9439 return create_error_statement();
9443 * Parse a do statement.
9445 static statement_t *parse_do(void)
9447 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9451 PUSH_PARENT(statement);
9453 add_anchor_token(T_while);
9454 statement->do_while.body = parse_loop_body(statement);
9455 rem_anchor_token(T_while);
9457 expect(T_while, end_error);
9458 expect('(', end_error);
9459 add_anchor_token(')');
9460 expression_t *const cond = parse_expression();
9461 statement->do_while.condition = cond;
9462 /* §6.8.5:2 The controlling expression of an iteration statement shall
9463 * have scalar type. */
9464 semantic_condition(cond, "condition of 'do-while'-statement");
9465 mark_vars_read(cond, NULL);
9466 rem_anchor_token(')');
9467 expect(')', end_error);
9468 expect(';', end_error);
9474 return create_error_statement();
9478 * Parse a for statement.
9480 static statement_t *parse_for(void)
9482 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9486 expect('(', end_error1);
9487 add_anchor_token(')');
9489 PUSH_PARENT(statement);
9490 PUSH_SCOPE(&statement->fors.scope);
9495 } else if (is_declaration_specifier(&token)) {
9496 parse_declaration(record_entity, DECL_FLAGS_NONE);
9498 add_anchor_token(';');
9499 expression_t *const init = parse_expression();
9500 statement->fors.initialisation = init;
9501 mark_vars_read(init, ENT_ANY);
9502 if (!expression_has_effect(init)) {
9503 warningf(WARN_UNUSED_VALUE, &init->base.source_position, "initialisation of 'for'-statement has no effect");
9505 rem_anchor_token(';');
9506 expect(';', end_error2);
9511 if (token.kind != ';') {
9512 add_anchor_token(';');
9513 expression_t *const cond = parse_expression();
9514 statement->fors.condition = cond;
9515 /* §6.8.5:2 The controlling expression of an iteration statement
9516 * shall have scalar type. */
9517 semantic_condition(cond, "condition of 'for'-statement");
9518 mark_vars_read(cond, NULL);
9519 rem_anchor_token(';');
9521 expect(';', end_error2);
9522 if (token.kind != ')') {
9523 expression_t *const step = parse_expression();
9524 statement->fors.step = step;
9525 mark_vars_read(step, ENT_ANY);
9526 if (!expression_has_effect(step)) {
9527 warningf(WARN_UNUSED_VALUE, &step->base.source_position, "step of 'for'-statement has no effect");
9530 expect(')', end_error2);
9531 rem_anchor_token(')');
9532 statement->fors.body = parse_loop_body(statement);
9540 rem_anchor_token(')');
9545 return create_error_statement();
9549 * Parse a goto statement.
9551 static statement_t *parse_goto(void)
9553 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
9556 if (GNU_MODE && next_if('*')) {
9557 expression_t *expression = parse_expression();
9558 mark_vars_read(expression, NULL);
9560 /* Argh: although documentation says the expression must be of type void*,
9561 * gcc accepts anything that can be casted into void* without error */
9562 type_t *type = expression->base.type;
9564 if (type != type_error_type) {
9565 if (!is_type_pointer(type) && !is_type_integer(type)) {
9566 errorf(&expression->base.source_position,
9567 "cannot convert to a pointer type");
9568 } else if (type != type_void_ptr) {
9569 warningf(WARN_OTHER, &expression->base.source_position, "type of computed goto expression should be 'void*' not '%T'", type);
9571 expression = create_implicit_cast(expression, type_void_ptr);
9574 statement->gotos.expression = expression;
9575 } else if (token.kind == T_IDENTIFIER) {
9576 label_t *const label = get_label();
9578 statement->gotos.label = label;
9581 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
9583 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
9585 return create_error_statement();
9588 /* remember the goto's in a list for later checking */
9589 *goto_anchor = &statement->gotos;
9590 goto_anchor = &statement->gotos.next;
9592 expect(';', end_error);
9599 * Parse a continue statement.
9601 static statement_t *parse_continue(void)
9603 if (current_loop == NULL) {
9604 errorf(HERE, "continue statement not within loop");
9607 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9610 expect(';', end_error);
9617 * Parse a break statement.
9619 static statement_t *parse_break(void)
9621 if (current_switch == NULL && current_loop == NULL) {
9622 errorf(HERE, "break statement not within loop or switch");
9625 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9628 expect(';', end_error);
9635 * Parse a __leave statement.
9637 static statement_t *parse_leave_statement(void)
9639 if (current_try == NULL) {
9640 errorf(HERE, "__leave statement not within __try");
9643 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9646 expect(';', end_error);
9653 * Check if a given entity represents a local variable.
9655 static bool is_local_variable(const entity_t *entity)
9657 if (entity->kind != ENTITY_VARIABLE)
9660 switch ((storage_class_tag_t) entity->declaration.storage_class) {
9661 case STORAGE_CLASS_AUTO:
9662 case STORAGE_CLASS_REGISTER: {
9663 const type_t *type = skip_typeref(entity->declaration.type);
9664 if (is_type_function(type)) {
9676 * Check if a given expression represents a local variable.
9678 static bool expression_is_local_variable(const expression_t *expression)
9680 if (expression->base.kind != EXPR_REFERENCE) {
9683 const entity_t *entity = expression->reference.entity;
9684 return is_local_variable(entity);
9688 * Check if a given expression represents a local variable and
9689 * return its declaration then, else return NULL.
9691 entity_t *expression_is_variable(const expression_t *expression)
9693 if (expression->base.kind != EXPR_REFERENCE) {
9696 entity_t *entity = expression->reference.entity;
9697 if (entity->kind != ENTITY_VARIABLE)
9704 * Parse a return statement.
9706 static statement_t *parse_return(void)
9708 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9711 expression_t *return_value = NULL;
9712 if (token.kind != ';') {
9713 return_value = parse_expression();
9714 mark_vars_read(return_value, NULL);
9717 const type_t *const func_type = skip_typeref(current_function->base.type);
9718 assert(is_type_function(func_type));
9719 type_t *const return_type = skip_typeref(func_type->function.return_type);
9721 source_position_t const *const pos = &statement->base.source_position;
9722 if (return_value != NULL) {
9723 type_t *return_value_type = skip_typeref(return_value->base.type);
9725 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
9726 if (is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
9727 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
9728 /* Only warn in C mode, because GCC does the same */
9729 if (c_mode & _CXX || strict_mode) {
9731 "'return' with a value, in function returning 'void'");
9733 warningf(WARN_OTHER, pos, "'return' with a value, in function returning 'void'");
9735 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9736 /* Only warn in C mode, because GCC does the same */
9739 "'return' with expression in function returning 'void'");
9741 warningf(WARN_OTHER, pos, "'return' with expression in function returning 'void'");
9745 assign_error_t error = semantic_assign(return_type, return_value);
9746 report_assign_error(error, return_type, return_value, "'return'",
9749 return_value = create_implicit_cast(return_value, return_type);
9750 /* check for returning address of a local var */
9751 if (return_value != NULL && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
9752 const expression_t *expression = return_value->unary.value;
9753 if (expression_is_local_variable(expression)) {
9754 warningf(WARN_OTHER, pos, "function returns address of local variable");
9757 } else if (!is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
9758 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9759 if (c_mode & _CXX || strict_mode) {
9761 "'return' without value, in function returning non-void");
9763 warningf(WARN_OTHER, pos, "'return' without value, in function returning non-void");
9766 statement->returns.value = return_value;
9768 expect(';', end_error);
9775 * Parse a declaration statement.
9777 static statement_t *parse_declaration_statement(void)
9779 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9781 entity_t *before = current_scope->last_entity;
9783 parse_external_declaration();
9785 parse_declaration(record_entity, DECL_FLAGS_NONE);
9788 declaration_statement_t *const decl = &statement->declaration;
9789 entity_t *const begin =
9790 before != NULL ? before->base.next : current_scope->entities;
9791 decl->declarations_begin = begin;
9792 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
9798 * Parse an expression statement, ie. expr ';'.
9800 static statement_t *parse_expression_statement(void)
9802 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
9804 expression_t *const expr = parse_expression();
9805 statement->expression.expression = expr;
9806 mark_vars_read(expr, ENT_ANY);
9808 expect(';', end_error);
9815 * Parse a microsoft __try { } __finally { } or
9816 * __try{ } __except() { }
9818 static statement_t *parse_ms_try_statment(void)
9820 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
9823 PUSH_PARENT(statement);
9825 ms_try_statement_t *rem = current_try;
9826 current_try = &statement->ms_try;
9827 statement->ms_try.try_statement = parse_compound_statement(false);
9832 if (next_if(T___except)) {
9833 expect('(', end_error);
9834 add_anchor_token(')');
9835 expression_t *const expr = parse_expression();
9836 mark_vars_read(expr, NULL);
9837 type_t * type = skip_typeref(expr->base.type);
9838 if (is_type_integer(type)) {
9839 type = promote_integer(type);
9840 } else if (is_type_valid(type)) {
9841 errorf(&expr->base.source_position,
9842 "__expect expression is not an integer, but '%T'", type);
9843 type = type_error_type;
9845 statement->ms_try.except_expression = create_implicit_cast(expr, type);
9846 rem_anchor_token(')');
9847 expect(')', end_error);
9848 statement->ms_try.final_statement = parse_compound_statement(false);
9849 } else if (next_if(T__finally)) {
9850 statement->ms_try.final_statement = parse_compound_statement(false);
9852 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
9853 return create_error_statement();
9857 return create_error_statement();
9860 static statement_t *parse_empty_statement(void)
9862 warningf(WARN_EMPTY_STATEMENT, HERE, "statement is empty");
9863 statement_t *const statement = create_empty_statement();
9868 static statement_t *parse_local_label_declaration(void)
9870 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9874 entity_t *begin = NULL;
9875 entity_t *end = NULL;
9876 entity_t **anchor = &begin;
9878 if (token.kind != T_IDENTIFIER) {
9879 parse_error_expected("while parsing local label declaration",
9880 T_IDENTIFIER, NULL);
9883 symbol_t *symbol = token.identifier.symbol;
9884 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
9885 if (entity != NULL && entity->base.parent_scope == current_scope) {
9886 source_position_t const *const ppos = &entity->base.source_position;
9887 errorf(HERE, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
9889 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL, NAMESPACE_LABEL, symbol);
9890 entity->base.parent_scope = current_scope;
9891 entity->base.source_position = token.base.source_position;
9894 anchor = &entity->base.next;
9897 environment_push(entity);
9900 } while (next_if(','));
9901 expect(';', end_error);
9903 statement->declaration.declarations_begin = begin;
9904 statement->declaration.declarations_end = end;
9908 static void parse_namespace_definition(void)
9912 entity_t *entity = NULL;
9913 symbol_t *symbol = NULL;
9915 if (token.kind == T_IDENTIFIER) {
9916 symbol = token.identifier.symbol;
9919 entity = get_entity(symbol, NAMESPACE_NORMAL);
9921 && entity->kind != ENTITY_NAMESPACE
9922 && entity->base.parent_scope == current_scope) {
9923 if (is_entity_valid(entity)) {
9924 error_redefined_as_different_kind(&token.base.source_position,
9925 entity, ENTITY_NAMESPACE);
9931 if (entity == NULL) {
9932 entity = allocate_entity_zero(ENTITY_NAMESPACE, NAMESPACE_NORMAL, symbol);
9933 entity->base.source_position = token.base.source_position;
9934 entity->base.parent_scope = current_scope;
9937 if (token.kind == '=') {
9938 /* TODO: parse namespace alias */
9939 panic("namespace alias definition not supported yet");
9942 environment_push(entity);
9943 append_entity(current_scope, entity);
9945 PUSH_SCOPE(&entity->namespacee.members);
9947 entity_t *old_current_entity = current_entity;
9948 current_entity = entity;
9950 expect('{', end_error);
9952 expect('}', end_error);
9955 assert(current_entity == entity);
9956 current_entity = old_current_entity;
9961 * Parse a statement.
9962 * There's also parse_statement() which additionally checks for
9963 * "statement has no effect" warnings
9965 static statement_t *intern_parse_statement(void)
9967 statement_t *statement = NULL;
9969 /* declaration or statement */
9970 add_anchor_token(';');
9971 switch (token.kind) {
9972 case T_IDENTIFIER: {
9973 token_kind_t la1_type = (token_kind_t)look_ahead(1)->kind;
9974 if (la1_type == ':') {
9975 statement = parse_label_statement();
9976 } else if (is_typedef_symbol(token.identifier.symbol)) {
9977 statement = parse_declaration_statement();
9979 /* it's an identifier, the grammar says this must be an
9980 * expression statement. However it is common that users mistype
9981 * declaration types, so we guess a bit here to improve robustness
9982 * for incorrect programs */
9986 if (get_entity(token.identifier.symbol, NAMESPACE_NORMAL) != NULL) {
9988 statement = parse_expression_statement();
9992 statement = parse_declaration_statement();
10000 case T___extension__: {
10001 /* This can be a prefix to a declaration or an expression statement.
10002 * We simply eat it now and parse the rest with tail recursion. */
10004 statement = intern_parse_statement();
10010 statement = parse_declaration_statement();
10014 statement = parse_local_label_declaration();
10017 case ';': statement = parse_empty_statement(); break;
10018 case '{': statement = parse_compound_statement(false); break;
10019 case T___leave: statement = parse_leave_statement(); break;
10020 case T___try: statement = parse_ms_try_statment(); break;
10021 case T_asm: statement = parse_asm_statement(); break;
10022 case T_break: statement = parse_break(); break;
10023 case T_case: statement = parse_case_statement(); break;
10024 case T_continue: statement = parse_continue(); break;
10025 case T_default: statement = parse_default_statement(); break;
10026 case T_do: statement = parse_do(); break;
10027 case T_for: statement = parse_for(); break;
10028 case T_goto: statement = parse_goto(); break;
10029 case T_if: statement = parse_if(); break;
10030 case T_return: statement = parse_return(); break;
10031 case T_switch: statement = parse_switch(); break;
10032 case T_while: statement = parse_while(); break;
10035 statement = parse_expression_statement();
10039 errorf(HERE, "unexpected token %K while parsing statement", &token);
10040 statement = create_error_statement();
10045 rem_anchor_token(';');
10047 assert(statement != NULL
10048 && statement->base.source_position.input_name != NULL);
10054 * parse a statement and emits "statement has no effect" warning if needed
10055 * (This is really a wrapper around intern_parse_statement with check for 1
10056 * single warning. It is needed, because for statement expressions we have
10057 * to avoid the warning on the last statement)
10059 static statement_t *parse_statement(void)
10061 statement_t *statement = intern_parse_statement();
10063 if (statement->kind == STATEMENT_EXPRESSION) {
10064 expression_t *expression = statement->expression.expression;
10065 if (!expression_has_effect(expression)) {
10066 warningf(WARN_UNUSED_VALUE, &expression->base.source_position, "statement has no effect");
10074 * Parse a compound statement.
10076 static statement_t *parse_compound_statement(bool inside_expression_statement)
10078 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
10080 PUSH_PARENT(statement);
10081 PUSH_SCOPE(&statement->compound.scope);
10084 add_anchor_token('}');
10085 /* tokens, which can start a statement */
10086 /* TODO MS, __builtin_FOO */
10087 add_anchor_token('!');
10088 add_anchor_token('&');
10089 add_anchor_token('(');
10090 add_anchor_token('*');
10091 add_anchor_token('+');
10092 add_anchor_token('-');
10093 add_anchor_token('{');
10094 add_anchor_token('~');
10095 add_anchor_token(T_CHARACTER_CONSTANT);
10096 add_anchor_token(T_COLONCOLON);
10097 add_anchor_token(T_FLOATINGPOINT);
10098 add_anchor_token(T_IDENTIFIER);
10099 add_anchor_token(T_INTEGER);
10100 add_anchor_token(T_MINUSMINUS);
10101 add_anchor_token(T_PLUSPLUS);
10102 add_anchor_token(T_STRING_LITERAL);
10103 add_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10104 add_anchor_token(T_WIDE_STRING_LITERAL);
10105 add_anchor_token(T__Bool);
10106 add_anchor_token(T__Complex);
10107 add_anchor_token(T__Imaginary);
10108 add_anchor_token(T___FUNCTION__);
10109 add_anchor_token(T___PRETTY_FUNCTION__);
10110 add_anchor_token(T___alignof__);
10111 add_anchor_token(T___attribute__);
10112 add_anchor_token(T___builtin_va_start);
10113 add_anchor_token(T___extension__);
10114 add_anchor_token(T___func__);
10115 add_anchor_token(T___imag__);
10116 add_anchor_token(T___label__);
10117 add_anchor_token(T___real__);
10118 add_anchor_token(T___thread);
10119 add_anchor_token(T_asm);
10120 add_anchor_token(T_auto);
10121 add_anchor_token(T_bool);
10122 add_anchor_token(T_break);
10123 add_anchor_token(T_case);
10124 add_anchor_token(T_char);
10125 add_anchor_token(T_class);
10126 add_anchor_token(T_const);
10127 add_anchor_token(T_const_cast);
10128 add_anchor_token(T_continue);
10129 add_anchor_token(T_default);
10130 add_anchor_token(T_delete);
10131 add_anchor_token(T_double);
10132 add_anchor_token(T_do);
10133 add_anchor_token(T_dynamic_cast);
10134 add_anchor_token(T_enum);
10135 add_anchor_token(T_extern);
10136 add_anchor_token(T_false);
10137 add_anchor_token(T_float);
10138 add_anchor_token(T_for);
10139 add_anchor_token(T_goto);
10140 add_anchor_token(T_if);
10141 add_anchor_token(T_inline);
10142 add_anchor_token(T_int);
10143 add_anchor_token(T_long);
10144 add_anchor_token(T_new);
10145 add_anchor_token(T_operator);
10146 add_anchor_token(T_register);
10147 add_anchor_token(T_reinterpret_cast);
10148 add_anchor_token(T_restrict);
10149 add_anchor_token(T_return);
10150 add_anchor_token(T_short);
10151 add_anchor_token(T_signed);
10152 add_anchor_token(T_sizeof);
10153 add_anchor_token(T_static);
10154 add_anchor_token(T_static_cast);
10155 add_anchor_token(T_struct);
10156 add_anchor_token(T_switch);
10157 add_anchor_token(T_template);
10158 add_anchor_token(T_this);
10159 add_anchor_token(T_throw);
10160 add_anchor_token(T_true);
10161 add_anchor_token(T_try);
10162 add_anchor_token(T_typedef);
10163 add_anchor_token(T_typeid);
10164 add_anchor_token(T_typename);
10165 add_anchor_token(T_typeof);
10166 add_anchor_token(T_union);
10167 add_anchor_token(T_unsigned);
10168 add_anchor_token(T_using);
10169 add_anchor_token(T_void);
10170 add_anchor_token(T_volatile);
10171 add_anchor_token(T_wchar_t);
10172 add_anchor_token(T_while);
10174 statement_t **anchor = &statement->compound.statements;
10175 bool only_decls_so_far = true;
10176 while (token.kind != '}') {
10177 if (token.kind == T_EOF) {
10178 errorf(&statement->base.source_position,
10179 "EOF while parsing compound statement");
10182 statement_t *sub_statement = intern_parse_statement();
10183 if (sub_statement->kind == STATEMENT_ERROR) {
10184 /* an error occurred. if we are at an anchor, return */
10190 if (sub_statement->kind != STATEMENT_DECLARATION) {
10191 only_decls_so_far = false;
10192 } else if (!only_decls_so_far) {
10193 source_position_t const *const pos = &sub_statement->base.source_position;
10194 warningf(WARN_DECLARATION_AFTER_STATEMENT, pos, "ISO C90 forbids mixed declarations and code");
10197 *anchor = sub_statement;
10199 while (sub_statement->base.next != NULL)
10200 sub_statement = sub_statement->base.next;
10202 anchor = &sub_statement->base.next;
10206 /* look over all statements again to produce no effect warnings */
10207 if (is_warn_on(WARN_UNUSED_VALUE)) {
10208 statement_t *sub_statement = statement->compound.statements;
10209 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
10210 if (sub_statement->kind != STATEMENT_EXPRESSION)
10212 /* don't emit a warning for the last expression in an expression
10213 * statement as it has always an effect */
10214 if (inside_expression_statement && sub_statement->base.next == NULL)
10217 expression_t *expression = sub_statement->expression.expression;
10218 if (!expression_has_effect(expression)) {
10219 warningf(WARN_UNUSED_VALUE, &expression->base.source_position, "statement has no effect");
10225 rem_anchor_token(T_while);
10226 rem_anchor_token(T_wchar_t);
10227 rem_anchor_token(T_volatile);
10228 rem_anchor_token(T_void);
10229 rem_anchor_token(T_using);
10230 rem_anchor_token(T_unsigned);
10231 rem_anchor_token(T_union);
10232 rem_anchor_token(T_typeof);
10233 rem_anchor_token(T_typename);
10234 rem_anchor_token(T_typeid);
10235 rem_anchor_token(T_typedef);
10236 rem_anchor_token(T_try);
10237 rem_anchor_token(T_true);
10238 rem_anchor_token(T_throw);
10239 rem_anchor_token(T_this);
10240 rem_anchor_token(T_template);
10241 rem_anchor_token(T_switch);
10242 rem_anchor_token(T_struct);
10243 rem_anchor_token(T_static_cast);
10244 rem_anchor_token(T_static);
10245 rem_anchor_token(T_sizeof);
10246 rem_anchor_token(T_signed);
10247 rem_anchor_token(T_short);
10248 rem_anchor_token(T_return);
10249 rem_anchor_token(T_restrict);
10250 rem_anchor_token(T_reinterpret_cast);
10251 rem_anchor_token(T_register);
10252 rem_anchor_token(T_operator);
10253 rem_anchor_token(T_new);
10254 rem_anchor_token(T_long);
10255 rem_anchor_token(T_int);
10256 rem_anchor_token(T_inline);
10257 rem_anchor_token(T_if);
10258 rem_anchor_token(T_goto);
10259 rem_anchor_token(T_for);
10260 rem_anchor_token(T_float);
10261 rem_anchor_token(T_false);
10262 rem_anchor_token(T_extern);
10263 rem_anchor_token(T_enum);
10264 rem_anchor_token(T_dynamic_cast);
10265 rem_anchor_token(T_do);
10266 rem_anchor_token(T_double);
10267 rem_anchor_token(T_delete);
10268 rem_anchor_token(T_default);
10269 rem_anchor_token(T_continue);
10270 rem_anchor_token(T_const_cast);
10271 rem_anchor_token(T_const);
10272 rem_anchor_token(T_class);
10273 rem_anchor_token(T_char);
10274 rem_anchor_token(T_case);
10275 rem_anchor_token(T_break);
10276 rem_anchor_token(T_bool);
10277 rem_anchor_token(T_auto);
10278 rem_anchor_token(T_asm);
10279 rem_anchor_token(T___thread);
10280 rem_anchor_token(T___real__);
10281 rem_anchor_token(T___label__);
10282 rem_anchor_token(T___imag__);
10283 rem_anchor_token(T___func__);
10284 rem_anchor_token(T___extension__);
10285 rem_anchor_token(T___builtin_va_start);
10286 rem_anchor_token(T___attribute__);
10287 rem_anchor_token(T___alignof__);
10288 rem_anchor_token(T___PRETTY_FUNCTION__);
10289 rem_anchor_token(T___FUNCTION__);
10290 rem_anchor_token(T__Imaginary);
10291 rem_anchor_token(T__Complex);
10292 rem_anchor_token(T__Bool);
10293 rem_anchor_token(T_WIDE_STRING_LITERAL);
10294 rem_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10295 rem_anchor_token(T_STRING_LITERAL);
10296 rem_anchor_token(T_PLUSPLUS);
10297 rem_anchor_token(T_MINUSMINUS);
10298 rem_anchor_token(T_INTEGER);
10299 rem_anchor_token(T_IDENTIFIER);
10300 rem_anchor_token(T_FLOATINGPOINT);
10301 rem_anchor_token(T_COLONCOLON);
10302 rem_anchor_token(T_CHARACTER_CONSTANT);
10303 rem_anchor_token('~');
10304 rem_anchor_token('{');
10305 rem_anchor_token('-');
10306 rem_anchor_token('+');
10307 rem_anchor_token('*');
10308 rem_anchor_token('(');
10309 rem_anchor_token('&');
10310 rem_anchor_token('!');
10311 rem_anchor_token('}');
10319 * Check for unused global static functions and variables
10321 static void check_unused_globals(void)
10323 if (!is_warn_on(WARN_UNUSED_FUNCTION) && !is_warn_on(WARN_UNUSED_VARIABLE))
10326 for (const entity_t *entity = file_scope->entities; entity != NULL;
10327 entity = entity->base.next) {
10328 if (!is_declaration(entity))
10331 const declaration_t *declaration = &entity->declaration;
10332 if (declaration->used ||
10333 declaration->modifiers & DM_UNUSED ||
10334 declaration->modifiers & DM_USED ||
10335 declaration->storage_class != STORAGE_CLASS_STATIC)
10340 if (entity->kind == ENTITY_FUNCTION) {
10341 /* inhibit warning for static inline functions */
10342 if (entity->function.is_inline)
10345 why = WARN_UNUSED_FUNCTION;
10346 s = entity->function.statement != NULL ? "defined" : "declared";
10348 why = WARN_UNUSED_VARIABLE;
10352 warningf(why, &declaration->base.source_position, "'%#N' %s but not used", entity, s);
10356 static void parse_global_asm(void)
10358 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10361 expect('(', end_error);
10363 statement->asms.asm_text = parse_string_literals();
10364 statement->base.next = unit->global_asm;
10365 unit->global_asm = statement;
10367 expect(')', end_error);
10368 expect(';', end_error);
10373 static void parse_linkage_specification(void)
10377 source_position_t const pos = *HERE;
10378 char const *const linkage = parse_string_literals().begin;
10380 linkage_kind_t old_linkage = current_linkage;
10381 linkage_kind_t new_linkage;
10382 if (strcmp(linkage, "C") == 0) {
10383 new_linkage = LINKAGE_C;
10384 } else if (strcmp(linkage, "C++") == 0) {
10385 new_linkage = LINKAGE_CXX;
10387 errorf(&pos, "linkage string \"%s\" not recognized", linkage);
10388 new_linkage = LINKAGE_C;
10390 current_linkage = new_linkage;
10392 if (next_if('{')) {
10394 expect('}', end_error);
10400 assert(current_linkage == new_linkage);
10401 current_linkage = old_linkage;
10404 static void parse_external(void)
10406 switch (token.kind) {
10408 if (look_ahead(1)->kind == T_STRING_LITERAL) {
10409 parse_linkage_specification();
10411 DECLARATION_START_NO_EXTERN
10413 case T___extension__:
10414 /* tokens below are for implicit int */
10415 case '&': /* & x; -> int& x; (and error later, because C++ has no
10417 case '*': /* * x; -> int* x; */
10418 case '(': /* (x); -> int (x); */
10420 parse_external_declaration();
10426 parse_global_asm();
10430 parse_namespace_definition();
10434 if (!strict_mode) {
10435 warningf(WARN_STRAY_SEMICOLON, HERE, "stray ';' outside of function");
10442 errorf(HERE, "stray %K outside of function", &token);
10443 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10444 eat_until_matching_token(token.kind);
10450 static void parse_externals(void)
10452 add_anchor_token('}');
10453 add_anchor_token(T_EOF);
10456 /* make a copy of the anchor set, so we can check if it is restored after parsing */
10457 unsigned short token_anchor_copy[T_LAST_TOKEN];
10458 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10461 while (token.kind != T_EOF && token.kind != '}') {
10463 for (int i = 0; i < T_LAST_TOKEN; ++i) {
10464 unsigned short count = token_anchor_set[i] - token_anchor_copy[i];
10466 /* the anchor set and its copy differs */
10467 internal_errorf(HERE, "Leaked anchor token %k %d times", i, count);
10470 if (in_gcc_extension) {
10471 /* an gcc extension scope was not closed */
10472 internal_errorf(HERE, "Leaked __extension__");
10479 rem_anchor_token(T_EOF);
10480 rem_anchor_token('}');
10484 * Parse a translation unit.
10486 static void parse_translation_unit(void)
10488 add_anchor_token(T_EOF);
10493 if (token.kind == T_EOF)
10496 errorf(HERE, "stray %K outside of function", &token);
10497 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10498 eat_until_matching_token(token.kind);
10503 void set_default_visibility(elf_visibility_tag_t visibility)
10505 default_visibility = visibility;
10511 * @return the translation unit or NULL if errors occurred.
10513 void start_parsing(void)
10515 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10516 label_stack = NEW_ARR_F(stack_entry_t, 0);
10517 diagnostic_count = 0;
10521 print_to_file(stderr);
10523 assert(unit == NULL);
10524 unit = allocate_ast_zero(sizeof(unit[0]));
10526 assert(file_scope == NULL);
10527 file_scope = &unit->scope;
10529 assert(current_scope == NULL);
10530 scope_push(&unit->scope);
10532 create_gnu_builtins();
10534 create_microsoft_intrinsics();
10537 translation_unit_t *finish_parsing(void)
10539 assert(current_scope == &unit->scope);
10542 assert(file_scope == &unit->scope);
10543 check_unused_globals();
10546 DEL_ARR_F(environment_stack);
10547 DEL_ARR_F(label_stack);
10549 translation_unit_t *result = unit;
10554 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
10555 * are given length one. */
10556 static void complete_incomplete_arrays(void)
10558 size_t n = ARR_LEN(incomplete_arrays);
10559 for (size_t i = 0; i != n; ++i) {
10560 declaration_t *const decl = incomplete_arrays[i];
10561 type_t *const type = skip_typeref(decl->type);
10563 if (!is_type_incomplete(type))
10566 source_position_t const *const pos = &decl->base.source_position;
10567 warningf(WARN_OTHER, pos, "array '%#N' assumed to have one element", (entity_t const*)decl);
10569 type_t *const new_type = duplicate_type(type);
10570 new_type->array.size_constant = true;
10571 new_type->array.has_implicit_size = true;
10572 new_type->array.size = 1;
10574 type_t *const result = identify_new_type(new_type);
10576 decl->type = result;
10580 void prepare_main_collect2(entity_t *entity)
10582 // create call to __main
10583 symbol_t *symbol = symbol_table_insert("__main");
10584 entity_t *subsubmain_ent
10585 = create_implicit_function(symbol, &builtin_source_position);
10587 expression_t *ref = allocate_expression_zero(EXPR_REFERENCE);
10588 type_t *ftype = subsubmain_ent->declaration.type;
10589 ref->base.source_position = builtin_source_position;
10590 ref->base.type = make_pointer_type(ftype, TYPE_QUALIFIER_NONE);
10591 ref->reference.entity = subsubmain_ent;
10593 expression_t *call = allocate_expression_zero(EXPR_CALL);
10594 call->base.source_position = builtin_source_position;
10595 call->base.type = type_void;
10596 call->call.function = ref;
10598 statement_t *expr_statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10599 expr_statement->base.source_position = builtin_source_position;
10600 expr_statement->expression.expression = call;
10602 statement_t *statement = entity->function.statement;
10603 assert(statement->kind == STATEMENT_COMPOUND);
10604 compound_statement_t *compounds = &statement->compound;
10606 expr_statement->base.next = compounds->statements;
10607 compounds->statements = expr_statement;
10612 lookahead_bufpos = 0;
10613 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10616 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
10617 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
10618 parse_translation_unit();
10619 complete_incomplete_arrays();
10620 DEL_ARR_F(incomplete_arrays);
10621 incomplete_arrays = NULL;
10625 * Initialize the parser.
10627 void init_parser(void)
10629 sym_anonymous = symbol_table_insert("<anonymous>");
10631 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10633 init_expression_parsers();
10634 obstack_init(&temp_obst);
10638 * Terminate the parser.
10640 void exit_parser(void)
10642 obstack_free(&temp_obst, NULL);