2 * This file is part of cparser.
3 * Copyright (C) 2007-2009 Matthias Braun <matze@braunis.de>
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * as published by the Free Software Foundation; either version 2
8 * of the License, or (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
27 #include "adt/strutil.h"
29 #include "diagnostic.h"
30 #include "format_check.h"
31 #include "preprocessor.h"
36 #include "type_hash.h"
39 #include "attribute_t.h"
40 #include "lang_features.h"
45 #include "adt/bitfiddle.h"
46 #include "adt/error.h"
47 #include "adt/array.h"
49 //#define PRINT_TOKENS
50 #define MAX_LOOKAHEAD 1
55 entity_namespace_t namespc;
58 typedef struct declaration_specifiers_t declaration_specifiers_t;
59 struct declaration_specifiers_t {
60 source_position_t source_position;
61 storage_class_t storage_class;
62 unsigned char alignment; /**< Alignment, 0 if not set. */
64 bool thread_local : 1;
65 attribute_t *attributes; /**< list of attributes */
70 * An environment for parsing initializers (and compound literals).
72 typedef struct parse_initializer_env_t {
73 type_t *type; /**< the type of the initializer. In case of an
74 array type with unspecified size this gets
75 adjusted to the actual size. */
76 entity_t *entity; /**< the variable that is initialized if any */
77 bool must_be_constant;
78 } parse_initializer_env_t;
80 typedef entity_t* (*parsed_declaration_func) (entity_t *declaration, bool is_definition);
82 /** The current token. */
84 /** The lookahead ring-buffer. */
85 static token_t lookahead_buffer[MAX_LOOKAHEAD];
86 /** Position of the next token in the lookahead buffer. */
87 static size_t lookahead_bufpos;
88 static stack_entry_t *environment_stack = NULL;
89 static stack_entry_t *label_stack = NULL;
90 static scope_t *file_scope = NULL;
91 static scope_t *current_scope = NULL;
92 /** Point to the current function declaration if inside a function. */
93 static function_t *current_function = NULL;
94 static entity_t *current_entity = NULL;
95 static switch_statement_t *current_switch = NULL;
96 static statement_t *current_loop = NULL;
97 static statement_t *current_parent = NULL;
98 static ms_try_statement_t *current_try = NULL;
99 static linkage_kind_t current_linkage;
100 static goto_statement_t *goto_first = NULL;
101 static goto_statement_t **goto_anchor = NULL;
102 static label_statement_t *label_first = NULL;
103 static label_statement_t **label_anchor = NULL;
104 /** current translation unit. */
105 static translation_unit_t *unit = NULL;
106 /** true if we are in an __extension__ context. */
107 static bool in_gcc_extension = false;
108 static struct obstack temp_obst;
109 static entity_t *anonymous_entity;
110 static declaration_t **incomplete_arrays;
111 static elf_visibility_tag_t default_visibility = ELF_VISIBILITY_DEFAULT;
114 #define PUSH_CURRENT_ENTITY(entity) \
115 entity_t *const new_current_entity = (entity); \
116 entity_t *const old_current_entity = current_entity; \
117 ((void)(current_entity = new_current_entity))
118 #define POP_CURRENT_ENTITY() (assert(current_entity == new_current_entity), (void)(current_entity = old_current_entity))
120 #define PUSH_PARENT(stmt) \
121 statement_t *const new_parent = (stmt); \
122 statement_t *const old_parent = current_parent; \
123 ((void)(current_parent = new_parent))
124 #define POP_PARENT() (assert(current_parent == new_parent), (void)(current_parent = old_parent))
126 #define PUSH_SCOPE(scope) \
127 size_t const top = environment_top(); \
128 scope_t *const new_scope = (scope); \
129 scope_t *const old_scope = (new_scope ? scope_push(new_scope) : NULL)
130 #define PUSH_SCOPE_STATEMENT(scope) PUSH_SCOPE(c_mode & (_C99 | _CXX) ? (scope) : NULL)
131 #define POP_SCOPE() (new_scope ? assert(current_scope == new_scope), scope_pop(old_scope), environment_pop_to(top) : (void)0)
133 #define PUSH_EXTENSION() \
135 bool const old_gcc_extension = in_gcc_extension; \
136 while (accept(T___extension__)) { \
137 in_gcc_extension = true; \
140 #define POP_EXTENSION() \
141 ((void)(in_gcc_extension = old_gcc_extension))
143 /** The token anchor set */
144 static unsigned short token_anchor_set[T_LAST_TOKEN];
146 /** The current source position. */
147 #define HERE (&token.base.source_position)
149 /** true if we are in GCC mode. */
150 #define GNU_MODE ((c_mode & _GNUC) || in_gcc_extension)
152 static statement_t *parse_compound_statement(bool inside_expression_statement);
153 static statement_t *parse_statement(void);
155 static expression_t *parse_subexpression(precedence_t);
156 static expression_t *parse_expression(void);
157 static type_t *parse_typename(void);
158 static void parse_externals(void);
159 static void parse_external(void);
161 static void parse_compound_type_entries(compound_t *compound_declaration);
163 static void check_call_argument(type_t *expected_type,
164 call_argument_t *argument, unsigned pos);
166 typedef enum declarator_flags_t {
168 DECL_MAY_BE_ABSTRACT = 1U << 0,
169 DECL_CREATE_COMPOUND_MEMBER = 1U << 1,
170 DECL_IS_PARAMETER = 1U << 2
171 } declarator_flags_t;
173 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
174 declarator_flags_t flags);
176 static void semantic_comparison(binary_expression_t *expression);
178 #define STORAGE_CLASSES \
179 STORAGE_CLASSES_NO_EXTERN \
182 #define STORAGE_CLASSES_NO_EXTERN \
187 case T__Thread_local:
189 #define TYPE_QUALIFIERS \
194 case T__forceinline: \
195 case T___attribute__:
197 #define COMPLEX_SPECIFIERS \
199 #define IMAGINARY_SPECIFIERS \
202 #define TYPE_SPECIFIERS \
204 case T___builtin_va_list: \
229 #define DECLARATION_START \
234 #define DECLARATION_START_NO_EXTERN \
235 STORAGE_CLASSES_NO_EXTERN \
239 #define EXPRESSION_START \
248 case T_CHARACTER_CONSTANT: \
252 case T_STRING_LITERAL: \
254 case T___FUNCDNAME__: \
255 case T___FUNCSIG__: \
256 case T___PRETTY_FUNCTION__: \
257 case T___builtin_classify_type: \
258 case T___builtin_constant_p: \
259 case T___builtin_isgreater: \
260 case T___builtin_isgreaterequal: \
261 case T___builtin_isless: \
262 case T___builtin_islessequal: \
263 case T___builtin_islessgreater: \
264 case T___builtin_isunordered: \
265 case T___builtin_offsetof: \
266 case T___builtin_va_arg: \
267 case T___builtin_va_copy: \
268 case T___builtin_va_start: \
279 * Returns the size of a statement node.
281 * @param kind the statement kind
283 static size_t get_statement_struct_size(statement_kind_t kind)
285 static const size_t sizes[] = {
286 [STATEMENT_ERROR] = sizeof(statement_base_t),
287 [STATEMENT_EMPTY] = sizeof(statement_base_t),
288 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
289 [STATEMENT_RETURN] = sizeof(return_statement_t),
290 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
291 [STATEMENT_IF] = sizeof(if_statement_t),
292 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
293 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
294 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
295 [STATEMENT_BREAK] = sizeof(statement_base_t),
296 [STATEMENT_COMPUTED_GOTO] = sizeof(computed_goto_statement_t),
297 [STATEMENT_GOTO] = sizeof(goto_statement_t),
298 [STATEMENT_LABEL] = sizeof(label_statement_t),
299 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
300 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
301 [STATEMENT_FOR] = sizeof(for_statement_t),
302 [STATEMENT_ASM] = sizeof(asm_statement_t),
303 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
304 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
306 assert((size_t)kind < lengthof(sizes));
307 assert(sizes[kind] != 0);
312 * Returns the size of an expression node.
314 * @param kind the expression kind
316 static size_t get_expression_struct_size(expression_kind_t kind)
318 static const size_t sizes[] = {
319 [EXPR_ERROR] = sizeof(expression_base_t),
320 [EXPR_REFERENCE] = sizeof(reference_expression_t),
321 [EXPR_ENUM_CONSTANT] = sizeof(reference_expression_t),
322 [EXPR_LITERAL_BOOLEAN] = sizeof(literal_expression_t),
323 [EXPR_LITERAL_INTEGER] = sizeof(literal_expression_t),
324 [EXPR_LITERAL_FLOATINGPOINT] = sizeof(literal_expression_t),
325 [EXPR_LITERAL_CHARACTER] = sizeof(string_literal_expression_t),
326 [EXPR_LITERAL_MS_NOOP] = sizeof(literal_expression_t),
327 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
328 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
329 [EXPR_CALL] = sizeof(call_expression_t),
330 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
331 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
332 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
333 [EXPR_SELECT] = sizeof(select_expression_t),
334 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
335 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
336 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
337 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
338 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
339 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
340 [EXPR_BUILTIN_TYPES_COMPATIBLE_P] = sizeof(builtin_types_compatible_expression_t),
341 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
342 [EXPR_VA_START] = sizeof(va_start_expression_t),
343 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
344 [EXPR_VA_COPY] = sizeof(va_copy_expression_t),
345 [EXPR_STATEMENT] = sizeof(statement_expression_t),
346 [EXPR_LABEL_ADDRESS] = sizeof(label_address_expression_t),
348 if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
349 return sizes[EXPR_UNARY_FIRST];
351 if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
352 return sizes[EXPR_BINARY_FIRST];
354 assert((size_t)kind < lengthof(sizes));
355 assert(sizes[kind] != 0);
360 * Allocate a statement node of given kind and initialize all
361 * fields with zero. Sets its source position to the position
362 * of the current token.
364 static statement_t *allocate_statement_zero(statement_kind_t kind)
366 size_t size = get_statement_struct_size(kind);
367 statement_t *res = allocate_ast_zero(size);
369 res->base.kind = kind;
370 res->base.parent = current_parent;
371 res->base.source_position = *HERE;
376 * Allocate an expression node of given kind and initialize all
379 * @param kind the kind of the expression to allocate
381 static expression_t *allocate_expression_zero(expression_kind_t kind)
383 size_t size = get_expression_struct_size(kind);
384 expression_t *res = allocate_ast_zero(size);
386 res->base.kind = kind;
387 res->base.type = type_error_type;
388 res->base.source_position = *HERE;
393 * Creates a new invalid expression at the source position
394 * of the current token.
396 static expression_t *create_error_expression(void)
398 expression_t *expression = allocate_expression_zero(EXPR_ERROR);
399 expression->base.type = type_error_type;
404 * Creates a new invalid statement.
406 static statement_t *create_error_statement(void)
408 return allocate_statement_zero(STATEMENT_ERROR);
412 * Allocate a new empty statement.
414 static statement_t *create_empty_statement(void)
416 return allocate_statement_zero(STATEMENT_EMPTY);
420 * Returns the size of an initializer node.
422 * @param kind the initializer kind
424 static size_t get_initializer_size(initializer_kind_t kind)
426 static const size_t sizes[] = {
427 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
428 [INITIALIZER_STRING] = sizeof(initializer_value_t),
429 [INITIALIZER_LIST] = sizeof(initializer_list_t),
430 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
432 assert((size_t)kind < lengthof(sizes));
433 assert(sizes[kind] != 0);
438 * Allocate an initializer node of given kind and initialize all
441 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
443 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
450 * Returns the index of the top element of the environment stack.
452 static size_t environment_top(void)
454 return ARR_LEN(environment_stack);
458 * Returns the index of the top element of the global label stack.
460 static size_t label_top(void)
462 return ARR_LEN(label_stack);
466 * Return the next token.
468 static inline void next_token(void)
470 token = lookahead_buffer[lookahead_bufpos];
471 lookahead_buffer[lookahead_bufpos] = pp_token;
472 next_preprocessing_token();
474 lookahead_bufpos = (lookahead_bufpos + 1) % MAX_LOOKAHEAD;
477 print_token(stderr, &token);
478 fprintf(stderr, "\n");
482 static inline void eat(token_kind_t const kind)
484 assert(token.kind == kind);
490 * Consume the current token, if it is of the expected kind.
492 * @param kind The kind of token to consume.
493 * @return Whether the token was consumed.
495 static inline bool accept(token_kind_t const kind)
497 if (token.kind == kind) {
506 * Return the next token with a given lookahead.
508 static inline const token_t *look_ahead(size_t num)
510 assert(0 < num && num <= MAX_LOOKAHEAD);
511 size_t pos = (lookahead_bufpos + num - 1) % MAX_LOOKAHEAD;
512 return &lookahead_buffer[pos];
516 * Adds a token type to the token type anchor set (a multi-set).
518 static void add_anchor_token(token_kind_t const token_kind)
520 assert(token_kind < T_LAST_TOKEN);
521 ++token_anchor_set[token_kind];
525 * Remove a token type from the token type anchor set (a multi-set).
527 static void rem_anchor_token(token_kind_t const token_kind)
529 assert(token_kind < T_LAST_TOKEN);
530 assert(token_anchor_set[token_kind] != 0);
531 --token_anchor_set[token_kind];
535 * Eat tokens until a matching token type is found.
537 static void eat_until_matching_token(token_kind_t const type)
539 token_kind_t end_token;
541 case '(': end_token = ')'; break;
542 case '{': end_token = '}'; break;
543 case '[': end_token = ']'; break;
544 default: end_token = type; break;
547 unsigned parenthesis_count = 0;
548 unsigned brace_count = 0;
549 unsigned bracket_count = 0;
550 while (token.kind != end_token ||
551 parenthesis_count != 0 ||
553 bracket_count != 0) {
554 switch (token.kind) {
556 case '(': ++parenthesis_count; break;
557 case '{': ++brace_count; break;
558 case '[': ++bracket_count; break;
561 if (parenthesis_count > 0)
571 if (bracket_count > 0)
574 if (token.kind == end_token &&
575 parenthesis_count == 0 &&
589 * Eat input tokens until an anchor is found.
591 static void eat_until_anchor(void)
593 while (token_anchor_set[token.kind] == 0) {
594 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
595 eat_until_matching_token(token.kind);
601 * Eat a whole block from input tokens.
603 static void eat_block(void)
605 eat_until_matching_token('{');
610 * Report a parse error because an expected token was not found.
613 #if defined __GNUC__ && __GNUC__ >= 4
614 __attribute__((sentinel))
616 void parse_error_expected(const char *message, ...)
618 if (message != NULL) {
619 errorf(HERE, "%s", message);
622 va_start(ap, message);
623 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
628 * Report an incompatible type.
630 static void type_error_incompatible(const char *msg,
631 const source_position_t *source_position, type_t *type1, type_t *type2)
633 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
637 static bool skip_till(token_kind_t const expected, char const *const context)
639 if (UNLIKELY(token.kind != expected)) {
640 parse_error_expected(context, expected, NULL);
641 add_anchor_token(expected);
643 rem_anchor_token(expected);
644 if (token.kind != expected)
651 * Expect the current token is the expected token.
652 * If not, generate an error and skip until the next anchor.
654 static void expect(token_kind_t const expected)
656 if (skip_till(expected, NULL))
660 static symbol_t *expect_identifier(char const *const context, source_position_t *const pos)
662 if (!skip_till(T_IDENTIFIER, context))
664 symbol_t *const sym = token.base.symbol;
672 * Push a given scope on the scope stack and make it the
675 static scope_t *scope_push(scope_t *new_scope)
677 if (current_scope != NULL) {
678 new_scope->depth = current_scope->depth + 1;
681 scope_t *old_scope = current_scope;
682 current_scope = new_scope;
687 * Pop the current scope from the scope stack.
689 static void scope_pop(scope_t *old_scope)
691 current_scope = old_scope;
695 * Search an entity by its symbol in a given namespace.
697 static entity_t *get_entity(const symbol_t *const symbol,
698 namespace_tag_t namespc)
700 entity_t *entity = symbol->entity;
701 for (; entity != NULL; entity = entity->base.symbol_next) {
702 if ((namespace_tag_t)entity->base.namespc == namespc)
709 /* §6.2.3:1 24) There is only one name space for tags even though three are
711 static entity_t *get_tag(symbol_t const *const symbol,
712 entity_kind_tag_t const kind)
714 entity_t *entity = get_entity(symbol, NAMESPACE_TAG);
715 if (entity != NULL && (entity_kind_tag_t)entity->kind != kind) {
717 "'%Y' defined as wrong kind of tag (previous definition %P)",
718 symbol, &entity->base.source_position);
725 * pushs an entity on the environment stack and links the corresponding symbol
728 static void stack_push(stack_entry_t **stack_ptr, entity_t *entity)
730 symbol_t *symbol = entity->base.symbol;
731 entity_namespace_t namespc = entity->base.namespc;
732 assert(namespc != 0);
734 /* replace/add entity into entity list of the symbol */
737 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
742 /* replace an entry? */
743 if (iter->base.namespc == namespc) {
744 entity->base.symbol_next = iter->base.symbol_next;
750 /* remember old declaration */
752 entry.symbol = symbol;
753 entry.old_entity = iter;
754 entry.namespc = namespc;
755 ARR_APP1(stack_entry_t, *stack_ptr, entry);
759 * Push an entity on the environment stack.
761 static void environment_push(entity_t *entity)
763 assert(entity->base.source_position.input_name != NULL);
764 assert(entity->base.parent_scope != NULL);
765 stack_push(&environment_stack, entity);
769 * Push a declaration on the global label stack.
771 * @param declaration the declaration
773 static void label_push(entity_t *label)
775 /* we abuse the parameters scope as parent for the labels */
776 label->base.parent_scope = ¤t_function->parameters;
777 stack_push(&label_stack, label);
781 * pops symbols from the environment stack until @p new_top is the top element
783 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
785 stack_entry_t *stack = *stack_ptr;
786 size_t top = ARR_LEN(stack);
789 assert(new_top <= top);
793 for (i = top; i > new_top; --i) {
794 stack_entry_t *entry = &stack[i - 1];
796 entity_t *old_entity = entry->old_entity;
797 symbol_t *symbol = entry->symbol;
798 entity_namespace_t namespc = entry->namespc;
800 /* replace with old_entity/remove */
803 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
805 assert(iter != NULL);
806 /* replace an entry? */
807 if (iter->base.namespc == namespc)
811 /* restore definition from outer scopes (if there was one) */
812 if (old_entity != NULL) {
813 old_entity->base.symbol_next = iter->base.symbol_next;
814 *anchor = old_entity;
816 /* remove entry from list */
817 *anchor = iter->base.symbol_next;
821 ARR_SHRINKLEN(*stack_ptr, new_top);
825 * Pop all entries from the environment stack until the new_top
828 * @param new_top the new stack top
830 static void environment_pop_to(size_t new_top)
832 stack_pop_to(&environment_stack, new_top);
836 * Pop all entries from the global label stack until the new_top
839 * @param new_top the new stack top
841 static void label_pop_to(size_t new_top)
843 stack_pop_to(&label_stack, new_top);
846 static atomic_type_kind_t get_akind(const type_t *type)
848 assert(type->kind == TYPE_ATOMIC || type->kind == TYPE_COMPLEX
849 || type->kind == TYPE_IMAGINARY || type->kind == TYPE_ENUM);
850 return type->atomic.akind;
854 * §6.3.1.1:2 Do integer promotion for a given type.
856 * @param type the type to promote
857 * @return the promoted type
859 static type_t *promote_integer(type_t *type)
861 if (get_akind_rank(get_akind(type)) < get_akind_rank(ATOMIC_TYPE_INT))
868 * Check if a given expression represents a null pointer constant.
870 * @param expression the expression to check
872 static bool is_null_pointer_constant(const expression_t *expression)
874 /* skip void* cast */
875 if (expression->kind == EXPR_UNARY_CAST) {
876 type_t *const type = skip_typeref(expression->base.type);
877 if (types_compatible(type, type_void_ptr))
878 expression = expression->unary.value;
881 type_t *const type = skip_typeref(expression->base.type);
882 if (!is_type_integer(type))
884 switch (is_constant_expression(expression)) {
885 case EXPR_CLASS_ERROR: return true;
886 case EXPR_CLASS_CONSTANT: return !fold_constant_to_bool(expression);
887 default: return false;
892 * Create an implicit cast expression.
894 * @param expression the expression to cast
895 * @param dest_type the destination type
897 static expression_t *create_implicit_cast(expression_t *expression,
900 type_t *const source_type = expression->base.type;
902 if (source_type == dest_type)
905 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
906 cast->unary.value = expression;
907 cast->base.type = dest_type;
908 cast->base.implicit = true;
913 typedef enum assign_error_t {
915 ASSIGN_ERROR_INCOMPATIBLE,
916 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
917 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
918 ASSIGN_WARNING_POINTER_FROM_INT,
919 ASSIGN_WARNING_INT_FROM_POINTER
922 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)
924 type_t *const orig_type_right = right->base.type;
925 type_t *const type_left = skip_typeref(orig_type_left);
926 type_t *const type_right = skip_typeref(orig_type_right);
931 case ASSIGN_ERROR_INCOMPATIBLE:
932 errorf(pos, "destination type '%T' in %s is incompatible with type '%T'", orig_type_left, context, orig_type_right);
935 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
936 type_t *points_to_left = skip_typeref(type_left->pointer.points_to);
937 type_t *points_to_right = skip_typeref(type_right->pointer.points_to);
939 /* the left type has all qualifiers from the right type */
940 unsigned missing_qualifiers = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
941 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);
945 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
946 warningf(WARN_OTHER, pos, "destination type '%T' in %s is incompatible with '%E' of type '%T'", orig_type_left, context, right, orig_type_right);
949 case ASSIGN_WARNING_POINTER_FROM_INT:
950 warningf(WARN_OTHER, pos, "%s makes pointer '%T' from integer '%T' without a cast", context, orig_type_left, orig_type_right);
953 case ASSIGN_WARNING_INT_FROM_POINTER:
954 warningf(WARN_OTHER, pos, "%s makes integer '%T' from pointer '%T' without a cast", context, orig_type_left, orig_type_right);
958 panic("invalid error value");
962 /** Implements the rules from §6.5.16.1 */
963 static assign_error_t semantic_assign(type_t *orig_type_left,
964 const expression_t *const right)
966 type_t *const orig_type_right = right->base.type;
967 type_t *const type_left = skip_typeref(orig_type_left);
968 type_t *const type_right = skip_typeref(orig_type_right);
970 if (is_type_pointer(type_left)) {
971 if (is_null_pointer_constant(right)) {
972 return ASSIGN_SUCCESS;
973 } else if (is_type_pointer(type_right)) {
974 type_t *points_to_left
975 = skip_typeref(type_left->pointer.points_to);
976 type_t *points_to_right
977 = skip_typeref(type_right->pointer.points_to);
978 assign_error_t res = ASSIGN_SUCCESS;
980 /* the left type has all qualifiers from the right type */
981 unsigned missing_qualifiers
982 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
983 if (missing_qualifiers != 0) {
984 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
987 points_to_left = get_unqualified_type(points_to_left);
988 points_to_right = get_unqualified_type(points_to_right);
990 if (is_type_void(points_to_left))
993 if (is_type_void(points_to_right)) {
994 /* ISO/IEC 14882:1998(E) §C.1.2:6 */
995 return c_mode & _CXX ? ASSIGN_ERROR_INCOMPATIBLE : res;
998 if (!types_compatible(points_to_left, points_to_right)) {
999 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
1003 } else if (is_type_integer(type_right)) {
1004 return ASSIGN_WARNING_POINTER_FROM_INT;
1006 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1007 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1008 && is_type_pointer(type_right))) {
1009 return ASSIGN_SUCCESS;
1010 } else if (is_type_compound(type_left) && is_type_compound(type_right)) {
1011 type_t *const unqual_type_left = get_unqualified_type(type_left);
1012 type_t *const unqual_type_right = get_unqualified_type(type_right);
1013 if (types_compatible(unqual_type_left, unqual_type_right)) {
1014 return ASSIGN_SUCCESS;
1016 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1017 return ASSIGN_WARNING_INT_FROM_POINTER;
1020 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1021 return ASSIGN_SUCCESS;
1023 return ASSIGN_ERROR_INCOMPATIBLE;
1026 static expression_t *parse_constant_expression(void)
1028 expression_t *result = parse_subexpression(PREC_CONDITIONAL);
1030 if (is_constant_expression(result) == EXPR_CLASS_VARIABLE) {
1031 errorf(&result->base.source_position,
1032 "expression '%E' is not constant", result);
1038 static expression_t *parse_assignment_expression(void)
1040 return parse_subexpression(PREC_ASSIGNMENT);
1043 static void append_string(string_t const *const s)
1045 /* FIXME Using the ast_obstack is a hack. Using the symbol_obstack is not
1046 * possible, because other tokens are grown there alongside. */
1047 obstack_grow(&ast_obstack, s->begin, s->size);
1050 static string_t finish_string(string_encoding_t const enc)
1052 obstack_1grow(&ast_obstack, '\0');
1053 size_t const size = obstack_object_size(&ast_obstack) - 1;
1054 char const *const string = obstack_finish(&ast_obstack);
1055 return (string_t){ string, size, enc };
1058 static string_t concat_string_literals(void)
1060 assert(token.kind == T_STRING_LITERAL);
1063 if (look_ahead(1)->kind == T_STRING_LITERAL) {
1064 append_string(&token.literal.string);
1065 eat(T_STRING_LITERAL);
1066 warningf(WARN_TRADITIONAL, HERE, "traditional C rejects string constant concatenation");
1067 string_encoding_t enc = token.literal.string.encoding;
1069 string_encoding_t const new_enc = token.literal.string.encoding;
1070 if (new_enc != enc && new_enc != STRING_ENCODING_CHAR) {
1071 if (enc == STRING_ENCODING_CHAR) {
1074 errorf(HERE, "concatenating string literals with encodings %s and %s", get_string_encoding_prefix(enc), get_string_encoding_prefix(new_enc));
1077 append_string(&token.literal.string);
1078 eat(T_STRING_LITERAL);
1079 } while (token.kind == T_STRING_LITERAL);
1080 result = finish_string(enc);
1082 result = token.literal.string;
1083 eat(T_STRING_LITERAL);
1089 static string_t parse_string_literals(char const *const context)
1091 if (!skip_till(T_STRING_LITERAL, context))
1092 return (string_t){ "", 0, STRING_ENCODING_CHAR };
1094 source_position_t const pos = *HERE;
1095 string_t const res = concat_string_literals();
1097 if (res.encoding != STRING_ENCODING_CHAR) {
1098 errorf(&pos, "expected plain string literal, got %s string literal", get_string_encoding_prefix(res.encoding));
1104 static attribute_t *allocate_attribute_zero(attribute_kind_t kind)
1106 attribute_t *attribute = allocate_ast_zero(sizeof(*attribute));
1107 attribute->kind = kind;
1108 attribute->source_position = *HERE;
1113 * Parse (gcc) attribute argument. From gcc comments in gcc source:
1116 * __attribute__ ( ( attribute-list ) )
1120 * attribute_list , attrib
1125 * any-word ( identifier )
1126 * any-word ( identifier , nonempty-expr-list )
1127 * any-word ( expr-list )
1129 * where the "identifier" must not be declared as a type, and
1130 * "any-word" may be any identifier (including one declared as a
1131 * type), a reserved word storage class specifier, type specifier or
1132 * type qualifier. ??? This still leaves out most reserved keywords
1133 * (following the old parser), shouldn't we include them, and why not
1134 * allow identifiers declared as types to start the arguments?
1136 * Matze: this all looks confusing and little systematic, so we're even less
1137 * strict and parse any list of things which are identifiers or
1138 * (assignment-)expressions.
1140 static attribute_argument_t *parse_attribute_arguments(void)
1142 attribute_argument_t *first = NULL;
1143 attribute_argument_t **anchor = &first;
1144 if (token.kind != ')') do {
1145 attribute_argument_t *argument = allocate_ast_zero(sizeof(*argument));
1147 /* is it an identifier */
1148 if (token.kind == T_IDENTIFIER
1149 && (look_ahead(1)->kind == ',' || look_ahead(1)->kind == ')')) {
1150 argument->kind = ATTRIBUTE_ARGUMENT_SYMBOL;
1151 argument->v.symbol = token.base.symbol;
1154 /* must be an expression */
1155 expression_t *expression = parse_assignment_expression();
1157 argument->kind = ATTRIBUTE_ARGUMENT_EXPRESSION;
1158 argument->v.expression = expression;
1161 /* append argument */
1163 anchor = &argument->next;
1164 } while (accept(','));
1169 static attribute_t *parse_attribute_asm(void)
1171 attribute_t *attribute = allocate_attribute_zero(ATTRIBUTE_GNU_ASM);
1174 attribute->a.arguments = parse_attribute_arguments();
1178 static attribute_t *parse_attribute_gnu_single(void)
1180 /* parse "any-word" */
1181 symbol_t *const symbol = token.base.symbol;
1182 if (symbol == NULL) {
1183 parse_error_expected("while parsing attribute((", T_IDENTIFIER, NULL);
1187 attribute_kind_t kind;
1188 char const *const name = symbol->string;
1189 for (kind = ATTRIBUTE_GNU_FIRST;; ++kind) {
1190 if (kind > ATTRIBUTE_GNU_LAST) {
1191 /* special case for "__const" */
1192 if (token.kind == T_const) {
1193 kind = ATTRIBUTE_GNU_CONST;
1197 warningf(WARN_ATTRIBUTE, HERE, "unknown attribute '%s' ignored", name);
1198 /* TODO: we should still save the attribute in the list... */
1199 kind = ATTRIBUTE_UNKNOWN;
1203 const char *attribute_name = get_attribute_name(kind);
1204 if (attribute_name != NULL && streq_underscore(attribute_name, name))
1208 attribute_t *attribute = allocate_attribute_zero(kind);
1211 /* parse arguments */
1213 attribute->a.arguments = parse_attribute_arguments();
1218 static attribute_t *parse_attribute_gnu(void)
1220 attribute_t *first = NULL;
1221 attribute_t **anchor = &first;
1223 eat(T___attribute__);
1224 add_anchor_token(')');
1225 add_anchor_token(',');
1229 if (token.kind != ')') do {
1230 attribute_t *attribute = parse_attribute_gnu_single();
1232 *anchor = attribute;
1233 anchor = &attribute->next;
1235 } while (accept(','));
1236 rem_anchor_token(',');
1237 rem_anchor_token(')');
1244 /** Parse attributes. */
1245 static attribute_t *parse_attributes(attribute_t *first)
1247 attribute_t **anchor = &first;
1249 while (*anchor != NULL)
1250 anchor = &(*anchor)->next;
1252 attribute_t *attribute;
1253 switch (token.kind) {
1254 case T___attribute__:
1255 attribute = parse_attribute_gnu();
1256 if (attribute == NULL)
1261 attribute = parse_attribute_asm();
1265 attribute = allocate_attribute_zero(ATTRIBUTE_MS_CDECL);
1270 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FASTCALL);
1274 case T__forceinline:
1275 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FORCEINLINE);
1276 eat(T__forceinline);
1280 attribute = allocate_attribute_zero(ATTRIBUTE_MS_STDCALL);
1285 /* TODO record modifier */
1286 warningf(WARN_OTHER, HERE, "Ignoring declaration modifier %K", &token);
1287 attribute = allocate_attribute_zero(ATTRIBUTE_MS_THISCALL);
1295 *anchor = attribute;
1296 anchor = &attribute->next;
1300 static void mark_vars_read(expression_t *expr, entity_t *lhs_ent);
1302 static entity_t *determine_lhs_ent(expression_t *const expr,
1305 switch (expr->kind) {
1306 case EXPR_REFERENCE: {
1307 entity_t *const entity = expr->reference.entity;
1308 /* we should only find variables as lvalues... */
1309 if (entity->base.kind != ENTITY_VARIABLE
1310 && entity->base.kind != ENTITY_PARAMETER)
1316 case EXPR_ARRAY_ACCESS: {
1317 expression_t *const ref = expr->array_access.array_ref;
1318 entity_t * ent = NULL;
1319 if (is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1320 ent = determine_lhs_ent(ref, lhs_ent);
1323 mark_vars_read(ref, lhs_ent);
1325 mark_vars_read(expr->array_access.index, lhs_ent);
1330 mark_vars_read(expr->select.compound, lhs_ent);
1331 if (is_type_compound(skip_typeref(expr->base.type)))
1332 return determine_lhs_ent(expr->select.compound, lhs_ent);
1336 case EXPR_UNARY_DEREFERENCE: {
1337 expression_t *const val = expr->unary.value;
1338 if (val->kind == EXPR_UNARY_TAKE_ADDRESS) {
1340 return determine_lhs_ent(val->unary.value, lhs_ent);
1342 mark_vars_read(val, NULL);
1348 mark_vars_read(expr, NULL);
1353 #define ENT_ANY ((entity_t*)-1)
1356 * Mark declarations, which are read. This is used to detect variables, which
1360 * x is not marked as "read", because it is only read to calculate its own new
1364 * x and y are not detected as "not read", because multiple variables are
1367 static void mark_vars_read(expression_t *const expr, entity_t *lhs_ent)
1369 switch (expr->kind) {
1370 case EXPR_REFERENCE: {
1371 entity_t *const entity = expr->reference.entity;
1372 if (entity->kind != ENTITY_VARIABLE
1373 && entity->kind != ENTITY_PARAMETER)
1376 if (lhs_ent != entity && lhs_ent != ENT_ANY) {
1377 entity->variable.read = true;
1383 // TODO respect pure/const
1384 mark_vars_read(expr->call.function, NULL);
1385 for (call_argument_t *arg = expr->call.arguments; arg != NULL; arg = arg->next) {
1386 mark_vars_read(arg->expression, NULL);
1390 case EXPR_CONDITIONAL:
1391 // TODO lhs_decl should depend on whether true/false have an effect
1392 mark_vars_read(expr->conditional.condition, NULL);
1393 if (expr->conditional.true_expression != NULL)
1394 mark_vars_read(expr->conditional.true_expression, lhs_ent);
1395 mark_vars_read(expr->conditional.false_expression, lhs_ent);
1399 if (lhs_ent == ENT_ANY
1400 && !is_type_compound(skip_typeref(expr->base.type)))
1402 mark_vars_read(expr->select.compound, lhs_ent);
1405 case EXPR_ARRAY_ACCESS: {
1406 mark_vars_read(expr->array_access.index, lhs_ent);
1407 expression_t *const ref = expr->array_access.array_ref;
1408 if (!is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1409 if (lhs_ent == ENT_ANY)
1412 mark_vars_read(ref, lhs_ent);
1417 mark_vars_read(expr->va_arge.ap, lhs_ent);
1421 mark_vars_read(expr->va_copye.src, lhs_ent);
1424 case EXPR_UNARY_CAST:
1425 /* Special case: Use void cast to mark a variable as "read" */
1426 if (is_type_void(skip_typeref(expr->base.type)))
1431 case EXPR_UNARY_THROW:
1432 if (expr->unary.value == NULL)
1435 case EXPR_UNARY_DEREFERENCE:
1436 case EXPR_UNARY_DELETE:
1437 case EXPR_UNARY_DELETE_ARRAY:
1438 if (lhs_ent == ENT_ANY)
1442 case EXPR_UNARY_NEGATE:
1443 case EXPR_UNARY_PLUS:
1444 case EXPR_UNARY_BITWISE_NEGATE:
1445 case EXPR_UNARY_NOT:
1446 case EXPR_UNARY_TAKE_ADDRESS:
1447 case EXPR_UNARY_POSTFIX_INCREMENT:
1448 case EXPR_UNARY_POSTFIX_DECREMENT:
1449 case EXPR_UNARY_PREFIX_INCREMENT:
1450 case EXPR_UNARY_PREFIX_DECREMENT:
1451 case EXPR_UNARY_ASSUME:
1453 mark_vars_read(expr->unary.value, lhs_ent);
1456 case EXPR_BINARY_ADD:
1457 case EXPR_BINARY_SUB:
1458 case EXPR_BINARY_MUL:
1459 case EXPR_BINARY_DIV:
1460 case EXPR_BINARY_MOD:
1461 case EXPR_BINARY_EQUAL:
1462 case EXPR_BINARY_NOTEQUAL:
1463 case EXPR_BINARY_LESS:
1464 case EXPR_BINARY_LESSEQUAL:
1465 case EXPR_BINARY_GREATER:
1466 case EXPR_BINARY_GREATEREQUAL:
1467 case EXPR_BINARY_BITWISE_AND:
1468 case EXPR_BINARY_BITWISE_OR:
1469 case EXPR_BINARY_BITWISE_XOR:
1470 case EXPR_BINARY_LOGICAL_AND:
1471 case EXPR_BINARY_LOGICAL_OR:
1472 case EXPR_BINARY_SHIFTLEFT:
1473 case EXPR_BINARY_SHIFTRIGHT:
1474 case EXPR_BINARY_COMMA:
1475 case EXPR_BINARY_ISGREATER:
1476 case EXPR_BINARY_ISGREATEREQUAL:
1477 case EXPR_BINARY_ISLESS:
1478 case EXPR_BINARY_ISLESSEQUAL:
1479 case EXPR_BINARY_ISLESSGREATER:
1480 case EXPR_BINARY_ISUNORDERED:
1481 mark_vars_read(expr->binary.left, lhs_ent);
1482 mark_vars_read(expr->binary.right, lhs_ent);
1485 case EXPR_BINARY_ASSIGN:
1486 case EXPR_BINARY_MUL_ASSIGN:
1487 case EXPR_BINARY_DIV_ASSIGN:
1488 case EXPR_BINARY_MOD_ASSIGN:
1489 case EXPR_BINARY_ADD_ASSIGN:
1490 case EXPR_BINARY_SUB_ASSIGN:
1491 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
1492 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
1493 case EXPR_BINARY_BITWISE_AND_ASSIGN:
1494 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
1495 case EXPR_BINARY_BITWISE_OR_ASSIGN: {
1496 if (lhs_ent == ENT_ANY)
1498 lhs_ent = determine_lhs_ent(expr->binary.left, lhs_ent);
1499 mark_vars_read(expr->binary.right, lhs_ent);
1504 determine_lhs_ent(expr->va_starte.ap, lhs_ent);
1507 case EXPR_LITERAL_CASES:
1508 case EXPR_LITERAL_CHARACTER:
1510 case EXPR_STRING_LITERAL:
1511 case EXPR_COMPOUND_LITERAL: // TODO init?
1513 case EXPR_CLASSIFY_TYPE:
1516 case EXPR_BUILTIN_CONSTANT_P:
1517 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
1519 case EXPR_STATEMENT: // TODO
1520 case EXPR_LABEL_ADDRESS:
1521 case EXPR_ENUM_CONSTANT:
1525 panic("unhandled expression");
1528 static designator_t *parse_designation(void)
1530 designator_t *result = NULL;
1531 designator_t **anchor = &result;
1534 designator_t *designator;
1535 switch (token.kind) {
1537 designator = allocate_ast_zero(sizeof(designator[0]));
1538 designator->source_position = *HERE;
1540 add_anchor_token(']');
1541 designator->array_index = parse_constant_expression();
1542 rem_anchor_token(']');
1546 designator = allocate_ast_zero(sizeof(designator[0]));
1547 designator->source_position = *HERE;
1549 designator->symbol = expect_identifier("while parsing designator", NULL);
1550 if (!designator->symbol)
1558 assert(designator != NULL);
1559 *anchor = designator;
1560 anchor = &designator->next;
1565 * Build an initializer from a given expression.
1567 static initializer_t *initializer_from_expression(type_t *orig_type,
1568 expression_t *expression)
1570 /* TODO check that expression is a constant expression */
1572 type_t *const type = skip_typeref(orig_type);
1574 /* §6.7.8.14/15 char array may be initialized by string literals */
1575 if (expression->kind == EXPR_STRING_LITERAL && is_type_array(type)) {
1576 array_type_t *const array_type = &type->array;
1577 type_t *const element_type = skip_typeref(array_type->element_type);
1578 switch (expression->string_literal.value.encoding) {
1579 case STRING_ENCODING_CHAR:
1580 case STRING_ENCODING_UTF8: {
1581 if (is_type_atomic(element_type, ATOMIC_TYPE_CHAR) ||
1582 is_type_atomic(element_type, ATOMIC_TYPE_SCHAR) ||
1583 is_type_atomic(element_type, ATOMIC_TYPE_UCHAR)) {
1584 goto make_string_init;
1589 case STRING_ENCODING_CHAR16:
1590 case STRING_ENCODING_CHAR32:
1591 case STRING_ENCODING_WIDE: {
1592 assert(is_type_pointer(expression->base.type));
1593 type_t *const init_type = get_unqualified_type(expression->base.type->pointer.points_to);
1594 if (types_compatible(get_unqualified_type(element_type), init_type)) {
1596 initializer_t *const init = allocate_initializer_zero(INITIALIZER_STRING);
1597 init->value.value = expression;
1605 assign_error_t error = semantic_assign(type, expression);
1606 if (error == ASSIGN_ERROR_INCOMPATIBLE)
1608 report_assign_error(error, type, expression, "initializer",
1609 &expression->base.source_position);
1611 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
1612 result->value.value = create_implicit_cast(expression, type);
1618 * Parses an scalar initializer.
1620 * §6.7.8.11; eat {} without warning
1622 static initializer_t *parse_scalar_initializer(type_t *type,
1623 bool must_be_constant)
1625 /* there might be extra {} hierarchies */
1627 if (token.kind == '{') {
1628 warningf(WARN_OTHER, HERE, "extra curly braces around scalar initializer");
1632 } while (token.kind == '{');
1635 expression_t *expression = parse_assignment_expression();
1636 mark_vars_read(expression, NULL);
1637 if (must_be_constant && !is_linker_constant(expression)) {
1638 errorf(&expression->base.source_position,
1639 "initialisation expression '%E' is not constant",
1643 initializer_t *initializer = initializer_from_expression(type, expression);
1645 if (initializer == NULL) {
1646 errorf(&expression->base.source_position,
1647 "expression '%E' (type '%T') doesn't match expected type '%T'",
1648 expression, expression->base.type, type);
1653 bool additional_warning_displayed = false;
1654 while (braces > 0) {
1656 if (token.kind != '}') {
1657 if (!additional_warning_displayed) {
1658 warningf(WARN_OTHER, HERE, "additional elements in scalar initializer");
1659 additional_warning_displayed = true;
1670 * An entry in the type path.
1672 typedef struct type_path_entry_t type_path_entry_t;
1673 struct type_path_entry_t {
1674 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
1676 size_t index; /**< For array types: the current index. */
1677 declaration_t *compound_entry; /**< For compound types: the current declaration. */
1682 * A type path expression a position inside compound or array types.
1684 typedef struct type_path_t type_path_t;
1685 struct type_path_t {
1686 type_path_entry_t *path; /**< An flexible array containing the current path. */
1687 type_t *top_type; /**< type of the element the path points */
1688 size_t max_index; /**< largest index in outermost array */
1692 * Prints a type path for debugging.
1694 static __attribute__((unused)) void debug_print_type_path(
1695 const type_path_t *path)
1697 size_t len = ARR_LEN(path->path);
1699 for (size_t i = 0; i < len; ++i) {
1700 const type_path_entry_t *entry = & path->path[i];
1702 type_t *type = skip_typeref(entry->type);
1703 if (is_type_compound(type)) {
1704 /* in gcc mode structs can have no members */
1705 if (entry->v.compound_entry == NULL) {
1709 fprintf(stderr, ".%s",
1710 entry->v.compound_entry->base.symbol->string);
1711 } else if (is_type_array(type)) {
1712 fprintf(stderr, "[%u]", (unsigned) entry->v.index);
1714 fprintf(stderr, "-INVALID-");
1717 if (path->top_type != NULL) {
1718 fprintf(stderr, " (");
1719 print_type(path->top_type);
1720 fprintf(stderr, ")");
1725 * Return the top type path entry, ie. in a path
1726 * (type).a.b returns the b.
1728 static type_path_entry_t *get_type_path_top(const type_path_t *path)
1730 size_t len = ARR_LEN(path->path);
1732 return &path->path[len-1];
1736 * Enlarge the type path by an (empty) element.
1738 static type_path_entry_t *append_to_type_path(type_path_t *path)
1740 size_t len = ARR_LEN(path->path);
1741 ARR_RESIZE(type_path_entry_t, path->path, len+1);
1743 type_path_entry_t *result = & path->path[len];
1744 memset(result, 0, sizeof(result[0]));
1749 * Descending into a sub-type. Enter the scope of the current top_type.
1751 static void descend_into_subtype(type_path_t *path)
1753 type_t *orig_top_type = path->top_type;
1754 type_t *top_type = skip_typeref(orig_top_type);
1756 type_path_entry_t *top = append_to_type_path(path);
1757 top->type = top_type;
1759 if (is_type_compound(top_type)) {
1760 compound_t *const compound = top_type->compound.compound;
1761 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
1763 if (entry != NULL) {
1764 top->v.compound_entry = &entry->declaration;
1765 path->top_type = entry->declaration.type;
1767 path->top_type = NULL;
1769 } else if (is_type_array(top_type)) {
1771 path->top_type = top_type->array.element_type;
1773 assert(!is_type_valid(top_type));
1778 * Pop an entry from the given type path, ie. returning from
1779 * (type).a.b to (type).a
1781 static void ascend_from_subtype(type_path_t *path)
1783 type_path_entry_t *top = get_type_path_top(path);
1785 path->top_type = top->type;
1787 size_t len = ARR_LEN(path->path);
1788 ARR_RESIZE(type_path_entry_t, path->path, len-1);
1792 * Pop entries from the given type path until the given
1793 * path level is reached.
1795 static void ascend_to(type_path_t *path, size_t top_path_level)
1797 size_t len = ARR_LEN(path->path);
1799 while (len > top_path_level) {
1800 ascend_from_subtype(path);
1801 len = ARR_LEN(path->path);
1805 static bool walk_designator(type_path_t *path, const designator_t *designator,
1806 bool used_in_offsetof)
1808 for (; designator != NULL; designator = designator->next) {
1809 type_path_entry_t *top = get_type_path_top(path);
1810 type_t *orig_type = top->type;
1812 type_t *type = skip_typeref(orig_type);
1814 if (designator->symbol != NULL) {
1815 symbol_t *symbol = designator->symbol;
1816 if (!is_type_compound(type)) {
1817 if (is_type_valid(type)) {
1818 errorf(&designator->source_position,
1819 "'.%Y' designator used for non-compound type '%T'",
1823 top->type = type_error_type;
1824 top->v.compound_entry = NULL;
1825 orig_type = type_error_type;
1827 compound_t *compound = type->compound.compound;
1828 entity_t *iter = compound->members.entities;
1829 for (; iter != NULL; iter = iter->base.next) {
1830 if (iter->base.symbol == symbol) {
1835 errorf(&designator->source_position,
1836 "'%T' has no member named '%Y'", orig_type, symbol);
1839 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
1840 if (used_in_offsetof && iter->compound_member.bitfield) {
1841 errorf(&designator->source_position,
1842 "offsetof designator '%Y' must not specify bitfield",
1847 top->type = orig_type;
1848 top->v.compound_entry = &iter->declaration;
1849 orig_type = iter->declaration.type;
1852 expression_t *array_index = designator->array_index;
1853 if (is_constant_expression(array_index) != EXPR_CLASS_CONSTANT)
1856 if (!is_type_array(type)) {
1857 if (is_type_valid(type)) {
1858 errorf(&designator->source_position,
1859 "[%E] designator used for non-array type '%T'",
1860 array_index, orig_type);
1865 long index = fold_constant_to_int(array_index);
1866 if (!used_in_offsetof) {
1868 errorf(&designator->source_position,
1869 "array index [%E] must be positive", array_index);
1870 } else if (type->array.size_constant) {
1871 long array_size = type->array.size;
1872 if (index >= array_size) {
1873 errorf(&designator->source_position,
1874 "designator [%E] (%d) exceeds array size %d",
1875 array_index, index, array_size);
1880 top->type = orig_type;
1881 top->v.index = (size_t) index;
1882 orig_type = type->array.element_type;
1884 path->top_type = orig_type;
1886 if (designator->next != NULL) {
1887 descend_into_subtype(path);
1893 static void advance_current_object(type_path_t *path, size_t top_path_level)
1895 type_path_entry_t *top = get_type_path_top(path);
1897 type_t *type = skip_typeref(top->type);
1898 if (is_type_union(type)) {
1899 /* in unions only the first element is initialized */
1900 top->v.compound_entry = NULL;
1901 } else if (is_type_struct(type)) {
1902 declaration_t *entry = top->v.compound_entry;
1904 entity_t *const next_entity = skip_unnamed_bitfields(entry->base.next);
1905 if (next_entity != NULL) {
1906 assert(is_declaration(next_entity));
1907 entry = &next_entity->declaration;
1912 top->v.compound_entry = entry;
1913 if (entry != NULL) {
1914 path->top_type = entry->type;
1917 } else if (is_type_array(type)) {
1918 assert(is_type_array(type));
1922 if (!type->array.size_constant || top->v.index < type->array.size) {
1926 assert(!is_type_valid(type));
1930 /* we're past the last member of the current sub-aggregate, try if we
1931 * can ascend in the type hierarchy and continue with another subobject */
1932 size_t len = ARR_LEN(path->path);
1934 if (len > top_path_level) {
1935 ascend_from_subtype(path);
1936 advance_current_object(path, top_path_level);
1938 path->top_type = NULL;
1943 * skip any {...} blocks until a closing bracket is reached.
1945 static void skip_initializers(void)
1949 while (token.kind != '}') {
1950 if (token.kind == T_EOF)
1952 if (token.kind == '{') {
1960 static initializer_t *create_empty_initializer(void)
1962 static initializer_t empty_initializer
1963 = { .list = { { INITIALIZER_LIST }, 0 } };
1964 return &empty_initializer;
1968 * Parse a part of an initialiser for a struct or union,
1970 static initializer_t *parse_sub_initializer(type_path_t *path,
1971 type_t *outer_type, size_t top_path_level,
1972 parse_initializer_env_t *env)
1974 if (token.kind == '}') {
1975 /* empty initializer */
1976 return create_empty_initializer();
1979 initializer_t *result = NULL;
1981 type_t *orig_type = path->top_type;
1982 type_t *type = NULL;
1984 if (orig_type == NULL) {
1985 /* We are initializing an empty compound. */
1987 type = skip_typeref(orig_type);
1990 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
1993 designator_t *designator = NULL;
1994 if (token.kind == '.' || token.kind == '[') {
1995 designator = parse_designation();
1996 goto finish_designator;
1997 } else if (token.kind == T_IDENTIFIER && look_ahead(1)->kind == ':') {
1998 /* GNU-style designator ("identifier: value") */
1999 designator = allocate_ast_zero(sizeof(designator[0]));
2000 designator->source_position = *HERE;
2001 designator->symbol = token.base.symbol;
2006 /* reset path to toplevel, evaluate designator from there */
2007 ascend_to(path, top_path_level);
2008 if (!walk_designator(path, designator, false)) {
2009 /* can't continue after designation error */
2013 initializer_t *designator_initializer
2014 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2015 designator_initializer->designator.designator = designator;
2016 ARR_APP1(initializer_t*, initializers, designator_initializer);
2018 orig_type = path->top_type;
2019 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2024 if (token.kind == '{') {
2025 if (type != NULL && is_type_scalar(type)) {
2026 sub = parse_scalar_initializer(type, env->must_be_constant);
2029 if (env->entity != NULL) {
2030 errorf(HERE, "extra brace group at end of initializer for '%N'", env->entity);
2032 errorf(HERE, "extra brace group at end of initializer");
2037 descend_into_subtype(path);
2040 add_anchor_token('}');
2041 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2043 rem_anchor_token('}');
2048 goto error_parse_next;
2050 ascend_from_subtype(path);
2053 /* must be an expression */
2054 expression_t *expression = parse_assignment_expression();
2055 mark_vars_read(expression, NULL);
2057 if (env->must_be_constant && !is_linker_constant(expression)) {
2058 errorf(&expression->base.source_position,
2059 "Initialisation expression '%E' is not constant",
2064 /* we are already outside, ... */
2065 if (outer_type == NULL)
2066 goto error_parse_next;
2067 type_t *const outer_type_skip = skip_typeref(outer_type);
2068 if (is_type_compound(outer_type_skip) &&
2069 !outer_type_skip->compound.compound->complete) {
2070 goto error_parse_next;
2073 source_position_t const* const pos = &expression->base.source_position;
2074 if (env->entity != NULL) {
2075 warningf(WARN_OTHER, pos, "excess elements in initializer for '%N'", env->entity);
2077 warningf(WARN_OTHER, pos, "excess elements in initializer");
2079 goto error_parse_next;
2082 /* handle { "string" } special case */
2083 if (expression->kind == EXPR_STRING_LITERAL && outer_type != NULL) {
2084 result = initializer_from_expression(outer_type, expression);
2085 if (result != NULL) {
2087 if (token.kind != '}') {
2088 warningf(WARN_OTHER, HERE, "excessive elements in initializer for type '%T'", outer_type);
2090 /* TODO: eat , ... */
2095 /* descend into subtypes until expression matches type */
2097 orig_type = path->top_type;
2098 type = skip_typeref(orig_type);
2100 sub = initializer_from_expression(orig_type, expression);
2104 if (!is_type_valid(type)) {
2107 if (is_type_scalar(type)) {
2108 errorf(&expression->base.source_position,
2109 "expression '%E' doesn't match expected type '%T'",
2110 expression, orig_type);
2114 descend_into_subtype(path);
2118 /* update largest index of top array */
2119 const type_path_entry_t *first = &path->path[0];
2120 type_t *first_type = first->type;
2121 first_type = skip_typeref(first_type);
2122 if (is_type_array(first_type)) {
2123 size_t index = first->v.index;
2124 if (index > path->max_index)
2125 path->max_index = index;
2128 /* append to initializers list */
2129 ARR_APP1(initializer_t*, initializers, sub);
2134 if (token.kind == '}') {
2139 /* advance to the next declaration if we are not at the end */
2140 advance_current_object(path, top_path_level);
2141 orig_type = path->top_type;
2142 if (orig_type != NULL)
2143 type = skip_typeref(orig_type);
2149 size_t len = ARR_LEN(initializers);
2150 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2151 result = allocate_ast_zero(size);
2152 result->kind = INITIALIZER_LIST;
2153 result->list.len = len;
2154 memcpy(&result->list.initializers, initializers,
2155 len * sizeof(initializers[0]));
2159 skip_initializers();
2161 DEL_ARR_F(initializers);
2162 ascend_to(path, top_path_level+1);
2166 static expression_t *make_size_literal(size_t value)
2168 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_INTEGER);
2169 literal->base.type = type_size_t;
2172 snprintf(buf, sizeof(buf), "%u", (unsigned) value);
2173 literal->literal.value = make_string(buf);
2179 * Parses an initializer. Parsers either a compound literal
2180 * (env->declaration == NULL) or an initializer of a declaration.
2182 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2184 type_t *type = skip_typeref(env->type);
2185 size_t max_index = 0;
2186 initializer_t *result;
2188 if (is_type_scalar(type)) {
2189 result = parse_scalar_initializer(type, env->must_be_constant);
2190 } else if (token.kind == '{') {
2194 memset(&path, 0, sizeof(path));
2195 path.top_type = env->type;
2196 path.path = NEW_ARR_F(type_path_entry_t, 0);
2198 descend_into_subtype(&path);
2200 add_anchor_token('}');
2201 result = parse_sub_initializer(&path, env->type, 1, env);
2202 rem_anchor_token('}');
2204 max_index = path.max_index;
2205 DEL_ARR_F(path.path);
2209 /* parse_scalar_initializer() also works in this case: we simply
2210 * have an expression without {} around it */
2211 result = parse_scalar_initializer(type, env->must_be_constant);
2214 /* §6.7.8:22 array initializers for arrays with unknown size determine
2215 * the array type size */
2216 if (is_type_array(type) && type->array.size_expression == NULL
2217 && result != NULL) {
2219 switch (result->kind) {
2220 case INITIALIZER_LIST:
2221 assert(max_index != 0xdeadbeaf);
2222 size = max_index + 1;
2225 case INITIALIZER_STRING: {
2226 size = get_string_len(&get_init_string(result)->value) + 1;
2230 case INITIALIZER_DESIGNATOR:
2231 case INITIALIZER_VALUE:
2232 /* can happen for parse errors */
2237 internal_errorf(HERE, "invalid initializer type");
2240 type_t *new_type = duplicate_type(type);
2242 new_type->array.size_expression = make_size_literal(size);
2243 new_type->array.size_constant = true;
2244 new_type->array.has_implicit_size = true;
2245 new_type->array.size = size;
2246 env->type = new_type;
2252 static void append_entity(scope_t *scope, entity_t *entity)
2254 if (scope->last_entity != NULL) {
2255 scope->last_entity->base.next = entity;
2257 scope->entities = entity;
2259 entity->base.parent_entity = current_entity;
2260 scope->last_entity = entity;
2264 static compound_t *parse_compound_type_specifier(bool is_struct)
2266 source_position_t const pos = *HERE;
2267 eat(is_struct ? T_struct : T_union);
2269 symbol_t *symbol = NULL;
2270 entity_t *entity = NULL;
2271 attribute_t *attributes = NULL;
2273 if (token.kind == T___attribute__) {
2274 attributes = parse_attributes(NULL);
2277 entity_kind_tag_t const kind = is_struct ? ENTITY_STRUCT : ENTITY_UNION;
2278 if (token.kind == T_IDENTIFIER) {
2279 /* the compound has a name, check if we have seen it already */
2280 symbol = token.base.symbol;
2281 entity = get_tag(symbol, kind);
2284 if (entity != NULL) {
2285 if (entity->base.parent_scope != current_scope &&
2286 (token.kind == '{' || token.kind == ';')) {
2287 /* we're in an inner scope and have a definition. Shadow
2288 * existing definition in outer scope */
2290 } else if (entity->compound.complete && token.kind == '{') {
2291 source_position_t const *const ppos = &entity->base.source_position;
2292 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2293 /* clear members in the hope to avoid further errors */
2294 entity->compound.members.entities = NULL;
2297 } else if (token.kind != '{') {
2298 char const *const msg =
2299 is_struct ? "while parsing struct type specifier" :
2300 "while parsing union type specifier";
2301 parse_error_expected(msg, T_IDENTIFIER, '{', NULL);
2306 if (entity == NULL) {
2307 entity = allocate_entity_zero(kind, NAMESPACE_TAG, symbol, &pos);
2308 entity->compound.alignment = 1;
2309 entity->base.parent_scope = current_scope;
2310 if (symbol != NULL) {
2311 environment_push(entity);
2313 append_entity(current_scope, entity);
2316 if (token.kind == '{') {
2317 parse_compound_type_entries(&entity->compound);
2319 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2320 if (symbol == NULL) {
2321 assert(anonymous_entity == NULL);
2322 anonymous_entity = entity;
2326 if (attributes != NULL) {
2327 entity->compound.attributes = attributes;
2328 handle_entity_attributes(attributes, entity);
2331 return &entity->compound;
2334 static void parse_enum_entries(type_t *const enum_type)
2338 if (token.kind == '}') {
2339 errorf(HERE, "empty enum not allowed");
2344 add_anchor_token('}');
2345 add_anchor_token(',');
2347 add_anchor_token('=');
2348 source_position_t pos;
2349 symbol_t *const symbol = expect_identifier("while parsing enum entry", &pos);
2350 entity_t *const entity = allocate_entity_zero(ENTITY_ENUM_VALUE, NAMESPACE_NORMAL, symbol, &pos);
2351 entity->enum_value.enum_type = enum_type;
2352 rem_anchor_token('=');
2355 expression_t *value = parse_constant_expression();
2357 value = create_implicit_cast(value, enum_type);
2358 entity->enum_value.value = value;
2363 record_entity(entity, false);
2364 } while (accept(',') && token.kind != '}');
2365 rem_anchor_token(',');
2366 rem_anchor_token('}');
2371 static type_t *parse_enum_specifier(void)
2373 source_position_t const pos = *HERE;
2378 switch (token.kind) {
2380 symbol = token.base.symbol;
2381 entity = get_tag(symbol, ENTITY_ENUM);
2384 if (entity != NULL) {
2385 if (entity->base.parent_scope != current_scope &&
2386 (token.kind == '{' || token.kind == ';')) {
2387 /* we're in an inner scope and have a definition. Shadow
2388 * existing definition in outer scope */
2390 } else if (entity->enume.complete && token.kind == '{') {
2391 source_position_t const *const ppos = &entity->base.source_position;
2392 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2403 parse_error_expected("while parsing enum type specifier",
2404 T_IDENTIFIER, '{', NULL);
2408 if (entity == NULL) {
2409 entity = allocate_entity_zero(ENTITY_ENUM, NAMESPACE_TAG, symbol, &pos);
2410 entity->base.parent_scope = current_scope;
2413 type_t *const type = allocate_type_zero(TYPE_ENUM);
2414 type->enumt.enume = &entity->enume;
2415 type->enumt.base.akind = ATOMIC_TYPE_INT;
2417 if (token.kind == '{') {
2418 if (symbol != NULL) {
2419 environment_push(entity);
2421 append_entity(current_scope, entity);
2422 entity->enume.complete = true;
2424 parse_enum_entries(type);
2425 parse_attributes(NULL);
2427 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2428 if (symbol == NULL) {
2429 assert(anonymous_entity == NULL);
2430 anonymous_entity = entity;
2432 } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
2433 errorf(HERE, "'%T' used before definition (incomplete enums are a GNU extension)", type);
2440 * if a symbol is a typedef to another type, return true
2442 static bool is_typedef_symbol(symbol_t *symbol)
2444 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
2445 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
2448 static type_t *parse_typeof(void)
2454 add_anchor_token(')');
2457 expression_t *expression = NULL;
2459 switch (token.kind) {
2461 if (is_typedef_symbol(token.base.symbol)) {
2463 type = parse_typename();
2466 expression = parse_expression();
2467 type = revert_automatic_type_conversion(expression);
2472 rem_anchor_token(')');
2475 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
2476 typeof_type->typeoft.expression = expression;
2477 typeof_type->typeoft.typeof_type = type;
2482 typedef enum specifiers_t {
2484 SPECIFIER_SIGNED = 1 << 0,
2485 SPECIFIER_UNSIGNED = 1 << 1,
2486 SPECIFIER_LONG = 1 << 2,
2487 SPECIFIER_INT = 1 << 3,
2488 SPECIFIER_DOUBLE = 1 << 4,
2489 SPECIFIER_CHAR = 1 << 5,
2490 SPECIFIER_WCHAR_T = 1 << 6,
2491 SPECIFIER_SHORT = 1 << 7,
2492 SPECIFIER_LONG_LONG = 1 << 8,
2493 SPECIFIER_FLOAT = 1 << 9,
2494 SPECIFIER_BOOL = 1 << 10,
2495 SPECIFIER_VOID = 1 << 11,
2496 SPECIFIER_INT8 = 1 << 12,
2497 SPECIFIER_INT16 = 1 << 13,
2498 SPECIFIER_INT32 = 1 << 14,
2499 SPECIFIER_INT64 = 1 << 15,
2500 SPECIFIER_INT128 = 1 << 16,
2501 SPECIFIER_COMPLEX = 1 << 17,
2502 SPECIFIER_IMAGINARY = 1 << 18,
2505 static type_t *get_typedef_type(symbol_t *symbol)
2507 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
2508 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
2511 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
2512 type->typedeft.typedefe = &entity->typedefe;
2517 static attribute_t *parse_attribute_ms_property(attribute_t *attribute)
2519 attribute_property_argument_t *const property = allocate_ast_zero(sizeof(*property));
2521 add_anchor_token(')');
2522 add_anchor_token(',');
2526 add_anchor_token('=');
2527 source_position_t pos;
2528 symbol_t *const prop_sym = expect_identifier("while parsing property declspec", &pos);
2529 rem_anchor_token('=');
2531 symbol_t **prop = NULL;
2533 if (streq(prop_sym->string, "put")) {
2534 prop = &property->put_symbol;
2535 } else if (streq(prop_sym->string, "get")) {
2536 prop = &property->get_symbol;
2538 errorf(&pos, "expected put or get in property declspec, but got '%Y'", prop_sym);
2542 add_anchor_token(T_IDENTIFIER);
2544 rem_anchor_token(T_IDENTIFIER);
2546 symbol_t *const sym = expect_identifier("while parsing property declspec", NULL);
2548 *prop = sym ? sym : sym_anonymous;
2549 } while (accept(','));
2550 rem_anchor_token(',');
2551 rem_anchor_token(')');
2553 attribute->a.property = property;
2559 static attribute_t *parse_microsoft_extended_decl_modifier_single(void)
2561 attribute_kind_t kind = ATTRIBUTE_UNKNOWN;
2562 if (accept(T_restrict)) {
2563 kind = ATTRIBUTE_MS_RESTRICT;
2564 } else if (token.kind == T_IDENTIFIER) {
2565 char const *const name = token.base.symbol->string;
2566 for (attribute_kind_t k = ATTRIBUTE_MS_FIRST; k <= ATTRIBUTE_MS_LAST;
2568 const char *attribute_name = get_attribute_name(k);
2569 if (attribute_name != NULL && streq(attribute_name, name)) {
2575 if (kind == ATTRIBUTE_UNKNOWN) {
2576 warningf(WARN_ATTRIBUTE, HERE, "unknown __declspec '%s' ignored", name);
2579 parse_error_expected("while parsing __declspec", T_IDENTIFIER, NULL);
2583 attribute_t *attribute = allocate_attribute_zero(kind);
2586 if (kind == ATTRIBUTE_MS_PROPERTY) {
2587 return parse_attribute_ms_property(attribute);
2590 /* parse arguments */
2592 attribute->a.arguments = parse_attribute_arguments();
2597 static attribute_t *parse_microsoft_extended_decl_modifier(attribute_t *first)
2601 add_anchor_token(')');
2603 if (token.kind != ')') {
2604 attribute_t **anchor = &first;
2606 while (*anchor != NULL)
2607 anchor = &(*anchor)->next;
2609 attribute_t *attribute
2610 = parse_microsoft_extended_decl_modifier_single();
2611 if (attribute == NULL)
2614 *anchor = attribute;
2615 anchor = &attribute->next;
2616 } while (accept(','));
2618 rem_anchor_token(')');
2623 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
2625 entity_t *const entity = allocate_entity_zero(kind, NAMESPACE_NORMAL, symbol, HERE);
2626 if (is_declaration(entity)) {
2627 entity->declaration.type = type_error_type;
2628 entity->declaration.implicit = true;
2629 } else if (kind == ENTITY_TYPEDEF) {
2630 entity->typedefe.type = type_error_type;
2631 entity->typedefe.builtin = true;
2633 if (kind != ENTITY_COMPOUND_MEMBER)
2634 record_entity(entity, false);
2638 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2640 type_t *type = NULL;
2641 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
2642 unsigned type_specifiers = 0;
2643 bool newtype = false;
2644 bool saw_error = false;
2646 memset(specifiers, 0, sizeof(*specifiers));
2647 specifiers->source_position = *HERE;
2650 specifiers->attributes = parse_attributes(specifiers->attributes);
2652 switch (token.kind) {
2654 #define MATCH_STORAGE_CLASS(token, class) \
2656 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
2657 errorf(HERE, "multiple storage classes in declaration specifiers"); \
2659 specifiers->storage_class = class; \
2660 if (specifiers->thread_local) \
2661 goto check_thread_storage_class; \
2665 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
2666 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
2667 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
2668 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
2669 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
2672 specifiers->attributes
2673 = parse_microsoft_extended_decl_modifier(specifiers->attributes);
2676 case T__Thread_local:
2677 if (specifiers->thread_local) {
2678 errorf(HERE, "duplicate %K", &token);
2680 specifiers->thread_local = true;
2681 check_thread_storage_class:
2682 switch (specifiers->storage_class) {
2683 case STORAGE_CLASS_EXTERN:
2684 case STORAGE_CLASS_NONE:
2685 case STORAGE_CLASS_STATIC:
2689 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_storage_class;
2690 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_storage_class;
2691 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_storage_class;
2692 wrong_thread_storage_class:
2693 errorf(HERE, "%K used with '%s'", &token, wrong);
2700 /* type qualifiers */
2701 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
2703 qualifiers |= qualifier; \
2707 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
2708 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
2709 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
2710 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
2711 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
2712 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
2713 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
2714 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
2716 /* type specifiers */
2717 #define MATCH_SPECIFIER(token, specifier, name) \
2719 if (type_specifiers & specifier) { \
2720 errorf(HERE, "multiple " name " type specifiers given"); \
2722 type_specifiers |= specifier; \
2727 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
2728 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
2729 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
2730 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
2731 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
2732 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
2733 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
2734 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
2735 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
2736 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
2737 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
2738 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
2739 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
2740 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
2741 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
2742 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
2743 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
2744 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
2748 specifiers->is_inline = true;
2752 case T__forceinline:
2753 eat(T__forceinline);
2754 specifiers->modifiers |= DM_FORCEINLINE;
2759 if (type_specifiers & SPECIFIER_LONG_LONG) {
2760 errorf(HERE, "too many long type specifiers given");
2761 } else if (type_specifiers & SPECIFIER_LONG) {
2762 type_specifiers |= SPECIFIER_LONG_LONG;
2764 type_specifiers |= SPECIFIER_LONG;
2769 #define CHECK_DOUBLE_TYPE() \
2770 (type != NULL ? errorf(HERE, "multiple types in declaration specifiers") : (void)0)
2773 CHECK_DOUBLE_TYPE();
2774 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
2776 type->compound.compound = parse_compound_type_specifier(true);
2779 CHECK_DOUBLE_TYPE();
2780 type = allocate_type_zero(TYPE_COMPOUND_UNION);
2781 type->compound.compound = parse_compound_type_specifier(false);
2784 CHECK_DOUBLE_TYPE();
2785 type = parse_enum_specifier();
2788 CHECK_DOUBLE_TYPE();
2789 type = parse_typeof();
2791 case T___builtin_va_list:
2792 CHECK_DOUBLE_TYPE();
2793 type = duplicate_type(type_valist);
2794 eat(T___builtin_va_list);
2797 case T_IDENTIFIER: {
2798 /* only parse identifier if we haven't found a type yet */
2799 if (type != NULL || type_specifiers != 0) {
2800 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
2801 * declaration, so it doesn't generate errors about expecting '(' or
2803 switch (look_ahead(1)->kind) {
2810 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
2814 errorf(HERE, "discarding stray %K in declaration specifier", &token);
2819 goto finish_specifiers;
2823 type_t *const typedef_type = get_typedef_type(token.base.symbol);
2824 if (typedef_type == NULL) {
2825 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
2826 * declaration, so it doesn't generate 'implicit int' followed by more
2827 * errors later on. */
2828 token_kind_t const la1_type = (token_kind_t)look_ahead(1)->kind;
2834 errorf(HERE, "%K does not name a type", &token);
2836 entity_t *const entity = create_error_entity(token.base.symbol, ENTITY_TYPEDEF);
2838 type = allocate_type_zero(TYPE_TYPEDEF);
2839 type->typedeft.typedefe = &entity->typedefe;
2847 goto finish_specifiers;
2852 type = typedef_type;
2856 /* function specifier */
2858 goto finish_specifiers;
2863 specifiers->attributes = parse_attributes(specifiers->attributes);
2865 if (type == NULL || (saw_error && type_specifiers != 0)) {
2866 atomic_type_kind_t atomic_type;
2868 /* match valid basic types */
2869 switch (type_specifiers) {
2870 case SPECIFIER_VOID:
2871 atomic_type = ATOMIC_TYPE_VOID;
2873 case SPECIFIER_WCHAR_T:
2874 atomic_type = ATOMIC_TYPE_WCHAR_T;
2876 case SPECIFIER_CHAR:
2877 atomic_type = ATOMIC_TYPE_CHAR;
2879 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
2880 atomic_type = ATOMIC_TYPE_SCHAR;
2882 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
2883 atomic_type = ATOMIC_TYPE_UCHAR;
2885 case SPECIFIER_SHORT:
2886 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
2887 case SPECIFIER_SHORT | SPECIFIER_INT:
2888 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
2889 atomic_type = ATOMIC_TYPE_SHORT;
2891 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
2892 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
2893 atomic_type = ATOMIC_TYPE_USHORT;
2896 case SPECIFIER_SIGNED:
2897 case SPECIFIER_SIGNED | SPECIFIER_INT:
2898 atomic_type = ATOMIC_TYPE_INT;
2900 case SPECIFIER_UNSIGNED:
2901 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
2902 atomic_type = ATOMIC_TYPE_UINT;
2904 case SPECIFIER_LONG:
2905 case SPECIFIER_SIGNED | SPECIFIER_LONG:
2906 case SPECIFIER_LONG | SPECIFIER_INT:
2907 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
2908 atomic_type = ATOMIC_TYPE_LONG;
2910 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
2911 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
2912 atomic_type = ATOMIC_TYPE_ULONG;
2915 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2916 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2917 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
2918 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
2920 atomic_type = ATOMIC_TYPE_LONGLONG;
2921 goto warn_about_long_long;
2923 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2924 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
2926 atomic_type = ATOMIC_TYPE_ULONGLONG;
2927 warn_about_long_long:
2928 warningf(WARN_LONG_LONG, &specifiers->source_position, "ISO C90 does not support 'long long'");
2931 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
2932 atomic_type = unsigned_int8_type_kind;
2935 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
2936 atomic_type = unsigned_int16_type_kind;
2939 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
2940 atomic_type = unsigned_int32_type_kind;
2943 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
2944 atomic_type = unsigned_int64_type_kind;
2947 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
2948 atomic_type = unsigned_int128_type_kind;
2951 case SPECIFIER_INT8:
2952 case SPECIFIER_SIGNED | SPECIFIER_INT8:
2953 atomic_type = int8_type_kind;
2956 case SPECIFIER_INT16:
2957 case SPECIFIER_SIGNED | SPECIFIER_INT16:
2958 atomic_type = int16_type_kind;
2961 case SPECIFIER_INT32:
2962 case SPECIFIER_SIGNED | SPECIFIER_INT32:
2963 atomic_type = int32_type_kind;
2966 case SPECIFIER_INT64:
2967 case SPECIFIER_SIGNED | SPECIFIER_INT64:
2968 atomic_type = int64_type_kind;
2971 case SPECIFIER_INT128:
2972 case SPECIFIER_SIGNED | SPECIFIER_INT128:
2973 atomic_type = int128_type_kind;
2976 case SPECIFIER_FLOAT:
2977 atomic_type = ATOMIC_TYPE_FLOAT;
2979 case SPECIFIER_DOUBLE:
2980 atomic_type = ATOMIC_TYPE_DOUBLE;
2982 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
2983 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
2985 case SPECIFIER_BOOL:
2986 atomic_type = ATOMIC_TYPE_BOOL;
2988 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
2989 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
2990 atomic_type = ATOMIC_TYPE_FLOAT;
2992 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
2993 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
2994 atomic_type = ATOMIC_TYPE_DOUBLE;
2996 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
2997 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
2998 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3001 /* invalid specifier combination, give an error message */
3002 source_position_t const* const pos = &specifiers->source_position;
3003 if (type_specifiers == 0) {
3005 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
3006 if (!(c_mode & _CXX) && !strict_mode) {
3007 warningf(WARN_IMPLICIT_INT, pos, "no type specifiers in declaration, using 'int'");
3008 atomic_type = ATOMIC_TYPE_INT;
3011 errorf(pos, "no type specifiers given in declaration");
3014 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3015 (type_specifiers & SPECIFIER_UNSIGNED)) {
3016 errorf(pos, "signed and unsigned specifiers given");
3017 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3018 errorf(pos, "only integer types can be signed or unsigned");
3020 errorf(pos, "multiple datatypes in declaration");
3022 specifiers->type = type_error_type;
3027 if (type_specifiers & SPECIFIER_COMPLEX) {
3028 type = allocate_type_zero(TYPE_COMPLEX);
3029 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3030 type = allocate_type_zero(TYPE_IMAGINARY);
3032 type = allocate_type_zero(TYPE_ATOMIC);
3034 type->atomic.akind = atomic_type;
3036 } else if (type_specifiers != 0) {
3037 errorf(&specifiers->source_position, "multiple datatypes in declaration");
3040 /* FIXME: check type qualifiers here */
3041 type->base.qualifiers = qualifiers;
3044 type = identify_new_type(type);
3046 type = typehash_insert(type);
3049 if (specifiers->attributes != NULL)
3050 type = handle_type_attributes(specifiers->attributes, type);
3051 specifiers->type = type;
3054 static type_qualifiers_t parse_type_qualifiers(void)
3056 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3059 switch (token.kind) {
3060 /* type qualifiers */
3061 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3062 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3063 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3064 /* microsoft extended type modifiers */
3065 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3066 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3067 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3068 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3069 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3078 * Parses an K&R identifier list
3080 static void parse_identifier_list(scope_t *scope)
3082 assert(token.kind == T_IDENTIFIER);
3084 entity_t *const entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, token.base.symbol, HERE);
3085 /* a K&R parameter has no type, yet */
3089 append_entity(scope, entity);
3090 } while (accept(',') && token.kind == T_IDENTIFIER);
3093 static entity_t *parse_parameter(void)
3095 declaration_specifiers_t specifiers;
3096 parse_declaration_specifiers(&specifiers);
3098 entity_t *entity = parse_declarator(&specifiers,
3099 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
3100 anonymous_entity = NULL;
3104 static void semantic_parameter_incomplete(const entity_t *entity)
3106 assert(entity->kind == ENTITY_PARAMETER);
3108 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
3109 * list in a function declarator that is part of a
3110 * definition of that function shall not have
3111 * incomplete type. */
3112 type_t *type = skip_typeref(entity->declaration.type);
3113 if (is_type_incomplete(type)) {
3114 errorf(&entity->base.source_position, "'%N' has incomplete type", entity);
3118 static bool has_parameters(void)
3120 /* func(void) is not a parameter */
3121 if (look_ahead(1)->kind != ')')
3123 if (token.kind == T_IDENTIFIER) {
3124 entity_t const *const entity = get_entity(token.base.symbol, NAMESPACE_NORMAL);
3127 if (entity->kind != ENTITY_TYPEDEF)
3129 type_t const *const type = skip_typeref(entity->typedefe.type);
3130 if (!is_type_void(type))
3132 if (c_mode & _CXX) {
3133 /* ISO/IEC 14882:1998(E) §8.3.5:2 It must be literally (void). A typedef
3134 * is not allowed. */
3135 errorf(HERE, "empty parameter list defined with a typedef of 'void' not allowed in C++");
3136 } else if (type->base.qualifiers != TYPE_QUALIFIER_NONE) {
3137 /* §6.7.5.3:10 Qualification is not allowed here. */
3138 errorf(HERE, "'void' as parameter must not have type qualifiers");
3140 } else if (token.kind != T_void) {
3148 * Parses function type parameters (and optionally creates variable_t entities
3149 * for them in a scope)
3151 static void parse_parameters(function_type_t *type, scope_t *scope)
3153 add_anchor_token(')');
3156 if (token.kind == T_IDENTIFIER &&
3157 !is_typedef_symbol(token.base.symbol) &&
3158 (look_ahead(1)->kind == ',' || look_ahead(1)->kind == ')')) {
3159 type->kr_style_parameters = true;
3160 parse_identifier_list(scope);
3161 } else if (token.kind == ')') {
3162 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
3163 if (!(c_mode & _CXX))
3164 type->unspecified_parameters = true;
3165 } else if (has_parameters()) {
3166 function_parameter_t **anchor = &type->parameters;
3167 add_anchor_token(',');
3169 switch (token.kind) {
3172 type->variadic = true;
3173 goto parameters_finished;
3178 entity_t *entity = parse_parameter();
3179 if (entity->kind == ENTITY_TYPEDEF) {
3180 errorf(&entity->base.source_position,
3181 "typedef not allowed as function parameter");
3184 assert(is_declaration(entity));
3186 semantic_parameter_incomplete(entity);
3188 function_parameter_t *const parameter =
3189 allocate_parameter(entity->declaration.type);
3191 if (scope != NULL) {
3192 append_entity(scope, entity);
3195 *anchor = parameter;
3196 anchor = ¶meter->next;
3201 goto parameters_finished;
3203 } while (accept(','));
3204 parameters_finished:
3205 rem_anchor_token(',');
3208 rem_anchor_token(')');
3212 typedef enum construct_type_kind_t {
3213 CONSTRUCT_POINTER = 1,
3214 CONSTRUCT_REFERENCE,
3217 } construct_type_kind_t;
3219 typedef union construct_type_t construct_type_t;
3221 typedef struct construct_type_base_t {
3222 construct_type_kind_t kind;
3223 source_position_t pos;
3224 construct_type_t *next;
3225 } construct_type_base_t;
3227 typedef struct parsed_pointer_t {
3228 construct_type_base_t base;
3229 type_qualifiers_t type_qualifiers;
3230 variable_t *base_variable; /**< MS __based extension. */
3233 typedef struct parsed_reference_t {
3234 construct_type_base_t base;
3235 } parsed_reference_t;
3237 typedef struct construct_function_type_t {
3238 construct_type_base_t base;
3239 type_t *function_type;
3240 } construct_function_type_t;
3242 typedef struct parsed_array_t {
3243 construct_type_base_t base;
3244 type_qualifiers_t type_qualifiers;
3250 union construct_type_t {
3251 construct_type_kind_t kind;
3252 construct_type_base_t base;
3253 parsed_pointer_t pointer;
3254 parsed_reference_t reference;
3255 construct_function_type_t function;
3256 parsed_array_t array;
3259 static construct_type_t *allocate_declarator_zero(construct_type_kind_t const kind, size_t const size)
3261 construct_type_t *const cons = obstack_alloc(&temp_obst, size);
3262 memset(cons, 0, size);
3264 cons->base.pos = *HERE;
3269 static construct_type_t *parse_pointer_declarator(void)
3271 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_POINTER, sizeof(parsed_pointer_t));
3273 cons->pointer.type_qualifiers = parse_type_qualifiers();
3274 //cons->pointer.base_variable = base_variable;
3279 /* ISO/IEC 14882:1998(E) §8.3.2 */
3280 static construct_type_t *parse_reference_declarator(void)
3282 if (!(c_mode & _CXX))
3283 errorf(HERE, "references are only available for C++");
3285 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_REFERENCE, sizeof(parsed_reference_t));
3292 static construct_type_t *parse_array_declarator(void)
3294 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_ARRAY, sizeof(parsed_array_t));
3295 parsed_array_t *const array = &cons->array;
3298 add_anchor_token(']');
3300 bool is_static = accept(T_static);
3302 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3305 is_static = accept(T_static);
3307 array->type_qualifiers = type_qualifiers;
3308 array->is_static = is_static;
3310 expression_t *size = NULL;
3311 if (token.kind == '*' && look_ahead(1)->kind == ']') {
3312 array->is_variable = true;
3314 } else if (token.kind != ']') {
3315 size = parse_assignment_expression();
3317 /* §6.7.5.2:1 Array size must have integer type */
3318 type_t *const orig_type = size->base.type;
3319 type_t *const type = skip_typeref(orig_type);
3320 if (!is_type_integer(type) && is_type_valid(type)) {
3321 errorf(&size->base.source_position,
3322 "array size '%E' must have integer type but has type '%T'",
3327 mark_vars_read(size, NULL);
3330 if (is_static && size == NULL)
3331 errorf(&array->base.pos, "static array parameters require a size");
3333 rem_anchor_token(']');
3339 static construct_type_t *parse_function_declarator(scope_t *scope)
3341 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_FUNCTION, sizeof(construct_function_type_t));
3343 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3344 function_type_t *ftype = &type->function;
3346 ftype->linkage = current_linkage;
3347 ftype->calling_convention = CC_DEFAULT;
3349 parse_parameters(ftype, scope);
3351 cons->function.function_type = type;
3356 typedef struct parse_declarator_env_t {
3357 bool may_be_abstract : 1;
3358 bool must_be_abstract : 1;
3359 decl_modifiers_t modifiers;
3361 source_position_t source_position;
3363 attribute_t *attributes;
3364 } parse_declarator_env_t;
3367 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env)
3369 /* construct a single linked list of construct_type_t's which describe
3370 * how to construct the final declarator type */
3371 construct_type_t *first = NULL;
3372 construct_type_t **anchor = &first;
3374 env->attributes = parse_attributes(env->attributes);
3377 construct_type_t *type;
3378 //variable_t *based = NULL; /* MS __based extension */
3379 switch (token.kind) {
3381 type = parse_reference_declarator();
3385 panic("based not supported anymore");
3390 type = parse_pointer_declarator();
3394 goto ptr_operator_end;
3398 anchor = &type->base.next;
3400 /* TODO: find out if this is correct */
3401 env->attributes = parse_attributes(env->attributes);
3405 construct_type_t *inner_types = NULL;
3407 switch (token.kind) {
3409 if (env->must_be_abstract) {
3410 errorf(HERE, "no identifier expected in typename");
3412 env->symbol = token.base.symbol;
3413 env->source_position = *HERE;
3419 /* Parenthesized declarator or function declarator? */
3420 token_t const *const la1 = look_ahead(1);
3421 switch (la1->kind) {
3423 if (is_typedef_symbol(la1->base.symbol)) {
3425 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
3426 * interpreted as ``function with no parameter specification'', rather
3427 * than redundant parentheses around the omitted identifier. */
3429 /* Function declarator. */
3430 if (!env->may_be_abstract) {
3431 errorf(HERE, "function declarator must have a name");
3438 case T___attribute__: /* FIXME __attribute__ might also introduce a parameter of a function declarator. */
3439 /* Paranthesized declarator. */
3441 add_anchor_token(')');
3442 inner_types = parse_inner_declarator(env);
3443 if (inner_types != NULL) {
3444 /* All later declarators only modify the return type */
3445 env->must_be_abstract = true;
3447 rem_anchor_token(')');
3456 if (env->may_be_abstract)
3458 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3463 construct_type_t **const p = anchor;
3466 construct_type_t *type;
3467 switch (token.kind) {
3469 scope_t *scope = NULL;
3470 if (!env->must_be_abstract) {
3471 scope = &env->parameters;
3474 type = parse_function_declarator(scope);
3478 type = parse_array_declarator();
3481 goto declarator_finished;
3484 /* insert in the middle of the list (at p) */
3485 type->base.next = *p;
3488 anchor = &type->base.next;
3491 declarator_finished:
3492 /* append inner_types at the end of the list, we don't to set anchor anymore
3493 * as it's not needed anymore */
3494 *anchor = inner_types;
3499 static type_t *construct_declarator_type(construct_type_t *construct_list,
3502 construct_type_t *iter = construct_list;
3503 for (; iter != NULL; iter = iter->base.next) {
3504 source_position_t const* const pos = &iter->base.pos;
3505 switch (iter->kind) {
3506 case CONSTRUCT_FUNCTION: {
3507 construct_function_type_t *function = &iter->function;
3508 type_t *function_type = function->function_type;
3510 function_type->function.return_type = type;
3512 type_t *skipped_return_type = skip_typeref(type);
3514 if (is_type_function(skipped_return_type)) {
3515 errorf(pos, "function returning function is not allowed");
3516 } else if (is_type_array(skipped_return_type)) {
3517 errorf(pos, "function returning array is not allowed");
3519 if (skipped_return_type->base.qualifiers != 0) {
3520 warningf(WARN_IGNORED_QUALIFIERS, pos, "type qualifiers in return type of function type are meaningless");
3524 /* The function type was constructed earlier. Freeing it here will
3525 * destroy other types. */
3526 type = typehash_insert(function_type);
3530 case CONSTRUCT_POINTER: {
3531 if (is_type_reference(skip_typeref(type)))
3532 errorf(pos, "cannot declare a pointer to reference");
3534 parsed_pointer_t *pointer = &iter->pointer;
3535 type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
3539 case CONSTRUCT_REFERENCE:
3540 if (is_type_reference(skip_typeref(type)))
3541 errorf(pos, "cannot declare a reference to reference");
3543 type = make_reference_type(type);
3546 case CONSTRUCT_ARRAY: {
3547 if (is_type_reference(skip_typeref(type)))
3548 errorf(pos, "cannot declare an array of references");
3550 parsed_array_t *array = &iter->array;
3551 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
3553 expression_t *size_expression = array->size;
3554 if (size_expression != NULL) {
3556 = create_implicit_cast(size_expression, type_size_t);
3559 array_type->base.qualifiers = array->type_qualifiers;
3560 array_type->array.element_type = type;
3561 array_type->array.is_static = array->is_static;
3562 array_type->array.is_variable = array->is_variable;
3563 array_type->array.size_expression = size_expression;
3565 if (size_expression != NULL) {
3566 switch (is_constant_expression(size_expression)) {
3567 case EXPR_CLASS_CONSTANT: {
3568 long const size = fold_constant_to_int(size_expression);
3569 array_type->array.size = size;
3570 array_type->array.size_constant = true;
3571 /* §6.7.5.2:1 If the expression is a constant expression,
3572 * it shall have a value greater than zero. */
3574 errorf(&size_expression->base.source_position,
3575 "size of array must be greater than zero");
3576 } else if (size == 0 && !GNU_MODE) {
3577 errorf(&size_expression->base.source_position,
3578 "size of array must be greater than zero (zero length arrays are a GCC extension)");
3583 case EXPR_CLASS_VARIABLE:
3584 array_type->array.is_vla = true;
3587 case EXPR_CLASS_ERROR:
3592 type_t *skipped_type = skip_typeref(type);
3594 if (is_type_incomplete(skipped_type)) {
3595 errorf(pos, "array of incomplete type '%T' is not allowed", type);
3596 } else if (is_type_function(skipped_type)) {
3597 errorf(pos, "array of functions is not allowed");
3599 type = identify_new_type(array_type);
3603 internal_errorf(pos, "invalid type construction found");
3609 static type_t *automatic_type_conversion(type_t *orig_type);
3611 static type_t *semantic_parameter(const source_position_t *pos,
3613 const declaration_specifiers_t *specifiers,
3614 entity_t const *const param)
3616 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
3617 * shall be adjusted to ``qualified pointer to type'',
3619 * §6.7.5.3:8 A declaration of a parameter as ``function returning
3620 * type'' shall be adjusted to ``pointer to function
3621 * returning type'', as in 6.3.2.1. */
3622 type = automatic_type_conversion(type);
3624 if (specifiers->is_inline && is_type_valid(type)) {
3625 errorf(pos, "'%N' declared 'inline'", param);
3628 /* §6.9.1:6 The declarations in the declaration list shall contain
3629 * no storage-class specifier other than register and no
3630 * initializations. */
3631 if (specifiers->thread_local || (
3632 specifiers->storage_class != STORAGE_CLASS_NONE &&
3633 specifiers->storage_class != STORAGE_CLASS_REGISTER)
3635 errorf(pos, "invalid storage class for '%N'", param);
3638 /* delay test for incomplete type, because we might have (void)
3639 * which is legal but incomplete... */
3644 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
3645 declarator_flags_t flags)
3647 parse_declarator_env_t env;
3648 memset(&env, 0, sizeof(env));
3649 env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
3651 construct_type_t *construct_type = parse_inner_declarator(&env);
3653 construct_declarator_type(construct_type, specifiers->type);
3654 type_t *type = skip_typeref(orig_type);
3656 if (construct_type != NULL) {
3657 obstack_free(&temp_obst, construct_type);
3660 attribute_t *attributes = parse_attributes(env.attributes);
3661 /* append (shared) specifier attribute behind attributes of this
3663 attribute_t **anchor = &attributes;
3664 while (*anchor != NULL)
3665 anchor = &(*anchor)->next;
3666 *anchor = specifiers->attributes;
3669 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
3670 entity = allocate_entity_zero(ENTITY_TYPEDEF, NAMESPACE_NORMAL, env.symbol, &env.source_position);
3671 entity->typedefe.type = orig_type;
3673 if (anonymous_entity != NULL) {
3674 if (is_type_compound(type)) {
3675 assert(anonymous_entity->compound.alias == NULL);
3676 assert(anonymous_entity->kind == ENTITY_STRUCT ||
3677 anonymous_entity->kind == ENTITY_UNION);
3678 anonymous_entity->compound.alias = entity;
3679 anonymous_entity = NULL;
3680 } else if (is_type_enum(type)) {
3681 assert(anonymous_entity->enume.alias == NULL);
3682 assert(anonymous_entity->kind == ENTITY_ENUM);
3683 anonymous_entity->enume.alias = entity;
3684 anonymous_entity = NULL;
3688 /* create a declaration type entity */
3689 source_position_t const *const pos = env.symbol ? &env.source_position : &specifiers->source_position;
3690 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
3691 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, env.symbol, pos);
3693 if (env.symbol != NULL) {
3694 if (specifiers->is_inline && is_type_valid(type)) {
3695 errorf(&env.source_position, "'%N' declared 'inline'", entity);
3698 if (specifiers->thread_local ||
3699 specifiers->storage_class != STORAGE_CLASS_NONE) {
3700 errorf(&env.source_position, "'%N' must have no storage class", entity);
3703 } else if (flags & DECL_IS_PARAMETER) {
3704 entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, env.symbol, pos);
3705 orig_type = semantic_parameter(&env.source_position, orig_type, specifiers, entity);
3706 } else if (is_type_function(type)) {
3707 entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, env.symbol, pos);
3708 entity->function.is_inline = specifiers->is_inline;
3709 entity->function.elf_visibility = default_visibility;
3710 entity->function.parameters = env.parameters;
3712 if (env.symbol != NULL) {
3713 /* this needs fixes for C++ */
3714 bool in_function_scope = current_function != NULL;
3716 if (specifiers->thread_local || (
3717 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3718 specifiers->storage_class != STORAGE_CLASS_NONE &&
3719 (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
3721 errorf(&env.source_position, "invalid storage class for '%N'", entity);
3725 entity = allocate_entity_zero(ENTITY_VARIABLE, NAMESPACE_NORMAL, env.symbol, pos);
3726 entity->variable.elf_visibility = default_visibility;
3727 entity->variable.thread_local = specifiers->thread_local;
3729 if (env.symbol != NULL) {
3730 if (specifiers->is_inline && is_type_valid(type)) {
3731 errorf(&env.source_position, "'%N' declared 'inline'", entity);
3734 bool invalid_storage_class = false;
3735 if (current_scope == file_scope) {
3736 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3737 specifiers->storage_class != STORAGE_CLASS_NONE &&
3738 specifiers->storage_class != STORAGE_CLASS_STATIC) {
3739 invalid_storage_class = true;
3742 if (specifiers->thread_local &&
3743 specifiers->storage_class == STORAGE_CLASS_NONE) {
3744 invalid_storage_class = true;
3747 if (invalid_storage_class) {
3748 errorf(&env.source_position, "invalid storage class for '%N'", entity);
3753 entity->declaration.type = orig_type;
3754 entity->declaration.alignment = get_type_alignment(orig_type);
3755 entity->declaration.modifiers = env.modifiers;
3756 entity->declaration.attributes = attributes;
3758 storage_class_t storage_class = specifiers->storage_class;
3759 entity->declaration.declared_storage_class = storage_class;
3761 if (storage_class == STORAGE_CLASS_NONE && current_function != NULL)
3762 storage_class = STORAGE_CLASS_AUTO;
3763 entity->declaration.storage_class = storage_class;
3766 if (attributes != NULL) {
3767 handle_entity_attributes(attributes, entity);
3770 if (entity->kind == ENTITY_FUNCTION && !freestanding) {
3771 adapt_special_functions(&entity->function);
3777 static type_t *parse_abstract_declarator(type_t *base_type)
3779 parse_declarator_env_t env;
3780 memset(&env, 0, sizeof(env));
3781 env.may_be_abstract = true;
3782 env.must_be_abstract = true;
3784 construct_type_t *construct_type = parse_inner_declarator(&env);
3786 type_t *result = construct_declarator_type(construct_type, base_type);
3787 if (construct_type != NULL) {
3788 obstack_free(&temp_obst, construct_type);
3790 result = handle_type_attributes(env.attributes, result);
3796 * Check if the declaration of main is suspicious. main should be a
3797 * function with external linkage, returning int, taking either zero
3798 * arguments, two, or three arguments of appropriate types, ie.
3800 * int main([ int argc, char **argv [, char **env ] ]).
3802 * @param decl the declaration to check
3803 * @param type the function type of the declaration
3805 static void check_main(const entity_t *entity)
3807 const source_position_t *pos = &entity->base.source_position;
3808 if (entity->kind != ENTITY_FUNCTION) {
3809 warningf(WARN_MAIN, pos, "'main' is not a function");
3813 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
3814 warningf(WARN_MAIN, pos, "'main' is normally a non-static function");
3817 type_t *type = skip_typeref(entity->declaration.type);
3818 assert(is_type_function(type));
3820 function_type_t const *const func_type = &type->function;
3821 type_t *const ret_type = func_type->return_type;
3822 if (!types_compatible(skip_typeref(ret_type), type_int)) {
3823 warningf(WARN_MAIN, pos, "return type of 'main' should be 'int', but is '%T'", ret_type);
3825 const function_parameter_t *parm = func_type->parameters;
3827 type_t *const first_type = skip_typeref(parm->type);
3828 type_t *const first_type_unqual = get_unqualified_type(first_type);
3829 if (!types_compatible(first_type_unqual, type_int)) {
3830 warningf(WARN_MAIN, pos, "first argument of 'main' should be 'int', but is '%T'", parm->type);
3834 type_t *const second_type = skip_typeref(parm->type);
3835 type_t *const second_type_unqual
3836 = get_unqualified_type(second_type);
3837 if (!types_compatible(second_type_unqual, type_char_ptr_ptr)) {
3838 warningf(WARN_MAIN, pos, "second argument of 'main' should be 'char**', but is '%T'", parm->type);
3842 type_t *const third_type = skip_typeref(parm->type);
3843 type_t *const third_type_unqual
3844 = get_unqualified_type(third_type);
3845 if (!types_compatible(third_type_unqual, type_char_ptr_ptr)) {
3846 warningf(WARN_MAIN, pos, "third argument of 'main' should be 'char**', but is '%T'", parm->type);
3850 goto warn_arg_count;
3854 warningf(WARN_MAIN, pos, "'main' takes only zero, two or three arguments");
3859 static void error_redefined_as_different_kind(const source_position_t *pos,
3860 const entity_t *old, entity_kind_t new_kind)
3862 char const *const what = get_entity_kind_name(new_kind);
3863 source_position_t const *const ppos = &old->base.source_position;
3864 errorf(pos, "redeclaration of '%N' as %s (declared %P)", old, what, ppos);
3867 static bool is_entity_valid(entity_t *const ent)
3869 if (is_declaration(ent)) {
3870 return is_type_valid(skip_typeref(ent->declaration.type));
3871 } else if (ent->kind == ENTITY_TYPEDEF) {
3872 return is_type_valid(skip_typeref(ent->typedefe.type));
3877 static bool contains_attribute(const attribute_t *list, const attribute_t *attr)
3879 for (const attribute_t *tattr = list; tattr != NULL; tattr = tattr->next) {
3880 if (attributes_equal(tattr, attr))
3887 * test wether new_list contains any attributes not included in old_list
3889 static bool has_new_attributes(const attribute_t *old_list,
3890 const attribute_t *new_list)
3892 for (const attribute_t *attr = new_list; attr != NULL; attr = attr->next) {
3893 if (!contains_attribute(old_list, attr))
3900 * Merge in attributes from an attribute list (probably from a previous
3901 * declaration with the same name). Warning: destroys the old structure
3902 * of the attribute list - don't reuse attributes after this call.
3904 static void merge_in_attributes(declaration_t *decl, attribute_t *attributes)
3907 for (attribute_t *attr = attributes; attr != NULL; attr = next) {
3909 if (contains_attribute(decl->attributes, attr))
3912 /* move attribute to new declarations attributes list */
3913 attr->next = decl->attributes;
3914 decl->attributes = attr;
3918 static bool is_main(entity_t*);
3921 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
3922 * for various problems that occur for multiple definitions
3924 entity_t *record_entity(entity_t *entity, const bool is_definition)
3926 const symbol_t *const symbol = entity->base.symbol;
3927 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
3928 const source_position_t *pos = &entity->base.source_position;
3930 /* can happen in error cases */
3934 assert(!entity->base.parent_scope);
3935 assert(current_scope);
3936 entity->base.parent_scope = current_scope;
3938 entity_t *const previous_entity = get_entity(symbol, namespc);
3939 /* pushing the same entity twice will break the stack structure */
3940 assert(previous_entity != entity);
3942 if (entity->kind == ENTITY_FUNCTION) {
3943 type_t *const orig_type = entity->declaration.type;
3944 type_t *const type = skip_typeref(orig_type);
3946 assert(is_type_function(type));
3947 if (type->function.unspecified_parameters &&
3948 previous_entity == NULL &&
3949 !entity->declaration.implicit) {
3950 warningf(WARN_STRICT_PROTOTYPES, pos, "function declaration '%#N' is not a prototype", entity);
3953 if (is_main(entity)) {
3958 if (is_declaration(entity) &&
3959 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
3960 current_scope != file_scope &&
3961 !entity->declaration.implicit) {
3962 warningf(WARN_NESTED_EXTERNS, pos, "nested extern declaration of '%#N'", entity);
3965 if (previous_entity != NULL) {
3966 source_position_t const *const ppos = &previous_entity->base.source_position;
3968 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
3969 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
3970 assert(previous_entity->kind == ENTITY_PARAMETER);
3971 errorf(pos, "declaration of '%N' redeclares the '%N' (declared %P)", entity, previous_entity, ppos);
3975 if (previous_entity->base.parent_scope == current_scope) {
3976 if (previous_entity->kind != entity->kind) {
3977 if (is_entity_valid(previous_entity) && is_entity_valid(entity)) {
3978 error_redefined_as_different_kind(pos, previous_entity,
3983 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
3984 errorf(pos, "redeclaration of '%N' (declared %P)", entity, ppos);
3987 if (previous_entity->kind == ENTITY_TYPEDEF) {
3988 type_t *const type = skip_typeref(entity->typedefe.type);
3989 type_t *const prev_type
3990 = skip_typeref(previous_entity->typedefe.type);
3991 if (c_mode & _CXX) {
3992 /* C++ allows double typedef if they are identical
3993 * (after skipping typedefs) */
3994 if (type == prev_type)
3997 /* GCC extension: redef in system headers is allowed */
3998 if ((pos->is_system_header || ppos->is_system_header) &&
3999 types_compatible(type, prev_type))
4002 errorf(pos, "redefinition of '%N' (declared %P)",
4007 /* at this point we should have only VARIABLES or FUNCTIONS */
4008 assert(is_declaration(previous_entity) && is_declaration(entity));
4010 declaration_t *const prev_decl = &previous_entity->declaration;
4011 declaration_t *const decl = &entity->declaration;
4013 /* can happen for K&R style declarations */
4014 if (prev_decl->type == NULL &&
4015 previous_entity->kind == ENTITY_PARAMETER &&
4016 entity->kind == ENTITY_PARAMETER) {
4017 prev_decl->type = decl->type;
4018 prev_decl->storage_class = decl->storage_class;
4019 prev_decl->declared_storage_class = decl->declared_storage_class;
4020 prev_decl->modifiers = decl->modifiers;
4021 return previous_entity;
4024 type_t *const type = skip_typeref(decl->type);
4025 type_t *const prev_type = skip_typeref(prev_decl->type);
4027 if (!types_compatible(type, prev_type)) {
4028 errorf(pos, "declaration '%#N' is incompatible with '%#N' (declared %P)", entity, previous_entity, ppos);
4030 unsigned old_storage_class = prev_decl->storage_class;
4032 if (is_definition &&
4034 !(prev_decl->modifiers & DM_USED) &&
4035 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4036 warningf(WARN_REDUNDANT_DECLS, ppos, "unnecessary static forward declaration for '%#N'", previous_entity);
4039 storage_class_t new_storage_class = decl->storage_class;
4041 /* pretend no storage class means extern for function
4042 * declarations (except if the previous declaration is neither
4043 * none nor extern) */
4044 if (entity->kind == ENTITY_FUNCTION) {
4045 /* the previous declaration could have unspecified parameters or
4046 * be a typedef, so use the new type */
4047 if (prev_type->function.unspecified_parameters || is_definition)
4048 prev_decl->type = type;
4050 switch (old_storage_class) {
4051 case STORAGE_CLASS_NONE:
4052 old_storage_class = STORAGE_CLASS_EXTERN;
4055 case STORAGE_CLASS_EXTERN:
4056 if (is_definition) {
4057 if (prev_type->function.unspecified_parameters && !is_main(entity)) {
4058 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4060 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4061 new_storage_class = STORAGE_CLASS_EXTERN;
4068 } else if (is_type_incomplete(prev_type)) {
4069 prev_decl->type = type;
4072 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4073 new_storage_class == STORAGE_CLASS_EXTERN) {
4075 warn_redundant_declaration: ;
4077 = has_new_attributes(prev_decl->attributes,
4079 if (has_new_attrs) {
4080 merge_in_attributes(decl, prev_decl->attributes);
4081 } else if (!is_definition &&
4082 is_type_valid(prev_type) &&
4083 !pos->is_system_header) {
4084 warningf(WARN_REDUNDANT_DECLS, pos, "redundant declaration for '%N' (declared %P)", entity, ppos);
4086 } else if (current_function == NULL) {
4087 if (old_storage_class != STORAGE_CLASS_STATIC &&
4088 new_storage_class == STORAGE_CLASS_STATIC) {
4089 errorf(pos, "static declaration of '%N' follows non-static declaration (declared %P)", entity, ppos);
4090 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4091 prev_decl->storage_class = STORAGE_CLASS_NONE;
4092 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4094 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4096 goto error_redeclaration;
4097 goto warn_redundant_declaration;
4099 } else if (is_type_valid(prev_type)) {
4100 if (old_storage_class == new_storage_class) {
4101 error_redeclaration:
4102 errorf(pos, "redeclaration of '%N' (declared %P)", entity, ppos);
4104 errorf(pos, "redeclaration of '%N' with different linkage (declared %P)", entity, ppos);
4109 prev_decl->modifiers |= decl->modifiers;
4110 if (entity->kind == ENTITY_FUNCTION) {
4111 previous_entity->function.is_inline |= entity->function.is_inline;
4113 return previous_entity;
4117 if (is_warn_on(why = WARN_SHADOW) ||
4118 (is_warn_on(why = WARN_SHADOW_LOCAL) && previous_entity->base.parent_scope != file_scope)) {
4119 char const *const what = get_entity_kind_name(previous_entity->kind);
4120 warningf(why, pos, "'%N' shadows %s (declared %P)", entity, what, ppos);
4124 if (entity->kind == ENTITY_FUNCTION) {
4125 if (is_definition &&
4126 entity->declaration.storage_class != STORAGE_CLASS_STATIC &&
4128 if (is_warn_on(WARN_MISSING_PROTOTYPES)) {
4129 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4131 goto warn_missing_declaration;
4134 } else if (entity->kind == ENTITY_VARIABLE) {
4135 if (current_scope == file_scope &&
4136 entity->declaration.storage_class == STORAGE_CLASS_NONE &&
4137 !entity->declaration.implicit) {
4138 warn_missing_declaration:
4139 warningf(WARN_MISSING_DECLARATIONS, pos, "no previous declaration for '%#N'", entity);
4144 environment_push(entity);
4145 append_entity(current_scope, entity);
4150 static void parser_error_multiple_definition(entity_t *entity,
4151 const source_position_t *source_position)
4153 errorf(source_position, "redefinition of '%N' (declared %P)", entity, &entity->base.source_position);
4156 static bool is_declaration_specifier(const token_t *token)
4158 switch (token->kind) {
4162 return is_typedef_symbol(token->base.symbol);
4169 static void parse_init_declarator_rest(entity_t *entity)
4171 type_t *orig_type = type_error_type;
4173 if (entity->base.kind == ENTITY_TYPEDEF) {
4174 source_position_t const *const pos = &entity->base.source_position;
4175 errorf(pos, "'%N' is initialized (use __typeof__ instead)", entity);
4177 assert(is_declaration(entity));
4178 orig_type = entity->declaration.type;
4181 type_t *type = skip_typeref(orig_type);
4183 if (entity->kind == ENTITY_VARIABLE
4184 && entity->variable.initializer != NULL) {
4185 parser_error_multiple_definition(entity, HERE);
4189 declaration_t *const declaration = &entity->declaration;
4190 bool must_be_constant = false;
4191 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4192 entity->base.parent_scope == file_scope) {
4193 must_be_constant = true;
4196 if (is_type_function(type)) {
4197 source_position_t const *const pos = &entity->base.source_position;
4198 errorf(pos, "'%N' is initialized like a variable", entity);
4199 orig_type = type_error_type;
4202 parse_initializer_env_t env;
4203 env.type = orig_type;
4204 env.must_be_constant = must_be_constant;
4205 env.entity = entity;
4207 initializer_t *initializer = parse_initializer(&env);
4209 if (entity->kind == ENTITY_VARIABLE) {
4210 /* §6.7.5:22 array initializers for arrays with unknown size
4211 * determine the array type size */
4212 declaration->type = env.type;
4213 entity->variable.initializer = initializer;
4217 /* parse rest of a declaration without any declarator */
4218 static void parse_anonymous_declaration_rest(
4219 const declaration_specifiers_t *specifiers)
4222 anonymous_entity = NULL;
4224 source_position_t const *const pos = &specifiers->source_position;
4225 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4226 specifiers->thread_local) {
4227 warningf(WARN_OTHER, pos, "useless storage class in empty declaration");
4230 type_t *type = specifiers->type;
4231 switch (type->kind) {
4232 case TYPE_COMPOUND_STRUCT:
4233 case TYPE_COMPOUND_UNION: {
4234 if (type->compound.compound->base.symbol == NULL) {
4235 warningf(WARN_OTHER, pos, "unnamed struct/union that defines no instances");
4244 warningf(WARN_OTHER, pos, "empty declaration");
4249 static void check_variable_type_complete(entity_t *ent)
4251 if (ent->kind != ENTITY_VARIABLE)
4254 /* §6.7:7 If an identifier for an object is declared with no linkage, the
4255 * type for the object shall be complete [...] */
4256 declaration_t *decl = &ent->declaration;
4257 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4258 decl->storage_class == STORAGE_CLASS_STATIC)
4261 type_t *const type = skip_typeref(decl->type);
4262 if (!is_type_incomplete(type))
4265 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4266 * are given length one. */
4267 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4268 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4272 errorf(&ent->base.source_position, "variable '%#N' has incomplete type", ent);
4276 static void parse_declaration_rest(entity_t *ndeclaration,
4277 const declaration_specifiers_t *specifiers,
4278 parsed_declaration_func finished_declaration,
4279 declarator_flags_t flags)
4281 add_anchor_token(';');
4282 add_anchor_token(',');
4284 entity_t *entity = finished_declaration(ndeclaration, token.kind == '=');
4286 if (token.kind == '=') {
4287 parse_init_declarator_rest(entity);
4288 } else if (entity->kind == ENTITY_VARIABLE) {
4289 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
4290 * [...] where the extern specifier is explicitly used. */
4291 declaration_t *decl = &entity->declaration;
4292 if (decl->storage_class != STORAGE_CLASS_EXTERN &&
4293 is_type_reference(skip_typeref(decl->type))) {
4294 source_position_t const *const pos = &entity->base.source_position;
4295 errorf(pos, "reference '%#N' must be initialized", entity);
4299 check_variable_type_complete(entity);
4304 add_anchor_token('=');
4305 ndeclaration = parse_declarator(specifiers, flags);
4306 rem_anchor_token('=');
4308 rem_anchor_token(',');
4309 rem_anchor_token(';');
4312 anonymous_entity = NULL;
4315 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4317 symbol_t *symbol = entity->base.symbol;
4321 assert(entity->base.namespc == NAMESPACE_NORMAL);
4322 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4323 if (previous_entity == NULL
4324 || previous_entity->base.parent_scope != current_scope) {
4325 errorf(&entity->base.source_position, "expected declaration of a function parameter, found '%Y'",
4330 if (is_definition) {
4331 errorf(HERE, "'%N' is initialised", entity);
4334 return record_entity(entity, false);
4337 static void parse_declaration(parsed_declaration_func finished_declaration,
4338 declarator_flags_t flags)
4340 add_anchor_token(';');
4341 declaration_specifiers_t specifiers;
4342 parse_declaration_specifiers(&specifiers);
4343 rem_anchor_token(';');
4345 if (token.kind == ';') {
4346 parse_anonymous_declaration_rest(&specifiers);
4348 entity_t *entity = parse_declarator(&specifiers, flags);
4349 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4354 static type_t *get_default_promoted_type(type_t *orig_type)
4356 type_t *result = orig_type;
4358 type_t *type = skip_typeref(orig_type);
4359 if (is_type_integer(type)) {
4360 result = promote_integer(type);
4361 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4362 result = type_double;
4368 static void parse_kr_declaration_list(entity_t *entity)
4370 if (entity->kind != ENTITY_FUNCTION)
4373 type_t *type = skip_typeref(entity->declaration.type);
4374 assert(is_type_function(type));
4375 if (!type->function.kr_style_parameters)
4378 add_anchor_token('{');
4380 PUSH_SCOPE(&entity->function.parameters);
4382 entity_t *parameter = entity->function.parameters.entities;
4383 for ( ; parameter != NULL; parameter = parameter->base.next) {
4384 assert(parameter->base.parent_scope == NULL);
4385 parameter->base.parent_scope = current_scope;
4386 environment_push(parameter);
4389 /* parse declaration list */
4391 switch (token.kind) {
4393 /* This covers symbols, which are no type, too, and results in
4394 * better error messages. The typical cases are misspelled type
4395 * names and missing includes. */
4397 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4407 /* update function type */
4408 type_t *new_type = duplicate_type(type);
4410 function_parameter_t *parameters = NULL;
4411 function_parameter_t **anchor = ¶meters;
4413 /* did we have an earlier prototype? */
4414 entity_t *proto_type = get_entity(entity->base.symbol, NAMESPACE_NORMAL);
4415 if (proto_type != NULL && proto_type->kind != ENTITY_FUNCTION)
4418 function_parameter_t *proto_parameter = NULL;
4419 if (proto_type != NULL) {
4420 type_t *proto_type_type = proto_type->declaration.type;
4421 proto_parameter = proto_type_type->function.parameters;
4422 /* If a K&R function definition has a variadic prototype earlier, then
4423 * make the function definition variadic, too. This should conform to
4424 * §6.7.5.3:15 and §6.9.1:8. */
4425 new_type->function.variadic = proto_type_type->function.variadic;
4427 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
4429 new_type->function.unspecified_parameters = true;
4432 bool need_incompatible_warning = false;
4433 parameter = entity->function.parameters.entities;
4434 for (; parameter != NULL; parameter = parameter->base.next,
4436 proto_parameter == NULL ? NULL : proto_parameter->next) {
4437 if (parameter->kind != ENTITY_PARAMETER)
4440 type_t *parameter_type = parameter->declaration.type;
4441 if (parameter_type == NULL) {
4442 source_position_t const* const pos = ¶meter->base.source_position;
4444 errorf(pos, "no type specified for function '%N'", parameter);
4445 parameter_type = type_error_type;
4447 warningf(WARN_IMPLICIT_INT, pos, "no type specified for function parameter '%N', using 'int'", parameter);
4448 parameter_type = type_int;
4450 parameter->declaration.type = parameter_type;
4453 semantic_parameter_incomplete(parameter);
4455 /* we need the default promoted types for the function type */
4456 type_t *not_promoted = parameter_type;
4457 parameter_type = get_default_promoted_type(parameter_type);
4459 /* gcc special: if the type of the prototype matches the unpromoted
4460 * type don't promote */
4461 if (!strict_mode && proto_parameter != NULL) {
4462 type_t *proto_p_type = skip_typeref(proto_parameter->type);
4463 type_t *promo_skip = skip_typeref(parameter_type);
4464 type_t *param_skip = skip_typeref(not_promoted);
4465 if (!types_compatible(proto_p_type, promo_skip)
4466 && types_compatible(proto_p_type, param_skip)) {
4468 need_incompatible_warning = true;
4469 parameter_type = not_promoted;
4472 function_parameter_t *const function_parameter
4473 = allocate_parameter(parameter_type);
4475 *anchor = function_parameter;
4476 anchor = &function_parameter->next;
4479 new_type->function.parameters = parameters;
4480 new_type = identify_new_type(new_type);
4482 if (need_incompatible_warning) {
4483 symbol_t const *const sym = entity->base.symbol;
4484 source_position_t const *const pos = &entity->base.source_position;
4485 source_position_t const *const ppos = &proto_type->base.source_position;
4486 warningf(WARN_OTHER, pos, "declaration '%#N' is incompatible with '%#T' (declared %P)", proto_type, new_type, sym, ppos);
4488 entity->declaration.type = new_type;
4490 rem_anchor_token('{');
4493 static bool first_err = true;
4496 * When called with first_err set, prints the name of the current function,
4499 static void print_in_function(void)
4503 char const *const file = current_function->base.base.source_position.input_name;
4504 diagnosticf("%s: In '%N':\n", file, (entity_t const*)current_function);
4509 * Check if all labels are defined in the current function.
4510 * Check if all labels are used in the current function.
4512 static void check_labels(void)
4514 for (const goto_statement_t *goto_statement = goto_first;
4515 goto_statement != NULL;
4516 goto_statement = goto_statement->next) {
4517 label_t *label = goto_statement->label;
4518 if (label->base.source_position.input_name == NULL) {
4519 print_in_function();
4520 source_position_t const *const pos = &goto_statement->base.source_position;
4521 errorf(pos, "'%N' used but not defined", (entity_t const*)label);
4525 if (is_warn_on(WARN_UNUSED_LABEL)) {
4526 for (const label_statement_t *label_statement = label_first;
4527 label_statement != NULL;
4528 label_statement = label_statement->next) {
4529 label_t *label = label_statement->label;
4531 if (! label->used) {
4532 print_in_function();
4533 source_position_t const *const pos = &label_statement->base.source_position;
4534 warningf(WARN_UNUSED_LABEL, pos, "'%N' defined but not used", (entity_t const*)label);
4540 static void warn_unused_entity(warning_t const why, entity_t *entity, entity_t *const last)
4542 entity_t const *const end = last != NULL ? last->base.next : NULL;
4543 for (; entity != end; entity = entity->base.next) {
4544 if (!is_declaration(entity))
4547 declaration_t *declaration = &entity->declaration;
4548 if (declaration->implicit)
4551 if (!declaration->used) {
4552 print_in_function();
4553 warningf(why, &entity->base.source_position, "'%N' is unused", entity);
4554 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
4555 print_in_function();
4556 warningf(why, &entity->base.source_position, "'%N' is never read", entity);
4561 static void check_unused_variables(statement_t *const stmt, void *const env)
4565 switch (stmt->kind) {
4566 case STATEMENT_DECLARATION: {
4567 declaration_statement_t const *const decls = &stmt->declaration;
4568 warn_unused_entity(WARN_UNUSED_VARIABLE, decls->declarations_begin, decls->declarations_end);
4573 warn_unused_entity(WARN_UNUSED_VARIABLE, stmt->fors.scope.entities, NULL);
4582 * Check declarations of current_function for unused entities.
4584 static void check_declarations(void)
4586 if (is_warn_on(WARN_UNUSED_PARAMETER)) {
4587 const scope_t *scope = ¤t_function->parameters;
4588 warn_unused_entity(WARN_UNUSED_PARAMETER, scope->entities, NULL);
4590 if (is_warn_on(WARN_UNUSED_VARIABLE)) {
4591 walk_statements(current_function->body, check_unused_variables, NULL);
4595 static int determine_truth(expression_t const* const cond)
4598 is_constant_expression(cond) != EXPR_CLASS_CONSTANT ? 0 :
4599 fold_constant_to_bool(cond) ? 1 :
4603 static void check_reachable(statement_t *);
4604 static bool reaches_end;
4606 static bool expression_returns(expression_t const *const expr)
4608 switch (expr->kind) {
4610 expression_t const *const func = expr->call.function;
4611 type_t const *const type = skip_typeref(func->base.type);
4612 if (type->kind == TYPE_POINTER) {
4613 type_t const *const points_to
4614 = skip_typeref(type->pointer.points_to);
4615 if (points_to->kind == TYPE_FUNCTION
4616 && points_to->function.modifiers & DM_NORETURN)
4620 if (!expression_returns(func))
4623 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
4624 if (!expression_returns(arg->expression))
4631 case EXPR_REFERENCE:
4632 case EXPR_ENUM_CONSTANT:
4633 case EXPR_LITERAL_CASES:
4634 case EXPR_LITERAL_CHARACTER:
4635 case EXPR_STRING_LITERAL:
4636 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
4637 case EXPR_LABEL_ADDRESS:
4638 case EXPR_CLASSIFY_TYPE:
4639 case EXPR_SIZEOF: // TODO handle obscure VLA case
4642 case EXPR_BUILTIN_CONSTANT_P:
4643 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
4648 case EXPR_STATEMENT: {
4649 bool old_reaches_end = reaches_end;
4650 reaches_end = false;
4651 check_reachable(expr->statement.statement);
4652 bool returns = reaches_end;
4653 reaches_end = old_reaches_end;
4657 case EXPR_CONDITIONAL:
4658 // TODO handle constant expression
4660 if (!expression_returns(expr->conditional.condition))
4663 if (expr->conditional.true_expression != NULL
4664 && expression_returns(expr->conditional.true_expression))
4667 return expression_returns(expr->conditional.false_expression);
4670 return expression_returns(expr->select.compound);
4672 case EXPR_ARRAY_ACCESS:
4674 expression_returns(expr->array_access.array_ref) &&
4675 expression_returns(expr->array_access.index);
4678 return expression_returns(expr->va_starte.ap);
4681 return expression_returns(expr->va_arge.ap);
4684 return expression_returns(expr->va_copye.src);
4686 case EXPR_UNARY_CASES_MANDATORY:
4687 return expression_returns(expr->unary.value);
4689 case EXPR_UNARY_THROW:
4692 case EXPR_BINARY_CASES:
4693 // TODO handle constant lhs of && and ||
4695 expression_returns(expr->binary.left) &&
4696 expression_returns(expr->binary.right);
4699 panic("unhandled expression");
4702 static bool initializer_returns(initializer_t const *const init)
4704 switch (init->kind) {
4705 case INITIALIZER_VALUE:
4706 return expression_returns(init->value.value);
4708 case INITIALIZER_LIST: {
4709 initializer_t * const* i = init->list.initializers;
4710 initializer_t * const* const end = i + init->list.len;
4711 bool returns = true;
4712 for (; i != end; ++i) {
4713 if (!initializer_returns(*i))
4719 case INITIALIZER_STRING:
4720 case INITIALIZER_DESIGNATOR: // designators have no payload
4723 panic("unhandled initializer");
4726 static bool noreturn_candidate;
4728 static void check_reachable(statement_t *const stmt)
4730 if (stmt->base.reachable)
4732 if (stmt->kind != STATEMENT_DO_WHILE)
4733 stmt->base.reachable = true;
4735 statement_t *last = stmt;
4737 switch (stmt->kind) {
4738 case STATEMENT_ERROR:
4739 case STATEMENT_EMPTY:
4741 next = stmt->base.next;
4744 case STATEMENT_DECLARATION: {
4745 declaration_statement_t const *const decl = &stmt->declaration;
4746 entity_t const * ent = decl->declarations_begin;
4747 entity_t const *const last_decl = decl->declarations_end;
4749 for (;; ent = ent->base.next) {
4750 if (ent->kind == ENTITY_VARIABLE &&
4751 ent->variable.initializer != NULL &&
4752 !initializer_returns(ent->variable.initializer)) {
4755 if (ent == last_decl)
4759 next = stmt->base.next;
4763 case STATEMENT_COMPOUND:
4764 next = stmt->compound.statements;
4766 next = stmt->base.next;
4769 case STATEMENT_RETURN: {
4770 expression_t const *const val = stmt->returns.value;
4771 if (val == NULL || expression_returns(val))
4772 noreturn_candidate = false;
4776 case STATEMENT_IF: {
4777 if_statement_t const *const ifs = &stmt->ifs;
4778 expression_t const *const cond = ifs->condition;
4780 if (!expression_returns(cond))
4783 int const val = determine_truth(cond);
4786 check_reachable(ifs->true_statement);
4791 if (ifs->false_statement != NULL) {
4792 check_reachable(ifs->false_statement);
4796 next = stmt->base.next;
4800 case STATEMENT_SWITCH: {
4801 switch_statement_t const *const switchs = &stmt->switchs;
4802 expression_t const *const expr = switchs->expression;
4804 if (!expression_returns(expr))
4807 if (is_constant_expression(expr) == EXPR_CLASS_CONSTANT) {
4808 ir_tarval *const val = fold_constant_to_tarval(expr);
4809 case_label_statement_t * defaults = NULL;
4810 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4811 if (i->expression == NULL) {
4816 if (i->first_case == val || i->last_case == val ||
4817 ((tarval_cmp(i->first_case, val) & ir_relation_less_equal)
4818 && (tarval_cmp(val, i->last_case) & ir_relation_less_equal))) {
4819 check_reachable((statement_t*)i);
4824 if (defaults != NULL) {
4825 check_reachable((statement_t*)defaults);
4829 bool has_default = false;
4830 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4831 if (i->expression == NULL)
4834 check_reachable((statement_t*)i);
4841 next = stmt->base.next;
4845 case STATEMENT_EXPRESSION: {
4846 /* Check for noreturn function call */
4847 expression_t const *const expr = stmt->expression.expression;
4848 if (!expression_returns(expr))
4851 next = stmt->base.next;
4855 case STATEMENT_CONTINUE:
4856 for (statement_t *parent = stmt;;) {
4857 parent = parent->base.parent;
4858 if (parent == NULL) /* continue not within loop */
4862 switch (parent->kind) {
4863 case STATEMENT_DO_WHILE: goto continue_do_while;
4864 case STATEMENT_FOR: goto continue_for;
4870 case STATEMENT_BREAK:
4871 for (statement_t *parent = stmt;;) {
4872 parent = parent->base.parent;
4873 if (parent == NULL) /* break not within loop/switch */
4876 switch (parent->kind) {
4877 case STATEMENT_SWITCH:
4878 case STATEMENT_DO_WHILE:
4881 next = parent->base.next;
4882 goto found_break_parent;
4890 case STATEMENT_COMPUTED_GOTO: {
4891 if (!expression_returns(stmt->computed_goto.expression))
4894 statement_t *parent = stmt->base.parent;
4895 if (parent == NULL) /* top level goto */
4901 case STATEMENT_GOTO:
4902 next = stmt->gotos.label->statement;
4903 if (next == NULL) /* missing label */
4907 case STATEMENT_LABEL:
4908 next = stmt->label.statement;
4911 case STATEMENT_CASE_LABEL:
4912 next = stmt->case_label.statement;
4915 case STATEMENT_DO_WHILE:
4916 next = stmt->do_while.body;
4919 case STATEMENT_FOR: {
4920 for_statement_t *const fors = &stmt->fors;
4922 if (fors->condition_reachable)
4924 fors->condition_reachable = true;
4926 expression_t const *const cond = fors->condition;
4931 } else if (expression_returns(cond)) {
4932 val = determine_truth(cond);
4938 check_reachable(fors->body);
4943 next = stmt->base.next;
4947 case STATEMENT_MS_TRY: {
4948 ms_try_statement_t const *const ms_try = &stmt->ms_try;
4949 check_reachable(ms_try->try_statement);
4950 next = ms_try->final_statement;
4954 case STATEMENT_LEAVE: {
4955 statement_t *parent = stmt;
4957 parent = parent->base.parent;
4958 if (parent == NULL) /* __leave not within __try */
4961 if (parent->kind == STATEMENT_MS_TRY) {
4963 next = parent->ms_try.final_statement;
4971 panic("invalid statement kind");
4974 while (next == NULL) {
4975 next = last->base.parent;
4977 noreturn_candidate = false;
4979 type_t *const type = skip_typeref(current_function->base.type);
4980 assert(is_type_function(type));
4981 type_t *const ret = skip_typeref(type->function.return_type);
4982 if (!is_type_void(ret) &&
4983 is_type_valid(ret) &&
4984 !is_main(current_entity)) {
4985 source_position_t const *const pos = &stmt->base.source_position;
4986 warningf(WARN_RETURN_TYPE, pos, "control reaches end of non-void function");
4991 switch (next->kind) {
4992 case STATEMENT_ERROR:
4993 case STATEMENT_EMPTY:
4994 case STATEMENT_DECLARATION:
4995 case STATEMENT_EXPRESSION:
4997 case STATEMENT_RETURN:
4998 case STATEMENT_CONTINUE:
4999 case STATEMENT_BREAK:
5000 case STATEMENT_COMPUTED_GOTO:
5001 case STATEMENT_GOTO:
5002 case STATEMENT_LEAVE:
5003 panic("invalid control flow in function");
5005 case STATEMENT_COMPOUND:
5006 if (next->compound.stmt_expr) {
5012 case STATEMENT_SWITCH:
5013 case STATEMENT_LABEL:
5014 case STATEMENT_CASE_LABEL:
5016 next = next->base.next;
5019 case STATEMENT_DO_WHILE: {
5021 if (next->base.reachable)
5023 next->base.reachable = true;
5025 do_while_statement_t const *const dw = &next->do_while;
5026 expression_t const *const cond = dw->condition;
5028 if (!expression_returns(cond))
5031 int const val = determine_truth(cond);
5034 check_reachable(dw->body);
5040 next = next->base.next;
5044 case STATEMENT_FOR: {
5046 for_statement_t *const fors = &next->fors;
5048 fors->step_reachable = true;
5050 if (fors->condition_reachable)
5052 fors->condition_reachable = true;
5054 expression_t const *const cond = fors->condition;
5059 } else if (expression_returns(cond)) {
5060 val = determine_truth(cond);
5066 check_reachable(fors->body);
5072 next = next->base.next;
5076 case STATEMENT_MS_TRY:
5078 next = next->ms_try.final_statement;
5083 check_reachable(next);
5086 static void check_unreachable(statement_t* const stmt, void *const env)
5090 switch (stmt->kind) {
5091 case STATEMENT_DO_WHILE:
5092 if (!stmt->base.reachable) {
5093 expression_t const *const cond = stmt->do_while.condition;
5094 if (determine_truth(cond) >= 0) {
5095 source_position_t const *const pos = &cond->base.source_position;
5096 warningf(WARN_UNREACHABLE_CODE, pos, "condition of do-while-loop is unreachable");
5101 case STATEMENT_FOR: {
5102 for_statement_t const* const fors = &stmt->fors;
5104 // if init and step are unreachable, cond is unreachable, too
5105 if (!stmt->base.reachable && !fors->step_reachable) {
5106 goto warn_unreachable;
5108 if (!stmt->base.reachable && fors->initialisation != NULL) {
5109 source_position_t const *const pos = &fors->initialisation->base.source_position;
5110 warningf(WARN_UNREACHABLE_CODE, pos, "initialisation of for-statement is unreachable");
5113 if (!fors->condition_reachable && fors->condition != NULL) {
5114 source_position_t const *const pos = &fors->condition->base.source_position;
5115 warningf(WARN_UNREACHABLE_CODE, pos, "condition of for-statement is unreachable");
5118 if (!fors->step_reachable && fors->step != NULL) {
5119 source_position_t const *const pos = &fors->step->base.source_position;
5120 warningf(WARN_UNREACHABLE_CODE, pos, "step of for-statement is unreachable");
5126 case STATEMENT_COMPOUND:
5127 if (stmt->compound.statements != NULL)
5129 goto warn_unreachable;
5131 case STATEMENT_DECLARATION: {
5132 /* Only warn if there is at least one declarator with an initializer.
5133 * This typically occurs in switch statements. */
5134 declaration_statement_t const *const decl = &stmt->declaration;
5135 entity_t const * ent = decl->declarations_begin;
5136 entity_t const *const last = decl->declarations_end;
5138 for (;; ent = ent->base.next) {
5139 if (ent->kind == ENTITY_VARIABLE &&
5140 ent->variable.initializer != NULL) {
5141 goto warn_unreachable;
5151 if (!stmt->base.reachable) {
5152 source_position_t const *const pos = &stmt->base.source_position;
5153 warningf(WARN_UNREACHABLE_CODE, pos, "statement is unreachable");
5159 static bool is_main(entity_t *entity)
5161 static symbol_t *sym_main = NULL;
5162 if (sym_main == NULL) {
5163 sym_main = symbol_table_insert("main");
5166 if (entity->base.symbol != sym_main)
5168 /* must be in outermost scope */
5169 if (entity->base.parent_scope != file_scope)
5175 static void prepare_main_collect2(entity_t*);
5177 static void parse_external_declaration(void)
5179 /* function-definitions and declarations both start with declaration
5181 add_anchor_token(';');
5182 declaration_specifiers_t specifiers;
5183 parse_declaration_specifiers(&specifiers);
5184 rem_anchor_token(';');
5186 /* must be a declaration */
5187 if (token.kind == ';') {
5188 parse_anonymous_declaration_rest(&specifiers);
5192 add_anchor_token(',');
5193 add_anchor_token('=');
5194 add_anchor_token(';');
5195 add_anchor_token('{');
5197 /* declarator is common to both function-definitions and declarations */
5198 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
5200 rem_anchor_token('{');
5201 rem_anchor_token(';');
5202 rem_anchor_token('=');
5203 rem_anchor_token(',');
5205 /* must be a declaration */
5206 switch (token.kind) {
5210 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
5215 /* must be a function definition */
5216 parse_kr_declaration_list(ndeclaration);
5218 if (token.kind != '{') {
5219 parse_error_expected("while parsing function definition", '{', NULL);
5220 eat_until_matching_token(';');
5224 assert(is_declaration(ndeclaration));
5225 type_t *const orig_type = ndeclaration->declaration.type;
5226 type_t * type = skip_typeref(orig_type);
5228 if (!is_type_function(type)) {
5229 if (is_type_valid(type)) {
5230 errorf(HERE, "declarator '%#N' has a body but is not a function type", ndeclaration);
5236 source_position_t const *const pos = &ndeclaration->base.source_position;
5237 if (is_typeref(orig_type)) {
5239 errorf(pos, "type of function definition '%#N' is a typedef", ndeclaration);
5242 if (is_type_compound(skip_typeref(type->function.return_type))) {
5243 warningf(WARN_AGGREGATE_RETURN, pos, "'%N' returns an aggregate", ndeclaration);
5245 if (type->function.unspecified_parameters) {
5246 warningf(WARN_OLD_STYLE_DEFINITION, pos, "old-style definition of '%N'", ndeclaration);
5248 warningf(WARN_TRADITIONAL, pos, "traditional C rejects ISO C style definition of '%N'", ndeclaration);
5251 /* §6.7.5.3:14 a function definition with () means no
5252 * parameters (and not unspecified parameters) */
5253 if (type->function.unspecified_parameters &&
5254 type->function.parameters == NULL) {
5255 type_t *copy = duplicate_type(type);
5256 copy->function.unspecified_parameters = false;
5257 type = identify_new_type(copy);
5259 ndeclaration->declaration.type = type;
5262 entity_t *const entity = record_entity(ndeclaration, true);
5263 assert(entity->kind == ENTITY_FUNCTION);
5264 assert(ndeclaration->kind == ENTITY_FUNCTION);
5266 function_t *const function = &entity->function;
5267 if (ndeclaration != entity) {
5268 function->parameters = ndeclaration->function.parameters;
5271 PUSH_SCOPE(&function->parameters);
5273 entity_t *parameter = function->parameters.entities;
5274 for (; parameter != NULL; parameter = parameter->base.next) {
5275 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5276 parameter->base.parent_scope = current_scope;
5278 assert(parameter->base.parent_scope == NULL
5279 || parameter->base.parent_scope == current_scope);
5280 parameter->base.parent_scope = current_scope;
5281 if (parameter->base.symbol == NULL) {
5282 errorf(¶meter->base.source_position, "parameter name omitted");
5285 environment_push(parameter);
5288 if (function->body != NULL) {
5289 parser_error_multiple_definition(entity, HERE);
5292 /* parse function body */
5293 int label_stack_top = label_top();
5294 function_t *old_current_function = current_function;
5295 current_function = function;
5296 PUSH_CURRENT_ENTITY(entity);
5300 goto_anchor = &goto_first;
5302 label_anchor = &label_first;
5304 statement_t *const body = parse_compound_statement(false);
5305 function->body = body;
5308 check_declarations();
5309 if (is_warn_on(WARN_RETURN_TYPE) ||
5310 is_warn_on(WARN_UNREACHABLE_CODE) ||
5311 (is_warn_on(WARN_MISSING_NORETURN) && !(function->base.modifiers & DM_NORETURN))) {
5312 noreturn_candidate = true;
5313 check_reachable(body);
5314 if (is_warn_on(WARN_UNREACHABLE_CODE))
5315 walk_statements(body, check_unreachable, NULL);
5316 if (noreturn_candidate &&
5317 !(function->base.modifiers & DM_NORETURN)) {
5318 source_position_t const *const pos = &body->base.source_position;
5319 warningf(WARN_MISSING_NORETURN, pos, "function '%#N' is candidate for attribute 'noreturn'", entity);
5323 if (is_main(entity)) {
5324 /* Force main to C linkage. */
5325 type_t *const type = entity->declaration.type;
5326 assert(is_type_function(type));
5327 if (type->function.linkage != LINKAGE_C) {
5328 type_t *new_type = duplicate_type(type);
5329 new_type->function.linkage = LINKAGE_C;
5330 entity->declaration.type = identify_new_type(new_type);
5333 if (enable_main_collect2_hack)
5334 prepare_main_collect2(entity);
5337 POP_CURRENT_ENTITY();
5339 assert(current_function == function);
5340 current_function = old_current_function;
5341 label_pop_to(label_stack_top);
5347 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
5349 entity_t *iter = compound->members.entities;
5350 for (; iter != NULL; iter = iter->base.next) {
5351 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5354 if (iter->base.symbol == symbol) {
5356 } else if (iter->base.symbol == NULL) {
5357 /* search in anonymous structs and unions */
5358 type_t *type = skip_typeref(iter->declaration.type);
5359 if (is_type_compound(type)) {
5360 if (find_compound_entry(type->compound.compound, symbol)
5371 static void check_deprecated(const source_position_t *source_position,
5372 const entity_t *entity)
5374 if (!is_declaration(entity))
5376 if ((entity->declaration.modifiers & DM_DEPRECATED) == 0)
5379 source_position_t const *const epos = &entity->base.source_position;
5380 char const *const msg = get_deprecated_string(entity->declaration.attributes);
5382 warningf(WARN_DEPRECATED_DECLARATIONS, source_position, "'%N' is deprecated (declared %P): \"%s\"", entity, epos, msg);
5384 warningf(WARN_DEPRECATED_DECLARATIONS, source_position, "'%N' is deprecated (declared %P)", entity, epos);
5389 static expression_t *create_select(const source_position_t *pos,
5391 type_qualifiers_t qualifiers,
5394 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
5396 check_deprecated(pos, entry);
5398 expression_t *select = allocate_expression_zero(EXPR_SELECT);
5399 select->select.compound = addr;
5400 select->select.compound_entry = entry;
5402 type_t *entry_type = entry->declaration.type;
5403 type_t *res_type = get_qualified_type(entry_type, qualifiers);
5405 /* bitfields need special treatment */
5406 if (entry->compound_member.bitfield) {
5407 unsigned bit_size = entry->compound_member.bit_size;
5408 /* if fewer bits than an int, convert to int (see §6.3.1.1) */
5409 if (bit_size < get_atomic_type_size(ATOMIC_TYPE_INT) * BITS_PER_BYTE) {
5410 res_type = type_int;
5414 /* we always do the auto-type conversions; the & and sizeof parser contains
5415 * code to revert this! */
5416 select->base.type = automatic_type_conversion(res_type);
5423 * Find entry with symbol in compound. Search anonymous structs and unions and
5424 * creates implicit select expressions for them.
5425 * Returns the adress for the innermost compound.
5427 static expression_t *find_create_select(const source_position_t *pos,
5429 type_qualifiers_t qualifiers,
5430 compound_t *compound, symbol_t *symbol)
5432 entity_t *iter = compound->members.entities;
5433 for (; iter != NULL; iter = iter->base.next) {
5434 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5437 symbol_t *iter_symbol = iter->base.symbol;
5438 if (iter_symbol == NULL) {
5439 type_t *type = iter->declaration.type;
5440 if (!is_type_compound(type))
5443 compound_t *sub_compound = type->compound.compound;
5445 if (find_compound_entry(sub_compound, symbol) == NULL)
5448 expression_t *sub_addr = create_select(pos, addr, qualifiers, iter);
5449 sub_addr->base.source_position = *pos;
5450 sub_addr->base.implicit = true;
5451 return find_create_select(pos, sub_addr, qualifiers, sub_compound,
5455 if (iter_symbol == symbol) {
5456 return create_select(pos, addr, qualifiers, iter);
5463 static void parse_bitfield_member(entity_t *entity)
5467 expression_t *size = parse_constant_expression();
5470 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5471 type_t *type = entity->declaration.type;
5472 if (!is_type_integer(skip_typeref(type))) {
5473 errorf(HERE, "bitfield base type '%T' is not an integer type",
5477 if (is_constant_expression(size) != EXPR_CLASS_CONSTANT) {
5478 /* error already reported by parse_constant_expression */
5479 size_long = get_type_size(type) * 8;
5481 size_long = fold_constant_to_int(size);
5483 const symbol_t *symbol = entity->base.symbol;
5484 const symbol_t *user_symbol
5485 = symbol == NULL ? sym_anonymous : symbol;
5486 unsigned bit_size = get_type_size(type) * 8;
5487 if (size_long < 0) {
5488 errorf(HERE, "negative width in bit-field '%Y'", user_symbol);
5489 } else if (size_long == 0 && symbol != NULL) {
5490 errorf(HERE, "zero width for bit-field '%Y'", user_symbol);
5491 } else if (bit_size > 0 && (unsigned)size_long > bit_size) {
5492 errorf(HERE, "width of bitfield '%Y' exceeds its type",
5495 /* hope that people don't invent crazy types with more bits
5496 * than our struct can hold */
5498 (1 << sizeof(entity->compound_member.bit_size)*8));
5502 entity->compound_member.bitfield = true;
5503 entity->compound_member.bit_size = (unsigned char)size_long;
5506 static void parse_compound_declarators(compound_t *compound,
5507 const declaration_specifiers_t *specifiers)
5509 add_anchor_token(';');
5510 add_anchor_token(',');
5514 if (token.kind == ':') {
5515 /* anonymous bitfield */
5516 type_t *type = specifiers->type;
5517 entity_t *const entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, NULL, HERE);
5518 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
5519 entity->declaration.storage_class = STORAGE_CLASS_NONE;
5520 entity->declaration.type = type;
5522 parse_bitfield_member(entity);
5524 attribute_t *attributes = parse_attributes(NULL);
5525 attribute_t **anchor = &attributes;
5526 while (*anchor != NULL)
5527 anchor = &(*anchor)->next;
5528 *anchor = specifiers->attributes;
5529 if (attributes != NULL) {
5530 handle_entity_attributes(attributes, entity);
5532 entity->declaration.attributes = attributes;
5534 append_entity(&compound->members, entity);
5536 entity = parse_declarator(specifiers,
5537 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
5538 source_position_t const *const pos = &entity->base.source_position;
5539 if (entity->kind == ENTITY_TYPEDEF) {
5540 errorf(pos, "typedef not allowed as compound member");
5542 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5544 /* make sure we don't define a symbol multiple times */
5545 symbol_t *symbol = entity->base.symbol;
5546 if (symbol != NULL) {
5547 entity_t *prev = find_compound_entry(compound, symbol);
5549 source_position_t const *const ppos = &prev->base.source_position;
5550 errorf(pos, "multiple declarations of '%N' (declared %P)", entity, ppos);
5554 if (token.kind == ':') {
5555 parse_bitfield_member(entity);
5557 attribute_t *attributes = parse_attributes(NULL);
5558 handle_entity_attributes(attributes, entity);
5560 type_t *orig_type = entity->declaration.type;
5561 type_t *type = skip_typeref(orig_type);
5562 if (is_type_function(type)) {
5563 errorf(pos, "'%N' must not have function type '%T'", entity, orig_type);
5564 } else if (is_type_incomplete(type)) {
5565 /* §6.7.2.1:16 flexible array member */
5566 if (!is_type_array(type) ||
5567 token.kind != ';' ||
5568 look_ahead(1)->kind != '}') {
5569 errorf(pos, "'%N' has incomplete type '%T'", entity, orig_type);
5570 } else if (compound->members.entities == NULL) {
5571 errorf(pos, "flexible array member in otherwise empty struct");
5576 append_entity(&compound->members, entity);
5579 } while (accept(','));
5580 rem_anchor_token(',');
5581 rem_anchor_token(';');
5584 anonymous_entity = NULL;
5587 static void parse_compound_type_entries(compound_t *compound)
5590 add_anchor_token('}');
5593 switch (token.kind) {
5595 case T___extension__:
5596 case T_IDENTIFIER: {
5598 declaration_specifiers_t specifiers;
5599 parse_declaration_specifiers(&specifiers);
5600 parse_compound_declarators(compound, &specifiers);
5606 rem_anchor_token('}');
5609 compound->complete = true;
5615 static type_t *parse_typename(void)
5617 declaration_specifiers_t specifiers;
5618 parse_declaration_specifiers(&specifiers);
5619 if (specifiers.storage_class != STORAGE_CLASS_NONE
5620 || specifiers.thread_local) {
5621 /* TODO: improve error message, user does probably not know what a
5622 * storage class is...
5624 errorf(&specifiers.source_position, "typename must not have a storage class");
5627 type_t *result = parse_abstract_declarator(specifiers.type);
5635 typedef expression_t* (*parse_expression_function)(void);
5636 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
5638 typedef struct expression_parser_function_t expression_parser_function_t;
5639 struct expression_parser_function_t {
5640 parse_expression_function parser;
5641 precedence_t infix_precedence;
5642 parse_expression_infix_function infix_parser;
5645 static expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5647 static type_t *get_string_type(string_encoding_t const enc)
5649 bool const warn = is_warn_on(WARN_WRITE_STRINGS);
5651 case STRING_ENCODING_CHAR:
5652 case STRING_ENCODING_UTF8: return warn ? type_const_char_ptr : type_char_ptr;
5653 case STRING_ENCODING_CHAR16: return warn ? type_char16_t_const_ptr : type_char16_t_ptr;
5654 case STRING_ENCODING_CHAR32: return warn ? type_char32_t_const_ptr : type_char32_t_ptr;
5655 case STRING_ENCODING_WIDE: return warn ? type_const_wchar_t_ptr : type_wchar_t_ptr;
5657 panic("invalid string encoding");
5661 * Parse a string constant.
5663 static expression_t *parse_string_literal(void)
5665 expression_t *const expr = allocate_expression_zero(EXPR_STRING_LITERAL);
5666 expr->string_literal.value = concat_string_literals();
5667 expr->base.type = get_string_type(expr->string_literal.value.encoding);
5672 * Parse a boolean constant.
5674 static expression_t *parse_boolean_literal(bool value)
5676 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_BOOLEAN);
5677 literal->base.type = type_bool;
5678 literal->literal.value.begin = value ? "true" : "false";
5679 literal->literal.value.size = value ? 4 : 5;
5681 eat(value ? T_true : T_false);
5685 static void warn_traditional_suffix(char const *const suffix)
5687 warningf(WARN_TRADITIONAL, HERE, "traditional C rejects the '%s' suffix", suffix);
5690 static void check_integer_suffix(expression_t *const expr, char const *const suffix)
5692 unsigned spec = SPECIFIER_NONE;
5693 char const *c = suffix;
5696 if (*c == 'L' || *c == 'l') {
5697 add = SPECIFIER_LONG;
5699 add |= SPECIFIER_LONG_LONG;
5702 } else if (*c == 'U' || *c == 'u') {
5703 add = SPECIFIER_UNSIGNED;
5716 case SPECIFIER_NONE: type = type_int; break;
5717 case SPECIFIER_LONG: type = type_long; break;
5718 case SPECIFIER_LONG | SPECIFIER_LONG_LONG: type = type_long_long; break;
5719 case SPECIFIER_UNSIGNED: type = type_unsigned_int; break;
5720 case SPECIFIER_UNSIGNED | SPECIFIER_LONG: type = type_unsigned_long; break;
5721 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG: type = type_unsigned_long_long; break;
5722 default: panic("inconsistent suffix");
5724 if (spec != SPECIFIER_NONE && spec != SPECIFIER_LONG) {
5725 warn_traditional_suffix(suffix);
5727 expr->base.type = type;
5728 /* Integer type depends on the size of the number and the size
5729 * representable by the types. The backend/codegeneration has to
5730 * determine that. */
5731 determine_literal_type(&expr->literal);
5734 errorf(HERE, "invalid suffix '%s' on integer constant", suffix);
5738 static void check_floatingpoint_suffix(expression_t *const expr, char const *const suffix)
5741 char const *c = suffix;
5744 case 'f': type = type_float; ++c; break;
5746 case 'l': type = type_long_double; ++c; break;
5747 default: type = type_double; break;
5751 expr->base.type = type;
5752 if (suffix[0] != '\0') {
5753 warn_traditional_suffix(suffix);
5756 errorf(HERE, "invalid suffix '%s' on floatingpoint constant", suffix);
5760 static expression_t *parse_number_literal(void)
5762 string_t const *const str = &token.literal.string;
5763 char const * i = str->begin;
5764 unsigned digits = 0;
5765 bool is_float = false;
5767 /* Parse base prefix. */
5771 case 'B': case 'b': base = 2; ++i; break;
5772 case 'X': case 'x': base = 16; ++i; break;
5773 default: base = 8; digits |= 1U << 0; break;
5779 /* Parse mantissa. */
5785 errorf(HERE, "multiple decimal points in %K", &token);
5794 case '0': digit = 0; break;
5795 case '1': digit = 1; break;
5796 case '2': digit = 2; break;
5797 case '3': digit = 3; break;
5798 case '4': digit = 4; break;
5799 case '5': digit = 5; break;
5800 case '6': digit = 6; break;
5801 case '7': digit = 7; break;
5802 case '8': digit = 8; break;
5803 case '9': digit = 9; break;
5804 case 'A': case 'a': digit = 10; break;
5805 case 'B': case 'b': digit = 11; break;
5806 case 'C': case 'c': digit = 12; break;
5807 case 'D': case 'd': digit = 13; break;
5808 case 'E': case 'e': digit = 14; break;
5809 case 'F': case 'f': digit = 15; break;
5811 default: goto done_mantissa;
5814 if (digit >= 10 && base != 16)
5817 digits |= 1U << digit;
5821 /* Parse exponent. */
5825 errorf(HERE, "binary floating %K not allowed", &token);
5830 if (*i == 'E' || *i == 'e') {
5832 goto parse_exponent;
5837 if (*i == 'P' || *i == 'p') {
5842 if (*i == '-' || *i == '+')
5848 } while (isdigit(*i));
5850 errorf(HERE, "exponent of %K has no digits", &token);
5852 } else if (is_float) {
5853 errorf(HERE, "hexadecimal floating %K requires an exponent", &token);
5859 panic("invalid base");
5863 expression_t *const expr = allocate_expression_zero(is_float ? EXPR_LITERAL_FLOATINGPOINT : EXPR_LITERAL_INTEGER);
5864 expr->literal.value = *str;
5868 errorf(HERE, "%K has no digits", &token);
5869 } else if (digits & ~((1U << base) - 1)) {
5870 errorf(HERE, "invalid digit in %K", &token);
5872 expr->literal.suffix = i;
5874 check_floatingpoint_suffix(expr, i);
5876 check_integer_suffix(expr, i);
5886 * Parse a character constant.
5888 static expression_t *parse_character_constant(void)
5890 expression_t *const literal = allocate_expression_zero(EXPR_LITERAL_CHARACTER);
5891 literal->string_literal.value = token.literal.string;
5893 size_t const size = get_string_len(&token.literal.string);
5894 switch (token.literal.string.encoding) {
5895 case STRING_ENCODING_CHAR:
5896 case STRING_ENCODING_UTF8:
5897 literal->base.type = c_mode & _CXX ? type_char : type_int;
5899 if (!GNU_MODE && !(c_mode & _C99)) {
5900 errorf(HERE, "more than 1 character in character constant");
5902 literal->base.type = type_int;
5903 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
5908 case STRING_ENCODING_CHAR16: literal->base.type = type_char16_t; goto warn_multi;
5909 case STRING_ENCODING_CHAR32: literal->base.type = type_char32_t; goto warn_multi;
5910 case STRING_ENCODING_WIDE: literal->base.type = type_wchar_t; goto warn_multi;
5913 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
5918 eat(T_CHARACTER_CONSTANT);
5922 static entity_t *create_implicit_function(symbol_t *symbol, source_position_t const *const pos)
5924 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
5925 ntype->function.return_type = type_int;
5926 ntype->function.unspecified_parameters = true;
5927 ntype->function.linkage = LINKAGE_C;
5928 type_t *type = identify_new_type(ntype);
5930 entity_t *const entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, symbol, pos);
5931 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
5932 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
5933 entity->declaration.type = type;
5934 entity->declaration.implicit = true;
5936 if (current_scope != NULL)
5937 record_entity(entity, false);
5943 * Performs automatic type cast as described in §6.3.2.1.
5945 * @param orig_type the original type
5947 static type_t *automatic_type_conversion(type_t *orig_type)
5949 type_t *type = skip_typeref(orig_type);
5950 if (is_type_array(type)) {
5951 array_type_t *array_type = &type->array;
5952 type_t *element_type = array_type->element_type;
5953 unsigned qualifiers = array_type->base.qualifiers;
5955 return make_pointer_type(element_type, qualifiers);
5958 if (is_type_function(type)) {
5959 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
5966 * reverts the automatic casts of array to pointer types and function
5967 * to function-pointer types as defined §6.3.2.1
5969 type_t *revert_automatic_type_conversion(const expression_t *expression)
5971 switch (expression->kind) {
5972 case EXPR_REFERENCE: {
5973 entity_t *entity = expression->reference.entity;
5974 if (is_declaration(entity)) {
5975 return entity->declaration.type;
5976 } else if (entity->kind == ENTITY_ENUM_VALUE) {
5977 return entity->enum_value.enum_type;
5979 panic("no declaration or enum in reference");
5984 entity_t *entity = expression->select.compound_entry;
5985 assert(is_declaration(entity));
5986 type_t *type = entity->declaration.type;
5987 return get_qualified_type(type, expression->base.type->base.qualifiers);
5990 case EXPR_UNARY_DEREFERENCE: {
5991 const expression_t *const value = expression->unary.value;
5992 type_t *const type = skip_typeref(value->base.type);
5993 if (!is_type_pointer(type))
5994 return type_error_type;
5995 return type->pointer.points_to;
5998 case EXPR_ARRAY_ACCESS: {
5999 const expression_t *array_ref = expression->array_access.array_ref;
6000 type_t *type_left = skip_typeref(array_ref->base.type);
6001 if (!is_type_pointer(type_left))
6002 return type_error_type;
6003 return type_left->pointer.points_to;
6006 case EXPR_STRING_LITERAL: {
6007 size_t const size = get_string_len(&expression->string_literal.value) + 1;
6008 type_t *const elem = get_unqualified_type(expression->base.type->pointer.points_to);
6009 return make_array_type(elem, size, TYPE_QUALIFIER_NONE);
6012 case EXPR_COMPOUND_LITERAL:
6013 return expression->compound_literal.type;
6018 return expression->base.type;
6022 * Find an entity matching a symbol in a scope.
6023 * Uses current scope if scope is NULL
6025 static entity_t *lookup_entity(const scope_t *scope, symbol_t *symbol,
6026 namespace_tag_t namespc)
6028 if (scope == NULL) {
6029 return get_entity(symbol, namespc);
6032 /* we should optimize here, if scope grows above a certain size we should
6033 construct a hashmap here... */
6034 entity_t *entity = scope->entities;
6035 for ( ; entity != NULL; entity = entity->base.next) {
6036 if (entity->base.symbol == symbol
6037 && (namespace_tag_t)entity->base.namespc == namespc)
6044 static entity_t *parse_qualified_identifier(void)
6046 /* namespace containing the symbol */
6048 source_position_t pos;
6049 const scope_t *lookup_scope = NULL;
6051 if (accept(T_COLONCOLON))
6052 lookup_scope = &unit->scope;
6056 symbol = expect_identifier("while parsing identifier", &pos);
6058 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6061 entity = lookup_entity(lookup_scope, symbol, NAMESPACE_NORMAL);
6063 if (!accept(T_COLONCOLON))
6066 switch (entity->kind) {
6067 case ENTITY_NAMESPACE:
6068 lookup_scope = &entity->namespacee.members;
6073 lookup_scope = &entity->compound.members;
6076 errorf(&pos, "'%Y' must be a namespace, class, struct or union (but is a %s)",
6077 symbol, get_entity_kind_name(entity->kind));
6079 /* skip further qualifications */
6080 while (accept(T_IDENTIFIER) && accept(T_COLONCOLON)) {}
6082 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6086 if (entity == NULL) {
6087 if (!strict_mode && token.kind == '(') {
6088 /* an implicitly declared function */
6089 entity = create_implicit_function(symbol, &pos);
6090 warningf(WARN_IMPLICIT_FUNCTION_DECLARATION, &pos, "implicit declaration of '%N'", entity);
6092 errorf(&pos, "unknown identifier '%Y' found.", symbol);
6093 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6100 static expression_t *parse_reference(void)
6102 source_position_t const pos = *HERE;
6103 entity_t *const entity = parse_qualified_identifier();
6106 if (is_declaration(entity)) {
6107 orig_type = entity->declaration.type;
6108 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6109 orig_type = entity->enum_value.enum_type;
6111 panic("expected declaration or enum value in reference");
6114 /* we always do the auto-type conversions; the & and sizeof parser contains
6115 * code to revert this! */
6116 type_t *type = automatic_type_conversion(orig_type);
6118 expression_kind_t kind = EXPR_REFERENCE;
6119 if (entity->kind == ENTITY_ENUM_VALUE)
6120 kind = EXPR_ENUM_CONSTANT;
6122 expression_t *expression = allocate_expression_zero(kind);
6123 expression->base.source_position = pos;
6124 expression->base.type = type;
6125 expression->reference.entity = entity;
6127 /* this declaration is used */
6128 if (is_declaration(entity)) {
6129 entity->declaration.used = true;
6132 if (entity->base.parent_scope != file_scope
6133 && (current_function != NULL
6134 && entity->base.parent_scope->depth < current_function->parameters.depth)
6135 && (entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER)) {
6136 /* access of a variable from an outer function */
6137 entity->variable.address_taken = true;
6138 current_function->need_closure = true;
6141 check_deprecated(&pos, entity);
6146 static bool semantic_cast(expression_t *cast)
6148 expression_t *expression = cast->unary.value;
6149 type_t *orig_dest_type = cast->base.type;
6150 type_t *orig_type_right = expression->base.type;
6151 type_t const *dst_type = skip_typeref(orig_dest_type);
6152 type_t const *src_type = skip_typeref(orig_type_right);
6153 source_position_t const *pos = &cast->base.source_position;
6155 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6156 if (is_type_void(dst_type))
6159 /* only integer and pointer can be casted to pointer */
6160 if (is_type_pointer(dst_type) &&
6161 !is_type_pointer(src_type) &&
6162 !is_type_integer(src_type) &&
6163 is_type_valid(src_type)) {
6164 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6168 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6169 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6173 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6174 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6178 if (is_type_pointer(src_type) && is_type_pointer(dst_type)) {
6179 type_t *src = skip_typeref(src_type->pointer.points_to);
6180 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6181 unsigned missing_qualifiers =
6182 src->base.qualifiers & ~dst->base.qualifiers;
6183 if (missing_qualifiers != 0) {
6184 warningf(WARN_CAST_QUAL, pos, "cast discards qualifiers '%Q' in pointer target type of '%T'", missing_qualifiers, orig_type_right);
6190 static expression_t *parse_compound_literal(source_position_t const *const pos, type_t *type)
6192 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6193 expression->base.source_position = *pos;
6195 parse_initializer_env_t env;
6198 env.must_be_constant = false;
6199 initializer_t *initializer = parse_initializer(&env);
6202 expression->compound_literal.initializer = initializer;
6203 expression->compound_literal.type = type;
6204 expression->base.type = automatic_type_conversion(type);
6210 * Parse a cast expression.
6212 static expression_t *parse_cast(void)
6214 source_position_t const pos = *HERE;
6217 add_anchor_token(')');
6219 type_t *type = parse_typename();
6221 rem_anchor_token(')');
6224 if (token.kind == '{') {
6225 return parse_compound_literal(&pos, type);
6228 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6229 cast->base.source_position = pos;
6231 expression_t *value = parse_subexpression(PREC_CAST);
6232 cast->base.type = type;
6233 cast->unary.value = value;
6235 if (! semantic_cast(cast)) {
6236 /* TODO: record the error in the AST. else it is impossible to detect it */
6243 * Parse a statement expression.
6245 static expression_t *parse_statement_expression(void)
6247 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6250 add_anchor_token(')');
6252 statement_t *statement = parse_compound_statement(true);
6253 statement->compound.stmt_expr = true;
6254 expression->statement.statement = statement;
6256 /* find last statement and use its type */
6257 type_t *type = type_void;
6258 const statement_t *stmt = statement->compound.statements;
6260 while (stmt->base.next != NULL)
6261 stmt = stmt->base.next;
6263 if (stmt->kind == STATEMENT_EXPRESSION) {
6264 type = stmt->expression.expression->base.type;
6267 source_position_t const *const pos = &expression->base.source_position;
6268 warningf(WARN_OTHER, pos, "empty statement expression ({})");
6270 expression->base.type = type;
6272 rem_anchor_token(')');
6278 * Parse a parenthesized expression.
6280 static expression_t *parse_parenthesized_expression(void)
6282 token_t const* const la1 = look_ahead(1);
6283 switch (la1->kind) {
6285 /* gcc extension: a statement expression */
6286 return parse_statement_expression();
6289 if (is_typedef_symbol(la1->base.symbol)) {
6291 return parse_cast();
6296 add_anchor_token(')');
6297 expression_t *result = parse_expression();
6298 result->base.parenthesized = true;
6299 rem_anchor_token(')');
6305 static expression_t *parse_function_keyword(funcname_kind_t const kind)
6307 if (current_function == NULL) {
6308 errorf(HERE, "'%K' used outside of a function", &token);
6311 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6312 expression->base.type = type_char_ptr;
6313 expression->funcname.kind = kind;
6320 static designator_t *parse_designator(void)
6322 designator_t *const result = allocate_ast_zero(sizeof(result[0]));
6323 result->symbol = expect_identifier("while parsing member designator", &result->source_position);
6324 if (!result->symbol)
6327 designator_t *last_designator = result;
6330 designator_t *const designator = allocate_ast_zero(sizeof(result[0]));
6331 designator->symbol = expect_identifier("while parsing member designator", &designator->source_position);
6332 if (!designator->symbol)
6335 last_designator->next = designator;
6336 last_designator = designator;
6340 add_anchor_token(']');
6341 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6342 designator->source_position = *HERE;
6343 designator->array_index = parse_expression();
6344 rem_anchor_token(']');
6346 if (designator->array_index == NULL) {
6350 last_designator->next = designator;
6351 last_designator = designator;
6361 * Parse the __builtin_offsetof() expression.
6363 static expression_t *parse_offsetof(void)
6365 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6366 expression->base.type = type_size_t;
6368 eat(T___builtin_offsetof);
6370 add_anchor_token(')');
6371 add_anchor_token(',');
6373 type_t *type = parse_typename();
6374 rem_anchor_token(',');
6376 designator_t *designator = parse_designator();
6377 rem_anchor_token(')');
6380 expression->offsetofe.type = type;
6381 expression->offsetofe.designator = designator;
6384 memset(&path, 0, sizeof(path));
6385 path.top_type = type;
6386 path.path = NEW_ARR_F(type_path_entry_t, 0);
6388 descend_into_subtype(&path);
6390 if (!walk_designator(&path, designator, true)) {
6391 return create_error_expression();
6394 DEL_ARR_F(path.path);
6399 static bool is_last_parameter(expression_t *const param)
6401 if (param->kind == EXPR_REFERENCE) {
6402 entity_t *const entity = param->reference.entity;
6403 if (entity->kind == ENTITY_PARAMETER &&
6404 !entity->base.next &&
6405 entity->base.parent_scope == ¤t_function->parameters) {
6410 if (!is_type_valid(skip_typeref(param->base.type)))
6417 * Parses a __builtin_va_start() expression.
6419 static expression_t *parse_va_start(void)
6421 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6423 eat(T___builtin_va_start);
6425 add_anchor_token(')');
6426 add_anchor_token(',');
6428 expression->va_starte.ap = parse_assignment_expression();
6429 rem_anchor_token(',');
6431 expression_t *const param = parse_assignment_expression();
6432 expression->va_starte.parameter = param;
6433 rem_anchor_token(')');
6436 if (!current_function) {
6437 errorf(&expression->base.source_position, "'va_start' used outside of function");
6438 } else if (!current_function->base.type->function.variadic) {
6439 errorf(&expression->base.source_position, "'va_start' used in non-variadic function");
6440 } else if (!is_last_parameter(param)) {
6441 errorf(¶m->base.source_position, "second argument of 'va_start' must be last parameter of the current function");
6448 * Parses a __builtin_va_arg() expression.
6450 static expression_t *parse_va_arg(void)
6452 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6454 eat(T___builtin_va_arg);
6456 add_anchor_token(')');
6457 add_anchor_token(',');
6460 ap.expression = parse_assignment_expression();
6461 expression->va_arge.ap = ap.expression;
6462 check_call_argument(type_valist, &ap, 1);
6464 rem_anchor_token(',');
6466 expression->base.type = parse_typename();
6467 rem_anchor_token(')');
6474 * Parses a __builtin_va_copy() expression.
6476 static expression_t *parse_va_copy(void)
6478 expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
6480 eat(T___builtin_va_copy);
6482 add_anchor_token(')');
6483 add_anchor_token(',');
6485 expression_t *dst = parse_assignment_expression();
6486 assign_error_t error = semantic_assign(type_valist, dst);
6487 report_assign_error(error, type_valist, dst, "call argument 1",
6488 &dst->base.source_position);
6489 expression->va_copye.dst = dst;
6491 rem_anchor_token(',');
6494 call_argument_t src;
6495 src.expression = parse_assignment_expression();
6496 check_call_argument(type_valist, &src, 2);
6497 expression->va_copye.src = src.expression;
6498 rem_anchor_token(')');
6505 * Parses a __builtin_constant_p() expression.
6507 static expression_t *parse_builtin_constant(void)
6509 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6511 eat(T___builtin_constant_p);
6513 add_anchor_token(')');
6515 expression->builtin_constant.value = parse_assignment_expression();
6516 rem_anchor_token(')');
6518 expression->base.type = type_int;
6524 * Parses a __builtin_types_compatible_p() expression.
6526 static expression_t *parse_builtin_types_compatible(void)
6528 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
6530 eat(T___builtin_types_compatible_p);
6532 add_anchor_token(')');
6533 add_anchor_token(',');
6535 expression->builtin_types_compatible.left = parse_typename();
6536 rem_anchor_token(',');
6538 expression->builtin_types_compatible.right = parse_typename();
6539 rem_anchor_token(')');
6541 expression->base.type = type_int;
6547 * Parses a __builtin_is_*() compare expression.
6549 static expression_t *parse_compare_builtin(void)
6551 expression_kind_t kind;
6552 switch (token.kind) {
6553 case T___builtin_isgreater: kind = EXPR_BINARY_ISGREATER; break;
6554 case T___builtin_isgreaterequal: kind = EXPR_BINARY_ISGREATEREQUAL; break;
6555 case T___builtin_isless: kind = EXPR_BINARY_ISLESS; break;
6556 case T___builtin_islessequal: kind = EXPR_BINARY_ISLESSEQUAL; break;
6557 case T___builtin_islessgreater: kind = EXPR_BINARY_ISLESSGREATER; break;
6558 case T___builtin_isunordered: kind = EXPR_BINARY_ISUNORDERED; break;
6559 default: internal_errorf(HERE, "invalid compare builtin found");
6561 expression_t *const expression = allocate_expression_zero(kind);
6564 add_anchor_token(')');
6565 add_anchor_token(',');
6567 expression->binary.left = parse_assignment_expression();
6568 rem_anchor_token(',');
6570 expression->binary.right = parse_assignment_expression();
6571 rem_anchor_token(')');
6574 type_t *const orig_type_left = expression->binary.left->base.type;
6575 type_t *const orig_type_right = expression->binary.right->base.type;
6577 type_t *const type_left = skip_typeref(orig_type_left);
6578 type_t *const type_right = skip_typeref(orig_type_right);
6579 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6580 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6581 type_error_incompatible("invalid operands in comparison",
6582 &expression->base.source_position, orig_type_left, orig_type_right);
6585 semantic_comparison(&expression->binary);
6592 * Parses a MS assume() expression.
6594 static expression_t *parse_assume(void)
6596 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
6600 add_anchor_token(')');
6602 expression->unary.value = parse_assignment_expression();
6603 rem_anchor_token(')');
6606 expression->base.type = type_void;
6611 * Return the label for the current symbol or create a new one.
6613 static label_t *get_label(char const *const context)
6615 assert(current_function != NULL);
6617 symbol_t *const sym = expect_identifier(context, NULL);
6621 entity_t *label = get_entity(sym, NAMESPACE_LABEL);
6622 /* If we find a local label, we already created the declaration. */
6623 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
6624 if (label->base.parent_scope != current_scope) {
6625 assert(label->base.parent_scope->depth < current_scope->depth);
6626 current_function->goto_to_outer = true;
6628 } else if (label == NULL || label->base.parent_scope != ¤t_function->parameters) {
6629 /* There is no matching label in the same function, so create a new one. */
6630 source_position_t const nowhere = { NULL, 0, 0, false };
6631 label = allocate_entity_zero(ENTITY_LABEL, NAMESPACE_LABEL, sym, &nowhere);
6635 return &label->label;
6639 * Parses a GNU && label address expression.
6641 static expression_t *parse_label_address(void)
6643 source_position_t const source_position = *HERE;
6646 label_t *const label = get_label("while parsing label address");
6648 return create_error_expression();
6651 label->address_taken = true;
6653 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
6654 expression->base.source_position = source_position;
6656 /* label address is treated as a void pointer */
6657 expression->base.type = type_void_ptr;
6658 expression->label_address.label = label;
6663 * Parse a microsoft __noop expression.
6665 static expression_t *parse_noop_expression(void)
6667 /* the result is a (int)0 */
6668 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_MS_NOOP);
6669 literal->base.type = type_int;
6670 literal->literal.value.begin = "__noop";
6671 literal->literal.value.size = 6;
6675 if (token.kind == '(') {
6676 /* parse arguments */
6678 add_anchor_token(')');
6679 add_anchor_token(',');
6681 if (token.kind != ')') do {
6682 (void)parse_assignment_expression();
6683 } while (accept(','));
6685 rem_anchor_token(',');
6686 rem_anchor_token(')');
6694 * Parses a primary expression.
6696 static expression_t *parse_primary_expression(void)
6698 switch (token.kind) {
6699 case T_false: return parse_boolean_literal(false);
6700 case T_true: return parse_boolean_literal(true);
6701 case T_NUMBER: return parse_number_literal();
6702 case T_CHARACTER_CONSTANT: return parse_character_constant();
6703 case T_STRING_LITERAL: return parse_string_literal();
6704 case T___func__: return parse_function_keyword(FUNCNAME_FUNCTION);
6705 case T___PRETTY_FUNCTION__: return parse_function_keyword(FUNCNAME_PRETTY_FUNCTION);
6706 case T___FUNCSIG__: return parse_function_keyword(FUNCNAME_FUNCSIG);
6707 case T___FUNCDNAME__: return parse_function_keyword(FUNCNAME_FUNCDNAME);
6708 case T___builtin_offsetof: return parse_offsetof();
6709 case T___builtin_va_start: return parse_va_start();
6710 case T___builtin_va_arg: return parse_va_arg();
6711 case T___builtin_va_copy: return parse_va_copy();
6712 case T___builtin_isgreater:
6713 case T___builtin_isgreaterequal:
6714 case T___builtin_isless:
6715 case T___builtin_islessequal:
6716 case T___builtin_islessgreater:
6717 case T___builtin_isunordered: return parse_compare_builtin();
6718 case T___builtin_constant_p: return parse_builtin_constant();
6719 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
6720 case T__assume: return parse_assume();
6723 return parse_label_address();
6726 case '(': return parse_parenthesized_expression();
6727 case T___noop: return parse_noop_expression();
6729 /* Gracefully handle type names while parsing expressions. */
6731 return parse_reference();
6733 if (!is_typedef_symbol(token.base.symbol)) {
6734 return parse_reference();
6738 source_position_t const pos = *HERE;
6739 declaration_specifiers_t specifiers;
6740 parse_declaration_specifiers(&specifiers);
6741 type_t const *const type = parse_abstract_declarator(specifiers.type);
6742 errorf(&pos, "encountered type '%T' while parsing expression", type);
6743 return create_error_expression();
6747 errorf(HERE, "unexpected token %K, expected an expression", &token);
6749 return create_error_expression();
6752 static expression_t *parse_array_expression(expression_t *left)
6754 expression_t *const expr = allocate_expression_zero(EXPR_ARRAY_ACCESS);
6755 array_access_expression_t *const arr = &expr->array_access;
6758 add_anchor_token(']');
6760 expression_t *const inside = parse_expression();
6762 type_t *const orig_type_left = left->base.type;
6763 type_t *const orig_type_inside = inside->base.type;
6765 type_t *const type_left = skip_typeref(orig_type_left);
6766 type_t *const type_inside = skip_typeref(orig_type_inside);
6772 if (is_type_pointer(type_left)) {
6775 idx_type = type_inside;
6776 res_type = type_left->pointer.points_to;
6778 } else if (is_type_pointer(type_inside)) {
6779 arr->flipped = true;
6782 idx_type = type_left;
6783 res_type = type_inside->pointer.points_to;
6785 res_type = automatic_type_conversion(res_type);
6786 if (!is_type_integer(idx_type)) {
6787 if (is_type_valid(idx_type))
6788 errorf(&idx->base.source_position, "array subscript must have integer type");
6789 } else if (is_type_atomic(idx_type, ATOMIC_TYPE_CHAR)) {
6790 source_position_t const *const pos = &idx->base.source_position;
6791 warningf(WARN_CHAR_SUBSCRIPTS, pos, "array subscript has char type");
6794 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
6795 errorf(&expr->base.source_position, "invalid types '%T[%T]' for array access", orig_type_left, orig_type_inside);
6797 res_type = type_error_type;
6802 arr->array_ref = ref;
6804 arr->base.type = res_type;
6806 rem_anchor_token(']');
6811 static bool is_bitfield(const expression_t *expression)
6813 return expression->kind == EXPR_SELECT
6814 && expression->select.compound_entry->compound_member.bitfield;
6817 static expression_t *parse_typeprop(expression_kind_t const kind)
6819 expression_t *tp_expression = allocate_expression_zero(kind);
6820 tp_expression->base.type = type_size_t;
6822 eat(kind == EXPR_SIZEOF ? T_sizeof : T__Alignof);
6825 expression_t *expression;
6826 if (token.kind == '(' && is_declaration_specifier(look_ahead(1))) {
6827 source_position_t const pos = *HERE;
6829 add_anchor_token(')');
6830 orig_type = parse_typename();
6831 rem_anchor_token(')');
6834 if (token.kind == '{') {
6835 /* It was not sizeof(type) after all. It is sizeof of an expression
6836 * starting with a compound literal */
6837 expression = parse_compound_literal(&pos, orig_type);
6838 goto typeprop_expression;
6841 expression = parse_subexpression(PREC_UNARY);
6843 typeprop_expression:
6844 if (is_bitfield(expression)) {
6845 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6846 errorf(&tp_expression->base.source_position,
6847 "operand of %s expression must not be a bitfield", what);
6850 tp_expression->typeprop.tp_expression = expression;
6852 orig_type = revert_automatic_type_conversion(expression);
6853 expression->base.type = orig_type;
6856 tp_expression->typeprop.type = orig_type;
6857 type_t const* const type = skip_typeref(orig_type);
6858 char const* wrong_type = NULL;
6859 if (is_type_incomplete(type)) {
6860 if (!is_type_void(type) || !GNU_MODE)
6861 wrong_type = "incomplete";
6862 } else if (type->kind == TYPE_FUNCTION) {
6864 /* function types are allowed (and return 1) */
6865 source_position_t const *const pos = &tp_expression->base.source_position;
6866 char const *const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6867 warningf(WARN_OTHER, pos, "%s expression with function argument returns invalid result", what);
6869 wrong_type = "function";
6873 if (wrong_type != NULL) {
6874 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6875 errorf(&tp_expression->base.source_position,
6876 "operand of %s expression must not be of %s type '%T'",
6877 what, wrong_type, orig_type);
6880 return tp_expression;
6883 static expression_t *parse_sizeof(void)
6885 return parse_typeprop(EXPR_SIZEOF);
6888 static expression_t *parse_alignof(void)
6890 return parse_typeprop(EXPR_ALIGNOF);
6893 static expression_t *parse_select_expression(expression_t *addr)
6895 assert(token.kind == '.' || token.kind == T_MINUSGREATER);
6896 bool select_left_arrow = (token.kind == T_MINUSGREATER);
6897 source_position_t const pos = *HERE;
6900 symbol_t *const symbol = expect_identifier("while parsing select", NULL);
6902 return create_error_expression();
6904 type_t *const orig_type = addr->base.type;
6905 type_t *const type = skip_typeref(orig_type);
6908 bool saw_error = false;
6909 if (is_type_pointer(type)) {
6910 if (!select_left_arrow) {
6912 "request for member '%Y' in something not a struct or union, but '%T'",
6916 type_left = skip_typeref(type->pointer.points_to);
6918 if (select_left_arrow && is_type_valid(type)) {
6919 errorf(&pos, "left hand side of '->' is not a pointer, but '%T'", orig_type);
6925 if (!is_type_compound(type_left)) {
6926 if (is_type_valid(type_left) && !saw_error) {
6928 "request for member '%Y' in something not a struct or union, but '%T'",
6931 return create_error_expression();
6934 compound_t *compound = type_left->compound.compound;
6935 if (!compound->complete) {
6936 errorf(&pos, "request for member '%Y' in incomplete type '%T'",
6938 return create_error_expression();
6941 type_qualifiers_t qualifiers = type_left->base.qualifiers;
6942 expression_t *result =
6943 find_create_select(&pos, addr, qualifiers, compound, symbol);
6945 if (result == NULL) {
6946 errorf(&pos, "'%T' has no member named '%Y'", orig_type, symbol);
6947 return create_error_expression();
6953 static void check_call_argument(type_t *expected_type,
6954 call_argument_t *argument, unsigned pos)
6956 type_t *expected_type_skip = skip_typeref(expected_type);
6957 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
6958 expression_t *arg_expr = argument->expression;
6959 type_t *arg_type = skip_typeref(arg_expr->base.type);
6961 /* handle transparent union gnu extension */
6962 if (is_type_union(expected_type_skip)
6963 && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
6964 compound_t *union_decl = expected_type_skip->compound.compound;
6965 type_t *best_type = NULL;
6966 entity_t *entry = union_decl->members.entities;
6967 for ( ; entry != NULL; entry = entry->base.next) {
6968 assert(is_declaration(entry));
6969 type_t *decl_type = entry->declaration.type;
6970 error = semantic_assign(decl_type, arg_expr);
6971 if (error == ASSIGN_ERROR_INCOMPATIBLE
6972 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
6975 if (error == ASSIGN_SUCCESS) {
6976 best_type = decl_type;
6977 } else if (best_type == NULL) {
6978 best_type = decl_type;
6982 if (best_type != NULL) {
6983 expected_type = best_type;
6987 error = semantic_assign(expected_type, arg_expr);
6988 argument->expression = create_implicit_cast(arg_expr, expected_type);
6990 if (error != ASSIGN_SUCCESS) {
6991 /* report exact scope in error messages (like "in argument 3") */
6993 snprintf(buf, sizeof(buf), "call argument %u", pos);
6994 report_assign_error(error, expected_type, arg_expr, buf,
6995 &arg_expr->base.source_position);
6997 type_t *const promoted_type = get_default_promoted_type(arg_type);
6998 if (!types_compatible(expected_type_skip, promoted_type) &&
6999 !types_compatible(expected_type_skip, type_void_ptr) &&
7000 !types_compatible(type_void_ptr, promoted_type)) {
7001 /* Deliberately show the skipped types in this warning */
7002 source_position_t const *const apos = &arg_expr->base.source_position;
7003 warningf(WARN_TRADITIONAL, apos, "passing call argument %u as '%T' rather than '%T' due to prototype", pos, expected_type_skip, promoted_type);
7009 * Handle the semantic restrictions of builtin calls
7011 static void handle_builtin_argument_restrictions(call_expression_t *call)
7013 entity_t *entity = call->function->reference.entity;
7014 switch (entity->function.btk) {
7016 switch (entity->function.b.firm_builtin_kind) {
7017 case ir_bk_return_address:
7018 case ir_bk_frame_address: {
7019 /* argument must be constant */
7020 call_argument_t *argument = call->arguments;
7022 if (is_constant_expression(argument->expression) == EXPR_CLASS_VARIABLE) {
7023 errorf(&call->base.source_position,
7024 "argument of '%Y' must be a constant expression",
7025 call->function->reference.entity->base.symbol);
7029 case ir_bk_prefetch:
7030 /* second and third argument must be constant if existent */
7031 if (call->arguments == NULL)
7033 call_argument_t *rw = call->arguments->next;
7034 call_argument_t *locality = NULL;
7037 if (is_constant_expression(rw->expression) == EXPR_CLASS_VARIABLE) {
7038 errorf(&call->base.source_position,
7039 "second argument of '%Y' must be a constant expression",
7040 call->function->reference.entity->base.symbol);
7042 locality = rw->next;
7044 if (locality != NULL) {
7045 if (is_constant_expression(locality->expression) == EXPR_CLASS_VARIABLE) {
7046 errorf(&call->base.source_position,
7047 "third argument of '%Y' must be a constant expression",
7048 call->function->reference.entity->base.symbol);
7056 case BUILTIN_OBJECT_SIZE:
7057 if (call->arguments == NULL)
7060 call_argument_t *arg = call->arguments->next;
7061 if (arg != NULL && is_constant_expression(arg->expression) == EXPR_CLASS_VARIABLE) {
7062 errorf(&call->base.source_position,
7063 "second argument of '%Y' must be a constant expression",
7064 call->function->reference.entity->base.symbol);
7073 * Parse a call expression, ie. expression '( ... )'.
7075 * @param expression the function address
7077 static expression_t *parse_call_expression(expression_t *expression)
7079 expression_t *result = allocate_expression_zero(EXPR_CALL);
7080 call_expression_t *call = &result->call;
7081 call->function = expression;
7083 type_t *const orig_type = expression->base.type;
7084 type_t *const type = skip_typeref(orig_type);
7086 function_type_t *function_type = NULL;
7087 if (is_type_pointer(type)) {
7088 type_t *const to_type = skip_typeref(type->pointer.points_to);
7090 if (is_type_function(to_type)) {
7091 function_type = &to_type->function;
7092 call->base.type = function_type->return_type;
7096 if (function_type == NULL && is_type_valid(type)) {
7098 "called object '%E' (type '%T') is not a pointer to a function",
7099 expression, orig_type);
7102 /* parse arguments */
7104 add_anchor_token(')');
7105 add_anchor_token(',');
7107 if (token.kind != ')') {
7108 call_argument_t **anchor = &call->arguments;
7110 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7111 argument->expression = parse_assignment_expression();
7114 anchor = &argument->next;
7115 } while (accept(','));
7117 rem_anchor_token(',');
7118 rem_anchor_token(')');
7121 if (function_type == NULL)
7124 /* check type and count of call arguments */
7125 function_parameter_t *parameter = function_type->parameters;
7126 call_argument_t *argument = call->arguments;
7127 if (!function_type->unspecified_parameters) {
7128 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7129 parameter = parameter->next, argument = argument->next) {
7130 check_call_argument(parameter->type, argument, ++pos);
7133 if (parameter != NULL) {
7134 errorf(&expression->base.source_position, "too few arguments to function '%E'", expression);
7135 } else if (argument != NULL && !function_type->variadic) {
7136 errorf(&argument->expression->base.source_position, "too many arguments to function '%E'", expression);
7140 /* do default promotion for other arguments */
7141 for (; argument != NULL; argument = argument->next) {
7142 type_t *argument_type = argument->expression->base.type;
7143 if (!is_type_object(skip_typeref(argument_type))) {
7144 errorf(&argument->expression->base.source_position,
7145 "call argument '%E' must not be void", argument->expression);
7148 argument_type = get_default_promoted_type(argument_type);
7150 argument->expression
7151 = create_implicit_cast(argument->expression, argument_type);
7156 if (is_type_compound(skip_typeref(function_type->return_type))) {
7157 source_position_t const *const pos = &expression->base.source_position;
7158 warningf(WARN_AGGREGATE_RETURN, pos, "function call has aggregate value");
7161 if (expression->kind == EXPR_REFERENCE) {
7162 reference_expression_t *reference = &expression->reference;
7163 if (reference->entity->kind == ENTITY_FUNCTION &&
7164 reference->entity->function.btk != BUILTIN_NONE)
7165 handle_builtin_argument_restrictions(call);
7171 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7173 static bool same_compound_type(const type_t *type1, const type_t *type2)
7176 is_type_compound(type1) &&
7177 type1->kind == type2->kind &&
7178 type1->compound.compound == type2->compound.compound;
7181 static expression_t const *get_reference_address(expression_t const *expr)
7183 bool regular_take_address = true;
7185 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7186 expr = expr->unary.value;
7188 regular_take_address = false;
7191 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7194 expr = expr->unary.value;
7197 if (expr->kind != EXPR_REFERENCE)
7200 /* special case for functions which are automatically converted to a
7201 * pointer to function without an extra TAKE_ADDRESS operation */
7202 if (!regular_take_address &&
7203 expr->reference.entity->kind != ENTITY_FUNCTION) {
7210 static void warn_reference_address_as_bool(expression_t const* expr)
7212 expr = get_reference_address(expr);
7214 source_position_t const *const pos = &expr->base.source_position;
7215 entity_t const *const ent = expr->reference.entity;
7216 warningf(WARN_ADDRESS, pos, "the address of '%N' will always evaluate as 'true'", ent);
7220 static void warn_assignment_in_condition(const expression_t *const expr)
7222 if (expr->base.kind != EXPR_BINARY_ASSIGN)
7224 if (expr->base.parenthesized)
7226 source_position_t const *const pos = &expr->base.source_position;
7227 warningf(WARN_PARENTHESES, pos, "suggest parentheses around assignment used as truth value");
7230 static void semantic_condition(expression_t const *const expr,
7231 char const *const context)
7233 type_t *const type = skip_typeref(expr->base.type);
7234 if (is_type_scalar(type)) {
7235 warn_reference_address_as_bool(expr);
7236 warn_assignment_in_condition(expr);
7237 } else if (is_type_valid(type)) {
7238 errorf(&expr->base.source_position,
7239 "%s must have scalar type", context);
7244 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7246 * @param expression the conditional expression
7248 static expression_t *parse_conditional_expression(expression_t *expression)
7250 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7252 conditional_expression_t *conditional = &result->conditional;
7253 conditional->condition = expression;
7256 add_anchor_token(':');
7258 /* §6.5.15:2 The first operand shall have scalar type. */
7259 semantic_condition(expression, "condition of conditional operator");
7261 expression_t *true_expression = expression;
7262 bool gnu_cond = false;
7263 if (GNU_MODE && token.kind == ':') {
7266 true_expression = parse_expression();
7268 rem_anchor_token(':');
7270 expression_t *false_expression =
7271 parse_subexpression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7273 type_t *const orig_true_type = true_expression->base.type;
7274 type_t *const orig_false_type = false_expression->base.type;
7275 type_t *const true_type = skip_typeref(orig_true_type);
7276 type_t *const false_type = skip_typeref(orig_false_type);
7279 source_position_t const *const pos = &conditional->base.source_position;
7280 type_t *result_type;
7281 if (is_type_void(true_type) || is_type_void(false_type)) {
7282 /* ISO/IEC 14882:1998(E) §5.16:2 */
7283 if (true_expression->kind == EXPR_UNARY_THROW) {
7284 result_type = false_type;
7285 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7286 result_type = true_type;
7288 if (!is_type_void(true_type) || !is_type_void(false_type)) {
7289 warningf(WARN_OTHER, pos, "ISO C forbids conditional expression with only one void side");
7291 result_type = type_void;
7293 } else if (is_type_arithmetic(true_type)
7294 && is_type_arithmetic(false_type)) {
7295 result_type = semantic_arithmetic(true_type, false_type);
7296 } else if (same_compound_type(true_type, false_type)) {
7297 /* just take 1 of the 2 types */
7298 result_type = true_type;
7299 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7300 type_t *pointer_type;
7302 expression_t *other_expression;
7303 if (is_type_pointer(true_type) &&
7304 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7305 pointer_type = true_type;
7306 other_type = false_type;
7307 other_expression = false_expression;
7309 pointer_type = false_type;
7310 other_type = true_type;
7311 other_expression = true_expression;
7314 if (is_null_pointer_constant(other_expression)) {
7315 result_type = pointer_type;
7316 } else if (is_type_pointer(other_type)) {
7317 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7318 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7321 if (is_type_void(to1) || is_type_void(to2)) {
7323 } else if (types_compatible(get_unqualified_type(to1),
7324 get_unqualified_type(to2))) {
7327 warningf(WARN_OTHER, pos, "pointer types '%T' and '%T' in conditional expression are incompatible", true_type, false_type);
7331 type_t *const type =
7332 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7333 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7334 } else if (is_type_integer(other_type)) {
7335 warningf(WARN_OTHER, pos, "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7336 result_type = pointer_type;
7338 goto types_incompatible;
7342 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7343 type_error_incompatible("while parsing conditional", pos, true_type, false_type);
7345 result_type = type_error_type;
7348 conditional->true_expression
7349 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7350 conditional->false_expression
7351 = create_implicit_cast(false_expression, result_type);
7352 conditional->base.type = result_type;
7357 * Parse an extension expression.
7359 static expression_t *parse_extension(void)
7362 expression_t *expression = parse_subexpression(PREC_UNARY);
7368 * Parse a __builtin_classify_type() expression.
7370 static expression_t *parse_builtin_classify_type(void)
7372 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7373 result->base.type = type_int;
7375 eat(T___builtin_classify_type);
7377 add_anchor_token(')');
7379 expression_t *expression = parse_expression();
7380 rem_anchor_token(')');
7382 result->classify_type.type_expression = expression;
7388 * Parse a delete expression
7389 * ISO/IEC 14882:1998(E) §5.3.5
7391 static expression_t *parse_delete(void)
7393 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7394 result->base.type = type_void;
7399 result->kind = EXPR_UNARY_DELETE_ARRAY;
7403 expression_t *const value = parse_subexpression(PREC_CAST);
7404 result->unary.value = value;
7406 type_t *const type = skip_typeref(value->base.type);
7407 if (!is_type_pointer(type)) {
7408 if (is_type_valid(type)) {
7409 errorf(&value->base.source_position,
7410 "operand of delete must have pointer type");
7412 } else if (is_type_void(skip_typeref(type->pointer.points_to))) {
7413 source_position_t const *const pos = &value->base.source_position;
7414 warningf(WARN_OTHER, pos, "deleting 'void*' is undefined");
7421 * Parse a throw expression
7422 * ISO/IEC 14882:1998(E) §15:1
7424 static expression_t *parse_throw(void)
7426 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7427 result->base.type = type_void;
7431 expression_t *value = NULL;
7432 switch (token.kind) {
7434 value = parse_assignment_expression();
7435 /* ISO/IEC 14882:1998(E) §15.1:3 */
7436 type_t *const orig_type = value->base.type;
7437 type_t *const type = skip_typeref(orig_type);
7438 if (is_type_incomplete(type)) {
7439 errorf(&value->base.source_position,
7440 "cannot throw object of incomplete type '%T'", orig_type);
7441 } else if (is_type_pointer(type)) {
7442 type_t *const points_to = skip_typeref(type->pointer.points_to);
7443 if (is_type_incomplete(points_to) && !is_type_void(points_to)) {
7444 errorf(&value->base.source_position,
7445 "cannot throw pointer to incomplete type '%T'", orig_type);
7453 result->unary.value = value;
7458 static bool check_pointer_arithmetic(const source_position_t *source_position,
7459 type_t *pointer_type,
7460 type_t *orig_pointer_type)
7462 type_t *points_to = pointer_type->pointer.points_to;
7463 points_to = skip_typeref(points_to);
7465 if (is_type_incomplete(points_to)) {
7466 if (!GNU_MODE || !is_type_void(points_to)) {
7467 errorf(source_position,
7468 "arithmetic with pointer to incomplete type '%T' not allowed",
7472 warningf(WARN_POINTER_ARITH, source_position, "pointer of type '%T' used in arithmetic", orig_pointer_type);
7474 } else if (is_type_function(points_to)) {
7476 errorf(source_position,
7477 "arithmetic with pointer to function type '%T' not allowed",
7481 warningf(WARN_POINTER_ARITH, source_position, "pointer to a function '%T' used in arithmetic", orig_pointer_type);
7487 static bool is_lvalue(const expression_t *expression)
7489 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
7490 switch (expression->kind) {
7491 case EXPR_ARRAY_ACCESS:
7492 case EXPR_COMPOUND_LITERAL:
7493 case EXPR_REFERENCE:
7495 case EXPR_UNARY_DEREFERENCE:
7499 type_t *type = skip_typeref(expression->base.type);
7501 /* ISO/IEC 14882:1998(E) §3.10:3 */
7502 is_type_reference(type) ||
7503 /* Claim it is an lvalue, if the type is invalid. There was a parse
7504 * error before, which maybe prevented properly recognizing it as
7506 !is_type_valid(type);
7511 static void semantic_incdec(unary_expression_t *expression)
7513 type_t *const orig_type = expression->value->base.type;
7514 type_t *const type = skip_typeref(orig_type);
7515 if (is_type_pointer(type)) {
7516 if (!check_pointer_arithmetic(&expression->base.source_position,
7520 } else if (!is_type_real(type) && is_type_valid(type)) {
7521 /* TODO: improve error message */
7522 errorf(&expression->base.source_position,
7523 "operation needs an arithmetic or pointer type");
7526 if (!is_lvalue(expression->value)) {
7527 /* TODO: improve error message */
7528 errorf(&expression->base.source_position, "lvalue required as operand");
7530 expression->base.type = orig_type;
7533 static void promote_unary_int_expr(unary_expression_t *const expr, type_t *const type)
7535 type_t *const res_type = promote_integer(type);
7536 expr->base.type = res_type;
7537 expr->value = create_implicit_cast(expr->value, res_type);
7540 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
7542 type_t *const orig_type = expression->value->base.type;
7543 type_t *const type = skip_typeref(orig_type);
7544 if (!is_type_arithmetic(type)) {
7545 if (is_type_valid(type)) {
7546 /* TODO: improve error message */
7547 errorf(&expression->base.source_position,
7548 "operation needs an arithmetic type");
7551 } else if (is_type_integer(type)) {
7552 promote_unary_int_expr(expression, type);
7554 expression->base.type = orig_type;
7558 static void semantic_unexpr_plus(unary_expression_t *expression)
7560 semantic_unexpr_arithmetic(expression);
7561 source_position_t const *const pos = &expression->base.source_position;
7562 warningf(WARN_TRADITIONAL, pos, "traditional C rejects the unary plus operator");
7565 static void semantic_not(unary_expression_t *expression)
7567 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
7568 semantic_condition(expression->value, "operand of !");
7569 expression->base.type = c_mode & _CXX ? type_bool : type_int;
7572 static void semantic_unexpr_integer(unary_expression_t *expression)
7574 type_t *const orig_type = expression->value->base.type;
7575 type_t *const type = skip_typeref(orig_type);
7576 if (!is_type_integer(type)) {
7577 if (is_type_valid(type)) {
7578 errorf(&expression->base.source_position,
7579 "operand of ~ must be of integer type");
7584 promote_unary_int_expr(expression, type);
7587 static void semantic_dereference(unary_expression_t *expression)
7589 type_t *const orig_type = expression->value->base.type;
7590 type_t *const type = skip_typeref(orig_type);
7591 if (!is_type_pointer(type)) {
7592 if (is_type_valid(type)) {
7593 errorf(&expression->base.source_position,
7594 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
7599 type_t *result_type = type->pointer.points_to;
7600 result_type = automatic_type_conversion(result_type);
7601 expression->base.type = result_type;
7605 * Record that an address is taken (expression represents an lvalue).
7607 * @param expression the expression
7608 * @param may_be_register if true, the expression might be an register
7610 static void set_address_taken(expression_t *expression, bool may_be_register)
7612 if (expression->kind != EXPR_REFERENCE)
7615 entity_t *const entity = expression->reference.entity;
7617 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
7620 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
7621 && !may_be_register) {
7622 source_position_t const *const pos = &expression->base.source_position;
7623 errorf(pos, "address of register '%N' requested", entity);
7626 entity->variable.address_taken = true;
7630 * Check the semantic of the address taken expression.
7632 static void semantic_take_addr(unary_expression_t *expression)
7634 expression_t *value = expression->value;
7635 value->base.type = revert_automatic_type_conversion(value);
7637 type_t *orig_type = value->base.type;
7638 type_t *type = skip_typeref(orig_type);
7639 if (!is_type_valid(type))
7643 if (!is_lvalue(value)) {
7644 errorf(&expression->base.source_position, "'&' requires an lvalue");
7646 if (is_bitfield(value)) {
7647 errorf(&expression->base.source_position,
7648 "'&' not allowed on bitfield");
7651 set_address_taken(value, false);
7653 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
7656 #define CREATE_UNARY_EXPRESSION_PARSER(token_kind, unexpression_type, sfunc) \
7657 static expression_t *parse_##unexpression_type(void) \
7659 expression_t *unary_expression \
7660 = allocate_expression_zero(unexpression_type); \
7662 unary_expression->unary.value = parse_subexpression(PREC_UNARY); \
7664 sfunc(&unary_expression->unary); \
7666 return unary_expression; \
7669 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
7670 semantic_unexpr_arithmetic)
7671 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
7672 semantic_unexpr_plus)
7673 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
7675 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
7676 semantic_dereference)
7677 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
7679 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
7680 semantic_unexpr_integer)
7681 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
7683 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
7686 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_kind, unexpression_type, \
7688 static expression_t *parse_##unexpression_type(expression_t *left) \
7690 expression_t *unary_expression \
7691 = allocate_expression_zero(unexpression_type); \
7693 unary_expression->unary.value = left; \
7695 sfunc(&unary_expression->unary); \
7697 return unary_expression; \
7700 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
7701 EXPR_UNARY_POSTFIX_INCREMENT,
7703 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
7704 EXPR_UNARY_POSTFIX_DECREMENT,
7707 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
7709 /* TODO: handle complex + imaginary types */
7711 type_left = get_unqualified_type(type_left);
7712 type_right = get_unqualified_type(type_right);
7714 /* §6.3.1.8 Usual arithmetic conversions */
7715 if (type_left == type_long_double || type_right == type_long_double) {
7716 return type_long_double;
7717 } else if (type_left == type_double || type_right == type_double) {
7719 } else if (type_left == type_float || type_right == type_float) {
7723 type_left = promote_integer(type_left);
7724 type_right = promote_integer(type_right);
7726 if (type_left == type_right)
7729 bool const signed_left = is_type_signed(type_left);
7730 bool const signed_right = is_type_signed(type_right);
7731 unsigned const rank_left = get_akind_rank(get_akind(type_left));
7732 unsigned const rank_right = get_akind_rank(get_akind(type_right));
7734 if (signed_left == signed_right)
7735 return rank_left >= rank_right ? type_left : type_right;
7739 atomic_type_kind_t s_akind;
7740 atomic_type_kind_t u_akind;
7745 u_type = type_right;
7747 s_type = type_right;
7750 s_akind = get_akind(s_type);
7751 u_akind = get_akind(u_type);
7752 s_rank = get_akind_rank(s_akind);
7753 u_rank = get_akind_rank(u_akind);
7755 if (u_rank >= s_rank)
7758 if (get_atomic_type_size(s_akind) > get_atomic_type_size(u_akind))
7762 case ATOMIC_TYPE_INT: return type_unsigned_int;
7763 case ATOMIC_TYPE_LONG: return type_unsigned_long;
7764 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
7766 default: panic("invalid atomic type");
7771 * Check the semantic restrictions for a binary expression.
7773 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
7775 expression_t *const left = expression->left;
7776 expression_t *const right = expression->right;
7777 type_t *const orig_type_left = left->base.type;
7778 type_t *const orig_type_right = right->base.type;
7779 type_t *const type_left = skip_typeref(orig_type_left);
7780 type_t *const type_right = skip_typeref(orig_type_right);
7782 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
7783 /* TODO: improve error message */
7784 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7785 errorf(&expression->base.source_position,
7786 "operation needs arithmetic types");
7791 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7792 expression->left = create_implicit_cast(left, arithmetic_type);
7793 expression->right = create_implicit_cast(right, arithmetic_type);
7794 expression->base.type = arithmetic_type;
7797 static void semantic_binexpr_integer(binary_expression_t *const expression)
7799 expression_t *const left = expression->left;
7800 expression_t *const right = expression->right;
7801 type_t *const orig_type_left = left->base.type;
7802 type_t *const orig_type_right = right->base.type;
7803 type_t *const type_left = skip_typeref(orig_type_left);
7804 type_t *const type_right = skip_typeref(orig_type_right);
7806 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
7807 /* TODO: improve error message */
7808 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7809 errorf(&expression->base.source_position,
7810 "operation needs integer types");
7815 type_t *const result_type = semantic_arithmetic(type_left, type_right);
7816 expression->left = create_implicit_cast(left, result_type);
7817 expression->right = create_implicit_cast(right, result_type);
7818 expression->base.type = result_type;
7821 static void warn_div_by_zero(binary_expression_t const *const expression)
7823 if (!is_type_integer(expression->base.type))
7826 expression_t const *const right = expression->right;
7827 /* The type of the right operand can be different for /= */
7828 if (is_type_integer(right->base.type) &&
7829 is_constant_expression(right) == EXPR_CLASS_CONSTANT &&
7830 !fold_constant_to_bool(right)) {
7831 source_position_t const *const pos = &expression->base.source_position;
7832 warningf(WARN_DIV_BY_ZERO, pos, "division by zero");
7837 * Check the semantic restrictions for a div/mod expression.
7839 static void semantic_divmod_arithmetic(binary_expression_t *expression)
7841 semantic_binexpr_arithmetic(expression);
7842 warn_div_by_zero(expression);
7845 static void warn_addsub_in_shift(const expression_t *const expr)
7847 if (expr->base.parenthesized)
7851 switch (expr->kind) {
7852 case EXPR_BINARY_ADD: op = '+'; break;
7853 case EXPR_BINARY_SUB: op = '-'; break;
7857 source_position_t const *const pos = &expr->base.source_position;
7858 warningf(WARN_PARENTHESES, pos, "suggest parentheses around '%c' inside shift", op);
7861 static bool semantic_shift(binary_expression_t *expression)
7863 expression_t *const left = expression->left;
7864 expression_t *const right = expression->right;
7865 type_t *const orig_type_left = left->base.type;
7866 type_t *const orig_type_right = right->base.type;
7867 type_t * type_left = skip_typeref(orig_type_left);
7868 type_t * type_right = skip_typeref(orig_type_right);
7870 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
7871 /* TODO: improve error message */
7872 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7873 errorf(&expression->base.source_position,
7874 "operands of shift operation must have integer types");
7879 type_left = promote_integer(type_left);
7881 if (is_constant_expression(right) == EXPR_CLASS_CONSTANT) {
7882 source_position_t const *const pos = &right->base.source_position;
7883 long const count = fold_constant_to_int(right);
7885 warningf(WARN_OTHER, pos, "shift count must be non-negative");
7886 } else if ((unsigned long)count >=
7887 get_atomic_type_size(type_left->atomic.akind) * 8) {
7888 warningf(WARN_OTHER, pos, "shift count must be less than type width");
7892 type_right = promote_integer(type_right);
7893 expression->right = create_implicit_cast(right, type_right);
7898 static void semantic_shift_op(binary_expression_t *expression)
7900 expression_t *const left = expression->left;
7901 expression_t *const right = expression->right;
7903 if (!semantic_shift(expression))
7906 warn_addsub_in_shift(left);
7907 warn_addsub_in_shift(right);
7909 type_t *const orig_type_left = left->base.type;
7910 type_t * type_left = skip_typeref(orig_type_left);
7912 type_left = promote_integer(type_left);
7913 expression->left = create_implicit_cast(left, type_left);
7914 expression->base.type = type_left;
7917 static void semantic_add(binary_expression_t *expression)
7919 expression_t *const left = expression->left;
7920 expression_t *const right = expression->right;
7921 type_t *const orig_type_left = left->base.type;
7922 type_t *const orig_type_right = right->base.type;
7923 type_t *const type_left = skip_typeref(orig_type_left);
7924 type_t *const type_right = skip_typeref(orig_type_right);
7927 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7928 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7929 expression->left = create_implicit_cast(left, arithmetic_type);
7930 expression->right = create_implicit_cast(right, arithmetic_type);
7931 expression->base.type = arithmetic_type;
7932 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
7933 check_pointer_arithmetic(&expression->base.source_position,
7934 type_left, orig_type_left);
7935 expression->base.type = type_left;
7936 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
7937 check_pointer_arithmetic(&expression->base.source_position,
7938 type_right, orig_type_right);
7939 expression->base.type = type_right;
7940 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
7941 errorf(&expression->base.source_position,
7942 "invalid operands to binary + ('%T', '%T')",
7943 orig_type_left, orig_type_right);
7947 static void semantic_sub(binary_expression_t *expression)
7949 expression_t *const left = expression->left;
7950 expression_t *const right = expression->right;
7951 type_t *const orig_type_left = left->base.type;
7952 type_t *const orig_type_right = right->base.type;
7953 type_t *const type_left = skip_typeref(orig_type_left);
7954 type_t *const type_right = skip_typeref(orig_type_right);
7955 source_position_t const *const pos = &expression->base.source_position;
7958 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7959 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7960 expression->left = create_implicit_cast(left, arithmetic_type);
7961 expression->right = create_implicit_cast(right, arithmetic_type);
7962 expression->base.type = arithmetic_type;
7963 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
7964 check_pointer_arithmetic(&expression->base.source_position,
7965 type_left, orig_type_left);
7966 expression->base.type = type_left;
7967 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
7968 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
7969 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
7970 if (!types_compatible(unqual_left, unqual_right)) {
7972 "subtracting pointers to incompatible types '%T' and '%T'",
7973 orig_type_left, orig_type_right);
7974 } else if (!is_type_object(unqual_left)) {
7975 if (!is_type_void(unqual_left)) {
7976 errorf(pos, "subtracting pointers to non-object types '%T'",
7979 warningf(WARN_OTHER, pos, "subtracting pointers to void");
7982 expression->base.type = type_ptrdiff_t;
7983 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
7984 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
7985 orig_type_left, orig_type_right);
7989 static void warn_string_literal_address(expression_t const* expr)
7991 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7992 expr = expr->unary.value;
7993 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7995 expr = expr->unary.value;
7998 if (expr->kind == EXPR_STRING_LITERAL) {
7999 source_position_t const *const pos = &expr->base.source_position;
8000 warningf(WARN_ADDRESS, pos, "comparison with string literal results in unspecified behaviour");
8004 static bool maybe_negative(expression_t const *const expr)
8006 switch (is_constant_expression(expr)) {
8007 case EXPR_CLASS_ERROR: return false;
8008 case EXPR_CLASS_CONSTANT: return constant_is_negative(expr);
8009 default: return true;
8013 static void warn_comparison(source_position_t const *const pos, expression_t const *const expr, expression_t const *const other)
8015 warn_string_literal_address(expr);
8017 expression_t const* const ref = get_reference_address(expr);
8018 if (ref != NULL && is_null_pointer_constant(other)) {
8019 entity_t const *const ent = ref->reference.entity;
8020 warningf(WARN_ADDRESS, pos, "the address of '%N' will never be NULL", ent);
8023 if (!expr->base.parenthesized) {
8024 switch (expr->base.kind) {
8025 case EXPR_BINARY_LESS:
8026 case EXPR_BINARY_GREATER:
8027 case EXPR_BINARY_LESSEQUAL:
8028 case EXPR_BINARY_GREATEREQUAL:
8029 case EXPR_BINARY_NOTEQUAL:
8030 case EXPR_BINARY_EQUAL:
8031 warningf(WARN_PARENTHESES, pos, "comparisons like 'x <= y < z' do not have their mathematical meaning");
8040 * Check the semantics of comparison expressions.
8042 * @param expression The expression to check.
8044 static void semantic_comparison(binary_expression_t *expression)
8046 source_position_t const *const pos = &expression->base.source_position;
8047 expression_t *const left = expression->left;
8048 expression_t *const right = expression->right;
8050 warn_comparison(pos, left, right);
8051 warn_comparison(pos, right, left);
8053 type_t *orig_type_left = left->base.type;
8054 type_t *orig_type_right = right->base.type;
8055 type_t *type_left = skip_typeref(orig_type_left);
8056 type_t *type_right = skip_typeref(orig_type_right);
8058 /* TODO non-arithmetic types */
8059 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8060 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8062 /* test for signed vs unsigned compares */
8063 if (is_type_integer(arithmetic_type)) {
8064 bool const signed_left = is_type_signed(type_left);
8065 bool const signed_right = is_type_signed(type_right);
8066 if (signed_left != signed_right) {
8067 /* FIXME long long needs better const folding magic */
8068 /* TODO check whether constant value can be represented by other type */
8069 if ((signed_left && maybe_negative(left)) ||
8070 (signed_right && maybe_negative(right))) {
8071 warningf(WARN_SIGN_COMPARE, pos, "comparison between signed and unsigned");
8076 expression->left = create_implicit_cast(left, arithmetic_type);
8077 expression->right = create_implicit_cast(right, arithmetic_type);
8078 expression->base.type = arithmetic_type;
8079 if ((expression->base.kind == EXPR_BINARY_EQUAL ||
8080 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8081 is_type_float(arithmetic_type)) {
8082 warningf(WARN_FLOAT_EQUAL, pos, "comparing floating point with == or != is unsafe");
8084 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8085 /* TODO check compatibility */
8086 } else if (is_type_pointer(type_left)) {
8087 expression->right = create_implicit_cast(right, type_left);
8088 } else if (is_type_pointer(type_right)) {
8089 expression->left = create_implicit_cast(left, type_right);
8090 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8091 type_error_incompatible("invalid operands in comparison", pos, type_left, type_right);
8093 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8097 * Checks if a compound type has constant fields.
8099 static bool has_const_fields(const compound_type_t *type)
8101 compound_t *compound = type->compound;
8102 entity_t *entry = compound->members.entities;
8104 for (; entry != NULL; entry = entry->base.next) {
8105 if (!is_declaration(entry))
8108 const type_t *decl_type = skip_typeref(entry->declaration.type);
8109 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8116 static bool is_valid_assignment_lhs(expression_t const* const left)
8118 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8119 type_t *const type_left = skip_typeref(orig_type_left);
8121 if (!is_lvalue(left)) {
8122 errorf(&left->base.source_position, "left hand side '%E' of assignment is not an lvalue",
8127 if (left->kind == EXPR_REFERENCE
8128 && left->reference.entity->kind == ENTITY_FUNCTION) {
8129 errorf(&left->base.source_position, "cannot assign to function '%E'", left);
8133 if (is_type_array(type_left)) {
8134 errorf(&left->base.source_position, "cannot assign to array '%E'", left);
8137 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8138 errorf(&left->base.source_position, "assignment to read-only location '%E' (type '%T')", left,
8142 if (is_type_incomplete(type_left)) {
8143 errorf(&left->base.source_position, "left-hand side '%E' of assignment has incomplete type '%T'",
8144 left, orig_type_left);
8147 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8148 errorf(&left->base.source_position, "cannot assign to '%E' because compound type '%T' has read-only fields",
8149 left, orig_type_left);
8156 static void semantic_arithmetic_assign(binary_expression_t *expression)
8158 expression_t *left = expression->left;
8159 expression_t *right = expression->right;
8160 type_t *orig_type_left = left->base.type;
8161 type_t *orig_type_right = right->base.type;
8163 if (!is_valid_assignment_lhs(left))
8166 type_t *type_left = skip_typeref(orig_type_left);
8167 type_t *type_right = skip_typeref(orig_type_right);
8169 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8170 /* TODO: improve error message */
8171 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8172 errorf(&expression->base.source_position,
8173 "operation needs arithmetic types");
8178 /* combined instructions are tricky. We can't create an implicit cast on
8179 * the left side, because we need the uncasted form for the store.
8180 * The ast2firm pass has to know that left_type must be right_type
8181 * for the arithmetic operation and create a cast by itself */
8182 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8183 expression->right = create_implicit_cast(right, arithmetic_type);
8184 expression->base.type = type_left;
8187 static void semantic_divmod_assign(binary_expression_t *expression)
8189 semantic_arithmetic_assign(expression);
8190 warn_div_by_zero(expression);
8193 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8195 expression_t *const left = expression->left;
8196 expression_t *const right = expression->right;
8197 type_t *const orig_type_left = left->base.type;
8198 type_t *const orig_type_right = right->base.type;
8199 type_t *const type_left = skip_typeref(orig_type_left);
8200 type_t *const type_right = skip_typeref(orig_type_right);
8202 if (!is_valid_assignment_lhs(left))
8205 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8206 /* combined instructions are tricky. We can't create an implicit cast on
8207 * the left side, because we need the uncasted form for the store.
8208 * The ast2firm pass has to know that left_type must be right_type
8209 * for the arithmetic operation and create a cast by itself */
8210 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8211 expression->right = create_implicit_cast(right, arithmetic_type);
8212 expression->base.type = type_left;
8213 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8214 check_pointer_arithmetic(&expression->base.source_position,
8215 type_left, orig_type_left);
8216 expression->base.type = type_left;
8217 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8218 errorf(&expression->base.source_position,
8219 "incompatible types '%T' and '%T' in assignment",
8220 orig_type_left, orig_type_right);
8224 static void semantic_integer_assign(binary_expression_t *expression)
8226 expression_t *left = expression->left;
8227 expression_t *right = expression->right;
8228 type_t *orig_type_left = left->base.type;
8229 type_t *orig_type_right = right->base.type;
8231 if (!is_valid_assignment_lhs(left))
8234 type_t *type_left = skip_typeref(orig_type_left);
8235 type_t *type_right = skip_typeref(orig_type_right);
8237 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8238 /* TODO: improve error message */
8239 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8240 errorf(&expression->base.source_position,
8241 "operation needs integer types");
8246 /* combined instructions are tricky. We can't create an implicit cast on
8247 * the left side, because we need the uncasted form for the store.
8248 * The ast2firm pass has to know that left_type must be right_type
8249 * for the arithmetic operation and create a cast by itself */
8250 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8251 expression->right = create_implicit_cast(right, arithmetic_type);
8252 expression->base.type = type_left;
8255 static void semantic_shift_assign(binary_expression_t *expression)
8257 expression_t *left = expression->left;
8259 if (!is_valid_assignment_lhs(left))
8262 if (!semantic_shift(expression))
8265 expression->base.type = skip_typeref(left->base.type);
8268 static void warn_logical_and_within_or(const expression_t *const expr)
8270 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8272 if (expr->base.parenthesized)
8274 source_position_t const *const pos = &expr->base.source_position;
8275 warningf(WARN_PARENTHESES, pos, "suggest parentheses around && within ||");
8279 * Check the semantic restrictions of a logical expression.
8281 static void semantic_logical_op(binary_expression_t *expression)
8283 /* §6.5.13:2 Each of the operands shall have scalar type.
8284 * §6.5.14:2 Each of the operands shall have scalar type. */
8285 semantic_condition(expression->left, "left operand of logical operator");
8286 semantic_condition(expression->right, "right operand of logical operator");
8287 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR) {
8288 warn_logical_and_within_or(expression->left);
8289 warn_logical_and_within_or(expression->right);
8291 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8295 * Check the semantic restrictions of a binary assign expression.
8297 static void semantic_binexpr_assign(binary_expression_t *expression)
8299 expression_t *left = expression->left;
8300 type_t *orig_type_left = left->base.type;
8302 if (!is_valid_assignment_lhs(left))
8305 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8306 report_assign_error(error, orig_type_left, expression->right,
8307 "assignment", &left->base.source_position);
8308 expression->right = create_implicit_cast(expression->right, orig_type_left);
8309 expression->base.type = orig_type_left;
8313 * Determine if the outermost operation (or parts thereof) of the given
8314 * expression has no effect in order to generate a warning about this fact.
8315 * Therefore in some cases this only examines some of the operands of the
8316 * expression (see comments in the function and examples below).
8318 * f() + 23; // warning, because + has no effect
8319 * x || f(); // no warning, because x controls execution of f()
8320 * x ? y : f(); // warning, because y has no effect
8321 * (void)x; // no warning to be able to suppress the warning
8322 * This function can NOT be used for an "expression has definitely no effect"-
8324 static bool expression_has_effect(const expression_t *const expr)
8326 switch (expr->kind) {
8327 case EXPR_ERROR: return true; /* do NOT warn */
8328 case EXPR_REFERENCE: return false;
8329 case EXPR_ENUM_CONSTANT: return false;
8330 case EXPR_LABEL_ADDRESS: return false;
8332 /* suppress the warning for microsoft __noop operations */
8333 case EXPR_LITERAL_MS_NOOP: return true;
8334 case EXPR_LITERAL_BOOLEAN:
8335 case EXPR_LITERAL_CHARACTER:
8336 case EXPR_LITERAL_INTEGER:
8337 case EXPR_LITERAL_FLOATINGPOINT:
8338 case EXPR_STRING_LITERAL: return false;
8341 const call_expression_t *const call = &expr->call;
8342 if (call->function->kind != EXPR_REFERENCE)
8345 switch (call->function->reference.entity->function.btk) {
8346 /* FIXME: which builtins have no effect? */
8347 default: return true;
8351 /* Generate the warning if either the left or right hand side of a
8352 * conditional expression has no effect */
8353 case EXPR_CONDITIONAL: {
8354 conditional_expression_t const *const cond = &expr->conditional;
8355 expression_t const *const t = cond->true_expression;
8357 (t == NULL || expression_has_effect(t)) &&
8358 expression_has_effect(cond->false_expression);
8361 case EXPR_SELECT: return false;
8362 case EXPR_ARRAY_ACCESS: return false;
8363 case EXPR_SIZEOF: return false;
8364 case EXPR_CLASSIFY_TYPE: return false;
8365 case EXPR_ALIGNOF: return false;
8367 case EXPR_FUNCNAME: return false;
8368 case EXPR_BUILTIN_CONSTANT_P: return false;
8369 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8370 case EXPR_OFFSETOF: return false;
8371 case EXPR_VA_START: return true;
8372 case EXPR_VA_ARG: return true;
8373 case EXPR_VA_COPY: return true;
8374 case EXPR_STATEMENT: return true; // TODO
8375 case EXPR_COMPOUND_LITERAL: return false;
8377 case EXPR_UNARY_NEGATE: return false;
8378 case EXPR_UNARY_PLUS: return false;
8379 case EXPR_UNARY_BITWISE_NEGATE: return false;
8380 case EXPR_UNARY_NOT: return false;
8381 case EXPR_UNARY_DEREFERENCE: return false;
8382 case EXPR_UNARY_TAKE_ADDRESS: return false;
8383 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8384 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8385 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8386 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8388 /* Treat void casts as if they have an effect in order to being able to
8389 * suppress the warning */
8390 case EXPR_UNARY_CAST: {
8391 type_t *const type = skip_typeref(expr->base.type);
8392 return is_type_void(type);
8395 case EXPR_UNARY_ASSUME: return true;
8396 case EXPR_UNARY_DELETE: return true;
8397 case EXPR_UNARY_DELETE_ARRAY: return true;
8398 case EXPR_UNARY_THROW: return true;
8400 case EXPR_BINARY_ADD: return false;
8401 case EXPR_BINARY_SUB: return false;
8402 case EXPR_BINARY_MUL: return false;
8403 case EXPR_BINARY_DIV: return false;
8404 case EXPR_BINARY_MOD: return false;
8405 case EXPR_BINARY_EQUAL: return false;
8406 case EXPR_BINARY_NOTEQUAL: return false;
8407 case EXPR_BINARY_LESS: return false;
8408 case EXPR_BINARY_LESSEQUAL: return false;
8409 case EXPR_BINARY_GREATER: return false;
8410 case EXPR_BINARY_GREATEREQUAL: return false;
8411 case EXPR_BINARY_BITWISE_AND: return false;
8412 case EXPR_BINARY_BITWISE_OR: return false;
8413 case EXPR_BINARY_BITWISE_XOR: return false;
8414 case EXPR_BINARY_SHIFTLEFT: return false;
8415 case EXPR_BINARY_SHIFTRIGHT: return false;
8416 case EXPR_BINARY_ASSIGN: return true;
8417 case EXPR_BINARY_MUL_ASSIGN: return true;
8418 case EXPR_BINARY_DIV_ASSIGN: return true;
8419 case EXPR_BINARY_MOD_ASSIGN: return true;
8420 case EXPR_BINARY_ADD_ASSIGN: return true;
8421 case EXPR_BINARY_SUB_ASSIGN: return true;
8422 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8423 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8424 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8425 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8426 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8428 /* Only examine the right hand side of && and ||, because the left hand
8429 * side already has the effect of controlling the execution of the right
8431 case EXPR_BINARY_LOGICAL_AND:
8432 case EXPR_BINARY_LOGICAL_OR:
8433 /* Only examine the right hand side of a comma expression, because the left
8434 * hand side has a separate warning */
8435 case EXPR_BINARY_COMMA:
8436 return expression_has_effect(expr->binary.right);
8438 case EXPR_BINARY_ISGREATER: return false;
8439 case EXPR_BINARY_ISGREATEREQUAL: return false;
8440 case EXPR_BINARY_ISLESS: return false;
8441 case EXPR_BINARY_ISLESSEQUAL: return false;
8442 case EXPR_BINARY_ISLESSGREATER: return false;
8443 case EXPR_BINARY_ISUNORDERED: return false;
8446 internal_errorf(HERE, "unexpected expression");
8449 static void semantic_comma(binary_expression_t *expression)
8451 const expression_t *const left = expression->left;
8452 if (!expression_has_effect(left)) {
8453 source_position_t const *const pos = &left->base.source_position;
8454 warningf(WARN_UNUSED_VALUE, pos, "left-hand operand of comma expression has no effect");
8456 expression->base.type = expression->right->base.type;
8460 * @param prec_r precedence of the right operand
8462 #define CREATE_BINEXPR_PARSER(token_kind, binexpression_type, prec_r, sfunc) \
8463 static expression_t *parse_##binexpression_type(expression_t *left) \
8465 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8466 binexpr->binary.left = left; \
8469 expression_t *right = parse_subexpression(prec_r); \
8471 binexpr->binary.right = right; \
8472 sfunc(&binexpr->binary); \
8477 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8478 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
8479 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
8480 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8481 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8482 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8483 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8484 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
8485 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
8486 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
8487 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
8488 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
8489 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
8490 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_integer)
8491 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_integer)
8492 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_integer)
8493 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8494 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8495 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
8496 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8497 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8498 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8499 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8500 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8501 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8502 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8503 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8504 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8505 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8506 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
8509 static expression_t *parse_subexpression(precedence_t precedence)
8511 expression_parser_function_t *parser
8512 = &expression_parsers[token.kind];
8515 if (parser->parser != NULL) {
8516 left = parser->parser();
8518 left = parse_primary_expression();
8520 assert(left != NULL);
8523 parser = &expression_parsers[token.kind];
8524 if (parser->infix_parser == NULL)
8526 if (parser->infix_precedence < precedence)
8529 left = parser->infix_parser(left);
8531 assert(left != NULL);
8538 * Parse an expression.
8540 static expression_t *parse_expression(void)
8542 return parse_subexpression(PREC_EXPRESSION);
8546 * Register a parser for a prefix-like operator.
8548 * @param parser the parser function
8549 * @param token_kind the token type of the prefix token
8551 static void register_expression_parser(parse_expression_function parser,
8554 expression_parser_function_t *entry = &expression_parsers[token_kind];
8556 assert(!entry->parser);
8557 entry->parser = parser;
8561 * Register a parser for an infix operator with given precedence.
8563 * @param parser the parser function
8564 * @param token_kind the token type of the infix operator
8565 * @param precedence the precedence of the operator
8567 static void register_infix_parser(parse_expression_infix_function parser,
8568 int token_kind, precedence_t precedence)
8570 expression_parser_function_t *entry = &expression_parsers[token_kind];
8572 assert(!entry->infix_parser);
8573 entry->infix_parser = parser;
8574 entry->infix_precedence = precedence;
8578 * Initialize the expression parsers.
8580 static void init_expression_parsers(void)
8582 memset(&expression_parsers, 0, sizeof(expression_parsers));
8584 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
8585 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
8586 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
8587 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
8588 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
8589 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
8590 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
8591 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
8592 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
8593 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
8594 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
8595 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
8596 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
8597 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
8598 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
8599 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
8600 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
8601 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
8602 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
8603 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
8604 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
8605 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
8606 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
8607 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
8608 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
8609 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
8610 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
8611 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
8612 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
8613 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
8614 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
8615 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
8616 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
8617 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
8618 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
8619 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
8620 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
8622 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
8623 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
8624 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
8625 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
8626 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
8627 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
8628 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
8629 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
8630 register_expression_parser(parse_sizeof, T_sizeof);
8631 register_expression_parser(parse_alignof, T__Alignof);
8632 register_expression_parser(parse_extension, T___extension__);
8633 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
8634 register_expression_parser(parse_delete, T_delete);
8635 register_expression_parser(parse_throw, T_throw);
8639 * Parse a asm statement arguments specification.
8641 static void parse_asm_arguments(asm_argument_t **anchor, bool const is_out)
8643 while (token.kind == T_STRING_LITERAL || token.kind == '[') {
8644 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
8647 add_anchor_token(']');
8648 argument->symbol = expect_identifier("while parsing asm argument", NULL);
8649 rem_anchor_token(']');
8653 argument->constraints = parse_string_literals("asm argument");
8654 add_anchor_token(')');
8656 expression_t *expression = parse_expression();
8657 rem_anchor_token(')');
8659 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
8660 * change size or type representation (e.g. int -> long is ok, but
8661 * int -> float is not) */
8662 if (expression->kind == EXPR_UNARY_CAST) {
8663 type_t *const type = expression->base.type;
8664 type_kind_t const kind = type->kind;
8665 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
8668 if (kind == TYPE_ATOMIC) {
8669 atomic_type_kind_t const akind = type->atomic.akind;
8670 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8671 size = get_atomic_type_size(akind);
8673 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8674 size = get_type_size(type_void_ptr);
8678 expression_t *const value = expression->unary.value;
8679 type_t *const value_type = value->base.type;
8680 type_kind_t const value_kind = value_type->kind;
8682 unsigned value_flags;
8683 unsigned value_size;
8684 if (value_kind == TYPE_ATOMIC) {
8685 atomic_type_kind_t const value_akind = value_type->atomic.akind;
8686 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8687 value_size = get_atomic_type_size(value_akind);
8688 } else if (value_kind == TYPE_POINTER) {
8689 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8690 value_size = get_type_size(type_void_ptr);
8695 if (value_flags != flags || value_size != size)
8699 } while (expression->kind == EXPR_UNARY_CAST);
8703 if (!is_lvalue(expression)) {
8704 errorf(&expression->base.source_position,
8705 "asm output argument is not an lvalue");
8708 if (argument->constraints.begin[0] == '=')
8709 determine_lhs_ent(expression, NULL);
8711 mark_vars_read(expression, NULL);
8713 mark_vars_read(expression, NULL);
8715 argument->expression = expression;
8718 set_address_taken(expression, true);
8721 anchor = &argument->next;
8729 * Parse a asm statement clobber specification.
8731 static void parse_asm_clobbers(asm_clobber_t **anchor)
8733 while (token.kind == T_STRING_LITERAL) {
8734 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
8735 clobber->clobber = parse_string_literals(NULL);
8738 anchor = &clobber->next;
8746 * Parse an asm statement.
8748 static statement_t *parse_asm_statement(void)
8750 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
8751 asm_statement_t *asm_statement = &statement->asms;
8754 add_anchor_token(')');
8755 add_anchor_token(':');
8756 add_anchor_token(T_STRING_LITERAL);
8758 if (accept(T_volatile))
8759 asm_statement->is_volatile = true;
8762 rem_anchor_token(T_STRING_LITERAL);
8763 asm_statement->asm_text = parse_string_literals("asm statement");
8765 if (accept(':')) parse_asm_arguments(&asm_statement->outputs, true);
8766 if (accept(':')) parse_asm_arguments(&asm_statement->inputs, false);
8767 rem_anchor_token(':');
8768 if (accept(':')) parse_asm_clobbers( &asm_statement->clobbers);
8770 rem_anchor_token(')');
8774 if (asm_statement->outputs == NULL) {
8775 /* GCC: An 'asm' instruction without any output operands will be treated
8776 * identically to a volatile 'asm' instruction. */
8777 asm_statement->is_volatile = true;
8783 static statement_t *parse_label_inner_statement(statement_t const *const label, char const *const label_kind)
8785 statement_t *inner_stmt;
8786 switch (token.kind) {
8788 errorf(&label->base.source_position, "%s at end of compound statement", label_kind);
8789 inner_stmt = create_error_statement();
8793 if (label->kind == STATEMENT_LABEL) {
8794 /* Eat an empty statement here, to avoid the warning about an empty
8795 * statement after a label. label:; is commonly used to have a label
8796 * before a closing brace. */
8797 inner_stmt = create_empty_statement();
8804 inner_stmt = parse_statement();
8805 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
8806 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
8807 if (inner_stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
8808 errorf(&inner_stmt->base.source_position, "declaration after %s", label_kind);
8816 * Parse a case statement.
8818 static statement_t *parse_case_statement(void)
8820 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
8821 source_position_t *const pos = &statement->base.source_position;
8824 add_anchor_token(':');
8826 expression_t *expression = parse_expression();
8827 type_t *expression_type = expression->base.type;
8828 type_t *skipped = skip_typeref(expression_type);
8829 if (!is_type_integer(skipped) && is_type_valid(skipped)) {
8830 errorf(pos, "case expression '%E' must have integer type but has type '%T'",
8831 expression, expression_type);
8834 type_t *type = expression_type;
8835 if (current_switch != NULL) {
8836 type_t *switch_type = current_switch->expression->base.type;
8837 if (is_type_valid(switch_type)) {
8838 expression = create_implicit_cast(expression, switch_type);
8842 statement->case_label.expression = expression;
8843 expression_classification_t const expr_class = is_constant_expression(expression);
8844 if (expr_class != EXPR_CLASS_CONSTANT) {
8845 if (expr_class != EXPR_CLASS_ERROR) {
8846 errorf(pos, "case label does not reduce to an integer constant");
8848 statement->case_label.is_bad = true;
8850 ir_tarval *val = fold_constant_to_tarval(expression);
8851 statement->case_label.first_case = val;
8852 statement->case_label.last_case = val;
8856 if (accept(T_DOTDOTDOT)) {
8857 expression_t *end_range = parse_expression();
8858 expression_type = expression->base.type;
8859 skipped = skip_typeref(expression_type);
8860 if (!is_type_integer(skipped) && is_type_valid(skipped)) {
8861 errorf(pos, "case expression '%E' must have integer type but has type '%T'",
8862 expression, expression_type);
8865 end_range = create_implicit_cast(end_range, type);
8866 statement->case_label.end_range = end_range;
8867 expression_classification_t const end_class = is_constant_expression(end_range);
8868 if (end_class != EXPR_CLASS_CONSTANT) {
8869 if (end_class != EXPR_CLASS_ERROR) {
8870 errorf(pos, "case range does not reduce to an integer constant");
8872 statement->case_label.is_bad = true;
8874 ir_tarval *val = fold_constant_to_tarval(end_range);
8875 statement->case_label.last_case = val;
8877 if (tarval_cmp(val, statement->case_label.first_case)
8878 == ir_relation_less) {
8879 statement->case_label.is_empty_range = true;
8880 warningf(WARN_OTHER, pos, "empty range specified");
8886 PUSH_PARENT(statement);
8888 rem_anchor_token(':');
8891 if (current_switch != NULL) {
8892 if (! statement->case_label.is_bad) {
8893 /* Check for duplicate case values */
8894 case_label_statement_t *c = &statement->case_label;
8895 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
8896 if (l->is_bad || l->is_empty_range || l->expression == NULL)
8899 if (c->last_case < l->first_case || c->first_case > l->last_case)
8902 errorf(pos, "duplicate case value (previously used %P)",
8903 &l->base.source_position);
8907 /* link all cases into the switch statement */
8908 if (current_switch->last_case == NULL) {
8909 current_switch->first_case = &statement->case_label;
8911 current_switch->last_case->next = &statement->case_label;
8913 current_switch->last_case = &statement->case_label;
8915 errorf(pos, "case label not within a switch statement");
8918 statement->case_label.statement = parse_label_inner_statement(statement, "case label");
8925 * Parse a default statement.
8927 static statement_t *parse_default_statement(void)
8929 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
8933 PUSH_PARENT(statement);
8937 if (current_switch != NULL) {
8938 const case_label_statement_t *def_label = current_switch->default_label;
8939 if (def_label != NULL) {
8940 errorf(&statement->base.source_position, "multiple default labels in one switch (previous declared %P)", &def_label->base.source_position);
8942 current_switch->default_label = &statement->case_label;
8944 /* link all cases into the switch statement */
8945 if (current_switch->last_case == NULL) {
8946 current_switch->first_case = &statement->case_label;
8948 current_switch->last_case->next = &statement->case_label;
8950 current_switch->last_case = &statement->case_label;
8953 errorf(&statement->base.source_position,
8954 "'default' label not within a switch statement");
8957 statement->case_label.statement = parse_label_inner_statement(statement, "default label");
8964 * Parse a label statement.
8966 static statement_t *parse_label_statement(void)
8968 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
8969 label_t *const label = get_label(NULL /* Cannot fail, token is T_IDENTIFIER. */);
8970 statement->label.label = label;
8972 PUSH_PARENT(statement);
8974 /* if statement is already set then the label is defined twice,
8975 * otherwise it was just mentioned in a goto/local label declaration so far
8977 source_position_t const* const pos = &statement->base.source_position;
8978 if (label->statement != NULL) {
8979 errorf(pos, "duplicate '%N' (declared %P)", (entity_t const*)label, &label->base.source_position);
8981 label->base.source_position = *pos;
8982 label->statement = statement;
8983 label->n_users += 1;
8988 if (token.kind == T___attribute__ && !(c_mode & _CXX)) {
8989 parse_attributes(NULL); // TODO process attributes
8992 statement->label.statement = parse_label_inner_statement(statement, "label");
8994 /* remember the labels in a list for later checking */
8995 *label_anchor = &statement->label;
8996 label_anchor = &statement->label.next;
9002 static statement_t *parse_inner_statement(void)
9004 statement_t *const stmt = parse_statement();
9005 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
9006 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
9007 if (stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
9008 errorf(&stmt->base.source_position, "declaration as inner statement, use {}");
9014 * Parse an expression in parentheses and mark its variables as read.
9016 static expression_t *parse_condition(void)
9018 add_anchor_token(')');
9020 expression_t *const expr = parse_expression();
9021 mark_vars_read(expr, NULL);
9022 rem_anchor_token(')');
9028 * Parse an if statement.
9030 static statement_t *parse_if(void)
9032 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9036 PUSH_PARENT(statement);
9037 PUSH_SCOPE_STATEMENT(&statement->ifs.scope);
9039 add_anchor_token(T_else);
9041 expression_t *const expr = parse_condition();
9042 statement->ifs.condition = expr;
9043 /* §6.8.4.1:1 The controlling expression of an if statement shall have
9045 semantic_condition(expr, "condition of 'if'-statment");
9047 statement_t *const true_stmt = parse_inner_statement();
9048 statement->ifs.true_statement = true_stmt;
9049 rem_anchor_token(T_else);
9051 if (true_stmt->kind == STATEMENT_EMPTY) {
9052 warningf(WARN_EMPTY_BODY, HERE,
9053 "suggest braces around empty body in an ‘if’ statement");
9056 if (accept(T_else)) {
9057 statement->ifs.false_statement = parse_inner_statement();
9059 if (statement->ifs.false_statement->kind == STATEMENT_EMPTY) {
9060 warningf(WARN_EMPTY_BODY, HERE,
9061 "suggest braces around empty body in an ‘if’ statement");
9063 } else if (true_stmt->kind == STATEMENT_IF &&
9064 true_stmt->ifs.false_statement != NULL) {
9065 source_position_t const *const pos = &true_stmt->base.source_position;
9066 warningf(WARN_PARENTHESES, pos, "suggest explicit braces to avoid ambiguous 'else'");
9075 * Check that all enums are handled in a switch.
9077 * @param statement the switch statement to check
9079 static void check_enum_cases(const switch_statement_t *statement)
9081 if (!is_warn_on(WARN_SWITCH_ENUM))
9083 type_t *type = skip_typeref(statement->expression->base.type);
9084 if (! is_type_enum(type))
9086 enum_type_t *enumt = &type->enumt;
9088 /* if we have a default, no warnings */
9089 if (statement->default_label != NULL)
9092 determine_enum_values(enumt);
9094 /* FIXME: calculation of value should be done while parsing */
9095 /* TODO: quadratic algorithm here. Change to an n log n one */
9096 const entity_t *entry = enumt->enume->base.next;
9097 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9098 entry = entry->base.next) {
9099 ir_tarval *value = entry->enum_value.tv;
9101 for (const case_label_statement_t *l = statement->first_case; l != NULL;
9103 if (l->expression == NULL)
9105 if (l->first_case == l->last_case && l->first_case != value)
9107 if ((tarval_cmp(l->first_case, value) & ir_relation_less_equal)
9108 && (tarval_cmp(value, l->last_case) & ir_relation_less_equal)) {
9114 source_position_t const *const pos = &statement->base.source_position;
9115 warningf(WARN_SWITCH_ENUM, pos, "'%N' not handled in switch", entry);
9121 * Parse a switch statement.
9123 static statement_t *parse_switch(void)
9125 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9129 PUSH_PARENT(statement);
9130 PUSH_SCOPE_STATEMENT(&statement->switchs.scope);
9132 expression_t *const expr = parse_condition();
9133 type_t * type = skip_typeref(expr->base.type);
9134 if (is_type_integer(type)) {
9135 type = promote_integer(type);
9136 if (get_akind_rank(get_akind(type)) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9137 warningf(WARN_TRADITIONAL, &expr->base.source_position, "'%T' switch expression not converted to '%T' in ISO C", type, type_int);
9139 } else if (is_type_valid(type)) {
9140 errorf(&expr->base.source_position,
9141 "switch quantity is not an integer, but '%T'", type);
9142 type = type_error_type;
9144 statement->switchs.expression = create_implicit_cast(expr, type);
9146 switch_statement_t *rem = current_switch;
9147 current_switch = &statement->switchs;
9148 statement->switchs.body = parse_inner_statement();
9149 current_switch = rem;
9151 if (statement->switchs.default_label == NULL) {
9152 warningf(WARN_SWITCH_DEFAULT, &statement->base.source_position, "switch has no default case");
9154 check_enum_cases(&statement->switchs);
9161 static statement_t *parse_loop_body(statement_t *const loop)
9163 statement_t *const rem = current_loop;
9164 current_loop = loop;
9166 statement_t *const body = parse_inner_statement();
9173 * Parse a while statement.
9175 static statement_t *parse_while(void)
9177 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9181 PUSH_PARENT(statement);
9182 PUSH_SCOPE_STATEMENT(&statement->fors.scope);
9184 expression_t *const cond = parse_condition();
9185 statement->fors.condition = cond;
9186 /* §6.8.5:2 The controlling expression of an iteration statement shall
9187 * have scalar type. */
9188 semantic_condition(cond, "condition of 'while'-statement");
9190 statement->fors.body = parse_loop_body(statement);
9198 * Parse a do statement.
9200 static statement_t *parse_do(void)
9202 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9206 PUSH_PARENT(statement);
9207 PUSH_SCOPE_STATEMENT(&statement->do_while.scope);
9209 add_anchor_token(T_while);
9210 statement->do_while.body = parse_loop_body(statement);
9211 rem_anchor_token(T_while);
9214 expression_t *const cond = parse_condition();
9215 statement->do_while.condition = cond;
9216 /* §6.8.5:2 The controlling expression of an iteration statement shall
9217 * have scalar type. */
9218 semantic_condition(cond, "condition of 'do-while'-statement");
9227 * Parse a for statement.
9229 static statement_t *parse_for(void)
9231 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9235 PUSH_PARENT(statement);
9236 PUSH_SCOPE_STATEMENT(&statement->fors.scope);
9238 add_anchor_token(')');
9244 } else if (is_declaration_specifier(&token)) {
9245 parse_declaration(record_entity, DECL_FLAGS_NONE);
9247 add_anchor_token(';');
9248 expression_t *const init = parse_expression();
9249 statement->fors.initialisation = init;
9250 mark_vars_read(init, ENT_ANY);
9251 if (!expression_has_effect(init)) {
9252 warningf(WARN_UNUSED_VALUE, &init->base.source_position, "initialisation of 'for'-statement has no effect");
9254 rem_anchor_token(';');
9260 if (token.kind != ';') {
9261 add_anchor_token(';');
9262 expression_t *const cond = parse_expression();
9263 statement->fors.condition = cond;
9264 /* §6.8.5:2 The controlling expression of an iteration statement
9265 * shall have scalar type. */
9266 semantic_condition(cond, "condition of 'for'-statement");
9267 mark_vars_read(cond, NULL);
9268 rem_anchor_token(';');
9271 if (token.kind != ')') {
9272 expression_t *const step = parse_expression();
9273 statement->fors.step = step;
9274 mark_vars_read(step, ENT_ANY);
9275 if (!expression_has_effect(step)) {
9276 warningf(WARN_UNUSED_VALUE, &step->base.source_position, "step of 'for'-statement has no effect");
9279 rem_anchor_token(')');
9281 statement->fors.body = parse_loop_body(statement);
9289 * Parse a goto statement.
9291 static statement_t *parse_goto(void)
9293 statement_t *statement;
9294 if (GNU_MODE && look_ahead(1)->kind == '*') {
9295 statement = allocate_statement_zero(STATEMENT_COMPUTED_GOTO);
9299 expression_t *expression = parse_expression();
9300 mark_vars_read(expression, NULL);
9302 /* Argh: although documentation says the expression must be of type void*,
9303 * gcc accepts anything that can be casted into void* without error */
9304 type_t *type = expression->base.type;
9306 if (type != type_error_type) {
9307 if (!is_type_pointer(type) && !is_type_integer(type)) {
9308 errorf(&expression->base.source_position,
9309 "cannot convert to a pointer type");
9310 } else if (type != type_void_ptr) {
9311 warningf(WARN_OTHER, &expression->base.source_position, "type of computed goto expression should be 'void*' not '%T'", type);
9313 expression = create_implicit_cast(expression, type_void_ptr);
9316 statement->computed_goto.expression = expression;
9318 statement = allocate_statement_zero(STATEMENT_GOTO);
9321 label_t *const label = get_label("while parsing goto");
9323 label->n_users += 1;
9325 statement->gotos.label = label;
9327 /* remember the goto's in a list for later checking */
9328 *goto_anchor = &statement->gotos;
9329 goto_anchor = &statement->gotos.next;
9331 statement->gotos.label = &allocate_entity_zero(ENTITY_LABEL, NAMESPACE_LABEL, sym_anonymous, &builtin_source_position)->label;
9340 * Parse a continue statement.
9342 static statement_t *parse_continue(void)
9344 if (current_loop == NULL) {
9345 errorf(HERE, "continue statement not within loop");
9348 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9356 * Parse a break statement.
9358 static statement_t *parse_break(void)
9360 if (current_switch == NULL && current_loop == NULL) {
9361 errorf(HERE, "break statement not within loop or switch");
9364 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9372 * Parse a __leave statement.
9374 static statement_t *parse_leave_statement(void)
9376 if (current_try == NULL) {
9377 errorf(HERE, "__leave statement not within __try");
9380 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9388 * Check if a given entity represents a local variable.
9390 static bool is_local_variable(const entity_t *entity)
9392 if (entity->kind != ENTITY_VARIABLE)
9395 switch ((storage_class_tag_t) entity->declaration.storage_class) {
9396 case STORAGE_CLASS_AUTO:
9397 case STORAGE_CLASS_REGISTER: {
9398 const type_t *type = skip_typeref(entity->declaration.type);
9399 if (is_type_function(type)) {
9411 * Check if a given expression represents a local variable.
9413 static bool expression_is_local_variable(const expression_t *expression)
9415 if (expression->base.kind != EXPR_REFERENCE) {
9418 const entity_t *entity = expression->reference.entity;
9419 return is_local_variable(entity);
9422 static void err_or_warn(source_position_t const *const pos, char const *const msg)
9424 if (c_mode & _CXX || strict_mode) {
9427 warningf(WARN_OTHER, pos, msg);
9432 * Parse a return statement.
9434 static statement_t *parse_return(void)
9436 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9439 expression_t *return_value = NULL;
9440 if (token.kind != ';') {
9441 return_value = parse_expression();
9442 mark_vars_read(return_value, NULL);
9445 const type_t *const func_type = skip_typeref(current_function->base.type);
9446 assert(is_type_function(func_type));
9447 type_t *const return_type = skip_typeref(func_type->function.return_type);
9449 source_position_t const *const pos = &statement->base.source_position;
9450 if (return_value != NULL) {
9451 type_t *return_value_type = skip_typeref(return_value->base.type);
9453 if (is_type_void(return_type)) {
9454 if (!is_type_void(return_value_type)) {
9455 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
9456 /* Only warn in C mode, because GCC does the same */
9457 err_or_warn(pos, "'return' with a value, in function returning 'void'");
9458 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9459 /* Only warn in C mode, because GCC does the same */
9460 err_or_warn(pos, "'return' with expression in function returning 'void'");
9463 assign_error_t error = semantic_assign(return_type, return_value);
9464 report_assign_error(error, return_type, return_value, "'return'",
9467 return_value = create_implicit_cast(return_value, return_type);
9468 /* check for returning address of a local var */
9469 if (return_value != NULL && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
9470 const expression_t *expression = return_value->unary.value;
9471 if (expression_is_local_variable(expression)) {
9472 warningf(WARN_OTHER, pos, "function returns address of local variable");
9475 } else if (!is_type_void(return_type)) {
9476 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9477 err_or_warn(pos, "'return' without value, in function returning non-void");
9479 statement->returns.value = return_value;
9486 * Parse a declaration statement.
9488 static statement_t *parse_declaration_statement(void)
9490 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9492 entity_t *before = current_scope->last_entity;
9494 parse_external_declaration();
9496 parse_declaration(record_entity, DECL_FLAGS_NONE);
9499 declaration_statement_t *const decl = &statement->declaration;
9500 entity_t *const begin =
9501 before != NULL ? before->base.next : current_scope->entities;
9502 decl->declarations_begin = begin;
9503 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
9509 * Parse an expression statement, ie. expr ';'.
9511 static statement_t *parse_expression_statement(void)
9513 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
9515 expression_t *const expr = parse_expression();
9516 statement->expression.expression = expr;
9517 mark_vars_read(expr, ENT_ANY);
9524 * Parse a microsoft __try { } __finally { } or
9525 * __try{ } __except() { }
9527 static statement_t *parse_ms_try_statment(void)
9529 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
9532 PUSH_PARENT(statement);
9534 ms_try_statement_t *rem = current_try;
9535 current_try = &statement->ms_try;
9536 statement->ms_try.try_statement = parse_compound_statement(false);
9541 if (accept(T___except)) {
9542 expression_t *const expr = parse_condition();
9543 type_t * type = skip_typeref(expr->base.type);
9544 if (is_type_integer(type)) {
9545 type = promote_integer(type);
9546 } else if (is_type_valid(type)) {
9547 errorf(&expr->base.source_position,
9548 "__expect expression is not an integer, but '%T'", type);
9549 type = type_error_type;
9551 statement->ms_try.except_expression = create_implicit_cast(expr, type);
9552 } else if (!accept(T__finally)) {
9553 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
9555 statement->ms_try.final_statement = parse_compound_statement(false);
9559 static statement_t *parse_empty_statement(void)
9561 warningf(WARN_EMPTY_STATEMENT, HERE, "statement is empty");
9562 statement_t *const statement = create_empty_statement();
9567 static statement_t *parse_local_label_declaration(void)
9569 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9573 entity_t *begin = NULL;
9574 entity_t *end = NULL;
9575 entity_t **anchor = &begin;
9576 add_anchor_token(';');
9577 add_anchor_token(',');
9579 source_position_t pos;
9580 symbol_t *const symbol = expect_identifier("while parsing local label declaration", &pos);
9582 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
9583 if (entity != NULL && entity->base.parent_scope == current_scope) {
9584 source_position_t const *const ppos = &entity->base.source_position;
9585 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
9587 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL, NAMESPACE_LABEL, symbol, &pos);
9588 entity->base.parent_scope = current_scope;
9591 anchor = &entity->base.next;
9594 environment_push(entity);
9597 } while (accept(','));
9598 rem_anchor_token(',');
9599 rem_anchor_token(';');
9601 statement->declaration.declarations_begin = begin;
9602 statement->declaration.declarations_end = end;
9606 static void parse_namespace_definition(void)
9610 entity_t *entity = NULL;
9611 symbol_t *symbol = NULL;
9613 if (token.kind == T_IDENTIFIER) {
9614 symbol = token.base.symbol;
9615 entity = get_entity(symbol, NAMESPACE_NORMAL);
9616 if (entity && entity->kind != ENTITY_NAMESPACE) {
9618 if (entity->base.parent_scope == current_scope && is_entity_valid(entity)) {
9619 error_redefined_as_different_kind(HERE, entity, ENTITY_NAMESPACE);
9625 if (entity == NULL) {
9626 entity = allocate_entity_zero(ENTITY_NAMESPACE, NAMESPACE_NORMAL, symbol, HERE);
9627 entity->base.parent_scope = current_scope;
9630 if (token.kind == '=') {
9631 /* TODO: parse namespace alias */
9632 panic("namespace alias definition not supported yet");
9635 environment_push(entity);
9636 append_entity(current_scope, entity);
9638 PUSH_SCOPE(&entity->namespacee.members);
9639 PUSH_CURRENT_ENTITY(entity);
9641 add_anchor_token('}');
9644 rem_anchor_token('}');
9647 POP_CURRENT_ENTITY();
9652 * Parse a statement.
9653 * There's also parse_statement() which additionally checks for
9654 * "statement has no effect" warnings
9656 static statement_t *intern_parse_statement(void)
9658 /* declaration or statement */
9659 statement_t *statement;
9660 switch (token.kind) {
9661 case T_IDENTIFIER: {
9662 token_kind_t la1_type = (token_kind_t)look_ahead(1)->kind;
9663 if (la1_type == ':') {
9664 statement = parse_label_statement();
9665 } else if (is_typedef_symbol(token.base.symbol)) {
9666 statement = parse_declaration_statement();
9668 /* it's an identifier, the grammar says this must be an
9669 * expression statement. However it is common that users mistype
9670 * declaration types, so we guess a bit here to improve robustness
9671 * for incorrect programs */
9675 if (get_entity(token.base.symbol, NAMESPACE_NORMAL) != NULL) {
9677 statement = parse_expression_statement();
9681 statement = parse_declaration_statement();
9689 case T___extension__: {
9690 /* This can be a prefix to a declaration or an expression statement.
9691 * We simply eat it now and parse the rest with tail recursion. */
9693 statement = intern_parse_statement();
9699 statement = parse_declaration_statement();
9703 statement = parse_local_label_declaration();
9706 case ';': statement = parse_empty_statement(); break;
9707 case '{': statement = parse_compound_statement(false); break;
9708 case T___leave: statement = parse_leave_statement(); break;
9709 case T___try: statement = parse_ms_try_statment(); break;
9710 case T_asm: statement = parse_asm_statement(); break;
9711 case T_break: statement = parse_break(); break;
9712 case T_case: statement = parse_case_statement(); break;
9713 case T_continue: statement = parse_continue(); break;
9714 case T_default: statement = parse_default_statement(); break;
9715 case T_do: statement = parse_do(); break;
9716 case T_for: statement = parse_for(); break;
9717 case T_goto: statement = parse_goto(); break;
9718 case T_if: statement = parse_if(); break;
9719 case T_return: statement = parse_return(); break;
9720 case T_switch: statement = parse_switch(); break;
9721 case T_while: statement = parse_while(); break;
9724 statement = parse_expression_statement();
9728 errorf(HERE, "unexpected token %K while parsing statement", &token);
9729 statement = create_error_statement();
9738 * parse a statement and emits "statement has no effect" warning if needed
9739 * (This is really a wrapper around intern_parse_statement with check for 1
9740 * single warning. It is needed, because for statement expressions we have
9741 * to avoid the warning on the last statement)
9743 static statement_t *parse_statement(void)
9745 statement_t *statement = intern_parse_statement();
9747 if (statement->kind == STATEMENT_EXPRESSION) {
9748 expression_t *expression = statement->expression.expression;
9749 if (!expression_has_effect(expression)) {
9750 warningf(WARN_UNUSED_VALUE, &expression->base.source_position, "statement has no effect");
9758 * Parse a compound statement.
9760 static statement_t *parse_compound_statement(bool inside_expression_statement)
9762 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
9764 PUSH_PARENT(statement);
9765 PUSH_SCOPE(&statement->compound.scope);
9768 add_anchor_token('}');
9769 /* tokens, which can start a statement */
9770 /* TODO MS, __builtin_FOO */
9771 add_anchor_token('!');
9772 add_anchor_token('&');
9773 add_anchor_token('(');
9774 add_anchor_token('*');
9775 add_anchor_token('+');
9776 add_anchor_token('-');
9777 add_anchor_token(';');
9778 add_anchor_token('{');
9779 add_anchor_token('~');
9780 add_anchor_token(T_CHARACTER_CONSTANT);
9781 add_anchor_token(T_COLONCOLON);
9782 add_anchor_token(T_IDENTIFIER);
9783 add_anchor_token(T_MINUSMINUS);
9784 add_anchor_token(T_NUMBER);
9785 add_anchor_token(T_PLUSPLUS);
9786 add_anchor_token(T_STRING_LITERAL);
9787 add_anchor_token(T__Alignof);
9788 add_anchor_token(T__Bool);
9789 add_anchor_token(T__Complex);
9790 add_anchor_token(T__Imaginary);
9791 add_anchor_token(T__Thread_local);
9792 add_anchor_token(T___PRETTY_FUNCTION__);
9793 add_anchor_token(T___attribute__);
9794 add_anchor_token(T___builtin_va_start);
9795 add_anchor_token(T___extension__);
9796 add_anchor_token(T___func__);
9797 add_anchor_token(T___imag__);
9798 add_anchor_token(T___label__);
9799 add_anchor_token(T___real__);
9800 add_anchor_token(T_asm);
9801 add_anchor_token(T_auto);
9802 add_anchor_token(T_bool);
9803 add_anchor_token(T_break);
9804 add_anchor_token(T_case);
9805 add_anchor_token(T_char);
9806 add_anchor_token(T_class);
9807 add_anchor_token(T_const);
9808 add_anchor_token(T_const_cast);
9809 add_anchor_token(T_continue);
9810 add_anchor_token(T_default);
9811 add_anchor_token(T_delete);
9812 add_anchor_token(T_double);
9813 add_anchor_token(T_do);
9814 add_anchor_token(T_dynamic_cast);
9815 add_anchor_token(T_enum);
9816 add_anchor_token(T_extern);
9817 add_anchor_token(T_false);
9818 add_anchor_token(T_float);
9819 add_anchor_token(T_for);
9820 add_anchor_token(T_goto);
9821 add_anchor_token(T_if);
9822 add_anchor_token(T_inline);
9823 add_anchor_token(T_int);
9824 add_anchor_token(T_long);
9825 add_anchor_token(T_new);
9826 add_anchor_token(T_operator);
9827 add_anchor_token(T_register);
9828 add_anchor_token(T_reinterpret_cast);
9829 add_anchor_token(T_restrict);
9830 add_anchor_token(T_return);
9831 add_anchor_token(T_short);
9832 add_anchor_token(T_signed);
9833 add_anchor_token(T_sizeof);
9834 add_anchor_token(T_static);
9835 add_anchor_token(T_static_cast);
9836 add_anchor_token(T_struct);
9837 add_anchor_token(T_switch);
9838 add_anchor_token(T_template);
9839 add_anchor_token(T_this);
9840 add_anchor_token(T_throw);
9841 add_anchor_token(T_true);
9842 add_anchor_token(T_try);
9843 add_anchor_token(T_typedef);
9844 add_anchor_token(T_typeid);
9845 add_anchor_token(T_typename);
9846 add_anchor_token(T_typeof);
9847 add_anchor_token(T_union);
9848 add_anchor_token(T_unsigned);
9849 add_anchor_token(T_using);
9850 add_anchor_token(T_void);
9851 add_anchor_token(T_volatile);
9852 add_anchor_token(T_wchar_t);
9853 add_anchor_token(T_while);
9855 statement_t **anchor = &statement->compound.statements;
9856 bool only_decls_so_far = true;
9857 while (token.kind != '}' && token.kind != T_EOF) {
9858 statement_t *sub_statement = intern_parse_statement();
9859 if (sub_statement->kind == STATEMENT_ERROR) {
9863 if (sub_statement->kind != STATEMENT_DECLARATION) {
9864 only_decls_so_far = false;
9865 } else if (!only_decls_so_far) {
9866 source_position_t const *const pos = &sub_statement->base.source_position;
9867 warningf(WARN_DECLARATION_AFTER_STATEMENT, pos, "ISO C90 forbids mixed declarations and code");
9870 *anchor = sub_statement;
9871 anchor = &sub_statement->base.next;
9875 /* look over all statements again to produce no effect warnings */
9876 if (is_warn_on(WARN_UNUSED_VALUE)) {
9877 statement_t *sub_statement = statement->compound.statements;
9878 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
9879 if (sub_statement->kind != STATEMENT_EXPRESSION)
9881 /* don't emit a warning for the last expression in an expression
9882 * statement as it has always an effect */
9883 if (inside_expression_statement && sub_statement->base.next == NULL)
9886 expression_t *expression = sub_statement->expression.expression;
9887 if (!expression_has_effect(expression)) {
9888 warningf(WARN_UNUSED_VALUE, &expression->base.source_position, "statement has no effect");
9893 rem_anchor_token(T_while);
9894 rem_anchor_token(T_wchar_t);
9895 rem_anchor_token(T_volatile);
9896 rem_anchor_token(T_void);
9897 rem_anchor_token(T_using);
9898 rem_anchor_token(T_unsigned);
9899 rem_anchor_token(T_union);
9900 rem_anchor_token(T_typeof);
9901 rem_anchor_token(T_typename);
9902 rem_anchor_token(T_typeid);
9903 rem_anchor_token(T_typedef);
9904 rem_anchor_token(T_try);
9905 rem_anchor_token(T_true);
9906 rem_anchor_token(T_throw);
9907 rem_anchor_token(T_this);
9908 rem_anchor_token(T_template);
9909 rem_anchor_token(T_switch);
9910 rem_anchor_token(T_struct);
9911 rem_anchor_token(T_static_cast);
9912 rem_anchor_token(T_static);
9913 rem_anchor_token(T_sizeof);
9914 rem_anchor_token(T_signed);
9915 rem_anchor_token(T_short);
9916 rem_anchor_token(T_return);
9917 rem_anchor_token(T_restrict);
9918 rem_anchor_token(T_reinterpret_cast);
9919 rem_anchor_token(T_register);
9920 rem_anchor_token(T_operator);
9921 rem_anchor_token(T_new);
9922 rem_anchor_token(T_long);
9923 rem_anchor_token(T_int);
9924 rem_anchor_token(T_inline);
9925 rem_anchor_token(T_if);
9926 rem_anchor_token(T_goto);
9927 rem_anchor_token(T_for);
9928 rem_anchor_token(T_float);
9929 rem_anchor_token(T_false);
9930 rem_anchor_token(T_extern);
9931 rem_anchor_token(T_enum);
9932 rem_anchor_token(T_dynamic_cast);
9933 rem_anchor_token(T_do);
9934 rem_anchor_token(T_double);
9935 rem_anchor_token(T_delete);
9936 rem_anchor_token(T_default);
9937 rem_anchor_token(T_continue);
9938 rem_anchor_token(T_const_cast);
9939 rem_anchor_token(T_const);
9940 rem_anchor_token(T_class);
9941 rem_anchor_token(T_char);
9942 rem_anchor_token(T_case);
9943 rem_anchor_token(T_break);
9944 rem_anchor_token(T_bool);
9945 rem_anchor_token(T_auto);
9946 rem_anchor_token(T_asm);
9947 rem_anchor_token(T___real__);
9948 rem_anchor_token(T___label__);
9949 rem_anchor_token(T___imag__);
9950 rem_anchor_token(T___func__);
9951 rem_anchor_token(T___extension__);
9952 rem_anchor_token(T___builtin_va_start);
9953 rem_anchor_token(T___attribute__);
9954 rem_anchor_token(T___PRETTY_FUNCTION__);
9955 rem_anchor_token(T__Thread_local);
9956 rem_anchor_token(T__Imaginary);
9957 rem_anchor_token(T__Complex);
9958 rem_anchor_token(T__Bool);
9959 rem_anchor_token(T__Alignof);
9960 rem_anchor_token(T_STRING_LITERAL);
9961 rem_anchor_token(T_PLUSPLUS);
9962 rem_anchor_token(T_NUMBER);
9963 rem_anchor_token(T_MINUSMINUS);
9964 rem_anchor_token(T_IDENTIFIER);
9965 rem_anchor_token(T_COLONCOLON);
9966 rem_anchor_token(T_CHARACTER_CONSTANT);
9967 rem_anchor_token('~');
9968 rem_anchor_token('{');
9969 rem_anchor_token(';');
9970 rem_anchor_token('-');
9971 rem_anchor_token('+');
9972 rem_anchor_token('*');
9973 rem_anchor_token('(');
9974 rem_anchor_token('&');
9975 rem_anchor_token('!');
9976 rem_anchor_token('}');
9984 * Check for unused global static functions and variables
9986 static void check_unused_globals(void)
9988 if (!is_warn_on(WARN_UNUSED_FUNCTION) && !is_warn_on(WARN_UNUSED_VARIABLE))
9991 for (const entity_t *entity = file_scope->entities; entity != NULL;
9992 entity = entity->base.next) {
9993 if (!is_declaration(entity))
9996 const declaration_t *declaration = &entity->declaration;
9997 if (declaration->used ||
9998 declaration->modifiers & DM_UNUSED ||
9999 declaration->modifiers & DM_USED ||
10000 declaration->storage_class != STORAGE_CLASS_STATIC)
10005 if (entity->kind == ENTITY_FUNCTION) {
10006 /* inhibit warning for static inline functions */
10007 if (entity->function.is_inline)
10010 why = WARN_UNUSED_FUNCTION;
10011 s = entity->function.body != NULL ? "defined" : "declared";
10013 why = WARN_UNUSED_VARIABLE;
10017 warningf(why, &declaration->base.source_position, "'%#N' %s but not used", entity, s);
10021 static void parse_global_asm(void)
10023 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10026 add_anchor_token(';');
10027 add_anchor_token(')');
10028 add_anchor_token(T_STRING_LITERAL);
10031 rem_anchor_token(T_STRING_LITERAL);
10032 statement->asms.asm_text = parse_string_literals("global asm");
10033 statement->base.next = unit->global_asm;
10034 unit->global_asm = statement;
10036 rem_anchor_token(')');
10038 rem_anchor_token(';');
10042 static void parse_linkage_specification(void)
10046 source_position_t const pos = *HERE;
10047 char const *const linkage = parse_string_literals(NULL).begin;
10049 linkage_kind_t old_linkage = current_linkage;
10050 linkage_kind_t new_linkage;
10051 if (streq(linkage, "C")) {
10052 new_linkage = LINKAGE_C;
10053 } else if (streq(linkage, "C++")) {
10054 new_linkage = LINKAGE_CXX;
10056 errorf(&pos, "linkage string \"%s\" not recognized", linkage);
10057 new_linkage = LINKAGE_C;
10059 current_linkage = new_linkage;
10068 assert(current_linkage == new_linkage);
10069 current_linkage = old_linkage;
10072 static void parse_external(void)
10074 switch (token.kind) {
10076 if (look_ahead(1)->kind == T_STRING_LITERAL) {
10077 parse_linkage_specification();
10079 DECLARATION_START_NO_EXTERN
10081 case T___extension__:
10082 /* tokens below are for implicit int */
10083 case '&': /* & x; -> int& x; (and error later, because C++ has no
10085 case '*': /* * x; -> int* x; */
10086 case '(': /* (x); -> int (x); */
10088 parse_external_declaration();
10094 parse_global_asm();
10098 parse_namespace_definition();
10102 if (!strict_mode) {
10103 warningf(WARN_STRAY_SEMICOLON, HERE, "stray ';' outside of function");
10110 errorf(HERE, "stray %K outside of function", &token);
10111 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10112 eat_until_matching_token(token.kind);
10118 static void parse_externals(void)
10120 add_anchor_token('}');
10121 add_anchor_token(T_EOF);
10124 /* make a copy of the anchor set, so we can check if it is restored after parsing */
10125 unsigned short token_anchor_copy[T_LAST_TOKEN];
10126 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10129 while (token.kind != T_EOF && token.kind != '}') {
10131 for (int i = 0; i < T_LAST_TOKEN; ++i) {
10132 unsigned short count = token_anchor_set[i] - token_anchor_copy[i];
10134 /* the anchor set and its copy differs */
10135 internal_errorf(HERE, "Leaked anchor token %k %d times", i, count);
10138 if (in_gcc_extension) {
10139 /* an gcc extension scope was not closed */
10140 internal_errorf(HERE, "Leaked __extension__");
10147 rem_anchor_token(T_EOF);
10148 rem_anchor_token('}');
10152 * Parse a translation unit.
10154 static void parse_translation_unit(void)
10156 add_anchor_token(T_EOF);
10161 if (token.kind == T_EOF)
10164 errorf(HERE, "stray %K outside of function", &token);
10165 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10166 eat_until_matching_token(token.kind);
10171 void set_default_visibility(elf_visibility_tag_t visibility)
10173 default_visibility = visibility;
10179 * @return the translation unit or NULL if errors occurred.
10181 void start_parsing(void)
10183 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10184 label_stack = NEW_ARR_F(stack_entry_t, 0);
10186 print_to_file(stderr);
10188 assert(unit == NULL);
10189 unit = allocate_ast_zero(sizeof(unit[0]));
10191 assert(file_scope == NULL);
10192 file_scope = &unit->scope;
10194 assert(current_scope == NULL);
10195 scope_push(&unit->scope);
10197 create_gnu_builtins();
10199 create_microsoft_intrinsics();
10202 translation_unit_t *finish_parsing(void)
10204 assert(current_scope == &unit->scope);
10207 assert(file_scope == &unit->scope);
10208 check_unused_globals();
10211 DEL_ARR_F(environment_stack);
10212 DEL_ARR_F(label_stack);
10214 translation_unit_t *result = unit;
10219 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
10220 * are given length one. */
10221 static void complete_incomplete_arrays(void)
10223 size_t n = ARR_LEN(incomplete_arrays);
10224 for (size_t i = 0; i != n; ++i) {
10225 declaration_t *const decl = incomplete_arrays[i];
10226 type_t *const type = skip_typeref(decl->type);
10228 if (!is_type_incomplete(type))
10231 source_position_t const *const pos = &decl->base.source_position;
10232 warningf(WARN_OTHER, pos, "array '%#N' assumed to have one element", (entity_t const*)decl);
10234 type_t *const new_type = duplicate_type(type);
10235 new_type->array.size_constant = true;
10236 new_type->array.has_implicit_size = true;
10237 new_type->array.size = 1;
10239 type_t *const result = identify_new_type(new_type);
10241 decl->type = result;
10245 static void prepare_main_collect2(entity_t *const entity)
10247 PUSH_SCOPE(&entity->function.body->compound.scope);
10249 // create call to __main
10250 symbol_t *symbol = symbol_table_insert("__main");
10251 entity_t *subsubmain_ent
10252 = create_implicit_function(symbol, &builtin_source_position);
10254 expression_t *ref = allocate_expression_zero(EXPR_REFERENCE);
10255 type_t *ftype = subsubmain_ent->declaration.type;
10256 ref->base.source_position = builtin_source_position;
10257 ref->base.type = make_pointer_type(ftype, TYPE_QUALIFIER_NONE);
10258 ref->reference.entity = subsubmain_ent;
10260 expression_t *call = allocate_expression_zero(EXPR_CALL);
10261 call->base.source_position = builtin_source_position;
10262 call->base.type = type_void;
10263 call->call.function = ref;
10265 statement_t *expr_statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10266 expr_statement->base.source_position = builtin_source_position;
10267 expr_statement->expression.expression = call;
10269 statement_t *const body = entity->function.body;
10270 assert(body->kind == STATEMENT_COMPOUND);
10271 compound_statement_t *compounds = &body->compound;
10273 expr_statement->base.next = compounds->statements;
10274 compounds->statements = expr_statement;
10281 lookahead_bufpos = 0;
10282 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10285 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
10286 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
10287 parse_translation_unit();
10288 complete_incomplete_arrays();
10289 DEL_ARR_F(incomplete_arrays);
10290 incomplete_arrays = NULL;
10294 * Initialize the parser.
10296 void init_parser(void)
10298 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10300 init_expression_parsers();
10301 obstack_init(&temp_obst);
10305 * Terminate the parser.
10307 void exit_parser(void)
10309 obstack_free(&temp_obst, NULL);