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 {
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.pos)
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.pos = *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.pos = *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 position_t *pos, type_t *type1, type_t *type2)
633 errorf(pos, "%s, incompatible types: '%T' - '%T'", msg, type1, type2);
636 static bool skip_till(token_kind_t const expected, char const *const context)
638 if (UNLIKELY(token.kind != expected)) {
639 parse_error_expected(context, expected, NULL);
640 add_anchor_token(expected);
642 rem_anchor_token(expected);
643 if (token.kind != expected)
650 * Expect the current token is the expected token.
651 * If not, generate an error and skip until the next anchor.
653 static void expect(token_kind_t const expected)
655 if (skip_till(expected, NULL))
659 static symbol_t *expect_identifier(char const *const context,
660 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.pos);
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.pos.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 = skip_typeref(expression->base.type);
901 if (source_type == skip_typeref(dest_type))
904 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
905 cast->unary.value = expression;
906 cast->base.type = dest_type;
907 cast->base.implicit = true;
912 typedef enum assign_error_t {
914 ASSIGN_ERROR_INCOMPATIBLE,
915 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
916 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
917 ASSIGN_WARNING_POINTER_FROM_INT,
918 ASSIGN_WARNING_INT_FROM_POINTER
921 static void report_assign_error(assign_error_t error, type_t *orig_type_left, expression_t const *const right, char const *const context, position_t const *const pos)
923 type_t *const orig_type_right = right->base.type;
924 type_t *const type_left = skip_typeref(orig_type_left);
925 type_t *const type_right = skip_typeref(orig_type_right);
930 case ASSIGN_ERROR_INCOMPATIBLE:
931 errorf(pos, "destination type '%T' in %s is incompatible with type '%T'", orig_type_left, context, orig_type_right);
934 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
935 type_t *points_to_left = skip_typeref(type_left->pointer.points_to);
936 type_t *points_to_right = skip_typeref(type_right->pointer.points_to);
938 /* the left type has all qualifiers from the right type */
939 unsigned missing_qualifiers = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
940 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);
944 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
945 warningf(WARN_OTHER, pos, "destination type '%T' in %s is incompatible with '%E' of type '%T'", orig_type_left, context, right, orig_type_right);
948 case ASSIGN_WARNING_POINTER_FROM_INT:
949 warningf(WARN_OTHER, pos, "%s makes pointer '%T' from integer '%T' without a cast", context, orig_type_left, orig_type_right);
952 case ASSIGN_WARNING_INT_FROM_POINTER:
953 warningf(WARN_OTHER, pos, "%s makes integer '%T' from pointer '%T' without a cast", context, orig_type_left, orig_type_right);
957 panic("invalid error value");
961 /** Implements the rules from §6.5.16.1 */
962 static assign_error_t semantic_assign(type_t *orig_type_left,
963 const expression_t *const right)
965 type_t *const orig_type_right = right->base.type;
966 type_t *const type_left = skip_typeref(orig_type_left);
967 type_t *const type_right = skip_typeref(orig_type_right);
969 if (is_type_pointer(type_left)) {
970 if (is_null_pointer_constant(right)) {
971 return ASSIGN_SUCCESS;
972 } else if (is_type_pointer(type_right)) {
973 type_t *points_to_left
974 = skip_typeref(type_left->pointer.points_to);
975 type_t *points_to_right
976 = skip_typeref(type_right->pointer.points_to);
977 assign_error_t res = ASSIGN_SUCCESS;
979 /* the left type has all qualifiers from the right type */
980 unsigned missing_qualifiers
981 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
982 if (missing_qualifiers != 0) {
983 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
986 points_to_left = get_unqualified_type(points_to_left);
987 points_to_right = get_unqualified_type(points_to_right);
989 if (is_type_void(points_to_left))
992 if (is_type_void(points_to_right)) {
993 /* ISO/IEC 14882:1998(E) §C.1.2:6 */
994 return c_mode & _CXX ? ASSIGN_ERROR_INCOMPATIBLE : res;
997 if (!types_compatible(points_to_left, points_to_right)) {
998 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
1002 } else if (is_type_integer(type_right)) {
1003 return ASSIGN_WARNING_POINTER_FROM_INT;
1005 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1006 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1007 && is_type_pointer(type_right))) {
1008 return ASSIGN_SUCCESS;
1009 } else if (is_type_compound(type_left) && is_type_compound(type_right)) {
1010 type_t *const unqual_type_left = get_unqualified_type(type_left);
1011 type_t *const unqual_type_right = get_unqualified_type(type_right);
1012 if (types_compatible(unqual_type_left, unqual_type_right)) {
1013 return ASSIGN_SUCCESS;
1015 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1016 return ASSIGN_WARNING_INT_FROM_POINTER;
1019 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1020 return ASSIGN_SUCCESS;
1022 return ASSIGN_ERROR_INCOMPATIBLE;
1025 static expression_t *parse_constant_expression(void)
1027 expression_t *result = parse_subexpression(PREC_CONDITIONAL);
1029 if (is_constant_expression(result) == EXPR_CLASS_VARIABLE) {
1030 errorf(&result->base.pos, "expression '%E' is not constant", result);
1036 static expression_t *parse_assignment_expression(void)
1038 return parse_subexpression(PREC_ASSIGNMENT);
1041 static void append_string(string_t const *const s)
1043 /* FIXME Using the ast_obstack is a hack. Using the symbol_obstack is not
1044 * possible, because other tokens are grown there alongside. */
1045 obstack_grow(&ast_obstack, s->begin, s->size);
1048 static string_t finish_string(string_encoding_t const enc)
1050 obstack_1grow(&ast_obstack, '\0');
1051 size_t const size = obstack_object_size(&ast_obstack) - 1;
1052 char const *const string = obstack_finish(&ast_obstack);
1053 return (string_t){ string, size, enc };
1056 static string_t concat_string_literals(void)
1058 assert(token.kind == T_STRING_LITERAL);
1061 if (look_ahead(1)->kind == T_STRING_LITERAL) {
1062 append_string(&token.literal.string);
1063 eat(T_STRING_LITERAL);
1064 warningf(WARN_TRADITIONAL, HERE, "traditional C rejects string constant concatenation");
1065 string_encoding_t enc = token.literal.string.encoding;
1067 string_encoding_t const new_enc = token.literal.string.encoding;
1068 if (new_enc != enc && new_enc != STRING_ENCODING_CHAR) {
1069 if (enc == STRING_ENCODING_CHAR) {
1072 errorf(HERE, "concatenating string literals with encodings %s and %s", get_string_encoding_prefix(enc), get_string_encoding_prefix(new_enc));
1075 append_string(&token.literal.string);
1076 eat(T_STRING_LITERAL);
1077 } while (token.kind == T_STRING_LITERAL);
1078 result = finish_string(enc);
1080 result = token.literal.string;
1081 eat(T_STRING_LITERAL);
1087 static string_t parse_string_literals(char const *const context)
1089 if (!skip_till(T_STRING_LITERAL, context))
1090 return (string_t){ "", 0, STRING_ENCODING_CHAR };
1092 position_t const pos = *HERE;
1093 string_t const res = concat_string_literals();
1095 if (res.encoding != STRING_ENCODING_CHAR) {
1096 errorf(&pos, "expected plain string literal, got %s string literal", get_string_encoding_prefix(res.encoding));
1102 static attribute_t *allocate_attribute_zero(attribute_kind_t kind)
1104 attribute_t *attribute = allocate_ast_zero(sizeof(*attribute));
1105 attribute->kind = kind;
1106 attribute->pos = *HERE;
1111 * Parse (gcc) attribute argument. From gcc comments in gcc source:
1114 * __attribute__ ( ( attribute-list ) )
1118 * attribute_list , attrib
1123 * any-word ( identifier )
1124 * any-word ( identifier , nonempty-expr-list )
1125 * any-word ( expr-list )
1127 * where the "identifier" must not be declared as a type, and
1128 * "any-word" may be any identifier (including one declared as a
1129 * type), a reserved word storage class specifier, type specifier or
1130 * type qualifier. ??? This still leaves out most reserved keywords
1131 * (following the old parser), shouldn't we include them, and why not
1132 * allow identifiers declared as types to start the arguments?
1134 * Matze: this all looks confusing and little systematic, so we're even less
1135 * strict and parse any list of things which are identifiers or
1136 * (assignment-)expressions.
1138 static attribute_argument_t *parse_attribute_arguments(void)
1140 attribute_argument_t *first = NULL;
1141 attribute_argument_t **anchor = &first;
1142 if (token.kind != ')') do {
1143 attribute_argument_t *argument = allocate_ast_zero(sizeof(*argument));
1145 /* is it an identifier */
1146 if (token.kind == T_IDENTIFIER
1147 && (look_ahead(1)->kind == ',' || look_ahead(1)->kind == ')')) {
1148 argument->kind = ATTRIBUTE_ARGUMENT_SYMBOL;
1149 argument->v.symbol = token.base.symbol;
1152 /* must be an expression */
1153 expression_t *expression = parse_assignment_expression();
1155 argument->kind = ATTRIBUTE_ARGUMENT_EXPRESSION;
1156 argument->v.expression = expression;
1159 /* append argument */
1161 anchor = &argument->next;
1162 } while (accept(','));
1167 static attribute_t *parse_attribute_asm(void)
1169 attribute_t *attribute = allocate_attribute_zero(ATTRIBUTE_GNU_ASM);
1172 attribute->a.arguments = parse_attribute_arguments();
1176 static attribute_t *parse_attribute_gnu_single(void)
1178 /* parse "any-word" */
1179 symbol_t *const symbol = token.base.symbol;
1180 if (symbol == NULL) {
1181 parse_error_expected("while parsing attribute((", T_IDENTIFIER, NULL);
1185 attribute_kind_t kind;
1186 char const *const name = symbol->string;
1187 for (kind = ATTRIBUTE_GNU_FIRST;; ++kind) {
1188 if (kind > ATTRIBUTE_GNU_LAST) {
1189 /* special case for "__const" */
1190 if (token.kind == T_const) {
1191 kind = ATTRIBUTE_GNU_CONST;
1195 warningf(WARN_ATTRIBUTE, HERE, "unknown attribute '%s' ignored", name);
1196 /* TODO: we should still save the attribute in the list... */
1197 kind = ATTRIBUTE_UNKNOWN;
1201 const char *attribute_name = get_attribute_name(kind);
1202 if (attribute_name != NULL && streq_underscore(attribute_name, name))
1206 attribute_t *attribute = allocate_attribute_zero(kind);
1209 /* parse arguments */
1211 attribute->a.arguments = parse_attribute_arguments();
1216 static attribute_t *parse_attribute_gnu(void)
1218 attribute_t *first = NULL;
1219 attribute_t **anchor = &first;
1221 eat(T___attribute__);
1222 add_anchor_token(')');
1223 add_anchor_token(',');
1227 if (token.kind != ')') do {
1228 attribute_t *attribute = parse_attribute_gnu_single();
1230 *anchor = attribute;
1231 anchor = &attribute->next;
1233 } while (accept(','));
1234 rem_anchor_token(',');
1235 rem_anchor_token(')');
1242 /** Parse attributes. */
1243 static attribute_t *parse_attributes(attribute_t *first)
1245 attribute_t **anchor = &first;
1247 while (*anchor != NULL)
1248 anchor = &(*anchor)->next;
1250 attribute_t *attribute;
1251 switch (token.kind) {
1252 case T___attribute__:
1253 attribute = parse_attribute_gnu();
1254 if (attribute == NULL)
1259 attribute = parse_attribute_asm();
1263 attribute = allocate_attribute_zero(ATTRIBUTE_MS_CDECL);
1268 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FASTCALL);
1272 case T__forceinline:
1273 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FORCEINLINE);
1274 eat(T__forceinline);
1278 attribute = allocate_attribute_zero(ATTRIBUTE_MS_STDCALL);
1283 /* TODO record modifier */
1284 warningf(WARN_OTHER, HERE, "Ignoring declaration modifier %K", &token);
1285 attribute = allocate_attribute_zero(ATTRIBUTE_MS_THISCALL);
1293 *anchor = attribute;
1294 anchor = &attribute->next;
1298 static void mark_vars_read(expression_t *expr, entity_t *lhs_ent);
1300 static entity_t *determine_lhs_ent(expression_t *const expr,
1303 switch (expr->kind) {
1304 case EXPR_REFERENCE: {
1305 entity_t *const entity = expr->reference.entity;
1306 /* we should only find variables as lvalues... */
1307 if (entity->base.kind != ENTITY_VARIABLE
1308 && entity->base.kind != ENTITY_PARAMETER)
1314 case EXPR_ARRAY_ACCESS: {
1315 expression_t *const ref = expr->array_access.array_ref;
1316 entity_t * ent = NULL;
1317 if (is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1318 ent = determine_lhs_ent(ref, lhs_ent);
1321 mark_vars_read(ref, lhs_ent);
1323 mark_vars_read(expr->array_access.index, lhs_ent);
1328 mark_vars_read(expr->select.compound, lhs_ent);
1329 if (is_type_compound(skip_typeref(expr->base.type)))
1330 return determine_lhs_ent(expr->select.compound, lhs_ent);
1334 case EXPR_UNARY_DEREFERENCE: {
1335 expression_t *const val = expr->unary.value;
1336 if (val->kind == EXPR_UNARY_TAKE_ADDRESS) {
1338 return determine_lhs_ent(val->unary.value, lhs_ent);
1340 mark_vars_read(val, NULL);
1346 mark_vars_read(expr, NULL);
1351 #define ENT_ANY ((entity_t*)-1)
1354 * Mark declarations, which are read. This is used to detect variables, which
1358 * x is not marked as "read", because it is only read to calculate its own new
1362 * x and y are not detected as "not read", because multiple variables are
1365 static void mark_vars_read(expression_t *const expr, entity_t *lhs_ent)
1367 switch (expr->kind) {
1368 case EXPR_REFERENCE: {
1369 entity_t *const entity = expr->reference.entity;
1370 if (entity->kind != ENTITY_VARIABLE
1371 && entity->kind != ENTITY_PARAMETER)
1374 if (lhs_ent != entity && lhs_ent != ENT_ANY) {
1375 entity->variable.read = true;
1381 // TODO respect pure/const
1382 mark_vars_read(expr->call.function, NULL);
1383 for (call_argument_t *arg = expr->call.arguments; arg != NULL; arg = arg->next) {
1384 mark_vars_read(arg->expression, NULL);
1388 case EXPR_CONDITIONAL:
1389 // TODO lhs_decl should depend on whether true/false have an effect
1390 mark_vars_read(expr->conditional.condition, NULL);
1391 if (expr->conditional.true_expression != NULL)
1392 mark_vars_read(expr->conditional.true_expression, lhs_ent);
1393 mark_vars_read(expr->conditional.false_expression, lhs_ent);
1397 if (lhs_ent == ENT_ANY
1398 && !is_type_compound(skip_typeref(expr->base.type)))
1400 mark_vars_read(expr->select.compound, lhs_ent);
1403 case EXPR_ARRAY_ACCESS: {
1404 mark_vars_read(expr->array_access.index, lhs_ent);
1405 expression_t *const ref = expr->array_access.array_ref;
1406 if (!is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1407 if (lhs_ent == ENT_ANY)
1410 mark_vars_read(ref, lhs_ent);
1415 mark_vars_read(expr->va_arge.ap, lhs_ent);
1419 mark_vars_read(expr->va_copye.src, lhs_ent);
1422 case EXPR_UNARY_CAST:
1423 /* Special case: Use void cast to mark a variable as "read" */
1424 if (is_type_void(skip_typeref(expr->base.type)))
1429 case EXPR_UNARY_THROW:
1430 if (expr->unary.value == NULL)
1433 case EXPR_UNARY_DEREFERENCE:
1434 case EXPR_UNARY_DELETE:
1435 case EXPR_UNARY_DELETE_ARRAY:
1436 if (lhs_ent == ENT_ANY)
1440 case EXPR_UNARY_NEGATE:
1441 case EXPR_UNARY_PLUS:
1442 case EXPR_UNARY_COMPLEMENT:
1443 case EXPR_UNARY_NOT:
1444 case EXPR_UNARY_TAKE_ADDRESS:
1445 case EXPR_UNARY_POSTFIX_INCREMENT:
1446 case EXPR_UNARY_POSTFIX_DECREMENT:
1447 case EXPR_UNARY_PREFIX_INCREMENT:
1448 case EXPR_UNARY_PREFIX_DECREMENT:
1449 case EXPR_UNARY_ASSUME:
1451 mark_vars_read(expr->unary.value, lhs_ent);
1454 case EXPR_BINARY_ADD:
1455 case EXPR_BINARY_SUB:
1456 case EXPR_BINARY_MUL:
1457 case EXPR_BINARY_DIV:
1458 case EXPR_BINARY_MOD:
1459 case EXPR_BINARY_EQUAL:
1460 case EXPR_BINARY_NOTEQUAL:
1461 case EXPR_BINARY_LESS:
1462 case EXPR_BINARY_LESSEQUAL:
1463 case EXPR_BINARY_GREATER:
1464 case EXPR_BINARY_GREATEREQUAL:
1465 case EXPR_BINARY_BITWISE_AND:
1466 case EXPR_BINARY_BITWISE_OR:
1467 case EXPR_BINARY_BITWISE_XOR:
1468 case EXPR_BINARY_LOGICAL_AND:
1469 case EXPR_BINARY_LOGICAL_OR:
1470 case EXPR_BINARY_SHIFTLEFT:
1471 case EXPR_BINARY_SHIFTRIGHT:
1472 case EXPR_BINARY_COMMA:
1473 case EXPR_BINARY_ISGREATER:
1474 case EXPR_BINARY_ISGREATEREQUAL:
1475 case EXPR_BINARY_ISLESS:
1476 case EXPR_BINARY_ISLESSEQUAL:
1477 case EXPR_BINARY_ISLESSGREATER:
1478 case EXPR_BINARY_ISUNORDERED:
1479 mark_vars_read(expr->binary.left, lhs_ent);
1480 mark_vars_read(expr->binary.right, lhs_ent);
1483 case EXPR_BINARY_ASSIGN:
1484 case EXPR_BINARY_MUL_ASSIGN:
1485 case EXPR_BINARY_DIV_ASSIGN:
1486 case EXPR_BINARY_MOD_ASSIGN:
1487 case EXPR_BINARY_ADD_ASSIGN:
1488 case EXPR_BINARY_SUB_ASSIGN:
1489 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
1490 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
1491 case EXPR_BINARY_BITWISE_AND_ASSIGN:
1492 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
1493 case EXPR_BINARY_BITWISE_OR_ASSIGN: {
1494 if (lhs_ent == ENT_ANY)
1496 lhs_ent = determine_lhs_ent(expr->binary.left, lhs_ent);
1497 mark_vars_read(expr->binary.right, lhs_ent);
1502 determine_lhs_ent(expr->va_starte.ap, lhs_ent);
1505 case EXPR_LITERAL_CASES:
1506 case EXPR_LITERAL_CHARACTER:
1508 case EXPR_STRING_LITERAL:
1509 case EXPR_COMPOUND_LITERAL: // TODO init?
1511 case EXPR_CLASSIFY_TYPE:
1514 case EXPR_BUILTIN_CONSTANT_P:
1515 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
1517 case EXPR_STATEMENT: // TODO
1518 case EXPR_LABEL_ADDRESS:
1519 case EXPR_ENUM_CONSTANT:
1523 panic("unhandled expression");
1526 static designator_t *parse_designation(void)
1528 designator_t *result = NULL;
1529 designator_t **anchor = &result;
1532 designator_t *designator;
1533 switch (token.kind) {
1535 designator = allocate_ast_zero(sizeof(designator[0]));
1536 designator->pos = *HERE;
1538 add_anchor_token(']');
1539 designator->array_index = parse_constant_expression();
1540 rem_anchor_token(']');
1544 designator = allocate_ast_zero(sizeof(designator[0]));
1545 designator->pos = *HERE;
1547 designator->symbol = expect_identifier("while parsing designator", NULL);
1548 if (!designator->symbol)
1556 assert(designator != NULL);
1557 *anchor = designator;
1558 anchor = &designator->next;
1563 * Build an initializer from a given expression.
1565 static initializer_t *initializer_from_expression(type_t *orig_type,
1566 expression_t *expression)
1568 /* TODO check that expression is a constant expression */
1570 type_t *const type = skip_typeref(orig_type);
1572 /* §6.7.8.14/15 char array may be initialized by string literals */
1573 if (expression->kind == EXPR_STRING_LITERAL && is_type_array(type)) {
1574 array_type_t *const array_type = &type->array;
1575 type_t *const element_type = skip_typeref(array_type->element_type);
1576 switch (expression->string_literal.value.encoding) {
1577 case STRING_ENCODING_CHAR:
1578 case STRING_ENCODING_UTF8: {
1579 if (is_type_atomic(element_type, ATOMIC_TYPE_CHAR) ||
1580 is_type_atomic(element_type, ATOMIC_TYPE_SCHAR) ||
1581 is_type_atomic(element_type, ATOMIC_TYPE_UCHAR)) {
1582 goto make_string_init;
1587 case STRING_ENCODING_CHAR16:
1588 case STRING_ENCODING_CHAR32:
1589 case STRING_ENCODING_WIDE: {
1590 assert(is_type_pointer(expression->base.type));
1591 type_t *const init_type = get_unqualified_type(expression->base.type->pointer.points_to);
1592 if (types_compatible(get_unqualified_type(element_type), init_type)) {
1594 initializer_t *const init = allocate_initializer_zero(INITIALIZER_STRING);
1595 init->value.value = expression;
1603 assign_error_t error = semantic_assign(type, expression);
1604 if (error == ASSIGN_ERROR_INCOMPATIBLE)
1606 report_assign_error(error, type, expression, "initializer",
1607 &expression->base.pos);
1609 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
1610 result->value.value = create_implicit_cast(expression, type);
1616 * Parses an scalar initializer.
1618 * §6.7.8.11; eat {} without warning
1620 static initializer_t *parse_scalar_initializer(type_t *type,
1621 bool must_be_constant)
1623 /* there might be extra {} hierarchies */
1625 if (token.kind == '{') {
1626 warningf(WARN_OTHER, HERE, "extra curly braces around scalar initializer");
1630 } while (token.kind == '{');
1633 expression_t *expression = parse_assignment_expression();
1634 mark_vars_read(expression, NULL);
1635 if (must_be_constant && !is_linker_constant(expression)) {
1636 errorf(&expression->base.pos,
1637 "initialisation expression '%E' is not constant",
1641 initializer_t *initializer = initializer_from_expression(type, expression);
1643 if (initializer == NULL) {
1644 errorf(&expression->base.pos,
1645 "expression '%E' (type '%T') doesn't match expected type '%T'",
1646 expression, expression->base.type, type);
1651 bool additional_warning_displayed = false;
1652 while (braces > 0) {
1654 if (token.kind != '}') {
1655 if (!additional_warning_displayed) {
1656 warningf(WARN_OTHER, HERE, "additional elements in scalar initializer");
1657 additional_warning_displayed = true;
1668 * An entry in the type path.
1670 typedef struct type_path_entry_t type_path_entry_t;
1671 struct type_path_entry_t {
1672 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
1674 size_t index; /**< For array types: the current index. */
1675 declaration_t *compound_entry; /**< For compound types: the current declaration. */
1680 * A type path expression a position inside compound or array types.
1682 typedef struct type_path_t type_path_t;
1683 struct type_path_t {
1684 type_path_entry_t *path; /**< An flexible array containing the current path. */
1685 type_t *top_type; /**< type of the element the path points */
1686 size_t max_index; /**< largest index in outermost array */
1690 * Prints a type path for debugging.
1692 static __attribute__((unused)) void debug_print_type_path(
1693 const type_path_t *path)
1695 size_t len = ARR_LEN(path->path);
1697 for (size_t i = 0; i < len; ++i) {
1698 const type_path_entry_t *entry = & path->path[i];
1700 type_t *type = skip_typeref(entry->type);
1701 if (is_type_compound(type)) {
1702 /* in gcc mode structs can have no members */
1703 if (entry->v.compound_entry == NULL) {
1707 fprintf(stderr, ".%s",
1708 entry->v.compound_entry->base.symbol->string);
1709 } else if (is_type_array(type)) {
1710 fprintf(stderr, "[%u]", (unsigned) entry->v.index);
1712 fprintf(stderr, "-INVALID-");
1715 if (path->top_type != NULL) {
1716 fprintf(stderr, " (");
1717 print_type(path->top_type);
1718 fprintf(stderr, ")");
1723 * Return the top type path entry, i.e. in a path
1724 * (type).a.b returns the b.
1726 static type_path_entry_t *get_type_path_top(const type_path_t *path)
1728 size_t len = ARR_LEN(path->path);
1730 return &path->path[len-1];
1734 * Enlarge the type path by an (empty) element.
1736 static type_path_entry_t *append_to_type_path(type_path_t *path)
1738 size_t len = ARR_LEN(path->path);
1739 ARR_RESIZE(type_path_entry_t, path->path, len+1);
1741 type_path_entry_t *result = & path->path[len];
1742 memset(result, 0, sizeof(result[0]));
1747 * Descending into a sub-type. Enter the scope of the current top_type.
1749 static void descend_into_subtype(type_path_t *path)
1751 type_t *orig_top_type = path->top_type;
1752 type_t *top_type = skip_typeref(orig_top_type);
1754 type_path_entry_t *top = append_to_type_path(path);
1755 top->type = top_type;
1757 if (is_type_compound(top_type)) {
1758 compound_t *const compound = top_type->compound.compound;
1759 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
1761 if (entry != NULL) {
1762 top->v.compound_entry = &entry->declaration;
1763 path->top_type = entry->declaration.type;
1765 path->top_type = NULL;
1767 } else if (is_type_array(top_type)) {
1769 path->top_type = top_type->array.element_type;
1771 assert(!is_type_valid(top_type));
1776 * Pop an entry from the given type path, i.e. returning from
1777 * (type).a.b to (type).a
1779 static void ascend_from_subtype(type_path_t *path)
1781 type_path_entry_t *top = get_type_path_top(path);
1783 path->top_type = top->type;
1785 size_t len = ARR_LEN(path->path);
1786 ARR_RESIZE(type_path_entry_t, path->path, len-1);
1790 * Pop entries from the given type path until the given
1791 * path level is reached.
1793 static void ascend_to(type_path_t *path, size_t top_path_level)
1795 size_t len = ARR_LEN(path->path);
1797 while (len > top_path_level) {
1798 ascend_from_subtype(path);
1799 len = ARR_LEN(path->path);
1803 static bool walk_designator(type_path_t *path, const designator_t *designator,
1804 bool used_in_offsetof)
1806 for (; designator != NULL; designator = designator->next) {
1807 type_path_entry_t *top = get_type_path_top(path);
1808 type_t *orig_type = top->type;
1810 type_t *type = skip_typeref(orig_type);
1812 if (designator->symbol != NULL) {
1813 symbol_t *symbol = designator->symbol;
1814 if (!is_type_compound(type)) {
1815 if (is_type_valid(type)) {
1816 errorf(&designator->pos,
1817 "'.%Y' designator used for non-compound type '%T'",
1821 top->type = type_error_type;
1822 top->v.compound_entry = NULL;
1823 orig_type = type_error_type;
1825 compound_t *compound = type->compound.compound;
1826 entity_t *iter = compound->members.entities;
1827 for (; iter != NULL; iter = iter->base.next) {
1828 if (iter->base.symbol == symbol) {
1833 errorf(&designator->pos,
1834 "'%T' has no member named '%Y'", orig_type, symbol);
1837 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
1838 if (used_in_offsetof && iter->compound_member.bitfield) {
1839 errorf(&designator->pos,
1840 "offsetof designator '%Y' must not specify bitfield",
1845 top->type = orig_type;
1846 top->v.compound_entry = &iter->declaration;
1847 orig_type = iter->declaration.type;
1850 expression_t *array_index = designator->array_index;
1851 if (is_constant_expression(array_index) != EXPR_CLASS_CONSTANT)
1854 if (!is_type_array(type)) {
1855 if (is_type_valid(type)) {
1856 errorf(&designator->pos,
1857 "[%E] designator used for non-array type '%T'",
1858 array_index, orig_type);
1863 long index = fold_constant_to_int(array_index);
1864 if (!used_in_offsetof) {
1866 errorf(&designator->pos,
1867 "array index [%E] must be positive", array_index);
1868 } else if (type->array.size_constant) {
1869 long array_size = type->array.size;
1870 if (index >= array_size) {
1871 errorf(&designator->pos,
1872 "designator [%E] (%d) exceeds array size %d",
1873 array_index, index, array_size);
1878 top->type = orig_type;
1879 top->v.index = (size_t) index;
1880 orig_type = type->array.element_type;
1882 path->top_type = orig_type;
1884 if (designator->next != NULL) {
1885 descend_into_subtype(path);
1891 static void advance_current_object(type_path_t *path, size_t top_path_level)
1893 type_path_entry_t *top = get_type_path_top(path);
1895 type_t *type = skip_typeref(top->type);
1896 if (is_type_union(type)) {
1897 /* in unions only the first element is initialized */
1898 top->v.compound_entry = NULL;
1899 } else if (is_type_struct(type)) {
1900 declaration_t *entry = top->v.compound_entry;
1902 entity_t *const next_entity = skip_unnamed_bitfields(entry->base.next);
1903 if (next_entity != NULL) {
1904 assert(is_declaration(next_entity));
1905 entry = &next_entity->declaration;
1910 top->v.compound_entry = entry;
1911 if (entry != NULL) {
1912 path->top_type = entry->type;
1915 } else if (is_type_array(type)) {
1916 assert(is_type_array(type));
1920 if (!type->array.size_constant || top->v.index < type->array.size) {
1924 assert(!is_type_valid(type));
1928 /* we're past the last member of the current sub-aggregate, try if we
1929 * can ascend in the type hierarchy and continue with another subobject */
1930 size_t len = ARR_LEN(path->path);
1932 if (len > top_path_level) {
1933 ascend_from_subtype(path);
1934 advance_current_object(path, top_path_level);
1936 path->top_type = NULL;
1941 * skip any {...} blocks until a closing bracket is reached.
1943 static void skip_initializers(void)
1947 while (token.kind != '}') {
1948 if (token.kind == T_EOF)
1950 if (token.kind == '{') {
1958 static initializer_t *create_empty_initializer(void)
1960 static initializer_t empty_initializer
1961 = { .list = { { INITIALIZER_LIST }, 0 } };
1962 return &empty_initializer;
1966 * Parse a part of an initialiser for a struct or union,
1968 static initializer_t *parse_sub_initializer(type_path_t *path,
1969 type_t *outer_type, size_t top_path_level,
1970 parse_initializer_env_t *env)
1972 if (token.kind == '}') {
1973 /* empty initializer */
1974 return create_empty_initializer();
1977 initializer_t *result = NULL;
1979 type_t *orig_type = path->top_type;
1980 type_t *type = NULL;
1982 if (orig_type == NULL) {
1983 /* We are initializing an empty compound. */
1985 type = skip_typeref(orig_type);
1988 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
1991 designator_t *designator = NULL;
1992 if (token.kind == '.' || token.kind == '[') {
1993 designator = parse_designation();
1994 goto finish_designator;
1995 } else if (token.kind == T_IDENTIFIER && look_ahead(1)->kind == ':') {
1996 /* GNU-style designator ("identifier: value") */
1997 designator = allocate_ast_zero(sizeof(designator[0]));
1998 designator->pos = *HERE;
1999 designator->symbol = token.base.symbol;
2004 /* reset path to toplevel, evaluate designator from there */
2005 ascend_to(path, top_path_level);
2006 if (!walk_designator(path, designator, false)) {
2007 /* can't continue after designation error */
2011 initializer_t *designator_initializer
2012 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2013 designator_initializer->designator.designator = designator;
2014 ARR_APP1(initializer_t*, initializers, designator_initializer);
2016 orig_type = path->top_type;
2017 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2022 if (token.kind == '{') {
2023 if (type != NULL && is_type_scalar(type)) {
2024 sub = parse_scalar_initializer(type, env->must_be_constant);
2027 if (env->entity != NULL) {
2028 errorf(HERE, "extra brace group at end of initializer for '%N'", env->entity);
2030 errorf(HERE, "extra brace group at end of initializer");
2035 descend_into_subtype(path);
2038 add_anchor_token('}');
2039 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2041 rem_anchor_token('}');
2046 goto error_parse_next;
2048 ascend_from_subtype(path);
2051 /* must be an expression */
2052 expression_t *expression = parse_assignment_expression();
2053 mark_vars_read(expression, NULL);
2055 if (env->must_be_constant && !is_linker_constant(expression)) {
2056 errorf(&expression->base.pos,
2057 "Initialisation expression '%E' is not constant",
2062 /* we are already outside, ... */
2063 if (outer_type == NULL)
2064 goto error_parse_next;
2065 type_t *const outer_type_skip = skip_typeref(outer_type);
2066 if (is_type_compound(outer_type_skip) &&
2067 !outer_type_skip->compound.compound->complete) {
2068 goto error_parse_next;
2071 position_t const* const pos = &expression->base.pos;
2072 if (env->entity != NULL) {
2073 warningf(WARN_OTHER, pos, "excess elements in initializer for '%N'", env->entity);
2075 warningf(WARN_OTHER, pos, "excess elements in initializer");
2077 goto error_parse_next;
2080 /* handle { "string" } special case */
2081 if (expression->kind == EXPR_STRING_LITERAL && outer_type != NULL) {
2082 result = initializer_from_expression(outer_type, expression);
2083 if (result != NULL) {
2085 if (token.kind != '}') {
2086 warningf(WARN_OTHER, HERE, "excessive elements in initializer for type '%T'", outer_type);
2088 /* TODO: eat , ... */
2093 /* descend into subtypes until expression matches type */
2095 orig_type = path->top_type;
2096 type = skip_typeref(orig_type);
2098 sub = initializer_from_expression(orig_type, expression);
2102 if (!is_type_valid(type)) {
2105 if (is_type_scalar(type)) {
2106 errorf(&expression->base.pos,
2107 "expression '%E' doesn't match expected type '%T'",
2108 expression, orig_type);
2112 descend_into_subtype(path);
2116 /* update largest index of top array */
2117 const type_path_entry_t *first = &path->path[0];
2118 type_t *first_type = first->type;
2119 first_type = skip_typeref(first_type);
2120 if (is_type_array(first_type)) {
2121 size_t index = first->v.index;
2122 if (index > path->max_index)
2123 path->max_index = index;
2126 /* append to initializers list */
2127 ARR_APP1(initializer_t*, initializers, sub);
2132 if (token.kind == '}') {
2137 /* advance to the next declaration if we are not at the end */
2138 advance_current_object(path, top_path_level);
2139 orig_type = path->top_type;
2140 if (orig_type != NULL)
2141 type = skip_typeref(orig_type);
2147 size_t len = ARR_LEN(initializers);
2148 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2149 result = allocate_ast_zero(size);
2150 result->kind = INITIALIZER_LIST;
2151 result->list.len = len;
2152 memcpy(&result->list.initializers, initializers,
2153 len * sizeof(initializers[0]));
2157 skip_initializers();
2159 DEL_ARR_F(initializers);
2160 ascend_to(path, top_path_level+1);
2164 static expression_t *make_size_literal(size_t value)
2166 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_INTEGER);
2167 literal->base.type = type_size_t;
2170 snprintf(buf, sizeof(buf), "%u", (unsigned) value);
2171 literal->literal.value = make_string(buf);
2177 * Parses an initializer. Parsers either a compound literal
2178 * (env->declaration == NULL) or an initializer of a declaration.
2180 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2182 type_t *type = skip_typeref(env->type);
2183 size_t max_index = 0;
2184 initializer_t *result;
2186 if (is_type_scalar(type)) {
2187 result = parse_scalar_initializer(type, env->must_be_constant);
2188 } else if (token.kind == '{') {
2192 memset(&path, 0, sizeof(path));
2193 path.top_type = env->type;
2194 path.path = NEW_ARR_F(type_path_entry_t, 0);
2196 descend_into_subtype(&path);
2198 add_anchor_token('}');
2199 result = parse_sub_initializer(&path, env->type, 1, env);
2200 rem_anchor_token('}');
2202 max_index = path.max_index;
2203 DEL_ARR_F(path.path);
2207 /* parse_scalar_initializer() also works in this case: we simply
2208 * have an expression without {} around it */
2209 result = parse_scalar_initializer(type, env->must_be_constant);
2212 /* §6.7.8:22 array initializers for arrays with unknown size determine
2213 * the array type size */
2214 if (is_type_array(type) && type->array.size_expression == NULL
2215 && result != NULL) {
2217 switch (result->kind) {
2218 case INITIALIZER_LIST:
2219 assert(max_index != 0xdeadbeaf);
2220 size = max_index + 1;
2223 case INITIALIZER_STRING: {
2224 size = get_string_len(&get_init_string(result)->value) + 1;
2228 case INITIALIZER_DESIGNATOR:
2229 case INITIALIZER_VALUE:
2230 /* can happen for parse errors */
2235 internal_errorf(HERE, "invalid initializer type");
2238 type_t *new_type = duplicate_type(type);
2240 new_type->array.size_expression = make_size_literal(size);
2241 new_type->array.size_constant = true;
2242 new_type->array.has_implicit_size = true;
2243 new_type->array.size = size;
2244 env->type = new_type;
2250 static void append_entity(scope_t *scope, entity_t *entity)
2252 if (scope->last_entity != NULL) {
2253 scope->last_entity->base.next = entity;
2255 scope->entities = entity;
2257 entity->base.parent_entity = current_entity;
2258 scope->last_entity = entity;
2262 static compound_t *parse_compound_type_specifier(bool is_struct)
2264 position_t const pos = *HERE;
2265 eat(is_struct ? T_struct : T_union);
2267 symbol_t *symbol = NULL;
2268 entity_t *entity = NULL;
2269 attribute_t *attributes = NULL;
2271 if (token.kind == T___attribute__) {
2272 attributes = parse_attributes(NULL);
2275 entity_kind_tag_t const kind = is_struct ? ENTITY_STRUCT : ENTITY_UNION;
2276 if (token.kind == T_IDENTIFIER) {
2277 /* the compound has a name, check if we have seen it already */
2278 symbol = token.base.symbol;
2279 entity = get_tag(symbol, kind);
2282 if (entity != NULL) {
2283 if (entity->base.parent_scope != current_scope &&
2284 (token.kind == '{' || token.kind == ';')) {
2285 /* we're in an inner scope and have a definition. Shadow
2286 * existing definition in outer scope */
2288 } else if (entity->compound.complete && token.kind == '{') {
2289 position_t const *const ppos = &entity->base.pos;
2290 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2291 /* clear members in the hope to avoid further errors */
2292 entity->compound.members.entities = NULL;
2295 } else if (token.kind != '{') {
2296 char const *const msg =
2297 is_struct ? "while parsing struct type specifier" :
2298 "while parsing union type specifier";
2299 parse_error_expected(msg, T_IDENTIFIER, '{', NULL);
2304 if (entity == NULL) {
2305 entity = allocate_entity_zero(kind, NAMESPACE_TAG, symbol, &pos);
2306 entity->compound.alignment = 1;
2307 entity->base.parent_scope = current_scope;
2308 if (symbol != NULL) {
2309 environment_push(entity);
2311 append_entity(current_scope, entity);
2314 if (token.kind == '{') {
2315 parse_compound_type_entries(&entity->compound);
2317 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2318 if (symbol == NULL) {
2319 assert(anonymous_entity == NULL);
2320 anonymous_entity = entity;
2324 if (attributes != NULL) {
2325 entity->compound.attributes = attributes;
2326 handle_entity_attributes(attributes, entity);
2329 return &entity->compound;
2332 static void parse_enum_entries(type_t *const enum_type)
2336 if (token.kind == '}') {
2337 errorf(HERE, "empty enum not allowed");
2342 add_anchor_token('}');
2343 add_anchor_token(',');
2345 add_anchor_token('=');
2347 symbol_t *const symbol = expect_identifier("while parsing enum entry", &pos);
2348 entity_t *const entity = allocate_entity_zero(ENTITY_ENUM_VALUE, NAMESPACE_NORMAL, symbol, &pos);
2349 entity->enum_value.enum_type = enum_type;
2350 rem_anchor_token('=');
2353 expression_t *value = parse_constant_expression();
2355 value = create_implicit_cast(value, enum_type);
2356 entity->enum_value.value = value;
2361 record_entity(entity, false);
2362 } while (accept(',') && token.kind != '}');
2363 rem_anchor_token(',');
2364 rem_anchor_token('}');
2369 static type_t *parse_enum_specifier(void)
2371 position_t const pos = *HERE;
2376 switch (token.kind) {
2378 symbol = token.base.symbol;
2379 entity = get_tag(symbol, ENTITY_ENUM);
2382 if (entity != NULL) {
2383 if (entity->base.parent_scope != current_scope &&
2384 (token.kind == '{' || token.kind == ';')) {
2385 /* we're in an inner scope and have a definition. Shadow
2386 * existing definition in outer scope */
2388 } else if (entity->enume.complete && token.kind == '{') {
2389 position_t const *const ppos = &entity->base.pos;
2390 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2401 parse_error_expected("while parsing enum type specifier",
2402 T_IDENTIFIER, '{', NULL);
2406 if (entity == NULL) {
2407 entity = allocate_entity_zero(ENTITY_ENUM, NAMESPACE_TAG, symbol, &pos);
2408 entity->base.parent_scope = current_scope;
2411 type_t *const type = allocate_type_zero(TYPE_ENUM);
2412 type->enumt.enume = &entity->enume;
2413 type->enumt.base.akind = ATOMIC_TYPE_INT;
2415 if (token.kind == '{') {
2416 if (symbol != NULL) {
2417 environment_push(entity);
2419 append_entity(current_scope, entity);
2420 entity->enume.complete = true;
2422 parse_enum_entries(type);
2423 parse_attributes(NULL);
2425 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2426 if (symbol == NULL) {
2427 assert(anonymous_entity == NULL);
2428 anonymous_entity = entity;
2430 } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
2431 errorf(HERE, "'%T' used before definition (incomplete enums are a GNU extension)", type);
2438 * if a symbol is a typedef to another type, return true
2440 static bool is_typedef_symbol(symbol_t *symbol)
2442 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
2443 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
2446 static type_t *parse_typeof(void)
2452 add_anchor_token(')');
2455 expression_t *expression = NULL;
2457 switch (token.kind) {
2459 if (is_typedef_symbol(token.base.symbol)) {
2461 type = parse_typename();
2464 expression = parse_expression();
2465 type = revert_automatic_type_conversion(expression);
2470 rem_anchor_token(')');
2473 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
2474 typeof_type->typeoft.expression = expression;
2475 typeof_type->typeoft.typeof_type = type;
2480 typedef enum specifiers_t {
2482 SPECIFIER_SIGNED = 1 << 0,
2483 SPECIFIER_UNSIGNED = 1 << 1,
2484 SPECIFIER_LONG = 1 << 2,
2485 SPECIFIER_INT = 1 << 3,
2486 SPECIFIER_DOUBLE = 1 << 4,
2487 SPECIFIER_CHAR = 1 << 5,
2488 SPECIFIER_WCHAR_T = 1 << 6,
2489 SPECIFIER_SHORT = 1 << 7,
2490 SPECIFIER_LONG_LONG = 1 << 8,
2491 SPECIFIER_FLOAT = 1 << 9,
2492 SPECIFIER_BOOL = 1 << 10,
2493 SPECIFIER_VOID = 1 << 11,
2494 SPECIFIER_INT8 = 1 << 12,
2495 SPECIFIER_INT16 = 1 << 13,
2496 SPECIFIER_INT32 = 1 << 14,
2497 SPECIFIER_INT64 = 1 << 15,
2498 SPECIFIER_INT128 = 1 << 16,
2499 SPECIFIER_COMPLEX = 1 << 17,
2500 SPECIFIER_IMAGINARY = 1 << 18,
2503 static type_t *get_typedef_type(symbol_t *symbol)
2505 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
2506 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
2509 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
2510 type->typedeft.typedefe = &entity->typedefe;
2515 static attribute_t *parse_attribute_ms_property(attribute_t *attribute)
2517 attribute_property_argument_t *const property = allocate_ast_zero(sizeof(*property));
2519 add_anchor_token(')');
2520 add_anchor_token(',');
2524 add_anchor_token('=');
2526 symbol_t *const prop_sym = expect_identifier("while parsing property declspec", &pos);
2527 rem_anchor_token('=');
2529 symbol_t **prop = NULL;
2531 if (streq(prop_sym->string, "put")) {
2532 prop = &property->put_symbol;
2533 } else if (streq(prop_sym->string, "get")) {
2534 prop = &property->get_symbol;
2536 errorf(&pos, "expected put or get in property declspec, but got '%Y'", prop_sym);
2540 add_anchor_token(T_IDENTIFIER);
2542 rem_anchor_token(T_IDENTIFIER);
2544 symbol_t *const sym = expect_identifier("while parsing property declspec", NULL);
2546 *prop = sym ? sym : sym_anonymous;
2547 } while (accept(','));
2548 rem_anchor_token(',');
2549 rem_anchor_token(')');
2551 attribute->a.property = property;
2557 static attribute_t *parse_microsoft_extended_decl_modifier_single(void)
2559 attribute_kind_t kind = ATTRIBUTE_UNKNOWN;
2560 if (accept(T_restrict)) {
2561 kind = ATTRIBUTE_MS_RESTRICT;
2562 } else if (token.kind == T_IDENTIFIER) {
2563 char const *const name = token.base.symbol->string;
2564 for (attribute_kind_t k = ATTRIBUTE_MS_FIRST; k <= ATTRIBUTE_MS_LAST;
2566 const char *attribute_name = get_attribute_name(k);
2567 if (attribute_name != NULL && streq(attribute_name, name)) {
2573 if (kind == ATTRIBUTE_UNKNOWN) {
2574 warningf(WARN_ATTRIBUTE, HERE, "unknown __declspec '%s' ignored", name);
2577 parse_error_expected("while parsing __declspec", T_IDENTIFIER, NULL);
2581 attribute_t *attribute = allocate_attribute_zero(kind);
2584 if (kind == ATTRIBUTE_MS_PROPERTY) {
2585 return parse_attribute_ms_property(attribute);
2588 /* parse arguments */
2590 attribute->a.arguments = parse_attribute_arguments();
2595 static attribute_t *parse_microsoft_extended_decl_modifier(attribute_t *first)
2599 add_anchor_token(')');
2601 if (token.kind != ')') {
2602 attribute_t **anchor = &first;
2604 while (*anchor != NULL)
2605 anchor = &(*anchor)->next;
2607 attribute_t *attribute
2608 = parse_microsoft_extended_decl_modifier_single();
2609 if (attribute == NULL)
2612 *anchor = attribute;
2613 anchor = &attribute->next;
2614 } while (accept(','));
2616 rem_anchor_token(')');
2621 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
2623 entity_t *const entity = allocate_entity_zero(kind, NAMESPACE_NORMAL, symbol, HERE);
2624 if (is_declaration(entity)) {
2625 entity->declaration.type = type_error_type;
2626 entity->declaration.implicit = true;
2627 } else if (kind == ENTITY_TYPEDEF) {
2628 entity->typedefe.type = type_error_type;
2629 entity->typedefe.builtin = true;
2631 if (kind != ENTITY_COMPOUND_MEMBER)
2632 record_entity(entity, false);
2636 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2638 type_t *type = NULL;
2639 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
2640 unsigned type_specifiers = 0;
2641 bool newtype = false;
2642 bool saw_error = false;
2644 memset(specifiers, 0, sizeof(*specifiers));
2645 specifiers->pos = *HERE;
2648 specifiers->attributes = parse_attributes(specifiers->attributes);
2650 switch (token.kind) {
2652 #define MATCH_STORAGE_CLASS(token, class) \
2654 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
2655 errorf(HERE, "multiple storage classes in declaration specifiers"); \
2657 specifiers->storage_class = class; \
2658 if (specifiers->thread_local) \
2659 goto check_thread_storage_class; \
2663 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
2664 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
2665 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
2666 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
2667 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
2670 specifiers->attributes
2671 = parse_microsoft_extended_decl_modifier(specifiers->attributes);
2674 case T__Thread_local:
2675 if (specifiers->thread_local) {
2676 errorf(HERE, "duplicate %K", &token);
2678 specifiers->thread_local = true;
2679 check_thread_storage_class:
2680 switch (specifiers->storage_class) {
2681 case STORAGE_CLASS_EXTERN:
2682 case STORAGE_CLASS_NONE:
2683 case STORAGE_CLASS_STATIC:
2687 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_storage_class;
2688 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_storage_class;
2689 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_storage_class;
2690 wrong_thread_storage_class:
2691 errorf(HERE, "%K used with '%s'", &token, wrong);
2698 /* type qualifiers */
2699 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
2701 qualifiers |= qualifier; \
2705 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
2706 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
2707 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
2708 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
2709 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
2710 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
2711 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
2712 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
2714 /* type specifiers */
2715 #define MATCH_SPECIFIER(token, specifier, name) \
2717 if (type_specifiers & specifier) { \
2718 errorf(HERE, "multiple " name " type specifiers given"); \
2720 type_specifiers |= specifier; \
2725 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
2726 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
2727 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
2728 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
2729 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
2730 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
2731 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
2732 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
2733 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
2734 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
2735 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
2736 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
2737 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
2738 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
2739 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
2740 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
2741 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
2742 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
2746 specifiers->is_inline = true;
2750 case T__forceinline:
2751 eat(T__forceinline);
2752 specifiers->modifiers |= DM_FORCEINLINE;
2757 if (type_specifiers & SPECIFIER_LONG_LONG) {
2758 errorf(HERE, "too many long type specifiers given");
2759 } else if (type_specifiers & SPECIFIER_LONG) {
2760 type_specifiers |= SPECIFIER_LONG_LONG;
2762 type_specifiers |= SPECIFIER_LONG;
2767 #define CHECK_DOUBLE_TYPE() \
2768 (type != NULL ? errorf(HERE, "multiple types in declaration specifiers") : (void)0)
2771 CHECK_DOUBLE_TYPE();
2772 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
2774 type->compound.compound = parse_compound_type_specifier(true);
2777 CHECK_DOUBLE_TYPE();
2778 type = allocate_type_zero(TYPE_COMPOUND_UNION);
2779 type->compound.compound = parse_compound_type_specifier(false);
2782 CHECK_DOUBLE_TYPE();
2783 type = parse_enum_specifier();
2786 CHECK_DOUBLE_TYPE();
2787 type = parse_typeof();
2789 case T___builtin_va_list:
2790 CHECK_DOUBLE_TYPE();
2791 type = duplicate_type(type_valist);
2792 eat(T___builtin_va_list);
2795 case T_IDENTIFIER: {
2796 /* only parse identifier if we haven't found a type yet */
2797 if (type != NULL || type_specifiers != 0) {
2798 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
2799 * declaration, so it doesn't generate errors about expecting '(' or
2801 switch (look_ahead(1)->kind) {
2808 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
2812 errorf(HERE, "discarding stray %K in declaration specifier", &token);
2817 goto finish_specifiers;
2821 type_t *const typedef_type = get_typedef_type(token.base.symbol);
2822 if (typedef_type == NULL) {
2823 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
2824 * declaration, so it doesn't generate 'implicit int' followed by more
2825 * errors later on. */
2826 token_kind_t const la1_type = (token_kind_t)look_ahead(1)->kind;
2832 errorf(HERE, "%K does not name a type", &token);
2834 entity_t *const entity = create_error_entity(token.base.symbol, ENTITY_TYPEDEF);
2836 type = allocate_type_zero(TYPE_TYPEDEF);
2837 type->typedeft.typedefe = &entity->typedefe;
2845 goto finish_specifiers;
2850 type = typedef_type;
2854 /* function specifier */
2856 goto finish_specifiers;
2861 specifiers->attributes = parse_attributes(specifiers->attributes);
2863 if (type == NULL || (saw_error && type_specifiers != 0)) {
2864 atomic_type_kind_t atomic_type;
2866 /* match valid basic types */
2867 switch (type_specifiers) {
2868 case SPECIFIER_VOID:
2869 atomic_type = ATOMIC_TYPE_VOID;
2871 case SPECIFIER_WCHAR_T:
2872 atomic_type = ATOMIC_TYPE_WCHAR_T;
2874 case SPECIFIER_CHAR:
2875 atomic_type = ATOMIC_TYPE_CHAR;
2877 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
2878 atomic_type = ATOMIC_TYPE_SCHAR;
2880 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
2881 atomic_type = ATOMIC_TYPE_UCHAR;
2883 case SPECIFIER_SHORT:
2884 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
2885 case SPECIFIER_SHORT | SPECIFIER_INT:
2886 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
2887 atomic_type = ATOMIC_TYPE_SHORT;
2889 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
2890 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
2891 atomic_type = ATOMIC_TYPE_USHORT;
2894 case SPECIFIER_SIGNED:
2895 case SPECIFIER_SIGNED | SPECIFIER_INT:
2896 atomic_type = ATOMIC_TYPE_INT;
2898 case SPECIFIER_UNSIGNED:
2899 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
2900 atomic_type = ATOMIC_TYPE_UINT;
2902 case SPECIFIER_LONG:
2903 case SPECIFIER_SIGNED | SPECIFIER_LONG:
2904 case SPECIFIER_LONG | SPECIFIER_INT:
2905 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
2906 atomic_type = ATOMIC_TYPE_LONG;
2908 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
2909 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
2910 atomic_type = ATOMIC_TYPE_ULONG;
2913 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2914 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2915 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
2916 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
2918 atomic_type = ATOMIC_TYPE_LONGLONG;
2919 goto warn_about_long_long;
2921 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2922 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
2924 atomic_type = ATOMIC_TYPE_ULONGLONG;
2925 warn_about_long_long:
2926 warningf(WARN_LONG_LONG, &specifiers->pos, "ISO C90 does not support 'long long'");
2929 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
2930 atomic_type = unsigned_int8_type_kind;
2933 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
2934 atomic_type = unsigned_int16_type_kind;
2937 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
2938 atomic_type = unsigned_int32_type_kind;
2941 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
2942 atomic_type = unsigned_int64_type_kind;
2945 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
2946 atomic_type = unsigned_int128_type_kind;
2949 case SPECIFIER_INT8:
2950 case SPECIFIER_SIGNED | SPECIFIER_INT8:
2951 atomic_type = int8_type_kind;
2954 case SPECIFIER_INT16:
2955 case SPECIFIER_SIGNED | SPECIFIER_INT16:
2956 atomic_type = int16_type_kind;
2959 case SPECIFIER_INT32:
2960 case SPECIFIER_SIGNED | SPECIFIER_INT32:
2961 atomic_type = int32_type_kind;
2964 case SPECIFIER_INT64:
2965 case SPECIFIER_SIGNED | SPECIFIER_INT64:
2966 atomic_type = int64_type_kind;
2969 case SPECIFIER_INT128:
2970 case SPECIFIER_SIGNED | SPECIFIER_INT128:
2971 atomic_type = int128_type_kind;
2974 case SPECIFIER_FLOAT:
2975 atomic_type = ATOMIC_TYPE_FLOAT;
2977 case SPECIFIER_DOUBLE:
2978 atomic_type = ATOMIC_TYPE_DOUBLE;
2980 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
2981 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
2983 case SPECIFIER_BOOL:
2984 atomic_type = ATOMIC_TYPE_BOOL;
2986 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
2987 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
2988 atomic_type = ATOMIC_TYPE_FLOAT;
2990 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
2991 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
2992 atomic_type = ATOMIC_TYPE_DOUBLE;
2994 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
2995 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
2996 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
2999 /* invalid specifier combination, give an error message */
3000 position_t const* const pos = &specifiers->pos;
3001 if (type_specifiers == 0) {
3003 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
3004 if (!(c_mode & _CXX) && !strict_mode) {
3005 warningf(WARN_IMPLICIT_INT, pos, "no type specifiers in declaration, using 'int'");
3006 atomic_type = ATOMIC_TYPE_INT;
3009 errorf(pos, "no type specifiers given in declaration");
3012 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3013 (type_specifiers & SPECIFIER_UNSIGNED)) {
3014 errorf(pos, "signed and unsigned specifiers given");
3015 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3016 errorf(pos, "only integer types can be signed or unsigned");
3018 errorf(pos, "multiple datatypes in declaration");
3020 specifiers->type = type_error_type;
3025 if (type_specifiers & SPECIFIER_COMPLEX) {
3026 type = allocate_type_zero(TYPE_COMPLEX);
3027 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3028 type = allocate_type_zero(TYPE_IMAGINARY);
3030 type = allocate_type_zero(TYPE_ATOMIC);
3032 type->atomic.akind = atomic_type;
3034 } else if (type_specifiers != 0) {
3035 errorf(&specifiers->pos, "multiple datatypes in declaration");
3038 /* FIXME: check type qualifiers here */
3039 type->base.qualifiers = qualifiers;
3042 type = identify_new_type(type);
3044 type = typehash_insert(type);
3047 if (specifiers->attributes != NULL)
3048 type = handle_type_attributes(specifiers->attributes, type);
3049 specifiers->type = type;
3052 static type_qualifiers_t parse_type_qualifiers(void)
3054 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3057 switch (token.kind) {
3058 /* type qualifiers */
3059 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3060 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3061 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3062 /* microsoft extended type modifiers */
3063 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3064 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3065 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3066 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3067 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3076 * Parses an K&R identifier list
3078 static void parse_identifier_list(scope_t *scope)
3080 assert(token.kind == T_IDENTIFIER);
3082 entity_t *const entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, token.base.symbol, HERE);
3083 /* a K&R parameter has no type, yet */
3087 append_entity(scope, entity);
3088 } while (accept(',') && token.kind == T_IDENTIFIER);
3091 static entity_t *parse_parameter(void)
3093 declaration_specifiers_t specifiers;
3094 parse_declaration_specifiers(&specifiers);
3096 entity_t *entity = parse_declarator(&specifiers,
3097 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
3098 anonymous_entity = NULL;
3102 static void semantic_parameter_incomplete(const entity_t *entity)
3104 assert(entity->kind == ENTITY_PARAMETER);
3106 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
3107 * list in a function declarator that is part of a
3108 * definition of that function shall not have
3109 * incomplete type. */
3110 type_t *type = skip_typeref(entity->declaration.type);
3111 if (is_type_incomplete(type)) {
3112 errorf(&entity->base.pos, "'%N' has incomplete type", entity);
3116 static bool has_parameters(void)
3118 /* func(void) is not a parameter */
3119 if (look_ahead(1)->kind != ')')
3121 if (token.kind == T_IDENTIFIER) {
3122 entity_t const *const entity = get_entity(token.base.symbol, NAMESPACE_NORMAL);
3125 if (entity->kind != ENTITY_TYPEDEF)
3127 type_t const *const type = skip_typeref(entity->typedefe.type);
3128 if (!is_type_void(type))
3130 if (c_mode & _CXX) {
3131 /* ISO/IEC 14882:1998(E) §8.3.5:2 It must be literally (void). A typedef
3132 * is not allowed. */
3133 errorf(HERE, "empty parameter list defined with a typedef of 'void' not allowed in C++");
3134 } else if (type->base.qualifiers != TYPE_QUALIFIER_NONE) {
3135 /* §6.7.5.3:10 Qualification is not allowed here. */
3136 errorf(HERE, "'void' as parameter must not have type qualifiers");
3138 } else if (token.kind != T_void) {
3146 * Parses function type parameters (and optionally creates variable_t entities
3147 * for them in a scope)
3149 static void parse_parameters(function_type_t *type, scope_t *scope)
3151 add_anchor_token(')');
3154 if (token.kind == T_IDENTIFIER &&
3155 !is_typedef_symbol(token.base.symbol) &&
3156 (look_ahead(1)->kind == ',' || look_ahead(1)->kind == ')')) {
3157 type->kr_style_parameters = true;
3158 parse_identifier_list(scope);
3159 } else if (token.kind == ')') {
3160 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
3161 if (!(c_mode & _CXX))
3162 type->unspecified_parameters = true;
3163 } else if (has_parameters()) {
3164 function_parameter_t **anchor = &type->parameters;
3165 add_anchor_token(',');
3167 switch (token.kind) {
3170 type->variadic = true;
3171 goto parameters_finished;
3176 entity_t *entity = parse_parameter();
3177 if (entity->kind == ENTITY_TYPEDEF) {
3178 errorf(&entity->base.pos,
3179 "typedef not allowed as function parameter");
3182 assert(is_declaration(entity));
3184 semantic_parameter_incomplete(entity);
3186 function_parameter_t *const parameter =
3187 allocate_parameter(entity->declaration.type);
3189 if (scope != NULL) {
3190 append_entity(scope, entity);
3193 *anchor = parameter;
3194 anchor = ¶meter->next;
3199 goto parameters_finished;
3201 } while (accept(','));
3202 parameters_finished:
3203 rem_anchor_token(',');
3206 rem_anchor_token(')');
3210 typedef enum construct_type_kind_t {
3211 CONSTRUCT_POINTER = 1,
3212 CONSTRUCT_REFERENCE,
3215 } construct_type_kind_t;
3217 typedef union construct_type_t construct_type_t;
3219 typedef struct construct_type_base_t {
3220 construct_type_kind_t kind;
3222 construct_type_t *next;
3223 } construct_type_base_t;
3225 typedef struct parsed_pointer_t {
3226 construct_type_base_t base;
3227 type_qualifiers_t type_qualifiers;
3228 variable_t *base_variable; /**< MS __based extension. */
3231 typedef struct parsed_reference_t {
3232 construct_type_base_t base;
3233 } parsed_reference_t;
3235 typedef struct construct_function_type_t {
3236 construct_type_base_t base;
3237 type_t *function_type;
3238 } construct_function_type_t;
3240 typedef struct parsed_array_t {
3241 construct_type_base_t base;
3242 type_qualifiers_t type_qualifiers;
3248 union construct_type_t {
3249 construct_type_kind_t kind;
3250 construct_type_base_t base;
3251 parsed_pointer_t pointer;
3252 parsed_reference_t reference;
3253 construct_function_type_t function;
3254 parsed_array_t array;
3257 static construct_type_t *allocate_declarator_zero(construct_type_kind_t const kind, size_t const size)
3259 construct_type_t *const cons = obstack_alloc(&temp_obst, size);
3260 memset(cons, 0, size);
3262 cons->base.pos = *HERE;
3267 static construct_type_t *parse_pointer_declarator(void)
3269 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_POINTER, sizeof(parsed_pointer_t));
3271 cons->pointer.type_qualifiers = parse_type_qualifiers();
3272 //cons->pointer.base_variable = base_variable;
3277 /* ISO/IEC 14882:1998(E) §8.3.2 */
3278 static construct_type_t *parse_reference_declarator(void)
3280 if (!(c_mode & _CXX))
3281 errorf(HERE, "references are only available for C++");
3283 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_REFERENCE, sizeof(parsed_reference_t));
3290 static construct_type_t *parse_array_declarator(void)
3292 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_ARRAY, sizeof(parsed_array_t));
3293 parsed_array_t *const array = &cons->array;
3296 add_anchor_token(']');
3298 bool is_static = accept(T_static);
3300 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3303 is_static = accept(T_static);
3305 array->type_qualifiers = type_qualifiers;
3306 array->is_static = is_static;
3308 expression_t *size = NULL;
3309 if (token.kind == '*' && look_ahead(1)->kind == ']') {
3310 array->is_variable = true;
3312 } else if (token.kind != ']') {
3313 size = parse_assignment_expression();
3315 /* §6.7.5.2:1 Array size must have integer type */
3316 type_t *const orig_type = size->base.type;
3317 type_t *const type = skip_typeref(orig_type);
3318 if (!is_type_integer(type) && is_type_valid(type)) {
3319 errorf(&size->base.pos,
3320 "array size '%E' must have integer type but has type '%T'",
3325 mark_vars_read(size, NULL);
3328 if (is_static && size == NULL)
3329 errorf(&array->base.pos, "static array parameters require a size");
3331 rem_anchor_token(']');
3337 static construct_type_t *parse_function_declarator(scope_t *scope)
3339 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_FUNCTION, sizeof(construct_function_type_t));
3341 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3342 function_type_t *ftype = &type->function;
3344 ftype->linkage = current_linkage;
3345 ftype->calling_convention = CC_DEFAULT;
3347 parse_parameters(ftype, scope);
3349 cons->function.function_type = type;
3354 typedef struct parse_declarator_env_t {
3355 bool may_be_abstract : 1;
3356 bool must_be_abstract : 1;
3357 decl_modifiers_t modifiers;
3361 attribute_t *attributes;
3362 } parse_declarator_env_t;
3365 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env)
3367 /* construct a single linked list of construct_type_t's which describe
3368 * how to construct the final declarator type */
3369 construct_type_t *first = NULL;
3370 construct_type_t **anchor = &first;
3372 env->attributes = parse_attributes(env->attributes);
3375 construct_type_t *type;
3376 //variable_t *based = NULL; /* MS __based extension */
3377 switch (token.kind) {
3379 type = parse_reference_declarator();
3383 panic("based not supported anymore");
3388 type = parse_pointer_declarator();
3392 goto ptr_operator_end;
3396 anchor = &type->base.next;
3398 /* TODO: find out if this is correct */
3399 env->attributes = parse_attributes(env->attributes);
3403 construct_type_t *inner_types = NULL;
3405 switch (token.kind) {
3407 if (env->must_be_abstract) {
3408 errorf(HERE, "no identifier expected in typename");
3410 env->symbol = token.base.symbol;
3417 /* Parenthesized declarator or function declarator? */
3418 token_t const *const la1 = look_ahead(1);
3419 switch (la1->kind) {
3421 if (is_typedef_symbol(la1->base.symbol)) {
3423 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
3424 * interpreted as ``function with no parameter specification'', rather
3425 * than redundant parentheses around the omitted identifier. */
3427 /* Function declarator. */
3428 if (!env->may_be_abstract) {
3429 errorf(HERE, "function declarator must have a name");
3436 case T___attribute__: /* FIXME __attribute__ might also introduce a parameter of a function declarator. */
3437 /* Paranthesized declarator. */
3439 add_anchor_token(')');
3440 inner_types = parse_inner_declarator(env);
3441 if (inner_types != NULL) {
3442 /* All later declarators only modify the return type */
3443 env->must_be_abstract = true;
3445 rem_anchor_token(')');
3454 if (env->may_be_abstract)
3456 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3461 construct_type_t **const p = anchor;
3464 construct_type_t *type;
3465 switch (token.kind) {
3467 scope_t *scope = NULL;
3468 if (!env->must_be_abstract) {
3469 scope = &env->parameters;
3472 type = parse_function_declarator(scope);
3476 type = parse_array_declarator();
3479 goto declarator_finished;
3482 /* insert in the middle of the list (at p) */
3483 type->base.next = *p;
3486 anchor = &type->base.next;
3489 declarator_finished:
3490 /* append inner_types at the end of the list, we don't to set anchor anymore
3491 * as it's not needed anymore */
3492 *anchor = inner_types;
3497 static type_t *construct_declarator_type(construct_type_t *construct_list,
3500 construct_type_t *iter = construct_list;
3501 for (; iter != NULL; iter = iter->base.next) {
3502 position_t const* const pos = &iter->base.pos;
3503 switch (iter->kind) {
3504 case CONSTRUCT_FUNCTION: {
3505 construct_function_type_t *function = &iter->function;
3506 type_t *function_type = function->function_type;
3508 function_type->function.return_type = type;
3510 type_t *skipped_return_type = skip_typeref(type);
3512 if (is_type_function(skipped_return_type)) {
3513 errorf(pos, "function returning function is not allowed");
3514 } else if (is_type_array(skipped_return_type)) {
3515 errorf(pos, "function returning array is not allowed");
3517 if (skipped_return_type->base.qualifiers != 0) {
3518 warningf(WARN_IGNORED_QUALIFIERS, pos, "type qualifiers in return type of function type are meaningless");
3522 /* The function type was constructed earlier. Freeing it here will
3523 * destroy other types. */
3524 type = typehash_insert(function_type);
3528 case CONSTRUCT_POINTER: {
3529 if (is_type_reference(skip_typeref(type)))
3530 errorf(pos, "cannot declare a pointer to reference");
3532 parsed_pointer_t *pointer = &iter->pointer;
3533 type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
3537 case CONSTRUCT_REFERENCE:
3538 if (is_type_reference(skip_typeref(type)))
3539 errorf(pos, "cannot declare a reference to reference");
3541 type = make_reference_type(type);
3544 case CONSTRUCT_ARRAY: {
3545 if (is_type_reference(skip_typeref(type)))
3546 errorf(pos, "cannot declare an array of references");
3548 parsed_array_t *array = &iter->array;
3549 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
3551 expression_t *size_expression = array->size;
3552 if (size_expression != NULL) {
3554 = create_implicit_cast(size_expression, type_size_t);
3557 array_type->base.qualifiers = array->type_qualifiers;
3558 array_type->array.element_type = type;
3559 array_type->array.is_static = array->is_static;
3560 array_type->array.is_variable = array->is_variable;
3561 array_type->array.size_expression = size_expression;
3563 if (size_expression != NULL) {
3564 switch (is_constant_expression(size_expression)) {
3565 case EXPR_CLASS_CONSTANT: {
3566 long const size = fold_constant_to_int(size_expression);
3567 array_type->array.size = size;
3568 array_type->array.size_constant = true;
3569 /* §6.7.5.2:1 If the expression is a constant expression,
3570 * it shall have a value greater than zero. */
3572 errorf(&size_expression->base.pos,
3573 "size of array must be greater than zero");
3574 } else if (size == 0 && !GNU_MODE) {
3575 errorf(&size_expression->base.pos,
3576 "size of array must be greater than zero (zero length arrays are a GCC extension)");
3581 case EXPR_CLASS_VARIABLE:
3582 array_type->array.is_vla = true;
3585 case EXPR_CLASS_ERROR:
3590 type_t *skipped_type = skip_typeref(type);
3592 if (is_type_incomplete(skipped_type)) {
3593 errorf(pos, "array of incomplete type '%T' is not allowed", type);
3594 } else if (is_type_function(skipped_type)) {
3595 errorf(pos, "array of functions is not allowed");
3597 type = identify_new_type(array_type);
3601 internal_errorf(pos, "invalid type construction found");
3607 static type_t *automatic_type_conversion(type_t *orig_type);
3609 static type_t *semantic_parameter(const position_t *pos, type_t *type,
3610 const declaration_specifiers_t *specifiers,
3611 entity_t const *const param)
3613 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
3614 * shall be adjusted to ``qualified pointer to type'',
3616 * §6.7.5.3:8 A declaration of a parameter as ``function returning
3617 * type'' shall be adjusted to ``pointer to function
3618 * returning type'', as in 6.3.2.1. */
3619 type = automatic_type_conversion(type);
3621 if (specifiers->is_inline && is_type_valid(type)) {
3622 errorf(pos, "'%N' declared 'inline'", param);
3625 /* §6.9.1:6 The declarations in the declaration list shall contain
3626 * no storage-class specifier other than register and no
3627 * initializations. */
3628 if (specifiers->thread_local || (
3629 specifiers->storage_class != STORAGE_CLASS_NONE &&
3630 specifiers->storage_class != STORAGE_CLASS_REGISTER)
3632 errorf(pos, "invalid storage class for '%N'", param);
3635 /* delay test for incomplete type, because we might have (void)
3636 * which is legal but incomplete... */
3641 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
3642 declarator_flags_t flags)
3644 parse_declarator_env_t env;
3645 memset(&env, 0, sizeof(env));
3646 env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
3648 construct_type_t *construct_type = parse_inner_declarator(&env);
3650 construct_declarator_type(construct_type, specifiers->type);
3651 type_t *type = skip_typeref(orig_type);
3653 if (construct_type != NULL) {
3654 obstack_free(&temp_obst, construct_type);
3657 attribute_t *attributes = parse_attributes(env.attributes);
3658 /* append (shared) specifier attribute behind attributes of this
3660 attribute_t **anchor = &attributes;
3661 while (*anchor != NULL)
3662 anchor = &(*anchor)->next;
3663 *anchor = specifiers->attributes;
3666 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
3667 entity = allocate_entity_zero(ENTITY_TYPEDEF, NAMESPACE_NORMAL, env.symbol, &env.pos);
3668 entity->typedefe.type = orig_type;
3670 if (anonymous_entity != NULL) {
3671 if (is_type_compound(type)) {
3672 assert(anonymous_entity->compound.alias == NULL);
3673 assert(anonymous_entity->kind == ENTITY_STRUCT ||
3674 anonymous_entity->kind == ENTITY_UNION);
3675 anonymous_entity->compound.alias = entity;
3676 anonymous_entity = NULL;
3677 } else if (is_type_enum(type)) {
3678 assert(anonymous_entity->enume.alias == NULL);
3679 assert(anonymous_entity->kind == ENTITY_ENUM);
3680 anonymous_entity->enume.alias = entity;
3681 anonymous_entity = NULL;
3685 /* create a declaration type entity */
3686 position_t const *const pos = env.symbol ? &env.pos : &specifiers->pos;
3687 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
3688 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, env.symbol, pos);
3690 if (env.symbol != NULL) {
3691 if (specifiers->is_inline && is_type_valid(type)) {
3692 errorf(&env.pos, "'%N' declared 'inline'", entity);
3695 if (specifiers->thread_local ||
3696 specifiers->storage_class != STORAGE_CLASS_NONE) {
3697 errorf(&env.pos, "'%N' must have no storage class", entity);
3700 } else if (flags & DECL_IS_PARAMETER) {
3701 entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, env.symbol, pos);
3702 orig_type = semantic_parameter(&env.pos, orig_type, specifiers, entity);
3703 } else if (is_type_function(type)) {
3704 entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, env.symbol, pos);
3705 entity->function.is_inline = specifiers->is_inline;
3706 entity->function.elf_visibility = default_visibility;
3707 entity->function.parameters = env.parameters;
3709 if (env.symbol != NULL) {
3710 /* this needs fixes for C++ */
3711 bool in_function_scope = current_function != NULL;
3713 if (specifiers->thread_local || (
3714 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3715 specifiers->storage_class != STORAGE_CLASS_NONE &&
3716 (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
3718 errorf(&env.pos, "invalid storage class for '%N'", entity);
3722 entity = allocate_entity_zero(ENTITY_VARIABLE, NAMESPACE_NORMAL, env.symbol, pos);
3723 entity->variable.elf_visibility = default_visibility;
3724 entity->variable.thread_local = specifiers->thread_local;
3726 if (env.symbol != NULL) {
3727 if (specifiers->is_inline && is_type_valid(type)) {
3728 errorf(&env.pos, "'%N' declared 'inline'", entity);
3731 bool invalid_storage_class = false;
3732 if (current_scope == file_scope) {
3733 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3734 specifiers->storage_class != STORAGE_CLASS_NONE &&
3735 specifiers->storage_class != STORAGE_CLASS_STATIC) {
3736 invalid_storage_class = true;
3739 if (specifiers->thread_local &&
3740 specifiers->storage_class == STORAGE_CLASS_NONE) {
3741 invalid_storage_class = true;
3744 if (invalid_storage_class) {
3745 errorf(&env.pos, "invalid storage class for '%N'", entity);
3750 entity->declaration.type = orig_type;
3751 entity->declaration.alignment = get_type_alignment(orig_type);
3752 entity->declaration.modifiers = env.modifiers;
3753 entity->declaration.attributes = attributes;
3755 storage_class_t storage_class = specifiers->storage_class;
3756 entity->declaration.declared_storage_class = storage_class;
3758 if (storage_class == STORAGE_CLASS_NONE && current_function != NULL)
3759 storage_class = STORAGE_CLASS_AUTO;
3760 entity->declaration.storage_class = storage_class;
3763 if (attributes != NULL) {
3764 handle_entity_attributes(attributes, entity);
3767 if (entity->kind == ENTITY_FUNCTION && !freestanding) {
3768 adapt_special_functions(&entity->function);
3774 static type_t *parse_abstract_declarator(type_t *base_type)
3776 parse_declarator_env_t env;
3777 memset(&env, 0, sizeof(env));
3778 env.may_be_abstract = true;
3779 env.must_be_abstract = true;
3781 construct_type_t *construct_type = parse_inner_declarator(&env);
3783 type_t *result = construct_declarator_type(construct_type, base_type);
3784 if (construct_type != NULL) {
3785 obstack_free(&temp_obst, construct_type);
3787 result = handle_type_attributes(env.attributes, result);
3793 * Check if the declaration of main is suspicious. main should be a
3794 * function with external linkage, returning int, taking either zero
3795 * arguments, two, or three arguments of appropriate types, ie.
3797 * int main([ int argc, char **argv [, char **env ] ]).
3799 * @param decl the declaration to check
3800 * @param type the function type of the declaration
3802 static void check_main(const entity_t *entity)
3804 const position_t *pos = &entity->base.pos;
3805 if (entity->kind != ENTITY_FUNCTION) {
3806 warningf(WARN_MAIN, pos, "'main' is not a function");
3810 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
3811 warningf(WARN_MAIN, pos, "'main' is normally a non-static function");
3814 type_t *type = skip_typeref(entity->declaration.type);
3815 assert(is_type_function(type));
3817 function_type_t const *const func_type = &type->function;
3818 type_t *const ret_type = func_type->return_type;
3819 if (!types_compatible(skip_typeref(ret_type), type_int)) {
3820 warningf(WARN_MAIN, pos, "return type of 'main' should be 'int', but is '%T'", ret_type);
3822 const function_parameter_t *parm = func_type->parameters;
3824 type_t *const first_type = skip_typeref(parm->type);
3825 type_t *const first_type_unqual = get_unqualified_type(first_type);
3826 if (!types_compatible(first_type_unqual, type_int)) {
3827 warningf(WARN_MAIN, pos, "first argument of 'main' should be 'int', but is '%T'", parm->type);
3831 type_t *const second_type = skip_typeref(parm->type);
3832 type_t *const second_type_unqual
3833 = get_unqualified_type(second_type);
3834 if (!types_compatible(second_type_unqual, type_char_ptr_ptr)) {
3835 warningf(WARN_MAIN, pos, "second argument of 'main' should be 'char**', but is '%T'", parm->type);
3839 type_t *const third_type = skip_typeref(parm->type);
3840 type_t *const third_type_unqual
3841 = get_unqualified_type(third_type);
3842 if (!types_compatible(third_type_unqual, type_char_ptr_ptr)) {
3843 warningf(WARN_MAIN, pos, "third argument of 'main' should be 'char**', but is '%T'", parm->type);
3847 goto warn_arg_count;
3851 warningf(WARN_MAIN, pos, "'main' takes only zero, two or three arguments");
3856 static void error_redefined_as_different_kind(const position_t *pos,
3857 const entity_t *old, entity_kind_t new_kind)
3859 char const *const what = get_entity_kind_name(new_kind);
3860 position_t const *const ppos = &old->base.pos;
3861 errorf(pos, "redeclaration of '%N' as %s (declared %P)", old, what, ppos);
3864 static bool is_entity_valid(entity_t *const ent)
3866 if (is_declaration(ent)) {
3867 return is_type_valid(skip_typeref(ent->declaration.type));
3868 } else if (ent->kind == ENTITY_TYPEDEF) {
3869 return is_type_valid(skip_typeref(ent->typedefe.type));
3874 static bool contains_attribute(const attribute_t *list, const attribute_t *attr)
3876 for (const attribute_t *tattr = list; tattr != NULL; tattr = tattr->next) {
3877 if (attributes_equal(tattr, attr))
3884 * Tests whether new_list contains any attributes not included in old_list
3886 static bool has_new_attributes(const attribute_t *old_list,
3887 const attribute_t *new_list)
3889 for (const attribute_t *attr = new_list; attr != NULL; attr = attr->next) {
3890 if (!contains_attribute(old_list, attr))
3897 * Merge in attributes from an attribute list (probably from a previous
3898 * declaration with the same name). Warning: destroys the old structure
3899 * of the attribute list - don't reuse attributes after this call.
3901 static void merge_in_attributes(declaration_t *decl, attribute_t *attributes)
3904 for (attribute_t *attr = attributes; attr != NULL; attr = next) {
3906 if (contains_attribute(decl->attributes, attr))
3909 /* move attribute to new declarations attributes list */
3910 attr->next = decl->attributes;
3911 decl->attributes = attr;
3915 static bool is_main(entity_t*);
3918 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
3919 * for various problems that occur for multiple definitions
3921 entity_t *record_entity(entity_t *entity, const bool is_definition)
3923 const symbol_t *const symbol = entity->base.symbol;
3924 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
3925 const position_t *pos = &entity->base.pos;
3927 /* can happen in error cases */
3931 assert(!entity->base.parent_scope);
3932 assert(current_scope);
3933 entity->base.parent_scope = current_scope;
3935 entity_t *const previous_entity = get_entity(symbol, namespc);
3936 /* pushing the same entity twice will break the stack structure */
3937 assert(previous_entity != entity);
3939 if (entity->kind == ENTITY_FUNCTION) {
3940 type_t *const orig_type = entity->declaration.type;
3941 type_t *const type = skip_typeref(orig_type);
3943 assert(is_type_function(type));
3944 if (type->function.unspecified_parameters &&
3945 previous_entity == NULL &&
3946 !entity->declaration.implicit) {
3947 warningf(WARN_STRICT_PROTOTYPES, pos, "function declaration '%#N' is not a prototype", entity);
3950 if (is_main(entity)) {
3955 if (is_declaration(entity) &&
3956 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
3957 current_scope != file_scope &&
3958 !entity->declaration.implicit) {
3959 warningf(WARN_NESTED_EXTERNS, pos, "nested extern declaration of '%#N'", entity);
3962 if (previous_entity != NULL) {
3963 position_t const *const ppos = &previous_entity->base.pos;
3965 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
3966 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
3967 assert(previous_entity->kind == ENTITY_PARAMETER);
3968 errorf(pos, "declaration of '%N' redeclares the '%N' (declared %P)", entity, previous_entity, ppos);
3972 if (previous_entity->base.parent_scope == current_scope) {
3973 if (previous_entity->kind != entity->kind) {
3974 if (is_entity_valid(previous_entity) && is_entity_valid(entity)) {
3975 error_redefined_as_different_kind(pos, previous_entity,
3980 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
3981 errorf(pos, "redeclaration of '%N' (declared %P)", entity, ppos);
3984 if (previous_entity->kind == ENTITY_TYPEDEF) {
3985 type_t *const type = skip_typeref(entity->typedefe.type);
3986 type_t *const prev_type
3987 = skip_typeref(previous_entity->typedefe.type);
3988 if (c_mode & _CXX) {
3989 /* C++ allows double typedef if they are identical
3990 * (after skipping typedefs) */
3991 if (type == prev_type)
3994 /* GCC extension: redef in system headers is allowed */
3995 if ((pos->is_system_header || ppos->is_system_header) &&
3996 types_compatible(type, prev_type))
3999 errorf(pos, "redefinition of '%N' (declared %P)",
4004 /* at this point we should have only VARIABLES or FUNCTIONS */
4005 assert(is_declaration(previous_entity) && is_declaration(entity));
4007 declaration_t *const prev_decl = &previous_entity->declaration;
4008 declaration_t *const decl = &entity->declaration;
4010 /* can happen for K&R style declarations */
4011 if (prev_decl->type == NULL &&
4012 previous_entity->kind == ENTITY_PARAMETER &&
4013 entity->kind == ENTITY_PARAMETER) {
4014 prev_decl->type = decl->type;
4015 prev_decl->storage_class = decl->storage_class;
4016 prev_decl->declared_storage_class = decl->declared_storage_class;
4017 prev_decl->modifiers = decl->modifiers;
4018 return previous_entity;
4021 type_t *const type = skip_typeref(decl->type);
4022 type_t *const prev_type = skip_typeref(prev_decl->type);
4024 if (!types_compatible(type, prev_type)) {
4025 errorf(pos, "declaration '%#N' is incompatible with '%#N' (declared %P)", entity, previous_entity, ppos);
4027 unsigned old_storage_class = prev_decl->storage_class;
4029 if (is_definition &&
4031 !(prev_decl->modifiers & DM_USED) &&
4032 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4033 warningf(WARN_REDUNDANT_DECLS, ppos, "unnecessary static forward declaration for '%#N'", previous_entity);
4036 storage_class_t new_storage_class = decl->storage_class;
4038 /* pretend no storage class means extern for function
4039 * declarations (except if the previous declaration is neither
4040 * none nor extern) */
4041 if (entity->kind == ENTITY_FUNCTION) {
4042 /* the previous declaration could have unspecified parameters or
4043 * be a typedef, so use the new type */
4044 if (prev_type->function.unspecified_parameters || is_definition)
4045 prev_decl->type = type;
4047 switch (old_storage_class) {
4048 case STORAGE_CLASS_NONE:
4049 old_storage_class = STORAGE_CLASS_EXTERN;
4052 case STORAGE_CLASS_EXTERN:
4053 if (is_definition) {
4054 if (prev_type->function.unspecified_parameters && !is_main(entity)) {
4055 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4057 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4058 new_storage_class = STORAGE_CLASS_EXTERN;
4065 } else if (is_type_incomplete(prev_type)) {
4066 prev_decl->type = type;
4069 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4070 new_storage_class == STORAGE_CLASS_EXTERN) {
4072 warn_redundant_declaration: ;
4074 = has_new_attributes(prev_decl->attributes,
4076 if (has_new_attrs) {
4077 merge_in_attributes(decl, prev_decl->attributes);
4078 } else if (!is_definition &&
4079 is_type_valid(prev_type) &&
4080 !pos->is_system_header) {
4081 warningf(WARN_REDUNDANT_DECLS, pos, "redundant declaration for '%N' (declared %P)", entity, ppos);
4083 } else if (current_function == NULL) {
4084 if (old_storage_class != STORAGE_CLASS_STATIC &&
4085 new_storage_class == STORAGE_CLASS_STATIC) {
4086 errorf(pos, "static declaration of '%N' follows non-static declaration (declared %P)", entity, ppos);
4087 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4088 prev_decl->storage_class = STORAGE_CLASS_NONE;
4089 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4091 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4093 goto error_redeclaration;
4094 goto warn_redundant_declaration;
4096 } else if (is_type_valid(prev_type)) {
4097 if (old_storage_class == new_storage_class) {
4098 error_redeclaration:
4099 errorf(pos, "redeclaration of '%N' (declared %P)", entity, ppos);
4101 errorf(pos, "redeclaration of '%N' with different linkage (declared %P)", entity, ppos);
4106 prev_decl->modifiers |= decl->modifiers;
4107 if (entity->kind == ENTITY_FUNCTION) {
4108 previous_entity->function.is_inline |= entity->function.is_inline;
4110 return previous_entity;
4114 if (is_warn_on(why = WARN_SHADOW) ||
4115 (is_warn_on(why = WARN_SHADOW_LOCAL) && previous_entity->base.parent_scope != file_scope)) {
4116 char const *const what = get_entity_kind_name(previous_entity->kind);
4117 warningf(why, pos, "'%N' shadows %s (declared %P)", entity, what, ppos);
4121 if (entity->kind == ENTITY_FUNCTION) {
4122 if (is_definition &&
4123 entity->declaration.storage_class != STORAGE_CLASS_STATIC &&
4125 if (is_warn_on(WARN_MISSING_PROTOTYPES)) {
4126 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4128 goto warn_missing_declaration;
4131 } else if (entity->kind == ENTITY_VARIABLE) {
4132 if (current_scope == file_scope &&
4133 entity->declaration.storage_class == STORAGE_CLASS_NONE &&
4134 !entity->declaration.implicit) {
4135 warn_missing_declaration:
4136 warningf(WARN_MISSING_DECLARATIONS, pos, "no previous declaration for '%#N'", entity);
4141 environment_push(entity);
4142 append_entity(current_scope, entity);
4147 static void parser_error_multiple_definition(entity_t *entity,
4148 const position_t *pos)
4150 errorf(pos, "redefinition of '%N' (declared %P)", entity, &entity->base.pos);
4153 static bool is_declaration_specifier(const token_t *token)
4155 switch (token->kind) {
4159 return is_typedef_symbol(token->base.symbol);
4166 static void parse_init_declarator_rest(entity_t *entity)
4168 type_t *orig_type = type_error_type;
4170 if (entity->base.kind == ENTITY_TYPEDEF) {
4171 position_t const *const pos = &entity->base.pos;
4172 errorf(pos, "'%N' is initialized (use __typeof__ instead)", entity);
4174 assert(is_declaration(entity));
4175 orig_type = entity->declaration.type;
4178 type_t *type = skip_typeref(orig_type);
4180 if (entity->kind == ENTITY_VARIABLE
4181 && entity->variable.initializer != NULL) {
4182 parser_error_multiple_definition(entity, HERE);
4186 declaration_t *const declaration = &entity->declaration;
4187 bool must_be_constant = false;
4188 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4189 entity->base.parent_scope == file_scope) {
4190 must_be_constant = true;
4193 if (is_type_function(type)) {
4194 position_t const *const pos = &entity->base.pos;
4195 errorf(pos, "'%N' is initialized like a variable", entity);
4196 orig_type = type_error_type;
4199 parse_initializer_env_t env;
4200 env.type = orig_type;
4201 env.must_be_constant = must_be_constant;
4202 env.entity = entity;
4204 initializer_t *initializer = parse_initializer(&env);
4206 if (entity->kind == ENTITY_VARIABLE) {
4207 /* §6.7.5:22 array initializers for arrays with unknown size
4208 * determine the array type size */
4209 declaration->type = env.type;
4210 entity->variable.initializer = initializer;
4214 /* parse rest of a declaration without any declarator */
4215 static void parse_anonymous_declaration_rest(
4216 const declaration_specifiers_t *specifiers)
4219 anonymous_entity = NULL;
4221 position_t const *const pos = &specifiers->pos;
4222 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4223 specifiers->thread_local) {
4224 warningf(WARN_OTHER, pos, "useless storage class in empty declaration");
4227 type_t *type = specifiers->type;
4228 switch (type->kind) {
4229 case TYPE_COMPOUND_STRUCT:
4230 case TYPE_COMPOUND_UNION: {
4231 if (type->compound.compound->base.symbol == NULL) {
4232 warningf(WARN_OTHER, pos, "unnamed struct/union that defines no instances");
4241 warningf(WARN_OTHER, pos, "empty declaration");
4246 static void check_variable_type_complete(entity_t *ent)
4248 if (ent->kind != ENTITY_VARIABLE)
4251 /* §6.7:7 If an identifier for an object is declared with no linkage, the
4252 * type for the object shall be complete [...] */
4253 declaration_t *decl = &ent->declaration;
4254 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4255 decl->storage_class == STORAGE_CLASS_STATIC)
4258 type_t *const type = skip_typeref(decl->type);
4259 if (!is_type_incomplete(type))
4262 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4263 * are given length one. */
4264 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4265 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4269 errorf(&ent->base.pos, "variable '%#N' has incomplete type", ent);
4273 static void parse_declaration_rest(entity_t *ndeclaration,
4274 const declaration_specifiers_t *specifiers,
4275 parsed_declaration_func finished_declaration,
4276 declarator_flags_t flags)
4278 add_anchor_token(';');
4279 add_anchor_token(',');
4281 entity_t *entity = finished_declaration(ndeclaration, token.kind == '=');
4283 if (token.kind == '=') {
4284 parse_init_declarator_rest(entity);
4285 } else if (entity->kind == ENTITY_VARIABLE) {
4286 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
4287 * [...] where the extern specifier is explicitly used. */
4288 declaration_t *decl = &entity->declaration;
4289 if (decl->storage_class != STORAGE_CLASS_EXTERN &&
4290 is_type_reference(skip_typeref(decl->type))) {
4291 position_t const *const pos = &entity->base.pos;
4292 errorf(pos, "reference '%#N' must be initialized", entity);
4296 check_variable_type_complete(entity);
4301 add_anchor_token('=');
4302 ndeclaration = parse_declarator(specifiers, flags);
4303 rem_anchor_token('=');
4305 rem_anchor_token(',');
4306 rem_anchor_token(';');
4309 anonymous_entity = NULL;
4312 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4314 symbol_t *symbol = entity->base.symbol;
4318 assert(entity->base.namespc == NAMESPACE_NORMAL);
4319 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4320 if (previous_entity == NULL
4321 || previous_entity->base.parent_scope != current_scope) {
4322 errorf(&entity->base.pos, "expected declaration of a function parameter, found '%Y'",
4327 if (is_definition) {
4328 errorf(HERE, "'%N' is initialised", entity);
4331 return record_entity(entity, false);
4334 static void parse_declaration(parsed_declaration_func finished_declaration,
4335 declarator_flags_t flags)
4337 add_anchor_token(';');
4338 declaration_specifiers_t specifiers;
4339 parse_declaration_specifiers(&specifiers);
4340 rem_anchor_token(';');
4342 if (token.kind == ';') {
4343 parse_anonymous_declaration_rest(&specifiers);
4345 entity_t *entity = parse_declarator(&specifiers, flags);
4346 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4351 static type_t *get_default_promoted_type(type_t *orig_type)
4353 type_t *result = orig_type;
4355 type_t *type = skip_typeref(orig_type);
4356 if (is_type_integer(type)) {
4357 result = promote_integer(type);
4358 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4359 result = type_double;
4365 static void parse_kr_declaration_list(entity_t *entity)
4367 if (entity->kind != ENTITY_FUNCTION)
4370 type_t *type = skip_typeref(entity->declaration.type);
4371 assert(is_type_function(type));
4372 if (!type->function.kr_style_parameters)
4375 add_anchor_token('{');
4377 PUSH_SCOPE(&entity->function.parameters);
4379 entity_t *parameter = entity->function.parameters.entities;
4380 for ( ; parameter != NULL; parameter = parameter->base.next) {
4381 assert(parameter->base.parent_scope == NULL);
4382 parameter->base.parent_scope = current_scope;
4383 environment_push(parameter);
4386 /* parse declaration list */
4388 switch (token.kind) {
4390 /* This covers symbols, which are no type, too, and results in
4391 * better error messages. The typical cases are misspelled type
4392 * names and missing includes. */
4394 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4404 /* update function type */
4405 type_t *new_type = duplicate_type(type);
4407 function_parameter_t *parameters = NULL;
4408 function_parameter_t **anchor = ¶meters;
4410 /* did we have an earlier prototype? */
4411 entity_t *proto_type = get_entity(entity->base.symbol, NAMESPACE_NORMAL);
4412 if (proto_type != NULL && proto_type->kind != ENTITY_FUNCTION)
4415 function_parameter_t *proto_parameter = NULL;
4416 if (proto_type != NULL) {
4417 type_t *proto_type_type = proto_type->declaration.type;
4418 proto_parameter = proto_type_type->function.parameters;
4419 /* If a K&R function definition has a variadic prototype earlier, then
4420 * make the function definition variadic, too. This should conform to
4421 * §6.7.5.3:15 and §6.9.1:8. */
4422 new_type->function.variadic = proto_type_type->function.variadic;
4424 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
4426 new_type->function.unspecified_parameters = true;
4429 bool need_incompatible_warning = false;
4430 parameter = entity->function.parameters.entities;
4431 for (; parameter != NULL; parameter = parameter->base.next,
4433 proto_parameter == NULL ? NULL : proto_parameter->next) {
4434 if (parameter->kind != ENTITY_PARAMETER)
4437 type_t *parameter_type = parameter->declaration.type;
4438 if (parameter_type == NULL) {
4439 position_t const* const pos = ¶meter->base.pos;
4441 errorf(pos, "no type specified for function '%N'", parameter);
4442 parameter_type = type_error_type;
4444 warningf(WARN_IMPLICIT_INT, pos, "no type specified for function parameter '%N', using 'int'", parameter);
4445 parameter_type = type_int;
4447 parameter->declaration.type = parameter_type;
4450 semantic_parameter_incomplete(parameter);
4452 /* we need the default promoted types for the function type */
4453 type_t *not_promoted = parameter_type;
4454 parameter_type = get_default_promoted_type(parameter_type);
4456 /* gcc special: if the type of the prototype matches the unpromoted
4457 * type don't promote */
4458 if (!strict_mode && proto_parameter != NULL) {
4459 type_t *proto_p_type = skip_typeref(proto_parameter->type);
4460 type_t *promo_skip = skip_typeref(parameter_type);
4461 type_t *param_skip = skip_typeref(not_promoted);
4462 if (!types_compatible(proto_p_type, promo_skip)
4463 && types_compatible(proto_p_type, param_skip)) {
4465 need_incompatible_warning = true;
4466 parameter_type = not_promoted;
4469 function_parameter_t *const function_parameter
4470 = allocate_parameter(parameter_type);
4472 *anchor = function_parameter;
4473 anchor = &function_parameter->next;
4476 new_type->function.parameters = parameters;
4477 new_type = identify_new_type(new_type);
4479 if (need_incompatible_warning) {
4480 symbol_t const *const sym = entity->base.symbol;
4481 position_t const *const pos = &entity->base.pos;
4482 position_t const *const ppos = &proto_type->base.pos;
4483 warningf(WARN_OTHER, pos, "declaration '%#N' is incompatible with '%#T' (declared %P)", proto_type, new_type, sym, ppos);
4485 entity->declaration.type = new_type;
4487 rem_anchor_token('{');
4490 static bool first_err = true;
4493 * When called with first_err set, prints the name of the current function,
4496 static void print_in_function(void)
4500 char const *const file = current_function->base.base.pos.input_name;
4501 diagnosticf("%s: In '%N':\n", file, (entity_t const*)current_function);
4506 * Check if all labels are defined in the current function.
4507 * Check if all labels are used in the current function.
4509 static void check_labels(void)
4511 for (const goto_statement_t *goto_statement = goto_first;
4512 goto_statement != NULL;
4513 goto_statement = goto_statement->next) {
4514 label_t *label = goto_statement->label;
4515 if (label->base.pos.input_name == NULL) {
4516 print_in_function();
4517 position_t const *const pos = &goto_statement->base.pos;
4518 errorf(pos, "'%N' used but not defined", (entity_t const*)label);
4522 if (is_warn_on(WARN_UNUSED_LABEL)) {
4523 for (const label_statement_t *label_statement = label_first;
4524 label_statement != NULL;
4525 label_statement = label_statement->next) {
4526 label_t *label = label_statement->label;
4528 if (! label->used) {
4529 print_in_function();
4530 position_t const *const pos = &label_statement->base.pos;
4531 warningf(WARN_UNUSED_LABEL, pos, "'%N' defined but not used", (entity_t const*)label);
4537 static void warn_unused_entity(warning_t const why, entity_t *entity, entity_t *const last)
4539 entity_t const *const end = last != NULL ? last->base.next : NULL;
4540 for (; entity != end; entity = entity->base.next) {
4541 if (!is_declaration(entity))
4544 declaration_t *declaration = &entity->declaration;
4545 if (declaration->implicit)
4548 if (!declaration->used) {
4549 print_in_function();
4550 warningf(why, &entity->base.pos, "'%N' is unused", entity);
4551 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
4552 print_in_function();
4553 warningf(why, &entity->base.pos, "'%N' is never read", entity);
4558 static void check_unused_variables(statement_t *const stmt, void *const env)
4562 switch (stmt->kind) {
4563 case STATEMENT_DECLARATION: {
4564 declaration_statement_t const *const decls = &stmt->declaration;
4565 warn_unused_entity(WARN_UNUSED_VARIABLE, decls->declarations_begin, decls->declarations_end);
4570 warn_unused_entity(WARN_UNUSED_VARIABLE, stmt->fors.scope.entities, NULL);
4579 * Check declarations of current_function for unused entities.
4581 static void check_declarations(void)
4583 if (is_warn_on(WARN_UNUSED_PARAMETER)) {
4584 const scope_t *scope = ¤t_function->parameters;
4585 warn_unused_entity(WARN_UNUSED_PARAMETER, scope->entities, NULL);
4587 if (is_warn_on(WARN_UNUSED_VARIABLE)) {
4588 walk_statements(current_function->body, check_unused_variables, NULL);
4592 static int determine_truth(expression_t const* const cond)
4595 is_constant_expression(cond) != EXPR_CLASS_CONSTANT ? 0 :
4596 fold_constant_to_bool(cond) ? 1 :
4600 static void check_reachable(statement_t *);
4601 static bool reaches_end;
4603 static bool expression_returns(expression_t const *const expr)
4605 switch (expr->kind) {
4607 expression_t const *const func = expr->call.function;
4608 type_t const *const type = skip_typeref(func->base.type);
4609 if (type->kind == TYPE_POINTER) {
4610 type_t const *const points_to
4611 = skip_typeref(type->pointer.points_to);
4612 if (points_to->kind == TYPE_FUNCTION
4613 && points_to->function.modifiers & DM_NORETURN)
4617 if (!expression_returns(func))
4620 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
4621 if (!expression_returns(arg->expression))
4628 case EXPR_REFERENCE:
4629 case EXPR_ENUM_CONSTANT:
4630 case EXPR_LITERAL_CASES:
4631 case EXPR_LITERAL_CHARACTER:
4632 case EXPR_STRING_LITERAL:
4633 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
4634 case EXPR_LABEL_ADDRESS:
4635 case EXPR_CLASSIFY_TYPE:
4636 case EXPR_SIZEOF: // TODO handle obscure VLA case
4639 case EXPR_BUILTIN_CONSTANT_P:
4640 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
4645 case EXPR_STATEMENT: {
4646 bool old_reaches_end = reaches_end;
4647 reaches_end = false;
4648 check_reachable(expr->statement.statement);
4649 bool returns = reaches_end;
4650 reaches_end = old_reaches_end;
4654 case EXPR_CONDITIONAL:
4655 // TODO handle constant expression
4657 if (!expression_returns(expr->conditional.condition))
4660 if (expr->conditional.true_expression != NULL
4661 && expression_returns(expr->conditional.true_expression))
4664 return expression_returns(expr->conditional.false_expression);
4667 return expression_returns(expr->select.compound);
4669 case EXPR_ARRAY_ACCESS:
4671 expression_returns(expr->array_access.array_ref) &&
4672 expression_returns(expr->array_access.index);
4675 return expression_returns(expr->va_starte.ap);
4678 return expression_returns(expr->va_arge.ap);
4681 return expression_returns(expr->va_copye.src);
4683 case EXPR_UNARY_CASES_MANDATORY:
4684 return expression_returns(expr->unary.value);
4686 case EXPR_UNARY_THROW:
4689 case EXPR_BINARY_CASES:
4690 // TODO handle constant lhs of && and ||
4692 expression_returns(expr->binary.left) &&
4693 expression_returns(expr->binary.right);
4696 panic("unhandled expression");
4699 static bool initializer_returns(initializer_t const *const init)
4701 switch (init->kind) {
4702 case INITIALIZER_VALUE:
4703 return expression_returns(init->value.value);
4705 case INITIALIZER_LIST: {
4706 initializer_t * const* i = init->list.initializers;
4707 initializer_t * const* const end = i + init->list.len;
4708 bool returns = true;
4709 for (; i != end; ++i) {
4710 if (!initializer_returns(*i))
4716 case INITIALIZER_STRING:
4717 case INITIALIZER_DESIGNATOR: // designators have no payload
4720 panic("unhandled initializer");
4723 static bool noreturn_candidate;
4725 static void check_reachable(statement_t *const stmt)
4727 if (stmt->base.reachable)
4729 if (stmt->kind != STATEMENT_DO_WHILE)
4730 stmt->base.reachable = true;
4732 statement_t *last = stmt;
4734 switch (stmt->kind) {
4735 case STATEMENT_ERROR:
4736 case STATEMENT_EMPTY:
4738 next = stmt->base.next;
4741 case STATEMENT_DECLARATION: {
4742 declaration_statement_t const *const decl = &stmt->declaration;
4743 entity_t const * ent = decl->declarations_begin;
4744 entity_t const *const last_decl = decl->declarations_end;
4746 for (;; ent = ent->base.next) {
4747 if (ent->kind == ENTITY_VARIABLE &&
4748 ent->variable.initializer != NULL &&
4749 !initializer_returns(ent->variable.initializer)) {
4752 if (ent == last_decl)
4756 next = stmt->base.next;
4760 case STATEMENT_COMPOUND:
4761 next = stmt->compound.statements;
4763 next = stmt->base.next;
4766 case STATEMENT_RETURN: {
4767 expression_t const *const val = stmt->returns.value;
4768 if (val == NULL || expression_returns(val))
4769 noreturn_candidate = false;
4773 case STATEMENT_IF: {
4774 if_statement_t const *const ifs = &stmt->ifs;
4775 expression_t const *const cond = ifs->condition;
4777 if (!expression_returns(cond))
4780 int const val = determine_truth(cond);
4783 check_reachable(ifs->true_statement);
4788 if (ifs->false_statement != NULL) {
4789 check_reachable(ifs->false_statement);
4793 next = stmt->base.next;
4797 case STATEMENT_SWITCH: {
4798 switch_statement_t const *const switchs = &stmt->switchs;
4799 expression_t const *const expr = switchs->expression;
4801 if (!expression_returns(expr))
4804 if (is_constant_expression(expr) == EXPR_CLASS_CONSTANT) {
4805 ir_tarval *const val = fold_constant_to_tarval(expr);
4806 case_label_statement_t * defaults = NULL;
4807 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4808 if (i->expression == NULL) {
4813 if (i->first_case == val || i->last_case == val ||
4814 ((tarval_cmp(i->first_case, val) & ir_relation_less_equal)
4815 && (tarval_cmp(val, i->last_case) & ir_relation_less_equal))) {
4816 check_reachable((statement_t*)i);
4821 if (defaults != NULL) {
4822 check_reachable((statement_t*)defaults);
4826 bool has_default = false;
4827 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4828 if (i->expression == NULL)
4831 check_reachable((statement_t*)i);
4838 next = stmt->base.next;
4842 case STATEMENT_EXPRESSION: {
4843 /* Check for noreturn function call */
4844 expression_t const *const expr = stmt->expression.expression;
4845 if (!expression_returns(expr))
4848 next = stmt->base.next;
4852 case STATEMENT_CONTINUE:
4853 for (statement_t *parent = stmt;;) {
4854 parent = parent->base.parent;
4855 if (parent == NULL) /* continue not within loop */
4859 switch (parent->kind) {
4860 case STATEMENT_DO_WHILE: goto continue_do_while;
4861 case STATEMENT_FOR: goto continue_for;
4867 case STATEMENT_BREAK:
4868 for (statement_t *parent = stmt;;) {
4869 parent = parent->base.parent;
4870 if (parent == NULL) /* break not within loop/switch */
4873 switch (parent->kind) {
4874 case STATEMENT_SWITCH:
4875 case STATEMENT_DO_WHILE:
4878 next = parent->base.next;
4879 goto found_break_parent;
4887 case STATEMENT_COMPUTED_GOTO: {
4888 if (!expression_returns(stmt->computed_goto.expression))
4891 statement_t *parent = stmt->base.parent;
4892 if (parent == NULL) /* top level goto */
4898 case STATEMENT_GOTO:
4899 next = stmt->gotos.label->statement;
4900 if (next == NULL) /* missing label */
4904 case STATEMENT_LABEL:
4905 next = stmt->label.statement;
4908 case STATEMENT_CASE_LABEL:
4909 next = stmt->case_label.statement;
4912 case STATEMENT_DO_WHILE:
4913 next = stmt->do_while.body;
4916 case STATEMENT_FOR: {
4917 for_statement_t *const fors = &stmt->fors;
4919 if (fors->condition_reachable)
4921 fors->condition_reachable = true;
4923 expression_t const *const cond = fors->condition;
4928 } else if (expression_returns(cond)) {
4929 val = determine_truth(cond);
4935 check_reachable(fors->body);
4940 next = stmt->base.next;
4944 case STATEMENT_MS_TRY: {
4945 ms_try_statement_t const *const ms_try = &stmt->ms_try;
4946 check_reachable(ms_try->try_statement);
4947 next = ms_try->final_statement;
4951 case STATEMENT_LEAVE: {
4952 statement_t *parent = stmt;
4954 parent = parent->base.parent;
4955 if (parent == NULL) /* __leave not within __try */
4958 if (parent->kind == STATEMENT_MS_TRY) {
4960 next = parent->ms_try.final_statement;
4968 panic("invalid statement kind");
4971 while (next == NULL) {
4972 next = last->base.parent;
4974 noreturn_candidate = false;
4976 type_t *const type = skip_typeref(current_function->base.type);
4977 assert(is_type_function(type));
4978 type_t *const ret = skip_typeref(type->function.return_type);
4979 if (!is_type_void(ret) &&
4980 is_type_valid(ret) &&
4981 !is_main(current_entity)) {
4982 position_t const *const pos = &stmt->base.pos;
4983 warningf(WARN_RETURN_TYPE, pos, "control reaches end of non-void function");
4988 switch (next->kind) {
4989 case STATEMENT_ERROR:
4990 case STATEMENT_EMPTY:
4991 case STATEMENT_DECLARATION:
4992 case STATEMENT_EXPRESSION:
4994 case STATEMENT_RETURN:
4995 case STATEMENT_CONTINUE:
4996 case STATEMENT_BREAK:
4997 case STATEMENT_COMPUTED_GOTO:
4998 case STATEMENT_GOTO:
4999 case STATEMENT_LEAVE:
5000 panic("invalid control flow in function");
5002 case STATEMENT_COMPOUND:
5003 if (next->compound.stmt_expr) {
5009 case STATEMENT_SWITCH:
5010 case STATEMENT_LABEL:
5011 case STATEMENT_CASE_LABEL:
5013 next = next->base.next;
5016 case STATEMENT_DO_WHILE: {
5018 if (next->base.reachable)
5020 next->base.reachable = true;
5022 do_while_statement_t const *const dw = &next->do_while;
5023 expression_t const *const cond = dw->condition;
5025 if (!expression_returns(cond))
5028 int const val = determine_truth(cond);
5031 check_reachable(dw->body);
5037 next = next->base.next;
5041 case STATEMENT_FOR: {
5043 for_statement_t *const fors = &next->fors;
5045 fors->step_reachable = true;
5047 if (fors->condition_reachable)
5049 fors->condition_reachable = true;
5051 expression_t const *const cond = fors->condition;
5056 } else if (expression_returns(cond)) {
5057 val = determine_truth(cond);
5063 check_reachable(fors->body);
5069 next = next->base.next;
5073 case STATEMENT_MS_TRY:
5075 next = next->ms_try.final_statement;
5080 check_reachable(next);
5083 static void check_unreachable(statement_t* const stmt, void *const env)
5087 switch (stmt->kind) {
5088 case STATEMENT_DO_WHILE:
5089 if (!stmt->base.reachable) {
5090 expression_t const *const cond = stmt->do_while.condition;
5091 if (determine_truth(cond) >= 0) {
5092 position_t const *const pos = &cond->base.pos;
5093 warningf(WARN_UNREACHABLE_CODE, pos, "condition of do-while-loop is unreachable");
5098 case STATEMENT_FOR: {
5099 for_statement_t const* const fors = &stmt->fors;
5101 // if init and step are unreachable, cond is unreachable, too
5102 if (!stmt->base.reachable && !fors->step_reachable) {
5103 goto warn_unreachable;
5105 if (!stmt->base.reachable && fors->initialisation != NULL) {
5106 position_t const *const pos = &fors->initialisation->base.pos;
5107 warningf(WARN_UNREACHABLE_CODE, pos, "initialisation of for-statement is unreachable");
5110 if (!fors->condition_reachable && fors->condition != NULL) {
5111 position_t const *const pos = &fors->condition->base.pos;
5112 warningf(WARN_UNREACHABLE_CODE, pos, "condition of for-statement is unreachable");
5115 if (!fors->step_reachable && fors->step != NULL) {
5116 position_t const *const pos = &fors->step->base.pos;
5117 warningf(WARN_UNREACHABLE_CODE, pos, "step of for-statement is unreachable");
5123 case STATEMENT_COMPOUND:
5124 if (stmt->compound.statements != NULL)
5126 goto warn_unreachable;
5128 case STATEMENT_DECLARATION: {
5129 /* Only warn if there is at least one declarator with an initializer.
5130 * This typically occurs in switch statements. */
5131 declaration_statement_t const *const decl = &stmt->declaration;
5132 entity_t const * ent = decl->declarations_begin;
5133 entity_t const *const last = decl->declarations_end;
5135 for (;; ent = ent->base.next) {
5136 if (ent->kind == ENTITY_VARIABLE &&
5137 ent->variable.initializer != NULL) {
5138 goto warn_unreachable;
5148 if (!stmt->base.reachable) {
5149 position_t const *const pos = &stmt->base.pos;
5150 warningf(WARN_UNREACHABLE_CODE, pos, "statement is unreachable");
5156 static bool is_main(entity_t *entity)
5158 static symbol_t *sym_main = NULL;
5159 if (sym_main == NULL) {
5160 sym_main = symbol_table_insert("main");
5163 if (entity->base.symbol != sym_main)
5165 /* must be in outermost scope */
5166 if (entity->base.parent_scope != file_scope)
5172 static void prepare_main_collect2(entity_t*);
5174 static void parse_external_declaration(void)
5176 /* function-definitions and declarations both start with declaration
5178 add_anchor_token(';');
5179 declaration_specifiers_t specifiers;
5180 parse_declaration_specifiers(&specifiers);
5181 rem_anchor_token(';');
5183 /* must be a declaration */
5184 if (token.kind == ';') {
5185 parse_anonymous_declaration_rest(&specifiers);
5189 add_anchor_token(',');
5190 add_anchor_token('=');
5191 add_anchor_token(';');
5192 add_anchor_token('{');
5194 /* declarator is common to both function-definitions and declarations */
5195 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
5197 rem_anchor_token('{');
5198 rem_anchor_token(';');
5199 rem_anchor_token('=');
5200 rem_anchor_token(',');
5202 /* must be a declaration */
5203 switch (token.kind) {
5207 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
5212 /* must be a function definition */
5213 parse_kr_declaration_list(ndeclaration);
5215 if (token.kind != '{') {
5216 parse_error_expected("while parsing function definition", '{', NULL);
5217 eat_until_matching_token(';');
5221 assert(is_declaration(ndeclaration));
5222 type_t *const orig_type = ndeclaration->declaration.type;
5223 type_t * type = skip_typeref(orig_type);
5225 if (!is_type_function(type)) {
5226 if (is_type_valid(type)) {
5227 errorf(HERE, "declarator '%#N' has a body but is not a function type", ndeclaration);
5233 position_t const *const pos = &ndeclaration->base.pos;
5234 if (is_typeref(orig_type)) {
5236 errorf(pos, "type of function definition '%#N' is a typedef", ndeclaration);
5239 if (is_type_compound(skip_typeref(type->function.return_type))) {
5240 warningf(WARN_AGGREGATE_RETURN, pos, "'%N' returns an aggregate", ndeclaration);
5242 if (type->function.unspecified_parameters) {
5243 warningf(WARN_OLD_STYLE_DEFINITION, pos, "old-style definition of '%N'", ndeclaration);
5245 warningf(WARN_TRADITIONAL, pos, "traditional C rejects ISO C style definition of '%N'", ndeclaration);
5248 /* §6.7.5.3:14 a function definition with () means no
5249 * parameters (and not unspecified parameters) */
5250 if (type->function.unspecified_parameters &&
5251 type->function.parameters == NULL) {
5252 type_t *copy = duplicate_type(type);
5253 copy->function.unspecified_parameters = false;
5254 type = identify_new_type(copy);
5256 ndeclaration->declaration.type = type;
5259 entity_t *const entity = record_entity(ndeclaration, true);
5260 assert(entity->kind == ENTITY_FUNCTION);
5261 assert(ndeclaration->kind == ENTITY_FUNCTION);
5263 function_t *const function = &entity->function;
5264 if (ndeclaration != entity) {
5265 function->parameters = ndeclaration->function.parameters;
5268 PUSH_SCOPE(&function->parameters);
5270 entity_t *parameter = function->parameters.entities;
5271 for (; parameter != NULL; parameter = parameter->base.next) {
5272 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5273 parameter->base.parent_scope = current_scope;
5275 assert(parameter->base.parent_scope == NULL
5276 || parameter->base.parent_scope == current_scope);
5277 parameter->base.parent_scope = current_scope;
5278 if (parameter->base.symbol == NULL) {
5279 errorf(¶meter->base.pos, "parameter name omitted");
5282 environment_push(parameter);
5285 if (function->body != NULL) {
5286 parser_error_multiple_definition(entity, HERE);
5289 /* parse function body */
5290 int label_stack_top = label_top();
5291 function_t *old_current_function = current_function;
5292 current_function = function;
5293 PUSH_CURRENT_ENTITY(entity);
5297 goto_anchor = &goto_first;
5299 label_anchor = &label_first;
5301 statement_t *const body = parse_compound_statement(false);
5302 function->body = body;
5305 check_declarations();
5306 if (is_warn_on(WARN_RETURN_TYPE) ||
5307 is_warn_on(WARN_UNREACHABLE_CODE) ||
5308 (is_warn_on(WARN_MISSING_NORETURN) && !(function->base.modifiers & DM_NORETURN))) {
5309 noreturn_candidate = true;
5310 check_reachable(body);
5311 if (is_warn_on(WARN_UNREACHABLE_CODE))
5312 walk_statements(body, check_unreachable, NULL);
5313 if (noreturn_candidate &&
5314 !(function->base.modifiers & DM_NORETURN)) {
5315 position_t const *const pos = &body->base.pos;
5316 warningf(WARN_MISSING_NORETURN, pos, "function '%#N' is candidate for attribute 'noreturn'", entity);
5320 if (is_main(entity)) {
5321 /* Force main to C linkage. */
5322 type_t *const type = entity->declaration.type;
5323 assert(is_type_function(type));
5324 if (type->function.linkage != LINKAGE_C) {
5325 type_t *new_type = duplicate_type(type);
5326 new_type->function.linkage = LINKAGE_C;
5327 entity->declaration.type = identify_new_type(new_type);
5330 if (enable_main_collect2_hack)
5331 prepare_main_collect2(entity);
5334 POP_CURRENT_ENTITY();
5336 assert(current_function == function);
5337 current_function = old_current_function;
5338 label_pop_to(label_stack_top);
5344 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
5346 entity_t *iter = compound->members.entities;
5347 for (; iter != NULL; iter = iter->base.next) {
5348 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5351 if (iter->base.symbol == symbol) {
5353 } else if (iter->base.symbol == NULL) {
5354 /* search in anonymous structs and unions */
5355 type_t *type = skip_typeref(iter->declaration.type);
5356 if (is_type_compound(type)) {
5357 if (find_compound_entry(type->compound.compound, symbol)
5368 static void check_deprecated(const position_t *pos, const entity_t *entity)
5370 if (!is_declaration(entity))
5372 if ((entity->declaration.modifiers & DM_DEPRECATED) == 0)
5375 position_t const *const epos = &entity->base.pos;
5376 char const *const msg = get_deprecated_string(entity->declaration.attributes);
5378 warningf(WARN_DEPRECATED_DECLARATIONS, pos, "'%N' is deprecated (declared %P): \"%s\"", entity, epos, msg);
5380 warningf(WARN_DEPRECATED_DECLARATIONS, pos, "'%N' is deprecated (declared %P)", entity, epos);
5385 static expression_t *create_select(const position_t *pos, expression_t *addr,
5386 type_qualifiers_t qualifiers,
5389 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
5391 check_deprecated(pos, entry);
5393 expression_t *select = allocate_expression_zero(EXPR_SELECT);
5394 select->select.compound = addr;
5395 select->select.compound_entry = entry;
5397 type_t *entry_type = entry->declaration.type;
5398 type_t *res_type = get_qualified_type(entry_type, qualifiers);
5400 /* bitfields need special treatment */
5401 if (entry->compound_member.bitfield) {
5402 unsigned bit_size = entry->compound_member.bit_size;
5403 /* if fewer bits than an int, convert to int (see §6.3.1.1) */
5404 if (bit_size < get_atomic_type_size(ATOMIC_TYPE_INT) * BITS_PER_BYTE) {
5405 res_type = type_int;
5409 /* we always do the auto-type conversions; the & and sizeof parser contains
5410 * code to revert this! */
5411 select->base.type = automatic_type_conversion(res_type);
5418 * Find entry with symbol in compound. Search anonymous structs and unions and
5419 * creates implicit select expressions for them.
5420 * Returns the adress for the innermost compound.
5422 static expression_t *find_create_select(const position_t *pos,
5424 type_qualifiers_t qualifiers,
5425 compound_t *compound, symbol_t *symbol)
5427 entity_t *iter = compound->members.entities;
5428 for (; iter != NULL; iter = iter->base.next) {
5429 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5432 symbol_t *iter_symbol = iter->base.symbol;
5433 if (iter_symbol == NULL) {
5434 type_t *type = iter->declaration.type;
5435 if (!is_type_compound(type))
5438 compound_t *sub_compound = type->compound.compound;
5440 if (find_compound_entry(sub_compound, symbol) == NULL)
5443 expression_t *sub_addr = create_select(pos, addr, qualifiers, iter);
5444 sub_addr->base.pos = *pos;
5445 sub_addr->base.implicit = true;
5446 return find_create_select(pos, sub_addr, qualifiers, sub_compound,
5450 if (iter_symbol == symbol) {
5451 return create_select(pos, addr, qualifiers, iter);
5458 static void parse_bitfield_member(entity_t *entity)
5462 expression_t *size = parse_constant_expression();
5465 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5466 type_t *type = entity->declaration.type;
5467 if (!is_type_integer(skip_typeref(type))) {
5468 errorf(HERE, "bitfield base type '%T' is not an integer type",
5472 if (is_constant_expression(size) != EXPR_CLASS_CONSTANT) {
5473 /* error already reported by parse_constant_expression */
5474 size_long = get_type_size(type) * 8;
5476 size_long = fold_constant_to_int(size);
5478 const symbol_t *symbol = entity->base.symbol;
5479 const symbol_t *user_symbol
5480 = symbol == NULL ? sym_anonymous : symbol;
5481 unsigned bit_size = get_type_size(type) * 8;
5482 if (size_long < 0) {
5483 errorf(HERE, "negative width in bit-field '%Y'", user_symbol);
5484 } else if (size_long == 0 && symbol != NULL) {
5485 errorf(HERE, "zero width for bit-field '%Y'", user_symbol);
5486 } else if (bit_size > 0 && (unsigned)size_long > bit_size) {
5487 errorf(HERE, "width of bitfield '%Y' exceeds its type",
5490 /* hope that people don't invent crazy types with more bits
5491 * than our struct can hold */
5493 (1 << sizeof(entity->compound_member.bit_size)*8));
5497 entity->compound_member.bitfield = true;
5498 entity->compound_member.bit_size = (unsigned char)size_long;
5501 static void parse_compound_declarators(compound_t *compound,
5502 const declaration_specifiers_t *specifiers)
5504 add_anchor_token(';');
5505 add_anchor_token(',');
5509 if (token.kind == ':') {
5510 /* anonymous bitfield */
5511 type_t *type = specifiers->type;
5512 entity_t *const entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, NULL, HERE);
5513 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
5514 entity->declaration.storage_class = STORAGE_CLASS_NONE;
5515 entity->declaration.type = type;
5517 parse_bitfield_member(entity);
5519 attribute_t *attributes = parse_attributes(NULL);
5520 attribute_t **anchor = &attributes;
5521 while (*anchor != NULL)
5522 anchor = &(*anchor)->next;
5523 *anchor = specifiers->attributes;
5524 if (attributes != NULL) {
5525 handle_entity_attributes(attributes, entity);
5527 entity->declaration.attributes = attributes;
5529 append_entity(&compound->members, entity);
5531 entity = parse_declarator(specifiers,
5532 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
5533 position_t const *const pos = &entity->base.pos;
5534 if (entity->kind == ENTITY_TYPEDEF) {
5535 errorf(pos, "typedef not allowed as compound member");
5537 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5539 /* make sure we don't define a symbol multiple times */
5540 symbol_t *symbol = entity->base.symbol;
5541 if (symbol != NULL) {
5542 entity_t *prev = find_compound_entry(compound, symbol);
5544 position_t const *const ppos = &prev->base.pos;
5545 errorf(pos, "multiple declarations of '%N' (declared %P)", entity, ppos);
5549 if (token.kind == ':') {
5550 parse_bitfield_member(entity);
5552 attribute_t *attributes = parse_attributes(NULL);
5553 handle_entity_attributes(attributes, entity);
5555 type_t *orig_type = entity->declaration.type;
5556 type_t *type = skip_typeref(orig_type);
5557 if (is_type_function(type)) {
5558 errorf(pos, "'%N' must not have function type '%T'", entity, orig_type);
5559 } else if (is_type_incomplete(type)) {
5560 /* §6.7.2.1:16 flexible array member */
5561 if (!is_type_array(type) ||
5562 token.kind != ';' ||
5563 look_ahead(1)->kind != '}') {
5564 errorf(pos, "'%N' has incomplete type '%T'", entity, orig_type);
5565 } else if (compound->members.entities == NULL) {
5566 errorf(pos, "flexible array member in otherwise empty struct");
5571 append_entity(&compound->members, entity);
5574 } while (accept(','));
5575 rem_anchor_token(',');
5576 rem_anchor_token(';');
5579 anonymous_entity = NULL;
5582 static void parse_compound_type_entries(compound_t *compound)
5585 add_anchor_token('}');
5588 switch (token.kind) {
5590 case T___extension__:
5591 case T_IDENTIFIER: {
5593 declaration_specifiers_t specifiers;
5594 parse_declaration_specifiers(&specifiers);
5595 parse_compound_declarators(compound, &specifiers);
5601 rem_anchor_token('}');
5604 compound->complete = true;
5610 static type_t *parse_typename(void)
5612 declaration_specifiers_t specifiers;
5613 parse_declaration_specifiers(&specifiers);
5614 if (specifiers.storage_class != STORAGE_CLASS_NONE
5615 || specifiers.thread_local) {
5616 /* TODO: improve error message, user does probably not know what a
5617 * storage class is...
5619 errorf(&specifiers.pos, "typename must not have a storage class");
5622 type_t *result = parse_abstract_declarator(specifiers.type);
5630 typedef expression_t* (*parse_expression_function)(void);
5631 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
5633 typedef struct expression_parser_function_t expression_parser_function_t;
5634 struct expression_parser_function_t {
5635 parse_expression_function parser;
5636 precedence_t infix_precedence;
5637 parse_expression_infix_function infix_parser;
5640 static expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5642 static type_t *get_string_type(string_encoding_t const enc)
5644 bool const warn = is_warn_on(WARN_WRITE_STRINGS);
5646 case STRING_ENCODING_CHAR:
5647 case STRING_ENCODING_UTF8: return warn ? type_const_char_ptr : type_char_ptr;
5648 case STRING_ENCODING_CHAR16: return warn ? type_char16_t_const_ptr : type_char16_t_ptr;
5649 case STRING_ENCODING_CHAR32: return warn ? type_char32_t_const_ptr : type_char32_t_ptr;
5650 case STRING_ENCODING_WIDE: return warn ? type_const_wchar_t_ptr : type_wchar_t_ptr;
5652 panic("invalid string encoding");
5656 * Parse a string constant.
5658 static expression_t *parse_string_literal(void)
5660 expression_t *const expr = allocate_expression_zero(EXPR_STRING_LITERAL);
5661 expr->string_literal.value = concat_string_literals();
5662 expr->base.type = get_string_type(expr->string_literal.value.encoding);
5667 * Parse a boolean constant.
5669 static expression_t *parse_boolean_literal(bool value)
5671 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_BOOLEAN);
5672 literal->base.type = type_bool;
5673 literal->literal.value.begin = value ? "true" : "false";
5674 literal->literal.value.size = value ? 4 : 5;
5676 eat(value ? T_true : T_false);
5680 static void warn_traditional_suffix(char const *const suffix)
5682 warningf(WARN_TRADITIONAL, HERE, "traditional C rejects the '%s' suffix", suffix);
5685 static void check_integer_suffix(expression_t *const expr, char const *const suffix)
5687 unsigned spec = SPECIFIER_NONE;
5688 char const *c = suffix;
5691 if (*c == 'L' || *c == 'l') {
5692 add = SPECIFIER_LONG;
5694 add |= SPECIFIER_LONG_LONG;
5697 } else if (*c == 'U' || *c == 'u') {
5698 add = SPECIFIER_UNSIGNED;
5711 case SPECIFIER_NONE: type = type_int; break;
5712 case SPECIFIER_LONG: type = type_long; break;
5713 case SPECIFIER_LONG | SPECIFIER_LONG_LONG: type = type_long_long; break;
5714 case SPECIFIER_UNSIGNED: type = type_unsigned_int; break;
5715 case SPECIFIER_UNSIGNED | SPECIFIER_LONG: type = type_unsigned_long; break;
5716 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG: type = type_unsigned_long_long; break;
5717 default: panic("inconsistent suffix");
5719 if (spec != SPECIFIER_NONE && spec != SPECIFIER_LONG) {
5720 warn_traditional_suffix(suffix);
5722 expr->base.type = type;
5723 /* Integer type depends on the size of the number and the size
5724 * representable by the types. The backend/codegeneration has to
5725 * determine that. */
5726 determine_literal_type(&expr->literal);
5729 errorf(HERE, "invalid suffix '%s' on integer constant", suffix);
5733 static void check_floatingpoint_suffix(expression_t *const expr, char const *const suffix)
5736 char const *c = suffix;
5739 case 'f': type = type_float; ++c; break;
5741 case 'l': type = type_long_double; ++c; break;
5742 default: type = type_double; break;
5746 expr->base.type = type;
5747 if (suffix[0] != '\0') {
5748 warn_traditional_suffix(suffix);
5751 errorf(HERE, "invalid suffix '%s' on floatingpoint constant", suffix);
5755 static expression_t *parse_number_literal(void)
5757 string_t const *const str = &token.literal.string;
5758 char const * i = str->begin;
5759 unsigned digits = 0;
5760 bool is_float = false;
5762 /* Parse base prefix. */
5766 case 'B': case 'b': base = 2; ++i; break;
5767 case 'X': case 'x': base = 16; ++i; break;
5768 default: base = 8; digits |= 1U << 0; break;
5774 /* Parse mantissa. */
5780 errorf(HERE, "multiple decimal points in %K", &token);
5789 case '0': digit = 0; break;
5790 case '1': digit = 1; break;
5791 case '2': digit = 2; break;
5792 case '3': digit = 3; break;
5793 case '4': digit = 4; break;
5794 case '5': digit = 5; break;
5795 case '6': digit = 6; break;
5796 case '7': digit = 7; break;
5797 case '8': digit = 8; break;
5798 case '9': digit = 9; break;
5799 case 'A': case 'a': digit = 10; break;
5800 case 'B': case 'b': digit = 11; break;
5801 case 'C': case 'c': digit = 12; break;
5802 case 'D': case 'd': digit = 13; break;
5803 case 'E': case 'e': digit = 14; break;
5804 case 'F': case 'f': digit = 15; break;
5806 default: goto done_mantissa;
5809 if (digit >= 10 && base != 16)
5812 digits |= 1U << digit;
5816 /* Parse exponent. */
5820 errorf(HERE, "binary floating %K not allowed", &token);
5825 if (*i == 'E' || *i == 'e') {
5827 goto parse_exponent;
5832 if (*i == 'P' || *i == 'p') {
5837 if (*i == '-' || *i == '+')
5843 } while (isdigit(*i));
5845 errorf(HERE, "exponent of %K has no digits", &token);
5847 } else if (is_float) {
5848 errorf(HERE, "hexadecimal floating %K requires an exponent", &token);
5854 panic("invalid base");
5858 expression_t *const expr = allocate_expression_zero(is_float ? EXPR_LITERAL_FLOATINGPOINT : EXPR_LITERAL_INTEGER);
5859 expr->literal.value = *str;
5863 errorf(HERE, "%K has no digits", &token);
5864 } else if (digits & ~((1U << base) - 1)) {
5865 errorf(HERE, "invalid digit in %K", &token);
5867 expr->literal.suffix = i;
5869 check_floatingpoint_suffix(expr, i);
5871 check_integer_suffix(expr, i);
5881 * Parse a character constant.
5883 static expression_t *parse_character_constant(void)
5885 expression_t *const literal = allocate_expression_zero(EXPR_LITERAL_CHARACTER);
5886 literal->string_literal.value = token.literal.string;
5888 size_t const size = get_string_len(&token.literal.string);
5889 switch (token.literal.string.encoding) {
5890 case STRING_ENCODING_CHAR:
5891 case STRING_ENCODING_UTF8:
5892 literal->base.type = c_mode & _CXX ? type_char : type_int;
5894 if (!GNU_MODE && !(c_mode & _C99)) {
5895 errorf(HERE, "more than 1 character in character constant");
5897 literal->base.type = type_int;
5898 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
5903 case STRING_ENCODING_CHAR16: literal->base.type = type_char16_t; goto warn_multi;
5904 case STRING_ENCODING_CHAR32: literal->base.type = type_char32_t; goto warn_multi;
5905 case STRING_ENCODING_WIDE: literal->base.type = type_wchar_t; goto warn_multi;
5908 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
5913 eat(T_CHARACTER_CONSTANT);
5917 static entity_t *create_implicit_function(symbol_t *symbol, position_t const *const pos)
5919 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
5920 ntype->function.return_type = type_int;
5921 ntype->function.unspecified_parameters = true;
5922 ntype->function.linkage = LINKAGE_C;
5923 type_t *type = identify_new_type(ntype);
5925 entity_t *const entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, symbol, pos);
5926 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
5927 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
5928 entity->declaration.type = type;
5929 entity->declaration.implicit = true;
5931 if (current_scope != NULL)
5932 record_entity(entity, false);
5938 * Performs automatic type cast as described in §6.3.2.1.
5940 * @param orig_type the original type
5942 static type_t *automatic_type_conversion(type_t *orig_type)
5944 type_t *type = skip_typeref(orig_type);
5945 if (is_type_array(type)) {
5946 array_type_t *array_type = &type->array;
5947 type_t *element_type = array_type->element_type;
5948 unsigned qualifiers = array_type->base.qualifiers;
5950 return make_pointer_type(element_type, qualifiers);
5953 if (is_type_function(type)) {
5954 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
5961 * reverts the automatic casts of array to pointer types and function
5962 * to function-pointer types as defined §6.3.2.1
5964 type_t *revert_automatic_type_conversion(const expression_t *expression)
5966 switch (expression->kind) {
5967 case EXPR_REFERENCE: {
5968 entity_t *entity = expression->reference.entity;
5969 if (is_declaration(entity)) {
5970 return entity->declaration.type;
5971 } else if (entity->kind == ENTITY_ENUM_VALUE) {
5972 return entity->enum_value.enum_type;
5974 panic("no declaration or enum in reference");
5979 entity_t *entity = expression->select.compound_entry;
5980 assert(is_declaration(entity));
5981 type_t *type = entity->declaration.type;
5982 return get_qualified_type(type, expression->base.type->base.qualifiers);
5985 case EXPR_UNARY_DEREFERENCE: {
5986 const expression_t *const value = expression->unary.value;
5987 type_t *const type = skip_typeref(value->base.type);
5988 if (!is_type_pointer(type))
5989 return type_error_type;
5990 return type->pointer.points_to;
5993 case EXPR_ARRAY_ACCESS: {
5994 const expression_t *array_ref = expression->array_access.array_ref;
5995 type_t *type_left = skip_typeref(array_ref->base.type);
5996 if (!is_type_pointer(type_left))
5997 return type_error_type;
5998 return type_left->pointer.points_to;
6001 case EXPR_STRING_LITERAL: {
6002 size_t const size = get_string_len(&expression->string_literal.value) + 1;
6003 type_t *const elem = get_unqualified_type(expression->base.type->pointer.points_to);
6004 return make_array_type(elem, size, TYPE_QUALIFIER_NONE);
6007 case EXPR_COMPOUND_LITERAL:
6008 return expression->compound_literal.type;
6013 return expression->base.type;
6017 * Find an entity matching a symbol in a scope.
6018 * Uses current scope if scope is NULL
6020 static entity_t *lookup_entity(const scope_t *scope, symbol_t *symbol,
6021 namespace_tag_t namespc)
6023 if (scope == NULL) {
6024 return get_entity(symbol, namespc);
6027 /* we should optimize here, if scope grows above a certain size we should
6028 construct a hashmap here... */
6029 entity_t *entity = scope->entities;
6030 for ( ; entity != NULL; entity = entity->base.next) {
6031 if (entity->base.symbol == symbol
6032 && (namespace_tag_t)entity->base.namespc == namespc)
6039 static entity_t *parse_qualified_identifier(void)
6041 /* namespace containing the symbol */
6044 const scope_t *lookup_scope = NULL;
6046 if (accept(T_COLONCOLON))
6047 lookup_scope = &unit->scope;
6051 symbol = expect_identifier("while parsing identifier", &pos);
6053 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6056 entity = lookup_entity(lookup_scope, symbol, NAMESPACE_NORMAL);
6058 if (!accept(T_COLONCOLON))
6061 switch (entity->kind) {
6062 case ENTITY_NAMESPACE:
6063 lookup_scope = &entity->namespacee.members;
6068 lookup_scope = &entity->compound.members;
6071 errorf(&pos, "'%Y' must be a namespace, class, struct or union (but is a %s)",
6072 symbol, get_entity_kind_name(entity->kind));
6074 /* skip further qualifications */
6075 while (accept(T_IDENTIFIER) && accept(T_COLONCOLON)) {}
6077 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6081 if (entity == NULL) {
6082 if (!strict_mode && token.kind == '(') {
6083 /* an implicitly declared function */
6084 entity = create_implicit_function(symbol, &pos);
6085 warningf(WARN_IMPLICIT_FUNCTION_DECLARATION, &pos, "implicit declaration of '%N'", entity);
6087 errorf(&pos, "unknown identifier '%Y' found.", symbol);
6088 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6095 static expression_t *parse_reference(void)
6097 position_t const pos = *HERE;
6098 entity_t *const entity = parse_qualified_identifier();
6101 if (is_declaration(entity)) {
6102 orig_type = entity->declaration.type;
6103 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6104 orig_type = entity->enum_value.enum_type;
6106 panic("expected declaration or enum value in reference");
6109 /* we always do the auto-type conversions; the & and sizeof parser contains
6110 * code to revert this! */
6111 type_t *type = automatic_type_conversion(orig_type);
6113 expression_kind_t kind = EXPR_REFERENCE;
6114 if (entity->kind == ENTITY_ENUM_VALUE)
6115 kind = EXPR_ENUM_CONSTANT;
6117 expression_t *expression = allocate_expression_zero(kind);
6118 expression->base.pos = pos;
6119 expression->base.type = type;
6120 expression->reference.entity = entity;
6122 /* this declaration is used */
6123 if (is_declaration(entity)) {
6124 entity->declaration.used = true;
6127 if (entity->base.parent_scope != file_scope
6128 && (current_function != NULL
6129 && entity->base.parent_scope->depth < current_function->parameters.depth)
6130 && (entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER)) {
6131 /* access of a variable from an outer function */
6132 entity->variable.address_taken = true;
6133 current_function->need_closure = true;
6136 check_deprecated(&pos, entity);
6141 static bool semantic_cast(expression_t *cast)
6143 expression_t *expression = cast->unary.value;
6144 type_t *orig_dest_type = cast->base.type;
6145 type_t *orig_type_right = expression->base.type;
6146 type_t const *dst_type = skip_typeref(orig_dest_type);
6147 type_t const *src_type = skip_typeref(orig_type_right);
6148 position_t const *pos = &cast->base.pos;
6150 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6151 if (is_type_void(dst_type))
6154 /* only integer and pointer can be casted to pointer */
6155 if (is_type_pointer(dst_type) &&
6156 !is_type_pointer(src_type) &&
6157 !is_type_integer(src_type) &&
6158 is_type_valid(src_type)) {
6159 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6163 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6164 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6168 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6169 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6173 if (is_type_pointer(src_type) && is_type_pointer(dst_type)) {
6174 type_t *src = skip_typeref(src_type->pointer.points_to);
6175 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6176 unsigned missing_qualifiers =
6177 src->base.qualifiers & ~dst->base.qualifiers;
6178 if (missing_qualifiers != 0) {
6179 warningf(WARN_CAST_QUAL, pos, "cast discards qualifiers '%Q' in pointer target type of '%T'", missing_qualifiers, orig_type_right);
6185 static expression_t *parse_compound_literal(position_t const *const pos,
6188 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6189 expression->base.pos = *pos;
6190 bool global_scope = current_scope == file_scope;
6192 parse_initializer_env_t env;
6195 env.must_be_constant = global_scope;
6196 initializer_t *initializer = parse_initializer(&env);
6199 expression->base.type = automatic_type_conversion(type);
6200 expression->compound_literal.initializer = initializer;
6201 expression->compound_literal.type = type;
6202 expression->compound_literal.global_scope = global_scope;
6208 * Parse a cast expression.
6210 static expression_t *parse_cast(void)
6212 position_t const pos = *HERE;
6215 add_anchor_token(')');
6217 type_t *type = parse_typename();
6219 rem_anchor_token(')');
6222 if (token.kind == '{') {
6223 return parse_compound_literal(&pos, type);
6226 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6227 cast->base.pos = pos;
6229 expression_t *value = parse_subexpression(PREC_CAST);
6230 cast->base.type = type;
6231 cast->unary.value = value;
6233 if (! semantic_cast(cast)) {
6234 /* TODO: record the error in the AST. else it is impossible to detect it */
6241 * Parse a statement expression.
6243 static expression_t *parse_statement_expression(void)
6245 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6248 add_anchor_token(')');
6250 statement_t *statement = parse_compound_statement(true);
6251 statement->compound.stmt_expr = true;
6252 expression->statement.statement = statement;
6254 /* find last statement and use its type */
6255 type_t *type = type_void;
6256 const statement_t *stmt = statement->compound.statements;
6258 while (stmt->base.next != NULL)
6259 stmt = stmt->base.next;
6261 if (stmt->kind == STATEMENT_EXPRESSION) {
6262 type = stmt->expression.expression->base.type;
6265 position_t const *const pos = &expression->base.pos;
6266 warningf(WARN_OTHER, pos, "empty statement expression ({})");
6268 expression->base.type = type;
6270 rem_anchor_token(')');
6276 * Parse a parenthesized expression.
6278 static expression_t *parse_parenthesized_expression(void)
6280 token_t const* const la1 = look_ahead(1);
6281 switch (la1->kind) {
6283 /* gcc extension: a statement expression */
6284 return parse_statement_expression();
6287 if (is_typedef_symbol(la1->base.symbol)) {
6289 return parse_cast();
6294 add_anchor_token(')');
6295 expression_t *result = parse_expression();
6296 result->base.parenthesized = true;
6297 rem_anchor_token(')');
6303 static expression_t *parse_function_keyword(funcname_kind_t const kind)
6305 if (current_function == NULL) {
6306 errorf(HERE, "%K used outside of a function", &token);
6309 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6310 expression->base.type = type_char_ptr;
6311 expression->funcname.kind = kind;
6318 static designator_t *parse_designator(void)
6320 designator_t *const result = allocate_ast_zero(sizeof(result[0]));
6321 result->symbol = expect_identifier("while parsing member designator", &result->pos);
6322 if (!result->symbol)
6325 designator_t *last_designator = result;
6328 designator_t *const designator = allocate_ast_zero(sizeof(result[0]));
6329 designator->symbol = expect_identifier("while parsing member designator", &designator->pos);
6330 if (!designator->symbol)
6333 last_designator->next = designator;
6334 last_designator = designator;
6338 add_anchor_token(']');
6339 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6340 designator->pos = *HERE;
6341 designator->array_index = parse_expression();
6342 rem_anchor_token(']');
6344 if (designator->array_index == NULL) {
6348 last_designator->next = designator;
6349 last_designator = designator;
6359 * Parse the __builtin_offsetof() expression.
6361 static expression_t *parse_offsetof(void)
6363 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6364 expression->base.type = type_size_t;
6366 eat(T___builtin_offsetof);
6368 add_anchor_token(')');
6369 add_anchor_token(',');
6371 type_t *type = parse_typename();
6372 rem_anchor_token(',');
6374 designator_t *designator = parse_designator();
6375 rem_anchor_token(')');
6378 expression->offsetofe.type = type;
6379 expression->offsetofe.designator = designator;
6382 memset(&path, 0, sizeof(path));
6383 path.top_type = type;
6384 path.path = NEW_ARR_F(type_path_entry_t, 0);
6386 descend_into_subtype(&path);
6388 if (!walk_designator(&path, designator, true)) {
6389 return create_error_expression();
6392 DEL_ARR_F(path.path);
6397 static bool is_last_parameter(expression_t *const param)
6399 if (param->kind == EXPR_REFERENCE) {
6400 entity_t *const entity = param->reference.entity;
6401 if (entity->kind == ENTITY_PARAMETER &&
6402 !entity->base.next &&
6403 entity->base.parent_scope == ¤t_function->parameters) {
6408 if (!is_type_valid(skip_typeref(param->base.type)))
6415 * Parses a __builtin_va_start() expression.
6417 static expression_t *parse_va_start(void)
6419 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6421 eat(T___builtin_va_start);
6423 add_anchor_token(')');
6424 add_anchor_token(',');
6426 expression->va_starte.ap = parse_assignment_expression();
6427 rem_anchor_token(',');
6429 expression_t *const param = parse_assignment_expression();
6430 expression->va_starte.parameter = param;
6431 rem_anchor_token(')');
6434 if (!current_function) {
6435 errorf(&expression->base.pos, "'va_start' used outside of function");
6436 } else if (!current_function->base.type->function.variadic) {
6437 errorf(&expression->base.pos, "'va_start' used in non-variadic function");
6438 } else if (!is_last_parameter(param)) {
6439 errorf(¶m->base.pos, "second argument of 'va_start' must be last parameter of the current function");
6446 * Parses a __builtin_va_arg() expression.
6448 static expression_t *parse_va_arg(void)
6450 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6452 eat(T___builtin_va_arg);
6454 add_anchor_token(')');
6455 add_anchor_token(',');
6458 ap.expression = parse_assignment_expression();
6459 expression->va_arge.ap = ap.expression;
6460 check_call_argument(type_valist, &ap, 1);
6462 rem_anchor_token(',');
6464 expression->base.type = parse_typename();
6465 rem_anchor_token(')');
6472 * Parses a __builtin_va_copy() expression.
6474 static expression_t *parse_va_copy(void)
6476 expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
6478 eat(T___builtin_va_copy);
6480 add_anchor_token(')');
6481 add_anchor_token(',');
6483 expression_t *dst = parse_assignment_expression();
6484 assign_error_t error = semantic_assign(type_valist, dst);
6485 report_assign_error(error, type_valist, dst, "call argument 1",
6487 expression->va_copye.dst = dst;
6489 rem_anchor_token(',');
6492 call_argument_t src;
6493 src.expression = parse_assignment_expression();
6494 check_call_argument(type_valist, &src, 2);
6495 expression->va_copye.src = src.expression;
6496 rem_anchor_token(')');
6503 * Parses a __builtin_constant_p() expression.
6505 static expression_t *parse_builtin_constant(void)
6507 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6509 eat(T___builtin_constant_p);
6511 add_anchor_token(')');
6513 expression->builtin_constant.value = parse_assignment_expression();
6514 rem_anchor_token(')');
6516 expression->base.type = type_int;
6522 * Parses a __builtin_types_compatible_p() expression.
6524 static expression_t *parse_builtin_types_compatible(void)
6526 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
6528 eat(T___builtin_types_compatible_p);
6530 add_anchor_token(')');
6531 add_anchor_token(',');
6533 expression->builtin_types_compatible.left = parse_typename();
6534 rem_anchor_token(',');
6536 expression->builtin_types_compatible.right = parse_typename();
6537 rem_anchor_token(')');
6539 expression->base.type = type_int;
6545 * Parses a __builtin_is_*() compare expression.
6547 static expression_t *parse_compare_builtin(void)
6549 expression_kind_t kind;
6550 switch (token.kind) {
6551 case T___builtin_isgreater: kind = EXPR_BINARY_ISGREATER; break;
6552 case T___builtin_isgreaterequal: kind = EXPR_BINARY_ISGREATEREQUAL; break;
6553 case T___builtin_isless: kind = EXPR_BINARY_ISLESS; break;
6554 case T___builtin_islessequal: kind = EXPR_BINARY_ISLESSEQUAL; break;
6555 case T___builtin_islessgreater: kind = EXPR_BINARY_ISLESSGREATER; break;
6556 case T___builtin_isunordered: kind = EXPR_BINARY_ISUNORDERED; break;
6557 default: internal_errorf(HERE, "invalid compare builtin found");
6559 expression_t *const expression = allocate_expression_zero(kind);
6562 add_anchor_token(')');
6563 add_anchor_token(',');
6565 expression->binary.left = parse_assignment_expression();
6566 rem_anchor_token(',');
6568 expression->binary.right = parse_assignment_expression();
6569 rem_anchor_token(')');
6572 type_t *const orig_type_left = expression->binary.left->base.type;
6573 type_t *const orig_type_right = expression->binary.right->base.type;
6575 type_t *const type_left = skip_typeref(orig_type_left);
6576 type_t *const type_right = skip_typeref(orig_type_right);
6577 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6578 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6579 type_error_incompatible("invalid operands in comparison",
6580 &expression->base.pos, orig_type_left, orig_type_right);
6583 semantic_comparison(&expression->binary);
6590 * Parses a MS assume() expression.
6592 static expression_t *parse_assume(void)
6594 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
6598 add_anchor_token(')');
6600 expression->unary.value = parse_assignment_expression();
6601 rem_anchor_token(')');
6604 expression->base.type = type_void;
6609 * Return the label for the current symbol or create a new one.
6611 static label_t *get_label(char const *const context)
6613 assert(current_function != NULL);
6615 symbol_t *const sym = expect_identifier(context, NULL);
6619 entity_t *label = get_entity(sym, NAMESPACE_LABEL);
6620 /* If we find a local label, we already created the declaration. */
6621 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
6622 if (label->base.parent_scope != current_scope) {
6623 assert(label->base.parent_scope->depth < current_scope->depth);
6624 current_function->goto_to_outer = true;
6626 } else if (label == NULL || label->base.parent_scope != ¤t_function->parameters) {
6627 /* There is no matching label in the same function, so create a new one. */
6628 position_t const nowhere = { NULL, 0, 0, false };
6629 label = allocate_entity_zero(ENTITY_LABEL, NAMESPACE_LABEL, sym, &nowhere);
6633 return &label->label;
6637 * Parses a GNU && label address expression.
6639 static expression_t *parse_label_address(void)
6641 position_t const pos = *HERE;
6644 label_t *const label = get_label("while parsing label address");
6646 return create_error_expression();
6649 label->address_taken = true;
6651 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
6652 expression->base.pos = pos;
6654 /* label address is treated as a void pointer */
6655 expression->base.type = type_void_ptr;
6656 expression->label_address.label = label;
6661 * Parse a microsoft __noop expression.
6663 static expression_t *parse_noop_expression(void)
6665 /* the result is a (int)0 */
6666 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_MS_NOOP);
6667 literal->base.type = type_int;
6668 literal->literal.value.begin = "__noop";
6669 literal->literal.value.size = 6;
6673 if (token.kind == '(') {
6674 /* parse arguments */
6676 add_anchor_token(')');
6677 add_anchor_token(',');
6679 if (token.kind != ')') do {
6680 (void)parse_assignment_expression();
6681 } while (accept(','));
6683 rem_anchor_token(',');
6684 rem_anchor_token(')');
6692 * Parses a primary expression.
6694 static expression_t *parse_primary_expression(void)
6696 switch (token.kind) {
6697 case T_false: return parse_boolean_literal(false);
6698 case T_true: return parse_boolean_literal(true);
6699 case T_NUMBER: return parse_number_literal();
6700 case T_CHARACTER_CONSTANT: return parse_character_constant();
6701 case T_STRING_LITERAL: return parse_string_literal();
6702 case T___func__: return parse_function_keyword(FUNCNAME_FUNCTION);
6703 case T___PRETTY_FUNCTION__: return parse_function_keyword(FUNCNAME_PRETTY_FUNCTION);
6704 case T___FUNCSIG__: return parse_function_keyword(FUNCNAME_FUNCSIG);
6705 case T___FUNCDNAME__: return parse_function_keyword(FUNCNAME_FUNCDNAME);
6706 case T___builtin_offsetof: return parse_offsetof();
6707 case T___builtin_va_start: return parse_va_start();
6708 case T___builtin_va_arg: return parse_va_arg();
6709 case T___builtin_va_copy: return parse_va_copy();
6710 case T___builtin_isgreater:
6711 case T___builtin_isgreaterequal:
6712 case T___builtin_isless:
6713 case T___builtin_islessequal:
6714 case T___builtin_islessgreater:
6715 case T___builtin_isunordered: return parse_compare_builtin();
6716 case T___builtin_constant_p: return parse_builtin_constant();
6717 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
6718 case T__assume: return parse_assume();
6721 return parse_label_address();
6724 case '(': return parse_parenthesized_expression();
6725 case T___noop: return parse_noop_expression();
6727 /* Gracefully handle type names while parsing expressions. */
6729 return parse_reference();
6731 if (!is_typedef_symbol(token.base.symbol)) {
6732 return parse_reference();
6736 position_t const pos = *HERE;
6737 declaration_specifiers_t specifiers;
6738 parse_declaration_specifiers(&specifiers);
6739 type_t const *const type = parse_abstract_declarator(specifiers.type);
6740 errorf(&pos, "encountered type '%T' while parsing expression", type);
6741 return create_error_expression();
6745 errorf(HERE, "unexpected token %K, expected an expression", &token);
6747 return create_error_expression();
6750 static expression_t *parse_array_expression(expression_t *left)
6752 expression_t *const expr = allocate_expression_zero(EXPR_ARRAY_ACCESS);
6753 array_access_expression_t *const arr = &expr->array_access;
6756 add_anchor_token(']');
6758 expression_t *const inside = parse_expression();
6760 type_t *const orig_type_left = left->base.type;
6761 type_t *const orig_type_inside = inside->base.type;
6763 type_t *const type_left = skip_typeref(orig_type_left);
6764 type_t *const type_inside = skip_typeref(orig_type_inside);
6770 if (is_type_pointer(type_left)) {
6773 idx_type = type_inside;
6774 res_type = type_left->pointer.points_to;
6776 } else if (is_type_pointer(type_inside)) {
6777 arr->flipped = true;
6780 idx_type = type_left;
6781 res_type = type_inside->pointer.points_to;
6783 res_type = automatic_type_conversion(res_type);
6784 if (!is_type_integer(idx_type)) {
6785 if (is_type_valid(idx_type))
6786 errorf(&idx->base.pos, "array subscript must have integer type");
6787 } else if (is_type_atomic(idx_type, ATOMIC_TYPE_CHAR)) {
6788 position_t const *const pos = &idx->base.pos;
6789 warningf(WARN_CHAR_SUBSCRIPTS, pos, "array subscript has char type");
6792 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
6793 errorf(&expr->base.pos, "invalid types '%T[%T]' for array access", orig_type_left, orig_type_inside);
6795 res_type = type_error_type;
6800 arr->array_ref = ref;
6802 arr->base.type = res_type;
6804 rem_anchor_token(']');
6809 static bool is_bitfield(const expression_t *expression)
6811 return expression->kind == EXPR_SELECT
6812 && expression->select.compound_entry->compound_member.bitfield;
6815 static expression_t *parse_typeprop(expression_kind_t const kind)
6817 expression_t *tp_expression = allocate_expression_zero(kind);
6818 tp_expression->base.type = type_size_t;
6820 eat(kind == EXPR_SIZEOF ? T_sizeof : T__Alignof);
6823 expression_t *expression;
6824 if (token.kind == '(' && is_declaration_specifier(look_ahead(1))) {
6825 position_t const pos = *HERE;
6827 add_anchor_token(')');
6828 orig_type = parse_typename();
6829 rem_anchor_token(')');
6832 if (token.kind == '{') {
6833 /* It was not sizeof(type) after all. It is sizeof of an expression
6834 * starting with a compound literal */
6835 expression = parse_compound_literal(&pos, orig_type);
6836 goto typeprop_expression;
6839 expression = parse_subexpression(PREC_UNARY);
6841 typeprop_expression:
6842 if (is_bitfield(expression)) {
6843 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6844 errorf(&tp_expression->base.pos,
6845 "operand of %s expression must not be a bitfield", what);
6848 tp_expression->typeprop.tp_expression = expression;
6850 orig_type = revert_automatic_type_conversion(expression);
6851 expression->base.type = orig_type;
6854 tp_expression->typeprop.type = orig_type;
6855 type_t const* const type = skip_typeref(orig_type);
6856 char const* wrong_type = NULL;
6857 if (is_type_incomplete(type)) {
6858 if (!is_type_void(type) || !GNU_MODE)
6859 wrong_type = "incomplete";
6860 } else if (type->kind == TYPE_FUNCTION) {
6862 /* function types are allowed (and return 1) */
6863 position_t const *const pos = &tp_expression->base.pos;
6864 char const *const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6865 warningf(WARN_OTHER, pos, "%s expression with function argument returns invalid result", what);
6867 wrong_type = "function";
6871 if (wrong_type != NULL) {
6872 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6873 errorf(&tp_expression->base.pos,
6874 "operand of %s expression must not be of %s type '%T'",
6875 what, wrong_type, orig_type);
6878 return tp_expression;
6881 static expression_t *parse_sizeof(void)
6883 return parse_typeprop(EXPR_SIZEOF);
6886 static expression_t *parse_alignof(void)
6888 return parse_typeprop(EXPR_ALIGNOF);
6891 static expression_t *parse_select_expression(expression_t *addr)
6893 assert(token.kind == '.' || token.kind == T_MINUSGREATER);
6894 bool select_left_arrow = (token.kind == T_MINUSGREATER);
6895 position_t const pos = *HERE;
6898 symbol_t *const symbol = expect_identifier("while parsing select", NULL);
6900 return create_error_expression();
6902 type_t *const orig_type = addr->base.type;
6903 type_t *const type = skip_typeref(orig_type);
6906 bool saw_error = false;
6907 if (is_type_pointer(type)) {
6908 if (!select_left_arrow) {
6910 "request for member '%Y' in something not a struct or union, but '%T'",
6914 type_left = skip_typeref(type->pointer.points_to);
6916 if (select_left_arrow && is_type_valid(type)) {
6917 errorf(&pos, "left hand side of '->' is not a pointer, but '%T'", orig_type);
6923 if (!is_type_compound(type_left)) {
6924 if (is_type_valid(type_left) && !saw_error) {
6926 "request for member '%Y' in something not a struct or union, but '%T'",
6929 return create_error_expression();
6932 compound_t *compound = type_left->compound.compound;
6933 if (!compound->complete) {
6934 errorf(&pos, "request for member '%Y' in incomplete type '%T'",
6936 return create_error_expression();
6939 type_qualifiers_t qualifiers = type_left->base.qualifiers;
6940 expression_t *result =
6941 find_create_select(&pos, addr, qualifiers, compound, symbol);
6943 if (result == NULL) {
6944 errorf(&pos, "'%T' has no member named '%Y'", orig_type, symbol);
6945 return create_error_expression();
6951 static void check_call_argument(type_t *expected_type,
6952 call_argument_t *argument, unsigned pos)
6954 type_t *expected_type_skip = skip_typeref(expected_type);
6955 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
6956 expression_t *arg_expr = argument->expression;
6957 type_t *arg_type = skip_typeref(arg_expr->base.type);
6959 /* handle transparent union gnu extension */
6960 if (is_type_union(expected_type_skip)
6961 && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
6962 compound_t *union_decl = expected_type_skip->compound.compound;
6963 type_t *best_type = NULL;
6964 entity_t *entry = union_decl->members.entities;
6965 for ( ; entry != NULL; entry = entry->base.next) {
6966 assert(is_declaration(entry));
6967 type_t *decl_type = entry->declaration.type;
6968 error = semantic_assign(decl_type, arg_expr);
6969 if (error == ASSIGN_ERROR_INCOMPATIBLE
6970 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
6973 if (error == ASSIGN_SUCCESS) {
6974 best_type = decl_type;
6975 } else if (best_type == NULL) {
6976 best_type = decl_type;
6980 if (best_type != NULL) {
6981 expected_type = best_type;
6985 error = semantic_assign(expected_type, arg_expr);
6986 argument->expression = create_implicit_cast(arg_expr, expected_type);
6988 if (error != ASSIGN_SUCCESS) {
6989 /* report exact scope in error messages (like "in argument 3") */
6991 snprintf(buf, sizeof(buf), "call argument %u", pos);
6992 report_assign_error(error, expected_type, arg_expr, buf,
6993 &arg_expr->base.pos);
6995 type_t *const promoted_type = get_default_promoted_type(arg_type);
6996 if (!types_compatible(expected_type_skip, promoted_type) &&
6997 !types_compatible(expected_type_skip, type_void_ptr) &&
6998 !types_compatible(type_void_ptr, promoted_type)) {
6999 /* Deliberately show the skipped types in this warning */
7000 position_t const *const apos = &arg_expr->base.pos;
7001 warningf(WARN_TRADITIONAL, apos, "passing call argument %u as '%T' rather than '%T' due to prototype", pos, expected_type_skip, promoted_type);
7007 * Handle the semantic restrictions of builtin calls
7009 static void handle_builtin_argument_restrictions(call_expression_t *call)
7011 entity_t *entity = call->function->reference.entity;
7012 switch (entity->function.btk) {
7014 switch (entity->function.b.firm_builtin_kind) {
7015 case ir_bk_return_address:
7016 case ir_bk_frame_address: {
7017 /* argument must be constant */
7018 call_argument_t *argument = call->arguments;
7020 if (is_constant_expression(argument->expression) == EXPR_CLASS_VARIABLE) {
7021 errorf(&call->base.pos,
7022 "argument of '%Y' must be a constant expression",
7023 call->function->reference.entity->base.symbol);
7027 case ir_bk_prefetch:
7028 /* second and third argument must be constant if existent */
7029 if (call->arguments == NULL)
7031 call_argument_t *rw = call->arguments->next;
7032 call_argument_t *locality = NULL;
7035 if (is_constant_expression(rw->expression) == EXPR_CLASS_VARIABLE) {
7036 errorf(&call->base.pos,
7037 "second argument of '%Y' must be a constant expression",
7038 call->function->reference.entity->base.symbol);
7040 locality = rw->next;
7042 if (locality != NULL) {
7043 if (is_constant_expression(locality->expression) == EXPR_CLASS_VARIABLE) {
7044 errorf(&call->base.pos,
7045 "third argument of '%Y' must be a constant expression",
7046 call->function->reference.entity->base.symbol);
7054 case BUILTIN_OBJECT_SIZE:
7055 if (call->arguments == NULL)
7058 call_argument_t *arg = call->arguments->next;
7059 if (arg != NULL && is_constant_expression(arg->expression) == EXPR_CLASS_VARIABLE) {
7060 errorf(&call->base.pos,
7061 "second argument of '%Y' must be a constant expression",
7062 call->function->reference.entity->base.symbol);
7071 * Parse a call expression, i.e. expression '( ... )'.
7073 * @param expression the function address
7075 static expression_t *parse_call_expression(expression_t *expression)
7077 expression_t *result = allocate_expression_zero(EXPR_CALL);
7078 call_expression_t *call = &result->call;
7079 call->function = expression;
7081 type_t *const orig_type = expression->base.type;
7082 type_t *const type = skip_typeref(orig_type);
7084 function_type_t *function_type = NULL;
7085 if (is_type_pointer(type)) {
7086 type_t *const to_type = skip_typeref(type->pointer.points_to);
7088 if (is_type_function(to_type)) {
7089 function_type = &to_type->function;
7090 call->base.type = function_type->return_type;
7094 if (function_type == NULL && is_type_valid(type)) {
7096 "called object '%E' (type '%T') is not a pointer to a function",
7097 expression, orig_type);
7100 /* parse arguments */
7102 add_anchor_token(')');
7103 add_anchor_token(',');
7105 if (token.kind != ')') {
7106 call_argument_t **anchor = &call->arguments;
7108 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7109 argument->expression = parse_assignment_expression();
7112 anchor = &argument->next;
7113 } while (accept(','));
7115 rem_anchor_token(',');
7116 rem_anchor_token(')');
7119 if (function_type == NULL)
7122 /* check type and count of call arguments */
7123 function_parameter_t *parameter = function_type->parameters;
7124 call_argument_t *argument = call->arguments;
7125 if (!function_type->unspecified_parameters) {
7126 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7127 parameter = parameter->next, argument = argument->next) {
7128 check_call_argument(parameter->type, argument, ++pos);
7131 if (parameter != NULL) {
7132 errorf(&expression->base.pos, "too few arguments to function '%E'",
7134 } else if (argument != NULL && !function_type->variadic) {
7135 errorf(&argument->expression->base.pos,
7136 "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.pos,
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 position_t const *const pos = &expression->base.pos;
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 position_t const *const pos = &expr->base.pos;
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 position_t const *const pos = &expr->base.pos;
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.pos, "%s must have scalar type", context);
7243 * Parse a conditional expression, i.e. 'expression ? ... : ...'.
7245 * @param expression the conditional expression
7247 static expression_t *parse_conditional_expression(expression_t *expression)
7249 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7251 conditional_expression_t *conditional = &result->conditional;
7252 conditional->condition = expression;
7255 add_anchor_token(':');
7257 /* §6.5.15:2 The first operand shall have scalar type. */
7258 semantic_condition(expression, "condition of conditional operator");
7260 expression_t *true_expression = expression;
7261 bool gnu_cond = false;
7262 if (GNU_MODE && token.kind == ':') {
7265 true_expression = parse_expression();
7267 rem_anchor_token(':');
7269 expression_t *false_expression =
7270 parse_subexpression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7272 type_t *const orig_true_type = true_expression->base.type;
7273 type_t *const orig_false_type = false_expression->base.type;
7274 type_t *const true_type = skip_typeref(orig_true_type);
7275 type_t *const false_type = skip_typeref(orig_false_type);
7278 position_t const *const pos = &conditional->base.pos;
7279 type_t *result_type;
7280 if (is_type_void(true_type) || is_type_void(false_type)) {
7281 /* ISO/IEC 14882:1998(E) §5.16:2 */
7282 if (true_expression->kind == EXPR_UNARY_THROW) {
7283 result_type = false_type;
7284 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7285 result_type = true_type;
7287 if (!is_type_void(true_type) || !is_type_void(false_type)) {
7288 warningf(WARN_OTHER, pos, "ISO C forbids conditional expression with only one void side");
7290 result_type = type_void;
7292 } else if (is_type_arithmetic(true_type)
7293 && is_type_arithmetic(false_type)) {
7294 result_type = semantic_arithmetic(true_type, false_type);
7295 } else if (same_compound_type(true_type, false_type)) {
7296 /* just take 1 of the 2 types */
7297 result_type = true_type;
7298 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7299 type_t *pointer_type;
7301 expression_t *other_expression;
7302 if (is_type_pointer(true_type) &&
7303 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7304 pointer_type = true_type;
7305 other_type = false_type;
7306 other_expression = false_expression;
7308 pointer_type = false_type;
7309 other_type = true_type;
7310 other_expression = true_expression;
7313 if (is_null_pointer_constant(other_expression)) {
7314 result_type = pointer_type;
7315 } else if (is_type_pointer(other_type)) {
7316 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7317 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7320 if (is_type_void(to1) || is_type_void(to2)) {
7322 } else if (types_compatible(get_unqualified_type(to1),
7323 get_unqualified_type(to2))) {
7326 warningf(WARN_OTHER, pos, "pointer types '%T' and '%T' in conditional expression are incompatible", true_type, false_type);
7330 type_t *const type =
7331 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7332 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7333 } else if (is_type_integer(other_type)) {
7334 warningf(WARN_OTHER, pos, "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7335 result_type = pointer_type;
7337 goto types_incompatible;
7341 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7342 type_error_incompatible("while parsing conditional", pos, true_type, false_type);
7344 result_type = type_error_type;
7347 conditional->true_expression
7348 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7349 conditional->false_expression
7350 = create_implicit_cast(false_expression, result_type);
7351 conditional->base.type = result_type;
7356 * Parse an extension expression.
7358 static expression_t *parse_extension(void)
7361 expression_t *expression = parse_subexpression(PREC_UNARY);
7367 * Parse a __builtin_classify_type() expression.
7369 static expression_t *parse_builtin_classify_type(void)
7371 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7372 result->base.type = type_int;
7374 eat(T___builtin_classify_type);
7376 add_anchor_token(')');
7378 expression_t *expression = parse_expression();
7379 rem_anchor_token(')');
7381 result->classify_type.type_expression = expression;
7387 * Parse a delete expression
7388 * ISO/IEC 14882:1998(E) §5.3.5
7390 static expression_t *parse_delete(void)
7392 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7393 result->base.type = type_void;
7398 result->kind = EXPR_UNARY_DELETE_ARRAY;
7402 expression_t *const value = parse_subexpression(PREC_CAST);
7403 result->unary.value = value;
7405 type_t *const type = skip_typeref(value->base.type);
7406 if (!is_type_pointer(type)) {
7407 if (is_type_valid(type)) {
7408 errorf(&value->base.pos,
7409 "operand of delete must have pointer type");
7411 } else if (is_type_void(skip_typeref(type->pointer.points_to))) {
7412 position_t const *const pos = &value->base.pos;
7413 warningf(WARN_OTHER, pos, "deleting 'void*' is undefined");
7420 * Parse a throw expression
7421 * ISO/IEC 14882:1998(E) §15:1
7423 static expression_t *parse_throw(void)
7425 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7426 result->base.type = type_void;
7430 expression_t *value = NULL;
7431 switch (token.kind) {
7433 value = parse_assignment_expression();
7434 /* ISO/IEC 14882:1998(E) §15.1:3 */
7435 type_t *const orig_type = value->base.type;
7436 type_t *const type = skip_typeref(orig_type);
7437 if (is_type_incomplete(type)) {
7438 errorf(&value->base.pos,
7439 "cannot throw object of incomplete type '%T'", orig_type);
7440 } else if (is_type_pointer(type)) {
7441 type_t *const points_to = skip_typeref(type->pointer.points_to);
7442 if (is_type_incomplete(points_to) && !is_type_void(points_to)) {
7443 errorf(&value->base.pos,
7444 "cannot throw pointer to incomplete type '%T'", orig_type);
7452 result->unary.value = value;
7457 static bool check_pointer_arithmetic(const position_t *pos,
7458 type_t *pointer_type,
7459 type_t *orig_pointer_type)
7461 type_t *points_to = pointer_type->pointer.points_to;
7462 points_to = skip_typeref(points_to);
7464 if (is_type_incomplete(points_to)) {
7465 if (!GNU_MODE || !is_type_void(points_to)) {
7467 "arithmetic with pointer to incomplete type '%T' not allowed",
7471 warningf(WARN_POINTER_ARITH, pos, "pointer of type '%T' used in arithmetic", orig_pointer_type);
7473 } else if (is_type_function(points_to)) {
7476 "arithmetic with pointer to function type '%T' not allowed",
7480 warningf(WARN_POINTER_ARITH, pos,
7481 "pointer to a function '%T' used in arithmetic",
7488 static bool is_lvalue(const expression_t *expression)
7490 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
7491 switch (expression->kind) {
7492 case EXPR_ARRAY_ACCESS:
7493 case EXPR_COMPOUND_LITERAL:
7494 case EXPR_REFERENCE:
7496 case EXPR_UNARY_DEREFERENCE:
7500 type_t *type = skip_typeref(expression->base.type);
7502 /* ISO/IEC 14882:1998(E) §3.10:3 */
7503 is_type_reference(type) ||
7504 /* Claim it is an lvalue, if the type is invalid. There was a parse
7505 * error before, which maybe prevented properly recognizing it as
7507 !is_type_valid(type);
7512 static void semantic_incdec(unary_expression_t *expression)
7514 type_t *const orig_type = expression->value->base.type;
7515 type_t *const type = skip_typeref(orig_type);
7516 if (is_type_pointer(type)) {
7517 if (!check_pointer_arithmetic(&expression->base.pos, type, orig_type)) {
7520 } else if (!is_type_real(type) && is_type_valid(type)) {
7521 /* TODO: improve error message */
7522 errorf(&expression->base.pos,
7523 "operation needs an arithmetic or pointer type");
7526 if (!is_lvalue(expression->value)) {
7527 /* TODO: improve error message */
7528 errorf(&expression->base.pos, "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 position_t const *const pos = &expression->base.pos;
7547 errorf(pos, "operand of unary expression must have arithmetic type, but is '%T'", orig_type);
7550 } else if (is_type_integer(type)) {
7551 promote_unary_int_expr(expression, type);
7553 expression->base.type = orig_type;
7557 static void semantic_unexpr_plus(unary_expression_t *expression)
7559 semantic_unexpr_arithmetic(expression);
7560 position_t const *const pos = &expression->base.pos;
7561 warningf(WARN_TRADITIONAL, pos, "traditional C rejects the unary plus operator");
7564 static void semantic_not(unary_expression_t *expression)
7566 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
7567 semantic_condition(expression->value, "operand of !");
7568 expression->base.type = c_mode & _CXX ? type_bool : type_int;
7571 static void semantic_complement(unary_expression_t *expression)
7573 type_t *const orig_type = expression->value->base.type;
7574 type_t *const type = skip_typeref(orig_type);
7575 if (!is_type_integer(type)) {
7576 if (is_type_valid(type)) {
7577 errorf(&expression->base.pos, "operand of ~ must be of integer type");
7582 promote_unary_int_expr(expression, type);
7585 static void semantic_dereference(unary_expression_t *expression)
7587 type_t *const orig_type = expression->value->base.type;
7588 type_t *const type = skip_typeref(orig_type);
7589 if (!is_type_pointer(type)) {
7590 if (is_type_valid(type)) {
7591 errorf(&expression->base.pos,
7592 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
7597 type_t *result_type = type->pointer.points_to;
7598 result_type = automatic_type_conversion(result_type);
7599 expression->base.type = result_type;
7603 * Record that an address is taken (expression represents an lvalue).
7605 * @param expression the expression
7606 * @param may_be_register if true, the expression might be an register
7608 static void set_address_taken(expression_t *expression, bool may_be_register)
7610 if (expression->kind != EXPR_REFERENCE)
7613 entity_t *const entity = expression->reference.entity;
7615 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
7618 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
7619 && !may_be_register) {
7620 position_t const *const pos = &expression->base.pos;
7621 errorf(pos, "address of register '%N' requested", entity);
7624 entity->variable.address_taken = true;
7628 * Check the semantic of the address taken expression.
7630 static void semantic_take_addr(unary_expression_t *expression)
7632 expression_t *value = expression->value;
7633 value->base.type = revert_automatic_type_conversion(value);
7635 type_t *orig_type = value->base.type;
7636 type_t *type = skip_typeref(orig_type);
7637 if (!is_type_valid(type))
7641 if (!is_lvalue(value)) {
7642 errorf(&expression->base.pos, "'&' requires an lvalue");
7644 if (is_bitfield(value)) {
7645 errorf(&expression->base.pos, "'&' not allowed on bitfield");
7648 set_address_taken(value, false);
7650 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
7653 #define CREATE_UNARY_EXPRESSION_PARSER(token_kind, unexpression_type, sfunc) \
7654 static expression_t *parse_##unexpression_type(void) \
7656 expression_t *unary_expression \
7657 = allocate_expression_zero(unexpression_type); \
7659 unary_expression->unary.value = parse_subexpression(PREC_UNARY); \
7661 sfunc(&unary_expression->unary); \
7663 return unary_expression; \
7666 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
7667 semantic_unexpr_arithmetic)
7668 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
7669 semantic_unexpr_plus)
7670 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
7672 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
7673 semantic_dereference)
7674 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
7676 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_COMPLEMENT,
7677 semantic_complement)
7678 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
7680 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
7683 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_kind, unexpression_type, \
7685 static expression_t *parse_##unexpression_type(expression_t *left) \
7687 expression_t *unary_expression \
7688 = allocate_expression_zero(unexpression_type); \
7690 unary_expression->unary.value = left; \
7692 sfunc(&unary_expression->unary); \
7694 return unary_expression; \
7697 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
7698 EXPR_UNARY_POSTFIX_INCREMENT,
7700 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
7701 EXPR_UNARY_POSTFIX_DECREMENT,
7704 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
7706 /* TODO: handle complex + imaginary types */
7708 type_left = get_unqualified_type(type_left);
7709 type_right = get_unqualified_type(type_right);
7711 /* §6.3.1.8 Usual arithmetic conversions */
7712 if (type_left == type_long_double || type_right == type_long_double) {
7713 return type_long_double;
7714 } else if (type_left == type_double || type_right == type_double) {
7716 } else if (type_left == type_float || type_right == type_float) {
7720 type_left = promote_integer(type_left);
7721 type_right = promote_integer(type_right);
7723 if (type_left == type_right)
7726 bool const signed_left = is_type_signed(type_left);
7727 bool const signed_right = is_type_signed(type_right);
7728 unsigned const rank_left = get_akind_rank(get_akind(type_left));
7729 unsigned const rank_right = get_akind_rank(get_akind(type_right));
7731 if (signed_left == signed_right)
7732 return rank_left >= rank_right ? type_left : type_right;
7736 atomic_type_kind_t s_akind;
7737 atomic_type_kind_t u_akind;
7742 u_type = type_right;
7744 s_type = type_right;
7747 s_akind = get_akind(s_type);
7748 u_akind = get_akind(u_type);
7749 s_rank = get_akind_rank(s_akind);
7750 u_rank = get_akind_rank(u_akind);
7752 if (u_rank >= s_rank)
7755 if (get_atomic_type_size(s_akind) > get_atomic_type_size(u_akind))
7759 case ATOMIC_TYPE_INT: return type_unsigned_int;
7760 case ATOMIC_TYPE_LONG: return type_unsigned_long;
7761 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
7763 default: panic("invalid atomic type");
7768 * Check the semantic restrictions for a binary expression.
7770 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
7772 expression_t *const left = expression->left;
7773 expression_t *const right = expression->right;
7774 type_t *const orig_type_left = left->base.type;
7775 type_t *const orig_type_right = right->base.type;
7776 type_t *const type_left = skip_typeref(orig_type_left);
7777 type_t *const type_right = skip_typeref(orig_type_right);
7779 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
7780 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7781 position_t const *const pos = &expression->base.pos;
7782 errorf(pos, "operands of binary expression must have arithmetic types, but are '%T' and '%T'", orig_type_left, orig_type_right);
7787 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7788 expression->left = create_implicit_cast(left, arithmetic_type);
7789 expression->right = create_implicit_cast(right, arithmetic_type);
7790 expression->base.type = arithmetic_type;
7793 static void semantic_binexpr_integer(binary_expression_t *const expression)
7795 expression_t *const left = expression->left;
7796 expression_t *const right = expression->right;
7797 type_t *const orig_type_left = left->base.type;
7798 type_t *const orig_type_right = right->base.type;
7799 type_t *const type_left = skip_typeref(orig_type_left);
7800 type_t *const type_right = skip_typeref(orig_type_right);
7802 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
7803 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7804 position_t const *const pos = &expression->base.pos;
7805 errorf(pos, "operands of binary expression must have integer types, but are '%T' and '%T'", orig_type_left, orig_type_right);
7810 type_t *const result_type = semantic_arithmetic(type_left, type_right);
7811 expression->left = create_implicit_cast(left, result_type);
7812 expression->right = create_implicit_cast(right, result_type);
7813 expression->base.type = result_type;
7816 static void warn_div_by_zero(binary_expression_t const *const expression)
7818 if (!is_type_integer(expression->base.type))
7821 expression_t const *const right = expression->right;
7822 /* The type of the right operand can be different for /= */
7823 if (is_type_integer(skip_typeref(right->base.type)) &&
7824 is_constant_expression(right) == EXPR_CLASS_CONSTANT &&
7825 !fold_constant_to_bool(right)) {
7826 position_t const *const pos = &expression->base.pos;
7827 warningf(WARN_DIV_BY_ZERO, pos, "division by zero");
7832 * Check the semantic restrictions for a div expression.
7834 static void semantic_div(binary_expression_t *expression)
7836 semantic_binexpr_arithmetic(expression);
7837 warn_div_by_zero(expression);
7841 * Check the semantic restrictions for a mod expression.
7843 static void semantic_mod(binary_expression_t *expression)
7845 semantic_binexpr_integer(expression);
7846 warn_div_by_zero(expression);
7849 static void warn_addsub_in_shift(const expression_t *const expr)
7851 if (expr->base.parenthesized)
7855 switch (expr->kind) {
7856 case EXPR_BINARY_ADD: op = '+'; break;
7857 case EXPR_BINARY_SUB: op = '-'; break;
7861 position_t const *const pos = &expr->base.pos;
7862 warningf(WARN_PARENTHESES, pos, "suggest parentheses around '%c' inside shift", op);
7865 static bool semantic_shift(binary_expression_t *expression)
7867 expression_t *const left = expression->left;
7868 expression_t *const right = expression->right;
7869 type_t *const orig_type_left = left->base.type;
7870 type_t *const orig_type_right = right->base.type;
7871 type_t * type_left = skip_typeref(orig_type_left);
7872 type_t * type_right = skip_typeref(orig_type_right);
7874 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
7875 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7876 position_t const *const pos = &expression->base.pos;
7877 errorf(pos, "operands of shift expression must have integer types, but are '%T' and '%T'", orig_type_left, orig_type_right);
7882 type_left = promote_integer(type_left);
7884 if (is_constant_expression(right) == EXPR_CLASS_CONSTANT) {
7885 position_t const *const pos = &right->base.pos;
7886 long const count = fold_constant_to_int(right);
7888 warningf(WARN_OTHER, pos, "shift count must be non-negative");
7889 } else if ((unsigned long)count >=
7890 get_atomic_type_size(type_left->atomic.akind) * 8) {
7891 warningf(WARN_OTHER, pos, "shift count must be less than type width");
7895 type_right = promote_integer(type_right);
7896 expression->right = create_implicit_cast(right, type_right);
7901 static void semantic_shift_op(binary_expression_t *expression)
7903 expression_t *const left = expression->left;
7904 expression_t *const right = expression->right;
7906 if (!semantic_shift(expression))
7909 warn_addsub_in_shift(left);
7910 warn_addsub_in_shift(right);
7912 type_t *const orig_type_left = left->base.type;
7913 type_t * type_left = skip_typeref(orig_type_left);
7915 type_left = promote_integer(type_left);
7916 expression->left = create_implicit_cast(left, type_left);
7917 expression->base.type = type_left;
7920 static void semantic_add(binary_expression_t *expression)
7922 expression_t *const left = expression->left;
7923 expression_t *const right = expression->right;
7924 type_t *const orig_type_left = left->base.type;
7925 type_t *const orig_type_right = right->base.type;
7926 type_t *const type_left = skip_typeref(orig_type_left);
7927 type_t *const type_right = skip_typeref(orig_type_right);
7930 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7931 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7932 expression->left = create_implicit_cast(left, arithmetic_type);
7933 expression->right = create_implicit_cast(right, arithmetic_type);
7934 expression->base.type = arithmetic_type;
7935 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
7936 check_pointer_arithmetic(&expression->base.pos, type_left,
7938 expression->base.type = type_left;
7939 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
7940 check_pointer_arithmetic(&expression->base.pos, type_right,
7942 expression->base.type = type_right;
7943 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
7944 errorf(&expression->base.pos,
7945 "invalid operands to binary + ('%T', '%T')",
7946 orig_type_left, orig_type_right);
7950 static void semantic_sub(binary_expression_t *expression)
7952 expression_t *const left = expression->left;
7953 expression_t *const right = expression->right;
7954 type_t *const orig_type_left = left->base.type;
7955 type_t *const orig_type_right = right->base.type;
7956 type_t *const type_left = skip_typeref(orig_type_left);
7957 type_t *const type_right = skip_typeref(orig_type_right);
7958 position_t const *const pos = &expression->base.pos;
7961 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7962 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7963 expression->left = create_implicit_cast(left, arithmetic_type);
7964 expression->right = create_implicit_cast(right, arithmetic_type);
7965 expression->base.type = arithmetic_type;
7966 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
7967 check_pointer_arithmetic(&expression->base.pos, type_left,
7969 expression->base.type = type_left;
7970 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
7971 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
7972 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
7973 if (!types_compatible(unqual_left, unqual_right)) {
7975 "subtracting pointers to incompatible types '%T' and '%T'",
7976 orig_type_left, orig_type_right);
7977 } else if (!is_type_object(unqual_left)) {
7978 if (!is_type_void(unqual_left)) {
7979 errorf(pos, "subtracting pointers to non-object types '%T'",
7982 warningf(WARN_OTHER, pos, "subtracting pointers to void");
7985 expression->base.type = type_ptrdiff_t;
7986 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
7987 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
7988 orig_type_left, orig_type_right);
7992 static void warn_string_literal_address(expression_t const* expr)
7994 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7995 expr = expr->unary.value;
7996 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7998 expr = expr->unary.value;
8001 if (expr->kind == EXPR_STRING_LITERAL) {
8002 position_t const *const pos = &expr->base.pos;
8003 warningf(WARN_ADDRESS, pos, "comparison with string literal results in unspecified behaviour");
8007 static bool maybe_negative(expression_t const *const expr)
8009 switch (is_constant_expression(expr)) {
8010 case EXPR_CLASS_ERROR: return false;
8011 case EXPR_CLASS_CONSTANT: return constant_is_negative(expr);
8012 default: return true;
8016 static void warn_comparison(position_t const *const pos, expression_t const *const expr, expression_t const *const other)
8018 warn_string_literal_address(expr);
8020 expression_t const* const ref = get_reference_address(expr);
8021 if (ref != NULL && is_null_pointer_constant(other)) {
8022 entity_t const *const ent = ref->reference.entity;
8023 warningf(WARN_ADDRESS, pos, "the address of '%N' will never be NULL", ent);
8026 if (!expr->base.parenthesized) {
8027 switch (expr->base.kind) {
8028 case EXPR_BINARY_LESS:
8029 case EXPR_BINARY_GREATER:
8030 case EXPR_BINARY_LESSEQUAL:
8031 case EXPR_BINARY_GREATEREQUAL:
8032 case EXPR_BINARY_NOTEQUAL:
8033 case EXPR_BINARY_EQUAL:
8034 warningf(WARN_PARENTHESES, pos, "comparisons like 'x <= y < z' do not have their mathematical meaning");
8043 * Check the semantics of comparison expressions.
8045 * @param expression The expression to check.
8047 static void semantic_comparison(binary_expression_t *expression)
8049 position_t const *const pos = &expression->base.pos;
8050 expression_t *const left = expression->left;
8051 expression_t *const right = expression->right;
8053 warn_comparison(pos, left, right);
8054 warn_comparison(pos, right, left);
8056 type_t *orig_type_left = left->base.type;
8057 type_t *orig_type_right = right->base.type;
8058 type_t *type_left = skip_typeref(orig_type_left);
8059 type_t *type_right = skip_typeref(orig_type_right);
8061 /* TODO non-arithmetic types */
8062 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8063 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8065 /* test for signed vs unsigned compares */
8066 if (is_type_integer(arithmetic_type)) {
8067 bool const signed_left = is_type_signed(type_left);
8068 bool const signed_right = is_type_signed(type_right);
8069 if (signed_left != signed_right) {
8070 /* FIXME long long needs better const folding magic */
8071 /* TODO check whether constant value can be represented by other type */
8072 if ((signed_left && maybe_negative(left)) ||
8073 (signed_right && maybe_negative(right))) {
8074 warningf(WARN_SIGN_COMPARE, pos, "comparison between signed and unsigned");
8079 expression->left = create_implicit_cast(left, arithmetic_type);
8080 expression->right = create_implicit_cast(right, arithmetic_type);
8081 expression->base.type = arithmetic_type;
8082 if ((expression->base.kind == EXPR_BINARY_EQUAL ||
8083 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8084 is_type_float(arithmetic_type)) {
8085 warningf(WARN_FLOAT_EQUAL, pos, "comparing floating point with == or != is unsafe");
8087 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8088 /* TODO check compatibility */
8089 } else if (is_type_pointer(type_left)) {
8090 expression->right = create_implicit_cast(right, type_left);
8091 } else if (is_type_pointer(type_right)) {
8092 expression->left = create_implicit_cast(left, type_right);
8093 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8094 type_error_incompatible("invalid operands in comparison", pos, type_left, type_right);
8096 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8100 * Checks if a compound type has constant fields.
8102 static bool has_const_fields(const compound_type_t *type)
8104 compound_t *compound = type->compound;
8105 entity_t *entry = compound->members.entities;
8107 for (; entry != NULL; entry = entry->base.next) {
8108 if (!is_declaration(entry))
8111 const type_t *decl_type = skip_typeref(entry->declaration.type);
8112 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8119 static bool is_valid_assignment_lhs(expression_t const* const left)
8121 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8122 type_t *const type_left = skip_typeref(orig_type_left);
8124 if (!is_lvalue(left)) {
8125 errorf(&left->base.pos,
8126 "left hand side '%E' of assignment is not an lvalue", left);
8130 if (left->kind == EXPR_REFERENCE
8131 && left->reference.entity->kind == ENTITY_FUNCTION) {
8132 errorf(&left->base.pos, "cannot assign to function '%E'", left);
8136 if (is_type_array(type_left)) {
8137 errorf(&left->base.pos, "cannot assign to array '%E'", left);
8140 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8141 errorf(&left->base.pos,
8142 "assignment to read-only location '%E' (type '%T')", left,
8146 if (is_type_incomplete(type_left)) {
8147 errorf(&left->base.pos, "left-hand side '%E' of assignment has incomplete type '%T'",
8148 left, orig_type_left);
8151 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8152 errorf(&left->base.pos, "cannot assign to '%E' because compound type '%T' has read-only fields",
8153 left, orig_type_left);
8160 static void semantic_arithmetic_assign(binary_expression_t *expression)
8162 expression_t *left = expression->left;
8163 expression_t *right = expression->right;
8164 type_t *orig_type_left = left->base.type;
8165 type_t *orig_type_right = right->base.type;
8167 if (!is_valid_assignment_lhs(left))
8170 type_t *type_left = skip_typeref(orig_type_left);
8171 type_t *type_right = skip_typeref(orig_type_right);
8173 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8174 /* TODO: improve error message */
8175 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8176 errorf(&expression->base.pos, "operation needs arithmetic types");
8181 /* combined instructions are tricky. We can't create an implicit cast on
8182 * the left side, because we need the uncasted form for the store.
8183 * The ast2firm pass has to know that left_type must be right_type
8184 * for the arithmetic operation and create a cast by itself */
8185 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8186 expression->right = create_implicit_cast(right, arithmetic_type);
8187 expression->base.type = type_left;
8190 static void semantic_divmod_assign(binary_expression_t *expression)
8192 semantic_arithmetic_assign(expression);
8193 warn_div_by_zero(expression);
8196 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8198 expression_t *const left = expression->left;
8199 expression_t *const right = expression->right;
8200 type_t *const orig_type_left = left->base.type;
8201 type_t *const orig_type_right = right->base.type;
8202 type_t *const type_left = skip_typeref(orig_type_left);
8203 type_t *const type_right = skip_typeref(orig_type_right);
8205 if (!is_valid_assignment_lhs(left))
8208 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8209 /* combined instructions are tricky. We can't create an implicit cast on
8210 * the left side, because we need the uncasted form for the store.
8211 * The ast2firm pass has to know that left_type must be right_type
8212 * for the arithmetic operation and create a cast by itself */
8213 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8214 expression->right = create_implicit_cast(right, arithmetic_type);
8215 expression->base.type = type_left;
8216 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8217 check_pointer_arithmetic(&expression->base.pos, type_left,
8219 expression->base.type = type_left;
8220 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8221 errorf(&expression->base.pos,
8222 "incompatible types '%T' and '%T' in assignment",
8223 orig_type_left, orig_type_right);
8227 static void semantic_integer_assign(binary_expression_t *expression)
8229 expression_t *left = expression->left;
8230 expression_t *right = expression->right;
8231 type_t *orig_type_left = left->base.type;
8232 type_t *orig_type_right = right->base.type;
8234 if (!is_valid_assignment_lhs(left))
8237 type_t *type_left = skip_typeref(orig_type_left);
8238 type_t *type_right = skip_typeref(orig_type_right);
8240 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8241 /* TODO: improve error message */
8242 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8243 errorf(&expression->base.pos, "operation needs integer types");
8248 /* combined instructions are tricky. We can't create an implicit cast on
8249 * the left side, because we need the uncasted form for the store.
8250 * The ast2firm pass has to know that left_type must be right_type
8251 * for the arithmetic operation and create a cast by itself */
8252 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8253 expression->right = create_implicit_cast(right, arithmetic_type);
8254 expression->base.type = type_left;
8257 static void semantic_shift_assign(binary_expression_t *expression)
8259 expression_t *left = expression->left;
8261 if (!is_valid_assignment_lhs(left))
8264 if (!semantic_shift(expression))
8267 expression->base.type = skip_typeref(left->base.type);
8270 static void warn_logical_and_within_or(const expression_t *const expr)
8272 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8274 if (expr->base.parenthesized)
8276 position_t const *const pos = &expr->base.pos;
8277 warningf(WARN_PARENTHESES, pos, "suggest parentheses around && within ||");
8281 * Check the semantic restrictions of a logical expression.
8283 static void semantic_logical_op(binary_expression_t *expression)
8285 /* §6.5.13:2 Each of the operands shall have scalar type.
8286 * §6.5.14:2 Each of the operands shall have scalar type. */
8287 semantic_condition(expression->left, "left operand of logical operator");
8288 semantic_condition(expression->right, "right operand of logical operator");
8289 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR) {
8290 warn_logical_and_within_or(expression->left);
8291 warn_logical_and_within_or(expression->right);
8293 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8297 * Check the semantic restrictions of a binary assign expression.
8299 static void semantic_binexpr_assign(binary_expression_t *expression)
8301 expression_t *left = expression->left;
8302 type_t *orig_type_left = left->base.type;
8304 if (!is_valid_assignment_lhs(left))
8307 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8308 report_assign_error(error, orig_type_left, expression->right,
8309 "assignment", &left->base.pos);
8310 expression->right = create_implicit_cast(expression->right, orig_type_left);
8311 expression->base.type = orig_type_left;
8315 * Determine if the outermost operation (or parts thereof) of the given
8316 * expression has no effect in order to generate a warning about this fact.
8317 * Therefore in some cases this only examines some of the operands of the
8318 * expression (see comments in the function and examples below).
8320 * f() + 23; // warning, because + has no effect
8321 * x || f(); // no warning, because x controls execution of f()
8322 * x ? y : f(); // warning, because y has no effect
8323 * (void)x; // no warning to be able to suppress the warning
8324 * This function can NOT be used for an "expression has definitely no effect"-
8326 static bool expression_has_effect(const expression_t *const expr)
8328 switch (expr->kind) {
8329 case EXPR_ERROR: return true; /* do NOT warn */
8330 case EXPR_REFERENCE: return false;
8331 case EXPR_ENUM_CONSTANT: return false;
8332 case EXPR_LABEL_ADDRESS: return false;
8334 /* suppress the warning for microsoft __noop operations */
8335 case EXPR_LITERAL_MS_NOOP: return true;
8336 case EXPR_LITERAL_BOOLEAN:
8337 case EXPR_LITERAL_CHARACTER:
8338 case EXPR_LITERAL_INTEGER:
8339 case EXPR_LITERAL_FLOATINGPOINT:
8340 case EXPR_STRING_LITERAL: return false;
8343 const call_expression_t *const call = &expr->call;
8344 if (call->function->kind != EXPR_REFERENCE)
8347 switch (call->function->reference.entity->function.btk) {
8348 /* FIXME: which builtins have no effect? */
8349 default: return true;
8353 /* Generate the warning if either the left or right hand side of a
8354 * conditional expression has no effect */
8355 case EXPR_CONDITIONAL: {
8356 conditional_expression_t const *const cond = &expr->conditional;
8357 expression_t const *const t = cond->true_expression;
8359 (t == NULL || expression_has_effect(t)) &&
8360 expression_has_effect(cond->false_expression);
8363 case EXPR_SELECT: return false;
8364 case EXPR_ARRAY_ACCESS: return false;
8365 case EXPR_SIZEOF: return false;
8366 case EXPR_CLASSIFY_TYPE: return false;
8367 case EXPR_ALIGNOF: return false;
8369 case EXPR_FUNCNAME: return false;
8370 case EXPR_BUILTIN_CONSTANT_P: return false;
8371 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8372 case EXPR_OFFSETOF: return false;
8373 case EXPR_VA_START: return true;
8374 case EXPR_VA_ARG: return true;
8375 case EXPR_VA_COPY: return true;
8376 case EXPR_STATEMENT: return true; // TODO
8377 case EXPR_COMPOUND_LITERAL: return false;
8379 case EXPR_UNARY_NEGATE: return false;
8380 case EXPR_UNARY_PLUS: return false;
8381 case EXPR_UNARY_COMPLEMENT: return false;
8382 case EXPR_UNARY_NOT: return false;
8383 case EXPR_UNARY_DEREFERENCE: return false;
8384 case EXPR_UNARY_TAKE_ADDRESS: return false;
8385 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8386 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8387 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8388 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8390 /* Treat void casts as if they have an effect in order to being able to
8391 * suppress the warning */
8392 case EXPR_UNARY_CAST: {
8393 type_t *const type = skip_typeref(expr->base.type);
8394 return is_type_void(type);
8397 case EXPR_UNARY_ASSUME: return true;
8398 case EXPR_UNARY_DELETE: return true;
8399 case EXPR_UNARY_DELETE_ARRAY: return true;
8400 case EXPR_UNARY_THROW: return true;
8402 case EXPR_BINARY_ADD: return false;
8403 case EXPR_BINARY_SUB: return false;
8404 case EXPR_BINARY_MUL: return false;
8405 case EXPR_BINARY_DIV: return false;
8406 case EXPR_BINARY_MOD: return false;
8407 case EXPR_BINARY_EQUAL: return false;
8408 case EXPR_BINARY_NOTEQUAL: return false;
8409 case EXPR_BINARY_LESS: return false;
8410 case EXPR_BINARY_LESSEQUAL: return false;
8411 case EXPR_BINARY_GREATER: return false;
8412 case EXPR_BINARY_GREATEREQUAL: return false;
8413 case EXPR_BINARY_BITWISE_AND: return false;
8414 case EXPR_BINARY_BITWISE_OR: return false;
8415 case EXPR_BINARY_BITWISE_XOR: return false;
8416 case EXPR_BINARY_SHIFTLEFT: return false;
8417 case EXPR_BINARY_SHIFTRIGHT: return false;
8418 case EXPR_BINARY_ASSIGN: return true;
8419 case EXPR_BINARY_MUL_ASSIGN: return true;
8420 case EXPR_BINARY_DIV_ASSIGN: return true;
8421 case EXPR_BINARY_MOD_ASSIGN: return true;
8422 case EXPR_BINARY_ADD_ASSIGN: return true;
8423 case EXPR_BINARY_SUB_ASSIGN: return true;
8424 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8425 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8426 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8427 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8428 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8430 /* Only examine the right hand side of && and ||, because the left hand
8431 * side already has the effect of controlling the execution of the right
8433 case EXPR_BINARY_LOGICAL_AND:
8434 case EXPR_BINARY_LOGICAL_OR:
8435 /* Only examine the right hand side of a comma expression, because the left
8436 * hand side has a separate warning */
8437 case EXPR_BINARY_COMMA:
8438 return expression_has_effect(expr->binary.right);
8440 case EXPR_BINARY_ISGREATER: return false;
8441 case EXPR_BINARY_ISGREATEREQUAL: return false;
8442 case EXPR_BINARY_ISLESS: return false;
8443 case EXPR_BINARY_ISLESSEQUAL: return false;
8444 case EXPR_BINARY_ISLESSGREATER: return false;
8445 case EXPR_BINARY_ISUNORDERED: return false;
8448 internal_errorf(HERE, "unexpected expression");
8451 static void semantic_comma(binary_expression_t *expression)
8453 const expression_t *const left = expression->left;
8454 if (!expression_has_effect(left)) {
8455 position_t const *const pos = &left->base.pos;
8456 warningf(WARN_UNUSED_VALUE, pos, "left-hand operand of comma expression has no effect");
8458 expression->base.type = expression->right->base.type;
8462 * @param prec_r precedence of the right operand
8464 #define CREATE_BINEXPR_PARSER(token_kind, binexpression_type, prec_r, sfunc) \
8465 static expression_t *parse_##binexpression_type(expression_t *left) \
8467 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8468 binexpr->binary.left = left; \
8471 expression_t *right = parse_subexpression(prec_r); \
8473 binexpr->binary.right = right; \
8474 sfunc(&binexpr->binary); \
8479 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8480 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_div)
8481 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_mod)
8482 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8483 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8484 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8485 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8486 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
8487 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
8488 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
8489 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
8490 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
8491 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
8492 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_integer)
8493 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_integer)
8494 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_integer)
8495 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8496 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8497 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
8498 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8499 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8500 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8501 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8502 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8503 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8504 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8505 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8506 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8507 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8508 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
8511 static expression_t *parse_subexpression(precedence_t precedence)
8513 expression_parser_function_t *parser
8514 = &expression_parsers[token.kind];
8517 if (parser->parser != NULL) {
8518 left = parser->parser();
8520 left = parse_primary_expression();
8522 assert(left != NULL);
8525 parser = &expression_parsers[token.kind];
8526 if (parser->infix_parser == NULL)
8528 if (parser->infix_precedence < precedence)
8531 left = parser->infix_parser(left);
8533 assert(left != NULL);
8540 * Parse an expression.
8542 static expression_t *parse_expression(void)
8544 return parse_subexpression(PREC_EXPRESSION);
8548 * Register a parser for a prefix-like operator.
8550 * @param parser the parser function
8551 * @param token_kind the token type of the prefix token
8553 static void register_expression_parser(parse_expression_function parser,
8556 expression_parser_function_t *entry = &expression_parsers[token_kind];
8558 assert(!entry->parser);
8559 entry->parser = parser;
8563 * Register a parser for an infix operator with given precedence.
8565 * @param parser the parser function
8566 * @param token_kind the token type of the infix operator
8567 * @param precedence the precedence of the operator
8569 static void register_infix_parser(parse_expression_infix_function parser,
8570 int token_kind, precedence_t precedence)
8572 expression_parser_function_t *entry = &expression_parsers[token_kind];
8574 assert(!entry->infix_parser);
8575 entry->infix_parser = parser;
8576 entry->infix_precedence = precedence;
8580 * Initialize the expression parsers.
8582 static void init_expression_parsers(void)
8584 memset(&expression_parsers, 0, sizeof(expression_parsers));
8586 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
8587 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
8588 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
8589 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
8590 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
8591 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
8592 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
8593 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
8594 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
8595 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
8596 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
8597 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
8598 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
8599 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
8600 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
8601 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
8602 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
8603 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
8604 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
8605 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
8606 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
8607 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
8608 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
8609 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
8610 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
8611 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
8612 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
8613 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
8614 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
8615 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
8616 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
8617 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
8618 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
8619 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
8620 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
8621 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
8622 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
8624 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
8625 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
8626 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
8627 register_expression_parser(parse_EXPR_UNARY_COMPLEMENT, '~');
8628 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
8629 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
8630 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
8631 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
8632 register_expression_parser(parse_sizeof, T_sizeof);
8633 register_expression_parser(parse_alignof, T__Alignof);
8634 register_expression_parser(parse_extension, T___extension__);
8635 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
8636 register_expression_parser(parse_delete, T_delete);
8637 register_expression_parser(parse_throw, T_throw);
8641 * Parse a asm statement arguments specification.
8643 static void parse_asm_arguments(asm_argument_t **anchor, bool const is_out)
8645 if (token.kind == T_STRING_LITERAL || token.kind == '[') {
8646 add_anchor_token(',');
8648 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
8650 add_anchor_token(')');
8651 add_anchor_token('(');
8652 add_anchor_token(T_STRING_LITERAL);
8655 add_anchor_token(']');
8656 argument->symbol = expect_identifier("while parsing asm argument", NULL);
8657 rem_anchor_token(']');
8661 rem_anchor_token(T_STRING_LITERAL);
8662 argument->constraints = parse_string_literals("asm argument");
8663 rem_anchor_token('(');
8665 expression_t *expression = parse_expression();
8667 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
8668 * change size or type representation (e.g. int -> long is ok, but
8669 * int -> float is not) */
8670 if (expression->kind == EXPR_UNARY_CAST) {
8671 type_t *const type = expression->base.type;
8672 type_kind_t const kind = type->kind;
8673 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
8676 if (kind == TYPE_ATOMIC) {
8677 atomic_type_kind_t const akind = type->atomic.akind;
8678 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8679 size = get_atomic_type_size(akind);
8681 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8682 size = get_type_size(type_void_ptr);
8686 expression_t *const value = expression->unary.value;
8687 type_t *const value_type = value->base.type;
8688 type_kind_t const value_kind = value_type->kind;
8690 unsigned value_flags;
8691 unsigned value_size;
8692 if (value_kind == TYPE_ATOMIC) {
8693 atomic_type_kind_t const value_akind = value_type->atomic.akind;
8694 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8695 value_size = get_atomic_type_size(value_akind);
8696 } else if (value_kind == TYPE_POINTER) {
8697 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8698 value_size = get_type_size(type_void_ptr);
8703 if (value_flags != flags || value_size != size)
8707 } while (expression->kind == EXPR_UNARY_CAST);
8711 if (!is_lvalue(expression))
8712 errorf(&expression->base.pos,
8713 "asm output argument is not an lvalue");
8715 if (argument->constraints.begin[0] == '=')
8716 determine_lhs_ent(expression, NULL);
8718 mark_vars_read(expression, NULL);
8720 mark_vars_read(expression, NULL);
8722 argument->expression = expression;
8723 rem_anchor_token(')');
8726 set_address_taken(expression, true);
8729 anchor = &argument->next;
8730 } while (accept(','));
8731 rem_anchor_token(',');
8736 * Parse a asm statement clobber specification.
8738 static void parse_asm_clobbers(asm_clobber_t **anchor)
8740 if (token.kind == T_STRING_LITERAL) {
8741 add_anchor_token(',');
8743 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
8744 clobber->clobber = parse_string_literals(NULL);
8747 anchor = &clobber->next;
8748 } while (accept(','));
8749 rem_anchor_token(',');
8753 static void parse_asm_labels(asm_label_t **anchor)
8755 if (token.kind == T_IDENTIFIER) {
8756 add_anchor_token(',');
8758 label_t *const label = get_label("while parsing 'asm goto' labels");
8760 asm_label_t *const asm_label = allocate_ast_zero(sizeof(*asm_label));
8761 asm_label->label = label;
8763 *anchor = asm_label;
8764 anchor = &asm_label->next;
8766 } while (accept(','));
8767 rem_anchor_token(',');
8772 * Parse an asm statement.
8774 static statement_t *parse_asm_statement(void)
8776 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
8777 asm_statement_t *asm_statement = &statement->asms;
8780 add_anchor_token(')');
8781 add_anchor_token(':');
8782 add_anchor_token(T_STRING_LITERAL);
8784 if (accept(T_volatile))
8785 asm_statement->is_volatile = true;
8787 bool const asm_goto = accept(T_goto);
8790 rem_anchor_token(T_STRING_LITERAL);
8791 asm_statement->asm_text = parse_string_literals("asm statement");
8793 if (accept(':')) parse_asm_arguments(&asm_statement->outputs, true);
8794 if (accept(':')) parse_asm_arguments(&asm_statement->inputs, false);
8795 if (accept(':')) parse_asm_clobbers( &asm_statement->clobbers);
8797 rem_anchor_token(':');
8800 warningf(WARN_OTHER, &statement->base.pos, "assembler statement with labels should be 'asm goto'");
8801 parse_asm_labels(&asm_statement->labels);
8802 if (asm_statement->labels)
8803 errorf(&statement->base.pos, "'asm goto' not supported");
8806 warningf(WARN_OTHER, &statement->base.pos, "'asm goto' without labels");
8809 rem_anchor_token(')');
8813 if (asm_statement->outputs == NULL) {
8814 /* GCC: An 'asm' instruction without any output operands will be treated
8815 * identically to a volatile 'asm' instruction. */
8816 asm_statement->is_volatile = true;
8822 static statement_t *parse_label_inner_statement(statement_t const *const label, char const *const label_kind)
8824 statement_t *inner_stmt;
8825 switch (token.kind) {
8827 errorf(&label->base.pos, "%s at end of compound statement", label_kind);
8828 inner_stmt = create_error_statement();
8832 if (label->kind == STATEMENT_LABEL) {
8833 /* Eat an empty statement here, to avoid the warning about an empty
8834 * statement after a label. label:; is commonly used to have a label
8835 * before a closing brace. */
8836 inner_stmt = create_empty_statement();
8843 inner_stmt = parse_statement();
8844 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
8845 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
8846 if (inner_stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
8847 errorf(&inner_stmt->base.pos, "declaration after %s", label_kind);
8855 * Parse a case statement.
8857 static statement_t *parse_case_statement(void)
8859 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
8860 position_t *const pos = &statement->base.pos;
8863 add_anchor_token(':');
8865 expression_t *expression = parse_expression();
8866 type_t *expression_type = expression->base.type;
8867 type_t *skipped = skip_typeref(expression_type);
8868 if (!is_type_integer(skipped) && is_type_valid(skipped)) {
8869 errorf(pos, "case expression '%E' must have integer type but has type '%T'",
8870 expression, expression_type);
8873 type_t *type = expression_type;
8874 if (current_switch != NULL) {
8875 type_t *switch_type = current_switch->expression->base.type;
8876 if (is_type_valid(skip_typeref(switch_type))) {
8877 expression = create_implicit_cast(expression, switch_type);
8881 statement->case_label.expression = expression;
8882 expression_classification_t const expr_class = is_constant_expression(expression);
8883 if (expr_class != EXPR_CLASS_CONSTANT) {
8884 if (expr_class != EXPR_CLASS_ERROR) {
8885 errorf(pos, "case label does not reduce to an integer constant");
8887 statement->case_label.is_bad = true;
8889 ir_tarval *val = fold_constant_to_tarval(expression);
8890 statement->case_label.first_case = val;
8891 statement->case_label.last_case = val;
8895 if (accept(T_DOTDOTDOT)) {
8896 expression_t *end_range = parse_expression();
8897 expression_type = expression->base.type;
8898 skipped = skip_typeref(expression_type);
8899 if (!is_type_integer(skipped) && is_type_valid(skipped)) {
8900 errorf(pos, "case expression '%E' must have integer type but has type '%T'",
8901 expression, expression_type);
8904 end_range = create_implicit_cast(end_range, type);
8905 statement->case_label.end_range = end_range;
8906 expression_classification_t const end_class = is_constant_expression(end_range);
8907 if (end_class != EXPR_CLASS_CONSTANT) {
8908 if (end_class != EXPR_CLASS_ERROR) {
8909 errorf(pos, "case range does not reduce to an integer constant");
8911 statement->case_label.is_bad = true;
8913 ir_tarval *val = fold_constant_to_tarval(end_range);
8914 statement->case_label.last_case = val;
8916 if (tarval_cmp(val, statement->case_label.first_case)
8917 == ir_relation_less) {
8918 statement->case_label.is_empty_range = true;
8919 warningf(WARN_OTHER, pos, "empty range specified");
8925 PUSH_PARENT(statement);
8927 rem_anchor_token(':');
8930 if (current_switch != NULL) {
8931 if (! statement->case_label.is_bad) {
8932 /* Check for duplicate case values */
8933 case_label_statement_t *c = &statement->case_label;
8934 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
8935 if (l->is_bad || l->is_empty_range || l->expression == NULL)
8938 if (c->last_case < l->first_case || c->first_case > l->last_case)
8941 errorf(pos, "duplicate case value (previously used %P)",
8946 /* link all cases into the switch statement */
8947 if (current_switch->last_case == NULL) {
8948 current_switch->first_case = &statement->case_label;
8950 current_switch->last_case->next = &statement->case_label;
8952 current_switch->last_case = &statement->case_label;
8954 errorf(pos, "case label not within a switch statement");
8957 statement->case_label.statement = parse_label_inner_statement(statement, "case label");
8964 * Parse a default statement.
8966 static statement_t *parse_default_statement(void)
8968 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
8972 PUSH_PARENT(statement);
8976 if (current_switch != NULL) {
8977 const case_label_statement_t *def_label = current_switch->default_label;
8978 if (def_label != NULL) {
8979 errorf(&statement->base.pos, "multiple default labels in one switch (previous declared %P)", &def_label->base.pos);
8981 current_switch->default_label = &statement->case_label;
8983 /* link all cases into the switch statement */
8984 if (current_switch->last_case == NULL) {
8985 current_switch->first_case = &statement->case_label;
8987 current_switch->last_case->next = &statement->case_label;
8989 current_switch->last_case = &statement->case_label;
8992 errorf(&statement->base.pos,
8993 "'default' label not within a switch statement");
8996 statement->case_label.statement = parse_label_inner_statement(statement, "default label");
9003 * Parse a label statement.
9005 static statement_t *parse_label_statement(void)
9007 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9008 label_t *const label = get_label(NULL /* Cannot fail, token is T_IDENTIFIER. */);
9009 statement->label.label = label;
9011 PUSH_PARENT(statement);
9013 /* if statement is already set then the label is defined twice,
9014 * otherwise it was just mentioned in a goto/local label declaration so far
9016 position_t const* const pos = &statement->base.pos;
9017 if (label->statement != NULL) {
9018 errorf(pos, "duplicate '%N' (declared %P)", (entity_t const*)label, &label->base.pos);
9020 label->base.pos = *pos;
9021 label->statement = statement;
9022 label->n_users += 1;
9027 if (token.kind == T___attribute__ && !(c_mode & _CXX)) {
9028 parse_attributes(NULL); // TODO process attributes
9031 statement->label.statement = parse_label_inner_statement(statement, "label");
9033 /* remember the labels in a list for later checking */
9034 *label_anchor = &statement->label;
9035 label_anchor = &statement->label.next;
9041 static statement_t *parse_inner_statement(void)
9043 statement_t *const stmt = parse_statement();
9044 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
9045 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
9046 if (stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
9047 errorf(&stmt->base.pos, "declaration as inner statement, use {}");
9053 * Parse an expression in parentheses and mark its variables as read.
9055 static expression_t *parse_condition(void)
9057 add_anchor_token(')');
9059 expression_t *const expr = parse_expression();
9060 mark_vars_read(expr, NULL);
9061 rem_anchor_token(')');
9067 * Parse an if statement.
9069 static statement_t *parse_if(void)
9071 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9075 PUSH_PARENT(statement);
9076 PUSH_SCOPE_STATEMENT(&statement->ifs.scope);
9078 add_anchor_token(T_else);
9080 expression_t *const expr = parse_condition();
9081 statement->ifs.condition = expr;
9082 /* §6.8.4.1:1 The controlling expression of an if statement shall have
9084 semantic_condition(expr, "condition of 'if'-statment");
9086 statement_t *const true_stmt = parse_inner_statement();
9087 statement->ifs.true_statement = true_stmt;
9088 rem_anchor_token(T_else);
9090 if (true_stmt->kind == STATEMENT_EMPTY) {
9091 warningf(WARN_EMPTY_BODY, HERE,
9092 "suggest braces around empty body in an ‘if’ statement");
9095 if (accept(T_else)) {
9096 statement->ifs.false_statement = parse_inner_statement();
9098 if (statement->ifs.false_statement->kind == STATEMENT_EMPTY) {
9099 warningf(WARN_EMPTY_BODY, HERE,
9100 "suggest braces around empty body in an ‘if’ statement");
9102 } else if (true_stmt->kind == STATEMENT_IF &&
9103 true_stmt->ifs.false_statement != NULL) {
9104 position_t const *const pos = &true_stmt->base.pos;
9105 warningf(WARN_PARENTHESES, pos, "suggest explicit braces to avoid ambiguous 'else'");
9114 * Check that all enums are handled in a switch.
9116 * @param statement the switch statement to check
9118 static void check_enum_cases(const switch_statement_t *statement)
9120 if (!is_warn_on(WARN_SWITCH_ENUM))
9122 type_t *type = skip_typeref(statement->expression->base.type);
9123 if (! is_type_enum(type))
9125 enum_type_t *enumt = &type->enumt;
9127 /* if we have a default, no warnings */
9128 if (statement->default_label != NULL)
9131 determine_enum_values(enumt);
9133 /* FIXME: calculation of value should be done while parsing */
9134 /* TODO: quadratic algorithm here. Change to an n log n one */
9135 const entity_t *entry = enumt->enume->base.next;
9136 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9137 entry = entry->base.next) {
9138 ir_tarval *value = entry->enum_value.tv;
9140 for (const case_label_statement_t *l = statement->first_case; l != NULL;
9142 if (l->expression == NULL)
9144 if (l->first_case == l->last_case && l->first_case != value)
9146 if ((tarval_cmp(l->first_case, value) & ir_relation_less_equal)
9147 && (tarval_cmp(value, l->last_case) & ir_relation_less_equal)) {
9153 position_t const *const pos = &statement->base.pos;
9154 warningf(WARN_SWITCH_ENUM, pos, "'%N' not handled in switch", entry);
9160 * Parse a switch statement.
9162 static statement_t *parse_switch(void)
9164 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9168 PUSH_PARENT(statement);
9169 PUSH_SCOPE_STATEMENT(&statement->switchs.scope);
9171 expression_t *const expr = parse_condition();
9172 type_t * type = skip_typeref(expr->base.type);
9173 if (is_type_integer(type)) {
9174 type = promote_integer(type);
9175 if (get_akind_rank(get_akind(type)) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9176 warningf(WARN_TRADITIONAL, &expr->base.pos,
9177 "'%T' switch expression not converted to '%T' in ISO C",
9180 } else if (is_type_valid(type)) {
9181 errorf(&expr->base.pos, "switch quantity is not an integer, but '%T'",
9183 type = type_error_type;
9185 statement->switchs.expression = create_implicit_cast(expr, type);
9187 switch_statement_t *rem = current_switch;
9188 current_switch = &statement->switchs;
9189 statement->switchs.body = parse_inner_statement();
9190 current_switch = rem;
9192 if (statement->switchs.default_label == NULL) {
9193 warningf(WARN_SWITCH_DEFAULT, &statement->base.pos, "switch has no default case");
9195 check_enum_cases(&statement->switchs);
9202 static statement_t *parse_loop_body(statement_t *const loop)
9204 statement_t *const rem = current_loop;
9205 current_loop = loop;
9207 statement_t *const body = parse_inner_statement();
9214 * Parse a while statement.
9216 static statement_t *parse_while(void)
9218 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9222 PUSH_PARENT(statement);
9223 PUSH_SCOPE_STATEMENT(&statement->fors.scope);
9225 expression_t *const cond = parse_condition();
9226 statement->fors.condition = cond;
9227 /* §6.8.5:2 The controlling expression of an iteration statement shall
9228 * have scalar type. */
9229 semantic_condition(cond, "condition of 'while'-statement");
9231 statement->fors.body = parse_loop_body(statement);
9239 * Parse a do statement.
9241 static statement_t *parse_do(void)
9243 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9247 PUSH_PARENT(statement);
9248 PUSH_SCOPE_STATEMENT(&statement->do_while.scope);
9250 add_anchor_token(T_while);
9251 statement->do_while.body = parse_loop_body(statement);
9252 rem_anchor_token(T_while);
9255 expression_t *const cond = parse_condition();
9256 statement->do_while.condition = cond;
9257 /* §6.8.5:2 The controlling expression of an iteration statement shall
9258 * have scalar type. */
9259 semantic_condition(cond, "condition of 'do-while'-statement");
9268 * Parse a for statement.
9270 static statement_t *parse_for(void)
9272 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9276 PUSH_PARENT(statement);
9277 PUSH_SCOPE_STATEMENT(&statement->fors.scope);
9279 add_anchor_token(')');
9285 } else if (is_declaration_specifier(&token)) {
9286 parse_declaration(record_entity, DECL_FLAGS_NONE);
9288 add_anchor_token(';');
9289 expression_t *const init = parse_expression();
9290 statement->fors.initialisation = init;
9291 mark_vars_read(init, ENT_ANY);
9292 if (!expression_has_effect(init)) {
9293 warningf(WARN_UNUSED_VALUE, &init->base.pos, "initialisation of 'for'-statement has no effect");
9295 rem_anchor_token(';');
9301 if (token.kind != ';') {
9302 add_anchor_token(';');
9303 expression_t *const cond = parse_expression();
9304 statement->fors.condition = cond;
9305 /* §6.8.5:2 The controlling expression of an iteration statement
9306 * shall have scalar type. */
9307 semantic_condition(cond, "condition of 'for'-statement");
9308 mark_vars_read(cond, NULL);
9309 rem_anchor_token(';');
9312 if (token.kind != ')') {
9313 expression_t *const step = parse_expression();
9314 statement->fors.step = step;
9315 mark_vars_read(step, ENT_ANY);
9316 if (!expression_has_effect(step)) {
9317 warningf(WARN_UNUSED_VALUE, &step->base.pos, "step of 'for'-statement has no effect");
9320 rem_anchor_token(')');
9322 statement->fors.body = parse_loop_body(statement);
9330 * Parse a goto statement.
9332 static statement_t *parse_goto(void)
9334 statement_t *statement;
9335 if (GNU_MODE && look_ahead(1)->kind == '*') {
9336 statement = allocate_statement_zero(STATEMENT_COMPUTED_GOTO);
9340 expression_t *expression = parse_expression();
9341 mark_vars_read(expression, NULL);
9343 /* Argh: although documentation says the expression must be of type void*,
9344 * gcc accepts anything that can be casted into void* without error */
9345 type_t *type = expression->base.type;
9347 if (type != type_error_type) {
9348 if (!is_type_pointer(type) && !is_type_integer(type)) {
9349 errorf(&expression->base.pos, "cannot convert to a pointer type");
9350 } else if (type != type_void_ptr) {
9351 warningf(WARN_OTHER, &expression->base.pos, "type of computed goto expression should be 'void*' not '%T'", type);
9353 expression = create_implicit_cast(expression, type_void_ptr);
9356 statement->computed_goto.expression = expression;
9358 statement = allocate_statement_zero(STATEMENT_GOTO);
9361 label_t *const label = get_label("while parsing goto");
9363 label->n_users += 1;
9365 statement->gotos.label = label;
9367 /* remember the goto's in a list for later checking */
9368 *goto_anchor = &statement->gotos;
9369 goto_anchor = &statement->gotos.next;
9371 statement->gotos.label = &allocate_entity_zero(ENTITY_LABEL, NAMESPACE_LABEL, sym_anonymous, &builtin_position)->label;
9380 * Parse a continue statement.
9382 static statement_t *parse_continue(void)
9384 if (current_loop == NULL) {
9385 errorf(HERE, "continue statement not within loop");
9388 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9396 * Parse a break statement.
9398 static statement_t *parse_break(void)
9400 if (current_switch == NULL && current_loop == NULL) {
9401 errorf(HERE, "break statement not within loop or switch");
9404 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9412 * Parse a __leave statement.
9414 static statement_t *parse_leave_statement(void)
9416 if (current_try == NULL) {
9417 errorf(HERE, "__leave statement not within __try");
9420 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9428 * Check if a given entity represents a local variable.
9430 static bool is_local_variable(const entity_t *entity)
9432 if (entity->kind != ENTITY_VARIABLE)
9435 switch ((storage_class_tag_t) entity->declaration.storage_class) {
9436 case STORAGE_CLASS_AUTO:
9437 case STORAGE_CLASS_REGISTER: {
9438 const type_t *type = skip_typeref(entity->declaration.type);
9439 if (is_type_function(type)) {
9451 * Check if a given expression represents a local variable.
9453 static bool expression_is_local_variable(const expression_t *expression)
9455 if (expression->base.kind != EXPR_REFERENCE) {
9458 const entity_t *entity = expression->reference.entity;
9459 return is_local_variable(entity);
9462 static void err_or_warn(position_t const *const pos, char const *const msg)
9464 if (c_mode & _CXX || strict_mode) {
9467 warningf(WARN_OTHER, pos, msg);
9472 * Parse a return statement.
9474 static statement_t *parse_return(void)
9476 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9479 expression_t *return_value = NULL;
9480 if (token.kind != ';') {
9481 return_value = parse_expression();
9482 mark_vars_read(return_value, NULL);
9485 const type_t *const func_type = skip_typeref(current_function->base.type);
9486 assert(is_type_function(func_type));
9487 type_t *const return_type = skip_typeref(func_type->function.return_type);
9489 position_t const *const pos = &statement->base.pos;
9490 if (return_value != NULL) {
9491 type_t *return_value_type = skip_typeref(return_value->base.type);
9493 if (is_type_void(return_type)) {
9494 if (!is_type_void(return_value_type)) {
9495 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
9496 /* Only warn in C mode, because GCC does the same */
9497 err_or_warn(pos, "'return' with a value, in function returning 'void'");
9498 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9499 /* Only warn in C mode, because GCC does the same */
9500 err_or_warn(pos, "'return' with expression in function returning 'void'");
9503 assign_error_t error = semantic_assign(return_type, return_value);
9504 report_assign_error(error, return_type, return_value, "'return'",
9507 return_value = create_implicit_cast(return_value, return_type);
9508 /* check for returning address of a local var */
9509 if (return_value != NULL && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
9510 const expression_t *expression = return_value->unary.value;
9511 if (expression_is_local_variable(expression)) {
9512 warningf(WARN_OTHER, pos, "function returns address of local variable");
9515 } else if (!is_type_void(return_type)) {
9516 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9517 err_or_warn(pos, "'return' without value, in function returning non-void");
9519 statement->returns.value = return_value;
9526 * Parse a declaration statement.
9528 static statement_t *parse_declaration_statement(void)
9530 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9532 entity_t *before = current_scope->last_entity;
9534 parse_external_declaration();
9536 parse_declaration(record_entity, DECL_FLAGS_NONE);
9539 declaration_statement_t *const decl = &statement->declaration;
9540 entity_t *const begin =
9541 before != NULL ? before->base.next : current_scope->entities;
9542 decl->declarations_begin = begin;
9543 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
9549 * Parse an expression statement, i.e. expr ';'.
9551 static statement_t *parse_expression_statement(void)
9553 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
9555 expression_t *const expr = parse_expression();
9556 statement->expression.expression = expr;
9557 mark_vars_read(expr, ENT_ANY);
9564 * Parse a microsoft __try { } __finally { } or
9565 * __try{ } __except() { }
9567 static statement_t *parse_ms_try_statment(void)
9569 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
9572 PUSH_PARENT(statement);
9574 ms_try_statement_t *rem = current_try;
9575 current_try = &statement->ms_try;
9576 statement->ms_try.try_statement = parse_compound_statement(false);
9581 if (accept(T___except)) {
9582 expression_t *const expr = parse_condition();
9583 type_t * type = skip_typeref(expr->base.type);
9584 if (is_type_integer(type)) {
9585 type = promote_integer(type);
9586 } else if (is_type_valid(type)) {
9587 errorf(&expr->base.pos,
9588 "__expect expression is not an integer, but '%T'", type);
9589 type = type_error_type;
9591 statement->ms_try.except_expression = create_implicit_cast(expr, type);
9592 } else if (!accept(T__finally)) {
9593 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
9595 statement->ms_try.final_statement = parse_compound_statement(false);
9599 static statement_t *parse_empty_statement(void)
9601 warningf(WARN_EMPTY_STATEMENT, HERE, "statement is empty");
9602 statement_t *const statement = create_empty_statement();
9607 static statement_t *parse_local_label_declaration(void)
9609 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9613 entity_t *begin = NULL;
9614 entity_t *end = NULL;
9615 entity_t **anchor = &begin;
9616 add_anchor_token(';');
9617 add_anchor_token(',');
9620 symbol_t *const symbol = expect_identifier("while parsing local label declaration", &pos);
9622 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
9623 if (entity != NULL && entity->base.parent_scope == current_scope) {
9624 position_t const *const ppos = &entity->base.pos;
9625 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
9627 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL, NAMESPACE_LABEL, symbol, &pos);
9628 entity->base.parent_scope = current_scope;
9631 anchor = &entity->base.next;
9634 environment_push(entity);
9637 } while (accept(','));
9638 rem_anchor_token(',');
9639 rem_anchor_token(';');
9641 statement->declaration.declarations_begin = begin;
9642 statement->declaration.declarations_end = end;
9646 static void parse_namespace_definition(void)
9650 entity_t *entity = NULL;
9651 symbol_t *symbol = NULL;
9653 if (token.kind == T_IDENTIFIER) {
9654 symbol = token.base.symbol;
9655 entity = get_entity(symbol, NAMESPACE_NORMAL);
9656 if (entity && entity->kind != ENTITY_NAMESPACE) {
9658 if (entity->base.parent_scope == current_scope && is_entity_valid(entity)) {
9659 error_redefined_as_different_kind(HERE, entity, ENTITY_NAMESPACE);
9665 if (entity == NULL) {
9666 entity = allocate_entity_zero(ENTITY_NAMESPACE, NAMESPACE_NORMAL, symbol, HERE);
9667 entity->base.parent_scope = current_scope;
9670 if (token.kind == '=') {
9671 /* TODO: parse namespace alias */
9672 panic("namespace alias definition not supported yet");
9675 environment_push(entity);
9676 append_entity(current_scope, entity);
9678 PUSH_SCOPE(&entity->namespacee.members);
9679 PUSH_CURRENT_ENTITY(entity);
9681 add_anchor_token('}');
9684 rem_anchor_token('}');
9687 POP_CURRENT_ENTITY();
9692 * Parse a statement.
9693 * There's also parse_statement() which additionally checks for
9694 * "statement has no effect" warnings
9696 static statement_t *intern_parse_statement(void)
9698 /* declaration or statement */
9699 statement_t *statement;
9700 switch (token.kind) {
9701 case T_IDENTIFIER: {
9702 token_kind_t la1_type = (token_kind_t)look_ahead(1)->kind;
9703 if (la1_type == ':') {
9704 statement = parse_label_statement();
9705 } else if (is_typedef_symbol(token.base.symbol)) {
9706 statement = parse_declaration_statement();
9708 /* it's an identifier, the grammar says this must be an
9709 * expression statement. However it is common that users mistype
9710 * declaration types, so we guess a bit here to improve robustness
9711 * for incorrect programs */
9715 if (get_entity(token.base.symbol, NAMESPACE_NORMAL) != NULL) {
9717 statement = parse_expression_statement();
9721 statement = parse_declaration_statement();
9729 case T___extension__: {
9730 /* This can be a prefix to a declaration or an expression statement.
9731 * We simply eat it now and parse the rest with tail recursion. */
9733 statement = intern_parse_statement();
9739 statement = parse_declaration_statement();
9743 statement = parse_local_label_declaration();
9746 case ';': statement = parse_empty_statement(); break;
9747 case '{': statement = parse_compound_statement(false); break;
9748 case T___leave: statement = parse_leave_statement(); break;
9749 case T___try: statement = parse_ms_try_statment(); break;
9750 case T_asm: statement = parse_asm_statement(); break;
9751 case T_break: statement = parse_break(); break;
9752 case T_case: statement = parse_case_statement(); break;
9753 case T_continue: statement = parse_continue(); break;
9754 case T_default: statement = parse_default_statement(); break;
9755 case T_do: statement = parse_do(); break;
9756 case T_for: statement = parse_for(); break;
9757 case T_goto: statement = parse_goto(); break;
9758 case T_if: statement = parse_if(); break;
9759 case T_return: statement = parse_return(); break;
9760 case T_switch: statement = parse_switch(); break;
9761 case T_while: statement = parse_while(); break;
9764 statement = parse_expression_statement();
9768 errorf(HERE, "unexpected token %K while parsing statement", &token);
9769 statement = create_error_statement();
9778 * parse a statement and emits "statement has no effect" warning if needed
9779 * (This is really a wrapper around intern_parse_statement with check for 1
9780 * single warning. It is needed, because for statement expressions we have
9781 * to avoid the warning on the last statement)
9783 static statement_t *parse_statement(void)
9785 statement_t *statement = intern_parse_statement();
9787 if (statement->kind == STATEMENT_EXPRESSION) {
9788 expression_t *expression = statement->expression.expression;
9789 if (!expression_has_effect(expression)) {
9790 warningf(WARN_UNUSED_VALUE, &expression->base.pos,
9791 "statement has no effect");
9799 * Parse a compound statement.
9801 static statement_t *parse_compound_statement(bool inside_expression_statement)
9803 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
9805 PUSH_PARENT(statement);
9806 PUSH_SCOPE(&statement->compound.scope);
9809 add_anchor_token('}');
9810 /* tokens, which can start a statement */
9811 /* TODO MS, __builtin_FOO */
9812 add_anchor_token('!');
9813 add_anchor_token('&');
9814 add_anchor_token('(');
9815 add_anchor_token('*');
9816 add_anchor_token('+');
9817 add_anchor_token('-');
9818 add_anchor_token(';');
9819 add_anchor_token('{');
9820 add_anchor_token('~');
9821 add_anchor_token(T_CHARACTER_CONSTANT);
9822 add_anchor_token(T_COLONCOLON);
9823 add_anchor_token(T_IDENTIFIER);
9824 add_anchor_token(T_MINUSMINUS);
9825 add_anchor_token(T_NUMBER);
9826 add_anchor_token(T_PLUSPLUS);
9827 add_anchor_token(T_STRING_LITERAL);
9828 add_anchor_token(T__Alignof);
9829 add_anchor_token(T__Bool);
9830 add_anchor_token(T__Complex);
9831 add_anchor_token(T__Imaginary);
9832 add_anchor_token(T__Thread_local);
9833 add_anchor_token(T___PRETTY_FUNCTION__);
9834 add_anchor_token(T___attribute__);
9835 add_anchor_token(T___builtin_va_start);
9836 add_anchor_token(T___extension__);
9837 add_anchor_token(T___func__);
9838 add_anchor_token(T___imag__);
9839 add_anchor_token(T___label__);
9840 add_anchor_token(T___real__);
9841 add_anchor_token(T_asm);
9842 add_anchor_token(T_auto);
9843 add_anchor_token(T_bool);
9844 add_anchor_token(T_break);
9845 add_anchor_token(T_case);
9846 add_anchor_token(T_char);
9847 add_anchor_token(T_class);
9848 add_anchor_token(T_const);
9849 add_anchor_token(T_const_cast);
9850 add_anchor_token(T_continue);
9851 add_anchor_token(T_default);
9852 add_anchor_token(T_delete);
9853 add_anchor_token(T_double);
9854 add_anchor_token(T_do);
9855 add_anchor_token(T_dynamic_cast);
9856 add_anchor_token(T_enum);
9857 add_anchor_token(T_extern);
9858 add_anchor_token(T_false);
9859 add_anchor_token(T_float);
9860 add_anchor_token(T_for);
9861 add_anchor_token(T_goto);
9862 add_anchor_token(T_if);
9863 add_anchor_token(T_inline);
9864 add_anchor_token(T_int);
9865 add_anchor_token(T_long);
9866 add_anchor_token(T_new);
9867 add_anchor_token(T_operator);
9868 add_anchor_token(T_register);
9869 add_anchor_token(T_reinterpret_cast);
9870 add_anchor_token(T_restrict);
9871 add_anchor_token(T_return);
9872 add_anchor_token(T_short);
9873 add_anchor_token(T_signed);
9874 add_anchor_token(T_sizeof);
9875 add_anchor_token(T_static);
9876 add_anchor_token(T_static_cast);
9877 add_anchor_token(T_struct);
9878 add_anchor_token(T_switch);
9879 add_anchor_token(T_template);
9880 add_anchor_token(T_this);
9881 add_anchor_token(T_throw);
9882 add_anchor_token(T_true);
9883 add_anchor_token(T_try);
9884 add_anchor_token(T_typedef);
9885 add_anchor_token(T_typeid);
9886 add_anchor_token(T_typename);
9887 add_anchor_token(T_typeof);
9888 add_anchor_token(T_union);
9889 add_anchor_token(T_unsigned);
9890 add_anchor_token(T_using);
9891 add_anchor_token(T_void);
9892 add_anchor_token(T_volatile);
9893 add_anchor_token(T_wchar_t);
9894 add_anchor_token(T_while);
9896 statement_t **anchor = &statement->compound.statements;
9897 bool only_decls_so_far = true;
9898 while (token.kind != '}' && token.kind != T_EOF) {
9899 statement_t *sub_statement = intern_parse_statement();
9900 if (sub_statement->kind == STATEMENT_ERROR) {
9904 if (sub_statement->kind != STATEMENT_DECLARATION) {
9905 only_decls_so_far = false;
9906 } else if (!only_decls_so_far) {
9907 position_t const *const pos = &sub_statement->base.pos;
9908 warningf(WARN_DECLARATION_AFTER_STATEMENT, pos, "ISO C90 forbids mixed declarations and code");
9911 *anchor = sub_statement;
9912 anchor = &sub_statement->base.next;
9916 /* look over all statements again to produce no effect warnings */
9917 if (is_warn_on(WARN_UNUSED_VALUE)) {
9918 statement_t *sub_statement = statement->compound.statements;
9919 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
9920 if (sub_statement->kind != STATEMENT_EXPRESSION)
9922 /* don't emit a warning for the last expression in an expression
9923 * statement as it has always an effect */
9924 if (inside_expression_statement && sub_statement->base.next == NULL)
9927 expression_t *expression = sub_statement->expression.expression;
9928 if (!expression_has_effect(expression)) {
9929 warningf(WARN_UNUSED_VALUE, &expression->base.pos,
9930 "statement has no effect");
9935 rem_anchor_token(T_while);
9936 rem_anchor_token(T_wchar_t);
9937 rem_anchor_token(T_volatile);
9938 rem_anchor_token(T_void);
9939 rem_anchor_token(T_using);
9940 rem_anchor_token(T_unsigned);
9941 rem_anchor_token(T_union);
9942 rem_anchor_token(T_typeof);
9943 rem_anchor_token(T_typename);
9944 rem_anchor_token(T_typeid);
9945 rem_anchor_token(T_typedef);
9946 rem_anchor_token(T_try);
9947 rem_anchor_token(T_true);
9948 rem_anchor_token(T_throw);
9949 rem_anchor_token(T_this);
9950 rem_anchor_token(T_template);
9951 rem_anchor_token(T_switch);
9952 rem_anchor_token(T_struct);
9953 rem_anchor_token(T_static_cast);
9954 rem_anchor_token(T_static);
9955 rem_anchor_token(T_sizeof);
9956 rem_anchor_token(T_signed);
9957 rem_anchor_token(T_short);
9958 rem_anchor_token(T_return);
9959 rem_anchor_token(T_restrict);
9960 rem_anchor_token(T_reinterpret_cast);
9961 rem_anchor_token(T_register);
9962 rem_anchor_token(T_operator);
9963 rem_anchor_token(T_new);
9964 rem_anchor_token(T_long);
9965 rem_anchor_token(T_int);
9966 rem_anchor_token(T_inline);
9967 rem_anchor_token(T_if);
9968 rem_anchor_token(T_goto);
9969 rem_anchor_token(T_for);
9970 rem_anchor_token(T_float);
9971 rem_anchor_token(T_false);
9972 rem_anchor_token(T_extern);
9973 rem_anchor_token(T_enum);
9974 rem_anchor_token(T_dynamic_cast);
9975 rem_anchor_token(T_do);
9976 rem_anchor_token(T_double);
9977 rem_anchor_token(T_delete);
9978 rem_anchor_token(T_default);
9979 rem_anchor_token(T_continue);
9980 rem_anchor_token(T_const_cast);
9981 rem_anchor_token(T_const);
9982 rem_anchor_token(T_class);
9983 rem_anchor_token(T_char);
9984 rem_anchor_token(T_case);
9985 rem_anchor_token(T_break);
9986 rem_anchor_token(T_bool);
9987 rem_anchor_token(T_auto);
9988 rem_anchor_token(T_asm);
9989 rem_anchor_token(T___real__);
9990 rem_anchor_token(T___label__);
9991 rem_anchor_token(T___imag__);
9992 rem_anchor_token(T___func__);
9993 rem_anchor_token(T___extension__);
9994 rem_anchor_token(T___builtin_va_start);
9995 rem_anchor_token(T___attribute__);
9996 rem_anchor_token(T___PRETTY_FUNCTION__);
9997 rem_anchor_token(T__Thread_local);
9998 rem_anchor_token(T__Imaginary);
9999 rem_anchor_token(T__Complex);
10000 rem_anchor_token(T__Bool);
10001 rem_anchor_token(T__Alignof);
10002 rem_anchor_token(T_STRING_LITERAL);
10003 rem_anchor_token(T_PLUSPLUS);
10004 rem_anchor_token(T_NUMBER);
10005 rem_anchor_token(T_MINUSMINUS);
10006 rem_anchor_token(T_IDENTIFIER);
10007 rem_anchor_token(T_COLONCOLON);
10008 rem_anchor_token(T_CHARACTER_CONSTANT);
10009 rem_anchor_token('~');
10010 rem_anchor_token('{');
10011 rem_anchor_token(';');
10012 rem_anchor_token('-');
10013 rem_anchor_token('+');
10014 rem_anchor_token('*');
10015 rem_anchor_token('(');
10016 rem_anchor_token('&');
10017 rem_anchor_token('!');
10018 rem_anchor_token('}');
10026 * Check for unused global static functions and variables
10028 static void check_unused_globals(void)
10030 if (!is_warn_on(WARN_UNUSED_FUNCTION) && !is_warn_on(WARN_UNUSED_VARIABLE))
10033 for (const entity_t *entity = file_scope->entities; entity != NULL;
10034 entity = entity->base.next) {
10035 if (!is_declaration(entity))
10038 const declaration_t *declaration = &entity->declaration;
10039 if (declaration->used ||
10040 declaration->modifiers & DM_UNUSED ||
10041 declaration->modifiers & DM_USED ||
10042 declaration->storage_class != STORAGE_CLASS_STATIC)
10047 if (entity->kind == ENTITY_FUNCTION) {
10048 /* inhibit warning for static inline functions */
10049 if (entity->function.is_inline)
10052 why = WARN_UNUSED_FUNCTION;
10053 s = entity->function.body != NULL ? "defined" : "declared";
10055 why = WARN_UNUSED_VARIABLE;
10059 warningf(why, &declaration->base.pos, "'%#N' %s but not used", entity, s);
10063 static void parse_global_asm(void)
10065 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10068 add_anchor_token(';');
10069 add_anchor_token(')');
10070 add_anchor_token(T_STRING_LITERAL);
10073 rem_anchor_token(T_STRING_LITERAL);
10074 statement->asms.asm_text = parse_string_literals("global asm");
10075 statement->base.next = unit->global_asm;
10076 unit->global_asm = statement;
10078 rem_anchor_token(')');
10080 rem_anchor_token(';');
10084 static void parse_linkage_specification(void)
10088 position_t const pos = *HERE;
10089 char const *const linkage = parse_string_literals(NULL).begin;
10091 linkage_kind_t old_linkage = current_linkage;
10092 linkage_kind_t new_linkage;
10093 if (streq(linkage, "C")) {
10094 new_linkage = LINKAGE_C;
10095 } else if (streq(linkage, "C++")) {
10096 new_linkage = LINKAGE_CXX;
10098 errorf(&pos, "linkage string \"%s\" not recognized", linkage);
10099 new_linkage = LINKAGE_C;
10101 current_linkage = new_linkage;
10110 assert(current_linkage == new_linkage);
10111 current_linkage = old_linkage;
10114 static void parse_external(void)
10116 switch (token.kind) {
10118 if (look_ahead(1)->kind == T_STRING_LITERAL) {
10119 parse_linkage_specification();
10121 DECLARATION_START_NO_EXTERN
10123 case T___extension__:
10124 /* tokens below are for implicit int */
10125 case '&': /* & x; -> int& x; (and error later, because C++ has no
10127 case '*': /* * x; -> int* x; */
10128 case '(': /* (x); -> int (x); */
10130 parse_external_declaration();
10136 parse_global_asm();
10140 parse_namespace_definition();
10144 if (!strict_mode) {
10145 warningf(WARN_STRAY_SEMICOLON, HERE, "stray ';' outside of function");
10152 errorf(HERE, "stray %K outside of function", &token);
10153 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10154 eat_until_matching_token(token.kind);
10160 static void parse_externals(void)
10162 add_anchor_token('}');
10163 add_anchor_token(T_EOF);
10166 /* make a copy of the anchor set, so we can check if it is restored after parsing */
10167 unsigned short token_anchor_copy[T_LAST_TOKEN];
10168 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10171 while (token.kind != T_EOF && token.kind != '}') {
10173 for (int i = 0; i < T_LAST_TOKEN; ++i) {
10174 unsigned short count = token_anchor_set[i] - token_anchor_copy[i];
10176 /* the anchor set and its copy differs */
10177 internal_errorf(HERE, "Leaked anchor token %k %d times", i, count);
10180 if (in_gcc_extension) {
10181 /* an gcc extension scope was not closed */
10182 internal_errorf(HERE, "Leaked __extension__");
10189 rem_anchor_token(T_EOF);
10190 rem_anchor_token('}');
10194 * Parse a translation unit.
10196 static void parse_translation_unit(void)
10198 add_anchor_token(T_EOF);
10203 if (token.kind == T_EOF)
10206 errorf(HERE, "stray %K outside of function", &token);
10207 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10208 eat_until_matching_token(token.kind);
10213 void set_default_visibility(elf_visibility_tag_t visibility)
10215 default_visibility = visibility;
10221 * @return the translation unit or NULL if errors occurred.
10223 void start_parsing(void)
10225 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10226 label_stack = NEW_ARR_F(stack_entry_t, 0);
10228 print_to_file(stderr);
10230 assert(unit == NULL);
10231 unit = allocate_ast_zero(sizeof(unit[0]));
10233 assert(file_scope == NULL);
10234 file_scope = &unit->scope;
10236 assert(current_scope == NULL);
10237 scope_push(&unit->scope);
10239 create_gnu_builtins();
10241 create_microsoft_intrinsics();
10244 translation_unit_t *finish_parsing(void)
10246 assert(current_scope == &unit->scope);
10249 assert(file_scope == &unit->scope);
10250 check_unused_globals();
10253 DEL_ARR_F(environment_stack);
10254 DEL_ARR_F(label_stack);
10256 translation_unit_t *result = unit;
10261 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
10262 * are given length one. */
10263 static void complete_incomplete_arrays(void)
10265 size_t n = ARR_LEN(incomplete_arrays);
10266 for (size_t i = 0; i != n; ++i) {
10267 declaration_t *const decl = incomplete_arrays[i];
10268 type_t *const type = skip_typeref(decl->type);
10270 if (!is_type_incomplete(type))
10273 position_t const *const pos = &decl->base.pos;
10274 warningf(WARN_OTHER, pos, "array '%#N' assumed to have one element", (entity_t const*)decl);
10276 type_t *const new_type = duplicate_type(type);
10277 new_type->array.size_constant = true;
10278 new_type->array.has_implicit_size = true;
10279 new_type->array.size = 1;
10281 type_t *const result = identify_new_type(new_type);
10283 decl->type = result;
10287 static void prepare_main_collect2(entity_t *const entity)
10289 PUSH_SCOPE(&entity->function.body->compound.scope);
10291 // create call to __main
10292 symbol_t *symbol = symbol_table_insert("__main");
10293 entity_t *subsubmain_ent
10294 = create_implicit_function(symbol, &builtin_position);
10296 expression_t *ref = allocate_expression_zero(EXPR_REFERENCE);
10297 type_t *ftype = subsubmain_ent->declaration.type;
10298 ref->base.pos = builtin_position;
10299 ref->base.type = make_pointer_type(ftype, TYPE_QUALIFIER_NONE);
10300 ref->reference.entity = subsubmain_ent;
10302 expression_t *call = allocate_expression_zero(EXPR_CALL);
10303 call->base.pos = builtin_position;
10304 call->base.type = type_void;
10305 call->call.function = ref;
10307 statement_t *expr_statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10308 expr_statement->base.pos = builtin_position;
10309 expr_statement->expression.expression = call;
10311 statement_t *const body = entity->function.body;
10312 assert(body->kind == STATEMENT_COMPOUND);
10313 compound_statement_t *compounds = &body->compound;
10315 expr_statement->base.next = compounds->statements;
10316 compounds->statements = expr_statement;
10323 lookahead_bufpos = 0;
10324 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10327 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
10328 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
10329 parse_translation_unit();
10330 complete_incomplete_arrays();
10331 DEL_ARR_F(incomplete_arrays);
10332 incomplete_arrays = NULL;
10336 * Initialize the parser.
10338 void init_parser(void)
10340 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10342 init_expression_parsers();
10343 obstack_init(&temp_obst);
10347 * Terminate the parser.
10349 void exit_parser(void)
10351 obstack_free(&temp_obst, NULL);