2 * This file is part of cparser.
3 * Copyright (C) 2007-2009 Matthias Braun <matze@braunis.de>
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * as published by the Free Software Foundation; either version 2
8 * of the License, or (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
26 #include "adt/strutil.h"
28 #include "diagnostic.h"
29 #include "format_check.h"
35 #include "type_hash.h"
38 #include "attribute_t.h"
39 #include "lang_features.h"
43 #include "adt/bitfiddle.h"
44 #include "adt/error.h"
45 #include "adt/array.h"
47 //#define PRINT_TOKENS
48 #define MAX_LOOKAHEAD 1
53 entity_namespace_t namespc;
56 typedef struct declaration_specifiers_t declaration_specifiers_t;
57 struct declaration_specifiers_t {
58 source_position_t source_position;
59 storage_class_t storage_class;
60 unsigned char alignment; /**< Alignment, 0 if not set. */
62 bool thread_local : 1; /**< GCC __thread */
63 attribute_t *attributes; /**< list of attributes */
68 * An environment for parsing initializers (and compound literals).
70 typedef struct parse_initializer_env_t {
71 type_t *type; /**< the type of the initializer. In case of an
72 array type with unspecified size this gets
73 adjusted to the actual size. */
74 entity_t *entity; /**< the variable that is initialized if any */
75 bool must_be_constant;
76 } parse_initializer_env_t;
78 typedef entity_t* (*parsed_declaration_func) (entity_t *declaration, bool is_definition);
80 /** The current token. */
82 /** The lookahead ring-buffer. */
83 static token_t lookahead_buffer[MAX_LOOKAHEAD];
84 /** Position of the next token in the lookahead buffer. */
85 static size_t lookahead_bufpos;
86 static stack_entry_t *environment_stack = NULL;
87 static stack_entry_t *label_stack = NULL;
88 static scope_t *file_scope = NULL;
89 static scope_t *current_scope = NULL;
90 /** Point to the current function declaration if inside a function. */
91 static function_t *current_function = NULL;
92 static entity_t *current_entity = NULL;
93 static switch_statement_t *current_switch = NULL;
94 static statement_t *current_loop = NULL;
95 static statement_t *current_parent = NULL;
96 static ms_try_statement_t *current_try = NULL;
97 static linkage_kind_t current_linkage;
98 static goto_statement_t *goto_first = NULL;
99 static goto_statement_t **goto_anchor = NULL;
100 static label_statement_t *label_first = NULL;
101 static label_statement_t **label_anchor = NULL;
102 /** current translation unit. */
103 static translation_unit_t *unit = NULL;
104 /** true if we are in an __extension__ context. */
105 static bool in_gcc_extension = false;
106 static struct obstack temp_obst;
107 static entity_t *anonymous_entity;
108 static declaration_t **incomplete_arrays;
109 static elf_visibility_tag_t default_visibility = ELF_VISIBILITY_DEFAULT;
112 #define PUSH_PARENT(stmt) \
113 statement_t *const new_parent = (stmt); \
114 statement_t *const old_parent = current_parent; \
115 ((void)(current_parent = new_parent))
116 #define POP_PARENT() (assert(current_parent == new_parent), (void)(current_parent = old_parent))
118 #define PUSH_SCOPE(scope) \
119 size_t const top = environment_top(); \
120 scope_t *const new_scope = (scope); \
121 scope_t *const old_scope = scope_push(new_scope)
122 #define POP_SCOPE() (assert(current_scope == new_scope), scope_pop(old_scope), environment_pop_to(top))
124 #define PUSH_EXTENSION() \
126 bool const old_gcc_extension = in_gcc_extension; \
127 while (next_if(T___extension__)) { \
128 in_gcc_extension = true; \
131 #define POP_EXTENSION() \
132 ((void)(in_gcc_extension = old_gcc_extension))
134 /** special symbol used for anonymous entities. */
135 static symbol_t *sym_anonymous = NULL;
137 /** The token anchor set */
138 static unsigned short token_anchor_set[T_LAST_TOKEN];
140 /** The current source position. */
141 #define HERE (&token.base.source_position)
143 /** true if we are in GCC mode. */
144 #define GNU_MODE ((c_mode & _GNUC) || in_gcc_extension)
146 static statement_t *parse_compound_statement(bool inside_expression_statement);
147 static statement_t *parse_statement(void);
149 static expression_t *parse_subexpression(precedence_t);
150 static expression_t *parse_expression(void);
151 static type_t *parse_typename(void);
152 static void parse_externals(void);
153 static void parse_external(void);
155 static void parse_compound_type_entries(compound_t *compound_declaration);
157 static void check_call_argument(type_t *expected_type,
158 call_argument_t *argument, unsigned pos);
160 typedef enum declarator_flags_t {
162 DECL_MAY_BE_ABSTRACT = 1U << 0,
163 DECL_CREATE_COMPOUND_MEMBER = 1U << 1,
164 DECL_IS_PARAMETER = 1U << 2
165 } declarator_flags_t;
167 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
168 declarator_flags_t flags);
170 static void semantic_comparison(binary_expression_t *expression);
172 #define STORAGE_CLASSES \
173 STORAGE_CLASSES_NO_EXTERN \
176 #define STORAGE_CLASSES_NO_EXTERN \
183 #define TYPE_QUALIFIERS \
188 case T__forceinline: \
189 case T___attribute__:
191 #define COMPLEX_SPECIFIERS \
193 #define IMAGINARY_SPECIFIERS \
196 #define TYPE_SPECIFIERS \
198 case T___builtin_va_list: \
223 #define DECLARATION_START \
228 #define DECLARATION_START_NO_EXTERN \
229 STORAGE_CLASSES_NO_EXTERN \
233 #define EXPRESSION_START \
242 case T_CHARACTER_CONSTANT: \
243 case T_FLOATINGPOINT: \
244 case T_FLOATINGPOINT_HEXADECIMAL: \
246 case T_INTEGER_HEXADECIMAL: \
247 case T_INTEGER_OCTAL: \
250 case T_STRING_LITERAL: \
251 case T_WIDE_CHARACTER_CONSTANT: \
252 case T_WIDE_STRING_LITERAL: \
253 case T___FUNCDNAME__: \
254 case T___FUNCSIG__: \
255 case T___FUNCTION__: \
256 case T___PRETTY_FUNCTION__: \
257 case T___alignof__: \
258 case T___builtin_classify_type: \
259 case T___builtin_constant_p: \
260 case T___builtin_isgreater: \
261 case T___builtin_isgreaterequal: \
262 case T___builtin_isless: \
263 case T___builtin_islessequal: \
264 case T___builtin_islessgreater: \
265 case T___builtin_isunordered: \
266 case T___builtin_offsetof: \
267 case T___builtin_va_arg: \
268 case T___builtin_va_copy: \
269 case T___builtin_va_start: \
280 * Returns the size of a statement node.
282 * @param kind the statement kind
284 static size_t get_statement_struct_size(statement_kind_t kind)
286 static const size_t sizes[] = {
287 [STATEMENT_ERROR] = sizeof(statement_base_t),
288 [STATEMENT_EMPTY] = sizeof(statement_base_t),
289 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
290 [STATEMENT_RETURN] = sizeof(return_statement_t),
291 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
292 [STATEMENT_IF] = sizeof(if_statement_t),
293 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
294 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
295 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
296 [STATEMENT_BREAK] = sizeof(statement_base_t),
297 [STATEMENT_COMPUTED_GOTO] = sizeof(computed_goto_statement_t),
298 [STATEMENT_GOTO] = sizeof(goto_statement_t),
299 [STATEMENT_LABEL] = sizeof(label_statement_t),
300 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
301 [STATEMENT_WHILE] = sizeof(while_statement_t),
302 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
303 [STATEMENT_FOR] = sizeof(for_statement_t),
304 [STATEMENT_ASM] = sizeof(asm_statement_t),
305 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
306 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
308 assert((size_t)kind < lengthof(sizes));
309 assert(sizes[kind] != 0);
314 * Returns the size of an expression node.
316 * @param kind the expression kind
318 static size_t get_expression_struct_size(expression_kind_t kind)
320 static const size_t sizes[] = {
321 [EXPR_ERROR] = sizeof(expression_base_t),
322 [EXPR_REFERENCE] = sizeof(reference_expression_t),
323 [EXPR_ENUM_CONSTANT] = sizeof(reference_expression_t),
324 [EXPR_LITERAL_BOOLEAN] = sizeof(literal_expression_t),
325 [EXPR_LITERAL_INTEGER] = sizeof(literal_expression_t),
326 [EXPR_LITERAL_INTEGER_OCTAL] = sizeof(literal_expression_t),
327 [EXPR_LITERAL_INTEGER_HEXADECIMAL]= sizeof(literal_expression_t),
328 [EXPR_LITERAL_FLOATINGPOINT] = sizeof(literal_expression_t),
329 [EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL] = sizeof(literal_expression_t),
330 [EXPR_LITERAL_CHARACTER] = sizeof(literal_expression_t),
331 [EXPR_LITERAL_WIDE_CHARACTER] = sizeof(literal_expression_t),
332 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
333 [EXPR_WIDE_STRING_LITERAL] = sizeof(string_literal_expression_t),
334 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
335 [EXPR_CALL] = sizeof(call_expression_t),
336 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
337 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
338 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
339 [EXPR_SELECT] = sizeof(select_expression_t),
340 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
341 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
342 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
343 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
344 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
345 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
346 [EXPR_BUILTIN_TYPES_COMPATIBLE_P] = sizeof(builtin_types_compatible_expression_t),
347 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
348 [EXPR_VA_START] = sizeof(va_start_expression_t),
349 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
350 [EXPR_VA_COPY] = sizeof(va_copy_expression_t),
351 [EXPR_STATEMENT] = sizeof(statement_expression_t),
352 [EXPR_LABEL_ADDRESS] = sizeof(label_address_expression_t),
354 if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
355 return sizes[EXPR_UNARY_FIRST];
357 if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
358 return sizes[EXPR_BINARY_FIRST];
360 assert((size_t)kind < lengthof(sizes));
361 assert(sizes[kind] != 0);
366 * Allocate a statement node of given kind and initialize all
367 * fields with zero. Sets its source position to the position
368 * of the current token.
370 static statement_t *allocate_statement_zero(statement_kind_t kind)
372 size_t size = get_statement_struct_size(kind);
373 statement_t *res = allocate_ast_zero(size);
375 res->base.kind = kind;
376 res->base.parent = current_parent;
377 res->base.source_position = token.base.source_position;
382 * Allocate an expression node of given kind and initialize all
385 * @param kind the kind of the expression to allocate
387 static expression_t *allocate_expression_zero(expression_kind_t kind)
389 size_t size = get_expression_struct_size(kind);
390 expression_t *res = allocate_ast_zero(size);
392 res->base.kind = kind;
393 res->base.type = type_error_type;
394 res->base.source_position = token.base.source_position;
399 * Creates a new invalid expression at the source position
400 * of the current token.
402 static expression_t *create_error_expression(void)
404 expression_t *expression = allocate_expression_zero(EXPR_ERROR);
405 expression->base.type = type_error_type;
410 * Creates a new invalid statement.
412 static statement_t *create_error_statement(void)
414 return allocate_statement_zero(STATEMENT_ERROR);
418 * Allocate a new empty statement.
420 static statement_t *create_empty_statement(void)
422 return allocate_statement_zero(STATEMENT_EMPTY);
426 * Returns the size of an initializer node.
428 * @param kind the initializer kind
430 static size_t get_initializer_size(initializer_kind_t kind)
432 static const size_t sizes[] = {
433 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
434 [INITIALIZER_STRING] = sizeof(initializer_string_t),
435 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
436 [INITIALIZER_LIST] = sizeof(initializer_list_t),
437 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
439 assert((size_t)kind < lengthof(sizes));
440 assert(sizes[kind] != 0);
445 * Allocate an initializer node of given kind and initialize all
448 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
450 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
457 * Returns the index of the top element of the environment stack.
459 static size_t environment_top(void)
461 return ARR_LEN(environment_stack);
465 * Returns the index of the top element of the global label stack.
467 static size_t label_top(void)
469 return ARR_LEN(label_stack);
473 * Return the next token.
475 static inline void next_token(void)
477 token = lookahead_buffer[lookahead_bufpos];
478 lookahead_buffer[lookahead_bufpos] = lexer_token;
481 lookahead_bufpos = (lookahead_bufpos + 1) % MAX_LOOKAHEAD;
484 print_token(stderr, &token);
485 fprintf(stderr, "\n");
489 static inline bool next_if(int const type)
491 if (token.kind == type) {
500 * Return the next token with a given lookahead.
502 static inline const token_t *look_ahead(size_t num)
504 assert(0 < num && num <= MAX_LOOKAHEAD);
505 size_t pos = (lookahead_bufpos + num - 1) % MAX_LOOKAHEAD;
506 return &lookahead_buffer[pos];
510 * Adds a token type to the token type anchor set (a multi-set).
512 static void add_anchor_token(int token_kind)
514 assert(0 <= token_kind && token_kind < T_LAST_TOKEN);
515 ++token_anchor_set[token_kind];
519 * Set the number of tokens types of the given type
520 * to zero and return the old count.
522 static int save_and_reset_anchor_state(int token_kind)
524 assert(0 <= token_kind && token_kind < T_LAST_TOKEN);
525 int count = token_anchor_set[token_kind];
526 token_anchor_set[token_kind] = 0;
531 * Restore the number of token types to the given count.
533 static void restore_anchor_state(int token_kind, int count)
535 assert(0 <= token_kind && token_kind < T_LAST_TOKEN);
536 token_anchor_set[token_kind] = count;
540 * Remove a token type from the token type anchor set (a multi-set).
542 static void rem_anchor_token(int token_kind)
544 assert(0 <= token_kind && token_kind < T_LAST_TOKEN);
545 assert(token_anchor_set[token_kind] != 0);
546 --token_anchor_set[token_kind];
550 * Eat tokens until a matching token type is found.
552 static void eat_until_matching_token(int type)
556 case '(': end_token = ')'; break;
557 case '{': end_token = '}'; break;
558 case '[': end_token = ']'; break;
559 default: end_token = type; break;
562 unsigned parenthesis_count = 0;
563 unsigned brace_count = 0;
564 unsigned bracket_count = 0;
565 while (token.kind != end_token ||
566 parenthesis_count != 0 ||
568 bracket_count != 0) {
569 switch (token.kind) {
571 case '(': ++parenthesis_count; break;
572 case '{': ++brace_count; break;
573 case '[': ++bracket_count; break;
576 if (parenthesis_count > 0)
586 if (bracket_count > 0)
589 if (token.kind == end_token &&
590 parenthesis_count == 0 &&
604 * Eat input tokens until an anchor is found.
606 static void eat_until_anchor(void)
608 while (token_anchor_set[token.kind] == 0) {
609 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
610 eat_until_matching_token(token.kind);
616 * Eat a whole block from input tokens.
618 static void eat_block(void)
620 eat_until_matching_token('{');
624 #define eat(token_kind) (assert(token.kind == (token_kind)), next_token())
627 * Report a parse error because an expected token was not found.
630 #if defined __GNUC__ && __GNUC__ >= 4
631 __attribute__((sentinel))
633 void parse_error_expected(const char *message, ...)
635 if (message != NULL) {
636 errorf(HERE, "%s", message);
639 va_start(ap, message);
640 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
645 * Report an incompatible type.
647 static void type_error_incompatible(const char *msg,
648 const source_position_t *source_position, type_t *type1, type_t *type2)
650 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
655 * Expect the current token is the expected token.
656 * If not, generate an error, eat the current statement,
657 * and goto the error_label label.
659 #define expect(expected, error_label) \
661 if (UNLIKELY(token.kind != (expected))) { \
662 parse_error_expected(NULL, (expected), NULL); \
663 add_anchor_token(expected); \
664 eat_until_anchor(); \
665 rem_anchor_token(expected); \
666 if (token.kind != (expected)) \
672 static symbol_t *expect_identifier(char const *const context, source_position_t *const pos)
674 if (token.kind != T_IDENTIFIER) {
675 parse_error_expected(context, T_IDENTIFIER, NULL);
676 add_anchor_token(T_IDENTIFIER);
678 rem_anchor_token(T_IDENTIFIER);
679 if (token.kind != T_IDENTIFIER)
682 symbol_t *const sym = token.identifier.symbol;
690 * Push a given scope on the scope stack and make it the
693 static scope_t *scope_push(scope_t *new_scope)
695 if (current_scope != NULL) {
696 new_scope->depth = current_scope->depth + 1;
699 scope_t *old_scope = current_scope;
700 current_scope = new_scope;
705 * Pop the current scope from the scope stack.
707 static void scope_pop(scope_t *old_scope)
709 current_scope = old_scope;
713 * Search an entity by its symbol in a given namespace.
715 static entity_t *get_entity(const symbol_t *const symbol,
716 namespace_tag_t namespc)
718 entity_t *entity = symbol->entity;
719 for (; entity != NULL; entity = entity->base.symbol_next) {
720 if ((namespace_tag_t)entity->base.namespc == namespc)
727 /* §6.2.3:1 24) There is only one name space for tags even though three are
729 static entity_t *get_tag(symbol_t const *const symbol,
730 entity_kind_tag_t const kind)
732 entity_t *entity = get_entity(symbol, NAMESPACE_TAG);
733 if (entity != NULL && (entity_kind_tag_t)entity->kind != kind) {
735 "'%Y' defined as wrong kind of tag (previous definition %P)",
736 symbol, &entity->base.source_position);
743 * pushs an entity on the environment stack and links the corresponding symbol
746 static void stack_push(stack_entry_t **stack_ptr, entity_t *entity)
748 symbol_t *symbol = entity->base.symbol;
749 entity_namespace_t namespc = entity->base.namespc;
750 assert(namespc != 0);
752 /* replace/add entity into entity list of the symbol */
755 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
760 /* replace an entry? */
761 if (iter->base.namespc == namespc) {
762 entity->base.symbol_next = iter->base.symbol_next;
768 /* remember old declaration */
770 entry.symbol = symbol;
771 entry.old_entity = iter;
772 entry.namespc = namespc;
773 ARR_APP1(stack_entry_t, *stack_ptr, entry);
777 * Push an entity on the environment stack.
779 static void environment_push(entity_t *entity)
781 assert(entity->base.source_position.input_name != NULL);
782 assert(entity->base.parent_scope != NULL);
783 stack_push(&environment_stack, entity);
787 * Push a declaration on the global label stack.
789 * @param declaration the declaration
791 static void label_push(entity_t *label)
793 /* we abuse the parameters scope as parent for the labels */
794 label->base.parent_scope = ¤t_function->parameters;
795 stack_push(&label_stack, label);
799 * pops symbols from the environment stack until @p new_top is the top element
801 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
803 stack_entry_t *stack = *stack_ptr;
804 size_t top = ARR_LEN(stack);
807 assert(new_top <= top);
811 for (i = top; i > new_top; --i) {
812 stack_entry_t *entry = &stack[i - 1];
814 entity_t *old_entity = entry->old_entity;
815 symbol_t *symbol = entry->symbol;
816 entity_namespace_t namespc = entry->namespc;
818 /* replace with old_entity/remove */
821 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
823 assert(iter != NULL);
824 /* replace an entry? */
825 if (iter->base.namespc == namespc)
829 /* restore definition from outer scopes (if there was one) */
830 if (old_entity != NULL) {
831 old_entity->base.symbol_next = iter->base.symbol_next;
832 *anchor = old_entity;
834 /* remove entry from list */
835 *anchor = iter->base.symbol_next;
839 ARR_SHRINKLEN(*stack_ptr, new_top);
843 * Pop all entries from the environment stack until the new_top
846 * @param new_top the new stack top
848 static void environment_pop_to(size_t new_top)
850 stack_pop_to(&environment_stack, new_top);
854 * Pop all entries from the global label stack until the new_top
857 * @param new_top the new stack top
859 static void label_pop_to(size_t new_top)
861 stack_pop_to(&label_stack, new_top);
864 static atomic_type_kind_t get_akind(const type_t *type)
866 assert(type->kind == TYPE_ATOMIC || type->kind == TYPE_COMPLEX
867 || type->kind == TYPE_IMAGINARY || type->kind == TYPE_ENUM);
868 return type->atomic.akind;
872 * §6.3.1.1:2 Do integer promotion for a given type.
874 * @param type the type to promote
875 * @return the promoted type
877 static type_t *promote_integer(type_t *type)
879 if (get_akind_rank(get_akind(type)) < get_akind_rank(ATOMIC_TYPE_INT))
886 * Check if a given expression represents a null pointer constant.
888 * @param expression the expression to check
890 static bool is_null_pointer_constant(const expression_t *expression)
892 /* skip void* cast */
893 if (expression->kind == EXPR_UNARY_CAST) {
894 type_t *const type = skip_typeref(expression->base.type);
895 if (types_compatible(type, type_void_ptr))
896 expression = expression->unary.value;
899 type_t *const type = skip_typeref(expression->base.type);
900 if (!is_type_integer(type))
902 switch (is_constant_expression(expression)) {
903 case EXPR_CLASS_ERROR: return true;
904 case EXPR_CLASS_CONSTANT: return !fold_constant_to_bool(expression);
905 default: return false;
910 * Create an implicit cast expression.
912 * @param expression the expression to cast
913 * @param dest_type the destination type
915 static expression_t *create_implicit_cast(expression_t *expression,
918 type_t *const source_type = expression->base.type;
920 if (source_type == dest_type)
923 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
924 cast->unary.value = expression;
925 cast->base.type = dest_type;
926 cast->base.implicit = true;
931 typedef enum assign_error_t {
933 ASSIGN_ERROR_INCOMPATIBLE,
934 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
935 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
936 ASSIGN_WARNING_POINTER_FROM_INT,
937 ASSIGN_WARNING_INT_FROM_POINTER
940 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)
942 type_t *const orig_type_right = right->base.type;
943 type_t *const type_left = skip_typeref(orig_type_left);
944 type_t *const type_right = skip_typeref(orig_type_right);
949 case ASSIGN_ERROR_INCOMPATIBLE:
950 errorf(pos, "destination type '%T' in %s is incompatible with type '%T'", orig_type_left, context, orig_type_right);
953 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
954 type_t *points_to_left = skip_typeref(type_left->pointer.points_to);
955 type_t *points_to_right = skip_typeref(type_right->pointer.points_to);
957 /* the left type has all qualifiers from the right type */
958 unsigned missing_qualifiers = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
959 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);
963 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
964 warningf(WARN_OTHER, pos, "destination type '%T' in %s is incompatible with '%E' of type '%T'", orig_type_left, context, right, orig_type_right);
967 case ASSIGN_WARNING_POINTER_FROM_INT:
968 warningf(WARN_OTHER, pos, "%s makes pointer '%T' from integer '%T' without a cast", context, orig_type_left, orig_type_right);
971 case ASSIGN_WARNING_INT_FROM_POINTER:
972 warningf(WARN_OTHER, pos, "%s makes integer '%T' from pointer '%T' without a cast", context, orig_type_left, orig_type_right);
976 panic("invalid error value");
980 /** Implements the rules from §6.5.16.1 */
981 static assign_error_t semantic_assign(type_t *orig_type_left,
982 const expression_t *const right)
984 type_t *const orig_type_right = right->base.type;
985 type_t *const type_left = skip_typeref(orig_type_left);
986 type_t *const type_right = skip_typeref(orig_type_right);
988 if (is_type_pointer(type_left)) {
989 if (is_null_pointer_constant(right)) {
990 return ASSIGN_SUCCESS;
991 } else if (is_type_pointer(type_right)) {
992 type_t *points_to_left
993 = skip_typeref(type_left->pointer.points_to);
994 type_t *points_to_right
995 = skip_typeref(type_right->pointer.points_to);
996 assign_error_t res = ASSIGN_SUCCESS;
998 /* the left type has all qualifiers from the right type */
999 unsigned missing_qualifiers
1000 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1001 if (missing_qualifiers != 0) {
1002 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
1005 points_to_left = get_unqualified_type(points_to_left);
1006 points_to_right = get_unqualified_type(points_to_right);
1008 if (is_type_void(points_to_left))
1011 if (is_type_void(points_to_right)) {
1012 /* ISO/IEC 14882:1998(E) §C.1.2:6 */
1013 return c_mode & _CXX ? ASSIGN_ERROR_INCOMPATIBLE : res;
1016 if (!types_compatible(points_to_left, points_to_right)) {
1017 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
1021 } else if (is_type_integer(type_right)) {
1022 return ASSIGN_WARNING_POINTER_FROM_INT;
1024 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1025 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1026 && is_type_pointer(type_right))) {
1027 return ASSIGN_SUCCESS;
1028 } else if (is_type_compound(type_left) && is_type_compound(type_right)) {
1029 type_t *const unqual_type_left = get_unqualified_type(type_left);
1030 type_t *const unqual_type_right = get_unqualified_type(type_right);
1031 if (types_compatible(unqual_type_left, unqual_type_right)) {
1032 return ASSIGN_SUCCESS;
1034 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1035 return ASSIGN_WARNING_INT_FROM_POINTER;
1038 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1039 return ASSIGN_SUCCESS;
1041 return ASSIGN_ERROR_INCOMPATIBLE;
1044 static expression_t *parse_constant_expression(void)
1046 expression_t *result = parse_subexpression(PREC_CONDITIONAL);
1048 if (is_constant_expression(result) == EXPR_CLASS_VARIABLE) {
1049 errorf(&result->base.source_position,
1050 "expression '%E' is not constant", result);
1056 static expression_t *parse_assignment_expression(void)
1058 return parse_subexpression(PREC_ASSIGNMENT);
1061 static void warn_string_concat(const source_position_t *pos)
1063 warningf(WARN_TRADITIONAL, pos, "traditional C rejects string constant concatenation");
1066 static string_t parse_string_literals(void)
1068 assert(token.kind == T_STRING_LITERAL);
1069 string_t result = token.string.string;
1073 while (token.kind == T_STRING_LITERAL) {
1074 warn_string_concat(&token.base.source_position);
1075 result = concat_strings(&result, &token.string.string);
1082 static attribute_t *allocate_attribute_zero(attribute_kind_t kind)
1084 attribute_t *attribute = allocate_ast_zero(sizeof(*attribute));
1085 attribute->kind = kind;
1086 attribute->source_position = *HERE;
1091 * Parse (gcc) attribute argument. From gcc comments in gcc source:
1094 * __attribute__ ( ( attribute-list ) )
1098 * attribute_list , attrib
1103 * any-word ( identifier )
1104 * any-word ( identifier , nonempty-expr-list )
1105 * any-word ( expr-list )
1107 * where the "identifier" must not be declared as a type, and
1108 * "any-word" may be any identifier (including one declared as a
1109 * type), a reserved word storage class specifier, type specifier or
1110 * type qualifier. ??? This still leaves out most reserved keywords
1111 * (following the old parser), shouldn't we include them, and why not
1112 * allow identifiers declared as types to start the arguments?
1114 * Matze: this all looks confusing and little systematic, so we're even less
1115 * strict and parse any list of things which are identifiers or
1116 * (assignment-)expressions.
1118 static attribute_argument_t *parse_attribute_arguments(void)
1120 attribute_argument_t *first = NULL;
1121 attribute_argument_t **anchor = &first;
1122 if (token.kind != ')') do {
1123 attribute_argument_t *argument = allocate_ast_zero(sizeof(*argument));
1125 /* is it an identifier */
1126 if (token.kind == T_IDENTIFIER
1127 && (look_ahead(1)->kind == ',' || look_ahead(1)->kind == ')')) {
1128 symbol_t *symbol = token.identifier.symbol;
1129 argument->kind = ATTRIBUTE_ARGUMENT_SYMBOL;
1130 argument->v.symbol = symbol;
1133 /* must be an expression */
1134 expression_t *expression = parse_assignment_expression();
1136 argument->kind = ATTRIBUTE_ARGUMENT_EXPRESSION;
1137 argument->v.expression = expression;
1140 /* append argument */
1142 anchor = &argument->next;
1143 } while (next_if(','));
1144 expect(')', end_error);
1149 static attribute_t *parse_attribute_asm(void)
1151 attribute_t *attribute = allocate_attribute_zero(ATTRIBUTE_GNU_ASM);
1154 expect('(', end_error);
1155 attribute->a.arguments = parse_attribute_arguments();
1162 static symbol_t *get_symbol_from_token(void)
1164 switch(token.kind) {
1166 return token.identifier.symbol;
1195 /* maybe we need more tokens ... add them on demand */
1196 return get_token_kind_symbol(token.kind);
1202 static attribute_t *parse_attribute_gnu_single(void)
1204 /* parse "any-word" */
1205 symbol_t *symbol = get_symbol_from_token();
1206 if (symbol == NULL) {
1207 parse_error_expected("while parsing attribute((", T_IDENTIFIER, NULL);
1211 attribute_kind_t kind;
1212 char const *const name = symbol->string;
1213 for (kind = ATTRIBUTE_GNU_FIRST;; ++kind) {
1214 if (kind > ATTRIBUTE_GNU_LAST) {
1215 warningf(WARN_ATTRIBUTE, HERE, "unknown attribute '%s' ignored", name);
1216 /* TODO: we should still save the attribute in the list... */
1217 kind = ATTRIBUTE_UNKNOWN;
1221 const char *attribute_name = get_attribute_name(kind);
1222 if (attribute_name != NULL && streq_underscore(attribute_name, name))
1226 attribute_t *attribute = allocate_attribute_zero(kind);
1229 /* parse arguments */
1231 attribute->a.arguments = parse_attribute_arguments();
1236 static attribute_t *parse_attribute_gnu(void)
1238 attribute_t *first = NULL;
1239 attribute_t **anchor = &first;
1241 eat(T___attribute__);
1242 expect('(', end_error);
1243 expect('(', end_error);
1245 if (token.kind != ')') do {
1246 attribute_t *attribute = parse_attribute_gnu_single();
1247 if (attribute == NULL)
1250 *anchor = attribute;
1251 anchor = &attribute->next;
1252 } while (next_if(','));
1253 expect(')', end_error);
1254 expect(')', end_error);
1260 /** Parse attributes. */
1261 static attribute_t *parse_attributes(attribute_t *first)
1263 attribute_t **anchor = &first;
1265 while (*anchor != NULL)
1266 anchor = &(*anchor)->next;
1268 attribute_t *attribute;
1269 switch (token.kind) {
1270 case T___attribute__:
1271 attribute = parse_attribute_gnu();
1272 if (attribute == NULL)
1277 attribute = parse_attribute_asm();
1281 attribute = allocate_attribute_zero(ATTRIBUTE_MS_CDECL);
1286 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FASTCALL);
1290 case T__forceinline:
1291 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FORCEINLINE);
1292 eat(T__forceinline);
1296 attribute = allocate_attribute_zero(ATTRIBUTE_MS_STDCALL);
1301 /* TODO record modifier */
1302 warningf(WARN_OTHER, HERE, "Ignoring declaration modifier %K", &token);
1303 attribute = allocate_attribute_zero(ATTRIBUTE_MS_THISCALL);
1311 *anchor = attribute;
1312 anchor = &attribute->next;
1316 static void mark_vars_read(expression_t *expr, entity_t *lhs_ent);
1318 static entity_t *determine_lhs_ent(expression_t *const expr,
1321 switch (expr->kind) {
1322 case EXPR_REFERENCE: {
1323 entity_t *const entity = expr->reference.entity;
1324 /* we should only find variables as lvalues... */
1325 if (entity->base.kind != ENTITY_VARIABLE
1326 && entity->base.kind != ENTITY_PARAMETER)
1332 case EXPR_ARRAY_ACCESS: {
1333 expression_t *const ref = expr->array_access.array_ref;
1334 entity_t * ent = NULL;
1335 if (is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1336 ent = determine_lhs_ent(ref, lhs_ent);
1339 mark_vars_read(ref, lhs_ent);
1341 mark_vars_read(expr->array_access.index, lhs_ent);
1346 mark_vars_read(expr->select.compound, lhs_ent);
1347 if (is_type_compound(skip_typeref(expr->base.type)))
1348 return determine_lhs_ent(expr->select.compound, lhs_ent);
1352 case EXPR_UNARY_DEREFERENCE: {
1353 expression_t *const val = expr->unary.value;
1354 if (val->kind == EXPR_UNARY_TAKE_ADDRESS) {
1356 return determine_lhs_ent(val->unary.value, lhs_ent);
1358 mark_vars_read(val, NULL);
1364 mark_vars_read(expr, NULL);
1369 #define ENT_ANY ((entity_t*)-1)
1372 * Mark declarations, which are read. This is used to detect variables, which
1376 * x is not marked as "read", because it is only read to calculate its own new
1380 * x and y are not detected as "not read", because multiple variables are
1383 static void mark_vars_read(expression_t *const expr, entity_t *lhs_ent)
1385 switch (expr->kind) {
1386 case EXPR_REFERENCE: {
1387 entity_t *const entity = expr->reference.entity;
1388 if (entity->kind != ENTITY_VARIABLE
1389 && entity->kind != ENTITY_PARAMETER)
1392 if (lhs_ent != entity && lhs_ent != ENT_ANY) {
1393 if (entity->kind == ENTITY_VARIABLE) {
1394 entity->variable.read = true;
1396 entity->parameter.read = true;
1403 // TODO respect pure/const
1404 mark_vars_read(expr->call.function, NULL);
1405 for (call_argument_t *arg = expr->call.arguments; arg != NULL; arg = arg->next) {
1406 mark_vars_read(arg->expression, NULL);
1410 case EXPR_CONDITIONAL:
1411 // TODO lhs_decl should depend on whether true/false have an effect
1412 mark_vars_read(expr->conditional.condition, NULL);
1413 if (expr->conditional.true_expression != NULL)
1414 mark_vars_read(expr->conditional.true_expression, lhs_ent);
1415 mark_vars_read(expr->conditional.false_expression, lhs_ent);
1419 if (lhs_ent == ENT_ANY
1420 && !is_type_compound(skip_typeref(expr->base.type)))
1422 mark_vars_read(expr->select.compound, lhs_ent);
1425 case EXPR_ARRAY_ACCESS: {
1426 mark_vars_read(expr->array_access.index, lhs_ent);
1427 expression_t *const ref = expr->array_access.array_ref;
1428 if (!is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1429 if (lhs_ent == ENT_ANY)
1432 mark_vars_read(ref, lhs_ent);
1437 mark_vars_read(expr->va_arge.ap, lhs_ent);
1441 mark_vars_read(expr->va_copye.src, lhs_ent);
1444 case EXPR_UNARY_CAST:
1445 /* Special case: Use void cast to mark a variable as "read" */
1446 if (is_type_void(skip_typeref(expr->base.type)))
1451 case EXPR_UNARY_THROW:
1452 if (expr->unary.value == NULL)
1455 case EXPR_UNARY_DEREFERENCE:
1456 case EXPR_UNARY_DELETE:
1457 case EXPR_UNARY_DELETE_ARRAY:
1458 if (lhs_ent == ENT_ANY)
1462 case EXPR_UNARY_NEGATE:
1463 case EXPR_UNARY_PLUS:
1464 case EXPR_UNARY_BITWISE_NEGATE:
1465 case EXPR_UNARY_NOT:
1466 case EXPR_UNARY_TAKE_ADDRESS:
1467 case EXPR_UNARY_POSTFIX_INCREMENT:
1468 case EXPR_UNARY_POSTFIX_DECREMENT:
1469 case EXPR_UNARY_PREFIX_INCREMENT:
1470 case EXPR_UNARY_PREFIX_DECREMENT:
1471 case EXPR_UNARY_ASSUME:
1473 mark_vars_read(expr->unary.value, lhs_ent);
1476 case EXPR_BINARY_ADD:
1477 case EXPR_BINARY_SUB:
1478 case EXPR_BINARY_MUL:
1479 case EXPR_BINARY_DIV:
1480 case EXPR_BINARY_MOD:
1481 case EXPR_BINARY_EQUAL:
1482 case EXPR_BINARY_NOTEQUAL:
1483 case EXPR_BINARY_LESS:
1484 case EXPR_BINARY_LESSEQUAL:
1485 case EXPR_BINARY_GREATER:
1486 case EXPR_BINARY_GREATEREQUAL:
1487 case EXPR_BINARY_BITWISE_AND:
1488 case EXPR_BINARY_BITWISE_OR:
1489 case EXPR_BINARY_BITWISE_XOR:
1490 case EXPR_BINARY_LOGICAL_AND:
1491 case EXPR_BINARY_LOGICAL_OR:
1492 case EXPR_BINARY_SHIFTLEFT:
1493 case EXPR_BINARY_SHIFTRIGHT:
1494 case EXPR_BINARY_COMMA:
1495 case EXPR_BINARY_ISGREATER:
1496 case EXPR_BINARY_ISGREATEREQUAL:
1497 case EXPR_BINARY_ISLESS:
1498 case EXPR_BINARY_ISLESSEQUAL:
1499 case EXPR_BINARY_ISLESSGREATER:
1500 case EXPR_BINARY_ISUNORDERED:
1501 mark_vars_read(expr->binary.left, lhs_ent);
1502 mark_vars_read(expr->binary.right, lhs_ent);
1505 case EXPR_BINARY_ASSIGN:
1506 case EXPR_BINARY_MUL_ASSIGN:
1507 case EXPR_BINARY_DIV_ASSIGN:
1508 case EXPR_BINARY_MOD_ASSIGN:
1509 case EXPR_BINARY_ADD_ASSIGN:
1510 case EXPR_BINARY_SUB_ASSIGN:
1511 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
1512 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
1513 case EXPR_BINARY_BITWISE_AND_ASSIGN:
1514 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
1515 case EXPR_BINARY_BITWISE_OR_ASSIGN: {
1516 if (lhs_ent == ENT_ANY)
1518 lhs_ent = determine_lhs_ent(expr->binary.left, lhs_ent);
1519 mark_vars_read(expr->binary.right, lhs_ent);
1524 determine_lhs_ent(expr->va_starte.ap, lhs_ent);
1527 case EXPR_LITERAL_CASES:
1529 case EXPR_STRING_LITERAL:
1530 case EXPR_WIDE_STRING_LITERAL:
1531 case EXPR_COMPOUND_LITERAL: // TODO init?
1533 case EXPR_CLASSIFY_TYPE:
1536 case EXPR_BUILTIN_CONSTANT_P:
1537 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
1539 case EXPR_STATEMENT: // TODO
1540 case EXPR_LABEL_ADDRESS:
1541 case EXPR_ENUM_CONSTANT:
1545 panic("unhandled expression");
1548 static designator_t *parse_designation(void)
1550 designator_t *result = NULL;
1551 designator_t **anchor = &result;
1554 designator_t *designator;
1555 switch (token.kind) {
1557 designator = allocate_ast_zero(sizeof(designator[0]));
1558 designator->source_position = token.base.source_position;
1560 add_anchor_token(']');
1561 designator->array_index = parse_constant_expression();
1562 rem_anchor_token(']');
1563 expect(']', end_error);
1566 designator = allocate_ast_zero(sizeof(designator[0]));
1567 designator->source_position = token.base.source_position;
1569 designator->symbol = expect_identifier("while parsing designator", NULL);
1570 if (!designator->symbol)
1574 expect('=', end_error);
1578 assert(designator != NULL);
1579 *anchor = designator;
1580 anchor = &designator->next;
1586 static initializer_t *initializer_from_string(array_type_t *const type,
1587 const string_t *const string)
1589 /* TODO: check len vs. size of array type */
1592 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
1593 initializer->string.string = *string;
1598 static initializer_t *initializer_from_wide_string(array_type_t *const type,
1599 const string_t *const string)
1601 /* TODO: check len vs. size of array type */
1604 initializer_t *const initializer =
1605 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
1606 initializer->wide_string.string = *string;
1612 * Build an initializer from a given expression.
1614 static initializer_t *initializer_from_expression(type_t *orig_type,
1615 expression_t *expression)
1617 /* TODO check that expression is a constant expression */
1619 /* §6.7.8.14/15 char array may be initialized by string literals */
1620 type_t *type = skip_typeref(orig_type);
1621 type_t *expr_type_orig = expression->base.type;
1622 type_t *expr_type = skip_typeref(expr_type_orig);
1624 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
1625 array_type_t *const array_type = &type->array;
1626 type_t *const element_type = skip_typeref(array_type->element_type);
1628 if (element_type->kind == TYPE_ATOMIC) {
1629 atomic_type_kind_t akind = element_type->atomic.akind;
1630 switch (expression->kind) {
1631 case EXPR_STRING_LITERAL:
1632 if (akind == ATOMIC_TYPE_CHAR
1633 || akind == ATOMIC_TYPE_SCHAR
1634 || akind == ATOMIC_TYPE_UCHAR) {
1635 return initializer_from_string(array_type,
1636 &expression->string_literal.value);
1640 case EXPR_WIDE_STRING_LITERAL: {
1641 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
1642 if (get_unqualified_type(element_type) == bare_wchar_type) {
1643 return initializer_from_wide_string(array_type,
1644 &expression->string_literal.value);
1655 assign_error_t error = semantic_assign(type, expression);
1656 if (error == ASSIGN_ERROR_INCOMPATIBLE)
1658 report_assign_error(error, type, expression, "initializer",
1659 &expression->base.source_position);
1661 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
1662 result->value.value = create_implicit_cast(expression, type);
1668 * Parses an scalar initializer.
1670 * §6.7.8.11; eat {} without warning
1672 static initializer_t *parse_scalar_initializer(type_t *type,
1673 bool must_be_constant)
1675 /* there might be extra {} hierarchies */
1677 if (token.kind == '{') {
1678 warningf(WARN_OTHER, HERE, "extra curly braces around scalar initializer");
1682 } while (token.kind == '{');
1685 expression_t *expression = parse_assignment_expression();
1686 mark_vars_read(expression, NULL);
1687 if (must_be_constant && !is_linker_constant(expression)) {
1688 errorf(&expression->base.source_position,
1689 "initialisation expression '%E' is not constant",
1693 initializer_t *initializer = initializer_from_expression(type, expression);
1695 if (initializer == NULL) {
1696 errorf(&expression->base.source_position,
1697 "expression '%E' (type '%T') doesn't match expected type '%T'",
1698 expression, expression->base.type, type);
1703 bool additional_warning_displayed = false;
1704 while (braces > 0) {
1706 if (token.kind != '}') {
1707 if (!additional_warning_displayed) {
1708 warningf(WARN_OTHER, HERE, "additional elements in scalar initializer");
1709 additional_warning_displayed = true;
1720 * An entry in the type path.
1722 typedef struct type_path_entry_t type_path_entry_t;
1723 struct type_path_entry_t {
1724 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
1726 size_t index; /**< For array types: the current index. */
1727 declaration_t *compound_entry; /**< For compound types: the current declaration. */
1732 * A type path expression a position inside compound or array types.
1734 typedef struct type_path_t type_path_t;
1735 struct type_path_t {
1736 type_path_entry_t *path; /**< An flexible array containing the current path. */
1737 type_t *top_type; /**< type of the element the path points */
1738 size_t max_index; /**< largest index in outermost array */
1742 * Prints a type path for debugging.
1744 static __attribute__((unused)) void debug_print_type_path(
1745 const type_path_t *path)
1747 size_t len = ARR_LEN(path->path);
1749 for (size_t i = 0; i < len; ++i) {
1750 const type_path_entry_t *entry = & path->path[i];
1752 type_t *type = skip_typeref(entry->type);
1753 if (is_type_compound(type)) {
1754 /* in gcc mode structs can have no members */
1755 if (entry->v.compound_entry == NULL) {
1759 fprintf(stderr, ".%s",
1760 entry->v.compound_entry->base.symbol->string);
1761 } else if (is_type_array(type)) {
1762 fprintf(stderr, "[%u]", (unsigned) entry->v.index);
1764 fprintf(stderr, "-INVALID-");
1767 if (path->top_type != NULL) {
1768 fprintf(stderr, " (");
1769 print_type(path->top_type);
1770 fprintf(stderr, ")");
1775 * Return the top type path entry, ie. in a path
1776 * (type).a.b returns the b.
1778 static type_path_entry_t *get_type_path_top(const type_path_t *path)
1780 size_t len = ARR_LEN(path->path);
1782 return &path->path[len-1];
1786 * Enlarge the type path by an (empty) element.
1788 static type_path_entry_t *append_to_type_path(type_path_t *path)
1790 size_t len = ARR_LEN(path->path);
1791 ARR_RESIZE(type_path_entry_t, path->path, len+1);
1793 type_path_entry_t *result = & path->path[len];
1794 memset(result, 0, sizeof(result[0]));
1799 * Descending into a sub-type. Enter the scope of the current top_type.
1801 static void descend_into_subtype(type_path_t *path)
1803 type_t *orig_top_type = path->top_type;
1804 type_t *top_type = skip_typeref(orig_top_type);
1806 type_path_entry_t *top = append_to_type_path(path);
1807 top->type = top_type;
1809 if (is_type_compound(top_type)) {
1810 compound_t *const compound = top_type->compound.compound;
1811 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
1813 if (entry != NULL) {
1814 top->v.compound_entry = &entry->declaration;
1815 path->top_type = entry->declaration.type;
1817 path->top_type = NULL;
1819 } else if (is_type_array(top_type)) {
1821 path->top_type = top_type->array.element_type;
1823 assert(!is_type_valid(top_type));
1828 * Pop an entry from the given type path, ie. returning from
1829 * (type).a.b to (type).a
1831 static void ascend_from_subtype(type_path_t *path)
1833 type_path_entry_t *top = get_type_path_top(path);
1835 path->top_type = top->type;
1837 size_t len = ARR_LEN(path->path);
1838 ARR_RESIZE(type_path_entry_t, path->path, len-1);
1842 * Pop entries from the given type path until the given
1843 * path level is reached.
1845 static void ascend_to(type_path_t *path, size_t top_path_level)
1847 size_t len = ARR_LEN(path->path);
1849 while (len > top_path_level) {
1850 ascend_from_subtype(path);
1851 len = ARR_LEN(path->path);
1855 static bool walk_designator(type_path_t *path, const designator_t *designator,
1856 bool used_in_offsetof)
1858 for (; designator != NULL; designator = designator->next) {
1859 type_path_entry_t *top = get_type_path_top(path);
1860 type_t *orig_type = top->type;
1862 type_t *type = skip_typeref(orig_type);
1864 if (designator->symbol != NULL) {
1865 symbol_t *symbol = designator->symbol;
1866 if (!is_type_compound(type)) {
1867 if (is_type_valid(type)) {
1868 errorf(&designator->source_position,
1869 "'.%Y' designator used for non-compound type '%T'",
1873 top->type = type_error_type;
1874 top->v.compound_entry = NULL;
1875 orig_type = type_error_type;
1877 compound_t *compound = type->compound.compound;
1878 entity_t *iter = compound->members.entities;
1879 for (; iter != NULL; iter = iter->base.next) {
1880 if (iter->base.symbol == symbol) {
1885 errorf(&designator->source_position,
1886 "'%T' has no member named '%Y'", orig_type, symbol);
1889 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
1890 if (used_in_offsetof && iter->compound_member.bitfield) {
1891 errorf(&designator->source_position,
1892 "offsetof designator '%Y' must not specify bitfield",
1897 top->type = orig_type;
1898 top->v.compound_entry = &iter->declaration;
1899 orig_type = iter->declaration.type;
1902 expression_t *array_index = designator->array_index;
1903 assert(designator->array_index != NULL);
1905 if (!is_type_array(type)) {
1906 if (is_type_valid(type)) {
1907 errorf(&designator->source_position,
1908 "[%E] designator used for non-array type '%T'",
1909 array_index, orig_type);
1914 long index = fold_constant_to_int(array_index);
1915 if (!used_in_offsetof) {
1917 errorf(&designator->source_position,
1918 "array index [%E] must be positive", array_index);
1919 } else if (type->array.size_constant) {
1920 long array_size = type->array.size;
1921 if (index >= array_size) {
1922 errorf(&designator->source_position,
1923 "designator [%E] (%d) exceeds array size %d",
1924 array_index, index, array_size);
1929 top->type = orig_type;
1930 top->v.index = (size_t) index;
1931 orig_type = type->array.element_type;
1933 path->top_type = orig_type;
1935 if (designator->next != NULL) {
1936 descend_into_subtype(path);
1942 static void advance_current_object(type_path_t *path, size_t top_path_level)
1944 type_path_entry_t *top = get_type_path_top(path);
1946 type_t *type = skip_typeref(top->type);
1947 if (is_type_union(type)) {
1948 /* in unions only the first element is initialized */
1949 top->v.compound_entry = NULL;
1950 } else if (is_type_struct(type)) {
1951 declaration_t *entry = top->v.compound_entry;
1953 entity_t *const next_entity = skip_unnamed_bitfields(entry->base.next);
1954 if (next_entity != NULL) {
1955 assert(is_declaration(next_entity));
1956 entry = &next_entity->declaration;
1961 top->v.compound_entry = entry;
1962 if (entry != NULL) {
1963 path->top_type = entry->type;
1966 } else if (is_type_array(type)) {
1967 assert(is_type_array(type));
1971 if (!type->array.size_constant || top->v.index < type->array.size) {
1975 assert(!is_type_valid(type));
1979 /* we're past the last member of the current sub-aggregate, try if we
1980 * can ascend in the type hierarchy and continue with another subobject */
1981 size_t len = ARR_LEN(path->path);
1983 if (len > top_path_level) {
1984 ascend_from_subtype(path);
1985 advance_current_object(path, top_path_level);
1987 path->top_type = NULL;
1992 * skip any {...} blocks until a closing bracket is reached.
1994 static void skip_initializers(void)
1998 while (token.kind != '}') {
1999 if (token.kind == T_EOF)
2001 if (token.kind == '{') {
2009 static initializer_t *create_empty_initializer(void)
2011 static initializer_t empty_initializer
2012 = { .list = { { INITIALIZER_LIST }, 0 } };
2013 return &empty_initializer;
2017 * Parse a part of an initialiser for a struct or union,
2019 static initializer_t *parse_sub_initializer(type_path_t *path,
2020 type_t *outer_type, size_t top_path_level,
2021 parse_initializer_env_t *env)
2023 if (token.kind == '}') {
2024 /* empty initializer */
2025 return create_empty_initializer();
2028 type_t *orig_type = path->top_type;
2029 type_t *type = NULL;
2031 if (orig_type == NULL) {
2032 /* We are initializing an empty compound. */
2034 type = skip_typeref(orig_type);
2037 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2040 designator_t *designator = NULL;
2041 if (token.kind == '.' || token.kind == '[') {
2042 designator = parse_designation();
2043 goto finish_designator;
2044 } else if (token.kind == T_IDENTIFIER && look_ahead(1)->kind == ':') {
2045 /* GNU-style designator ("identifier: value") */
2046 designator = allocate_ast_zero(sizeof(designator[0]));
2047 designator->source_position = token.base.source_position;
2048 designator->symbol = token.identifier.symbol;
2053 /* reset path to toplevel, evaluate designator from there */
2054 ascend_to(path, top_path_level);
2055 if (!walk_designator(path, designator, false)) {
2056 /* can't continue after designation error */
2060 initializer_t *designator_initializer
2061 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2062 designator_initializer->designator.designator = designator;
2063 ARR_APP1(initializer_t*, initializers, designator_initializer);
2065 orig_type = path->top_type;
2066 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2071 if (token.kind == '{') {
2072 if (type != NULL && is_type_scalar(type)) {
2073 sub = parse_scalar_initializer(type, env->must_be_constant);
2076 if (env->entity != NULL) {
2078 "extra brace group at end of initializer for '%Y'",
2079 env->entity->base.symbol);
2081 errorf(HERE, "extra brace group at end of initializer");
2086 descend_into_subtype(path);
2089 add_anchor_token('}');
2090 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2092 rem_anchor_token('}');
2095 ascend_from_subtype(path);
2096 expect('}', end_error);
2098 expect('}', end_error);
2099 goto error_parse_next;
2103 /* must be an expression */
2104 expression_t *expression = parse_assignment_expression();
2105 mark_vars_read(expression, NULL);
2107 if (env->must_be_constant && !is_linker_constant(expression)) {
2108 errorf(&expression->base.source_position,
2109 "Initialisation expression '%E' is not constant",
2114 /* we are already outside, ... */
2115 if (outer_type == NULL)
2116 goto error_parse_next;
2117 type_t *const outer_type_skip = skip_typeref(outer_type);
2118 if (is_type_compound(outer_type_skip) &&
2119 !outer_type_skip->compound.compound->complete) {
2120 goto error_parse_next;
2123 source_position_t const* const pos = &expression->base.source_position;
2124 if (env->entity != NULL) {
2125 warningf(WARN_OTHER, pos, "excess elements in initializer for '%Y'", env->entity->base.symbol);
2127 warningf(WARN_OTHER, pos, "excess elements in initializer");
2129 goto error_parse_next;
2132 /* handle { "string" } special case */
2133 if ((expression->kind == EXPR_STRING_LITERAL
2134 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2135 && outer_type != NULL) {
2136 sub = initializer_from_expression(outer_type, expression);
2139 if (token.kind != '}') {
2140 warningf(WARN_OTHER, HERE, "excessive elements in initializer for type '%T'", orig_type);
2142 /* TODO: eat , ... */
2147 /* descend into subtypes until expression matches type */
2149 orig_type = path->top_type;
2150 type = skip_typeref(orig_type);
2152 sub = initializer_from_expression(orig_type, expression);
2156 if (!is_type_valid(type)) {
2159 if (is_type_scalar(type)) {
2160 errorf(&expression->base.source_position,
2161 "expression '%E' doesn't match expected type '%T'",
2162 expression, orig_type);
2166 descend_into_subtype(path);
2170 /* update largest index of top array */
2171 const type_path_entry_t *first = &path->path[0];
2172 type_t *first_type = first->type;
2173 first_type = skip_typeref(first_type);
2174 if (is_type_array(first_type)) {
2175 size_t index = first->v.index;
2176 if (index > path->max_index)
2177 path->max_index = index;
2180 /* append to initializers list */
2181 ARR_APP1(initializer_t*, initializers, sub);
2184 if (token.kind == '}') {
2187 expect(',', end_error);
2188 if (token.kind == '}') {
2193 /* advance to the next declaration if we are not at the end */
2194 advance_current_object(path, top_path_level);
2195 orig_type = path->top_type;
2196 if (orig_type != NULL)
2197 type = skip_typeref(orig_type);
2203 size_t len = ARR_LEN(initializers);
2204 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2205 initializer_t *result = allocate_ast_zero(size);
2206 result->kind = INITIALIZER_LIST;
2207 result->list.len = len;
2208 memcpy(&result->list.initializers, initializers,
2209 len * sizeof(initializers[0]));
2211 DEL_ARR_F(initializers);
2212 ascend_to(path, top_path_level+1);
2217 skip_initializers();
2218 DEL_ARR_F(initializers);
2219 ascend_to(path, top_path_level+1);
2223 static expression_t *make_size_literal(size_t value)
2225 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_INTEGER);
2226 literal->base.type = type_size_t;
2229 snprintf(buf, sizeof(buf), "%u", (unsigned) value);
2230 literal->literal.value = make_string(buf);
2236 * Parses an initializer. Parsers either a compound literal
2237 * (env->declaration == NULL) or an initializer of a declaration.
2239 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2241 type_t *type = skip_typeref(env->type);
2242 size_t max_index = 0;
2243 initializer_t *result;
2245 if (is_type_scalar(type)) {
2246 result = parse_scalar_initializer(type, env->must_be_constant);
2247 } else if (token.kind == '{') {
2251 memset(&path, 0, sizeof(path));
2252 path.top_type = env->type;
2253 path.path = NEW_ARR_F(type_path_entry_t, 0);
2255 descend_into_subtype(&path);
2257 add_anchor_token('}');
2258 result = parse_sub_initializer(&path, env->type, 1, env);
2259 rem_anchor_token('}');
2261 max_index = path.max_index;
2262 DEL_ARR_F(path.path);
2264 expect('}', end_error);
2267 /* parse_scalar_initializer() also works in this case: we simply
2268 * have an expression without {} around it */
2269 result = parse_scalar_initializer(type, env->must_be_constant);
2272 /* §6.7.8:22 array initializers for arrays with unknown size determine
2273 * the array type size */
2274 if (is_type_array(type) && type->array.size_expression == NULL
2275 && result != NULL) {
2277 switch (result->kind) {
2278 case INITIALIZER_LIST:
2279 assert(max_index != 0xdeadbeaf);
2280 size = max_index + 1;
2283 case INITIALIZER_STRING:
2284 size = result->string.string.size;
2287 case INITIALIZER_WIDE_STRING:
2288 size = result->wide_string.string.size;
2291 case INITIALIZER_DESIGNATOR:
2292 case INITIALIZER_VALUE:
2293 /* can happen for parse errors */
2298 internal_errorf(HERE, "invalid initializer type");
2301 type_t *new_type = duplicate_type(type);
2303 new_type->array.size_expression = make_size_literal(size);
2304 new_type->array.size_constant = true;
2305 new_type->array.has_implicit_size = true;
2306 new_type->array.size = size;
2307 env->type = new_type;
2313 static void append_entity(scope_t *scope, entity_t *entity)
2315 if (scope->last_entity != NULL) {
2316 scope->last_entity->base.next = entity;
2318 scope->entities = entity;
2320 entity->base.parent_entity = current_entity;
2321 scope->last_entity = entity;
2325 static compound_t *parse_compound_type_specifier(bool is_struct)
2327 source_position_t const pos = *HERE;
2328 eat(is_struct ? T_struct : T_union);
2330 symbol_t *symbol = NULL;
2331 entity_t *entity = NULL;
2332 attribute_t *attributes = NULL;
2334 if (token.kind == T___attribute__) {
2335 attributes = parse_attributes(NULL);
2338 entity_kind_tag_t const kind = is_struct ? ENTITY_STRUCT : ENTITY_UNION;
2339 if (token.kind == T_IDENTIFIER) {
2340 /* the compound has a name, check if we have seen it already */
2341 symbol = token.identifier.symbol;
2342 entity = get_tag(symbol, kind);
2345 if (entity != NULL) {
2346 if (entity->base.parent_scope != current_scope &&
2347 (token.kind == '{' || token.kind == ';')) {
2348 /* we're in an inner scope and have a definition. Shadow
2349 * existing definition in outer scope */
2351 } else if (entity->compound.complete && token.kind == '{') {
2352 source_position_t const *const ppos = &entity->base.source_position;
2353 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2354 /* clear members in the hope to avoid further errors */
2355 entity->compound.members.entities = NULL;
2358 } else if (token.kind != '{') {
2359 char const *const msg =
2360 is_struct ? "while parsing struct type specifier" :
2361 "while parsing union type specifier";
2362 parse_error_expected(msg, T_IDENTIFIER, '{', NULL);
2367 if (entity == NULL) {
2368 entity = allocate_entity_zero(kind, NAMESPACE_TAG, symbol, &pos);
2369 entity->compound.alignment = 1;
2370 entity->base.parent_scope = current_scope;
2371 if (symbol != NULL) {
2372 environment_push(entity);
2374 append_entity(current_scope, entity);
2377 if (token.kind == '{') {
2378 parse_compound_type_entries(&entity->compound);
2380 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2381 if (symbol == NULL) {
2382 assert(anonymous_entity == NULL);
2383 anonymous_entity = entity;
2387 if (attributes != NULL) {
2388 handle_entity_attributes(attributes, entity);
2391 return &entity->compound;
2394 static void parse_enum_entries(type_t *const enum_type)
2398 if (token.kind == '}') {
2399 errorf(HERE, "empty enum not allowed");
2404 add_anchor_token('}');
2405 add_anchor_token(',');
2407 add_anchor_token('=');
2408 source_position_t pos;
2409 symbol_t *const symbol = expect_identifier("while parsing enum entry", &pos);
2410 entity_t *const entity = allocate_entity_zero(ENTITY_ENUM_VALUE, NAMESPACE_NORMAL, symbol, &pos);
2411 entity->enum_value.enum_type = enum_type;
2412 rem_anchor_token('=');
2415 expression_t *value = parse_constant_expression();
2417 value = create_implicit_cast(value, enum_type);
2418 entity->enum_value.value = value;
2423 record_entity(entity, false);
2424 } while (next_if(',') && token.kind != '}');
2425 rem_anchor_token(',');
2426 rem_anchor_token('}');
2428 expect('}', end_error);
2434 static type_t *parse_enum_specifier(void)
2436 source_position_t const pos = *HERE;
2441 switch (token.kind) {
2443 symbol = token.identifier.symbol;
2444 entity = get_tag(symbol, ENTITY_ENUM);
2447 if (entity != NULL) {
2448 if (entity->base.parent_scope != current_scope &&
2449 (token.kind == '{' || token.kind == ';')) {
2450 /* we're in an inner scope and have a definition. Shadow
2451 * existing definition in outer scope */
2453 } else if (entity->enume.complete && token.kind == '{') {
2454 source_position_t const *const ppos = &entity->base.source_position;
2455 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2466 parse_error_expected("while parsing enum type specifier",
2467 T_IDENTIFIER, '{', NULL);
2471 if (entity == NULL) {
2472 entity = allocate_entity_zero(ENTITY_ENUM, NAMESPACE_TAG, symbol, &pos);
2473 entity->base.parent_scope = current_scope;
2476 type_t *const type = allocate_type_zero(TYPE_ENUM);
2477 type->enumt.enume = &entity->enume;
2478 type->enumt.base.akind = ATOMIC_TYPE_INT;
2480 if (token.kind == '{') {
2481 if (symbol != NULL) {
2482 environment_push(entity);
2484 append_entity(current_scope, entity);
2485 entity->enume.complete = true;
2487 parse_enum_entries(type);
2488 parse_attributes(NULL);
2490 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2491 if (symbol == NULL) {
2492 assert(anonymous_entity == NULL);
2493 anonymous_entity = entity;
2495 } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
2496 errorf(HERE, "'%T' used before definition (incomplete enums are a GNU extension)", type);
2503 * if a symbol is a typedef to another type, return true
2505 static bool is_typedef_symbol(symbol_t *symbol)
2507 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
2508 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
2511 static type_t *parse_typeof(void)
2517 expect('(', end_error);
2518 add_anchor_token(')');
2520 expression_t *expression = NULL;
2522 switch (token.kind) {
2524 if (is_typedef_symbol(token.identifier.symbol)) {
2526 type = parse_typename();
2529 expression = parse_expression();
2530 type = revert_automatic_type_conversion(expression);
2535 rem_anchor_token(')');
2536 expect(')', end_error);
2538 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
2539 typeof_type->typeoft.expression = expression;
2540 typeof_type->typeoft.typeof_type = type;
2547 typedef enum specifiers_t {
2548 SPECIFIER_SIGNED = 1 << 0,
2549 SPECIFIER_UNSIGNED = 1 << 1,
2550 SPECIFIER_LONG = 1 << 2,
2551 SPECIFIER_INT = 1 << 3,
2552 SPECIFIER_DOUBLE = 1 << 4,
2553 SPECIFIER_CHAR = 1 << 5,
2554 SPECIFIER_WCHAR_T = 1 << 6,
2555 SPECIFIER_SHORT = 1 << 7,
2556 SPECIFIER_LONG_LONG = 1 << 8,
2557 SPECIFIER_FLOAT = 1 << 9,
2558 SPECIFIER_BOOL = 1 << 10,
2559 SPECIFIER_VOID = 1 << 11,
2560 SPECIFIER_INT8 = 1 << 12,
2561 SPECIFIER_INT16 = 1 << 13,
2562 SPECIFIER_INT32 = 1 << 14,
2563 SPECIFIER_INT64 = 1 << 15,
2564 SPECIFIER_INT128 = 1 << 16,
2565 SPECIFIER_COMPLEX = 1 << 17,
2566 SPECIFIER_IMAGINARY = 1 << 18,
2569 static type_t *get_typedef_type(symbol_t *symbol)
2571 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
2572 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
2575 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
2576 type->typedeft.typedefe = &entity->typedefe;
2581 static attribute_t *parse_attribute_ms_property(attribute_t *attribute)
2583 expect('(', end_error);
2585 attribute_property_argument_t *property
2586 = allocate_ast_zero(sizeof(*property));
2588 add_anchor_token(')');
2589 add_anchor_token(',');
2591 add_anchor_token('=');
2592 source_position_t pos;
2593 symbol_t *const prop_sym = expect_identifier("while parsing property declspec", &pos);
2594 rem_anchor_token('=');
2596 symbol_t **prop = NULL;
2598 if (streq(prop_sym->string, "put")) {
2599 prop = &property->put_symbol;
2600 } else if (streq(prop_sym->string, "get")) {
2601 prop = &property->get_symbol;
2603 errorf(&pos, "expected put or get in property declspec, but got '%Y'", prop_sym);
2607 add_anchor_token(T_IDENTIFIER);
2608 expect('=', end_error1);
2610 rem_anchor_token(T_IDENTIFIER);
2612 symbol_t *const sym = expect_identifier("while parsing property declspec", NULL);
2614 *prop = sym ? sym : sym_anonymous;
2615 } while (next_if(','));
2616 rem_anchor_token(',');
2617 rem_anchor_token(')');
2619 attribute->a.property = property;
2621 expect(')', end_error);
2627 static attribute_t *parse_microsoft_extended_decl_modifier_single(void)
2629 attribute_kind_t kind = ATTRIBUTE_UNKNOWN;
2630 if (next_if(T_restrict)) {
2631 kind = ATTRIBUTE_MS_RESTRICT;
2632 } else if (token.kind == T_IDENTIFIER) {
2633 const char *name = token.identifier.symbol->string;
2634 for (attribute_kind_t k = ATTRIBUTE_MS_FIRST; k <= ATTRIBUTE_MS_LAST;
2636 const char *attribute_name = get_attribute_name(k);
2637 if (attribute_name != NULL && streq(attribute_name, name)) {
2643 if (kind == ATTRIBUTE_UNKNOWN) {
2644 warningf(WARN_ATTRIBUTE, HERE, "unknown __declspec '%s' ignored", name);
2647 parse_error_expected("while parsing __declspec", T_IDENTIFIER, NULL);
2651 attribute_t *attribute = allocate_attribute_zero(kind);
2654 if (kind == ATTRIBUTE_MS_PROPERTY) {
2655 return parse_attribute_ms_property(attribute);
2658 /* parse arguments */
2660 attribute->a.arguments = parse_attribute_arguments();
2665 static attribute_t *parse_microsoft_extended_decl_modifier(attribute_t *first)
2669 expect('(', end_error);
2670 if (token.kind != ')') {
2671 add_anchor_token(')');
2673 attribute_t **anchor = &first;
2675 while (*anchor != NULL)
2676 anchor = &(*anchor)->next;
2678 attribute_t *attribute
2679 = parse_microsoft_extended_decl_modifier_single();
2680 if (attribute == NULL)
2683 *anchor = attribute;
2684 anchor = &attribute->next;
2685 } while (next_if(','));
2687 rem_anchor_token(')');
2689 expect(')', end_error);
2694 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
2696 entity_t *const entity = allocate_entity_zero(kind, NAMESPACE_NORMAL, symbol, HERE);
2697 if (is_declaration(entity)) {
2698 entity->declaration.type = type_error_type;
2699 entity->declaration.implicit = true;
2700 } else if (kind == ENTITY_TYPEDEF) {
2701 entity->typedefe.type = type_error_type;
2702 entity->typedefe.builtin = true;
2704 if (kind != ENTITY_COMPOUND_MEMBER)
2705 record_entity(entity, false);
2709 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2711 type_t *type = NULL;
2712 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
2713 unsigned type_specifiers = 0;
2714 bool newtype = false;
2715 bool saw_error = false;
2717 memset(specifiers, 0, sizeof(*specifiers));
2718 specifiers->source_position = token.base.source_position;
2721 specifiers->attributes = parse_attributes(specifiers->attributes);
2723 switch (token.kind) {
2725 #define MATCH_STORAGE_CLASS(token, class) \
2727 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
2728 errorf(HERE, "multiple storage classes in declaration specifiers"); \
2730 specifiers->storage_class = class; \
2731 if (specifiers->thread_local) \
2732 goto check_thread_storage_class; \
2736 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
2737 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
2738 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
2739 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
2740 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
2743 specifiers->attributes
2744 = parse_microsoft_extended_decl_modifier(specifiers->attributes);
2748 if (specifiers->thread_local) {
2749 errorf(HERE, "duplicate '__thread'");
2751 specifiers->thread_local = true;
2752 check_thread_storage_class:
2753 switch (specifiers->storage_class) {
2754 case STORAGE_CLASS_EXTERN:
2755 case STORAGE_CLASS_NONE:
2756 case STORAGE_CLASS_STATIC:
2760 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_storage_class;
2761 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_storage_class;
2762 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_storage_class;
2763 wrong_thread_storage_class:
2764 errorf(HERE, "'__thread' used with '%s'", wrong);
2771 /* type qualifiers */
2772 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
2774 qualifiers |= qualifier; \
2778 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
2779 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
2780 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
2781 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
2782 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
2783 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
2784 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
2785 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
2787 /* type specifiers */
2788 #define MATCH_SPECIFIER(token, specifier, name) \
2790 if (type_specifiers & specifier) { \
2791 errorf(HERE, "multiple " name " type specifiers given"); \
2793 type_specifiers |= specifier; \
2798 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
2799 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
2800 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
2801 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
2802 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
2803 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
2804 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
2805 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
2806 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
2807 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
2808 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
2809 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
2810 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
2811 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
2812 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
2813 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
2814 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
2815 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
2819 specifiers->is_inline = true;
2823 case T__forceinline:
2825 specifiers->modifiers |= DM_FORCEINLINE;
2830 if (type_specifiers & SPECIFIER_LONG_LONG) {
2831 errorf(HERE, "too many long type specifiers given");
2832 } else if (type_specifiers & SPECIFIER_LONG) {
2833 type_specifiers |= SPECIFIER_LONG_LONG;
2835 type_specifiers |= SPECIFIER_LONG;
2840 #define CHECK_DOUBLE_TYPE() \
2841 (type != NULL ? errorf(HERE, "multiple types in declaration specifiers") : (void)0)
2844 CHECK_DOUBLE_TYPE();
2845 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
2847 type->compound.compound = parse_compound_type_specifier(true);
2850 CHECK_DOUBLE_TYPE();
2851 type = allocate_type_zero(TYPE_COMPOUND_UNION);
2852 type->compound.compound = parse_compound_type_specifier(false);
2855 CHECK_DOUBLE_TYPE();
2856 type = parse_enum_specifier();
2859 CHECK_DOUBLE_TYPE();
2860 type = parse_typeof();
2862 case T___builtin_va_list:
2863 CHECK_DOUBLE_TYPE();
2864 type = duplicate_type(type_valist);
2868 case T_IDENTIFIER: {
2869 /* only parse identifier if we haven't found a type yet */
2870 if (type != NULL || type_specifiers != 0) {
2871 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
2872 * declaration, so it doesn't generate errors about expecting '(' or
2874 switch (look_ahead(1)->kind) {
2881 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
2885 errorf(HERE, "discarding stray %K in declaration specifier", &token);
2890 goto finish_specifiers;
2894 type_t *const typedef_type = get_typedef_type(token.identifier.symbol);
2895 if (typedef_type == NULL) {
2896 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
2897 * declaration, so it doesn't generate 'implicit int' followed by more
2898 * errors later on. */
2899 token_kind_t const la1_type = (token_kind_t)look_ahead(1)->kind;
2905 errorf(HERE, "%K does not name a type", &token);
2907 symbol_t *symbol = token.identifier.symbol;
2909 = create_error_entity(symbol, ENTITY_TYPEDEF);
2911 type = allocate_type_zero(TYPE_TYPEDEF);
2912 type->typedeft.typedefe = &entity->typedefe;
2920 goto finish_specifiers;
2925 type = typedef_type;
2929 /* function specifier */
2931 goto finish_specifiers;
2936 specifiers->attributes = parse_attributes(specifiers->attributes);
2938 if (type == NULL || (saw_error && type_specifiers != 0)) {
2939 atomic_type_kind_t atomic_type;
2941 /* match valid basic types */
2942 switch (type_specifiers) {
2943 case SPECIFIER_VOID:
2944 atomic_type = ATOMIC_TYPE_VOID;
2946 case SPECIFIER_WCHAR_T:
2947 atomic_type = ATOMIC_TYPE_WCHAR_T;
2949 case SPECIFIER_CHAR:
2950 atomic_type = ATOMIC_TYPE_CHAR;
2952 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
2953 atomic_type = ATOMIC_TYPE_SCHAR;
2955 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
2956 atomic_type = ATOMIC_TYPE_UCHAR;
2958 case SPECIFIER_SHORT:
2959 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
2960 case SPECIFIER_SHORT | SPECIFIER_INT:
2961 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
2962 atomic_type = ATOMIC_TYPE_SHORT;
2964 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
2965 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
2966 atomic_type = ATOMIC_TYPE_USHORT;
2969 case SPECIFIER_SIGNED:
2970 case SPECIFIER_SIGNED | SPECIFIER_INT:
2971 atomic_type = ATOMIC_TYPE_INT;
2973 case SPECIFIER_UNSIGNED:
2974 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
2975 atomic_type = ATOMIC_TYPE_UINT;
2977 case SPECIFIER_LONG:
2978 case SPECIFIER_SIGNED | SPECIFIER_LONG:
2979 case SPECIFIER_LONG | SPECIFIER_INT:
2980 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
2981 atomic_type = ATOMIC_TYPE_LONG;
2983 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
2984 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
2985 atomic_type = ATOMIC_TYPE_ULONG;
2988 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2989 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2990 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
2991 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
2993 atomic_type = ATOMIC_TYPE_LONGLONG;
2994 goto warn_about_long_long;
2996 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2997 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
2999 atomic_type = ATOMIC_TYPE_ULONGLONG;
3000 warn_about_long_long:
3001 warningf(WARN_LONG_LONG, &specifiers->source_position, "ISO C90 does not support 'long long'");
3004 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3005 atomic_type = unsigned_int8_type_kind;
3008 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3009 atomic_type = unsigned_int16_type_kind;
3012 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3013 atomic_type = unsigned_int32_type_kind;
3016 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3017 atomic_type = unsigned_int64_type_kind;
3020 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3021 atomic_type = unsigned_int128_type_kind;
3024 case SPECIFIER_INT8:
3025 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3026 atomic_type = int8_type_kind;
3029 case SPECIFIER_INT16:
3030 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3031 atomic_type = int16_type_kind;
3034 case SPECIFIER_INT32:
3035 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3036 atomic_type = int32_type_kind;
3039 case SPECIFIER_INT64:
3040 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3041 atomic_type = int64_type_kind;
3044 case SPECIFIER_INT128:
3045 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3046 atomic_type = int128_type_kind;
3049 case SPECIFIER_FLOAT:
3050 atomic_type = ATOMIC_TYPE_FLOAT;
3052 case SPECIFIER_DOUBLE:
3053 atomic_type = ATOMIC_TYPE_DOUBLE;
3055 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3056 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3058 case SPECIFIER_BOOL:
3059 atomic_type = ATOMIC_TYPE_BOOL;
3061 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3062 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3063 atomic_type = ATOMIC_TYPE_FLOAT;
3065 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3066 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3067 atomic_type = ATOMIC_TYPE_DOUBLE;
3069 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3070 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3071 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3074 /* invalid specifier combination, give an error message */
3075 source_position_t const* const pos = &specifiers->source_position;
3076 if (type_specifiers == 0) {
3078 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
3079 if (!(c_mode & _CXX) && !strict_mode) {
3080 warningf(WARN_IMPLICIT_INT, pos, "no type specifiers in declaration, using 'int'");
3081 atomic_type = ATOMIC_TYPE_INT;
3084 errorf(pos, "no type specifiers given in declaration");
3087 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3088 (type_specifiers & SPECIFIER_UNSIGNED)) {
3089 errorf(pos, "signed and unsigned specifiers given");
3090 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3091 errorf(pos, "only integer types can be signed or unsigned");
3093 errorf(pos, "multiple datatypes in declaration");
3099 if (type_specifiers & SPECIFIER_COMPLEX) {
3100 type = allocate_type_zero(TYPE_COMPLEX);
3101 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3102 type = allocate_type_zero(TYPE_IMAGINARY);
3104 type = allocate_type_zero(TYPE_ATOMIC);
3106 type->atomic.akind = atomic_type;
3108 } else if (type_specifiers != 0) {
3109 errorf(&specifiers->source_position, "multiple datatypes in declaration");
3112 /* FIXME: check type qualifiers here */
3113 type->base.qualifiers = qualifiers;
3116 type = identify_new_type(type);
3118 type = typehash_insert(type);
3121 if (specifiers->attributes != NULL)
3122 type = handle_type_attributes(specifiers->attributes, type);
3123 specifiers->type = type;
3127 specifiers->type = type_error_type;
3130 static type_qualifiers_t parse_type_qualifiers(void)
3132 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3135 switch (token.kind) {
3136 /* type qualifiers */
3137 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3138 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3139 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3140 /* microsoft extended type modifiers */
3141 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3142 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3143 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3144 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3145 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3154 * Parses an K&R identifier list
3156 static void parse_identifier_list(scope_t *scope)
3158 assert(token.kind == T_IDENTIFIER);
3160 entity_t *const entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, token.identifier.symbol, HERE);
3161 /* a K&R parameter has no type, yet */
3165 append_entity(scope, entity);
3166 } while (next_if(',') && token.kind == T_IDENTIFIER);
3169 static entity_t *parse_parameter(void)
3171 declaration_specifiers_t specifiers;
3172 parse_declaration_specifiers(&specifiers);
3174 entity_t *entity = parse_declarator(&specifiers,
3175 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
3176 anonymous_entity = NULL;
3180 static void semantic_parameter_incomplete(const entity_t *entity)
3182 assert(entity->kind == ENTITY_PARAMETER);
3184 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
3185 * list in a function declarator that is part of a
3186 * definition of that function shall not have
3187 * incomplete type. */
3188 type_t *type = skip_typeref(entity->declaration.type);
3189 if (is_type_incomplete(type)) {
3190 errorf(&entity->base.source_position, "'%N' has incomplete type", entity);
3194 static bool has_parameters(void)
3196 /* func(void) is not a parameter */
3197 if (look_ahead(1)->kind != ')')
3199 if (token.kind == T_IDENTIFIER) {
3200 entity_t const *const entity
3201 = get_entity(token.identifier.symbol, NAMESPACE_NORMAL);
3204 if (entity->kind != ENTITY_TYPEDEF)
3206 type_t const *const type = skip_typeref(entity->typedefe.type);
3207 if (!is_type_void(type))
3209 if (c_mode & _CXX) {
3210 /* ISO/IEC 14882:1998(E) §8.3.5:2 It must be literally (void). A typedef
3211 * is not allowed. */
3212 errorf(HERE, "empty parameter list defined with a typedef of 'void' not allowed in C++");
3213 } else if (type->base.qualifiers != TYPE_QUALIFIER_NONE) {
3214 /* §6.7.5.3:10 Qualification is not allowed here. */
3215 errorf(HERE, "'void' as parameter must not have type qualifiers");
3217 } else if (token.kind != T_void) {
3225 * Parses function type parameters (and optionally creates variable_t entities
3226 * for them in a scope)
3228 static void parse_parameters(function_type_t *type, scope_t *scope)
3231 add_anchor_token(')');
3232 int saved_comma_state = save_and_reset_anchor_state(',');
3234 if (token.kind == T_IDENTIFIER
3235 && !is_typedef_symbol(token.identifier.symbol)) {
3236 token_kind_t la1_type = (token_kind_t)look_ahead(1)->kind;
3237 if (la1_type == ',' || la1_type == ')') {
3238 type->kr_style_parameters = true;
3239 parse_identifier_list(scope);
3240 goto parameters_finished;
3244 if (token.kind == ')') {
3245 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
3246 if (!(c_mode & _CXX))
3247 type->unspecified_parameters = true;
3248 } else if (has_parameters()) {
3249 function_parameter_t **anchor = &type->parameters;
3251 switch (token.kind) {
3254 type->variadic = true;
3255 goto parameters_finished;
3260 entity_t *entity = parse_parameter();
3261 if (entity->kind == ENTITY_TYPEDEF) {
3262 errorf(&entity->base.source_position,
3263 "typedef not allowed as function parameter");
3266 assert(is_declaration(entity));
3268 semantic_parameter_incomplete(entity);
3270 function_parameter_t *const parameter =
3271 allocate_parameter(entity->declaration.type);
3273 if (scope != NULL) {
3274 append_entity(scope, entity);
3277 *anchor = parameter;
3278 anchor = ¶meter->next;
3283 goto parameters_finished;
3285 } while (next_if(','));
3288 parameters_finished:
3289 rem_anchor_token(')');
3290 expect(')', end_error);
3293 restore_anchor_state(',', saved_comma_state);
3296 typedef enum construct_type_kind_t {
3297 CONSTRUCT_POINTER = 1,
3298 CONSTRUCT_REFERENCE,
3301 } construct_type_kind_t;
3303 typedef union construct_type_t construct_type_t;
3305 typedef struct construct_type_base_t {
3306 construct_type_kind_t kind;
3307 source_position_t pos;
3308 construct_type_t *next;
3309 } construct_type_base_t;
3311 typedef struct parsed_pointer_t {
3312 construct_type_base_t base;
3313 type_qualifiers_t type_qualifiers;
3314 variable_t *base_variable; /**< MS __based extension. */
3317 typedef struct parsed_reference_t {
3318 construct_type_base_t base;
3319 } parsed_reference_t;
3321 typedef struct construct_function_type_t {
3322 construct_type_base_t base;
3323 type_t *function_type;
3324 } construct_function_type_t;
3326 typedef struct parsed_array_t {
3327 construct_type_base_t base;
3328 type_qualifiers_t type_qualifiers;
3334 union construct_type_t {
3335 construct_type_kind_t kind;
3336 construct_type_base_t base;
3337 parsed_pointer_t pointer;
3338 parsed_reference_t reference;
3339 construct_function_type_t function;
3340 parsed_array_t array;
3343 static construct_type_t *allocate_declarator_zero(construct_type_kind_t const kind, size_t const size)
3345 construct_type_t *const cons = obstack_alloc(&temp_obst, size);
3346 memset(cons, 0, size);
3348 cons->base.pos = *HERE;
3353 static construct_type_t *parse_pointer_declarator(void)
3355 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_POINTER, sizeof(parsed_pointer_t));
3357 cons->pointer.type_qualifiers = parse_type_qualifiers();
3358 //cons->pointer.base_variable = base_variable;
3363 /* ISO/IEC 14882:1998(E) §8.3.2 */
3364 static construct_type_t *parse_reference_declarator(void)
3366 if (!(c_mode & _CXX))
3367 errorf(HERE, "references are only available for C++");
3369 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_REFERENCE, sizeof(parsed_reference_t));
3376 static construct_type_t *parse_array_declarator(void)
3378 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_ARRAY, sizeof(parsed_array_t));
3379 parsed_array_t *const array = &cons->array;
3382 add_anchor_token(']');
3384 bool is_static = next_if(T_static);
3386 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3389 is_static = next_if(T_static);
3391 array->type_qualifiers = type_qualifiers;
3392 array->is_static = is_static;
3394 expression_t *size = NULL;
3395 if (token.kind == '*' && look_ahead(1)->kind == ']') {
3396 array->is_variable = true;
3398 } else if (token.kind != ']') {
3399 size = parse_assignment_expression();
3401 /* §6.7.5.2:1 Array size must have integer type */
3402 type_t *const orig_type = size->base.type;
3403 type_t *const type = skip_typeref(orig_type);
3404 if (!is_type_integer(type) && is_type_valid(type)) {
3405 errorf(&size->base.source_position,
3406 "array size '%E' must have integer type but has type '%T'",
3411 mark_vars_read(size, NULL);
3414 if (is_static && size == NULL)
3415 errorf(&array->base.pos, "static array parameters require a size");
3417 rem_anchor_token(']');
3418 expect(']', end_error);
3425 static construct_type_t *parse_function_declarator(scope_t *scope)
3427 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_FUNCTION, sizeof(construct_function_type_t));
3429 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3430 function_type_t *ftype = &type->function;
3432 ftype->linkage = current_linkage;
3433 ftype->calling_convention = CC_DEFAULT;
3435 parse_parameters(ftype, scope);
3437 cons->function.function_type = type;
3442 typedef struct parse_declarator_env_t {
3443 bool may_be_abstract : 1;
3444 bool must_be_abstract : 1;
3445 decl_modifiers_t modifiers;
3447 source_position_t source_position;
3449 attribute_t *attributes;
3450 } parse_declarator_env_t;
3453 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env)
3455 /* construct a single linked list of construct_type_t's which describe
3456 * how to construct the final declarator type */
3457 construct_type_t *first = NULL;
3458 construct_type_t **anchor = &first;
3460 env->attributes = parse_attributes(env->attributes);
3463 construct_type_t *type;
3464 //variable_t *based = NULL; /* MS __based extension */
3465 switch (token.kind) {
3467 type = parse_reference_declarator();
3471 panic("based not supported anymore");
3476 type = parse_pointer_declarator();
3480 goto ptr_operator_end;
3484 anchor = &type->base.next;
3486 /* TODO: find out if this is correct */
3487 env->attributes = parse_attributes(env->attributes);
3491 construct_type_t *inner_types = NULL;
3493 switch (token.kind) {
3495 if (env->must_be_abstract) {
3496 errorf(HERE, "no identifier expected in typename");
3498 env->symbol = token.identifier.symbol;
3499 env->source_position = token.base.source_position;
3505 /* Parenthesized declarator or function declarator? */
3506 token_t const *const la1 = look_ahead(1);
3507 switch (la1->kind) {
3509 if (is_typedef_symbol(la1->identifier.symbol)) {
3511 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
3512 * interpreted as ``function with no parameter specification'', rather
3513 * than redundant parentheses around the omitted identifier. */
3515 /* Function declarator. */
3516 if (!env->may_be_abstract) {
3517 errorf(HERE, "function declarator must have a name");
3524 case T___attribute__: /* FIXME __attribute__ might also introduce a parameter of a function declarator. */
3525 /* Paranthesized declarator. */
3527 add_anchor_token(')');
3528 inner_types = parse_inner_declarator(env);
3529 if (inner_types != NULL) {
3530 /* All later declarators only modify the return type */
3531 env->must_be_abstract = true;
3533 rem_anchor_token(')');
3534 expect(')', end_error);
3542 if (env->may_be_abstract)
3544 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3549 construct_type_t **const p = anchor;
3552 construct_type_t *type;
3553 switch (token.kind) {
3555 scope_t *scope = NULL;
3556 if (!env->must_be_abstract) {
3557 scope = &env->parameters;
3560 type = parse_function_declarator(scope);
3564 type = parse_array_declarator();
3567 goto declarator_finished;
3570 /* insert in the middle of the list (at p) */
3571 type->base.next = *p;
3574 anchor = &type->base.next;
3577 declarator_finished:
3578 /* append inner_types at the end of the list, we don't to set anchor anymore
3579 * as it's not needed anymore */
3580 *anchor = inner_types;
3587 static type_t *construct_declarator_type(construct_type_t *construct_list,
3590 construct_type_t *iter = construct_list;
3591 for (; iter != NULL; iter = iter->base.next) {
3592 source_position_t const* const pos = &iter->base.pos;
3593 switch (iter->kind) {
3594 case CONSTRUCT_FUNCTION: {
3595 construct_function_type_t *function = &iter->function;
3596 type_t *function_type = function->function_type;
3598 function_type->function.return_type = type;
3600 type_t *skipped_return_type = skip_typeref(type);
3602 if (is_type_function(skipped_return_type)) {
3603 errorf(pos, "function returning function is not allowed");
3604 } else if (is_type_array(skipped_return_type)) {
3605 errorf(pos, "function returning array is not allowed");
3607 if (skipped_return_type->base.qualifiers != 0) {
3608 warningf(WARN_IGNORED_QUALIFIERS, pos, "type qualifiers in return type of function type are meaningless");
3612 /* The function type was constructed earlier. Freeing it here will
3613 * destroy other types. */
3614 type = typehash_insert(function_type);
3618 case CONSTRUCT_POINTER: {
3619 if (is_type_reference(skip_typeref(type)))
3620 errorf(pos, "cannot declare a pointer to reference");
3622 parsed_pointer_t *pointer = &iter->pointer;
3623 type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
3627 case CONSTRUCT_REFERENCE:
3628 if (is_type_reference(skip_typeref(type)))
3629 errorf(pos, "cannot declare a reference to reference");
3631 type = make_reference_type(type);
3634 case CONSTRUCT_ARRAY: {
3635 if (is_type_reference(skip_typeref(type)))
3636 errorf(pos, "cannot declare an array of references");
3638 parsed_array_t *array = &iter->array;
3639 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
3641 expression_t *size_expression = array->size;
3642 if (size_expression != NULL) {
3644 = create_implicit_cast(size_expression, type_size_t);
3647 array_type->base.qualifiers = array->type_qualifiers;
3648 array_type->array.element_type = type;
3649 array_type->array.is_static = array->is_static;
3650 array_type->array.is_variable = array->is_variable;
3651 array_type->array.size_expression = size_expression;
3653 if (size_expression != NULL) {
3654 switch (is_constant_expression(size_expression)) {
3655 case EXPR_CLASS_CONSTANT: {
3656 long const size = fold_constant_to_int(size_expression);
3657 array_type->array.size = size;
3658 array_type->array.size_constant = true;
3659 /* §6.7.5.2:1 If the expression is a constant expression,
3660 * it shall have a value greater than zero. */
3662 errorf(&size_expression->base.source_position,
3663 "size of array must be greater than zero");
3664 } else if (size == 0 && !GNU_MODE) {
3665 errorf(&size_expression->base.source_position,
3666 "size of array must be greater than zero (zero length arrays are a GCC extension)");
3671 case EXPR_CLASS_VARIABLE:
3672 array_type->array.is_vla = true;
3675 case EXPR_CLASS_ERROR:
3680 type_t *skipped_type = skip_typeref(type);
3682 if (is_type_incomplete(skipped_type)) {
3683 errorf(pos, "array of incomplete type '%T' is not allowed", type);
3684 } else if (is_type_function(skipped_type)) {
3685 errorf(pos, "array of functions is not allowed");
3687 type = identify_new_type(array_type);
3691 internal_errorf(pos, "invalid type construction found");
3697 static type_t *automatic_type_conversion(type_t *orig_type);
3699 static type_t *semantic_parameter(const source_position_t *pos,
3701 const declaration_specifiers_t *specifiers,
3702 entity_t const *const param)
3704 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
3705 * shall be adjusted to ``qualified pointer to type'',
3707 * §6.7.5.3:8 A declaration of a parameter as ``function returning
3708 * type'' shall be adjusted to ``pointer to function
3709 * returning type'', as in 6.3.2.1. */
3710 type = automatic_type_conversion(type);
3712 if (specifiers->is_inline && is_type_valid(type)) {
3713 errorf(pos, "'%N' declared 'inline'", param);
3716 /* §6.9.1:6 The declarations in the declaration list shall contain
3717 * no storage-class specifier other than register and no
3718 * initializations. */
3719 if (specifiers->thread_local || (
3720 specifiers->storage_class != STORAGE_CLASS_NONE &&
3721 specifiers->storage_class != STORAGE_CLASS_REGISTER)
3723 errorf(pos, "invalid storage class for '%N'", param);
3726 /* delay test for incomplete type, because we might have (void)
3727 * which is legal but incomplete... */
3732 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
3733 declarator_flags_t flags)
3735 parse_declarator_env_t env;
3736 memset(&env, 0, sizeof(env));
3737 env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
3739 construct_type_t *construct_type = parse_inner_declarator(&env);
3741 construct_declarator_type(construct_type, specifiers->type);
3742 type_t *type = skip_typeref(orig_type);
3744 if (construct_type != NULL) {
3745 obstack_free(&temp_obst, construct_type);
3748 attribute_t *attributes = parse_attributes(env.attributes);
3749 /* append (shared) specifier attribute behind attributes of this
3751 attribute_t **anchor = &attributes;
3752 while (*anchor != NULL)
3753 anchor = &(*anchor)->next;
3754 *anchor = specifiers->attributes;
3757 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
3758 entity = allocate_entity_zero(ENTITY_TYPEDEF, NAMESPACE_NORMAL, env.symbol, &env.source_position);
3759 entity->typedefe.type = orig_type;
3761 if (anonymous_entity != NULL) {
3762 if (is_type_compound(type)) {
3763 assert(anonymous_entity->compound.alias == NULL);
3764 assert(anonymous_entity->kind == ENTITY_STRUCT ||
3765 anonymous_entity->kind == ENTITY_UNION);
3766 anonymous_entity->compound.alias = entity;
3767 anonymous_entity = NULL;
3768 } else if (is_type_enum(type)) {
3769 assert(anonymous_entity->enume.alias == NULL);
3770 assert(anonymous_entity->kind == ENTITY_ENUM);
3771 anonymous_entity->enume.alias = entity;
3772 anonymous_entity = NULL;
3776 /* create a declaration type entity */
3777 source_position_t const *const pos = env.symbol ? &env.source_position : &specifiers->source_position;
3778 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
3779 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, env.symbol, pos);
3781 if (env.symbol != NULL) {
3782 if (specifiers->is_inline && is_type_valid(type)) {
3783 errorf(&env.source_position,
3784 "compound member '%Y' declared 'inline'", env.symbol);
3787 if (specifiers->thread_local ||
3788 specifiers->storage_class != STORAGE_CLASS_NONE) {
3789 errorf(&env.source_position,
3790 "compound member '%Y' must have no storage class",
3794 } else if (flags & DECL_IS_PARAMETER) {
3795 entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, env.symbol, pos);
3796 orig_type = semantic_parameter(&env.source_position, orig_type, specifiers, entity);
3797 } else if (is_type_function(type)) {
3798 entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, env.symbol, pos);
3799 entity->function.is_inline = specifiers->is_inline;
3800 entity->function.elf_visibility = default_visibility;
3801 entity->function.parameters = env.parameters;
3803 if (env.symbol != NULL) {
3804 /* this needs fixes for C++ */
3805 bool in_function_scope = current_function != NULL;
3807 if (specifiers->thread_local || (
3808 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3809 specifiers->storage_class != STORAGE_CLASS_NONE &&
3810 (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
3812 errorf(&env.source_position, "invalid storage class for '%N'", entity);
3816 entity = allocate_entity_zero(ENTITY_VARIABLE, NAMESPACE_NORMAL, env.symbol, pos);
3817 entity->variable.elf_visibility = default_visibility;
3818 entity->variable.thread_local = specifiers->thread_local;
3820 if (env.symbol != NULL) {
3821 if (specifiers->is_inline && is_type_valid(type)) {
3822 errorf(&env.source_position, "'%N' declared 'inline'", entity);
3825 bool invalid_storage_class = false;
3826 if (current_scope == file_scope) {
3827 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3828 specifiers->storage_class != STORAGE_CLASS_NONE &&
3829 specifiers->storage_class != STORAGE_CLASS_STATIC) {
3830 invalid_storage_class = true;
3833 if (specifiers->thread_local &&
3834 specifiers->storage_class == STORAGE_CLASS_NONE) {
3835 invalid_storage_class = true;
3838 if (invalid_storage_class) {
3839 errorf(&env.source_position, "invalid storage class for variable '%N'", entity);
3844 entity->declaration.type = orig_type;
3845 entity->declaration.alignment = get_type_alignment(orig_type);
3846 entity->declaration.modifiers = env.modifiers;
3847 entity->declaration.attributes = attributes;
3849 storage_class_t storage_class = specifiers->storage_class;
3850 entity->declaration.declared_storage_class = storage_class;
3852 if (storage_class == STORAGE_CLASS_NONE && current_function != NULL)
3853 storage_class = STORAGE_CLASS_AUTO;
3854 entity->declaration.storage_class = storage_class;
3857 if (attributes != NULL) {
3858 handle_entity_attributes(attributes, entity);
3861 if (entity->kind == ENTITY_FUNCTION && !freestanding) {
3862 adapt_special_functions(&entity->function);
3868 static type_t *parse_abstract_declarator(type_t *base_type)
3870 parse_declarator_env_t env;
3871 memset(&env, 0, sizeof(env));
3872 env.may_be_abstract = true;
3873 env.must_be_abstract = true;
3875 construct_type_t *construct_type = parse_inner_declarator(&env);
3877 type_t *result = construct_declarator_type(construct_type, base_type);
3878 if (construct_type != NULL) {
3879 obstack_free(&temp_obst, construct_type);
3881 result = handle_type_attributes(env.attributes, result);
3887 * Check if the declaration of main is suspicious. main should be a
3888 * function with external linkage, returning int, taking either zero
3889 * arguments, two, or three arguments of appropriate types, ie.
3891 * int main([ int argc, char **argv [, char **env ] ]).
3893 * @param decl the declaration to check
3894 * @param type the function type of the declaration
3896 static void check_main(const entity_t *entity)
3898 const source_position_t *pos = &entity->base.source_position;
3899 if (entity->kind != ENTITY_FUNCTION) {
3900 warningf(WARN_MAIN, pos, "'main' is not a function");
3904 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
3905 warningf(WARN_MAIN, pos, "'main' is normally a non-static function");
3908 type_t *type = skip_typeref(entity->declaration.type);
3909 assert(is_type_function(type));
3911 function_type_t const *const func_type = &type->function;
3912 type_t *const ret_type = func_type->return_type;
3913 if (!types_compatible(skip_typeref(ret_type), type_int)) {
3914 warningf(WARN_MAIN, pos, "return type of 'main' should be 'int', but is '%T'", ret_type);
3916 const function_parameter_t *parm = func_type->parameters;
3918 type_t *const first_type = skip_typeref(parm->type);
3919 type_t *const first_type_unqual = get_unqualified_type(first_type);
3920 if (!types_compatible(first_type_unqual, type_int)) {
3921 warningf(WARN_MAIN, pos, "first argument of 'main' should be 'int', but is '%T'", parm->type);
3925 type_t *const second_type = skip_typeref(parm->type);
3926 type_t *const second_type_unqual
3927 = get_unqualified_type(second_type);
3928 if (!types_compatible(second_type_unqual, type_char_ptr_ptr)) {
3929 warningf(WARN_MAIN, pos, "second argument of 'main' should be 'char**', but is '%T'", parm->type);
3933 type_t *const third_type = skip_typeref(parm->type);
3934 type_t *const third_type_unqual
3935 = get_unqualified_type(third_type);
3936 if (!types_compatible(third_type_unqual, type_char_ptr_ptr)) {
3937 warningf(WARN_MAIN, pos, "third argument of 'main' should be 'char**', but is '%T'", parm->type);
3941 goto warn_arg_count;
3945 warningf(WARN_MAIN, pos, "'main' takes only zero, two or three arguments");
3951 * Check if a symbol is the equal to "main".
3953 static bool is_sym_main(const symbol_t *const sym)
3955 return streq(sym->string, "main");
3958 static void error_redefined_as_different_kind(const source_position_t *pos,
3959 const entity_t *old, entity_kind_t new_kind)
3961 char const *const what = get_entity_kind_name(new_kind);
3962 source_position_t const *const ppos = &old->base.source_position;
3963 errorf(pos, "redeclaration of '%N' as %s (declared %P)", old, what, ppos);
3966 static bool is_entity_valid(entity_t *const ent)
3968 if (is_declaration(ent)) {
3969 return is_type_valid(skip_typeref(ent->declaration.type));
3970 } else if (ent->kind == ENTITY_TYPEDEF) {
3971 return is_type_valid(skip_typeref(ent->typedefe.type));
3976 static bool contains_attribute(const attribute_t *list, const attribute_t *attr)
3978 for (const attribute_t *tattr = list; tattr != NULL; tattr = tattr->next) {
3979 if (attributes_equal(tattr, attr))
3986 * test wether new_list contains any attributes not included in old_list
3988 static bool has_new_attributes(const attribute_t *old_list,
3989 const attribute_t *new_list)
3991 for (const attribute_t *attr = new_list; attr != NULL; attr = attr->next) {
3992 if (!contains_attribute(old_list, attr))
3999 * Merge in attributes from an attribute list (probably from a previous
4000 * declaration with the same name). Warning: destroys the old structure
4001 * of the attribute list - don't reuse attributes after this call.
4003 static void merge_in_attributes(declaration_t *decl, attribute_t *attributes)
4006 for (attribute_t *attr = attributes; attr != NULL; attr = next) {
4008 if (contains_attribute(decl->attributes, attr))
4011 /* move attribute to new declarations attributes list */
4012 attr->next = decl->attributes;
4013 decl->attributes = attr;
4018 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
4019 * for various problems that occur for multiple definitions
4021 entity_t *record_entity(entity_t *entity, const bool is_definition)
4023 const symbol_t *const symbol = entity->base.symbol;
4024 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
4025 const source_position_t *pos = &entity->base.source_position;
4027 /* can happen in error cases */
4031 entity_t *const previous_entity = get_entity(symbol, namespc);
4032 /* pushing the same entity twice will break the stack structure */
4033 assert(previous_entity != entity);
4035 if (entity->kind == ENTITY_FUNCTION) {
4036 type_t *const orig_type = entity->declaration.type;
4037 type_t *const type = skip_typeref(orig_type);
4039 assert(is_type_function(type));
4040 if (type->function.unspecified_parameters &&
4041 previous_entity == NULL &&
4042 !entity->declaration.implicit) {
4043 warningf(WARN_STRICT_PROTOTYPES, pos, "function declaration '%#N' is not a prototype", entity);
4046 if (current_scope == file_scope && is_sym_main(symbol)) {
4051 if (is_declaration(entity) &&
4052 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
4053 current_scope != file_scope &&
4054 !entity->declaration.implicit) {
4055 warningf(WARN_NESTED_EXTERNS, pos, "nested extern declaration of '%#N'", entity);
4058 if (previous_entity != NULL) {
4059 source_position_t const *const ppos = &previous_entity->base.source_position;
4061 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
4062 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
4063 assert(previous_entity->kind == ENTITY_PARAMETER);
4064 errorf(pos, "declaration of '%N' redeclares the '%N' (declared %P)", entity, previous_entity, ppos);
4068 if (previous_entity->base.parent_scope == current_scope) {
4069 if (previous_entity->kind != entity->kind) {
4070 if (is_entity_valid(previous_entity) && is_entity_valid(entity)) {
4071 error_redefined_as_different_kind(pos, previous_entity,
4076 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
4077 errorf(pos, "redeclaration of '%N' (declared %P)", entity, ppos);
4080 if (previous_entity->kind == ENTITY_TYPEDEF) {
4081 type_t *const type = skip_typeref(entity->typedefe.type);
4082 type_t *const prev_type
4083 = skip_typeref(previous_entity->typedefe.type);
4084 if (c_mode & _CXX) {
4085 /* C++ allows double typedef if they are identical
4086 * (after skipping typedefs) */
4087 if (type == prev_type)
4090 /* GCC extension: redef in system headers is allowed */
4091 if ((pos->is_system_header || ppos->is_system_header) &&
4092 types_compatible(type, prev_type))
4095 errorf(pos, "redefinition of '%N' (declared %P)",
4100 /* at this point we should have only VARIABLES or FUNCTIONS */
4101 assert(is_declaration(previous_entity) && is_declaration(entity));
4103 declaration_t *const prev_decl = &previous_entity->declaration;
4104 declaration_t *const decl = &entity->declaration;
4106 /* can happen for K&R style declarations */
4107 if (prev_decl->type == NULL &&
4108 previous_entity->kind == ENTITY_PARAMETER &&
4109 entity->kind == ENTITY_PARAMETER) {
4110 prev_decl->type = decl->type;
4111 prev_decl->storage_class = decl->storage_class;
4112 prev_decl->declared_storage_class = decl->declared_storage_class;
4113 prev_decl->modifiers = decl->modifiers;
4114 return previous_entity;
4117 type_t *const type = skip_typeref(decl->type);
4118 type_t *const prev_type = skip_typeref(prev_decl->type);
4120 if (!types_compatible(type, prev_type)) {
4121 errorf(pos, "declaration '%#N' is incompatible with '%#N' (declared %P)", entity, previous_entity, ppos);
4123 unsigned old_storage_class = prev_decl->storage_class;
4125 if (is_definition &&
4127 !(prev_decl->modifiers & DM_USED) &&
4128 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4129 warningf(WARN_REDUNDANT_DECLS, ppos, "unnecessary static forward declaration for '%#N'", previous_entity);
4132 storage_class_t new_storage_class = decl->storage_class;
4134 /* pretend no storage class means extern for function
4135 * declarations (except if the previous declaration is neither
4136 * none nor extern) */
4137 if (entity->kind == ENTITY_FUNCTION) {
4138 /* the previous declaration could have unspecified parameters or
4139 * be a typedef, so use the new type */
4140 if (prev_type->function.unspecified_parameters || is_definition)
4141 prev_decl->type = type;
4143 switch (old_storage_class) {
4144 case STORAGE_CLASS_NONE:
4145 old_storage_class = STORAGE_CLASS_EXTERN;
4148 case STORAGE_CLASS_EXTERN:
4149 if (is_definition) {
4150 if (prev_type->function.unspecified_parameters && !is_sym_main(symbol)) {
4151 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4153 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4154 new_storage_class = STORAGE_CLASS_EXTERN;
4161 } else if (is_type_incomplete(prev_type)) {
4162 prev_decl->type = type;
4165 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4166 new_storage_class == STORAGE_CLASS_EXTERN) {
4168 warn_redundant_declaration: ;
4170 = has_new_attributes(prev_decl->attributes,
4172 if (has_new_attrs) {
4173 merge_in_attributes(decl, prev_decl->attributes);
4174 } else if (!is_definition &&
4175 is_type_valid(prev_type) &&
4176 !pos->is_system_header) {
4177 warningf(WARN_REDUNDANT_DECLS, pos, "redundant declaration for '%Y' (declared %P)", symbol, ppos);
4179 } else if (current_function == NULL) {
4180 if (old_storage_class != STORAGE_CLASS_STATIC &&
4181 new_storage_class == STORAGE_CLASS_STATIC) {
4182 errorf(pos, "static declaration of '%Y' follows non-static declaration (declared %P)", symbol, ppos);
4183 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4184 prev_decl->storage_class = STORAGE_CLASS_NONE;
4185 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4187 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4189 goto error_redeclaration;
4190 goto warn_redundant_declaration;
4192 } else if (is_type_valid(prev_type)) {
4193 if (old_storage_class == new_storage_class) {
4194 error_redeclaration:
4195 errorf(pos, "redeclaration of '%Y' (declared %P)", symbol, ppos);
4197 errorf(pos, "redeclaration of '%Y' with different linkage (declared %P)", symbol, ppos);
4202 prev_decl->modifiers |= decl->modifiers;
4203 if (entity->kind == ENTITY_FUNCTION) {
4204 previous_entity->function.is_inline |= entity->function.is_inline;
4206 return previous_entity;
4210 if (is_warn_on(why = WARN_SHADOW) ||
4211 (is_warn_on(why = WARN_SHADOW_LOCAL) && previous_entity->base.parent_scope != file_scope)) {
4212 char const *const what = get_entity_kind_name(previous_entity->kind);
4213 warningf(why, pos, "'%N' shadows %s (declared %P)", entity, what, ppos);
4217 if (entity->kind == ENTITY_FUNCTION) {
4218 if (is_definition &&
4219 entity->declaration.storage_class != STORAGE_CLASS_STATIC &&
4220 !is_sym_main(symbol)) {
4221 if (is_warn_on(WARN_MISSING_PROTOTYPES)) {
4222 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4224 goto warn_missing_declaration;
4227 } else if (entity->kind == ENTITY_VARIABLE) {
4228 if (current_scope == file_scope &&
4229 entity->declaration.storage_class == STORAGE_CLASS_NONE &&
4230 !entity->declaration.implicit) {
4231 warn_missing_declaration:
4232 warningf(WARN_MISSING_DECLARATIONS, pos, "no previous declaration for '%#N'", entity);
4237 assert(entity->base.parent_scope == NULL);
4238 assert(current_scope != NULL);
4240 entity->base.parent_scope = current_scope;
4241 environment_push(entity);
4242 append_entity(current_scope, entity);
4247 static void parser_error_multiple_definition(entity_t *entity,
4248 const source_position_t *source_position)
4250 errorf(source_position, "multiple definition of '%Y' (declared %P)",
4251 entity->base.symbol, &entity->base.source_position);
4254 static bool is_declaration_specifier(const token_t *token)
4256 switch (token->kind) {
4260 return is_typedef_symbol(token->identifier.symbol);
4267 static void parse_init_declarator_rest(entity_t *entity)
4269 type_t *orig_type = type_error_type;
4271 if (entity->base.kind == ENTITY_TYPEDEF) {
4272 source_position_t const *const pos = &entity->base.source_position;
4273 errorf(pos, "'%N' is initialized (use __typeof__ instead)", entity);
4275 assert(is_declaration(entity));
4276 orig_type = entity->declaration.type;
4279 type_t *type = skip_typeref(orig_type);
4281 if (entity->kind == ENTITY_VARIABLE
4282 && entity->variable.initializer != NULL) {
4283 parser_error_multiple_definition(entity, HERE);
4287 declaration_t *const declaration = &entity->declaration;
4288 bool must_be_constant = false;
4289 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4290 entity->base.parent_scope == file_scope) {
4291 must_be_constant = true;
4294 if (is_type_function(type)) {
4295 source_position_t const *const pos = &entity->base.source_position;
4296 errorf(pos, "'%N' is initialized like a variable", entity);
4297 orig_type = type_error_type;
4300 parse_initializer_env_t env;
4301 env.type = orig_type;
4302 env.must_be_constant = must_be_constant;
4303 env.entity = entity;
4305 initializer_t *initializer = parse_initializer(&env);
4307 if (entity->kind == ENTITY_VARIABLE) {
4308 /* §6.7.5:22 array initializers for arrays with unknown size
4309 * determine the array type size */
4310 declaration->type = env.type;
4311 entity->variable.initializer = initializer;
4315 /* parse rest of a declaration without any declarator */
4316 static void parse_anonymous_declaration_rest(
4317 const declaration_specifiers_t *specifiers)
4320 anonymous_entity = NULL;
4322 source_position_t const *const pos = &specifiers->source_position;
4323 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4324 specifiers->thread_local) {
4325 warningf(WARN_OTHER, pos, "useless storage class in empty declaration");
4328 type_t *type = specifiers->type;
4329 switch (type->kind) {
4330 case TYPE_COMPOUND_STRUCT:
4331 case TYPE_COMPOUND_UNION: {
4332 if (type->compound.compound->base.symbol == NULL) {
4333 warningf(WARN_OTHER, pos, "unnamed struct/union that defines no instances");
4342 warningf(WARN_OTHER, pos, "empty declaration");
4347 static void check_variable_type_complete(entity_t *ent)
4349 if (ent->kind != ENTITY_VARIABLE)
4352 /* §6.7:7 If an identifier for an object is declared with no linkage, the
4353 * type for the object shall be complete [...] */
4354 declaration_t *decl = &ent->declaration;
4355 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4356 decl->storage_class == STORAGE_CLASS_STATIC)
4359 type_t *const type = skip_typeref(decl->type);
4360 if (!is_type_incomplete(type))
4363 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4364 * are given length one. */
4365 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4366 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4370 errorf(&ent->base.source_position, "variable '%#N' has incomplete type", ent);
4374 static void parse_declaration_rest(entity_t *ndeclaration,
4375 const declaration_specifiers_t *specifiers,
4376 parsed_declaration_func finished_declaration,
4377 declarator_flags_t flags)
4379 add_anchor_token(';');
4380 add_anchor_token(',');
4382 entity_t *entity = finished_declaration(ndeclaration, token.kind == '=');
4384 if (token.kind == '=') {
4385 parse_init_declarator_rest(entity);
4386 } else if (entity->kind == ENTITY_VARIABLE) {
4387 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
4388 * [...] where the extern specifier is explicitly used. */
4389 declaration_t *decl = &entity->declaration;
4390 if (decl->storage_class != STORAGE_CLASS_EXTERN &&
4391 is_type_reference(skip_typeref(decl->type))) {
4392 source_position_t const *const pos = &entity->base.source_position;
4393 errorf(pos, "reference '%#N' must be initialized", entity);
4397 check_variable_type_complete(entity);
4402 add_anchor_token('=');
4403 ndeclaration = parse_declarator(specifiers, flags);
4404 rem_anchor_token('=');
4406 rem_anchor_token(',');
4407 rem_anchor_token(';');
4408 expect(';', end_error);
4411 anonymous_entity = NULL;
4414 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4416 symbol_t *symbol = entity->base.symbol;
4420 assert(entity->base.namespc == NAMESPACE_NORMAL);
4421 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4422 if (previous_entity == NULL
4423 || previous_entity->base.parent_scope != current_scope) {
4424 errorf(&entity->base.source_position, "expected declaration of a function parameter, found '%Y'",
4429 if (is_definition) {
4430 errorf(HERE, "'%N' is initialised", entity);
4433 return record_entity(entity, false);
4436 static void parse_declaration(parsed_declaration_func finished_declaration,
4437 declarator_flags_t flags)
4439 add_anchor_token(';');
4440 declaration_specifiers_t specifiers;
4441 parse_declaration_specifiers(&specifiers);
4442 rem_anchor_token(';');
4444 if (token.kind == ';') {
4445 parse_anonymous_declaration_rest(&specifiers);
4447 entity_t *entity = parse_declarator(&specifiers, flags);
4448 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4453 static type_t *get_default_promoted_type(type_t *orig_type)
4455 type_t *result = orig_type;
4457 type_t *type = skip_typeref(orig_type);
4458 if (is_type_integer(type)) {
4459 result = promote_integer(type);
4460 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4461 result = type_double;
4467 static void parse_kr_declaration_list(entity_t *entity)
4469 if (entity->kind != ENTITY_FUNCTION)
4472 type_t *type = skip_typeref(entity->declaration.type);
4473 assert(is_type_function(type));
4474 if (!type->function.kr_style_parameters)
4477 add_anchor_token('{');
4479 PUSH_SCOPE(&entity->function.parameters);
4481 entity_t *parameter = entity->function.parameters.entities;
4482 for ( ; parameter != NULL; parameter = parameter->base.next) {
4483 assert(parameter->base.parent_scope == NULL);
4484 parameter->base.parent_scope = current_scope;
4485 environment_push(parameter);
4488 /* parse declaration list */
4490 switch (token.kind) {
4492 /* This covers symbols, which are no type, too, and results in
4493 * better error messages. The typical cases are misspelled type
4494 * names and missing includes. */
4496 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4506 /* update function type */
4507 type_t *new_type = duplicate_type(type);
4509 function_parameter_t *parameters = NULL;
4510 function_parameter_t **anchor = ¶meters;
4512 /* did we have an earlier prototype? */
4513 entity_t *proto_type = get_entity(entity->base.symbol, NAMESPACE_NORMAL);
4514 if (proto_type != NULL && proto_type->kind != ENTITY_FUNCTION)
4517 function_parameter_t *proto_parameter = NULL;
4518 if (proto_type != NULL) {
4519 type_t *proto_type_type = proto_type->declaration.type;
4520 proto_parameter = proto_type_type->function.parameters;
4521 /* If a K&R function definition has a variadic prototype earlier, then
4522 * make the function definition variadic, too. This should conform to
4523 * §6.7.5.3:15 and §6.9.1:8. */
4524 new_type->function.variadic = proto_type_type->function.variadic;
4526 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
4528 new_type->function.unspecified_parameters = true;
4531 bool need_incompatible_warning = false;
4532 parameter = entity->function.parameters.entities;
4533 for (; parameter != NULL; parameter = parameter->base.next,
4535 proto_parameter == NULL ? NULL : proto_parameter->next) {
4536 if (parameter->kind != ENTITY_PARAMETER)
4539 type_t *parameter_type = parameter->declaration.type;
4540 if (parameter_type == NULL) {
4541 source_position_t const* const pos = ¶meter->base.source_position;
4543 errorf(pos, "no type specified for function '%N'", parameter);
4544 parameter_type = type_error_type;
4546 warningf(WARN_IMPLICIT_INT, pos, "no type specified for function parameter '%N', using 'int'", parameter);
4547 parameter_type = type_int;
4549 parameter->declaration.type = parameter_type;
4552 semantic_parameter_incomplete(parameter);
4554 /* we need the default promoted types for the function type */
4555 type_t *not_promoted = parameter_type;
4556 parameter_type = get_default_promoted_type(parameter_type);
4558 /* gcc special: if the type of the prototype matches the unpromoted
4559 * type don't promote */
4560 if (!strict_mode && proto_parameter != NULL) {
4561 type_t *proto_p_type = skip_typeref(proto_parameter->type);
4562 type_t *promo_skip = skip_typeref(parameter_type);
4563 type_t *param_skip = skip_typeref(not_promoted);
4564 if (!types_compatible(proto_p_type, promo_skip)
4565 && types_compatible(proto_p_type, param_skip)) {
4567 need_incompatible_warning = true;
4568 parameter_type = not_promoted;
4571 function_parameter_t *const function_parameter
4572 = allocate_parameter(parameter_type);
4574 *anchor = function_parameter;
4575 anchor = &function_parameter->next;
4578 new_type->function.parameters = parameters;
4579 new_type = identify_new_type(new_type);
4581 if (need_incompatible_warning) {
4582 symbol_t const *const sym = entity->base.symbol;
4583 source_position_t const *const pos = &entity->base.source_position;
4584 source_position_t const *const ppos = &proto_type->base.source_position;
4585 warningf(WARN_OTHER, pos, "declaration '%#N' is incompatible with '%#T' (declared %P)", proto_type, new_type, sym, ppos);
4587 entity->declaration.type = new_type;
4589 rem_anchor_token('{');
4592 static bool first_err = true;
4595 * When called with first_err set, prints the name of the current function,
4598 static void print_in_function(void)
4602 char const *const file = current_function->base.base.source_position.input_name;
4603 diagnosticf("%s: In '%N':\n", file, (entity_t const*)current_function);
4608 * Check if all labels are defined in the current function.
4609 * Check if all labels are used in the current function.
4611 static void check_labels(void)
4613 for (const goto_statement_t *goto_statement = goto_first;
4614 goto_statement != NULL;
4615 goto_statement = goto_statement->next) {
4616 label_t *label = goto_statement->label;
4617 if (label->base.source_position.input_name == NULL) {
4618 print_in_function();
4619 source_position_t const *const pos = &goto_statement->base.source_position;
4620 errorf(pos, "'%N' used but not defined", (entity_t const*)label);
4624 if (is_warn_on(WARN_UNUSED_LABEL)) {
4625 for (const label_statement_t *label_statement = label_first;
4626 label_statement != NULL;
4627 label_statement = label_statement->next) {
4628 label_t *label = label_statement->label;
4630 if (! label->used) {
4631 print_in_function();
4632 source_position_t const *const pos = &label_statement->base.source_position;
4633 warningf(WARN_UNUSED_LABEL, pos, "'%N' defined but not used", (entity_t const*)label);
4639 static void warn_unused_entity(warning_t const why, entity_t *entity, entity_t *const last)
4641 entity_t const *const end = last != NULL ? last->base.next : NULL;
4642 for (; entity != end; entity = entity->base.next) {
4643 if (!is_declaration(entity))
4646 declaration_t *declaration = &entity->declaration;
4647 if (declaration->implicit)
4650 if (!declaration->used) {
4651 print_in_function();
4652 warningf(why, &entity->base.source_position, "'%N' is unused", entity);
4653 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
4654 print_in_function();
4655 warningf(why, &entity->base.source_position, "'%N' is never read", entity);
4660 static void check_unused_variables(statement_t *const stmt, void *const env)
4664 switch (stmt->kind) {
4665 case STATEMENT_DECLARATION: {
4666 declaration_statement_t const *const decls = &stmt->declaration;
4667 warn_unused_entity(WARN_UNUSED_VARIABLE, decls->declarations_begin, decls->declarations_end);
4672 warn_unused_entity(WARN_UNUSED_VARIABLE, stmt->fors.scope.entities, NULL);
4681 * Check declarations of current_function for unused entities.
4683 static void check_declarations(void)
4685 if (is_warn_on(WARN_UNUSED_PARAMETER)) {
4686 const scope_t *scope = ¤t_function->parameters;
4688 /* do not issue unused warnings for main */
4689 if (!is_sym_main(current_function->base.base.symbol)) {
4690 warn_unused_entity(WARN_UNUSED_PARAMETER, scope->entities, NULL);
4693 if (is_warn_on(WARN_UNUSED_VARIABLE)) {
4694 walk_statements(current_function->statement, check_unused_variables,
4699 static int determine_truth(expression_t const* const cond)
4702 is_constant_expression(cond) != EXPR_CLASS_CONSTANT ? 0 :
4703 fold_constant_to_bool(cond) ? 1 :
4707 static void check_reachable(statement_t *);
4708 static bool reaches_end;
4710 static bool expression_returns(expression_t const *const expr)
4712 switch (expr->kind) {
4714 expression_t const *const func = expr->call.function;
4715 type_t const *const type = skip_typeref(func->base.type);
4716 if (type->kind == TYPE_POINTER) {
4717 type_t const *const points_to
4718 = skip_typeref(type->pointer.points_to);
4719 if (points_to->kind == TYPE_FUNCTION
4720 && points_to->function.modifiers & DM_NORETURN)
4724 if (!expression_returns(func))
4727 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
4728 if (!expression_returns(arg->expression))
4735 case EXPR_REFERENCE:
4736 case EXPR_ENUM_CONSTANT:
4737 case EXPR_LITERAL_CASES:
4738 case EXPR_STRING_LITERAL:
4739 case EXPR_WIDE_STRING_LITERAL:
4740 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
4741 case EXPR_LABEL_ADDRESS:
4742 case EXPR_CLASSIFY_TYPE:
4743 case EXPR_SIZEOF: // TODO handle obscure VLA case
4746 case EXPR_BUILTIN_CONSTANT_P:
4747 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
4752 case EXPR_STATEMENT: {
4753 bool old_reaches_end = reaches_end;
4754 reaches_end = false;
4755 check_reachable(expr->statement.statement);
4756 bool returns = reaches_end;
4757 reaches_end = old_reaches_end;
4761 case EXPR_CONDITIONAL:
4762 // TODO handle constant expression
4764 if (!expression_returns(expr->conditional.condition))
4767 if (expr->conditional.true_expression != NULL
4768 && expression_returns(expr->conditional.true_expression))
4771 return expression_returns(expr->conditional.false_expression);
4774 return expression_returns(expr->select.compound);
4776 case EXPR_ARRAY_ACCESS:
4778 expression_returns(expr->array_access.array_ref) &&
4779 expression_returns(expr->array_access.index);
4782 return expression_returns(expr->va_starte.ap);
4785 return expression_returns(expr->va_arge.ap);
4788 return expression_returns(expr->va_copye.src);
4790 case EXPR_UNARY_CASES_MANDATORY:
4791 return expression_returns(expr->unary.value);
4793 case EXPR_UNARY_THROW:
4796 case EXPR_BINARY_CASES:
4797 // TODO handle constant lhs of && and ||
4799 expression_returns(expr->binary.left) &&
4800 expression_returns(expr->binary.right);
4803 panic("unhandled expression");
4806 static bool initializer_returns(initializer_t const *const init)
4808 switch (init->kind) {
4809 case INITIALIZER_VALUE:
4810 return expression_returns(init->value.value);
4812 case INITIALIZER_LIST: {
4813 initializer_t * const* i = init->list.initializers;
4814 initializer_t * const* const end = i + init->list.len;
4815 bool returns = true;
4816 for (; i != end; ++i) {
4817 if (!initializer_returns(*i))
4823 case INITIALIZER_STRING:
4824 case INITIALIZER_WIDE_STRING:
4825 case INITIALIZER_DESIGNATOR: // designators have no payload
4828 panic("unhandled initializer");
4831 static bool noreturn_candidate;
4833 static void check_reachable(statement_t *const stmt)
4835 if (stmt->base.reachable)
4837 if (stmt->kind != STATEMENT_DO_WHILE)
4838 stmt->base.reachable = true;
4840 statement_t *last = stmt;
4842 switch (stmt->kind) {
4843 case STATEMENT_ERROR:
4844 case STATEMENT_EMPTY:
4846 next = stmt->base.next;
4849 case STATEMENT_DECLARATION: {
4850 declaration_statement_t const *const decl = &stmt->declaration;
4851 entity_t const * ent = decl->declarations_begin;
4852 entity_t const *const last_decl = decl->declarations_end;
4854 for (;; ent = ent->base.next) {
4855 if (ent->kind == ENTITY_VARIABLE &&
4856 ent->variable.initializer != NULL &&
4857 !initializer_returns(ent->variable.initializer)) {
4860 if (ent == last_decl)
4864 next = stmt->base.next;
4868 case STATEMENT_COMPOUND:
4869 next = stmt->compound.statements;
4871 next = stmt->base.next;
4874 case STATEMENT_RETURN: {
4875 expression_t const *const val = stmt->returns.value;
4876 if (val == NULL || expression_returns(val))
4877 noreturn_candidate = false;
4881 case STATEMENT_IF: {
4882 if_statement_t const *const ifs = &stmt->ifs;
4883 expression_t const *const cond = ifs->condition;
4885 if (!expression_returns(cond))
4888 int const val = determine_truth(cond);
4891 check_reachable(ifs->true_statement);
4896 if (ifs->false_statement != NULL) {
4897 check_reachable(ifs->false_statement);
4901 next = stmt->base.next;
4905 case STATEMENT_SWITCH: {
4906 switch_statement_t const *const switchs = &stmt->switchs;
4907 expression_t const *const expr = switchs->expression;
4909 if (!expression_returns(expr))
4912 if (is_constant_expression(expr) == EXPR_CLASS_CONSTANT) {
4913 long const val = fold_constant_to_int(expr);
4914 case_label_statement_t * defaults = NULL;
4915 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4916 if (i->expression == NULL) {
4921 if (i->first_case <= val && val <= i->last_case) {
4922 check_reachable((statement_t*)i);
4927 if (defaults != NULL) {
4928 check_reachable((statement_t*)defaults);
4932 bool has_default = false;
4933 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4934 if (i->expression == NULL)
4937 check_reachable((statement_t*)i);
4944 next = stmt->base.next;
4948 case STATEMENT_EXPRESSION: {
4949 /* Check for noreturn function call */
4950 expression_t const *const expr = stmt->expression.expression;
4951 if (!expression_returns(expr))
4954 next = stmt->base.next;
4958 case STATEMENT_CONTINUE:
4959 for (statement_t *parent = stmt;;) {
4960 parent = parent->base.parent;
4961 if (parent == NULL) /* continue not within loop */
4965 switch (parent->kind) {
4966 case STATEMENT_WHILE: goto continue_while;
4967 case STATEMENT_DO_WHILE: goto continue_do_while;
4968 case STATEMENT_FOR: goto continue_for;
4974 case STATEMENT_BREAK:
4975 for (statement_t *parent = stmt;;) {
4976 parent = parent->base.parent;
4977 if (parent == NULL) /* break not within loop/switch */
4980 switch (parent->kind) {
4981 case STATEMENT_SWITCH:
4982 case STATEMENT_WHILE:
4983 case STATEMENT_DO_WHILE:
4986 next = parent->base.next;
4987 goto found_break_parent;
4995 case STATEMENT_COMPUTED_GOTO: {
4996 if (!expression_returns(stmt->computed_goto.expression))
4999 statement_t *parent = stmt->base.parent;
5000 if (parent == NULL) /* top level goto */
5006 case STATEMENT_GOTO:
5007 next = stmt->gotos.label->statement;
5008 if (next == NULL) /* missing label */
5012 case STATEMENT_LABEL:
5013 next = stmt->label.statement;
5016 case STATEMENT_CASE_LABEL:
5017 next = stmt->case_label.statement;
5020 case STATEMENT_WHILE: {
5021 while_statement_t const *const whiles = &stmt->whiles;
5022 expression_t const *const cond = whiles->condition;
5024 if (!expression_returns(cond))
5027 int const val = determine_truth(cond);
5030 check_reachable(whiles->body);
5035 next = stmt->base.next;
5039 case STATEMENT_DO_WHILE:
5040 next = stmt->do_while.body;
5043 case STATEMENT_FOR: {
5044 for_statement_t *const fors = &stmt->fors;
5046 if (fors->condition_reachable)
5048 fors->condition_reachable = true;
5050 expression_t const *const cond = fors->condition;
5055 } else if (expression_returns(cond)) {
5056 val = determine_truth(cond);
5062 check_reachable(fors->body);
5067 next = stmt->base.next;
5071 case STATEMENT_MS_TRY: {
5072 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5073 check_reachable(ms_try->try_statement);
5074 next = ms_try->final_statement;
5078 case STATEMENT_LEAVE: {
5079 statement_t *parent = stmt;
5081 parent = parent->base.parent;
5082 if (parent == NULL) /* __leave not within __try */
5085 if (parent->kind == STATEMENT_MS_TRY) {
5087 next = parent->ms_try.final_statement;
5095 panic("invalid statement kind");
5098 while (next == NULL) {
5099 next = last->base.parent;
5101 noreturn_candidate = false;
5103 type_t *const type = skip_typeref(current_function->base.type);
5104 assert(is_type_function(type));
5105 type_t *const ret = skip_typeref(type->function.return_type);
5106 if (!is_type_void(ret) &&
5107 is_type_valid(ret) &&
5108 !is_sym_main(current_function->base.base.symbol)) {
5109 source_position_t const *const pos = &stmt->base.source_position;
5110 warningf(WARN_RETURN_TYPE, pos, "control reaches end of non-void function");
5115 switch (next->kind) {
5116 case STATEMENT_ERROR:
5117 case STATEMENT_EMPTY:
5118 case STATEMENT_DECLARATION:
5119 case STATEMENT_EXPRESSION:
5121 case STATEMENT_RETURN:
5122 case STATEMENT_CONTINUE:
5123 case STATEMENT_BREAK:
5124 case STATEMENT_COMPUTED_GOTO:
5125 case STATEMENT_GOTO:
5126 case STATEMENT_LEAVE:
5127 panic("invalid control flow in function");
5129 case STATEMENT_COMPOUND:
5130 if (next->compound.stmt_expr) {
5136 case STATEMENT_SWITCH:
5137 case STATEMENT_LABEL:
5138 case STATEMENT_CASE_LABEL:
5140 next = next->base.next;
5143 case STATEMENT_WHILE: {
5145 if (next->base.reachable)
5147 next->base.reachable = true;
5149 while_statement_t const *const whiles = &next->whiles;
5150 expression_t const *const cond = whiles->condition;
5152 if (!expression_returns(cond))
5155 int const val = determine_truth(cond);
5158 check_reachable(whiles->body);
5164 next = next->base.next;
5168 case STATEMENT_DO_WHILE: {
5170 if (next->base.reachable)
5172 next->base.reachable = true;
5174 do_while_statement_t const *const dw = &next->do_while;
5175 expression_t const *const cond = dw->condition;
5177 if (!expression_returns(cond))
5180 int const val = determine_truth(cond);
5183 check_reachable(dw->body);
5189 next = next->base.next;
5193 case STATEMENT_FOR: {
5195 for_statement_t *const fors = &next->fors;
5197 fors->step_reachable = true;
5199 if (fors->condition_reachable)
5201 fors->condition_reachable = true;
5203 expression_t const *const cond = fors->condition;
5208 } else if (expression_returns(cond)) {
5209 val = determine_truth(cond);
5215 check_reachable(fors->body);
5221 next = next->base.next;
5225 case STATEMENT_MS_TRY:
5227 next = next->ms_try.final_statement;
5232 check_reachable(next);
5235 static void check_unreachable(statement_t* const stmt, void *const env)
5239 switch (stmt->kind) {
5240 case STATEMENT_DO_WHILE:
5241 if (!stmt->base.reachable) {
5242 expression_t const *const cond = stmt->do_while.condition;
5243 if (determine_truth(cond) >= 0) {
5244 source_position_t const *const pos = &cond->base.source_position;
5245 warningf(WARN_UNREACHABLE_CODE, pos, "condition of do-while-loop is unreachable");
5250 case STATEMENT_FOR: {
5251 for_statement_t const* const fors = &stmt->fors;
5253 // if init and step are unreachable, cond is unreachable, too
5254 if (!stmt->base.reachable && !fors->step_reachable) {
5255 goto warn_unreachable;
5257 if (!stmt->base.reachable && fors->initialisation != NULL) {
5258 source_position_t const *const pos = &fors->initialisation->base.source_position;
5259 warningf(WARN_UNREACHABLE_CODE, pos, "initialisation of for-statement is unreachable");
5262 if (!fors->condition_reachable && fors->condition != NULL) {
5263 source_position_t const *const pos = &fors->condition->base.source_position;
5264 warningf(WARN_UNREACHABLE_CODE, pos, "condition of for-statement is unreachable");
5267 if (!fors->step_reachable && fors->step != NULL) {
5268 source_position_t const *const pos = &fors->step->base.source_position;
5269 warningf(WARN_UNREACHABLE_CODE, pos, "step of for-statement is unreachable");
5275 case STATEMENT_COMPOUND:
5276 if (stmt->compound.statements != NULL)
5278 goto warn_unreachable;
5280 case STATEMENT_DECLARATION: {
5281 /* Only warn if there is at least one declarator with an initializer.
5282 * This typically occurs in switch statements. */
5283 declaration_statement_t const *const decl = &stmt->declaration;
5284 entity_t const * ent = decl->declarations_begin;
5285 entity_t const *const last = decl->declarations_end;
5287 for (;; ent = ent->base.next) {
5288 if (ent->kind == ENTITY_VARIABLE &&
5289 ent->variable.initializer != NULL) {
5290 goto warn_unreachable;
5300 if (!stmt->base.reachable) {
5301 source_position_t const *const pos = &stmt->base.source_position;
5302 warningf(WARN_UNREACHABLE_CODE, pos, "statement is unreachable");
5308 static bool is_main(entity_t *entity)
5310 static symbol_t *sym_main = NULL;
5311 if (sym_main == NULL) {
5312 sym_main = symbol_table_insert("main");
5315 if (entity->base.symbol != sym_main)
5317 /* must be in outermost scope */
5318 if (entity->base.parent_scope != file_scope)
5324 static void parse_external_declaration(void)
5326 /* function-definitions and declarations both start with declaration
5328 add_anchor_token(';');
5329 declaration_specifiers_t specifiers;
5330 parse_declaration_specifiers(&specifiers);
5331 rem_anchor_token(';');
5333 /* must be a declaration */
5334 if (token.kind == ';') {
5335 parse_anonymous_declaration_rest(&specifiers);
5339 add_anchor_token(',');
5340 add_anchor_token('=');
5341 add_anchor_token(';');
5342 add_anchor_token('{');
5344 /* declarator is common to both function-definitions and declarations */
5345 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
5347 rem_anchor_token('{');
5348 rem_anchor_token(';');
5349 rem_anchor_token('=');
5350 rem_anchor_token(',');
5352 /* must be a declaration */
5353 switch (token.kind) {
5357 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
5362 /* must be a function definition */
5363 parse_kr_declaration_list(ndeclaration);
5365 if (token.kind != '{') {
5366 parse_error_expected("while parsing function definition", '{', NULL);
5367 eat_until_matching_token(';');
5371 assert(is_declaration(ndeclaration));
5372 type_t *const orig_type = ndeclaration->declaration.type;
5373 type_t * type = skip_typeref(orig_type);
5375 if (!is_type_function(type)) {
5376 if (is_type_valid(type)) {
5377 errorf(HERE, "declarator '%#N' has a body but is not a function type", ndeclaration);
5383 source_position_t const *const pos = &ndeclaration->base.source_position;
5384 if (is_typeref(orig_type)) {
5386 errorf(pos, "type of function definition '%#N' is a typedef", ndeclaration);
5389 if (is_type_compound(skip_typeref(type->function.return_type))) {
5390 warningf(WARN_AGGREGATE_RETURN, pos, "'%N' returns an aggregate", ndeclaration);
5392 if (type->function.unspecified_parameters) {
5393 warningf(WARN_OLD_STYLE_DEFINITION, pos, "old-style definition of '%N'", ndeclaration);
5395 warningf(WARN_TRADITIONAL, pos, "traditional C rejects ISO C style definition of '%N'", ndeclaration);
5398 /* §6.7.5.3:14 a function definition with () means no
5399 * parameters (and not unspecified parameters) */
5400 if (type->function.unspecified_parameters &&
5401 type->function.parameters == NULL) {
5402 type_t *copy = duplicate_type(type);
5403 copy->function.unspecified_parameters = false;
5404 type = identify_new_type(copy);
5406 ndeclaration->declaration.type = type;
5409 entity_t *const entity = record_entity(ndeclaration, true);
5410 assert(entity->kind == ENTITY_FUNCTION);
5411 assert(ndeclaration->kind == ENTITY_FUNCTION);
5413 function_t *const function = &entity->function;
5414 if (ndeclaration != entity) {
5415 function->parameters = ndeclaration->function.parameters;
5417 assert(is_declaration(entity));
5418 type = skip_typeref(entity->declaration.type);
5420 PUSH_SCOPE(&function->parameters);
5422 entity_t *parameter = function->parameters.entities;
5423 for (; parameter != NULL; parameter = parameter->base.next) {
5424 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5425 parameter->base.parent_scope = current_scope;
5427 assert(parameter->base.parent_scope == NULL
5428 || parameter->base.parent_scope == current_scope);
5429 parameter->base.parent_scope = current_scope;
5430 if (parameter->base.symbol == NULL) {
5431 errorf(¶meter->base.source_position, "parameter name omitted");
5434 environment_push(parameter);
5437 if (function->statement != NULL) {
5438 parser_error_multiple_definition(entity, HERE);
5441 /* parse function body */
5442 int label_stack_top = label_top();
5443 function_t *old_current_function = current_function;
5444 entity_t *old_current_entity = current_entity;
5445 current_function = function;
5446 current_entity = entity;
5450 goto_anchor = &goto_first;
5452 label_anchor = &label_first;
5454 statement_t *const body = parse_compound_statement(false);
5455 function->statement = body;
5458 check_declarations();
5459 if (is_warn_on(WARN_RETURN_TYPE) ||
5460 is_warn_on(WARN_UNREACHABLE_CODE) ||
5461 (is_warn_on(WARN_MISSING_NORETURN) && !(function->base.modifiers & DM_NORETURN))) {
5462 noreturn_candidate = true;
5463 check_reachable(body);
5464 if (is_warn_on(WARN_UNREACHABLE_CODE))
5465 walk_statements(body, check_unreachable, NULL);
5466 if (noreturn_candidate &&
5467 !(function->base.modifiers & DM_NORETURN)) {
5468 source_position_t const *const pos = &body->base.source_position;
5469 warningf(WARN_MISSING_NORETURN, pos, "function '%#N' is candidate for attribute 'noreturn'", entity);
5473 if (is_main(entity) && enable_main_collect2_hack)
5474 prepare_main_collect2(entity);
5477 assert(current_function == function);
5478 assert(current_entity == entity);
5479 current_entity = old_current_entity;
5480 current_function = old_current_function;
5481 label_pop_to(label_stack_top);
5487 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
5489 entity_t *iter = compound->members.entities;
5490 for (; iter != NULL; iter = iter->base.next) {
5491 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5494 if (iter->base.symbol == symbol) {
5496 } else if (iter->base.symbol == NULL) {
5497 /* search in anonymous structs and unions */
5498 type_t *type = skip_typeref(iter->declaration.type);
5499 if (is_type_compound(type)) {
5500 if (find_compound_entry(type->compound.compound, symbol)
5511 static void check_deprecated(const source_position_t *source_position,
5512 const entity_t *entity)
5514 if (!is_declaration(entity))
5516 if ((entity->declaration.modifiers & DM_DEPRECATED) == 0)
5519 source_position_t const *const epos = &entity->base.source_position;
5520 char const *const msg = get_deprecated_string(entity->declaration.attributes);
5522 warningf(WARN_DEPRECATED_DECLARATIONS, source_position, "'%N' is deprecated (declared %P): \"%s\"", entity, epos, msg);
5524 warningf(WARN_DEPRECATED_DECLARATIONS, source_position, "'%N' is deprecated (declared %P)", entity, epos);
5529 static expression_t *create_select(const source_position_t *pos,
5531 type_qualifiers_t qualifiers,
5534 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
5536 check_deprecated(pos, entry);
5538 expression_t *select = allocate_expression_zero(EXPR_SELECT);
5539 select->select.compound = addr;
5540 select->select.compound_entry = entry;
5542 type_t *entry_type = entry->declaration.type;
5543 type_t *res_type = get_qualified_type(entry_type, qualifiers);
5545 /* bitfields need special treatment */
5546 if (entry->compound_member.bitfield) {
5547 unsigned bit_size = entry->compound_member.bit_size;
5548 /* if fewer bits than an int, convert to int (see §6.3.1.1) */
5549 if (bit_size < get_atomic_type_size(ATOMIC_TYPE_INT) * BITS_PER_BYTE) {
5550 res_type = type_int;
5554 /* we always do the auto-type conversions; the & and sizeof parser contains
5555 * code to revert this! */
5556 select->base.type = automatic_type_conversion(res_type);
5563 * Find entry with symbol in compound. Search anonymous structs and unions and
5564 * creates implicit select expressions for them.
5565 * Returns the adress for the innermost compound.
5567 static expression_t *find_create_select(const source_position_t *pos,
5569 type_qualifiers_t qualifiers,
5570 compound_t *compound, symbol_t *symbol)
5572 entity_t *iter = compound->members.entities;
5573 for (; iter != NULL; iter = iter->base.next) {
5574 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5577 symbol_t *iter_symbol = iter->base.symbol;
5578 if (iter_symbol == NULL) {
5579 type_t *type = iter->declaration.type;
5580 if (type->kind != TYPE_COMPOUND_STRUCT
5581 && type->kind != TYPE_COMPOUND_UNION)
5584 compound_t *sub_compound = type->compound.compound;
5586 if (find_compound_entry(sub_compound, symbol) == NULL)
5589 expression_t *sub_addr = create_select(pos, addr, qualifiers, iter);
5590 sub_addr->base.source_position = *pos;
5591 sub_addr->base.implicit = true;
5592 return find_create_select(pos, sub_addr, qualifiers, sub_compound,
5596 if (iter_symbol == symbol) {
5597 return create_select(pos, addr, qualifiers, iter);
5604 static void parse_bitfield_member(entity_t *entity)
5608 expression_t *size = parse_constant_expression();
5611 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5612 type_t *type = entity->declaration.type;
5613 if (!is_type_integer(skip_typeref(type))) {
5614 errorf(HERE, "bitfield base type '%T' is not an integer type",
5618 if (is_constant_expression(size) != EXPR_CLASS_CONSTANT) {
5619 /* error already reported by parse_constant_expression */
5620 size_long = get_type_size(type) * 8;
5622 size_long = fold_constant_to_int(size);
5624 const symbol_t *symbol = entity->base.symbol;
5625 const symbol_t *user_symbol
5626 = symbol == NULL ? sym_anonymous : symbol;
5627 unsigned bit_size = get_type_size(type) * 8;
5628 if (size_long < 0) {
5629 errorf(HERE, "negative width in bit-field '%Y'", user_symbol);
5630 } else if (size_long == 0 && symbol != NULL) {
5631 errorf(HERE, "zero width for bit-field '%Y'", user_symbol);
5632 } else if (bit_size > 0 && (unsigned)size_long > bit_size) {
5633 errorf(HERE, "width of bitfield '%Y' exceeds its type",
5636 /* hope that people don't invent crazy types with more bits
5637 * than our struct can hold */
5639 (1 << sizeof(entity->compound_member.bit_size)*8));
5643 entity->compound_member.bitfield = true;
5644 entity->compound_member.bit_size = (unsigned char)size_long;
5647 static void parse_compound_declarators(compound_t *compound,
5648 const declaration_specifiers_t *specifiers)
5653 if (token.kind == ':') {
5654 /* anonymous bitfield */
5655 type_t *type = specifiers->type;
5656 entity_t *const entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, NULL, HERE);
5657 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
5658 entity->declaration.storage_class = STORAGE_CLASS_NONE;
5659 entity->declaration.type = type;
5661 parse_bitfield_member(entity);
5663 attribute_t *attributes = parse_attributes(NULL);
5664 attribute_t **anchor = &attributes;
5665 while (*anchor != NULL)
5666 anchor = &(*anchor)->next;
5667 *anchor = specifiers->attributes;
5668 if (attributes != NULL) {
5669 handle_entity_attributes(attributes, entity);
5671 entity->declaration.attributes = attributes;
5673 append_entity(&compound->members, entity);
5675 entity = parse_declarator(specifiers,
5676 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
5677 source_position_t const *const pos = &entity->base.source_position;
5678 if (entity->kind == ENTITY_TYPEDEF) {
5679 errorf(pos, "typedef not allowed as compound member");
5681 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5683 /* make sure we don't define a symbol multiple times */
5684 symbol_t *symbol = entity->base.symbol;
5685 if (symbol != NULL) {
5686 entity_t *prev = find_compound_entry(compound, symbol);
5688 source_position_t const *const ppos = &prev->base.source_position;
5689 errorf(pos, "multiple declarations of symbol '%Y' (declared %P)", symbol, ppos);
5693 if (token.kind == ':') {
5694 parse_bitfield_member(entity);
5696 attribute_t *attributes = parse_attributes(NULL);
5697 handle_entity_attributes(attributes, entity);
5699 type_t *orig_type = entity->declaration.type;
5700 type_t *type = skip_typeref(orig_type);
5701 if (is_type_function(type)) {
5702 errorf(pos, "'%N' must not have function type '%T'", entity, orig_type);
5703 } else if (is_type_incomplete(type)) {
5704 /* §6.7.2.1:16 flexible array member */
5705 if (!is_type_array(type) ||
5706 token.kind != ';' ||
5707 look_ahead(1)->kind != '}') {
5708 errorf(pos, "'%N' has incomplete type '%T'", entity, orig_type);
5709 } else if (compound->members.entities == NULL) {
5710 errorf(pos, "flexible array member in otherwise empty struct");
5715 append_entity(&compound->members, entity);
5718 } while (next_if(','));
5719 expect(';', end_error);
5722 anonymous_entity = NULL;
5725 static void parse_compound_type_entries(compound_t *compound)
5728 add_anchor_token('}');
5731 switch (token.kind) {
5733 case T___extension__:
5734 case T_IDENTIFIER: {
5736 declaration_specifiers_t specifiers;
5737 parse_declaration_specifiers(&specifiers);
5738 parse_compound_declarators(compound, &specifiers);
5744 rem_anchor_token('}');
5745 expect('}', end_error);
5748 compound->complete = true;
5754 static type_t *parse_typename(void)
5756 declaration_specifiers_t specifiers;
5757 parse_declaration_specifiers(&specifiers);
5758 if (specifiers.storage_class != STORAGE_CLASS_NONE
5759 || specifiers.thread_local) {
5760 /* TODO: improve error message, user does probably not know what a
5761 * storage class is...
5763 errorf(&specifiers.source_position, "typename must not have a storage class");
5766 type_t *result = parse_abstract_declarator(specifiers.type);
5774 typedef expression_t* (*parse_expression_function)(void);
5775 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
5777 typedef struct expression_parser_function_t expression_parser_function_t;
5778 struct expression_parser_function_t {
5779 parse_expression_function parser;
5780 precedence_t infix_precedence;
5781 parse_expression_infix_function infix_parser;
5784 static expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5787 * Prints an error message if an expression was expected but not read
5789 static expression_t *expected_expression_error(void)
5791 /* skip the error message if the error token was read */
5792 if (token.kind != T_ERROR) {
5793 errorf(HERE, "expected expression, got token %K", &token);
5797 return create_error_expression();
5800 static type_t *get_string_type(void)
5802 return is_warn_on(WARN_WRITE_STRINGS) ? type_const_char_ptr : type_char_ptr;
5805 static type_t *get_wide_string_type(void)
5807 return is_warn_on(WARN_WRITE_STRINGS) ? type_const_wchar_t_ptr : type_wchar_t_ptr;
5811 * Parse a string constant.
5813 static expression_t *parse_string_literal(void)
5815 source_position_t begin = token.base.source_position;
5816 string_t res = token.string.string;
5817 bool is_wide = (token.kind == T_WIDE_STRING_LITERAL);
5820 while (token.kind == T_STRING_LITERAL
5821 || token.kind == T_WIDE_STRING_LITERAL) {
5822 warn_string_concat(&token.base.source_position);
5823 res = concat_strings(&res, &token.string.string);
5825 is_wide |= token.kind == T_WIDE_STRING_LITERAL;
5828 expression_t *literal;
5830 literal = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
5831 literal->base.type = get_wide_string_type();
5833 literal = allocate_expression_zero(EXPR_STRING_LITERAL);
5834 literal->base.type = get_string_type();
5836 literal->base.source_position = begin;
5837 literal->literal.value = res;
5843 * Parse a boolean constant.
5845 static expression_t *parse_boolean_literal(bool value)
5847 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_BOOLEAN);
5848 literal->base.type = type_bool;
5849 literal->literal.value.begin = value ? "true" : "false";
5850 literal->literal.value.size = value ? 4 : 5;
5856 static void warn_traditional_suffix(void)
5858 warningf(WARN_TRADITIONAL, HERE, "traditional C rejects the '%S' suffix",
5859 &token.number.suffix);
5862 static void check_integer_suffix(void)
5864 const string_t *suffix = &token.number.suffix;
5865 if (suffix->size == 0)
5868 bool not_traditional = false;
5869 const char *c = suffix->begin;
5870 if (*c == 'l' || *c == 'L') {
5873 not_traditional = true;
5875 if (*c == 'u' || *c == 'U') {
5878 } else if (*c == 'u' || *c == 'U') {
5879 not_traditional = true;
5882 } else if (*c == 'u' || *c == 'U') {
5883 not_traditional = true;
5885 if (*c == 'l' || *c == 'L') {
5893 errorf(&token.base.source_position,
5894 "invalid suffix '%S' on integer constant", suffix);
5895 } else if (not_traditional) {
5896 warn_traditional_suffix();
5900 static type_t *check_floatingpoint_suffix(void)
5902 const string_t *suffix = &token.number.suffix;
5903 type_t *type = type_double;
5904 if (suffix->size == 0)
5907 bool not_traditional = false;
5908 const char *c = suffix->begin;
5909 if (*c == 'f' || *c == 'F') {
5912 } else if (*c == 'l' || *c == 'L') {
5914 type = type_long_double;
5917 errorf(&token.base.source_position,
5918 "invalid suffix '%S' on floatingpoint constant", suffix);
5919 } else if (not_traditional) {
5920 warn_traditional_suffix();
5927 * Parse an integer constant.
5929 static expression_t *parse_number_literal(void)
5931 expression_kind_t kind;
5934 switch (token.kind) {
5936 kind = EXPR_LITERAL_INTEGER;
5937 check_integer_suffix();
5940 case T_INTEGER_OCTAL:
5941 kind = EXPR_LITERAL_INTEGER_OCTAL;
5942 check_integer_suffix();
5945 case T_INTEGER_HEXADECIMAL:
5946 kind = EXPR_LITERAL_INTEGER_HEXADECIMAL;
5947 check_integer_suffix();
5950 case T_FLOATINGPOINT:
5951 kind = EXPR_LITERAL_FLOATINGPOINT;
5952 type = check_floatingpoint_suffix();
5954 case T_FLOATINGPOINT_HEXADECIMAL:
5955 kind = EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL;
5956 type = check_floatingpoint_suffix();
5959 panic("unexpected token type in parse_number_literal");
5962 expression_t *literal = allocate_expression_zero(kind);
5963 literal->base.type = type;
5964 literal->literal.value = token.number.number;
5965 literal->literal.suffix = token.number.suffix;
5968 /* integer type depends on the size of the number and the size
5969 * representable by the types. The backend/codegeneration has to determine
5972 determine_literal_type(&literal->literal);
5977 * Parse a character constant.
5979 static expression_t *parse_character_constant(void)
5981 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_CHARACTER);
5982 literal->base.type = c_mode & _CXX ? type_char : type_int;
5983 literal->literal.value = token.string.string;
5985 size_t len = literal->literal.value.size;
5987 if (!GNU_MODE && !(c_mode & _C99)) {
5988 errorf(HERE, "more than 1 character in character constant");
5990 literal->base.type = type_int;
5991 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
6000 * Parse a wide character constant.
6002 static expression_t *parse_wide_character_constant(void)
6004 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_WIDE_CHARACTER);
6005 literal->base.type = type_int;
6006 literal->literal.value = token.string.string;
6008 size_t len = wstrlen(&literal->literal.value);
6010 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
6017 static entity_t *create_implicit_function(symbol_t *symbol, source_position_t const *const pos)
6019 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
6020 ntype->function.return_type = type_int;
6021 ntype->function.unspecified_parameters = true;
6022 ntype->function.linkage = LINKAGE_C;
6023 type_t *type = identify_new_type(ntype);
6025 entity_t *const entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, symbol, pos);
6026 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
6027 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
6028 entity->declaration.type = type;
6029 entity->declaration.implicit = true;
6031 if (current_scope != NULL)
6032 record_entity(entity, false);
6038 * Performs automatic type cast as described in §6.3.2.1.
6040 * @param orig_type the original type
6042 static type_t *automatic_type_conversion(type_t *orig_type)
6044 type_t *type = skip_typeref(orig_type);
6045 if (is_type_array(type)) {
6046 array_type_t *array_type = &type->array;
6047 type_t *element_type = array_type->element_type;
6048 unsigned qualifiers = array_type->base.qualifiers;
6050 return make_pointer_type(element_type, qualifiers);
6053 if (is_type_function(type)) {
6054 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6061 * reverts the automatic casts of array to pointer types and function
6062 * to function-pointer types as defined §6.3.2.1
6064 type_t *revert_automatic_type_conversion(const expression_t *expression)
6066 switch (expression->kind) {
6067 case EXPR_REFERENCE: {
6068 entity_t *entity = expression->reference.entity;
6069 if (is_declaration(entity)) {
6070 return entity->declaration.type;
6071 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6072 return entity->enum_value.enum_type;
6074 panic("no declaration or enum in reference");
6079 entity_t *entity = expression->select.compound_entry;
6080 assert(is_declaration(entity));
6081 type_t *type = entity->declaration.type;
6082 return get_qualified_type(type, expression->base.type->base.qualifiers);
6085 case EXPR_UNARY_DEREFERENCE: {
6086 const expression_t *const value = expression->unary.value;
6087 type_t *const type = skip_typeref(value->base.type);
6088 if (!is_type_pointer(type))
6089 return type_error_type;
6090 return type->pointer.points_to;
6093 case EXPR_ARRAY_ACCESS: {
6094 const expression_t *array_ref = expression->array_access.array_ref;
6095 type_t *type_left = skip_typeref(array_ref->base.type);
6096 if (!is_type_pointer(type_left))
6097 return type_error_type;
6098 return type_left->pointer.points_to;
6101 case EXPR_STRING_LITERAL: {
6102 size_t size = expression->string_literal.value.size;
6103 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6106 case EXPR_WIDE_STRING_LITERAL: {
6107 size_t size = wstrlen(&expression->string_literal.value);
6108 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6111 case EXPR_COMPOUND_LITERAL:
6112 return expression->compound_literal.type;
6117 return expression->base.type;
6121 * Find an entity matching a symbol in a scope.
6122 * Uses current scope if scope is NULL
6124 static entity_t *lookup_entity(const scope_t *scope, symbol_t *symbol,
6125 namespace_tag_t namespc)
6127 if (scope == NULL) {
6128 return get_entity(symbol, namespc);
6131 /* we should optimize here, if scope grows above a certain size we should
6132 construct a hashmap here... */
6133 entity_t *entity = scope->entities;
6134 for ( ; entity != NULL; entity = entity->base.next) {
6135 if (entity->base.symbol == symbol
6136 && (namespace_tag_t)entity->base.namespc == namespc)
6143 static entity_t *parse_qualified_identifier(void)
6145 /* namespace containing the symbol */
6147 source_position_t pos;
6148 const scope_t *lookup_scope = NULL;
6150 if (next_if(T_COLONCOLON))
6151 lookup_scope = &unit->scope;
6155 symbol = expect_identifier("while parsing identifier", &pos);
6157 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6160 entity = lookup_entity(lookup_scope, symbol, NAMESPACE_NORMAL);
6162 if (!next_if(T_COLONCOLON))
6165 switch (entity->kind) {
6166 case ENTITY_NAMESPACE:
6167 lookup_scope = &entity->namespacee.members;
6172 lookup_scope = &entity->compound.members;
6175 errorf(&pos, "'%Y' must be a namespace, class, struct or union (but is a %s)",
6176 symbol, get_entity_kind_name(entity->kind));
6178 /* skip further qualifications */
6179 while (next_if(T_IDENTIFIER) && next_if(T_COLONCOLON)) {}
6181 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6185 if (entity == NULL) {
6186 if (!strict_mode && token.kind == '(') {
6187 /* an implicitly declared function */
6188 warningf(WARN_IMPLICIT_FUNCTION_DECLARATION, &pos,
6189 "implicit declaration of function '%Y'", symbol);
6190 entity = create_implicit_function(symbol, &pos);
6192 errorf(&pos, "unknown identifier '%Y' found.", symbol);
6193 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6200 static expression_t *parse_reference(void)
6202 source_position_t const pos = token.base.source_position;
6203 entity_t *const entity = parse_qualified_identifier();
6206 if (is_declaration(entity)) {
6207 orig_type = entity->declaration.type;
6208 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6209 orig_type = entity->enum_value.enum_type;
6211 panic("expected declaration or enum value in reference");
6214 /* we always do the auto-type conversions; the & and sizeof parser contains
6215 * code to revert this! */
6216 type_t *type = automatic_type_conversion(orig_type);
6218 expression_kind_t kind = EXPR_REFERENCE;
6219 if (entity->kind == ENTITY_ENUM_VALUE)
6220 kind = EXPR_ENUM_CONSTANT;
6222 expression_t *expression = allocate_expression_zero(kind);
6223 expression->base.source_position = pos;
6224 expression->base.type = type;
6225 expression->reference.entity = entity;
6227 /* this declaration is used */
6228 if (is_declaration(entity)) {
6229 entity->declaration.used = true;
6232 if (entity->base.parent_scope != file_scope
6233 && (current_function != NULL
6234 && entity->base.parent_scope->depth < current_function->parameters.depth)
6235 && (entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER)) {
6236 if (entity->kind == ENTITY_VARIABLE) {
6237 /* access of a variable from an outer function */
6238 entity->variable.address_taken = true;
6239 } else if (entity->kind == ENTITY_PARAMETER) {
6240 entity->parameter.address_taken = true;
6242 current_function->need_closure = true;
6245 check_deprecated(&pos, entity);
6250 static bool semantic_cast(expression_t *cast)
6252 expression_t *expression = cast->unary.value;
6253 type_t *orig_dest_type = cast->base.type;
6254 type_t *orig_type_right = expression->base.type;
6255 type_t const *dst_type = skip_typeref(orig_dest_type);
6256 type_t const *src_type = skip_typeref(orig_type_right);
6257 source_position_t const *pos = &cast->base.source_position;
6259 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6260 if (is_type_void(dst_type))
6263 /* only integer and pointer can be casted to pointer */
6264 if (is_type_pointer(dst_type) &&
6265 !is_type_pointer(src_type) &&
6266 !is_type_integer(src_type) &&
6267 is_type_valid(src_type)) {
6268 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6272 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6273 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6277 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6278 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6282 if (is_type_pointer(src_type) && is_type_pointer(dst_type)) {
6283 type_t *src = skip_typeref(src_type->pointer.points_to);
6284 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6285 unsigned missing_qualifiers =
6286 src->base.qualifiers & ~dst->base.qualifiers;
6287 if (missing_qualifiers != 0) {
6288 warningf(WARN_CAST_QUAL, pos, "cast discards qualifiers '%Q' in pointer target type of '%T'", missing_qualifiers, orig_type_right);
6294 static expression_t *parse_compound_literal(source_position_t const *const pos, type_t *type)
6296 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6297 expression->base.source_position = *pos;
6299 parse_initializer_env_t env;
6302 env.must_be_constant = false;
6303 initializer_t *initializer = parse_initializer(&env);
6306 expression->compound_literal.initializer = initializer;
6307 expression->compound_literal.type = type;
6308 expression->base.type = automatic_type_conversion(type);
6314 * Parse a cast expression.
6316 static expression_t *parse_cast(void)
6318 source_position_t const pos = *HERE;
6321 add_anchor_token(')');
6323 type_t *type = parse_typename();
6325 rem_anchor_token(')');
6326 expect(')', end_error);
6328 if (token.kind == '{') {
6329 return parse_compound_literal(&pos, type);
6332 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6333 cast->base.source_position = pos;
6335 expression_t *value = parse_subexpression(PREC_CAST);
6336 cast->base.type = type;
6337 cast->unary.value = value;
6339 if (! semantic_cast(cast)) {
6340 /* TODO: record the error in the AST. else it is impossible to detect it */
6345 return create_error_expression();
6349 * Parse a statement expression.
6351 static expression_t *parse_statement_expression(void)
6353 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6356 add_anchor_token(')');
6358 statement_t *statement = parse_compound_statement(true);
6359 statement->compound.stmt_expr = true;
6360 expression->statement.statement = statement;
6362 /* find last statement and use its type */
6363 type_t *type = type_void;
6364 const statement_t *stmt = statement->compound.statements;
6366 while (stmt->base.next != NULL)
6367 stmt = stmt->base.next;
6369 if (stmt->kind == STATEMENT_EXPRESSION) {
6370 type = stmt->expression.expression->base.type;
6373 source_position_t const *const pos = &expression->base.source_position;
6374 warningf(WARN_OTHER, pos, "empty statement expression ({})");
6376 expression->base.type = type;
6378 rem_anchor_token(')');
6379 expect(')', end_error);
6386 * Parse a parenthesized expression.
6388 static expression_t *parse_parenthesized_expression(void)
6390 token_t const* const la1 = look_ahead(1);
6391 switch (la1->kind) {
6393 /* gcc extension: a statement expression */
6394 return parse_statement_expression();
6397 if (is_typedef_symbol(la1->identifier.symbol)) {
6399 return parse_cast();
6404 add_anchor_token(')');
6405 expression_t *result = parse_expression();
6406 result->base.parenthesized = true;
6407 rem_anchor_token(')');
6408 expect(')', end_error);
6414 static expression_t *parse_function_keyword(void)
6418 if (current_function == NULL) {
6419 errorf(HERE, "'__func__' used outside of a function");
6422 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6423 expression->base.type = type_char_ptr;
6424 expression->funcname.kind = FUNCNAME_FUNCTION;
6431 static expression_t *parse_pretty_function_keyword(void)
6433 if (current_function == NULL) {
6434 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6437 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6438 expression->base.type = type_char_ptr;
6439 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6441 eat(T___PRETTY_FUNCTION__);
6446 static expression_t *parse_funcsig_keyword(void)
6448 if (current_function == NULL) {
6449 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6452 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6453 expression->base.type = type_char_ptr;
6454 expression->funcname.kind = FUNCNAME_FUNCSIG;
6461 static expression_t *parse_funcdname_keyword(void)
6463 if (current_function == NULL) {
6464 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6467 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6468 expression->base.type = type_char_ptr;
6469 expression->funcname.kind = FUNCNAME_FUNCDNAME;
6471 eat(T___FUNCDNAME__);
6476 static designator_t *parse_designator(void)
6478 designator_t *const result = allocate_ast_zero(sizeof(result[0]));
6479 result->symbol = expect_identifier("while parsing member designator", &result->source_position);
6480 if (!result->symbol)
6483 designator_t *last_designator = result;
6486 designator_t *const designator = allocate_ast_zero(sizeof(result[0]));
6487 designator->symbol = expect_identifier("while parsing member designator", &designator->source_position);
6488 if (!designator->symbol)
6491 last_designator->next = designator;
6492 last_designator = designator;
6496 add_anchor_token(']');
6497 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6498 designator->source_position = *HERE;
6499 designator->array_index = parse_expression();
6500 rem_anchor_token(']');
6501 expect(']', end_error);
6502 if (designator->array_index == NULL) {
6506 last_designator->next = designator;
6507 last_designator = designator;
6519 * Parse the __builtin_offsetof() expression.
6521 static expression_t *parse_offsetof(void)
6523 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6524 expression->base.type = type_size_t;
6526 eat(T___builtin_offsetof);
6528 expect('(', end_error);
6529 add_anchor_token(',');
6530 type_t *type = parse_typename();
6531 rem_anchor_token(',');
6532 expect(',', end_error);
6533 add_anchor_token(')');
6534 designator_t *designator = parse_designator();
6535 rem_anchor_token(')');
6536 expect(')', end_error);
6538 expression->offsetofe.type = type;
6539 expression->offsetofe.designator = designator;
6542 memset(&path, 0, sizeof(path));
6543 path.top_type = type;
6544 path.path = NEW_ARR_F(type_path_entry_t, 0);
6546 descend_into_subtype(&path);
6548 if (!walk_designator(&path, designator, true)) {
6549 return create_error_expression();
6552 DEL_ARR_F(path.path);
6556 return create_error_expression();
6560 * Parses a _builtin_va_start() expression.
6562 static expression_t *parse_va_start(void)
6564 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6566 eat(T___builtin_va_start);
6568 expect('(', end_error);
6569 add_anchor_token(',');
6570 expression->va_starte.ap = parse_assignment_expression();
6571 rem_anchor_token(',');
6572 expect(',', end_error);
6573 expression_t *const expr = parse_assignment_expression();
6574 if (expr->kind == EXPR_REFERENCE) {
6575 entity_t *const entity = expr->reference.entity;
6576 if (!current_function->base.type->function.variadic) {
6577 errorf(&expr->base.source_position,
6578 "'va_start' used in non-variadic function");
6579 } else if (entity->base.parent_scope != ¤t_function->parameters ||
6580 entity->base.next != NULL ||
6581 entity->kind != ENTITY_PARAMETER) {
6582 errorf(&expr->base.source_position,
6583 "second argument of 'va_start' must be last parameter of the current function");
6585 expression->va_starte.parameter = &entity->variable;
6587 expect(')', end_error);
6590 expect(')', end_error);
6592 return create_error_expression();
6596 * Parses a __builtin_va_arg() expression.
6598 static expression_t *parse_va_arg(void)
6600 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6602 eat(T___builtin_va_arg);
6604 expect('(', end_error);
6606 ap.expression = parse_assignment_expression();
6607 expression->va_arge.ap = ap.expression;
6608 check_call_argument(type_valist, &ap, 1);
6610 expect(',', end_error);
6611 expression->base.type = parse_typename();
6612 expect(')', end_error);
6616 return create_error_expression();
6620 * Parses a __builtin_va_copy() expression.
6622 static expression_t *parse_va_copy(void)
6624 expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
6626 eat(T___builtin_va_copy);
6628 expect('(', end_error);
6629 expression_t *dst = parse_assignment_expression();
6630 assign_error_t error = semantic_assign(type_valist, dst);
6631 report_assign_error(error, type_valist, dst, "call argument 1",
6632 &dst->base.source_position);
6633 expression->va_copye.dst = dst;
6635 expect(',', end_error);
6637 call_argument_t src;
6638 src.expression = parse_assignment_expression();
6639 check_call_argument(type_valist, &src, 2);
6640 expression->va_copye.src = src.expression;
6641 expect(')', end_error);
6645 return create_error_expression();
6649 * Parses a __builtin_constant_p() expression.
6651 static expression_t *parse_builtin_constant(void)
6653 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6655 eat(T___builtin_constant_p);
6657 expect('(', end_error);
6658 add_anchor_token(')');
6659 expression->builtin_constant.value = parse_assignment_expression();
6660 rem_anchor_token(')');
6661 expect(')', end_error);
6662 expression->base.type = type_int;
6666 return create_error_expression();
6670 * Parses a __builtin_types_compatible_p() expression.
6672 static expression_t *parse_builtin_types_compatible(void)
6674 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
6676 eat(T___builtin_types_compatible_p);
6678 expect('(', end_error);
6679 add_anchor_token(')');
6680 add_anchor_token(',');
6681 expression->builtin_types_compatible.left = parse_typename();
6682 rem_anchor_token(',');
6683 expect(',', end_error);
6684 expression->builtin_types_compatible.right = parse_typename();
6685 rem_anchor_token(')');
6686 expect(')', end_error);
6687 expression->base.type = type_int;
6691 return create_error_expression();
6695 * Parses a __builtin_is_*() compare expression.
6697 static expression_t *parse_compare_builtin(void)
6699 expression_t *expression;
6701 switch (token.kind) {
6702 case T___builtin_isgreater:
6703 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
6705 case T___builtin_isgreaterequal:
6706 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
6708 case T___builtin_isless:
6709 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
6711 case T___builtin_islessequal:
6712 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
6714 case T___builtin_islessgreater:
6715 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
6717 case T___builtin_isunordered:
6718 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
6721 internal_errorf(HERE, "invalid compare builtin found");
6723 expression->base.source_position = *HERE;
6726 expect('(', end_error);
6727 expression->binary.left = parse_assignment_expression();
6728 expect(',', end_error);
6729 expression->binary.right = parse_assignment_expression();
6730 expect(')', end_error);
6732 type_t *const orig_type_left = expression->binary.left->base.type;
6733 type_t *const orig_type_right = expression->binary.right->base.type;
6735 type_t *const type_left = skip_typeref(orig_type_left);
6736 type_t *const type_right = skip_typeref(orig_type_right);
6737 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6738 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6739 type_error_incompatible("invalid operands in comparison",
6740 &expression->base.source_position, orig_type_left, orig_type_right);
6743 semantic_comparison(&expression->binary);
6748 return create_error_expression();
6752 * Parses a MS assume() expression.
6754 static expression_t *parse_assume(void)
6756 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
6760 expect('(', end_error);
6761 add_anchor_token(')');
6762 expression->unary.value = parse_assignment_expression();
6763 rem_anchor_token(')');
6764 expect(')', end_error);
6766 expression->base.type = type_void;
6769 return create_error_expression();
6773 * Return the label for the current symbol or create a new one.
6775 static label_t *get_label(void)
6777 assert(token.kind == T_IDENTIFIER);
6778 assert(current_function != NULL);
6780 entity_t *label = get_entity(token.identifier.symbol, NAMESPACE_LABEL);
6781 /* If we find a local label, we already created the declaration. */
6782 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
6783 if (label->base.parent_scope != current_scope) {
6784 assert(label->base.parent_scope->depth < current_scope->depth);
6785 current_function->goto_to_outer = true;
6787 } else if (label == NULL || label->base.parent_scope != ¤t_function->parameters) {
6788 /* There is no matching label in the same function, so create a new one. */
6789 source_position_t const nowhere = { NULL, 0, 0, false };
6790 label = allocate_entity_zero(ENTITY_LABEL, NAMESPACE_LABEL, token.identifier.symbol, &nowhere);
6795 return &label->label;
6799 * Parses a GNU && label address expression.
6801 static expression_t *parse_label_address(void)
6803 source_position_t source_position = token.base.source_position;
6805 if (token.kind != T_IDENTIFIER) {
6806 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
6807 return create_error_expression();
6810 label_t *const label = get_label();
6812 label->address_taken = true;
6814 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
6815 expression->base.source_position = source_position;
6817 /* label address is treated as a void pointer */
6818 expression->base.type = type_void_ptr;
6819 expression->label_address.label = label;
6824 * Parse a microsoft __noop expression.
6826 static expression_t *parse_noop_expression(void)
6828 /* the result is a (int)0 */
6829 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_MS_NOOP);
6830 literal->base.type = type_int;
6831 literal->literal.value.begin = "__noop";
6832 literal->literal.value.size = 6;
6836 if (token.kind == '(') {
6837 /* parse arguments */
6839 add_anchor_token(')');
6840 add_anchor_token(',');
6842 if (token.kind != ')') do {
6843 (void)parse_assignment_expression();
6844 } while (next_if(','));
6846 rem_anchor_token(',');
6847 rem_anchor_token(')');
6849 expect(')', end_error);
6856 * Parses a primary expression.
6858 static expression_t *parse_primary_expression(void)
6860 switch (token.kind) {
6861 case T_false: return parse_boolean_literal(false);
6862 case T_true: return parse_boolean_literal(true);
6864 case T_INTEGER_OCTAL:
6865 case T_INTEGER_HEXADECIMAL:
6866 case T_FLOATINGPOINT:
6867 case T_FLOATINGPOINT_HEXADECIMAL: return parse_number_literal();
6868 case T_CHARACTER_CONSTANT: return parse_character_constant();
6869 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
6870 case T_STRING_LITERAL:
6871 case T_WIDE_STRING_LITERAL: return parse_string_literal();
6872 case T___FUNCTION__:
6873 case T___func__: return parse_function_keyword();
6874 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
6875 case T___FUNCSIG__: return parse_funcsig_keyword();
6876 case T___FUNCDNAME__: return parse_funcdname_keyword();
6877 case T___builtin_offsetof: return parse_offsetof();
6878 case T___builtin_va_start: return parse_va_start();
6879 case T___builtin_va_arg: return parse_va_arg();
6880 case T___builtin_va_copy: return parse_va_copy();
6881 case T___builtin_isgreater:
6882 case T___builtin_isgreaterequal:
6883 case T___builtin_isless:
6884 case T___builtin_islessequal:
6885 case T___builtin_islessgreater:
6886 case T___builtin_isunordered: return parse_compare_builtin();
6887 case T___builtin_constant_p: return parse_builtin_constant();
6888 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
6889 case T__assume: return parse_assume();
6892 return parse_label_address();
6895 case '(': return parse_parenthesized_expression();
6896 case T___noop: return parse_noop_expression();
6898 /* Gracefully handle type names while parsing expressions. */
6900 return parse_reference();
6902 if (!is_typedef_symbol(token.identifier.symbol)) {
6903 return parse_reference();
6907 source_position_t const pos = *HERE;
6908 declaration_specifiers_t specifiers;
6909 parse_declaration_specifiers(&specifiers);
6910 type_t const *const type = parse_abstract_declarator(specifiers.type);
6911 errorf(&pos, "encountered type '%T' while parsing expression", type);
6912 return create_error_expression();
6916 errorf(HERE, "unexpected token %K, expected an expression", &token);
6918 return create_error_expression();
6921 static expression_t *parse_array_expression(expression_t *left)
6923 expression_t *const expr = allocate_expression_zero(EXPR_ARRAY_ACCESS);
6924 array_access_expression_t *const arr = &expr->array_access;
6927 add_anchor_token(']');
6929 expression_t *const inside = parse_expression();
6931 type_t *const orig_type_left = left->base.type;
6932 type_t *const orig_type_inside = inside->base.type;
6934 type_t *const type_left = skip_typeref(orig_type_left);
6935 type_t *const type_inside = skip_typeref(orig_type_inside);
6941 if (is_type_pointer(type_left)) {
6944 idx_type = type_inside;
6945 res_type = type_left->pointer.points_to;
6947 } else if (is_type_pointer(type_inside)) {
6948 arr->flipped = true;
6951 idx_type = type_left;
6952 res_type = type_inside->pointer.points_to;
6954 res_type = automatic_type_conversion(res_type);
6955 if (!is_type_integer(idx_type)) {
6956 errorf(&idx->base.source_position, "array subscript must have integer type");
6957 } else if (is_type_atomic(idx_type, ATOMIC_TYPE_CHAR)) {
6958 source_position_t const *const pos = &idx->base.source_position;
6959 warningf(WARN_CHAR_SUBSCRIPTS, pos, "array subscript has char type");
6962 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
6963 errorf(&expr->base.source_position, "invalid types '%T[%T]' for array access", orig_type_left, orig_type_inside);
6965 res_type = type_error_type;
6970 arr->array_ref = ref;
6972 arr->base.type = res_type;
6974 rem_anchor_token(']');
6975 expect(']', end_error);
6980 static bool is_bitfield(const expression_t *expression)
6982 return expression->kind == EXPR_SELECT
6983 && expression->select.compound_entry->compound_member.bitfield;
6986 static expression_t *parse_typeprop(expression_kind_t const kind)
6988 expression_t *tp_expression = allocate_expression_zero(kind);
6989 tp_expression->base.type = type_size_t;
6991 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
6994 expression_t *expression;
6995 if (token.kind == '(' && is_declaration_specifier(look_ahead(1))) {
6996 source_position_t const pos = *HERE;
6998 add_anchor_token(')');
6999 orig_type = parse_typename();
7000 rem_anchor_token(')');
7001 expect(')', end_error);
7003 if (token.kind == '{') {
7004 /* It was not sizeof(type) after all. It is sizeof of an expression
7005 * starting with a compound literal */
7006 expression = parse_compound_literal(&pos, orig_type);
7007 goto typeprop_expression;
7010 expression = parse_subexpression(PREC_UNARY);
7012 typeprop_expression:
7013 if (is_bitfield(expression)) {
7014 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7015 errorf(&tp_expression->base.source_position,
7016 "operand of %s expression must not be a bitfield", what);
7019 tp_expression->typeprop.tp_expression = expression;
7021 orig_type = revert_automatic_type_conversion(expression);
7022 expression->base.type = orig_type;
7025 tp_expression->typeprop.type = orig_type;
7026 type_t const* const type = skip_typeref(orig_type);
7027 char const* wrong_type = NULL;
7028 if (is_type_incomplete(type)) {
7029 if (!is_type_void(type) || !GNU_MODE)
7030 wrong_type = "incomplete";
7031 } else if (type->kind == TYPE_FUNCTION) {
7033 /* function types are allowed (and return 1) */
7034 source_position_t const *const pos = &tp_expression->base.source_position;
7035 char const *const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7036 warningf(WARN_OTHER, pos, "%s expression with function argument returns invalid result", what);
7038 wrong_type = "function";
7042 if (wrong_type != NULL) {
7043 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7044 errorf(&tp_expression->base.source_position,
7045 "operand of %s expression must not be of %s type '%T'",
7046 what, wrong_type, orig_type);
7050 return tp_expression;
7053 static expression_t *parse_sizeof(void)
7055 return parse_typeprop(EXPR_SIZEOF);
7058 static expression_t *parse_alignof(void)
7060 return parse_typeprop(EXPR_ALIGNOF);
7063 static expression_t *parse_select_expression(expression_t *addr)
7065 assert(token.kind == '.' || token.kind == T_MINUSGREATER);
7066 bool select_left_arrow = (token.kind == T_MINUSGREATER);
7067 source_position_t const pos = *HERE;
7070 symbol_t *const symbol = expect_identifier("while parsing select", NULL);
7072 return create_error_expression();
7074 type_t *const orig_type = addr->base.type;
7075 type_t *const type = skip_typeref(orig_type);
7078 bool saw_error = false;
7079 if (is_type_pointer(type)) {
7080 if (!select_left_arrow) {
7082 "request for member '%Y' in something not a struct or union, but '%T'",
7086 type_left = skip_typeref(type->pointer.points_to);
7088 if (select_left_arrow && is_type_valid(type)) {
7089 errorf(&pos, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7095 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
7096 type_left->kind != TYPE_COMPOUND_UNION) {
7098 if (is_type_valid(type_left) && !saw_error) {
7100 "request for member '%Y' in something not a struct or union, but '%T'",
7103 return create_error_expression();
7106 compound_t *compound = type_left->compound.compound;
7107 if (!compound->complete) {
7108 errorf(&pos, "request for member '%Y' in incomplete type '%T'",
7110 return create_error_expression();
7113 type_qualifiers_t qualifiers = type_left->base.qualifiers;
7114 expression_t *result =
7115 find_create_select(&pos, addr, qualifiers, compound, symbol);
7117 if (result == NULL) {
7118 errorf(&pos, "'%T' has no member named '%Y'", orig_type, symbol);
7119 return create_error_expression();
7125 static void check_call_argument(type_t *expected_type,
7126 call_argument_t *argument, unsigned pos)
7128 type_t *expected_type_skip = skip_typeref(expected_type);
7129 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
7130 expression_t *arg_expr = argument->expression;
7131 type_t *arg_type = skip_typeref(arg_expr->base.type);
7133 /* handle transparent union gnu extension */
7134 if (is_type_union(expected_type_skip)
7135 && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
7136 compound_t *union_decl = expected_type_skip->compound.compound;
7137 type_t *best_type = NULL;
7138 entity_t *entry = union_decl->members.entities;
7139 for ( ; entry != NULL; entry = entry->base.next) {
7140 assert(is_declaration(entry));
7141 type_t *decl_type = entry->declaration.type;
7142 error = semantic_assign(decl_type, arg_expr);
7143 if (error == ASSIGN_ERROR_INCOMPATIBLE
7144 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
7147 if (error == ASSIGN_SUCCESS) {
7148 best_type = decl_type;
7149 } else if (best_type == NULL) {
7150 best_type = decl_type;
7154 if (best_type != NULL) {
7155 expected_type = best_type;
7159 error = semantic_assign(expected_type, arg_expr);
7160 argument->expression = create_implicit_cast(arg_expr, expected_type);
7162 if (error != ASSIGN_SUCCESS) {
7163 /* report exact scope in error messages (like "in argument 3") */
7165 snprintf(buf, sizeof(buf), "call argument %u", pos);
7166 report_assign_error(error, expected_type, arg_expr, buf,
7167 &arg_expr->base.source_position);
7169 type_t *const promoted_type = get_default_promoted_type(arg_type);
7170 if (!types_compatible(expected_type_skip, promoted_type) &&
7171 !types_compatible(expected_type_skip, type_void_ptr) &&
7172 !types_compatible(type_void_ptr, promoted_type)) {
7173 /* Deliberately show the skipped types in this warning */
7174 source_position_t const *const apos = &arg_expr->base.source_position;
7175 warningf(WARN_TRADITIONAL, apos, "passing call argument %u as '%T' rather than '%T' due to prototype", pos, expected_type_skip, promoted_type);
7181 * Handle the semantic restrictions of builtin calls
7183 static void handle_builtin_argument_restrictions(call_expression_t *call)
7185 entity_t *entity = call->function->reference.entity;
7186 switch (entity->function.btk) {
7188 switch (entity->function.b.firm_builtin_kind) {
7189 case ir_bk_return_address:
7190 case ir_bk_frame_address: {
7191 /* argument must be constant */
7192 call_argument_t *argument = call->arguments;
7194 if (is_constant_expression(argument->expression) == EXPR_CLASS_VARIABLE) {
7195 errorf(&call->base.source_position,
7196 "argument of '%Y' must be a constant expression",
7197 call->function->reference.entity->base.symbol);
7201 case ir_bk_prefetch:
7202 /* second and third argument must be constant if existent */
7203 if (call->arguments == NULL)
7205 call_argument_t *rw = call->arguments->next;
7206 call_argument_t *locality = NULL;
7209 if (is_constant_expression(rw->expression) == EXPR_CLASS_VARIABLE) {
7210 errorf(&call->base.source_position,
7211 "second argument of '%Y' must be a constant expression",
7212 call->function->reference.entity->base.symbol);
7214 locality = rw->next;
7216 if (locality != NULL) {
7217 if (is_constant_expression(locality->expression) == EXPR_CLASS_VARIABLE) {
7218 errorf(&call->base.source_position,
7219 "third argument of '%Y' must be a constant expression",
7220 call->function->reference.entity->base.symbol);
7222 locality = rw->next;
7229 case BUILTIN_OBJECT_SIZE:
7230 if (call->arguments == NULL)
7233 call_argument_t *arg = call->arguments->next;
7234 if (arg != NULL && is_constant_expression(arg->expression) == EXPR_CLASS_VARIABLE) {
7235 errorf(&call->base.source_position,
7236 "second argument of '%Y' must be a constant expression",
7237 call->function->reference.entity->base.symbol);
7246 * Parse a call expression, ie. expression '( ... )'.
7248 * @param expression the function address
7250 static expression_t *parse_call_expression(expression_t *expression)
7252 expression_t *result = allocate_expression_zero(EXPR_CALL);
7253 call_expression_t *call = &result->call;
7254 call->function = expression;
7256 type_t *const orig_type = expression->base.type;
7257 type_t *const type = skip_typeref(orig_type);
7259 function_type_t *function_type = NULL;
7260 if (is_type_pointer(type)) {
7261 type_t *const to_type = skip_typeref(type->pointer.points_to);
7263 if (is_type_function(to_type)) {
7264 function_type = &to_type->function;
7265 call->base.type = function_type->return_type;
7269 if (function_type == NULL && is_type_valid(type)) {
7271 "called object '%E' (type '%T') is not a pointer to a function",
7272 expression, orig_type);
7275 /* parse arguments */
7277 add_anchor_token(')');
7278 add_anchor_token(',');
7280 if (token.kind != ')') {
7281 call_argument_t **anchor = &call->arguments;
7283 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7284 argument->expression = parse_assignment_expression();
7287 anchor = &argument->next;
7288 } while (next_if(','));
7290 rem_anchor_token(',');
7291 rem_anchor_token(')');
7292 expect(')', end_error);
7294 if (function_type == NULL)
7297 /* check type and count of call arguments */
7298 function_parameter_t *parameter = function_type->parameters;
7299 call_argument_t *argument = call->arguments;
7300 if (!function_type->unspecified_parameters) {
7301 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7302 parameter = parameter->next, argument = argument->next) {
7303 check_call_argument(parameter->type, argument, ++pos);
7306 if (parameter != NULL) {
7307 errorf(&expression->base.source_position, "too few arguments to function '%E'", expression);
7308 } else if (argument != NULL && !function_type->variadic) {
7309 errorf(&argument->expression->base.source_position, "too many arguments to function '%E'", expression);
7313 /* do default promotion for other arguments */
7314 for (; argument != NULL; argument = argument->next) {
7315 type_t *argument_type = argument->expression->base.type;
7316 if (!is_type_object(skip_typeref(argument_type))) {
7317 errorf(&argument->expression->base.source_position,
7318 "call argument '%E' must not be void", argument->expression);
7321 argument_type = get_default_promoted_type(argument_type);
7323 argument->expression
7324 = create_implicit_cast(argument->expression, argument_type);
7329 if (is_type_compound(skip_typeref(function_type->return_type))) {
7330 source_position_t const *const pos = &expression->base.source_position;
7331 warningf(WARN_AGGREGATE_RETURN, pos, "function call has aggregate value");
7334 if (expression->kind == EXPR_REFERENCE) {
7335 reference_expression_t *reference = &expression->reference;
7336 if (reference->entity->kind == ENTITY_FUNCTION &&
7337 reference->entity->function.btk != BUILTIN_NONE)
7338 handle_builtin_argument_restrictions(call);
7345 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7347 static bool same_compound_type(const type_t *type1, const type_t *type2)
7350 is_type_compound(type1) &&
7351 type1->kind == type2->kind &&
7352 type1->compound.compound == type2->compound.compound;
7355 static expression_t const *get_reference_address(expression_t const *expr)
7357 bool regular_take_address = true;
7359 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7360 expr = expr->unary.value;
7362 regular_take_address = false;
7365 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7368 expr = expr->unary.value;
7371 if (expr->kind != EXPR_REFERENCE)
7374 /* special case for functions which are automatically converted to a
7375 * pointer to function without an extra TAKE_ADDRESS operation */
7376 if (!regular_take_address &&
7377 expr->reference.entity->kind != ENTITY_FUNCTION) {
7384 static void warn_reference_address_as_bool(expression_t const* expr)
7386 expr = get_reference_address(expr);
7388 source_position_t const *const pos = &expr->base.source_position;
7389 entity_t const *const ent = expr->reference.entity;
7390 warningf(WARN_ADDRESS, pos, "the address of '%N' will always evaluate as 'true'", ent);
7394 static void warn_assignment_in_condition(const expression_t *const expr)
7396 if (expr->base.kind != EXPR_BINARY_ASSIGN)
7398 if (expr->base.parenthesized)
7400 source_position_t const *const pos = &expr->base.source_position;
7401 warningf(WARN_PARENTHESES, pos, "suggest parentheses around assignment used as truth value");
7404 static void semantic_condition(expression_t const *const expr,
7405 char const *const context)
7407 type_t *const type = skip_typeref(expr->base.type);
7408 if (is_type_scalar(type)) {
7409 warn_reference_address_as_bool(expr);
7410 warn_assignment_in_condition(expr);
7411 } else if (is_type_valid(type)) {
7412 errorf(&expr->base.source_position,
7413 "%s must have scalar type", context);
7418 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7420 * @param expression the conditional expression
7422 static expression_t *parse_conditional_expression(expression_t *expression)
7424 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7426 conditional_expression_t *conditional = &result->conditional;
7427 conditional->condition = expression;
7430 add_anchor_token(':');
7432 /* §6.5.15:2 The first operand shall have scalar type. */
7433 semantic_condition(expression, "condition of conditional operator");
7435 expression_t *true_expression = expression;
7436 bool gnu_cond = false;
7437 if (GNU_MODE && token.kind == ':') {
7440 true_expression = parse_expression();
7442 rem_anchor_token(':');
7443 expect(':', end_error);
7445 expression_t *false_expression =
7446 parse_subexpression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7448 type_t *const orig_true_type = true_expression->base.type;
7449 type_t *const orig_false_type = false_expression->base.type;
7450 type_t *const true_type = skip_typeref(orig_true_type);
7451 type_t *const false_type = skip_typeref(orig_false_type);
7454 source_position_t const *const pos = &conditional->base.source_position;
7455 type_t *result_type;
7456 if (is_type_void(true_type) || is_type_void(false_type)) {
7457 /* ISO/IEC 14882:1998(E) §5.16:2 */
7458 if (true_expression->kind == EXPR_UNARY_THROW) {
7459 result_type = false_type;
7460 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7461 result_type = true_type;
7463 if (!is_type_void(true_type) || !is_type_void(false_type)) {
7464 warningf(WARN_OTHER, pos, "ISO C forbids conditional expression with only one void side");
7466 result_type = type_void;
7468 } else if (is_type_arithmetic(true_type)
7469 && is_type_arithmetic(false_type)) {
7470 result_type = semantic_arithmetic(true_type, false_type);
7471 } else if (same_compound_type(true_type, false_type)) {
7472 /* just take 1 of the 2 types */
7473 result_type = true_type;
7474 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7475 type_t *pointer_type;
7477 expression_t *other_expression;
7478 if (is_type_pointer(true_type) &&
7479 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7480 pointer_type = true_type;
7481 other_type = false_type;
7482 other_expression = false_expression;
7484 pointer_type = false_type;
7485 other_type = true_type;
7486 other_expression = true_expression;
7489 if (is_null_pointer_constant(other_expression)) {
7490 result_type = pointer_type;
7491 } else if (is_type_pointer(other_type)) {
7492 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7493 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7496 if (is_type_void(to1) || is_type_void(to2)) {
7498 } else if (types_compatible(get_unqualified_type(to1),
7499 get_unqualified_type(to2))) {
7502 warningf(WARN_OTHER, pos, "pointer types '%T' and '%T' in conditional expression are incompatible", true_type, false_type);
7506 type_t *const type =
7507 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7508 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7509 } else if (is_type_integer(other_type)) {
7510 warningf(WARN_OTHER, pos, "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7511 result_type = pointer_type;
7513 goto types_incompatible;
7517 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7518 type_error_incompatible("while parsing conditional", pos, true_type, false_type);
7520 result_type = type_error_type;
7523 conditional->true_expression
7524 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7525 conditional->false_expression
7526 = create_implicit_cast(false_expression, result_type);
7527 conditional->base.type = result_type;
7532 * Parse an extension expression.
7534 static expression_t *parse_extension(void)
7537 expression_t *expression = parse_subexpression(PREC_UNARY);
7543 * Parse a __builtin_classify_type() expression.
7545 static expression_t *parse_builtin_classify_type(void)
7547 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7548 result->base.type = type_int;
7550 eat(T___builtin_classify_type);
7552 expect('(', end_error);
7553 add_anchor_token(')');
7554 expression_t *expression = parse_expression();
7555 rem_anchor_token(')');
7556 expect(')', end_error);
7557 result->classify_type.type_expression = expression;
7561 return create_error_expression();
7565 * Parse a delete expression
7566 * ISO/IEC 14882:1998(E) §5.3.5
7568 static expression_t *parse_delete(void)
7570 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7571 result->base.type = type_void;
7576 result->kind = EXPR_UNARY_DELETE_ARRAY;
7577 expect(']', end_error);
7581 expression_t *const value = parse_subexpression(PREC_CAST);
7582 result->unary.value = value;
7584 type_t *const type = skip_typeref(value->base.type);
7585 if (!is_type_pointer(type)) {
7586 if (is_type_valid(type)) {
7587 errorf(&value->base.source_position,
7588 "operand of delete must have pointer type");
7590 } else if (is_type_void(skip_typeref(type->pointer.points_to))) {
7591 source_position_t const *const pos = &value->base.source_position;
7592 warningf(WARN_OTHER, pos, "deleting 'void*' is undefined");
7599 * Parse a throw expression
7600 * ISO/IEC 14882:1998(E) §15:1
7602 static expression_t *parse_throw(void)
7604 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7605 result->base.type = type_void;
7609 expression_t *value = NULL;
7610 switch (token.kind) {
7612 value = parse_assignment_expression();
7613 /* ISO/IEC 14882:1998(E) §15.1:3 */
7614 type_t *const orig_type = value->base.type;
7615 type_t *const type = skip_typeref(orig_type);
7616 if (is_type_incomplete(type)) {
7617 errorf(&value->base.source_position,
7618 "cannot throw object of incomplete type '%T'", orig_type);
7619 } else if (is_type_pointer(type)) {
7620 type_t *const points_to = skip_typeref(type->pointer.points_to);
7621 if (is_type_incomplete(points_to) && !is_type_void(points_to)) {
7622 errorf(&value->base.source_position,
7623 "cannot throw pointer to incomplete type '%T'", orig_type);
7631 result->unary.value = value;
7636 static bool check_pointer_arithmetic(const source_position_t *source_position,
7637 type_t *pointer_type,
7638 type_t *orig_pointer_type)
7640 type_t *points_to = pointer_type->pointer.points_to;
7641 points_to = skip_typeref(points_to);
7643 if (is_type_incomplete(points_to)) {
7644 if (!GNU_MODE || !is_type_void(points_to)) {
7645 errorf(source_position,
7646 "arithmetic with pointer to incomplete type '%T' not allowed",
7650 warningf(WARN_POINTER_ARITH, source_position, "pointer of type '%T' used in arithmetic", orig_pointer_type);
7652 } else if (is_type_function(points_to)) {
7654 errorf(source_position,
7655 "arithmetic with pointer to function type '%T' not allowed",
7659 warningf(WARN_POINTER_ARITH, source_position, "pointer to a function '%T' used in arithmetic", orig_pointer_type);
7665 static bool is_lvalue(const expression_t *expression)
7667 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
7668 switch (expression->kind) {
7669 case EXPR_ARRAY_ACCESS:
7670 case EXPR_COMPOUND_LITERAL:
7671 case EXPR_REFERENCE:
7673 case EXPR_UNARY_DEREFERENCE:
7677 type_t *type = skip_typeref(expression->base.type);
7679 /* ISO/IEC 14882:1998(E) §3.10:3 */
7680 is_type_reference(type) ||
7681 /* Claim it is an lvalue, if the type is invalid. There was a parse
7682 * error before, which maybe prevented properly recognizing it as
7684 !is_type_valid(type);
7689 static void semantic_incdec(unary_expression_t *expression)
7691 type_t *const orig_type = expression->value->base.type;
7692 type_t *const type = skip_typeref(orig_type);
7693 if (is_type_pointer(type)) {
7694 if (!check_pointer_arithmetic(&expression->base.source_position,
7698 } else if (!is_type_real(type) && is_type_valid(type)) {
7699 /* TODO: improve error message */
7700 errorf(&expression->base.source_position,
7701 "operation needs an arithmetic or pointer type");
7704 if (!is_lvalue(expression->value)) {
7705 /* TODO: improve error message */
7706 errorf(&expression->base.source_position, "lvalue required as operand");
7708 expression->base.type = orig_type;
7711 static void promote_unary_int_expr(unary_expression_t *const expr, type_t *const type)
7713 type_t *const res_type = promote_integer(type);
7714 expr->base.type = res_type;
7715 expr->value = create_implicit_cast(expr->value, res_type);
7718 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
7720 type_t *const orig_type = expression->value->base.type;
7721 type_t *const type = skip_typeref(orig_type);
7722 if (!is_type_arithmetic(type)) {
7723 if (is_type_valid(type)) {
7724 /* TODO: improve error message */
7725 errorf(&expression->base.source_position,
7726 "operation needs an arithmetic type");
7729 } else if (is_type_integer(type)) {
7730 promote_unary_int_expr(expression, type);
7732 expression->base.type = orig_type;
7736 static void semantic_unexpr_plus(unary_expression_t *expression)
7738 semantic_unexpr_arithmetic(expression);
7739 source_position_t const *const pos = &expression->base.source_position;
7740 warningf(WARN_TRADITIONAL, pos, "traditional C rejects the unary plus operator");
7743 static void semantic_not(unary_expression_t *expression)
7745 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
7746 semantic_condition(expression->value, "operand of !");
7747 expression->base.type = c_mode & _CXX ? type_bool : type_int;
7750 static void semantic_unexpr_integer(unary_expression_t *expression)
7752 type_t *const orig_type = expression->value->base.type;
7753 type_t *const type = skip_typeref(orig_type);
7754 if (!is_type_integer(type)) {
7755 if (is_type_valid(type)) {
7756 errorf(&expression->base.source_position,
7757 "operand of ~ must be of integer type");
7762 promote_unary_int_expr(expression, type);
7765 static void semantic_dereference(unary_expression_t *expression)
7767 type_t *const orig_type = expression->value->base.type;
7768 type_t *const type = skip_typeref(orig_type);
7769 if (!is_type_pointer(type)) {
7770 if (is_type_valid(type)) {
7771 errorf(&expression->base.source_position,
7772 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
7777 type_t *result_type = type->pointer.points_to;
7778 result_type = automatic_type_conversion(result_type);
7779 expression->base.type = result_type;
7783 * Record that an address is taken (expression represents an lvalue).
7785 * @param expression the expression
7786 * @param may_be_register if true, the expression might be an register
7788 static void set_address_taken(expression_t *expression, bool may_be_register)
7790 if (expression->kind != EXPR_REFERENCE)
7793 entity_t *const entity = expression->reference.entity;
7795 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
7798 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
7799 && !may_be_register) {
7800 source_position_t const *const pos = &expression->base.source_position;
7801 errorf(pos, "address of register '%N' requested", entity);
7804 if (entity->kind == ENTITY_VARIABLE) {
7805 entity->variable.address_taken = true;
7807 assert(entity->kind == ENTITY_PARAMETER);
7808 entity->parameter.address_taken = true;
7813 * Check the semantic of the address taken expression.
7815 static void semantic_take_addr(unary_expression_t *expression)
7817 expression_t *value = expression->value;
7818 value->base.type = revert_automatic_type_conversion(value);
7820 type_t *orig_type = value->base.type;
7821 type_t *type = skip_typeref(orig_type);
7822 if (!is_type_valid(type))
7826 if (!is_lvalue(value)) {
7827 errorf(&expression->base.source_position, "'&' requires an lvalue");
7829 if (is_bitfield(value)) {
7830 errorf(&expression->base.source_position,
7831 "'&' not allowed on bitfield");
7834 set_address_taken(value, false);
7836 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
7839 #define CREATE_UNARY_EXPRESSION_PARSER(token_kind, unexpression_type, sfunc) \
7840 static expression_t *parse_##unexpression_type(void) \
7842 expression_t *unary_expression \
7843 = allocate_expression_zero(unexpression_type); \
7845 unary_expression->unary.value = parse_subexpression(PREC_UNARY); \
7847 sfunc(&unary_expression->unary); \
7849 return unary_expression; \
7852 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
7853 semantic_unexpr_arithmetic)
7854 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
7855 semantic_unexpr_plus)
7856 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
7858 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
7859 semantic_dereference)
7860 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
7862 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
7863 semantic_unexpr_integer)
7864 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
7866 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
7869 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_kind, unexpression_type, \
7871 static expression_t *parse_##unexpression_type(expression_t *left) \
7873 expression_t *unary_expression \
7874 = allocate_expression_zero(unexpression_type); \
7876 unary_expression->unary.value = left; \
7878 sfunc(&unary_expression->unary); \
7880 return unary_expression; \
7883 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
7884 EXPR_UNARY_POSTFIX_INCREMENT,
7886 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
7887 EXPR_UNARY_POSTFIX_DECREMENT,
7890 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
7892 /* TODO: handle complex + imaginary types */
7894 type_left = get_unqualified_type(type_left);
7895 type_right = get_unqualified_type(type_right);
7897 /* §6.3.1.8 Usual arithmetic conversions */
7898 if (type_left == type_long_double || type_right == type_long_double) {
7899 return type_long_double;
7900 } else if (type_left == type_double || type_right == type_double) {
7902 } else if (type_left == type_float || type_right == type_float) {
7906 type_left = promote_integer(type_left);
7907 type_right = promote_integer(type_right);
7909 if (type_left == type_right)
7912 bool const signed_left = is_type_signed(type_left);
7913 bool const signed_right = is_type_signed(type_right);
7914 unsigned const rank_left = get_akind_rank(get_akind(type_left));
7915 unsigned const rank_right = get_akind_rank(get_akind(type_right));
7917 if (signed_left == signed_right)
7918 return rank_left >= rank_right ? type_left : type_right;
7922 atomic_type_kind_t s_akind;
7923 atomic_type_kind_t u_akind;
7928 u_type = type_right;
7930 s_type = type_right;
7933 s_akind = get_akind(s_type);
7934 u_akind = get_akind(u_type);
7935 s_rank = get_akind_rank(s_akind);
7936 u_rank = get_akind_rank(u_akind);
7938 if (u_rank >= s_rank)
7941 if (get_atomic_type_size(s_akind) > get_atomic_type_size(u_akind))
7945 case ATOMIC_TYPE_INT: return type_unsigned_int;
7946 case ATOMIC_TYPE_LONG: return type_unsigned_long;
7947 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
7949 default: panic("invalid atomic type");
7954 * Check the semantic restrictions for a binary expression.
7956 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
7958 expression_t *const left = expression->left;
7959 expression_t *const right = expression->right;
7960 type_t *const orig_type_left = left->base.type;
7961 type_t *const orig_type_right = right->base.type;
7962 type_t *const type_left = skip_typeref(orig_type_left);
7963 type_t *const type_right = skip_typeref(orig_type_right);
7965 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
7966 /* TODO: improve error message */
7967 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7968 errorf(&expression->base.source_position,
7969 "operation needs arithmetic types");
7974 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7975 expression->left = create_implicit_cast(left, arithmetic_type);
7976 expression->right = create_implicit_cast(right, arithmetic_type);
7977 expression->base.type = arithmetic_type;
7980 static void semantic_binexpr_integer(binary_expression_t *const 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_integer(type_left) || !is_type_integer(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 integer types");
7998 type_t *const result_type = semantic_arithmetic(type_left, type_right);
7999 expression->left = create_implicit_cast(left, result_type);
8000 expression->right = create_implicit_cast(right, result_type);
8001 expression->base.type = result_type;
8004 static void warn_div_by_zero(binary_expression_t const *const expression)
8006 if (!is_type_integer(expression->base.type))
8009 expression_t const *const right = expression->right;
8010 /* The type of the right operand can be different for /= */
8011 if (is_type_integer(right->base.type) &&
8012 is_constant_expression(right) == EXPR_CLASS_CONSTANT &&
8013 !fold_constant_to_bool(right)) {
8014 source_position_t const *const pos = &expression->base.source_position;
8015 warningf(WARN_DIV_BY_ZERO, pos, "division by zero");
8020 * Check the semantic restrictions for a div/mod expression.
8022 static void semantic_divmod_arithmetic(binary_expression_t *expression)
8024 semantic_binexpr_arithmetic(expression);
8025 warn_div_by_zero(expression);
8028 static void warn_addsub_in_shift(const expression_t *const expr)
8030 if (expr->base.parenthesized)
8034 switch (expr->kind) {
8035 case EXPR_BINARY_ADD: op = '+'; break;
8036 case EXPR_BINARY_SUB: op = '-'; break;
8040 source_position_t const *const pos = &expr->base.source_position;
8041 warningf(WARN_PARENTHESES, pos, "suggest parentheses around '%c' inside shift", op);
8044 static bool semantic_shift(binary_expression_t *expression)
8046 expression_t *const left = expression->left;
8047 expression_t *const right = expression->right;
8048 type_t *const orig_type_left = left->base.type;
8049 type_t *const orig_type_right = right->base.type;
8050 type_t * type_left = skip_typeref(orig_type_left);
8051 type_t * type_right = skip_typeref(orig_type_right);
8053 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8054 /* TODO: improve error message */
8055 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8056 errorf(&expression->base.source_position,
8057 "operands of shift operation must have integer types");
8062 type_left = promote_integer(type_left);
8064 if (is_constant_expression(right) == EXPR_CLASS_CONSTANT) {
8065 source_position_t const *const pos = &right->base.source_position;
8066 long const count = fold_constant_to_int(right);
8068 warningf(WARN_OTHER, pos, "shift count must be non-negative");
8069 } else if ((unsigned long)count >=
8070 get_atomic_type_size(type_left->atomic.akind) * 8) {
8071 warningf(WARN_OTHER, pos, "shift count must be less than type width");
8075 type_right = promote_integer(type_right);
8076 expression->right = create_implicit_cast(right, type_right);
8081 static void semantic_shift_op(binary_expression_t *expression)
8083 expression_t *const left = expression->left;
8084 expression_t *const right = expression->right;
8086 if (!semantic_shift(expression))
8089 warn_addsub_in_shift(left);
8090 warn_addsub_in_shift(right);
8092 type_t *const orig_type_left = left->base.type;
8093 type_t * type_left = skip_typeref(orig_type_left);
8095 type_left = promote_integer(type_left);
8096 expression->left = create_implicit_cast(left, type_left);
8097 expression->base.type = type_left;
8100 static void semantic_add(binary_expression_t *expression)
8102 expression_t *const left = expression->left;
8103 expression_t *const right = expression->right;
8104 type_t *const orig_type_left = left->base.type;
8105 type_t *const orig_type_right = right->base.type;
8106 type_t *const type_left = skip_typeref(orig_type_left);
8107 type_t *const type_right = skip_typeref(orig_type_right);
8110 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8111 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8112 expression->left = create_implicit_cast(left, arithmetic_type);
8113 expression->right = create_implicit_cast(right, arithmetic_type);
8114 expression->base.type = arithmetic_type;
8115 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8116 check_pointer_arithmetic(&expression->base.source_position,
8117 type_left, orig_type_left);
8118 expression->base.type = type_left;
8119 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8120 check_pointer_arithmetic(&expression->base.source_position,
8121 type_right, orig_type_right);
8122 expression->base.type = type_right;
8123 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8124 errorf(&expression->base.source_position,
8125 "invalid operands to binary + ('%T', '%T')",
8126 orig_type_left, orig_type_right);
8130 static void semantic_sub(binary_expression_t *expression)
8132 expression_t *const left = expression->left;
8133 expression_t *const right = expression->right;
8134 type_t *const orig_type_left = left->base.type;
8135 type_t *const orig_type_right = right->base.type;
8136 type_t *const type_left = skip_typeref(orig_type_left);
8137 type_t *const type_right = skip_typeref(orig_type_right);
8138 source_position_t const *const pos = &expression->base.source_position;
8141 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8142 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8143 expression->left = create_implicit_cast(left, arithmetic_type);
8144 expression->right = create_implicit_cast(right, arithmetic_type);
8145 expression->base.type = arithmetic_type;
8146 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8147 check_pointer_arithmetic(&expression->base.source_position,
8148 type_left, orig_type_left);
8149 expression->base.type = type_left;
8150 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8151 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
8152 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
8153 if (!types_compatible(unqual_left, unqual_right)) {
8155 "subtracting pointers to incompatible types '%T' and '%T'",
8156 orig_type_left, orig_type_right);
8157 } else if (!is_type_object(unqual_left)) {
8158 if (!is_type_void(unqual_left)) {
8159 errorf(pos, "subtracting pointers to non-object types '%T'",
8162 warningf(WARN_OTHER, pos, "subtracting pointers to void");
8165 expression->base.type = type_ptrdiff_t;
8166 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8167 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8168 orig_type_left, orig_type_right);
8172 static void warn_string_literal_address(expression_t const* expr)
8174 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8175 expr = expr->unary.value;
8176 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8178 expr = expr->unary.value;
8181 if (expr->kind == EXPR_STRING_LITERAL
8182 || expr->kind == EXPR_WIDE_STRING_LITERAL) {
8183 source_position_t const *const pos = &expr->base.source_position;
8184 warningf(WARN_ADDRESS, pos, "comparison with string literal results in unspecified behaviour");
8188 static bool maybe_negative(expression_t const *const expr)
8190 switch (is_constant_expression(expr)) {
8191 case EXPR_CLASS_ERROR: return false;
8192 case EXPR_CLASS_CONSTANT: return constant_is_negative(expr);
8193 default: return true;
8197 static void warn_comparison(source_position_t const *const pos, expression_t const *const expr, expression_t const *const other)
8199 warn_string_literal_address(expr);
8201 expression_t const* const ref = get_reference_address(expr);
8202 if (ref != NULL && is_null_pointer_constant(other)) {
8203 entity_t const *const ent = ref->reference.entity;
8204 warningf(WARN_ADDRESS, pos, "the address of '%N' will never be NULL", ent);
8207 if (!expr->base.parenthesized) {
8208 switch (expr->base.kind) {
8209 case EXPR_BINARY_LESS:
8210 case EXPR_BINARY_GREATER:
8211 case EXPR_BINARY_LESSEQUAL:
8212 case EXPR_BINARY_GREATEREQUAL:
8213 case EXPR_BINARY_NOTEQUAL:
8214 case EXPR_BINARY_EQUAL:
8215 warningf(WARN_PARENTHESES, pos, "comparisons like 'x <= y < z' do not have their mathematical meaning");
8224 * Check the semantics of comparison expressions.
8226 * @param expression The expression to check.
8228 static void semantic_comparison(binary_expression_t *expression)
8230 source_position_t const *const pos = &expression->base.source_position;
8231 expression_t *const left = expression->left;
8232 expression_t *const right = expression->right;
8234 warn_comparison(pos, left, right);
8235 warn_comparison(pos, right, left);
8237 type_t *orig_type_left = left->base.type;
8238 type_t *orig_type_right = right->base.type;
8239 type_t *type_left = skip_typeref(orig_type_left);
8240 type_t *type_right = skip_typeref(orig_type_right);
8242 /* TODO non-arithmetic types */
8243 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8244 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8246 /* test for signed vs unsigned compares */
8247 if (is_type_integer(arithmetic_type)) {
8248 bool const signed_left = is_type_signed(type_left);
8249 bool const signed_right = is_type_signed(type_right);
8250 if (signed_left != signed_right) {
8251 /* FIXME long long needs better const folding magic */
8252 /* TODO check whether constant value can be represented by other type */
8253 if ((signed_left && maybe_negative(left)) ||
8254 (signed_right && maybe_negative(right))) {
8255 warningf(WARN_SIGN_COMPARE, pos, "comparison between signed and unsigned");
8260 expression->left = create_implicit_cast(left, arithmetic_type);
8261 expression->right = create_implicit_cast(right, arithmetic_type);
8262 expression->base.type = arithmetic_type;
8263 if ((expression->base.kind == EXPR_BINARY_EQUAL ||
8264 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8265 is_type_float(arithmetic_type)) {
8266 warningf(WARN_FLOAT_EQUAL, pos, "comparing floating point with == or != is unsafe");
8268 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8269 /* TODO check compatibility */
8270 } else if (is_type_pointer(type_left)) {
8271 expression->right = create_implicit_cast(right, type_left);
8272 } else if (is_type_pointer(type_right)) {
8273 expression->left = create_implicit_cast(left, type_right);
8274 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8275 type_error_incompatible("invalid operands in comparison", pos, type_left, type_right);
8277 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8281 * Checks if a compound type has constant fields.
8283 static bool has_const_fields(const compound_type_t *type)
8285 compound_t *compound = type->compound;
8286 entity_t *entry = compound->members.entities;
8288 for (; entry != NULL; entry = entry->base.next) {
8289 if (!is_declaration(entry))
8292 const type_t *decl_type = skip_typeref(entry->declaration.type);
8293 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8300 static bool is_valid_assignment_lhs(expression_t const* const left)
8302 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8303 type_t *const type_left = skip_typeref(orig_type_left);
8305 if (!is_lvalue(left)) {
8306 errorf(&left->base.source_position, "left hand side '%E' of assignment is not an lvalue",
8311 if (left->kind == EXPR_REFERENCE
8312 && left->reference.entity->kind == ENTITY_FUNCTION) {
8313 errorf(&left->base.source_position, "cannot assign to function '%E'", left);
8317 if (is_type_array(type_left)) {
8318 errorf(&left->base.source_position, "cannot assign to array '%E'", left);
8321 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8322 errorf(&left->base.source_position, "assignment to read-only location '%E' (type '%T')", left,
8326 if (is_type_incomplete(type_left)) {
8327 errorf(&left->base.source_position, "left-hand side '%E' of assignment has incomplete type '%T'",
8328 left, orig_type_left);
8331 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8332 errorf(&left->base.source_position, "cannot assign to '%E' because compound type '%T' has read-only fields",
8333 left, orig_type_left);
8340 static void semantic_arithmetic_assign(binary_expression_t *expression)
8342 expression_t *left = expression->left;
8343 expression_t *right = expression->right;
8344 type_t *orig_type_left = left->base.type;
8345 type_t *orig_type_right = right->base.type;
8347 if (!is_valid_assignment_lhs(left))
8350 type_t *type_left = skip_typeref(orig_type_left);
8351 type_t *type_right = skip_typeref(orig_type_right);
8353 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8354 /* TODO: improve error message */
8355 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8356 errorf(&expression->base.source_position,
8357 "operation needs arithmetic types");
8362 /* combined instructions are tricky. We can't create an implicit cast on
8363 * the left side, because we need the uncasted form for the store.
8364 * The ast2firm pass has to know that left_type must be right_type
8365 * for the arithmetic operation and create a cast by itself */
8366 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8367 expression->right = create_implicit_cast(right, arithmetic_type);
8368 expression->base.type = type_left;
8371 static void semantic_divmod_assign(binary_expression_t *expression)
8373 semantic_arithmetic_assign(expression);
8374 warn_div_by_zero(expression);
8377 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8379 expression_t *const left = expression->left;
8380 expression_t *const right = expression->right;
8381 type_t *const orig_type_left = left->base.type;
8382 type_t *const orig_type_right = right->base.type;
8383 type_t *const type_left = skip_typeref(orig_type_left);
8384 type_t *const type_right = skip_typeref(orig_type_right);
8386 if (!is_valid_assignment_lhs(left))
8389 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8390 /* combined instructions are tricky. We can't create an implicit cast on
8391 * the left side, because we need the uncasted form for the store.
8392 * The ast2firm pass has to know that left_type must be right_type
8393 * for the arithmetic operation and create a cast by itself */
8394 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8395 expression->right = create_implicit_cast(right, arithmetic_type);
8396 expression->base.type = type_left;
8397 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8398 check_pointer_arithmetic(&expression->base.source_position,
8399 type_left, orig_type_left);
8400 expression->base.type = type_left;
8401 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8402 errorf(&expression->base.source_position,
8403 "incompatible types '%T' and '%T' in assignment",
8404 orig_type_left, orig_type_right);
8408 static void semantic_integer_assign(binary_expression_t *expression)
8410 expression_t *left = expression->left;
8411 expression_t *right = expression->right;
8412 type_t *orig_type_left = left->base.type;
8413 type_t *orig_type_right = right->base.type;
8415 if (!is_valid_assignment_lhs(left))
8418 type_t *type_left = skip_typeref(orig_type_left);
8419 type_t *type_right = skip_typeref(orig_type_right);
8421 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8422 /* TODO: improve error message */
8423 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8424 errorf(&expression->base.source_position,
8425 "operation needs integer types");
8430 /* combined instructions are tricky. We can't create an implicit cast on
8431 * the left side, because we need the uncasted form for the store.
8432 * The ast2firm pass has to know that left_type must be right_type
8433 * for the arithmetic operation and create a cast by itself */
8434 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8435 expression->right = create_implicit_cast(right, arithmetic_type);
8436 expression->base.type = type_left;
8439 static void semantic_shift_assign(binary_expression_t *expression)
8441 expression_t *left = expression->left;
8443 if (!is_valid_assignment_lhs(left))
8446 if (!semantic_shift(expression))
8449 expression->base.type = skip_typeref(left->base.type);
8452 static void warn_logical_and_within_or(const expression_t *const expr)
8454 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8456 if (expr->base.parenthesized)
8458 source_position_t const *const pos = &expr->base.source_position;
8459 warningf(WARN_PARENTHESES, pos, "suggest parentheses around && within ||");
8463 * Check the semantic restrictions of a logical expression.
8465 static void semantic_logical_op(binary_expression_t *expression)
8467 /* §6.5.13:2 Each of the operands shall have scalar type.
8468 * §6.5.14:2 Each of the operands shall have scalar type. */
8469 semantic_condition(expression->left, "left operand of logical operator");
8470 semantic_condition(expression->right, "right operand of logical operator");
8471 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR) {
8472 warn_logical_and_within_or(expression->left);
8473 warn_logical_and_within_or(expression->right);
8475 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8479 * Check the semantic restrictions of a binary assign expression.
8481 static void semantic_binexpr_assign(binary_expression_t *expression)
8483 expression_t *left = expression->left;
8484 type_t *orig_type_left = left->base.type;
8486 if (!is_valid_assignment_lhs(left))
8489 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8490 report_assign_error(error, orig_type_left, expression->right,
8491 "assignment", &left->base.source_position);
8492 expression->right = create_implicit_cast(expression->right, orig_type_left);
8493 expression->base.type = orig_type_left;
8497 * Determine if the outermost operation (or parts thereof) of the given
8498 * expression has no effect in order to generate a warning about this fact.
8499 * Therefore in some cases this only examines some of the operands of the
8500 * expression (see comments in the function and examples below).
8502 * f() + 23; // warning, because + has no effect
8503 * x || f(); // no warning, because x controls execution of f()
8504 * x ? y : f(); // warning, because y has no effect
8505 * (void)x; // no warning to be able to suppress the warning
8506 * This function can NOT be used for an "expression has definitely no effect"-
8508 static bool expression_has_effect(const expression_t *const expr)
8510 switch (expr->kind) {
8511 case EXPR_ERROR: return true; /* do NOT warn */
8512 case EXPR_REFERENCE: return false;
8513 case EXPR_ENUM_CONSTANT: return false;
8514 case EXPR_LABEL_ADDRESS: return false;
8516 /* suppress the warning for microsoft __noop operations */
8517 case EXPR_LITERAL_MS_NOOP: return true;
8518 case EXPR_LITERAL_BOOLEAN:
8519 case EXPR_LITERAL_CHARACTER:
8520 case EXPR_LITERAL_WIDE_CHARACTER:
8521 case EXPR_LITERAL_INTEGER:
8522 case EXPR_LITERAL_INTEGER_OCTAL:
8523 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
8524 case EXPR_LITERAL_FLOATINGPOINT:
8525 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: return false;
8526 case EXPR_STRING_LITERAL: return false;
8527 case EXPR_WIDE_STRING_LITERAL: return false;
8530 const call_expression_t *const call = &expr->call;
8531 if (call->function->kind != EXPR_REFERENCE)
8534 switch (call->function->reference.entity->function.btk) {
8535 /* FIXME: which builtins have no effect? */
8536 default: return true;
8540 /* Generate the warning if either the left or right hand side of a
8541 * conditional expression has no effect */
8542 case EXPR_CONDITIONAL: {
8543 conditional_expression_t const *const cond = &expr->conditional;
8544 expression_t const *const t = cond->true_expression;
8546 (t == NULL || expression_has_effect(t)) &&
8547 expression_has_effect(cond->false_expression);
8550 case EXPR_SELECT: return false;
8551 case EXPR_ARRAY_ACCESS: return false;
8552 case EXPR_SIZEOF: return false;
8553 case EXPR_CLASSIFY_TYPE: return false;
8554 case EXPR_ALIGNOF: return false;
8556 case EXPR_FUNCNAME: return false;
8557 case EXPR_BUILTIN_CONSTANT_P: return false;
8558 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8559 case EXPR_OFFSETOF: return false;
8560 case EXPR_VA_START: return true;
8561 case EXPR_VA_ARG: return true;
8562 case EXPR_VA_COPY: return true;
8563 case EXPR_STATEMENT: return true; // TODO
8564 case EXPR_COMPOUND_LITERAL: return false;
8566 case EXPR_UNARY_NEGATE: return false;
8567 case EXPR_UNARY_PLUS: return false;
8568 case EXPR_UNARY_BITWISE_NEGATE: return false;
8569 case EXPR_UNARY_NOT: return false;
8570 case EXPR_UNARY_DEREFERENCE: return false;
8571 case EXPR_UNARY_TAKE_ADDRESS: return false;
8572 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8573 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8574 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8575 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8577 /* Treat void casts as if they have an effect in order to being able to
8578 * suppress the warning */
8579 case EXPR_UNARY_CAST: {
8580 type_t *const type = skip_typeref(expr->base.type);
8581 return is_type_void(type);
8584 case EXPR_UNARY_ASSUME: return true;
8585 case EXPR_UNARY_DELETE: return true;
8586 case EXPR_UNARY_DELETE_ARRAY: return true;
8587 case EXPR_UNARY_THROW: return true;
8589 case EXPR_BINARY_ADD: return false;
8590 case EXPR_BINARY_SUB: return false;
8591 case EXPR_BINARY_MUL: return false;
8592 case EXPR_BINARY_DIV: return false;
8593 case EXPR_BINARY_MOD: return false;
8594 case EXPR_BINARY_EQUAL: return false;
8595 case EXPR_BINARY_NOTEQUAL: return false;
8596 case EXPR_BINARY_LESS: return false;
8597 case EXPR_BINARY_LESSEQUAL: return false;
8598 case EXPR_BINARY_GREATER: return false;
8599 case EXPR_BINARY_GREATEREQUAL: return false;
8600 case EXPR_BINARY_BITWISE_AND: return false;
8601 case EXPR_BINARY_BITWISE_OR: return false;
8602 case EXPR_BINARY_BITWISE_XOR: return false;
8603 case EXPR_BINARY_SHIFTLEFT: return false;
8604 case EXPR_BINARY_SHIFTRIGHT: return false;
8605 case EXPR_BINARY_ASSIGN: return true;
8606 case EXPR_BINARY_MUL_ASSIGN: return true;
8607 case EXPR_BINARY_DIV_ASSIGN: return true;
8608 case EXPR_BINARY_MOD_ASSIGN: return true;
8609 case EXPR_BINARY_ADD_ASSIGN: return true;
8610 case EXPR_BINARY_SUB_ASSIGN: return true;
8611 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8612 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8613 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8614 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8615 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8617 /* Only examine the right hand side of && and ||, because the left hand
8618 * side already has the effect of controlling the execution of the right
8620 case EXPR_BINARY_LOGICAL_AND:
8621 case EXPR_BINARY_LOGICAL_OR:
8622 /* Only examine the right hand side of a comma expression, because the left
8623 * hand side has a separate warning */
8624 case EXPR_BINARY_COMMA:
8625 return expression_has_effect(expr->binary.right);
8627 case EXPR_BINARY_ISGREATER: return false;
8628 case EXPR_BINARY_ISGREATEREQUAL: return false;
8629 case EXPR_BINARY_ISLESS: return false;
8630 case EXPR_BINARY_ISLESSEQUAL: return false;
8631 case EXPR_BINARY_ISLESSGREATER: return false;
8632 case EXPR_BINARY_ISUNORDERED: return false;
8635 internal_errorf(HERE, "unexpected expression");
8638 static void semantic_comma(binary_expression_t *expression)
8640 const expression_t *const left = expression->left;
8641 if (!expression_has_effect(left)) {
8642 source_position_t const *const pos = &left->base.source_position;
8643 warningf(WARN_UNUSED_VALUE, pos, "left-hand operand of comma expression has no effect");
8645 expression->base.type = expression->right->base.type;
8649 * @param prec_r precedence of the right operand
8651 #define CREATE_BINEXPR_PARSER(token_kind, binexpression_type, prec_r, sfunc) \
8652 static expression_t *parse_##binexpression_type(expression_t *left) \
8654 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8655 binexpr->binary.left = left; \
8658 expression_t *right = parse_subexpression(prec_r); \
8660 binexpr->binary.right = right; \
8661 sfunc(&binexpr->binary); \
8666 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8667 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
8668 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
8669 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8670 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8671 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8672 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8673 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
8674 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
8675 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
8676 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
8677 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
8678 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
8679 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_integer)
8680 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_integer)
8681 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_integer)
8682 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8683 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8684 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
8685 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8686 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8687 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8688 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8689 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8690 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8691 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8692 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8693 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8694 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8695 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
8698 static expression_t *parse_subexpression(precedence_t precedence)
8700 if (token.kind < 0) {
8701 return expected_expression_error();
8704 expression_parser_function_t *parser
8705 = &expression_parsers[token.kind];
8708 if (parser->parser != NULL) {
8709 left = parser->parser();
8711 left = parse_primary_expression();
8713 assert(left != NULL);
8716 if (token.kind < 0) {
8717 return expected_expression_error();
8720 parser = &expression_parsers[token.kind];
8721 if (parser->infix_parser == NULL)
8723 if (parser->infix_precedence < precedence)
8726 left = parser->infix_parser(left);
8728 assert(left != NULL);
8735 * Parse an expression.
8737 static expression_t *parse_expression(void)
8739 return parse_subexpression(PREC_EXPRESSION);
8743 * Register a parser for a prefix-like operator.
8745 * @param parser the parser function
8746 * @param token_kind the token type of the prefix token
8748 static void register_expression_parser(parse_expression_function parser,
8751 expression_parser_function_t *entry = &expression_parsers[token_kind];
8753 if (entry->parser != NULL) {
8754 diagnosticf("for token '%k'\n", (token_kind_t)token_kind);
8755 panic("trying to register multiple expression parsers for a token");
8757 entry->parser = parser;
8761 * Register a parser for an infix operator with given precedence.
8763 * @param parser the parser function
8764 * @param token_kind the token type of the infix operator
8765 * @param precedence the precedence of the operator
8767 static void register_infix_parser(parse_expression_infix_function parser,
8768 int token_kind, precedence_t precedence)
8770 expression_parser_function_t *entry = &expression_parsers[token_kind];
8772 if (entry->infix_parser != NULL) {
8773 diagnosticf("for token '%k'\n", (token_kind_t)token_kind);
8774 panic("trying to register multiple infix expression parsers for a "
8777 entry->infix_parser = parser;
8778 entry->infix_precedence = precedence;
8782 * Initialize the expression parsers.
8784 static void init_expression_parsers(void)
8786 memset(&expression_parsers, 0, sizeof(expression_parsers));
8788 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
8789 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
8790 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
8791 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
8792 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
8793 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
8794 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
8795 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
8796 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
8797 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
8798 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
8799 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
8800 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
8801 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
8802 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
8803 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
8804 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
8805 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
8806 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
8807 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
8808 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
8809 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
8810 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
8811 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
8812 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
8813 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
8814 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
8815 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
8816 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
8817 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
8818 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
8819 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
8820 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
8821 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
8822 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
8823 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
8824 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
8826 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
8827 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
8828 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
8829 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
8830 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
8831 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
8832 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
8833 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
8834 register_expression_parser(parse_sizeof, T_sizeof);
8835 register_expression_parser(parse_alignof, T___alignof__);
8836 register_expression_parser(parse_extension, T___extension__);
8837 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
8838 register_expression_parser(parse_delete, T_delete);
8839 register_expression_parser(parse_throw, T_throw);
8843 * Parse a asm statement arguments specification.
8845 static asm_argument_t *parse_asm_arguments(bool is_out)
8847 asm_argument_t *result = NULL;
8848 asm_argument_t **anchor = &result;
8850 while (token.kind == T_STRING_LITERAL || token.kind == '[') {
8851 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
8854 add_anchor_token(']');
8855 argument->symbol = expect_identifier("while parsing asm argument", NULL);
8856 rem_anchor_token(']');
8857 expect(']', end_error);
8858 if (!argument->symbol)
8862 argument->constraints = parse_string_literals();
8863 expect('(', end_error);
8864 add_anchor_token(')');
8865 expression_t *expression = parse_expression();
8866 rem_anchor_token(')');
8868 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
8869 * change size or type representation (e.g. int -> long is ok, but
8870 * int -> float is not) */
8871 if (expression->kind == EXPR_UNARY_CAST) {
8872 type_t *const type = expression->base.type;
8873 type_kind_t const kind = type->kind;
8874 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
8877 if (kind == TYPE_ATOMIC) {
8878 atomic_type_kind_t const akind = type->atomic.akind;
8879 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8880 size = get_atomic_type_size(akind);
8882 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8883 size = get_type_size(type_void_ptr);
8887 expression_t *const value = expression->unary.value;
8888 type_t *const value_type = value->base.type;
8889 type_kind_t const value_kind = value_type->kind;
8891 unsigned value_flags;
8892 unsigned value_size;
8893 if (value_kind == TYPE_ATOMIC) {
8894 atomic_type_kind_t const value_akind = value_type->atomic.akind;
8895 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8896 value_size = get_atomic_type_size(value_akind);
8897 } else if (value_kind == TYPE_POINTER) {
8898 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8899 value_size = get_type_size(type_void_ptr);
8904 if (value_flags != flags || value_size != size)
8908 } while (expression->kind == EXPR_UNARY_CAST);
8912 if (!is_lvalue(expression)) {
8913 errorf(&expression->base.source_position,
8914 "asm output argument is not an lvalue");
8917 if (argument->constraints.begin[0] == '=')
8918 determine_lhs_ent(expression, NULL);
8920 mark_vars_read(expression, NULL);
8922 mark_vars_read(expression, NULL);
8924 argument->expression = expression;
8925 expect(')', end_error);
8927 set_address_taken(expression, true);
8930 anchor = &argument->next;
8942 * Parse a asm statement clobber specification.
8944 static asm_clobber_t *parse_asm_clobbers(void)
8946 asm_clobber_t *result = NULL;
8947 asm_clobber_t **anchor = &result;
8949 while (token.kind == T_STRING_LITERAL) {
8950 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
8951 clobber->clobber = parse_string_literals();
8954 anchor = &clobber->next;
8964 * Parse an asm statement.
8966 static statement_t *parse_asm_statement(void)
8968 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
8969 asm_statement_t *asm_statement = &statement->asms;
8973 if (next_if(T_volatile))
8974 asm_statement->is_volatile = true;
8976 expect('(', end_error);
8977 add_anchor_token(')');
8978 if (token.kind != T_STRING_LITERAL) {
8979 parse_error_expected("after asm(", T_STRING_LITERAL, NULL);
8982 asm_statement->asm_text = parse_string_literals();
8984 add_anchor_token(':');
8985 if (!next_if(':')) {
8986 rem_anchor_token(':');
8990 asm_statement->outputs = parse_asm_arguments(true);
8991 if (!next_if(':')) {
8992 rem_anchor_token(':');
8996 asm_statement->inputs = parse_asm_arguments(false);
8997 if (!next_if(':')) {
8998 rem_anchor_token(':');
9001 rem_anchor_token(':');
9003 asm_statement->clobbers = parse_asm_clobbers();
9006 rem_anchor_token(')');
9007 expect(')', end_error);
9008 expect(';', end_error);
9011 if (asm_statement->outputs == NULL) {
9012 /* GCC: An 'asm' instruction without any output operands will be treated
9013 * identically to a volatile 'asm' instruction. */
9014 asm_statement->is_volatile = true;
9020 static statement_t *parse_label_inner_statement(statement_t const *const label, char const *const label_kind)
9022 statement_t *inner_stmt;
9023 switch (token.kind) {
9025 errorf(&label->base.source_position, "%s at end of compound statement", label_kind);
9026 inner_stmt = create_error_statement();
9030 if (label->kind == STATEMENT_LABEL) {
9031 /* Eat an empty statement here, to avoid the warning about an empty
9032 * statement after a label. label:; is commonly used to have a label
9033 * before a closing brace. */
9034 inner_stmt = create_empty_statement();
9041 inner_stmt = parse_statement();
9042 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
9043 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
9044 if (inner_stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
9045 errorf(&inner_stmt->base.source_position, "declaration after %s", label_kind);
9053 * Parse a case statement.
9055 static statement_t *parse_case_statement(void)
9057 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9058 source_position_t *const pos = &statement->base.source_position;
9062 expression_t *expression = parse_expression();
9063 type_t *expression_type = expression->base.type;
9064 type_t *skipped = skip_typeref(expression_type);
9065 if (!is_type_integer(skipped) && is_type_valid(skipped)) {
9066 errorf(pos, "case expression '%E' must have integer type but has type '%T'",
9067 expression, expression_type);
9070 type_t *type = expression_type;
9071 if (current_switch != NULL) {
9072 type_t *switch_type = current_switch->expression->base.type;
9073 if (is_type_valid(switch_type)) {
9074 expression = create_implicit_cast(expression, switch_type);
9078 statement->case_label.expression = expression;
9079 expression_classification_t const expr_class = is_constant_expression(expression);
9080 if (expr_class != EXPR_CLASS_CONSTANT) {
9081 if (expr_class != EXPR_CLASS_ERROR) {
9082 errorf(pos, "case label does not reduce to an integer constant");
9084 statement->case_label.is_bad = true;
9086 long const val = fold_constant_to_int(expression);
9087 statement->case_label.first_case = val;
9088 statement->case_label.last_case = val;
9092 if (next_if(T_DOTDOTDOT)) {
9093 expression_t *end_range = parse_expression();
9094 expression_type = expression->base.type;
9095 skipped = skip_typeref(expression_type);
9096 if (!is_type_integer(skipped) && is_type_valid(skipped)) {
9097 errorf(pos, "case expression '%E' must have integer type but has type '%T'",
9098 expression, expression_type);
9101 end_range = create_implicit_cast(end_range, type);
9102 statement->case_label.end_range = end_range;
9103 expression_classification_t const end_class = is_constant_expression(end_range);
9104 if (end_class != EXPR_CLASS_CONSTANT) {
9105 if (end_class != EXPR_CLASS_ERROR) {
9106 errorf(pos, "case range does not reduce to an integer constant");
9108 statement->case_label.is_bad = true;
9110 long const val = fold_constant_to_int(end_range);
9111 statement->case_label.last_case = val;
9113 if (val < statement->case_label.first_case) {
9114 statement->case_label.is_empty_range = true;
9115 warningf(WARN_OTHER, pos, "empty range specified");
9121 PUSH_PARENT(statement);
9123 expect(':', end_error);
9126 if (current_switch != NULL) {
9127 if (! statement->case_label.is_bad) {
9128 /* Check for duplicate case values */
9129 case_label_statement_t *c = &statement->case_label;
9130 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9131 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9134 if (c->last_case < l->first_case || c->first_case > l->last_case)
9137 errorf(pos, "duplicate case value (previously used %P)",
9138 &l->base.source_position);
9142 /* link all cases into the switch statement */
9143 if (current_switch->last_case == NULL) {
9144 current_switch->first_case = &statement->case_label;
9146 current_switch->last_case->next = &statement->case_label;
9148 current_switch->last_case = &statement->case_label;
9150 errorf(pos, "case label not within a switch statement");
9153 statement->case_label.statement = parse_label_inner_statement(statement, "case label");
9160 * Parse a default statement.
9162 static statement_t *parse_default_statement(void)
9164 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9168 PUSH_PARENT(statement);
9170 expect(':', end_error);
9173 if (current_switch != NULL) {
9174 const case_label_statement_t *def_label = current_switch->default_label;
9175 if (def_label != NULL) {
9176 errorf(&statement->base.source_position, "multiple default labels in one switch (previous declared %P)", &def_label->base.source_position);
9178 current_switch->default_label = &statement->case_label;
9180 /* link all cases into the switch statement */
9181 if (current_switch->last_case == NULL) {
9182 current_switch->first_case = &statement->case_label;
9184 current_switch->last_case->next = &statement->case_label;
9186 current_switch->last_case = &statement->case_label;
9189 errorf(&statement->base.source_position,
9190 "'default' label not within a switch statement");
9193 statement->case_label.statement = parse_label_inner_statement(statement, "default label");
9200 * Parse a label statement.
9202 static statement_t *parse_label_statement(void)
9204 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9205 label_t *const label = get_label();
9206 statement->label.label = label;
9208 PUSH_PARENT(statement);
9210 /* if statement is already set then the label is defined twice,
9211 * otherwise it was just mentioned in a goto/local label declaration so far
9213 source_position_t const* const pos = &statement->base.source_position;
9214 if (label->statement != NULL) {
9215 errorf(pos, "duplicate '%N' (declared %P)", (entity_t const*)label, &label->base.source_position);
9217 label->base.source_position = *pos;
9218 label->statement = statement;
9223 if (token.kind == T___attribute__ && !(c_mode & _CXX)) {
9224 parse_attributes(NULL); // TODO process attributes
9227 statement->label.statement = parse_label_inner_statement(statement, "label");
9229 /* remember the labels in a list for later checking */
9230 *label_anchor = &statement->label;
9231 label_anchor = &statement->label.next;
9237 static statement_t *parse_inner_statement(void)
9239 statement_t *const stmt = parse_statement();
9240 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
9241 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
9242 if (stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
9243 errorf(&stmt->base.source_position, "declaration as inner statement, use {}");
9249 * Parse an expression in parentheses and mark its variables as read.
9251 static expression_t *parse_condition(void)
9253 expect('(', end_error0);
9254 add_anchor_token(')');
9255 expression_t *const expr = parse_expression();
9256 mark_vars_read(expr, NULL);
9257 rem_anchor_token(')');
9258 expect(')', end_error1);
9262 return create_error_expression();
9266 * Parse an if statement.
9268 static statement_t *parse_if(void)
9270 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9274 PUSH_PARENT(statement);
9276 add_anchor_token('{');
9278 expression_t *const expr = parse_condition();
9279 statement->ifs.condition = expr;
9280 /* §6.8.4.1:1 The controlling expression of an if statement shall have
9282 semantic_condition(expr, "condition of 'if'-statment");
9284 rem_anchor_token('{');
9286 add_anchor_token(T_else);
9287 statement_t *const true_stmt = parse_inner_statement();
9288 statement->ifs.true_statement = true_stmt;
9289 rem_anchor_token(T_else);
9291 if (true_stmt->kind == STATEMENT_EMPTY) {
9292 warningf(WARN_EMPTY_BODY, HERE,
9293 "suggest braces around empty body in an ‘if’ statement");
9296 if (next_if(T_else)) {
9297 statement->ifs.false_statement = parse_inner_statement();
9299 if (statement->ifs.false_statement->kind == STATEMENT_EMPTY) {
9300 warningf(WARN_EMPTY_BODY, HERE,
9301 "suggest braces around empty body in an ‘if’ statement");
9303 } else if (true_stmt->kind == STATEMENT_IF &&
9304 true_stmt->ifs.false_statement != NULL) {
9305 source_position_t const *const pos = &true_stmt->base.source_position;
9306 warningf(WARN_PARENTHESES, pos, "suggest explicit braces to avoid ambiguous 'else'");
9314 * Check that all enums are handled in a switch.
9316 * @param statement the switch statement to check
9318 static void check_enum_cases(const switch_statement_t *statement)
9320 if (!is_warn_on(WARN_SWITCH_ENUM))
9322 const type_t *type = skip_typeref(statement->expression->base.type);
9323 if (! is_type_enum(type))
9325 const enum_type_t *enumt = &type->enumt;
9327 /* if we have a default, no warnings */
9328 if (statement->default_label != NULL)
9331 /* FIXME: calculation of value should be done while parsing */
9332 /* TODO: quadratic algorithm here. Change to an n log n one */
9333 long last_value = -1;
9334 const entity_t *entry = enumt->enume->base.next;
9335 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9336 entry = entry->base.next) {
9337 const expression_t *expression = entry->enum_value.value;
9338 long value = expression != NULL ? fold_constant_to_int(expression) : last_value + 1;
9340 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9341 if (l->expression == NULL)
9343 if (l->first_case <= value && value <= l->last_case) {
9349 source_position_t const *const pos = &statement->base.source_position;
9350 warningf(WARN_SWITCH_ENUM, pos, "'%N' not handled in switch", entry);
9357 * Parse a switch statement.
9359 static statement_t *parse_switch(void)
9361 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9365 PUSH_PARENT(statement);
9367 expression_t *const expr = parse_condition();
9368 type_t * type = skip_typeref(expr->base.type);
9369 if (is_type_integer(type)) {
9370 type = promote_integer(type);
9371 if (get_akind_rank(get_akind(type)) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9372 warningf(WARN_TRADITIONAL, &expr->base.source_position, "'%T' switch expression not converted to '%T' in ISO C", type, type_int);
9374 } else if (is_type_valid(type)) {
9375 errorf(&expr->base.source_position,
9376 "switch quantity is not an integer, but '%T'", type);
9377 type = type_error_type;
9379 statement->switchs.expression = create_implicit_cast(expr, type);
9381 switch_statement_t *rem = current_switch;
9382 current_switch = &statement->switchs;
9383 statement->switchs.body = parse_inner_statement();
9384 current_switch = rem;
9386 if (statement->switchs.default_label == NULL) {
9387 warningf(WARN_SWITCH_DEFAULT, &statement->base.source_position, "switch has no default case");
9389 check_enum_cases(&statement->switchs);
9395 static statement_t *parse_loop_body(statement_t *const loop)
9397 statement_t *const rem = current_loop;
9398 current_loop = loop;
9400 statement_t *const body = parse_inner_statement();
9407 * Parse a while statement.
9409 static statement_t *parse_while(void)
9411 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9415 PUSH_PARENT(statement);
9417 expression_t *const cond = parse_condition();
9418 statement->whiles.condition = cond;
9419 /* §6.8.5:2 The controlling expression of an iteration statement shall
9420 * have scalar type. */
9421 semantic_condition(cond, "condition of 'while'-statement");
9423 statement->whiles.body = parse_loop_body(statement);
9430 * Parse a do statement.
9432 static statement_t *parse_do(void)
9434 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9438 PUSH_PARENT(statement);
9440 add_anchor_token(T_while);
9441 statement->do_while.body = parse_loop_body(statement);
9442 rem_anchor_token(T_while);
9444 expect(T_while, end_error0);
9446 expression_t *const cond = parse_condition();
9447 statement->do_while.condition = cond;
9448 /* §6.8.5:2 The controlling expression of an iteration statement shall
9449 * have scalar type. */
9450 semantic_condition(cond, "condition of 'do-while'-statement");
9451 expect(';', end_error1);
9459 * Parse a for statement.
9461 static statement_t *parse_for(void)
9463 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9467 PUSH_PARENT(statement);
9468 PUSH_SCOPE(&statement->fors.scope);
9470 expect('(', end_error1);
9471 add_anchor_token(')');
9476 } else if (is_declaration_specifier(&token)) {
9477 parse_declaration(record_entity, DECL_FLAGS_NONE);
9479 add_anchor_token(';');
9480 expression_t *const init = parse_expression();
9481 statement->fors.initialisation = init;
9482 mark_vars_read(init, ENT_ANY);
9483 if (!expression_has_effect(init)) {
9484 warningf(WARN_UNUSED_VALUE, &init->base.source_position, "initialisation of 'for'-statement has no effect");
9486 rem_anchor_token(';');
9487 expect(';', end_error3);
9493 if (token.kind != ';') {
9494 add_anchor_token(';');
9495 expression_t *const cond = parse_expression();
9496 statement->fors.condition = cond;
9497 /* §6.8.5:2 The controlling expression of an iteration statement
9498 * shall have scalar type. */
9499 semantic_condition(cond, "condition of 'for'-statement");
9500 mark_vars_read(cond, NULL);
9501 rem_anchor_token(';');
9503 expect(';', end_error2);
9505 if (token.kind != ')') {
9506 expression_t *const step = parse_expression();
9507 statement->fors.step = step;
9508 mark_vars_read(step, ENT_ANY);
9509 if (!expression_has_effect(step)) {
9510 warningf(WARN_UNUSED_VALUE, &step->base.source_position, "step of 'for'-statement has no effect");
9513 rem_anchor_token(')');
9514 expect(')', end_error1);
9516 statement->fors.body = parse_loop_body(statement);
9524 * Parse a goto statement.
9526 static statement_t *parse_goto(void)
9528 statement_t *statement;
9529 if (GNU_MODE && look_ahead(1)->kind == '*') {
9530 statement = allocate_statement_zero(STATEMENT_COMPUTED_GOTO);
9534 expression_t *expression = parse_expression();
9535 mark_vars_read(expression, NULL);
9537 /* Argh: although documentation says the expression must be of type void*,
9538 * gcc accepts anything that can be casted into void* without error */
9539 type_t *type = expression->base.type;
9541 if (type != type_error_type) {
9542 if (!is_type_pointer(type) && !is_type_integer(type)) {
9543 errorf(&expression->base.source_position,
9544 "cannot convert to a pointer type");
9545 } else if (type != type_void_ptr) {
9546 warningf(WARN_OTHER, &expression->base.source_position, "type of computed goto expression should be 'void*' not '%T'", type);
9548 expression = create_implicit_cast(expression, type_void_ptr);
9551 statement->computed_goto.expression = expression;
9553 statement = allocate_statement_zero(STATEMENT_GOTO);
9555 if (token.kind == T_IDENTIFIER) {
9556 label_t *const label = get_label();
9558 statement->gotos.label = label;
9560 /* remember the goto's in a list for later checking */
9561 *goto_anchor = &statement->gotos;
9562 goto_anchor = &statement->gotos.next;
9565 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
9567 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
9569 statement->gotos.label = &allocate_entity_zero(ENTITY_LABEL, NAMESPACE_LABEL, sym_anonymous, &builtin_source_position)->label;
9573 expect(';', end_error);
9580 * Parse a continue statement.
9582 static statement_t *parse_continue(void)
9584 if (current_loop == NULL) {
9585 errorf(HERE, "continue statement not within loop");
9588 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9591 expect(';', end_error);
9598 * Parse a break statement.
9600 static statement_t *parse_break(void)
9602 if (current_switch == NULL && current_loop == NULL) {
9603 errorf(HERE, "break statement not within loop or switch");
9606 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9609 expect(';', end_error);
9616 * Parse a __leave statement.
9618 static statement_t *parse_leave_statement(void)
9620 if (current_try == NULL) {
9621 errorf(HERE, "__leave statement not within __try");
9624 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9627 expect(';', end_error);
9634 * Check if a given entity represents a local variable.
9636 static bool is_local_variable(const entity_t *entity)
9638 if (entity->kind != ENTITY_VARIABLE)
9641 switch ((storage_class_tag_t) entity->declaration.storage_class) {
9642 case STORAGE_CLASS_AUTO:
9643 case STORAGE_CLASS_REGISTER: {
9644 const type_t *type = skip_typeref(entity->declaration.type);
9645 if (is_type_function(type)) {
9657 * Check if a given expression represents a local variable.
9659 static bool expression_is_local_variable(const expression_t *expression)
9661 if (expression->base.kind != EXPR_REFERENCE) {
9664 const entity_t *entity = expression->reference.entity;
9665 return is_local_variable(entity);
9669 * Check if a given expression represents a local variable and
9670 * return its declaration then, else return NULL.
9672 entity_t *expression_is_variable(const expression_t *expression)
9674 if (expression->base.kind != EXPR_REFERENCE) {
9677 entity_t *entity = expression->reference.entity;
9678 if (entity->kind != ENTITY_VARIABLE)
9684 static void err_or_warn(source_position_t const *const pos, char const *const msg)
9686 if (c_mode & _CXX || strict_mode) {
9689 warningf(WARN_OTHER, pos, msg);
9694 * Parse a return statement.
9696 static statement_t *parse_return(void)
9698 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9701 expression_t *return_value = NULL;
9702 if (token.kind != ';') {
9703 return_value = parse_expression();
9704 mark_vars_read(return_value, NULL);
9707 const type_t *const func_type = skip_typeref(current_function->base.type);
9708 assert(is_type_function(func_type));
9709 type_t *const return_type = skip_typeref(func_type->function.return_type);
9711 source_position_t const *const pos = &statement->base.source_position;
9712 if (return_value != NULL) {
9713 type_t *return_value_type = skip_typeref(return_value->base.type);
9715 if (is_type_void(return_type)) {
9716 if (!is_type_void(return_value_type)) {
9717 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
9718 /* Only warn in C mode, because GCC does the same */
9719 err_or_warn(pos, "'return' with a value, in function returning 'void'");
9720 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9721 /* Only warn in C mode, because GCC does the same */
9722 err_or_warn(pos, "'return' with expression in function returning 'void'");
9725 assign_error_t error = semantic_assign(return_type, return_value);
9726 report_assign_error(error, return_type, return_value, "'return'",
9729 return_value = create_implicit_cast(return_value, return_type);
9730 /* check for returning address of a local var */
9731 if (return_value != NULL && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
9732 const expression_t *expression = return_value->unary.value;
9733 if (expression_is_local_variable(expression)) {
9734 warningf(WARN_OTHER, pos, "function returns address of local variable");
9737 } else if (!is_type_void(return_type)) {
9738 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9739 err_or_warn(pos, "'return' without value, in function returning non-void");
9741 statement->returns.value = return_value;
9743 expect(';', end_error);
9750 * Parse a declaration statement.
9752 static statement_t *parse_declaration_statement(void)
9754 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9756 entity_t *before = current_scope->last_entity;
9758 parse_external_declaration();
9760 parse_declaration(record_entity, DECL_FLAGS_NONE);
9763 declaration_statement_t *const decl = &statement->declaration;
9764 entity_t *const begin =
9765 before != NULL ? before->base.next : current_scope->entities;
9766 decl->declarations_begin = begin;
9767 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
9773 * Parse an expression statement, ie. expr ';'.
9775 static statement_t *parse_expression_statement(void)
9777 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
9779 expression_t *const expr = parse_expression();
9780 statement->expression.expression = expr;
9781 mark_vars_read(expr, ENT_ANY);
9783 expect(';', end_error);
9790 * Parse a microsoft __try { } __finally { } or
9791 * __try{ } __except() { }
9793 static statement_t *parse_ms_try_statment(void)
9795 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
9798 PUSH_PARENT(statement);
9800 ms_try_statement_t *rem = current_try;
9801 current_try = &statement->ms_try;
9802 statement->ms_try.try_statement = parse_compound_statement(false);
9807 if (next_if(T___except)) {
9808 expression_t *const expr = parse_condition();
9809 type_t * type = skip_typeref(expr->base.type);
9810 if (is_type_integer(type)) {
9811 type = promote_integer(type);
9812 } else if (is_type_valid(type)) {
9813 errorf(&expr->base.source_position,
9814 "__expect expression is not an integer, but '%T'", type);
9815 type = type_error_type;
9817 statement->ms_try.except_expression = create_implicit_cast(expr, type);
9818 } else if (!next_if(T__finally)) {
9819 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
9821 statement->ms_try.final_statement = parse_compound_statement(false);
9825 static statement_t *parse_empty_statement(void)
9827 warningf(WARN_EMPTY_STATEMENT, HERE, "statement is empty");
9828 statement_t *const statement = create_empty_statement();
9833 static statement_t *parse_local_label_declaration(void)
9835 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9839 entity_t *begin = NULL;
9840 entity_t *end = NULL;
9841 entity_t **anchor = &begin;
9843 source_position_t pos;
9844 symbol_t *const symbol = expect_identifier("while parsing local label declaration", &pos);
9848 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
9849 if (entity != NULL && entity->base.parent_scope == current_scope) {
9850 source_position_t const *const ppos = &entity->base.source_position;
9851 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
9853 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL, NAMESPACE_LABEL, symbol, &pos);
9854 entity->base.parent_scope = current_scope;
9857 anchor = &entity->base.next;
9860 environment_push(entity);
9862 } while (next_if(','));
9863 expect(';', end_error);
9865 statement->declaration.declarations_begin = begin;
9866 statement->declaration.declarations_end = end;
9870 static void parse_namespace_definition(void)
9874 entity_t *entity = NULL;
9875 symbol_t *symbol = NULL;
9877 if (token.kind == T_IDENTIFIER) {
9878 symbol = token.identifier.symbol;
9881 entity = get_entity(symbol, NAMESPACE_NORMAL);
9883 && entity->kind != ENTITY_NAMESPACE
9884 && entity->base.parent_scope == current_scope) {
9885 if (is_entity_valid(entity)) {
9886 error_redefined_as_different_kind(&token.base.source_position,
9887 entity, ENTITY_NAMESPACE);
9893 if (entity == NULL) {
9894 entity = allocate_entity_zero(ENTITY_NAMESPACE, NAMESPACE_NORMAL, symbol, HERE);
9895 entity->base.parent_scope = current_scope;
9898 if (token.kind == '=') {
9899 /* TODO: parse namespace alias */
9900 panic("namespace alias definition not supported yet");
9903 environment_push(entity);
9904 append_entity(current_scope, entity);
9906 PUSH_SCOPE(&entity->namespacee.members);
9908 entity_t *old_current_entity = current_entity;
9909 current_entity = entity;
9911 expect('{', end_error);
9913 expect('}', end_error);
9916 assert(current_entity == entity);
9917 current_entity = old_current_entity;
9922 * Parse a statement.
9923 * There's also parse_statement() which additionally checks for
9924 * "statement has no effect" warnings
9926 static statement_t *intern_parse_statement(void)
9928 /* declaration or statement */
9929 statement_t *statement;
9930 switch (token.kind) {
9931 case T_IDENTIFIER: {
9932 token_kind_t la1_type = (token_kind_t)look_ahead(1)->kind;
9933 if (la1_type == ':') {
9934 statement = parse_label_statement();
9935 } else if (is_typedef_symbol(token.identifier.symbol)) {
9936 statement = parse_declaration_statement();
9938 /* it's an identifier, the grammar says this must be an
9939 * expression statement. However it is common that users mistype
9940 * declaration types, so we guess a bit here to improve robustness
9941 * for incorrect programs */
9945 if (get_entity(token.identifier.symbol, NAMESPACE_NORMAL) != NULL) {
9947 statement = parse_expression_statement();
9951 statement = parse_declaration_statement();
9959 case T___extension__: {
9960 /* This can be a prefix to a declaration or an expression statement.
9961 * We simply eat it now and parse the rest with tail recursion. */
9963 statement = intern_parse_statement();
9969 statement = parse_declaration_statement();
9973 statement = parse_local_label_declaration();
9976 case ';': statement = parse_empty_statement(); break;
9977 case '{': statement = parse_compound_statement(false); break;
9978 case T___leave: statement = parse_leave_statement(); break;
9979 case T___try: statement = parse_ms_try_statment(); break;
9980 case T_asm: statement = parse_asm_statement(); break;
9981 case T_break: statement = parse_break(); break;
9982 case T_case: statement = parse_case_statement(); break;
9983 case T_continue: statement = parse_continue(); break;
9984 case T_default: statement = parse_default_statement(); break;
9985 case T_do: statement = parse_do(); break;
9986 case T_for: statement = parse_for(); break;
9987 case T_goto: statement = parse_goto(); break;
9988 case T_if: statement = parse_if(); break;
9989 case T_return: statement = parse_return(); break;
9990 case T_switch: statement = parse_switch(); break;
9991 case T_while: statement = parse_while(); break;
9994 statement = parse_expression_statement();
9998 errorf(HERE, "unexpected token %K while parsing statement", &token);
9999 statement = create_error_statement();
10000 eat_until_anchor();
10008 * parse a statement and emits "statement has no effect" warning if needed
10009 * (This is really a wrapper around intern_parse_statement with check for 1
10010 * single warning. It is needed, because for statement expressions we have
10011 * to avoid the warning on the last statement)
10013 static statement_t *parse_statement(void)
10015 statement_t *statement = intern_parse_statement();
10017 if (statement->kind == STATEMENT_EXPRESSION) {
10018 expression_t *expression = statement->expression.expression;
10019 if (!expression_has_effect(expression)) {
10020 warningf(WARN_UNUSED_VALUE, &expression->base.source_position, "statement has no effect");
10028 * Parse a compound statement.
10030 static statement_t *parse_compound_statement(bool inside_expression_statement)
10032 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
10034 PUSH_PARENT(statement);
10035 PUSH_SCOPE(&statement->compound.scope);
10038 add_anchor_token('}');
10039 /* tokens, which can start a statement */
10040 /* TODO MS, __builtin_FOO */
10041 add_anchor_token('!');
10042 add_anchor_token('&');
10043 add_anchor_token('(');
10044 add_anchor_token('*');
10045 add_anchor_token('+');
10046 add_anchor_token('-');
10047 add_anchor_token(';');
10048 add_anchor_token('{');
10049 add_anchor_token('~');
10050 add_anchor_token(T_CHARACTER_CONSTANT);
10051 add_anchor_token(T_COLONCOLON);
10052 add_anchor_token(T_FLOATINGPOINT);
10053 add_anchor_token(T_IDENTIFIER);
10054 add_anchor_token(T_INTEGER);
10055 add_anchor_token(T_MINUSMINUS);
10056 add_anchor_token(T_PLUSPLUS);
10057 add_anchor_token(T_STRING_LITERAL);
10058 add_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10059 add_anchor_token(T_WIDE_STRING_LITERAL);
10060 add_anchor_token(T__Bool);
10061 add_anchor_token(T__Complex);
10062 add_anchor_token(T__Imaginary);
10063 add_anchor_token(T___FUNCTION__);
10064 add_anchor_token(T___PRETTY_FUNCTION__);
10065 add_anchor_token(T___alignof__);
10066 add_anchor_token(T___attribute__);
10067 add_anchor_token(T___builtin_va_start);
10068 add_anchor_token(T___extension__);
10069 add_anchor_token(T___func__);
10070 add_anchor_token(T___imag__);
10071 add_anchor_token(T___label__);
10072 add_anchor_token(T___real__);
10073 add_anchor_token(T___thread);
10074 add_anchor_token(T_asm);
10075 add_anchor_token(T_auto);
10076 add_anchor_token(T_bool);
10077 add_anchor_token(T_break);
10078 add_anchor_token(T_case);
10079 add_anchor_token(T_char);
10080 add_anchor_token(T_class);
10081 add_anchor_token(T_const);
10082 add_anchor_token(T_const_cast);
10083 add_anchor_token(T_continue);
10084 add_anchor_token(T_default);
10085 add_anchor_token(T_delete);
10086 add_anchor_token(T_double);
10087 add_anchor_token(T_do);
10088 add_anchor_token(T_dynamic_cast);
10089 add_anchor_token(T_enum);
10090 add_anchor_token(T_extern);
10091 add_anchor_token(T_false);
10092 add_anchor_token(T_float);
10093 add_anchor_token(T_for);
10094 add_anchor_token(T_goto);
10095 add_anchor_token(T_if);
10096 add_anchor_token(T_inline);
10097 add_anchor_token(T_int);
10098 add_anchor_token(T_long);
10099 add_anchor_token(T_new);
10100 add_anchor_token(T_operator);
10101 add_anchor_token(T_register);
10102 add_anchor_token(T_reinterpret_cast);
10103 add_anchor_token(T_restrict);
10104 add_anchor_token(T_return);
10105 add_anchor_token(T_short);
10106 add_anchor_token(T_signed);
10107 add_anchor_token(T_sizeof);
10108 add_anchor_token(T_static);
10109 add_anchor_token(T_static_cast);
10110 add_anchor_token(T_struct);
10111 add_anchor_token(T_switch);
10112 add_anchor_token(T_template);
10113 add_anchor_token(T_this);
10114 add_anchor_token(T_throw);
10115 add_anchor_token(T_true);
10116 add_anchor_token(T_try);
10117 add_anchor_token(T_typedef);
10118 add_anchor_token(T_typeid);
10119 add_anchor_token(T_typename);
10120 add_anchor_token(T_typeof);
10121 add_anchor_token(T_union);
10122 add_anchor_token(T_unsigned);
10123 add_anchor_token(T_using);
10124 add_anchor_token(T_void);
10125 add_anchor_token(T_volatile);
10126 add_anchor_token(T_wchar_t);
10127 add_anchor_token(T_while);
10129 statement_t **anchor = &statement->compound.statements;
10130 bool only_decls_so_far = true;
10131 while (token.kind != '}' && token.kind != T_EOF) {
10132 statement_t *sub_statement = intern_parse_statement();
10133 if (sub_statement->kind == STATEMENT_ERROR) {
10137 if (sub_statement->kind != STATEMENT_DECLARATION) {
10138 only_decls_so_far = false;
10139 } else if (!only_decls_so_far) {
10140 source_position_t const *const pos = &sub_statement->base.source_position;
10141 warningf(WARN_DECLARATION_AFTER_STATEMENT, pos, "ISO C90 forbids mixed declarations and code");
10144 *anchor = sub_statement;
10145 anchor = &sub_statement->base.next;
10147 expect('}', end_error);
10150 /* look over all statements again to produce no effect warnings */
10151 if (is_warn_on(WARN_UNUSED_VALUE)) {
10152 statement_t *sub_statement = statement->compound.statements;
10153 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
10154 if (sub_statement->kind != STATEMENT_EXPRESSION)
10156 /* don't emit a warning for the last expression in an expression
10157 * statement as it has always an effect */
10158 if (inside_expression_statement && sub_statement->base.next == NULL)
10161 expression_t *expression = sub_statement->expression.expression;
10162 if (!expression_has_effect(expression)) {
10163 warningf(WARN_UNUSED_VALUE, &expression->base.source_position, "statement has no effect");
10168 rem_anchor_token(T_while);
10169 rem_anchor_token(T_wchar_t);
10170 rem_anchor_token(T_volatile);
10171 rem_anchor_token(T_void);
10172 rem_anchor_token(T_using);
10173 rem_anchor_token(T_unsigned);
10174 rem_anchor_token(T_union);
10175 rem_anchor_token(T_typeof);
10176 rem_anchor_token(T_typename);
10177 rem_anchor_token(T_typeid);
10178 rem_anchor_token(T_typedef);
10179 rem_anchor_token(T_try);
10180 rem_anchor_token(T_true);
10181 rem_anchor_token(T_throw);
10182 rem_anchor_token(T_this);
10183 rem_anchor_token(T_template);
10184 rem_anchor_token(T_switch);
10185 rem_anchor_token(T_struct);
10186 rem_anchor_token(T_static_cast);
10187 rem_anchor_token(T_static);
10188 rem_anchor_token(T_sizeof);
10189 rem_anchor_token(T_signed);
10190 rem_anchor_token(T_short);
10191 rem_anchor_token(T_return);
10192 rem_anchor_token(T_restrict);
10193 rem_anchor_token(T_reinterpret_cast);
10194 rem_anchor_token(T_register);
10195 rem_anchor_token(T_operator);
10196 rem_anchor_token(T_new);
10197 rem_anchor_token(T_long);
10198 rem_anchor_token(T_int);
10199 rem_anchor_token(T_inline);
10200 rem_anchor_token(T_if);
10201 rem_anchor_token(T_goto);
10202 rem_anchor_token(T_for);
10203 rem_anchor_token(T_float);
10204 rem_anchor_token(T_false);
10205 rem_anchor_token(T_extern);
10206 rem_anchor_token(T_enum);
10207 rem_anchor_token(T_dynamic_cast);
10208 rem_anchor_token(T_do);
10209 rem_anchor_token(T_double);
10210 rem_anchor_token(T_delete);
10211 rem_anchor_token(T_default);
10212 rem_anchor_token(T_continue);
10213 rem_anchor_token(T_const_cast);
10214 rem_anchor_token(T_const);
10215 rem_anchor_token(T_class);
10216 rem_anchor_token(T_char);
10217 rem_anchor_token(T_case);
10218 rem_anchor_token(T_break);
10219 rem_anchor_token(T_bool);
10220 rem_anchor_token(T_auto);
10221 rem_anchor_token(T_asm);
10222 rem_anchor_token(T___thread);
10223 rem_anchor_token(T___real__);
10224 rem_anchor_token(T___label__);
10225 rem_anchor_token(T___imag__);
10226 rem_anchor_token(T___func__);
10227 rem_anchor_token(T___extension__);
10228 rem_anchor_token(T___builtin_va_start);
10229 rem_anchor_token(T___attribute__);
10230 rem_anchor_token(T___alignof__);
10231 rem_anchor_token(T___PRETTY_FUNCTION__);
10232 rem_anchor_token(T___FUNCTION__);
10233 rem_anchor_token(T__Imaginary);
10234 rem_anchor_token(T__Complex);
10235 rem_anchor_token(T__Bool);
10236 rem_anchor_token(T_WIDE_STRING_LITERAL);
10237 rem_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10238 rem_anchor_token(T_STRING_LITERAL);
10239 rem_anchor_token(T_PLUSPLUS);
10240 rem_anchor_token(T_MINUSMINUS);
10241 rem_anchor_token(T_INTEGER);
10242 rem_anchor_token(T_IDENTIFIER);
10243 rem_anchor_token(T_FLOATINGPOINT);
10244 rem_anchor_token(T_COLONCOLON);
10245 rem_anchor_token(T_CHARACTER_CONSTANT);
10246 rem_anchor_token('~');
10247 rem_anchor_token('{');
10248 rem_anchor_token(';');
10249 rem_anchor_token('-');
10250 rem_anchor_token('+');
10251 rem_anchor_token('*');
10252 rem_anchor_token('(');
10253 rem_anchor_token('&');
10254 rem_anchor_token('!');
10255 rem_anchor_token('}');
10263 * Check for unused global static functions and variables
10265 static void check_unused_globals(void)
10267 if (!is_warn_on(WARN_UNUSED_FUNCTION) && !is_warn_on(WARN_UNUSED_VARIABLE))
10270 for (const entity_t *entity = file_scope->entities; entity != NULL;
10271 entity = entity->base.next) {
10272 if (!is_declaration(entity))
10275 const declaration_t *declaration = &entity->declaration;
10276 if (declaration->used ||
10277 declaration->modifiers & DM_UNUSED ||
10278 declaration->modifiers & DM_USED ||
10279 declaration->storage_class != STORAGE_CLASS_STATIC)
10284 if (entity->kind == ENTITY_FUNCTION) {
10285 /* inhibit warning for static inline functions */
10286 if (entity->function.is_inline)
10289 why = WARN_UNUSED_FUNCTION;
10290 s = entity->function.statement != NULL ? "defined" : "declared";
10292 why = WARN_UNUSED_VARIABLE;
10296 warningf(why, &declaration->base.source_position, "'%#N' %s but not used", entity, s);
10300 static void parse_global_asm(void)
10302 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10305 expect('(', end_error);
10307 statement->asms.asm_text = parse_string_literals();
10308 statement->base.next = unit->global_asm;
10309 unit->global_asm = statement;
10311 expect(')', end_error);
10312 expect(';', end_error);
10317 static void parse_linkage_specification(void)
10321 source_position_t const pos = *HERE;
10322 char const *const linkage = parse_string_literals().begin;
10324 linkage_kind_t old_linkage = current_linkage;
10325 linkage_kind_t new_linkage;
10326 if (streq(linkage, "C")) {
10327 new_linkage = LINKAGE_C;
10328 } else if (streq(linkage, "C++")) {
10329 new_linkage = LINKAGE_CXX;
10331 errorf(&pos, "linkage string \"%s\" not recognized", linkage);
10332 new_linkage = LINKAGE_C;
10334 current_linkage = new_linkage;
10336 if (next_if('{')) {
10338 expect('}', end_error);
10344 assert(current_linkage == new_linkage);
10345 current_linkage = old_linkage;
10348 static void parse_external(void)
10350 switch (token.kind) {
10352 if (look_ahead(1)->kind == T_STRING_LITERAL) {
10353 parse_linkage_specification();
10355 DECLARATION_START_NO_EXTERN
10357 case T___extension__:
10358 /* tokens below are for implicit int */
10359 case '&': /* & x; -> int& x; (and error later, because C++ has no
10361 case '*': /* * x; -> int* x; */
10362 case '(': /* (x); -> int (x); */
10364 parse_external_declaration();
10370 parse_global_asm();
10374 parse_namespace_definition();
10378 if (!strict_mode) {
10379 warningf(WARN_STRAY_SEMICOLON, HERE, "stray ';' outside of function");
10386 errorf(HERE, "stray %K outside of function", &token);
10387 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10388 eat_until_matching_token(token.kind);
10394 static void parse_externals(void)
10396 add_anchor_token('}');
10397 add_anchor_token(T_EOF);
10400 /* make a copy of the anchor set, so we can check if it is restored after parsing */
10401 unsigned short token_anchor_copy[T_LAST_TOKEN];
10402 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10405 while (token.kind != T_EOF && token.kind != '}') {
10407 for (int i = 0; i < T_LAST_TOKEN; ++i) {
10408 unsigned short count = token_anchor_set[i] - token_anchor_copy[i];
10410 /* the anchor set and its copy differs */
10411 internal_errorf(HERE, "Leaked anchor token %k %d times", i, count);
10414 if (in_gcc_extension) {
10415 /* an gcc extension scope was not closed */
10416 internal_errorf(HERE, "Leaked __extension__");
10423 rem_anchor_token(T_EOF);
10424 rem_anchor_token('}');
10428 * Parse a translation unit.
10430 static void parse_translation_unit(void)
10432 add_anchor_token(T_EOF);
10437 if (token.kind == T_EOF)
10440 errorf(HERE, "stray %K outside of function", &token);
10441 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10442 eat_until_matching_token(token.kind);
10447 void set_default_visibility(elf_visibility_tag_t visibility)
10449 default_visibility = visibility;
10455 * @return the translation unit or NULL if errors occurred.
10457 void start_parsing(void)
10459 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10460 label_stack = NEW_ARR_F(stack_entry_t, 0);
10461 diagnostic_count = 0;
10465 print_to_file(stderr);
10467 assert(unit == NULL);
10468 unit = allocate_ast_zero(sizeof(unit[0]));
10470 assert(file_scope == NULL);
10471 file_scope = &unit->scope;
10473 assert(current_scope == NULL);
10474 scope_push(&unit->scope);
10476 create_gnu_builtins();
10478 create_microsoft_intrinsics();
10481 translation_unit_t *finish_parsing(void)
10483 assert(current_scope == &unit->scope);
10486 assert(file_scope == &unit->scope);
10487 check_unused_globals();
10490 DEL_ARR_F(environment_stack);
10491 DEL_ARR_F(label_stack);
10493 translation_unit_t *result = unit;
10498 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
10499 * are given length one. */
10500 static void complete_incomplete_arrays(void)
10502 size_t n = ARR_LEN(incomplete_arrays);
10503 for (size_t i = 0; i != n; ++i) {
10504 declaration_t *const decl = incomplete_arrays[i];
10505 type_t *const type = skip_typeref(decl->type);
10507 if (!is_type_incomplete(type))
10510 source_position_t const *const pos = &decl->base.source_position;
10511 warningf(WARN_OTHER, pos, "array '%#N' assumed to have one element", (entity_t const*)decl);
10513 type_t *const new_type = duplicate_type(type);
10514 new_type->array.size_constant = true;
10515 new_type->array.has_implicit_size = true;
10516 new_type->array.size = 1;
10518 type_t *const result = identify_new_type(new_type);
10520 decl->type = result;
10524 void prepare_main_collect2(entity_t *entity)
10526 PUSH_SCOPE(&entity->function.statement->compound.scope);
10528 // create call to __main
10529 symbol_t *symbol = symbol_table_insert("__main");
10530 entity_t *subsubmain_ent
10531 = create_implicit_function(symbol, &builtin_source_position);
10533 expression_t *ref = allocate_expression_zero(EXPR_REFERENCE);
10534 type_t *ftype = subsubmain_ent->declaration.type;
10535 ref->base.source_position = builtin_source_position;
10536 ref->base.type = make_pointer_type(ftype, TYPE_QUALIFIER_NONE);
10537 ref->reference.entity = subsubmain_ent;
10539 expression_t *call = allocate_expression_zero(EXPR_CALL);
10540 call->base.source_position = builtin_source_position;
10541 call->base.type = type_void;
10542 call->call.function = ref;
10544 statement_t *expr_statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10545 expr_statement->base.source_position = builtin_source_position;
10546 expr_statement->expression.expression = call;
10548 statement_t *statement = entity->function.statement;
10549 assert(statement->kind == STATEMENT_COMPOUND);
10550 compound_statement_t *compounds = &statement->compound;
10552 expr_statement->base.next = compounds->statements;
10553 compounds->statements = expr_statement;
10560 lookahead_bufpos = 0;
10561 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10564 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
10565 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
10566 parse_translation_unit();
10567 complete_incomplete_arrays();
10568 DEL_ARR_F(incomplete_arrays);
10569 incomplete_arrays = NULL;
10573 * Initialize the parser.
10575 void init_parser(void)
10577 sym_anonymous = symbol_table_insert("<anonymous>");
10579 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10581 init_expression_parsers();
10582 obstack_init(&temp_obst);
10586 * Terminate the parser.
10588 void exit_parser(void)
10590 obstack_free(&temp_obst, NULL);