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]));
1825 * Descending into a sub-type. Enter the scope of the current top_type.
1827 static void descend_into_subtype(type_path_t *path)
1829 type_t *orig_top_type = path->top_type;
1830 type_t *top_type = skip_typeref(orig_top_type);
1832 type_path_entry_t *top = append_to_type_path(path);
1833 top->type = top_type;
1835 if (is_type_compound(top_type)) {
1836 compound_t *const compound = top_type->compound.compound;
1837 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
1839 if (entry != NULL) {
1840 top->v.compound_entry = &entry->declaration;
1841 path->top_type = entry->declaration.type;
1843 path->top_type = NULL;
1845 } else if (is_type_array(top_type)) {
1847 path->top_type = top_type->array.element_type;
1849 assert(!is_type_valid(top_type));
1854 * Pop an entry from the given type path, ie. returning from
1855 * (type).a.b to (type).a
1857 static void ascend_from_subtype(type_path_t *path)
1859 type_path_entry_t *top = get_type_path_top(path);
1861 path->top_type = top->type;
1863 size_t len = ARR_LEN(path->path);
1864 ARR_RESIZE(type_path_entry_t, path->path, len-1);
1868 * Pop entries from the given type path until the given
1869 * path level is reached.
1871 static void ascend_to(type_path_t *path, size_t top_path_level)
1873 size_t len = ARR_LEN(path->path);
1875 while (len > top_path_level) {
1876 ascend_from_subtype(path);
1877 len = ARR_LEN(path->path);
1881 static bool walk_designator(type_path_t *path, const designator_t *designator,
1882 bool used_in_offsetof)
1884 for (; designator != NULL; designator = designator->next) {
1885 type_path_entry_t *top = get_type_path_top(path);
1886 type_t *orig_type = top->type;
1888 type_t *type = skip_typeref(orig_type);
1890 if (designator->symbol != NULL) {
1891 symbol_t *symbol = designator->symbol;
1892 if (!is_type_compound(type)) {
1893 if (is_type_valid(type)) {
1894 errorf(&designator->source_position,
1895 "'.%Y' designator used for non-compound type '%T'",
1899 top->type = type_error_type;
1900 top->v.compound_entry = NULL;
1901 orig_type = type_error_type;
1903 compound_t *compound = type->compound.compound;
1904 entity_t *iter = compound->members.entities;
1905 for (; iter != NULL; iter = iter->base.next) {
1906 if (iter->base.symbol == symbol) {
1911 errorf(&designator->source_position,
1912 "'%T' has no member named '%Y'", orig_type, symbol);
1915 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
1916 if (used_in_offsetof && iter->compound_member.bitfield) {
1917 errorf(&designator->source_position,
1918 "offsetof designator '%Y' must not specify bitfield",
1923 top->type = orig_type;
1924 top->v.compound_entry = &iter->declaration;
1925 orig_type = iter->declaration.type;
1928 expression_t *array_index = designator->array_index;
1929 assert(designator->array_index != NULL);
1931 if (!is_type_array(type)) {
1932 if (is_type_valid(type)) {
1933 errorf(&designator->source_position,
1934 "[%E] designator used for non-array type '%T'",
1935 array_index, orig_type);
1940 long index = fold_constant_to_int(array_index);
1941 if (!used_in_offsetof) {
1943 errorf(&designator->source_position,
1944 "array index [%E] must be positive", array_index);
1945 } else if (type->array.size_constant) {
1946 long array_size = type->array.size;
1947 if (index >= array_size) {
1948 errorf(&designator->source_position,
1949 "designator [%E] (%d) exceeds array size %d",
1950 array_index, index, array_size);
1955 top->type = orig_type;
1956 top->v.index = (size_t) index;
1957 orig_type = type->array.element_type;
1959 path->top_type = orig_type;
1961 if (designator->next != NULL) {
1962 descend_into_subtype(path);
1968 static void advance_current_object(type_path_t *path, size_t top_path_level)
1970 type_path_entry_t *top = get_type_path_top(path);
1972 type_t *type = skip_typeref(top->type);
1973 if (is_type_union(type)) {
1974 /* in unions only the first element is initialized */
1975 top->v.compound_entry = NULL;
1976 } else if (is_type_struct(type)) {
1977 declaration_t *entry = top->v.compound_entry;
1979 entity_t *const next_entity = skip_unnamed_bitfields(entry->base.next);
1980 if (next_entity != NULL) {
1981 assert(is_declaration(next_entity));
1982 entry = &next_entity->declaration;
1987 top->v.compound_entry = entry;
1988 if (entry != NULL) {
1989 path->top_type = entry->type;
1992 } else if (is_type_array(type)) {
1993 assert(is_type_array(type));
1997 if (!type->array.size_constant || top->v.index < type->array.size) {
2001 assert(!is_type_valid(type));
2005 /* we're past the last member of the current sub-aggregate, try if we
2006 * can ascend in the type hierarchy and continue with another subobject */
2007 size_t len = ARR_LEN(path->path);
2009 if (len > top_path_level) {
2010 ascend_from_subtype(path);
2011 advance_current_object(path, top_path_level);
2013 path->top_type = NULL;
2018 * skip any {...} blocks until a closing bracket is reached.
2020 static void skip_initializers(void)
2024 while (token.kind != '}') {
2025 if (token.kind == T_EOF)
2027 if (token.kind == '{') {
2035 static initializer_t *create_empty_initializer(void)
2037 static initializer_t empty_initializer
2038 = { .list = { { INITIALIZER_LIST }, 0 } };
2039 return &empty_initializer;
2043 * Parse a part of an initialiser for a struct or union,
2045 static initializer_t *parse_sub_initializer(type_path_t *path,
2046 type_t *outer_type, size_t top_path_level,
2047 parse_initializer_env_t *env)
2049 if (token.kind == '}') {
2050 /* empty initializer */
2051 return create_empty_initializer();
2054 type_t *orig_type = path->top_type;
2055 type_t *type = NULL;
2057 if (orig_type == NULL) {
2058 /* We are initializing an empty compound. */
2060 type = skip_typeref(orig_type);
2063 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2066 designator_t *designator = NULL;
2067 if (token.kind == '.' || token.kind == '[') {
2068 designator = parse_designation();
2069 goto finish_designator;
2070 } else if (token.kind == T_IDENTIFIER && look_ahead(1)->kind == ':') {
2071 /* GNU-style designator ("identifier: value") */
2072 designator = allocate_ast_zero(sizeof(designator[0]));
2073 designator->source_position = token.base.source_position;
2074 designator->symbol = token.identifier.symbol;
2079 /* reset path to toplevel, evaluate designator from there */
2080 ascend_to(path, top_path_level);
2081 if (!walk_designator(path, designator, false)) {
2082 /* can't continue after designation error */
2086 initializer_t *designator_initializer
2087 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2088 designator_initializer->designator.designator = designator;
2089 ARR_APP1(initializer_t*, initializers, designator_initializer);
2091 orig_type = path->top_type;
2092 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2097 if (token.kind == '{') {
2098 if (type != NULL && is_type_scalar(type)) {
2099 sub = parse_scalar_initializer(type, env->must_be_constant);
2102 if (env->entity != NULL) {
2104 "extra brace group at end of initializer for '%Y'",
2105 env->entity->base.symbol);
2107 errorf(HERE, "extra brace group at end of initializer");
2112 descend_into_subtype(path);
2115 add_anchor_token('}');
2116 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2118 rem_anchor_token('}');
2121 ascend_from_subtype(path);
2122 expect('}', end_error);
2124 expect('}', end_error);
2125 goto error_parse_next;
2129 /* must be an expression */
2130 expression_t *expression = parse_assignment_expression();
2131 mark_vars_read(expression, NULL);
2133 if (env->must_be_constant && !is_initializer_constant(expression)) {
2134 errorf(&expression->base.source_position,
2135 "Initialisation expression '%E' is not constant",
2140 /* we are already outside, ... */
2141 if (outer_type == NULL)
2142 goto error_parse_next;
2143 type_t *const outer_type_skip = skip_typeref(outer_type);
2144 if (is_type_compound(outer_type_skip) &&
2145 !outer_type_skip->compound.compound->complete) {
2146 goto error_parse_next;
2149 source_position_t const* const pos = &expression->base.source_position;
2150 if (env->entity != NULL) {
2151 warningf(WARN_OTHER, pos, "excess elements in initializer for '%Y'", env->entity->base.symbol);
2153 warningf(WARN_OTHER, pos, "excess elements in initializer");
2155 goto error_parse_next;
2158 /* handle { "string" } special case */
2159 if ((expression->kind == EXPR_STRING_LITERAL
2160 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2161 && outer_type != NULL) {
2162 sub = initializer_from_expression(outer_type, expression);
2165 if (token.kind != '}') {
2166 warningf(WARN_OTHER, HERE, "excessive elements in initializer for type '%T'", orig_type);
2168 /* TODO: eat , ... */
2173 /* descend into subtypes until expression matches type */
2175 orig_type = path->top_type;
2176 type = skip_typeref(orig_type);
2178 sub = initializer_from_expression(orig_type, expression);
2182 if (!is_type_valid(type)) {
2185 if (is_type_scalar(type)) {
2186 errorf(&expression->base.source_position,
2187 "expression '%E' doesn't match expected type '%T'",
2188 expression, orig_type);
2192 descend_into_subtype(path);
2196 /* update largest index of top array */
2197 const type_path_entry_t *first = &path->path[0];
2198 type_t *first_type = first->type;
2199 first_type = skip_typeref(first_type);
2200 if (is_type_array(first_type)) {
2201 size_t index = first->v.index;
2202 if (index > path->max_index)
2203 path->max_index = index;
2206 /* append to initializers list */
2207 ARR_APP1(initializer_t*, initializers, sub);
2210 if (token.kind == '}') {
2213 expect(',', end_error);
2214 if (token.kind == '}') {
2219 /* advance to the next declaration if we are not at the end */
2220 advance_current_object(path, top_path_level);
2221 orig_type = path->top_type;
2222 if (orig_type != NULL)
2223 type = skip_typeref(orig_type);
2229 size_t len = ARR_LEN(initializers);
2230 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2231 initializer_t *result = allocate_ast_zero(size);
2232 result->kind = INITIALIZER_LIST;
2233 result->list.len = len;
2234 memcpy(&result->list.initializers, initializers,
2235 len * sizeof(initializers[0]));
2237 DEL_ARR_F(initializers);
2238 ascend_to(path, top_path_level+1);
2243 skip_initializers();
2244 DEL_ARR_F(initializers);
2245 ascend_to(path, top_path_level+1);
2249 static expression_t *make_size_literal(size_t value)
2251 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_INTEGER);
2252 literal->base.type = type_size_t;
2255 snprintf(buf, sizeof(buf), "%u", (unsigned) value);
2256 literal->literal.value = make_string(buf);
2262 * Parses an initializer. Parsers either a compound literal
2263 * (env->declaration == NULL) or an initializer of a declaration.
2265 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2267 type_t *type = skip_typeref(env->type);
2268 size_t max_index = 0;
2269 initializer_t *result;
2271 if (is_type_scalar(type)) {
2272 result = parse_scalar_initializer(type, env->must_be_constant);
2273 } else if (token.kind == '{') {
2277 memset(&path, 0, sizeof(path));
2278 path.top_type = env->type;
2279 path.path = NEW_ARR_F(type_path_entry_t, 0);
2281 descend_into_subtype(&path);
2283 add_anchor_token('}');
2284 result = parse_sub_initializer(&path, env->type, 1, env);
2285 rem_anchor_token('}');
2287 max_index = path.max_index;
2288 DEL_ARR_F(path.path);
2290 expect('}', end_error);
2293 /* parse_scalar_initializer() also works in this case: we simply
2294 * have an expression without {} around it */
2295 result = parse_scalar_initializer(type, env->must_be_constant);
2298 /* §6.7.8:22 array initializers for arrays with unknown size determine
2299 * the array type size */
2300 if (is_type_array(type) && type->array.size_expression == NULL
2301 && result != NULL) {
2303 switch (result->kind) {
2304 case INITIALIZER_LIST:
2305 assert(max_index != 0xdeadbeaf);
2306 size = max_index + 1;
2309 case INITIALIZER_STRING:
2310 size = result->string.string.size;
2313 case INITIALIZER_WIDE_STRING:
2314 size = result->wide_string.string.size;
2317 case INITIALIZER_DESIGNATOR:
2318 case INITIALIZER_VALUE:
2319 /* can happen for parse errors */
2324 internal_errorf(HERE, "invalid initializer type");
2327 type_t *new_type = duplicate_type(type);
2329 new_type->array.size_expression = make_size_literal(size);
2330 new_type->array.size_constant = true;
2331 new_type->array.has_implicit_size = true;
2332 new_type->array.size = size;
2333 env->type = new_type;
2339 static void append_entity(scope_t *scope, entity_t *entity)
2341 if (scope->last_entity != NULL) {
2342 scope->last_entity->base.next = entity;
2344 scope->entities = entity;
2346 entity->base.parent_entity = current_entity;
2347 scope->last_entity = entity;
2351 static compound_t *parse_compound_type_specifier(bool is_struct)
2353 source_position_t const pos = *HERE;
2354 eat(is_struct ? T_struct : T_union);
2356 symbol_t *symbol = NULL;
2357 entity_t *entity = NULL;
2358 attribute_t *attributes = NULL;
2360 if (token.kind == T___attribute__) {
2361 attributes = parse_attributes(NULL);
2364 entity_kind_tag_t const kind = is_struct ? ENTITY_STRUCT : ENTITY_UNION;
2365 if (token.kind == T_IDENTIFIER) {
2366 /* the compound has a name, check if we have seen it already */
2367 symbol = token.identifier.symbol;
2368 entity = get_tag(symbol, kind);
2371 if (entity != NULL) {
2372 if (entity->base.parent_scope != current_scope &&
2373 (token.kind == '{' || token.kind == ';')) {
2374 /* we're in an inner scope and have a definition. Shadow
2375 * existing definition in outer scope */
2377 } else if (entity->compound.complete && token.kind == '{') {
2378 source_position_t const *const ppos = &entity->base.source_position;
2379 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2380 /* clear members in the hope to avoid further errors */
2381 entity->compound.members.entities = NULL;
2384 } else if (token.kind != '{') {
2385 char const *const msg =
2386 is_struct ? "while parsing struct type specifier" :
2387 "while parsing union type specifier";
2388 parse_error_expected(msg, T_IDENTIFIER, '{', NULL);
2393 if (entity == NULL) {
2394 entity = allocate_entity_zero(kind, NAMESPACE_TAG, symbol);
2395 entity->compound.alignment = 1;
2396 entity->base.source_position = pos;
2397 entity->base.parent_scope = current_scope;
2398 if (symbol != NULL) {
2399 environment_push(entity);
2401 append_entity(current_scope, entity);
2404 if (token.kind == '{') {
2405 parse_compound_type_entries(&entity->compound);
2407 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2408 if (symbol == NULL) {
2409 assert(anonymous_entity == NULL);
2410 anonymous_entity = entity;
2414 if (attributes != NULL) {
2415 handle_entity_attributes(attributes, entity);
2418 return &entity->compound;
2421 static void parse_enum_entries(type_t *const enum_type)
2425 if (token.kind == '}') {
2426 errorf(HERE, "empty enum not allowed");
2431 add_anchor_token('}');
2433 if (token.kind != T_IDENTIFIER) {
2434 parse_error_expected("while parsing enum entry", T_IDENTIFIER, NULL);
2436 rem_anchor_token('}');
2440 symbol_t *symbol = token.identifier.symbol;
2441 entity_t *const entity
2442 = allocate_entity_zero(ENTITY_ENUM_VALUE, NAMESPACE_NORMAL, symbol);
2443 entity->enum_value.enum_type = enum_type;
2444 entity->base.source_position = token.base.source_position;
2448 expression_t *value = parse_constant_expression();
2450 value = create_implicit_cast(value, enum_type);
2451 entity->enum_value.value = value;
2456 record_entity(entity, false);
2457 } while (next_if(',') && token.kind != '}');
2458 rem_anchor_token('}');
2460 expect('}', end_error);
2466 static type_t *parse_enum_specifier(void)
2468 source_position_t const pos = *HERE;
2473 switch (token.kind) {
2475 symbol = token.identifier.symbol;
2476 entity = get_tag(symbol, ENTITY_ENUM);
2479 if (entity != NULL) {
2480 if (entity->base.parent_scope != current_scope &&
2481 (token.kind == '{' || token.kind == ';')) {
2482 /* we're in an inner scope and have a definition. Shadow
2483 * existing definition in outer scope */
2485 } else if (entity->enume.complete && token.kind == '{') {
2486 source_position_t const *const ppos = &entity->base.source_position;
2487 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2498 parse_error_expected("while parsing enum type specifier",
2499 T_IDENTIFIER, '{', NULL);
2503 if (entity == NULL) {
2504 entity = allocate_entity_zero(ENTITY_ENUM, NAMESPACE_TAG, symbol);
2505 entity->base.source_position = pos;
2506 entity->base.parent_scope = current_scope;
2509 type_t *const type = allocate_type_zero(TYPE_ENUM);
2510 type->enumt.enume = &entity->enume;
2511 type->enumt.base.akind = ATOMIC_TYPE_INT;
2513 if (token.kind == '{') {
2514 if (symbol != NULL) {
2515 environment_push(entity);
2517 append_entity(current_scope, entity);
2518 entity->enume.complete = true;
2520 parse_enum_entries(type);
2521 parse_attributes(NULL);
2523 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2524 if (symbol == NULL) {
2525 assert(anonymous_entity == NULL);
2526 anonymous_entity = entity;
2528 } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
2529 errorf(HERE, "'%T' used before definition (incomplete enums are a GNU extension)", type);
2536 * if a symbol is a typedef to another type, return true
2538 static bool is_typedef_symbol(symbol_t *symbol)
2540 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
2541 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
2544 static type_t *parse_typeof(void)
2550 expect('(', end_error);
2551 add_anchor_token(')');
2553 expression_t *expression = NULL;
2555 switch (token.kind) {
2557 if (is_typedef_symbol(token.identifier.symbol)) {
2559 type = parse_typename();
2562 expression = parse_expression();
2563 type = revert_automatic_type_conversion(expression);
2568 rem_anchor_token(')');
2569 expect(')', end_error);
2571 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
2572 typeof_type->typeoft.expression = expression;
2573 typeof_type->typeoft.typeof_type = type;
2580 typedef enum specifiers_t {
2581 SPECIFIER_SIGNED = 1 << 0,
2582 SPECIFIER_UNSIGNED = 1 << 1,
2583 SPECIFIER_LONG = 1 << 2,
2584 SPECIFIER_INT = 1 << 3,
2585 SPECIFIER_DOUBLE = 1 << 4,
2586 SPECIFIER_CHAR = 1 << 5,
2587 SPECIFIER_WCHAR_T = 1 << 6,
2588 SPECIFIER_SHORT = 1 << 7,
2589 SPECIFIER_LONG_LONG = 1 << 8,
2590 SPECIFIER_FLOAT = 1 << 9,
2591 SPECIFIER_BOOL = 1 << 10,
2592 SPECIFIER_VOID = 1 << 11,
2593 SPECIFIER_INT8 = 1 << 12,
2594 SPECIFIER_INT16 = 1 << 13,
2595 SPECIFIER_INT32 = 1 << 14,
2596 SPECIFIER_INT64 = 1 << 15,
2597 SPECIFIER_INT128 = 1 << 16,
2598 SPECIFIER_COMPLEX = 1 << 17,
2599 SPECIFIER_IMAGINARY = 1 << 18,
2602 static type_t *get_typedef_type(symbol_t *symbol)
2604 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
2605 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
2608 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
2609 type->typedeft.typedefe = &entity->typedefe;
2614 static attribute_t *parse_attribute_ms_property(attribute_t *attribute)
2616 expect('(', end_error);
2618 attribute_property_argument_t *property
2619 = allocate_ast_zero(sizeof(*property));
2622 if (token.kind != T_IDENTIFIER) {
2623 parse_error_expected("while parsing property declspec",
2624 T_IDENTIFIER, NULL);
2629 symbol_t *symbol = token.identifier.symbol;
2630 if (strcmp(symbol->string, "put") == 0) {
2631 prop = &property->put_symbol;
2632 } else if (strcmp(symbol->string, "get") == 0) {
2633 prop = &property->get_symbol;
2635 errorf(HERE, "expected put or get in property declspec");
2639 expect('=', end_error);
2640 if (token.kind != T_IDENTIFIER) {
2641 parse_error_expected("while parsing property declspec",
2642 T_IDENTIFIER, NULL);
2646 *prop = token.identifier.symbol;
2648 } while (next_if(','));
2650 attribute->a.property = property;
2652 expect(')', end_error);
2658 static attribute_t *parse_microsoft_extended_decl_modifier_single(void)
2660 attribute_kind_t kind = ATTRIBUTE_UNKNOWN;
2661 if (next_if(T_restrict)) {
2662 kind = ATTRIBUTE_MS_RESTRICT;
2663 } else if (token.kind == T_IDENTIFIER) {
2664 const char *name = token.identifier.symbol->string;
2665 for (attribute_kind_t k = ATTRIBUTE_MS_FIRST; k <= ATTRIBUTE_MS_LAST;
2667 const char *attribute_name = get_attribute_name(k);
2668 if (attribute_name != NULL && strcmp(attribute_name, name) == 0) {
2674 if (kind == ATTRIBUTE_UNKNOWN) {
2675 warningf(WARN_ATTRIBUTE, HERE, "unknown __declspec '%s' ignored", name);
2678 parse_error_expected("while parsing __declspec", T_IDENTIFIER, NULL);
2682 attribute_t *attribute = allocate_attribute_zero(kind);
2685 if (kind == ATTRIBUTE_MS_PROPERTY) {
2686 return parse_attribute_ms_property(attribute);
2689 /* parse arguments */
2691 attribute->a.arguments = parse_attribute_arguments();
2696 static attribute_t *parse_microsoft_extended_decl_modifier(attribute_t *first)
2700 expect('(', end_error);
2705 add_anchor_token(')');
2707 attribute_t **anchor = &first;
2709 while (*anchor != NULL)
2710 anchor = &(*anchor)->next;
2712 attribute_t *attribute
2713 = parse_microsoft_extended_decl_modifier_single();
2714 if (attribute == NULL)
2717 *anchor = attribute;
2718 anchor = &attribute->next;
2719 } while (next_if(','));
2721 rem_anchor_token(')');
2722 expect(')', end_error);
2726 rem_anchor_token(')');
2730 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
2732 entity_t *const entity = allocate_entity_zero(kind, NAMESPACE_NORMAL, symbol);
2733 entity->base.source_position = *HERE;
2734 if (is_declaration(entity)) {
2735 entity->declaration.type = type_error_type;
2736 entity->declaration.implicit = true;
2737 } else if (kind == ENTITY_TYPEDEF) {
2738 entity->typedefe.type = type_error_type;
2739 entity->typedefe.builtin = true;
2741 if (kind != ENTITY_COMPOUND_MEMBER)
2742 record_entity(entity, false);
2746 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2748 type_t *type = NULL;
2749 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
2750 unsigned type_specifiers = 0;
2751 bool newtype = false;
2752 bool saw_error = false;
2754 memset(specifiers, 0, sizeof(*specifiers));
2755 specifiers->source_position = token.base.source_position;
2758 specifiers->attributes = parse_attributes(specifiers->attributes);
2760 switch (token.kind) {
2762 #define MATCH_STORAGE_CLASS(token, class) \
2764 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
2765 errorf(HERE, "multiple storage classes in declaration specifiers"); \
2767 specifiers->storage_class = class; \
2768 if (specifiers->thread_local) \
2769 goto check_thread_storage_class; \
2773 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
2774 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
2775 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
2776 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
2777 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
2780 specifiers->attributes
2781 = parse_microsoft_extended_decl_modifier(specifiers->attributes);
2785 if (specifiers->thread_local) {
2786 errorf(HERE, "duplicate '__thread'");
2788 specifiers->thread_local = true;
2789 check_thread_storage_class:
2790 switch (specifiers->storage_class) {
2791 case STORAGE_CLASS_EXTERN:
2792 case STORAGE_CLASS_NONE:
2793 case STORAGE_CLASS_STATIC:
2797 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_storage_class;
2798 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_storage_class;
2799 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_storage_class;
2800 wrong_thread_storage_class:
2801 errorf(HERE, "'__thread' used with '%s'", wrong);
2808 /* type qualifiers */
2809 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
2811 qualifiers |= qualifier; \
2815 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
2816 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
2817 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
2818 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
2819 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
2820 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
2821 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
2822 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
2824 /* type specifiers */
2825 #define MATCH_SPECIFIER(token, specifier, name) \
2827 if (type_specifiers & specifier) { \
2828 errorf(HERE, "multiple " name " type specifiers given"); \
2830 type_specifiers |= specifier; \
2835 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
2836 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
2837 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
2838 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
2839 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
2840 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
2841 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
2842 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
2843 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
2844 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
2845 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
2846 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
2847 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
2848 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
2849 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
2850 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
2851 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
2852 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
2856 specifiers->is_inline = true;
2860 case T__forceinline:
2862 specifiers->modifiers |= DM_FORCEINLINE;
2867 if (type_specifiers & SPECIFIER_LONG_LONG) {
2868 errorf(HERE, "too many long type specifiers given");
2869 } else if (type_specifiers & SPECIFIER_LONG) {
2870 type_specifiers |= SPECIFIER_LONG_LONG;
2872 type_specifiers |= SPECIFIER_LONG;
2877 #define CHECK_DOUBLE_TYPE() \
2878 (type != NULL ? errorf(HERE, "multiple types in declaration specifiers") : (void)0)
2881 CHECK_DOUBLE_TYPE();
2882 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
2884 type->compound.compound = parse_compound_type_specifier(true);
2887 CHECK_DOUBLE_TYPE();
2888 type = allocate_type_zero(TYPE_COMPOUND_UNION);
2889 type->compound.compound = parse_compound_type_specifier(false);
2892 CHECK_DOUBLE_TYPE();
2893 type = parse_enum_specifier();
2896 CHECK_DOUBLE_TYPE();
2897 type = parse_typeof();
2899 case T___builtin_va_list:
2900 CHECK_DOUBLE_TYPE();
2901 type = duplicate_type(type_valist);
2905 case T_IDENTIFIER: {
2906 /* only parse identifier if we haven't found a type yet */
2907 if (type != NULL || type_specifiers != 0) {
2908 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
2909 * declaration, so it doesn't generate errors about expecting '(' or
2911 switch (look_ahead(1)->kind) {
2918 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
2922 errorf(HERE, "discarding stray %K in declaration specifier", &token);
2927 goto finish_specifiers;
2931 type_t *const typedef_type = get_typedef_type(token.identifier.symbol);
2932 if (typedef_type == NULL) {
2933 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
2934 * declaration, so it doesn't generate 'implicit int' followed by more
2935 * errors later on. */
2936 token_kind_t const la1_type = (token_kind_t)look_ahead(1)->kind;
2942 errorf(HERE, "%K does not name a type", &token);
2944 symbol_t *symbol = token.identifier.symbol;
2946 = create_error_entity(symbol, ENTITY_TYPEDEF);
2948 type = allocate_type_zero(TYPE_TYPEDEF);
2949 type->typedeft.typedefe = &entity->typedefe;
2957 goto finish_specifiers;
2962 type = typedef_type;
2966 /* function specifier */
2968 goto finish_specifiers;
2973 specifiers->attributes = parse_attributes(specifiers->attributes);
2975 if (type == NULL || (saw_error && type_specifiers != 0)) {
2976 atomic_type_kind_t atomic_type;
2978 /* match valid basic types */
2979 switch (type_specifiers) {
2980 case SPECIFIER_VOID:
2981 atomic_type = ATOMIC_TYPE_VOID;
2983 case SPECIFIER_WCHAR_T:
2984 atomic_type = ATOMIC_TYPE_WCHAR_T;
2986 case SPECIFIER_CHAR:
2987 atomic_type = ATOMIC_TYPE_CHAR;
2989 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
2990 atomic_type = ATOMIC_TYPE_SCHAR;
2992 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
2993 atomic_type = ATOMIC_TYPE_UCHAR;
2995 case SPECIFIER_SHORT:
2996 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
2997 case SPECIFIER_SHORT | SPECIFIER_INT:
2998 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
2999 atomic_type = ATOMIC_TYPE_SHORT;
3001 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3002 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3003 atomic_type = ATOMIC_TYPE_USHORT;
3006 case SPECIFIER_SIGNED:
3007 case SPECIFIER_SIGNED | SPECIFIER_INT:
3008 atomic_type = ATOMIC_TYPE_INT;
3010 case SPECIFIER_UNSIGNED:
3011 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3012 atomic_type = ATOMIC_TYPE_UINT;
3014 case SPECIFIER_LONG:
3015 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3016 case SPECIFIER_LONG | SPECIFIER_INT:
3017 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3018 atomic_type = ATOMIC_TYPE_LONG;
3020 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3021 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3022 atomic_type = ATOMIC_TYPE_ULONG;
3025 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3026 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3027 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3028 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3030 atomic_type = ATOMIC_TYPE_LONGLONG;
3031 goto warn_about_long_long;
3033 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3034 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3036 atomic_type = ATOMIC_TYPE_ULONGLONG;
3037 warn_about_long_long:
3038 warningf(WARN_LONG_LONG, &specifiers->source_position, "ISO C90 does not support 'long long'");
3041 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3042 atomic_type = unsigned_int8_type_kind;
3045 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3046 atomic_type = unsigned_int16_type_kind;
3049 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3050 atomic_type = unsigned_int32_type_kind;
3053 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3054 atomic_type = unsigned_int64_type_kind;
3057 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3058 atomic_type = unsigned_int128_type_kind;
3061 case SPECIFIER_INT8:
3062 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3063 atomic_type = int8_type_kind;
3066 case SPECIFIER_INT16:
3067 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3068 atomic_type = int16_type_kind;
3071 case SPECIFIER_INT32:
3072 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3073 atomic_type = int32_type_kind;
3076 case SPECIFIER_INT64:
3077 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3078 atomic_type = int64_type_kind;
3081 case SPECIFIER_INT128:
3082 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3083 atomic_type = int128_type_kind;
3086 case SPECIFIER_FLOAT:
3087 atomic_type = ATOMIC_TYPE_FLOAT;
3089 case SPECIFIER_DOUBLE:
3090 atomic_type = ATOMIC_TYPE_DOUBLE;
3092 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3093 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3095 case SPECIFIER_BOOL:
3096 atomic_type = ATOMIC_TYPE_BOOL;
3098 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3099 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3100 atomic_type = ATOMIC_TYPE_FLOAT;
3102 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3103 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3104 atomic_type = ATOMIC_TYPE_DOUBLE;
3106 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3107 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3108 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3111 /* invalid specifier combination, give an error message */
3112 source_position_t const* const pos = &specifiers->source_position;
3113 if (type_specifiers == 0) {
3115 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
3116 if (!(c_mode & _CXX) && !strict_mode) {
3117 warningf(WARN_IMPLICIT_INT, pos, "no type specifiers in declaration, using 'int'");
3118 atomic_type = ATOMIC_TYPE_INT;
3121 errorf(pos, "no type specifiers given in declaration");
3124 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3125 (type_specifiers & SPECIFIER_UNSIGNED)) {
3126 errorf(pos, "signed and unsigned specifiers given");
3127 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3128 errorf(pos, "only integer types can be signed or unsigned");
3130 errorf(pos, "multiple datatypes in declaration");
3136 if (type_specifiers & SPECIFIER_COMPLEX) {
3137 type = allocate_type_zero(TYPE_COMPLEX);
3138 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3139 type = allocate_type_zero(TYPE_IMAGINARY);
3141 type = allocate_type_zero(TYPE_ATOMIC);
3143 type->atomic.akind = atomic_type;
3145 } else if (type_specifiers != 0) {
3146 errorf(&specifiers->source_position, "multiple datatypes in declaration");
3149 /* FIXME: check type qualifiers here */
3150 type->base.qualifiers = qualifiers;
3153 type = identify_new_type(type);
3155 type = typehash_insert(type);
3158 if (specifiers->attributes != NULL)
3159 type = handle_type_attributes(specifiers->attributes, type);
3160 specifiers->type = type;
3164 specifiers->type = type_error_type;
3167 static type_qualifiers_t parse_type_qualifiers(void)
3169 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3172 switch (token.kind) {
3173 /* type qualifiers */
3174 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3175 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3176 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3177 /* microsoft extended type modifiers */
3178 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3179 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3180 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3181 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3182 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3191 * Parses an K&R identifier list
3193 static void parse_identifier_list(scope_t *scope)
3195 assert(token.kind == T_IDENTIFIER);
3197 entity_t *const entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, token.identifier.symbol);
3198 entity->base.source_position = token.base.source_position;
3199 /* a K&R parameter has no type, yet */
3203 append_entity(scope, entity);
3204 } while (next_if(',') && token.kind == T_IDENTIFIER);
3207 static entity_t *parse_parameter(void)
3209 declaration_specifiers_t specifiers;
3210 parse_declaration_specifiers(&specifiers);
3212 entity_t *entity = parse_declarator(&specifiers,
3213 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
3214 anonymous_entity = NULL;
3218 static void semantic_parameter_incomplete(const entity_t *entity)
3220 assert(entity->kind == ENTITY_PARAMETER);
3222 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
3223 * list in a function declarator that is part of a
3224 * definition of that function shall not have
3225 * incomplete type. */
3226 type_t *type = skip_typeref(entity->declaration.type);
3227 if (is_type_incomplete(type)) {
3228 errorf(&entity->base.source_position, "'%N' has incomplete type", entity);
3232 static bool has_parameters(void)
3234 /* func(void) is not a parameter */
3235 if (token.kind == T_IDENTIFIER) {
3236 entity_t const *const entity
3237 = get_entity(token.identifier.symbol, NAMESPACE_NORMAL);
3240 if (entity->kind != ENTITY_TYPEDEF)
3242 if (skip_typeref(entity->typedefe.type) != type_void)
3244 } else if (token.kind != T_void) {
3247 if (look_ahead(1)->kind != ')')
3254 * Parses function type parameters (and optionally creates variable_t entities
3255 * for them in a scope)
3257 static void parse_parameters(function_type_t *type, scope_t *scope)
3260 add_anchor_token(')');
3261 int saved_comma_state = save_and_reset_anchor_state(',');
3263 if (token.kind == T_IDENTIFIER
3264 && !is_typedef_symbol(token.identifier.symbol)) {
3265 token_kind_t la1_type = (token_kind_t)look_ahead(1)->kind;
3266 if (la1_type == ',' || la1_type == ')') {
3267 type->kr_style_parameters = true;
3268 parse_identifier_list(scope);
3269 goto parameters_finished;
3273 if (token.kind == ')') {
3274 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
3275 if (!(c_mode & _CXX))
3276 type->unspecified_parameters = true;
3277 } else if (has_parameters()) {
3278 function_parameter_t **anchor = &type->parameters;
3280 switch (token.kind) {
3283 type->variadic = true;
3284 goto parameters_finished;
3289 entity_t *entity = parse_parameter();
3290 if (entity->kind == ENTITY_TYPEDEF) {
3291 errorf(&entity->base.source_position,
3292 "typedef not allowed as function parameter");
3295 assert(is_declaration(entity));
3297 semantic_parameter_incomplete(entity);
3299 function_parameter_t *const parameter =
3300 allocate_parameter(entity->declaration.type);
3302 if (scope != NULL) {
3303 append_entity(scope, entity);
3306 *anchor = parameter;
3307 anchor = ¶meter->next;
3312 goto parameters_finished;
3314 } while (next_if(','));
3317 parameters_finished:
3318 rem_anchor_token(')');
3319 expect(')', end_error);
3322 restore_anchor_state(',', saved_comma_state);
3325 typedef enum construct_type_kind_t {
3326 CONSTRUCT_POINTER = 1,
3327 CONSTRUCT_REFERENCE,
3330 } construct_type_kind_t;
3332 typedef union construct_type_t construct_type_t;
3334 typedef struct construct_type_base_t {
3335 construct_type_kind_t kind;
3336 source_position_t pos;
3337 construct_type_t *next;
3338 } construct_type_base_t;
3340 typedef struct parsed_pointer_t {
3341 construct_type_base_t base;
3342 type_qualifiers_t type_qualifiers;
3343 variable_t *base_variable; /**< MS __based extension. */
3346 typedef struct parsed_reference_t {
3347 construct_type_base_t base;
3348 } parsed_reference_t;
3350 typedef struct construct_function_type_t {
3351 construct_type_base_t base;
3352 type_t *function_type;
3353 } construct_function_type_t;
3355 typedef struct parsed_array_t {
3356 construct_type_base_t base;
3357 type_qualifiers_t type_qualifiers;
3363 union construct_type_t {
3364 construct_type_kind_t kind;
3365 construct_type_base_t base;
3366 parsed_pointer_t pointer;
3367 parsed_reference_t reference;
3368 construct_function_type_t function;
3369 parsed_array_t array;
3372 static construct_type_t *allocate_declarator_zero(construct_type_kind_t const kind, size_t const size)
3374 construct_type_t *const cons = obstack_alloc(&temp_obst, size);
3375 memset(cons, 0, size);
3377 cons->base.pos = *HERE;
3382 static construct_type_t *parse_pointer_declarator(void)
3384 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_POINTER, sizeof(parsed_pointer_t));
3386 cons->pointer.type_qualifiers = parse_type_qualifiers();
3387 //cons->pointer.base_variable = base_variable;
3392 /* ISO/IEC 14882:1998(E) §8.3.2 */
3393 static construct_type_t *parse_reference_declarator(void)
3395 if (!(c_mode & _CXX))
3396 errorf(HERE, "references are only available for C++");
3398 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_REFERENCE, sizeof(parsed_reference_t));
3405 static construct_type_t *parse_array_declarator(void)
3407 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_ARRAY, sizeof(parsed_array_t));
3408 parsed_array_t *const array = &cons->array;
3411 add_anchor_token(']');
3413 bool is_static = next_if(T_static);
3415 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3418 is_static = next_if(T_static);
3420 array->type_qualifiers = type_qualifiers;
3421 array->is_static = is_static;
3423 expression_t *size = NULL;
3424 if (token.kind == '*' && look_ahead(1)->kind == ']') {
3425 array->is_variable = true;
3427 } else if (token.kind != ']') {
3428 size = parse_assignment_expression();
3430 /* §6.7.5.2:1 Array size must have integer type */
3431 type_t *const orig_type = size->base.type;
3432 type_t *const type = skip_typeref(orig_type);
3433 if (!is_type_integer(type) && is_type_valid(type)) {
3434 errorf(&size->base.source_position,
3435 "array size '%E' must have integer type but has type '%T'",
3440 mark_vars_read(size, NULL);
3443 if (is_static && size == NULL)
3444 errorf(&array->base.pos, "static array parameters require a size");
3446 rem_anchor_token(']');
3447 expect(']', end_error);
3454 static construct_type_t *parse_function_declarator(scope_t *scope)
3456 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_FUNCTION, sizeof(construct_function_type_t));
3458 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3459 function_type_t *ftype = &type->function;
3461 ftype->linkage = current_linkage;
3462 ftype->calling_convention = CC_DEFAULT;
3464 parse_parameters(ftype, scope);
3466 cons->function.function_type = type;
3471 typedef struct parse_declarator_env_t {
3472 bool may_be_abstract : 1;
3473 bool must_be_abstract : 1;
3474 decl_modifiers_t modifiers;
3476 source_position_t source_position;
3478 attribute_t *attributes;
3479 } parse_declarator_env_t;
3482 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env)
3484 /* construct a single linked list of construct_type_t's which describe
3485 * how to construct the final declarator type */
3486 construct_type_t *first = NULL;
3487 construct_type_t **anchor = &first;
3489 env->attributes = parse_attributes(env->attributes);
3492 construct_type_t *type;
3493 //variable_t *based = NULL; /* MS __based extension */
3494 switch (token.kind) {
3496 type = parse_reference_declarator();
3500 panic("based not supported anymore");
3505 type = parse_pointer_declarator();
3509 goto ptr_operator_end;
3513 anchor = &type->base.next;
3515 /* TODO: find out if this is correct */
3516 env->attributes = parse_attributes(env->attributes);
3520 construct_type_t *inner_types = NULL;
3522 switch (token.kind) {
3524 if (env->must_be_abstract) {
3525 errorf(HERE, "no identifier expected in typename");
3527 env->symbol = token.identifier.symbol;
3528 env->source_position = token.base.source_position;
3534 /* Parenthesized declarator or function declarator? */
3535 token_t const *const la1 = look_ahead(1);
3536 switch (la1->kind) {
3538 if (is_typedef_symbol(la1->identifier.symbol)) {
3540 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
3541 * interpreted as ``function with no parameter specification'', rather
3542 * than redundant parentheses around the omitted identifier. */
3544 /* Function declarator. */
3545 if (!env->may_be_abstract) {
3546 errorf(HERE, "function declarator must have a name");
3553 case T___attribute__: /* FIXME __attribute__ might also introduce a parameter of a function declarator. */
3554 /* Paranthesized declarator. */
3556 add_anchor_token(')');
3557 inner_types = parse_inner_declarator(env);
3558 if (inner_types != NULL) {
3559 /* All later declarators only modify the return type */
3560 env->must_be_abstract = true;
3562 rem_anchor_token(')');
3563 expect(')', end_error);
3571 if (env->may_be_abstract)
3573 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3578 construct_type_t **const p = anchor;
3581 construct_type_t *type;
3582 switch (token.kind) {
3584 scope_t *scope = NULL;
3585 if (!env->must_be_abstract) {
3586 scope = &env->parameters;
3589 type = parse_function_declarator(scope);
3593 type = parse_array_declarator();
3596 goto declarator_finished;
3599 /* insert in the middle of the list (at p) */
3600 type->base.next = *p;
3603 anchor = &type->base.next;
3606 declarator_finished:
3607 /* append inner_types at the end of the list, we don't to set anchor anymore
3608 * as it's not needed anymore */
3609 *anchor = inner_types;
3616 static type_t *construct_declarator_type(construct_type_t *construct_list,
3619 construct_type_t *iter = construct_list;
3620 for (; iter != NULL; iter = iter->base.next) {
3621 source_position_t const* const pos = &iter->base.pos;
3622 switch (iter->kind) {
3623 case CONSTRUCT_FUNCTION: {
3624 construct_function_type_t *function = &iter->function;
3625 type_t *function_type = function->function_type;
3627 function_type->function.return_type = type;
3629 type_t *skipped_return_type = skip_typeref(type);
3631 if (is_type_function(skipped_return_type)) {
3632 errorf(pos, "function returning function is not allowed");
3633 } else if (is_type_array(skipped_return_type)) {
3634 errorf(pos, "function returning array is not allowed");
3636 if (skipped_return_type->base.qualifiers != 0) {
3637 warningf(WARN_IGNORED_QUALIFIERS, pos, "type qualifiers in return type of function type are meaningless");
3641 /* The function type was constructed earlier. Freeing it here will
3642 * destroy other types. */
3643 type = typehash_insert(function_type);
3647 case CONSTRUCT_POINTER: {
3648 if (is_type_reference(skip_typeref(type)))
3649 errorf(pos, "cannot declare a pointer to reference");
3651 parsed_pointer_t *pointer = &iter->pointer;
3652 type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
3656 case CONSTRUCT_REFERENCE:
3657 if (is_type_reference(skip_typeref(type)))
3658 errorf(pos, "cannot declare a reference to reference");
3660 type = make_reference_type(type);
3663 case CONSTRUCT_ARRAY: {
3664 if (is_type_reference(skip_typeref(type)))
3665 errorf(pos, "cannot declare an array of references");
3667 parsed_array_t *array = &iter->array;
3668 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
3670 expression_t *size_expression = array->size;
3671 if (size_expression != NULL) {
3673 = create_implicit_cast(size_expression, type_size_t);
3676 array_type->base.qualifiers = array->type_qualifiers;
3677 array_type->array.element_type = type;
3678 array_type->array.is_static = array->is_static;
3679 array_type->array.is_variable = array->is_variable;
3680 array_type->array.size_expression = size_expression;
3682 if (size_expression != NULL) {
3683 switch (is_constant_expression(size_expression)) {
3684 case EXPR_CLASS_CONSTANT: {
3685 long const size = fold_constant_to_int(size_expression);
3686 array_type->array.size = size;
3687 array_type->array.size_constant = true;
3688 /* §6.7.5.2:1 If the expression is a constant expression,
3689 * it shall have a value greater than zero. */
3691 errorf(&size_expression->base.source_position,
3692 "size of array must be greater than zero");
3693 } else if (size == 0 && !GNU_MODE) {
3694 errorf(&size_expression->base.source_position,
3695 "size of array must be greater than zero (zero length arrays are a GCC extension)");
3700 case EXPR_CLASS_VARIABLE:
3701 array_type->array.is_vla = true;
3704 case EXPR_CLASS_ERROR:
3709 type_t *skipped_type = skip_typeref(type);
3711 if (is_type_incomplete(skipped_type)) {
3712 errorf(pos, "array of incomplete type '%T' is not allowed", type);
3713 } else if (is_type_function(skipped_type)) {
3714 errorf(pos, "array of functions is not allowed");
3716 type = identify_new_type(array_type);
3720 internal_errorf(pos, "invalid type construction found");
3726 static type_t *automatic_type_conversion(type_t *orig_type);
3728 static type_t *semantic_parameter(const source_position_t *pos,
3730 const declaration_specifiers_t *specifiers,
3731 entity_t const *const param)
3733 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
3734 * shall be adjusted to ``qualified pointer to type'',
3736 * §6.7.5.3:8 A declaration of a parameter as ``function returning
3737 * type'' shall be adjusted to ``pointer to function
3738 * returning type'', as in 6.3.2.1. */
3739 type = automatic_type_conversion(type);
3741 if (specifiers->is_inline && is_type_valid(type)) {
3742 errorf(pos, "'%N' declared 'inline'", param);
3745 /* §6.9.1:6 The declarations in the declaration list shall contain
3746 * no storage-class specifier other than register and no
3747 * initializations. */
3748 if (specifiers->thread_local || (
3749 specifiers->storage_class != STORAGE_CLASS_NONE &&
3750 specifiers->storage_class != STORAGE_CLASS_REGISTER)
3752 errorf(pos, "invalid storage class for '%N'", param);
3755 /* delay test for incomplete type, because we might have (void)
3756 * which is legal but incomplete... */
3761 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
3762 declarator_flags_t flags)
3764 parse_declarator_env_t env;
3765 memset(&env, 0, sizeof(env));
3766 env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
3768 construct_type_t *construct_type = parse_inner_declarator(&env);
3770 construct_declarator_type(construct_type, specifiers->type);
3771 type_t *type = skip_typeref(orig_type);
3773 if (construct_type != NULL) {
3774 obstack_free(&temp_obst, construct_type);
3777 attribute_t *attributes = parse_attributes(env.attributes);
3778 /* append (shared) specifier attribute behind attributes of this
3780 attribute_t **anchor = &attributes;
3781 while (*anchor != NULL)
3782 anchor = &(*anchor)->next;
3783 *anchor = specifiers->attributes;
3786 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
3787 entity = allocate_entity_zero(ENTITY_TYPEDEF, NAMESPACE_NORMAL, env.symbol);
3788 entity->base.source_position = env.source_position;
3789 entity->typedefe.type = orig_type;
3791 if (anonymous_entity != NULL) {
3792 if (is_type_compound(type)) {
3793 assert(anonymous_entity->compound.alias == NULL);
3794 assert(anonymous_entity->kind == ENTITY_STRUCT ||
3795 anonymous_entity->kind == ENTITY_UNION);
3796 anonymous_entity->compound.alias = entity;
3797 anonymous_entity = NULL;
3798 } else if (is_type_enum(type)) {
3799 assert(anonymous_entity->enume.alias == NULL);
3800 assert(anonymous_entity->kind == ENTITY_ENUM);
3801 anonymous_entity->enume.alias = entity;
3802 anonymous_entity = NULL;
3806 /* create a declaration type entity */
3807 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
3808 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, env.symbol);
3810 if (env.symbol != NULL) {
3811 if (specifiers->is_inline && is_type_valid(type)) {
3812 errorf(&env.source_position,
3813 "compound member '%Y' declared 'inline'", env.symbol);
3816 if (specifiers->thread_local ||
3817 specifiers->storage_class != STORAGE_CLASS_NONE) {
3818 errorf(&env.source_position,
3819 "compound member '%Y' must have no storage class",
3823 } else if (flags & DECL_IS_PARAMETER) {
3824 entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, env.symbol);
3825 orig_type = semantic_parameter(&env.source_position, orig_type, specifiers, entity);
3826 } else if (is_type_function(type)) {
3827 entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, env.symbol);
3828 entity->function.is_inline = specifiers->is_inline;
3829 entity->function.elf_visibility = default_visibility;
3830 entity->function.parameters = env.parameters;
3832 if (env.symbol != NULL) {
3833 /* this needs fixes for C++ */
3834 bool in_function_scope = current_function != NULL;
3836 if (specifiers->thread_local || (
3837 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3838 specifiers->storage_class != STORAGE_CLASS_NONE &&
3839 (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
3841 errorf(&env.source_position, "invalid storage class for '%N'", entity);
3845 entity = allocate_entity_zero(ENTITY_VARIABLE, NAMESPACE_NORMAL, env.symbol);
3846 entity->variable.elf_visibility = default_visibility;
3847 entity->variable.thread_local = specifiers->thread_local;
3849 if (env.symbol != NULL) {
3850 if (specifiers->is_inline && is_type_valid(type)) {
3851 errorf(&env.source_position, "'%N' declared 'inline'", entity);
3854 bool invalid_storage_class = false;
3855 if (current_scope == file_scope) {
3856 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3857 specifiers->storage_class != STORAGE_CLASS_NONE &&
3858 specifiers->storage_class != STORAGE_CLASS_STATIC) {
3859 invalid_storage_class = true;
3862 if (specifiers->thread_local &&
3863 specifiers->storage_class == STORAGE_CLASS_NONE) {
3864 invalid_storage_class = true;
3867 if (invalid_storage_class) {
3868 errorf(&env.source_position, "invalid storage class for variable '%N'", entity);
3873 entity->base.source_position = env.symbol != NULL ? env.source_position : specifiers->source_position;
3874 entity->declaration.type = orig_type;
3875 entity->declaration.alignment = get_type_alignment(orig_type);
3876 entity->declaration.modifiers = env.modifiers;
3877 entity->declaration.attributes = attributes;
3879 storage_class_t storage_class = specifiers->storage_class;
3880 entity->declaration.declared_storage_class = storage_class;
3882 if (storage_class == STORAGE_CLASS_NONE && current_function != NULL)
3883 storage_class = STORAGE_CLASS_AUTO;
3884 entity->declaration.storage_class = storage_class;
3887 if (attributes != NULL) {
3888 handle_entity_attributes(attributes, entity);
3894 static type_t *parse_abstract_declarator(type_t *base_type)
3896 parse_declarator_env_t env;
3897 memset(&env, 0, sizeof(env));
3898 env.may_be_abstract = true;
3899 env.must_be_abstract = true;
3901 construct_type_t *construct_type = parse_inner_declarator(&env);
3903 type_t *result = construct_declarator_type(construct_type, base_type);
3904 if (construct_type != NULL) {
3905 obstack_free(&temp_obst, construct_type);
3907 result = handle_type_attributes(env.attributes, result);
3913 * Check if the declaration of main is suspicious. main should be a
3914 * function with external linkage, returning int, taking either zero
3915 * arguments, two, or three arguments of appropriate types, ie.
3917 * int main([ int argc, char **argv [, char **env ] ]).
3919 * @param decl the declaration to check
3920 * @param type the function type of the declaration
3922 static void check_main(const entity_t *entity)
3924 const source_position_t *pos = &entity->base.source_position;
3925 if (entity->kind != ENTITY_FUNCTION) {
3926 warningf(WARN_MAIN, pos, "'main' is not a function");
3930 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
3931 warningf(WARN_MAIN, pos, "'main' is normally a non-static function");
3934 type_t *type = skip_typeref(entity->declaration.type);
3935 assert(is_type_function(type));
3937 function_type_t const *const func_type = &type->function;
3938 type_t *const ret_type = func_type->return_type;
3939 if (!types_compatible(skip_typeref(ret_type), type_int)) {
3940 warningf(WARN_MAIN, pos, "return type of 'main' should be 'int', but is '%T'", ret_type);
3942 const function_parameter_t *parm = func_type->parameters;
3944 type_t *const first_type = skip_typeref(parm->type);
3945 type_t *const first_type_unqual = get_unqualified_type(first_type);
3946 if (!types_compatible(first_type_unqual, type_int)) {
3947 warningf(WARN_MAIN, pos, "first argument of 'main' should be 'int', but is '%T'", parm->type);
3951 type_t *const second_type = skip_typeref(parm->type);
3952 type_t *const second_type_unqual
3953 = get_unqualified_type(second_type);
3954 if (!types_compatible(second_type_unqual, type_char_ptr_ptr)) {
3955 warningf(WARN_MAIN, pos, "second argument of 'main' should be 'char**', but is '%T'", parm->type);
3959 type_t *const third_type = skip_typeref(parm->type);
3960 type_t *const third_type_unqual
3961 = get_unqualified_type(third_type);
3962 if (!types_compatible(third_type_unqual, type_char_ptr_ptr)) {
3963 warningf(WARN_MAIN, pos, "third argument of 'main' should be 'char**', but is '%T'", parm->type);
3967 goto warn_arg_count;
3971 warningf(WARN_MAIN, pos, "'main' takes only zero, two or three arguments");
3977 * Check if a symbol is the equal to "main".
3979 static bool is_sym_main(const symbol_t *const sym)
3981 return strcmp(sym->string, "main") == 0;
3984 static void error_redefined_as_different_kind(const source_position_t *pos,
3985 const entity_t *old, entity_kind_t new_kind)
3987 char const *const what = get_entity_kind_name(new_kind);
3988 source_position_t const *const ppos = &old->base.source_position;
3989 errorf(pos, "redeclaration of '%N' as %s (declared %P)", old, what, ppos);
3992 static bool is_entity_valid(entity_t *const ent)
3994 if (is_declaration(ent)) {
3995 return is_type_valid(skip_typeref(ent->declaration.type));
3996 } else if (ent->kind == ENTITY_TYPEDEF) {
3997 return is_type_valid(skip_typeref(ent->typedefe.type));
4002 static bool contains_attribute(const attribute_t *list, const attribute_t *attr)
4004 for (const attribute_t *tattr = list; tattr != NULL; tattr = tattr->next) {
4005 if (attributes_equal(tattr, attr))
4012 * test wether new_list contains any attributes not included in old_list
4014 static bool has_new_attributes(const attribute_t *old_list,
4015 const attribute_t *new_list)
4017 for (const attribute_t *attr = new_list; attr != NULL; attr = attr->next) {
4018 if (!contains_attribute(old_list, attr))
4025 * Merge in attributes from an attribute list (probably from a previous
4026 * declaration with the same name). Warning: destroys the old structure
4027 * of the attribute list - don't reuse attributes after this call.
4029 static void merge_in_attributes(declaration_t *decl, attribute_t *attributes)
4032 for (attribute_t *attr = attributes; attr != NULL; attr = next) {
4034 if (contains_attribute(decl->attributes, attr))
4037 /* move attribute to new declarations attributes list */
4038 attr->next = decl->attributes;
4039 decl->attributes = attr;
4044 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
4045 * for various problems that occur for multiple definitions
4047 entity_t *record_entity(entity_t *entity, const bool is_definition)
4049 const symbol_t *const symbol = entity->base.symbol;
4050 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
4051 const source_position_t *pos = &entity->base.source_position;
4053 /* can happen in error cases */
4057 entity_t *const previous_entity = get_entity(symbol, namespc);
4058 /* pushing the same entity twice will break the stack structure */
4059 assert(previous_entity != entity);
4061 if (entity->kind == ENTITY_FUNCTION) {
4062 type_t *const orig_type = entity->declaration.type;
4063 type_t *const type = skip_typeref(orig_type);
4065 assert(is_type_function(type));
4066 if (type->function.unspecified_parameters &&
4067 previous_entity == NULL &&
4068 !entity->declaration.implicit) {
4069 warningf(WARN_STRICT_PROTOTYPES, pos, "function declaration '%#N' is not a prototype", entity);
4072 if (current_scope == file_scope && is_sym_main(symbol)) {
4077 if (is_declaration(entity) &&
4078 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
4079 current_scope != file_scope &&
4080 !entity->declaration.implicit) {
4081 warningf(WARN_NESTED_EXTERNS, pos, "nested extern declaration of '%#N'", entity);
4084 if (previous_entity != NULL) {
4085 source_position_t const *const ppos = &previous_entity->base.source_position;
4087 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
4088 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
4089 assert(previous_entity->kind == ENTITY_PARAMETER);
4090 errorf(pos, "declaration of '%N' redeclares the '%N' (declared %P)", entity, previous_entity, ppos);
4094 if (previous_entity->base.parent_scope == current_scope) {
4095 if (previous_entity->kind != entity->kind) {
4096 if (is_entity_valid(previous_entity) && is_entity_valid(entity)) {
4097 error_redefined_as_different_kind(pos, previous_entity,
4102 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
4103 errorf(pos, "redeclaration of '%N' (declared %P)", entity, ppos);
4106 if (previous_entity->kind == ENTITY_TYPEDEF) {
4107 type_t *const type = skip_typeref(entity->typedefe.type);
4108 type_t *const prev_type
4109 = skip_typeref(previous_entity->typedefe.type);
4110 /* gcc extension redef in system headers is allowed */
4111 if ((!(c_mode & _CXX) && !pos->is_system_header)
4112 || !types_compatible(type, prev_type)) {
4113 errorf(pos, "redefinition of '%N' (declared %P)",
4119 /* at this point we should have only VARIABLES or FUNCTIONS */
4120 assert(is_declaration(previous_entity) && is_declaration(entity));
4122 declaration_t *const prev_decl = &previous_entity->declaration;
4123 declaration_t *const decl = &entity->declaration;
4125 /* can happen for K&R style declarations */
4126 if (prev_decl->type == NULL &&
4127 previous_entity->kind == ENTITY_PARAMETER &&
4128 entity->kind == ENTITY_PARAMETER) {
4129 prev_decl->type = decl->type;
4130 prev_decl->storage_class = decl->storage_class;
4131 prev_decl->declared_storage_class = decl->declared_storage_class;
4132 prev_decl->modifiers = decl->modifiers;
4133 return previous_entity;
4136 type_t *const type = skip_typeref(decl->type);
4137 type_t *const prev_type = skip_typeref(prev_decl->type);
4139 if (!types_compatible(type, prev_type)) {
4140 errorf(pos, "declaration '%#N' is incompatible with '%#N' (declared %P)", entity, previous_entity, ppos);
4142 unsigned old_storage_class = prev_decl->storage_class;
4144 if (is_definition &&
4146 !(prev_decl->modifiers & DM_USED) &&
4147 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4148 warningf(WARN_REDUNDANT_DECLS, ppos, "unnecessary static forward declaration for '%#N'", previous_entity);
4151 storage_class_t new_storage_class = decl->storage_class;
4153 /* pretend no storage class means extern for function
4154 * declarations (except if the previous declaration is neither
4155 * none nor extern) */
4156 if (entity->kind == ENTITY_FUNCTION) {
4157 /* the previous declaration could have unspecified parameters or
4158 * be a typedef, so use the new type */
4159 if (prev_type->function.unspecified_parameters || is_definition)
4160 prev_decl->type = type;
4162 switch (old_storage_class) {
4163 case STORAGE_CLASS_NONE:
4164 old_storage_class = STORAGE_CLASS_EXTERN;
4167 case STORAGE_CLASS_EXTERN:
4168 if (is_definition) {
4169 if (prev_type->function.unspecified_parameters && !is_sym_main(symbol)) {
4170 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4172 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4173 new_storage_class = STORAGE_CLASS_EXTERN;
4180 } else if (is_type_incomplete(prev_type)) {
4181 prev_decl->type = type;
4184 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4185 new_storage_class == STORAGE_CLASS_EXTERN) {
4187 warn_redundant_declaration: ;
4189 = has_new_attributes(prev_decl->attributes,
4191 if (has_new_attrs) {
4192 merge_in_attributes(decl, prev_decl->attributes);
4193 } else if (!is_definition &&
4194 is_type_valid(prev_type) &&
4195 !pos->is_system_header) {
4196 warningf(WARN_REDUNDANT_DECLS, pos, "redundant declaration for '%Y' (declared %P)", symbol, ppos);
4198 } else if (current_function == NULL) {
4199 if (old_storage_class != STORAGE_CLASS_STATIC &&
4200 new_storage_class == STORAGE_CLASS_STATIC) {
4201 errorf(pos, "static declaration of '%Y' follows non-static declaration (declared %P)", symbol, ppos);
4202 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4203 prev_decl->storage_class = STORAGE_CLASS_NONE;
4204 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4206 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4208 goto error_redeclaration;
4209 goto warn_redundant_declaration;
4211 } else if (is_type_valid(prev_type)) {
4212 if (old_storage_class == new_storage_class) {
4213 error_redeclaration:
4214 errorf(pos, "redeclaration of '%Y' (declared %P)", symbol, ppos);
4216 errorf(pos, "redeclaration of '%Y' with different linkage (declared %P)", symbol, ppos);
4221 prev_decl->modifiers |= decl->modifiers;
4222 if (entity->kind == ENTITY_FUNCTION) {
4223 previous_entity->function.is_inline |= entity->function.is_inline;
4225 return previous_entity;
4229 if (is_warn_on(why = WARN_SHADOW) ||
4230 (is_warn_on(why = WARN_SHADOW_LOCAL) && previous_entity->base.parent_scope != file_scope)) {
4231 char const *const what = get_entity_kind_name(previous_entity->kind);
4232 warningf(why, pos, "'%N' shadows %s (declared %P)", entity, what, ppos);
4236 if (entity->kind == ENTITY_FUNCTION) {
4237 if (is_definition &&
4238 entity->declaration.storage_class != STORAGE_CLASS_STATIC &&
4239 !is_sym_main(symbol)) {
4240 if (is_warn_on(WARN_MISSING_PROTOTYPES)) {
4241 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4243 goto warn_missing_declaration;
4246 } else if (entity->kind == ENTITY_VARIABLE) {
4247 if (current_scope == file_scope &&
4248 entity->declaration.storage_class == STORAGE_CLASS_NONE &&
4249 !entity->declaration.implicit) {
4250 warn_missing_declaration:
4251 warningf(WARN_MISSING_DECLARATIONS, pos, "no previous declaration for '%#N'", entity);
4256 assert(entity->base.parent_scope == NULL);
4257 assert(current_scope != NULL);
4259 entity->base.parent_scope = current_scope;
4260 environment_push(entity);
4261 append_entity(current_scope, entity);
4266 static void parser_error_multiple_definition(entity_t *entity,
4267 const source_position_t *source_position)
4269 errorf(source_position, "multiple definition of '%Y' (declared %P)",
4270 entity->base.symbol, &entity->base.source_position);
4273 static bool is_declaration_specifier(const token_t *token)
4275 switch (token->kind) {
4279 return is_typedef_symbol(token->identifier.symbol);
4286 static void parse_init_declarator_rest(entity_t *entity)
4288 type_t *orig_type = type_error_type;
4290 if (entity->base.kind == ENTITY_TYPEDEF) {
4291 source_position_t const *const pos = &entity->base.source_position;
4292 errorf(pos, "'%N' is initialized (use __typeof__ instead)", entity);
4294 assert(is_declaration(entity));
4295 orig_type = entity->declaration.type;
4298 type_t *type = skip_typeref(orig_type);
4300 if (entity->kind == ENTITY_VARIABLE
4301 && entity->variable.initializer != NULL) {
4302 parser_error_multiple_definition(entity, HERE);
4306 declaration_t *const declaration = &entity->declaration;
4307 bool must_be_constant = false;
4308 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4309 entity->base.parent_scope == file_scope) {
4310 must_be_constant = true;
4313 if (is_type_function(type)) {
4314 source_position_t const *const pos = &entity->base.source_position;
4315 errorf(pos, "'%N' is initialized like a variable", entity);
4316 orig_type = type_error_type;
4319 parse_initializer_env_t env;
4320 env.type = orig_type;
4321 env.must_be_constant = must_be_constant;
4322 env.entity = entity;
4324 initializer_t *initializer = parse_initializer(&env);
4326 if (entity->kind == ENTITY_VARIABLE) {
4327 /* §6.7.5:22 array initializers for arrays with unknown size
4328 * determine the array type size */
4329 declaration->type = env.type;
4330 entity->variable.initializer = initializer;
4334 /* parse rest of a declaration without any declarator */
4335 static void parse_anonymous_declaration_rest(
4336 const declaration_specifiers_t *specifiers)
4339 anonymous_entity = NULL;
4341 source_position_t const *const pos = &specifiers->source_position;
4342 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4343 specifiers->thread_local) {
4344 warningf(WARN_OTHER, pos, "useless storage class in empty declaration");
4347 type_t *type = specifiers->type;
4348 switch (type->kind) {
4349 case TYPE_COMPOUND_STRUCT:
4350 case TYPE_COMPOUND_UNION: {
4351 if (type->compound.compound->base.symbol == NULL) {
4352 warningf(WARN_OTHER, pos, "unnamed struct/union that defines no instances");
4361 warningf(WARN_OTHER, pos, "empty declaration");
4366 static void check_variable_type_complete(entity_t *ent)
4368 if (ent->kind != ENTITY_VARIABLE)
4371 /* §6.7:7 If an identifier for an object is declared with no linkage, the
4372 * type for the object shall be complete [...] */
4373 declaration_t *decl = &ent->declaration;
4374 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4375 decl->storage_class == STORAGE_CLASS_STATIC)
4378 type_t *const type = skip_typeref(decl->type);
4379 if (!is_type_incomplete(type))
4382 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4383 * are given length one. */
4384 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4385 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4389 errorf(&ent->base.source_position, "variable '%#N' has incomplete type", ent);
4393 static void parse_declaration_rest(entity_t *ndeclaration,
4394 const declaration_specifiers_t *specifiers,
4395 parsed_declaration_func finished_declaration,
4396 declarator_flags_t flags)
4398 add_anchor_token(';');
4399 add_anchor_token(',');
4401 entity_t *entity = finished_declaration(ndeclaration, token.kind == '=');
4403 if (token.kind == '=') {
4404 parse_init_declarator_rest(entity);
4405 } else if (entity->kind == ENTITY_VARIABLE) {
4406 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
4407 * [...] where the extern specifier is explicitly used. */
4408 declaration_t *decl = &entity->declaration;
4409 if (decl->storage_class != STORAGE_CLASS_EXTERN) {
4410 type_t *type = decl->type;
4411 if (is_type_reference(skip_typeref(type))) {
4412 source_position_t const *const pos = &entity->base.source_position;
4413 errorf(pos, "reference '%#N' must be initialized", entity);
4418 check_variable_type_complete(entity);
4423 add_anchor_token('=');
4424 ndeclaration = parse_declarator(specifiers, flags);
4425 rem_anchor_token('=');
4427 expect(';', end_error);
4430 anonymous_entity = NULL;
4431 rem_anchor_token(';');
4432 rem_anchor_token(',');
4435 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4437 symbol_t *symbol = entity->base.symbol;
4441 assert(entity->base.namespc == NAMESPACE_NORMAL);
4442 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4443 if (previous_entity == NULL
4444 || previous_entity->base.parent_scope != current_scope) {
4445 errorf(&entity->base.source_position, "expected declaration of a function parameter, found '%Y'",
4450 if (is_definition) {
4451 errorf(HERE, "'%N' is initialised", entity);
4454 return record_entity(entity, false);
4457 static void parse_declaration(parsed_declaration_func finished_declaration,
4458 declarator_flags_t flags)
4460 add_anchor_token(';');
4461 declaration_specifiers_t specifiers;
4462 parse_declaration_specifiers(&specifiers);
4463 rem_anchor_token(';');
4465 if (token.kind == ';') {
4466 parse_anonymous_declaration_rest(&specifiers);
4468 entity_t *entity = parse_declarator(&specifiers, flags);
4469 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4474 static type_t *get_default_promoted_type(type_t *orig_type)
4476 type_t *result = orig_type;
4478 type_t *type = skip_typeref(orig_type);
4479 if (is_type_integer(type)) {
4480 result = promote_integer(type);
4481 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4482 result = type_double;
4488 static void parse_kr_declaration_list(entity_t *entity)
4490 if (entity->kind != ENTITY_FUNCTION)
4493 type_t *type = skip_typeref(entity->declaration.type);
4494 assert(is_type_function(type));
4495 if (!type->function.kr_style_parameters)
4498 add_anchor_token('{');
4500 PUSH_SCOPE(&entity->function.parameters);
4502 entity_t *parameter = entity->function.parameters.entities;
4503 for ( ; parameter != NULL; parameter = parameter->base.next) {
4504 assert(parameter->base.parent_scope == NULL);
4505 parameter->base.parent_scope = current_scope;
4506 environment_push(parameter);
4509 /* parse declaration list */
4511 switch (token.kind) {
4513 /* This covers symbols, which are no type, too, and results in
4514 * better error messages. The typical cases are misspelled type
4515 * names and missing includes. */
4517 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4527 /* update function type */
4528 type_t *new_type = duplicate_type(type);
4530 function_parameter_t *parameters = NULL;
4531 function_parameter_t **anchor = ¶meters;
4533 /* did we have an earlier prototype? */
4534 entity_t *proto_type = get_entity(entity->base.symbol, NAMESPACE_NORMAL);
4535 if (proto_type != NULL && proto_type->kind != ENTITY_FUNCTION)
4538 function_parameter_t *proto_parameter = NULL;
4539 if (proto_type != NULL) {
4540 type_t *proto_type_type = proto_type->declaration.type;
4541 proto_parameter = proto_type_type->function.parameters;
4542 /* If a K&R function definition has a variadic prototype earlier, then
4543 * make the function definition variadic, too. This should conform to
4544 * §6.7.5.3:15 and §6.9.1:8. */
4545 new_type->function.variadic = proto_type_type->function.variadic;
4547 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
4549 new_type->function.unspecified_parameters = true;
4552 bool need_incompatible_warning = false;
4553 parameter = entity->function.parameters.entities;
4554 for (; parameter != NULL; parameter = parameter->base.next,
4556 proto_parameter == NULL ? NULL : proto_parameter->next) {
4557 if (parameter->kind != ENTITY_PARAMETER)
4560 type_t *parameter_type = parameter->declaration.type;
4561 if (parameter_type == NULL) {
4562 source_position_t const* const pos = ¶meter->base.source_position;
4564 errorf(pos, "no type specified for function '%N'", parameter);
4565 parameter_type = type_error_type;
4567 warningf(WARN_IMPLICIT_INT, pos, "no type specified for function parameter '%N', using 'int'", parameter);
4568 parameter_type = type_int;
4570 parameter->declaration.type = parameter_type;
4573 semantic_parameter_incomplete(parameter);
4575 /* we need the default promoted types for the function type */
4576 type_t *not_promoted = parameter_type;
4577 parameter_type = get_default_promoted_type(parameter_type);
4579 /* gcc special: if the type of the prototype matches the unpromoted
4580 * type don't promote */
4581 if (!strict_mode && proto_parameter != NULL) {
4582 type_t *proto_p_type = skip_typeref(proto_parameter->type);
4583 type_t *promo_skip = skip_typeref(parameter_type);
4584 type_t *param_skip = skip_typeref(not_promoted);
4585 if (!types_compatible(proto_p_type, promo_skip)
4586 && types_compatible(proto_p_type, param_skip)) {
4588 need_incompatible_warning = true;
4589 parameter_type = not_promoted;
4592 function_parameter_t *const function_parameter
4593 = allocate_parameter(parameter_type);
4595 *anchor = function_parameter;
4596 anchor = &function_parameter->next;
4599 new_type->function.parameters = parameters;
4600 new_type = identify_new_type(new_type);
4602 if (need_incompatible_warning) {
4603 symbol_t const *const sym = entity->base.symbol;
4604 source_position_t const *const pos = &entity->base.source_position;
4605 source_position_t const *const ppos = &proto_type->base.source_position;
4606 warningf(WARN_OTHER, pos, "declaration '%#N' is incompatible with '%#T' (declared %P)", proto_type, new_type, sym, ppos);
4608 entity->declaration.type = new_type;
4610 rem_anchor_token('{');
4613 static bool first_err = true;
4616 * When called with first_err set, prints the name of the current function,
4619 static void print_in_function(void)
4623 char const *const file = current_function->base.base.source_position.input_name;
4624 diagnosticf("%s: In '%N':\n", file, (entity_t const*)current_function);
4629 * Check if all labels are defined in the current function.
4630 * Check if all labels are used in the current function.
4632 static void check_labels(void)
4634 for (const goto_statement_t *goto_statement = goto_first;
4635 goto_statement != NULL;
4636 goto_statement = goto_statement->next) {
4637 /* skip computed gotos */
4638 if (goto_statement->expression != NULL)
4641 label_t *label = goto_statement->label;
4642 if (label->base.source_position.input_name == NULL) {
4643 print_in_function();
4644 source_position_t const *const pos = &goto_statement->base.source_position;
4645 errorf(pos, "'%N' used but not defined", (entity_t const*)label);
4649 if (is_warn_on(WARN_UNUSED_LABEL)) {
4650 for (const label_statement_t *label_statement = label_first;
4651 label_statement != NULL;
4652 label_statement = label_statement->next) {
4653 label_t *label = label_statement->label;
4655 if (! label->used) {
4656 print_in_function();
4657 source_position_t const *const pos = &label_statement->base.source_position;
4658 warningf(WARN_UNUSED_LABEL, pos, "'%N' defined but not used", (entity_t const*)label);
4664 static void warn_unused_entity(warning_t const why, entity_t *entity, entity_t *const last)
4666 entity_t const *const end = last != NULL ? last->base.next : NULL;
4667 for (; entity != end; entity = entity->base.next) {
4668 if (!is_declaration(entity))
4671 declaration_t *declaration = &entity->declaration;
4672 if (declaration->implicit)
4675 if (!declaration->used) {
4676 print_in_function();
4677 warningf(why, &entity->base.source_position, "'%N' is unused", entity);
4678 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
4679 print_in_function();
4680 warningf(why, &entity->base.source_position, "'%N' is never read", entity);
4685 static void check_unused_variables(statement_t *const stmt, void *const env)
4689 switch (stmt->kind) {
4690 case STATEMENT_DECLARATION: {
4691 declaration_statement_t const *const decls = &stmt->declaration;
4692 warn_unused_entity(WARN_UNUSED_VARIABLE, decls->declarations_begin, decls->declarations_end);
4697 warn_unused_entity(WARN_UNUSED_VARIABLE, stmt->fors.scope.entities, NULL);
4706 * Check declarations of current_function for unused entities.
4708 static void check_declarations(void)
4710 if (is_warn_on(WARN_UNUSED_PARAMETER)) {
4711 const scope_t *scope = ¤t_function->parameters;
4713 /* do not issue unused warnings for main */
4714 if (!is_sym_main(current_function->base.base.symbol)) {
4715 warn_unused_entity(WARN_UNUSED_PARAMETER, scope->entities, NULL);
4718 if (is_warn_on(WARN_UNUSED_VARIABLE)) {
4719 walk_statements(current_function->statement, check_unused_variables,
4724 static int determine_truth(expression_t const* const cond)
4727 is_constant_expression(cond) != EXPR_CLASS_CONSTANT ? 0 :
4728 fold_constant_to_bool(cond) ? 1 :
4732 static void check_reachable(statement_t *);
4733 static bool reaches_end;
4735 static bool expression_returns(expression_t const *const expr)
4737 switch (expr->kind) {
4739 expression_t const *const func = expr->call.function;
4740 if (func->kind == EXPR_REFERENCE) {
4741 entity_t *entity = func->reference.entity;
4742 if (entity->kind == ENTITY_FUNCTION
4743 && entity->declaration.modifiers & DM_NORETURN)
4747 if (!expression_returns(func))
4750 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
4751 if (!expression_returns(arg->expression))
4758 case EXPR_REFERENCE:
4759 case EXPR_REFERENCE_ENUM_VALUE:
4761 case EXPR_STRING_LITERAL:
4762 case EXPR_WIDE_STRING_LITERAL:
4763 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
4764 case EXPR_LABEL_ADDRESS:
4765 case EXPR_CLASSIFY_TYPE:
4766 case EXPR_SIZEOF: // TODO handle obscure VLA case
4769 case EXPR_BUILTIN_CONSTANT_P:
4770 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
4775 case EXPR_STATEMENT: {
4776 bool old_reaches_end = reaches_end;
4777 reaches_end = false;
4778 check_reachable(expr->statement.statement);
4779 bool returns = reaches_end;
4780 reaches_end = old_reaches_end;
4784 case EXPR_CONDITIONAL:
4785 // TODO handle constant expression
4787 if (!expression_returns(expr->conditional.condition))
4790 if (expr->conditional.true_expression != NULL
4791 && expression_returns(expr->conditional.true_expression))
4794 return expression_returns(expr->conditional.false_expression);
4797 return expression_returns(expr->select.compound);
4799 case EXPR_ARRAY_ACCESS:
4801 expression_returns(expr->array_access.array_ref) &&
4802 expression_returns(expr->array_access.index);
4805 return expression_returns(expr->va_starte.ap);
4808 return expression_returns(expr->va_arge.ap);
4811 return expression_returns(expr->va_copye.src);
4813 EXPR_UNARY_CASES_MANDATORY
4814 return expression_returns(expr->unary.value);
4816 case EXPR_UNARY_THROW:
4820 // TODO handle constant lhs of && and ||
4822 expression_returns(expr->binary.left) &&
4823 expression_returns(expr->binary.right);
4826 panic("unhandled expression");
4829 static bool initializer_returns(initializer_t const *const init)
4831 switch (init->kind) {
4832 case INITIALIZER_VALUE:
4833 return expression_returns(init->value.value);
4835 case INITIALIZER_LIST: {
4836 initializer_t * const* i = init->list.initializers;
4837 initializer_t * const* const end = i + init->list.len;
4838 bool returns = true;
4839 for (; i != end; ++i) {
4840 if (!initializer_returns(*i))
4846 case INITIALIZER_STRING:
4847 case INITIALIZER_WIDE_STRING:
4848 case INITIALIZER_DESIGNATOR: // designators have no payload
4851 panic("unhandled initializer");
4854 static bool noreturn_candidate;
4856 static void check_reachable(statement_t *const stmt)
4858 if (stmt->base.reachable)
4860 if (stmt->kind != STATEMENT_DO_WHILE)
4861 stmt->base.reachable = true;
4863 statement_t *last = stmt;
4865 switch (stmt->kind) {
4866 case STATEMENT_ERROR:
4867 case STATEMENT_EMPTY:
4869 next = stmt->base.next;
4872 case STATEMENT_DECLARATION: {
4873 declaration_statement_t const *const decl = &stmt->declaration;
4874 entity_t const * ent = decl->declarations_begin;
4875 entity_t const *const last_decl = decl->declarations_end;
4877 for (;; ent = ent->base.next) {
4878 if (ent->kind == ENTITY_VARIABLE &&
4879 ent->variable.initializer != NULL &&
4880 !initializer_returns(ent->variable.initializer)) {
4883 if (ent == last_decl)
4887 next = stmt->base.next;
4891 case STATEMENT_COMPOUND:
4892 next = stmt->compound.statements;
4894 next = stmt->base.next;
4897 case STATEMENT_RETURN: {
4898 expression_t const *const val = stmt->returns.value;
4899 if (val == NULL || expression_returns(val))
4900 noreturn_candidate = false;
4904 case STATEMENT_IF: {
4905 if_statement_t const *const ifs = &stmt->ifs;
4906 expression_t const *const cond = ifs->condition;
4908 if (!expression_returns(cond))
4911 int const val = determine_truth(cond);
4914 check_reachable(ifs->true_statement);
4919 if (ifs->false_statement != NULL) {
4920 check_reachable(ifs->false_statement);
4924 next = stmt->base.next;
4928 case STATEMENT_SWITCH: {
4929 switch_statement_t const *const switchs = &stmt->switchs;
4930 expression_t const *const expr = switchs->expression;
4932 if (!expression_returns(expr))
4935 if (is_constant_expression(expr) == EXPR_CLASS_CONSTANT) {
4936 long const val = fold_constant_to_int(expr);
4937 case_label_statement_t * defaults = NULL;
4938 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4939 if (i->expression == NULL) {
4944 if (i->first_case <= val && val <= i->last_case) {
4945 check_reachable((statement_t*)i);
4950 if (defaults != NULL) {
4951 check_reachable((statement_t*)defaults);
4955 bool has_default = false;
4956 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4957 if (i->expression == NULL)
4960 check_reachable((statement_t*)i);
4967 next = stmt->base.next;
4971 case STATEMENT_EXPRESSION: {
4972 /* Check for noreturn function call */
4973 expression_t const *const expr = stmt->expression.expression;
4974 if (!expression_returns(expr))
4977 next = stmt->base.next;
4981 case STATEMENT_CONTINUE:
4982 for (statement_t *parent = stmt;;) {
4983 parent = parent->base.parent;
4984 if (parent == NULL) /* continue not within loop */
4988 switch (parent->kind) {
4989 case STATEMENT_WHILE: goto continue_while;
4990 case STATEMENT_DO_WHILE: goto continue_do_while;
4991 case STATEMENT_FOR: goto continue_for;
4997 case STATEMENT_BREAK:
4998 for (statement_t *parent = stmt;;) {
4999 parent = parent->base.parent;
5000 if (parent == NULL) /* break not within loop/switch */
5003 switch (parent->kind) {
5004 case STATEMENT_SWITCH:
5005 case STATEMENT_WHILE:
5006 case STATEMENT_DO_WHILE:
5009 next = parent->base.next;
5010 goto found_break_parent;
5018 case STATEMENT_GOTO:
5019 if (stmt->gotos.expression) {
5020 if (!expression_returns(stmt->gotos.expression))
5023 statement_t *parent = stmt->base.parent;
5024 if (parent == NULL) /* top level goto */
5028 next = stmt->gotos.label->statement;
5029 if (next == NULL) /* missing label */
5034 case STATEMENT_LABEL:
5035 next = stmt->label.statement;
5038 case STATEMENT_CASE_LABEL:
5039 next = stmt->case_label.statement;
5042 case STATEMENT_WHILE: {
5043 while_statement_t const *const whiles = &stmt->whiles;
5044 expression_t const *const cond = whiles->condition;
5046 if (!expression_returns(cond))
5049 int const val = determine_truth(cond);
5052 check_reachable(whiles->body);
5057 next = stmt->base.next;
5061 case STATEMENT_DO_WHILE:
5062 next = stmt->do_while.body;
5065 case STATEMENT_FOR: {
5066 for_statement_t *const fors = &stmt->fors;
5068 if (fors->condition_reachable)
5070 fors->condition_reachable = true;
5072 expression_t const *const cond = fors->condition;
5077 } else if (expression_returns(cond)) {
5078 val = determine_truth(cond);
5084 check_reachable(fors->body);
5089 next = stmt->base.next;
5093 case STATEMENT_MS_TRY: {
5094 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5095 check_reachable(ms_try->try_statement);
5096 next = ms_try->final_statement;
5100 case STATEMENT_LEAVE: {
5101 statement_t *parent = stmt;
5103 parent = parent->base.parent;
5104 if (parent == NULL) /* __leave not within __try */
5107 if (parent->kind == STATEMENT_MS_TRY) {
5109 next = parent->ms_try.final_statement;
5117 panic("invalid statement kind");
5120 while (next == NULL) {
5121 next = last->base.parent;
5123 noreturn_candidate = false;
5125 type_t *const type = skip_typeref(current_function->base.type);
5126 assert(is_type_function(type));
5127 type_t *const ret = skip_typeref(type->function.return_type);
5128 if (!is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
5129 is_type_valid(ret) &&
5130 !is_sym_main(current_function->base.base.symbol)) {
5131 source_position_t const *const pos = &stmt->base.source_position;
5132 warningf(WARN_RETURN_TYPE, pos, "control reaches end of non-void function");
5137 switch (next->kind) {
5138 case STATEMENT_ERROR:
5139 case STATEMENT_EMPTY:
5140 case STATEMENT_DECLARATION:
5141 case STATEMENT_EXPRESSION:
5143 case STATEMENT_RETURN:
5144 case STATEMENT_CONTINUE:
5145 case STATEMENT_BREAK:
5146 case STATEMENT_GOTO:
5147 case STATEMENT_LEAVE:
5148 panic("invalid control flow in function");
5150 case STATEMENT_COMPOUND:
5151 if (next->compound.stmt_expr) {
5157 case STATEMENT_SWITCH:
5158 case STATEMENT_LABEL:
5159 case STATEMENT_CASE_LABEL:
5161 next = next->base.next;
5164 case STATEMENT_WHILE: {
5166 if (next->base.reachable)
5168 next->base.reachable = true;
5170 while_statement_t const *const whiles = &next->whiles;
5171 expression_t const *const cond = whiles->condition;
5173 if (!expression_returns(cond))
5176 int const val = determine_truth(cond);
5179 check_reachable(whiles->body);
5185 next = next->base.next;
5189 case STATEMENT_DO_WHILE: {
5191 if (next->base.reachable)
5193 next->base.reachable = true;
5195 do_while_statement_t const *const dw = &next->do_while;
5196 expression_t const *const cond = dw->condition;
5198 if (!expression_returns(cond))
5201 int const val = determine_truth(cond);
5204 check_reachable(dw->body);
5210 next = next->base.next;
5214 case STATEMENT_FOR: {
5216 for_statement_t *const fors = &next->fors;
5218 fors->step_reachable = true;
5220 if (fors->condition_reachable)
5222 fors->condition_reachable = true;
5224 expression_t const *const cond = fors->condition;
5229 } else if (expression_returns(cond)) {
5230 val = determine_truth(cond);
5236 check_reachable(fors->body);
5242 next = next->base.next;
5246 case STATEMENT_MS_TRY:
5248 next = next->ms_try.final_statement;
5253 check_reachable(next);
5256 static void check_unreachable(statement_t* const stmt, void *const env)
5260 switch (stmt->kind) {
5261 case STATEMENT_DO_WHILE:
5262 if (!stmt->base.reachable) {
5263 expression_t const *const cond = stmt->do_while.condition;
5264 if (determine_truth(cond) >= 0) {
5265 source_position_t const *const pos = &cond->base.source_position;
5266 warningf(WARN_UNREACHABLE_CODE, pos, "condition of do-while-loop is unreachable");
5271 case STATEMENT_FOR: {
5272 for_statement_t const* const fors = &stmt->fors;
5274 // if init and step are unreachable, cond is unreachable, too
5275 if (!stmt->base.reachable && !fors->step_reachable) {
5276 goto warn_unreachable;
5278 if (!stmt->base.reachable && fors->initialisation != NULL) {
5279 source_position_t const *const pos = &fors->initialisation->base.source_position;
5280 warningf(WARN_UNREACHABLE_CODE, pos, "initialisation of for-statement is unreachable");
5283 if (!fors->condition_reachable && fors->condition != NULL) {
5284 source_position_t const *const pos = &fors->condition->base.source_position;
5285 warningf(WARN_UNREACHABLE_CODE, pos, "condition of for-statement is unreachable");
5288 if (!fors->step_reachable && fors->step != NULL) {
5289 source_position_t const *const pos = &fors->step->base.source_position;
5290 warningf(WARN_UNREACHABLE_CODE, pos, "step of for-statement is unreachable");
5296 case STATEMENT_COMPOUND:
5297 if (stmt->compound.statements != NULL)
5299 goto warn_unreachable;
5301 case STATEMENT_DECLARATION: {
5302 /* Only warn if there is at least one declarator with an initializer.
5303 * This typically occurs in switch statements. */
5304 declaration_statement_t const *const decl = &stmt->declaration;
5305 entity_t const * ent = decl->declarations_begin;
5306 entity_t const *const last = decl->declarations_end;
5308 for (;; ent = ent->base.next) {
5309 if (ent->kind == ENTITY_VARIABLE &&
5310 ent->variable.initializer != NULL) {
5311 goto warn_unreachable;
5321 if (!stmt->base.reachable) {
5322 source_position_t const *const pos = &stmt->base.source_position;
5323 warningf(WARN_UNREACHABLE_CODE, pos, "statement is unreachable");
5329 static void parse_external_declaration(void)
5331 /* function-definitions and declarations both start with declaration
5333 add_anchor_token(';');
5334 declaration_specifiers_t specifiers;
5335 parse_declaration_specifiers(&specifiers);
5336 rem_anchor_token(';');
5338 /* must be a declaration */
5339 if (token.kind == ';') {
5340 parse_anonymous_declaration_rest(&specifiers);
5344 add_anchor_token(',');
5345 add_anchor_token('=');
5346 add_anchor_token(';');
5347 add_anchor_token('{');
5349 /* declarator is common to both function-definitions and declarations */
5350 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
5352 rem_anchor_token('{');
5353 rem_anchor_token(';');
5354 rem_anchor_token('=');
5355 rem_anchor_token(',');
5357 /* must be a declaration */
5358 switch (token.kind) {
5362 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
5367 /* must be a function definition */
5368 parse_kr_declaration_list(ndeclaration);
5370 if (token.kind != '{') {
5371 parse_error_expected("while parsing function definition", '{', NULL);
5372 eat_until_matching_token(';');
5376 assert(is_declaration(ndeclaration));
5377 type_t *const orig_type = ndeclaration->declaration.type;
5378 type_t * type = skip_typeref(orig_type);
5380 if (!is_type_function(type)) {
5381 if (is_type_valid(type)) {
5382 errorf(HERE, "declarator '%#N' has a body but is not a function type", ndeclaration);
5388 source_position_t const *const pos = &ndeclaration->base.source_position;
5389 if (is_typeref(orig_type)) {
5391 errorf(pos, "type of function definition '%#N' is a typedef", ndeclaration);
5394 if (is_type_compound(skip_typeref(type->function.return_type))) {
5395 warningf(WARN_AGGREGATE_RETURN, pos, "'%N' returns an aggregate", ndeclaration);
5397 if (type->function.unspecified_parameters) {
5398 warningf(WARN_OLD_STYLE_DEFINITION, pos, "old-style definition of '%N'", ndeclaration);
5400 warningf(WARN_TRADITIONAL, pos, "traditional C rejects ISO C style definition of '%N'", ndeclaration);
5403 /* §6.7.5.3:14 a function definition with () means no
5404 * parameters (and not unspecified parameters) */
5405 if (type->function.unspecified_parameters &&
5406 type->function.parameters == NULL) {
5407 type_t *copy = duplicate_type(type);
5408 copy->function.unspecified_parameters = false;
5409 type = identify_new_type(copy);
5411 ndeclaration->declaration.type = type;
5414 entity_t *const entity = record_entity(ndeclaration, true);
5415 assert(entity->kind == ENTITY_FUNCTION);
5416 assert(ndeclaration->kind == ENTITY_FUNCTION);
5418 function_t *const function = &entity->function;
5419 if (ndeclaration != entity) {
5420 function->parameters = ndeclaration->function.parameters;
5422 assert(is_declaration(entity));
5423 type = skip_typeref(entity->declaration.type);
5425 PUSH_SCOPE(&function->parameters);
5427 entity_t *parameter = function->parameters.entities;
5428 for (; parameter != NULL; parameter = parameter->base.next) {
5429 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5430 parameter->base.parent_scope = current_scope;
5432 assert(parameter->base.parent_scope == NULL
5433 || parameter->base.parent_scope == current_scope);
5434 parameter->base.parent_scope = current_scope;
5435 if (parameter->base.symbol == NULL) {
5436 errorf(¶meter->base.source_position, "parameter name omitted");
5439 environment_push(parameter);
5442 if (function->statement != NULL) {
5443 parser_error_multiple_definition(entity, HERE);
5446 /* parse function body */
5447 int label_stack_top = label_top();
5448 function_t *old_current_function = current_function;
5449 entity_t *old_current_entity = current_entity;
5450 current_function = function;
5451 current_entity = entity;
5455 goto_anchor = &goto_first;
5457 label_anchor = &label_first;
5459 statement_t *const body = parse_compound_statement(false);
5460 function->statement = body;
5463 check_declarations();
5464 if (is_warn_on(WARN_RETURN_TYPE) ||
5465 is_warn_on(WARN_UNREACHABLE_CODE) ||
5466 (is_warn_on(WARN_MISSING_NORETURN) && !(function->base.modifiers & DM_NORETURN))) {
5467 noreturn_candidate = true;
5468 check_reachable(body);
5469 if (is_warn_on(WARN_UNREACHABLE_CODE))
5470 walk_statements(body, check_unreachable, NULL);
5471 if (noreturn_candidate &&
5472 !(function->base.modifiers & DM_NORETURN)) {
5473 source_position_t const *const pos = &body->base.source_position;
5474 warningf(WARN_MISSING_NORETURN, pos, "function '%#N' is candidate for attribute 'noreturn'", entity);
5479 assert(current_function == function);
5480 assert(current_entity == entity);
5481 current_entity = old_current_entity;
5482 current_function = old_current_function;
5483 label_pop_to(label_stack_top);
5489 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
5491 entity_t *iter = compound->members.entities;
5492 for (; iter != NULL; iter = iter->base.next) {
5493 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5496 if (iter->base.symbol == symbol) {
5498 } else if (iter->base.symbol == NULL) {
5499 /* search in anonymous structs and unions */
5500 type_t *type = skip_typeref(iter->declaration.type);
5501 if (is_type_compound(type)) {
5502 if (find_compound_entry(type->compound.compound, symbol)
5513 static void check_deprecated(const source_position_t *source_position,
5514 const entity_t *entity)
5516 if (!is_declaration(entity))
5518 if ((entity->declaration.modifiers & DM_DEPRECATED) == 0)
5521 source_position_t const *const epos = &entity->base.source_position;
5522 char const *const msg = get_deprecated_string(entity->declaration.attributes);
5524 warningf(WARN_DEPRECATED_DECLARATIONS, source_position, "'%N' is deprecated (declared %P): \"%s\"", entity, epos, msg);
5526 warningf(WARN_DEPRECATED_DECLARATIONS, source_position, "'%N' is deprecated (declared %P)", entity, epos);
5531 static expression_t *create_select(const source_position_t *pos,
5533 type_qualifiers_t qualifiers,
5536 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
5538 check_deprecated(pos, entry);
5540 expression_t *select = allocate_expression_zero(EXPR_SELECT);
5541 select->select.compound = addr;
5542 select->select.compound_entry = entry;
5544 type_t *entry_type = entry->declaration.type;
5545 type_t *res_type = get_qualified_type(entry_type, qualifiers);
5547 /* bitfields need special treatment */
5548 if (entry->compound_member.bitfield) {
5549 unsigned bit_size = entry->compound_member.bit_size;
5550 /* if fewer bits than an int, convert to int (see §6.3.1.1) */
5551 if (bit_size < get_atomic_type_size(ATOMIC_TYPE_INT) * BITS_PER_BYTE) {
5552 res_type = type_int;
5556 /* we always do the auto-type conversions; the & and sizeof parser contains
5557 * code to revert this! */
5558 select->base.type = automatic_type_conversion(res_type);
5565 * Find entry with symbol in compound. Search anonymous structs and unions and
5566 * creates implicit select expressions for them.
5567 * Returns the adress for the innermost compound.
5569 static expression_t *find_create_select(const source_position_t *pos,
5571 type_qualifiers_t qualifiers,
5572 compound_t *compound, symbol_t *symbol)
5574 entity_t *iter = compound->members.entities;
5575 for (; iter != NULL; iter = iter->base.next) {
5576 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5579 symbol_t *iter_symbol = iter->base.symbol;
5580 if (iter_symbol == NULL) {
5581 type_t *type = iter->declaration.type;
5582 if (type->kind != TYPE_COMPOUND_STRUCT
5583 && type->kind != TYPE_COMPOUND_UNION)
5586 compound_t *sub_compound = type->compound.compound;
5588 if (find_compound_entry(sub_compound, symbol) == NULL)
5591 expression_t *sub_addr = create_select(pos, addr, qualifiers, iter);
5592 sub_addr->base.source_position = *pos;
5593 sub_addr->base.implicit = true;
5594 return find_create_select(pos, sub_addr, qualifiers, sub_compound,
5598 if (iter_symbol == symbol) {
5599 return create_select(pos, addr, qualifiers, iter);
5606 static void parse_bitfield_member(entity_t *entity)
5610 expression_t *size = parse_constant_expression();
5613 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5614 type_t *type = entity->declaration.type;
5615 if (!is_type_integer(skip_typeref(type))) {
5616 errorf(HERE, "bitfield base type '%T' is not an integer type",
5620 if (is_constant_expression(size) != EXPR_CLASS_CONSTANT) {
5621 /* error already reported by parse_constant_expression */
5622 size_long = get_type_size(type) * 8;
5624 size_long = fold_constant_to_int(size);
5626 const symbol_t *symbol = entity->base.symbol;
5627 const symbol_t *user_symbol
5628 = symbol == NULL ? sym_anonymous : symbol;
5629 unsigned bit_size = get_type_size(type) * 8;
5630 if (size_long < 0) {
5631 errorf(HERE, "negative width in bit-field '%Y'", user_symbol);
5632 } else if (size_long == 0 && symbol != NULL) {
5633 errorf(HERE, "zero width for bit-field '%Y'", user_symbol);
5634 } else if (bit_size > 0 && (unsigned)size_long > bit_size) {
5635 errorf(HERE, "width of bitfield '%Y' exceeds its type",
5638 /* hope that people don't invent crazy types with more bits
5639 * than our struct can hold */
5641 (1 << sizeof(entity->compound_member.bit_size)*8));
5645 entity->compound_member.bitfield = true;
5646 entity->compound_member.bit_size = (unsigned char)size_long;
5649 static void parse_compound_declarators(compound_t *compound,
5650 const declaration_specifiers_t *specifiers)
5655 if (token.kind == ':') {
5656 /* anonymous bitfield */
5657 type_t *type = specifiers->type;
5658 entity_t *entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER,
5659 NAMESPACE_NORMAL, NULL);
5660 entity->base.source_position = *HERE;
5661 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
5662 entity->declaration.storage_class = STORAGE_CLASS_NONE;
5663 entity->declaration.type = type;
5665 parse_bitfield_member(entity);
5667 attribute_t *attributes = parse_attributes(NULL);
5668 attribute_t **anchor = &attributes;
5669 while (*anchor != NULL)
5670 anchor = &(*anchor)->next;
5671 *anchor = specifiers->attributes;
5672 if (attributes != NULL) {
5673 handle_entity_attributes(attributes, entity);
5675 entity->declaration.attributes = attributes;
5677 append_entity(&compound->members, entity);
5679 entity = parse_declarator(specifiers,
5680 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
5681 source_position_t const *const pos = &entity->base.source_position;
5682 if (entity->kind == ENTITY_TYPEDEF) {
5683 errorf(pos, "typedef not allowed as compound member");
5685 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5687 /* make sure we don't define a symbol multiple times */
5688 symbol_t *symbol = entity->base.symbol;
5689 if (symbol != NULL) {
5690 entity_t *prev = find_compound_entry(compound, symbol);
5692 source_position_t const *const ppos = &prev->base.source_position;
5693 errorf(pos, "multiple declarations of symbol '%Y' (declared %P)", symbol, ppos);
5697 if (token.kind == ':') {
5698 parse_bitfield_member(entity);
5700 attribute_t *attributes = parse_attributes(NULL);
5701 handle_entity_attributes(attributes, entity);
5703 type_t *orig_type = entity->declaration.type;
5704 type_t *type = skip_typeref(orig_type);
5705 if (is_type_function(type)) {
5706 errorf(pos, "'%N' must not have function type '%T'", entity, orig_type);
5707 } else if (is_type_incomplete(type)) {
5708 /* §6.7.2.1:16 flexible array member */
5709 if (!is_type_array(type) ||
5710 token.kind != ';' ||
5711 look_ahead(1)->kind != '}') {
5712 errorf(pos, "'%N' has incomplete type '%T'", entity, orig_type);
5717 append_entity(&compound->members, entity);
5720 } while (next_if(','));
5721 expect(';', end_error);
5724 anonymous_entity = NULL;
5727 static void parse_compound_type_entries(compound_t *compound)
5730 add_anchor_token('}');
5733 switch (token.kind) {
5735 case T___extension__:
5736 case T_IDENTIFIER: {
5738 declaration_specifiers_t specifiers;
5739 parse_declaration_specifiers(&specifiers);
5740 parse_compound_declarators(compound, &specifiers);
5746 rem_anchor_token('}');
5747 expect('}', end_error);
5750 compound->complete = true;
5756 static type_t *parse_typename(void)
5758 declaration_specifiers_t specifiers;
5759 parse_declaration_specifiers(&specifiers);
5760 if (specifiers.storage_class != STORAGE_CLASS_NONE
5761 || specifiers.thread_local) {
5762 /* TODO: improve error message, user does probably not know what a
5763 * storage class is...
5765 errorf(&specifiers.source_position, "typename must not have a storage class");
5768 type_t *result = parse_abstract_declarator(specifiers.type);
5776 typedef expression_t* (*parse_expression_function)(void);
5777 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
5779 typedef struct expression_parser_function_t expression_parser_function_t;
5780 struct expression_parser_function_t {
5781 parse_expression_function parser;
5782 precedence_t infix_precedence;
5783 parse_expression_infix_function infix_parser;
5786 static expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5789 * Prints an error message if an expression was expected but not read
5791 static expression_t *expected_expression_error(void)
5793 /* skip the error message if the error token was read */
5794 if (token.kind != T_ERROR) {
5795 errorf(HERE, "expected expression, got token %K", &token);
5799 return create_error_expression();
5802 static type_t *get_string_type(void)
5804 return is_warn_on(WARN_WRITE_STRINGS) ? type_const_char_ptr : type_char_ptr;
5807 static type_t *get_wide_string_type(void)
5809 return is_warn_on(WARN_WRITE_STRINGS) ? type_const_wchar_t_ptr : type_wchar_t_ptr;
5813 * Parse a string constant.
5815 static expression_t *parse_string_literal(void)
5817 source_position_t begin = token.base.source_position;
5818 string_t res = token.string.string;
5819 bool is_wide = (token.kind == T_WIDE_STRING_LITERAL);
5822 while (token.kind == T_STRING_LITERAL
5823 || token.kind == T_WIDE_STRING_LITERAL) {
5824 warn_string_concat(&token.base.source_position);
5825 res = concat_strings(&res, &token.string.string);
5827 is_wide |= token.kind == T_WIDE_STRING_LITERAL;
5830 expression_t *literal;
5832 literal = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
5833 literal->base.type = get_wide_string_type();
5835 literal = allocate_expression_zero(EXPR_STRING_LITERAL);
5836 literal->base.type = get_string_type();
5838 literal->base.source_position = begin;
5839 literal->literal.value = res;
5845 * Parse a boolean constant.
5847 static expression_t *parse_boolean_literal(bool value)
5849 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_BOOLEAN);
5850 literal->base.type = type_bool;
5851 literal->literal.value.begin = value ? "true" : "false";
5852 literal->literal.value.size = value ? 4 : 5;
5858 static void warn_traditional_suffix(void)
5860 warningf(WARN_TRADITIONAL, HERE, "traditional C rejects the '%S' suffix",
5861 &token.number.suffix);
5864 static void check_integer_suffix(void)
5866 const string_t *suffix = &token.number.suffix;
5867 if (suffix->size == 0)
5870 bool not_traditional = false;
5871 const char *c = suffix->begin;
5872 if (*c == 'l' || *c == 'L') {
5875 not_traditional = true;
5877 if (*c == 'u' || *c == 'U') {
5880 } else if (*c == 'u' || *c == 'U') {
5881 not_traditional = true;
5884 } else if (*c == 'u' || *c == 'U') {
5885 not_traditional = true;
5887 if (*c == 'l' || *c == 'L') {
5895 errorf(&token.base.source_position,
5896 "invalid suffix '%S' on integer constant", suffix);
5897 } else if (not_traditional) {
5898 warn_traditional_suffix();
5902 static type_t *check_floatingpoint_suffix(void)
5904 const string_t *suffix = &token.number.suffix;
5905 type_t *type = type_double;
5906 if (suffix->size == 0)
5909 bool not_traditional = false;
5910 const char *c = suffix->begin;
5911 if (*c == 'f' || *c == 'F') {
5914 } else if (*c == 'l' || *c == 'L') {
5916 type = type_long_double;
5919 errorf(&token.base.source_position,
5920 "invalid suffix '%S' on floatingpoint constant", suffix);
5921 } else if (not_traditional) {
5922 warn_traditional_suffix();
5929 * Parse an integer constant.
5931 static expression_t *parse_number_literal(void)
5933 expression_kind_t kind;
5936 switch (token.kind) {
5938 kind = EXPR_LITERAL_INTEGER;
5939 check_integer_suffix();
5942 case T_INTEGER_OCTAL:
5943 kind = EXPR_LITERAL_INTEGER_OCTAL;
5944 check_integer_suffix();
5947 case T_INTEGER_HEXADECIMAL:
5948 kind = EXPR_LITERAL_INTEGER_HEXADECIMAL;
5949 check_integer_suffix();
5952 case T_FLOATINGPOINT:
5953 kind = EXPR_LITERAL_FLOATINGPOINT;
5954 type = check_floatingpoint_suffix();
5956 case T_FLOATINGPOINT_HEXADECIMAL:
5957 kind = EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL;
5958 type = check_floatingpoint_suffix();
5961 panic("unexpected token type in parse_number_literal");
5964 expression_t *literal = allocate_expression_zero(kind);
5965 literal->base.type = type;
5966 literal->literal.value = token.number.number;
5967 literal->literal.suffix = token.number.suffix;
5970 /* integer type depends on the size of the number and the size
5971 * representable by the types. The backend/codegeneration has to determine
5974 determine_literal_type(&literal->literal);
5979 * Parse a character constant.
5981 static expression_t *parse_character_constant(void)
5983 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_CHARACTER);
5984 literal->base.type = c_mode & _CXX ? type_char : type_int;
5985 literal->literal.value = token.string.string;
5987 size_t len = literal->literal.value.size;
5989 if (!GNU_MODE && !(c_mode & _C99)) {
5990 errorf(HERE, "more than 1 character in character constant");
5992 literal->base.type = type_int;
5993 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
6002 * Parse a wide character constant.
6004 static expression_t *parse_wide_character_constant(void)
6006 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_WIDE_CHARACTER);
6007 literal->base.type = type_int;
6008 literal->literal.value = token.string.string;
6010 size_t len = wstrlen(&literal->literal.value);
6012 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
6019 static entity_t *create_implicit_function(symbol_t *symbol,
6020 const source_position_t *source_position)
6022 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
6023 ntype->function.return_type = type_int;
6024 ntype->function.unspecified_parameters = true;
6025 ntype->function.linkage = LINKAGE_C;
6026 type_t *type = identify_new_type(ntype);
6028 entity_t *const entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, symbol);
6029 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
6030 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
6031 entity->declaration.type = type;
6032 entity->declaration.implicit = true;
6033 entity->base.source_position = *source_position;
6035 if (current_scope != NULL)
6036 record_entity(entity, false);
6042 * Performs automatic type cast as described in §6.3.2.1.
6044 * @param orig_type the original type
6046 static type_t *automatic_type_conversion(type_t *orig_type)
6048 type_t *type = skip_typeref(orig_type);
6049 if (is_type_array(type)) {
6050 array_type_t *array_type = &type->array;
6051 type_t *element_type = array_type->element_type;
6052 unsigned qualifiers = array_type->base.qualifiers;
6054 return make_pointer_type(element_type, qualifiers);
6057 if (is_type_function(type)) {
6058 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6065 * reverts the automatic casts of array to pointer types and function
6066 * to function-pointer types as defined §6.3.2.1
6068 type_t *revert_automatic_type_conversion(const expression_t *expression)
6070 switch (expression->kind) {
6071 case EXPR_REFERENCE: {
6072 entity_t *entity = expression->reference.entity;
6073 if (is_declaration(entity)) {
6074 return entity->declaration.type;
6075 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6076 return entity->enum_value.enum_type;
6078 panic("no declaration or enum in reference");
6083 entity_t *entity = expression->select.compound_entry;
6084 assert(is_declaration(entity));
6085 type_t *type = entity->declaration.type;
6086 return get_qualified_type(type, expression->base.type->base.qualifiers);
6089 case EXPR_UNARY_DEREFERENCE: {
6090 const expression_t *const value = expression->unary.value;
6091 type_t *const type = skip_typeref(value->base.type);
6092 if (!is_type_pointer(type))
6093 return type_error_type;
6094 return type->pointer.points_to;
6097 case EXPR_ARRAY_ACCESS: {
6098 const expression_t *array_ref = expression->array_access.array_ref;
6099 type_t *type_left = skip_typeref(array_ref->base.type);
6100 if (!is_type_pointer(type_left))
6101 return type_error_type;
6102 return type_left->pointer.points_to;
6105 case EXPR_STRING_LITERAL: {
6106 size_t size = expression->string_literal.value.size;
6107 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6110 case EXPR_WIDE_STRING_LITERAL: {
6111 size_t size = wstrlen(&expression->string_literal.value);
6112 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6115 case EXPR_COMPOUND_LITERAL:
6116 return expression->compound_literal.type;
6121 return expression->base.type;
6125 * Find an entity matching a symbol in a scope.
6126 * Uses current scope if scope is NULL
6128 static entity_t *lookup_entity(const scope_t *scope, symbol_t *symbol,
6129 namespace_tag_t namespc)
6131 if (scope == NULL) {
6132 return get_entity(symbol, namespc);
6135 /* we should optimize here, if scope grows above a certain size we should
6136 construct a hashmap here... */
6137 entity_t *entity = scope->entities;
6138 for ( ; entity != NULL; entity = entity->base.next) {
6139 if (entity->base.symbol == symbol
6140 && (namespace_tag_t)entity->base.namespc == namespc)
6147 static entity_t *parse_qualified_identifier(void)
6149 /* namespace containing the symbol */
6151 source_position_t pos;
6152 const scope_t *lookup_scope = NULL;
6154 if (next_if(T_COLONCOLON))
6155 lookup_scope = &unit->scope;
6159 if (token.kind != T_IDENTIFIER) {
6160 parse_error_expected("while parsing identifier", T_IDENTIFIER, NULL);
6161 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6163 symbol = token.identifier.symbol;
6168 entity = lookup_entity(lookup_scope, symbol, NAMESPACE_NORMAL);
6170 if (!next_if(T_COLONCOLON))
6173 switch (entity->kind) {
6174 case ENTITY_NAMESPACE:
6175 lookup_scope = &entity->namespacee.members;
6180 lookup_scope = &entity->compound.members;
6183 errorf(&pos, "'%Y' must be a namespace, class, struct or union (but is a %s)",
6184 symbol, get_entity_kind_name(entity->kind));
6186 /* skip further qualifications */
6187 while (next_if(T_IDENTIFIER) && next_if(T_COLONCOLON)) {}
6189 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6193 if (entity == NULL) {
6194 if (!strict_mode && token.kind == '(') {
6195 /* an implicitly declared function */
6196 warningf(WARN_IMPLICIT_FUNCTION_DECLARATION, &pos,
6197 "implicit declaration of function '%Y'", symbol);
6198 entity = create_implicit_function(symbol, &pos);
6200 errorf(&pos, "unknown identifier '%Y' found.", symbol);
6201 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6208 static expression_t *parse_reference(void)
6210 source_position_t const pos = token.base.source_position;
6211 entity_t *const entity = parse_qualified_identifier();
6214 if (is_declaration(entity)) {
6215 orig_type = entity->declaration.type;
6216 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6217 orig_type = entity->enum_value.enum_type;
6219 panic("expected declaration or enum value in reference");
6222 /* we always do the auto-type conversions; the & and sizeof parser contains
6223 * code to revert this! */
6224 type_t *type = automatic_type_conversion(orig_type);
6226 expression_kind_t kind = EXPR_REFERENCE;
6227 if (entity->kind == ENTITY_ENUM_VALUE)
6228 kind = EXPR_REFERENCE_ENUM_VALUE;
6230 expression_t *expression = allocate_expression_zero(kind);
6231 expression->base.source_position = pos;
6232 expression->base.type = type;
6233 expression->reference.entity = entity;
6235 /* this declaration is used */
6236 if (is_declaration(entity)) {
6237 entity->declaration.used = true;
6240 if (entity->base.parent_scope != file_scope
6241 && (current_function != NULL
6242 && entity->base.parent_scope->depth < current_function->parameters.depth)
6243 && (entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER)) {
6244 if (entity->kind == ENTITY_VARIABLE) {
6245 /* access of a variable from an outer function */
6246 entity->variable.address_taken = true;
6247 } else if (entity->kind == ENTITY_PARAMETER) {
6248 entity->parameter.address_taken = true;
6250 current_function->need_closure = true;
6253 check_deprecated(&pos, entity);
6258 static bool semantic_cast(expression_t *cast)
6260 expression_t *expression = cast->unary.value;
6261 type_t *orig_dest_type = cast->base.type;
6262 type_t *orig_type_right = expression->base.type;
6263 type_t const *dst_type = skip_typeref(orig_dest_type);
6264 type_t const *src_type = skip_typeref(orig_type_right);
6265 source_position_t const *pos = &cast->base.source_position;
6267 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6268 if (dst_type == type_void)
6271 /* only integer and pointer can be casted to pointer */
6272 if (is_type_pointer(dst_type) &&
6273 !is_type_pointer(src_type) &&
6274 !is_type_integer(src_type) &&
6275 is_type_valid(src_type)) {
6276 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6280 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6281 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6285 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6286 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6290 if (is_type_pointer(src_type) && is_type_pointer(dst_type)) {
6291 type_t *src = skip_typeref(src_type->pointer.points_to);
6292 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6293 unsigned missing_qualifiers =
6294 src->base.qualifiers & ~dst->base.qualifiers;
6295 if (missing_qualifiers != 0) {
6296 warningf(WARN_CAST_QUAL, pos, "cast discards qualifiers '%Q' in pointer target type of '%T'", missing_qualifiers, orig_type_right);
6302 static expression_t *parse_compound_literal(source_position_t const *const pos, type_t *type)
6304 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6305 expression->base.source_position = *pos;
6307 parse_initializer_env_t env;
6310 env.must_be_constant = false;
6311 initializer_t *initializer = parse_initializer(&env);
6314 expression->compound_literal.initializer = initializer;
6315 expression->compound_literal.type = type;
6316 expression->base.type = automatic_type_conversion(type);
6322 * Parse a cast expression.
6324 static expression_t *parse_cast(void)
6326 source_position_t const pos = *HERE;
6329 add_anchor_token(')');
6331 type_t *type = parse_typename();
6333 rem_anchor_token(')');
6334 expect(')', end_error);
6336 if (token.kind == '{') {
6337 return parse_compound_literal(&pos, type);
6340 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6341 cast->base.source_position = pos;
6343 expression_t *value = parse_subexpression(PREC_CAST);
6344 cast->base.type = type;
6345 cast->unary.value = value;
6347 if (! semantic_cast(cast)) {
6348 /* TODO: record the error in the AST. else it is impossible to detect it */
6353 return create_error_expression();
6357 * Parse a statement expression.
6359 static expression_t *parse_statement_expression(void)
6361 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6364 add_anchor_token(')');
6366 statement_t *statement = parse_compound_statement(true);
6367 statement->compound.stmt_expr = true;
6368 expression->statement.statement = statement;
6370 /* find last statement and use its type */
6371 type_t *type = type_void;
6372 const statement_t *stmt = statement->compound.statements;
6374 while (stmt->base.next != NULL)
6375 stmt = stmt->base.next;
6377 if (stmt->kind == STATEMENT_EXPRESSION) {
6378 type = stmt->expression.expression->base.type;
6381 source_position_t const *const pos = &expression->base.source_position;
6382 warningf(WARN_OTHER, pos, "empty statement expression ({})");
6384 expression->base.type = type;
6386 rem_anchor_token(')');
6387 expect(')', end_error);
6394 * Parse a parenthesized expression.
6396 static expression_t *parse_parenthesized_expression(void)
6398 token_t const* const la1 = look_ahead(1);
6399 switch (la1->kind) {
6401 /* gcc extension: a statement expression */
6402 return parse_statement_expression();
6405 if (is_typedef_symbol(la1->identifier.symbol)) {
6407 return parse_cast();
6412 add_anchor_token(')');
6413 expression_t *result = parse_expression();
6414 result->base.parenthesized = true;
6415 rem_anchor_token(')');
6416 expect(')', end_error);
6422 static expression_t *parse_function_keyword(void)
6426 if (current_function == NULL) {
6427 errorf(HERE, "'__func__' used outside of a function");
6430 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6431 expression->base.type = type_char_ptr;
6432 expression->funcname.kind = FUNCNAME_FUNCTION;
6439 static expression_t *parse_pretty_function_keyword(void)
6441 if (current_function == NULL) {
6442 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6445 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6446 expression->base.type = type_char_ptr;
6447 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6449 eat(T___PRETTY_FUNCTION__);
6454 static expression_t *parse_funcsig_keyword(void)
6456 if (current_function == NULL) {
6457 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6460 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6461 expression->base.type = type_char_ptr;
6462 expression->funcname.kind = FUNCNAME_FUNCSIG;
6469 static expression_t *parse_funcdname_keyword(void)
6471 if (current_function == NULL) {
6472 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6475 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6476 expression->base.type = type_char_ptr;
6477 expression->funcname.kind = FUNCNAME_FUNCDNAME;
6479 eat(T___FUNCDNAME__);
6484 static designator_t *parse_designator(void)
6486 designator_t *result = allocate_ast_zero(sizeof(result[0]));
6487 result->source_position = *HERE;
6489 if (token.kind != T_IDENTIFIER) {
6490 parse_error_expected("while parsing member designator",
6491 T_IDENTIFIER, NULL);
6494 result->symbol = token.identifier.symbol;
6497 designator_t *last_designator = result;
6500 if (token.kind != T_IDENTIFIER) {
6501 parse_error_expected("while parsing member designator",
6502 T_IDENTIFIER, NULL);
6505 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6506 designator->source_position = *HERE;
6507 designator->symbol = token.identifier.symbol;
6510 last_designator->next = designator;
6511 last_designator = designator;
6515 add_anchor_token(']');
6516 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6517 designator->source_position = *HERE;
6518 designator->array_index = parse_expression();
6519 rem_anchor_token(']');
6520 expect(']', end_error);
6521 if (designator->array_index == NULL) {
6525 last_designator->next = designator;
6526 last_designator = designator;
6538 * Parse the __builtin_offsetof() expression.
6540 static expression_t *parse_offsetof(void)
6542 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6543 expression->base.type = type_size_t;
6545 eat(T___builtin_offsetof);
6547 expect('(', end_error);
6548 add_anchor_token(',');
6549 type_t *type = parse_typename();
6550 rem_anchor_token(',');
6551 expect(',', end_error);
6552 add_anchor_token(')');
6553 designator_t *designator = parse_designator();
6554 rem_anchor_token(')');
6555 expect(')', end_error);
6557 expression->offsetofe.type = type;
6558 expression->offsetofe.designator = designator;
6561 memset(&path, 0, sizeof(path));
6562 path.top_type = type;
6563 path.path = NEW_ARR_F(type_path_entry_t, 0);
6565 descend_into_subtype(&path);
6567 if (!walk_designator(&path, designator, true)) {
6568 return create_error_expression();
6571 DEL_ARR_F(path.path);
6575 return create_error_expression();
6579 * Parses a _builtin_va_start() expression.
6581 static expression_t *parse_va_start(void)
6583 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6585 eat(T___builtin_va_start);
6587 expect('(', end_error);
6588 add_anchor_token(',');
6589 expression->va_starte.ap = parse_assignment_expression();
6590 rem_anchor_token(',');
6591 expect(',', end_error);
6592 expression_t *const expr = parse_assignment_expression();
6593 if (expr->kind == EXPR_REFERENCE) {
6594 entity_t *const entity = expr->reference.entity;
6595 if (!current_function->base.type->function.variadic) {
6596 errorf(&expr->base.source_position,
6597 "'va_start' used in non-variadic function");
6598 } else if (entity->base.parent_scope != ¤t_function->parameters ||
6599 entity->base.next != NULL ||
6600 entity->kind != ENTITY_PARAMETER) {
6601 errorf(&expr->base.source_position,
6602 "second argument of 'va_start' must be last parameter of the current function");
6604 expression->va_starte.parameter = &entity->variable;
6606 expect(')', end_error);
6609 expect(')', end_error);
6611 return create_error_expression();
6615 * Parses a __builtin_va_arg() expression.
6617 static expression_t *parse_va_arg(void)
6619 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6621 eat(T___builtin_va_arg);
6623 expect('(', end_error);
6625 ap.expression = parse_assignment_expression();
6626 expression->va_arge.ap = ap.expression;
6627 check_call_argument(type_valist, &ap, 1);
6629 expect(',', end_error);
6630 expression->base.type = parse_typename();
6631 expect(')', end_error);
6635 return create_error_expression();
6639 * Parses a __builtin_va_copy() expression.
6641 static expression_t *parse_va_copy(void)
6643 expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
6645 eat(T___builtin_va_copy);
6647 expect('(', end_error);
6648 expression_t *dst = parse_assignment_expression();
6649 assign_error_t error = semantic_assign(type_valist, dst);
6650 report_assign_error(error, type_valist, dst, "call argument 1",
6651 &dst->base.source_position);
6652 expression->va_copye.dst = dst;
6654 expect(',', end_error);
6656 call_argument_t src;
6657 src.expression = parse_assignment_expression();
6658 check_call_argument(type_valist, &src, 2);
6659 expression->va_copye.src = src.expression;
6660 expect(')', end_error);
6664 return create_error_expression();
6668 * Parses a __builtin_constant_p() expression.
6670 static expression_t *parse_builtin_constant(void)
6672 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6674 eat(T___builtin_constant_p);
6676 expect('(', end_error);
6677 add_anchor_token(')');
6678 expression->builtin_constant.value = parse_assignment_expression();
6679 rem_anchor_token(')');
6680 expect(')', end_error);
6681 expression->base.type = type_int;
6685 return create_error_expression();
6689 * Parses a __builtin_types_compatible_p() expression.
6691 static expression_t *parse_builtin_types_compatible(void)
6693 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
6695 eat(T___builtin_types_compatible_p);
6697 expect('(', end_error);
6698 add_anchor_token(')');
6699 add_anchor_token(',');
6700 expression->builtin_types_compatible.left = parse_typename();
6701 rem_anchor_token(',');
6702 expect(',', end_error);
6703 expression->builtin_types_compatible.right = parse_typename();
6704 rem_anchor_token(')');
6705 expect(')', end_error);
6706 expression->base.type = type_int;
6710 return create_error_expression();
6714 * Parses a __builtin_is_*() compare expression.
6716 static expression_t *parse_compare_builtin(void)
6718 expression_t *expression;
6720 switch (token.kind) {
6721 case T___builtin_isgreater:
6722 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
6724 case T___builtin_isgreaterequal:
6725 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
6727 case T___builtin_isless:
6728 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
6730 case T___builtin_islessequal:
6731 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
6733 case T___builtin_islessgreater:
6734 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
6736 case T___builtin_isunordered:
6737 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
6740 internal_errorf(HERE, "invalid compare builtin found");
6742 expression->base.source_position = *HERE;
6745 expect('(', end_error);
6746 expression->binary.left = parse_assignment_expression();
6747 expect(',', end_error);
6748 expression->binary.right = parse_assignment_expression();
6749 expect(')', end_error);
6751 type_t *const orig_type_left = expression->binary.left->base.type;
6752 type_t *const orig_type_right = expression->binary.right->base.type;
6754 type_t *const type_left = skip_typeref(orig_type_left);
6755 type_t *const type_right = skip_typeref(orig_type_right);
6756 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6757 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6758 type_error_incompatible("invalid operands in comparison",
6759 &expression->base.source_position, orig_type_left, orig_type_right);
6762 semantic_comparison(&expression->binary);
6767 return create_error_expression();
6771 * Parses a MS assume() expression.
6773 static expression_t *parse_assume(void)
6775 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
6779 expect('(', end_error);
6780 add_anchor_token(')');
6781 expression->unary.value = parse_assignment_expression();
6782 rem_anchor_token(')');
6783 expect(')', end_error);
6785 expression->base.type = type_void;
6788 return create_error_expression();
6792 * Return the label for the current symbol or create a new one.
6794 static label_t *get_label(void)
6796 assert(token.kind == T_IDENTIFIER);
6797 assert(current_function != NULL);
6799 entity_t *label = get_entity(token.identifier.symbol, NAMESPACE_LABEL);
6800 /* If we find a local label, we already created the declaration. */
6801 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
6802 if (label->base.parent_scope != current_scope) {
6803 assert(label->base.parent_scope->depth < current_scope->depth);
6804 current_function->goto_to_outer = true;
6806 } else if (label == NULL || label->base.parent_scope != ¤t_function->parameters) {
6807 /* There is no matching label in the same function, so create a new one. */
6808 label = allocate_entity_zero(ENTITY_LABEL, NAMESPACE_LABEL, token.identifier.symbol);
6813 return &label->label;
6817 * Parses a GNU && label address expression.
6819 static expression_t *parse_label_address(void)
6821 source_position_t source_position = token.base.source_position;
6823 if (token.kind != T_IDENTIFIER) {
6824 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
6825 return create_error_expression();
6828 label_t *const label = get_label();
6830 label->address_taken = true;
6832 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
6833 expression->base.source_position = source_position;
6835 /* label address is treated as a void pointer */
6836 expression->base.type = type_void_ptr;
6837 expression->label_address.label = label;
6842 * Parse a microsoft __noop expression.
6844 static expression_t *parse_noop_expression(void)
6846 /* the result is a (int)0 */
6847 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_MS_NOOP);
6848 literal->base.type = type_int;
6849 literal->literal.value.begin = "__noop";
6850 literal->literal.value.size = 6;
6854 if (token.kind == '(') {
6855 /* parse arguments */
6857 add_anchor_token(')');
6858 add_anchor_token(',');
6860 if (token.kind != ')') do {
6861 (void)parse_assignment_expression();
6862 } while (next_if(','));
6864 rem_anchor_token(',');
6865 rem_anchor_token(')');
6866 expect(')', end_error);
6873 * Parses a primary expression.
6875 static expression_t *parse_primary_expression(void)
6877 switch (token.kind) {
6878 case T_false: return parse_boolean_literal(false);
6879 case T_true: return parse_boolean_literal(true);
6881 case T_INTEGER_OCTAL:
6882 case T_INTEGER_HEXADECIMAL:
6883 case T_FLOATINGPOINT:
6884 case T_FLOATINGPOINT_HEXADECIMAL: return parse_number_literal();
6885 case T_CHARACTER_CONSTANT: return parse_character_constant();
6886 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
6887 case T_STRING_LITERAL:
6888 case T_WIDE_STRING_LITERAL: return parse_string_literal();
6889 case T___FUNCTION__:
6890 case T___func__: return parse_function_keyword();
6891 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
6892 case T___FUNCSIG__: return parse_funcsig_keyword();
6893 case T___FUNCDNAME__: return parse_funcdname_keyword();
6894 case T___builtin_offsetof: return parse_offsetof();
6895 case T___builtin_va_start: return parse_va_start();
6896 case T___builtin_va_arg: return parse_va_arg();
6897 case T___builtin_va_copy: return parse_va_copy();
6898 case T___builtin_isgreater:
6899 case T___builtin_isgreaterequal:
6900 case T___builtin_isless:
6901 case T___builtin_islessequal:
6902 case T___builtin_islessgreater:
6903 case T___builtin_isunordered: return parse_compare_builtin();
6904 case T___builtin_constant_p: return parse_builtin_constant();
6905 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
6906 case T__assume: return parse_assume();
6909 return parse_label_address();
6912 case '(': return parse_parenthesized_expression();
6913 case T___noop: return parse_noop_expression();
6915 /* Gracefully handle type names while parsing expressions. */
6917 return parse_reference();
6919 if (!is_typedef_symbol(token.identifier.symbol)) {
6920 return parse_reference();
6924 source_position_t const pos = *HERE;
6925 declaration_specifiers_t specifiers;
6926 parse_declaration_specifiers(&specifiers);
6927 type_t const *const type = parse_abstract_declarator(specifiers.type);
6928 errorf(&pos, "encountered type '%T' while parsing expression", type);
6929 return create_error_expression();
6933 errorf(HERE, "unexpected token %K, expected an expression", &token);
6935 return create_error_expression();
6938 static expression_t *parse_array_expression(expression_t *left)
6940 expression_t *const expr = allocate_expression_zero(EXPR_ARRAY_ACCESS);
6941 array_access_expression_t *const arr = &expr->array_access;
6944 add_anchor_token(']');
6946 expression_t *const inside = parse_expression();
6948 type_t *const orig_type_left = left->base.type;
6949 type_t *const orig_type_inside = inside->base.type;
6951 type_t *const type_left = skip_typeref(orig_type_left);
6952 type_t *const type_inside = skip_typeref(orig_type_inside);
6958 if (is_type_pointer(type_left)) {
6961 idx_type = type_inside;
6962 res_type = type_left->pointer.points_to;
6964 } else if (is_type_pointer(type_inside)) {
6965 arr->flipped = true;
6968 idx_type = type_left;
6969 res_type = type_inside->pointer.points_to;
6971 res_type = automatic_type_conversion(res_type);
6972 if (!is_type_integer(idx_type)) {
6973 errorf(&idx->base.source_position, "array subscript must have integer type");
6974 } else if (is_type_atomic(idx_type, ATOMIC_TYPE_CHAR)) {
6975 source_position_t const *const pos = &idx->base.source_position;
6976 warningf(WARN_CHAR_SUBSCRIPTS, pos, "array subscript has char type");
6979 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
6980 errorf(&expr->base.source_position, "invalid types '%T[%T]' for array access", orig_type_left, orig_type_inside);
6982 res_type = type_error_type;
6987 arr->array_ref = ref;
6989 arr->base.type = res_type;
6991 rem_anchor_token(']');
6992 expect(']', end_error);
6997 static bool is_bitfield(const expression_t *expression)
6999 return expression->kind == EXPR_SELECT
7000 && expression->select.compound_entry->compound_member.bitfield;
7003 static expression_t *parse_typeprop(expression_kind_t const kind)
7005 expression_t *tp_expression = allocate_expression_zero(kind);
7006 tp_expression->base.type = type_size_t;
7008 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
7011 expression_t *expression;
7012 if (token.kind == '(' && is_declaration_specifier(look_ahead(1))) {
7013 source_position_t const pos = *HERE;
7015 add_anchor_token(')');
7016 orig_type = parse_typename();
7017 rem_anchor_token(')');
7018 expect(')', end_error);
7020 if (token.kind == '{') {
7021 /* It was not sizeof(type) after all. It is sizeof of an expression
7022 * starting with a compound literal */
7023 expression = parse_compound_literal(&pos, orig_type);
7024 goto typeprop_expression;
7027 expression = parse_subexpression(PREC_UNARY);
7029 typeprop_expression:
7030 if (is_bitfield(expression)) {
7031 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7032 errorf(&tp_expression->base.source_position,
7033 "operand of %s expression must not be a bitfield", what);
7036 tp_expression->typeprop.tp_expression = expression;
7038 orig_type = revert_automatic_type_conversion(expression);
7039 expression->base.type = orig_type;
7042 tp_expression->typeprop.type = orig_type;
7043 type_t const* const type = skip_typeref(orig_type);
7044 char const* wrong_type = NULL;
7045 if (is_type_incomplete(type)) {
7046 if (!is_type_atomic(type, ATOMIC_TYPE_VOID) || !GNU_MODE)
7047 wrong_type = "incomplete";
7048 } else if (type->kind == TYPE_FUNCTION) {
7050 /* function types are allowed (and return 1) */
7051 source_position_t const *const pos = &tp_expression->base.source_position;
7052 char const *const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7053 warningf(WARN_OTHER, pos, "%s expression with function argument returns invalid result", what);
7055 wrong_type = "function";
7059 if (wrong_type != NULL) {
7060 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7061 errorf(&tp_expression->base.source_position,
7062 "operand of %s expression must not be of %s type '%T'",
7063 what, wrong_type, orig_type);
7067 return tp_expression;
7070 static expression_t *parse_sizeof(void)
7072 return parse_typeprop(EXPR_SIZEOF);
7075 static expression_t *parse_alignof(void)
7077 return parse_typeprop(EXPR_ALIGNOF);
7080 static expression_t *parse_select_expression(expression_t *addr)
7082 assert(token.kind == '.' || token.kind == T_MINUSGREATER);
7083 bool select_left_arrow = (token.kind == T_MINUSGREATER);
7084 source_position_t const pos = *HERE;
7087 if (token.kind != T_IDENTIFIER) {
7088 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
7089 return create_error_expression();
7091 symbol_t *symbol = token.identifier.symbol;
7094 type_t *const orig_type = addr->base.type;
7095 type_t *const type = skip_typeref(orig_type);
7098 bool saw_error = false;
7099 if (is_type_pointer(type)) {
7100 if (!select_left_arrow) {
7102 "request for member '%Y' in something not a struct or union, but '%T'",
7106 type_left = skip_typeref(type->pointer.points_to);
7108 if (select_left_arrow && is_type_valid(type)) {
7109 errorf(&pos, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7115 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
7116 type_left->kind != TYPE_COMPOUND_UNION) {
7118 if (is_type_valid(type_left) && !saw_error) {
7120 "request for member '%Y' in something not a struct or union, but '%T'",
7123 return create_error_expression();
7126 compound_t *compound = type_left->compound.compound;
7127 if (!compound->complete) {
7128 errorf(&pos, "request for member '%Y' in incomplete type '%T'",
7130 return create_error_expression();
7133 type_qualifiers_t qualifiers = type_left->base.qualifiers;
7134 expression_t *result =
7135 find_create_select(&pos, addr, qualifiers, compound, symbol);
7137 if (result == NULL) {
7138 errorf(&pos, "'%T' has no member named '%Y'", orig_type, symbol);
7139 return create_error_expression();
7145 static void check_call_argument(type_t *expected_type,
7146 call_argument_t *argument, unsigned pos)
7148 type_t *expected_type_skip = skip_typeref(expected_type);
7149 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
7150 expression_t *arg_expr = argument->expression;
7151 type_t *arg_type = skip_typeref(arg_expr->base.type);
7153 /* handle transparent union gnu extension */
7154 if (is_type_union(expected_type_skip)
7155 && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
7156 compound_t *union_decl = expected_type_skip->compound.compound;
7157 type_t *best_type = NULL;
7158 entity_t *entry = union_decl->members.entities;
7159 for ( ; entry != NULL; entry = entry->base.next) {
7160 assert(is_declaration(entry));
7161 type_t *decl_type = entry->declaration.type;
7162 error = semantic_assign(decl_type, arg_expr);
7163 if (error == ASSIGN_ERROR_INCOMPATIBLE
7164 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
7167 if (error == ASSIGN_SUCCESS) {
7168 best_type = decl_type;
7169 } else if (best_type == NULL) {
7170 best_type = decl_type;
7174 if (best_type != NULL) {
7175 expected_type = best_type;
7179 error = semantic_assign(expected_type, arg_expr);
7180 argument->expression = create_implicit_cast(arg_expr, expected_type);
7182 if (error != ASSIGN_SUCCESS) {
7183 /* report exact scope in error messages (like "in argument 3") */
7185 snprintf(buf, sizeof(buf), "call argument %u", pos);
7186 report_assign_error(error, expected_type, arg_expr, buf,
7187 &arg_expr->base.source_position);
7189 type_t *const promoted_type = get_default_promoted_type(arg_type);
7190 if (!types_compatible(expected_type_skip, promoted_type) &&
7191 !types_compatible(expected_type_skip, type_void_ptr) &&
7192 !types_compatible(type_void_ptr, promoted_type)) {
7193 /* Deliberately show the skipped types in this warning */
7194 source_position_t const *const apos = &arg_expr->base.source_position;
7195 warningf(WARN_TRADITIONAL, apos, "passing call argument %u as '%T' rather than '%T' due to prototype", pos, expected_type_skip, promoted_type);
7201 * Handle the semantic restrictions of builtin calls
7203 static void handle_builtin_argument_restrictions(call_expression_t *call)
7205 entity_t *entity = call->function->reference.entity;
7206 switch (entity->function.btk) {
7208 switch (entity->function.b.firm_builtin_kind) {
7209 case ir_bk_return_address:
7210 case ir_bk_frame_address: {
7211 /* argument must be constant */
7212 call_argument_t *argument = call->arguments;
7214 if (is_constant_expression(argument->expression) == EXPR_CLASS_VARIABLE) {
7215 errorf(&call->base.source_position,
7216 "argument of '%Y' must be a constant expression",
7217 call->function->reference.entity->base.symbol);
7221 case ir_bk_prefetch:
7222 /* second and third argument must be constant if existent */
7223 if (call->arguments == NULL)
7225 call_argument_t *rw = call->arguments->next;
7226 call_argument_t *locality = NULL;
7229 if (is_constant_expression(rw->expression) == EXPR_CLASS_VARIABLE) {
7230 errorf(&call->base.source_position,
7231 "second argument of '%Y' must be a constant expression",
7232 call->function->reference.entity->base.symbol);
7234 locality = rw->next;
7236 if (locality != NULL) {
7237 if (is_constant_expression(locality->expression) == EXPR_CLASS_VARIABLE) {
7238 errorf(&call->base.source_position,
7239 "third argument of '%Y' must be a constant expression",
7240 call->function->reference.entity->base.symbol);
7242 locality = rw->next;
7249 case BUILTIN_OBJECT_SIZE:
7250 if (call->arguments == NULL)
7253 call_argument_t *arg = call->arguments->next;
7254 if (arg != NULL && is_constant_expression(arg->expression) == EXPR_CLASS_VARIABLE) {
7255 errorf(&call->base.source_position,
7256 "second argument of '%Y' must be a constant expression",
7257 call->function->reference.entity->base.symbol);
7266 * Parse a call expression, ie. expression '( ... )'.
7268 * @param expression the function address
7270 static expression_t *parse_call_expression(expression_t *expression)
7272 expression_t *result = allocate_expression_zero(EXPR_CALL);
7273 call_expression_t *call = &result->call;
7274 call->function = expression;
7276 type_t *const orig_type = expression->base.type;
7277 type_t *const type = skip_typeref(orig_type);
7279 function_type_t *function_type = NULL;
7280 if (is_type_pointer(type)) {
7281 type_t *const to_type = skip_typeref(type->pointer.points_to);
7283 if (is_type_function(to_type)) {
7284 function_type = &to_type->function;
7285 call->base.type = function_type->return_type;
7289 if (function_type == NULL && is_type_valid(type)) {
7291 "called object '%E' (type '%T') is not a pointer to a function",
7292 expression, orig_type);
7295 /* parse arguments */
7297 add_anchor_token(')');
7298 add_anchor_token(',');
7300 if (token.kind != ')') {
7301 call_argument_t **anchor = &call->arguments;
7303 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7304 argument->expression = parse_assignment_expression();
7307 anchor = &argument->next;
7308 } while (next_if(','));
7310 rem_anchor_token(',');
7311 rem_anchor_token(')');
7312 expect(')', end_error);
7314 if (function_type == NULL)
7317 /* check type and count of call arguments */
7318 function_parameter_t *parameter = function_type->parameters;
7319 call_argument_t *argument = call->arguments;
7320 if (!function_type->unspecified_parameters) {
7321 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7322 parameter = parameter->next, argument = argument->next) {
7323 check_call_argument(parameter->type, argument, ++pos);
7326 if (parameter != NULL) {
7327 errorf(&expression->base.source_position, "too few arguments to function '%E'", expression);
7328 } else if (argument != NULL && !function_type->variadic) {
7329 errorf(&argument->expression->base.source_position, "too many arguments to function '%E'", expression);
7333 /* do default promotion for other arguments */
7334 for (; argument != NULL; argument = argument->next) {
7335 type_t *argument_type = argument->expression->base.type;
7336 if (!is_type_object(skip_typeref(argument_type))) {
7337 errorf(&argument->expression->base.source_position,
7338 "call argument '%E' must not be void", argument->expression);
7341 argument_type = get_default_promoted_type(argument_type);
7343 argument->expression
7344 = create_implicit_cast(argument->expression, argument_type);
7349 if (is_type_compound(skip_typeref(function_type->return_type))) {
7350 source_position_t const *const pos = &expression->base.source_position;
7351 warningf(WARN_AGGREGATE_RETURN, pos, "function call has aggregate value");
7354 if (expression->kind == EXPR_REFERENCE) {
7355 reference_expression_t *reference = &expression->reference;
7356 if (reference->entity->kind == ENTITY_FUNCTION &&
7357 reference->entity->function.btk != BUILTIN_NONE)
7358 handle_builtin_argument_restrictions(call);
7365 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7367 static bool same_compound_type(const type_t *type1, const type_t *type2)
7370 is_type_compound(type1) &&
7371 type1->kind == type2->kind &&
7372 type1->compound.compound == type2->compound.compound;
7375 static expression_t const *get_reference_address(expression_t const *expr)
7377 bool regular_take_address = true;
7379 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7380 expr = expr->unary.value;
7382 regular_take_address = false;
7385 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7388 expr = expr->unary.value;
7391 if (expr->kind != EXPR_REFERENCE)
7394 /* special case for functions which are automatically converted to a
7395 * pointer to function without an extra TAKE_ADDRESS operation */
7396 if (!regular_take_address &&
7397 expr->reference.entity->kind != ENTITY_FUNCTION) {
7404 static void warn_reference_address_as_bool(expression_t const* expr)
7406 expr = get_reference_address(expr);
7408 source_position_t const *const pos = &expr->base.source_position;
7409 entity_t const *const ent = expr->reference.entity;
7410 warningf(WARN_ADDRESS, pos, "the address of '%N' will always evaluate as 'true'", ent);
7414 static void warn_assignment_in_condition(const expression_t *const expr)
7416 if (expr->base.kind != EXPR_BINARY_ASSIGN)
7418 if (expr->base.parenthesized)
7420 source_position_t const *const pos = &expr->base.source_position;
7421 warningf(WARN_PARENTHESES, pos, "suggest parentheses around assignment used as truth value");
7424 static void semantic_condition(expression_t const *const expr,
7425 char const *const context)
7427 type_t *const type = skip_typeref(expr->base.type);
7428 if (is_type_scalar(type)) {
7429 warn_reference_address_as_bool(expr);
7430 warn_assignment_in_condition(expr);
7431 } else if (is_type_valid(type)) {
7432 errorf(&expr->base.source_position,
7433 "%s must have scalar type", context);
7438 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7440 * @param expression the conditional expression
7442 static expression_t *parse_conditional_expression(expression_t *expression)
7444 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7446 conditional_expression_t *conditional = &result->conditional;
7447 conditional->condition = expression;
7450 add_anchor_token(':');
7452 /* §6.5.15:2 The first operand shall have scalar type. */
7453 semantic_condition(expression, "condition of conditional operator");
7455 expression_t *true_expression = expression;
7456 bool gnu_cond = false;
7457 if (GNU_MODE && token.kind == ':') {
7460 true_expression = parse_expression();
7462 rem_anchor_token(':');
7463 expect(':', end_error);
7465 expression_t *false_expression =
7466 parse_subexpression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7468 type_t *const orig_true_type = true_expression->base.type;
7469 type_t *const orig_false_type = false_expression->base.type;
7470 type_t *const true_type = skip_typeref(orig_true_type);
7471 type_t *const false_type = skip_typeref(orig_false_type);
7474 source_position_t const *const pos = &conditional->base.source_position;
7475 type_t *result_type;
7476 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7477 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7478 /* ISO/IEC 14882:1998(E) §5.16:2 */
7479 if (true_expression->kind == EXPR_UNARY_THROW) {
7480 result_type = false_type;
7481 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7482 result_type = true_type;
7484 if (!is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7485 !is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7486 warningf(WARN_OTHER, pos, "ISO C forbids conditional expression with only one void side");
7488 result_type = type_void;
7490 } else if (is_type_arithmetic(true_type)
7491 && is_type_arithmetic(false_type)) {
7492 result_type = semantic_arithmetic(true_type, false_type);
7493 } else if (same_compound_type(true_type, false_type)) {
7494 /* just take 1 of the 2 types */
7495 result_type = true_type;
7496 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7497 type_t *pointer_type;
7499 expression_t *other_expression;
7500 if (is_type_pointer(true_type) &&
7501 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7502 pointer_type = true_type;
7503 other_type = false_type;
7504 other_expression = false_expression;
7506 pointer_type = false_type;
7507 other_type = true_type;
7508 other_expression = true_expression;
7511 if (is_null_pointer_constant(other_expression)) {
7512 result_type = pointer_type;
7513 } else if (is_type_pointer(other_type)) {
7514 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7515 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7518 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
7519 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
7521 } else if (types_compatible(get_unqualified_type(to1),
7522 get_unqualified_type(to2))) {
7525 warningf(WARN_OTHER, pos, "pointer types '%T' and '%T' in conditional expression are incompatible", true_type, false_type);
7529 type_t *const type =
7530 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7531 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7532 } else if (is_type_integer(other_type)) {
7533 warningf(WARN_OTHER, pos, "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7534 result_type = pointer_type;
7536 goto types_incompatible;
7540 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7541 type_error_incompatible("while parsing conditional", pos, true_type, false_type);
7543 result_type = type_error_type;
7546 conditional->true_expression
7547 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7548 conditional->false_expression
7549 = create_implicit_cast(false_expression, result_type);
7550 conditional->base.type = result_type;
7555 * Parse an extension expression.
7557 static expression_t *parse_extension(void)
7560 expression_t *expression = parse_subexpression(PREC_UNARY);
7566 * Parse a __builtin_classify_type() expression.
7568 static expression_t *parse_builtin_classify_type(void)
7570 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7571 result->base.type = type_int;
7573 eat(T___builtin_classify_type);
7575 expect('(', end_error);
7576 add_anchor_token(')');
7577 expression_t *expression = parse_expression();
7578 rem_anchor_token(')');
7579 expect(')', end_error);
7580 result->classify_type.type_expression = expression;
7584 return create_error_expression();
7588 * Parse a delete expression
7589 * ISO/IEC 14882:1998(E) §5.3.5
7591 static expression_t *parse_delete(void)
7593 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7594 result->base.type = type_void;
7599 result->kind = EXPR_UNARY_DELETE_ARRAY;
7600 expect(']', end_error);
7604 expression_t *const value = parse_subexpression(PREC_CAST);
7605 result->unary.value = value;
7607 type_t *const type = skip_typeref(value->base.type);
7608 if (!is_type_pointer(type)) {
7609 if (is_type_valid(type)) {
7610 errorf(&value->base.source_position,
7611 "operand of delete must have pointer type");
7613 } else if (is_type_atomic(skip_typeref(type->pointer.points_to), ATOMIC_TYPE_VOID)) {
7614 source_position_t const *const pos = &value->base.source_position;
7615 warningf(WARN_OTHER, pos, "deleting 'void*' is undefined");
7622 * Parse a throw expression
7623 * ISO/IEC 14882:1998(E) §15:1
7625 static expression_t *parse_throw(void)
7627 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7628 result->base.type = type_void;
7632 expression_t *value = NULL;
7633 switch (token.kind) {
7635 value = parse_assignment_expression();
7636 /* ISO/IEC 14882:1998(E) §15.1:3 */
7637 type_t *const orig_type = value->base.type;
7638 type_t *const type = skip_typeref(orig_type);
7639 if (is_type_incomplete(type)) {
7640 errorf(&value->base.source_position,
7641 "cannot throw object of incomplete type '%T'", orig_type);
7642 } else if (is_type_pointer(type)) {
7643 type_t *const points_to = skip_typeref(type->pointer.points_to);
7644 if (is_type_incomplete(points_to) &&
7645 !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7646 errorf(&value->base.source_position,
7647 "cannot throw pointer to incomplete type '%T'", orig_type);
7655 result->unary.value = value;
7660 static bool check_pointer_arithmetic(const source_position_t *source_position,
7661 type_t *pointer_type,
7662 type_t *orig_pointer_type)
7664 type_t *points_to = pointer_type->pointer.points_to;
7665 points_to = skip_typeref(points_to);
7667 if (is_type_incomplete(points_to)) {
7668 if (!GNU_MODE || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7669 errorf(source_position,
7670 "arithmetic with pointer to incomplete type '%T' not allowed",
7674 warningf(WARN_POINTER_ARITH, source_position, "pointer of type '%T' used in arithmetic", orig_pointer_type);
7676 } else if (is_type_function(points_to)) {
7678 errorf(source_position,
7679 "arithmetic with pointer to function type '%T' not allowed",
7683 warningf(WARN_POINTER_ARITH, source_position, "pointer to a function '%T' used in arithmetic", orig_pointer_type);
7689 static bool is_lvalue(const expression_t *expression)
7691 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
7692 switch (expression->kind) {
7693 case EXPR_ARRAY_ACCESS:
7694 case EXPR_COMPOUND_LITERAL:
7695 case EXPR_REFERENCE:
7697 case EXPR_UNARY_DEREFERENCE:
7701 type_t *type = skip_typeref(expression->base.type);
7703 /* ISO/IEC 14882:1998(E) §3.10:3 */
7704 is_type_reference(type) ||
7705 /* Claim it is an lvalue, if the type is invalid. There was a parse
7706 * error before, which maybe prevented properly recognizing it as
7708 !is_type_valid(type);
7713 static void semantic_incdec(unary_expression_t *expression)
7715 type_t *const orig_type = expression->value->base.type;
7716 type_t *const type = skip_typeref(orig_type);
7717 if (is_type_pointer(type)) {
7718 if (!check_pointer_arithmetic(&expression->base.source_position,
7722 } else if (!is_type_real(type) && is_type_valid(type)) {
7723 /* TODO: improve error message */
7724 errorf(&expression->base.source_position,
7725 "operation needs an arithmetic or pointer type");
7728 if (!is_lvalue(expression->value)) {
7729 /* TODO: improve error message */
7730 errorf(&expression->base.source_position, "lvalue required as operand");
7732 expression->base.type = orig_type;
7735 static void promote_unary_int_expr(unary_expression_t *const expr, type_t *const type)
7737 type_t *const res_type = promote_integer(type);
7738 expr->base.type = res_type;
7739 expr->value = create_implicit_cast(expr->value, res_type);
7742 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
7744 type_t *const orig_type = expression->value->base.type;
7745 type_t *const type = skip_typeref(orig_type);
7746 if (!is_type_arithmetic(type)) {
7747 if (is_type_valid(type)) {
7748 /* TODO: improve error message */
7749 errorf(&expression->base.source_position,
7750 "operation needs an arithmetic type");
7753 } else if (is_type_integer(type)) {
7754 promote_unary_int_expr(expression, type);
7756 expression->base.type = orig_type;
7760 static void semantic_unexpr_plus(unary_expression_t *expression)
7762 semantic_unexpr_arithmetic(expression);
7763 source_position_t const *const pos = &expression->base.source_position;
7764 warningf(WARN_TRADITIONAL, pos, "traditional C rejects the unary plus operator");
7767 static void semantic_not(unary_expression_t *expression)
7769 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
7770 semantic_condition(expression->value, "operand of !");
7771 expression->base.type = c_mode & _CXX ? type_bool : type_int;
7774 static void semantic_unexpr_integer(unary_expression_t *expression)
7776 type_t *const orig_type = expression->value->base.type;
7777 type_t *const type = skip_typeref(orig_type);
7778 if (!is_type_integer(type)) {
7779 if (is_type_valid(type)) {
7780 errorf(&expression->base.source_position,
7781 "operand of ~ must be of integer type");
7786 promote_unary_int_expr(expression, type);
7789 static void semantic_dereference(unary_expression_t *expression)
7791 type_t *const orig_type = expression->value->base.type;
7792 type_t *const type = skip_typeref(orig_type);
7793 if (!is_type_pointer(type)) {
7794 if (is_type_valid(type)) {
7795 errorf(&expression->base.source_position,
7796 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
7801 type_t *result_type = type->pointer.points_to;
7802 result_type = automatic_type_conversion(result_type);
7803 expression->base.type = result_type;
7807 * Record that an address is taken (expression represents an lvalue).
7809 * @param expression the expression
7810 * @param may_be_register if true, the expression might be an register
7812 static void set_address_taken(expression_t *expression, bool may_be_register)
7814 if (expression->kind != EXPR_REFERENCE)
7817 entity_t *const entity = expression->reference.entity;
7819 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
7822 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
7823 && !may_be_register) {
7824 source_position_t const *const pos = &expression->base.source_position;
7825 errorf(pos, "address of register '%N' requested", entity);
7828 if (entity->kind == ENTITY_VARIABLE) {
7829 entity->variable.address_taken = true;
7831 assert(entity->kind == ENTITY_PARAMETER);
7832 entity->parameter.address_taken = true;
7837 * Check the semantic of the address taken expression.
7839 static void semantic_take_addr(unary_expression_t *expression)
7841 expression_t *value = expression->value;
7842 value->base.type = revert_automatic_type_conversion(value);
7844 type_t *orig_type = value->base.type;
7845 type_t *type = skip_typeref(orig_type);
7846 if (!is_type_valid(type))
7850 if (!is_lvalue(value)) {
7851 errorf(&expression->base.source_position, "'&' requires an lvalue");
7853 if (is_bitfield(value)) {
7854 errorf(&expression->base.source_position,
7855 "'&' not allowed on bitfield");
7858 set_address_taken(value, false);
7860 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
7863 #define CREATE_UNARY_EXPRESSION_PARSER(token_kind, unexpression_type, sfunc) \
7864 static expression_t *parse_##unexpression_type(void) \
7866 expression_t *unary_expression \
7867 = allocate_expression_zero(unexpression_type); \
7869 unary_expression->unary.value = parse_subexpression(PREC_UNARY); \
7871 sfunc(&unary_expression->unary); \
7873 return unary_expression; \
7876 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
7877 semantic_unexpr_arithmetic)
7878 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
7879 semantic_unexpr_plus)
7880 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
7882 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
7883 semantic_dereference)
7884 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
7886 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
7887 semantic_unexpr_integer)
7888 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
7890 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
7893 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_kind, unexpression_type, \
7895 static expression_t *parse_##unexpression_type(expression_t *left) \
7897 expression_t *unary_expression \
7898 = allocate_expression_zero(unexpression_type); \
7900 unary_expression->unary.value = left; \
7902 sfunc(&unary_expression->unary); \
7904 return unary_expression; \
7907 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
7908 EXPR_UNARY_POSTFIX_INCREMENT,
7910 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
7911 EXPR_UNARY_POSTFIX_DECREMENT,
7914 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
7916 /* TODO: handle complex + imaginary types */
7918 type_left = get_unqualified_type(type_left);
7919 type_right = get_unqualified_type(type_right);
7921 /* §6.3.1.8 Usual arithmetic conversions */
7922 if (type_left == type_long_double || type_right == type_long_double) {
7923 return type_long_double;
7924 } else if (type_left == type_double || type_right == type_double) {
7926 } else if (type_left == type_float || type_right == type_float) {
7930 type_left = promote_integer(type_left);
7931 type_right = promote_integer(type_right);
7933 if (type_left == type_right)
7936 bool const signed_left = is_type_signed(type_left);
7937 bool const signed_right = is_type_signed(type_right);
7938 unsigned const rank_left = get_akind_rank(get_akind(type_left));
7939 unsigned const rank_right = get_akind_rank(get_akind(type_right));
7941 if (signed_left == signed_right)
7942 return rank_left >= rank_right ? type_left : type_right;
7946 atomic_type_kind_t s_akind;
7947 atomic_type_kind_t u_akind;
7952 u_type = type_right;
7954 s_type = type_right;
7957 s_akind = get_akind(s_type);
7958 u_akind = get_akind(u_type);
7959 s_rank = get_akind_rank(s_akind);
7960 u_rank = get_akind_rank(u_akind);
7962 if (u_rank >= s_rank)
7965 if (get_atomic_type_size(s_akind) > get_atomic_type_size(u_akind))
7969 case ATOMIC_TYPE_INT: return type_unsigned_int;
7970 case ATOMIC_TYPE_LONG: return type_unsigned_long;
7971 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
7973 default: panic("invalid atomic type");
7978 * Check the semantic restrictions for a binary expression.
7980 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
7982 expression_t *const left = expression->left;
7983 expression_t *const right = expression->right;
7984 type_t *const orig_type_left = left->base.type;
7985 type_t *const orig_type_right = right->base.type;
7986 type_t *const type_left = skip_typeref(orig_type_left);
7987 type_t *const type_right = skip_typeref(orig_type_right);
7989 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
7990 /* TODO: improve error message */
7991 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7992 errorf(&expression->base.source_position,
7993 "operation needs arithmetic types");
7998 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7999 expression->left = create_implicit_cast(left, arithmetic_type);
8000 expression->right = create_implicit_cast(right, arithmetic_type);
8001 expression->base.type = arithmetic_type;
8004 static void semantic_binexpr_integer(binary_expression_t *const expression)
8006 expression_t *const left = expression->left;
8007 expression_t *const right = expression->right;
8008 type_t *const orig_type_left = left->base.type;
8009 type_t *const orig_type_right = right->base.type;
8010 type_t *const type_left = skip_typeref(orig_type_left);
8011 type_t *const type_right = skip_typeref(orig_type_right);
8013 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8014 /* TODO: improve error message */
8015 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8016 errorf(&expression->base.source_position,
8017 "operation needs integer types");
8022 type_t *const result_type = semantic_arithmetic(type_left, type_right);
8023 expression->left = create_implicit_cast(left, result_type);
8024 expression->right = create_implicit_cast(right, result_type);
8025 expression->base.type = result_type;
8028 static void warn_div_by_zero(binary_expression_t const *const expression)
8030 if (!is_type_integer(expression->base.type))
8033 expression_t const *const right = expression->right;
8034 /* The type of the right operand can be different for /= */
8035 if (is_type_integer(right->base.type) &&
8036 is_constant_expression(right) == EXPR_CLASS_CONSTANT &&
8037 !fold_constant_to_bool(right)) {
8038 source_position_t const *const pos = &expression->base.source_position;
8039 warningf(WARN_DIV_BY_ZERO, pos, "division by zero");
8044 * Check the semantic restrictions for a div/mod expression.
8046 static void semantic_divmod_arithmetic(binary_expression_t *expression)
8048 semantic_binexpr_arithmetic(expression);
8049 warn_div_by_zero(expression);
8052 static void warn_addsub_in_shift(const expression_t *const expr)
8054 if (expr->base.parenthesized)
8058 switch (expr->kind) {
8059 case EXPR_BINARY_ADD: op = '+'; break;
8060 case EXPR_BINARY_SUB: op = '-'; break;
8064 source_position_t const *const pos = &expr->base.source_position;
8065 warningf(WARN_PARENTHESES, pos, "suggest parentheses around '%c' inside shift", op);
8068 static bool semantic_shift(binary_expression_t *expression)
8070 expression_t *const left = expression->left;
8071 expression_t *const right = expression->right;
8072 type_t *const orig_type_left = left->base.type;
8073 type_t *const orig_type_right = right->base.type;
8074 type_t * type_left = skip_typeref(orig_type_left);
8075 type_t * type_right = skip_typeref(orig_type_right);
8077 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8078 /* TODO: improve error message */
8079 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8080 errorf(&expression->base.source_position,
8081 "operands of shift operation must have integer types");
8086 type_left = promote_integer(type_left);
8088 if (is_constant_expression(right) == EXPR_CLASS_CONSTANT) {
8089 source_position_t const *const pos = &right->base.source_position;
8090 long const count = fold_constant_to_int(right);
8092 warningf(WARN_OTHER, pos, "shift count must be non-negative");
8093 } else if ((unsigned long)count >=
8094 get_atomic_type_size(type_left->atomic.akind) * 8) {
8095 warningf(WARN_OTHER, pos, "shift count must be less than type width");
8099 type_right = promote_integer(type_right);
8100 expression->right = create_implicit_cast(right, type_right);
8105 static void semantic_shift_op(binary_expression_t *expression)
8107 expression_t *const left = expression->left;
8108 expression_t *const right = expression->right;
8110 if (!semantic_shift(expression))
8113 warn_addsub_in_shift(left);
8114 warn_addsub_in_shift(right);
8116 type_t *const orig_type_left = left->base.type;
8117 type_t * type_left = skip_typeref(orig_type_left);
8119 type_left = promote_integer(type_left);
8120 expression->left = create_implicit_cast(left, type_left);
8121 expression->base.type = type_left;
8124 static void semantic_add(binary_expression_t *expression)
8126 expression_t *const left = expression->left;
8127 expression_t *const right = expression->right;
8128 type_t *const orig_type_left = left->base.type;
8129 type_t *const orig_type_right = right->base.type;
8130 type_t *const type_left = skip_typeref(orig_type_left);
8131 type_t *const type_right = skip_typeref(orig_type_right);
8134 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8135 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8136 expression->left = create_implicit_cast(left, arithmetic_type);
8137 expression->right = create_implicit_cast(right, arithmetic_type);
8138 expression->base.type = arithmetic_type;
8139 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8140 check_pointer_arithmetic(&expression->base.source_position,
8141 type_left, orig_type_left);
8142 expression->base.type = type_left;
8143 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8144 check_pointer_arithmetic(&expression->base.source_position,
8145 type_right, orig_type_right);
8146 expression->base.type = type_right;
8147 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8148 errorf(&expression->base.source_position,
8149 "invalid operands to binary + ('%T', '%T')",
8150 orig_type_left, orig_type_right);
8154 static void semantic_sub(binary_expression_t *expression)
8156 expression_t *const left = expression->left;
8157 expression_t *const right = expression->right;
8158 type_t *const orig_type_left = left->base.type;
8159 type_t *const orig_type_right = right->base.type;
8160 type_t *const type_left = skip_typeref(orig_type_left);
8161 type_t *const type_right = skip_typeref(orig_type_right);
8162 source_position_t const *const pos = &expression->base.source_position;
8165 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8166 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8167 expression->left = create_implicit_cast(left, arithmetic_type);
8168 expression->right = create_implicit_cast(right, arithmetic_type);
8169 expression->base.type = arithmetic_type;
8170 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8171 check_pointer_arithmetic(&expression->base.source_position,
8172 type_left, orig_type_left);
8173 expression->base.type = type_left;
8174 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8175 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
8176 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
8177 if (!types_compatible(unqual_left, unqual_right)) {
8179 "subtracting pointers to incompatible types '%T' and '%T'",
8180 orig_type_left, orig_type_right);
8181 } else if (!is_type_object(unqual_left)) {
8182 if (!is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
8183 errorf(pos, "subtracting pointers to non-object types '%T'",
8186 warningf(WARN_OTHER, pos, "subtracting pointers to void");
8189 expression->base.type = type_ptrdiff_t;
8190 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8191 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8192 orig_type_left, orig_type_right);
8196 static void warn_string_literal_address(expression_t const* expr)
8198 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8199 expr = expr->unary.value;
8200 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8202 expr = expr->unary.value;
8205 if (expr->kind == EXPR_STRING_LITERAL
8206 || expr->kind == EXPR_WIDE_STRING_LITERAL) {
8207 source_position_t const *const pos = &expr->base.source_position;
8208 warningf(WARN_ADDRESS, pos, "comparison with string literal results in unspecified behaviour");
8212 static bool maybe_negative(expression_t const *const expr)
8214 switch (is_constant_expression(expr)) {
8215 case EXPR_CLASS_ERROR: return false;
8216 case EXPR_CLASS_CONSTANT: return constant_is_negative(expr);
8217 default: return true;
8221 static void warn_comparison(source_position_t const *const pos, expression_t const *const expr, expression_t const *const other)
8223 warn_string_literal_address(expr);
8225 expression_t const* const ref = get_reference_address(expr);
8226 if (ref != NULL && is_null_pointer_constant(other)) {
8227 entity_t const *const ent = ref->reference.entity;
8228 warningf(WARN_ADDRESS, pos, "the address of '%N' will never be NULL", ent);
8231 if (!expr->base.parenthesized) {
8232 switch (expr->base.kind) {
8233 case EXPR_BINARY_LESS:
8234 case EXPR_BINARY_GREATER:
8235 case EXPR_BINARY_LESSEQUAL:
8236 case EXPR_BINARY_GREATEREQUAL:
8237 case EXPR_BINARY_NOTEQUAL:
8238 case EXPR_BINARY_EQUAL:
8239 warningf(WARN_PARENTHESES, pos, "comparisons like 'x <= y < z' do not have their mathematical meaning");
8248 * Check the semantics of comparison expressions.
8250 * @param expression The expression to check.
8252 static void semantic_comparison(binary_expression_t *expression)
8254 source_position_t const *const pos = &expression->base.source_position;
8255 expression_t *const left = expression->left;
8256 expression_t *const right = expression->right;
8258 warn_comparison(pos, left, right);
8259 warn_comparison(pos, right, left);
8261 type_t *orig_type_left = left->base.type;
8262 type_t *orig_type_right = right->base.type;
8263 type_t *type_left = skip_typeref(orig_type_left);
8264 type_t *type_right = skip_typeref(orig_type_right);
8266 /* TODO non-arithmetic types */
8267 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8268 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8270 /* test for signed vs unsigned compares */
8271 if (is_type_integer(arithmetic_type)) {
8272 bool const signed_left = is_type_signed(type_left);
8273 bool const signed_right = is_type_signed(type_right);
8274 if (signed_left != signed_right) {
8275 /* FIXME long long needs better const folding magic */
8276 /* TODO check whether constant value can be represented by other type */
8277 if ((signed_left && maybe_negative(left)) ||
8278 (signed_right && maybe_negative(right))) {
8279 warningf(WARN_SIGN_COMPARE, pos, "comparison between signed and unsigned");
8284 expression->left = create_implicit_cast(left, arithmetic_type);
8285 expression->right = create_implicit_cast(right, arithmetic_type);
8286 expression->base.type = arithmetic_type;
8287 if ((expression->base.kind == EXPR_BINARY_EQUAL ||
8288 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8289 is_type_float(arithmetic_type)) {
8290 warningf(WARN_FLOAT_EQUAL, pos, "comparing floating point with == or != is unsafe");
8292 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8293 /* TODO check compatibility */
8294 } else if (is_type_pointer(type_left)) {
8295 expression->right = create_implicit_cast(right, type_left);
8296 } else if (is_type_pointer(type_right)) {
8297 expression->left = create_implicit_cast(left, type_right);
8298 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8299 type_error_incompatible("invalid operands in comparison", pos, type_left, type_right);
8301 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8305 * Checks if a compound type has constant fields.
8307 static bool has_const_fields(const compound_type_t *type)
8309 compound_t *compound = type->compound;
8310 entity_t *entry = compound->members.entities;
8312 for (; entry != NULL; entry = entry->base.next) {
8313 if (!is_declaration(entry))
8316 const type_t *decl_type = skip_typeref(entry->declaration.type);
8317 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8324 static bool is_valid_assignment_lhs(expression_t const* const left)
8326 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8327 type_t *const type_left = skip_typeref(orig_type_left);
8329 if (!is_lvalue(left)) {
8330 errorf(&left->base.source_position, "left hand side '%E' of assignment is not an lvalue",
8335 if (left->kind == EXPR_REFERENCE
8336 && left->reference.entity->kind == ENTITY_FUNCTION) {
8337 errorf(&left->base.source_position, "cannot assign to function '%E'", left);
8341 if (is_type_array(type_left)) {
8342 errorf(&left->base.source_position, "cannot assign to array '%E'", left);
8345 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8346 errorf(&left->base.source_position, "assignment to read-only location '%E' (type '%T')", left,
8350 if (is_type_incomplete(type_left)) {
8351 errorf(&left->base.source_position, "left-hand side '%E' of assignment has incomplete type '%T'",
8352 left, orig_type_left);
8355 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8356 errorf(&left->base.source_position, "cannot assign to '%E' because compound type '%T' has read-only fields",
8357 left, orig_type_left);
8364 static void semantic_arithmetic_assign(binary_expression_t *expression)
8366 expression_t *left = expression->left;
8367 expression_t *right = expression->right;
8368 type_t *orig_type_left = left->base.type;
8369 type_t *orig_type_right = right->base.type;
8371 if (!is_valid_assignment_lhs(left))
8374 type_t *type_left = skip_typeref(orig_type_left);
8375 type_t *type_right = skip_typeref(orig_type_right);
8377 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8378 /* TODO: improve error message */
8379 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8380 errorf(&expression->base.source_position,
8381 "operation needs arithmetic types");
8386 /* combined instructions are tricky. We can't create an implicit cast on
8387 * the left side, because we need the uncasted form for the store.
8388 * The ast2firm pass has to know that left_type must be right_type
8389 * for the arithmetic operation and create a cast by itself */
8390 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8391 expression->right = create_implicit_cast(right, arithmetic_type);
8392 expression->base.type = type_left;
8395 static void semantic_divmod_assign(binary_expression_t *expression)
8397 semantic_arithmetic_assign(expression);
8398 warn_div_by_zero(expression);
8401 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8403 expression_t *const left = expression->left;
8404 expression_t *const right = expression->right;
8405 type_t *const orig_type_left = left->base.type;
8406 type_t *const orig_type_right = right->base.type;
8407 type_t *const type_left = skip_typeref(orig_type_left);
8408 type_t *const type_right = skip_typeref(orig_type_right);
8410 if (!is_valid_assignment_lhs(left))
8413 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8414 /* combined instructions are tricky. We can't create an implicit cast on
8415 * the left side, because we need the uncasted form for the store.
8416 * The ast2firm pass has to know that left_type must be right_type
8417 * for the arithmetic operation and create a cast by itself */
8418 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8419 expression->right = create_implicit_cast(right, arithmetic_type);
8420 expression->base.type = type_left;
8421 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8422 check_pointer_arithmetic(&expression->base.source_position,
8423 type_left, orig_type_left);
8424 expression->base.type = type_left;
8425 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8426 errorf(&expression->base.source_position,
8427 "incompatible types '%T' and '%T' in assignment",
8428 orig_type_left, orig_type_right);
8432 static void semantic_integer_assign(binary_expression_t *expression)
8434 expression_t *left = expression->left;
8435 expression_t *right = expression->right;
8436 type_t *orig_type_left = left->base.type;
8437 type_t *orig_type_right = right->base.type;
8439 if (!is_valid_assignment_lhs(left))
8442 type_t *type_left = skip_typeref(orig_type_left);
8443 type_t *type_right = skip_typeref(orig_type_right);
8445 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8446 /* TODO: improve error message */
8447 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8448 errorf(&expression->base.source_position,
8449 "operation needs integer types");
8454 /* combined instructions are tricky. We can't create an implicit cast on
8455 * the left side, because we need the uncasted form for the store.
8456 * The ast2firm pass has to know that left_type must be right_type
8457 * for the arithmetic operation and create a cast by itself */
8458 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8459 expression->right = create_implicit_cast(right, arithmetic_type);
8460 expression->base.type = type_left;
8463 static void semantic_shift_assign(binary_expression_t *expression)
8465 expression_t *left = expression->left;
8467 if (!is_valid_assignment_lhs(left))
8470 if (!semantic_shift(expression))
8473 expression->base.type = skip_typeref(left->base.type);
8476 static void warn_logical_and_within_or(const expression_t *const expr)
8478 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8480 if (expr->base.parenthesized)
8482 source_position_t const *const pos = &expr->base.source_position;
8483 warningf(WARN_PARENTHESES, pos, "suggest parentheses around && within ||");
8487 * Check the semantic restrictions of a logical expression.
8489 static void semantic_logical_op(binary_expression_t *expression)
8491 /* §6.5.13:2 Each of the operands shall have scalar type.
8492 * §6.5.14:2 Each of the operands shall have scalar type. */
8493 semantic_condition(expression->left, "left operand of logical operator");
8494 semantic_condition(expression->right, "right operand of logical operator");
8495 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR) {
8496 warn_logical_and_within_or(expression->left);
8497 warn_logical_and_within_or(expression->right);
8499 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8503 * Check the semantic restrictions of a binary assign expression.
8505 static void semantic_binexpr_assign(binary_expression_t *expression)
8507 expression_t *left = expression->left;
8508 type_t *orig_type_left = left->base.type;
8510 if (!is_valid_assignment_lhs(left))
8513 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8514 report_assign_error(error, orig_type_left, expression->right,
8515 "assignment", &left->base.source_position);
8516 expression->right = create_implicit_cast(expression->right, orig_type_left);
8517 expression->base.type = orig_type_left;
8521 * Determine if the outermost operation (or parts thereof) of the given
8522 * expression has no effect in order to generate a warning about this fact.
8523 * Therefore in some cases this only examines some of the operands of the
8524 * expression (see comments in the function and examples below).
8526 * f() + 23; // warning, because + has no effect
8527 * x || f(); // no warning, because x controls execution of f()
8528 * x ? y : f(); // warning, because y has no effect
8529 * (void)x; // no warning to be able to suppress the warning
8530 * This function can NOT be used for an "expression has definitely no effect"-
8532 static bool expression_has_effect(const expression_t *const expr)
8534 switch (expr->kind) {
8535 case EXPR_ERROR: return true; /* do NOT warn */
8536 case EXPR_REFERENCE: return false;
8537 case EXPR_REFERENCE_ENUM_VALUE: return false;
8538 case EXPR_LABEL_ADDRESS: return false;
8540 /* suppress the warning for microsoft __noop operations */
8541 case EXPR_LITERAL_MS_NOOP: return true;
8542 case EXPR_LITERAL_BOOLEAN:
8543 case EXPR_LITERAL_CHARACTER:
8544 case EXPR_LITERAL_WIDE_CHARACTER:
8545 case EXPR_LITERAL_INTEGER:
8546 case EXPR_LITERAL_INTEGER_OCTAL:
8547 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
8548 case EXPR_LITERAL_FLOATINGPOINT:
8549 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: return false;
8550 case EXPR_STRING_LITERAL: return false;
8551 case EXPR_WIDE_STRING_LITERAL: return false;
8554 const call_expression_t *const call = &expr->call;
8555 if (call->function->kind != EXPR_REFERENCE)
8558 switch (call->function->reference.entity->function.btk) {
8559 /* FIXME: which builtins have no effect? */
8560 default: return true;
8564 /* Generate the warning if either the left or right hand side of a
8565 * conditional expression has no effect */
8566 case EXPR_CONDITIONAL: {
8567 conditional_expression_t const *const cond = &expr->conditional;
8568 expression_t const *const t = cond->true_expression;
8570 (t == NULL || expression_has_effect(t)) &&
8571 expression_has_effect(cond->false_expression);
8574 case EXPR_SELECT: return false;
8575 case EXPR_ARRAY_ACCESS: return false;
8576 case EXPR_SIZEOF: return false;
8577 case EXPR_CLASSIFY_TYPE: return false;
8578 case EXPR_ALIGNOF: return false;
8580 case EXPR_FUNCNAME: return false;
8581 case EXPR_BUILTIN_CONSTANT_P: return false;
8582 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8583 case EXPR_OFFSETOF: return false;
8584 case EXPR_VA_START: return true;
8585 case EXPR_VA_ARG: return true;
8586 case EXPR_VA_COPY: return true;
8587 case EXPR_STATEMENT: return true; // TODO
8588 case EXPR_COMPOUND_LITERAL: return false;
8590 case EXPR_UNARY_NEGATE: return false;
8591 case EXPR_UNARY_PLUS: return false;
8592 case EXPR_UNARY_BITWISE_NEGATE: return false;
8593 case EXPR_UNARY_NOT: return false;
8594 case EXPR_UNARY_DEREFERENCE: return false;
8595 case EXPR_UNARY_TAKE_ADDRESS: return false;
8596 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8597 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8598 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8599 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8601 /* Treat void casts as if they have an effect in order to being able to
8602 * suppress the warning */
8603 case EXPR_UNARY_CAST: {
8604 type_t *const type = skip_typeref(expr->base.type);
8605 return is_type_atomic(type, ATOMIC_TYPE_VOID);
8608 case EXPR_UNARY_ASSUME: return true;
8609 case EXPR_UNARY_DELETE: return true;
8610 case EXPR_UNARY_DELETE_ARRAY: return true;
8611 case EXPR_UNARY_THROW: return true;
8613 case EXPR_BINARY_ADD: return false;
8614 case EXPR_BINARY_SUB: return false;
8615 case EXPR_BINARY_MUL: return false;
8616 case EXPR_BINARY_DIV: return false;
8617 case EXPR_BINARY_MOD: return false;
8618 case EXPR_BINARY_EQUAL: return false;
8619 case EXPR_BINARY_NOTEQUAL: return false;
8620 case EXPR_BINARY_LESS: return false;
8621 case EXPR_BINARY_LESSEQUAL: return false;
8622 case EXPR_BINARY_GREATER: return false;
8623 case EXPR_BINARY_GREATEREQUAL: return false;
8624 case EXPR_BINARY_BITWISE_AND: return false;
8625 case EXPR_BINARY_BITWISE_OR: return false;
8626 case EXPR_BINARY_BITWISE_XOR: return false;
8627 case EXPR_BINARY_SHIFTLEFT: return false;
8628 case EXPR_BINARY_SHIFTRIGHT: return false;
8629 case EXPR_BINARY_ASSIGN: return true;
8630 case EXPR_BINARY_MUL_ASSIGN: return true;
8631 case EXPR_BINARY_DIV_ASSIGN: return true;
8632 case EXPR_BINARY_MOD_ASSIGN: return true;
8633 case EXPR_BINARY_ADD_ASSIGN: return true;
8634 case EXPR_BINARY_SUB_ASSIGN: return true;
8635 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8636 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8637 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8638 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8639 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8641 /* Only examine the right hand side of && and ||, because the left hand
8642 * side already has the effect of controlling the execution of the right
8644 case EXPR_BINARY_LOGICAL_AND:
8645 case EXPR_BINARY_LOGICAL_OR:
8646 /* Only examine the right hand side of a comma expression, because the left
8647 * hand side has a separate warning */
8648 case EXPR_BINARY_COMMA:
8649 return expression_has_effect(expr->binary.right);
8651 case EXPR_BINARY_ISGREATER: return false;
8652 case EXPR_BINARY_ISGREATEREQUAL: return false;
8653 case EXPR_BINARY_ISLESS: return false;
8654 case EXPR_BINARY_ISLESSEQUAL: return false;
8655 case EXPR_BINARY_ISLESSGREATER: return false;
8656 case EXPR_BINARY_ISUNORDERED: return false;
8659 internal_errorf(HERE, "unexpected expression");
8662 static void semantic_comma(binary_expression_t *expression)
8664 const expression_t *const left = expression->left;
8665 if (!expression_has_effect(left)) {
8666 source_position_t const *const pos = &left->base.source_position;
8667 warningf(WARN_UNUSED_VALUE, pos, "left-hand operand of comma expression has no effect");
8669 expression->base.type = expression->right->base.type;
8673 * @param prec_r precedence of the right operand
8675 #define CREATE_BINEXPR_PARSER(token_kind, binexpression_type, prec_r, sfunc) \
8676 static expression_t *parse_##binexpression_type(expression_t *left) \
8678 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8679 binexpr->binary.left = left; \
8682 expression_t *right = parse_subexpression(prec_r); \
8684 binexpr->binary.right = right; \
8685 sfunc(&binexpr->binary); \
8690 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8691 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
8692 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
8693 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8694 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8695 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8696 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8697 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
8698 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
8699 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
8700 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
8701 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
8702 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
8703 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_integer)
8704 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_integer)
8705 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_integer)
8706 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8707 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8708 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
8709 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8710 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8711 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8712 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8713 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8714 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8715 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8716 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8717 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8718 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8719 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
8722 static expression_t *parse_subexpression(precedence_t precedence)
8724 if (token.kind < 0) {
8725 return expected_expression_error();
8728 expression_parser_function_t *parser
8729 = &expression_parsers[token.kind];
8732 if (parser->parser != NULL) {
8733 left = parser->parser();
8735 left = parse_primary_expression();
8737 assert(left != NULL);
8740 if (token.kind < 0) {
8741 return expected_expression_error();
8744 parser = &expression_parsers[token.kind];
8745 if (parser->infix_parser == NULL)
8747 if (parser->infix_precedence < precedence)
8750 left = parser->infix_parser(left);
8752 assert(left != NULL);
8759 * Parse an expression.
8761 static expression_t *parse_expression(void)
8763 return parse_subexpression(PREC_EXPRESSION);
8767 * Register a parser for a prefix-like operator.
8769 * @param parser the parser function
8770 * @param token_kind the token type of the prefix token
8772 static void register_expression_parser(parse_expression_function parser,
8775 expression_parser_function_t *entry = &expression_parsers[token_kind];
8777 if (entry->parser != NULL) {
8778 diagnosticf("for token '%k'\n", (token_kind_t)token_kind);
8779 panic("trying to register multiple expression parsers for a token");
8781 entry->parser = parser;
8785 * Register a parser for an infix operator with given precedence.
8787 * @param parser the parser function
8788 * @param token_kind the token type of the infix operator
8789 * @param precedence the precedence of the operator
8791 static void register_infix_parser(parse_expression_infix_function parser,
8792 int token_kind, precedence_t precedence)
8794 expression_parser_function_t *entry = &expression_parsers[token_kind];
8796 if (entry->infix_parser != NULL) {
8797 diagnosticf("for token '%k'\n", (token_kind_t)token_kind);
8798 panic("trying to register multiple infix expression parsers for a "
8801 entry->infix_parser = parser;
8802 entry->infix_precedence = precedence;
8806 * Initialize the expression parsers.
8808 static void init_expression_parsers(void)
8810 memset(&expression_parsers, 0, sizeof(expression_parsers));
8812 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
8813 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
8814 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
8815 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
8816 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
8817 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
8818 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
8819 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
8820 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
8821 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
8822 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
8823 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
8824 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
8825 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
8826 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
8827 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
8828 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
8829 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
8830 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
8831 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
8832 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
8833 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
8834 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
8835 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
8836 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
8837 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
8838 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
8839 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
8840 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
8841 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
8842 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
8843 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
8844 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
8845 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
8846 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
8847 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
8848 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
8850 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
8851 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
8852 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
8853 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
8854 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
8855 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
8856 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
8857 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
8858 register_expression_parser(parse_sizeof, T_sizeof);
8859 register_expression_parser(parse_alignof, T___alignof__);
8860 register_expression_parser(parse_extension, T___extension__);
8861 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
8862 register_expression_parser(parse_delete, T_delete);
8863 register_expression_parser(parse_throw, T_throw);
8867 * Parse a asm statement arguments specification.
8869 static asm_argument_t *parse_asm_arguments(bool is_out)
8871 asm_argument_t *result = NULL;
8872 asm_argument_t **anchor = &result;
8874 while (token.kind == T_STRING_LITERAL || token.kind == '[') {
8875 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
8876 memset(argument, 0, sizeof(argument[0]));
8879 if (token.kind != T_IDENTIFIER) {
8880 parse_error_expected("while parsing asm argument",
8881 T_IDENTIFIER, NULL);
8884 argument->symbol = token.identifier.symbol;
8886 expect(']', end_error);
8889 argument->constraints = parse_string_literals();
8890 expect('(', end_error);
8891 add_anchor_token(')');
8892 expression_t *expression = parse_expression();
8893 rem_anchor_token(')');
8895 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
8896 * change size or type representation (e.g. int -> long is ok, but
8897 * int -> float is not) */
8898 if (expression->kind == EXPR_UNARY_CAST) {
8899 type_t *const type = expression->base.type;
8900 type_kind_t const kind = type->kind;
8901 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
8904 if (kind == TYPE_ATOMIC) {
8905 atomic_type_kind_t const akind = type->atomic.akind;
8906 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8907 size = get_atomic_type_size(akind);
8909 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8910 size = get_type_size(type_void_ptr);
8914 expression_t *const value = expression->unary.value;
8915 type_t *const value_type = value->base.type;
8916 type_kind_t const value_kind = value_type->kind;
8918 unsigned value_flags;
8919 unsigned value_size;
8920 if (value_kind == TYPE_ATOMIC) {
8921 atomic_type_kind_t const value_akind = value_type->atomic.akind;
8922 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8923 value_size = get_atomic_type_size(value_akind);
8924 } else if (value_kind == TYPE_POINTER) {
8925 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8926 value_size = get_type_size(type_void_ptr);
8931 if (value_flags != flags || value_size != size)
8935 } while (expression->kind == EXPR_UNARY_CAST);
8939 if (!is_lvalue(expression)) {
8940 errorf(&expression->base.source_position,
8941 "asm output argument is not an lvalue");
8944 if (argument->constraints.begin[0] == '=')
8945 determine_lhs_ent(expression, NULL);
8947 mark_vars_read(expression, NULL);
8949 mark_vars_read(expression, NULL);
8951 argument->expression = expression;
8952 expect(')', end_error);
8954 set_address_taken(expression, true);
8957 anchor = &argument->next;
8969 * Parse a asm statement clobber specification.
8971 static asm_clobber_t *parse_asm_clobbers(void)
8973 asm_clobber_t *result = NULL;
8974 asm_clobber_t **anchor = &result;
8976 while (token.kind == T_STRING_LITERAL) {
8977 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
8978 clobber->clobber = parse_string_literals();
8981 anchor = &clobber->next;
8991 * Parse an asm statement.
8993 static statement_t *parse_asm_statement(void)
8995 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
8996 asm_statement_t *asm_statement = &statement->asms;
9000 if (next_if(T_volatile))
9001 asm_statement->is_volatile = true;
9003 expect('(', end_error);
9004 add_anchor_token(')');
9005 if (token.kind != T_STRING_LITERAL) {
9006 parse_error_expected("after asm(", T_STRING_LITERAL, NULL);
9009 asm_statement->asm_text = parse_string_literals();
9011 add_anchor_token(':');
9012 if (!next_if(':')) {
9013 rem_anchor_token(':');
9017 asm_statement->outputs = parse_asm_arguments(true);
9018 if (!next_if(':')) {
9019 rem_anchor_token(':');
9023 asm_statement->inputs = parse_asm_arguments(false);
9024 if (!next_if(':')) {
9025 rem_anchor_token(':');
9028 rem_anchor_token(':');
9030 asm_statement->clobbers = parse_asm_clobbers();
9033 rem_anchor_token(')');
9034 expect(')', end_error);
9035 expect(';', end_error);
9037 if (asm_statement->outputs == NULL) {
9038 /* GCC: An 'asm' instruction without any output operands will be treated
9039 * identically to a volatile 'asm' instruction. */
9040 asm_statement->is_volatile = true;
9045 return create_error_statement();
9048 static statement_t *parse_label_inner_statement(statement_t const *const label, char const *const label_kind)
9050 statement_t *inner_stmt;
9051 switch (token.kind) {
9053 errorf(&label->base.source_position, "%s at end of compound statement", label_kind);
9054 inner_stmt = create_error_statement();
9058 if (label->kind == STATEMENT_LABEL) {
9059 /* Eat an empty statement here, to avoid the warning about an empty
9060 * statement after a label. label:; is commonly used to have a label
9061 * before a closing brace. */
9062 inner_stmt = create_empty_statement();
9069 inner_stmt = parse_statement();
9070 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
9071 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
9072 if (inner_stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
9073 errorf(&inner_stmt->base.source_position, "declaration after %s", label_kind);
9081 * Parse a case statement.
9083 static statement_t *parse_case_statement(void)
9085 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9086 source_position_t *const pos = &statement->base.source_position;
9090 expression_t *const expression = parse_expression();
9091 statement->case_label.expression = expression;
9092 expression_classification_t const expr_class = is_constant_expression(expression);
9093 if (expr_class != EXPR_CLASS_CONSTANT) {
9094 if (expr_class != EXPR_CLASS_ERROR) {
9095 errorf(pos, "case label does not reduce to an integer constant");
9097 statement->case_label.is_bad = true;
9099 long const val = fold_constant_to_int(expression);
9100 statement->case_label.first_case = val;
9101 statement->case_label.last_case = val;
9105 if (next_if(T_DOTDOTDOT)) {
9106 expression_t *const end_range = parse_expression();
9107 statement->case_label.end_range = end_range;
9108 expression_classification_t const end_class = is_constant_expression(end_range);
9109 if (end_class != EXPR_CLASS_CONSTANT) {
9110 if (end_class != EXPR_CLASS_ERROR) {
9111 errorf(pos, "case range does not reduce to an integer constant");
9113 statement->case_label.is_bad = true;
9115 long const val = fold_constant_to_int(end_range);
9116 statement->case_label.last_case = val;
9118 if (val < statement->case_label.first_case) {
9119 statement->case_label.is_empty_range = true;
9120 warningf(WARN_OTHER, pos, "empty range specified");
9126 PUSH_PARENT(statement);
9128 expect(':', end_error);
9131 if (current_switch != NULL) {
9132 if (! statement->case_label.is_bad) {
9133 /* Check for duplicate case values */
9134 case_label_statement_t *c = &statement->case_label;
9135 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9136 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9139 if (c->last_case < l->first_case || c->first_case > l->last_case)
9142 errorf(pos, "duplicate case value (previously used %P)",
9143 &l->base.source_position);
9147 /* link all cases into the switch statement */
9148 if (current_switch->last_case == NULL) {
9149 current_switch->first_case = &statement->case_label;
9151 current_switch->last_case->next = &statement->case_label;
9153 current_switch->last_case = &statement->case_label;
9155 errorf(pos, "case label not within a switch statement");
9158 statement->case_label.statement = parse_label_inner_statement(statement, "case label");
9165 * Parse a default statement.
9167 static statement_t *parse_default_statement(void)
9169 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9173 PUSH_PARENT(statement);
9175 expect(':', end_error);
9178 if (current_switch != NULL) {
9179 const case_label_statement_t *def_label = current_switch->default_label;
9180 if (def_label != NULL) {
9181 errorf(&statement->base.source_position, "multiple default labels in one switch (previous declared %P)", &def_label->base.source_position);
9183 current_switch->default_label = &statement->case_label;
9185 /* link all cases into the switch statement */
9186 if (current_switch->last_case == NULL) {
9187 current_switch->first_case = &statement->case_label;
9189 current_switch->last_case->next = &statement->case_label;
9191 current_switch->last_case = &statement->case_label;
9194 errorf(&statement->base.source_position,
9195 "'default' label not within a switch statement");
9198 statement->case_label.statement = parse_label_inner_statement(statement, "default label");
9205 * Parse a label statement.
9207 static statement_t *parse_label_statement(void)
9209 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9210 label_t *const label = get_label();
9211 statement->label.label = label;
9213 PUSH_PARENT(statement);
9215 /* if statement is already set then the label is defined twice,
9216 * otherwise it was just mentioned in a goto/local label declaration so far
9218 source_position_t const* const pos = &statement->base.source_position;
9219 if (label->statement != NULL) {
9220 errorf(pos, "duplicate '%N' (declared %P)", (entity_t const*)label, &label->base.source_position);
9222 label->base.source_position = *pos;
9223 label->statement = statement;
9228 if (token.kind == T___attribute__ && !(c_mode & _CXX)) {
9229 parse_attributes(NULL); // TODO process attributes
9232 statement->label.statement = parse_label_inner_statement(statement, "label");
9234 /* remember the labels in a list for later checking */
9235 *label_anchor = &statement->label;
9236 label_anchor = &statement->label.next;
9242 static statement_t *parse_inner_statement(void)
9244 statement_t *const stmt = parse_statement();
9245 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
9246 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
9247 if (stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
9248 errorf(&stmt->base.source_position, "declaration as inner statement, use {}");
9254 * Parse an if statement.
9256 static statement_t *parse_if(void)
9258 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9262 PUSH_PARENT(statement);
9264 add_anchor_token('{');
9266 expect('(', end_error);
9267 add_anchor_token(')');
9268 expression_t *const expr = parse_expression();
9269 statement->ifs.condition = expr;
9270 /* §6.8.4.1:1 The controlling expression of an if statement shall have
9272 semantic_condition(expr, "condition of 'if'-statment");
9273 mark_vars_read(expr, NULL);
9274 rem_anchor_token(')');
9275 expect(')', end_error);
9278 rem_anchor_token('{');
9280 add_anchor_token(T_else);
9281 statement_t *const true_stmt = parse_inner_statement();
9282 statement->ifs.true_statement = true_stmt;
9283 rem_anchor_token(T_else);
9285 if (true_stmt->kind == STATEMENT_EMPTY) {
9286 warningf(WARN_EMPTY_BODY, HERE,
9287 "suggest braces around empty body in an ‘if’ statement");
9290 if (next_if(T_else)) {
9291 statement->ifs.false_statement = parse_inner_statement();
9293 if (statement->ifs.false_statement->kind == STATEMENT_EMPTY) {
9294 warningf(WARN_EMPTY_BODY, HERE,
9295 "suggest braces around empty body in an ‘if’ statement");
9297 } else if (true_stmt->kind == STATEMENT_IF &&
9298 true_stmt->ifs.false_statement != NULL) {
9299 source_position_t const *const pos = &true_stmt->base.source_position;
9300 warningf(WARN_PARENTHESES, pos, "suggest explicit braces to avoid ambiguous 'else'");
9308 * Check that all enums are handled in a switch.
9310 * @param statement the switch statement to check
9312 static void check_enum_cases(const switch_statement_t *statement)
9314 if (!is_warn_on(WARN_SWITCH_ENUM))
9316 const type_t *type = skip_typeref(statement->expression->base.type);
9317 if (! is_type_enum(type))
9319 const enum_type_t *enumt = &type->enumt;
9321 /* if we have a default, no warnings */
9322 if (statement->default_label != NULL)
9325 /* FIXME: calculation of value should be done while parsing */
9326 /* TODO: quadratic algorithm here. Change to an n log n one */
9327 long last_value = -1;
9328 const entity_t *entry = enumt->enume->base.next;
9329 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9330 entry = entry->base.next) {
9331 const expression_t *expression = entry->enum_value.value;
9332 long value = expression != NULL ? fold_constant_to_int(expression) : last_value + 1;
9334 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9335 if (l->expression == NULL)
9337 if (l->first_case <= value && value <= l->last_case) {
9343 source_position_t const *const pos = &statement->base.source_position;
9344 warningf(WARN_SWITCH_ENUM, pos, "'%N' not handled in switch", entry);
9351 * Parse a switch statement.
9353 static statement_t *parse_switch(void)
9355 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9359 PUSH_PARENT(statement);
9361 expect('(', end_error);
9362 add_anchor_token(')');
9363 expression_t *const expr = parse_expression();
9364 mark_vars_read(expr, NULL);
9365 type_t * type = skip_typeref(expr->base.type);
9366 if (is_type_integer(type)) {
9367 type = promote_integer(type);
9368 if (get_akind_rank(get_akind(type)) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9369 warningf(WARN_TRADITIONAL, &expr->base.source_position, "'%T' switch expression not converted to '%T' in ISO C", type, type_int);
9371 } else if (is_type_valid(type)) {
9372 errorf(&expr->base.source_position,
9373 "switch quantity is not an integer, but '%T'", type);
9374 type = type_error_type;
9376 statement->switchs.expression = create_implicit_cast(expr, type);
9377 expect(')', end_error);
9378 rem_anchor_token(')');
9380 switch_statement_t *rem = current_switch;
9381 current_switch = &statement->switchs;
9382 statement->switchs.body = parse_inner_statement();
9383 current_switch = rem;
9385 if (statement->switchs.default_label == NULL) {
9386 warningf(WARN_SWITCH_DEFAULT, &statement->base.source_position, "switch has no default case");
9388 check_enum_cases(&statement->switchs);
9394 return create_error_statement();
9397 static statement_t *parse_loop_body(statement_t *const loop)
9399 statement_t *const rem = current_loop;
9400 current_loop = loop;
9402 statement_t *const body = parse_inner_statement();
9409 * Parse a while statement.
9411 static statement_t *parse_while(void)
9413 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9417 PUSH_PARENT(statement);
9419 expect('(', end_error);
9420 add_anchor_token(')');
9421 expression_t *const cond = parse_expression();
9422 statement->whiles.condition = cond;
9423 /* §6.8.5:2 The controlling expression of an iteration statement shall
9424 * have scalar type. */
9425 semantic_condition(cond, "condition of 'while'-statement");
9426 mark_vars_read(cond, NULL);
9427 rem_anchor_token(')');
9428 expect(')', end_error);
9430 statement->whiles.body = parse_loop_body(statement);
9436 return create_error_statement();
9440 * Parse a do statement.
9442 static statement_t *parse_do(void)
9444 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9448 PUSH_PARENT(statement);
9450 add_anchor_token(T_while);
9451 statement->do_while.body = parse_loop_body(statement);
9452 rem_anchor_token(T_while);
9454 expect(T_while, end_error);
9455 expect('(', end_error);
9456 add_anchor_token(')');
9457 expression_t *const cond = parse_expression();
9458 statement->do_while.condition = cond;
9459 /* §6.8.5:2 The controlling expression of an iteration statement shall
9460 * have scalar type. */
9461 semantic_condition(cond, "condition of 'do-while'-statement");
9462 mark_vars_read(cond, NULL);
9463 rem_anchor_token(')');
9464 expect(')', end_error);
9465 expect(';', end_error);
9471 return create_error_statement();
9475 * Parse a for statement.
9477 static statement_t *parse_for(void)
9479 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9483 expect('(', end_error1);
9484 add_anchor_token(')');
9486 PUSH_PARENT(statement);
9487 PUSH_SCOPE(&statement->fors.scope);
9492 } else if (is_declaration_specifier(&token)) {
9493 parse_declaration(record_entity, DECL_FLAGS_NONE);
9495 add_anchor_token(';');
9496 expression_t *const init = parse_expression();
9497 statement->fors.initialisation = init;
9498 mark_vars_read(init, ENT_ANY);
9499 if (!expression_has_effect(init)) {
9500 warningf(WARN_UNUSED_VALUE, &init->base.source_position, "initialisation of 'for'-statement has no effect");
9502 rem_anchor_token(';');
9503 expect(';', end_error2);
9508 if (token.kind != ';') {
9509 add_anchor_token(';');
9510 expression_t *const cond = parse_expression();
9511 statement->fors.condition = cond;
9512 /* §6.8.5:2 The controlling expression of an iteration statement
9513 * shall have scalar type. */
9514 semantic_condition(cond, "condition of 'for'-statement");
9515 mark_vars_read(cond, NULL);
9516 rem_anchor_token(';');
9518 expect(';', end_error2);
9519 if (token.kind != ')') {
9520 expression_t *const step = parse_expression();
9521 statement->fors.step = step;
9522 mark_vars_read(step, ENT_ANY);
9523 if (!expression_has_effect(step)) {
9524 warningf(WARN_UNUSED_VALUE, &step->base.source_position, "step of 'for'-statement has no effect");
9527 expect(')', end_error2);
9528 rem_anchor_token(')');
9529 statement->fors.body = parse_loop_body(statement);
9537 rem_anchor_token(')');
9542 return create_error_statement();
9546 * Parse a goto statement.
9548 static statement_t *parse_goto(void)
9550 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
9553 if (GNU_MODE && next_if('*')) {
9554 expression_t *expression = parse_expression();
9555 mark_vars_read(expression, NULL);
9557 /* Argh: although documentation says the expression must be of type void*,
9558 * gcc accepts anything that can be casted into void* without error */
9559 type_t *type = expression->base.type;
9561 if (type != type_error_type) {
9562 if (!is_type_pointer(type) && !is_type_integer(type)) {
9563 errorf(&expression->base.source_position,
9564 "cannot convert to a pointer type");
9565 } else if (type != type_void_ptr) {
9566 warningf(WARN_OTHER, &expression->base.source_position, "type of computed goto expression should be 'void*' not '%T'", type);
9568 expression = create_implicit_cast(expression, type_void_ptr);
9571 statement->gotos.expression = expression;
9572 } else if (token.kind == T_IDENTIFIER) {
9573 label_t *const label = get_label();
9575 statement->gotos.label = label;
9578 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
9580 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
9582 return create_error_statement();
9585 /* remember the goto's in a list for later checking */
9586 *goto_anchor = &statement->gotos;
9587 goto_anchor = &statement->gotos.next;
9589 expect(';', end_error);
9596 * Parse a continue statement.
9598 static statement_t *parse_continue(void)
9600 if (current_loop == NULL) {
9601 errorf(HERE, "continue statement not within loop");
9604 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9607 expect(';', end_error);
9614 * Parse a break statement.
9616 static statement_t *parse_break(void)
9618 if (current_switch == NULL && current_loop == NULL) {
9619 errorf(HERE, "break statement not within loop or switch");
9622 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9625 expect(';', end_error);
9632 * Parse a __leave statement.
9634 static statement_t *parse_leave_statement(void)
9636 if (current_try == NULL) {
9637 errorf(HERE, "__leave statement not within __try");
9640 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9643 expect(';', end_error);
9650 * Check if a given entity represents a local variable.
9652 static bool is_local_variable(const entity_t *entity)
9654 if (entity->kind != ENTITY_VARIABLE)
9657 switch ((storage_class_tag_t) entity->declaration.storage_class) {
9658 case STORAGE_CLASS_AUTO:
9659 case STORAGE_CLASS_REGISTER: {
9660 const type_t *type = skip_typeref(entity->declaration.type);
9661 if (is_type_function(type)) {
9673 * Check if a given expression represents a local variable.
9675 static bool expression_is_local_variable(const expression_t *expression)
9677 if (expression->base.kind != EXPR_REFERENCE) {
9680 const entity_t *entity = expression->reference.entity;
9681 return is_local_variable(entity);
9685 * Check if a given expression represents a local variable and
9686 * return its declaration then, else return NULL.
9688 entity_t *expression_is_variable(const expression_t *expression)
9690 if (expression->base.kind != EXPR_REFERENCE) {
9693 entity_t *entity = expression->reference.entity;
9694 if (entity->kind != ENTITY_VARIABLE)
9701 * Parse a return statement.
9703 static statement_t *parse_return(void)
9705 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9708 expression_t *return_value = NULL;
9709 if (token.kind != ';') {
9710 return_value = parse_expression();
9711 mark_vars_read(return_value, NULL);
9714 const type_t *const func_type = skip_typeref(current_function->base.type);
9715 assert(is_type_function(func_type));
9716 type_t *const return_type = skip_typeref(func_type->function.return_type);
9718 source_position_t const *const pos = &statement->base.source_position;
9719 if (return_value != NULL) {
9720 type_t *return_value_type = skip_typeref(return_value->base.type);
9722 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
9723 if (is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
9724 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
9725 /* Only warn in C mode, because GCC does the same */
9726 if (c_mode & _CXX || strict_mode) {
9728 "'return' with a value, in function returning 'void'");
9730 warningf(WARN_OTHER, pos, "'return' with a value, in function returning 'void'");
9732 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9733 /* Only warn in C mode, because GCC does the same */
9736 "'return' with expression in function returning 'void'");
9738 warningf(WARN_OTHER, pos, "'return' with expression in function returning 'void'");
9742 assign_error_t error = semantic_assign(return_type, return_value);
9743 report_assign_error(error, return_type, return_value, "'return'",
9746 return_value = create_implicit_cast(return_value, return_type);
9747 /* check for returning address of a local var */
9748 if (return_value != NULL && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
9749 const expression_t *expression = return_value->unary.value;
9750 if (expression_is_local_variable(expression)) {
9751 warningf(WARN_OTHER, pos, "function returns address of local variable");
9754 } else if (!is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
9755 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9756 if (c_mode & _CXX || strict_mode) {
9758 "'return' without value, in function returning non-void");
9760 warningf(WARN_OTHER, pos, "'return' without value, in function returning non-void");
9763 statement->returns.value = return_value;
9765 expect(';', end_error);
9772 * Parse a declaration statement.
9774 static statement_t *parse_declaration_statement(void)
9776 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9778 entity_t *before = current_scope->last_entity;
9780 parse_external_declaration();
9782 parse_declaration(record_entity, DECL_FLAGS_NONE);
9785 declaration_statement_t *const decl = &statement->declaration;
9786 entity_t *const begin =
9787 before != NULL ? before->base.next : current_scope->entities;
9788 decl->declarations_begin = begin;
9789 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
9795 * Parse an expression statement, ie. expr ';'.
9797 static statement_t *parse_expression_statement(void)
9799 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
9801 expression_t *const expr = parse_expression();
9802 statement->expression.expression = expr;
9803 mark_vars_read(expr, ENT_ANY);
9805 expect(';', end_error);
9812 * Parse a microsoft __try { } __finally { } or
9813 * __try{ } __except() { }
9815 static statement_t *parse_ms_try_statment(void)
9817 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
9820 PUSH_PARENT(statement);
9822 ms_try_statement_t *rem = current_try;
9823 current_try = &statement->ms_try;
9824 statement->ms_try.try_statement = parse_compound_statement(false);
9829 if (next_if(T___except)) {
9830 expect('(', end_error);
9831 add_anchor_token(')');
9832 expression_t *const expr = parse_expression();
9833 mark_vars_read(expr, NULL);
9834 type_t * type = skip_typeref(expr->base.type);
9835 if (is_type_integer(type)) {
9836 type = promote_integer(type);
9837 } else if (is_type_valid(type)) {
9838 errorf(&expr->base.source_position,
9839 "__expect expression is not an integer, but '%T'", type);
9840 type = type_error_type;
9842 statement->ms_try.except_expression = create_implicit_cast(expr, type);
9843 rem_anchor_token(')');
9844 expect(')', end_error);
9845 statement->ms_try.final_statement = parse_compound_statement(false);
9846 } else if (next_if(T__finally)) {
9847 statement->ms_try.final_statement = parse_compound_statement(false);
9849 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
9850 return create_error_statement();
9854 return create_error_statement();
9857 static statement_t *parse_empty_statement(void)
9859 warningf(WARN_EMPTY_STATEMENT, HERE, "statement is empty");
9860 statement_t *const statement = create_empty_statement();
9865 static statement_t *parse_local_label_declaration(void)
9867 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9871 entity_t *begin = NULL;
9872 entity_t *end = NULL;
9873 entity_t **anchor = &begin;
9875 if (token.kind != T_IDENTIFIER) {
9876 parse_error_expected("while parsing local label declaration",
9877 T_IDENTIFIER, NULL);
9880 symbol_t *symbol = token.identifier.symbol;
9881 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
9882 if (entity != NULL && entity->base.parent_scope == current_scope) {
9883 source_position_t const *const ppos = &entity->base.source_position;
9884 errorf(HERE, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
9886 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL, NAMESPACE_LABEL, symbol);
9887 entity->base.parent_scope = current_scope;
9888 entity->base.source_position = token.base.source_position;
9891 anchor = &entity->base.next;
9894 environment_push(entity);
9897 } while (next_if(','));
9898 expect(';', end_error);
9900 statement->declaration.declarations_begin = begin;
9901 statement->declaration.declarations_end = end;
9905 static void parse_namespace_definition(void)
9909 entity_t *entity = NULL;
9910 symbol_t *symbol = NULL;
9912 if (token.kind == T_IDENTIFIER) {
9913 symbol = token.identifier.symbol;
9916 entity = get_entity(symbol, NAMESPACE_NORMAL);
9918 && entity->kind != ENTITY_NAMESPACE
9919 && entity->base.parent_scope == current_scope) {
9920 if (is_entity_valid(entity)) {
9921 error_redefined_as_different_kind(&token.base.source_position,
9922 entity, ENTITY_NAMESPACE);
9928 if (entity == NULL) {
9929 entity = allocate_entity_zero(ENTITY_NAMESPACE, NAMESPACE_NORMAL, symbol);
9930 entity->base.source_position = token.base.source_position;
9931 entity->base.parent_scope = current_scope;
9934 if (token.kind == '=') {
9935 /* TODO: parse namespace alias */
9936 panic("namespace alias definition not supported yet");
9939 environment_push(entity);
9940 append_entity(current_scope, entity);
9942 PUSH_SCOPE(&entity->namespacee.members);
9944 entity_t *old_current_entity = current_entity;
9945 current_entity = entity;
9947 expect('{', end_error);
9949 expect('}', end_error);
9952 assert(current_entity == entity);
9953 current_entity = old_current_entity;
9958 * Parse a statement.
9959 * There's also parse_statement() which additionally checks for
9960 * "statement has no effect" warnings
9962 static statement_t *intern_parse_statement(void)
9964 statement_t *statement = NULL;
9966 /* declaration or statement */
9967 add_anchor_token(';');
9968 switch (token.kind) {
9969 case T_IDENTIFIER: {
9970 token_kind_t la1_type = (token_kind_t)look_ahead(1)->kind;
9971 if (la1_type == ':') {
9972 statement = parse_label_statement();
9973 } else if (is_typedef_symbol(token.identifier.symbol)) {
9974 statement = parse_declaration_statement();
9976 /* it's an identifier, the grammar says this must be an
9977 * expression statement. However it is common that users mistype
9978 * declaration types, so we guess a bit here to improve robustness
9979 * for incorrect programs */
9983 if (get_entity(token.identifier.symbol, NAMESPACE_NORMAL) != NULL) {
9985 statement = parse_expression_statement();
9989 statement = parse_declaration_statement();
9997 case T___extension__: {
9998 /* This can be a prefix to a declaration or an expression statement.
9999 * We simply eat it now and parse the rest with tail recursion. */
10001 statement = intern_parse_statement();
10007 statement = parse_declaration_statement();
10011 statement = parse_local_label_declaration();
10014 case ';': statement = parse_empty_statement(); break;
10015 case '{': statement = parse_compound_statement(false); break;
10016 case T___leave: statement = parse_leave_statement(); break;
10017 case T___try: statement = parse_ms_try_statment(); break;
10018 case T_asm: statement = parse_asm_statement(); break;
10019 case T_break: statement = parse_break(); break;
10020 case T_case: statement = parse_case_statement(); break;
10021 case T_continue: statement = parse_continue(); break;
10022 case T_default: statement = parse_default_statement(); break;
10023 case T_do: statement = parse_do(); break;
10024 case T_for: statement = parse_for(); break;
10025 case T_goto: statement = parse_goto(); break;
10026 case T_if: statement = parse_if(); break;
10027 case T_return: statement = parse_return(); break;
10028 case T_switch: statement = parse_switch(); break;
10029 case T_while: statement = parse_while(); break;
10032 statement = parse_expression_statement();
10036 errorf(HERE, "unexpected token %K while parsing statement", &token);
10037 statement = create_error_statement();
10042 rem_anchor_token(';');
10044 assert(statement != NULL
10045 && statement->base.source_position.input_name != NULL);
10051 * parse a statement and emits "statement has no effect" warning if needed
10052 * (This is really a wrapper around intern_parse_statement with check for 1
10053 * single warning. It is needed, because for statement expressions we have
10054 * to avoid the warning on the last statement)
10056 static statement_t *parse_statement(void)
10058 statement_t *statement = intern_parse_statement();
10060 if (statement->kind == STATEMENT_EXPRESSION) {
10061 expression_t *expression = statement->expression.expression;
10062 if (!expression_has_effect(expression)) {
10063 warningf(WARN_UNUSED_VALUE, &expression->base.source_position, "statement has no effect");
10071 * Parse a compound statement.
10073 static statement_t *parse_compound_statement(bool inside_expression_statement)
10075 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
10077 PUSH_PARENT(statement);
10078 PUSH_SCOPE(&statement->compound.scope);
10081 add_anchor_token('}');
10082 /* tokens, which can start a statement */
10083 /* TODO MS, __builtin_FOO */
10084 add_anchor_token('!');
10085 add_anchor_token('&');
10086 add_anchor_token('(');
10087 add_anchor_token('*');
10088 add_anchor_token('+');
10089 add_anchor_token('-');
10090 add_anchor_token('{');
10091 add_anchor_token('~');
10092 add_anchor_token(T_CHARACTER_CONSTANT);
10093 add_anchor_token(T_COLONCOLON);
10094 add_anchor_token(T_FLOATINGPOINT);
10095 add_anchor_token(T_IDENTIFIER);
10096 add_anchor_token(T_INTEGER);
10097 add_anchor_token(T_MINUSMINUS);
10098 add_anchor_token(T_PLUSPLUS);
10099 add_anchor_token(T_STRING_LITERAL);
10100 add_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10101 add_anchor_token(T_WIDE_STRING_LITERAL);
10102 add_anchor_token(T__Bool);
10103 add_anchor_token(T__Complex);
10104 add_anchor_token(T__Imaginary);
10105 add_anchor_token(T___FUNCTION__);
10106 add_anchor_token(T___PRETTY_FUNCTION__);
10107 add_anchor_token(T___alignof__);
10108 add_anchor_token(T___attribute__);
10109 add_anchor_token(T___builtin_va_start);
10110 add_anchor_token(T___extension__);
10111 add_anchor_token(T___func__);
10112 add_anchor_token(T___imag__);
10113 add_anchor_token(T___label__);
10114 add_anchor_token(T___real__);
10115 add_anchor_token(T___thread);
10116 add_anchor_token(T_asm);
10117 add_anchor_token(T_auto);
10118 add_anchor_token(T_bool);
10119 add_anchor_token(T_break);
10120 add_anchor_token(T_case);
10121 add_anchor_token(T_char);
10122 add_anchor_token(T_class);
10123 add_anchor_token(T_const);
10124 add_anchor_token(T_const_cast);
10125 add_anchor_token(T_continue);
10126 add_anchor_token(T_default);
10127 add_anchor_token(T_delete);
10128 add_anchor_token(T_double);
10129 add_anchor_token(T_do);
10130 add_anchor_token(T_dynamic_cast);
10131 add_anchor_token(T_enum);
10132 add_anchor_token(T_extern);
10133 add_anchor_token(T_false);
10134 add_anchor_token(T_float);
10135 add_anchor_token(T_for);
10136 add_anchor_token(T_goto);
10137 add_anchor_token(T_if);
10138 add_anchor_token(T_inline);
10139 add_anchor_token(T_int);
10140 add_anchor_token(T_long);
10141 add_anchor_token(T_new);
10142 add_anchor_token(T_operator);
10143 add_anchor_token(T_register);
10144 add_anchor_token(T_reinterpret_cast);
10145 add_anchor_token(T_restrict);
10146 add_anchor_token(T_return);
10147 add_anchor_token(T_short);
10148 add_anchor_token(T_signed);
10149 add_anchor_token(T_sizeof);
10150 add_anchor_token(T_static);
10151 add_anchor_token(T_static_cast);
10152 add_anchor_token(T_struct);
10153 add_anchor_token(T_switch);
10154 add_anchor_token(T_template);
10155 add_anchor_token(T_this);
10156 add_anchor_token(T_throw);
10157 add_anchor_token(T_true);
10158 add_anchor_token(T_try);
10159 add_anchor_token(T_typedef);
10160 add_anchor_token(T_typeid);
10161 add_anchor_token(T_typename);
10162 add_anchor_token(T_typeof);
10163 add_anchor_token(T_union);
10164 add_anchor_token(T_unsigned);
10165 add_anchor_token(T_using);
10166 add_anchor_token(T_void);
10167 add_anchor_token(T_volatile);
10168 add_anchor_token(T_wchar_t);
10169 add_anchor_token(T_while);
10171 statement_t **anchor = &statement->compound.statements;
10172 bool only_decls_so_far = true;
10173 while (token.kind != '}') {
10174 if (token.kind == T_EOF) {
10175 errorf(&statement->base.source_position,
10176 "EOF while parsing compound statement");
10179 statement_t *sub_statement = intern_parse_statement();
10180 if (sub_statement->kind == STATEMENT_ERROR) {
10181 /* an error occurred. if we are at an anchor, return */
10187 if (sub_statement->kind != STATEMENT_DECLARATION) {
10188 only_decls_so_far = false;
10189 } else if (!only_decls_so_far) {
10190 source_position_t const *const pos = &sub_statement->base.source_position;
10191 warningf(WARN_DECLARATION_AFTER_STATEMENT, pos, "ISO C90 forbids mixed declarations and code");
10194 *anchor = sub_statement;
10196 while (sub_statement->base.next != NULL)
10197 sub_statement = sub_statement->base.next;
10199 anchor = &sub_statement->base.next;
10203 /* look over all statements again to produce no effect warnings */
10204 if (is_warn_on(WARN_UNUSED_VALUE)) {
10205 statement_t *sub_statement = statement->compound.statements;
10206 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
10207 if (sub_statement->kind != STATEMENT_EXPRESSION)
10209 /* don't emit a warning for the last expression in an expression
10210 * statement as it has always an effect */
10211 if (inside_expression_statement && sub_statement->base.next == NULL)
10214 expression_t *expression = sub_statement->expression.expression;
10215 if (!expression_has_effect(expression)) {
10216 warningf(WARN_UNUSED_VALUE, &expression->base.source_position, "statement has no effect");
10222 rem_anchor_token(T_while);
10223 rem_anchor_token(T_wchar_t);
10224 rem_anchor_token(T_volatile);
10225 rem_anchor_token(T_void);
10226 rem_anchor_token(T_using);
10227 rem_anchor_token(T_unsigned);
10228 rem_anchor_token(T_union);
10229 rem_anchor_token(T_typeof);
10230 rem_anchor_token(T_typename);
10231 rem_anchor_token(T_typeid);
10232 rem_anchor_token(T_typedef);
10233 rem_anchor_token(T_try);
10234 rem_anchor_token(T_true);
10235 rem_anchor_token(T_throw);
10236 rem_anchor_token(T_this);
10237 rem_anchor_token(T_template);
10238 rem_anchor_token(T_switch);
10239 rem_anchor_token(T_struct);
10240 rem_anchor_token(T_static_cast);
10241 rem_anchor_token(T_static);
10242 rem_anchor_token(T_sizeof);
10243 rem_anchor_token(T_signed);
10244 rem_anchor_token(T_short);
10245 rem_anchor_token(T_return);
10246 rem_anchor_token(T_restrict);
10247 rem_anchor_token(T_reinterpret_cast);
10248 rem_anchor_token(T_register);
10249 rem_anchor_token(T_operator);
10250 rem_anchor_token(T_new);
10251 rem_anchor_token(T_long);
10252 rem_anchor_token(T_int);
10253 rem_anchor_token(T_inline);
10254 rem_anchor_token(T_if);
10255 rem_anchor_token(T_goto);
10256 rem_anchor_token(T_for);
10257 rem_anchor_token(T_float);
10258 rem_anchor_token(T_false);
10259 rem_anchor_token(T_extern);
10260 rem_anchor_token(T_enum);
10261 rem_anchor_token(T_dynamic_cast);
10262 rem_anchor_token(T_do);
10263 rem_anchor_token(T_double);
10264 rem_anchor_token(T_delete);
10265 rem_anchor_token(T_default);
10266 rem_anchor_token(T_continue);
10267 rem_anchor_token(T_const_cast);
10268 rem_anchor_token(T_const);
10269 rem_anchor_token(T_class);
10270 rem_anchor_token(T_char);
10271 rem_anchor_token(T_case);
10272 rem_anchor_token(T_break);
10273 rem_anchor_token(T_bool);
10274 rem_anchor_token(T_auto);
10275 rem_anchor_token(T_asm);
10276 rem_anchor_token(T___thread);
10277 rem_anchor_token(T___real__);
10278 rem_anchor_token(T___label__);
10279 rem_anchor_token(T___imag__);
10280 rem_anchor_token(T___func__);
10281 rem_anchor_token(T___extension__);
10282 rem_anchor_token(T___builtin_va_start);
10283 rem_anchor_token(T___attribute__);
10284 rem_anchor_token(T___alignof__);
10285 rem_anchor_token(T___PRETTY_FUNCTION__);
10286 rem_anchor_token(T___FUNCTION__);
10287 rem_anchor_token(T__Imaginary);
10288 rem_anchor_token(T__Complex);
10289 rem_anchor_token(T__Bool);
10290 rem_anchor_token(T_WIDE_STRING_LITERAL);
10291 rem_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10292 rem_anchor_token(T_STRING_LITERAL);
10293 rem_anchor_token(T_PLUSPLUS);
10294 rem_anchor_token(T_MINUSMINUS);
10295 rem_anchor_token(T_INTEGER);
10296 rem_anchor_token(T_IDENTIFIER);
10297 rem_anchor_token(T_FLOATINGPOINT);
10298 rem_anchor_token(T_COLONCOLON);
10299 rem_anchor_token(T_CHARACTER_CONSTANT);
10300 rem_anchor_token('~');
10301 rem_anchor_token('{');
10302 rem_anchor_token('-');
10303 rem_anchor_token('+');
10304 rem_anchor_token('*');
10305 rem_anchor_token('(');
10306 rem_anchor_token('&');
10307 rem_anchor_token('!');
10308 rem_anchor_token('}');
10316 * Check for unused global static functions and variables
10318 static void check_unused_globals(void)
10320 if (!is_warn_on(WARN_UNUSED_FUNCTION) && !is_warn_on(WARN_UNUSED_VARIABLE))
10323 for (const entity_t *entity = file_scope->entities; entity != NULL;
10324 entity = entity->base.next) {
10325 if (!is_declaration(entity))
10328 const declaration_t *declaration = &entity->declaration;
10329 if (declaration->used ||
10330 declaration->modifiers & DM_UNUSED ||
10331 declaration->modifiers & DM_USED ||
10332 declaration->storage_class != STORAGE_CLASS_STATIC)
10337 if (entity->kind == ENTITY_FUNCTION) {
10338 /* inhibit warning for static inline functions */
10339 if (entity->function.is_inline)
10342 why = WARN_UNUSED_FUNCTION;
10343 s = entity->function.statement != NULL ? "defined" : "declared";
10345 why = WARN_UNUSED_VARIABLE;
10349 warningf(why, &declaration->base.source_position, "'%#N' %s but not used", entity, s);
10353 static void parse_global_asm(void)
10355 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10358 expect('(', end_error);
10360 statement->asms.asm_text = parse_string_literals();
10361 statement->base.next = unit->global_asm;
10362 unit->global_asm = statement;
10364 expect(')', end_error);
10365 expect(';', end_error);
10370 static void parse_linkage_specification(void)
10374 source_position_t const pos = *HERE;
10375 char const *const linkage = parse_string_literals().begin;
10377 linkage_kind_t old_linkage = current_linkage;
10378 linkage_kind_t new_linkage;
10379 if (strcmp(linkage, "C") == 0) {
10380 new_linkage = LINKAGE_C;
10381 } else if (strcmp(linkage, "C++") == 0) {
10382 new_linkage = LINKAGE_CXX;
10384 errorf(&pos, "linkage string \"%s\" not recognized", linkage);
10385 new_linkage = LINKAGE_C;
10387 current_linkage = new_linkage;
10389 if (next_if('{')) {
10391 expect('}', end_error);
10397 assert(current_linkage == new_linkage);
10398 current_linkage = old_linkage;
10401 static void parse_external(void)
10403 switch (token.kind) {
10405 if (look_ahead(1)->kind == T_STRING_LITERAL) {
10406 parse_linkage_specification();
10408 DECLARATION_START_NO_EXTERN
10410 case T___extension__:
10411 /* tokens below are for implicit int */
10412 case '&': /* & x; -> int& x; (and error later, because C++ has no
10414 case '*': /* * x; -> int* x; */
10415 case '(': /* (x); -> int (x); */
10417 parse_external_declaration();
10423 parse_global_asm();
10427 parse_namespace_definition();
10431 if (!strict_mode) {
10432 warningf(WARN_STRAY_SEMICOLON, HERE, "stray ';' outside of function");
10439 errorf(HERE, "stray %K outside of function", &token);
10440 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10441 eat_until_matching_token(token.kind);
10447 static void parse_externals(void)
10449 add_anchor_token('}');
10450 add_anchor_token(T_EOF);
10453 /* make a copy of the anchor set, so we can check if it is restored after parsing */
10454 unsigned short token_anchor_copy[T_LAST_TOKEN];
10455 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10458 while (token.kind != T_EOF && token.kind != '}') {
10460 for (int i = 0; i < T_LAST_TOKEN; ++i) {
10461 unsigned short count = token_anchor_set[i] - token_anchor_copy[i];
10463 /* the anchor set and its copy differs */
10464 internal_errorf(HERE, "Leaked anchor token %k %d times", i, count);
10467 if (in_gcc_extension) {
10468 /* an gcc extension scope was not closed */
10469 internal_errorf(HERE, "Leaked __extension__");
10476 rem_anchor_token(T_EOF);
10477 rem_anchor_token('}');
10481 * Parse a translation unit.
10483 static void parse_translation_unit(void)
10485 add_anchor_token(T_EOF);
10490 if (token.kind == T_EOF)
10493 errorf(HERE, "stray %K outside of function", &token);
10494 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10495 eat_until_matching_token(token.kind);
10500 void set_default_visibility(elf_visibility_tag_t visibility)
10502 default_visibility = visibility;
10508 * @return the translation unit or NULL if errors occurred.
10510 void start_parsing(void)
10512 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10513 label_stack = NEW_ARR_F(stack_entry_t, 0);
10514 diagnostic_count = 0;
10518 print_to_file(stderr);
10520 assert(unit == NULL);
10521 unit = allocate_ast_zero(sizeof(unit[0]));
10523 assert(file_scope == NULL);
10524 file_scope = &unit->scope;
10526 assert(current_scope == NULL);
10527 scope_push(&unit->scope);
10529 create_gnu_builtins();
10531 create_microsoft_intrinsics();
10534 translation_unit_t *finish_parsing(void)
10536 assert(current_scope == &unit->scope);
10539 assert(file_scope == &unit->scope);
10540 check_unused_globals();
10543 DEL_ARR_F(environment_stack);
10544 DEL_ARR_F(label_stack);
10546 translation_unit_t *result = unit;
10551 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
10552 * are given length one. */
10553 static void complete_incomplete_arrays(void)
10555 size_t n = ARR_LEN(incomplete_arrays);
10556 for (size_t i = 0; i != n; ++i) {
10557 declaration_t *const decl = incomplete_arrays[i];
10558 type_t *const type = skip_typeref(decl->type);
10560 if (!is_type_incomplete(type))
10563 source_position_t const *const pos = &decl->base.source_position;
10564 warningf(WARN_OTHER, pos, "array '%#N' assumed to have one element", (entity_t const*)decl);
10566 type_t *const new_type = duplicate_type(type);
10567 new_type->array.size_constant = true;
10568 new_type->array.has_implicit_size = true;
10569 new_type->array.size = 1;
10571 type_t *const result = identify_new_type(new_type);
10573 decl->type = result;
10577 void prepare_main_collect2(entity_t *entity)
10579 // create call to __main
10580 symbol_t *symbol = symbol_table_insert("__main");
10581 entity_t *subsubmain_ent
10582 = create_implicit_function(symbol, &builtin_source_position);
10584 expression_t *ref = allocate_expression_zero(EXPR_REFERENCE);
10585 type_t *ftype = subsubmain_ent->declaration.type;
10586 ref->base.source_position = builtin_source_position;
10587 ref->base.type = make_pointer_type(ftype, TYPE_QUALIFIER_NONE);
10588 ref->reference.entity = subsubmain_ent;
10590 expression_t *call = allocate_expression_zero(EXPR_CALL);
10591 call->base.source_position = builtin_source_position;
10592 call->base.type = type_void;
10593 call->call.function = ref;
10595 statement_t *expr_statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10596 expr_statement->base.source_position = builtin_source_position;
10597 expr_statement->expression.expression = call;
10599 statement_t *statement = entity->function.statement;
10600 assert(statement->kind == STATEMENT_COMPOUND);
10601 compound_statement_t *compounds = &statement->compound;
10603 expr_statement->base.next = compounds->statements;
10604 compounds->statements = expr_statement;
10609 lookahead_bufpos = 0;
10610 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10613 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
10614 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
10615 parse_translation_unit();
10616 complete_incomplete_arrays();
10617 DEL_ARR_F(incomplete_arrays);
10618 incomplete_arrays = NULL;
10622 * Initialize the parser.
10624 void init_parser(void)
10626 sym_anonymous = symbol_table_insert("<anonymous>");
10628 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10630 init_expression_parsers();
10631 obstack_init(&temp_obst);
10635 * Terminate the parser.
10637 void exit_parser(void)
10639 obstack_free(&temp_obst, NULL);