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 = expression->base.type;
902 if (source_type == dest_type)
905 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
906 cast->unary.value = expression;
907 cast->base.type = dest_type;
908 cast->base.implicit = true;
913 typedef enum assign_error_t {
915 ASSIGN_ERROR_INCOMPATIBLE,
916 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
917 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
918 ASSIGN_WARNING_POINTER_FROM_INT,
919 ASSIGN_WARNING_INT_FROM_POINTER
922 static void report_assign_error(assign_error_t error, type_t *orig_type_left, expression_t const *const right, char const *const context, position_t const *const pos)
924 type_t *const orig_type_right = right->base.type;
925 type_t *const type_left = skip_typeref(orig_type_left);
926 type_t *const type_right = skip_typeref(orig_type_right);
931 case ASSIGN_ERROR_INCOMPATIBLE:
932 errorf(pos, "destination type '%T' in %s is incompatible with type '%T'", orig_type_left, context, orig_type_right);
935 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
936 type_t *points_to_left = skip_typeref(type_left->pointer.points_to);
937 type_t *points_to_right = skip_typeref(type_right->pointer.points_to);
939 /* the left type has all qualifiers from the right type */
940 unsigned missing_qualifiers = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
941 warningf(WARN_OTHER, pos, "destination type '%T' in %s from type '%T' lacks qualifiers '%Q' in pointer target type", orig_type_left, context, orig_type_right, missing_qualifiers);
945 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
946 warningf(WARN_OTHER, pos, "destination type '%T' in %s is incompatible with '%E' of type '%T'", orig_type_left, context, right, orig_type_right);
949 case ASSIGN_WARNING_POINTER_FROM_INT:
950 warningf(WARN_OTHER, pos, "%s makes pointer '%T' from integer '%T' without a cast", context, orig_type_left, orig_type_right);
953 case ASSIGN_WARNING_INT_FROM_POINTER:
954 warningf(WARN_OTHER, pos, "%s makes integer '%T' from pointer '%T' without a cast", context, orig_type_left, orig_type_right);
958 panic("invalid error value");
962 /** Implements the rules from §6.5.16.1 */
963 static assign_error_t semantic_assign(type_t *orig_type_left,
964 const expression_t *const right)
966 type_t *const orig_type_right = right->base.type;
967 type_t *const type_left = skip_typeref(orig_type_left);
968 type_t *const type_right = skip_typeref(orig_type_right);
970 if (is_type_pointer(type_left)) {
971 if (is_null_pointer_constant(right)) {
972 return ASSIGN_SUCCESS;
973 } else if (is_type_pointer(type_right)) {
974 type_t *points_to_left
975 = skip_typeref(type_left->pointer.points_to);
976 type_t *points_to_right
977 = skip_typeref(type_right->pointer.points_to);
978 assign_error_t res = ASSIGN_SUCCESS;
980 /* the left type has all qualifiers from the right type */
981 unsigned missing_qualifiers
982 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
983 if (missing_qualifiers != 0) {
984 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
987 points_to_left = get_unqualified_type(points_to_left);
988 points_to_right = get_unqualified_type(points_to_right);
990 if (is_type_void(points_to_left))
993 if (is_type_void(points_to_right)) {
994 /* ISO/IEC 14882:1998(E) §C.1.2:6 */
995 return c_mode & _CXX ? ASSIGN_ERROR_INCOMPATIBLE : res;
998 if (!types_compatible(points_to_left, points_to_right)) {
999 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
1003 } else if (is_type_integer(type_right)) {
1004 return ASSIGN_WARNING_POINTER_FROM_INT;
1006 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1007 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1008 && is_type_pointer(type_right))) {
1009 return ASSIGN_SUCCESS;
1010 } else if (is_type_compound(type_left) && is_type_compound(type_right)) {
1011 type_t *const unqual_type_left = get_unqualified_type(type_left);
1012 type_t *const unqual_type_right = get_unqualified_type(type_right);
1013 if (types_compatible(unqual_type_left, unqual_type_right)) {
1014 return ASSIGN_SUCCESS;
1016 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1017 return ASSIGN_WARNING_INT_FROM_POINTER;
1020 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1021 return ASSIGN_SUCCESS;
1023 return ASSIGN_ERROR_INCOMPATIBLE;
1026 static expression_t *parse_constant_expression(void)
1028 expression_t *result = parse_subexpression(PREC_CONDITIONAL);
1030 if (is_constant_expression(result) == EXPR_CLASS_VARIABLE) {
1031 errorf(&result->base.pos, "expression '%E' is not constant", result);
1037 static expression_t *parse_assignment_expression(void)
1039 return parse_subexpression(PREC_ASSIGNMENT);
1042 static void append_string(string_t const *const s)
1044 /* FIXME Using the ast_obstack is a hack. Using the symbol_obstack is not
1045 * possible, because other tokens are grown there alongside. */
1046 obstack_grow(&ast_obstack, s->begin, s->size);
1049 static string_t finish_string(string_encoding_t const enc)
1051 obstack_1grow(&ast_obstack, '\0');
1052 size_t const size = obstack_object_size(&ast_obstack) - 1;
1053 char const *const string = obstack_finish(&ast_obstack);
1054 return (string_t){ string, size, enc };
1057 static string_t concat_string_literals(void)
1059 assert(token.kind == T_STRING_LITERAL);
1062 if (look_ahead(1)->kind == T_STRING_LITERAL) {
1063 append_string(&token.literal.string);
1064 eat(T_STRING_LITERAL);
1065 warningf(WARN_TRADITIONAL, HERE, "traditional C rejects string constant concatenation");
1066 string_encoding_t enc = token.literal.string.encoding;
1068 string_encoding_t const new_enc = token.literal.string.encoding;
1069 if (new_enc != enc && new_enc != STRING_ENCODING_CHAR) {
1070 if (enc == STRING_ENCODING_CHAR) {
1073 errorf(HERE, "concatenating string literals with encodings %s and %s", get_string_encoding_prefix(enc), get_string_encoding_prefix(new_enc));
1076 append_string(&token.literal.string);
1077 eat(T_STRING_LITERAL);
1078 } while (token.kind == T_STRING_LITERAL);
1079 result = finish_string(enc);
1081 result = token.literal.string;
1082 eat(T_STRING_LITERAL);
1088 static string_t parse_string_literals(char const *const context)
1090 if (!skip_till(T_STRING_LITERAL, context))
1091 return (string_t){ "", 0, STRING_ENCODING_CHAR };
1093 position_t const pos = *HERE;
1094 string_t const res = concat_string_literals();
1096 if (res.encoding != STRING_ENCODING_CHAR) {
1097 errorf(&pos, "expected plain string literal, got %s string literal", get_string_encoding_prefix(res.encoding));
1103 static attribute_t *allocate_attribute_zero(attribute_kind_t kind)
1105 attribute_t *attribute = allocate_ast_zero(sizeof(*attribute));
1106 attribute->kind = kind;
1107 attribute->pos = *HERE;
1112 * Parse (gcc) attribute argument. From gcc comments in gcc source:
1115 * __attribute__ ( ( attribute-list ) )
1119 * attribute_list , attrib
1124 * any-word ( identifier )
1125 * any-word ( identifier , nonempty-expr-list )
1126 * any-word ( expr-list )
1128 * where the "identifier" must not be declared as a type, and
1129 * "any-word" may be any identifier (including one declared as a
1130 * type), a reserved word storage class specifier, type specifier or
1131 * type qualifier. ??? This still leaves out most reserved keywords
1132 * (following the old parser), shouldn't we include them, and why not
1133 * allow identifiers declared as types to start the arguments?
1135 * Matze: this all looks confusing and little systematic, so we're even less
1136 * strict and parse any list of things which are identifiers or
1137 * (assignment-)expressions.
1139 static attribute_argument_t *parse_attribute_arguments(void)
1141 attribute_argument_t *first = NULL;
1142 attribute_argument_t **anchor = &first;
1143 if (token.kind != ')') do {
1144 attribute_argument_t *argument = allocate_ast_zero(sizeof(*argument));
1146 /* is it an identifier */
1147 if (token.kind == T_IDENTIFIER
1148 && (look_ahead(1)->kind == ',' || look_ahead(1)->kind == ')')) {
1149 argument->kind = ATTRIBUTE_ARGUMENT_SYMBOL;
1150 argument->v.symbol = token.base.symbol;
1153 /* must be an expression */
1154 expression_t *expression = parse_assignment_expression();
1156 argument->kind = ATTRIBUTE_ARGUMENT_EXPRESSION;
1157 argument->v.expression = expression;
1160 /* append argument */
1162 anchor = &argument->next;
1163 } while (accept(','));
1168 static attribute_t *parse_attribute_asm(void)
1170 attribute_t *attribute = allocate_attribute_zero(ATTRIBUTE_GNU_ASM);
1173 attribute->a.arguments = parse_attribute_arguments();
1177 static attribute_t *parse_attribute_gnu_single(void)
1179 /* parse "any-word" */
1180 symbol_t *const symbol = token.base.symbol;
1181 if (symbol == NULL) {
1182 parse_error_expected("while parsing attribute((", T_IDENTIFIER, NULL);
1186 attribute_kind_t kind;
1187 char const *const name = symbol->string;
1188 for (kind = ATTRIBUTE_GNU_FIRST;; ++kind) {
1189 if (kind > ATTRIBUTE_GNU_LAST) {
1190 /* special case for "__const" */
1191 if (token.kind == T_const) {
1192 kind = ATTRIBUTE_GNU_CONST;
1196 warningf(WARN_ATTRIBUTE, HERE, "unknown attribute '%s' ignored", name);
1197 /* TODO: we should still save the attribute in the list... */
1198 kind = ATTRIBUTE_UNKNOWN;
1202 const char *attribute_name = get_attribute_name(kind);
1203 if (attribute_name != NULL && streq_underscore(attribute_name, name))
1207 attribute_t *attribute = allocate_attribute_zero(kind);
1210 /* parse arguments */
1212 attribute->a.arguments = parse_attribute_arguments();
1217 static attribute_t *parse_attribute_gnu(void)
1219 attribute_t *first = NULL;
1220 attribute_t **anchor = &first;
1222 eat(T___attribute__);
1223 add_anchor_token(')');
1224 add_anchor_token(',');
1228 if (token.kind != ')') do {
1229 attribute_t *attribute = parse_attribute_gnu_single();
1231 *anchor = attribute;
1232 anchor = &attribute->next;
1234 } while (accept(','));
1235 rem_anchor_token(',');
1236 rem_anchor_token(')');
1243 /** Parse attributes. */
1244 static attribute_t *parse_attributes(attribute_t *first)
1246 attribute_t **anchor = &first;
1248 while (*anchor != NULL)
1249 anchor = &(*anchor)->next;
1251 attribute_t *attribute;
1252 switch (token.kind) {
1253 case T___attribute__:
1254 attribute = parse_attribute_gnu();
1255 if (attribute == NULL)
1260 attribute = parse_attribute_asm();
1264 attribute = allocate_attribute_zero(ATTRIBUTE_MS_CDECL);
1269 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FASTCALL);
1273 case T__forceinline:
1274 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FORCEINLINE);
1275 eat(T__forceinline);
1279 attribute = allocate_attribute_zero(ATTRIBUTE_MS_STDCALL);
1284 /* TODO record modifier */
1285 warningf(WARN_OTHER, HERE, "Ignoring declaration modifier %K", &token);
1286 attribute = allocate_attribute_zero(ATTRIBUTE_MS_THISCALL);
1294 *anchor = attribute;
1295 anchor = &attribute->next;
1299 static void mark_vars_read(expression_t *expr, entity_t *lhs_ent);
1301 static entity_t *determine_lhs_ent(expression_t *const expr,
1304 switch (expr->kind) {
1305 case EXPR_REFERENCE: {
1306 entity_t *const entity = expr->reference.entity;
1307 /* we should only find variables as lvalues... */
1308 if (entity->base.kind != ENTITY_VARIABLE
1309 && entity->base.kind != ENTITY_PARAMETER)
1315 case EXPR_ARRAY_ACCESS: {
1316 expression_t *const ref = expr->array_access.array_ref;
1317 entity_t * ent = NULL;
1318 if (is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1319 ent = determine_lhs_ent(ref, lhs_ent);
1322 mark_vars_read(ref, lhs_ent);
1324 mark_vars_read(expr->array_access.index, lhs_ent);
1329 mark_vars_read(expr->select.compound, lhs_ent);
1330 if (is_type_compound(skip_typeref(expr->base.type)))
1331 return determine_lhs_ent(expr->select.compound, lhs_ent);
1335 case EXPR_UNARY_DEREFERENCE: {
1336 expression_t *const val = expr->unary.value;
1337 if (val->kind == EXPR_UNARY_TAKE_ADDRESS) {
1339 return determine_lhs_ent(val->unary.value, lhs_ent);
1341 mark_vars_read(val, NULL);
1347 mark_vars_read(expr, NULL);
1352 #define ENT_ANY ((entity_t*)-1)
1355 * Mark declarations, which are read. This is used to detect variables, which
1359 * x is not marked as "read", because it is only read to calculate its own new
1363 * x and y are not detected as "not read", because multiple variables are
1366 static void mark_vars_read(expression_t *const expr, entity_t *lhs_ent)
1368 switch (expr->kind) {
1369 case EXPR_REFERENCE: {
1370 entity_t *const entity = expr->reference.entity;
1371 if (entity->kind != ENTITY_VARIABLE
1372 && entity->kind != ENTITY_PARAMETER)
1375 if (lhs_ent != entity && lhs_ent != ENT_ANY) {
1376 entity->variable.read = true;
1382 // TODO respect pure/const
1383 mark_vars_read(expr->call.function, NULL);
1384 for (call_argument_t *arg = expr->call.arguments; arg != NULL; arg = arg->next) {
1385 mark_vars_read(arg->expression, NULL);
1389 case EXPR_CONDITIONAL:
1390 // TODO lhs_decl should depend on whether true/false have an effect
1391 mark_vars_read(expr->conditional.condition, NULL);
1392 if (expr->conditional.true_expression != NULL)
1393 mark_vars_read(expr->conditional.true_expression, lhs_ent);
1394 mark_vars_read(expr->conditional.false_expression, lhs_ent);
1398 if (lhs_ent == ENT_ANY
1399 && !is_type_compound(skip_typeref(expr->base.type)))
1401 mark_vars_read(expr->select.compound, lhs_ent);
1404 case EXPR_ARRAY_ACCESS: {
1405 mark_vars_read(expr->array_access.index, lhs_ent);
1406 expression_t *const ref = expr->array_access.array_ref;
1407 if (!is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1408 if (lhs_ent == ENT_ANY)
1411 mark_vars_read(ref, lhs_ent);
1416 mark_vars_read(expr->va_arge.ap, lhs_ent);
1420 mark_vars_read(expr->va_copye.src, lhs_ent);
1423 case EXPR_UNARY_CAST:
1424 /* Special case: Use void cast to mark a variable as "read" */
1425 if (is_type_void(skip_typeref(expr->base.type)))
1430 case EXPR_UNARY_THROW:
1431 if (expr->unary.value == NULL)
1434 case EXPR_UNARY_DEREFERENCE:
1435 case EXPR_UNARY_DELETE:
1436 case EXPR_UNARY_DELETE_ARRAY:
1437 if (lhs_ent == ENT_ANY)
1441 case EXPR_UNARY_NEGATE:
1442 case EXPR_UNARY_PLUS:
1443 case EXPR_UNARY_BITWISE_NEGATE:
1444 case EXPR_UNARY_NOT:
1445 case EXPR_UNARY_TAKE_ADDRESS:
1446 case EXPR_UNARY_POSTFIX_INCREMENT:
1447 case EXPR_UNARY_POSTFIX_DECREMENT:
1448 case EXPR_UNARY_PREFIX_INCREMENT:
1449 case EXPR_UNARY_PREFIX_DECREMENT:
1450 case EXPR_UNARY_ASSUME:
1452 mark_vars_read(expr->unary.value, lhs_ent);
1455 case EXPR_BINARY_ADD:
1456 case EXPR_BINARY_SUB:
1457 case EXPR_BINARY_MUL:
1458 case EXPR_BINARY_DIV:
1459 case EXPR_BINARY_MOD:
1460 case EXPR_BINARY_EQUAL:
1461 case EXPR_BINARY_NOTEQUAL:
1462 case EXPR_BINARY_LESS:
1463 case EXPR_BINARY_LESSEQUAL:
1464 case EXPR_BINARY_GREATER:
1465 case EXPR_BINARY_GREATEREQUAL:
1466 case EXPR_BINARY_BITWISE_AND:
1467 case EXPR_BINARY_BITWISE_OR:
1468 case EXPR_BINARY_BITWISE_XOR:
1469 case EXPR_BINARY_LOGICAL_AND:
1470 case EXPR_BINARY_LOGICAL_OR:
1471 case EXPR_BINARY_SHIFTLEFT:
1472 case EXPR_BINARY_SHIFTRIGHT:
1473 case EXPR_BINARY_COMMA:
1474 case EXPR_BINARY_ISGREATER:
1475 case EXPR_BINARY_ISGREATEREQUAL:
1476 case EXPR_BINARY_ISLESS:
1477 case EXPR_BINARY_ISLESSEQUAL:
1478 case EXPR_BINARY_ISLESSGREATER:
1479 case EXPR_BINARY_ISUNORDERED:
1480 mark_vars_read(expr->binary.left, lhs_ent);
1481 mark_vars_read(expr->binary.right, lhs_ent);
1484 case EXPR_BINARY_ASSIGN:
1485 case EXPR_BINARY_MUL_ASSIGN:
1486 case EXPR_BINARY_DIV_ASSIGN:
1487 case EXPR_BINARY_MOD_ASSIGN:
1488 case EXPR_BINARY_ADD_ASSIGN:
1489 case EXPR_BINARY_SUB_ASSIGN:
1490 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
1491 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
1492 case EXPR_BINARY_BITWISE_AND_ASSIGN:
1493 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
1494 case EXPR_BINARY_BITWISE_OR_ASSIGN: {
1495 if (lhs_ent == ENT_ANY)
1497 lhs_ent = determine_lhs_ent(expr->binary.left, lhs_ent);
1498 mark_vars_read(expr->binary.right, lhs_ent);
1503 determine_lhs_ent(expr->va_starte.ap, lhs_ent);
1506 case EXPR_LITERAL_CASES:
1507 case EXPR_LITERAL_CHARACTER:
1509 case EXPR_STRING_LITERAL:
1510 case EXPR_COMPOUND_LITERAL: // TODO init?
1512 case EXPR_CLASSIFY_TYPE:
1515 case EXPR_BUILTIN_CONSTANT_P:
1516 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
1518 case EXPR_STATEMENT: // TODO
1519 case EXPR_LABEL_ADDRESS:
1520 case EXPR_ENUM_CONSTANT:
1524 panic("unhandled expression");
1527 static designator_t *parse_designation(void)
1529 designator_t *result = NULL;
1530 designator_t **anchor = &result;
1533 designator_t *designator;
1534 switch (token.kind) {
1536 designator = allocate_ast_zero(sizeof(designator[0]));
1537 designator->pos = *HERE;
1539 add_anchor_token(']');
1540 designator->array_index = parse_constant_expression();
1541 rem_anchor_token(']');
1545 designator = allocate_ast_zero(sizeof(designator[0]));
1546 designator->pos = *HERE;
1548 designator->symbol = expect_identifier("while parsing designator", NULL);
1549 if (!designator->symbol)
1557 assert(designator != NULL);
1558 *anchor = designator;
1559 anchor = &designator->next;
1564 * Build an initializer from a given expression.
1566 static initializer_t *initializer_from_expression(type_t *orig_type,
1567 expression_t *expression)
1569 /* TODO check that expression is a constant expression */
1571 type_t *const type = skip_typeref(orig_type);
1573 /* §6.7.8.14/15 char array may be initialized by string literals */
1574 if (expression->kind == EXPR_STRING_LITERAL && is_type_array(type)) {
1575 array_type_t *const array_type = &type->array;
1576 type_t *const element_type = skip_typeref(array_type->element_type);
1577 switch (expression->string_literal.value.encoding) {
1578 case STRING_ENCODING_CHAR:
1579 case STRING_ENCODING_UTF8: {
1580 if (is_type_atomic(element_type, ATOMIC_TYPE_CHAR) ||
1581 is_type_atomic(element_type, ATOMIC_TYPE_SCHAR) ||
1582 is_type_atomic(element_type, ATOMIC_TYPE_UCHAR)) {
1583 goto make_string_init;
1588 case STRING_ENCODING_CHAR16:
1589 case STRING_ENCODING_CHAR32:
1590 case STRING_ENCODING_WIDE: {
1591 assert(is_type_pointer(expression->base.type));
1592 type_t *const init_type = get_unqualified_type(expression->base.type->pointer.points_to);
1593 if (types_compatible(get_unqualified_type(element_type), init_type)) {
1595 initializer_t *const init = allocate_initializer_zero(INITIALIZER_STRING);
1596 init->value.value = expression;
1604 assign_error_t error = semantic_assign(type, expression);
1605 if (error == ASSIGN_ERROR_INCOMPATIBLE)
1607 report_assign_error(error, type, expression, "initializer",
1608 &expression->base.pos);
1610 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
1611 result->value.value = create_implicit_cast(expression, type);
1617 * Parses an scalar initializer.
1619 * §6.7.8.11; eat {} without warning
1621 static initializer_t *parse_scalar_initializer(type_t *type,
1622 bool must_be_constant)
1624 /* there might be extra {} hierarchies */
1626 if (token.kind == '{') {
1627 warningf(WARN_OTHER, HERE, "extra curly braces around scalar initializer");
1631 } while (token.kind == '{');
1634 expression_t *expression = parse_assignment_expression();
1635 mark_vars_read(expression, NULL);
1636 if (must_be_constant && !is_linker_constant(expression)) {
1637 errorf(&expression->base.pos,
1638 "initialisation expression '%E' is not constant",
1642 initializer_t *initializer = initializer_from_expression(type, expression);
1644 if (initializer == NULL) {
1645 errorf(&expression->base.pos,
1646 "expression '%E' (type '%T') doesn't match expected type '%T'",
1647 expression, expression->base.type, type);
1652 bool additional_warning_displayed = false;
1653 while (braces > 0) {
1655 if (token.kind != '}') {
1656 if (!additional_warning_displayed) {
1657 warningf(WARN_OTHER, HERE, "additional elements in scalar initializer");
1658 additional_warning_displayed = true;
1669 * An entry in the type path.
1671 typedef struct type_path_entry_t type_path_entry_t;
1672 struct type_path_entry_t {
1673 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
1675 size_t index; /**< For array types: the current index. */
1676 declaration_t *compound_entry; /**< For compound types: the current declaration. */
1681 * A type path expression a position inside compound or array types.
1683 typedef struct type_path_t type_path_t;
1684 struct type_path_t {
1685 type_path_entry_t *path; /**< An flexible array containing the current path. */
1686 type_t *top_type; /**< type of the element the path points */
1687 size_t max_index; /**< largest index in outermost array */
1691 * Prints a type path for debugging.
1693 static __attribute__((unused)) void debug_print_type_path(
1694 const type_path_t *path)
1696 size_t len = ARR_LEN(path->path);
1698 for (size_t i = 0; i < len; ++i) {
1699 const type_path_entry_t *entry = & path->path[i];
1701 type_t *type = skip_typeref(entry->type);
1702 if (is_type_compound(type)) {
1703 /* in gcc mode structs can have no members */
1704 if (entry->v.compound_entry == NULL) {
1708 fprintf(stderr, ".%s",
1709 entry->v.compound_entry->base.symbol->string);
1710 } else if (is_type_array(type)) {
1711 fprintf(stderr, "[%u]", (unsigned) entry->v.index);
1713 fprintf(stderr, "-INVALID-");
1716 if (path->top_type != NULL) {
1717 fprintf(stderr, " (");
1718 print_type(path->top_type);
1719 fprintf(stderr, ")");
1724 * Return the top type path entry, i.e. in a path
1725 * (type).a.b returns the b.
1727 static type_path_entry_t *get_type_path_top(const type_path_t *path)
1729 size_t len = ARR_LEN(path->path);
1731 return &path->path[len-1];
1735 * Enlarge the type path by an (empty) element.
1737 static type_path_entry_t *append_to_type_path(type_path_t *path)
1739 size_t len = ARR_LEN(path->path);
1740 ARR_RESIZE(type_path_entry_t, path->path, len+1);
1742 type_path_entry_t *result = & path->path[len];
1743 memset(result, 0, sizeof(result[0]));
1748 * Descending into a sub-type. Enter the scope of the current top_type.
1750 static void descend_into_subtype(type_path_t *path)
1752 type_t *orig_top_type = path->top_type;
1753 type_t *top_type = skip_typeref(orig_top_type);
1755 type_path_entry_t *top = append_to_type_path(path);
1756 top->type = top_type;
1758 if (is_type_compound(top_type)) {
1759 compound_t *const compound = top_type->compound.compound;
1760 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
1762 if (entry != NULL) {
1763 top->v.compound_entry = &entry->declaration;
1764 path->top_type = entry->declaration.type;
1766 path->top_type = NULL;
1768 } else if (is_type_array(top_type)) {
1770 path->top_type = top_type->array.element_type;
1772 assert(!is_type_valid(top_type));
1777 * Pop an entry from the given type path, i.e. returning from
1778 * (type).a.b to (type).a
1780 static void ascend_from_subtype(type_path_t *path)
1782 type_path_entry_t *top = get_type_path_top(path);
1784 path->top_type = top->type;
1786 size_t len = ARR_LEN(path->path);
1787 ARR_RESIZE(type_path_entry_t, path->path, len-1);
1791 * Pop entries from the given type path until the given
1792 * path level is reached.
1794 static void ascend_to(type_path_t *path, size_t top_path_level)
1796 size_t len = ARR_LEN(path->path);
1798 while (len > top_path_level) {
1799 ascend_from_subtype(path);
1800 len = ARR_LEN(path->path);
1804 static bool walk_designator(type_path_t *path, const designator_t *designator,
1805 bool used_in_offsetof)
1807 for (; designator != NULL; designator = designator->next) {
1808 type_path_entry_t *top = get_type_path_top(path);
1809 type_t *orig_type = top->type;
1811 type_t *type = skip_typeref(orig_type);
1813 if (designator->symbol != NULL) {
1814 symbol_t *symbol = designator->symbol;
1815 if (!is_type_compound(type)) {
1816 if (is_type_valid(type)) {
1817 errorf(&designator->pos,
1818 "'.%Y' designator used for non-compound type '%T'",
1822 top->type = type_error_type;
1823 top->v.compound_entry = NULL;
1824 orig_type = type_error_type;
1826 compound_t *compound = type->compound.compound;
1827 entity_t *iter = compound->members.entities;
1828 for (; iter != NULL; iter = iter->base.next) {
1829 if (iter->base.symbol == symbol) {
1834 errorf(&designator->pos,
1835 "'%T' has no member named '%Y'", orig_type, symbol);
1838 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
1839 if (used_in_offsetof && iter->compound_member.bitfield) {
1840 errorf(&designator->pos,
1841 "offsetof designator '%Y' must not specify bitfield",
1846 top->type = orig_type;
1847 top->v.compound_entry = &iter->declaration;
1848 orig_type = iter->declaration.type;
1851 expression_t *array_index = designator->array_index;
1852 if (is_constant_expression(array_index) != EXPR_CLASS_CONSTANT)
1855 if (!is_type_array(type)) {
1856 if (is_type_valid(type)) {
1857 errorf(&designator->pos,
1858 "[%E] designator used for non-array type '%T'",
1859 array_index, orig_type);
1864 long index = fold_constant_to_int(array_index);
1865 if (!used_in_offsetof) {
1867 errorf(&designator->pos,
1868 "array index [%E] must be positive", array_index);
1869 } else if (type->array.size_constant) {
1870 long array_size = type->array.size;
1871 if (index >= array_size) {
1872 errorf(&designator->pos,
1873 "designator [%E] (%d) exceeds array size %d",
1874 array_index, index, array_size);
1879 top->type = orig_type;
1880 top->v.index = (size_t) index;
1881 orig_type = type->array.element_type;
1883 path->top_type = orig_type;
1885 if (designator->next != NULL) {
1886 descend_into_subtype(path);
1892 static void advance_current_object(type_path_t *path, size_t top_path_level)
1894 type_path_entry_t *top = get_type_path_top(path);
1896 type_t *type = skip_typeref(top->type);
1897 if (is_type_union(type)) {
1898 /* in unions only the first element is initialized */
1899 top->v.compound_entry = NULL;
1900 } else if (is_type_struct(type)) {
1901 declaration_t *entry = top->v.compound_entry;
1903 entity_t *const next_entity = skip_unnamed_bitfields(entry->base.next);
1904 if (next_entity != NULL) {
1905 assert(is_declaration(next_entity));
1906 entry = &next_entity->declaration;
1911 top->v.compound_entry = entry;
1912 if (entry != NULL) {
1913 path->top_type = entry->type;
1916 } else if (is_type_array(type)) {
1917 assert(is_type_array(type));
1921 if (!type->array.size_constant || top->v.index < type->array.size) {
1925 assert(!is_type_valid(type));
1929 /* we're past the last member of the current sub-aggregate, try if we
1930 * can ascend in the type hierarchy and continue with another subobject */
1931 size_t len = ARR_LEN(path->path);
1933 if (len > top_path_level) {
1934 ascend_from_subtype(path);
1935 advance_current_object(path, top_path_level);
1937 path->top_type = NULL;
1942 * skip any {...} blocks until a closing bracket is reached.
1944 static void skip_initializers(void)
1948 while (token.kind != '}') {
1949 if (token.kind == T_EOF)
1951 if (token.kind == '{') {
1959 static initializer_t *create_empty_initializer(void)
1961 static initializer_t empty_initializer
1962 = { .list = { { INITIALIZER_LIST }, 0 } };
1963 return &empty_initializer;
1967 * Parse a part of an initialiser for a struct or union,
1969 static initializer_t *parse_sub_initializer(type_path_t *path,
1970 type_t *outer_type, size_t top_path_level,
1971 parse_initializer_env_t *env)
1973 if (token.kind == '}') {
1974 /* empty initializer */
1975 return create_empty_initializer();
1978 initializer_t *result = NULL;
1980 type_t *orig_type = path->top_type;
1981 type_t *type = NULL;
1983 if (orig_type == NULL) {
1984 /* We are initializing an empty compound. */
1986 type = skip_typeref(orig_type);
1989 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
1992 designator_t *designator = NULL;
1993 if (token.kind == '.' || token.kind == '[') {
1994 designator = parse_designation();
1995 goto finish_designator;
1996 } else if (token.kind == T_IDENTIFIER && look_ahead(1)->kind == ':') {
1997 /* GNU-style designator ("identifier: value") */
1998 designator = allocate_ast_zero(sizeof(designator[0]));
1999 designator->pos = *HERE;
2000 designator->symbol = token.base.symbol;
2005 /* reset path to toplevel, evaluate designator from there */
2006 ascend_to(path, top_path_level);
2007 if (!walk_designator(path, designator, false)) {
2008 /* can't continue after designation error */
2012 initializer_t *designator_initializer
2013 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2014 designator_initializer->designator.designator = designator;
2015 ARR_APP1(initializer_t*, initializers, designator_initializer);
2017 orig_type = path->top_type;
2018 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2023 if (token.kind == '{') {
2024 if (type != NULL && is_type_scalar(type)) {
2025 sub = parse_scalar_initializer(type, env->must_be_constant);
2028 if (env->entity != NULL) {
2029 errorf(HERE, "extra brace group at end of initializer for '%N'", env->entity);
2031 errorf(HERE, "extra brace group at end of initializer");
2036 descend_into_subtype(path);
2039 add_anchor_token('}');
2040 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2042 rem_anchor_token('}');
2047 goto error_parse_next;
2049 ascend_from_subtype(path);
2052 /* must be an expression */
2053 expression_t *expression = parse_assignment_expression();
2054 mark_vars_read(expression, NULL);
2056 if (env->must_be_constant && !is_linker_constant(expression)) {
2057 errorf(&expression->base.pos,
2058 "Initialisation expression '%E' is not constant",
2063 /* we are already outside, ... */
2064 if (outer_type == NULL)
2065 goto error_parse_next;
2066 type_t *const outer_type_skip = skip_typeref(outer_type);
2067 if (is_type_compound(outer_type_skip) &&
2068 !outer_type_skip->compound.compound->complete) {
2069 goto error_parse_next;
2072 position_t const* const pos = &expression->base.pos;
2073 if (env->entity != NULL) {
2074 warningf(WARN_OTHER, pos, "excess elements in initializer for '%N'", env->entity);
2076 warningf(WARN_OTHER, pos, "excess elements in initializer");
2078 goto error_parse_next;
2081 /* handle { "string" } special case */
2082 if (expression->kind == EXPR_STRING_LITERAL && outer_type != NULL) {
2083 result = initializer_from_expression(outer_type, expression);
2084 if (result != NULL) {
2086 if (token.kind != '}') {
2087 warningf(WARN_OTHER, HERE, "excessive elements in initializer for type '%T'", outer_type);
2089 /* TODO: eat , ... */
2094 /* descend into subtypes until expression matches type */
2096 orig_type = path->top_type;
2097 type = skip_typeref(orig_type);
2099 sub = initializer_from_expression(orig_type, expression);
2103 if (!is_type_valid(type)) {
2106 if (is_type_scalar(type)) {
2107 errorf(&expression->base.pos,
2108 "expression '%E' doesn't match expected type '%T'",
2109 expression, orig_type);
2113 descend_into_subtype(path);
2117 /* update largest index of top array */
2118 const type_path_entry_t *first = &path->path[0];
2119 type_t *first_type = first->type;
2120 first_type = skip_typeref(first_type);
2121 if (is_type_array(first_type)) {
2122 size_t index = first->v.index;
2123 if (index > path->max_index)
2124 path->max_index = index;
2127 /* append to initializers list */
2128 ARR_APP1(initializer_t*, initializers, sub);
2133 if (token.kind == '}') {
2138 /* advance to the next declaration if we are not at the end */
2139 advance_current_object(path, top_path_level);
2140 orig_type = path->top_type;
2141 if (orig_type != NULL)
2142 type = skip_typeref(orig_type);
2148 size_t len = ARR_LEN(initializers);
2149 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2150 result = allocate_ast_zero(size);
2151 result->kind = INITIALIZER_LIST;
2152 result->list.len = len;
2153 memcpy(&result->list.initializers, initializers,
2154 len * sizeof(initializers[0]));
2158 skip_initializers();
2160 DEL_ARR_F(initializers);
2161 ascend_to(path, top_path_level+1);
2165 static expression_t *make_size_literal(size_t value)
2167 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_INTEGER);
2168 literal->base.type = type_size_t;
2171 snprintf(buf, sizeof(buf), "%u", (unsigned) value);
2172 literal->literal.value = make_string(buf);
2178 * Parses an initializer. Parsers either a compound literal
2179 * (env->declaration == NULL) or an initializer of a declaration.
2181 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2183 type_t *type = skip_typeref(env->type);
2184 size_t max_index = 0;
2185 initializer_t *result;
2187 if (is_type_scalar(type)) {
2188 result = parse_scalar_initializer(type, env->must_be_constant);
2189 } else if (token.kind == '{') {
2193 memset(&path, 0, sizeof(path));
2194 path.top_type = env->type;
2195 path.path = NEW_ARR_F(type_path_entry_t, 0);
2197 descend_into_subtype(&path);
2199 add_anchor_token('}');
2200 result = parse_sub_initializer(&path, env->type, 1, env);
2201 rem_anchor_token('}');
2203 max_index = path.max_index;
2204 DEL_ARR_F(path.path);
2208 /* parse_scalar_initializer() also works in this case: we simply
2209 * have an expression without {} around it */
2210 result = parse_scalar_initializer(type, env->must_be_constant);
2213 /* §6.7.8:22 array initializers for arrays with unknown size determine
2214 * the array type size */
2215 if (is_type_array(type) && type->array.size_expression == NULL
2216 && result != NULL) {
2218 switch (result->kind) {
2219 case INITIALIZER_LIST:
2220 assert(max_index != 0xdeadbeaf);
2221 size = max_index + 1;
2224 case INITIALIZER_STRING: {
2225 size = get_string_len(&get_init_string(result)->value) + 1;
2229 case INITIALIZER_DESIGNATOR:
2230 case INITIALIZER_VALUE:
2231 /* can happen for parse errors */
2236 internal_errorf(HERE, "invalid initializer type");
2239 type_t *new_type = duplicate_type(type);
2241 new_type->array.size_expression = make_size_literal(size);
2242 new_type->array.size_constant = true;
2243 new_type->array.has_implicit_size = true;
2244 new_type->array.size = size;
2245 env->type = new_type;
2251 static void append_entity(scope_t *scope, entity_t *entity)
2253 if (scope->last_entity != NULL) {
2254 scope->last_entity->base.next = entity;
2256 scope->entities = entity;
2258 entity->base.parent_entity = current_entity;
2259 scope->last_entity = entity;
2263 static compound_t *parse_compound_type_specifier(bool is_struct)
2265 position_t const pos = *HERE;
2266 eat(is_struct ? T_struct : T_union);
2268 symbol_t *symbol = NULL;
2269 entity_t *entity = NULL;
2270 attribute_t *attributes = NULL;
2272 if (token.kind == T___attribute__) {
2273 attributes = parse_attributes(NULL);
2276 entity_kind_tag_t const kind = is_struct ? ENTITY_STRUCT : ENTITY_UNION;
2277 if (token.kind == T_IDENTIFIER) {
2278 /* the compound has a name, check if we have seen it already */
2279 symbol = token.base.symbol;
2280 entity = get_tag(symbol, kind);
2283 if (entity != NULL) {
2284 if (entity->base.parent_scope != current_scope &&
2285 (token.kind == '{' || token.kind == ';')) {
2286 /* we're in an inner scope and have a definition. Shadow
2287 * existing definition in outer scope */
2289 } else if (entity->compound.complete && token.kind == '{') {
2290 position_t const *const ppos = &entity->base.pos;
2291 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2292 /* clear members in the hope to avoid further errors */
2293 entity->compound.members.entities = NULL;
2296 } else if (token.kind != '{') {
2297 char const *const msg =
2298 is_struct ? "while parsing struct type specifier" :
2299 "while parsing union type specifier";
2300 parse_error_expected(msg, T_IDENTIFIER, '{', NULL);
2305 if (entity == NULL) {
2306 entity = allocate_entity_zero(kind, NAMESPACE_TAG, symbol, &pos);
2307 entity->compound.alignment = 1;
2308 entity->base.parent_scope = current_scope;
2309 if (symbol != NULL) {
2310 environment_push(entity);
2312 append_entity(current_scope, entity);
2315 if (token.kind == '{') {
2316 parse_compound_type_entries(&entity->compound);
2318 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2319 if (symbol == NULL) {
2320 assert(anonymous_entity == NULL);
2321 anonymous_entity = entity;
2325 if (attributes != NULL) {
2326 entity->compound.attributes = attributes;
2327 handle_entity_attributes(attributes, entity);
2330 return &entity->compound;
2333 static void parse_enum_entries(type_t *const enum_type)
2337 if (token.kind == '}') {
2338 errorf(HERE, "empty enum not allowed");
2343 add_anchor_token('}');
2344 add_anchor_token(',');
2346 add_anchor_token('=');
2348 symbol_t *const symbol = expect_identifier("while parsing enum entry", &pos);
2349 entity_t *const entity = allocate_entity_zero(ENTITY_ENUM_VALUE, NAMESPACE_NORMAL, symbol, &pos);
2350 entity->enum_value.enum_type = enum_type;
2351 rem_anchor_token('=');
2354 expression_t *value = parse_constant_expression();
2356 value = create_implicit_cast(value, enum_type);
2357 entity->enum_value.value = value;
2362 record_entity(entity, false);
2363 } while (accept(',') && token.kind != '}');
2364 rem_anchor_token(',');
2365 rem_anchor_token('}');
2370 static type_t *parse_enum_specifier(void)
2372 position_t const pos = *HERE;
2377 switch (token.kind) {
2379 symbol = token.base.symbol;
2380 entity = get_tag(symbol, ENTITY_ENUM);
2383 if (entity != NULL) {
2384 if (entity->base.parent_scope != current_scope &&
2385 (token.kind == '{' || token.kind == ';')) {
2386 /* we're in an inner scope and have a definition. Shadow
2387 * existing definition in outer scope */
2389 } else if (entity->enume.complete && token.kind == '{') {
2390 position_t const *const ppos = &entity->base.pos;
2391 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2402 parse_error_expected("while parsing enum type specifier",
2403 T_IDENTIFIER, '{', NULL);
2407 if (entity == NULL) {
2408 entity = allocate_entity_zero(ENTITY_ENUM, NAMESPACE_TAG, symbol, &pos);
2409 entity->base.parent_scope = current_scope;
2412 type_t *const type = allocate_type_zero(TYPE_ENUM);
2413 type->enumt.enume = &entity->enume;
2414 type->enumt.base.akind = ATOMIC_TYPE_INT;
2416 if (token.kind == '{') {
2417 if (symbol != NULL) {
2418 environment_push(entity);
2420 append_entity(current_scope, entity);
2421 entity->enume.complete = true;
2423 parse_enum_entries(type);
2424 parse_attributes(NULL);
2426 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2427 if (symbol == NULL) {
2428 assert(anonymous_entity == NULL);
2429 anonymous_entity = entity;
2431 } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
2432 errorf(HERE, "'%T' used before definition (incomplete enums are a GNU extension)", type);
2439 * if a symbol is a typedef to another type, return true
2441 static bool is_typedef_symbol(symbol_t *symbol)
2443 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
2444 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
2447 static type_t *parse_typeof(void)
2453 add_anchor_token(')');
2456 expression_t *expression = NULL;
2458 switch (token.kind) {
2460 if (is_typedef_symbol(token.base.symbol)) {
2462 type = parse_typename();
2465 expression = parse_expression();
2466 type = revert_automatic_type_conversion(expression);
2471 rem_anchor_token(')');
2474 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
2475 typeof_type->typeoft.expression = expression;
2476 typeof_type->typeoft.typeof_type = type;
2481 typedef enum specifiers_t {
2483 SPECIFIER_SIGNED = 1 << 0,
2484 SPECIFIER_UNSIGNED = 1 << 1,
2485 SPECIFIER_LONG = 1 << 2,
2486 SPECIFIER_INT = 1 << 3,
2487 SPECIFIER_DOUBLE = 1 << 4,
2488 SPECIFIER_CHAR = 1 << 5,
2489 SPECIFIER_WCHAR_T = 1 << 6,
2490 SPECIFIER_SHORT = 1 << 7,
2491 SPECIFIER_LONG_LONG = 1 << 8,
2492 SPECIFIER_FLOAT = 1 << 9,
2493 SPECIFIER_BOOL = 1 << 10,
2494 SPECIFIER_VOID = 1 << 11,
2495 SPECIFIER_INT8 = 1 << 12,
2496 SPECIFIER_INT16 = 1 << 13,
2497 SPECIFIER_INT32 = 1 << 14,
2498 SPECIFIER_INT64 = 1 << 15,
2499 SPECIFIER_INT128 = 1 << 16,
2500 SPECIFIER_COMPLEX = 1 << 17,
2501 SPECIFIER_IMAGINARY = 1 << 18,
2504 static type_t *get_typedef_type(symbol_t *symbol)
2506 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
2507 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
2510 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
2511 type->typedeft.typedefe = &entity->typedefe;
2516 static attribute_t *parse_attribute_ms_property(attribute_t *attribute)
2518 attribute_property_argument_t *const property = allocate_ast_zero(sizeof(*property));
2520 add_anchor_token(')');
2521 add_anchor_token(',');
2525 add_anchor_token('=');
2527 symbol_t *const prop_sym = expect_identifier("while parsing property declspec", &pos);
2528 rem_anchor_token('=');
2530 symbol_t **prop = NULL;
2532 if (streq(prop_sym->string, "put")) {
2533 prop = &property->put_symbol;
2534 } else if (streq(prop_sym->string, "get")) {
2535 prop = &property->get_symbol;
2537 errorf(&pos, "expected put or get in property declspec, but got '%Y'", prop_sym);
2541 add_anchor_token(T_IDENTIFIER);
2543 rem_anchor_token(T_IDENTIFIER);
2545 symbol_t *const sym = expect_identifier("while parsing property declspec", NULL);
2547 *prop = sym ? sym : sym_anonymous;
2548 } while (accept(','));
2549 rem_anchor_token(',');
2550 rem_anchor_token(')');
2552 attribute->a.property = property;
2558 static attribute_t *parse_microsoft_extended_decl_modifier_single(void)
2560 attribute_kind_t kind = ATTRIBUTE_UNKNOWN;
2561 if (accept(T_restrict)) {
2562 kind = ATTRIBUTE_MS_RESTRICT;
2563 } else if (token.kind == T_IDENTIFIER) {
2564 char const *const name = token.base.symbol->string;
2565 for (attribute_kind_t k = ATTRIBUTE_MS_FIRST; k <= ATTRIBUTE_MS_LAST;
2567 const char *attribute_name = get_attribute_name(k);
2568 if (attribute_name != NULL && streq(attribute_name, name)) {
2574 if (kind == ATTRIBUTE_UNKNOWN) {
2575 warningf(WARN_ATTRIBUTE, HERE, "unknown __declspec '%s' ignored", name);
2578 parse_error_expected("while parsing __declspec", T_IDENTIFIER, NULL);
2582 attribute_t *attribute = allocate_attribute_zero(kind);
2585 if (kind == ATTRIBUTE_MS_PROPERTY) {
2586 return parse_attribute_ms_property(attribute);
2589 /* parse arguments */
2591 attribute->a.arguments = parse_attribute_arguments();
2596 static attribute_t *parse_microsoft_extended_decl_modifier(attribute_t *first)
2600 add_anchor_token(')');
2602 if (token.kind != ')') {
2603 attribute_t **anchor = &first;
2605 while (*anchor != NULL)
2606 anchor = &(*anchor)->next;
2608 attribute_t *attribute
2609 = parse_microsoft_extended_decl_modifier_single();
2610 if (attribute == NULL)
2613 *anchor = attribute;
2614 anchor = &attribute->next;
2615 } while (accept(','));
2617 rem_anchor_token(')');
2622 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
2624 entity_t *const entity = allocate_entity_zero(kind, NAMESPACE_NORMAL, symbol, HERE);
2625 if (is_declaration(entity)) {
2626 entity->declaration.type = type_error_type;
2627 entity->declaration.implicit = true;
2628 } else if (kind == ENTITY_TYPEDEF) {
2629 entity->typedefe.type = type_error_type;
2630 entity->typedefe.builtin = true;
2632 if (kind != ENTITY_COMPOUND_MEMBER)
2633 record_entity(entity, false);
2637 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2639 type_t *type = NULL;
2640 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
2641 unsigned type_specifiers = 0;
2642 bool newtype = false;
2643 bool saw_error = false;
2645 memset(specifiers, 0, sizeof(*specifiers));
2646 specifiers->pos = *HERE;
2649 specifiers->attributes = parse_attributes(specifiers->attributes);
2651 switch (token.kind) {
2653 #define MATCH_STORAGE_CLASS(token, class) \
2655 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
2656 errorf(HERE, "multiple storage classes in declaration specifiers"); \
2658 specifiers->storage_class = class; \
2659 if (specifiers->thread_local) \
2660 goto check_thread_storage_class; \
2664 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
2665 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
2666 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
2667 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
2668 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
2671 specifiers->attributes
2672 = parse_microsoft_extended_decl_modifier(specifiers->attributes);
2675 case T__Thread_local:
2676 if (specifiers->thread_local) {
2677 errorf(HERE, "duplicate %K", &token);
2679 specifiers->thread_local = true;
2680 check_thread_storage_class:
2681 switch (specifiers->storage_class) {
2682 case STORAGE_CLASS_EXTERN:
2683 case STORAGE_CLASS_NONE:
2684 case STORAGE_CLASS_STATIC:
2688 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_storage_class;
2689 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_storage_class;
2690 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_storage_class;
2691 wrong_thread_storage_class:
2692 errorf(HERE, "%K used with '%s'", &token, wrong);
2699 /* type qualifiers */
2700 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
2702 qualifiers |= qualifier; \
2706 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
2707 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
2708 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
2709 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
2710 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
2711 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
2712 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
2713 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
2715 /* type specifiers */
2716 #define MATCH_SPECIFIER(token, specifier, name) \
2718 if (type_specifiers & specifier) { \
2719 errorf(HERE, "multiple " name " type specifiers given"); \
2721 type_specifiers |= specifier; \
2726 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
2727 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
2728 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
2729 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
2730 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
2731 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
2732 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
2733 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
2734 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
2735 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
2736 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
2737 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
2738 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
2739 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
2740 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
2741 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
2742 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
2743 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
2747 specifiers->is_inline = true;
2751 case T__forceinline:
2752 eat(T__forceinline);
2753 specifiers->modifiers |= DM_FORCEINLINE;
2758 if (type_specifiers & SPECIFIER_LONG_LONG) {
2759 errorf(HERE, "too many long type specifiers given");
2760 } else if (type_specifiers & SPECIFIER_LONG) {
2761 type_specifiers |= SPECIFIER_LONG_LONG;
2763 type_specifiers |= SPECIFIER_LONG;
2768 #define CHECK_DOUBLE_TYPE() \
2769 (type != NULL ? errorf(HERE, "multiple types in declaration specifiers") : (void)0)
2772 CHECK_DOUBLE_TYPE();
2773 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
2775 type->compound.compound = parse_compound_type_specifier(true);
2778 CHECK_DOUBLE_TYPE();
2779 type = allocate_type_zero(TYPE_COMPOUND_UNION);
2780 type->compound.compound = parse_compound_type_specifier(false);
2783 CHECK_DOUBLE_TYPE();
2784 type = parse_enum_specifier();
2787 CHECK_DOUBLE_TYPE();
2788 type = parse_typeof();
2790 case T___builtin_va_list:
2791 CHECK_DOUBLE_TYPE();
2792 type = duplicate_type(type_valist);
2793 eat(T___builtin_va_list);
2796 case T_IDENTIFIER: {
2797 /* only parse identifier if we haven't found a type yet */
2798 if (type != NULL || type_specifiers != 0) {
2799 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
2800 * declaration, so it doesn't generate errors about expecting '(' or
2802 switch (look_ahead(1)->kind) {
2809 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
2813 errorf(HERE, "discarding stray %K in declaration specifier", &token);
2818 goto finish_specifiers;
2822 type_t *const typedef_type = get_typedef_type(token.base.symbol);
2823 if (typedef_type == NULL) {
2824 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
2825 * declaration, so it doesn't generate 'implicit int' followed by more
2826 * errors later on. */
2827 token_kind_t const la1_type = (token_kind_t)look_ahead(1)->kind;
2833 errorf(HERE, "%K does not name a type", &token);
2835 entity_t *const entity = create_error_entity(token.base.symbol, ENTITY_TYPEDEF);
2837 type = allocate_type_zero(TYPE_TYPEDEF);
2838 type->typedeft.typedefe = &entity->typedefe;
2846 goto finish_specifiers;
2851 type = typedef_type;
2855 /* function specifier */
2857 goto finish_specifiers;
2862 specifiers->attributes = parse_attributes(specifiers->attributes);
2864 if (type == NULL || (saw_error && type_specifiers != 0)) {
2865 atomic_type_kind_t atomic_type;
2867 /* match valid basic types */
2868 switch (type_specifiers) {
2869 case SPECIFIER_VOID:
2870 atomic_type = ATOMIC_TYPE_VOID;
2872 case SPECIFIER_WCHAR_T:
2873 atomic_type = ATOMIC_TYPE_WCHAR_T;
2875 case SPECIFIER_CHAR:
2876 atomic_type = ATOMIC_TYPE_CHAR;
2878 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
2879 atomic_type = ATOMIC_TYPE_SCHAR;
2881 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
2882 atomic_type = ATOMIC_TYPE_UCHAR;
2884 case SPECIFIER_SHORT:
2885 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
2886 case SPECIFIER_SHORT | SPECIFIER_INT:
2887 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
2888 atomic_type = ATOMIC_TYPE_SHORT;
2890 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
2891 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
2892 atomic_type = ATOMIC_TYPE_USHORT;
2895 case SPECIFIER_SIGNED:
2896 case SPECIFIER_SIGNED | SPECIFIER_INT:
2897 atomic_type = ATOMIC_TYPE_INT;
2899 case SPECIFIER_UNSIGNED:
2900 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
2901 atomic_type = ATOMIC_TYPE_UINT;
2903 case SPECIFIER_LONG:
2904 case SPECIFIER_SIGNED | SPECIFIER_LONG:
2905 case SPECIFIER_LONG | SPECIFIER_INT:
2906 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
2907 atomic_type = ATOMIC_TYPE_LONG;
2909 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
2910 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
2911 atomic_type = ATOMIC_TYPE_ULONG;
2914 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2915 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2916 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
2917 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
2919 atomic_type = ATOMIC_TYPE_LONGLONG;
2920 goto warn_about_long_long;
2922 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2923 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
2925 atomic_type = ATOMIC_TYPE_ULONGLONG;
2926 warn_about_long_long:
2927 warningf(WARN_LONG_LONG, &specifiers->pos, "ISO C90 does not support 'long long'");
2930 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
2931 atomic_type = unsigned_int8_type_kind;
2934 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
2935 atomic_type = unsigned_int16_type_kind;
2938 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
2939 atomic_type = unsigned_int32_type_kind;
2942 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
2943 atomic_type = unsigned_int64_type_kind;
2946 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
2947 atomic_type = unsigned_int128_type_kind;
2950 case SPECIFIER_INT8:
2951 case SPECIFIER_SIGNED | SPECIFIER_INT8:
2952 atomic_type = int8_type_kind;
2955 case SPECIFIER_INT16:
2956 case SPECIFIER_SIGNED | SPECIFIER_INT16:
2957 atomic_type = int16_type_kind;
2960 case SPECIFIER_INT32:
2961 case SPECIFIER_SIGNED | SPECIFIER_INT32:
2962 atomic_type = int32_type_kind;
2965 case SPECIFIER_INT64:
2966 case SPECIFIER_SIGNED | SPECIFIER_INT64:
2967 atomic_type = int64_type_kind;
2970 case SPECIFIER_INT128:
2971 case SPECIFIER_SIGNED | SPECIFIER_INT128:
2972 atomic_type = int128_type_kind;
2975 case SPECIFIER_FLOAT:
2976 atomic_type = ATOMIC_TYPE_FLOAT;
2978 case SPECIFIER_DOUBLE:
2979 atomic_type = ATOMIC_TYPE_DOUBLE;
2981 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
2982 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
2984 case SPECIFIER_BOOL:
2985 atomic_type = ATOMIC_TYPE_BOOL;
2987 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
2988 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
2989 atomic_type = ATOMIC_TYPE_FLOAT;
2991 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
2992 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
2993 atomic_type = ATOMIC_TYPE_DOUBLE;
2995 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
2996 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
2997 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3000 /* invalid specifier combination, give an error message */
3001 position_t const* const pos = &specifiers->pos;
3002 if (type_specifiers == 0) {
3004 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
3005 if (!(c_mode & _CXX) && !strict_mode) {
3006 warningf(WARN_IMPLICIT_INT, pos, "no type specifiers in declaration, using 'int'");
3007 atomic_type = ATOMIC_TYPE_INT;
3010 errorf(pos, "no type specifiers given in declaration");
3013 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3014 (type_specifiers & SPECIFIER_UNSIGNED)) {
3015 errorf(pos, "signed and unsigned specifiers given");
3016 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3017 errorf(pos, "only integer types can be signed or unsigned");
3019 errorf(pos, "multiple datatypes in declaration");
3021 specifiers->type = type_error_type;
3026 if (type_specifiers & SPECIFIER_COMPLEX) {
3027 type = allocate_type_zero(TYPE_COMPLEX);
3028 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3029 type = allocate_type_zero(TYPE_IMAGINARY);
3031 type = allocate_type_zero(TYPE_ATOMIC);
3033 type->atomic.akind = atomic_type;
3035 } else if (type_specifiers != 0) {
3036 errorf(&specifiers->pos, "multiple datatypes in declaration");
3039 /* FIXME: check type qualifiers here */
3040 type->base.qualifiers = qualifiers;
3043 type = identify_new_type(type);
3045 type = typehash_insert(type);
3048 if (specifiers->attributes != NULL)
3049 type = handle_type_attributes(specifiers->attributes, type);
3050 specifiers->type = type;
3053 static type_qualifiers_t parse_type_qualifiers(void)
3055 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3058 switch (token.kind) {
3059 /* type qualifiers */
3060 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3061 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3062 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3063 /* microsoft extended type modifiers */
3064 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3065 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3066 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3067 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3068 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3077 * Parses an K&R identifier list
3079 static void parse_identifier_list(scope_t *scope)
3081 assert(token.kind == T_IDENTIFIER);
3083 entity_t *const entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, token.base.symbol, HERE);
3084 /* a K&R parameter has no type, yet */
3088 append_entity(scope, entity);
3089 } while (accept(',') && token.kind == T_IDENTIFIER);
3092 static entity_t *parse_parameter(void)
3094 declaration_specifiers_t specifiers;
3095 parse_declaration_specifiers(&specifiers);
3097 entity_t *entity = parse_declarator(&specifiers,
3098 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
3099 anonymous_entity = NULL;
3103 static void semantic_parameter_incomplete(const entity_t *entity)
3105 assert(entity->kind == ENTITY_PARAMETER);
3107 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
3108 * list in a function declarator that is part of a
3109 * definition of that function shall not have
3110 * incomplete type. */
3111 type_t *type = skip_typeref(entity->declaration.type);
3112 if (is_type_incomplete(type)) {
3113 errorf(&entity->base.pos, "'%N' has incomplete type", entity);
3117 static bool has_parameters(void)
3119 /* func(void) is not a parameter */
3120 if (look_ahead(1)->kind != ')')
3122 if (token.kind == T_IDENTIFIER) {
3123 entity_t const *const entity = get_entity(token.base.symbol, NAMESPACE_NORMAL);
3126 if (entity->kind != ENTITY_TYPEDEF)
3128 type_t const *const type = skip_typeref(entity->typedefe.type);
3129 if (!is_type_void(type))
3131 if (c_mode & _CXX) {
3132 /* ISO/IEC 14882:1998(E) §8.3.5:2 It must be literally (void). A typedef
3133 * is not allowed. */
3134 errorf(HERE, "empty parameter list defined with a typedef of 'void' not allowed in C++");
3135 } else if (type->base.qualifiers != TYPE_QUALIFIER_NONE) {
3136 /* §6.7.5.3:10 Qualification is not allowed here. */
3137 errorf(HERE, "'void' as parameter must not have type qualifiers");
3139 } else if (token.kind != T_void) {
3147 * Parses function type parameters (and optionally creates variable_t entities
3148 * for them in a scope)
3150 static void parse_parameters(function_type_t *type, scope_t *scope)
3152 add_anchor_token(')');
3155 if (token.kind == T_IDENTIFIER &&
3156 !is_typedef_symbol(token.base.symbol) &&
3157 (look_ahead(1)->kind == ',' || look_ahead(1)->kind == ')')) {
3158 type->kr_style_parameters = true;
3159 parse_identifier_list(scope);
3160 } else if (token.kind == ')') {
3161 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
3162 if (!(c_mode & _CXX))
3163 type->unspecified_parameters = true;
3164 } else if (has_parameters()) {
3165 function_parameter_t **anchor = &type->parameters;
3166 add_anchor_token(',');
3168 switch (token.kind) {
3171 type->variadic = true;
3172 goto parameters_finished;
3177 entity_t *entity = parse_parameter();
3178 if (entity->kind == ENTITY_TYPEDEF) {
3179 errorf(&entity->base.pos,
3180 "typedef not allowed as function parameter");
3183 assert(is_declaration(entity));
3185 semantic_parameter_incomplete(entity);
3187 function_parameter_t *const parameter =
3188 allocate_parameter(entity->declaration.type);
3190 if (scope != NULL) {
3191 append_entity(scope, entity);
3194 *anchor = parameter;
3195 anchor = ¶meter->next;
3200 goto parameters_finished;
3202 } while (accept(','));
3203 parameters_finished:
3204 rem_anchor_token(',');
3207 rem_anchor_token(')');
3211 typedef enum construct_type_kind_t {
3212 CONSTRUCT_POINTER = 1,
3213 CONSTRUCT_REFERENCE,
3216 } construct_type_kind_t;
3218 typedef union construct_type_t construct_type_t;
3220 typedef struct construct_type_base_t {
3221 construct_type_kind_t kind;
3223 construct_type_t *next;
3224 } construct_type_base_t;
3226 typedef struct parsed_pointer_t {
3227 construct_type_base_t base;
3228 type_qualifiers_t type_qualifiers;
3229 variable_t *base_variable; /**< MS __based extension. */
3232 typedef struct parsed_reference_t {
3233 construct_type_base_t base;
3234 } parsed_reference_t;
3236 typedef struct construct_function_type_t {
3237 construct_type_base_t base;
3238 type_t *function_type;
3239 } construct_function_type_t;
3241 typedef struct parsed_array_t {
3242 construct_type_base_t base;
3243 type_qualifiers_t type_qualifiers;
3249 union construct_type_t {
3250 construct_type_kind_t kind;
3251 construct_type_base_t base;
3252 parsed_pointer_t pointer;
3253 parsed_reference_t reference;
3254 construct_function_type_t function;
3255 parsed_array_t array;
3258 static construct_type_t *allocate_declarator_zero(construct_type_kind_t const kind, size_t const size)
3260 construct_type_t *const cons = obstack_alloc(&temp_obst, size);
3261 memset(cons, 0, size);
3263 cons->base.pos = *HERE;
3268 static construct_type_t *parse_pointer_declarator(void)
3270 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_POINTER, sizeof(parsed_pointer_t));
3272 cons->pointer.type_qualifiers = parse_type_qualifiers();
3273 //cons->pointer.base_variable = base_variable;
3278 /* ISO/IEC 14882:1998(E) §8.3.2 */
3279 static construct_type_t *parse_reference_declarator(void)
3281 if (!(c_mode & _CXX))
3282 errorf(HERE, "references are only available for C++");
3284 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_REFERENCE, sizeof(parsed_reference_t));
3291 static construct_type_t *parse_array_declarator(void)
3293 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_ARRAY, sizeof(parsed_array_t));
3294 parsed_array_t *const array = &cons->array;
3297 add_anchor_token(']');
3299 bool is_static = accept(T_static);
3301 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3304 is_static = accept(T_static);
3306 array->type_qualifiers = type_qualifiers;
3307 array->is_static = is_static;
3309 expression_t *size = NULL;
3310 if (token.kind == '*' && look_ahead(1)->kind == ']') {
3311 array->is_variable = true;
3313 } else if (token.kind != ']') {
3314 size = parse_assignment_expression();
3316 /* §6.7.5.2:1 Array size must have integer type */
3317 type_t *const orig_type = size->base.type;
3318 type_t *const type = skip_typeref(orig_type);
3319 if (!is_type_integer(type) && is_type_valid(type)) {
3320 errorf(&size->base.pos,
3321 "array size '%E' must have integer type but has type '%T'",
3326 mark_vars_read(size, NULL);
3329 if (is_static && size == NULL)
3330 errorf(&array->base.pos, "static array parameters require a size");
3332 rem_anchor_token(']');
3338 static construct_type_t *parse_function_declarator(scope_t *scope)
3340 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_FUNCTION, sizeof(construct_function_type_t));
3342 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3343 function_type_t *ftype = &type->function;
3345 ftype->linkage = current_linkage;
3346 ftype->calling_convention = CC_DEFAULT;
3348 parse_parameters(ftype, scope);
3350 cons->function.function_type = type;
3355 typedef struct parse_declarator_env_t {
3356 bool may_be_abstract : 1;
3357 bool must_be_abstract : 1;
3358 decl_modifiers_t modifiers;
3362 attribute_t *attributes;
3363 } parse_declarator_env_t;
3366 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env)
3368 /* construct a single linked list of construct_type_t's which describe
3369 * how to construct the final declarator type */
3370 construct_type_t *first = NULL;
3371 construct_type_t **anchor = &first;
3373 env->attributes = parse_attributes(env->attributes);
3376 construct_type_t *type;
3377 //variable_t *based = NULL; /* MS __based extension */
3378 switch (token.kind) {
3380 type = parse_reference_declarator();
3384 panic("based not supported anymore");
3389 type = parse_pointer_declarator();
3393 goto ptr_operator_end;
3397 anchor = &type->base.next;
3399 /* TODO: find out if this is correct */
3400 env->attributes = parse_attributes(env->attributes);
3404 construct_type_t *inner_types = NULL;
3406 switch (token.kind) {
3408 if (env->must_be_abstract) {
3409 errorf(HERE, "no identifier expected in typename");
3411 env->symbol = token.base.symbol;
3418 /* Parenthesized declarator or function declarator? */
3419 token_t const *const la1 = look_ahead(1);
3420 switch (la1->kind) {
3422 if (is_typedef_symbol(la1->base.symbol)) {
3424 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
3425 * interpreted as ``function with no parameter specification'', rather
3426 * than redundant parentheses around the omitted identifier. */
3428 /* Function declarator. */
3429 if (!env->may_be_abstract) {
3430 errorf(HERE, "function declarator must have a name");
3437 case T___attribute__: /* FIXME __attribute__ might also introduce a parameter of a function declarator. */
3438 /* Paranthesized declarator. */
3440 add_anchor_token(')');
3441 inner_types = parse_inner_declarator(env);
3442 if (inner_types != NULL) {
3443 /* All later declarators only modify the return type */
3444 env->must_be_abstract = true;
3446 rem_anchor_token(')');
3455 if (env->may_be_abstract)
3457 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3462 construct_type_t **const p = anchor;
3465 construct_type_t *type;
3466 switch (token.kind) {
3468 scope_t *scope = NULL;
3469 if (!env->must_be_abstract) {
3470 scope = &env->parameters;
3473 type = parse_function_declarator(scope);
3477 type = parse_array_declarator();
3480 goto declarator_finished;
3483 /* insert in the middle of the list (at p) */
3484 type->base.next = *p;
3487 anchor = &type->base.next;
3490 declarator_finished:
3491 /* append inner_types at the end of the list, we don't to set anchor anymore
3492 * as it's not needed anymore */
3493 *anchor = inner_types;
3498 static type_t *construct_declarator_type(construct_type_t *construct_list,
3501 construct_type_t *iter = construct_list;
3502 for (; iter != NULL; iter = iter->base.next) {
3503 position_t const* const pos = &iter->base.pos;
3504 switch (iter->kind) {
3505 case CONSTRUCT_FUNCTION: {
3506 construct_function_type_t *function = &iter->function;
3507 type_t *function_type = function->function_type;
3509 function_type->function.return_type = type;
3511 type_t *skipped_return_type = skip_typeref(type);
3513 if (is_type_function(skipped_return_type)) {
3514 errorf(pos, "function returning function is not allowed");
3515 } else if (is_type_array(skipped_return_type)) {
3516 errorf(pos, "function returning array is not allowed");
3518 if (skipped_return_type->base.qualifiers != 0) {
3519 warningf(WARN_IGNORED_QUALIFIERS, pos, "type qualifiers in return type of function type are meaningless");
3523 /* The function type was constructed earlier. Freeing it here will
3524 * destroy other types. */
3525 type = typehash_insert(function_type);
3529 case CONSTRUCT_POINTER: {
3530 if (is_type_reference(skip_typeref(type)))
3531 errorf(pos, "cannot declare a pointer to reference");
3533 parsed_pointer_t *pointer = &iter->pointer;
3534 type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
3538 case CONSTRUCT_REFERENCE:
3539 if (is_type_reference(skip_typeref(type)))
3540 errorf(pos, "cannot declare a reference to reference");
3542 type = make_reference_type(type);
3545 case CONSTRUCT_ARRAY: {
3546 if (is_type_reference(skip_typeref(type)))
3547 errorf(pos, "cannot declare an array of references");
3549 parsed_array_t *array = &iter->array;
3550 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
3552 expression_t *size_expression = array->size;
3553 if (size_expression != NULL) {
3555 = create_implicit_cast(size_expression, type_size_t);
3558 array_type->base.qualifiers = array->type_qualifiers;
3559 array_type->array.element_type = type;
3560 array_type->array.is_static = array->is_static;
3561 array_type->array.is_variable = array->is_variable;
3562 array_type->array.size_expression = size_expression;
3564 if (size_expression != NULL) {
3565 switch (is_constant_expression(size_expression)) {
3566 case EXPR_CLASS_CONSTANT: {
3567 long const size = fold_constant_to_int(size_expression);
3568 array_type->array.size = size;
3569 array_type->array.size_constant = true;
3570 /* §6.7.5.2:1 If the expression is a constant expression,
3571 * it shall have a value greater than zero. */
3573 errorf(&size_expression->base.pos,
3574 "size of array must be greater than zero");
3575 } else if (size == 0 && !GNU_MODE) {
3576 errorf(&size_expression->base.pos,
3577 "size of array must be greater than zero (zero length arrays are a GCC extension)");
3582 case EXPR_CLASS_VARIABLE:
3583 array_type->array.is_vla = true;
3586 case EXPR_CLASS_ERROR:
3591 type_t *skipped_type = skip_typeref(type);
3593 if (is_type_incomplete(skipped_type)) {
3594 errorf(pos, "array of incomplete type '%T' is not allowed", type);
3595 } else if (is_type_function(skipped_type)) {
3596 errorf(pos, "array of functions is not allowed");
3598 type = identify_new_type(array_type);
3602 internal_errorf(pos, "invalid type construction found");
3608 static type_t *automatic_type_conversion(type_t *orig_type);
3610 static type_t *semantic_parameter(const position_t *pos, type_t *type,
3611 const declaration_specifiers_t *specifiers,
3612 entity_t const *const param)
3614 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
3615 * shall be adjusted to ``qualified pointer to type'',
3617 * §6.7.5.3:8 A declaration of a parameter as ``function returning
3618 * type'' shall be adjusted to ``pointer to function
3619 * returning type'', as in 6.3.2.1. */
3620 type = automatic_type_conversion(type);
3622 if (specifiers->is_inline && is_type_valid(type)) {
3623 errorf(pos, "'%N' declared 'inline'", param);
3626 /* §6.9.1:6 The declarations in the declaration list shall contain
3627 * no storage-class specifier other than register and no
3628 * initializations. */
3629 if (specifiers->thread_local || (
3630 specifiers->storage_class != STORAGE_CLASS_NONE &&
3631 specifiers->storage_class != STORAGE_CLASS_REGISTER)
3633 errorf(pos, "invalid storage class for '%N'", param);
3636 /* delay test for incomplete type, because we might have (void)
3637 * which is legal but incomplete... */
3642 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
3643 declarator_flags_t flags)
3645 parse_declarator_env_t env;
3646 memset(&env, 0, sizeof(env));
3647 env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
3649 construct_type_t *construct_type = parse_inner_declarator(&env);
3651 construct_declarator_type(construct_type, specifiers->type);
3652 type_t *type = skip_typeref(orig_type);
3654 if (construct_type != NULL) {
3655 obstack_free(&temp_obst, construct_type);
3658 attribute_t *attributes = parse_attributes(env.attributes);
3659 /* append (shared) specifier attribute behind attributes of this
3661 attribute_t **anchor = &attributes;
3662 while (*anchor != NULL)
3663 anchor = &(*anchor)->next;
3664 *anchor = specifiers->attributes;
3667 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
3668 entity = allocate_entity_zero(ENTITY_TYPEDEF, NAMESPACE_NORMAL, env.symbol, &env.pos);
3669 entity->typedefe.type = orig_type;
3671 if (anonymous_entity != NULL) {
3672 if (is_type_compound(type)) {
3673 assert(anonymous_entity->compound.alias == NULL);
3674 assert(anonymous_entity->kind == ENTITY_STRUCT ||
3675 anonymous_entity->kind == ENTITY_UNION);
3676 anonymous_entity->compound.alias = entity;
3677 anonymous_entity = NULL;
3678 } else if (is_type_enum(type)) {
3679 assert(anonymous_entity->enume.alias == NULL);
3680 assert(anonymous_entity->kind == ENTITY_ENUM);
3681 anonymous_entity->enume.alias = entity;
3682 anonymous_entity = NULL;
3686 /* create a declaration type entity */
3687 position_t const *const pos = env.symbol ? &env.pos : &specifiers->pos;
3688 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
3689 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, env.symbol, pos);
3691 if (env.symbol != NULL) {
3692 if (specifiers->is_inline && is_type_valid(type)) {
3693 errorf(&env.pos, "'%N' declared 'inline'", entity);
3696 if (specifiers->thread_local ||
3697 specifiers->storage_class != STORAGE_CLASS_NONE) {
3698 errorf(&env.pos, "'%N' must have no storage class", entity);
3701 } else if (flags & DECL_IS_PARAMETER) {
3702 entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, env.symbol, pos);
3703 orig_type = semantic_parameter(&env.pos, orig_type, specifiers, entity);
3704 } else if (is_type_function(type)) {
3705 entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, env.symbol, pos);
3706 entity->function.is_inline = specifiers->is_inline;
3707 entity->function.elf_visibility = default_visibility;
3708 entity->function.parameters = env.parameters;
3710 if (env.symbol != NULL) {
3711 /* this needs fixes for C++ */
3712 bool in_function_scope = current_function != NULL;
3714 if (specifiers->thread_local || (
3715 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3716 specifiers->storage_class != STORAGE_CLASS_NONE &&
3717 (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
3719 errorf(&env.pos, "invalid storage class for '%N'", entity);
3723 entity = allocate_entity_zero(ENTITY_VARIABLE, NAMESPACE_NORMAL, env.symbol, pos);
3724 entity->variable.elf_visibility = default_visibility;
3725 entity->variable.thread_local = specifiers->thread_local;
3727 if (env.symbol != NULL) {
3728 if (specifiers->is_inline && is_type_valid(type)) {
3729 errorf(&env.pos, "'%N' declared 'inline'", entity);
3732 bool invalid_storage_class = false;
3733 if (current_scope == file_scope) {
3734 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3735 specifiers->storage_class != STORAGE_CLASS_NONE &&
3736 specifiers->storage_class != STORAGE_CLASS_STATIC) {
3737 invalid_storage_class = true;
3740 if (specifiers->thread_local &&
3741 specifiers->storage_class == STORAGE_CLASS_NONE) {
3742 invalid_storage_class = true;
3745 if (invalid_storage_class) {
3746 errorf(&env.pos, "invalid storage class for '%N'", entity);
3751 entity->declaration.type = orig_type;
3752 entity->declaration.alignment = get_type_alignment(orig_type);
3753 entity->declaration.modifiers = env.modifiers;
3754 entity->declaration.attributes = attributes;
3756 storage_class_t storage_class = specifiers->storage_class;
3757 entity->declaration.declared_storage_class = storage_class;
3759 if (storage_class == STORAGE_CLASS_NONE && current_function != NULL)
3760 storage_class = STORAGE_CLASS_AUTO;
3761 entity->declaration.storage_class = storage_class;
3764 if (attributes != NULL) {
3765 handle_entity_attributes(attributes, entity);
3768 if (entity->kind == ENTITY_FUNCTION && !freestanding) {
3769 adapt_special_functions(&entity->function);
3775 static type_t *parse_abstract_declarator(type_t *base_type)
3777 parse_declarator_env_t env;
3778 memset(&env, 0, sizeof(env));
3779 env.may_be_abstract = true;
3780 env.must_be_abstract = true;
3782 construct_type_t *construct_type = parse_inner_declarator(&env);
3784 type_t *result = construct_declarator_type(construct_type, base_type);
3785 if (construct_type != NULL) {
3786 obstack_free(&temp_obst, construct_type);
3788 result = handle_type_attributes(env.attributes, result);
3794 * Check if the declaration of main is suspicious. main should be a
3795 * function with external linkage, returning int, taking either zero
3796 * arguments, two, or three arguments of appropriate types, ie.
3798 * int main([ int argc, char **argv [, char **env ] ]).
3800 * @param decl the declaration to check
3801 * @param type the function type of the declaration
3803 static void check_main(const entity_t *entity)
3805 const position_t *pos = &entity->base.pos;
3806 if (entity->kind != ENTITY_FUNCTION) {
3807 warningf(WARN_MAIN, pos, "'main' is not a function");
3811 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
3812 warningf(WARN_MAIN, pos, "'main' is normally a non-static function");
3815 type_t *type = skip_typeref(entity->declaration.type);
3816 assert(is_type_function(type));
3818 function_type_t const *const func_type = &type->function;
3819 type_t *const ret_type = func_type->return_type;
3820 if (!types_compatible(skip_typeref(ret_type), type_int)) {
3821 warningf(WARN_MAIN, pos, "return type of 'main' should be 'int', but is '%T'", ret_type);
3823 const function_parameter_t *parm = func_type->parameters;
3825 type_t *const first_type = skip_typeref(parm->type);
3826 type_t *const first_type_unqual = get_unqualified_type(first_type);
3827 if (!types_compatible(first_type_unqual, type_int)) {
3828 warningf(WARN_MAIN, pos, "first argument of 'main' should be 'int', but is '%T'", parm->type);
3832 type_t *const second_type = skip_typeref(parm->type);
3833 type_t *const second_type_unqual
3834 = get_unqualified_type(second_type);
3835 if (!types_compatible(second_type_unqual, type_char_ptr_ptr)) {
3836 warningf(WARN_MAIN, pos, "second argument of 'main' should be 'char**', but is '%T'", parm->type);
3840 type_t *const third_type = skip_typeref(parm->type);
3841 type_t *const third_type_unqual
3842 = get_unqualified_type(third_type);
3843 if (!types_compatible(third_type_unqual, type_char_ptr_ptr)) {
3844 warningf(WARN_MAIN, pos, "third argument of 'main' should be 'char**', but is '%T'", parm->type);
3848 goto warn_arg_count;
3852 warningf(WARN_MAIN, pos, "'main' takes only zero, two or three arguments");
3857 static void error_redefined_as_different_kind(const position_t *pos,
3858 const entity_t *old, entity_kind_t new_kind)
3860 char const *const what = get_entity_kind_name(new_kind);
3861 position_t const *const ppos = &old->base.pos;
3862 errorf(pos, "redeclaration of '%N' as %s (declared %P)", old, what, ppos);
3865 static bool is_entity_valid(entity_t *const ent)
3867 if (is_declaration(ent)) {
3868 return is_type_valid(skip_typeref(ent->declaration.type));
3869 } else if (ent->kind == ENTITY_TYPEDEF) {
3870 return is_type_valid(skip_typeref(ent->typedefe.type));
3875 static bool contains_attribute(const attribute_t *list, const attribute_t *attr)
3877 for (const attribute_t *tattr = list; tattr != NULL; tattr = tattr->next) {
3878 if (attributes_equal(tattr, attr))
3885 * Tests whether new_list contains any attributes not included in old_list
3887 static bool has_new_attributes(const attribute_t *old_list,
3888 const attribute_t *new_list)
3890 for (const attribute_t *attr = new_list; attr != NULL; attr = attr->next) {
3891 if (!contains_attribute(old_list, attr))
3898 * Merge in attributes from an attribute list (probably from a previous
3899 * declaration with the same name). Warning: destroys the old structure
3900 * of the attribute list - don't reuse attributes after this call.
3902 static void merge_in_attributes(declaration_t *decl, attribute_t *attributes)
3905 for (attribute_t *attr = attributes; attr != NULL; attr = next) {
3907 if (contains_attribute(decl->attributes, attr))
3910 /* move attribute to new declarations attributes list */
3911 attr->next = decl->attributes;
3912 decl->attributes = attr;
3916 static bool is_main(entity_t*);
3919 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
3920 * for various problems that occur for multiple definitions
3922 entity_t *record_entity(entity_t *entity, const bool is_definition)
3924 const symbol_t *const symbol = entity->base.symbol;
3925 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
3926 const position_t *pos = &entity->base.pos;
3928 /* can happen in error cases */
3932 assert(!entity->base.parent_scope);
3933 assert(current_scope);
3934 entity->base.parent_scope = current_scope;
3936 entity_t *const previous_entity = get_entity(symbol, namespc);
3937 /* pushing the same entity twice will break the stack structure */
3938 assert(previous_entity != entity);
3940 if (entity->kind == ENTITY_FUNCTION) {
3941 type_t *const orig_type = entity->declaration.type;
3942 type_t *const type = skip_typeref(orig_type);
3944 assert(is_type_function(type));
3945 if (type->function.unspecified_parameters &&
3946 previous_entity == NULL &&
3947 !entity->declaration.implicit) {
3948 warningf(WARN_STRICT_PROTOTYPES, pos, "function declaration '%#N' is not a prototype", entity);
3951 if (is_main(entity)) {
3956 if (is_declaration(entity) &&
3957 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
3958 current_scope != file_scope &&
3959 !entity->declaration.implicit) {
3960 warningf(WARN_NESTED_EXTERNS, pos, "nested extern declaration of '%#N'", entity);
3963 if (previous_entity != NULL) {
3964 position_t const *const ppos = &previous_entity->base.pos;
3966 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
3967 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
3968 assert(previous_entity->kind == ENTITY_PARAMETER);
3969 errorf(pos, "declaration of '%N' redeclares the '%N' (declared %P)", entity, previous_entity, ppos);
3973 if (previous_entity->base.parent_scope == current_scope) {
3974 if (previous_entity->kind != entity->kind) {
3975 if (is_entity_valid(previous_entity) && is_entity_valid(entity)) {
3976 error_redefined_as_different_kind(pos, previous_entity,
3981 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
3982 errorf(pos, "redeclaration of '%N' (declared %P)", entity, ppos);
3985 if (previous_entity->kind == ENTITY_TYPEDEF) {
3986 type_t *const type = skip_typeref(entity->typedefe.type);
3987 type_t *const prev_type
3988 = skip_typeref(previous_entity->typedefe.type);
3989 if (c_mode & _CXX) {
3990 /* C++ allows double typedef if they are identical
3991 * (after skipping typedefs) */
3992 if (type == prev_type)
3995 /* GCC extension: redef in system headers is allowed */
3996 if ((pos->is_system_header || ppos->is_system_header) &&
3997 types_compatible(type, prev_type))
4000 errorf(pos, "redefinition of '%N' (declared %P)",
4005 /* at this point we should have only VARIABLES or FUNCTIONS */
4006 assert(is_declaration(previous_entity) && is_declaration(entity));
4008 declaration_t *const prev_decl = &previous_entity->declaration;
4009 declaration_t *const decl = &entity->declaration;
4011 /* can happen for K&R style declarations */
4012 if (prev_decl->type == NULL &&
4013 previous_entity->kind == ENTITY_PARAMETER &&
4014 entity->kind == ENTITY_PARAMETER) {
4015 prev_decl->type = decl->type;
4016 prev_decl->storage_class = decl->storage_class;
4017 prev_decl->declared_storage_class = decl->declared_storage_class;
4018 prev_decl->modifiers = decl->modifiers;
4019 return previous_entity;
4022 type_t *const type = skip_typeref(decl->type);
4023 type_t *const prev_type = skip_typeref(prev_decl->type);
4025 if (!types_compatible(type, prev_type)) {
4026 errorf(pos, "declaration '%#N' is incompatible with '%#N' (declared %P)", entity, previous_entity, ppos);
4028 unsigned old_storage_class = prev_decl->storage_class;
4030 if (is_definition &&
4032 !(prev_decl->modifiers & DM_USED) &&
4033 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4034 warningf(WARN_REDUNDANT_DECLS, ppos, "unnecessary static forward declaration for '%#N'", previous_entity);
4037 storage_class_t new_storage_class = decl->storage_class;
4039 /* pretend no storage class means extern for function
4040 * declarations (except if the previous declaration is neither
4041 * none nor extern) */
4042 if (entity->kind == ENTITY_FUNCTION) {
4043 /* the previous declaration could have unspecified parameters or
4044 * be a typedef, so use the new type */
4045 if (prev_type->function.unspecified_parameters || is_definition)
4046 prev_decl->type = type;
4048 switch (old_storage_class) {
4049 case STORAGE_CLASS_NONE:
4050 old_storage_class = STORAGE_CLASS_EXTERN;
4053 case STORAGE_CLASS_EXTERN:
4054 if (is_definition) {
4055 if (prev_type->function.unspecified_parameters && !is_main(entity)) {
4056 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4058 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4059 new_storage_class = STORAGE_CLASS_EXTERN;
4066 } else if (is_type_incomplete(prev_type)) {
4067 prev_decl->type = type;
4070 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4071 new_storage_class == STORAGE_CLASS_EXTERN) {
4073 warn_redundant_declaration: ;
4075 = has_new_attributes(prev_decl->attributes,
4077 if (has_new_attrs) {
4078 merge_in_attributes(decl, prev_decl->attributes);
4079 } else if (!is_definition &&
4080 is_type_valid(prev_type) &&
4081 !pos->is_system_header) {
4082 warningf(WARN_REDUNDANT_DECLS, pos, "redundant declaration for '%N' (declared %P)", entity, ppos);
4084 } else if (current_function == NULL) {
4085 if (old_storage_class != STORAGE_CLASS_STATIC &&
4086 new_storage_class == STORAGE_CLASS_STATIC) {
4087 errorf(pos, "static declaration of '%N' follows non-static declaration (declared %P)", entity, ppos);
4088 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4089 prev_decl->storage_class = STORAGE_CLASS_NONE;
4090 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4092 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4094 goto error_redeclaration;
4095 goto warn_redundant_declaration;
4097 } else if (is_type_valid(prev_type)) {
4098 if (old_storage_class == new_storage_class) {
4099 error_redeclaration:
4100 errorf(pos, "redeclaration of '%N' (declared %P)", entity, ppos);
4102 errorf(pos, "redeclaration of '%N' with different linkage (declared %P)", entity, ppos);
4107 prev_decl->modifiers |= decl->modifiers;
4108 if (entity->kind == ENTITY_FUNCTION) {
4109 previous_entity->function.is_inline |= entity->function.is_inline;
4111 return previous_entity;
4115 if (is_warn_on(why = WARN_SHADOW) ||
4116 (is_warn_on(why = WARN_SHADOW_LOCAL) && previous_entity->base.parent_scope != file_scope)) {
4117 char const *const what = get_entity_kind_name(previous_entity->kind);
4118 warningf(why, pos, "'%N' shadows %s (declared %P)", entity, what, ppos);
4122 if (entity->kind == ENTITY_FUNCTION) {
4123 if (is_definition &&
4124 entity->declaration.storage_class != STORAGE_CLASS_STATIC &&
4126 if (is_warn_on(WARN_MISSING_PROTOTYPES)) {
4127 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4129 goto warn_missing_declaration;
4132 } else if (entity->kind == ENTITY_VARIABLE) {
4133 if (current_scope == file_scope &&
4134 entity->declaration.storage_class == STORAGE_CLASS_NONE &&
4135 !entity->declaration.implicit) {
4136 warn_missing_declaration:
4137 warningf(WARN_MISSING_DECLARATIONS, pos, "no previous declaration for '%#N'", entity);
4142 environment_push(entity);
4143 append_entity(current_scope, entity);
4148 static void parser_error_multiple_definition(entity_t *entity,
4149 const position_t *pos)
4151 errorf(pos, "redefinition of '%N' (declared %P)", entity, &entity->base.pos);
4154 static bool is_declaration_specifier(const token_t *token)
4156 switch (token->kind) {
4160 return is_typedef_symbol(token->base.symbol);
4167 static void parse_init_declarator_rest(entity_t *entity)
4169 type_t *orig_type = type_error_type;
4171 if (entity->base.kind == ENTITY_TYPEDEF) {
4172 position_t const *const pos = &entity->base.pos;
4173 errorf(pos, "'%N' is initialized (use __typeof__ instead)", entity);
4175 assert(is_declaration(entity));
4176 orig_type = entity->declaration.type;
4179 type_t *type = skip_typeref(orig_type);
4181 if (entity->kind == ENTITY_VARIABLE
4182 && entity->variable.initializer != NULL) {
4183 parser_error_multiple_definition(entity, HERE);
4187 declaration_t *const declaration = &entity->declaration;
4188 bool must_be_constant = false;
4189 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4190 entity->base.parent_scope == file_scope) {
4191 must_be_constant = true;
4194 if (is_type_function(type)) {
4195 position_t const *const pos = &entity->base.pos;
4196 errorf(pos, "'%N' is initialized like a variable", entity);
4197 orig_type = type_error_type;
4200 parse_initializer_env_t env;
4201 env.type = orig_type;
4202 env.must_be_constant = must_be_constant;
4203 env.entity = entity;
4205 initializer_t *initializer = parse_initializer(&env);
4207 if (entity->kind == ENTITY_VARIABLE) {
4208 /* §6.7.5:22 array initializers for arrays with unknown size
4209 * determine the array type size */
4210 declaration->type = env.type;
4211 entity->variable.initializer = initializer;
4215 /* parse rest of a declaration without any declarator */
4216 static void parse_anonymous_declaration_rest(
4217 const declaration_specifiers_t *specifiers)
4220 anonymous_entity = NULL;
4222 position_t const *const pos = &specifiers->pos;
4223 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4224 specifiers->thread_local) {
4225 warningf(WARN_OTHER, pos, "useless storage class in empty declaration");
4228 type_t *type = specifiers->type;
4229 switch (type->kind) {
4230 case TYPE_COMPOUND_STRUCT:
4231 case TYPE_COMPOUND_UNION: {
4232 if (type->compound.compound->base.symbol == NULL) {
4233 warningf(WARN_OTHER, pos, "unnamed struct/union that defines no instances");
4242 warningf(WARN_OTHER, pos, "empty declaration");
4247 static void check_variable_type_complete(entity_t *ent)
4249 if (ent->kind != ENTITY_VARIABLE)
4252 /* §6.7:7 If an identifier for an object is declared with no linkage, the
4253 * type for the object shall be complete [...] */
4254 declaration_t *decl = &ent->declaration;
4255 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4256 decl->storage_class == STORAGE_CLASS_STATIC)
4259 type_t *const type = skip_typeref(decl->type);
4260 if (!is_type_incomplete(type))
4263 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4264 * are given length one. */
4265 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4266 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4270 errorf(&ent->base.pos, "variable '%#N' has incomplete type", ent);
4274 static void parse_declaration_rest(entity_t *ndeclaration,
4275 const declaration_specifiers_t *specifiers,
4276 parsed_declaration_func finished_declaration,
4277 declarator_flags_t flags)
4279 add_anchor_token(';');
4280 add_anchor_token(',');
4282 entity_t *entity = finished_declaration(ndeclaration, token.kind == '=');
4284 if (token.kind == '=') {
4285 parse_init_declarator_rest(entity);
4286 } else if (entity->kind == ENTITY_VARIABLE) {
4287 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
4288 * [...] where the extern specifier is explicitly used. */
4289 declaration_t *decl = &entity->declaration;
4290 if (decl->storage_class != STORAGE_CLASS_EXTERN &&
4291 is_type_reference(skip_typeref(decl->type))) {
4292 position_t const *const pos = &entity->base.pos;
4293 errorf(pos, "reference '%#N' must be initialized", entity);
4297 check_variable_type_complete(entity);
4302 add_anchor_token('=');
4303 ndeclaration = parse_declarator(specifiers, flags);
4304 rem_anchor_token('=');
4306 rem_anchor_token(',');
4307 rem_anchor_token(';');
4310 anonymous_entity = NULL;
4313 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4315 symbol_t *symbol = entity->base.symbol;
4319 assert(entity->base.namespc == NAMESPACE_NORMAL);
4320 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4321 if (previous_entity == NULL
4322 || previous_entity->base.parent_scope != current_scope) {
4323 errorf(&entity->base.pos, "expected declaration of a function parameter, found '%Y'",
4328 if (is_definition) {
4329 errorf(HERE, "'%N' is initialised", entity);
4332 return record_entity(entity, false);
4335 static void parse_declaration(parsed_declaration_func finished_declaration,
4336 declarator_flags_t flags)
4338 add_anchor_token(';');
4339 declaration_specifiers_t specifiers;
4340 parse_declaration_specifiers(&specifiers);
4341 rem_anchor_token(';');
4343 if (token.kind == ';') {
4344 parse_anonymous_declaration_rest(&specifiers);
4346 entity_t *entity = parse_declarator(&specifiers, flags);
4347 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4352 static type_t *get_default_promoted_type(type_t *orig_type)
4354 type_t *result = orig_type;
4356 type_t *type = skip_typeref(orig_type);
4357 if (is_type_integer(type)) {
4358 result = promote_integer(type);
4359 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4360 result = type_double;
4366 static void parse_kr_declaration_list(entity_t *entity)
4368 if (entity->kind != ENTITY_FUNCTION)
4371 type_t *type = skip_typeref(entity->declaration.type);
4372 assert(is_type_function(type));
4373 if (!type->function.kr_style_parameters)
4376 add_anchor_token('{');
4378 PUSH_SCOPE(&entity->function.parameters);
4380 entity_t *parameter = entity->function.parameters.entities;
4381 for ( ; parameter != NULL; parameter = parameter->base.next) {
4382 assert(parameter->base.parent_scope == NULL);
4383 parameter->base.parent_scope = current_scope;
4384 environment_push(parameter);
4387 /* parse declaration list */
4389 switch (token.kind) {
4391 /* This covers symbols, which are no type, too, and results in
4392 * better error messages. The typical cases are misspelled type
4393 * names and missing includes. */
4395 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4405 /* update function type */
4406 type_t *new_type = duplicate_type(type);
4408 function_parameter_t *parameters = NULL;
4409 function_parameter_t **anchor = ¶meters;
4411 /* did we have an earlier prototype? */
4412 entity_t *proto_type = get_entity(entity->base.symbol, NAMESPACE_NORMAL);
4413 if (proto_type != NULL && proto_type->kind != ENTITY_FUNCTION)
4416 function_parameter_t *proto_parameter = NULL;
4417 if (proto_type != NULL) {
4418 type_t *proto_type_type = proto_type->declaration.type;
4419 proto_parameter = proto_type_type->function.parameters;
4420 /* If a K&R function definition has a variadic prototype earlier, then
4421 * make the function definition variadic, too. This should conform to
4422 * §6.7.5.3:15 and §6.9.1:8. */
4423 new_type->function.variadic = proto_type_type->function.variadic;
4425 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
4427 new_type->function.unspecified_parameters = true;
4430 bool need_incompatible_warning = false;
4431 parameter = entity->function.parameters.entities;
4432 for (; parameter != NULL; parameter = parameter->base.next,
4434 proto_parameter == NULL ? NULL : proto_parameter->next) {
4435 if (parameter->kind != ENTITY_PARAMETER)
4438 type_t *parameter_type = parameter->declaration.type;
4439 if (parameter_type == NULL) {
4440 position_t const* const pos = ¶meter->base.pos;
4442 errorf(pos, "no type specified for function '%N'", parameter);
4443 parameter_type = type_error_type;
4445 warningf(WARN_IMPLICIT_INT, pos, "no type specified for function parameter '%N', using 'int'", parameter);
4446 parameter_type = type_int;
4448 parameter->declaration.type = parameter_type;
4451 semantic_parameter_incomplete(parameter);
4453 /* we need the default promoted types for the function type */
4454 type_t *not_promoted = parameter_type;
4455 parameter_type = get_default_promoted_type(parameter_type);
4457 /* gcc special: if the type of the prototype matches the unpromoted
4458 * type don't promote */
4459 if (!strict_mode && proto_parameter != NULL) {
4460 type_t *proto_p_type = skip_typeref(proto_parameter->type);
4461 type_t *promo_skip = skip_typeref(parameter_type);
4462 type_t *param_skip = skip_typeref(not_promoted);
4463 if (!types_compatible(proto_p_type, promo_skip)
4464 && types_compatible(proto_p_type, param_skip)) {
4466 need_incompatible_warning = true;
4467 parameter_type = not_promoted;
4470 function_parameter_t *const function_parameter
4471 = allocate_parameter(parameter_type);
4473 *anchor = function_parameter;
4474 anchor = &function_parameter->next;
4477 new_type->function.parameters = parameters;
4478 new_type = identify_new_type(new_type);
4480 if (need_incompatible_warning) {
4481 symbol_t const *const sym = entity->base.symbol;
4482 position_t const *const pos = &entity->base.pos;
4483 position_t const *const ppos = &proto_type->base.pos;
4484 warningf(WARN_OTHER, pos, "declaration '%#N' is incompatible with '%#T' (declared %P)", proto_type, new_type, sym, ppos);
4486 entity->declaration.type = new_type;
4488 rem_anchor_token('{');
4491 static bool first_err = true;
4494 * When called with first_err set, prints the name of the current function,
4497 static void print_in_function(void)
4501 char const *const file = current_function->base.base.pos.input_name;
4502 diagnosticf("%s: In '%N':\n", file, (entity_t const*)current_function);
4507 * Check if all labels are defined in the current function.
4508 * Check if all labels are used in the current function.
4510 static void check_labels(void)
4512 for (const goto_statement_t *goto_statement = goto_first;
4513 goto_statement != NULL;
4514 goto_statement = goto_statement->next) {
4515 label_t *label = goto_statement->label;
4516 if (label->base.pos.input_name == NULL) {
4517 print_in_function();
4518 position_t const *const pos = &goto_statement->base.pos;
4519 errorf(pos, "'%N' used but not defined", (entity_t const*)label);
4523 if (is_warn_on(WARN_UNUSED_LABEL)) {
4524 for (const label_statement_t *label_statement = label_first;
4525 label_statement != NULL;
4526 label_statement = label_statement->next) {
4527 label_t *label = label_statement->label;
4529 if (! label->used) {
4530 print_in_function();
4531 position_t const *const pos = &label_statement->base.pos;
4532 warningf(WARN_UNUSED_LABEL, pos, "'%N' defined but not used", (entity_t const*)label);
4538 static void warn_unused_entity(warning_t const why, entity_t *entity, entity_t *const last)
4540 entity_t const *const end = last != NULL ? last->base.next : NULL;
4541 for (; entity != end; entity = entity->base.next) {
4542 if (!is_declaration(entity))
4545 declaration_t *declaration = &entity->declaration;
4546 if (declaration->implicit)
4549 if (!declaration->used) {
4550 print_in_function();
4551 warningf(why, &entity->base.pos, "'%N' is unused", entity);
4552 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
4553 print_in_function();
4554 warningf(why, &entity->base.pos, "'%N' is never read", entity);
4559 static void check_unused_variables(statement_t *const stmt, void *const env)
4563 switch (stmt->kind) {
4564 case STATEMENT_DECLARATION: {
4565 declaration_statement_t const *const decls = &stmt->declaration;
4566 warn_unused_entity(WARN_UNUSED_VARIABLE, decls->declarations_begin, decls->declarations_end);
4571 warn_unused_entity(WARN_UNUSED_VARIABLE, stmt->fors.scope.entities, NULL);
4580 * Check declarations of current_function for unused entities.
4582 static void check_declarations(void)
4584 if (is_warn_on(WARN_UNUSED_PARAMETER)) {
4585 const scope_t *scope = ¤t_function->parameters;
4586 warn_unused_entity(WARN_UNUSED_PARAMETER, scope->entities, NULL);
4588 if (is_warn_on(WARN_UNUSED_VARIABLE)) {
4589 walk_statements(current_function->body, check_unused_variables, NULL);
4593 static int determine_truth(expression_t const* const cond)
4596 is_constant_expression(cond) != EXPR_CLASS_CONSTANT ? 0 :
4597 fold_constant_to_bool(cond) ? 1 :
4601 static void check_reachable(statement_t *);
4602 static bool reaches_end;
4604 static bool expression_returns(expression_t const *const expr)
4606 switch (expr->kind) {
4608 expression_t const *const func = expr->call.function;
4609 type_t const *const type = skip_typeref(func->base.type);
4610 if (type->kind == TYPE_POINTER) {
4611 type_t const *const points_to
4612 = skip_typeref(type->pointer.points_to);
4613 if (points_to->kind == TYPE_FUNCTION
4614 && points_to->function.modifiers & DM_NORETURN)
4618 if (!expression_returns(func))
4621 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
4622 if (!expression_returns(arg->expression))
4629 case EXPR_REFERENCE:
4630 case EXPR_ENUM_CONSTANT:
4631 case EXPR_LITERAL_CASES:
4632 case EXPR_LITERAL_CHARACTER:
4633 case EXPR_STRING_LITERAL:
4634 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
4635 case EXPR_LABEL_ADDRESS:
4636 case EXPR_CLASSIFY_TYPE:
4637 case EXPR_SIZEOF: // TODO handle obscure VLA case
4640 case EXPR_BUILTIN_CONSTANT_P:
4641 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
4646 case EXPR_STATEMENT: {
4647 bool old_reaches_end = reaches_end;
4648 reaches_end = false;
4649 check_reachable(expr->statement.statement);
4650 bool returns = reaches_end;
4651 reaches_end = old_reaches_end;
4655 case EXPR_CONDITIONAL:
4656 // TODO handle constant expression
4658 if (!expression_returns(expr->conditional.condition))
4661 if (expr->conditional.true_expression != NULL
4662 && expression_returns(expr->conditional.true_expression))
4665 return expression_returns(expr->conditional.false_expression);
4668 return expression_returns(expr->select.compound);
4670 case EXPR_ARRAY_ACCESS:
4672 expression_returns(expr->array_access.array_ref) &&
4673 expression_returns(expr->array_access.index);
4676 return expression_returns(expr->va_starte.ap);
4679 return expression_returns(expr->va_arge.ap);
4682 return expression_returns(expr->va_copye.src);
4684 case EXPR_UNARY_CASES_MANDATORY:
4685 return expression_returns(expr->unary.value);
4687 case EXPR_UNARY_THROW:
4690 case EXPR_BINARY_CASES:
4691 // TODO handle constant lhs of && and ||
4693 expression_returns(expr->binary.left) &&
4694 expression_returns(expr->binary.right);
4697 panic("unhandled expression");
4700 static bool initializer_returns(initializer_t const *const init)
4702 switch (init->kind) {
4703 case INITIALIZER_VALUE:
4704 return expression_returns(init->value.value);
4706 case INITIALIZER_LIST: {
4707 initializer_t * const* i = init->list.initializers;
4708 initializer_t * const* const end = i + init->list.len;
4709 bool returns = true;
4710 for (; i != end; ++i) {
4711 if (!initializer_returns(*i))
4717 case INITIALIZER_STRING:
4718 case INITIALIZER_DESIGNATOR: // designators have no payload
4721 panic("unhandled initializer");
4724 static bool noreturn_candidate;
4726 static void check_reachable(statement_t *const stmt)
4728 if (stmt->base.reachable)
4730 if (stmt->kind != STATEMENT_DO_WHILE)
4731 stmt->base.reachable = true;
4733 statement_t *last = stmt;
4735 switch (stmt->kind) {
4736 case STATEMENT_ERROR:
4737 case STATEMENT_EMPTY:
4739 next = stmt->base.next;
4742 case STATEMENT_DECLARATION: {
4743 declaration_statement_t const *const decl = &stmt->declaration;
4744 entity_t const * ent = decl->declarations_begin;
4745 entity_t const *const last_decl = decl->declarations_end;
4747 for (;; ent = ent->base.next) {
4748 if (ent->kind == ENTITY_VARIABLE &&
4749 ent->variable.initializer != NULL &&
4750 !initializer_returns(ent->variable.initializer)) {
4753 if (ent == last_decl)
4757 next = stmt->base.next;
4761 case STATEMENT_COMPOUND:
4762 next = stmt->compound.statements;
4764 next = stmt->base.next;
4767 case STATEMENT_RETURN: {
4768 expression_t const *const val = stmt->returns.value;
4769 if (val == NULL || expression_returns(val))
4770 noreturn_candidate = false;
4774 case STATEMENT_IF: {
4775 if_statement_t const *const ifs = &stmt->ifs;
4776 expression_t const *const cond = ifs->condition;
4778 if (!expression_returns(cond))
4781 int const val = determine_truth(cond);
4784 check_reachable(ifs->true_statement);
4789 if (ifs->false_statement != NULL) {
4790 check_reachable(ifs->false_statement);
4794 next = stmt->base.next;
4798 case STATEMENT_SWITCH: {
4799 switch_statement_t const *const switchs = &stmt->switchs;
4800 expression_t const *const expr = switchs->expression;
4802 if (!expression_returns(expr))
4805 if (is_constant_expression(expr) == EXPR_CLASS_CONSTANT) {
4806 ir_tarval *const val = fold_constant_to_tarval(expr);
4807 case_label_statement_t * defaults = NULL;
4808 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4809 if (i->expression == NULL) {
4814 if (i->first_case == val || i->last_case == val ||
4815 ((tarval_cmp(i->first_case, val) & ir_relation_less_equal)
4816 && (tarval_cmp(val, i->last_case) & ir_relation_less_equal))) {
4817 check_reachable((statement_t*)i);
4822 if (defaults != NULL) {
4823 check_reachable((statement_t*)defaults);
4827 bool has_default = false;
4828 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4829 if (i->expression == NULL)
4832 check_reachable((statement_t*)i);
4839 next = stmt->base.next;
4843 case STATEMENT_EXPRESSION: {
4844 /* Check for noreturn function call */
4845 expression_t const *const expr = stmt->expression.expression;
4846 if (!expression_returns(expr))
4849 next = stmt->base.next;
4853 case STATEMENT_CONTINUE:
4854 for (statement_t *parent = stmt;;) {
4855 parent = parent->base.parent;
4856 if (parent == NULL) /* continue not within loop */
4860 switch (parent->kind) {
4861 case STATEMENT_DO_WHILE: goto continue_do_while;
4862 case STATEMENT_FOR: goto continue_for;
4868 case STATEMENT_BREAK:
4869 for (statement_t *parent = stmt;;) {
4870 parent = parent->base.parent;
4871 if (parent == NULL) /* break not within loop/switch */
4874 switch (parent->kind) {
4875 case STATEMENT_SWITCH:
4876 case STATEMENT_DO_WHILE:
4879 next = parent->base.next;
4880 goto found_break_parent;
4888 case STATEMENT_COMPUTED_GOTO: {
4889 if (!expression_returns(stmt->computed_goto.expression))
4892 statement_t *parent = stmt->base.parent;
4893 if (parent == NULL) /* top level goto */
4899 case STATEMENT_GOTO:
4900 next = stmt->gotos.label->statement;
4901 if (next == NULL) /* missing label */
4905 case STATEMENT_LABEL:
4906 next = stmt->label.statement;
4909 case STATEMENT_CASE_LABEL:
4910 next = stmt->case_label.statement;
4913 case STATEMENT_DO_WHILE:
4914 next = stmt->do_while.body;
4917 case STATEMENT_FOR: {
4918 for_statement_t *const fors = &stmt->fors;
4920 if (fors->condition_reachable)
4922 fors->condition_reachable = true;
4924 expression_t const *const cond = fors->condition;
4929 } else if (expression_returns(cond)) {
4930 val = determine_truth(cond);
4936 check_reachable(fors->body);
4941 next = stmt->base.next;
4945 case STATEMENT_MS_TRY: {
4946 ms_try_statement_t const *const ms_try = &stmt->ms_try;
4947 check_reachable(ms_try->try_statement);
4948 next = ms_try->final_statement;
4952 case STATEMENT_LEAVE: {
4953 statement_t *parent = stmt;
4955 parent = parent->base.parent;
4956 if (parent == NULL) /* __leave not within __try */
4959 if (parent->kind == STATEMENT_MS_TRY) {
4961 next = parent->ms_try.final_statement;
4969 panic("invalid statement kind");
4972 while (next == NULL) {
4973 next = last->base.parent;
4975 noreturn_candidate = false;
4977 type_t *const type = skip_typeref(current_function->base.type);
4978 assert(is_type_function(type));
4979 type_t *const ret = skip_typeref(type->function.return_type);
4980 if (!is_type_void(ret) &&
4981 is_type_valid(ret) &&
4982 !is_main(current_entity)) {
4983 position_t const *const pos = &stmt->base.pos;
4984 warningf(WARN_RETURN_TYPE, pos, "control reaches end of non-void function");
4989 switch (next->kind) {
4990 case STATEMENT_ERROR:
4991 case STATEMENT_EMPTY:
4992 case STATEMENT_DECLARATION:
4993 case STATEMENT_EXPRESSION:
4995 case STATEMENT_RETURN:
4996 case STATEMENT_CONTINUE:
4997 case STATEMENT_BREAK:
4998 case STATEMENT_COMPUTED_GOTO:
4999 case STATEMENT_GOTO:
5000 case STATEMENT_LEAVE:
5001 panic("invalid control flow in function");
5003 case STATEMENT_COMPOUND:
5004 if (next->compound.stmt_expr) {
5010 case STATEMENT_SWITCH:
5011 case STATEMENT_LABEL:
5012 case STATEMENT_CASE_LABEL:
5014 next = next->base.next;
5017 case STATEMENT_DO_WHILE: {
5019 if (next->base.reachable)
5021 next->base.reachable = true;
5023 do_while_statement_t const *const dw = &next->do_while;
5024 expression_t const *const cond = dw->condition;
5026 if (!expression_returns(cond))
5029 int const val = determine_truth(cond);
5032 check_reachable(dw->body);
5038 next = next->base.next;
5042 case STATEMENT_FOR: {
5044 for_statement_t *const fors = &next->fors;
5046 fors->step_reachable = true;
5048 if (fors->condition_reachable)
5050 fors->condition_reachable = true;
5052 expression_t const *const cond = fors->condition;
5057 } else if (expression_returns(cond)) {
5058 val = determine_truth(cond);
5064 check_reachable(fors->body);
5070 next = next->base.next;
5074 case STATEMENT_MS_TRY:
5076 next = next->ms_try.final_statement;
5081 check_reachable(next);
5084 static void check_unreachable(statement_t* const stmt, void *const env)
5088 switch (stmt->kind) {
5089 case STATEMENT_DO_WHILE:
5090 if (!stmt->base.reachable) {
5091 expression_t const *const cond = stmt->do_while.condition;
5092 if (determine_truth(cond) >= 0) {
5093 position_t const *const pos = &cond->base.pos;
5094 warningf(WARN_UNREACHABLE_CODE, pos, "condition of do-while-loop is unreachable");
5099 case STATEMENT_FOR: {
5100 for_statement_t const* const fors = &stmt->fors;
5102 // if init and step are unreachable, cond is unreachable, too
5103 if (!stmt->base.reachable && !fors->step_reachable) {
5104 goto warn_unreachable;
5106 if (!stmt->base.reachable && fors->initialisation != NULL) {
5107 position_t const *const pos = &fors->initialisation->base.pos;
5108 warningf(WARN_UNREACHABLE_CODE, pos, "initialisation of for-statement is unreachable");
5111 if (!fors->condition_reachable && fors->condition != NULL) {
5112 position_t const *const pos = &fors->condition->base.pos;
5113 warningf(WARN_UNREACHABLE_CODE, pos, "condition of for-statement is unreachable");
5116 if (!fors->step_reachable && fors->step != NULL) {
5117 position_t const *const pos = &fors->step->base.pos;
5118 warningf(WARN_UNREACHABLE_CODE, pos, "step of for-statement is unreachable");
5124 case STATEMENT_COMPOUND:
5125 if (stmt->compound.statements != NULL)
5127 goto warn_unreachable;
5129 case STATEMENT_DECLARATION: {
5130 /* Only warn if there is at least one declarator with an initializer.
5131 * This typically occurs in switch statements. */
5132 declaration_statement_t const *const decl = &stmt->declaration;
5133 entity_t const * ent = decl->declarations_begin;
5134 entity_t const *const last = decl->declarations_end;
5136 for (;; ent = ent->base.next) {
5137 if (ent->kind == ENTITY_VARIABLE &&
5138 ent->variable.initializer != NULL) {
5139 goto warn_unreachable;
5149 if (!stmt->base.reachable) {
5150 position_t const *const pos = &stmt->base.pos;
5151 warningf(WARN_UNREACHABLE_CODE, pos, "statement is unreachable");
5157 static bool is_main(entity_t *entity)
5159 static symbol_t *sym_main = NULL;
5160 if (sym_main == NULL) {
5161 sym_main = symbol_table_insert("main");
5164 if (entity->base.symbol != sym_main)
5166 /* must be in outermost scope */
5167 if (entity->base.parent_scope != file_scope)
5173 static void prepare_main_collect2(entity_t*);
5175 static void parse_external_declaration(void)
5177 /* function-definitions and declarations both start with declaration
5179 add_anchor_token(';');
5180 declaration_specifiers_t specifiers;
5181 parse_declaration_specifiers(&specifiers);
5182 rem_anchor_token(';');
5184 /* must be a declaration */
5185 if (token.kind == ';') {
5186 parse_anonymous_declaration_rest(&specifiers);
5190 add_anchor_token(',');
5191 add_anchor_token('=');
5192 add_anchor_token(';');
5193 add_anchor_token('{');
5195 /* declarator is common to both function-definitions and declarations */
5196 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
5198 rem_anchor_token('{');
5199 rem_anchor_token(';');
5200 rem_anchor_token('=');
5201 rem_anchor_token(',');
5203 /* must be a declaration */
5204 switch (token.kind) {
5208 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
5213 /* must be a function definition */
5214 parse_kr_declaration_list(ndeclaration);
5216 if (token.kind != '{') {
5217 parse_error_expected("while parsing function definition", '{', NULL);
5218 eat_until_matching_token(';');
5222 assert(is_declaration(ndeclaration));
5223 type_t *const orig_type = ndeclaration->declaration.type;
5224 type_t * type = skip_typeref(orig_type);
5226 if (!is_type_function(type)) {
5227 if (is_type_valid(type)) {
5228 errorf(HERE, "declarator '%#N' has a body but is not a function type", ndeclaration);
5234 position_t const *const pos = &ndeclaration->base.pos;
5235 if (is_typeref(orig_type)) {
5237 errorf(pos, "type of function definition '%#N' is a typedef", ndeclaration);
5240 if (is_type_compound(skip_typeref(type->function.return_type))) {
5241 warningf(WARN_AGGREGATE_RETURN, pos, "'%N' returns an aggregate", ndeclaration);
5243 if (type->function.unspecified_parameters) {
5244 warningf(WARN_OLD_STYLE_DEFINITION, pos, "old-style definition of '%N'", ndeclaration);
5246 warningf(WARN_TRADITIONAL, pos, "traditional C rejects ISO C style definition of '%N'", ndeclaration);
5249 /* §6.7.5.3:14 a function definition with () means no
5250 * parameters (and not unspecified parameters) */
5251 if (type->function.unspecified_parameters &&
5252 type->function.parameters == NULL) {
5253 type_t *copy = duplicate_type(type);
5254 copy->function.unspecified_parameters = false;
5255 type = identify_new_type(copy);
5257 ndeclaration->declaration.type = type;
5260 entity_t *const entity = record_entity(ndeclaration, true);
5261 assert(entity->kind == ENTITY_FUNCTION);
5262 assert(ndeclaration->kind == ENTITY_FUNCTION);
5264 function_t *const function = &entity->function;
5265 if (ndeclaration != entity) {
5266 function->parameters = ndeclaration->function.parameters;
5269 PUSH_SCOPE(&function->parameters);
5271 entity_t *parameter = function->parameters.entities;
5272 for (; parameter != NULL; parameter = parameter->base.next) {
5273 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5274 parameter->base.parent_scope = current_scope;
5276 assert(parameter->base.parent_scope == NULL
5277 || parameter->base.parent_scope == current_scope);
5278 parameter->base.parent_scope = current_scope;
5279 if (parameter->base.symbol == NULL) {
5280 errorf(¶meter->base.pos, "parameter name omitted");
5283 environment_push(parameter);
5286 if (function->body != NULL) {
5287 parser_error_multiple_definition(entity, HERE);
5290 /* parse function body */
5291 int label_stack_top = label_top();
5292 function_t *old_current_function = current_function;
5293 current_function = function;
5294 PUSH_CURRENT_ENTITY(entity);
5298 goto_anchor = &goto_first;
5300 label_anchor = &label_first;
5302 statement_t *const body = parse_compound_statement(false);
5303 function->body = body;
5306 check_declarations();
5307 if (is_warn_on(WARN_RETURN_TYPE) ||
5308 is_warn_on(WARN_UNREACHABLE_CODE) ||
5309 (is_warn_on(WARN_MISSING_NORETURN) && !(function->base.modifiers & DM_NORETURN))) {
5310 noreturn_candidate = true;
5311 check_reachable(body);
5312 if (is_warn_on(WARN_UNREACHABLE_CODE))
5313 walk_statements(body, check_unreachable, NULL);
5314 if (noreturn_candidate &&
5315 !(function->base.modifiers & DM_NORETURN)) {
5316 position_t const *const pos = &body->base.pos;
5317 warningf(WARN_MISSING_NORETURN, pos, "function '%#N' is candidate for attribute 'noreturn'", entity);
5321 if (is_main(entity)) {
5322 /* Force main to C linkage. */
5323 type_t *const type = entity->declaration.type;
5324 assert(is_type_function(type));
5325 if (type->function.linkage != LINKAGE_C) {
5326 type_t *new_type = duplicate_type(type);
5327 new_type->function.linkage = LINKAGE_C;
5328 entity->declaration.type = identify_new_type(new_type);
5331 if (enable_main_collect2_hack)
5332 prepare_main_collect2(entity);
5335 POP_CURRENT_ENTITY();
5337 assert(current_function == function);
5338 current_function = old_current_function;
5339 label_pop_to(label_stack_top);
5345 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
5347 entity_t *iter = compound->members.entities;
5348 for (; iter != NULL; iter = iter->base.next) {
5349 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5352 if (iter->base.symbol == symbol) {
5354 } else if (iter->base.symbol == NULL) {
5355 /* search in anonymous structs and unions */
5356 type_t *type = skip_typeref(iter->declaration.type);
5357 if (is_type_compound(type)) {
5358 if (find_compound_entry(type->compound.compound, symbol)
5369 static void check_deprecated(const position_t *pos, const entity_t *entity)
5371 if (!is_declaration(entity))
5373 if ((entity->declaration.modifiers & DM_DEPRECATED) == 0)
5376 position_t const *const epos = &entity->base.pos;
5377 char const *const msg = get_deprecated_string(entity->declaration.attributes);
5379 warningf(WARN_DEPRECATED_DECLARATIONS, pos, "'%N' is deprecated (declared %P): \"%s\"", entity, epos, msg);
5381 warningf(WARN_DEPRECATED_DECLARATIONS, pos, "'%N' is deprecated (declared %P)", entity, epos);
5386 static expression_t *create_select(const position_t *pos, expression_t *addr,
5387 type_qualifiers_t qualifiers,
5390 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
5392 check_deprecated(pos, entry);
5394 expression_t *select = allocate_expression_zero(EXPR_SELECT);
5395 select->select.compound = addr;
5396 select->select.compound_entry = entry;
5398 type_t *entry_type = entry->declaration.type;
5399 type_t *res_type = get_qualified_type(entry_type, qualifiers);
5401 /* bitfields need special treatment */
5402 if (entry->compound_member.bitfield) {
5403 unsigned bit_size = entry->compound_member.bit_size;
5404 /* if fewer bits than an int, convert to int (see §6.3.1.1) */
5405 if (bit_size < get_atomic_type_size(ATOMIC_TYPE_INT) * BITS_PER_BYTE) {
5406 res_type = type_int;
5410 /* we always do the auto-type conversions; the & and sizeof parser contains
5411 * code to revert this! */
5412 select->base.type = automatic_type_conversion(res_type);
5419 * Find entry with symbol in compound. Search anonymous structs and unions and
5420 * creates implicit select expressions for them.
5421 * Returns the adress for the innermost compound.
5423 static expression_t *find_create_select(const position_t *pos,
5425 type_qualifiers_t qualifiers,
5426 compound_t *compound, symbol_t *symbol)
5428 entity_t *iter = compound->members.entities;
5429 for (; iter != NULL; iter = iter->base.next) {
5430 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5433 symbol_t *iter_symbol = iter->base.symbol;
5434 if (iter_symbol == NULL) {
5435 type_t *type = iter->declaration.type;
5436 if (!is_type_compound(type))
5439 compound_t *sub_compound = type->compound.compound;
5441 if (find_compound_entry(sub_compound, symbol) == NULL)
5444 expression_t *sub_addr = create_select(pos, addr, qualifiers, iter);
5445 sub_addr->base.pos = *pos;
5446 sub_addr->base.implicit = true;
5447 return find_create_select(pos, sub_addr, qualifiers, sub_compound,
5451 if (iter_symbol == symbol) {
5452 return create_select(pos, addr, qualifiers, iter);
5459 static void parse_bitfield_member(entity_t *entity)
5463 expression_t *size = parse_constant_expression();
5466 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5467 type_t *type = entity->declaration.type;
5468 if (!is_type_integer(skip_typeref(type))) {
5469 errorf(HERE, "bitfield base type '%T' is not an integer type",
5473 if (is_constant_expression(size) != EXPR_CLASS_CONSTANT) {
5474 /* error already reported by parse_constant_expression */
5475 size_long = get_type_size(type) * 8;
5477 size_long = fold_constant_to_int(size);
5479 const symbol_t *symbol = entity->base.symbol;
5480 const symbol_t *user_symbol
5481 = symbol == NULL ? sym_anonymous : symbol;
5482 unsigned bit_size = get_type_size(type) * 8;
5483 if (size_long < 0) {
5484 errorf(HERE, "negative width in bit-field '%Y'", user_symbol);
5485 } else if (size_long == 0 && symbol != NULL) {
5486 errorf(HERE, "zero width for bit-field '%Y'", user_symbol);
5487 } else if (bit_size > 0 && (unsigned)size_long > bit_size) {
5488 errorf(HERE, "width of bitfield '%Y' exceeds its type",
5491 /* hope that people don't invent crazy types with more bits
5492 * than our struct can hold */
5494 (1 << sizeof(entity->compound_member.bit_size)*8));
5498 entity->compound_member.bitfield = true;
5499 entity->compound_member.bit_size = (unsigned char)size_long;
5502 static void parse_compound_declarators(compound_t *compound,
5503 const declaration_specifiers_t *specifiers)
5505 add_anchor_token(';');
5506 add_anchor_token(',');
5510 if (token.kind == ':') {
5511 /* anonymous bitfield */
5512 type_t *type = specifiers->type;
5513 entity_t *const entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, NULL, HERE);
5514 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
5515 entity->declaration.storage_class = STORAGE_CLASS_NONE;
5516 entity->declaration.type = type;
5518 parse_bitfield_member(entity);
5520 attribute_t *attributes = parse_attributes(NULL);
5521 attribute_t **anchor = &attributes;
5522 while (*anchor != NULL)
5523 anchor = &(*anchor)->next;
5524 *anchor = specifiers->attributes;
5525 if (attributes != NULL) {
5526 handle_entity_attributes(attributes, entity);
5528 entity->declaration.attributes = attributes;
5530 append_entity(&compound->members, entity);
5532 entity = parse_declarator(specifiers,
5533 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
5534 position_t const *const pos = &entity->base.pos;
5535 if (entity->kind == ENTITY_TYPEDEF) {
5536 errorf(pos, "typedef not allowed as compound member");
5538 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5540 /* make sure we don't define a symbol multiple times */
5541 symbol_t *symbol = entity->base.symbol;
5542 if (symbol != NULL) {
5543 entity_t *prev = find_compound_entry(compound, symbol);
5545 position_t const *const ppos = &prev->base.pos;
5546 errorf(pos, "multiple declarations of '%N' (declared %P)", entity, ppos);
5550 if (token.kind == ':') {
5551 parse_bitfield_member(entity);
5553 attribute_t *attributes = parse_attributes(NULL);
5554 handle_entity_attributes(attributes, entity);
5556 type_t *orig_type = entity->declaration.type;
5557 type_t *type = skip_typeref(orig_type);
5558 if (is_type_function(type)) {
5559 errorf(pos, "'%N' must not have function type '%T'", entity, orig_type);
5560 } else if (is_type_incomplete(type)) {
5561 /* §6.7.2.1:16 flexible array member */
5562 if (!is_type_array(type) ||
5563 token.kind != ';' ||
5564 look_ahead(1)->kind != '}') {
5565 errorf(pos, "'%N' has incomplete type '%T'", entity, orig_type);
5566 } else if (compound->members.entities == NULL) {
5567 errorf(pos, "flexible array member in otherwise empty struct");
5572 append_entity(&compound->members, entity);
5575 } while (accept(','));
5576 rem_anchor_token(',');
5577 rem_anchor_token(';');
5580 anonymous_entity = NULL;
5583 static void parse_compound_type_entries(compound_t *compound)
5586 add_anchor_token('}');
5589 switch (token.kind) {
5591 case T___extension__:
5592 case T_IDENTIFIER: {
5594 declaration_specifiers_t specifiers;
5595 parse_declaration_specifiers(&specifiers);
5596 parse_compound_declarators(compound, &specifiers);
5602 rem_anchor_token('}');
5605 compound->complete = true;
5611 static type_t *parse_typename(void)
5613 declaration_specifiers_t specifiers;
5614 parse_declaration_specifiers(&specifiers);
5615 if (specifiers.storage_class != STORAGE_CLASS_NONE
5616 || specifiers.thread_local) {
5617 /* TODO: improve error message, user does probably not know what a
5618 * storage class is...
5620 errorf(&specifiers.pos, "typename must not have a storage class");
5623 type_t *result = parse_abstract_declarator(specifiers.type);
5631 typedef expression_t* (*parse_expression_function)(void);
5632 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
5634 typedef struct expression_parser_function_t expression_parser_function_t;
5635 struct expression_parser_function_t {
5636 parse_expression_function parser;
5637 precedence_t infix_precedence;
5638 parse_expression_infix_function infix_parser;
5641 static expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5643 static type_t *get_string_type(string_encoding_t const enc)
5645 bool const warn = is_warn_on(WARN_WRITE_STRINGS);
5647 case STRING_ENCODING_CHAR:
5648 case STRING_ENCODING_UTF8: return warn ? type_const_char_ptr : type_char_ptr;
5649 case STRING_ENCODING_CHAR16: return warn ? type_char16_t_const_ptr : type_char16_t_ptr;
5650 case STRING_ENCODING_CHAR32: return warn ? type_char32_t_const_ptr : type_char32_t_ptr;
5651 case STRING_ENCODING_WIDE: return warn ? type_const_wchar_t_ptr : type_wchar_t_ptr;
5653 panic("invalid string encoding");
5657 * Parse a string constant.
5659 static expression_t *parse_string_literal(void)
5661 expression_t *const expr = allocate_expression_zero(EXPR_STRING_LITERAL);
5662 expr->string_literal.value = concat_string_literals();
5663 expr->base.type = get_string_type(expr->string_literal.value.encoding);
5668 * Parse a boolean constant.
5670 static expression_t *parse_boolean_literal(bool value)
5672 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_BOOLEAN);
5673 literal->base.type = type_bool;
5674 literal->literal.value.begin = value ? "true" : "false";
5675 literal->literal.value.size = value ? 4 : 5;
5677 eat(value ? T_true : T_false);
5681 static void warn_traditional_suffix(char const *const suffix)
5683 warningf(WARN_TRADITIONAL, HERE, "traditional C rejects the '%s' suffix", suffix);
5686 static void check_integer_suffix(expression_t *const expr, char const *const suffix)
5688 unsigned spec = SPECIFIER_NONE;
5689 char const *c = suffix;
5692 if (*c == 'L' || *c == 'l') {
5693 add = SPECIFIER_LONG;
5695 add |= SPECIFIER_LONG_LONG;
5698 } else if (*c == 'U' || *c == 'u') {
5699 add = SPECIFIER_UNSIGNED;
5712 case SPECIFIER_NONE: type = type_int; break;
5713 case SPECIFIER_LONG: type = type_long; break;
5714 case SPECIFIER_LONG | SPECIFIER_LONG_LONG: type = type_long_long; break;
5715 case SPECIFIER_UNSIGNED: type = type_unsigned_int; break;
5716 case SPECIFIER_UNSIGNED | SPECIFIER_LONG: type = type_unsigned_long; break;
5717 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG: type = type_unsigned_long_long; break;
5718 default: panic("inconsistent suffix");
5720 if (spec != SPECIFIER_NONE && spec != SPECIFIER_LONG) {
5721 warn_traditional_suffix(suffix);
5723 expr->base.type = type;
5724 /* Integer type depends on the size of the number and the size
5725 * representable by the types. The backend/codegeneration has to
5726 * determine that. */
5727 determine_literal_type(&expr->literal);
5730 errorf(HERE, "invalid suffix '%s' on integer constant", suffix);
5734 static void check_floatingpoint_suffix(expression_t *const expr, char const *const suffix)
5737 char const *c = suffix;
5740 case 'f': type = type_float; ++c; break;
5742 case 'l': type = type_long_double; ++c; break;
5743 default: type = type_double; break;
5747 expr->base.type = type;
5748 if (suffix[0] != '\0') {
5749 warn_traditional_suffix(suffix);
5752 errorf(HERE, "invalid suffix '%s' on floatingpoint constant", suffix);
5756 static expression_t *parse_number_literal(void)
5758 string_t const *const str = &token.literal.string;
5759 char const * i = str->begin;
5760 unsigned digits = 0;
5761 bool is_float = false;
5763 /* Parse base prefix. */
5767 case 'B': case 'b': base = 2; ++i; break;
5768 case 'X': case 'x': base = 16; ++i; break;
5769 default: base = 8; digits |= 1U << 0; break;
5775 /* Parse mantissa. */
5781 errorf(HERE, "multiple decimal points in %K", &token);
5790 case '0': digit = 0; break;
5791 case '1': digit = 1; break;
5792 case '2': digit = 2; break;
5793 case '3': digit = 3; break;
5794 case '4': digit = 4; break;
5795 case '5': digit = 5; break;
5796 case '6': digit = 6; break;
5797 case '7': digit = 7; break;
5798 case '8': digit = 8; break;
5799 case '9': digit = 9; break;
5800 case 'A': case 'a': digit = 10; break;
5801 case 'B': case 'b': digit = 11; break;
5802 case 'C': case 'c': digit = 12; break;
5803 case 'D': case 'd': digit = 13; break;
5804 case 'E': case 'e': digit = 14; break;
5805 case 'F': case 'f': digit = 15; break;
5807 default: goto done_mantissa;
5810 if (digit >= 10 && base != 16)
5813 digits |= 1U << digit;
5817 /* Parse exponent. */
5821 errorf(HERE, "binary floating %K not allowed", &token);
5826 if (*i == 'E' || *i == 'e') {
5828 goto parse_exponent;
5833 if (*i == 'P' || *i == 'p') {
5838 if (*i == '-' || *i == '+')
5844 } while (isdigit(*i));
5846 errorf(HERE, "exponent of %K has no digits", &token);
5848 } else if (is_float) {
5849 errorf(HERE, "hexadecimal floating %K requires an exponent", &token);
5855 panic("invalid base");
5859 expression_t *const expr = allocate_expression_zero(is_float ? EXPR_LITERAL_FLOATINGPOINT : EXPR_LITERAL_INTEGER);
5860 expr->literal.value = *str;
5864 errorf(HERE, "%K has no digits", &token);
5865 } else if (digits & ~((1U << base) - 1)) {
5866 errorf(HERE, "invalid digit in %K", &token);
5868 expr->literal.suffix = i;
5870 check_floatingpoint_suffix(expr, i);
5872 check_integer_suffix(expr, i);
5882 * Parse a character constant.
5884 static expression_t *parse_character_constant(void)
5886 expression_t *const literal = allocate_expression_zero(EXPR_LITERAL_CHARACTER);
5887 literal->string_literal.value = token.literal.string;
5889 size_t const size = get_string_len(&token.literal.string);
5890 switch (token.literal.string.encoding) {
5891 case STRING_ENCODING_CHAR:
5892 case STRING_ENCODING_UTF8:
5893 literal->base.type = c_mode & _CXX ? type_char : type_int;
5895 if (!GNU_MODE && !(c_mode & _C99)) {
5896 errorf(HERE, "more than 1 character in character constant");
5898 literal->base.type = type_int;
5899 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
5904 case STRING_ENCODING_CHAR16: literal->base.type = type_char16_t; goto warn_multi;
5905 case STRING_ENCODING_CHAR32: literal->base.type = type_char32_t; goto warn_multi;
5906 case STRING_ENCODING_WIDE: literal->base.type = type_wchar_t; goto warn_multi;
5909 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
5914 eat(T_CHARACTER_CONSTANT);
5918 static entity_t *create_implicit_function(symbol_t *symbol, position_t const *const pos)
5920 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
5921 ntype->function.return_type = type_int;
5922 ntype->function.unspecified_parameters = true;
5923 ntype->function.linkage = LINKAGE_C;
5924 type_t *type = identify_new_type(ntype);
5926 entity_t *const entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, symbol, pos);
5927 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
5928 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
5929 entity->declaration.type = type;
5930 entity->declaration.implicit = true;
5932 if (current_scope != NULL)
5933 record_entity(entity, false);
5939 * Performs automatic type cast as described in §6.3.2.1.
5941 * @param orig_type the original type
5943 static type_t *automatic_type_conversion(type_t *orig_type)
5945 type_t *type = skip_typeref(orig_type);
5946 if (is_type_array(type)) {
5947 array_type_t *array_type = &type->array;
5948 type_t *element_type = array_type->element_type;
5949 unsigned qualifiers = array_type->base.qualifiers;
5951 return make_pointer_type(element_type, qualifiers);
5954 if (is_type_function(type)) {
5955 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
5962 * reverts the automatic casts of array to pointer types and function
5963 * to function-pointer types as defined §6.3.2.1
5965 type_t *revert_automatic_type_conversion(const expression_t *expression)
5967 switch (expression->kind) {
5968 case EXPR_REFERENCE: {
5969 entity_t *entity = expression->reference.entity;
5970 if (is_declaration(entity)) {
5971 return entity->declaration.type;
5972 } else if (entity->kind == ENTITY_ENUM_VALUE) {
5973 return entity->enum_value.enum_type;
5975 panic("no declaration or enum in reference");
5980 entity_t *entity = expression->select.compound_entry;
5981 assert(is_declaration(entity));
5982 type_t *type = entity->declaration.type;
5983 return get_qualified_type(type, expression->base.type->base.qualifiers);
5986 case EXPR_UNARY_DEREFERENCE: {
5987 const expression_t *const value = expression->unary.value;
5988 type_t *const type = skip_typeref(value->base.type);
5989 if (!is_type_pointer(type))
5990 return type_error_type;
5991 return type->pointer.points_to;
5994 case EXPR_ARRAY_ACCESS: {
5995 const expression_t *array_ref = expression->array_access.array_ref;
5996 type_t *type_left = skip_typeref(array_ref->base.type);
5997 if (!is_type_pointer(type_left))
5998 return type_error_type;
5999 return type_left->pointer.points_to;
6002 case EXPR_STRING_LITERAL: {
6003 size_t const size = get_string_len(&expression->string_literal.value) + 1;
6004 type_t *const elem = get_unqualified_type(expression->base.type->pointer.points_to);
6005 return make_array_type(elem, size, TYPE_QUALIFIER_NONE);
6008 case EXPR_COMPOUND_LITERAL:
6009 return expression->compound_literal.type;
6014 return expression->base.type;
6018 * Find an entity matching a symbol in a scope.
6019 * Uses current scope if scope is NULL
6021 static entity_t *lookup_entity(const scope_t *scope, symbol_t *symbol,
6022 namespace_tag_t namespc)
6024 if (scope == NULL) {
6025 return get_entity(symbol, namespc);
6028 /* we should optimize here, if scope grows above a certain size we should
6029 construct a hashmap here... */
6030 entity_t *entity = scope->entities;
6031 for ( ; entity != NULL; entity = entity->base.next) {
6032 if (entity->base.symbol == symbol
6033 && (namespace_tag_t)entity->base.namespc == namespc)
6040 static entity_t *parse_qualified_identifier(void)
6042 /* namespace containing the symbol */
6045 const scope_t *lookup_scope = NULL;
6047 if (accept(T_COLONCOLON))
6048 lookup_scope = &unit->scope;
6052 symbol = expect_identifier("while parsing identifier", &pos);
6054 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6057 entity = lookup_entity(lookup_scope, symbol, NAMESPACE_NORMAL);
6059 if (!accept(T_COLONCOLON))
6062 switch (entity->kind) {
6063 case ENTITY_NAMESPACE:
6064 lookup_scope = &entity->namespacee.members;
6069 lookup_scope = &entity->compound.members;
6072 errorf(&pos, "'%Y' must be a namespace, class, struct or union (but is a %s)",
6073 symbol, get_entity_kind_name(entity->kind));
6075 /* skip further qualifications */
6076 while (accept(T_IDENTIFIER) && accept(T_COLONCOLON)) {}
6078 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6082 if (entity == NULL) {
6083 if (!strict_mode && token.kind == '(') {
6084 /* an implicitly declared function */
6085 entity = create_implicit_function(symbol, &pos);
6086 warningf(WARN_IMPLICIT_FUNCTION_DECLARATION, &pos, "implicit declaration of '%N'", entity);
6088 errorf(&pos, "unknown identifier '%Y' found.", symbol);
6089 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6096 static expression_t *parse_reference(void)
6098 position_t const pos = *HERE;
6099 entity_t *const entity = parse_qualified_identifier();
6102 if (is_declaration(entity)) {
6103 orig_type = entity->declaration.type;
6104 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6105 orig_type = entity->enum_value.enum_type;
6107 panic("expected declaration or enum value in reference");
6110 /* we always do the auto-type conversions; the & and sizeof parser contains
6111 * code to revert this! */
6112 type_t *type = automatic_type_conversion(orig_type);
6114 expression_kind_t kind = EXPR_REFERENCE;
6115 if (entity->kind == ENTITY_ENUM_VALUE)
6116 kind = EXPR_ENUM_CONSTANT;
6118 expression_t *expression = allocate_expression_zero(kind);
6119 expression->base.pos = pos;
6120 expression->base.type = type;
6121 expression->reference.entity = entity;
6123 /* this declaration is used */
6124 if (is_declaration(entity)) {
6125 entity->declaration.used = true;
6128 if (entity->base.parent_scope != file_scope
6129 && (current_function != NULL
6130 && entity->base.parent_scope->depth < current_function->parameters.depth)
6131 && (entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER)) {
6132 /* access of a variable from an outer function */
6133 entity->variable.address_taken = true;
6134 current_function->need_closure = true;
6137 check_deprecated(&pos, entity);
6142 static bool semantic_cast(expression_t *cast)
6144 expression_t *expression = cast->unary.value;
6145 type_t *orig_dest_type = cast->base.type;
6146 type_t *orig_type_right = expression->base.type;
6147 type_t const *dst_type = skip_typeref(orig_dest_type);
6148 type_t const *src_type = skip_typeref(orig_type_right);
6149 position_t const *pos = &cast->base.pos;
6151 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6152 if (is_type_void(dst_type))
6155 /* only integer and pointer can be casted to pointer */
6156 if (is_type_pointer(dst_type) &&
6157 !is_type_pointer(src_type) &&
6158 !is_type_integer(src_type) &&
6159 is_type_valid(src_type)) {
6160 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6164 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6165 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6169 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6170 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6174 if (is_type_pointer(src_type) && is_type_pointer(dst_type)) {
6175 type_t *src = skip_typeref(src_type->pointer.points_to);
6176 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6177 unsigned missing_qualifiers =
6178 src->base.qualifiers & ~dst->base.qualifiers;
6179 if (missing_qualifiers != 0) {
6180 warningf(WARN_CAST_QUAL, pos, "cast discards qualifiers '%Q' in pointer target type of '%T'", missing_qualifiers, orig_type_right);
6186 static expression_t *parse_compound_literal(position_t const *const pos,
6189 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6190 expression->base.pos = *pos;
6191 bool global_scope = current_scope == file_scope;
6193 parse_initializer_env_t env;
6196 env.must_be_constant = global_scope;
6197 initializer_t *initializer = parse_initializer(&env);
6200 expression->base.type = automatic_type_conversion(type);
6201 expression->compound_literal.initializer = initializer;
6202 expression->compound_literal.type = type;
6203 expression->compound_literal.global_scope = global_scope;
6209 * Parse a cast expression.
6211 static expression_t *parse_cast(void)
6213 position_t const pos = *HERE;
6216 add_anchor_token(')');
6218 type_t *type = parse_typename();
6220 rem_anchor_token(')');
6223 if (token.kind == '{') {
6224 return parse_compound_literal(&pos, type);
6227 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6228 cast->base.pos = pos;
6230 expression_t *value = parse_subexpression(PREC_CAST);
6231 cast->base.type = type;
6232 cast->unary.value = value;
6234 if (! semantic_cast(cast)) {
6235 /* TODO: record the error in the AST. else it is impossible to detect it */
6242 * Parse a statement expression.
6244 static expression_t *parse_statement_expression(void)
6246 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6249 add_anchor_token(')');
6251 statement_t *statement = parse_compound_statement(true);
6252 statement->compound.stmt_expr = true;
6253 expression->statement.statement = statement;
6255 /* find last statement and use its type */
6256 type_t *type = type_void;
6257 const statement_t *stmt = statement->compound.statements;
6259 while (stmt->base.next != NULL)
6260 stmt = stmt->base.next;
6262 if (stmt->kind == STATEMENT_EXPRESSION) {
6263 type = stmt->expression.expression->base.type;
6266 position_t const *const pos = &expression->base.pos;
6267 warningf(WARN_OTHER, pos, "empty statement expression ({})");
6269 expression->base.type = type;
6271 rem_anchor_token(')');
6277 * Parse a parenthesized expression.
6279 static expression_t *parse_parenthesized_expression(void)
6281 token_t const* const la1 = look_ahead(1);
6282 switch (la1->kind) {
6284 /* gcc extension: a statement expression */
6285 return parse_statement_expression();
6288 if (is_typedef_symbol(la1->base.symbol)) {
6290 return parse_cast();
6295 add_anchor_token(')');
6296 expression_t *result = parse_expression();
6297 result->base.parenthesized = true;
6298 rem_anchor_token(')');
6304 static expression_t *parse_function_keyword(funcname_kind_t const kind)
6306 if (current_function == NULL) {
6307 errorf(HERE, "%K used outside of a function", &token);
6310 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6311 expression->base.type = type_char_ptr;
6312 expression->funcname.kind = kind;
6319 static designator_t *parse_designator(void)
6321 designator_t *const result = allocate_ast_zero(sizeof(result[0]));
6322 result->symbol = expect_identifier("while parsing member designator", &result->pos);
6323 if (!result->symbol)
6326 designator_t *last_designator = result;
6329 designator_t *const designator = allocate_ast_zero(sizeof(result[0]));
6330 designator->symbol = expect_identifier("while parsing member designator", &designator->pos);
6331 if (!designator->symbol)
6334 last_designator->next = designator;
6335 last_designator = designator;
6339 add_anchor_token(']');
6340 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6341 designator->pos = *HERE;
6342 designator->array_index = parse_expression();
6343 rem_anchor_token(']');
6345 if (designator->array_index == NULL) {
6349 last_designator->next = designator;
6350 last_designator = designator;
6360 * Parse the __builtin_offsetof() expression.
6362 static expression_t *parse_offsetof(void)
6364 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6365 expression->base.type = type_size_t;
6367 eat(T___builtin_offsetof);
6369 add_anchor_token(')');
6370 add_anchor_token(',');
6372 type_t *type = parse_typename();
6373 rem_anchor_token(',');
6375 designator_t *designator = parse_designator();
6376 rem_anchor_token(')');
6379 expression->offsetofe.type = type;
6380 expression->offsetofe.designator = designator;
6383 memset(&path, 0, sizeof(path));
6384 path.top_type = type;
6385 path.path = NEW_ARR_F(type_path_entry_t, 0);
6387 descend_into_subtype(&path);
6389 if (!walk_designator(&path, designator, true)) {
6390 return create_error_expression();
6393 DEL_ARR_F(path.path);
6398 static bool is_last_parameter(expression_t *const param)
6400 if (param->kind == EXPR_REFERENCE) {
6401 entity_t *const entity = param->reference.entity;
6402 if (entity->kind == ENTITY_PARAMETER &&
6403 !entity->base.next &&
6404 entity->base.parent_scope == ¤t_function->parameters) {
6409 if (!is_type_valid(skip_typeref(param->base.type)))
6416 * Parses a __builtin_va_start() expression.
6418 static expression_t *parse_va_start(void)
6420 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6422 eat(T___builtin_va_start);
6424 add_anchor_token(')');
6425 add_anchor_token(',');
6427 expression->va_starte.ap = parse_assignment_expression();
6428 rem_anchor_token(',');
6430 expression_t *const param = parse_assignment_expression();
6431 expression->va_starte.parameter = param;
6432 rem_anchor_token(')');
6435 if (!current_function) {
6436 errorf(&expression->base.pos, "'va_start' used outside of function");
6437 } else if (!current_function->base.type->function.variadic) {
6438 errorf(&expression->base.pos, "'va_start' used in non-variadic function");
6439 } else if (!is_last_parameter(param)) {
6440 errorf(¶m->base.pos, "second argument of 'va_start' must be last parameter of the current function");
6447 * Parses a __builtin_va_arg() expression.
6449 static expression_t *parse_va_arg(void)
6451 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6453 eat(T___builtin_va_arg);
6455 add_anchor_token(')');
6456 add_anchor_token(',');
6459 ap.expression = parse_assignment_expression();
6460 expression->va_arge.ap = ap.expression;
6461 check_call_argument(type_valist, &ap, 1);
6463 rem_anchor_token(',');
6465 expression->base.type = parse_typename();
6466 rem_anchor_token(')');
6473 * Parses a __builtin_va_copy() expression.
6475 static expression_t *parse_va_copy(void)
6477 expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
6479 eat(T___builtin_va_copy);
6481 add_anchor_token(')');
6482 add_anchor_token(',');
6484 expression_t *dst = parse_assignment_expression();
6485 assign_error_t error = semantic_assign(type_valist, dst);
6486 report_assign_error(error, type_valist, dst, "call argument 1",
6488 expression->va_copye.dst = dst;
6490 rem_anchor_token(',');
6493 call_argument_t src;
6494 src.expression = parse_assignment_expression();
6495 check_call_argument(type_valist, &src, 2);
6496 expression->va_copye.src = src.expression;
6497 rem_anchor_token(')');
6504 * Parses a __builtin_constant_p() expression.
6506 static expression_t *parse_builtin_constant(void)
6508 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6510 eat(T___builtin_constant_p);
6512 add_anchor_token(')');
6514 expression->builtin_constant.value = parse_assignment_expression();
6515 rem_anchor_token(')');
6517 expression->base.type = type_int;
6523 * Parses a __builtin_types_compatible_p() expression.
6525 static expression_t *parse_builtin_types_compatible(void)
6527 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
6529 eat(T___builtin_types_compatible_p);
6531 add_anchor_token(')');
6532 add_anchor_token(',');
6534 expression->builtin_types_compatible.left = parse_typename();
6535 rem_anchor_token(',');
6537 expression->builtin_types_compatible.right = parse_typename();
6538 rem_anchor_token(')');
6540 expression->base.type = type_int;
6546 * Parses a __builtin_is_*() compare expression.
6548 static expression_t *parse_compare_builtin(void)
6550 expression_kind_t kind;
6551 switch (token.kind) {
6552 case T___builtin_isgreater: kind = EXPR_BINARY_ISGREATER; break;
6553 case T___builtin_isgreaterequal: kind = EXPR_BINARY_ISGREATEREQUAL; break;
6554 case T___builtin_isless: kind = EXPR_BINARY_ISLESS; break;
6555 case T___builtin_islessequal: kind = EXPR_BINARY_ISLESSEQUAL; break;
6556 case T___builtin_islessgreater: kind = EXPR_BINARY_ISLESSGREATER; break;
6557 case T___builtin_isunordered: kind = EXPR_BINARY_ISUNORDERED; break;
6558 default: internal_errorf(HERE, "invalid compare builtin found");
6560 expression_t *const expression = allocate_expression_zero(kind);
6563 add_anchor_token(')');
6564 add_anchor_token(',');
6566 expression->binary.left = parse_assignment_expression();
6567 rem_anchor_token(',');
6569 expression->binary.right = parse_assignment_expression();
6570 rem_anchor_token(')');
6573 type_t *const orig_type_left = expression->binary.left->base.type;
6574 type_t *const orig_type_right = expression->binary.right->base.type;
6576 type_t *const type_left = skip_typeref(orig_type_left);
6577 type_t *const type_right = skip_typeref(orig_type_right);
6578 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6579 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6580 type_error_incompatible("invalid operands in comparison",
6581 &expression->base.pos, orig_type_left, orig_type_right);
6584 semantic_comparison(&expression->binary);
6591 * Parses a MS assume() expression.
6593 static expression_t *parse_assume(void)
6595 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
6599 add_anchor_token(')');
6601 expression->unary.value = parse_assignment_expression();
6602 rem_anchor_token(')');
6605 expression->base.type = type_void;
6610 * Return the label for the current symbol or create a new one.
6612 static label_t *get_label(char const *const context)
6614 assert(current_function != NULL);
6616 symbol_t *const sym = expect_identifier(context, NULL);
6620 entity_t *label = get_entity(sym, NAMESPACE_LABEL);
6621 /* If we find a local label, we already created the declaration. */
6622 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
6623 if (label->base.parent_scope != current_scope) {
6624 assert(label->base.parent_scope->depth < current_scope->depth);
6625 current_function->goto_to_outer = true;
6627 } else if (label == NULL || label->base.parent_scope != ¤t_function->parameters) {
6628 /* There is no matching label in the same function, so create a new one. */
6629 position_t const nowhere = { NULL, 0, 0, false };
6630 label = allocate_entity_zero(ENTITY_LABEL, NAMESPACE_LABEL, sym, &nowhere);
6634 return &label->label;
6638 * Parses a GNU && label address expression.
6640 static expression_t *parse_label_address(void)
6642 position_t const pos = *HERE;
6645 label_t *const label = get_label("while parsing label address");
6647 return create_error_expression();
6650 label->address_taken = true;
6652 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
6653 expression->base.pos = pos;
6655 /* label address is treated as a void pointer */
6656 expression->base.type = type_void_ptr;
6657 expression->label_address.label = label;
6662 * Parse a microsoft __noop expression.
6664 static expression_t *parse_noop_expression(void)
6666 /* the result is a (int)0 */
6667 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_MS_NOOP);
6668 literal->base.type = type_int;
6669 literal->literal.value.begin = "__noop";
6670 literal->literal.value.size = 6;
6674 if (token.kind == '(') {
6675 /* parse arguments */
6677 add_anchor_token(')');
6678 add_anchor_token(',');
6680 if (token.kind != ')') do {
6681 (void)parse_assignment_expression();
6682 } while (accept(','));
6684 rem_anchor_token(',');
6685 rem_anchor_token(')');
6693 * Parses a primary expression.
6695 static expression_t *parse_primary_expression(void)
6697 switch (token.kind) {
6698 case T_false: return parse_boolean_literal(false);
6699 case T_true: return parse_boolean_literal(true);
6700 case T_NUMBER: return parse_number_literal();
6701 case T_CHARACTER_CONSTANT: return parse_character_constant();
6702 case T_STRING_LITERAL: return parse_string_literal();
6703 case T___func__: return parse_function_keyword(FUNCNAME_FUNCTION);
6704 case T___PRETTY_FUNCTION__: return parse_function_keyword(FUNCNAME_PRETTY_FUNCTION);
6705 case T___FUNCSIG__: return parse_function_keyword(FUNCNAME_FUNCSIG);
6706 case T___FUNCDNAME__: return parse_function_keyword(FUNCNAME_FUNCDNAME);
6707 case T___builtin_offsetof: return parse_offsetof();
6708 case T___builtin_va_start: return parse_va_start();
6709 case T___builtin_va_arg: return parse_va_arg();
6710 case T___builtin_va_copy: return parse_va_copy();
6711 case T___builtin_isgreater:
6712 case T___builtin_isgreaterequal:
6713 case T___builtin_isless:
6714 case T___builtin_islessequal:
6715 case T___builtin_islessgreater:
6716 case T___builtin_isunordered: return parse_compare_builtin();
6717 case T___builtin_constant_p: return parse_builtin_constant();
6718 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
6719 case T__assume: return parse_assume();
6722 return parse_label_address();
6725 case '(': return parse_parenthesized_expression();
6726 case T___noop: return parse_noop_expression();
6728 /* Gracefully handle type names while parsing expressions. */
6730 return parse_reference();
6732 if (!is_typedef_symbol(token.base.symbol)) {
6733 return parse_reference();
6737 position_t const pos = *HERE;
6738 declaration_specifiers_t specifiers;
6739 parse_declaration_specifiers(&specifiers);
6740 type_t const *const type = parse_abstract_declarator(specifiers.type);
6741 errorf(&pos, "encountered type '%T' while parsing expression", type);
6742 return create_error_expression();
6746 errorf(HERE, "unexpected token %K, expected an expression", &token);
6748 return create_error_expression();
6751 static expression_t *parse_array_expression(expression_t *left)
6753 expression_t *const expr = allocate_expression_zero(EXPR_ARRAY_ACCESS);
6754 array_access_expression_t *const arr = &expr->array_access;
6757 add_anchor_token(']');
6759 expression_t *const inside = parse_expression();
6761 type_t *const orig_type_left = left->base.type;
6762 type_t *const orig_type_inside = inside->base.type;
6764 type_t *const type_left = skip_typeref(orig_type_left);
6765 type_t *const type_inside = skip_typeref(orig_type_inside);
6771 if (is_type_pointer(type_left)) {
6774 idx_type = type_inside;
6775 res_type = type_left->pointer.points_to;
6777 } else if (is_type_pointer(type_inside)) {
6778 arr->flipped = true;
6781 idx_type = type_left;
6782 res_type = type_inside->pointer.points_to;
6784 res_type = automatic_type_conversion(res_type);
6785 if (!is_type_integer(idx_type)) {
6786 if (is_type_valid(idx_type))
6787 errorf(&idx->base.pos, "array subscript must have integer type");
6788 } else if (is_type_atomic(idx_type, ATOMIC_TYPE_CHAR)) {
6789 position_t const *const pos = &idx->base.pos;
6790 warningf(WARN_CHAR_SUBSCRIPTS, pos, "array subscript has char type");
6793 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
6794 errorf(&expr->base.pos, "invalid types '%T[%T]' for array access", orig_type_left, orig_type_inside);
6796 res_type = type_error_type;
6801 arr->array_ref = ref;
6803 arr->base.type = res_type;
6805 rem_anchor_token(']');
6810 static bool is_bitfield(const expression_t *expression)
6812 return expression->kind == EXPR_SELECT
6813 && expression->select.compound_entry->compound_member.bitfield;
6816 static expression_t *parse_typeprop(expression_kind_t const kind)
6818 expression_t *tp_expression = allocate_expression_zero(kind);
6819 tp_expression->base.type = type_size_t;
6821 eat(kind == EXPR_SIZEOF ? T_sizeof : T__Alignof);
6824 expression_t *expression;
6825 if (token.kind == '(' && is_declaration_specifier(look_ahead(1))) {
6826 position_t const pos = *HERE;
6828 add_anchor_token(')');
6829 orig_type = parse_typename();
6830 rem_anchor_token(')');
6833 if (token.kind == '{') {
6834 /* It was not sizeof(type) after all. It is sizeof of an expression
6835 * starting with a compound literal */
6836 expression = parse_compound_literal(&pos, orig_type);
6837 goto typeprop_expression;
6840 expression = parse_subexpression(PREC_UNARY);
6842 typeprop_expression:
6843 if (is_bitfield(expression)) {
6844 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6845 errorf(&tp_expression->base.pos,
6846 "operand of %s expression must not be a bitfield", what);
6849 tp_expression->typeprop.tp_expression = expression;
6851 orig_type = revert_automatic_type_conversion(expression);
6852 expression->base.type = orig_type;
6855 tp_expression->typeprop.type = orig_type;
6856 type_t const* const type = skip_typeref(orig_type);
6857 char const* wrong_type = NULL;
6858 if (is_type_incomplete(type)) {
6859 if (!is_type_void(type) || !GNU_MODE)
6860 wrong_type = "incomplete";
6861 } else if (type->kind == TYPE_FUNCTION) {
6863 /* function types are allowed (and return 1) */
6864 position_t const *const pos = &tp_expression->base.pos;
6865 char const *const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6866 warningf(WARN_OTHER, pos, "%s expression with function argument returns invalid result", what);
6868 wrong_type = "function";
6872 if (wrong_type != NULL) {
6873 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6874 errorf(&tp_expression->base.pos,
6875 "operand of %s expression must not be of %s type '%T'",
6876 what, wrong_type, orig_type);
6879 return tp_expression;
6882 static expression_t *parse_sizeof(void)
6884 return parse_typeprop(EXPR_SIZEOF);
6887 static expression_t *parse_alignof(void)
6889 return parse_typeprop(EXPR_ALIGNOF);
6892 static expression_t *parse_select_expression(expression_t *addr)
6894 assert(token.kind == '.' || token.kind == T_MINUSGREATER);
6895 bool select_left_arrow = (token.kind == T_MINUSGREATER);
6896 position_t const pos = *HERE;
6899 symbol_t *const symbol = expect_identifier("while parsing select", NULL);
6901 return create_error_expression();
6903 type_t *const orig_type = addr->base.type;
6904 type_t *const type = skip_typeref(orig_type);
6907 bool saw_error = false;
6908 if (is_type_pointer(type)) {
6909 if (!select_left_arrow) {
6911 "request for member '%Y' in something not a struct or union, but '%T'",
6915 type_left = skip_typeref(type->pointer.points_to);
6917 if (select_left_arrow && is_type_valid(type)) {
6918 errorf(&pos, "left hand side of '->' is not a pointer, but '%T'", orig_type);
6924 if (!is_type_compound(type_left)) {
6925 if (is_type_valid(type_left) && !saw_error) {
6927 "request for member '%Y' in something not a struct or union, but '%T'",
6930 return create_error_expression();
6933 compound_t *compound = type_left->compound.compound;
6934 if (!compound->complete) {
6935 errorf(&pos, "request for member '%Y' in incomplete type '%T'",
6937 return create_error_expression();
6940 type_qualifiers_t qualifiers = type_left->base.qualifiers;
6941 expression_t *result =
6942 find_create_select(&pos, addr, qualifiers, compound, symbol);
6944 if (result == NULL) {
6945 errorf(&pos, "'%T' has no member named '%Y'", orig_type, symbol);
6946 return create_error_expression();
6952 static void check_call_argument(type_t *expected_type,
6953 call_argument_t *argument, unsigned pos)
6955 type_t *expected_type_skip = skip_typeref(expected_type);
6956 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
6957 expression_t *arg_expr = argument->expression;
6958 type_t *arg_type = skip_typeref(arg_expr->base.type);
6960 /* handle transparent union gnu extension */
6961 if (is_type_union(expected_type_skip)
6962 && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
6963 compound_t *union_decl = expected_type_skip->compound.compound;
6964 type_t *best_type = NULL;
6965 entity_t *entry = union_decl->members.entities;
6966 for ( ; entry != NULL; entry = entry->base.next) {
6967 assert(is_declaration(entry));
6968 type_t *decl_type = entry->declaration.type;
6969 error = semantic_assign(decl_type, arg_expr);
6970 if (error == ASSIGN_ERROR_INCOMPATIBLE
6971 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
6974 if (error == ASSIGN_SUCCESS) {
6975 best_type = decl_type;
6976 } else if (best_type == NULL) {
6977 best_type = decl_type;
6981 if (best_type != NULL) {
6982 expected_type = best_type;
6986 error = semantic_assign(expected_type, arg_expr);
6987 argument->expression = create_implicit_cast(arg_expr, expected_type);
6989 if (error != ASSIGN_SUCCESS) {
6990 /* report exact scope in error messages (like "in argument 3") */
6992 snprintf(buf, sizeof(buf), "call argument %u", pos);
6993 report_assign_error(error, expected_type, arg_expr, buf,
6994 &arg_expr->base.pos);
6996 type_t *const promoted_type = get_default_promoted_type(arg_type);
6997 if (!types_compatible(expected_type_skip, promoted_type) &&
6998 !types_compatible(expected_type_skip, type_void_ptr) &&
6999 !types_compatible(type_void_ptr, promoted_type)) {
7000 /* Deliberately show the skipped types in this warning */
7001 position_t const *const apos = &arg_expr->base.pos;
7002 warningf(WARN_TRADITIONAL, apos, "passing call argument %u as '%T' rather than '%T' due to prototype", pos, expected_type_skip, promoted_type);
7008 * Handle the semantic restrictions of builtin calls
7010 static void handle_builtin_argument_restrictions(call_expression_t *call)
7012 entity_t *entity = call->function->reference.entity;
7013 switch (entity->function.btk) {
7015 switch (entity->function.b.firm_builtin_kind) {
7016 case ir_bk_return_address:
7017 case ir_bk_frame_address: {
7018 /* argument must be constant */
7019 call_argument_t *argument = call->arguments;
7021 if (is_constant_expression(argument->expression) == EXPR_CLASS_VARIABLE) {
7022 errorf(&call->base.pos,
7023 "argument of '%Y' must be a constant expression",
7024 call->function->reference.entity->base.symbol);
7028 case ir_bk_prefetch:
7029 /* second and third argument must be constant if existent */
7030 if (call->arguments == NULL)
7032 call_argument_t *rw = call->arguments->next;
7033 call_argument_t *locality = NULL;
7036 if (is_constant_expression(rw->expression) == EXPR_CLASS_VARIABLE) {
7037 errorf(&call->base.pos,
7038 "second argument of '%Y' must be a constant expression",
7039 call->function->reference.entity->base.symbol);
7041 locality = rw->next;
7043 if (locality != NULL) {
7044 if (is_constant_expression(locality->expression) == EXPR_CLASS_VARIABLE) {
7045 errorf(&call->base.pos,
7046 "third argument of '%Y' must be a constant expression",
7047 call->function->reference.entity->base.symbol);
7055 case BUILTIN_OBJECT_SIZE:
7056 if (call->arguments == NULL)
7059 call_argument_t *arg = call->arguments->next;
7060 if (arg != NULL && is_constant_expression(arg->expression) == EXPR_CLASS_VARIABLE) {
7061 errorf(&call->base.pos,
7062 "second argument of '%Y' must be a constant expression",
7063 call->function->reference.entity->base.symbol);
7072 * Parse a call expression, i.e. expression '( ... )'.
7074 * @param expression the function address
7076 static expression_t *parse_call_expression(expression_t *expression)
7078 expression_t *result = allocate_expression_zero(EXPR_CALL);
7079 call_expression_t *call = &result->call;
7080 call->function = expression;
7082 type_t *const orig_type = expression->base.type;
7083 type_t *const type = skip_typeref(orig_type);
7085 function_type_t *function_type = NULL;
7086 if (is_type_pointer(type)) {
7087 type_t *const to_type = skip_typeref(type->pointer.points_to);
7089 if (is_type_function(to_type)) {
7090 function_type = &to_type->function;
7091 call->base.type = function_type->return_type;
7095 if (function_type == NULL && is_type_valid(type)) {
7097 "called object '%E' (type '%T') is not a pointer to a function",
7098 expression, orig_type);
7101 /* parse arguments */
7103 add_anchor_token(')');
7104 add_anchor_token(',');
7106 if (token.kind != ')') {
7107 call_argument_t **anchor = &call->arguments;
7109 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7110 argument->expression = parse_assignment_expression();
7113 anchor = &argument->next;
7114 } while (accept(','));
7116 rem_anchor_token(',');
7117 rem_anchor_token(')');
7120 if (function_type == NULL)
7123 /* check type and count of call arguments */
7124 function_parameter_t *parameter = function_type->parameters;
7125 call_argument_t *argument = call->arguments;
7126 if (!function_type->unspecified_parameters) {
7127 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7128 parameter = parameter->next, argument = argument->next) {
7129 check_call_argument(parameter->type, argument, ++pos);
7132 if (parameter != NULL) {
7133 errorf(&expression->base.pos, "too few arguments to function '%E'",
7135 } else if (argument != NULL && !function_type->variadic) {
7136 errorf(&argument->expression->base.pos,
7137 "too many arguments to function '%E'", expression);
7141 /* do default promotion for other arguments */
7142 for (; argument != NULL; argument = argument->next) {
7143 type_t *argument_type = argument->expression->base.type;
7144 if (!is_type_object(skip_typeref(argument_type))) {
7145 errorf(&argument->expression->base.pos,
7146 "call argument '%E' must not be void", argument->expression);
7149 argument_type = get_default_promoted_type(argument_type);
7151 argument->expression
7152 = create_implicit_cast(argument->expression, argument_type);
7157 if (is_type_compound(skip_typeref(function_type->return_type))) {
7158 position_t const *const pos = &expression->base.pos;
7159 warningf(WARN_AGGREGATE_RETURN, pos, "function call has aggregate value");
7162 if (expression->kind == EXPR_REFERENCE) {
7163 reference_expression_t *reference = &expression->reference;
7164 if (reference->entity->kind == ENTITY_FUNCTION &&
7165 reference->entity->function.btk != BUILTIN_NONE)
7166 handle_builtin_argument_restrictions(call);
7172 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7174 static bool same_compound_type(const type_t *type1, const type_t *type2)
7177 is_type_compound(type1) &&
7178 type1->kind == type2->kind &&
7179 type1->compound.compound == type2->compound.compound;
7182 static expression_t const *get_reference_address(expression_t const *expr)
7184 bool regular_take_address = true;
7186 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7187 expr = expr->unary.value;
7189 regular_take_address = false;
7192 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7195 expr = expr->unary.value;
7198 if (expr->kind != EXPR_REFERENCE)
7201 /* special case for functions which are automatically converted to a
7202 * pointer to function without an extra TAKE_ADDRESS operation */
7203 if (!regular_take_address &&
7204 expr->reference.entity->kind != ENTITY_FUNCTION) {
7211 static void warn_reference_address_as_bool(expression_t const* expr)
7213 expr = get_reference_address(expr);
7215 position_t const *const pos = &expr->base.pos;
7216 entity_t const *const ent = expr->reference.entity;
7217 warningf(WARN_ADDRESS, pos, "the address of '%N' will always evaluate as 'true'", ent);
7221 static void warn_assignment_in_condition(const expression_t *const expr)
7223 if (expr->base.kind != EXPR_BINARY_ASSIGN)
7225 if (expr->base.parenthesized)
7227 position_t const *const pos = &expr->base.pos;
7228 warningf(WARN_PARENTHESES, pos, "suggest parentheses around assignment used as truth value");
7231 static void semantic_condition(expression_t const *const expr,
7232 char const *const context)
7234 type_t *const type = skip_typeref(expr->base.type);
7235 if (is_type_scalar(type)) {
7236 warn_reference_address_as_bool(expr);
7237 warn_assignment_in_condition(expr);
7238 } else if (is_type_valid(type)) {
7239 errorf(&expr->base.pos, "%s must have scalar type", context);
7244 * Parse a conditional expression, i.e. 'expression ? ... : ...'.
7246 * @param expression the conditional expression
7248 static expression_t *parse_conditional_expression(expression_t *expression)
7250 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7252 conditional_expression_t *conditional = &result->conditional;
7253 conditional->condition = expression;
7256 add_anchor_token(':');
7258 /* §6.5.15:2 The first operand shall have scalar type. */
7259 semantic_condition(expression, "condition of conditional operator");
7261 expression_t *true_expression = expression;
7262 bool gnu_cond = false;
7263 if (GNU_MODE && token.kind == ':') {
7266 true_expression = parse_expression();
7268 rem_anchor_token(':');
7270 expression_t *false_expression =
7271 parse_subexpression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7273 type_t *const orig_true_type = true_expression->base.type;
7274 type_t *const orig_false_type = false_expression->base.type;
7275 type_t *const true_type = skip_typeref(orig_true_type);
7276 type_t *const false_type = skip_typeref(orig_false_type);
7279 position_t const *const pos = &conditional->base.pos;
7280 type_t *result_type;
7281 if (is_type_void(true_type) || is_type_void(false_type)) {
7282 /* ISO/IEC 14882:1998(E) §5.16:2 */
7283 if (true_expression->kind == EXPR_UNARY_THROW) {
7284 result_type = false_type;
7285 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7286 result_type = true_type;
7288 if (!is_type_void(true_type) || !is_type_void(false_type)) {
7289 warningf(WARN_OTHER, pos, "ISO C forbids conditional expression with only one void side");
7291 result_type = type_void;
7293 } else if (is_type_arithmetic(true_type)
7294 && is_type_arithmetic(false_type)) {
7295 result_type = semantic_arithmetic(true_type, false_type);
7296 } else if (same_compound_type(true_type, false_type)) {
7297 /* just take 1 of the 2 types */
7298 result_type = true_type;
7299 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7300 type_t *pointer_type;
7302 expression_t *other_expression;
7303 if (is_type_pointer(true_type) &&
7304 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7305 pointer_type = true_type;
7306 other_type = false_type;
7307 other_expression = false_expression;
7309 pointer_type = false_type;
7310 other_type = true_type;
7311 other_expression = true_expression;
7314 if (is_null_pointer_constant(other_expression)) {
7315 result_type = pointer_type;
7316 } else if (is_type_pointer(other_type)) {
7317 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7318 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7321 if (is_type_void(to1) || is_type_void(to2)) {
7323 } else if (types_compatible(get_unqualified_type(to1),
7324 get_unqualified_type(to2))) {
7327 warningf(WARN_OTHER, pos, "pointer types '%T' and '%T' in conditional expression are incompatible", true_type, false_type);
7331 type_t *const type =
7332 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7333 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7334 } else if (is_type_integer(other_type)) {
7335 warningf(WARN_OTHER, pos, "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7336 result_type = pointer_type;
7338 goto types_incompatible;
7342 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7343 type_error_incompatible("while parsing conditional", pos, true_type, false_type);
7345 result_type = type_error_type;
7348 conditional->true_expression
7349 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7350 conditional->false_expression
7351 = create_implicit_cast(false_expression, result_type);
7352 conditional->base.type = result_type;
7357 * Parse an extension expression.
7359 static expression_t *parse_extension(void)
7362 expression_t *expression = parse_subexpression(PREC_UNARY);
7368 * Parse a __builtin_classify_type() expression.
7370 static expression_t *parse_builtin_classify_type(void)
7372 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7373 result->base.type = type_int;
7375 eat(T___builtin_classify_type);
7377 add_anchor_token(')');
7379 expression_t *expression = parse_expression();
7380 rem_anchor_token(')');
7382 result->classify_type.type_expression = expression;
7388 * Parse a delete expression
7389 * ISO/IEC 14882:1998(E) §5.3.5
7391 static expression_t *parse_delete(void)
7393 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7394 result->base.type = type_void;
7399 result->kind = EXPR_UNARY_DELETE_ARRAY;
7403 expression_t *const value = parse_subexpression(PREC_CAST);
7404 result->unary.value = value;
7406 type_t *const type = skip_typeref(value->base.type);
7407 if (!is_type_pointer(type)) {
7408 if (is_type_valid(type)) {
7409 errorf(&value->base.pos,
7410 "operand of delete must have pointer type");
7412 } else if (is_type_void(skip_typeref(type->pointer.points_to))) {
7413 position_t const *const pos = &value->base.pos;
7414 warningf(WARN_OTHER, pos, "deleting 'void*' is undefined");
7421 * Parse a throw expression
7422 * ISO/IEC 14882:1998(E) §15:1
7424 static expression_t *parse_throw(void)
7426 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7427 result->base.type = type_void;
7431 expression_t *value = NULL;
7432 switch (token.kind) {
7434 value = parse_assignment_expression();
7435 /* ISO/IEC 14882:1998(E) §15.1:3 */
7436 type_t *const orig_type = value->base.type;
7437 type_t *const type = skip_typeref(orig_type);
7438 if (is_type_incomplete(type)) {
7439 errorf(&value->base.pos,
7440 "cannot throw object of incomplete type '%T'", orig_type);
7441 } else if (is_type_pointer(type)) {
7442 type_t *const points_to = skip_typeref(type->pointer.points_to);
7443 if (is_type_incomplete(points_to) && !is_type_void(points_to)) {
7444 errorf(&value->base.pos,
7445 "cannot throw pointer to incomplete type '%T'", orig_type);
7453 result->unary.value = value;
7458 static bool check_pointer_arithmetic(const position_t *pos,
7459 type_t *pointer_type,
7460 type_t *orig_pointer_type)
7462 type_t *points_to = pointer_type->pointer.points_to;
7463 points_to = skip_typeref(points_to);
7465 if (is_type_incomplete(points_to)) {
7466 if (!GNU_MODE || !is_type_void(points_to)) {
7468 "arithmetic with pointer to incomplete type '%T' not allowed",
7472 warningf(WARN_POINTER_ARITH, pos, "pointer of type '%T' used in arithmetic", orig_pointer_type);
7474 } else if (is_type_function(points_to)) {
7477 "arithmetic with pointer to function type '%T' not allowed",
7481 warningf(WARN_POINTER_ARITH, pos,
7482 "pointer to a function '%T' used in arithmetic",
7489 static bool is_lvalue(const expression_t *expression)
7491 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
7492 switch (expression->kind) {
7493 case EXPR_ARRAY_ACCESS:
7494 case EXPR_COMPOUND_LITERAL:
7495 case EXPR_REFERENCE:
7497 case EXPR_UNARY_DEREFERENCE:
7501 type_t *type = skip_typeref(expression->base.type);
7503 /* ISO/IEC 14882:1998(E) §3.10:3 */
7504 is_type_reference(type) ||
7505 /* Claim it is an lvalue, if the type is invalid. There was a parse
7506 * error before, which maybe prevented properly recognizing it as
7508 !is_type_valid(type);
7513 static void semantic_incdec(unary_expression_t *expression)
7515 type_t *const orig_type = expression->value->base.type;
7516 type_t *const type = skip_typeref(orig_type);
7517 if (is_type_pointer(type)) {
7518 if (!check_pointer_arithmetic(&expression->base.pos, type, orig_type)) {
7521 } else if (!is_type_real(type) && is_type_valid(type)) {
7522 /* TODO: improve error message */
7523 errorf(&expression->base.pos,
7524 "operation needs an arithmetic or pointer type");
7527 if (!is_lvalue(expression->value)) {
7528 /* TODO: improve error message */
7529 errorf(&expression->base.pos, "lvalue required as operand");
7531 expression->base.type = orig_type;
7534 static void promote_unary_int_expr(unary_expression_t *const expr, type_t *const type)
7536 type_t *const res_type = promote_integer(type);
7537 expr->base.type = res_type;
7538 expr->value = create_implicit_cast(expr->value, res_type);
7541 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
7543 type_t *const orig_type = expression->value->base.type;
7544 type_t *const type = skip_typeref(orig_type);
7545 if (!is_type_arithmetic(type)) {
7546 if (is_type_valid(type)) {
7547 position_t const *const pos = &expression->base.pos;
7548 errorf(pos, "operand of unary expression must have arithmetic type, but is '%T'", orig_type);
7551 } else if (is_type_integer(type)) {
7552 promote_unary_int_expr(expression, type);
7554 expression->base.type = orig_type;
7558 static void semantic_unexpr_plus(unary_expression_t *expression)
7560 semantic_unexpr_arithmetic(expression);
7561 position_t const *const pos = &expression->base.pos;
7562 warningf(WARN_TRADITIONAL, pos, "traditional C rejects the unary plus operator");
7565 static void semantic_not(unary_expression_t *expression)
7567 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
7568 semantic_condition(expression->value, "operand of !");
7569 expression->base.type = c_mode & _CXX ? type_bool : type_int;
7572 static void semantic_unexpr_integer(unary_expression_t *expression)
7574 type_t *const orig_type = expression->value->base.type;
7575 type_t *const type = skip_typeref(orig_type);
7576 if (!is_type_integer(type)) {
7577 if (is_type_valid(type)) {
7578 errorf(&expression->base.pos, "operand of ~ must be of integer type");
7583 promote_unary_int_expr(expression, type);
7586 static void semantic_dereference(unary_expression_t *expression)
7588 type_t *const orig_type = expression->value->base.type;
7589 type_t *const type = skip_typeref(orig_type);
7590 if (!is_type_pointer(type)) {
7591 if (is_type_valid(type)) {
7592 errorf(&expression->base.pos,
7593 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
7598 type_t *result_type = type->pointer.points_to;
7599 result_type = automatic_type_conversion(result_type);
7600 expression->base.type = result_type;
7604 * Record that an address is taken (expression represents an lvalue).
7606 * @param expression the expression
7607 * @param may_be_register if true, the expression might be an register
7609 static void set_address_taken(expression_t *expression, bool may_be_register)
7611 if (expression->kind != EXPR_REFERENCE)
7614 entity_t *const entity = expression->reference.entity;
7616 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
7619 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
7620 && !may_be_register) {
7621 position_t const *const pos = &expression->base.pos;
7622 errorf(pos, "address of register '%N' requested", entity);
7625 entity->variable.address_taken = true;
7629 * Check the semantic of the address taken expression.
7631 static void semantic_take_addr(unary_expression_t *expression)
7633 expression_t *value = expression->value;
7634 value->base.type = revert_automatic_type_conversion(value);
7636 type_t *orig_type = value->base.type;
7637 type_t *type = skip_typeref(orig_type);
7638 if (!is_type_valid(type))
7642 if (!is_lvalue(value)) {
7643 errorf(&expression->base.pos, "'&' requires an lvalue");
7645 if (is_bitfield(value)) {
7646 errorf(&expression->base.pos, "'&' not allowed on bitfield");
7649 set_address_taken(value, false);
7651 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
7654 #define CREATE_UNARY_EXPRESSION_PARSER(token_kind, unexpression_type, sfunc) \
7655 static expression_t *parse_##unexpression_type(void) \
7657 expression_t *unary_expression \
7658 = allocate_expression_zero(unexpression_type); \
7660 unary_expression->unary.value = parse_subexpression(PREC_UNARY); \
7662 sfunc(&unary_expression->unary); \
7664 return unary_expression; \
7667 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
7668 semantic_unexpr_arithmetic)
7669 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
7670 semantic_unexpr_plus)
7671 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
7673 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
7674 semantic_dereference)
7675 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
7677 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
7678 semantic_unexpr_integer)
7679 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
7681 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
7684 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_kind, unexpression_type, \
7686 static expression_t *parse_##unexpression_type(expression_t *left) \
7688 expression_t *unary_expression \
7689 = allocate_expression_zero(unexpression_type); \
7691 unary_expression->unary.value = left; \
7693 sfunc(&unary_expression->unary); \
7695 return unary_expression; \
7698 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
7699 EXPR_UNARY_POSTFIX_INCREMENT,
7701 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
7702 EXPR_UNARY_POSTFIX_DECREMENT,
7705 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
7707 /* TODO: handle complex + imaginary types */
7709 type_left = get_unqualified_type(type_left);
7710 type_right = get_unqualified_type(type_right);
7712 /* §6.3.1.8 Usual arithmetic conversions */
7713 if (type_left == type_long_double || type_right == type_long_double) {
7714 return type_long_double;
7715 } else if (type_left == type_double || type_right == type_double) {
7717 } else if (type_left == type_float || type_right == type_float) {
7721 type_left = promote_integer(type_left);
7722 type_right = promote_integer(type_right);
7724 if (type_left == type_right)
7727 bool const signed_left = is_type_signed(type_left);
7728 bool const signed_right = is_type_signed(type_right);
7729 unsigned const rank_left = get_akind_rank(get_akind(type_left));
7730 unsigned const rank_right = get_akind_rank(get_akind(type_right));
7732 if (signed_left == signed_right)
7733 return rank_left >= rank_right ? type_left : type_right;
7737 atomic_type_kind_t s_akind;
7738 atomic_type_kind_t u_akind;
7743 u_type = type_right;
7745 s_type = type_right;
7748 s_akind = get_akind(s_type);
7749 u_akind = get_akind(u_type);
7750 s_rank = get_akind_rank(s_akind);
7751 u_rank = get_akind_rank(u_akind);
7753 if (u_rank >= s_rank)
7756 if (get_atomic_type_size(s_akind) > get_atomic_type_size(u_akind))
7760 case ATOMIC_TYPE_INT: return type_unsigned_int;
7761 case ATOMIC_TYPE_LONG: return type_unsigned_long;
7762 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
7764 default: panic("invalid atomic type");
7769 * Check the semantic restrictions for a binary expression.
7771 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
7773 expression_t *const left = expression->left;
7774 expression_t *const right = expression->right;
7775 type_t *const orig_type_left = left->base.type;
7776 type_t *const orig_type_right = right->base.type;
7777 type_t *const type_left = skip_typeref(orig_type_left);
7778 type_t *const type_right = skip_typeref(orig_type_right);
7780 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
7781 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7782 position_t const *const pos = &expression->base.pos;
7783 errorf(pos, "operands of binary expression must have arithmetic types, but are '%T' and '%T'", orig_type_left, orig_type_right);
7788 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7789 expression->left = create_implicit_cast(left, arithmetic_type);
7790 expression->right = create_implicit_cast(right, arithmetic_type);
7791 expression->base.type = arithmetic_type;
7794 static void semantic_binexpr_integer(binary_expression_t *const expression)
7796 expression_t *const left = expression->left;
7797 expression_t *const right = expression->right;
7798 type_t *const orig_type_left = left->base.type;
7799 type_t *const orig_type_right = right->base.type;
7800 type_t *const type_left = skip_typeref(orig_type_left);
7801 type_t *const type_right = skip_typeref(orig_type_right);
7803 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
7804 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7805 position_t const *const pos = &expression->base.pos;
7806 errorf(pos, "operands of binary expression must have integer types, but are '%T' and '%T'", orig_type_left, orig_type_right);
7811 type_t *const result_type = semantic_arithmetic(type_left, type_right);
7812 expression->left = create_implicit_cast(left, result_type);
7813 expression->right = create_implicit_cast(right, result_type);
7814 expression->base.type = result_type;
7817 static void warn_div_by_zero(binary_expression_t const *const expression)
7819 if (!is_type_integer(expression->base.type))
7822 expression_t const *const right = expression->right;
7823 /* The type of the right operand can be different for /= */
7824 if (is_type_integer(right->base.type) &&
7825 is_constant_expression(right) == EXPR_CLASS_CONSTANT &&
7826 !fold_constant_to_bool(right)) {
7827 position_t const *const pos = &expression->base.pos;
7828 warningf(WARN_DIV_BY_ZERO, pos, "division by zero");
7833 * Check the semantic restrictions for a div expression.
7835 static void semantic_div(binary_expression_t *expression)
7837 semantic_binexpr_arithmetic(expression);
7838 warn_div_by_zero(expression);
7842 * Check the semantic restrictions for a mod expression.
7844 static void semantic_mod(binary_expression_t *expression)
7846 semantic_binexpr_integer(expression);
7847 warn_div_by_zero(expression);
7850 static void warn_addsub_in_shift(const expression_t *const expr)
7852 if (expr->base.parenthesized)
7856 switch (expr->kind) {
7857 case EXPR_BINARY_ADD: op = '+'; break;
7858 case EXPR_BINARY_SUB: op = '-'; break;
7862 position_t const *const pos = &expr->base.pos;
7863 warningf(WARN_PARENTHESES, pos, "suggest parentheses around '%c' inside shift", op);
7866 static bool semantic_shift(binary_expression_t *expression)
7868 expression_t *const left = expression->left;
7869 expression_t *const right = expression->right;
7870 type_t *const orig_type_left = left->base.type;
7871 type_t *const orig_type_right = right->base.type;
7872 type_t * type_left = skip_typeref(orig_type_left);
7873 type_t * type_right = skip_typeref(orig_type_right);
7875 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
7876 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7877 position_t const *const pos = &expression->base.pos;
7878 errorf(pos, "operands of shift expression must have integer types, but are '%T' and '%T'", orig_type_left, orig_type_right);
7883 type_left = promote_integer(type_left);
7885 if (is_constant_expression(right) == EXPR_CLASS_CONSTANT) {
7886 position_t const *const pos = &right->base.pos;
7887 long const count = fold_constant_to_int(right);
7889 warningf(WARN_OTHER, pos, "shift count must be non-negative");
7890 } else if ((unsigned long)count >=
7891 get_atomic_type_size(type_left->atomic.akind) * 8) {
7892 warningf(WARN_OTHER, pos, "shift count must be less than type width");
7896 type_right = promote_integer(type_right);
7897 expression->right = create_implicit_cast(right, type_right);
7902 static void semantic_shift_op(binary_expression_t *expression)
7904 expression_t *const left = expression->left;
7905 expression_t *const right = expression->right;
7907 if (!semantic_shift(expression))
7910 warn_addsub_in_shift(left);
7911 warn_addsub_in_shift(right);
7913 type_t *const orig_type_left = left->base.type;
7914 type_t * type_left = skip_typeref(orig_type_left);
7916 type_left = promote_integer(type_left);
7917 expression->left = create_implicit_cast(left, type_left);
7918 expression->base.type = type_left;
7921 static void semantic_add(binary_expression_t *expression)
7923 expression_t *const left = expression->left;
7924 expression_t *const right = expression->right;
7925 type_t *const orig_type_left = left->base.type;
7926 type_t *const orig_type_right = right->base.type;
7927 type_t *const type_left = skip_typeref(orig_type_left);
7928 type_t *const type_right = skip_typeref(orig_type_right);
7931 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7932 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7933 expression->left = create_implicit_cast(left, arithmetic_type);
7934 expression->right = create_implicit_cast(right, arithmetic_type);
7935 expression->base.type = arithmetic_type;
7936 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
7937 check_pointer_arithmetic(&expression->base.pos, type_left,
7939 expression->base.type = type_left;
7940 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
7941 check_pointer_arithmetic(&expression->base.pos, type_right,
7943 expression->base.type = type_right;
7944 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
7945 errorf(&expression->base.pos,
7946 "invalid operands to binary + ('%T', '%T')",
7947 orig_type_left, orig_type_right);
7951 static void semantic_sub(binary_expression_t *expression)
7953 expression_t *const left = expression->left;
7954 expression_t *const right = expression->right;
7955 type_t *const orig_type_left = left->base.type;
7956 type_t *const orig_type_right = right->base.type;
7957 type_t *const type_left = skip_typeref(orig_type_left);
7958 type_t *const type_right = skip_typeref(orig_type_right);
7959 position_t const *const pos = &expression->base.pos;
7962 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7963 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7964 expression->left = create_implicit_cast(left, arithmetic_type);
7965 expression->right = create_implicit_cast(right, arithmetic_type);
7966 expression->base.type = arithmetic_type;
7967 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
7968 check_pointer_arithmetic(&expression->base.pos, type_left,
7970 expression->base.type = type_left;
7971 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
7972 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
7973 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
7974 if (!types_compatible(unqual_left, unqual_right)) {
7976 "subtracting pointers to incompatible types '%T' and '%T'",
7977 orig_type_left, orig_type_right);
7978 } else if (!is_type_object(unqual_left)) {
7979 if (!is_type_void(unqual_left)) {
7980 errorf(pos, "subtracting pointers to non-object types '%T'",
7983 warningf(WARN_OTHER, pos, "subtracting pointers to void");
7986 expression->base.type = type_ptrdiff_t;
7987 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
7988 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
7989 orig_type_left, orig_type_right);
7993 static void warn_string_literal_address(expression_t const* expr)
7995 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7996 expr = expr->unary.value;
7997 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7999 expr = expr->unary.value;
8002 if (expr->kind == EXPR_STRING_LITERAL) {
8003 position_t const *const pos = &expr->base.pos;
8004 warningf(WARN_ADDRESS, pos, "comparison with string literal results in unspecified behaviour");
8008 static bool maybe_negative(expression_t const *const expr)
8010 switch (is_constant_expression(expr)) {
8011 case EXPR_CLASS_ERROR: return false;
8012 case EXPR_CLASS_CONSTANT: return constant_is_negative(expr);
8013 default: return true;
8017 static void warn_comparison(position_t const *const pos, expression_t const *const expr, expression_t const *const other)
8019 warn_string_literal_address(expr);
8021 expression_t const* const ref = get_reference_address(expr);
8022 if (ref != NULL && is_null_pointer_constant(other)) {
8023 entity_t const *const ent = ref->reference.entity;
8024 warningf(WARN_ADDRESS, pos, "the address of '%N' will never be NULL", ent);
8027 if (!expr->base.parenthesized) {
8028 switch (expr->base.kind) {
8029 case EXPR_BINARY_LESS:
8030 case EXPR_BINARY_GREATER:
8031 case EXPR_BINARY_LESSEQUAL:
8032 case EXPR_BINARY_GREATEREQUAL:
8033 case EXPR_BINARY_NOTEQUAL:
8034 case EXPR_BINARY_EQUAL:
8035 warningf(WARN_PARENTHESES, pos, "comparisons like 'x <= y < z' do not have their mathematical meaning");
8044 * Check the semantics of comparison expressions.
8046 * @param expression The expression to check.
8048 static void semantic_comparison(binary_expression_t *expression)
8050 position_t const *const pos = &expression->base.pos;
8051 expression_t *const left = expression->left;
8052 expression_t *const right = expression->right;
8054 warn_comparison(pos, left, right);
8055 warn_comparison(pos, right, left);
8057 type_t *orig_type_left = left->base.type;
8058 type_t *orig_type_right = right->base.type;
8059 type_t *type_left = skip_typeref(orig_type_left);
8060 type_t *type_right = skip_typeref(orig_type_right);
8062 /* TODO non-arithmetic types */
8063 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8064 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8066 /* test for signed vs unsigned compares */
8067 if (is_type_integer(arithmetic_type)) {
8068 bool const signed_left = is_type_signed(type_left);
8069 bool const signed_right = is_type_signed(type_right);
8070 if (signed_left != signed_right) {
8071 /* FIXME long long needs better const folding magic */
8072 /* TODO check whether constant value can be represented by other type */
8073 if ((signed_left && maybe_negative(left)) ||
8074 (signed_right && maybe_negative(right))) {
8075 warningf(WARN_SIGN_COMPARE, pos, "comparison between signed and unsigned");
8080 expression->left = create_implicit_cast(left, arithmetic_type);
8081 expression->right = create_implicit_cast(right, arithmetic_type);
8082 expression->base.type = arithmetic_type;
8083 if ((expression->base.kind == EXPR_BINARY_EQUAL ||
8084 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8085 is_type_float(arithmetic_type)) {
8086 warningf(WARN_FLOAT_EQUAL, pos, "comparing floating point with == or != is unsafe");
8088 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8089 /* TODO check compatibility */
8090 } else if (is_type_pointer(type_left)) {
8091 expression->right = create_implicit_cast(right, type_left);
8092 } else if (is_type_pointer(type_right)) {
8093 expression->left = create_implicit_cast(left, type_right);
8094 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8095 type_error_incompatible("invalid operands in comparison", pos, type_left, type_right);
8097 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8101 * Checks if a compound type has constant fields.
8103 static bool has_const_fields(const compound_type_t *type)
8105 compound_t *compound = type->compound;
8106 entity_t *entry = compound->members.entities;
8108 for (; entry != NULL; entry = entry->base.next) {
8109 if (!is_declaration(entry))
8112 const type_t *decl_type = skip_typeref(entry->declaration.type);
8113 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8120 static bool is_valid_assignment_lhs(expression_t const* const left)
8122 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8123 type_t *const type_left = skip_typeref(orig_type_left);
8125 if (!is_lvalue(left)) {
8126 errorf(&left->base.pos,
8127 "left hand side '%E' of assignment is not an lvalue", left);
8131 if (left->kind == EXPR_REFERENCE
8132 && left->reference.entity->kind == ENTITY_FUNCTION) {
8133 errorf(&left->base.pos, "cannot assign to function '%E'", left);
8137 if (is_type_array(type_left)) {
8138 errorf(&left->base.pos, "cannot assign to array '%E'", left);
8141 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8142 errorf(&left->base.pos,
8143 "assignment to read-only location '%E' (type '%T')", left,
8147 if (is_type_incomplete(type_left)) {
8148 errorf(&left->base.pos, "left-hand side '%E' of assignment has incomplete type '%T'",
8149 left, orig_type_left);
8152 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8153 errorf(&left->base.pos, "cannot assign to '%E' because compound type '%T' has read-only fields",
8154 left, orig_type_left);
8161 static void semantic_arithmetic_assign(binary_expression_t *expression)
8163 expression_t *left = expression->left;
8164 expression_t *right = expression->right;
8165 type_t *orig_type_left = left->base.type;
8166 type_t *orig_type_right = right->base.type;
8168 if (!is_valid_assignment_lhs(left))
8171 type_t *type_left = skip_typeref(orig_type_left);
8172 type_t *type_right = skip_typeref(orig_type_right);
8174 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8175 /* TODO: improve error message */
8176 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8177 errorf(&expression->base.pos, "operation needs arithmetic types");
8182 /* combined instructions are tricky. We can't create an implicit cast on
8183 * the left side, because we need the uncasted form for the store.
8184 * The ast2firm pass has to know that left_type must be right_type
8185 * for the arithmetic operation and create a cast by itself */
8186 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8187 expression->right = create_implicit_cast(right, arithmetic_type);
8188 expression->base.type = type_left;
8191 static void semantic_divmod_assign(binary_expression_t *expression)
8193 semantic_arithmetic_assign(expression);
8194 warn_div_by_zero(expression);
8197 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8199 expression_t *const left = expression->left;
8200 expression_t *const right = expression->right;
8201 type_t *const orig_type_left = left->base.type;
8202 type_t *const orig_type_right = right->base.type;
8203 type_t *const type_left = skip_typeref(orig_type_left);
8204 type_t *const type_right = skip_typeref(orig_type_right);
8206 if (!is_valid_assignment_lhs(left))
8209 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8210 /* combined instructions are tricky. We can't create an implicit cast on
8211 * the left side, because we need the uncasted form for the store.
8212 * The ast2firm pass has to know that left_type must be right_type
8213 * for the arithmetic operation and create a cast by itself */
8214 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8215 expression->right = create_implicit_cast(right, arithmetic_type);
8216 expression->base.type = type_left;
8217 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8218 check_pointer_arithmetic(&expression->base.pos, type_left,
8220 expression->base.type = type_left;
8221 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8222 errorf(&expression->base.pos,
8223 "incompatible types '%T' and '%T' in assignment",
8224 orig_type_left, orig_type_right);
8228 static void semantic_integer_assign(binary_expression_t *expression)
8230 expression_t *left = expression->left;
8231 expression_t *right = expression->right;
8232 type_t *orig_type_left = left->base.type;
8233 type_t *orig_type_right = right->base.type;
8235 if (!is_valid_assignment_lhs(left))
8238 type_t *type_left = skip_typeref(orig_type_left);
8239 type_t *type_right = skip_typeref(orig_type_right);
8241 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8242 /* TODO: improve error message */
8243 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8244 errorf(&expression->base.pos, "operation needs integer types");
8249 /* combined instructions are tricky. We can't create an implicit cast on
8250 * the left side, because we need the uncasted form for the store.
8251 * The ast2firm pass has to know that left_type must be right_type
8252 * for the arithmetic operation and create a cast by itself */
8253 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8254 expression->right = create_implicit_cast(right, arithmetic_type);
8255 expression->base.type = type_left;
8258 static void semantic_shift_assign(binary_expression_t *expression)
8260 expression_t *left = expression->left;
8262 if (!is_valid_assignment_lhs(left))
8265 if (!semantic_shift(expression))
8268 expression->base.type = skip_typeref(left->base.type);
8271 static void warn_logical_and_within_or(const expression_t *const expr)
8273 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8275 if (expr->base.parenthesized)
8277 position_t const *const pos = &expr->base.pos;
8278 warningf(WARN_PARENTHESES, pos, "suggest parentheses around && within ||");
8282 * Check the semantic restrictions of a logical expression.
8284 static void semantic_logical_op(binary_expression_t *expression)
8286 /* §6.5.13:2 Each of the operands shall have scalar type.
8287 * §6.5.14:2 Each of the operands shall have scalar type. */
8288 semantic_condition(expression->left, "left operand of logical operator");
8289 semantic_condition(expression->right, "right operand of logical operator");
8290 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR) {
8291 warn_logical_and_within_or(expression->left);
8292 warn_logical_and_within_or(expression->right);
8294 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8298 * Check the semantic restrictions of a binary assign expression.
8300 static void semantic_binexpr_assign(binary_expression_t *expression)
8302 expression_t *left = expression->left;
8303 type_t *orig_type_left = left->base.type;
8305 if (!is_valid_assignment_lhs(left))
8308 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8309 report_assign_error(error, orig_type_left, expression->right,
8310 "assignment", &left->base.pos);
8311 expression->right = create_implicit_cast(expression->right, orig_type_left);
8312 expression->base.type = orig_type_left;
8316 * Determine if the outermost operation (or parts thereof) of the given
8317 * expression has no effect in order to generate a warning about this fact.
8318 * Therefore in some cases this only examines some of the operands of the
8319 * expression (see comments in the function and examples below).
8321 * f() + 23; // warning, because + has no effect
8322 * x || f(); // no warning, because x controls execution of f()
8323 * x ? y : f(); // warning, because y has no effect
8324 * (void)x; // no warning to be able to suppress the warning
8325 * This function can NOT be used for an "expression has definitely no effect"-
8327 static bool expression_has_effect(const expression_t *const expr)
8329 switch (expr->kind) {
8330 case EXPR_ERROR: return true; /* do NOT warn */
8331 case EXPR_REFERENCE: return false;
8332 case EXPR_ENUM_CONSTANT: return false;
8333 case EXPR_LABEL_ADDRESS: return false;
8335 /* suppress the warning for microsoft __noop operations */
8336 case EXPR_LITERAL_MS_NOOP: return true;
8337 case EXPR_LITERAL_BOOLEAN:
8338 case EXPR_LITERAL_CHARACTER:
8339 case EXPR_LITERAL_INTEGER:
8340 case EXPR_LITERAL_FLOATINGPOINT:
8341 case EXPR_STRING_LITERAL: return false;
8344 const call_expression_t *const call = &expr->call;
8345 if (call->function->kind != EXPR_REFERENCE)
8348 switch (call->function->reference.entity->function.btk) {
8349 /* FIXME: which builtins have no effect? */
8350 default: return true;
8354 /* Generate the warning if either the left or right hand side of a
8355 * conditional expression has no effect */
8356 case EXPR_CONDITIONAL: {
8357 conditional_expression_t const *const cond = &expr->conditional;
8358 expression_t const *const t = cond->true_expression;
8360 (t == NULL || expression_has_effect(t)) &&
8361 expression_has_effect(cond->false_expression);
8364 case EXPR_SELECT: return false;
8365 case EXPR_ARRAY_ACCESS: return false;
8366 case EXPR_SIZEOF: return false;
8367 case EXPR_CLASSIFY_TYPE: return false;
8368 case EXPR_ALIGNOF: return false;
8370 case EXPR_FUNCNAME: return false;
8371 case EXPR_BUILTIN_CONSTANT_P: return false;
8372 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8373 case EXPR_OFFSETOF: return false;
8374 case EXPR_VA_START: return true;
8375 case EXPR_VA_ARG: return true;
8376 case EXPR_VA_COPY: return true;
8377 case EXPR_STATEMENT: return true; // TODO
8378 case EXPR_COMPOUND_LITERAL: return false;
8380 case EXPR_UNARY_NEGATE: return false;
8381 case EXPR_UNARY_PLUS: return false;
8382 case EXPR_UNARY_BITWISE_NEGATE: return false;
8383 case EXPR_UNARY_NOT: return false;
8384 case EXPR_UNARY_DEREFERENCE: return false;
8385 case EXPR_UNARY_TAKE_ADDRESS: return false;
8386 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8387 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8388 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8389 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8391 /* Treat void casts as if they have an effect in order to being able to
8392 * suppress the warning */
8393 case EXPR_UNARY_CAST: {
8394 type_t *const type = skip_typeref(expr->base.type);
8395 return is_type_void(type);
8398 case EXPR_UNARY_ASSUME: return true;
8399 case EXPR_UNARY_DELETE: return true;
8400 case EXPR_UNARY_DELETE_ARRAY: return true;
8401 case EXPR_UNARY_THROW: return true;
8403 case EXPR_BINARY_ADD: return false;
8404 case EXPR_BINARY_SUB: return false;
8405 case EXPR_BINARY_MUL: return false;
8406 case EXPR_BINARY_DIV: return false;
8407 case EXPR_BINARY_MOD: return false;
8408 case EXPR_BINARY_EQUAL: return false;
8409 case EXPR_BINARY_NOTEQUAL: return false;
8410 case EXPR_BINARY_LESS: return false;
8411 case EXPR_BINARY_LESSEQUAL: return false;
8412 case EXPR_BINARY_GREATER: return false;
8413 case EXPR_BINARY_GREATEREQUAL: return false;
8414 case EXPR_BINARY_BITWISE_AND: return false;
8415 case EXPR_BINARY_BITWISE_OR: return false;
8416 case EXPR_BINARY_BITWISE_XOR: return false;
8417 case EXPR_BINARY_SHIFTLEFT: return false;
8418 case EXPR_BINARY_SHIFTRIGHT: return false;
8419 case EXPR_BINARY_ASSIGN: return true;
8420 case EXPR_BINARY_MUL_ASSIGN: return true;
8421 case EXPR_BINARY_DIV_ASSIGN: return true;
8422 case EXPR_BINARY_MOD_ASSIGN: return true;
8423 case EXPR_BINARY_ADD_ASSIGN: return true;
8424 case EXPR_BINARY_SUB_ASSIGN: return true;
8425 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8426 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8427 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8428 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8429 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8431 /* Only examine the right hand side of && and ||, because the left hand
8432 * side already has the effect of controlling the execution of the right
8434 case EXPR_BINARY_LOGICAL_AND:
8435 case EXPR_BINARY_LOGICAL_OR:
8436 /* Only examine the right hand side of a comma expression, because the left
8437 * hand side has a separate warning */
8438 case EXPR_BINARY_COMMA:
8439 return expression_has_effect(expr->binary.right);
8441 case EXPR_BINARY_ISGREATER: return false;
8442 case EXPR_BINARY_ISGREATEREQUAL: return false;
8443 case EXPR_BINARY_ISLESS: return false;
8444 case EXPR_BINARY_ISLESSEQUAL: return false;
8445 case EXPR_BINARY_ISLESSGREATER: return false;
8446 case EXPR_BINARY_ISUNORDERED: return false;
8449 internal_errorf(HERE, "unexpected expression");
8452 static void semantic_comma(binary_expression_t *expression)
8454 const expression_t *const left = expression->left;
8455 if (!expression_has_effect(left)) {
8456 position_t const *const pos = &left->base.pos;
8457 warningf(WARN_UNUSED_VALUE, pos, "left-hand operand of comma expression has no effect");
8459 expression->base.type = expression->right->base.type;
8463 * @param prec_r precedence of the right operand
8465 #define CREATE_BINEXPR_PARSER(token_kind, binexpression_type, prec_r, sfunc) \
8466 static expression_t *parse_##binexpression_type(expression_t *left) \
8468 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8469 binexpr->binary.left = left; \
8472 expression_t *right = parse_subexpression(prec_r); \
8474 binexpr->binary.right = right; \
8475 sfunc(&binexpr->binary); \
8480 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8481 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_div)
8482 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_mod)
8483 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8484 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8485 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8486 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8487 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
8488 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
8489 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
8490 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
8491 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
8492 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
8493 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_integer)
8494 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_integer)
8495 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_integer)
8496 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8497 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8498 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
8499 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8500 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8501 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8502 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8503 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8504 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8505 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8506 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8507 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8508 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8509 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
8512 static expression_t *parse_subexpression(precedence_t precedence)
8514 expression_parser_function_t *parser
8515 = &expression_parsers[token.kind];
8518 if (parser->parser != NULL) {
8519 left = parser->parser();
8521 left = parse_primary_expression();
8523 assert(left != NULL);
8526 parser = &expression_parsers[token.kind];
8527 if (parser->infix_parser == NULL)
8529 if (parser->infix_precedence < precedence)
8532 left = parser->infix_parser(left);
8534 assert(left != NULL);
8541 * Parse an expression.
8543 static expression_t *parse_expression(void)
8545 return parse_subexpression(PREC_EXPRESSION);
8549 * Register a parser for a prefix-like operator.
8551 * @param parser the parser function
8552 * @param token_kind the token type of the prefix token
8554 static void register_expression_parser(parse_expression_function parser,
8557 expression_parser_function_t *entry = &expression_parsers[token_kind];
8559 assert(!entry->parser);
8560 entry->parser = parser;
8564 * Register a parser for an infix operator with given precedence.
8566 * @param parser the parser function
8567 * @param token_kind the token type of the infix operator
8568 * @param precedence the precedence of the operator
8570 static void register_infix_parser(parse_expression_infix_function parser,
8571 int token_kind, precedence_t precedence)
8573 expression_parser_function_t *entry = &expression_parsers[token_kind];
8575 assert(!entry->infix_parser);
8576 entry->infix_parser = parser;
8577 entry->infix_precedence = precedence;
8581 * Initialize the expression parsers.
8583 static void init_expression_parsers(void)
8585 memset(&expression_parsers, 0, sizeof(expression_parsers));
8587 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
8588 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
8589 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
8590 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
8591 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
8592 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
8593 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
8594 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
8595 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
8596 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
8597 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
8598 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
8599 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
8600 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
8601 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
8602 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
8603 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
8604 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
8605 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
8606 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
8607 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
8608 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
8609 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
8610 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
8611 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
8612 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
8613 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
8614 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
8615 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
8616 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
8617 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
8618 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
8619 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
8620 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
8621 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
8622 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
8623 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
8625 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
8626 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
8627 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
8628 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
8629 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
8630 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
8631 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
8632 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
8633 register_expression_parser(parse_sizeof, T_sizeof);
8634 register_expression_parser(parse_alignof, T__Alignof);
8635 register_expression_parser(parse_extension, T___extension__);
8636 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
8637 register_expression_parser(parse_delete, T_delete);
8638 register_expression_parser(parse_throw, T_throw);
8642 * Parse a asm statement arguments specification.
8644 static void parse_asm_arguments(asm_argument_t **anchor, bool const is_out)
8646 if (token.kind == T_STRING_LITERAL || token.kind == '[') {
8647 add_anchor_token(',');
8649 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
8651 add_anchor_token(')');
8652 add_anchor_token('(');
8653 add_anchor_token(T_STRING_LITERAL);
8656 add_anchor_token(']');
8657 argument->symbol = expect_identifier("while parsing asm argument", NULL);
8658 rem_anchor_token(']');
8662 rem_anchor_token(T_STRING_LITERAL);
8663 argument->constraints = parse_string_literals("asm argument");
8664 rem_anchor_token('(');
8666 expression_t *expression = parse_expression();
8668 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
8669 * change size or type representation (e.g. int -> long is ok, but
8670 * int -> float is not) */
8671 if (expression->kind == EXPR_UNARY_CAST) {
8672 type_t *const type = expression->base.type;
8673 type_kind_t const kind = type->kind;
8674 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
8677 if (kind == TYPE_ATOMIC) {
8678 atomic_type_kind_t const akind = type->atomic.akind;
8679 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8680 size = get_atomic_type_size(akind);
8682 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8683 size = get_type_size(type_void_ptr);
8687 expression_t *const value = expression->unary.value;
8688 type_t *const value_type = value->base.type;
8689 type_kind_t const value_kind = value_type->kind;
8691 unsigned value_flags;
8692 unsigned value_size;
8693 if (value_kind == TYPE_ATOMIC) {
8694 atomic_type_kind_t const value_akind = value_type->atomic.akind;
8695 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8696 value_size = get_atomic_type_size(value_akind);
8697 } else if (value_kind == TYPE_POINTER) {
8698 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8699 value_size = get_type_size(type_void_ptr);
8704 if (value_flags != flags || value_size != size)
8708 } while (expression->kind == EXPR_UNARY_CAST);
8712 if (!is_lvalue(expression))
8713 errorf(&expression->base.pos,
8714 "asm output argument is not an lvalue");
8716 if (argument->constraints.begin[0] == '=')
8717 determine_lhs_ent(expression, NULL);
8719 mark_vars_read(expression, NULL);
8721 mark_vars_read(expression, NULL);
8723 argument->expression = expression;
8724 rem_anchor_token(')');
8727 set_address_taken(expression, true);
8730 anchor = &argument->next;
8731 } while (accept(','));
8732 rem_anchor_token(',');
8737 * Parse a asm statement clobber specification.
8739 static void parse_asm_clobbers(asm_clobber_t **anchor)
8741 if (token.kind == T_STRING_LITERAL) {
8742 add_anchor_token(',');
8744 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
8745 clobber->clobber = parse_string_literals(NULL);
8748 anchor = &clobber->next;
8749 } while (accept(','));
8750 rem_anchor_token(',');
8754 static void parse_asm_labels(asm_label_t **anchor)
8756 if (token.kind == T_IDENTIFIER) {
8757 add_anchor_token(',');
8759 label_t *const label = get_label("while parsing 'asm goto' labels");
8761 asm_label_t *const asm_label = allocate_ast_zero(sizeof(*asm_label));
8762 asm_label->label = label;
8764 *anchor = asm_label;
8765 anchor = &asm_label->next;
8767 } while (accept(','));
8768 rem_anchor_token(',');
8773 * Parse an asm statement.
8775 static statement_t *parse_asm_statement(void)
8777 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
8778 asm_statement_t *asm_statement = &statement->asms;
8781 add_anchor_token(')');
8782 add_anchor_token(':');
8783 add_anchor_token(T_STRING_LITERAL);
8785 if (accept(T_volatile))
8786 asm_statement->is_volatile = true;
8788 bool const asm_goto = accept(T_goto);
8791 rem_anchor_token(T_STRING_LITERAL);
8792 asm_statement->asm_text = parse_string_literals("asm statement");
8794 if (accept(':')) parse_asm_arguments(&asm_statement->outputs, true);
8795 if (accept(':')) parse_asm_arguments(&asm_statement->inputs, false);
8796 if (accept(':')) parse_asm_clobbers( &asm_statement->clobbers);
8798 rem_anchor_token(':');
8801 warningf(WARN_OTHER, &statement->base.pos, "assembler statement with labels should be 'asm goto'");
8802 parse_asm_labels(&asm_statement->labels);
8803 if (asm_statement->labels)
8804 errorf(&statement->base.pos, "'asm goto' not supported");
8807 warningf(WARN_OTHER, &statement->base.pos, "'asm goto' without labels");
8810 rem_anchor_token(')');
8814 if (asm_statement->outputs == NULL) {
8815 /* GCC: An 'asm' instruction without any output operands will be treated
8816 * identically to a volatile 'asm' instruction. */
8817 asm_statement->is_volatile = true;
8823 static statement_t *parse_label_inner_statement(statement_t const *const label, char const *const label_kind)
8825 statement_t *inner_stmt;
8826 switch (token.kind) {
8828 errorf(&label->base.pos, "%s at end of compound statement", label_kind);
8829 inner_stmt = create_error_statement();
8833 if (label->kind == STATEMENT_LABEL) {
8834 /* Eat an empty statement here, to avoid the warning about an empty
8835 * statement after a label. label:; is commonly used to have a label
8836 * before a closing brace. */
8837 inner_stmt = create_empty_statement();
8844 inner_stmt = parse_statement();
8845 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
8846 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
8847 if (inner_stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
8848 errorf(&inner_stmt->base.pos, "declaration after %s", label_kind);
8856 * Parse a case statement.
8858 static statement_t *parse_case_statement(void)
8860 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
8861 position_t *const pos = &statement->base.pos;
8864 add_anchor_token(':');
8866 expression_t *expression = parse_expression();
8867 type_t *expression_type = expression->base.type;
8868 type_t *skipped = skip_typeref(expression_type);
8869 if (!is_type_integer(skipped) && is_type_valid(skipped)) {
8870 errorf(pos, "case expression '%E' must have integer type but has type '%T'",
8871 expression, expression_type);
8874 type_t *type = expression_type;
8875 if (current_switch != NULL) {
8876 type_t *switch_type = current_switch->expression->base.type;
8877 if (is_type_valid(switch_type)) {
8878 expression = create_implicit_cast(expression, switch_type);
8882 statement->case_label.expression = expression;
8883 expression_classification_t const expr_class = is_constant_expression(expression);
8884 if (expr_class != EXPR_CLASS_CONSTANT) {
8885 if (expr_class != EXPR_CLASS_ERROR) {
8886 errorf(pos, "case label does not reduce to an integer constant");
8888 statement->case_label.is_bad = true;
8890 ir_tarval *val = fold_constant_to_tarval(expression);
8891 statement->case_label.first_case = val;
8892 statement->case_label.last_case = val;
8896 if (accept(T_DOTDOTDOT)) {
8897 expression_t *end_range = parse_expression();
8898 expression_type = expression->base.type;
8899 skipped = skip_typeref(expression_type);
8900 if (!is_type_integer(skipped) && is_type_valid(skipped)) {
8901 errorf(pos, "case expression '%E' must have integer type but has type '%T'",
8902 expression, expression_type);
8905 end_range = create_implicit_cast(end_range, type);
8906 statement->case_label.end_range = end_range;
8907 expression_classification_t const end_class = is_constant_expression(end_range);
8908 if (end_class != EXPR_CLASS_CONSTANT) {
8909 if (end_class != EXPR_CLASS_ERROR) {
8910 errorf(pos, "case range does not reduce to an integer constant");
8912 statement->case_label.is_bad = true;
8914 ir_tarval *val = fold_constant_to_tarval(end_range);
8915 statement->case_label.last_case = val;
8917 if (tarval_cmp(val, statement->case_label.first_case)
8918 == ir_relation_less) {
8919 statement->case_label.is_empty_range = true;
8920 warningf(WARN_OTHER, pos, "empty range specified");
8926 PUSH_PARENT(statement);
8928 rem_anchor_token(':');
8931 if (current_switch != NULL) {
8932 if (! statement->case_label.is_bad) {
8933 /* Check for duplicate case values */
8934 case_label_statement_t *c = &statement->case_label;
8935 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
8936 if (l->is_bad || l->is_empty_range || l->expression == NULL)
8939 if (c->last_case < l->first_case || c->first_case > l->last_case)
8942 errorf(pos, "duplicate case value (previously used %P)",
8947 /* link all cases into the switch statement */
8948 if (current_switch->last_case == NULL) {
8949 current_switch->first_case = &statement->case_label;
8951 current_switch->last_case->next = &statement->case_label;
8953 current_switch->last_case = &statement->case_label;
8955 errorf(pos, "case label not within a switch statement");
8958 statement->case_label.statement = parse_label_inner_statement(statement, "case label");
8965 * Parse a default statement.
8967 static statement_t *parse_default_statement(void)
8969 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
8973 PUSH_PARENT(statement);
8977 if (current_switch != NULL) {
8978 const case_label_statement_t *def_label = current_switch->default_label;
8979 if (def_label != NULL) {
8980 errorf(&statement->base.pos, "multiple default labels in one switch (previous declared %P)", &def_label->base.pos);
8982 current_switch->default_label = &statement->case_label;
8984 /* link all cases into the switch statement */
8985 if (current_switch->last_case == NULL) {
8986 current_switch->first_case = &statement->case_label;
8988 current_switch->last_case->next = &statement->case_label;
8990 current_switch->last_case = &statement->case_label;
8993 errorf(&statement->base.pos,
8994 "'default' label not within a switch statement");
8997 statement->case_label.statement = parse_label_inner_statement(statement, "default label");
9004 * Parse a label statement.
9006 static statement_t *parse_label_statement(void)
9008 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9009 label_t *const label = get_label(NULL /* Cannot fail, token is T_IDENTIFIER. */);
9010 statement->label.label = label;
9012 PUSH_PARENT(statement);
9014 /* if statement is already set then the label is defined twice,
9015 * otherwise it was just mentioned in a goto/local label declaration so far
9017 position_t const* const pos = &statement->base.pos;
9018 if (label->statement != NULL) {
9019 errorf(pos, "duplicate '%N' (declared %P)", (entity_t const*)label, &label->base.pos);
9021 label->base.pos = *pos;
9022 label->statement = statement;
9023 label->n_users += 1;
9028 if (token.kind == T___attribute__ && !(c_mode & _CXX)) {
9029 parse_attributes(NULL); // TODO process attributes
9032 statement->label.statement = parse_label_inner_statement(statement, "label");
9034 /* remember the labels in a list for later checking */
9035 *label_anchor = &statement->label;
9036 label_anchor = &statement->label.next;
9042 static statement_t *parse_inner_statement(void)
9044 statement_t *const stmt = parse_statement();
9045 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
9046 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
9047 if (stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
9048 errorf(&stmt->base.pos, "declaration as inner statement, use {}");
9054 * Parse an expression in parentheses and mark its variables as read.
9056 static expression_t *parse_condition(void)
9058 add_anchor_token(')');
9060 expression_t *const expr = parse_expression();
9061 mark_vars_read(expr, NULL);
9062 rem_anchor_token(')');
9068 * Parse an if statement.
9070 static statement_t *parse_if(void)
9072 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9076 PUSH_PARENT(statement);
9077 PUSH_SCOPE_STATEMENT(&statement->ifs.scope);
9079 add_anchor_token(T_else);
9081 expression_t *const expr = parse_condition();
9082 statement->ifs.condition = expr;
9083 /* §6.8.4.1:1 The controlling expression of an if statement shall have
9085 semantic_condition(expr, "condition of 'if'-statment");
9087 statement_t *const true_stmt = parse_inner_statement();
9088 statement->ifs.true_statement = true_stmt;
9089 rem_anchor_token(T_else);
9091 if (true_stmt->kind == STATEMENT_EMPTY) {
9092 warningf(WARN_EMPTY_BODY, HERE,
9093 "suggest braces around empty body in an ‘if’ statement");
9096 if (accept(T_else)) {
9097 statement->ifs.false_statement = parse_inner_statement();
9099 if (statement->ifs.false_statement->kind == STATEMENT_EMPTY) {
9100 warningf(WARN_EMPTY_BODY, HERE,
9101 "suggest braces around empty body in an ‘if’ statement");
9103 } else if (true_stmt->kind == STATEMENT_IF &&
9104 true_stmt->ifs.false_statement != NULL) {
9105 position_t const *const pos = &true_stmt->base.pos;
9106 warningf(WARN_PARENTHESES, pos, "suggest explicit braces to avoid ambiguous 'else'");
9115 * Check that all enums are handled in a switch.
9117 * @param statement the switch statement to check
9119 static void check_enum_cases(const switch_statement_t *statement)
9121 if (!is_warn_on(WARN_SWITCH_ENUM))
9123 type_t *type = skip_typeref(statement->expression->base.type);
9124 if (! is_type_enum(type))
9126 enum_type_t *enumt = &type->enumt;
9128 /* if we have a default, no warnings */
9129 if (statement->default_label != NULL)
9132 determine_enum_values(enumt);
9134 /* FIXME: calculation of value should be done while parsing */
9135 /* TODO: quadratic algorithm here. Change to an n log n one */
9136 const entity_t *entry = enumt->enume->base.next;
9137 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9138 entry = entry->base.next) {
9139 ir_tarval *value = entry->enum_value.tv;
9141 for (const case_label_statement_t *l = statement->first_case; l != NULL;
9143 if (l->expression == NULL)
9145 if (l->first_case == l->last_case && l->first_case != value)
9147 if ((tarval_cmp(l->first_case, value) & ir_relation_less_equal)
9148 && (tarval_cmp(value, l->last_case) & ir_relation_less_equal)) {
9154 position_t const *const pos = &statement->base.pos;
9155 warningf(WARN_SWITCH_ENUM, pos, "'%N' not handled in switch", entry);
9161 * Parse a switch statement.
9163 static statement_t *parse_switch(void)
9165 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9169 PUSH_PARENT(statement);
9170 PUSH_SCOPE_STATEMENT(&statement->switchs.scope);
9172 expression_t *const expr = parse_condition();
9173 type_t * type = skip_typeref(expr->base.type);
9174 if (is_type_integer(type)) {
9175 type = promote_integer(type);
9176 if (get_akind_rank(get_akind(type)) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9177 warningf(WARN_TRADITIONAL, &expr->base.pos,
9178 "'%T' switch expression not converted to '%T' in ISO C",
9181 } else if (is_type_valid(type)) {
9182 errorf(&expr->base.pos, "switch quantity is not an integer, but '%T'",
9184 type = type_error_type;
9186 statement->switchs.expression = create_implicit_cast(expr, type);
9188 switch_statement_t *rem = current_switch;
9189 current_switch = &statement->switchs;
9190 statement->switchs.body = parse_inner_statement();
9191 current_switch = rem;
9193 if (statement->switchs.default_label == NULL) {
9194 warningf(WARN_SWITCH_DEFAULT, &statement->base.pos, "switch has no default case");
9196 check_enum_cases(&statement->switchs);
9203 static statement_t *parse_loop_body(statement_t *const loop)
9205 statement_t *const rem = current_loop;
9206 current_loop = loop;
9208 statement_t *const body = parse_inner_statement();
9215 * Parse a while statement.
9217 static statement_t *parse_while(void)
9219 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9223 PUSH_PARENT(statement);
9224 PUSH_SCOPE_STATEMENT(&statement->fors.scope);
9226 expression_t *const cond = parse_condition();
9227 statement->fors.condition = cond;
9228 /* §6.8.5:2 The controlling expression of an iteration statement shall
9229 * have scalar type. */
9230 semantic_condition(cond, "condition of 'while'-statement");
9232 statement->fors.body = parse_loop_body(statement);
9240 * Parse a do statement.
9242 static statement_t *parse_do(void)
9244 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9248 PUSH_PARENT(statement);
9249 PUSH_SCOPE_STATEMENT(&statement->do_while.scope);
9251 add_anchor_token(T_while);
9252 statement->do_while.body = parse_loop_body(statement);
9253 rem_anchor_token(T_while);
9256 expression_t *const cond = parse_condition();
9257 statement->do_while.condition = cond;
9258 /* §6.8.5:2 The controlling expression of an iteration statement shall
9259 * have scalar type. */
9260 semantic_condition(cond, "condition of 'do-while'-statement");
9269 * Parse a for statement.
9271 static statement_t *parse_for(void)
9273 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9277 PUSH_PARENT(statement);
9278 PUSH_SCOPE_STATEMENT(&statement->fors.scope);
9280 add_anchor_token(')');
9286 } else if (is_declaration_specifier(&token)) {
9287 parse_declaration(record_entity, DECL_FLAGS_NONE);
9289 add_anchor_token(';');
9290 expression_t *const init = parse_expression();
9291 statement->fors.initialisation = init;
9292 mark_vars_read(init, ENT_ANY);
9293 if (!expression_has_effect(init)) {
9294 warningf(WARN_UNUSED_VALUE, &init->base.pos, "initialisation of 'for'-statement has no effect");
9296 rem_anchor_token(';');
9302 if (token.kind != ';') {
9303 add_anchor_token(';');
9304 expression_t *const cond = parse_expression();
9305 statement->fors.condition = cond;
9306 /* §6.8.5:2 The controlling expression of an iteration statement
9307 * shall have scalar type. */
9308 semantic_condition(cond, "condition of 'for'-statement");
9309 mark_vars_read(cond, NULL);
9310 rem_anchor_token(';');
9313 if (token.kind != ')') {
9314 expression_t *const step = parse_expression();
9315 statement->fors.step = step;
9316 mark_vars_read(step, ENT_ANY);
9317 if (!expression_has_effect(step)) {
9318 warningf(WARN_UNUSED_VALUE, &step->base.pos, "step of 'for'-statement has no effect");
9321 rem_anchor_token(')');
9323 statement->fors.body = parse_loop_body(statement);
9331 * Parse a goto statement.
9333 static statement_t *parse_goto(void)
9335 statement_t *statement;
9336 if (GNU_MODE && look_ahead(1)->kind == '*') {
9337 statement = allocate_statement_zero(STATEMENT_COMPUTED_GOTO);
9341 expression_t *expression = parse_expression();
9342 mark_vars_read(expression, NULL);
9344 /* Argh: although documentation says the expression must be of type void*,
9345 * gcc accepts anything that can be casted into void* without error */
9346 type_t *type = expression->base.type;
9348 if (type != type_error_type) {
9349 if (!is_type_pointer(type) && !is_type_integer(type)) {
9350 errorf(&expression->base.pos, "cannot convert to a pointer type");
9351 } else if (type != type_void_ptr) {
9352 warningf(WARN_OTHER, &expression->base.pos, "type of computed goto expression should be 'void*' not '%T'", type);
9354 expression = create_implicit_cast(expression, type_void_ptr);
9357 statement->computed_goto.expression = expression;
9359 statement = allocate_statement_zero(STATEMENT_GOTO);
9362 label_t *const label = get_label("while parsing goto");
9364 label->n_users += 1;
9366 statement->gotos.label = label;
9368 /* remember the goto's in a list for later checking */
9369 *goto_anchor = &statement->gotos;
9370 goto_anchor = &statement->gotos.next;
9372 statement->gotos.label = &allocate_entity_zero(ENTITY_LABEL, NAMESPACE_LABEL, sym_anonymous, &builtin_position)->label;
9381 * Parse a continue statement.
9383 static statement_t *parse_continue(void)
9385 if (current_loop == NULL) {
9386 errorf(HERE, "continue statement not within loop");
9389 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9397 * Parse a break statement.
9399 static statement_t *parse_break(void)
9401 if (current_switch == NULL && current_loop == NULL) {
9402 errorf(HERE, "break statement not within loop or switch");
9405 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9413 * Parse a __leave statement.
9415 static statement_t *parse_leave_statement(void)
9417 if (current_try == NULL) {
9418 errorf(HERE, "__leave statement not within __try");
9421 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9429 * Check if a given entity represents a local variable.
9431 static bool is_local_variable(const entity_t *entity)
9433 if (entity->kind != ENTITY_VARIABLE)
9436 switch ((storage_class_tag_t) entity->declaration.storage_class) {
9437 case STORAGE_CLASS_AUTO:
9438 case STORAGE_CLASS_REGISTER: {
9439 const type_t *type = skip_typeref(entity->declaration.type);
9440 if (is_type_function(type)) {
9452 * Check if a given expression represents a local variable.
9454 static bool expression_is_local_variable(const expression_t *expression)
9456 if (expression->base.kind != EXPR_REFERENCE) {
9459 const entity_t *entity = expression->reference.entity;
9460 return is_local_variable(entity);
9463 static void err_or_warn(position_t const *const pos, char const *const msg)
9465 if (c_mode & _CXX || strict_mode) {
9468 warningf(WARN_OTHER, pos, msg);
9473 * Parse a return statement.
9475 static statement_t *parse_return(void)
9477 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9480 expression_t *return_value = NULL;
9481 if (token.kind != ';') {
9482 return_value = parse_expression();
9483 mark_vars_read(return_value, NULL);
9486 const type_t *const func_type = skip_typeref(current_function->base.type);
9487 assert(is_type_function(func_type));
9488 type_t *const return_type = skip_typeref(func_type->function.return_type);
9490 position_t const *const pos = &statement->base.pos;
9491 if (return_value != NULL) {
9492 type_t *return_value_type = skip_typeref(return_value->base.type);
9494 if (is_type_void(return_type)) {
9495 if (!is_type_void(return_value_type)) {
9496 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
9497 /* Only warn in C mode, because GCC does the same */
9498 err_or_warn(pos, "'return' with a value, in function returning 'void'");
9499 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9500 /* Only warn in C mode, because GCC does the same */
9501 err_or_warn(pos, "'return' with expression in function returning 'void'");
9504 assign_error_t error = semantic_assign(return_type, return_value);
9505 report_assign_error(error, return_type, return_value, "'return'",
9508 return_value = create_implicit_cast(return_value, return_type);
9509 /* check for returning address of a local var */
9510 if (return_value != NULL && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
9511 const expression_t *expression = return_value->unary.value;
9512 if (expression_is_local_variable(expression)) {
9513 warningf(WARN_OTHER, pos, "function returns address of local variable");
9516 } else if (!is_type_void(return_type)) {
9517 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9518 err_or_warn(pos, "'return' without value, in function returning non-void");
9520 statement->returns.value = return_value;
9527 * Parse a declaration statement.
9529 static statement_t *parse_declaration_statement(void)
9531 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9533 entity_t *before = current_scope->last_entity;
9535 parse_external_declaration();
9537 parse_declaration(record_entity, DECL_FLAGS_NONE);
9540 declaration_statement_t *const decl = &statement->declaration;
9541 entity_t *const begin =
9542 before != NULL ? before->base.next : current_scope->entities;
9543 decl->declarations_begin = begin;
9544 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
9550 * Parse an expression statement, i.e. expr ';'.
9552 static statement_t *parse_expression_statement(void)
9554 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
9556 expression_t *const expr = parse_expression();
9557 statement->expression.expression = expr;
9558 mark_vars_read(expr, ENT_ANY);
9565 * Parse a microsoft __try { } __finally { } or
9566 * __try{ } __except() { }
9568 static statement_t *parse_ms_try_statment(void)
9570 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
9573 PUSH_PARENT(statement);
9575 ms_try_statement_t *rem = current_try;
9576 current_try = &statement->ms_try;
9577 statement->ms_try.try_statement = parse_compound_statement(false);
9582 if (accept(T___except)) {
9583 expression_t *const expr = parse_condition();
9584 type_t * type = skip_typeref(expr->base.type);
9585 if (is_type_integer(type)) {
9586 type = promote_integer(type);
9587 } else if (is_type_valid(type)) {
9588 errorf(&expr->base.pos,
9589 "__expect expression is not an integer, but '%T'", type);
9590 type = type_error_type;
9592 statement->ms_try.except_expression = create_implicit_cast(expr, type);
9593 } else if (!accept(T__finally)) {
9594 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
9596 statement->ms_try.final_statement = parse_compound_statement(false);
9600 static statement_t *parse_empty_statement(void)
9602 warningf(WARN_EMPTY_STATEMENT, HERE, "statement is empty");
9603 statement_t *const statement = create_empty_statement();
9608 static statement_t *parse_local_label_declaration(void)
9610 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9614 entity_t *begin = NULL;
9615 entity_t *end = NULL;
9616 entity_t **anchor = &begin;
9617 add_anchor_token(';');
9618 add_anchor_token(',');
9621 symbol_t *const symbol = expect_identifier("while parsing local label declaration", &pos);
9623 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
9624 if (entity != NULL && entity->base.parent_scope == current_scope) {
9625 position_t const *const ppos = &entity->base.pos;
9626 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
9628 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL, NAMESPACE_LABEL, symbol, &pos);
9629 entity->base.parent_scope = current_scope;
9632 anchor = &entity->base.next;
9635 environment_push(entity);
9638 } while (accept(','));
9639 rem_anchor_token(',');
9640 rem_anchor_token(';');
9642 statement->declaration.declarations_begin = begin;
9643 statement->declaration.declarations_end = end;
9647 static void parse_namespace_definition(void)
9651 entity_t *entity = NULL;
9652 symbol_t *symbol = NULL;
9654 if (token.kind == T_IDENTIFIER) {
9655 symbol = token.base.symbol;
9656 entity = get_entity(symbol, NAMESPACE_NORMAL);
9657 if (entity && entity->kind != ENTITY_NAMESPACE) {
9659 if (entity->base.parent_scope == current_scope && is_entity_valid(entity)) {
9660 error_redefined_as_different_kind(HERE, entity, ENTITY_NAMESPACE);
9666 if (entity == NULL) {
9667 entity = allocate_entity_zero(ENTITY_NAMESPACE, NAMESPACE_NORMAL, symbol, HERE);
9668 entity->base.parent_scope = current_scope;
9671 if (token.kind == '=') {
9672 /* TODO: parse namespace alias */
9673 panic("namespace alias definition not supported yet");
9676 environment_push(entity);
9677 append_entity(current_scope, entity);
9679 PUSH_SCOPE(&entity->namespacee.members);
9680 PUSH_CURRENT_ENTITY(entity);
9682 add_anchor_token('}');
9685 rem_anchor_token('}');
9688 POP_CURRENT_ENTITY();
9693 * Parse a statement.
9694 * There's also parse_statement() which additionally checks for
9695 * "statement has no effect" warnings
9697 static statement_t *intern_parse_statement(void)
9699 /* declaration or statement */
9700 statement_t *statement;
9701 switch (token.kind) {
9702 case T_IDENTIFIER: {
9703 token_kind_t la1_type = (token_kind_t)look_ahead(1)->kind;
9704 if (la1_type == ':') {
9705 statement = parse_label_statement();
9706 } else if (is_typedef_symbol(token.base.symbol)) {
9707 statement = parse_declaration_statement();
9709 /* it's an identifier, the grammar says this must be an
9710 * expression statement. However it is common that users mistype
9711 * declaration types, so we guess a bit here to improve robustness
9712 * for incorrect programs */
9716 if (get_entity(token.base.symbol, NAMESPACE_NORMAL) != NULL) {
9718 statement = parse_expression_statement();
9722 statement = parse_declaration_statement();
9730 case T___extension__: {
9731 /* This can be a prefix to a declaration or an expression statement.
9732 * We simply eat it now and parse the rest with tail recursion. */
9734 statement = intern_parse_statement();
9740 statement = parse_declaration_statement();
9744 statement = parse_local_label_declaration();
9747 case ';': statement = parse_empty_statement(); break;
9748 case '{': statement = parse_compound_statement(false); break;
9749 case T___leave: statement = parse_leave_statement(); break;
9750 case T___try: statement = parse_ms_try_statment(); break;
9751 case T_asm: statement = parse_asm_statement(); break;
9752 case T_break: statement = parse_break(); break;
9753 case T_case: statement = parse_case_statement(); break;
9754 case T_continue: statement = parse_continue(); break;
9755 case T_default: statement = parse_default_statement(); break;
9756 case T_do: statement = parse_do(); break;
9757 case T_for: statement = parse_for(); break;
9758 case T_goto: statement = parse_goto(); break;
9759 case T_if: statement = parse_if(); break;
9760 case T_return: statement = parse_return(); break;
9761 case T_switch: statement = parse_switch(); break;
9762 case T_while: statement = parse_while(); break;
9765 statement = parse_expression_statement();
9769 errorf(HERE, "unexpected token %K while parsing statement", &token);
9770 statement = create_error_statement();
9779 * parse a statement and emits "statement has no effect" warning if needed
9780 * (This is really a wrapper around intern_parse_statement with check for 1
9781 * single warning. It is needed, because for statement expressions we have
9782 * to avoid the warning on the last statement)
9784 static statement_t *parse_statement(void)
9786 statement_t *statement = intern_parse_statement();
9788 if (statement->kind == STATEMENT_EXPRESSION) {
9789 expression_t *expression = statement->expression.expression;
9790 if (!expression_has_effect(expression)) {
9791 warningf(WARN_UNUSED_VALUE, &expression->base.pos,
9792 "statement has no effect");
9800 * Parse a compound statement.
9802 static statement_t *parse_compound_statement(bool inside_expression_statement)
9804 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
9806 PUSH_PARENT(statement);
9807 PUSH_SCOPE(&statement->compound.scope);
9810 add_anchor_token('}');
9811 /* tokens, which can start a statement */
9812 /* TODO MS, __builtin_FOO */
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('~');
9822 add_anchor_token(T_CHARACTER_CONSTANT);
9823 add_anchor_token(T_COLONCOLON);
9824 add_anchor_token(T_IDENTIFIER);
9825 add_anchor_token(T_MINUSMINUS);
9826 add_anchor_token(T_NUMBER);
9827 add_anchor_token(T_PLUSPLUS);
9828 add_anchor_token(T_STRING_LITERAL);
9829 add_anchor_token(T__Alignof);
9830 add_anchor_token(T__Bool);
9831 add_anchor_token(T__Complex);
9832 add_anchor_token(T__Imaginary);
9833 add_anchor_token(T__Thread_local);
9834 add_anchor_token(T___PRETTY_FUNCTION__);
9835 add_anchor_token(T___attribute__);
9836 add_anchor_token(T___builtin_va_start);
9837 add_anchor_token(T___extension__);
9838 add_anchor_token(T___func__);
9839 add_anchor_token(T___imag__);
9840 add_anchor_token(T___label__);
9841 add_anchor_token(T___real__);
9842 add_anchor_token(T_asm);
9843 add_anchor_token(T_auto);
9844 add_anchor_token(T_bool);
9845 add_anchor_token(T_break);
9846 add_anchor_token(T_case);
9847 add_anchor_token(T_char);
9848 add_anchor_token(T_class);
9849 add_anchor_token(T_const);
9850 add_anchor_token(T_const_cast);
9851 add_anchor_token(T_continue);
9852 add_anchor_token(T_default);
9853 add_anchor_token(T_delete);
9854 add_anchor_token(T_double);
9855 add_anchor_token(T_do);
9856 add_anchor_token(T_dynamic_cast);
9857 add_anchor_token(T_enum);
9858 add_anchor_token(T_extern);
9859 add_anchor_token(T_false);
9860 add_anchor_token(T_float);
9861 add_anchor_token(T_for);
9862 add_anchor_token(T_goto);
9863 add_anchor_token(T_if);
9864 add_anchor_token(T_inline);
9865 add_anchor_token(T_int);
9866 add_anchor_token(T_long);
9867 add_anchor_token(T_new);
9868 add_anchor_token(T_operator);
9869 add_anchor_token(T_register);
9870 add_anchor_token(T_reinterpret_cast);
9871 add_anchor_token(T_restrict);
9872 add_anchor_token(T_return);
9873 add_anchor_token(T_short);
9874 add_anchor_token(T_signed);
9875 add_anchor_token(T_sizeof);
9876 add_anchor_token(T_static);
9877 add_anchor_token(T_static_cast);
9878 add_anchor_token(T_struct);
9879 add_anchor_token(T_switch);
9880 add_anchor_token(T_template);
9881 add_anchor_token(T_this);
9882 add_anchor_token(T_throw);
9883 add_anchor_token(T_true);
9884 add_anchor_token(T_try);
9885 add_anchor_token(T_typedef);
9886 add_anchor_token(T_typeid);
9887 add_anchor_token(T_typename);
9888 add_anchor_token(T_typeof);
9889 add_anchor_token(T_union);
9890 add_anchor_token(T_unsigned);
9891 add_anchor_token(T_using);
9892 add_anchor_token(T_void);
9893 add_anchor_token(T_volatile);
9894 add_anchor_token(T_wchar_t);
9895 add_anchor_token(T_while);
9897 statement_t **anchor = &statement->compound.statements;
9898 bool only_decls_so_far = true;
9899 while (token.kind != '}' && token.kind != T_EOF) {
9900 statement_t *sub_statement = intern_parse_statement();
9901 if (sub_statement->kind == STATEMENT_ERROR) {
9905 if (sub_statement->kind != STATEMENT_DECLARATION) {
9906 only_decls_so_far = false;
9907 } else if (!only_decls_so_far) {
9908 position_t const *const pos = &sub_statement->base.pos;
9909 warningf(WARN_DECLARATION_AFTER_STATEMENT, pos, "ISO C90 forbids mixed declarations and code");
9912 *anchor = sub_statement;
9913 anchor = &sub_statement->base.next;
9917 /* look over all statements again to produce no effect warnings */
9918 if (is_warn_on(WARN_UNUSED_VALUE)) {
9919 statement_t *sub_statement = statement->compound.statements;
9920 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
9921 if (sub_statement->kind != STATEMENT_EXPRESSION)
9923 /* don't emit a warning for the last expression in an expression
9924 * statement as it has always an effect */
9925 if (inside_expression_statement && sub_statement->base.next == NULL)
9928 expression_t *expression = sub_statement->expression.expression;
9929 if (!expression_has_effect(expression)) {
9930 warningf(WARN_UNUSED_VALUE, &expression->base.pos,
9931 "statement has no effect");
9936 rem_anchor_token(T_while);
9937 rem_anchor_token(T_wchar_t);
9938 rem_anchor_token(T_volatile);
9939 rem_anchor_token(T_void);
9940 rem_anchor_token(T_using);
9941 rem_anchor_token(T_unsigned);
9942 rem_anchor_token(T_union);
9943 rem_anchor_token(T_typeof);
9944 rem_anchor_token(T_typename);
9945 rem_anchor_token(T_typeid);
9946 rem_anchor_token(T_typedef);
9947 rem_anchor_token(T_try);
9948 rem_anchor_token(T_true);
9949 rem_anchor_token(T_throw);
9950 rem_anchor_token(T_this);
9951 rem_anchor_token(T_template);
9952 rem_anchor_token(T_switch);
9953 rem_anchor_token(T_struct);
9954 rem_anchor_token(T_static_cast);
9955 rem_anchor_token(T_static);
9956 rem_anchor_token(T_sizeof);
9957 rem_anchor_token(T_signed);
9958 rem_anchor_token(T_short);
9959 rem_anchor_token(T_return);
9960 rem_anchor_token(T_restrict);
9961 rem_anchor_token(T_reinterpret_cast);
9962 rem_anchor_token(T_register);
9963 rem_anchor_token(T_operator);
9964 rem_anchor_token(T_new);
9965 rem_anchor_token(T_long);
9966 rem_anchor_token(T_int);
9967 rem_anchor_token(T_inline);
9968 rem_anchor_token(T_if);
9969 rem_anchor_token(T_goto);
9970 rem_anchor_token(T_for);
9971 rem_anchor_token(T_float);
9972 rem_anchor_token(T_false);
9973 rem_anchor_token(T_extern);
9974 rem_anchor_token(T_enum);
9975 rem_anchor_token(T_dynamic_cast);
9976 rem_anchor_token(T_do);
9977 rem_anchor_token(T_double);
9978 rem_anchor_token(T_delete);
9979 rem_anchor_token(T_default);
9980 rem_anchor_token(T_continue);
9981 rem_anchor_token(T_const_cast);
9982 rem_anchor_token(T_const);
9983 rem_anchor_token(T_class);
9984 rem_anchor_token(T_char);
9985 rem_anchor_token(T_case);
9986 rem_anchor_token(T_break);
9987 rem_anchor_token(T_bool);
9988 rem_anchor_token(T_auto);
9989 rem_anchor_token(T_asm);
9990 rem_anchor_token(T___real__);
9991 rem_anchor_token(T___label__);
9992 rem_anchor_token(T___imag__);
9993 rem_anchor_token(T___func__);
9994 rem_anchor_token(T___extension__);
9995 rem_anchor_token(T___builtin_va_start);
9996 rem_anchor_token(T___attribute__);
9997 rem_anchor_token(T___PRETTY_FUNCTION__);
9998 rem_anchor_token(T__Thread_local);
9999 rem_anchor_token(T__Imaginary);
10000 rem_anchor_token(T__Complex);
10001 rem_anchor_token(T__Bool);
10002 rem_anchor_token(T__Alignof);
10003 rem_anchor_token(T_STRING_LITERAL);
10004 rem_anchor_token(T_PLUSPLUS);
10005 rem_anchor_token(T_NUMBER);
10006 rem_anchor_token(T_MINUSMINUS);
10007 rem_anchor_token(T_IDENTIFIER);
10008 rem_anchor_token(T_COLONCOLON);
10009 rem_anchor_token(T_CHARACTER_CONSTANT);
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('!');
10019 rem_anchor_token('}');
10027 * Check for unused global static functions and variables
10029 static void check_unused_globals(void)
10031 if (!is_warn_on(WARN_UNUSED_FUNCTION) && !is_warn_on(WARN_UNUSED_VARIABLE))
10034 for (const entity_t *entity = file_scope->entities; entity != NULL;
10035 entity = entity->base.next) {
10036 if (!is_declaration(entity))
10039 const declaration_t *declaration = &entity->declaration;
10040 if (declaration->used ||
10041 declaration->modifiers & DM_UNUSED ||
10042 declaration->modifiers & DM_USED ||
10043 declaration->storage_class != STORAGE_CLASS_STATIC)
10048 if (entity->kind == ENTITY_FUNCTION) {
10049 /* inhibit warning for static inline functions */
10050 if (entity->function.is_inline)
10053 why = WARN_UNUSED_FUNCTION;
10054 s = entity->function.body != NULL ? "defined" : "declared";
10056 why = WARN_UNUSED_VARIABLE;
10060 warningf(why, &declaration->base.pos, "'%#N' %s but not used", entity, s);
10064 static void parse_global_asm(void)
10066 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10069 add_anchor_token(';');
10070 add_anchor_token(')');
10071 add_anchor_token(T_STRING_LITERAL);
10074 rem_anchor_token(T_STRING_LITERAL);
10075 statement->asms.asm_text = parse_string_literals("global asm");
10076 statement->base.next = unit->global_asm;
10077 unit->global_asm = statement;
10079 rem_anchor_token(')');
10081 rem_anchor_token(';');
10085 static void parse_linkage_specification(void)
10089 position_t const pos = *HERE;
10090 char const *const linkage = parse_string_literals(NULL).begin;
10092 linkage_kind_t old_linkage = current_linkage;
10093 linkage_kind_t new_linkage;
10094 if (streq(linkage, "C")) {
10095 new_linkage = LINKAGE_C;
10096 } else if (streq(linkage, "C++")) {
10097 new_linkage = LINKAGE_CXX;
10099 errorf(&pos, "linkage string \"%s\" not recognized", linkage);
10100 new_linkage = LINKAGE_C;
10102 current_linkage = new_linkage;
10111 assert(current_linkage == new_linkage);
10112 current_linkage = old_linkage;
10115 static void parse_external(void)
10117 switch (token.kind) {
10119 if (look_ahead(1)->kind == T_STRING_LITERAL) {
10120 parse_linkage_specification();
10122 DECLARATION_START_NO_EXTERN
10124 case T___extension__:
10125 /* tokens below are for implicit int */
10126 case '&': /* & x; -> int& x; (and error later, because C++ has no
10128 case '*': /* * x; -> int* x; */
10129 case '(': /* (x); -> int (x); */
10131 parse_external_declaration();
10137 parse_global_asm();
10141 parse_namespace_definition();
10145 if (!strict_mode) {
10146 warningf(WARN_STRAY_SEMICOLON, HERE, "stray ';' outside of function");
10153 errorf(HERE, "stray %K outside of function", &token);
10154 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10155 eat_until_matching_token(token.kind);
10161 static void parse_externals(void)
10163 add_anchor_token('}');
10164 add_anchor_token(T_EOF);
10167 /* make a copy of the anchor set, so we can check if it is restored after parsing */
10168 unsigned short token_anchor_copy[T_LAST_TOKEN];
10169 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10172 while (token.kind != T_EOF && token.kind != '}') {
10174 for (int i = 0; i < T_LAST_TOKEN; ++i) {
10175 unsigned short count = token_anchor_set[i] - token_anchor_copy[i];
10177 /* the anchor set and its copy differs */
10178 internal_errorf(HERE, "Leaked anchor token %k %d times", i, count);
10181 if (in_gcc_extension) {
10182 /* an gcc extension scope was not closed */
10183 internal_errorf(HERE, "Leaked __extension__");
10190 rem_anchor_token(T_EOF);
10191 rem_anchor_token('}');
10195 * Parse a translation unit.
10197 static void parse_translation_unit(void)
10199 add_anchor_token(T_EOF);
10204 if (token.kind == T_EOF)
10207 errorf(HERE, "stray %K outside of function", &token);
10208 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10209 eat_until_matching_token(token.kind);
10214 void set_default_visibility(elf_visibility_tag_t visibility)
10216 default_visibility = visibility;
10222 * @return the translation unit or NULL if errors occurred.
10224 void start_parsing(void)
10226 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10227 label_stack = NEW_ARR_F(stack_entry_t, 0);
10229 print_to_file(stderr);
10231 assert(unit == NULL);
10232 unit = allocate_ast_zero(sizeof(unit[0]));
10234 assert(file_scope == NULL);
10235 file_scope = &unit->scope;
10237 assert(current_scope == NULL);
10238 scope_push(&unit->scope);
10240 create_gnu_builtins();
10242 create_microsoft_intrinsics();
10245 translation_unit_t *finish_parsing(void)
10247 assert(current_scope == &unit->scope);
10250 assert(file_scope == &unit->scope);
10251 check_unused_globals();
10254 DEL_ARR_F(environment_stack);
10255 DEL_ARR_F(label_stack);
10257 translation_unit_t *result = unit;
10262 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
10263 * are given length one. */
10264 static void complete_incomplete_arrays(void)
10266 size_t n = ARR_LEN(incomplete_arrays);
10267 for (size_t i = 0; i != n; ++i) {
10268 declaration_t *const decl = incomplete_arrays[i];
10269 type_t *const type = skip_typeref(decl->type);
10271 if (!is_type_incomplete(type))
10274 position_t const *const pos = &decl->base.pos;
10275 warningf(WARN_OTHER, pos, "array '%#N' assumed to have one element", (entity_t const*)decl);
10277 type_t *const new_type = duplicate_type(type);
10278 new_type->array.size_constant = true;
10279 new_type->array.has_implicit_size = true;
10280 new_type->array.size = 1;
10282 type_t *const result = identify_new_type(new_type);
10284 decl->type = result;
10288 static void prepare_main_collect2(entity_t *const entity)
10290 PUSH_SCOPE(&entity->function.body->compound.scope);
10292 // create call to __main
10293 symbol_t *symbol = symbol_table_insert("__main");
10294 entity_t *subsubmain_ent
10295 = create_implicit_function(symbol, &builtin_position);
10297 expression_t *ref = allocate_expression_zero(EXPR_REFERENCE);
10298 type_t *ftype = subsubmain_ent->declaration.type;
10299 ref->base.pos = builtin_position;
10300 ref->base.type = make_pointer_type(ftype, TYPE_QUALIFIER_NONE);
10301 ref->reference.entity = subsubmain_ent;
10303 expression_t *call = allocate_expression_zero(EXPR_CALL);
10304 call->base.pos = builtin_position;
10305 call->base.type = type_void;
10306 call->call.function = ref;
10308 statement_t *expr_statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10309 expr_statement->base.pos = builtin_position;
10310 expr_statement->expression.expression = call;
10312 statement_t *const body = entity->function.body;
10313 assert(body->kind == STATEMENT_COMPOUND);
10314 compound_statement_t *compounds = &body->compound;
10316 expr_statement->base.next = compounds->statements;
10317 compounds->statements = expr_statement;
10324 lookahead_bufpos = 0;
10325 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10328 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
10329 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
10330 parse_translation_unit();
10331 complete_incomplete_arrays();
10332 DEL_ARR_F(incomplete_arrays);
10333 incomplete_arrays = NULL;
10337 * Initialize the parser.
10339 void init_parser(void)
10341 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10343 init_expression_parsers();
10344 obstack_init(&temp_obst);
10348 * Terminate the parser.
10350 void exit_parser(void)
10352 obstack_free(&temp_obst, NULL);