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,
179 #define STORAGE_CLASSES \
180 STORAGE_CLASSES_NO_EXTERN \
183 #define STORAGE_CLASSES_NO_EXTERN \
188 case T__Thread_local:
190 #define TYPE_QUALIFIERS \
195 case T__forceinline: \
196 case T___attribute__:
198 #define COMPLEX_SPECIFIERS \
200 #define IMAGINARY_SPECIFIERS \
203 #define TYPE_SPECIFIERS \
205 case T___builtin_va_list: \
230 #define DECLARATION_START \
235 #define DECLARATION_START_NO_EXTERN \
236 STORAGE_CLASSES_NO_EXTERN \
240 #define EXPRESSION_START \
249 case T_CHARACTER_CONSTANT: \
253 case T_STRING_LITERAL: \
255 case T___FUNCDNAME__: \
256 case T___FUNCSIG__: \
257 case T___PRETTY_FUNCTION__: \
258 case T___builtin_classify_type: \
259 case T___builtin_constant_p: \
260 case T___builtin_isgreater: \
261 case T___builtin_isgreaterequal: \
262 case T___builtin_isless: \
263 case T___builtin_islessequal: \
264 case T___builtin_islessgreater: \
265 case T___builtin_isunordered: \
266 case T___builtin_offsetof: \
267 case T___builtin_va_arg: \
268 case T___builtin_va_copy: \
269 case T___builtin_va_start: \
282 * Returns the size of a statement node.
284 * @param kind the statement kind
286 static size_t get_statement_struct_size(statement_kind_t kind)
288 static const size_t sizes[] = {
289 [STATEMENT_ERROR] = sizeof(statement_base_t),
290 [STATEMENT_EMPTY] = sizeof(statement_base_t),
291 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
292 [STATEMENT_RETURN] = sizeof(return_statement_t),
293 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
294 [STATEMENT_IF] = sizeof(if_statement_t),
295 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
296 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
297 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
298 [STATEMENT_BREAK] = sizeof(statement_base_t),
299 [STATEMENT_COMPUTED_GOTO] = sizeof(computed_goto_statement_t),
300 [STATEMENT_GOTO] = sizeof(goto_statement_t),
301 [STATEMENT_LABEL] = sizeof(label_statement_t),
302 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
303 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
304 [STATEMENT_FOR] = sizeof(for_statement_t),
305 [STATEMENT_ASM] = sizeof(asm_statement_t),
306 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
307 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
309 assert((size_t)kind < lengthof(sizes));
310 assert(sizes[kind] != 0);
315 * Returns the size of an expression node.
317 * @param kind the expression kind
319 static size_t get_expression_struct_size(expression_kind_t kind)
321 static const size_t sizes[] = {
322 [EXPR_ERROR] = sizeof(expression_base_t),
323 [EXPR_REFERENCE] = sizeof(reference_expression_t),
324 [EXPR_ENUM_CONSTANT] = sizeof(reference_expression_t),
325 [EXPR_LITERAL_BOOLEAN] = sizeof(literal_expression_t),
326 [EXPR_LITERAL_INTEGER] = sizeof(literal_expression_t),
327 [EXPR_LITERAL_FLOATINGPOINT] = sizeof(literal_expression_t),
328 [EXPR_LITERAL_CHARACTER] = sizeof(string_literal_expression_t),
329 [EXPR_LITERAL_MS_NOOP] = sizeof(literal_expression_t),
330 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
331 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
332 [EXPR_CALL] = sizeof(call_expression_t),
333 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
334 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
335 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
336 [EXPR_SELECT] = sizeof(select_expression_t),
337 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
338 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
339 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
340 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
341 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
342 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
343 [EXPR_BUILTIN_TYPES_COMPATIBLE_P] = sizeof(builtin_types_compatible_expression_t),
344 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
345 [EXPR_VA_START] = sizeof(va_start_expression_t),
346 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
347 [EXPR_VA_COPY] = sizeof(va_copy_expression_t),
348 [EXPR_STATEMENT] = sizeof(statement_expression_t),
349 [EXPR_LABEL_ADDRESS] = sizeof(label_address_expression_t),
351 if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
352 return sizes[EXPR_UNARY_FIRST];
354 if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
355 return sizes[EXPR_BINARY_FIRST];
357 assert((size_t)kind < lengthof(sizes));
358 assert(sizes[kind] != 0);
363 * Allocate a statement node of given kind and initialize all
364 * fields with zero. Sets its source position to the position
365 * of the current token.
367 static statement_t *allocate_statement_zero(statement_kind_t kind)
369 size_t size = get_statement_struct_size(kind);
370 statement_t *res = allocate_ast_zero(size);
372 res->base.kind = kind;
373 res->base.parent = current_parent;
374 res->base.pos = *HERE;
379 * Allocate an expression node of given kind and initialize all
382 * @param kind the kind of the expression to allocate
384 static expression_t *allocate_expression_zero(expression_kind_t kind)
386 size_t size = get_expression_struct_size(kind);
387 expression_t *res = allocate_ast_zero(size);
389 res->base.kind = kind;
390 res->base.type = type_error_type;
391 res->base.pos = *HERE;
396 * Creates a new invalid expression at the source position
397 * of the current token.
399 static expression_t *create_error_expression(void)
401 expression_t *expression = allocate_expression_zero(EXPR_ERROR);
402 expression->base.type = type_error_type;
407 * Creates a new invalid statement.
409 static statement_t *create_error_statement(void)
411 return allocate_statement_zero(STATEMENT_ERROR);
415 * Allocate a new empty statement.
417 static statement_t *create_empty_statement(void)
419 return allocate_statement_zero(STATEMENT_EMPTY);
423 * Returns the size of an initializer node.
425 * @param kind the initializer kind
427 static size_t get_initializer_size(initializer_kind_t kind)
429 static const size_t sizes[] = {
430 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
431 [INITIALIZER_STRING] = sizeof(initializer_value_t),
432 [INITIALIZER_LIST] = sizeof(initializer_list_t),
433 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
435 assert((size_t)kind < lengthof(sizes));
436 assert(sizes[kind] != 0);
441 * Allocate an initializer node of given kind and initialize all
444 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
446 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
453 * Returns the index of the top element of the environment stack.
455 static size_t environment_top(void)
457 return ARR_LEN(environment_stack);
461 * Returns the index of the top element of the global label stack.
463 static size_t label_top(void)
465 return ARR_LEN(label_stack);
469 * Return the next token.
471 static inline void next_token(void)
473 token = lookahead_buffer[lookahead_bufpos];
474 lookahead_buffer[lookahead_bufpos] = pp_token;
475 next_preprocessing_token();
477 lookahead_bufpos = (lookahead_bufpos + 1) % MAX_LOOKAHEAD;
480 print_token(stderr, &token);
481 fprintf(stderr, "\n");
485 static inline void eat(token_kind_t const kind)
487 assert(token.kind == kind);
493 * Consume the current token, if it is of the expected kind.
495 * @param kind The kind of token to consume.
496 * @return Whether the token was consumed.
498 static inline bool accept(token_kind_t const kind)
500 if (token.kind == kind) {
509 * Return the next token with a given lookahead.
511 static inline const token_t *look_ahead(size_t num)
513 assert(0 < num && num <= MAX_LOOKAHEAD);
514 size_t pos = (lookahead_bufpos + num - 1) % MAX_LOOKAHEAD;
515 return &lookahead_buffer[pos];
519 * Adds a token type to the token type anchor set (a multi-set).
521 static void add_anchor_token(token_kind_t const token_kind)
523 assert(token_kind < T_LAST_TOKEN);
524 ++token_anchor_set[token_kind];
528 * Remove a token type from the token type anchor set (a multi-set).
530 static void rem_anchor_token(token_kind_t const token_kind)
532 assert(token_kind < T_LAST_TOKEN);
533 assert(token_anchor_set[token_kind] != 0);
534 --token_anchor_set[token_kind];
538 * Eat tokens until a matching token type is found.
540 static void eat_until_matching_token(token_kind_t const type)
542 token_kind_t end_token;
544 case '(': end_token = ')'; break;
545 case '{': end_token = '}'; break;
546 case '[': end_token = ']'; break;
547 default: end_token = type; break;
550 unsigned parenthesis_count = 0;
551 unsigned brace_count = 0;
552 unsigned bracket_count = 0;
553 while (token.kind != end_token ||
554 parenthesis_count != 0 ||
556 bracket_count != 0) {
557 switch (token.kind) {
559 case '(': ++parenthesis_count; break;
560 case '{': ++brace_count; break;
561 case '[': ++bracket_count; break;
564 if (parenthesis_count > 0)
574 if (bracket_count > 0)
577 if (token.kind == end_token &&
578 parenthesis_count == 0 &&
592 * Eat input tokens until an anchor is found.
594 static void eat_until_anchor(void)
596 while (token_anchor_set[token.kind] == 0) {
597 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
598 eat_until_matching_token(token.kind);
604 * Eat a whole block from input tokens.
606 static void eat_block(void)
608 eat_until_matching_token('{');
613 * Report a parse error because an expected token was not found.
616 #if defined __GNUC__ && __GNUC__ >= 4
617 __attribute__((sentinel))
619 void parse_error_expected(const char *message, ...)
621 if (message != NULL) {
622 errorf(HERE, "%s", message);
625 va_start(ap, message);
626 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
631 * Report an incompatible type.
633 static void type_error_incompatible(const char *msg,
634 const position_t *pos, type_t *type1, type_t *type2)
636 errorf(pos, "%s, incompatible types: '%T' - '%T'", msg, type1, type2);
639 static bool skip_till(token_kind_t const expected, char const *const context)
641 if (UNLIKELY(token.kind != expected)) {
642 parse_error_expected(context, expected, NULL);
643 add_anchor_token(expected);
645 rem_anchor_token(expected);
646 if (token.kind != expected)
653 * Expect the current token is the expected token.
654 * If not, generate an error and skip until the next anchor.
656 static void expect(token_kind_t const expected)
658 if (skip_till(expected, NULL))
662 static symbol_t *expect_identifier(char const *const context,
663 position_t *const pos)
665 if (!skip_till(T_IDENTIFIER, context))
667 symbol_t *const sym = token.base.symbol;
675 * Push a given scope on the scope stack and make it the
678 static scope_t *scope_push(scope_t *new_scope)
680 if (current_scope != NULL) {
681 new_scope->depth = current_scope->depth + 1;
684 scope_t *old_scope = current_scope;
685 current_scope = new_scope;
690 * Pop the current scope from the scope stack.
692 static void scope_pop(scope_t *old_scope)
694 current_scope = old_scope;
698 * Search an entity by its symbol in a given namespace.
700 static entity_t *get_entity(const symbol_t *const symbol,
701 namespace_tag_t namespc)
703 entity_t *entity = symbol->entity;
704 for (; entity != NULL; entity = entity->base.symbol_next) {
705 if ((namespace_tag_t)entity->base.namespc == namespc)
712 /* §6.2.3:1 24) There is only one name space for tags even though three are
714 static entity_t *get_tag(symbol_t const *const symbol,
715 entity_kind_tag_t const kind)
717 entity_t *entity = get_entity(symbol, NAMESPACE_TAG);
718 if (entity != NULL && (entity_kind_tag_t)entity->kind != kind) {
720 "'%Y' defined as wrong kind of tag (previous definition %P)",
721 symbol, &entity->base.pos);
728 * pushs an entity on the environment stack and links the corresponding symbol
731 static void stack_push(stack_entry_t **stack_ptr, entity_t *entity)
733 symbol_t *symbol = entity->base.symbol;
734 entity_namespace_t namespc = entity->base.namespc;
735 assert(namespc != 0);
737 /* replace/add entity into entity list of the symbol */
740 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
745 /* replace an entry? */
746 if (iter->base.namespc == namespc) {
747 entity->base.symbol_next = iter->base.symbol_next;
753 /* remember old declaration */
755 entry.symbol = symbol;
756 entry.old_entity = iter;
757 entry.namespc = namespc;
758 ARR_APP1(stack_entry_t, *stack_ptr, entry);
762 * Push an entity on the environment stack.
764 static void environment_push(entity_t *entity)
766 assert(entity->base.pos.input_name != NULL);
767 assert(entity->base.parent_scope != NULL);
768 stack_push(&environment_stack, entity);
772 * Push a declaration on the global label stack.
774 * @param declaration the declaration
776 static void label_push(entity_t *label)
778 /* we abuse the parameters scope as parent for the labels */
779 label->base.parent_scope = ¤t_function->parameters;
780 stack_push(&label_stack, label);
784 * pops symbols from the environment stack until @p new_top is the top element
786 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
788 stack_entry_t *stack = *stack_ptr;
789 size_t top = ARR_LEN(stack);
792 assert(new_top <= top);
796 for (i = top; i > new_top; --i) {
797 stack_entry_t *entry = &stack[i - 1];
799 entity_t *old_entity = entry->old_entity;
800 symbol_t *symbol = entry->symbol;
801 entity_namespace_t namespc = entry->namespc;
803 /* replace with old_entity/remove */
806 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
808 assert(iter != NULL);
809 /* replace an entry? */
810 if (iter->base.namespc == namespc)
814 /* restore definition from outer scopes (if there was one) */
815 if (old_entity != NULL) {
816 old_entity->base.symbol_next = iter->base.symbol_next;
817 *anchor = old_entity;
819 /* remove entry from list */
820 *anchor = iter->base.symbol_next;
824 ARR_SHRINKLEN(*stack_ptr, new_top);
828 * Pop all entries from the environment stack until the new_top
831 * @param new_top the new stack top
833 static void environment_pop_to(size_t new_top)
835 stack_pop_to(&environment_stack, new_top);
839 * Pop all entries from the global label stack until the new_top
842 * @param new_top the new stack top
844 static void label_pop_to(size_t new_top)
846 stack_pop_to(&label_stack, new_top);
850 * §6.3.1.1:2 Do integer promotion for a given type.
852 * @param type the type to promote
853 * @return the promoted type
855 static type_t *promote_integer(type_t *type)
857 atomic_type_kind_t akind = get_arithmetic_akind(type);
858 if (get_akind_rank(akind) < get_akind_rank(ATOMIC_TYPE_INT))
865 * Check if a given expression represents a null pointer constant.
867 * @param expression the expression to check
869 static bool is_null_pointer_constant(const expression_t *expression)
871 /* skip void* cast */
872 if (expression->kind == EXPR_UNARY_CAST) {
873 type_t *const type = skip_typeref(expression->base.type);
874 if (types_compatible(type, type_void_ptr))
875 expression = expression->unary.value;
878 type_t *const type = skip_typeref(expression->base.type);
879 if (!is_type_integer(type))
881 switch (is_constant_expression(expression)) {
882 case EXPR_CLASS_ERROR: return true;
883 case EXPR_CLASS_CONSTANT: return !fold_constant_to_bool(expression);
884 default: return false;
889 * Create an implicit cast expression.
891 * @param expression the expression to cast
892 * @param dest_type the destination type
894 static expression_t *create_implicit_cast(expression_t *expression,
897 type_t *const source_type = skip_typeref(expression->base.type);
898 if (source_type == skip_typeref(dest_type))
901 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
902 cast->unary.value = expression;
903 cast->base.type = dest_type;
904 cast->base.implicit = true;
909 typedef enum assign_error_t {
911 ASSIGN_ERROR_INCOMPATIBLE,
912 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
913 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
914 ASSIGN_WARNING_POINTER_FROM_INT,
915 ASSIGN_WARNING_INT_FROM_POINTER
918 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)
920 type_t *const orig_type_right = right->base.type;
921 type_t *const type_left = skip_typeref(orig_type_left);
922 type_t *const type_right = skip_typeref(orig_type_right);
927 case ASSIGN_ERROR_INCOMPATIBLE:
928 errorf(pos, "destination type '%T' in %s is incompatible with type '%T'", orig_type_left, context, orig_type_right);
931 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
932 type_t *points_to_left = skip_typeref(type_left->pointer.points_to);
933 type_t *points_to_right = skip_typeref(type_right->pointer.points_to);
935 /* the left type has all qualifiers from the right type */
936 unsigned missing_qualifiers = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
937 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);
941 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
942 warningf(WARN_OTHER, pos, "destination type '%T' in %s is incompatible with '%E' of type '%T'", orig_type_left, context, right, orig_type_right);
945 case ASSIGN_WARNING_POINTER_FROM_INT:
946 warningf(WARN_OTHER, pos, "%s makes pointer '%T' from integer '%T' without a cast", context, orig_type_left, orig_type_right);
949 case ASSIGN_WARNING_INT_FROM_POINTER:
950 warningf(WARN_OTHER, pos, "%s makes integer '%T' from pointer '%T' without a cast", context, orig_type_left, orig_type_right);
954 panic("invalid error value");
958 /** Implements the rules from §6.5.16.1 */
959 static assign_error_t semantic_assign(type_t *orig_type_left,
960 const expression_t *const right)
962 type_t *const orig_type_right = right->base.type;
963 type_t *const type_left = skip_typeref(orig_type_left);
964 type_t *const type_right = skip_typeref(orig_type_right);
966 if (is_type_pointer(type_left)) {
967 if (is_null_pointer_constant(right)) {
968 return ASSIGN_SUCCESS;
969 } else if (is_type_pointer(type_right)) {
970 type_t *points_to_left
971 = skip_typeref(type_left->pointer.points_to);
972 type_t *points_to_right
973 = skip_typeref(type_right->pointer.points_to);
974 assign_error_t res = ASSIGN_SUCCESS;
976 /* the left type has all qualifiers from the right type */
977 unsigned missing_qualifiers
978 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
979 if (missing_qualifiers != 0) {
980 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
983 points_to_left = get_unqualified_type(points_to_left);
984 points_to_right = get_unqualified_type(points_to_right);
986 if (is_type_void(points_to_left))
989 if (is_type_void(points_to_right)) {
990 /* ISO/IEC 14882:1998(E) §C.1.2:6 */
991 return c_mode & _CXX ? ASSIGN_ERROR_INCOMPATIBLE : res;
994 if (!types_compatible(points_to_left, points_to_right)) {
995 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
999 } else if (is_type_integer(type_right)) {
1000 return ASSIGN_WARNING_POINTER_FROM_INT;
1002 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1003 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1004 && is_type_pointer(type_right))) {
1005 return ASSIGN_SUCCESS;
1006 } else if (is_type_compound(type_left) && is_type_compound(type_right)) {
1007 type_t *const unqual_type_left = get_unqualified_type(type_left);
1008 type_t *const unqual_type_right = get_unqualified_type(type_right);
1009 if (types_compatible(unqual_type_left, unqual_type_right)) {
1010 return ASSIGN_SUCCESS;
1012 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1013 return ASSIGN_WARNING_INT_FROM_POINTER;
1016 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1017 return ASSIGN_SUCCESS;
1019 return ASSIGN_ERROR_INCOMPATIBLE;
1022 static expression_t *parse_constant_expression(void)
1024 expression_t *result = parse_subexpression(PREC_CONDITIONAL);
1026 if (is_constant_expression(result) == EXPR_CLASS_VARIABLE) {
1027 errorf(&result->base.pos, "expression '%E' is not constant", result);
1033 static expression_t *parse_assignment_expression(void)
1035 return parse_subexpression(PREC_ASSIGNMENT);
1038 static void append_string(string_t const *const s)
1040 /* FIXME Using the ast_obstack is a hack. Using the symbol_obstack is not
1041 * possible, because other tokens are grown there alongside. */
1042 obstack_grow(&ast_obstack, s->begin, s->size);
1045 static string_t finish_string(string_encoding_t const enc)
1047 obstack_1grow(&ast_obstack, '\0');
1048 size_t const size = obstack_object_size(&ast_obstack) - 1;
1049 char const *const string = obstack_finish(&ast_obstack);
1050 return (string_t){ string, size, enc };
1053 static string_t concat_string_literals(void)
1055 assert(token.kind == T_STRING_LITERAL);
1058 if (look_ahead(1)->kind == T_STRING_LITERAL) {
1059 append_string(&token.literal.string);
1060 eat(T_STRING_LITERAL);
1061 warningf(WARN_TRADITIONAL, HERE, "traditional C rejects string constant concatenation");
1062 string_encoding_t enc = token.literal.string.encoding;
1064 string_encoding_t const new_enc = token.literal.string.encoding;
1065 if (new_enc != enc && new_enc != STRING_ENCODING_CHAR) {
1066 if (enc == STRING_ENCODING_CHAR) {
1069 errorf(HERE, "concatenating string literals with encodings %s and %s", get_string_encoding_prefix(enc), get_string_encoding_prefix(new_enc));
1072 append_string(&token.literal.string);
1073 eat(T_STRING_LITERAL);
1074 } while (token.kind == T_STRING_LITERAL);
1075 result = finish_string(enc);
1077 result = token.literal.string;
1078 eat(T_STRING_LITERAL);
1084 static string_t parse_string_literals(char const *const context)
1086 if (!skip_till(T_STRING_LITERAL, context))
1087 return (string_t){ "", 0, STRING_ENCODING_CHAR };
1089 position_t const pos = *HERE;
1090 string_t const res = concat_string_literals();
1092 if (res.encoding != STRING_ENCODING_CHAR) {
1093 errorf(&pos, "expected plain string literal, got %s string literal", get_string_encoding_prefix(res.encoding));
1099 static attribute_t *allocate_attribute_zero(attribute_kind_t kind)
1101 attribute_t *attribute = allocate_ast_zero(sizeof(*attribute));
1102 attribute->kind = kind;
1103 attribute->pos = *HERE;
1108 * Parse (gcc) attribute argument. From gcc comments in gcc source:
1111 * __attribute__ ( ( attribute-list ) )
1115 * attribute_list , attrib
1120 * any-word ( identifier )
1121 * any-word ( identifier , nonempty-expr-list )
1122 * any-word ( expr-list )
1124 * where the "identifier" must not be declared as a type, and
1125 * "any-word" may be any identifier (including one declared as a
1126 * type), a reserved word storage class specifier, type specifier or
1127 * type qualifier. ??? This still leaves out most reserved keywords
1128 * (following the old parser), shouldn't we include them, and why not
1129 * allow identifiers declared as types to start the arguments?
1131 * Matze: this all looks confusing and little systematic, so we're even less
1132 * strict and parse any list of things which are identifiers or
1133 * (assignment-)expressions.
1135 static attribute_argument_t *parse_attribute_arguments(void)
1137 attribute_argument_t *first = NULL;
1138 attribute_argument_t **anchor = &first;
1139 if (token.kind != ')') do {
1140 attribute_argument_t *argument = allocate_ast_zero(sizeof(*argument));
1142 /* is it an identifier */
1143 if (token.kind == T_IDENTIFIER
1144 && (look_ahead(1)->kind == ',' || look_ahead(1)->kind == ')')) {
1145 argument->kind = ATTRIBUTE_ARGUMENT_SYMBOL;
1146 argument->v.symbol = token.base.symbol;
1149 /* must be an expression */
1150 expression_t *expression = parse_assignment_expression();
1152 argument->kind = ATTRIBUTE_ARGUMENT_EXPRESSION;
1153 argument->v.expression = expression;
1156 /* append argument */
1158 anchor = &argument->next;
1159 } while (accept(','));
1164 static attribute_t *parse_attribute_asm(void)
1166 attribute_t *attribute = allocate_attribute_zero(ATTRIBUTE_GNU_ASM);
1169 attribute->a.arguments = parse_attribute_arguments();
1173 static attribute_t *parse_attribute_gnu_single(void)
1175 /* parse "any-word" */
1176 symbol_t *const symbol = token.base.symbol;
1177 if (symbol == NULL) {
1178 parse_error_expected("while parsing attribute((", T_IDENTIFIER, NULL);
1182 attribute_kind_t kind;
1183 char const *const name = symbol->string;
1184 for (kind = ATTRIBUTE_GNU_FIRST;; ++kind) {
1185 if (kind > ATTRIBUTE_GNU_LAST) {
1186 /* special case for "__const" */
1187 if (token.kind == T_const) {
1188 kind = ATTRIBUTE_GNU_CONST;
1192 warningf(WARN_ATTRIBUTE, HERE, "unknown attribute '%s' ignored", name);
1193 /* TODO: we should still save the attribute in the list... */
1194 kind = ATTRIBUTE_UNKNOWN;
1198 const char *attribute_name = get_attribute_name(kind);
1199 if (attribute_name != NULL && streq_underscore(attribute_name, name))
1203 attribute_t *attribute = allocate_attribute_zero(kind);
1206 /* parse arguments */
1208 attribute->a.arguments = parse_attribute_arguments();
1213 static attribute_t *parse_attribute_gnu(void)
1215 attribute_t *first = NULL;
1216 attribute_t **anchor = &first;
1218 eat(T___attribute__);
1219 add_anchor_token(')');
1220 add_anchor_token(',');
1224 if (token.kind != ')') do {
1225 attribute_t *attribute = parse_attribute_gnu_single();
1227 *anchor = attribute;
1228 anchor = &attribute->next;
1230 } while (accept(','));
1231 rem_anchor_token(',');
1232 rem_anchor_token(')');
1239 /** Parse attributes. */
1240 static attribute_t *parse_attributes(attribute_t *first)
1242 attribute_t **anchor = &first;
1244 while (*anchor != NULL)
1245 anchor = &(*anchor)->next;
1247 attribute_t *attribute;
1248 switch (token.kind) {
1249 case T___attribute__:
1250 attribute = parse_attribute_gnu();
1251 if (attribute == NULL)
1256 attribute = parse_attribute_asm();
1260 attribute = allocate_attribute_zero(ATTRIBUTE_MS_CDECL);
1265 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FASTCALL);
1269 case T__forceinline:
1270 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FORCEINLINE);
1271 eat(T__forceinline);
1275 attribute = allocate_attribute_zero(ATTRIBUTE_MS_STDCALL);
1280 /* TODO record modifier */
1281 warningf(WARN_OTHER, HERE, "Ignoring declaration modifier %K", &token);
1282 attribute = allocate_attribute_zero(ATTRIBUTE_MS_THISCALL);
1290 *anchor = attribute;
1291 anchor = &attribute->next;
1295 static void mark_vars_read(expression_t *expr, entity_t *lhs_ent);
1297 static entity_t *determine_lhs_ent(expression_t *const expr,
1300 switch (expr->kind) {
1301 case EXPR_REFERENCE: {
1302 entity_t *const entity = expr->reference.entity;
1303 /* we should only find variables as lvalues... */
1304 if (entity->base.kind != ENTITY_VARIABLE
1305 && entity->base.kind != ENTITY_PARAMETER)
1311 case EXPR_ARRAY_ACCESS: {
1312 expression_t *const ref = expr->array_access.array_ref;
1313 entity_t * ent = NULL;
1314 if (is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1315 ent = determine_lhs_ent(ref, lhs_ent);
1318 mark_vars_read(ref, lhs_ent);
1320 mark_vars_read(expr->array_access.index, lhs_ent);
1325 mark_vars_read(expr->select.compound, lhs_ent);
1326 if (is_type_compound(skip_typeref(expr->base.type)))
1327 return determine_lhs_ent(expr->select.compound, lhs_ent);
1331 case EXPR_UNARY_DEREFERENCE: {
1332 expression_t *const val = expr->unary.value;
1333 if (val->kind == EXPR_UNARY_TAKE_ADDRESS) {
1335 return determine_lhs_ent(val->unary.value, lhs_ent);
1337 mark_vars_read(val, NULL);
1343 mark_vars_read(expr, NULL);
1348 #define ENT_ANY ((entity_t*)-1)
1351 * Mark declarations, which are read. This is used to detect variables, which
1355 * x is not marked as "read", because it is only read to calculate its own new
1359 * x and y are not detected as "not read", because multiple variables are
1362 static void mark_vars_read(expression_t *const expr, entity_t *lhs_ent)
1364 switch (expr->kind) {
1365 case EXPR_REFERENCE: {
1366 entity_t *const entity = expr->reference.entity;
1367 if (entity->kind != ENTITY_VARIABLE
1368 && entity->kind != ENTITY_PARAMETER)
1371 if (lhs_ent != entity && lhs_ent != ENT_ANY) {
1372 entity->variable.read = true;
1378 // TODO respect pure/const
1379 mark_vars_read(expr->call.function, NULL);
1380 for (call_argument_t *arg = expr->call.arguments; arg != NULL; arg = arg->next) {
1381 mark_vars_read(arg->expression, NULL);
1385 case EXPR_CONDITIONAL:
1386 // TODO lhs_decl should depend on whether true/false have an effect
1387 mark_vars_read(expr->conditional.condition, NULL);
1388 if (expr->conditional.true_expression != NULL)
1389 mark_vars_read(expr->conditional.true_expression, lhs_ent);
1390 mark_vars_read(expr->conditional.false_expression, lhs_ent);
1394 if (lhs_ent == ENT_ANY
1395 && !is_type_compound(skip_typeref(expr->base.type)))
1397 mark_vars_read(expr->select.compound, lhs_ent);
1400 case EXPR_ARRAY_ACCESS: {
1401 mark_vars_read(expr->array_access.index, lhs_ent);
1402 expression_t *const ref = expr->array_access.array_ref;
1403 if (!is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1404 if (lhs_ent == ENT_ANY)
1407 mark_vars_read(ref, lhs_ent);
1412 mark_vars_read(expr->va_arge.ap, lhs_ent);
1416 mark_vars_read(expr->va_copye.src, lhs_ent);
1419 case EXPR_UNARY_CAST:
1420 /* Special case: Use void cast to mark a variable as "read" */
1421 if (is_type_void(skip_typeref(expr->base.type)))
1426 case EXPR_UNARY_THROW:
1427 if (expr->unary.value == NULL)
1430 case EXPR_UNARY_DEREFERENCE:
1431 case EXPR_UNARY_DELETE:
1432 case EXPR_UNARY_DELETE_ARRAY:
1433 if (lhs_ent == ENT_ANY)
1437 case EXPR_UNARY_NEGATE:
1438 case EXPR_UNARY_PLUS:
1439 case EXPR_UNARY_COMPLEMENT:
1440 case EXPR_UNARY_NOT:
1441 case EXPR_UNARY_TAKE_ADDRESS:
1442 case EXPR_UNARY_POSTFIX_INCREMENT:
1443 case EXPR_UNARY_POSTFIX_DECREMENT:
1444 case EXPR_UNARY_PREFIX_INCREMENT:
1445 case EXPR_UNARY_PREFIX_DECREMENT:
1446 case EXPR_UNARY_ASSUME:
1447 case EXPR_UNARY_IMAG:
1448 case EXPR_UNARY_REAL:
1450 mark_vars_read(expr->unary.value, lhs_ent);
1453 case EXPR_BINARY_ADD:
1454 case EXPR_BINARY_SUB:
1455 case EXPR_BINARY_MUL:
1456 case EXPR_BINARY_DIV:
1457 case EXPR_BINARY_MOD:
1458 case EXPR_BINARY_EQUAL:
1459 case EXPR_BINARY_NOTEQUAL:
1460 case EXPR_BINARY_LESS:
1461 case EXPR_BINARY_LESSEQUAL:
1462 case EXPR_BINARY_GREATER:
1463 case EXPR_BINARY_GREATEREQUAL:
1464 case EXPR_BINARY_BITWISE_AND:
1465 case EXPR_BINARY_BITWISE_OR:
1466 case EXPR_BINARY_BITWISE_XOR:
1467 case EXPR_BINARY_LOGICAL_AND:
1468 case EXPR_BINARY_LOGICAL_OR:
1469 case EXPR_BINARY_SHIFTLEFT:
1470 case EXPR_BINARY_SHIFTRIGHT:
1471 case EXPR_BINARY_COMMA:
1472 case EXPR_BINARY_ISGREATER:
1473 case EXPR_BINARY_ISGREATEREQUAL:
1474 case EXPR_BINARY_ISLESS:
1475 case EXPR_BINARY_ISLESSEQUAL:
1476 case EXPR_BINARY_ISLESSGREATER:
1477 case EXPR_BINARY_ISUNORDERED:
1478 mark_vars_read(expr->binary.left, lhs_ent);
1479 mark_vars_read(expr->binary.right, lhs_ent);
1482 case EXPR_BINARY_ASSIGN:
1483 case EXPR_BINARY_MUL_ASSIGN:
1484 case EXPR_BINARY_DIV_ASSIGN:
1485 case EXPR_BINARY_MOD_ASSIGN:
1486 case EXPR_BINARY_ADD_ASSIGN:
1487 case EXPR_BINARY_SUB_ASSIGN:
1488 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
1489 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
1490 case EXPR_BINARY_BITWISE_AND_ASSIGN:
1491 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
1492 case EXPR_BINARY_BITWISE_OR_ASSIGN: {
1493 if (lhs_ent == ENT_ANY)
1495 lhs_ent = determine_lhs_ent(expr->binary.left, lhs_ent);
1496 mark_vars_read(expr->binary.right, lhs_ent);
1501 determine_lhs_ent(expr->va_starte.ap, lhs_ent);
1504 case EXPR_LITERAL_CASES:
1505 case EXPR_LITERAL_CHARACTER:
1507 case EXPR_STRING_LITERAL:
1508 case EXPR_COMPOUND_LITERAL: // TODO init?
1510 case EXPR_CLASSIFY_TYPE:
1513 case EXPR_BUILTIN_CONSTANT_P:
1514 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
1516 case EXPR_STATEMENT: // TODO
1517 case EXPR_LABEL_ADDRESS:
1518 case EXPR_ENUM_CONSTANT:
1522 panic("unhandled expression");
1525 static designator_t *parse_designation(void)
1527 designator_t *result = NULL;
1528 designator_t **anchor = &result;
1531 designator_t *designator;
1532 switch (token.kind) {
1534 designator = allocate_ast_zero(sizeof(designator[0]));
1535 designator->pos = *HERE;
1537 add_anchor_token(']');
1538 designator->array_index = parse_constant_expression();
1539 rem_anchor_token(']');
1543 designator = allocate_ast_zero(sizeof(designator[0]));
1544 designator->pos = *HERE;
1546 designator->symbol = expect_identifier("while parsing designator", NULL);
1547 if (!designator->symbol)
1555 assert(designator != NULL);
1556 *anchor = designator;
1557 anchor = &designator->next;
1562 * Build an initializer from a given expression.
1564 static initializer_t *initializer_from_expression(type_t *orig_type,
1565 expression_t *expression)
1567 /* TODO check that expression is a constant expression */
1569 type_t *const type = skip_typeref(orig_type);
1571 /* §6.7.8.14/15 char array may be initialized by string literals */
1572 if (expression->kind == EXPR_STRING_LITERAL && is_type_array(type)) {
1573 array_type_t *const array_type = &type->array;
1574 type_t *const element_type = skip_typeref(array_type->element_type);
1575 switch (expression->string_literal.value.encoding) {
1576 case STRING_ENCODING_CHAR:
1577 case STRING_ENCODING_UTF8: {
1578 if (is_type_atomic(element_type, ATOMIC_TYPE_CHAR) ||
1579 is_type_atomic(element_type, ATOMIC_TYPE_SCHAR) ||
1580 is_type_atomic(element_type, ATOMIC_TYPE_UCHAR)) {
1581 goto make_string_init;
1586 case STRING_ENCODING_CHAR16:
1587 case STRING_ENCODING_CHAR32:
1588 case STRING_ENCODING_WIDE: {
1589 assert(is_type_pointer(expression->base.type));
1590 type_t *const init_type = get_unqualified_type(expression->base.type->pointer.points_to);
1591 if (types_compatible(get_unqualified_type(element_type), init_type)) {
1593 initializer_t *const init = allocate_initializer_zero(INITIALIZER_STRING);
1594 init->value.value = expression;
1602 assign_error_t error = semantic_assign(type, expression);
1603 if (error == ASSIGN_ERROR_INCOMPATIBLE)
1605 report_assign_error(error, type, expression, "initializer",
1606 &expression->base.pos);
1608 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
1609 result->value.value = create_implicit_cast(expression, type);
1615 * Parses an scalar initializer.
1617 * §6.7.8.11; eat {} without warning
1619 static initializer_t *parse_scalar_initializer(type_t *type,
1620 bool must_be_constant)
1622 /* there might be extra {} hierarchies */
1624 if (token.kind == '{') {
1625 warningf(WARN_OTHER, HERE, "extra curly braces around scalar initializer");
1629 } while (token.kind == '{');
1632 expression_t *expression = parse_assignment_expression();
1633 mark_vars_read(expression, NULL);
1634 if (must_be_constant && !is_linker_constant(expression)) {
1635 errorf(&expression->base.pos,
1636 "initialisation expression '%E' is not constant",
1640 initializer_t *initializer = initializer_from_expression(type, expression);
1642 if (initializer == NULL) {
1643 errorf(&expression->base.pos,
1644 "expression '%E' (type '%T') doesn't match expected type '%T'",
1645 expression, expression->base.type, type);
1650 bool additional_warning_displayed = false;
1651 while (braces > 0) {
1653 if (token.kind != '}') {
1654 if (!additional_warning_displayed) {
1655 warningf(WARN_OTHER, HERE, "additional elements in scalar initializer");
1656 additional_warning_displayed = true;
1667 * An entry in the type path.
1669 typedef struct type_path_entry_t type_path_entry_t;
1670 struct type_path_entry_t {
1671 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
1673 size_t index; /**< For array types: the current index. */
1674 declaration_t *compound_entry; /**< For compound types: the current declaration. */
1679 * A type path expression a position inside compound or array types.
1681 typedef struct type_path_t type_path_t;
1682 struct type_path_t {
1683 type_path_entry_t *path; /**< An flexible array containing the current path. */
1684 type_t *top_type; /**< type of the element the path points */
1685 size_t max_index; /**< largest index in outermost array */
1689 * Prints a type path for debugging.
1691 static __attribute__((unused)) void debug_print_type_path(
1692 const type_path_t *path)
1694 size_t len = ARR_LEN(path->path);
1696 for (size_t i = 0; i < len; ++i) {
1697 const type_path_entry_t *entry = & path->path[i];
1699 type_t *type = skip_typeref(entry->type);
1700 if (is_type_compound(type)) {
1701 /* in gcc mode structs can have no members */
1702 if (entry->v.compound_entry == NULL) {
1706 fprintf(stderr, ".%s",
1707 entry->v.compound_entry->base.symbol->string);
1708 } else if (is_type_array(type)) {
1709 fprintf(stderr, "[%u]", (unsigned) entry->v.index);
1711 fprintf(stderr, "-INVALID-");
1714 if (path->top_type != NULL) {
1715 fprintf(stderr, " (");
1716 print_type(path->top_type);
1717 fprintf(stderr, ")");
1722 * Return the top type path entry, i.e. in a path
1723 * (type).a.b returns the b.
1725 static type_path_entry_t *get_type_path_top(const type_path_t *path)
1727 size_t len = ARR_LEN(path->path);
1729 return &path->path[len-1];
1733 * Enlarge the type path by an (empty) element.
1735 static type_path_entry_t *append_to_type_path(type_path_t *path)
1737 size_t len = ARR_LEN(path->path);
1738 ARR_RESIZE(type_path_entry_t, path->path, len+1);
1740 type_path_entry_t *result = & path->path[len];
1741 memset(result, 0, sizeof(result[0]));
1746 * Descending into a sub-type. Enter the scope of the current top_type.
1748 static void descend_into_subtype(type_path_t *path)
1750 type_t *orig_top_type = path->top_type;
1751 type_t *top_type = skip_typeref(orig_top_type);
1753 type_path_entry_t *top = append_to_type_path(path);
1754 top->type = top_type;
1756 if (is_type_compound(top_type)) {
1757 compound_t *const compound = top_type->compound.compound;
1758 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
1760 if (entry != NULL) {
1761 top->v.compound_entry = &entry->declaration;
1762 path->top_type = entry->declaration.type;
1764 path->top_type = NULL;
1766 } else if (is_type_array(top_type)) {
1768 path->top_type = top_type->array.element_type;
1770 assert(!is_type_valid(top_type));
1775 * Pop an entry from the given type path, i.e. returning from
1776 * (type).a.b to (type).a
1778 static void ascend_from_subtype(type_path_t *path)
1780 type_path_entry_t *top = get_type_path_top(path);
1782 path->top_type = top->type;
1784 size_t len = ARR_LEN(path->path);
1785 ARR_RESIZE(type_path_entry_t, path->path, len-1);
1789 * Pop entries from the given type path until the given
1790 * path level is reached.
1792 static void ascend_to(type_path_t *path, size_t top_path_level)
1794 size_t len = ARR_LEN(path->path);
1796 while (len > top_path_level) {
1797 ascend_from_subtype(path);
1798 len = ARR_LEN(path->path);
1802 static bool walk_designator(type_path_t *path, const designator_t *designator,
1803 bool used_in_offsetof)
1805 for (; designator != NULL; designator = designator->next) {
1806 type_path_entry_t *top = get_type_path_top(path);
1807 type_t *orig_type = top->type;
1809 type_t *type = skip_typeref(orig_type);
1811 if (designator->symbol != NULL) {
1812 symbol_t *symbol = designator->symbol;
1813 if (!is_type_compound(type)) {
1814 if (is_type_valid(type)) {
1815 errorf(&designator->pos,
1816 "'.%Y' designator used for non-compound type '%T'",
1820 top->type = type_error_type;
1821 top->v.compound_entry = NULL;
1822 orig_type = type_error_type;
1824 compound_t *compound = type->compound.compound;
1825 entity_t *iter = compound->members.entities;
1826 for (; iter != NULL; iter = iter->base.next) {
1827 if (iter->base.symbol == symbol) {
1832 errorf(&designator->pos,
1833 "'%T' has no member named '%Y'", orig_type, symbol);
1836 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
1837 if (used_in_offsetof && iter->compound_member.bitfield) {
1838 errorf(&designator->pos,
1839 "offsetof designator '%Y' must not specify bitfield",
1844 top->type = orig_type;
1845 top->v.compound_entry = &iter->declaration;
1846 orig_type = iter->declaration.type;
1849 expression_t *array_index = designator->array_index;
1850 if (is_constant_expression(array_index) != EXPR_CLASS_CONSTANT)
1853 if (!is_type_array(type)) {
1854 if (is_type_valid(type)) {
1855 errorf(&designator->pos,
1856 "[%E] designator used for non-array type '%T'",
1857 array_index, orig_type);
1862 long index = fold_constant_to_int(array_index);
1863 if (!used_in_offsetof) {
1865 errorf(&designator->pos,
1866 "array index [%E] must be positive", array_index);
1867 } else if (type->array.size_constant) {
1868 long array_size = type->array.size;
1869 if (index >= array_size) {
1870 errorf(&designator->pos,
1871 "designator [%E] (%d) exceeds array size %d",
1872 array_index, index, array_size);
1877 top->type = orig_type;
1878 top->v.index = (size_t) index;
1879 orig_type = type->array.element_type;
1881 path->top_type = orig_type;
1883 if (designator->next != NULL) {
1884 descend_into_subtype(path);
1890 static void advance_current_object(type_path_t *path, size_t top_path_level)
1892 type_path_entry_t *top = get_type_path_top(path);
1894 type_t *type = skip_typeref(top->type);
1895 if (is_type_union(type)) {
1896 /* in unions only the first element is initialized */
1897 top->v.compound_entry = NULL;
1898 } else if (is_type_struct(type)) {
1899 declaration_t *entry = top->v.compound_entry;
1901 entity_t *const next_entity = skip_unnamed_bitfields(entry->base.next);
1902 if (next_entity != NULL) {
1903 assert(is_declaration(next_entity));
1904 entry = &next_entity->declaration;
1909 top->v.compound_entry = entry;
1910 if (entry != NULL) {
1911 path->top_type = entry->type;
1914 } else if (is_type_array(type)) {
1915 assert(is_type_array(type));
1919 if (!type->array.size_constant || top->v.index < type->array.size) {
1923 assert(!is_type_valid(type));
1927 /* we're past the last member of the current sub-aggregate, try if we
1928 * can ascend in the type hierarchy and continue with another subobject */
1929 size_t len = ARR_LEN(path->path);
1931 if (len > top_path_level) {
1932 ascend_from_subtype(path);
1933 advance_current_object(path, top_path_level);
1935 path->top_type = NULL;
1940 * skip any {...} blocks until a closing bracket is reached.
1942 static void skip_initializers(void)
1946 while (token.kind != '}') {
1947 if (token.kind == T_EOF)
1949 if (token.kind == '{') {
1957 static initializer_t *create_empty_initializer(void)
1959 static initializer_t empty_initializer
1960 = { .list = { { INITIALIZER_LIST }, 0 } };
1961 return &empty_initializer;
1965 * Parse a part of an initialiser for a struct or union,
1967 static initializer_t *parse_sub_initializer(type_path_t *path,
1968 type_t *outer_type, size_t top_path_level,
1969 parse_initializer_env_t *env)
1971 if (token.kind == '}') {
1972 /* empty initializer */
1973 return create_empty_initializer();
1976 initializer_t *result = NULL;
1978 type_t *orig_type = path->top_type;
1979 type_t *type = NULL;
1981 if (orig_type == NULL) {
1982 /* We are initializing an empty compound. */
1984 type = skip_typeref(orig_type);
1987 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
1990 designator_t *designator = NULL;
1991 if (token.kind == '.' || token.kind == '[') {
1992 designator = parse_designation();
1993 goto finish_designator;
1994 } else if (token.kind == T_IDENTIFIER && look_ahead(1)->kind == ':') {
1995 /* GNU-style designator ("identifier: value") */
1996 designator = allocate_ast_zero(sizeof(designator[0]));
1997 designator->pos = *HERE;
1998 designator->symbol = token.base.symbol;
2003 /* reset path to toplevel, evaluate designator from there */
2004 ascend_to(path, top_path_level);
2005 if (!walk_designator(path, designator, false)) {
2006 /* can't continue after designation error */
2010 initializer_t *designator_initializer
2011 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2012 designator_initializer->designator.designator = designator;
2013 ARR_APP1(initializer_t*, initializers, designator_initializer);
2015 orig_type = path->top_type;
2016 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2021 if (token.kind == '{') {
2022 if (type != NULL && is_type_scalar(type)) {
2023 sub = parse_scalar_initializer(type, env->must_be_constant);
2026 if (env->entity != NULL) {
2027 errorf(HERE, "extra brace group at end of initializer for '%N'", env->entity);
2029 errorf(HERE, "extra brace group at end of initializer");
2034 descend_into_subtype(path);
2037 add_anchor_token('}');
2038 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2040 rem_anchor_token('}');
2045 goto error_parse_next;
2047 ascend_from_subtype(path);
2050 /* must be an expression */
2051 expression_t *expression = parse_assignment_expression();
2052 mark_vars_read(expression, NULL);
2054 if (env->must_be_constant && !is_linker_constant(expression)) {
2055 errorf(&expression->base.pos,
2056 "Initialisation expression '%E' is not constant",
2061 /* we are already outside, ... */
2062 if (outer_type == NULL)
2063 goto error_parse_next;
2064 type_t *const outer_type_skip = skip_typeref(outer_type);
2065 if (is_type_compound(outer_type_skip) &&
2066 !outer_type_skip->compound.compound->complete) {
2067 goto error_parse_next;
2070 position_t const* const pos = &expression->base.pos;
2071 if (env->entity != NULL) {
2072 warningf(WARN_OTHER, pos, "excess elements in initializer for '%N'", env->entity);
2074 warningf(WARN_OTHER, pos, "excess elements in initializer");
2076 goto error_parse_next;
2079 /* handle { "string" } special case */
2080 if (expression->kind == EXPR_STRING_LITERAL && outer_type != NULL) {
2081 result = initializer_from_expression(outer_type, expression);
2082 if (result != NULL) {
2084 if (token.kind != '}') {
2085 warningf(WARN_OTHER, HERE, "excessive elements in initializer for type '%T'", outer_type);
2087 /* TODO: eat , ... */
2092 /* descend into subtypes until expression matches type */
2094 orig_type = path->top_type;
2095 type = skip_typeref(orig_type);
2097 sub = initializer_from_expression(orig_type, expression);
2101 if (!is_type_valid(type)) {
2104 if (is_type_scalar(type)) {
2105 errorf(&expression->base.pos,
2106 "expression '%E' doesn't match expected type '%T'",
2107 expression, orig_type);
2111 descend_into_subtype(path);
2115 /* update largest index of top array */
2116 const type_path_entry_t *first = &path->path[0];
2117 type_t *first_type = first->type;
2118 first_type = skip_typeref(first_type);
2119 if (is_type_array(first_type)) {
2120 size_t index = first->v.index;
2121 if (index > path->max_index)
2122 path->max_index = index;
2125 /* append to initializers list */
2126 ARR_APP1(initializer_t*, initializers, sub);
2131 if (token.kind == '}') {
2136 /* advance to the next declaration if we are not at the end */
2137 advance_current_object(path, top_path_level);
2138 orig_type = path->top_type;
2139 if (orig_type != NULL)
2140 type = skip_typeref(orig_type);
2146 size_t len = ARR_LEN(initializers);
2147 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2148 result = allocate_ast_zero(size);
2149 result->kind = INITIALIZER_LIST;
2150 result->list.len = len;
2151 memcpy(&result->list.initializers, initializers,
2152 len * sizeof(initializers[0]));
2156 skip_initializers();
2158 DEL_ARR_F(initializers);
2159 ascend_to(path, top_path_level+1);
2163 static expression_t *make_size_literal(size_t value)
2165 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_INTEGER);
2166 literal->base.type = type_size_t;
2169 snprintf(buf, sizeof(buf), "%u", (unsigned) value);
2170 literal->literal.value = make_string(buf);
2176 * Parses an initializer. Parsers either a compound literal
2177 * (env->declaration == NULL) or an initializer of a declaration.
2179 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2181 type_t *type = skip_typeref(env->type);
2182 size_t max_index = 0;
2183 initializer_t *result;
2185 if (is_type_scalar(type)) {
2186 result = parse_scalar_initializer(type, env->must_be_constant);
2187 } else if (token.kind == '{') {
2191 memset(&path, 0, sizeof(path));
2192 path.top_type = env->type;
2193 path.path = NEW_ARR_F(type_path_entry_t, 0);
2195 descend_into_subtype(&path);
2197 add_anchor_token('}');
2198 result = parse_sub_initializer(&path, env->type, 1, env);
2199 rem_anchor_token('}');
2201 max_index = path.max_index;
2202 DEL_ARR_F(path.path);
2206 /* parse_scalar_initializer() also works in this case: we simply
2207 * have an expression without {} around it */
2208 result = parse_scalar_initializer(type, env->must_be_constant);
2211 /* §6.7.8:22 array initializers for arrays with unknown size determine
2212 * the array type size */
2213 if (is_type_array(type) && type->array.size_expression == NULL
2214 && result != NULL) {
2216 switch (result->kind) {
2217 case INITIALIZER_LIST:
2218 assert(max_index != 0xdeadbeaf);
2219 size = max_index + 1;
2222 case INITIALIZER_STRING: {
2223 size = get_string_len(&get_init_string(result)->value) + 1;
2227 case INITIALIZER_DESIGNATOR:
2228 case INITIALIZER_VALUE:
2229 /* can happen for parse errors */
2234 internal_errorf(HERE, "invalid initializer type");
2237 type_t *new_type = duplicate_type(type);
2239 new_type->array.size_expression = make_size_literal(size);
2240 new_type->array.size_constant = true;
2241 new_type->array.has_implicit_size = true;
2242 new_type->array.size = size;
2243 env->type = new_type;
2249 static void append_entity(scope_t *scope, entity_t *entity)
2251 if (scope->last_entity != NULL) {
2252 scope->last_entity->base.next = entity;
2254 scope->entities = entity;
2256 entity->base.parent_entity = current_entity;
2257 scope->last_entity = entity;
2261 static compound_t *parse_compound_type_specifier(bool is_struct)
2263 position_t const pos = *HERE;
2264 eat(is_struct ? T_struct : T_union);
2266 symbol_t *symbol = NULL;
2267 entity_t *entity = NULL;
2268 attribute_t *attributes = NULL;
2270 if (token.kind == T___attribute__) {
2271 attributes = parse_attributes(NULL);
2274 entity_kind_tag_t const kind = is_struct ? ENTITY_STRUCT : ENTITY_UNION;
2275 if (token.kind == T_IDENTIFIER) {
2276 /* the compound has a name, check if we have seen it already */
2277 symbol = token.base.symbol;
2278 entity = get_tag(symbol, kind);
2281 if (entity != NULL) {
2282 if (entity->base.parent_scope != current_scope &&
2283 (token.kind == '{' || token.kind == ';')) {
2284 /* we're in an inner scope and have a definition. Shadow
2285 * existing definition in outer scope */
2287 } else if (entity->compound.complete && token.kind == '{') {
2288 position_t const *const ppos = &entity->base.pos;
2289 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2290 /* clear members in the hope to avoid further errors */
2291 entity->compound.members.entities = NULL;
2294 } else if (token.kind != '{') {
2295 char const *const msg =
2296 is_struct ? "while parsing struct type specifier" :
2297 "while parsing union type specifier";
2298 parse_error_expected(msg, T_IDENTIFIER, '{', NULL);
2303 if (entity == NULL) {
2304 entity = allocate_entity_zero(kind, NAMESPACE_TAG, symbol, &pos);
2305 entity->compound.alignment = 1;
2306 entity->base.parent_scope = current_scope;
2307 if (symbol != NULL) {
2308 environment_push(entity);
2310 append_entity(current_scope, entity);
2313 if (token.kind == '{') {
2314 parse_compound_type_entries(&entity->compound);
2316 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2317 if (symbol == NULL) {
2318 assert(anonymous_entity == NULL);
2319 anonymous_entity = entity;
2323 if (attributes != NULL) {
2324 entity->compound.attributes = attributes;
2325 handle_entity_attributes(attributes, entity);
2328 return &entity->compound;
2331 static void parse_enum_entries(type_t *const enum_type)
2335 if (token.kind == '}') {
2336 errorf(HERE, "empty enum not allowed");
2341 add_anchor_token('}');
2342 add_anchor_token(',');
2344 add_anchor_token('=');
2346 symbol_t *const symbol = expect_identifier("while parsing enum entry", &pos);
2347 entity_t *const entity = allocate_entity_zero(ENTITY_ENUM_VALUE, NAMESPACE_NORMAL, symbol, &pos);
2348 entity->enum_value.enum_type = enum_type;
2349 rem_anchor_token('=');
2352 expression_t *value = parse_constant_expression();
2354 value = create_implicit_cast(value, enum_type);
2355 entity->enum_value.value = value;
2360 record_entity(entity, false);
2361 } while (accept(',') && token.kind != '}');
2362 rem_anchor_token(',');
2363 rem_anchor_token('}');
2368 static type_t *parse_enum_specifier(void)
2370 position_t const pos = *HERE;
2375 switch (token.kind) {
2377 symbol = token.base.symbol;
2378 entity = get_tag(symbol, ENTITY_ENUM);
2381 if (entity != NULL) {
2382 if (entity->base.parent_scope != current_scope &&
2383 (token.kind == '{' || token.kind == ';')) {
2384 /* we're in an inner scope and have a definition. Shadow
2385 * existing definition in outer scope */
2387 } else if (entity->enume.complete && token.kind == '{') {
2388 position_t const *const ppos = &entity->base.pos;
2389 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2400 parse_error_expected("while parsing enum type specifier",
2401 T_IDENTIFIER, '{', NULL);
2405 if (entity == NULL) {
2406 entity = allocate_entity_zero(ENTITY_ENUM, NAMESPACE_TAG, symbol, &pos);
2407 entity->base.parent_scope = current_scope;
2410 type_t *const type = allocate_type_zero(TYPE_ENUM);
2411 type->enumt.enume = &entity->enume;
2412 type->enumt.base.akind = ATOMIC_TYPE_INT;
2414 if (token.kind == '{') {
2415 if (symbol != NULL) {
2416 environment_push(entity);
2418 append_entity(current_scope, entity);
2419 entity->enume.complete = true;
2421 parse_enum_entries(type);
2422 parse_attributes(NULL);
2424 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2425 if (symbol == NULL) {
2426 assert(anonymous_entity == NULL);
2427 anonymous_entity = entity;
2429 } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
2430 errorf(HERE, "'%T' used before definition (incomplete enums are a GNU extension)", type);
2437 * if a symbol is a typedef to another type, return true
2439 static bool is_typedef_symbol(symbol_t *symbol)
2441 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
2442 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
2445 static type_t *parse_typeof(void)
2451 add_anchor_token(')');
2454 expression_t *expression = NULL;
2456 switch (token.kind) {
2458 if (is_typedef_symbol(token.base.symbol)) {
2460 type = parse_typename();
2463 expression = parse_expression();
2464 type = revert_automatic_type_conversion(expression);
2469 rem_anchor_token(')');
2472 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
2473 typeof_type->typeoft.expression = expression;
2474 typeof_type->typeoft.typeof_type = type;
2479 typedef enum specifiers_t {
2481 SPECIFIER_SIGNED = 1 << 0,
2482 SPECIFIER_UNSIGNED = 1 << 1,
2483 SPECIFIER_LONG = 1 << 2,
2484 SPECIFIER_INT = 1 << 3,
2485 SPECIFIER_DOUBLE = 1 << 4,
2486 SPECIFIER_CHAR = 1 << 5,
2487 SPECIFIER_WCHAR_T = 1 << 6,
2488 SPECIFIER_SHORT = 1 << 7,
2489 SPECIFIER_LONG_LONG = 1 << 8,
2490 SPECIFIER_FLOAT = 1 << 9,
2491 SPECIFIER_BOOL = 1 << 10,
2492 SPECIFIER_VOID = 1 << 11,
2493 SPECIFIER_INT8 = 1 << 12,
2494 SPECIFIER_INT16 = 1 << 13,
2495 SPECIFIER_INT32 = 1 << 14,
2496 SPECIFIER_INT64 = 1 << 15,
2497 SPECIFIER_INT128 = 1 << 16,
2498 SPECIFIER_COMPLEX = 1 << 17,
2499 SPECIFIER_IMAGINARY = 1 << 18,
2502 static type_t *get_typedef_type(symbol_t *symbol)
2504 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
2505 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
2508 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
2509 type->typedeft.typedefe = &entity->typedefe;
2514 static attribute_t *parse_attribute_ms_property(attribute_t *attribute)
2516 attribute_property_argument_t *const property = allocate_ast_zero(sizeof(*property));
2518 add_anchor_token(')');
2519 add_anchor_token(',');
2523 add_anchor_token('=');
2525 symbol_t *const prop_sym = expect_identifier("while parsing property declspec", &pos);
2526 rem_anchor_token('=');
2528 symbol_t **prop = NULL;
2530 if (streq(prop_sym->string, "put")) {
2531 prop = &property->put_symbol;
2532 } else if (streq(prop_sym->string, "get")) {
2533 prop = &property->get_symbol;
2535 errorf(&pos, "expected put or get in property declspec, but got '%Y'", prop_sym);
2539 add_anchor_token(T_IDENTIFIER);
2541 rem_anchor_token(T_IDENTIFIER);
2543 symbol_t *const sym = expect_identifier("while parsing property declspec", NULL);
2545 *prop = sym ? sym : sym_anonymous;
2546 } while (accept(','));
2547 rem_anchor_token(',');
2548 rem_anchor_token(')');
2550 attribute->a.property = property;
2556 static attribute_t *parse_microsoft_extended_decl_modifier_single(void)
2558 attribute_kind_t kind = ATTRIBUTE_UNKNOWN;
2559 if (accept(T_restrict)) {
2560 kind = ATTRIBUTE_MS_RESTRICT;
2561 } else if (token.kind == T_IDENTIFIER) {
2562 char const *const name = token.base.symbol->string;
2563 for (attribute_kind_t k = ATTRIBUTE_MS_FIRST; k <= ATTRIBUTE_MS_LAST;
2565 const char *attribute_name = get_attribute_name(k);
2566 if (attribute_name != NULL && streq(attribute_name, name)) {
2572 if (kind == ATTRIBUTE_UNKNOWN) {
2573 warningf(WARN_ATTRIBUTE, HERE, "unknown __declspec '%s' ignored", name);
2576 parse_error_expected("while parsing __declspec", T_IDENTIFIER, NULL);
2580 attribute_t *attribute = allocate_attribute_zero(kind);
2583 if (kind == ATTRIBUTE_MS_PROPERTY) {
2584 return parse_attribute_ms_property(attribute);
2587 /* parse arguments */
2589 attribute->a.arguments = parse_attribute_arguments();
2594 static attribute_t *parse_microsoft_extended_decl_modifier(attribute_t *first)
2598 add_anchor_token(')');
2600 if (token.kind != ')') {
2601 attribute_t **anchor = &first;
2603 while (*anchor != NULL)
2604 anchor = &(*anchor)->next;
2606 attribute_t *attribute
2607 = parse_microsoft_extended_decl_modifier_single();
2608 if (attribute == NULL)
2611 *anchor = attribute;
2612 anchor = &attribute->next;
2613 } while (accept(','));
2615 rem_anchor_token(')');
2620 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
2622 entity_t *const entity = allocate_entity_zero(kind, NAMESPACE_NORMAL, symbol, HERE);
2623 if (is_declaration(entity)) {
2624 entity->declaration.type = type_error_type;
2625 entity->declaration.implicit = true;
2626 } else if (kind == ENTITY_TYPEDEF) {
2627 entity->typedefe.type = type_error_type;
2628 entity->typedefe.builtin = true;
2630 if (kind != ENTITY_COMPOUND_MEMBER)
2631 record_entity(entity, false);
2635 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2637 type_t *type = NULL;
2638 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
2639 unsigned type_specifiers = 0;
2640 bool newtype = false;
2641 bool saw_error = false;
2643 memset(specifiers, 0, sizeof(*specifiers));
2644 specifiers->pos = *HERE;
2647 specifiers->attributes = parse_attributes(specifiers->attributes);
2649 switch (token.kind) {
2651 #define MATCH_STORAGE_CLASS(token, class) \
2653 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
2654 errorf(HERE, "multiple storage classes in declaration specifiers"); \
2656 specifiers->storage_class = class; \
2657 if (specifiers->thread_local) \
2658 goto check_thread_storage_class; \
2662 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
2663 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
2664 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
2665 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
2666 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
2669 specifiers->attributes
2670 = parse_microsoft_extended_decl_modifier(specifiers->attributes);
2673 case T__Thread_local:
2674 if (specifiers->thread_local) {
2675 errorf(HERE, "duplicate %K", &token);
2677 specifiers->thread_local = true;
2678 check_thread_storage_class:
2679 switch (specifiers->storage_class) {
2680 case STORAGE_CLASS_EXTERN:
2681 case STORAGE_CLASS_NONE:
2682 case STORAGE_CLASS_STATIC:
2686 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_storage_class;
2687 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_storage_class;
2688 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_storage_class;
2689 wrong_thread_storage_class:
2690 errorf(HERE, "%K used with '%s'", &token, wrong);
2697 /* type qualifiers */
2698 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
2700 qualifiers |= qualifier; \
2704 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
2705 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
2706 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
2707 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
2708 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
2709 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
2710 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
2711 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
2713 /* type specifiers */
2714 #define MATCH_SPECIFIER(token, specifier, name) \
2716 if (type_specifiers & specifier) { \
2717 errorf(HERE, "multiple " name " type specifiers given"); \
2719 type_specifiers |= specifier; \
2724 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
2725 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
2726 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
2727 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
2728 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
2729 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
2730 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
2731 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
2732 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
2733 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
2734 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
2735 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
2736 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
2737 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
2738 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
2739 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
2740 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
2741 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
2745 specifiers->is_inline = true;
2749 case T__forceinline:
2750 eat(T__forceinline);
2751 specifiers->modifiers |= DM_FORCEINLINE;
2756 if (type_specifiers & SPECIFIER_LONG_LONG) {
2757 errorf(HERE, "too many long type specifiers given");
2758 } else if (type_specifiers & SPECIFIER_LONG) {
2759 type_specifiers |= SPECIFIER_LONG_LONG;
2761 type_specifiers |= SPECIFIER_LONG;
2766 #define CHECK_DOUBLE_TYPE() \
2767 (type != NULL ? errorf(HERE, "multiple types in declaration specifiers") : (void)0)
2770 CHECK_DOUBLE_TYPE();
2771 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
2773 type->compound.compound = parse_compound_type_specifier(true);
2776 CHECK_DOUBLE_TYPE();
2777 type = allocate_type_zero(TYPE_COMPOUND_UNION);
2778 type->compound.compound = parse_compound_type_specifier(false);
2781 CHECK_DOUBLE_TYPE();
2782 type = parse_enum_specifier();
2785 CHECK_DOUBLE_TYPE();
2786 type = parse_typeof();
2788 case T___builtin_va_list:
2789 CHECK_DOUBLE_TYPE();
2790 type = duplicate_type(type_valist);
2791 eat(T___builtin_va_list);
2794 case T_IDENTIFIER: {
2795 /* only parse identifier if we haven't found a type yet */
2796 if (type != NULL || type_specifiers != 0) {
2797 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
2798 * declaration, so it doesn't generate errors about expecting '(' or
2800 switch (look_ahead(1)->kind) {
2807 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
2811 errorf(HERE, "discarding stray %K in declaration specifier", &token);
2816 goto finish_specifiers;
2820 type_t *const typedef_type = get_typedef_type(token.base.symbol);
2821 if (typedef_type == NULL) {
2822 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
2823 * declaration, so it doesn't generate 'implicit int' followed by more
2824 * errors later on. */
2825 token_kind_t const la1_type = (token_kind_t)look_ahead(1)->kind;
2831 errorf(HERE, "%K does not name a type", &token);
2833 entity_t *const entity = create_error_entity(token.base.symbol, ENTITY_TYPEDEF);
2835 type = allocate_type_zero(TYPE_TYPEDEF);
2836 type->typedeft.typedefe = &entity->typedefe;
2844 goto finish_specifiers;
2849 type = typedef_type;
2853 /* function specifier */
2855 goto finish_specifiers;
2860 specifiers->attributes = parse_attributes(specifiers->attributes);
2862 if (type == NULL || (saw_error && type_specifiers != 0)) {
2863 position_t const* const pos = &specifiers->pos;
2864 atomic_type_kind_t atomic_type;
2866 /* match valid basic types */
2867 switch (type_specifiers & ~(SPECIFIER_COMPLEX|SPECIFIER_IMAGINARY)) {
2868 case SPECIFIER_VOID:
2869 if (type_specifiers & (SPECIFIER_COMPLEX|SPECIFIER_IMAGINARY)) {
2870 if (type_specifiers & SPECIFIER_COMPLEX)
2871 errorf(pos, "_Complex specifier is invalid for void");
2872 if (type_specifiers & SPECIFIER_IMAGINARY)
2873 errorf(pos, "_Imaginary specifier is invalid for void");
2874 type_specifiers &= ~(SPECIFIER_COMPLEX|SPECIFIER_IMAGINARY);
2876 atomic_type = ATOMIC_TYPE_VOID;
2878 case SPECIFIER_WCHAR_T:
2879 atomic_type = ATOMIC_TYPE_WCHAR_T;
2881 case SPECIFIER_CHAR:
2882 atomic_type = ATOMIC_TYPE_CHAR;
2884 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
2885 atomic_type = ATOMIC_TYPE_SCHAR;
2887 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
2888 atomic_type = ATOMIC_TYPE_UCHAR;
2890 case SPECIFIER_SHORT:
2891 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
2892 case SPECIFIER_SHORT | SPECIFIER_INT:
2893 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
2894 atomic_type = ATOMIC_TYPE_SHORT;
2896 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
2897 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
2898 atomic_type = ATOMIC_TYPE_USHORT;
2901 case SPECIFIER_SIGNED:
2902 case SPECIFIER_SIGNED | SPECIFIER_INT:
2903 atomic_type = ATOMIC_TYPE_INT;
2905 case SPECIFIER_UNSIGNED:
2906 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
2907 atomic_type = ATOMIC_TYPE_UINT;
2909 case SPECIFIER_LONG:
2910 case SPECIFIER_SIGNED | SPECIFIER_LONG:
2911 case SPECIFIER_LONG | SPECIFIER_INT:
2912 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
2913 atomic_type = ATOMIC_TYPE_LONG;
2915 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
2916 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
2917 atomic_type = ATOMIC_TYPE_ULONG;
2920 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2921 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2922 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
2923 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
2925 atomic_type = ATOMIC_TYPE_LONGLONG;
2926 goto warn_about_long_long;
2928 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2929 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
2931 atomic_type = ATOMIC_TYPE_ULONGLONG;
2932 warn_about_long_long:
2933 warningf(WARN_LONG_LONG, &specifiers->pos, "ISO C90 does not support 'long long'");
2936 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
2937 atomic_type = unsigned_int8_type_kind;
2940 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
2941 atomic_type = unsigned_int16_type_kind;
2944 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
2945 atomic_type = unsigned_int32_type_kind;
2948 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
2949 atomic_type = unsigned_int64_type_kind;
2952 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
2953 atomic_type = unsigned_int128_type_kind;
2956 case SPECIFIER_INT8:
2957 case SPECIFIER_SIGNED | SPECIFIER_INT8:
2958 atomic_type = int8_type_kind;
2961 case SPECIFIER_INT16:
2962 case SPECIFIER_SIGNED | SPECIFIER_INT16:
2963 atomic_type = int16_type_kind;
2966 case SPECIFIER_INT32:
2967 case SPECIFIER_SIGNED | SPECIFIER_INT32:
2968 atomic_type = int32_type_kind;
2971 case SPECIFIER_INT64:
2972 case SPECIFIER_SIGNED | SPECIFIER_INT64:
2973 atomic_type = int64_type_kind;
2976 case SPECIFIER_INT128:
2977 case SPECIFIER_SIGNED | SPECIFIER_INT128:
2978 atomic_type = int128_type_kind;
2981 case SPECIFIER_FLOAT:
2982 atomic_type = ATOMIC_TYPE_FLOAT;
2984 case SPECIFIER_DOUBLE:
2985 atomic_type = ATOMIC_TYPE_DOUBLE;
2987 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
2988 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
2990 case SPECIFIER_BOOL:
2991 if (type_specifiers & (SPECIFIER_COMPLEX|SPECIFIER_IMAGINARY)) {
2992 if (type_specifiers & SPECIFIER_COMPLEX)
2993 errorf(pos, "_Complex specifier is invalid for _Bool");
2994 if (type_specifiers & SPECIFIER_IMAGINARY)
2995 errorf(pos, "_Imaginary specifier is invalid for _Bool");
2996 type_specifiers &= ~(SPECIFIER_COMPLEX|SPECIFIER_IMAGINARY);
2998 atomic_type = ATOMIC_TYPE_BOOL;
3001 /* invalid specifier combination, give an error message */
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_COMPLEX) {
3014 warningf(WARN_OTHER, pos, "_Complex requires a type specifier; assuming '_Complex double'");
3015 atomic_type = ATOMIC_TYPE_DOUBLE;
3017 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3018 (type_specifiers & SPECIFIER_UNSIGNED)) {
3019 errorf(pos, "signed and unsigned specifiers given");
3020 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3021 errorf(pos, "only integer types can be signed or unsigned");
3023 errorf(pos, "multiple datatypes in declaration");
3025 specifiers->type = type_error_type;
3030 if (type_specifiers & SPECIFIER_COMPLEX) {
3031 type = allocate_type_zero(TYPE_COMPLEX);
3032 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3033 type = allocate_type_zero(TYPE_IMAGINARY);
3035 type = allocate_type_zero(TYPE_ATOMIC);
3037 type->atomic.akind = atomic_type;
3039 } else if (type_specifiers != 0) {
3040 errorf(&specifiers->pos, "multiple datatypes in declaration");
3043 /* FIXME: check type qualifiers here */
3044 type->base.qualifiers = qualifiers;
3047 type = identify_new_type(type);
3049 type = typehash_insert(type);
3052 if (specifiers->attributes != NULL)
3053 type = handle_type_attributes(specifiers->attributes, type);
3054 specifiers->type = type;
3057 static type_qualifiers_t parse_type_qualifiers(void)
3059 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3062 switch (token.kind) {
3063 /* type qualifiers */
3064 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3065 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3066 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3067 /* microsoft extended type modifiers */
3068 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3069 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3070 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3071 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3072 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3081 * Parses an K&R identifier list
3083 static void parse_identifier_list(scope_t *scope)
3085 assert(token.kind == T_IDENTIFIER);
3087 entity_t *const entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, token.base.symbol, HERE);
3088 /* a K&R parameter has no type, yet */
3092 append_entity(scope, entity);
3093 } while (accept(',') && token.kind == T_IDENTIFIER);
3096 static entity_t *parse_parameter(void)
3098 declaration_specifiers_t specifiers;
3099 parse_declaration_specifiers(&specifiers);
3101 entity_t *entity = parse_declarator(&specifiers,
3102 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
3103 anonymous_entity = NULL;
3107 static void semantic_parameter_incomplete(const entity_t *entity)
3109 assert(entity->kind == ENTITY_PARAMETER);
3111 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
3112 * list in a function declarator that is part of a
3113 * definition of that function shall not have
3114 * incomplete type. */
3115 type_t *type = skip_typeref(entity->declaration.type);
3116 if (is_type_incomplete(type)) {
3117 errorf(&entity->base.pos, "'%N' has incomplete type", entity);
3121 static bool has_parameters(void)
3123 /* func(void) is not a parameter */
3124 if (look_ahead(1)->kind != ')')
3126 if (token.kind == T_IDENTIFIER) {
3127 entity_t const *const entity = get_entity(token.base.symbol, NAMESPACE_NORMAL);
3130 if (entity->kind != ENTITY_TYPEDEF)
3132 type_t const *const type = skip_typeref(entity->typedefe.type);
3133 if (!is_type_void(type))
3135 if (c_mode & _CXX) {
3136 /* ISO/IEC 14882:1998(E) §8.3.5:2 It must be literally (void). A typedef
3137 * is not allowed. */
3138 errorf(HERE, "empty parameter list defined with a typedef of 'void' not allowed in C++");
3139 } else if (type->base.qualifiers != TYPE_QUALIFIER_NONE) {
3140 /* §6.7.5.3:10 Qualification is not allowed here. */
3141 errorf(HERE, "'void' as parameter must not have type qualifiers");
3143 } else if (token.kind != T_void) {
3151 * Parses function type parameters (and optionally creates variable_t entities
3152 * for them in a scope)
3154 static void parse_parameters(function_type_t *type, scope_t *scope)
3156 add_anchor_token(')');
3159 if (token.kind == T_IDENTIFIER &&
3160 !is_typedef_symbol(token.base.symbol) &&
3161 (look_ahead(1)->kind == ',' || look_ahead(1)->kind == ')')) {
3162 type->kr_style_parameters = true;
3163 parse_identifier_list(scope);
3164 } else if (token.kind == ')') {
3165 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
3166 if (!(c_mode & _CXX))
3167 type->unspecified_parameters = true;
3168 } else if (has_parameters()) {
3169 function_parameter_t **anchor = &type->parameters;
3170 add_anchor_token(',');
3172 switch (token.kind) {
3175 type->variadic = true;
3176 goto parameters_finished;
3181 entity_t *entity = parse_parameter();
3182 if (entity->kind == ENTITY_TYPEDEF) {
3183 errorf(&entity->base.pos,
3184 "typedef not allowed as function parameter");
3187 assert(is_declaration(entity));
3189 semantic_parameter_incomplete(entity);
3191 function_parameter_t *const parameter =
3192 allocate_parameter(entity->declaration.type);
3194 if (scope != NULL) {
3195 append_entity(scope, entity);
3198 *anchor = parameter;
3199 anchor = ¶meter->next;
3204 goto parameters_finished;
3206 } while (accept(','));
3207 parameters_finished:
3208 rem_anchor_token(',');
3211 rem_anchor_token(')');
3215 typedef enum construct_type_kind_t {
3216 CONSTRUCT_POINTER = 1,
3217 CONSTRUCT_REFERENCE,
3220 } construct_type_kind_t;
3222 typedef union construct_type_t construct_type_t;
3224 typedef struct construct_type_base_t {
3225 construct_type_kind_t kind;
3227 construct_type_t *next;
3228 } construct_type_base_t;
3230 typedef struct parsed_pointer_t {
3231 construct_type_base_t base;
3232 type_qualifiers_t type_qualifiers;
3233 variable_t *base_variable; /**< MS __based extension. */
3236 typedef struct parsed_reference_t {
3237 construct_type_base_t base;
3238 } parsed_reference_t;
3240 typedef struct construct_function_type_t {
3241 construct_type_base_t base;
3242 type_t *function_type;
3243 } construct_function_type_t;
3245 typedef struct parsed_array_t {
3246 construct_type_base_t base;
3247 type_qualifiers_t type_qualifiers;
3253 union construct_type_t {
3254 construct_type_kind_t kind;
3255 construct_type_base_t base;
3256 parsed_pointer_t pointer;
3257 parsed_reference_t reference;
3258 construct_function_type_t function;
3259 parsed_array_t array;
3262 static construct_type_t *allocate_declarator_zero(construct_type_kind_t const kind, size_t const size)
3264 construct_type_t *const cons = obstack_alloc(&temp_obst, size);
3265 memset(cons, 0, size);
3267 cons->base.pos = *HERE;
3272 static construct_type_t *parse_pointer_declarator(void)
3274 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_POINTER, sizeof(parsed_pointer_t));
3276 cons->pointer.type_qualifiers = parse_type_qualifiers();
3277 //cons->pointer.base_variable = base_variable;
3282 /* ISO/IEC 14882:1998(E) §8.3.2 */
3283 static construct_type_t *parse_reference_declarator(void)
3285 if (!(c_mode & _CXX))
3286 errorf(HERE, "references are only available for C++");
3288 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_REFERENCE, sizeof(parsed_reference_t));
3295 static construct_type_t *parse_array_declarator(void)
3297 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_ARRAY, sizeof(parsed_array_t));
3298 parsed_array_t *const array = &cons->array;
3301 add_anchor_token(']');
3303 bool is_static = accept(T_static);
3305 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3308 is_static = accept(T_static);
3310 array->type_qualifiers = type_qualifiers;
3311 array->is_static = is_static;
3313 expression_t *size = NULL;
3314 if (token.kind == '*' && look_ahead(1)->kind == ']') {
3315 array->is_variable = true;
3317 } else if (token.kind != ']') {
3318 size = parse_assignment_expression();
3320 /* §6.7.5.2:1 Array size must have integer type */
3321 type_t *const orig_type = size->base.type;
3322 type_t *const type = skip_typeref(orig_type);
3323 if (!is_type_integer(type) && is_type_valid(type)) {
3324 errorf(&size->base.pos,
3325 "array size '%E' must have integer type but has type '%T'",
3330 mark_vars_read(size, NULL);
3333 if (is_static && size == NULL)
3334 errorf(&array->base.pos, "static array parameters require a size");
3336 rem_anchor_token(']');
3342 static construct_type_t *parse_function_declarator(scope_t *scope)
3344 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_FUNCTION, sizeof(construct_function_type_t));
3346 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3347 function_type_t *ftype = &type->function;
3349 ftype->linkage = current_linkage;
3350 ftype->calling_convention = CC_DEFAULT;
3352 parse_parameters(ftype, scope);
3354 cons->function.function_type = type;
3359 typedef struct parse_declarator_env_t {
3360 bool may_be_abstract : 1;
3361 bool must_be_abstract : 1;
3362 decl_modifiers_t modifiers;
3366 attribute_t *attributes;
3367 } parse_declarator_env_t;
3370 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env)
3372 /* construct a single linked list of construct_type_t's which describe
3373 * how to construct the final declarator type */
3374 construct_type_t *first = NULL;
3375 construct_type_t **anchor = &first;
3377 env->attributes = parse_attributes(env->attributes);
3380 construct_type_t *type;
3381 //variable_t *based = NULL; /* MS __based extension */
3382 switch (token.kind) {
3384 type = parse_reference_declarator();
3388 panic("based not supported anymore");
3393 type = parse_pointer_declarator();
3397 goto ptr_operator_end;
3401 anchor = &type->base.next;
3403 /* TODO: find out if this is correct */
3404 env->attributes = parse_attributes(env->attributes);
3408 construct_type_t *inner_types = NULL;
3410 switch (token.kind) {
3412 if (env->must_be_abstract) {
3413 errorf(HERE, "no identifier expected in typename");
3415 env->symbol = token.base.symbol;
3422 /* Parenthesized declarator or function declarator? */
3423 token_t const *const la1 = look_ahead(1);
3424 switch (la1->kind) {
3426 if (is_typedef_symbol(la1->base.symbol)) {
3428 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
3429 * interpreted as ``function with no parameter specification'', rather
3430 * than redundant parentheses around the omitted identifier. */
3432 /* Function declarator. */
3433 if (!env->may_be_abstract) {
3434 errorf(HERE, "function declarator must have a name");
3441 case T___attribute__: /* FIXME __attribute__ might also introduce a parameter of a function declarator. */
3442 /* Paranthesized declarator. */
3444 add_anchor_token(')');
3445 inner_types = parse_inner_declarator(env);
3446 if (inner_types != NULL) {
3447 /* All later declarators only modify the return type */
3448 env->must_be_abstract = true;
3450 rem_anchor_token(')');
3459 if (env->may_be_abstract)
3461 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3466 construct_type_t **const p = anchor;
3469 construct_type_t *type;
3470 switch (token.kind) {
3472 scope_t *scope = NULL;
3473 if (!env->must_be_abstract) {
3474 scope = &env->parameters;
3477 type = parse_function_declarator(scope);
3481 type = parse_array_declarator();
3484 goto declarator_finished;
3487 /* insert in the middle of the list (at p) */
3488 type->base.next = *p;
3491 anchor = &type->base.next;
3494 declarator_finished:
3495 /* append inner_types at the end of the list, we don't to set anchor anymore
3496 * as it's not needed anymore */
3497 *anchor = inner_types;
3502 static type_t *construct_declarator_type(construct_type_t *construct_list,
3505 construct_type_t *iter = construct_list;
3506 for (; iter != NULL; iter = iter->base.next) {
3507 position_t const* const pos = &iter->base.pos;
3508 switch (iter->kind) {
3509 case CONSTRUCT_FUNCTION: {
3510 construct_function_type_t *function = &iter->function;
3511 type_t *function_type = function->function_type;
3513 function_type->function.return_type = type;
3515 type_t *skipped_return_type = skip_typeref(type);
3517 if (is_type_function(skipped_return_type)) {
3518 errorf(pos, "function returning function is not allowed");
3519 } else if (is_type_array(skipped_return_type)) {
3520 errorf(pos, "function returning array is not allowed");
3522 if (skipped_return_type->base.qualifiers != 0) {
3523 warningf(WARN_IGNORED_QUALIFIERS, pos, "type qualifiers in return type of function type are meaningless");
3527 /* The function type was constructed earlier. Freeing it here will
3528 * destroy other types. */
3529 type = typehash_insert(function_type);
3533 case CONSTRUCT_POINTER: {
3534 if (is_type_reference(skip_typeref(type)))
3535 errorf(pos, "cannot declare a pointer to reference");
3537 parsed_pointer_t *pointer = &iter->pointer;
3538 type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
3542 case CONSTRUCT_REFERENCE:
3543 if (is_type_reference(skip_typeref(type)))
3544 errorf(pos, "cannot declare a reference to reference");
3546 type = make_reference_type(type);
3549 case CONSTRUCT_ARRAY: {
3550 if (is_type_reference(skip_typeref(type)))
3551 errorf(pos, "cannot declare an array of references");
3553 parsed_array_t *array = &iter->array;
3554 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
3556 expression_t *size_expression = array->size;
3557 if (size_expression != NULL) {
3559 = create_implicit_cast(size_expression, type_size_t);
3562 array_type->base.qualifiers = array->type_qualifiers;
3563 array_type->array.element_type = type;
3564 array_type->array.is_static = array->is_static;
3565 array_type->array.is_variable = array->is_variable;
3566 array_type->array.size_expression = size_expression;
3568 if (size_expression != NULL) {
3569 switch (is_constant_expression(size_expression)) {
3570 case EXPR_CLASS_CONSTANT: {
3571 long const size = fold_constant_to_int(size_expression);
3572 array_type->array.size = size;
3573 array_type->array.size_constant = true;
3574 /* §6.7.5.2:1 If the expression is a constant expression,
3575 * it shall have a value greater than zero. */
3577 errorf(&size_expression->base.pos,
3578 "size of array must be greater than zero");
3579 } else if (size == 0 && !GNU_MODE) {
3580 errorf(&size_expression->base.pos,
3581 "size of array must be greater than zero (zero length arrays are a GCC extension)");
3586 case EXPR_CLASS_VARIABLE:
3587 array_type->array.is_vla = true;
3590 case EXPR_CLASS_ERROR:
3595 type_t *skipped_type = skip_typeref(type);
3597 if (is_type_incomplete(skipped_type)) {
3598 errorf(pos, "array of incomplete type '%T' is not allowed", type);
3599 } else if (is_type_function(skipped_type)) {
3600 errorf(pos, "array of functions is not allowed");
3602 type = identify_new_type(array_type);
3606 internal_errorf(pos, "invalid type construction found");
3612 static type_t *automatic_type_conversion(type_t *orig_type);
3614 static type_t *semantic_parameter(const position_t *pos, type_t *type,
3615 const declaration_specifiers_t *specifiers,
3616 entity_t const *const param)
3618 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
3619 * shall be adjusted to ``qualified pointer to type'',
3621 * §6.7.5.3:8 A declaration of a parameter as ``function returning
3622 * type'' shall be adjusted to ``pointer to function
3623 * returning type'', as in 6.3.2.1. */
3624 type = automatic_type_conversion(type);
3626 if (specifiers->is_inline && is_type_valid(type)) {
3627 errorf(pos, "'%N' declared 'inline'", param);
3630 /* §6.9.1:6 The declarations in the declaration list shall contain
3631 * no storage-class specifier other than register and no
3632 * initializations. */
3633 if (specifiers->thread_local || (
3634 specifiers->storage_class != STORAGE_CLASS_NONE &&
3635 specifiers->storage_class != STORAGE_CLASS_REGISTER)
3637 errorf(pos, "invalid storage class for '%N'", param);
3640 /* delay test for incomplete type, because we might have (void)
3641 * which is legal but incomplete... */
3646 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
3647 declarator_flags_t flags)
3649 parse_declarator_env_t env;
3650 memset(&env, 0, sizeof(env));
3651 env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
3653 construct_type_t *construct_type = parse_inner_declarator(&env);
3655 construct_declarator_type(construct_type, specifiers->type);
3656 type_t *type = skip_typeref(orig_type);
3658 if (construct_type != NULL) {
3659 obstack_free(&temp_obst, construct_type);
3662 attribute_t *attributes = parse_attributes(env.attributes);
3663 /* append (shared) specifier attribute behind attributes of this
3665 attribute_t **anchor = &attributes;
3666 while (*anchor != NULL)
3667 anchor = &(*anchor)->next;
3668 *anchor = specifiers->attributes;
3671 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
3672 entity = allocate_entity_zero(ENTITY_TYPEDEF, NAMESPACE_NORMAL, env.symbol, &env.pos);
3673 entity->typedefe.type = orig_type;
3675 if (anonymous_entity != NULL) {
3676 if (is_type_compound(type)) {
3677 assert(anonymous_entity->compound.alias == NULL);
3678 assert(anonymous_entity->kind == ENTITY_STRUCT ||
3679 anonymous_entity->kind == ENTITY_UNION);
3680 anonymous_entity->compound.alias = entity;
3681 anonymous_entity = NULL;
3682 } else if (is_type_enum(type)) {
3683 assert(anonymous_entity->enume.alias == NULL);
3684 assert(anonymous_entity->kind == ENTITY_ENUM);
3685 anonymous_entity->enume.alias = entity;
3686 anonymous_entity = NULL;
3690 /* create a declaration type entity */
3691 position_t const *const pos = env.symbol ? &env.pos : &specifiers->pos;
3692 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
3693 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, env.symbol, pos);
3695 if (env.symbol != NULL) {
3696 if (specifiers->is_inline && is_type_valid(type)) {
3697 errorf(&env.pos, "'%N' declared 'inline'", entity);
3700 if (specifiers->thread_local ||
3701 specifiers->storage_class != STORAGE_CLASS_NONE) {
3702 errorf(&env.pos, "'%N' must have no storage class", entity);
3705 } else if (flags & DECL_IS_PARAMETER) {
3706 entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, env.symbol, pos);
3707 orig_type = semantic_parameter(&env.pos, orig_type, specifiers, entity);
3708 } else if (is_type_function(type)) {
3709 entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, env.symbol, pos);
3710 entity->function.is_inline = specifiers->is_inline;
3711 entity->function.elf_visibility = default_visibility;
3712 entity->function.parameters = env.parameters;
3714 if (env.symbol != NULL) {
3715 /* this needs fixes for C++ */
3716 bool in_function_scope = current_function != NULL;
3718 if (specifiers->thread_local || (
3719 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3720 specifiers->storage_class != STORAGE_CLASS_NONE &&
3721 (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
3723 errorf(&env.pos, "invalid storage class for '%N'", entity);
3727 entity = allocate_entity_zero(ENTITY_VARIABLE, NAMESPACE_NORMAL, env.symbol, pos);
3728 entity->variable.elf_visibility = default_visibility;
3729 entity->variable.thread_local = specifiers->thread_local;
3731 if (env.symbol != NULL) {
3732 if (specifiers->is_inline && is_type_valid(type)) {
3733 errorf(&env.pos, "'%N' declared 'inline'", entity);
3736 bool invalid_storage_class = false;
3737 if (current_scope == file_scope) {
3738 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3739 specifiers->storage_class != STORAGE_CLASS_NONE &&
3740 specifiers->storage_class != STORAGE_CLASS_STATIC) {
3741 invalid_storage_class = true;
3744 if (specifiers->thread_local &&
3745 specifiers->storage_class == STORAGE_CLASS_NONE) {
3746 invalid_storage_class = true;
3749 if (invalid_storage_class) {
3750 errorf(&env.pos, "invalid storage class for '%N'", entity);
3755 entity->declaration.type = orig_type;
3756 entity->declaration.alignment = get_type_alignment(orig_type);
3757 entity->declaration.modifiers = env.modifiers;
3758 entity->declaration.attributes = attributes;
3760 storage_class_t storage_class = specifiers->storage_class;
3761 entity->declaration.declared_storage_class = storage_class;
3763 if (storage_class == STORAGE_CLASS_NONE && current_function != NULL)
3764 storage_class = STORAGE_CLASS_AUTO;
3765 entity->declaration.storage_class = storage_class;
3768 if (attributes != NULL) {
3769 handle_entity_attributes(attributes, entity);
3772 if (entity->kind == ENTITY_FUNCTION && !freestanding) {
3773 adapt_special_functions(&entity->function);
3779 static type_t *parse_abstract_declarator(type_t *base_type)
3781 parse_declarator_env_t env;
3782 memset(&env, 0, sizeof(env));
3783 env.may_be_abstract = true;
3784 env.must_be_abstract = true;
3786 construct_type_t *construct_type = parse_inner_declarator(&env);
3788 type_t *result = construct_declarator_type(construct_type, base_type);
3789 if (construct_type != NULL) {
3790 obstack_free(&temp_obst, construct_type);
3792 result = handle_type_attributes(env.attributes, result);
3798 * Check if the declaration of main is suspicious. main should be a
3799 * function with external linkage, returning int, taking either zero
3800 * arguments, two, or three arguments of appropriate types, ie.
3802 * int main([ int argc, char **argv [, char **env ] ]).
3804 * @param decl the declaration to check
3805 * @param type the function type of the declaration
3807 static void check_main(const entity_t *entity)
3809 const position_t *pos = &entity->base.pos;
3810 if (entity->kind != ENTITY_FUNCTION) {
3811 warningf(WARN_MAIN, pos, "'main' is not a function");
3815 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
3816 warningf(WARN_MAIN, pos, "'main' is normally a non-static function");
3819 type_t *type = skip_typeref(entity->declaration.type);
3820 assert(is_type_function(type));
3822 function_type_t const *const func_type = &type->function;
3823 type_t *const ret_type = func_type->return_type;
3824 if (!types_compatible(skip_typeref(ret_type), type_int)) {
3825 warningf(WARN_MAIN, pos, "return type of 'main' should be 'int', but is '%T'", ret_type);
3827 const function_parameter_t *parm = func_type->parameters;
3829 type_t *const first_type = skip_typeref(parm->type);
3830 type_t *const first_type_unqual = get_unqualified_type(first_type);
3831 if (!types_compatible(first_type_unqual, type_int)) {
3832 warningf(WARN_MAIN, pos, "first argument of 'main' should be 'int', but is '%T'", parm->type);
3836 type_t *const second_type = skip_typeref(parm->type);
3837 type_t *const second_type_unqual
3838 = get_unqualified_type(second_type);
3839 if (!types_compatible(second_type_unqual, type_char_ptr_ptr)) {
3840 warningf(WARN_MAIN, pos, "second argument of 'main' should be 'char**', but is '%T'", parm->type);
3844 type_t *const third_type = skip_typeref(parm->type);
3845 type_t *const third_type_unqual
3846 = get_unqualified_type(third_type);
3847 if (!types_compatible(third_type_unqual, type_char_ptr_ptr)) {
3848 warningf(WARN_MAIN, pos, "third argument of 'main' should be 'char**', but is '%T'", parm->type);
3852 goto warn_arg_count;
3856 warningf(WARN_MAIN, pos, "'main' takes only zero, two or three arguments");
3861 static void error_redefined_as_different_kind(const position_t *pos,
3862 const entity_t *old, entity_kind_t new_kind)
3864 char const *const what = get_entity_kind_name(new_kind);
3865 position_t const *const ppos = &old->base.pos;
3866 errorf(pos, "redeclaration of '%N' as %s (declared %P)", old, what, ppos);
3869 static bool is_entity_valid(entity_t *const ent)
3871 if (is_declaration(ent)) {
3872 return is_type_valid(skip_typeref(ent->declaration.type));
3873 } else if (ent->kind == ENTITY_TYPEDEF) {
3874 return is_type_valid(skip_typeref(ent->typedefe.type));
3879 static bool contains_attribute(const attribute_t *list, const attribute_t *attr)
3881 for (const attribute_t *tattr = list; tattr != NULL; tattr = tattr->next) {
3882 if (attributes_equal(tattr, attr))
3889 * Tests whether new_list contains any attributes not included in old_list
3891 static bool has_new_attributes(const attribute_t *old_list,
3892 const attribute_t *new_list)
3894 for (const attribute_t *attr = new_list; attr != NULL; attr = attr->next) {
3895 if (!contains_attribute(old_list, attr))
3902 * Merge in attributes from an attribute list (probably from a previous
3903 * declaration with the same name). Warning: destroys the old structure
3904 * of the attribute list - don't reuse attributes after this call.
3906 static void merge_in_attributes(declaration_t *decl, attribute_t *attributes)
3909 for (attribute_t *attr = attributes; attr != NULL; attr = next) {
3911 if (contains_attribute(decl->attributes, attr))
3914 /* move attribute to new declarations attributes list */
3915 attr->next = decl->attributes;
3916 decl->attributes = attr;
3920 static bool is_main(entity_t*);
3923 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
3924 * for various problems that occur for multiple definitions
3926 entity_t *record_entity(entity_t *entity, const bool is_definition)
3928 const symbol_t *const symbol = entity->base.symbol;
3929 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
3930 const position_t *pos = &entity->base.pos;
3932 /* can happen in error cases */
3936 assert(!entity->base.parent_scope);
3937 assert(current_scope);
3938 entity->base.parent_scope = current_scope;
3940 entity_t *const previous_entity = get_entity(symbol, namespc);
3941 /* pushing the same entity twice will break the stack structure */
3942 assert(previous_entity != entity);
3944 if (entity->kind == ENTITY_FUNCTION) {
3945 type_t *const orig_type = entity->declaration.type;
3946 type_t *const type = skip_typeref(orig_type);
3948 assert(is_type_function(type));
3949 if (type->function.unspecified_parameters &&
3950 previous_entity == NULL &&
3951 !entity->declaration.implicit) {
3952 warningf(WARN_STRICT_PROTOTYPES, pos, "function declaration '%#N' is not a prototype", entity);
3955 if (is_main(entity)) {
3960 if (is_declaration(entity) &&
3961 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
3962 current_scope != file_scope &&
3963 !entity->declaration.implicit) {
3964 warningf(WARN_NESTED_EXTERNS, pos, "nested extern declaration of '%#N'", entity);
3967 if (previous_entity != NULL) {
3968 position_t const *const ppos = &previous_entity->base.pos;
3970 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
3971 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
3972 assert(previous_entity->kind == ENTITY_PARAMETER);
3973 errorf(pos, "declaration of '%N' redeclares the '%N' (declared %P)", entity, previous_entity, ppos);
3977 if (previous_entity->base.parent_scope == current_scope) {
3978 if (previous_entity->kind != entity->kind) {
3979 if (is_entity_valid(previous_entity) && is_entity_valid(entity)) {
3980 error_redefined_as_different_kind(pos, previous_entity,
3985 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
3986 errorf(pos, "redeclaration of '%N' (declared %P)", entity, ppos);
3989 if (previous_entity->kind == ENTITY_TYPEDEF) {
3990 type_t *const type = skip_typeref(entity->typedefe.type);
3991 type_t *const prev_type
3992 = skip_typeref(previous_entity->typedefe.type);
3993 if (c_mode & _CXX) {
3994 /* C++ allows double typedef if they are identical
3995 * (after skipping typedefs) */
3996 if (type == prev_type)
3999 /* GCC extension: redef in system headers is allowed */
4000 if ((pos->is_system_header || ppos->is_system_header) &&
4001 types_compatible(type, prev_type))
4004 errorf(pos, "redefinition of '%N' (declared %P)",
4009 /* at this point we should have only VARIABLES or FUNCTIONS */
4010 assert(is_declaration(previous_entity) && is_declaration(entity));
4012 declaration_t *const prev_decl = &previous_entity->declaration;
4013 declaration_t *const decl = &entity->declaration;
4015 /* can happen for K&R style declarations */
4016 if (prev_decl->type == NULL &&
4017 previous_entity->kind == ENTITY_PARAMETER &&
4018 entity->kind == ENTITY_PARAMETER) {
4019 prev_decl->type = decl->type;
4020 prev_decl->storage_class = decl->storage_class;
4021 prev_decl->declared_storage_class = decl->declared_storage_class;
4022 prev_decl->modifiers = decl->modifiers;
4023 return previous_entity;
4026 type_t *const type = skip_typeref(decl->type);
4027 type_t *const prev_type = skip_typeref(prev_decl->type);
4029 if (!types_compatible(type, prev_type)) {
4030 errorf(pos, "declaration '%#N' is incompatible with '%#N' (declared %P)", entity, previous_entity, ppos);
4032 unsigned old_storage_class = prev_decl->storage_class;
4034 if (is_definition &&
4036 !(prev_decl->modifiers & DM_USED) &&
4037 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4038 warningf(WARN_REDUNDANT_DECLS, ppos, "unnecessary static forward declaration for '%#N'", previous_entity);
4041 storage_class_t new_storage_class = decl->storage_class;
4043 /* pretend no storage class means extern for function
4044 * declarations (except if the previous declaration is neither
4045 * none nor extern) */
4046 if (entity->kind == ENTITY_FUNCTION) {
4047 /* the previous declaration could have unspecified parameters or
4048 * be a typedef, so use the new type */
4049 if (prev_type->function.unspecified_parameters || is_definition)
4050 prev_decl->type = type;
4052 switch (old_storage_class) {
4053 case STORAGE_CLASS_NONE:
4054 old_storage_class = STORAGE_CLASS_EXTERN;
4057 case STORAGE_CLASS_EXTERN:
4058 if (is_definition) {
4059 if (prev_type->function.unspecified_parameters && !is_main(entity)) {
4060 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4062 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4063 new_storage_class = STORAGE_CLASS_EXTERN;
4070 } else if (is_type_incomplete(prev_type)) {
4071 prev_decl->type = type;
4074 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4075 new_storage_class == STORAGE_CLASS_EXTERN) {
4077 warn_redundant_declaration: ;
4079 = has_new_attributes(prev_decl->attributes,
4081 if (has_new_attrs) {
4082 merge_in_attributes(decl, prev_decl->attributes);
4083 } else if (!is_definition &&
4084 is_type_valid(prev_type) &&
4085 !pos->is_system_header) {
4086 warningf(WARN_REDUNDANT_DECLS, pos, "redundant declaration for '%N' (declared %P)", entity, ppos);
4088 } else if (current_function == NULL) {
4089 if (old_storage_class != STORAGE_CLASS_STATIC &&
4090 new_storage_class == STORAGE_CLASS_STATIC) {
4091 errorf(pos, "static declaration of '%N' follows non-static declaration (declared %P)", entity, ppos);
4092 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4093 prev_decl->storage_class = STORAGE_CLASS_NONE;
4094 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4096 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4098 goto error_redeclaration;
4099 goto warn_redundant_declaration;
4101 } else if (is_type_valid(prev_type)) {
4102 if (old_storage_class == new_storage_class) {
4103 error_redeclaration:
4104 errorf(pos, "redeclaration of '%N' (declared %P)", entity, ppos);
4106 errorf(pos, "redeclaration of '%N' with different linkage (declared %P)", entity, ppos);
4111 prev_decl->modifiers |= decl->modifiers;
4112 if (entity->kind == ENTITY_FUNCTION) {
4113 previous_entity->function.is_inline |= entity->function.is_inline;
4115 return previous_entity;
4119 if (is_warn_on(why = WARN_SHADOW) ||
4120 (is_warn_on(why = WARN_SHADOW_LOCAL) && previous_entity->base.parent_scope != file_scope)) {
4121 char const *const what = get_entity_kind_name(previous_entity->kind);
4122 warningf(why, pos, "'%N' shadows %s (declared %P)", entity, what, ppos);
4126 if (entity->kind == ENTITY_FUNCTION) {
4127 if (is_definition &&
4128 entity->declaration.storage_class != STORAGE_CLASS_STATIC &&
4130 if (is_warn_on(WARN_MISSING_PROTOTYPES)) {
4131 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4133 goto warn_missing_declaration;
4136 } else if (entity->kind == ENTITY_VARIABLE) {
4137 if (current_scope == file_scope &&
4138 entity->declaration.storage_class == STORAGE_CLASS_NONE &&
4139 !entity->declaration.implicit) {
4140 warn_missing_declaration:
4141 if (is_type_valid(skip_typeref(entity->declaration.type)))
4142 warningf(WARN_MISSING_DECLARATIONS, pos, "no previous declaration for '%#N'", entity);
4147 environment_push(entity);
4148 append_entity(current_scope, entity);
4153 static void parser_error_multiple_definition(entity_t *entity,
4154 const position_t *pos)
4156 errorf(pos, "redefinition of '%N' (declared %P)", entity, &entity->base.pos);
4159 static bool is_declaration_specifier(const token_t *token)
4161 switch (token->kind) {
4165 return is_typedef_symbol(token->base.symbol);
4172 static void parse_init_declarator_rest(entity_t *entity)
4174 type_t *orig_type = type_error_type;
4176 if (entity->base.kind == ENTITY_TYPEDEF) {
4177 position_t const *const pos = &entity->base.pos;
4178 errorf(pos, "'%N' is initialized (use __typeof__ instead)", entity);
4180 assert(is_declaration(entity));
4181 orig_type = entity->declaration.type;
4184 type_t *type = skip_typeref(orig_type);
4186 if (entity->kind == ENTITY_VARIABLE
4187 && entity->variable.initializer != NULL) {
4188 parser_error_multiple_definition(entity, HERE);
4192 declaration_t *const declaration = &entity->declaration;
4193 bool must_be_constant = false;
4194 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4195 entity->base.parent_scope == file_scope) {
4196 must_be_constant = true;
4199 if (is_type_function(type)) {
4200 position_t const *const pos = &entity->base.pos;
4201 errorf(pos, "'%N' is initialized like a variable", entity);
4202 orig_type = type_error_type;
4205 parse_initializer_env_t env;
4206 env.type = orig_type;
4207 env.must_be_constant = must_be_constant;
4208 env.entity = entity;
4210 initializer_t *initializer = parse_initializer(&env);
4212 if (entity->kind == ENTITY_VARIABLE) {
4213 /* §6.7.5:22 array initializers for arrays with unknown size
4214 * determine the array type size */
4215 declaration->type = env.type;
4216 entity->variable.initializer = initializer;
4220 /* parse rest of a declaration without any declarator */
4221 static void parse_anonymous_declaration_rest(
4222 const declaration_specifiers_t *specifiers)
4225 anonymous_entity = NULL;
4227 position_t const *const pos = &specifiers->pos;
4228 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4229 specifiers->thread_local) {
4230 warningf(WARN_OTHER, pos, "useless storage class in empty declaration");
4233 type_t *type = specifiers->type;
4234 switch (type->kind) {
4235 case TYPE_COMPOUND_STRUCT:
4236 case TYPE_COMPOUND_UNION: {
4237 if (type->compound.compound->base.symbol == NULL) {
4238 warningf(WARN_OTHER, pos, "unnamed struct/union that defines no instances");
4247 warningf(WARN_OTHER, pos, "empty declaration");
4252 static void check_variable_type_complete(entity_t *ent)
4254 if (ent->kind != ENTITY_VARIABLE)
4257 /* §6.7:7 If an identifier for an object is declared with no linkage, the
4258 * type for the object shall be complete [...] */
4259 declaration_t *decl = &ent->declaration;
4260 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4261 decl->storage_class == STORAGE_CLASS_STATIC)
4264 type_t *const type = skip_typeref(decl->type);
4265 if (!is_type_incomplete(type))
4268 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4269 * are given length one. */
4270 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4271 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4275 errorf(&ent->base.pos, "variable '%#N' has incomplete type", ent);
4279 static void parse_declaration_rest(entity_t *ndeclaration,
4280 const declaration_specifiers_t *specifiers,
4281 parsed_declaration_func finished_declaration,
4282 declarator_flags_t flags)
4284 add_anchor_token(';');
4285 add_anchor_token(',');
4287 entity_t *entity = finished_declaration(ndeclaration, token.kind == '=');
4289 if (token.kind == '=') {
4290 parse_init_declarator_rest(entity);
4291 } else if (entity->kind == ENTITY_VARIABLE) {
4292 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
4293 * [...] where the extern specifier is explicitly used. */
4294 declaration_t *decl = &entity->declaration;
4295 if (decl->storage_class != STORAGE_CLASS_EXTERN &&
4296 is_type_reference(skip_typeref(decl->type))) {
4297 position_t const *const pos = &entity->base.pos;
4298 errorf(pos, "reference '%#N' must be initialized", entity);
4302 check_variable_type_complete(entity);
4307 add_anchor_token('=');
4308 ndeclaration = parse_declarator(specifiers, flags);
4309 rem_anchor_token('=');
4311 rem_anchor_token(',');
4312 rem_anchor_token(';');
4315 anonymous_entity = NULL;
4318 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4320 symbol_t *symbol = entity->base.symbol;
4324 assert(entity->base.namespc == NAMESPACE_NORMAL);
4325 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4326 if (previous_entity == NULL
4327 || previous_entity->base.parent_scope != current_scope) {
4328 errorf(&entity->base.pos, "expected declaration of a function parameter, found '%Y'",
4333 if (is_definition) {
4334 errorf(HERE, "'%N' is initialised", entity);
4337 return record_entity(entity, false);
4340 static void parse_declaration(parsed_declaration_func finished_declaration,
4341 declarator_flags_t flags)
4343 add_anchor_token(';');
4344 declaration_specifiers_t specifiers;
4345 parse_declaration_specifiers(&specifiers);
4346 rem_anchor_token(';');
4348 if (token.kind == ';') {
4349 parse_anonymous_declaration_rest(&specifiers);
4351 entity_t *entity = parse_declarator(&specifiers, flags);
4352 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4357 static type_t *get_default_promoted_type(type_t *orig_type)
4359 type_t *result = orig_type;
4361 type_t *type = skip_typeref(orig_type);
4362 if (is_type_integer(type)) {
4363 result = promote_integer(type);
4364 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4365 result = type_double;
4371 static void parse_kr_declaration_list(entity_t *entity)
4373 if (entity->kind != ENTITY_FUNCTION)
4376 type_t *type = skip_typeref(entity->declaration.type);
4377 assert(is_type_function(type));
4378 if (!type->function.kr_style_parameters)
4381 add_anchor_token('{');
4383 PUSH_SCOPE(&entity->function.parameters);
4385 entity_t *parameter = entity->function.parameters.entities;
4386 for ( ; parameter != NULL; parameter = parameter->base.next) {
4387 assert(parameter->base.parent_scope == NULL);
4388 parameter->base.parent_scope = current_scope;
4389 environment_push(parameter);
4392 /* parse declaration list */
4394 switch (token.kind) {
4396 /* This covers symbols, which are no type, too, and results in
4397 * better error messages. The typical cases are misspelled type
4398 * names and missing includes. */
4400 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4410 /* update function type */
4411 type_t *new_type = duplicate_type(type);
4413 function_parameter_t *parameters = NULL;
4414 function_parameter_t **anchor = ¶meters;
4416 /* did we have an earlier prototype? */
4417 entity_t *proto_type = get_entity(entity->base.symbol, NAMESPACE_NORMAL);
4418 if (proto_type != NULL && proto_type->kind != ENTITY_FUNCTION)
4421 function_parameter_t *proto_parameter = NULL;
4422 if (proto_type != NULL) {
4423 type_t *proto_type_type = proto_type->declaration.type;
4424 proto_parameter = proto_type_type->function.parameters;
4425 /* If a K&R function definition has a variadic prototype earlier, then
4426 * make the function definition variadic, too. This should conform to
4427 * §6.7.5.3:15 and §6.9.1:8. */
4428 new_type->function.variadic = proto_type_type->function.variadic;
4430 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
4432 new_type->function.unspecified_parameters = true;
4435 bool need_incompatible_warning = false;
4436 parameter = entity->function.parameters.entities;
4437 for (; parameter != NULL; parameter = parameter->base.next,
4439 proto_parameter == NULL ? NULL : proto_parameter->next) {
4440 if (parameter->kind != ENTITY_PARAMETER)
4443 type_t *parameter_type = parameter->declaration.type;
4444 if (parameter_type == NULL) {
4445 position_t const* const pos = ¶meter->base.pos;
4447 errorf(pos, "no type specified for function '%N'", parameter);
4448 parameter_type = type_error_type;
4450 warningf(WARN_IMPLICIT_INT, pos, "no type specified for function parameter '%N', using 'int'", parameter);
4451 parameter_type = type_int;
4453 parameter->declaration.type = parameter_type;
4456 semantic_parameter_incomplete(parameter);
4458 /* we need the default promoted types for the function type */
4459 type_t *not_promoted = parameter_type;
4460 parameter_type = get_default_promoted_type(parameter_type);
4462 /* gcc special: if the type of the prototype matches the unpromoted
4463 * type don't promote */
4464 if (!strict_mode && proto_parameter != NULL) {
4465 type_t *proto_p_type = skip_typeref(proto_parameter->type);
4466 type_t *promo_skip = skip_typeref(parameter_type);
4467 type_t *param_skip = skip_typeref(not_promoted);
4468 if (!types_compatible(proto_p_type, promo_skip)
4469 && types_compatible(proto_p_type, param_skip)) {
4471 need_incompatible_warning = true;
4472 parameter_type = not_promoted;
4475 function_parameter_t *const function_parameter
4476 = allocate_parameter(parameter_type);
4478 *anchor = function_parameter;
4479 anchor = &function_parameter->next;
4482 new_type->function.parameters = parameters;
4483 new_type = identify_new_type(new_type);
4485 if (need_incompatible_warning) {
4486 symbol_t const *const sym = entity->base.symbol;
4487 position_t const *const pos = &entity->base.pos;
4488 position_t const *const ppos = &proto_type->base.pos;
4489 warningf(WARN_OTHER, pos, "declaration '%#N' is incompatible with '%#T' (declared %P)", proto_type, new_type, sym, ppos);
4491 entity->declaration.type = new_type;
4493 rem_anchor_token('{');
4496 static bool first_err = true;
4499 * When called with first_err set, prints the name of the current function,
4502 static void print_in_function(void)
4506 char const *const file = current_function->base.base.pos.input_name;
4507 diagnosticf("%s: In '%N':\n", file, (entity_t const*)current_function);
4512 * Check if all labels are defined in the current function.
4513 * Check if all labels are used in the current function.
4515 static void check_labels(void)
4517 for (const goto_statement_t *goto_statement = goto_first;
4518 goto_statement != NULL;
4519 goto_statement = goto_statement->next) {
4520 label_t *label = goto_statement->label;
4521 if (label->base.pos.input_name == NULL) {
4522 print_in_function();
4523 position_t const *const pos = &goto_statement->base.pos;
4524 errorf(pos, "'%N' used but not defined", (entity_t const*)label);
4528 if (is_warn_on(WARN_UNUSED_LABEL)) {
4529 for (const label_statement_t *label_statement = label_first;
4530 label_statement != NULL;
4531 label_statement = label_statement->next) {
4532 label_t *label = label_statement->label;
4534 if (! label->used) {
4535 print_in_function();
4536 position_t const *const pos = &label_statement->base.pos;
4537 warningf(WARN_UNUSED_LABEL, pos, "'%N' defined but not used", (entity_t const*)label);
4543 static void warn_unused_entity(warning_t const why, entity_t *entity, entity_t *const last)
4545 entity_t const *const end = last != NULL ? last->base.next : NULL;
4546 for (; entity != end; entity = entity->base.next) {
4547 if (!is_declaration(entity))
4550 declaration_t *declaration = &entity->declaration;
4551 if (declaration->implicit)
4554 if (!declaration->used) {
4555 print_in_function();
4556 warningf(why, &entity->base.pos, "'%N' is unused", entity);
4557 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
4558 print_in_function();
4559 warningf(why, &entity->base.pos, "'%N' is never read", entity);
4564 static void check_unused_variables(statement_t *const stmt, void *const env)
4568 switch (stmt->kind) {
4569 case STATEMENT_DECLARATION: {
4570 declaration_statement_t const *const decls = &stmt->declaration;
4571 warn_unused_entity(WARN_UNUSED_VARIABLE, decls->declarations_begin, decls->declarations_end);
4576 warn_unused_entity(WARN_UNUSED_VARIABLE, stmt->fors.scope.entities, NULL);
4585 * Check declarations of current_function for unused entities.
4587 static void check_declarations(void)
4589 if (is_warn_on(WARN_UNUSED_PARAMETER)) {
4590 const scope_t *scope = ¤t_function->parameters;
4591 warn_unused_entity(WARN_UNUSED_PARAMETER, scope->entities, NULL);
4593 if (is_warn_on(WARN_UNUSED_VARIABLE)) {
4594 walk_statements(current_function->body, check_unused_variables, NULL);
4598 static int determine_truth(expression_t const* const cond)
4601 is_constant_expression(cond) != EXPR_CLASS_CONSTANT ? 0 :
4602 fold_constant_to_bool(cond) ? 1 :
4606 static void check_reachable(statement_t *);
4607 static bool reaches_end;
4609 static bool expression_returns(expression_t const *const expr)
4611 switch (expr->kind) {
4613 expression_t const *const func = expr->call.function;
4614 type_t const *const type = skip_typeref(func->base.type);
4615 if (type->kind == TYPE_POINTER) {
4616 type_t const *const points_to
4617 = skip_typeref(type->pointer.points_to);
4618 if (points_to->kind == TYPE_FUNCTION
4619 && points_to->function.modifiers & DM_NORETURN)
4623 if (!expression_returns(func))
4626 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
4627 if (!expression_returns(arg->expression))
4634 case EXPR_REFERENCE:
4635 case EXPR_ENUM_CONSTANT:
4636 case EXPR_LITERAL_CASES:
4637 case EXPR_LITERAL_CHARACTER:
4638 case EXPR_STRING_LITERAL:
4639 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
4640 case EXPR_LABEL_ADDRESS:
4641 case EXPR_CLASSIFY_TYPE:
4642 case EXPR_SIZEOF: // TODO handle obscure VLA case
4645 case EXPR_BUILTIN_CONSTANT_P:
4646 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
4651 case EXPR_STATEMENT: {
4652 bool old_reaches_end = reaches_end;
4653 reaches_end = false;
4654 check_reachable(expr->statement.statement);
4655 bool returns = reaches_end;
4656 reaches_end = old_reaches_end;
4660 case EXPR_CONDITIONAL:
4661 // TODO handle constant expression
4663 if (!expression_returns(expr->conditional.condition))
4666 if (expr->conditional.true_expression != NULL
4667 && expression_returns(expr->conditional.true_expression))
4670 return expression_returns(expr->conditional.false_expression);
4673 return expression_returns(expr->select.compound);
4675 case EXPR_ARRAY_ACCESS:
4677 expression_returns(expr->array_access.array_ref) &&
4678 expression_returns(expr->array_access.index);
4681 return expression_returns(expr->va_starte.ap);
4684 return expression_returns(expr->va_arge.ap);
4687 return expression_returns(expr->va_copye.src);
4689 case EXPR_UNARY_CASES_MANDATORY:
4690 return expression_returns(expr->unary.value);
4692 case EXPR_UNARY_THROW:
4695 case EXPR_BINARY_CASES:
4696 // TODO handle constant lhs of && and ||
4698 expression_returns(expr->binary.left) &&
4699 expression_returns(expr->binary.right);
4702 panic("unhandled expression");
4705 static bool initializer_returns(initializer_t const *const init)
4707 switch (init->kind) {
4708 case INITIALIZER_VALUE:
4709 return expression_returns(init->value.value);
4711 case INITIALIZER_LIST: {
4712 initializer_t * const* i = init->list.initializers;
4713 initializer_t * const* const end = i + init->list.len;
4714 bool returns = true;
4715 for (; i != end; ++i) {
4716 if (!initializer_returns(*i))
4722 case INITIALIZER_STRING:
4723 case INITIALIZER_DESIGNATOR: // designators have no payload
4726 panic("unhandled initializer");
4729 static bool noreturn_candidate;
4731 static void check_reachable(statement_t *const stmt)
4733 if (stmt->base.reachable)
4735 if (stmt->kind != STATEMENT_DO_WHILE)
4736 stmt->base.reachable = true;
4738 statement_t *last = stmt;
4740 switch (stmt->kind) {
4741 case STATEMENT_ERROR:
4742 case STATEMENT_EMPTY:
4744 next = stmt->base.next;
4747 case STATEMENT_DECLARATION: {
4748 declaration_statement_t const *const decl = &stmt->declaration;
4749 entity_t const * ent = decl->declarations_begin;
4750 entity_t const *const last_decl = decl->declarations_end;
4752 for (;; ent = ent->base.next) {
4753 if (ent->kind == ENTITY_VARIABLE &&
4754 ent->variable.initializer != NULL &&
4755 !initializer_returns(ent->variable.initializer)) {
4758 if (ent == last_decl)
4762 next = stmt->base.next;
4766 case STATEMENT_COMPOUND:
4767 next = stmt->compound.statements;
4769 next = stmt->base.next;
4772 case STATEMENT_RETURN: {
4773 expression_t const *const val = stmt->returns.value;
4774 if (val == NULL || expression_returns(val))
4775 noreturn_candidate = false;
4779 case STATEMENT_IF: {
4780 if_statement_t const *const ifs = &stmt->ifs;
4781 expression_t const *const cond = ifs->condition;
4783 if (!expression_returns(cond))
4786 int const val = determine_truth(cond);
4789 check_reachable(ifs->true_statement);
4794 if (ifs->false_statement != NULL) {
4795 check_reachable(ifs->false_statement);
4799 next = stmt->base.next;
4803 case STATEMENT_SWITCH: {
4804 switch_statement_t const *const switchs = &stmt->switchs;
4805 expression_t const *const expr = switchs->expression;
4807 if (!expression_returns(expr))
4810 if (is_constant_expression(expr) == EXPR_CLASS_CONSTANT) {
4811 ir_tarval *const val = fold_constant_to_tarval(expr);
4812 case_label_statement_t * defaults = NULL;
4813 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4814 if (i->expression == NULL) {
4819 if (i->first_case == val || i->last_case == val ||
4820 ((tarval_cmp(i->first_case, val) & ir_relation_less_equal)
4821 && (tarval_cmp(val, i->last_case) & ir_relation_less_equal))) {
4822 check_reachable((statement_t*)i);
4827 if (defaults != NULL) {
4828 check_reachable((statement_t*)defaults);
4832 bool has_default = false;
4833 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4834 if (i->expression == NULL)
4837 check_reachable((statement_t*)i);
4844 next = stmt->base.next;
4848 case STATEMENT_EXPRESSION: {
4849 /* Check for noreturn function call */
4850 expression_t const *const expr = stmt->expression.expression;
4851 if (!expression_returns(expr))
4854 next = stmt->base.next;
4858 case STATEMENT_CONTINUE:
4859 for (statement_t *parent = stmt;;) {
4860 parent = parent->base.parent;
4861 if (parent == NULL) /* continue not within loop */
4865 switch (parent->kind) {
4866 case STATEMENT_DO_WHILE: goto continue_do_while;
4867 case STATEMENT_FOR: goto continue_for;
4873 case STATEMENT_BREAK:
4874 for (statement_t *parent = stmt;;) {
4875 parent = parent->base.parent;
4876 if (parent == NULL) /* break not within loop/switch */
4879 switch (parent->kind) {
4880 case STATEMENT_SWITCH:
4881 case STATEMENT_DO_WHILE:
4884 next = parent->base.next;
4885 goto found_break_parent;
4893 case STATEMENT_COMPUTED_GOTO: {
4894 if (!expression_returns(stmt->computed_goto.expression))
4897 statement_t *parent = stmt->base.parent;
4898 if (parent == NULL) /* top level goto */
4904 case STATEMENT_GOTO:
4905 next = stmt->gotos.label->statement;
4906 if (next == NULL) /* missing label */
4910 case STATEMENT_LABEL:
4911 next = stmt->label.statement;
4914 case STATEMENT_CASE_LABEL:
4915 next = stmt->case_label.statement;
4918 case STATEMENT_DO_WHILE:
4919 next = stmt->do_while.body;
4922 case STATEMENT_FOR: {
4923 for_statement_t *const fors = &stmt->fors;
4925 if (fors->condition_reachable)
4927 fors->condition_reachable = true;
4929 expression_t const *const cond = fors->condition;
4934 } else if (expression_returns(cond)) {
4935 val = determine_truth(cond);
4941 check_reachable(fors->body);
4946 next = stmt->base.next;
4950 case STATEMENT_MS_TRY: {
4951 ms_try_statement_t const *const ms_try = &stmt->ms_try;
4952 check_reachable(ms_try->try_statement);
4953 next = ms_try->final_statement;
4957 case STATEMENT_LEAVE: {
4958 statement_t *parent = stmt;
4960 parent = parent->base.parent;
4961 if (parent == NULL) /* __leave not within __try */
4964 if (parent->kind == STATEMENT_MS_TRY) {
4966 next = parent->ms_try.final_statement;
4974 panic("invalid statement kind");
4977 while (next == NULL) {
4978 next = last->base.parent;
4980 noreturn_candidate = false;
4982 type_t *const type = skip_typeref(current_function->base.type);
4983 assert(is_type_function(type));
4984 type_t *const ret = skip_typeref(type->function.return_type);
4985 if (!is_type_void(ret) &&
4986 is_type_valid(ret) &&
4987 !is_main(current_entity)) {
4988 position_t const *const pos = &stmt->base.pos;
4989 warningf(WARN_RETURN_TYPE, pos, "control reaches end of non-void function");
4994 switch (next->kind) {
4995 case STATEMENT_ERROR:
4996 case STATEMENT_EMPTY:
4997 case STATEMENT_DECLARATION:
4998 case STATEMENT_EXPRESSION:
5000 case STATEMENT_RETURN:
5001 case STATEMENT_CONTINUE:
5002 case STATEMENT_BREAK:
5003 case STATEMENT_COMPUTED_GOTO:
5004 case STATEMENT_GOTO:
5005 case STATEMENT_LEAVE:
5006 panic("invalid control flow in function");
5008 case STATEMENT_COMPOUND:
5009 if (next->compound.stmt_expr) {
5015 case STATEMENT_SWITCH:
5016 case STATEMENT_LABEL:
5017 case STATEMENT_CASE_LABEL:
5019 next = next->base.next;
5022 case STATEMENT_DO_WHILE: {
5024 if (next->base.reachable)
5026 next->base.reachable = true;
5028 do_while_statement_t const *const dw = &next->do_while;
5029 expression_t const *const cond = dw->condition;
5031 if (!expression_returns(cond))
5034 int const val = determine_truth(cond);
5037 check_reachable(dw->body);
5043 next = next->base.next;
5047 case STATEMENT_FOR: {
5049 for_statement_t *const fors = &next->fors;
5051 fors->step_reachable = true;
5053 if (fors->condition_reachable)
5055 fors->condition_reachable = true;
5057 expression_t const *const cond = fors->condition;
5062 } else if (expression_returns(cond)) {
5063 val = determine_truth(cond);
5069 check_reachable(fors->body);
5075 next = next->base.next;
5079 case STATEMENT_MS_TRY:
5081 next = next->ms_try.final_statement;
5086 check_reachable(next);
5089 static void check_unreachable(statement_t* const stmt, void *const env)
5093 switch (stmt->kind) {
5094 case STATEMENT_DO_WHILE:
5095 if (!stmt->base.reachable) {
5096 expression_t const *const cond = stmt->do_while.condition;
5097 if (determine_truth(cond) >= 0) {
5098 position_t const *const pos = &cond->base.pos;
5099 warningf(WARN_UNREACHABLE_CODE, pos, "condition of do-while-loop is unreachable");
5104 case STATEMENT_FOR: {
5105 for_statement_t const* const fors = &stmt->fors;
5107 // if init and step are unreachable, cond is unreachable, too
5108 if (!stmt->base.reachable && !fors->step_reachable) {
5109 goto warn_unreachable;
5111 if (!stmt->base.reachable && fors->initialisation != NULL) {
5112 position_t const *const pos = &fors->initialisation->base.pos;
5113 warningf(WARN_UNREACHABLE_CODE, pos, "initialisation of for-statement is unreachable");
5116 if (!fors->condition_reachable && fors->condition != NULL) {
5117 position_t const *const pos = &fors->condition->base.pos;
5118 warningf(WARN_UNREACHABLE_CODE, pos, "condition of for-statement is unreachable");
5121 if (!fors->step_reachable && fors->step != NULL) {
5122 position_t const *const pos = &fors->step->base.pos;
5123 warningf(WARN_UNREACHABLE_CODE, pos, "step of for-statement is unreachable");
5129 case STATEMENT_COMPOUND:
5130 if (stmt->compound.statements != NULL)
5132 goto warn_unreachable;
5134 case STATEMENT_DECLARATION: {
5135 /* Only warn if there is at least one declarator with an initializer.
5136 * This typically occurs in switch statements. */
5137 declaration_statement_t const *const decl = &stmt->declaration;
5138 entity_t const * ent = decl->declarations_begin;
5139 entity_t const *const last = decl->declarations_end;
5141 for (;; ent = ent->base.next) {
5142 if (ent->kind == ENTITY_VARIABLE &&
5143 ent->variable.initializer != NULL) {
5144 goto warn_unreachable;
5154 if (!stmt->base.reachable) {
5155 position_t const *const pos = &stmt->base.pos;
5156 warningf(WARN_UNREACHABLE_CODE, pos, "statement is unreachable");
5162 static bool is_main(entity_t *entity)
5164 static symbol_t *sym_main = NULL;
5165 if (sym_main == NULL) {
5166 sym_main = symbol_table_insert("main");
5169 if (entity->base.symbol != sym_main)
5171 /* must be in outermost scope */
5172 if (entity->base.parent_scope != file_scope)
5178 static void prepare_main_collect2(entity_t*);
5180 static void parse_external_declaration(void)
5182 /* function-definitions and declarations both start with declaration
5184 add_anchor_token(';');
5185 declaration_specifiers_t specifiers;
5186 parse_declaration_specifiers(&specifiers);
5187 rem_anchor_token(';');
5189 /* must be a declaration */
5190 if (token.kind == ';') {
5191 parse_anonymous_declaration_rest(&specifiers);
5195 add_anchor_token(',');
5196 add_anchor_token('=');
5197 add_anchor_token(';');
5198 add_anchor_token('{');
5200 /* declarator is common to both function-definitions and declarations */
5201 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
5203 rem_anchor_token('{');
5204 rem_anchor_token(';');
5205 rem_anchor_token('=');
5206 rem_anchor_token(',');
5208 /* must be a declaration */
5209 switch (token.kind) {
5213 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
5218 /* must be a function definition */
5219 parse_kr_declaration_list(ndeclaration);
5221 if (token.kind != '{') {
5222 parse_error_expected("while parsing function definition", '{', NULL);
5223 eat_until_matching_token(';');
5227 assert(is_declaration(ndeclaration));
5228 type_t *const orig_type = ndeclaration->declaration.type;
5229 type_t * type = skip_typeref(orig_type);
5231 if (!is_type_function(type)) {
5232 if (is_type_valid(type)) {
5233 errorf(HERE, "declarator '%#N' has a body but is not a function type", ndeclaration);
5239 position_t const *const pos = &ndeclaration->base.pos;
5240 if (is_typeref(orig_type)) {
5242 errorf(pos, "type of function definition '%#N' is a typedef", ndeclaration);
5245 if (is_type_compound(skip_typeref(type->function.return_type))) {
5246 warningf(WARN_AGGREGATE_RETURN, pos, "'%N' returns an aggregate", ndeclaration);
5248 if (type->function.unspecified_parameters) {
5249 warningf(WARN_OLD_STYLE_DEFINITION, pos, "old-style definition of '%N'", ndeclaration);
5251 warningf(WARN_TRADITIONAL, pos, "traditional C rejects ISO C style definition of '%N'", ndeclaration);
5254 /* §6.7.5.3:14 a function definition with () means no
5255 * parameters (and not unspecified parameters) */
5256 if (type->function.unspecified_parameters &&
5257 type->function.parameters == NULL) {
5258 type_t *copy = duplicate_type(type);
5259 copy->function.unspecified_parameters = false;
5260 type = identify_new_type(copy);
5262 ndeclaration->declaration.type = type;
5265 entity_t *const entity = record_entity(ndeclaration, true);
5266 assert(entity->kind == ENTITY_FUNCTION);
5267 assert(ndeclaration->kind == ENTITY_FUNCTION);
5269 function_t *const function = &entity->function;
5270 if (ndeclaration != entity) {
5271 function->parameters = ndeclaration->function.parameters;
5274 PUSH_SCOPE(&function->parameters);
5276 entity_t *parameter = function->parameters.entities;
5277 for (; parameter != NULL; parameter = parameter->base.next) {
5278 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5279 parameter->base.parent_scope = current_scope;
5281 assert(parameter->base.parent_scope == NULL
5282 || parameter->base.parent_scope == current_scope);
5283 parameter->base.parent_scope = current_scope;
5284 if (parameter->base.symbol == NULL) {
5285 errorf(¶meter->base.pos, "parameter name omitted");
5288 environment_push(parameter);
5291 if (function->body != NULL) {
5292 parser_error_multiple_definition(entity, HERE);
5295 /* parse function body */
5296 int label_stack_top = label_top();
5297 function_t *old_current_function = current_function;
5298 current_function = function;
5299 PUSH_CURRENT_ENTITY(entity);
5303 goto_anchor = &goto_first;
5305 label_anchor = &label_first;
5307 statement_t *const body = parse_compound_statement(false);
5308 function->body = body;
5311 check_declarations();
5312 if (is_warn_on(WARN_RETURN_TYPE) ||
5313 is_warn_on(WARN_UNREACHABLE_CODE) ||
5314 (is_warn_on(WARN_MISSING_NORETURN) && !(function->base.modifiers & DM_NORETURN))) {
5315 noreturn_candidate = true;
5316 check_reachable(body);
5317 if (is_warn_on(WARN_UNREACHABLE_CODE))
5318 walk_statements(body, check_unreachable, NULL);
5319 if (noreturn_candidate &&
5320 !(function->base.modifiers & DM_NORETURN)) {
5321 position_t const *const pos = &body->base.pos;
5322 warningf(WARN_MISSING_NORETURN, pos, "function '%#N' is candidate for attribute 'noreturn'", entity);
5326 if (is_main(entity)) {
5327 /* Force main to C linkage. */
5328 type_t *const type = entity->declaration.type;
5329 assert(is_type_function(type));
5330 if (type->function.linkage != LINKAGE_C) {
5331 type_t *new_type = duplicate_type(type);
5332 new_type->function.linkage = LINKAGE_C;
5333 entity->declaration.type = identify_new_type(new_type);
5336 if (enable_main_collect2_hack)
5337 prepare_main_collect2(entity);
5340 POP_CURRENT_ENTITY();
5342 assert(current_function == function);
5343 current_function = old_current_function;
5344 label_pop_to(label_stack_top);
5350 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
5352 entity_t *iter = compound->members.entities;
5353 for (; iter != NULL; iter = iter->base.next) {
5354 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5357 if (iter->base.symbol == symbol) {
5359 } else if (iter->base.symbol == NULL) {
5360 /* search in anonymous structs and unions */
5361 type_t *type = skip_typeref(iter->declaration.type);
5362 if (is_type_compound(type)) {
5363 if (find_compound_entry(type->compound.compound, symbol)
5374 static void check_deprecated(const position_t *pos, const entity_t *entity)
5376 if (!is_declaration(entity))
5378 if ((entity->declaration.modifiers & DM_DEPRECATED) == 0)
5381 position_t const *const epos = &entity->base.pos;
5382 char const *const msg = get_deprecated_string(entity->declaration.attributes);
5384 warningf(WARN_DEPRECATED_DECLARATIONS, pos, "'%N' is deprecated (declared %P): \"%s\"", entity, epos, msg);
5386 warningf(WARN_DEPRECATED_DECLARATIONS, pos, "'%N' is deprecated (declared %P)", entity, epos);
5391 static expression_t *create_select(const position_t *pos, expression_t *addr,
5392 type_qualifiers_t qualifiers,
5395 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
5397 check_deprecated(pos, entry);
5399 expression_t *select = allocate_expression_zero(EXPR_SELECT);
5400 select->select.compound = addr;
5401 select->select.compound_entry = entry;
5403 type_t *entry_type = entry->declaration.type;
5404 type_t *res_type = get_qualified_type(entry_type, qualifiers);
5406 /* bitfields need special treatment */
5407 if (entry->compound_member.bitfield) {
5408 unsigned bit_size = entry->compound_member.bit_size;
5409 /* if fewer bits than an int, convert to int (see §6.3.1.1) */
5410 if (bit_size < get_atomic_type_size(ATOMIC_TYPE_INT) * BITS_PER_BYTE) {
5411 res_type = type_int;
5415 /* we always do the auto-type conversions; the & and sizeof parser contains
5416 * code to revert this! */
5417 select->base.type = automatic_type_conversion(res_type);
5424 * Find entry with symbol in compound. Search anonymous structs and unions and
5425 * creates implicit select expressions for them.
5426 * Returns the adress for the innermost compound.
5428 static expression_t *find_create_select(const position_t *pos,
5430 type_qualifiers_t qualifiers,
5431 compound_t *compound, symbol_t *symbol)
5433 entity_t *iter = compound->members.entities;
5434 for (; iter != NULL; iter = iter->base.next) {
5435 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5438 symbol_t *iter_symbol = iter->base.symbol;
5439 if (iter_symbol == NULL) {
5440 type_t *type = iter->declaration.type;
5441 if (!is_type_compound(type))
5444 compound_t *sub_compound = type->compound.compound;
5446 if (find_compound_entry(sub_compound, symbol) == NULL)
5449 expression_t *sub_addr = create_select(pos, addr, qualifiers, iter);
5450 sub_addr->base.pos = *pos;
5451 sub_addr->base.implicit = true;
5452 return find_create_select(pos, sub_addr, qualifiers, sub_compound,
5456 if (iter_symbol == symbol) {
5457 return create_select(pos, addr, qualifiers, iter);
5464 static void parse_bitfield_member(entity_t *entity)
5468 expression_t *size = parse_constant_expression();
5471 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5472 type_t *type = entity->declaration.type;
5473 if (!is_type_integer(skip_typeref(type))) {
5474 errorf(HERE, "bitfield base type '%T' is not an integer type",
5478 if (is_constant_expression(size) != EXPR_CLASS_CONSTANT) {
5479 /* error already reported by parse_constant_expression */
5480 size_long = get_type_size(type) * 8;
5482 size_long = fold_constant_to_int(size);
5484 const symbol_t *symbol = entity->base.symbol;
5485 const symbol_t *user_symbol
5486 = symbol == NULL ? sym_anonymous : symbol;
5487 unsigned bit_size = get_type_size(type) * 8;
5488 if (size_long < 0) {
5489 errorf(HERE, "negative width in bit-field '%Y'", user_symbol);
5490 } else if (size_long == 0 && symbol != NULL) {
5491 errorf(HERE, "zero width for bit-field '%Y'", user_symbol);
5492 } else if (bit_size > 0 && (unsigned)size_long > bit_size) {
5493 errorf(HERE, "width of bitfield '%Y' exceeds its type",
5496 /* hope that people don't invent crazy types with more bits
5497 * than our struct can hold */
5499 (1 << sizeof(entity->compound_member.bit_size)*8));
5503 entity->compound_member.bitfield = true;
5504 entity->compound_member.bit_size = (unsigned char)size_long;
5507 static void parse_compound_declarators(compound_t *compound,
5508 const declaration_specifiers_t *specifiers)
5510 add_anchor_token(';');
5511 add_anchor_token(',');
5515 if (token.kind == ':') {
5516 /* anonymous bitfield */
5517 type_t *type = specifiers->type;
5518 entity_t *const entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, NULL, HERE);
5519 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
5520 entity->declaration.storage_class = STORAGE_CLASS_NONE;
5521 entity->declaration.type = type;
5523 parse_bitfield_member(entity);
5525 attribute_t *attributes = parse_attributes(NULL);
5526 attribute_t **anchor = &attributes;
5527 while (*anchor != NULL)
5528 anchor = &(*anchor)->next;
5529 *anchor = specifiers->attributes;
5530 if (attributes != NULL) {
5531 handle_entity_attributes(attributes, entity);
5533 entity->declaration.attributes = attributes;
5535 append_entity(&compound->members, entity);
5537 entity = parse_declarator(specifiers,
5538 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
5539 position_t const *const pos = &entity->base.pos;
5540 if (entity->kind == ENTITY_TYPEDEF) {
5541 errorf(pos, "typedef not allowed as compound member");
5543 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5545 /* make sure we don't define a symbol multiple times */
5546 symbol_t *symbol = entity->base.symbol;
5547 if (symbol != NULL) {
5548 entity_t *prev = find_compound_entry(compound, symbol);
5550 position_t const *const ppos = &prev->base.pos;
5551 errorf(pos, "multiple declarations of '%N' (declared %P)", entity, ppos);
5555 if (token.kind == ':') {
5556 parse_bitfield_member(entity);
5558 attribute_t *attributes = parse_attributes(NULL);
5559 handle_entity_attributes(attributes, entity);
5561 type_t *orig_type = entity->declaration.type;
5562 type_t *type = skip_typeref(orig_type);
5563 if (is_type_function(type)) {
5564 errorf(pos, "'%N' must not have function type '%T'", entity, orig_type);
5565 } else if (is_type_incomplete(type)) {
5566 /* §6.7.2.1:16 flexible array member */
5567 if (!is_type_array(type) ||
5568 token.kind != ';' ||
5569 look_ahead(1)->kind != '}') {
5570 errorf(pos, "'%N' has incomplete type '%T'", entity, orig_type);
5571 } else if (compound->members.entities == NULL) {
5572 errorf(pos, "flexible array member in otherwise empty struct");
5577 append_entity(&compound->members, entity);
5580 } while (accept(','));
5581 rem_anchor_token(',');
5582 rem_anchor_token(';');
5585 anonymous_entity = NULL;
5588 static void parse_compound_type_entries(compound_t *compound)
5591 add_anchor_token('}');
5594 switch (token.kind) {
5596 case T___extension__:
5597 case T_IDENTIFIER: {
5599 declaration_specifiers_t specifiers;
5600 parse_declaration_specifiers(&specifiers);
5601 parse_compound_declarators(compound, &specifiers);
5607 rem_anchor_token('}');
5610 compound->complete = true;
5616 static type_t *parse_typename(void)
5618 declaration_specifiers_t specifiers;
5619 parse_declaration_specifiers(&specifiers);
5620 if (specifiers.storage_class != STORAGE_CLASS_NONE
5621 || specifiers.thread_local) {
5622 /* TODO: improve error message, user does probably not know what a
5623 * storage class is...
5625 errorf(&specifiers.pos, "typename must not have a storage class");
5628 type_t *result = parse_abstract_declarator(specifiers.type);
5636 typedef expression_t* (*parse_expression_function)(void);
5637 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
5639 typedef struct expression_parser_function_t expression_parser_function_t;
5640 struct expression_parser_function_t {
5641 parse_expression_function parser;
5642 precedence_t infix_precedence;
5643 parse_expression_infix_function infix_parser;
5646 static expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5648 static type_t *get_string_type(string_encoding_t const enc)
5650 bool const warn = is_warn_on(WARN_WRITE_STRINGS);
5652 case STRING_ENCODING_CHAR:
5653 case STRING_ENCODING_UTF8: return warn ? type_const_char_ptr : type_char_ptr;
5654 case STRING_ENCODING_CHAR16: return warn ? type_char16_t_const_ptr : type_char16_t_ptr;
5655 case STRING_ENCODING_CHAR32: return warn ? type_char32_t_const_ptr : type_char32_t_ptr;
5656 case STRING_ENCODING_WIDE: return warn ? type_const_wchar_t_ptr : type_wchar_t_ptr;
5658 panic("invalid string encoding");
5662 * Parse a string constant.
5664 static expression_t *parse_string_literal(void)
5666 expression_t *const expr = allocate_expression_zero(EXPR_STRING_LITERAL);
5667 expr->string_literal.value = concat_string_literals();
5668 expr->base.type = get_string_type(expr->string_literal.value.encoding);
5673 * Parse a boolean constant.
5675 static expression_t *parse_boolean_literal(bool value)
5677 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_BOOLEAN);
5678 literal->base.type = type_bool;
5679 literal->literal.value.begin = value ? "true" : "false";
5680 literal->literal.value.size = value ? 4 : 5;
5682 eat(value ? T_true : T_false);
5686 static void warn_traditional_suffix(char const *const suffix)
5688 warningf(WARN_TRADITIONAL, HERE, "traditional C rejects the '%s' suffix", suffix);
5691 static void check_integer_suffix(expression_t *const expr, char const *const suffix)
5693 unsigned spec = SPECIFIER_NONE;
5694 char const *c = suffix;
5695 while (*c != '\0') {
5700 add = SPECIFIER_LONG;
5702 add |= SPECIFIER_LONG_LONG;
5708 add = SPECIFIER_UNSIGNED;
5716 add = SPECIFIER_COMPLEX;
5730 switch (spec & ~SPECIFIER_COMPLEX) {
5731 case SPECIFIER_NONE: type = type_int; break;
5732 case SPECIFIER_LONG: type = type_long; break;
5733 case SPECIFIER_LONG | SPECIFIER_LONG_LONG: type = type_long_long; break;
5734 case SPECIFIER_UNSIGNED: type = type_unsigned_int; break;
5735 case SPECIFIER_UNSIGNED | SPECIFIER_LONG: type = type_unsigned_long; break;
5736 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG: type = type_unsigned_long_long; break;
5737 default: panic("inconsistent suffix");
5739 if (spec != SPECIFIER_NONE && spec != SPECIFIER_LONG) {
5740 warn_traditional_suffix(suffix);
5742 if (spec & SPECIFIER_COMPLEX) {
5743 assert(type->kind == TYPE_ATOMIC);
5744 type = make_complex_type(type->atomic.akind, TYPE_QUALIFIER_NONE);
5746 expr->base.type = type;
5747 /* Integer type depends on the size of the number and the size
5748 * representable by the types. The backend/codegeneration has to
5749 * determine that. */
5750 determine_literal_type(&expr->literal);
5753 errorf(HERE, "invalid suffix '%s' on integer constant", suffix);
5757 static void check_floatingpoint_suffix(expression_t *const expr, char const *const suffix)
5760 char const *c = suffix;
5761 bool is_complex = false;
5765 case 'f': type = type_float; ++c; break;
5767 case 'l': type = type_long_double; ++c; break;
5777 default: type = type_double; break;
5782 assert(type->kind == TYPE_ATOMIC);
5783 type = make_complex_type(type->atomic.akind, TYPE_QUALIFIER_NONE);
5786 expr->base.type = type;
5787 if (suffix[0] != '\0') {
5788 warn_traditional_suffix(suffix);
5791 errorf(HERE, "invalid suffix '%s' on floatingpoint constant", suffix);
5795 static expression_t *parse_number_literal(void)
5797 string_t const *const str = &token.literal.string;
5798 char const * i = str->begin;
5799 unsigned digits = 0;
5800 bool is_float = false;
5802 /* Parse base prefix. */
5806 case 'B': case 'b': base = 2; ++i; break;
5807 case 'X': case 'x': base = 16; ++i; break;
5808 default: base = 8; digits |= 1U << 0; break;
5814 /* Parse mantissa. */
5820 errorf(HERE, "multiple decimal points in %K", &token);
5829 case '0': digit = 0; break;
5830 case '1': digit = 1; break;
5831 case '2': digit = 2; break;
5832 case '3': digit = 3; break;
5833 case '4': digit = 4; break;
5834 case '5': digit = 5; break;
5835 case '6': digit = 6; break;
5836 case '7': digit = 7; break;
5837 case '8': digit = 8; break;
5838 case '9': digit = 9; break;
5839 case 'A': case 'a': digit = 10; break;
5840 case 'B': case 'b': digit = 11; break;
5841 case 'C': case 'c': digit = 12; break;
5842 case 'D': case 'd': digit = 13; break;
5843 case 'E': case 'e': digit = 14; break;
5844 case 'F': case 'f': digit = 15; break;
5846 default: goto done_mantissa;
5849 if (digit >= 10 && base != 16)
5852 digits |= 1U << digit;
5856 /* Parse exponent. */
5860 errorf(HERE, "binary floating %K not allowed", &token);
5865 if (*i == 'E' || *i == 'e') {
5867 goto parse_exponent;
5872 if (*i == 'P' || *i == 'p') {
5877 if (*i == '-' || *i == '+')
5883 } while (isdigit(*i));
5885 errorf(HERE, "exponent of %K has no digits", &token);
5887 } else if (is_float) {
5888 errorf(HERE, "hexadecimal floating %K requires an exponent", &token);
5894 panic("invalid base");
5898 expression_t *const expr = allocate_expression_zero(is_float ? EXPR_LITERAL_FLOATINGPOINT : EXPR_LITERAL_INTEGER);
5899 expr->literal.value = *str;
5903 errorf(HERE, "%K has no digits", &token);
5904 } else if (digits & ~((1U << base) - 1)) {
5905 errorf(HERE, "invalid digit in %K", &token);
5907 expr->literal.suffix = i;
5909 check_floatingpoint_suffix(expr, i);
5911 check_integer_suffix(expr, i);
5921 * Parse a character constant.
5923 static expression_t *parse_character_constant(void)
5925 expression_t *const literal = allocate_expression_zero(EXPR_LITERAL_CHARACTER);
5926 literal->string_literal.value = token.literal.string;
5928 size_t const size = get_string_len(&token.literal.string);
5929 switch (token.literal.string.encoding) {
5930 case STRING_ENCODING_CHAR:
5931 case STRING_ENCODING_UTF8:
5932 literal->base.type = c_mode & _CXX ? type_char : type_int;
5934 if (!GNU_MODE && !(c_mode & _C99)) {
5935 errorf(HERE, "more than 1 character in character constant");
5937 literal->base.type = type_int;
5938 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
5943 case STRING_ENCODING_CHAR16: literal->base.type = type_char16_t; goto warn_multi;
5944 case STRING_ENCODING_CHAR32: literal->base.type = type_char32_t; goto warn_multi;
5945 case STRING_ENCODING_WIDE: literal->base.type = type_wchar_t; goto warn_multi;
5948 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
5953 eat(T_CHARACTER_CONSTANT);
5957 static entity_t *create_implicit_function(symbol_t *symbol, position_t const *const pos)
5959 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
5960 ntype->function.return_type = type_int;
5961 ntype->function.unspecified_parameters = true;
5962 ntype->function.linkage = LINKAGE_C;
5963 type_t *type = identify_new_type(ntype);
5965 entity_t *const entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, symbol, pos);
5966 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
5967 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
5968 entity->declaration.type = type;
5969 entity->declaration.implicit = true;
5971 if (current_scope != NULL)
5972 record_entity(entity, false);
5978 * Performs automatic type cast as described in §6.3.2.1.
5980 * @param orig_type the original type
5982 static type_t *automatic_type_conversion(type_t *orig_type)
5984 type_t *type = skip_typeref(orig_type);
5985 if (is_type_array(type)) {
5986 array_type_t *array_type = &type->array;
5987 type_t *element_type = array_type->element_type;
5988 unsigned qualifiers = array_type->base.qualifiers;
5990 return make_pointer_type(element_type, qualifiers);
5993 if (is_type_function(type)) {
5994 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6001 * reverts the automatic casts of array to pointer types and function
6002 * to function-pointer types as defined §6.3.2.1
6004 type_t *revert_automatic_type_conversion(const expression_t *expression)
6006 switch (expression->kind) {
6007 case EXPR_REFERENCE: {
6008 entity_t *entity = expression->reference.entity;
6009 if (is_declaration(entity)) {
6010 return entity->declaration.type;
6011 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6012 return entity->enum_value.enum_type;
6014 panic("no declaration or enum in reference");
6019 entity_t *entity = expression->select.compound_entry;
6020 assert(is_declaration(entity));
6021 type_t *type = entity->declaration.type;
6022 return get_qualified_type(type, expression->base.type->base.qualifiers);
6025 case EXPR_UNARY_DEREFERENCE: {
6026 const expression_t *const value = expression->unary.value;
6027 type_t *const type = skip_typeref(value->base.type);
6028 if (!is_type_pointer(type))
6029 return type_error_type;
6030 return type->pointer.points_to;
6033 case EXPR_ARRAY_ACCESS: {
6034 const expression_t *array_ref = expression->array_access.array_ref;
6035 type_t *type_left = skip_typeref(array_ref->base.type);
6036 if (!is_type_pointer(type_left))
6037 return type_error_type;
6038 return type_left->pointer.points_to;
6041 case EXPR_STRING_LITERAL: {
6042 size_t const size = get_string_len(&expression->string_literal.value) + 1;
6043 type_t *const elem = get_unqualified_type(expression->base.type->pointer.points_to);
6044 return make_array_type(elem, size, TYPE_QUALIFIER_NONE);
6047 case EXPR_COMPOUND_LITERAL:
6048 return expression->compound_literal.type;
6053 return expression->base.type;
6057 * Find an entity matching a symbol in a scope.
6058 * Uses current scope if scope is NULL
6060 static entity_t *lookup_entity(const scope_t *scope, symbol_t *symbol,
6061 namespace_tag_t namespc)
6063 if (scope == NULL) {
6064 return get_entity(symbol, namespc);
6067 /* we should optimize here, if scope grows above a certain size we should
6068 construct a hashmap here... */
6069 entity_t *entity = scope->entities;
6070 for ( ; entity != NULL; entity = entity->base.next) {
6071 if (entity->base.symbol == symbol
6072 && (namespace_tag_t)entity->base.namespc == namespc)
6079 static entity_t *parse_qualified_identifier(void)
6081 /* namespace containing the symbol */
6084 const scope_t *lookup_scope = NULL;
6086 if (accept(T_COLONCOLON))
6087 lookup_scope = &unit->scope;
6091 symbol = expect_identifier("while parsing identifier", &pos);
6093 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6096 entity = lookup_entity(lookup_scope, symbol, NAMESPACE_NORMAL);
6098 if (!accept(T_COLONCOLON))
6101 switch (entity->kind) {
6102 case ENTITY_NAMESPACE:
6103 lookup_scope = &entity->namespacee.members;
6108 lookup_scope = &entity->compound.members;
6111 errorf(&pos, "'%Y' must be a namespace, class, struct or union (but is a %s)",
6112 symbol, get_entity_kind_name(entity->kind));
6114 /* skip further qualifications */
6115 while (accept(T_IDENTIFIER) && accept(T_COLONCOLON)) {}
6117 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6121 if (entity == NULL) {
6122 if (!strict_mode && token.kind == '(') {
6123 /* an implicitly declared function */
6124 entity = create_implicit_function(symbol, &pos);
6125 warningf(WARN_IMPLICIT_FUNCTION_DECLARATION, &pos, "implicit declaration of '%N'", entity);
6127 errorf(&pos, "unknown identifier '%Y' found.", symbol);
6128 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6135 static expression_t *parse_reference(void)
6137 position_t const pos = *HERE;
6138 entity_t *const entity = parse_qualified_identifier();
6141 if (is_declaration(entity)) {
6142 orig_type = entity->declaration.type;
6143 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6144 orig_type = entity->enum_value.enum_type;
6146 panic("expected declaration or enum value in reference");
6149 /* we always do the auto-type conversions; the & and sizeof parser contains
6150 * code to revert this! */
6151 type_t *type = automatic_type_conversion(orig_type);
6153 expression_kind_t kind = EXPR_REFERENCE;
6154 if (entity->kind == ENTITY_ENUM_VALUE)
6155 kind = EXPR_ENUM_CONSTANT;
6157 expression_t *expression = allocate_expression_zero(kind);
6158 expression->base.pos = pos;
6159 expression->base.type = type;
6160 expression->reference.entity = entity;
6162 /* this declaration is used */
6163 if (is_declaration(entity)) {
6164 entity->declaration.used = true;
6167 if (entity->base.parent_scope != file_scope
6168 && (current_function != NULL
6169 && entity->base.parent_scope->depth < current_function->parameters.depth)
6170 && (entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER)) {
6171 /* access of a variable from an outer function */
6172 entity->variable.address_taken = true;
6173 current_function->need_closure = true;
6176 check_deprecated(&pos, entity);
6181 static bool semantic_cast(expression_t *cast)
6183 expression_t *expression = cast->unary.value;
6184 type_t *orig_dest_type = cast->base.type;
6185 type_t *orig_type_right = expression->base.type;
6186 type_t const *dst_type = skip_typeref(orig_dest_type);
6187 type_t const *src_type = skip_typeref(orig_type_right);
6188 position_t const *pos = &cast->base.pos;
6190 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation
6191 * than for utility. */
6192 if (is_type_void(dst_type))
6195 /* only integer and pointer can be casted to pointer */
6196 if (is_type_pointer(dst_type) &&
6197 !is_type_pointer(src_type) &&
6198 !is_type_integer(src_type) &&
6199 is_type_valid(src_type)) {
6200 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6204 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6205 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6209 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6210 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6214 if (is_type_pointer(src_type) && is_type_pointer(dst_type)) {
6215 type_t *src = skip_typeref(src_type->pointer.points_to);
6216 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6217 unsigned missing_qualifiers =
6218 src->base.qualifiers & ~dst->base.qualifiers;
6219 if (missing_qualifiers != 0) {
6220 warningf(WARN_CAST_QUAL, pos, "cast discards qualifiers '%Q' in pointer target type of '%T'", missing_qualifiers, orig_type_right);
6226 static void semantic_complex_extract(unary_expression_t *extract)
6228 type_t *orig_value_type = extract->value->base.type;
6229 type_t *value_type = skip_typeref(orig_value_type);
6230 if (!is_type_valid(value_type)) {
6231 extract->base.type = type_error_type;
6235 type_t *type = value_type;
6236 if (!is_type_complex(type)) {
6237 if (!is_type_arithmetic(type)) {
6238 errorf(&extract->base.pos,
6239 "%s requires an argument with complex or arithmetic type, got '%T'",
6240 extract->base.kind == EXPR_UNARY_IMAG ? "__imag__" : "__real__",
6242 extract->base.type = type_error_type;
6245 atomic_type_kind_t const akind = get_arithmetic_akind(type);
6246 type = make_complex_type(akind, TYPE_QUALIFIER_NONE);
6247 extract->value = create_implicit_cast(extract->value, type);
6249 assert(type->kind == TYPE_COMPLEX);
6250 type = make_atomic_type(type->atomic.akind, TYPE_QUALIFIER_NONE);
6251 extract->base.type = type;
6254 static expression_t *parse_compound_literal(position_t const *const pos,
6257 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6258 expression->base.pos = *pos;
6259 bool global_scope = current_scope == file_scope;
6261 parse_initializer_env_t env;
6264 env.must_be_constant = global_scope;
6265 initializer_t *initializer = parse_initializer(&env);
6268 expression->base.type = automatic_type_conversion(type);
6269 expression->compound_literal.initializer = initializer;
6270 expression->compound_literal.type = type;
6271 expression->compound_literal.global_scope = global_scope;
6277 * Parse a cast expression.
6279 static expression_t *parse_cast(void)
6281 position_t const pos = *HERE;
6284 add_anchor_token(')');
6286 type_t *type = parse_typename();
6288 rem_anchor_token(')');
6291 if (token.kind == '{') {
6292 return parse_compound_literal(&pos, type);
6295 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6296 cast->base.pos = pos;
6298 expression_t *value = parse_subexpression(PREC_CAST);
6299 cast->base.type = type;
6300 cast->unary.value = value;
6302 if (!semantic_cast(cast)) {
6303 cast->base.type = type_error_type;
6309 static expression_t *parse_complex_extract_expression(void)
6311 expression_kind_t kind;
6312 if (token.kind == T___imag__) {
6313 kind = EXPR_UNARY_IMAG;
6315 assert(token.kind == T___real__);
6316 kind = EXPR_UNARY_REAL;
6318 expression_t *extract = allocate_expression_zero(kind);
6319 extract->base.pos = *HERE;
6322 extract->unary.value = parse_subexpression(PREC_CAST);
6323 semantic_complex_extract(&extract->unary);
6328 * Parse a statement expression.
6330 static expression_t *parse_statement_expression(void)
6332 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6335 add_anchor_token(')');
6337 statement_t *statement = parse_compound_statement(true);
6338 statement->compound.stmt_expr = true;
6339 expression->statement.statement = statement;
6341 /* find last statement and use its type */
6342 type_t *type = type_void;
6343 const statement_t *stmt = statement->compound.statements;
6345 while (stmt->base.next != NULL)
6346 stmt = stmt->base.next;
6348 if (stmt->kind == STATEMENT_EXPRESSION) {
6349 type = stmt->expression.expression->base.type;
6352 position_t const *const pos = &expression->base.pos;
6353 warningf(WARN_OTHER, pos, "empty statement expression ({})");
6355 expression->base.type = type;
6357 rem_anchor_token(')');
6363 * Parse a parenthesized expression.
6365 static expression_t *parse_parenthesized_expression(void)
6367 token_t const* const la1 = look_ahead(1);
6368 switch (la1->kind) {
6370 /* gcc extension: a statement expression */
6371 return parse_statement_expression();
6374 if (is_typedef_symbol(la1->base.symbol)) {
6376 return parse_cast();
6381 add_anchor_token(')');
6382 expression_t *result = parse_expression();
6383 result->base.parenthesized = true;
6384 rem_anchor_token(')');
6390 static expression_t *parse_function_keyword(funcname_kind_t const kind)
6392 if (current_function == NULL) {
6393 errorf(HERE, "%K used outside of a function", &token);
6396 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6397 expression->base.type = type_char_ptr;
6398 expression->funcname.kind = kind;
6405 static designator_t *parse_designator(void)
6407 designator_t *const result = allocate_ast_zero(sizeof(result[0]));
6408 result->symbol = expect_identifier("while parsing member designator", &result->pos);
6409 if (!result->symbol)
6412 designator_t *last_designator = result;
6415 designator_t *const designator = allocate_ast_zero(sizeof(result[0]));
6416 designator->symbol = expect_identifier("while parsing member designator", &designator->pos);
6417 if (!designator->symbol)
6420 last_designator->next = designator;
6421 last_designator = designator;
6425 add_anchor_token(']');
6426 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6427 designator->pos = *HERE;
6428 designator->array_index = parse_expression();
6429 rem_anchor_token(']');
6431 if (designator->array_index == NULL) {
6435 last_designator->next = designator;
6436 last_designator = designator;
6446 * Parse the __builtin_offsetof() expression.
6448 static expression_t *parse_offsetof(void)
6450 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6451 expression->base.type = type_size_t;
6453 eat(T___builtin_offsetof);
6455 add_anchor_token(')');
6456 add_anchor_token(',');
6458 type_t *type = parse_typename();
6459 rem_anchor_token(',');
6461 designator_t *designator = parse_designator();
6462 rem_anchor_token(')');
6465 expression->offsetofe.type = type;
6466 expression->offsetofe.designator = designator;
6469 memset(&path, 0, sizeof(path));
6470 path.top_type = type;
6471 path.path = NEW_ARR_F(type_path_entry_t, 0);
6473 descend_into_subtype(&path);
6475 if (!walk_designator(&path, designator, true)) {
6476 return create_error_expression();
6479 DEL_ARR_F(path.path);
6484 static bool is_last_parameter(expression_t *const param)
6486 if (param->kind == EXPR_REFERENCE) {
6487 entity_t *const entity = param->reference.entity;
6488 if (entity->kind == ENTITY_PARAMETER &&
6489 !entity->base.next &&
6490 entity->base.parent_scope == ¤t_function->parameters) {
6495 if (!is_type_valid(skip_typeref(param->base.type)))
6502 * Parses a __builtin_va_start() expression.
6504 static expression_t *parse_va_start(void)
6506 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6508 eat(T___builtin_va_start);
6510 add_anchor_token(')');
6511 add_anchor_token(',');
6513 expression->va_starte.ap = parse_assignment_expression();
6514 rem_anchor_token(',');
6516 expression_t *const param = parse_assignment_expression();
6517 expression->va_starte.parameter = param;
6518 rem_anchor_token(')');
6521 if (!current_function) {
6522 errorf(&expression->base.pos, "'va_start' used outside of function");
6523 } else if (!current_function->base.type->function.variadic) {
6524 errorf(&expression->base.pos, "'va_start' used in non-variadic function");
6525 } else if (!is_last_parameter(param)) {
6526 errorf(¶m->base.pos, "second argument of 'va_start' must be last parameter of the current function");
6533 * Parses a __builtin_va_arg() expression.
6535 static expression_t *parse_va_arg(void)
6537 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6539 eat(T___builtin_va_arg);
6541 add_anchor_token(')');
6542 add_anchor_token(',');
6545 ap.expression = parse_assignment_expression();
6546 expression->va_arge.ap = ap.expression;
6547 check_call_argument(type_valist, &ap, 1);
6549 rem_anchor_token(',');
6551 expression->base.type = parse_typename();
6552 rem_anchor_token(')');
6559 * Parses a __builtin_va_copy() expression.
6561 static expression_t *parse_va_copy(void)
6563 expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
6565 eat(T___builtin_va_copy);
6567 add_anchor_token(')');
6568 add_anchor_token(',');
6570 expression_t *dst = parse_assignment_expression();
6571 assign_error_t error = semantic_assign(type_valist, dst);
6572 report_assign_error(error, type_valist, dst, "call argument 1",
6574 expression->va_copye.dst = dst;
6576 rem_anchor_token(',');
6579 call_argument_t src;
6580 src.expression = parse_assignment_expression();
6581 check_call_argument(type_valist, &src, 2);
6582 expression->va_copye.src = src.expression;
6583 rem_anchor_token(')');
6590 * Parses a __builtin_constant_p() expression.
6592 static expression_t *parse_builtin_constant(void)
6594 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6596 eat(T___builtin_constant_p);
6598 add_anchor_token(')');
6600 expression->builtin_constant.value = parse_assignment_expression();
6601 rem_anchor_token(')');
6603 expression->base.type = type_int;
6609 * Parses a __builtin_types_compatible_p() expression.
6611 static expression_t *parse_builtin_types_compatible(void)
6613 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
6615 eat(T___builtin_types_compatible_p);
6617 add_anchor_token(')');
6618 add_anchor_token(',');
6620 expression->builtin_types_compatible.left = parse_typename();
6621 rem_anchor_token(',');
6623 expression->builtin_types_compatible.right = parse_typename();
6624 rem_anchor_token(')');
6626 expression->base.type = type_int;
6632 * Parses a __builtin_is_*() compare expression.
6634 static expression_t *parse_compare_builtin(void)
6636 expression_kind_t kind;
6637 switch (token.kind) {
6638 case T___builtin_isgreater: kind = EXPR_BINARY_ISGREATER; break;
6639 case T___builtin_isgreaterequal: kind = EXPR_BINARY_ISGREATEREQUAL; break;
6640 case T___builtin_isless: kind = EXPR_BINARY_ISLESS; break;
6641 case T___builtin_islessequal: kind = EXPR_BINARY_ISLESSEQUAL; break;
6642 case T___builtin_islessgreater: kind = EXPR_BINARY_ISLESSGREATER; break;
6643 case T___builtin_isunordered: kind = EXPR_BINARY_ISUNORDERED; break;
6644 default: internal_errorf(HERE, "invalid compare builtin found");
6646 expression_t *const expression = allocate_expression_zero(kind);
6649 add_anchor_token(')');
6650 add_anchor_token(',');
6652 expression->binary.left = parse_assignment_expression();
6653 rem_anchor_token(',');
6655 expression->binary.right = parse_assignment_expression();
6656 rem_anchor_token(')');
6659 type_t *const orig_type_left = expression->binary.left->base.type;
6660 type_t *const orig_type_right = expression->binary.right->base.type;
6662 type_t *const type_left = skip_typeref(orig_type_left);
6663 type_t *const type_right = skip_typeref(orig_type_right);
6664 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6665 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6666 type_error_incompatible("invalid operands in comparison",
6667 &expression->base.pos, orig_type_left, orig_type_right);
6670 semantic_comparison(&expression->binary, true);
6677 * Parses a MS assume() expression.
6679 static expression_t *parse_assume(void)
6681 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
6685 add_anchor_token(')');
6687 expression->unary.value = parse_assignment_expression();
6688 rem_anchor_token(')');
6691 expression->base.type = type_void;
6696 * Return the label for the current symbol or create a new one.
6698 static label_t *get_label(char const *const context)
6700 assert(current_function != NULL);
6702 symbol_t *const sym = expect_identifier(context, NULL);
6706 entity_t *label = get_entity(sym, NAMESPACE_LABEL);
6707 /* If we find a local label, we already created the declaration. */
6708 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
6709 if (label->base.parent_scope != current_scope) {
6710 assert(label->base.parent_scope->depth < current_scope->depth);
6711 current_function->goto_to_outer = true;
6713 } else if (label == NULL || label->base.parent_scope != ¤t_function->parameters) {
6714 /* There is no matching label in the same function, so create a new one. */
6715 position_t const nowhere = { NULL, 0, 0, false };
6716 label = allocate_entity_zero(ENTITY_LABEL, NAMESPACE_LABEL, sym, &nowhere);
6720 return &label->label;
6724 * Parses a GNU && label address expression.
6726 static expression_t *parse_label_address(void)
6728 position_t const pos = *HERE;
6731 label_t *const label = get_label("while parsing label address");
6733 return create_error_expression();
6736 label->address_taken = true;
6738 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
6739 expression->base.pos = pos;
6741 /* label address is treated as a void pointer */
6742 expression->base.type = type_void_ptr;
6743 expression->label_address.label = label;
6748 * Parse a microsoft __noop expression.
6750 static expression_t *parse_noop_expression(void)
6752 /* the result is a (int)0 */
6753 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_MS_NOOP);
6754 literal->base.type = type_int;
6755 literal->literal.value.begin = "__noop";
6756 literal->literal.value.size = 6;
6760 if (token.kind == '(') {
6761 /* parse arguments */
6763 add_anchor_token(')');
6764 add_anchor_token(',');
6766 if (token.kind != ')') do {
6767 (void)parse_assignment_expression();
6768 } while (accept(','));
6770 rem_anchor_token(',');
6771 rem_anchor_token(')');
6779 * Parses a primary expression.
6781 static expression_t *parse_primary_expression(void)
6783 switch (token.kind) {
6784 case T_false: return parse_boolean_literal(false);
6785 case T_true: return parse_boolean_literal(true);
6786 case T_NUMBER: return parse_number_literal();
6787 case T_CHARACTER_CONSTANT: return parse_character_constant();
6788 case T_STRING_LITERAL: return parse_string_literal();
6789 case T___func__: return parse_function_keyword(FUNCNAME_FUNCTION);
6790 case T___PRETTY_FUNCTION__: return parse_function_keyword(FUNCNAME_PRETTY_FUNCTION);
6791 case T___FUNCSIG__: return parse_function_keyword(FUNCNAME_FUNCSIG);
6792 case T___FUNCDNAME__: return parse_function_keyword(FUNCNAME_FUNCDNAME);
6793 case T___builtin_offsetof: return parse_offsetof();
6794 case T___builtin_va_start: return parse_va_start();
6795 case T___builtin_va_arg: return parse_va_arg();
6796 case T___builtin_va_copy: return parse_va_copy();
6797 case T___builtin_isgreater:
6798 case T___builtin_isgreaterequal:
6799 case T___builtin_isless:
6800 case T___builtin_islessequal:
6801 case T___builtin_islessgreater:
6802 case T___builtin_isunordered: return parse_compare_builtin();
6803 case T___builtin_constant_p: return parse_builtin_constant();
6804 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
6805 case T__assume: return parse_assume();
6808 return parse_label_address();
6811 case '(': return parse_parenthesized_expression();
6812 case T___noop: return parse_noop_expression();
6814 case T___imag__: return parse_complex_extract_expression();
6816 /* Gracefully handle type names while parsing expressions. */
6818 return parse_reference();
6820 if (!is_typedef_symbol(token.base.symbol)) {
6821 return parse_reference();
6825 position_t const pos = *HERE;
6826 declaration_specifiers_t specifiers;
6827 parse_declaration_specifiers(&specifiers);
6828 type_t const *const type = parse_abstract_declarator(specifiers.type);
6829 errorf(&pos, "encountered type '%T' while parsing expression", type);
6830 return create_error_expression();
6834 errorf(HERE, "unexpected token %K, expected an expression", &token);
6836 return create_error_expression();
6839 static expression_t *parse_array_expression(expression_t *left)
6841 expression_t *const expr = allocate_expression_zero(EXPR_ARRAY_ACCESS);
6842 array_access_expression_t *const arr = &expr->array_access;
6845 add_anchor_token(']');
6847 expression_t *const inside = parse_expression();
6849 type_t *const orig_type_left = left->base.type;
6850 type_t *const orig_type_inside = inside->base.type;
6852 type_t *const type_left = skip_typeref(orig_type_left);
6853 type_t *const type_inside = skip_typeref(orig_type_inside);
6859 if (is_type_pointer(type_left)) {
6862 idx_type = type_inside;
6863 res_type = type_left->pointer.points_to;
6865 } else if (is_type_pointer(type_inside)) {
6866 arr->flipped = true;
6869 idx_type = type_left;
6870 res_type = type_inside->pointer.points_to;
6872 res_type = automatic_type_conversion(res_type);
6873 if (!is_type_integer(idx_type)) {
6874 if (is_type_valid(idx_type))
6875 errorf(&idx->base.pos, "array subscript must have integer type");
6876 } else if (is_type_atomic(idx_type, ATOMIC_TYPE_CHAR)) {
6877 position_t const *const pos = &idx->base.pos;
6878 warningf(WARN_CHAR_SUBSCRIPTS, pos, "array subscript has char type");
6881 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
6882 errorf(&expr->base.pos, "invalid types '%T[%T]' for array access", orig_type_left, orig_type_inside);
6884 res_type = type_error_type;
6889 arr->array_ref = ref;
6891 arr->base.type = res_type;
6893 rem_anchor_token(']');
6898 static bool is_bitfield(const expression_t *expression)
6900 return expression->kind == EXPR_SELECT
6901 && expression->select.compound_entry->compound_member.bitfield;
6904 static expression_t *parse_typeprop(expression_kind_t const kind)
6906 expression_t *tp_expression = allocate_expression_zero(kind);
6907 tp_expression->base.type = type_size_t;
6909 eat(kind == EXPR_SIZEOF ? T_sizeof : T__Alignof);
6912 expression_t *expression;
6913 if (token.kind == '(' && is_declaration_specifier(look_ahead(1))) {
6914 position_t const pos = *HERE;
6916 add_anchor_token(')');
6917 orig_type = parse_typename();
6918 rem_anchor_token(')');
6921 if (token.kind == '{') {
6922 /* It was not sizeof(type) after all. It is sizeof of an expression
6923 * starting with a compound literal */
6924 expression = parse_compound_literal(&pos, orig_type);
6925 goto typeprop_expression;
6928 expression = parse_subexpression(PREC_UNARY);
6930 typeprop_expression:
6931 if (is_bitfield(expression)) {
6932 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6933 errorf(&tp_expression->base.pos,
6934 "operand of %s expression must not be a bitfield", what);
6937 tp_expression->typeprop.tp_expression = expression;
6939 orig_type = revert_automatic_type_conversion(expression);
6940 expression->base.type = orig_type;
6943 tp_expression->typeprop.type = orig_type;
6944 type_t const* const type = skip_typeref(orig_type);
6945 char const* wrong_type = NULL;
6946 if (is_type_incomplete(type)) {
6947 if (!is_type_void(type) || !GNU_MODE)
6948 wrong_type = "incomplete";
6949 } else if (type->kind == TYPE_FUNCTION) {
6951 /* function types are allowed (and return 1) */
6952 position_t const *const pos = &tp_expression->base.pos;
6953 char const *const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6954 warningf(WARN_OTHER, pos, "%s expression with function argument returns invalid result", what);
6956 wrong_type = "function";
6960 if (wrong_type != NULL) {
6961 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6962 errorf(&tp_expression->base.pos,
6963 "operand of %s expression must not be of %s type '%T'",
6964 what, wrong_type, orig_type);
6967 return tp_expression;
6970 static expression_t *parse_sizeof(void)
6972 return parse_typeprop(EXPR_SIZEOF);
6975 static expression_t *parse_alignof(void)
6977 return parse_typeprop(EXPR_ALIGNOF);
6980 static expression_t *parse_select_expression(expression_t *addr)
6982 assert(token.kind == '.' || token.kind == T_MINUSGREATER);
6983 bool select_left_arrow = (token.kind == T_MINUSGREATER);
6984 position_t const pos = *HERE;
6987 symbol_t *const symbol = expect_identifier("while parsing select", NULL);
6989 return create_error_expression();
6991 type_t *const orig_type = addr->base.type;
6992 type_t *const type = skip_typeref(orig_type);
6995 bool saw_error = false;
6996 if (is_type_pointer(type)) {
6997 if (!select_left_arrow) {
6999 "request for member '%Y' in something not a struct or union, but '%T'",
7003 type_left = skip_typeref(type->pointer.points_to);
7005 if (select_left_arrow && is_type_valid(type)) {
7006 errorf(&pos, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7012 if (!is_type_compound(type_left)) {
7013 if (is_type_valid(type_left) && !saw_error) {
7015 "request for member '%Y' in something not a struct or union, but '%T'",
7018 return create_error_expression();
7021 compound_t *compound = type_left->compound.compound;
7022 if (!compound->complete) {
7023 errorf(&pos, "request for member '%Y' in incomplete type '%T'",
7025 return create_error_expression();
7028 type_qualifiers_t qualifiers = type_left->base.qualifiers;
7029 expression_t *result =
7030 find_create_select(&pos, addr, qualifiers, compound, symbol);
7032 if (result == NULL) {
7033 errorf(&pos, "'%T' has no member named '%Y'", orig_type, symbol);
7034 return create_error_expression();
7040 static void check_call_argument(type_t *expected_type,
7041 call_argument_t *argument, unsigned pos)
7043 type_t *expected_type_skip = skip_typeref(expected_type);
7044 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
7045 expression_t *arg_expr = argument->expression;
7046 type_t *arg_type = skip_typeref(arg_expr->base.type);
7048 /* handle transparent union gnu extension */
7049 if (is_type_union(expected_type_skip)
7050 && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
7051 compound_t *union_decl = expected_type_skip->compound.compound;
7052 type_t *best_type = NULL;
7053 entity_t *entry = union_decl->members.entities;
7054 for ( ; entry != NULL; entry = entry->base.next) {
7055 assert(is_declaration(entry));
7056 type_t *decl_type = entry->declaration.type;
7057 error = semantic_assign(decl_type, arg_expr);
7058 if (error == ASSIGN_ERROR_INCOMPATIBLE
7059 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
7062 if (error == ASSIGN_SUCCESS) {
7063 best_type = decl_type;
7064 } else if (best_type == NULL) {
7065 best_type = decl_type;
7069 if (best_type != NULL) {
7070 expected_type = best_type;
7074 error = semantic_assign(expected_type, arg_expr);
7075 argument->expression = create_implicit_cast(arg_expr, expected_type);
7077 if (error != ASSIGN_SUCCESS) {
7078 /* report exact scope in error messages (like "in argument 3") */
7080 snprintf(buf, sizeof(buf), "call argument %u", pos);
7081 report_assign_error(error, expected_type, arg_expr, buf,
7082 &arg_expr->base.pos);
7084 type_t *const promoted_type = get_default_promoted_type(arg_type);
7085 if (!types_compatible(expected_type_skip, promoted_type) &&
7086 !types_compatible(expected_type_skip, type_void_ptr) &&
7087 !types_compatible(type_void_ptr, promoted_type)) {
7088 /* Deliberately show the skipped types in this warning */
7089 position_t const *const apos = &arg_expr->base.pos;
7090 warningf(WARN_TRADITIONAL, apos, "passing call argument %u as '%T' rather than '%T' due to prototype", pos, expected_type_skip, promoted_type);
7096 * Handle the semantic restrictions of builtin calls
7098 static void handle_builtin_argument_restrictions(call_expression_t *call)
7100 entity_t *entity = call->function->reference.entity;
7101 switch (entity->function.btk) {
7103 switch (entity->function.b.firm_builtin_kind) {
7104 case ir_bk_return_address:
7105 case ir_bk_frame_address: {
7106 /* argument must be constant */
7107 call_argument_t *argument = call->arguments;
7109 if (is_constant_expression(argument->expression) == EXPR_CLASS_VARIABLE) {
7110 errorf(&call->base.pos,
7111 "argument of '%Y' must be a constant expression",
7112 call->function->reference.entity->base.symbol);
7116 case ir_bk_prefetch:
7117 /* second and third argument must be constant if existent */
7118 if (call->arguments == NULL)
7120 call_argument_t *rw = call->arguments->next;
7121 call_argument_t *locality = NULL;
7124 if (is_constant_expression(rw->expression) == EXPR_CLASS_VARIABLE) {
7125 errorf(&call->base.pos,
7126 "second argument of '%Y' must be a constant expression",
7127 call->function->reference.entity->base.symbol);
7129 locality = rw->next;
7131 if (locality != NULL) {
7132 if (is_constant_expression(locality->expression) == EXPR_CLASS_VARIABLE) {
7133 errorf(&call->base.pos,
7134 "third argument of '%Y' must be a constant expression",
7135 call->function->reference.entity->base.symbol);
7143 case BUILTIN_OBJECT_SIZE:
7144 if (call->arguments == NULL)
7147 call_argument_t *arg = call->arguments->next;
7148 if (arg != NULL && is_constant_expression(arg->expression) == EXPR_CLASS_VARIABLE) {
7149 errorf(&call->base.pos,
7150 "second argument of '%Y' must be a constant expression",
7151 call->function->reference.entity->base.symbol);
7160 * Parse a call expression, i.e. expression '( ... )'.
7162 * @param expression the function address
7164 static expression_t *parse_call_expression(expression_t *expression)
7166 expression_t *result = allocate_expression_zero(EXPR_CALL);
7167 call_expression_t *call = &result->call;
7168 call->function = expression;
7170 type_t *const orig_type = expression->base.type;
7171 type_t *const type = skip_typeref(orig_type);
7173 function_type_t *function_type = NULL;
7174 if (is_type_pointer(type)) {
7175 type_t *const to_type = skip_typeref(type->pointer.points_to);
7177 if (is_type_function(to_type)) {
7178 function_type = &to_type->function;
7179 call->base.type = function_type->return_type;
7183 if (function_type == NULL && is_type_valid(type)) {
7185 "called object '%E' (type '%T') is not a pointer to a function",
7186 expression, orig_type);
7189 /* parse arguments */
7191 add_anchor_token(')');
7192 add_anchor_token(',');
7194 if (token.kind != ')') {
7195 call_argument_t **anchor = &call->arguments;
7197 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7198 argument->expression = parse_assignment_expression();
7201 anchor = &argument->next;
7202 } while (accept(','));
7204 rem_anchor_token(',');
7205 rem_anchor_token(')');
7208 if (function_type == NULL)
7211 /* check type and count of call arguments */
7212 function_parameter_t *parameter = function_type->parameters;
7213 call_argument_t *argument = call->arguments;
7214 if (!function_type->unspecified_parameters) {
7215 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7216 parameter = parameter->next, argument = argument->next) {
7217 check_call_argument(parameter->type, argument, ++pos);
7220 if (parameter != NULL) {
7221 errorf(&expression->base.pos, "too few arguments to function '%E'",
7223 } else if (argument != NULL && !function_type->variadic) {
7224 errorf(&argument->expression->base.pos,
7225 "too many arguments to function '%E'", expression);
7229 /* do default promotion for other arguments */
7230 for (; argument != NULL; argument = argument->next) {
7231 type_t *argument_type = argument->expression->base.type;
7232 if (!is_type_object(skip_typeref(argument_type))) {
7233 errorf(&argument->expression->base.pos,
7234 "call argument '%E' must not be void", argument->expression);
7237 argument_type = get_default_promoted_type(argument_type);
7239 argument->expression
7240 = create_implicit_cast(argument->expression, argument_type);
7245 if (is_type_compound(skip_typeref(function_type->return_type))) {
7246 position_t const *const pos = &expression->base.pos;
7247 warningf(WARN_AGGREGATE_RETURN, pos, "function call has aggregate value");
7250 if (expression->kind == EXPR_REFERENCE) {
7251 reference_expression_t *reference = &expression->reference;
7252 if (reference->entity->kind == ENTITY_FUNCTION &&
7253 reference->entity->function.btk != BUILTIN_NONE)
7254 handle_builtin_argument_restrictions(call);
7260 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7262 static bool same_compound_type(const type_t *type1, const type_t *type2)
7265 is_type_compound(type1) &&
7266 type1->kind == type2->kind &&
7267 type1->compound.compound == type2->compound.compound;
7270 static expression_t const *get_reference_address(expression_t const *expr)
7272 bool regular_take_address = true;
7274 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7275 expr = expr->unary.value;
7277 regular_take_address = false;
7280 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7283 expr = expr->unary.value;
7286 if (expr->kind != EXPR_REFERENCE)
7289 /* special case for functions which are automatically converted to a
7290 * pointer to function without an extra TAKE_ADDRESS operation */
7291 if (!regular_take_address &&
7292 expr->reference.entity->kind != ENTITY_FUNCTION) {
7299 static void warn_reference_address_as_bool(expression_t const* expr)
7301 expr = get_reference_address(expr);
7303 position_t const *const pos = &expr->base.pos;
7304 entity_t const *const ent = expr->reference.entity;
7305 warningf(WARN_ADDRESS, pos, "the address of '%N' will always evaluate as 'true'", ent);
7309 static void warn_assignment_in_condition(const expression_t *const expr)
7311 if (expr->base.kind != EXPR_BINARY_ASSIGN)
7313 if (expr->base.parenthesized)
7315 position_t const *const pos = &expr->base.pos;
7316 warningf(WARN_PARENTHESES, pos, "suggest parentheses around assignment used as truth value");
7319 static void semantic_condition(expression_t const *const expr,
7320 char const *const context)
7322 type_t *const type = skip_typeref(expr->base.type);
7323 if (is_type_scalar(type)) {
7324 warn_reference_address_as_bool(expr);
7325 warn_assignment_in_condition(expr);
7326 } else if (is_type_valid(type)) {
7327 errorf(&expr->base.pos, "%s must have scalar type", context);
7332 * Parse a conditional expression, i.e. 'expression ? ... : ...'.
7334 * @param expression the conditional expression
7336 static expression_t *parse_conditional_expression(expression_t *expression)
7338 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7340 conditional_expression_t *conditional = &result->conditional;
7341 conditional->condition = expression;
7344 add_anchor_token(':');
7346 /* §6.5.15:2 The first operand shall have scalar type. */
7347 semantic_condition(expression, "condition of conditional operator");
7349 expression_t *true_expression = expression;
7350 bool gnu_cond = false;
7351 if (GNU_MODE && token.kind == ':') {
7354 true_expression = parse_expression();
7356 rem_anchor_token(':');
7358 expression_t *false_expression =
7359 parse_subexpression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7361 type_t *const orig_true_type = true_expression->base.type;
7362 type_t *const orig_false_type = false_expression->base.type;
7363 type_t *const true_type = skip_typeref(orig_true_type);
7364 type_t *const false_type = skip_typeref(orig_false_type);
7367 position_t const *const pos = &conditional->base.pos;
7368 type_t *result_type;
7369 if (is_type_void(true_type) || is_type_void(false_type)) {
7370 /* ISO/IEC 14882:1998(E) §5.16:2 */
7371 if (true_expression->kind == EXPR_UNARY_THROW) {
7372 result_type = false_type;
7373 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7374 result_type = true_type;
7376 if (!is_type_void(true_type) || !is_type_void(false_type)) {
7377 warningf(WARN_OTHER, pos, "ISO C forbids conditional expression with only one void side");
7379 result_type = type_void;
7381 } else if (is_type_arithmetic(true_type)
7382 && is_type_arithmetic(false_type)) {
7383 result_type = semantic_arithmetic(true_type, false_type);
7384 } else if (same_compound_type(true_type, false_type)) {
7385 /* just take 1 of the 2 types */
7386 result_type = true_type;
7387 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7388 type_t *pointer_type;
7390 expression_t *other_expression;
7391 if (is_type_pointer(true_type) &&
7392 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7393 pointer_type = true_type;
7394 other_type = false_type;
7395 other_expression = false_expression;
7397 pointer_type = false_type;
7398 other_type = true_type;
7399 other_expression = true_expression;
7402 if (is_null_pointer_constant(other_expression)) {
7403 result_type = pointer_type;
7404 } else if (is_type_pointer(other_type)) {
7405 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7406 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7409 if (is_type_void(to1) || is_type_void(to2)) {
7411 } else if (types_compatible(get_unqualified_type(to1),
7412 get_unqualified_type(to2))) {
7415 warningf(WARN_OTHER, pos, "pointer types '%T' and '%T' in conditional expression are incompatible", true_type, false_type);
7419 type_t *const type =
7420 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7421 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7422 } else if (is_type_integer(other_type)) {
7423 warningf(WARN_OTHER, pos, "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7424 result_type = pointer_type;
7426 goto types_incompatible;
7430 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7431 type_error_incompatible("while parsing conditional", pos, true_type, false_type);
7433 result_type = type_error_type;
7436 conditional->true_expression
7437 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7438 conditional->false_expression
7439 = create_implicit_cast(false_expression, result_type);
7440 conditional->base.type = result_type;
7445 * Parse an extension expression.
7447 static expression_t *parse_extension(void)
7450 expression_t *expression = parse_subexpression(PREC_UNARY);
7456 * Parse a __builtin_classify_type() expression.
7458 static expression_t *parse_builtin_classify_type(void)
7460 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7461 result->base.type = type_int;
7463 eat(T___builtin_classify_type);
7465 add_anchor_token(')');
7467 expression_t *expression = parse_expression();
7468 rem_anchor_token(')');
7470 result->classify_type.type_expression = expression;
7476 * Parse a delete expression
7477 * ISO/IEC 14882:1998(E) §5.3.5
7479 static expression_t *parse_delete(void)
7481 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7482 result->base.type = type_void;
7487 result->kind = EXPR_UNARY_DELETE_ARRAY;
7491 expression_t *const value = parse_subexpression(PREC_CAST);
7492 result->unary.value = value;
7494 type_t *const type = skip_typeref(value->base.type);
7495 if (!is_type_pointer(type)) {
7496 if (is_type_valid(type)) {
7497 errorf(&value->base.pos,
7498 "operand of delete must have pointer type");
7500 } else if (is_type_void(skip_typeref(type->pointer.points_to))) {
7501 position_t const *const pos = &value->base.pos;
7502 warningf(WARN_OTHER, pos, "deleting 'void*' is undefined");
7509 * Parse a throw expression
7510 * ISO/IEC 14882:1998(E) §15:1
7512 static expression_t *parse_throw(void)
7514 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7515 result->base.type = type_void;
7519 expression_t *value = NULL;
7520 switch (token.kind) {
7522 value = parse_assignment_expression();
7523 /* ISO/IEC 14882:1998(E) §15.1:3 */
7524 type_t *const orig_type = value->base.type;
7525 type_t *const type = skip_typeref(orig_type);
7526 if (is_type_incomplete(type)) {
7527 errorf(&value->base.pos,
7528 "cannot throw object of incomplete type '%T'", orig_type);
7529 } else if (is_type_pointer(type)) {
7530 type_t *const points_to = skip_typeref(type->pointer.points_to);
7531 if (is_type_incomplete(points_to) && !is_type_void(points_to)) {
7532 errorf(&value->base.pos,
7533 "cannot throw pointer to incomplete type '%T'", orig_type);
7541 result->unary.value = value;
7546 static bool check_pointer_arithmetic(const position_t *pos,
7547 type_t *pointer_type,
7548 type_t *orig_pointer_type)
7550 type_t *points_to = pointer_type->pointer.points_to;
7551 points_to = skip_typeref(points_to);
7553 if (is_type_incomplete(points_to)) {
7554 if (!GNU_MODE || !is_type_void(points_to)) {
7556 "arithmetic with pointer to incomplete type '%T' not allowed",
7560 warningf(WARN_POINTER_ARITH, pos, "pointer of type '%T' used in arithmetic", orig_pointer_type);
7562 } else if (is_type_function(points_to)) {
7565 "arithmetic with pointer to function type '%T' not allowed",
7569 warningf(WARN_POINTER_ARITH, pos,
7570 "pointer to a function '%T' used in arithmetic",
7577 static bool is_lvalue(const expression_t *expression)
7579 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
7580 switch (expression->kind) {
7581 case EXPR_ARRAY_ACCESS:
7582 case EXPR_COMPOUND_LITERAL:
7583 case EXPR_REFERENCE:
7585 case EXPR_UNARY_DEREFERENCE:
7589 type_t *type = skip_typeref(expression->base.type);
7591 /* ISO/IEC 14882:1998(E) §3.10:3 */
7592 is_type_reference(type) ||
7593 /* Claim it is an lvalue, if the type is invalid. There was a parse
7594 * error before, which maybe prevented properly recognizing it as
7596 !is_type_valid(type);
7601 static void semantic_incdec(unary_expression_t *expression)
7603 type_t *orig_type = expression->value->base.type;
7604 type_t *type = skip_typeref(orig_type);
7605 if (is_type_pointer(type)) {
7606 if (!check_pointer_arithmetic(&expression->base.pos, type, orig_type)) {
7609 } else if (!is_type_real(type) &&
7610 (!GNU_MODE || !is_type_complex(type)) && is_type_valid(type)) {
7611 /* TODO: improve error message */
7612 errorf(&expression->base.pos,
7613 "operation needs an arithmetic or pointer type");
7614 orig_type = type = type_error_type;
7616 if (!is_lvalue(expression->value)) {
7617 /* TODO: improve error message */
7618 errorf(&expression->base.pos, "lvalue required as operand");
7620 expression->base.type = orig_type;
7623 static void promote_unary_int_expr(unary_expression_t *const expr, type_t *const type)
7625 atomic_type_kind_t akind = get_arithmetic_akind(type);
7627 if (get_akind_rank(akind) < get_akind_rank(ATOMIC_TYPE_INT)) {
7628 if (type->kind == TYPE_COMPLEX)
7629 res_type = make_complex_type(ATOMIC_TYPE_INT, TYPE_QUALIFIER_NONE);
7631 res_type = type_int;
7635 expr->base.type = res_type;
7636 expr->value = create_implicit_cast(expr->value, res_type);
7639 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
7641 type_t *const orig_type = expression->value->base.type;
7642 type_t *const type = skip_typeref(orig_type);
7643 if (!is_type_arithmetic(type)) {
7644 if (is_type_valid(type)) {
7645 position_t const *const pos = &expression->base.pos;
7646 errorf(pos, "operand of unary expression must have arithmetic type, but is '%T'", orig_type);
7649 } else if (is_type_integer(type)) {
7650 promote_unary_int_expr(expression, type);
7652 expression->base.type = orig_type;
7656 static void semantic_unexpr_plus(unary_expression_t *expression)
7658 semantic_unexpr_arithmetic(expression);
7659 position_t const *const pos = &expression->base.pos;
7660 warningf(WARN_TRADITIONAL, pos, "traditional C rejects the unary plus operator");
7663 static void semantic_not(unary_expression_t *expression)
7665 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
7666 semantic_condition(expression->value, "operand of !");
7667 expression->base.type = c_mode & _CXX ? type_bool : type_int;
7670 static void semantic_complement(unary_expression_t *expression)
7672 type_t *const orig_type = expression->value->base.type;
7673 type_t *const type = skip_typeref(orig_type);
7674 if (!is_type_integer(type) && (!GNU_MODE || !is_type_complex(type))) {
7675 if (is_type_valid(type)) {
7676 errorf(&expression->base.pos, "operand of ~ must be of integer type");
7681 if (is_type_integer(type)) {
7682 promote_unary_int_expr(expression, type);
7684 expression->base.type = orig_type;
7688 static void semantic_dereference(unary_expression_t *expression)
7690 type_t *const orig_type = expression->value->base.type;
7691 type_t *const type = skip_typeref(orig_type);
7692 if (!is_type_pointer(type)) {
7693 if (is_type_valid(type)) {
7694 errorf(&expression->base.pos,
7695 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
7700 type_t *result_type = type->pointer.points_to;
7701 result_type = automatic_type_conversion(result_type);
7702 expression->base.type = result_type;
7706 * Record that an address is taken (expression represents an lvalue).
7708 * @param expression the expression
7709 * @param may_be_register if true, the expression might be an register
7711 static void set_address_taken(expression_t *expression, bool may_be_register)
7713 if (expression->kind != EXPR_REFERENCE)
7716 entity_t *const entity = expression->reference.entity;
7718 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
7721 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
7722 && !may_be_register) {
7723 position_t const *const pos = &expression->base.pos;
7724 errorf(pos, "address of register '%N' requested", entity);
7727 entity->variable.address_taken = true;
7731 * Check the semantic of the address taken expression.
7733 static void semantic_take_addr(unary_expression_t *expression)
7735 expression_t *value = expression->value;
7736 value->base.type = revert_automatic_type_conversion(value);
7738 type_t *orig_type = value->base.type;
7739 type_t *type = skip_typeref(orig_type);
7740 if (!is_type_valid(type))
7744 if (!is_lvalue(value)) {
7745 errorf(&expression->base.pos, "'&' requires an lvalue");
7747 if (is_bitfield(value)) {
7748 errorf(&expression->base.pos, "'&' not allowed on bitfield");
7751 set_address_taken(value, false);
7753 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
7756 #define CREATE_UNARY_EXPRESSION_PARSER(token_kind, unexpression_type, sfunc) \
7757 static expression_t *parse_##unexpression_type(void) \
7759 expression_t *unary_expression \
7760 = allocate_expression_zero(unexpression_type); \
7762 unary_expression->unary.value = parse_subexpression(PREC_UNARY); \
7764 sfunc(&unary_expression->unary); \
7766 return unary_expression; \
7769 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
7770 semantic_unexpr_arithmetic)
7771 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
7772 semantic_unexpr_plus)
7773 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
7775 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
7776 semantic_dereference)
7777 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
7779 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_COMPLEMENT,
7780 semantic_complement)
7781 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
7783 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
7786 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_kind, unexpression_type, \
7788 static expression_t *parse_##unexpression_type(expression_t *left) \
7790 expression_t *unary_expression \
7791 = allocate_expression_zero(unexpression_type); \
7793 unary_expression->unary.value = left; \
7795 sfunc(&unary_expression->unary); \
7797 return unary_expression; \
7800 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
7801 EXPR_UNARY_POSTFIX_INCREMENT,
7803 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
7804 EXPR_UNARY_POSTFIX_DECREMENT,
7807 static atomic_type_kind_t semantic_arithmetic_(atomic_type_kind_t kind_left,
7808 atomic_type_kind_t kind_right)
7810 /* §6.3.1.8 Usual arithmetic conversions */
7811 if (kind_left == ATOMIC_TYPE_LONG_DOUBLE
7812 || kind_right == ATOMIC_TYPE_LONG_DOUBLE) {
7813 return ATOMIC_TYPE_LONG_DOUBLE;
7814 } else if (kind_left == ATOMIC_TYPE_DOUBLE
7815 || kind_right == ATOMIC_TYPE_DOUBLE) {
7816 return ATOMIC_TYPE_DOUBLE;
7817 } else if (kind_left == ATOMIC_TYPE_FLOAT
7818 || kind_right == ATOMIC_TYPE_FLOAT) {
7819 return ATOMIC_TYPE_FLOAT;
7822 unsigned rank_left = get_akind_rank(kind_left);
7823 unsigned rank_right = get_akind_rank(kind_right);
7824 unsigned const rank_int = get_akind_rank(ATOMIC_TYPE_INT);
7825 if (rank_left < rank_int) {
7826 kind_left = ATOMIC_TYPE_INT;
7827 rank_left = rank_int;
7829 if (rank_right < rank_int) {
7830 kind_right = ATOMIC_TYPE_INT;
7831 rank_right = rank_int;
7833 if (kind_left == kind_right)
7836 bool const signed_left = is_akind_signed(kind_left);
7837 bool const signed_right = is_akind_signed(kind_right);
7838 if (signed_left == signed_right)
7839 return rank_left >= rank_right ? kind_left : kind_right;
7843 atomic_type_kind_t s_kind;
7844 atomic_type_kind_t u_kind;
7848 u_kind = kind_right;
7849 u_rank = rank_right;
7851 s_kind = kind_right;
7852 s_rank = rank_right;
7856 if (u_rank >= s_rank)
7858 if (get_atomic_type_size(s_kind) > get_atomic_type_size(u_kind))
7862 case ATOMIC_TYPE_INT: return ATOMIC_TYPE_UINT;
7863 case ATOMIC_TYPE_LONG: return ATOMIC_TYPE_ULONG;
7864 case ATOMIC_TYPE_LONGLONG: return ATOMIC_TYPE_ULONGLONG;
7865 default: panic("invalid atomic type");
7869 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
7871 atomic_type_kind_t kind_left = get_arithmetic_akind(type_left);
7872 atomic_type_kind_t kind_right = get_arithmetic_akind(type_right);
7873 atomic_type_kind_t kind_res = semantic_arithmetic_(kind_left, kind_right);
7875 if (type_left->kind == TYPE_COMPLEX || type_right->kind == TYPE_COMPLEX) {
7876 return make_complex_type(kind_res, TYPE_QUALIFIER_NONE);
7878 return make_atomic_type(kind_res, TYPE_QUALIFIER_NONE);
7882 * Check the semantic restrictions for a binary expression.
7884 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
7886 expression_t *const left = expression->left;
7887 expression_t *const right = expression->right;
7888 type_t *const orig_type_left = left->base.type;
7889 type_t *const orig_type_right = right->base.type;
7890 type_t *const type_left = skip_typeref(orig_type_left);
7891 type_t *const type_right = skip_typeref(orig_type_right);
7893 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
7894 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7895 position_t const *const pos = &expression->base.pos;
7896 errorf(pos, "operands of binary expression must have arithmetic types, but are '%T' and '%T'", orig_type_left, orig_type_right);
7901 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7902 expression->left = create_implicit_cast(left, arithmetic_type);
7903 expression->right = create_implicit_cast(right, arithmetic_type);
7904 expression->base.type = arithmetic_type;
7907 static void semantic_binexpr_integer(binary_expression_t *const expression)
7909 expression_t *const left = expression->left;
7910 expression_t *const right = expression->right;
7911 type_t *const orig_type_left = left->base.type;
7912 type_t *const orig_type_right = right->base.type;
7913 type_t *const type_left = skip_typeref(orig_type_left);
7914 type_t *const type_right = skip_typeref(orig_type_right);
7916 if (!is_type_integer(type_left) || !is_type_integer(type_right)
7917 || is_type_complex(type_left) || is_type_complex(type_right)) {
7918 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7919 position_t const *const pos = &expression->base.pos;
7920 errorf(pos, "operands of binary expression must have integer types, but are '%T' and '%T'", orig_type_left, orig_type_right);
7925 type_t *const result_type = semantic_arithmetic(type_left, type_right);
7926 expression->left = create_implicit_cast(left, result_type);
7927 expression->right = create_implicit_cast(right, result_type);
7928 expression->base.type = result_type;
7931 static void warn_div_by_zero(binary_expression_t const *const expression)
7933 if (!is_type_integer(expression->base.type))
7936 expression_t const *const right = expression->right;
7937 /* The type of the right operand can be different for /= */
7938 if (is_type_integer(skip_typeref(right->base.type)) &&
7939 is_constant_expression(right) == EXPR_CLASS_CONSTANT &&
7940 !fold_constant_to_bool(right)) {
7941 position_t const *const pos = &expression->base.pos;
7942 warningf(WARN_DIV_BY_ZERO, pos, "division by zero");
7947 * Check the semantic restrictions for a div expression.
7949 static void semantic_div(binary_expression_t *expression)
7951 semantic_binexpr_arithmetic(expression);
7952 warn_div_by_zero(expression);
7956 * Check the semantic restrictions for a mod expression.
7958 static void semantic_mod(binary_expression_t *expression)
7960 semantic_binexpr_integer(expression);
7961 warn_div_by_zero(expression);
7964 static void warn_addsub_in_shift(const expression_t *const expr)
7966 if (expr->base.parenthesized)
7970 switch (expr->kind) {
7971 case EXPR_BINARY_ADD: op = '+'; break;
7972 case EXPR_BINARY_SUB: op = '-'; break;
7976 position_t const *const pos = &expr->base.pos;
7977 warningf(WARN_PARENTHESES, pos, "suggest parentheses around '%c' inside shift", op);
7980 static bool semantic_shift(binary_expression_t *expression)
7982 expression_t *const left = expression->left;
7983 expression_t *const right = expression->right;
7984 type_t *const orig_type_left = left->base.type;
7985 type_t *const orig_type_right = right->base.type;
7986 type_t * type_left = skip_typeref(orig_type_left);
7987 type_t * type_right = skip_typeref(orig_type_right);
7989 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
7990 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7991 position_t const *const pos = &expression->base.pos;
7992 errorf(pos, "operands of shift expression must have integer types, but are '%T' and '%T'", orig_type_left, orig_type_right);
7997 type_left = promote_integer(type_left);
7999 if (is_constant_expression(right) == EXPR_CLASS_CONSTANT) {
8000 position_t const *const pos = &right->base.pos;
8001 long const count = fold_constant_to_int(right);
8003 warningf(WARN_OTHER, pos, "shift count must be non-negative");
8004 } else if ((unsigned long)count >=
8005 get_atomic_type_size(type_left->atomic.akind) * 8) {
8006 warningf(WARN_OTHER, pos, "shift count must be less than type width");
8010 type_right = promote_integer(type_right);
8011 expression->right = create_implicit_cast(right, type_right);
8016 static void semantic_shift_op(binary_expression_t *expression)
8018 expression_t *const left = expression->left;
8019 expression_t *const right = expression->right;
8021 if (!semantic_shift(expression))
8024 warn_addsub_in_shift(left);
8025 warn_addsub_in_shift(right);
8027 type_t *const orig_type_left = left->base.type;
8028 type_t * type_left = skip_typeref(orig_type_left);
8030 type_left = promote_integer(type_left);
8031 expression->left = create_implicit_cast(left, type_left);
8032 expression->base.type = type_left;
8035 static void semantic_add(binary_expression_t *expression)
8037 expression_t *const left = expression->left;
8038 expression_t *const right = expression->right;
8039 type_t *const orig_type_left = left->base.type;
8040 type_t *const orig_type_right = right->base.type;
8041 type_t *const type_left = skip_typeref(orig_type_left);
8042 type_t *const type_right = skip_typeref(orig_type_right);
8045 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8046 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8047 expression->left = create_implicit_cast(left, arithmetic_type);
8048 expression->right = create_implicit_cast(right, arithmetic_type);
8049 expression->base.type = arithmetic_type;
8050 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8051 check_pointer_arithmetic(&expression->base.pos, type_left,
8053 expression->base.type = type_left;
8054 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8055 check_pointer_arithmetic(&expression->base.pos, type_right,
8057 expression->base.type = type_right;
8058 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8059 errorf(&expression->base.pos,
8060 "invalid operands to binary + ('%T', '%T')",
8061 orig_type_left, orig_type_right);
8065 static void semantic_sub(binary_expression_t *expression)
8067 expression_t *const left = expression->left;
8068 expression_t *const right = expression->right;
8069 type_t *const orig_type_left = left->base.type;
8070 type_t *const orig_type_right = right->base.type;
8071 type_t *const type_left = skip_typeref(orig_type_left);
8072 type_t *const type_right = skip_typeref(orig_type_right);
8073 position_t const *const pos = &expression->base.pos;
8076 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8077 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8078 expression->left = create_implicit_cast(left, arithmetic_type);
8079 expression->right = create_implicit_cast(right, arithmetic_type);
8080 expression->base.type = arithmetic_type;
8081 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8082 check_pointer_arithmetic(&expression->base.pos, type_left,
8084 expression->base.type = type_left;
8085 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8086 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
8087 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
8088 if (!types_compatible(unqual_left, unqual_right)) {
8090 "subtracting pointers to incompatible types '%T' and '%T'",
8091 orig_type_left, orig_type_right);
8092 } else if (!is_type_object(unqual_left)) {
8093 if (!is_type_void(unqual_left)) {
8094 errorf(pos, "subtracting pointers to non-object types '%T'",
8097 warningf(WARN_OTHER, pos, "subtracting pointers to void");
8100 expression->base.type = type_ptrdiff_t;
8101 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8102 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8103 orig_type_left, orig_type_right);
8107 static void warn_string_literal_address(expression_t const* expr)
8109 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8110 expr = expr->unary.value;
8111 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8113 expr = expr->unary.value;
8116 if (expr->kind == EXPR_STRING_LITERAL) {
8117 position_t const *const pos = &expr->base.pos;
8118 warningf(WARN_ADDRESS, pos, "comparison with string literal results in unspecified behaviour");
8122 static bool maybe_negative(expression_t const *const expr)
8124 switch (is_constant_expression(expr)) {
8125 case EXPR_CLASS_ERROR: return false;
8126 case EXPR_CLASS_CONSTANT: return constant_is_negative(expr);
8127 default: return true;
8131 static void warn_comparison(position_t const *const pos, expression_t const *const expr, expression_t const *const other)
8133 warn_string_literal_address(expr);
8135 expression_t const* const ref = get_reference_address(expr);
8136 if (ref != NULL && is_null_pointer_constant(other)) {
8137 entity_t const *const ent = ref->reference.entity;
8138 warningf(WARN_ADDRESS, pos, "the address of '%N' will never be NULL", ent);
8141 if (!expr->base.parenthesized) {
8142 switch (expr->base.kind) {
8143 case EXPR_BINARY_LESS:
8144 case EXPR_BINARY_GREATER:
8145 case EXPR_BINARY_LESSEQUAL:
8146 case EXPR_BINARY_GREATEREQUAL:
8147 case EXPR_BINARY_NOTEQUAL:
8148 case EXPR_BINARY_EQUAL:
8149 warningf(WARN_PARENTHESES, pos, "comparisons like 'x <= y < z' do not have their mathematical meaning");
8158 * Check the semantics of comparison expressions.
8160 static void semantic_comparison(binary_expression_t *expression,
8163 position_t const *const pos = &expression->base.pos;
8164 expression_t *const left = expression->left;
8165 expression_t *const right = expression->right;
8167 warn_comparison(pos, left, right);
8168 warn_comparison(pos, right, left);
8170 type_t *orig_type_left = left->base.type;
8171 type_t *orig_type_right = right->base.type;
8172 type_t *type_left = skip_typeref(orig_type_left);
8173 type_t *type_right = skip_typeref(orig_type_right);
8175 /* TODO non-arithmetic types */
8176 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8177 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8179 /* test for signed vs unsigned compares */
8180 if (is_type_integer(arithmetic_type)) {
8181 bool const signed_left = is_type_signed(type_left);
8182 bool const signed_right = is_type_signed(type_right);
8183 if (signed_left != signed_right) {
8184 /* FIXME long long needs better const folding magic */
8185 /* TODO check whether constant value can be represented by other type */
8186 if ((signed_left && maybe_negative(left)) ||
8187 (signed_right && maybe_negative(right))) {
8188 warningf(WARN_SIGN_COMPARE, pos, "comparison between signed and unsigned");
8193 expression->left = create_implicit_cast(left, arithmetic_type);
8194 expression->right = create_implicit_cast(right, arithmetic_type);
8195 expression->base.type = arithmetic_type;
8196 if (!is_relational && is_type_float(arithmetic_type)) {
8197 warningf(WARN_FLOAT_EQUAL, pos, "comparing floating point with == or != is unsafe");
8199 /* for relational ops we need real types, not just arithmetic */
8201 && (!is_type_real(type_left) || !is_type_real(type_right))) {
8202 type_error_incompatible("invalid operands for relational operator", pos, type_left, type_right);
8204 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8205 /* TODO check compatibility */
8206 } else if (is_type_pointer(type_left)) {
8207 expression->right = create_implicit_cast(right, type_left);
8208 } else if (is_type_pointer(type_right)) {
8209 expression->left = create_implicit_cast(left, type_right);
8210 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8211 type_error_incompatible("invalid operands in comparison", pos, type_left, type_right);
8213 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8216 static void semantic_relational(binary_expression_t *expression)
8218 semantic_comparison(expression, true);
8221 static void semantic_equality(binary_expression_t *expression)
8223 semantic_comparison(expression, false);
8227 * Checks if a compound type has constant fields.
8229 static bool has_const_fields(const compound_type_t *type)
8231 compound_t *compound = type->compound;
8232 entity_t *entry = compound->members.entities;
8234 for (; entry != NULL; entry = entry->base.next) {
8235 if (!is_declaration(entry))
8238 const type_t *decl_type = skip_typeref(entry->declaration.type);
8239 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8246 static bool is_valid_assignment_lhs(expression_t const* const left)
8248 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8249 type_t *const type_left = skip_typeref(orig_type_left);
8251 if (!is_lvalue(left)) {
8252 errorf(&left->base.pos,
8253 "left hand side '%E' of assignment is not an lvalue", left);
8257 if (left->kind == EXPR_REFERENCE
8258 && left->reference.entity->kind == ENTITY_FUNCTION) {
8259 errorf(&left->base.pos, "cannot assign to function '%E'", left);
8263 if (is_type_array(type_left)) {
8264 errorf(&left->base.pos, "cannot assign to array '%E'", left);
8267 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8268 errorf(&left->base.pos,
8269 "assignment to read-only location '%E' (type '%T')", left,
8273 if (is_type_incomplete(type_left)) {
8274 errorf(&left->base.pos, "left-hand side '%E' of assignment has incomplete type '%T'",
8275 left, orig_type_left);
8278 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8279 errorf(&left->base.pos, "cannot assign to '%E' because compound type '%T' has read-only fields",
8280 left, orig_type_left);
8287 static void semantic_arithmetic_assign(binary_expression_t *expression)
8289 expression_t *left = expression->left;
8290 expression_t *right = expression->right;
8291 type_t *orig_type_left = left->base.type;
8292 type_t *orig_type_right = right->base.type;
8294 if (!is_valid_assignment_lhs(left))
8297 type_t *type_left = skip_typeref(orig_type_left);
8298 type_t *type_right = skip_typeref(orig_type_right);
8300 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8301 /* TODO: improve error message */
8302 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8303 errorf(&expression->base.pos, "operation needs arithmetic types");
8308 /* combined instructions are tricky. We can't create an implicit cast on
8309 * the left side, because we need the uncasted form for the store.
8310 * The ast2firm pass has to know that left_type must be right_type
8311 * for the arithmetic operation and create a cast by itself */
8312 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8313 expression->right = create_implicit_cast(right, arithmetic_type);
8314 expression->base.type = type_left;
8317 static void semantic_divmod_assign(binary_expression_t *expression)
8319 semantic_arithmetic_assign(expression);
8320 warn_div_by_zero(expression);
8323 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8325 expression_t *const left = expression->left;
8326 expression_t *const right = expression->right;
8327 type_t *const orig_type_left = left->base.type;
8328 type_t *const orig_type_right = right->base.type;
8329 type_t *const type_left = skip_typeref(orig_type_left);
8330 type_t *const type_right = skip_typeref(orig_type_right);
8332 if (!is_valid_assignment_lhs(left))
8335 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8336 /* combined instructions are tricky. We can't create an implicit cast on
8337 * the left side, because we need the uncasted form for the store.
8338 * The ast2firm pass has to know that left_type must be right_type
8339 * for the arithmetic operation and create a cast by itself */
8340 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8341 expression->right = create_implicit_cast(right, arithmetic_type);
8342 expression->base.type = type_left;
8343 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8344 check_pointer_arithmetic(&expression->base.pos, type_left,
8346 expression->base.type = type_left;
8347 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8348 errorf(&expression->base.pos,
8349 "incompatible types '%T' and '%T' in assignment",
8350 orig_type_left, orig_type_right);
8354 static void semantic_integer_assign(binary_expression_t *expression)
8356 expression_t *left = expression->left;
8357 expression_t *right = expression->right;
8358 type_t *orig_type_left = left->base.type;
8359 type_t *orig_type_right = right->base.type;
8361 if (!is_valid_assignment_lhs(left))
8364 type_t *type_left = skip_typeref(orig_type_left);
8365 type_t *type_right = skip_typeref(orig_type_right);
8367 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8368 /* TODO: improve error message */
8369 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8370 errorf(&expression->base.pos, "operation needs integer types");
8375 /* combined instructions are tricky. We can't create an implicit cast on
8376 * the left side, because we need the uncasted form for the store.
8377 * The ast2firm pass has to know that left_type must be right_type
8378 * for the arithmetic operation and create a cast by itself */
8379 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8380 expression->right = create_implicit_cast(right, arithmetic_type);
8381 expression->base.type = type_left;
8384 static void semantic_shift_assign(binary_expression_t *expression)
8386 expression_t *left = expression->left;
8388 if (!is_valid_assignment_lhs(left))
8391 if (!semantic_shift(expression))
8394 expression->base.type = skip_typeref(left->base.type);
8397 static void warn_logical_and_within_or(const expression_t *const expr)
8399 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8401 if (expr->base.parenthesized)
8403 position_t const *const pos = &expr->base.pos;
8404 warningf(WARN_PARENTHESES, pos, "suggest parentheses around && within ||");
8408 * Check the semantic restrictions of a logical expression.
8410 static void semantic_logical_op(binary_expression_t *expression)
8412 /* §6.5.13:2 Each of the operands shall have scalar type.
8413 * §6.5.14:2 Each of the operands shall have scalar type. */
8414 semantic_condition(expression->left, "left operand of logical operator");
8415 semantic_condition(expression->right, "right operand of logical operator");
8416 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR) {
8417 warn_logical_and_within_or(expression->left);
8418 warn_logical_and_within_or(expression->right);
8420 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8424 * Check the semantic restrictions of a binary assign expression.
8426 static void semantic_binexpr_assign(binary_expression_t *expression)
8428 expression_t *left = expression->left;
8429 type_t *orig_type_left = left->base.type;
8431 if (!is_valid_assignment_lhs(left))
8434 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8435 report_assign_error(error, orig_type_left, expression->right,
8436 "assignment", &left->base.pos);
8437 expression->right = create_implicit_cast(expression->right, orig_type_left);
8438 expression->base.type = orig_type_left;
8442 * Determine if the outermost operation (or parts thereof) of the given
8443 * expression has no effect in order to generate a warning about this fact.
8444 * Therefore in some cases this only examines some of the operands of the
8445 * expression (see comments in the function and examples below).
8447 * f() + 23; // warning, because + has no effect
8448 * x || f(); // no warning, because x controls execution of f()
8449 * x ? y : f(); // warning, because y has no effect
8450 * (void)x; // no warning to be able to suppress the warning
8451 * This function can NOT be used for an "expression has definitely no effect"-
8453 static bool expression_has_effect(const expression_t *const expr)
8455 switch (expr->kind) {
8456 case EXPR_ERROR: return true; /* do NOT warn */
8457 case EXPR_REFERENCE: return false;
8458 case EXPR_ENUM_CONSTANT: return false;
8459 case EXPR_LABEL_ADDRESS: return false;
8461 /* suppress the warning for microsoft __noop operations */
8462 case EXPR_LITERAL_MS_NOOP: return true;
8463 case EXPR_LITERAL_BOOLEAN:
8464 case EXPR_LITERAL_CHARACTER:
8465 case EXPR_LITERAL_INTEGER:
8466 case EXPR_LITERAL_FLOATINGPOINT:
8467 case EXPR_STRING_LITERAL: return false;
8470 const call_expression_t *const call = &expr->call;
8471 if (call->function->kind != EXPR_REFERENCE)
8474 switch (call->function->reference.entity->function.btk) {
8475 /* FIXME: which builtins have no effect? */
8476 default: return true;
8480 /* Generate the warning if either the left or right hand side of a
8481 * conditional expression has no effect */
8482 case EXPR_CONDITIONAL: {
8483 conditional_expression_t const *const cond = &expr->conditional;
8484 expression_t const *const t = cond->true_expression;
8486 (t == NULL || expression_has_effect(t)) &&
8487 expression_has_effect(cond->false_expression);
8490 case EXPR_SELECT: return false;
8491 case EXPR_ARRAY_ACCESS: return false;
8492 case EXPR_SIZEOF: return false;
8493 case EXPR_CLASSIFY_TYPE: return false;
8494 case EXPR_ALIGNOF: return false;
8496 case EXPR_FUNCNAME: return false;
8497 case EXPR_BUILTIN_CONSTANT_P: return false;
8498 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8499 case EXPR_OFFSETOF: return false;
8500 case EXPR_VA_START: return true;
8501 case EXPR_VA_ARG: return true;
8502 case EXPR_VA_COPY: return true;
8503 case EXPR_STATEMENT: return true; // TODO
8504 case EXPR_COMPOUND_LITERAL: return false;
8506 case EXPR_UNARY_NEGATE: return false;
8507 case EXPR_UNARY_PLUS: return false;
8508 case EXPR_UNARY_COMPLEMENT: return false;
8509 case EXPR_UNARY_NOT: return false;
8510 case EXPR_UNARY_DEREFERENCE: return false;
8511 case EXPR_UNARY_TAKE_ADDRESS: return false;
8512 case EXPR_UNARY_REAL: return false;
8513 case EXPR_UNARY_IMAG: return false;
8514 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8515 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8516 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8517 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8519 /* Treat void casts as if they have an effect in order to being able to
8520 * suppress the warning */
8521 case EXPR_UNARY_CAST: {
8522 type_t *const type = skip_typeref(expr->base.type);
8523 return is_type_void(type);
8526 case EXPR_UNARY_ASSUME: return true;
8527 case EXPR_UNARY_DELETE: return true;
8528 case EXPR_UNARY_DELETE_ARRAY: return true;
8529 case EXPR_UNARY_THROW: return true;
8531 case EXPR_BINARY_ADD: return false;
8532 case EXPR_BINARY_SUB: return false;
8533 case EXPR_BINARY_MUL: return false;
8534 case EXPR_BINARY_DIV: return false;
8535 case EXPR_BINARY_MOD: return false;
8536 case EXPR_BINARY_EQUAL: return false;
8537 case EXPR_BINARY_NOTEQUAL: return false;
8538 case EXPR_BINARY_LESS: return false;
8539 case EXPR_BINARY_LESSEQUAL: return false;
8540 case EXPR_BINARY_GREATER: return false;
8541 case EXPR_BINARY_GREATEREQUAL: return false;
8542 case EXPR_BINARY_BITWISE_AND: return false;
8543 case EXPR_BINARY_BITWISE_OR: return false;
8544 case EXPR_BINARY_BITWISE_XOR: return false;
8545 case EXPR_BINARY_SHIFTLEFT: return false;
8546 case EXPR_BINARY_SHIFTRIGHT: return false;
8547 case EXPR_BINARY_ASSIGN: return true;
8548 case EXPR_BINARY_MUL_ASSIGN: return true;
8549 case EXPR_BINARY_DIV_ASSIGN: return true;
8550 case EXPR_BINARY_MOD_ASSIGN: return true;
8551 case EXPR_BINARY_ADD_ASSIGN: return true;
8552 case EXPR_BINARY_SUB_ASSIGN: return true;
8553 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8554 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8555 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8556 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8557 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8559 /* Only examine the right hand side of && and ||, because the left hand
8560 * side already has the effect of controlling the execution of the right
8562 case EXPR_BINARY_LOGICAL_AND:
8563 case EXPR_BINARY_LOGICAL_OR:
8564 /* Only examine the right hand side of a comma expression, because the left
8565 * hand side has a separate warning */
8566 case EXPR_BINARY_COMMA:
8567 return expression_has_effect(expr->binary.right);
8569 case EXPR_BINARY_ISGREATER: return false;
8570 case EXPR_BINARY_ISGREATEREQUAL: return false;
8571 case EXPR_BINARY_ISLESS: return false;
8572 case EXPR_BINARY_ISLESSEQUAL: return false;
8573 case EXPR_BINARY_ISLESSGREATER: return false;
8574 case EXPR_BINARY_ISUNORDERED: return false;
8577 internal_errorf(HERE, "unexpected expression");
8580 static void semantic_comma(binary_expression_t *expression)
8582 const expression_t *const left = expression->left;
8583 if (!expression_has_effect(left)) {
8584 position_t const *const pos = &left->base.pos;
8585 warningf(WARN_UNUSED_VALUE, pos, "left-hand operand of comma expression has no effect");
8587 expression->base.type = expression->right->base.type;
8591 * @param prec_r precedence of the right operand
8593 #define CREATE_BINEXPR_PARSER(token_kind, binexpression_type, prec_r, sfunc) \
8594 static expression_t *parse_##binexpression_type(expression_t *left) \
8596 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8597 binexpr->binary.left = left; \
8600 expression_t *right = parse_subexpression(prec_r); \
8602 binexpr->binary.right = right; \
8603 sfunc(&binexpr->binary); \
8608 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8609 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_div)
8610 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_mod)
8611 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8612 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8613 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8614 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8615 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_relational)
8616 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_relational)
8617 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_relational)
8618 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_relational)
8619 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_equality)
8620 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_equality)
8621 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_integer)
8622 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_integer)
8623 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_integer)
8624 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8625 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8626 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
8627 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8628 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8629 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8630 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8631 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8632 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8633 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8634 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8635 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8636 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8637 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
8640 static expression_t *parse_subexpression(precedence_t precedence)
8642 expression_parser_function_t *parser
8643 = &expression_parsers[token.kind];
8646 if (parser->parser != NULL) {
8647 left = parser->parser();
8649 left = parse_primary_expression();
8651 assert(left != NULL);
8654 parser = &expression_parsers[token.kind];
8655 if (parser->infix_parser == NULL)
8657 if (parser->infix_precedence < precedence)
8660 left = parser->infix_parser(left);
8662 assert(left != NULL);
8669 * Parse an expression.
8671 static expression_t *parse_expression(void)
8673 return parse_subexpression(PREC_EXPRESSION);
8677 * Register a parser for a prefix-like operator.
8679 * @param parser the parser function
8680 * @param token_kind the token type of the prefix token
8682 static void register_expression_parser(parse_expression_function parser,
8685 expression_parser_function_t *entry = &expression_parsers[token_kind];
8687 assert(!entry->parser);
8688 entry->parser = parser;
8692 * Register a parser for an infix operator with given precedence.
8694 * @param parser the parser function
8695 * @param token_kind the token type of the infix operator
8696 * @param precedence the precedence of the operator
8698 static void register_infix_parser(parse_expression_infix_function parser,
8699 int token_kind, precedence_t precedence)
8701 expression_parser_function_t *entry = &expression_parsers[token_kind];
8703 assert(!entry->infix_parser);
8704 entry->infix_parser = parser;
8705 entry->infix_precedence = precedence;
8709 * Initialize the expression parsers.
8711 static void init_expression_parsers(void)
8713 memset(&expression_parsers, 0, sizeof(expression_parsers));
8715 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
8716 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
8717 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
8718 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
8719 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
8720 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
8721 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
8722 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
8723 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
8724 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
8725 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
8726 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
8727 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
8728 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
8729 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
8730 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
8731 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
8732 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
8733 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
8734 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
8735 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
8736 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
8737 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
8738 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
8739 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
8740 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
8741 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
8742 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
8743 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
8744 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
8745 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
8746 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
8747 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
8748 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
8749 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
8750 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
8751 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
8753 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
8754 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
8755 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
8756 register_expression_parser(parse_EXPR_UNARY_COMPLEMENT, '~');
8757 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
8758 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
8759 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
8760 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
8761 register_expression_parser(parse_sizeof, T_sizeof);
8762 register_expression_parser(parse_alignof, T__Alignof);
8763 register_expression_parser(parse_extension, T___extension__);
8764 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
8765 register_expression_parser(parse_delete, T_delete);
8766 register_expression_parser(parse_throw, T_throw);
8770 * Parse a asm statement arguments specification.
8772 static void parse_asm_arguments(asm_argument_t **anchor, bool const is_out)
8774 if (token.kind == T_STRING_LITERAL || token.kind == '[') {
8775 add_anchor_token(',');
8777 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
8779 add_anchor_token(')');
8780 add_anchor_token('(');
8781 add_anchor_token(T_STRING_LITERAL);
8784 add_anchor_token(']');
8785 argument->symbol = expect_identifier("while parsing asm argument", NULL);
8786 rem_anchor_token(']');
8790 rem_anchor_token(T_STRING_LITERAL);
8791 argument->constraints = parse_string_literals("asm argument");
8792 rem_anchor_token('(');
8794 expression_t *expression = parse_expression();
8796 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
8797 * change size or type representation (e.g. int -> long is ok, but
8798 * int -> float is not) */
8799 if (expression->kind == EXPR_UNARY_CAST) {
8800 type_t *const type = expression->base.type;
8801 type_kind_t const kind = type->kind;
8802 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
8805 if (kind == TYPE_ATOMIC) {
8806 atomic_type_kind_t const akind = type->atomic.akind;
8807 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8808 size = get_atomic_type_size(akind);
8810 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8811 size = get_type_size(type_void_ptr);
8815 expression_t *const value = expression->unary.value;
8816 type_t *const value_type = value->base.type;
8817 type_kind_t const value_kind = value_type->kind;
8819 unsigned value_flags;
8820 unsigned value_size;
8821 if (value_kind == TYPE_ATOMIC) {
8822 atomic_type_kind_t const value_akind = value_type->atomic.akind;
8823 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8824 value_size = get_atomic_type_size(value_akind);
8825 } else if (value_kind == TYPE_POINTER) {
8826 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8827 value_size = get_type_size(type_void_ptr);
8832 if (value_flags != flags || value_size != size)
8836 } while (expression->kind == EXPR_UNARY_CAST);
8840 if (!is_lvalue(expression))
8841 errorf(&expression->base.pos,
8842 "asm output argument is not an lvalue");
8844 if (argument->constraints.begin[0] == '=')
8845 determine_lhs_ent(expression, NULL);
8847 mark_vars_read(expression, NULL);
8849 mark_vars_read(expression, NULL);
8851 argument->expression = expression;
8852 rem_anchor_token(')');
8855 set_address_taken(expression, true);
8858 anchor = &argument->next;
8859 } while (accept(','));
8860 rem_anchor_token(',');
8865 * Parse a asm statement clobber specification.
8867 static void parse_asm_clobbers(asm_clobber_t **anchor)
8869 if (token.kind == T_STRING_LITERAL) {
8870 add_anchor_token(',');
8872 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
8873 clobber->clobber = parse_string_literals(NULL);
8876 anchor = &clobber->next;
8877 } while (accept(','));
8878 rem_anchor_token(',');
8882 static void parse_asm_labels(asm_label_t **anchor)
8884 if (token.kind == T_IDENTIFIER) {
8885 add_anchor_token(',');
8887 label_t *const label = get_label("while parsing 'asm goto' labels");
8889 asm_label_t *const asm_label = allocate_ast_zero(sizeof(*asm_label));
8890 asm_label->label = label;
8892 *anchor = asm_label;
8893 anchor = &asm_label->next;
8895 } while (accept(','));
8896 rem_anchor_token(',');
8901 * Parse an asm statement.
8903 static statement_t *parse_asm_statement(void)
8905 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
8906 asm_statement_t *asm_statement = &statement->asms;
8909 add_anchor_token(')');
8910 add_anchor_token(':');
8911 add_anchor_token(T_STRING_LITERAL);
8913 if (accept(T_volatile))
8914 asm_statement->is_volatile = true;
8916 bool const asm_goto = accept(T_goto);
8919 rem_anchor_token(T_STRING_LITERAL);
8920 asm_statement->asm_text = parse_string_literals("asm statement");
8922 if (accept(':')) parse_asm_arguments(&asm_statement->outputs, true);
8923 if (accept(':')) parse_asm_arguments(&asm_statement->inputs, false);
8924 if (accept(':')) parse_asm_clobbers( &asm_statement->clobbers);
8926 rem_anchor_token(':');
8929 warningf(WARN_OTHER, &statement->base.pos, "assembler statement with labels should be 'asm goto'");
8930 parse_asm_labels(&asm_statement->labels);
8931 if (asm_statement->labels)
8932 errorf(&statement->base.pos, "'asm goto' not supported");
8935 warningf(WARN_OTHER, &statement->base.pos, "'asm goto' without labels");
8938 rem_anchor_token(')');
8942 if (asm_statement->outputs == NULL) {
8943 /* GCC: An 'asm' instruction without any output operands will be treated
8944 * identically to a volatile 'asm' instruction. */
8945 asm_statement->is_volatile = true;
8951 static statement_t *parse_label_inner_statement(statement_t const *const label, char const *const label_kind)
8953 statement_t *inner_stmt;
8954 switch (token.kind) {
8956 errorf(&label->base.pos, "%s at end of compound statement", label_kind);
8957 inner_stmt = create_error_statement();
8961 if (label->kind == STATEMENT_LABEL) {
8962 /* Eat an empty statement here, to avoid the warning about an empty
8963 * statement after a label. label:; is commonly used to have a label
8964 * before a closing brace. */
8965 inner_stmt = create_empty_statement();
8972 inner_stmt = parse_statement();
8973 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
8974 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
8975 if (inner_stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
8976 errorf(&inner_stmt->base.pos, "declaration after %s", label_kind);
8984 * Parse a case statement.
8986 static statement_t *parse_case_statement(void)
8988 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
8989 position_t *const pos = &statement->base.pos;
8992 add_anchor_token(':');
8994 expression_t *expression = parse_expression();
8995 type_t *expression_type = expression->base.type;
8996 type_t *skipped = skip_typeref(expression_type);
8997 if (!is_type_integer(skipped) && is_type_valid(skipped)) {
8998 errorf(pos, "case expression '%E' must have integer type but has type '%T'",
8999 expression, expression_type);
9002 type_t *type = expression_type;
9003 if (current_switch != NULL) {
9004 type_t *switch_type = current_switch->expression->base.type;
9005 if (is_type_valid(skip_typeref(switch_type))) {
9006 expression = create_implicit_cast(expression, switch_type);
9010 statement->case_label.expression = expression;
9011 expression_classification_t const expr_class = is_constant_expression(expression);
9012 if (expr_class != EXPR_CLASS_CONSTANT) {
9013 if (expr_class != EXPR_CLASS_ERROR) {
9014 errorf(pos, "case label does not reduce to an integer constant");
9016 statement->case_label.is_bad = true;
9018 ir_tarval *val = fold_constant_to_tarval(expression);
9019 statement->case_label.first_case = val;
9020 statement->case_label.last_case = val;
9024 if (accept(T_DOTDOTDOT)) {
9025 expression_t *end_range = parse_expression();
9026 expression_type = expression->base.type;
9027 skipped = skip_typeref(expression_type);
9028 if (!is_type_integer(skipped) && is_type_valid(skipped)) {
9029 errorf(pos, "case expression '%E' must have integer type but has type '%T'",
9030 expression, expression_type);
9033 end_range = create_implicit_cast(end_range, type);
9034 statement->case_label.end_range = end_range;
9035 expression_classification_t const end_class = is_constant_expression(end_range);
9036 if (end_class != EXPR_CLASS_CONSTANT) {
9037 if (end_class != EXPR_CLASS_ERROR) {
9038 errorf(pos, "case range does not reduce to an integer constant");
9040 statement->case_label.is_bad = true;
9042 ir_tarval *val = fold_constant_to_tarval(end_range);
9043 statement->case_label.last_case = val;
9045 if (tarval_cmp(val, statement->case_label.first_case)
9046 == ir_relation_less) {
9047 statement->case_label.is_empty_range = true;
9048 warningf(WARN_OTHER, pos, "empty range specified");
9054 PUSH_PARENT(statement);
9056 rem_anchor_token(':');
9059 if (current_switch != NULL) {
9060 if (! statement->case_label.is_bad) {
9061 /* Check for duplicate case values */
9062 case_label_statement_t *c = &statement->case_label;
9063 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9064 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9067 if (c->last_case < l->first_case || c->first_case > l->last_case)
9070 errorf(pos, "duplicate case value (previously used %P)",
9075 /* link all cases into the switch statement */
9076 if (current_switch->last_case == NULL) {
9077 current_switch->first_case = &statement->case_label;
9079 current_switch->last_case->next = &statement->case_label;
9081 current_switch->last_case = &statement->case_label;
9083 errorf(pos, "case label not within a switch statement");
9086 statement->case_label.statement = parse_label_inner_statement(statement, "case label");
9093 * Parse a default statement.
9095 static statement_t *parse_default_statement(void)
9097 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9101 PUSH_PARENT(statement);
9105 if (current_switch != NULL) {
9106 const case_label_statement_t *def_label = current_switch->default_label;
9107 if (def_label != NULL) {
9108 errorf(&statement->base.pos, "multiple default labels in one switch (previous declared %P)", &def_label->base.pos);
9110 current_switch->default_label = &statement->case_label;
9112 /* link all cases into the switch statement */
9113 if (current_switch->last_case == NULL) {
9114 current_switch->first_case = &statement->case_label;
9116 current_switch->last_case->next = &statement->case_label;
9118 current_switch->last_case = &statement->case_label;
9121 errorf(&statement->base.pos,
9122 "'default' label not within a switch statement");
9125 statement->case_label.statement = parse_label_inner_statement(statement, "default label");
9132 * Parse a label statement.
9134 static statement_t *parse_label_statement(void)
9136 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9137 label_t *const label = get_label(NULL /* Cannot fail, token is T_IDENTIFIER. */);
9138 statement->label.label = label;
9140 PUSH_PARENT(statement);
9142 /* if statement is already set then the label is defined twice,
9143 * otherwise it was just mentioned in a goto/local label declaration so far
9145 position_t const* const pos = &statement->base.pos;
9146 if (label->statement != NULL) {
9147 errorf(pos, "duplicate '%N' (declared %P)", (entity_t const*)label, &label->base.pos);
9149 label->base.pos = *pos;
9150 label->statement = statement;
9151 label->n_users += 1;
9156 if (token.kind == T___attribute__ && !(c_mode & _CXX)) {
9157 parse_attributes(NULL); // TODO process attributes
9160 statement->label.statement = parse_label_inner_statement(statement, "label");
9162 /* remember the labels in a list for later checking */
9163 *label_anchor = &statement->label;
9164 label_anchor = &statement->label.next;
9170 static statement_t *parse_inner_statement(void)
9172 statement_t *const stmt = parse_statement();
9173 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
9174 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
9175 if (stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
9176 errorf(&stmt->base.pos, "declaration as inner statement, use {}");
9182 * Parse an expression in parentheses and mark its variables as read.
9184 static expression_t *parse_condition(void)
9186 add_anchor_token(')');
9188 expression_t *const expr = parse_expression();
9189 mark_vars_read(expr, NULL);
9190 rem_anchor_token(')');
9196 * Parse an if statement.
9198 static statement_t *parse_if(void)
9200 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9204 PUSH_PARENT(statement);
9205 PUSH_SCOPE_STATEMENT(&statement->ifs.scope);
9207 add_anchor_token(T_else);
9209 expression_t *const expr = parse_condition();
9210 statement->ifs.condition = expr;
9211 /* §6.8.4.1:1 The controlling expression of an if statement shall have
9213 semantic_condition(expr, "condition of 'if'-statment");
9215 statement_t *const true_stmt = parse_inner_statement();
9216 statement->ifs.true_statement = true_stmt;
9217 rem_anchor_token(T_else);
9219 if (true_stmt->kind == STATEMENT_EMPTY) {
9220 warningf(WARN_EMPTY_BODY, HERE,
9221 "suggest braces around empty body in an ‘if’ statement");
9224 if (accept(T_else)) {
9225 statement->ifs.false_statement = parse_inner_statement();
9227 if (statement->ifs.false_statement->kind == STATEMENT_EMPTY) {
9228 warningf(WARN_EMPTY_BODY, HERE,
9229 "suggest braces around empty body in an ‘if’ statement");
9231 } else if (true_stmt->kind == STATEMENT_IF &&
9232 true_stmt->ifs.false_statement != NULL) {
9233 position_t const *const pos = &true_stmt->base.pos;
9234 warningf(WARN_PARENTHESES, pos, "suggest explicit braces to avoid ambiguous 'else'");
9243 * Check that all enums are handled in a switch.
9245 * @param statement the switch statement to check
9247 static void check_enum_cases(const switch_statement_t *statement)
9249 if (!is_warn_on(WARN_SWITCH_ENUM))
9251 type_t *type = skip_typeref(statement->expression->base.type);
9252 if (! is_type_enum(type))
9254 enum_type_t *enumt = &type->enumt;
9256 /* if we have a default, no warnings */
9257 if (statement->default_label != NULL)
9260 determine_enum_values(enumt);
9262 /* FIXME: calculation of value should be done while parsing */
9263 /* TODO: quadratic algorithm here. Change to an n log n one */
9264 const entity_t *entry = enumt->enume->base.next;
9265 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9266 entry = entry->base.next) {
9267 ir_tarval *value = entry->enum_value.tv;
9269 for (const case_label_statement_t *l = statement->first_case; l != NULL;
9271 if (l->expression == NULL)
9273 if (l->first_case == l->last_case && l->first_case != value)
9275 if ((tarval_cmp(l->first_case, value) & ir_relation_less_equal)
9276 && (tarval_cmp(value, l->last_case) & ir_relation_less_equal)) {
9282 position_t const *const pos = &statement->base.pos;
9283 warningf(WARN_SWITCH_ENUM, pos, "'%N' not handled in switch", entry);
9289 * Parse a switch statement.
9291 static statement_t *parse_switch(void)
9293 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9297 PUSH_PARENT(statement);
9298 PUSH_SCOPE_STATEMENT(&statement->switchs.scope);
9300 expression_t *const expr = parse_condition();
9301 type_t * type = skip_typeref(expr->base.type);
9302 if (is_type_integer(type)) {
9303 type = promote_integer(type);
9304 if (get_akind_rank(get_arithmetic_akind(type)) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9305 warningf(WARN_TRADITIONAL, &expr->base.pos,
9306 "'%T' switch expression not converted to '%T' in ISO C",
9309 } else if (is_type_valid(type)) {
9310 errorf(&expr->base.pos, "switch quantity is not an integer, but '%T'",
9312 type = type_error_type;
9314 statement->switchs.expression = create_implicit_cast(expr, type);
9316 switch_statement_t *rem = current_switch;
9317 current_switch = &statement->switchs;
9318 statement->switchs.body = parse_inner_statement();
9319 current_switch = rem;
9321 if (statement->switchs.default_label == NULL) {
9322 warningf(WARN_SWITCH_DEFAULT, &statement->base.pos, "switch has no default case");
9324 check_enum_cases(&statement->switchs);
9331 static statement_t *parse_loop_body(statement_t *const loop)
9333 statement_t *const rem = current_loop;
9334 current_loop = loop;
9336 statement_t *const body = parse_inner_statement();
9343 * Parse a while statement.
9345 static statement_t *parse_while(void)
9347 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9351 PUSH_PARENT(statement);
9352 PUSH_SCOPE_STATEMENT(&statement->fors.scope);
9354 expression_t *const cond = parse_condition();
9355 statement->fors.condition = cond;
9356 /* §6.8.5:2 The controlling expression of an iteration statement shall
9357 * have scalar type. */
9358 semantic_condition(cond, "condition of 'while'-statement");
9360 statement->fors.body = parse_loop_body(statement);
9368 * Parse a do statement.
9370 static statement_t *parse_do(void)
9372 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9376 PUSH_PARENT(statement);
9377 PUSH_SCOPE_STATEMENT(&statement->do_while.scope);
9379 add_anchor_token(T_while);
9380 statement->do_while.body = parse_loop_body(statement);
9381 rem_anchor_token(T_while);
9384 expression_t *const cond = parse_condition();
9385 statement->do_while.condition = cond;
9386 /* §6.8.5:2 The controlling expression of an iteration statement shall
9387 * have scalar type. */
9388 semantic_condition(cond, "condition of 'do-while'-statement");
9397 * Parse a for statement.
9399 static statement_t *parse_for(void)
9401 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9405 PUSH_PARENT(statement);
9406 PUSH_SCOPE_STATEMENT(&statement->fors.scope);
9408 add_anchor_token(')');
9414 } else if (is_declaration_specifier(&token)) {
9415 parse_declaration(record_entity, DECL_FLAGS_NONE);
9417 add_anchor_token(';');
9418 expression_t *const init = parse_expression();
9419 statement->fors.initialisation = init;
9420 mark_vars_read(init, ENT_ANY);
9421 if (!expression_has_effect(init)) {
9422 warningf(WARN_UNUSED_VALUE, &init->base.pos, "initialisation of 'for'-statement has no effect");
9424 rem_anchor_token(';');
9430 if (token.kind != ';') {
9431 add_anchor_token(';');
9432 expression_t *const cond = parse_expression();
9433 statement->fors.condition = cond;
9434 /* §6.8.5:2 The controlling expression of an iteration statement
9435 * shall have scalar type. */
9436 semantic_condition(cond, "condition of 'for'-statement");
9437 mark_vars_read(cond, NULL);
9438 rem_anchor_token(';');
9441 if (token.kind != ')') {
9442 expression_t *const step = parse_expression();
9443 statement->fors.step = step;
9444 mark_vars_read(step, ENT_ANY);
9445 if (!expression_has_effect(step)) {
9446 warningf(WARN_UNUSED_VALUE, &step->base.pos, "step of 'for'-statement has no effect");
9449 rem_anchor_token(')');
9451 statement->fors.body = parse_loop_body(statement);
9459 * Parse a goto statement.
9461 static statement_t *parse_goto(void)
9463 statement_t *statement;
9464 if (GNU_MODE && look_ahead(1)->kind == '*') {
9465 statement = allocate_statement_zero(STATEMENT_COMPUTED_GOTO);
9469 expression_t *expression = parse_expression();
9470 mark_vars_read(expression, NULL);
9472 /* Argh: although documentation says the expression must be of type void*,
9473 * gcc accepts anything that can be casted into void* without error */
9474 type_t *type = expression->base.type;
9476 if (type != type_error_type) {
9477 if (!is_type_pointer(type) && !is_type_integer(type)) {
9478 errorf(&expression->base.pos, "cannot convert to a pointer type");
9479 } else if (type != type_void_ptr) {
9480 warningf(WARN_OTHER, &expression->base.pos, "type of computed goto expression should be 'void*' not '%T'", type);
9482 expression = create_implicit_cast(expression, type_void_ptr);
9485 statement->computed_goto.expression = expression;
9487 statement = allocate_statement_zero(STATEMENT_GOTO);
9490 label_t *const label = get_label("while parsing goto");
9492 label->n_users += 1;
9494 statement->gotos.label = label;
9496 /* remember the goto's in a list for later checking */
9497 *goto_anchor = &statement->gotos;
9498 goto_anchor = &statement->gotos.next;
9500 statement->gotos.label = &allocate_entity_zero(ENTITY_LABEL, NAMESPACE_LABEL, sym_anonymous, &builtin_position)->label;
9509 * Parse a continue statement.
9511 static statement_t *parse_continue(void)
9513 if (current_loop == NULL) {
9514 errorf(HERE, "continue statement not within loop");
9517 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9525 * Parse a break statement.
9527 static statement_t *parse_break(void)
9529 if (current_switch == NULL && current_loop == NULL) {
9530 errorf(HERE, "break statement not within loop or switch");
9533 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9541 * Parse a __leave statement.
9543 static statement_t *parse_leave_statement(void)
9545 if (current_try == NULL) {
9546 errorf(HERE, "__leave statement not within __try");
9549 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9557 * Check if a given entity represents a local variable.
9559 static bool is_local_variable(const entity_t *entity)
9561 if (entity->kind != ENTITY_VARIABLE)
9564 switch ((storage_class_tag_t) entity->declaration.storage_class) {
9565 case STORAGE_CLASS_AUTO:
9566 case STORAGE_CLASS_REGISTER: {
9567 const type_t *type = skip_typeref(entity->declaration.type);
9568 if (is_type_function(type)) {
9580 * Check if a given expression represents a local variable.
9582 static bool expression_is_local_variable(const expression_t *expression)
9584 if (expression->base.kind != EXPR_REFERENCE) {
9587 const entity_t *entity = expression->reference.entity;
9588 return is_local_variable(entity);
9591 static void err_or_warn(position_t const *const pos, char const *const msg)
9593 if (c_mode & _CXX || strict_mode) {
9596 warningf(WARN_OTHER, pos, msg);
9601 * Parse a return statement.
9603 static statement_t *parse_return(void)
9605 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9608 expression_t *return_value = NULL;
9609 if (token.kind != ';') {
9610 return_value = parse_expression();
9611 mark_vars_read(return_value, NULL);
9614 const type_t *const func_type = skip_typeref(current_function->base.type);
9615 assert(is_type_function(func_type));
9616 type_t *const return_type = skip_typeref(func_type->function.return_type);
9618 position_t const *const pos = &statement->base.pos;
9619 if (return_value != NULL) {
9620 type_t *return_value_type = skip_typeref(return_value->base.type);
9622 if (is_type_void(return_type)) {
9623 if (!is_type_void(return_value_type)) {
9624 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
9625 /* Only warn in C mode, because GCC does the same */
9626 err_or_warn(pos, "'return' with a value, in function returning 'void'");
9627 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9628 /* Only warn in C mode, because GCC does the same */
9629 err_or_warn(pos, "'return' with expression in function returning 'void'");
9632 assign_error_t error = semantic_assign(return_type, return_value);
9633 report_assign_error(error, return_type, return_value, "'return'",
9636 return_value = create_implicit_cast(return_value, return_type);
9637 /* check for returning address of a local var */
9638 if (return_value != NULL && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
9639 const expression_t *expression = return_value->unary.value;
9640 if (expression_is_local_variable(expression)) {
9641 warningf(WARN_OTHER, pos, "function returns address of local variable");
9644 } else if (!is_type_void(return_type)) {
9645 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9646 err_or_warn(pos, "'return' without value, in function returning non-void");
9648 statement->returns.value = return_value;
9655 * Parse a declaration statement.
9657 static statement_t *parse_declaration_statement(void)
9659 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9661 entity_t *before = current_scope->last_entity;
9663 parse_external_declaration();
9665 parse_declaration(record_entity, DECL_FLAGS_NONE);
9668 declaration_statement_t *const decl = &statement->declaration;
9669 entity_t *const begin =
9670 before != NULL ? before->base.next : current_scope->entities;
9671 decl->declarations_begin = begin;
9672 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
9678 * Parse an expression statement, i.e. expr ';'.
9680 static statement_t *parse_expression_statement(void)
9682 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
9684 expression_t *const expr = parse_expression();
9685 statement->expression.expression = expr;
9686 mark_vars_read(expr, ENT_ANY);
9693 * Parse a microsoft __try { } __finally { } or
9694 * __try{ } __except() { }
9696 static statement_t *parse_ms_try_statment(void)
9698 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
9701 PUSH_PARENT(statement);
9703 ms_try_statement_t *rem = current_try;
9704 current_try = &statement->ms_try;
9705 statement->ms_try.try_statement = parse_compound_statement(false);
9710 if (accept(T___except)) {
9711 expression_t *const expr = parse_condition();
9712 type_t * type = skip_typeref(expr->base.type);
9713 if (is_type_integer(type)) {
9714 type = promote_integer(type);
9715 } else if (is_type_valid(type)) {
9716 errorf(&expr->base.pos,
9717 "__expect expression is not an integer, but '%T'", type);
9718 type = type_error_type;
9720 statement->ms_try.except_expression = create_implicit_cast(expr, type);
9721 } else if (!accept(T__finally)) {
9722 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
9724 statement->ms_try.final_statement = parse_compound_statement(false);
9728 static statement_t *parse_empty_statement(void)
9730 warningf(WARN_EMPTY_STATEMENT, HERE, "statement is empty");
9731 statement_t *const statement = create_empty_statement();
9736 static statement_t *parse_local_label_declaration(void)
9738 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9742 entity_t *begin = NULL;
9743 entity_t *end = NULL;
9744 entity_t **anchor = &begin;
9745 add_anchor_token(';');
9746 add_anchor_token(',');
9749 symbol_t *const symbol = expect_identifier("while parsing local label declaration", &pos);
9751 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
9752 if (entity != NULL && entity->base.parent_scope == current_scope) {
9753 position_t const *const ppos = &entity->base.pos;
9754 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
9756 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL, NAMESPACE_LABEL, symbol, &pos);
9757 entity->base.parent_scope = current_scope;
9760 anchor = &entity->base.next;
9763 environment_push(entity);
9766 } while (accept(','));
9767 rem_anchor_token(',');
9768 rem_anchor_token(';');
9770 statement->declaration.declarations_begin = begin;
9771 statement->declaration.declarations_end = end;
9775 static void parse_namespace_definition(void)
9779 entity_t *entity = NULL;
9780 symbol_t *symbol = NULL;
9782 if (token.kind == T_IDENTIFIER) {
9783 symbol = token.base.symbol;
9784 entity = get_entity(symbol, NAMESPACE_NORMAL);
9785 if (entity && entity->kind != ENTITY_NAMESPACE) {
9787 if (entity->base.parent_scope == current_scope && is_entity_valid(entity)) {
9788 error_redefined_as_different_kind(HERE, entity, ENTITY_NAMESPACE);
9794 if (entity == NULL) {
9795 entity = allocate_entity_zero(ENTITY_NAMESPACE, NAMESPACE_NORMAL, symbol, HERE);
9796 entity->base.parent_scope = current_scope;
9799 if (token.kind == '=') {
9800 /* TODO: parse namespace alias */
9801 panic("namespace alias definition not supported yet");
9804 environment_push(entity);
9805 append_entity(current_scope, entity);
9807 PUSH_SCOPE(&entity->namespacee.members);
9808 PUSH_CURRENT_ENTITY(entity);
9810 add_anchor_token('}');
9813 rem_anchor_token('}');
9816 POP_CURRENT_ENTITY();
9821 * Parse a statement.
9822 * There's also parse_statement() which additionally checks for
9823 * "statement has no effect" warnings
9825 static statement_t *intern_parse_statement(void)
9827 /* declaration or statement */
9828 statement_t *statement;
9829 switch (token.kind) {
9830 case T_IDENTIFIER: {
9831 token_kind_t la1_type = (token_kind_t)look_ahead(1)->kind;
9832 if (la1_type == ':') {
9833 statement = parse_label_statement();
9834 } else if (is_typedef_symbol(token.base.symbol)) {
9835 statement = parse_declaration_statement();
9837 /* it's an identifier, the grammar says this must be an
9838 * expression statement. However it is common that users mistype
9839 * declaration types, so we guess a bit here to improve robustness
9840 * for incorrect programs */
9844 if (get_entity(token.base.symbol, NAMESPACE_NORMAL) != NULL) {
9846 statement = parse_expression_statement();
9850 statement = parse_declaration_statement();
9858 case T___extension__: {
9859 /* This can be a prefix to a declaration or an expression statement.
9860 * We simply eat it now and parse the rest with tail recursion. */
9862 statement = intern_parse_statement();
9868 statement = parse_declaration_statement();
9872 statement = parse_local_label_declaration();
9875 case ';': statement = parse_empty_statement(); break;
9876 case '{': statement = parse_compound_statement(false); break;
9877 case T___leave: statement = parse_leave_statement(); break;
9878 case T___try: statement = parse_ms_try_statment(); break;
9879 case T_asm: statement = parse_asm_statement(); break;
9880 case T_break: statement = parse_break(); break;
9881 case T_case: statement = parse_case_statement(); break;
9882 case T_continue: statement = parse_continue(); break;
9883 case T_default: statement = parse_default_statement(); break;
9884 case T_do: statement = parse_do(); break;
9885 case T_for: statement = parse_for(); break;
9886 case T_goto: statement = parse_goto(); break;
9887 case T_if: statement = parse_if(); break;
9888 case T_return: statement = parse_return(); break;
9889 case T_switch: statement = parse_switch(); break;
9890 case T_while: statement = parse_while(); break;
9893 statement = parse_expression_statement();
9897 errorf(HERE, "unexpected token %K while parsing statement", &token);
9898 statement = create_error_statement();
9907 * parse a statement and emits "statement has no effect" warning if needed
9908 * (This is really a wrapper around intern_parse_statement with check for 1
9909 * single warning. It is needed, because for statement expressions we have
9910 * to avoid the warning on the last statement)
9912 static statement_t *parse_statement(void)
9914 statement_t *statement = intern_parse_statement();
9916 if (statement->kind == STATEMENT_EXPRESSION) {
9917 expression_t *expression = statement->expression.expression;
9918 if (!expression_has_effect(expression)) {
9919 warningf(WARN_UNUSED_VALUE, &expression->base.pos,
9920 "statement has no effect");
9928 * Parse a compound statement.
9930 static statement_t *parse_compound_statement(bool inside_expression_statement)
9932 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
9934 PUSH_PARENT(statement);
9935 PUSH_SCOPE(&statement->compound.scope);
9938 add_anchor_token('}');
9939 /* tokens, which can start a statement */
9940 /* TODO MS, __builtin_FOO */
9941 add_anchor_token('!');
9942 add_anchor_token('&');
9943 add_anchor_token('(');
9944 add_anchor_token('*');
9945 add_anchor_token('+');
9946 add_anchor_token('-');
9947 add_anchor_token(';');
9948 add_anchor_token('{');
9949 add_anchor_token('~');
9950 add_anchor_token(T_CHARACTER_CONSTANT);
9951 add_anchor_token(T_COLONCOLON);
9952 add_anchor_token(T_IDENTIFIER);
9953 add_anchor_token(T_MINUSMINUS);
9954 add_anchor_token(T_NUMBER);
9955 add_anchor_token(T_PLUSPLUS);
9956 add_anchor_token(T_STRING_LITERAL);
9957 add_anchor_token(T__Alignof);
9958 add_anchor_token(T__Bool);
9959 add_anchor_token(T__Complex);
9960 add_anchor_token(T__Imaginary);
9961 add_anchor_token(T__Thread_local);
9962 add_anchor_token(T___PRETTY_FUNCTION__);
9963 add_anchor_token(T___attribute__);
9964 add_anchor_token(T___builtin_va_start);
9965 add_anchor_token(T___extension__);
9966 add_anchor_token(T___func__);
9967 add_anchor_token(T___imag__);
9968 add_anchor_token(T___label__);
9969 add_anchor_token(T___real__);
9970 add_anchor_token(T_asm);
9971 add_anchor_token(T_auto);
9972 add_anchor_token(T_bool);
9973 add_anchor_token(T_break);
9974 add_anchor_token(T_case);
9975 add_anchor_token(T_char);
9976 add_anchor_token(T_class);
9977 add_anchor_token(T_const);
9978 add_anchor_token(T_const_cast);
9979 add_anchor_token(T_continue);
9980 add_anchor_token(T_default);
9981 add_anchor_token(T_delete);
9982 add_anchor_token(T_double);
9983 add_anchor_token(T_do);
9984 add_anchor_token(T_dynamic_cast);
9985 add_anchor_token(T_enum);
9986 add_anchor_token(T_extern);
9987 add_anchor_token(T_false);
9988 add_anchor_token(T_float);
9989 add_anchor_token(T_for);
9990 add_anchor_token(T_goto);
9991 add_anchor_token(T_if);
9992 add_anchor_token(T_inline);
9993 add_anchor_token(T_int);
9994 add_anchor_token(T_long);
9995 add_anchor_token(T_new);
9996 add_anchor_token(T_operator);
9997 add_anchor_token(T_register);
9998 add_anchor_token(T_reinterpret_cast);
9999 add_anchor_token(T_restrict);
10000 add_anchor_token(T_return);
10001 add_anchor_token(T_short);
10002 add_anchor_token(T_signed);
10003 add_anchor_token(T_sizeof);
10004 add_anchor_token(T_static);
10005 add_anchor_token(T_static_cast);
10006 add_anchor_token(T_struct);
10007 add_anchor_token(T_switch);
10008 add_anchor_token(T_template);
10009 add_anchor_token(T_this);
10010 add_anchor_token(T_throw);
10011 add_anchor_token(T_true);
10012 add_anchor_token(T_try);
10013 add_anchor_token(T_typedef);
10014 add_anchor_token(T_typeid);
10015 add_anchor_token(T_typename);
10016 add_anchor_token(T_typeof);
10017 add_anchor_token(T_union);
10018 add_anchor_token(T_unsigned);
10019 add_anchor_token(T_using);
10020 add_anchor_token(T_void);
10021 add_anchor_token(T_volatile);
10022 add_anchor_token(T_wchar_t);
10023 add_anchor_token(T_while);
10025 statement_t **anchor = &statement->compound.statements;
10026 bool only_decls_so_far = true;
10027 while (token.kind != '}' && token.kind != T_EOF) {
10028 statement_t *sub_statement = intern_parse_statement();
10029 if (sub_statement->kind == STATEMENT_ERROR) {
10033 if (sub_statement->kind != STATEMENT_DECLARATION) {
10034 only_decls_so_far = false;
10035 } else if (!only_decls_so_far) {
10036 position_t const *const pos = &sub_statement->base.pos;
10037 warningf(WARN_DECLARATION_AFTER_STATEMENT, pos, "ISO C90 forbids mixed declarations and code");
10040 *anchor = sub_statement;
10041 anchor = &sub_statement->base.next;
10045 /* look over all statements again to produce no effect warnings */
10046 if (is_warn_on(WARN_UNUSED_VALUE)) {
10047 statement_t *sub_statement = statement->compound.statements;
10048 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
10049 if (sub_statement->kind != STATEMENT_EXPRESSION)
10051 /* don't emit a warning for the last expression in an expression
10052 * statement as it has always an effect */
10053 if (inside_expression_statement && sub_statement->base.next == NULL)
10056 expression_t *expression = sub_statement->expression.expression;
10057 if (!expression_has_effect(expression)) {
10058 warningf(WARN_UNUSED_VALUE, &expression->base.pos,
10059 "statement has no effect");
10064 rem_anchor_token(T_while);
10065 rem_anchor_token(T_wchar_t);
10066 rem_anchor_token(T_volatile);
10067 rem_anchor_token(T_void);
10068 rem_anchor_token(T_using);
10069 rem_anchor_token(T_unsigned);
10070 rem_anchor_token(T_union);
10071 rem_anchor_token(T_typeof);
10072 rem_anchor_token(T_typename);
10073 rem_anchor_token(T_typeid);
10074 rem_anchor_token(T_typedef);
10075 rem_anchor_token(T_try);
10076 rem_anchor_token(T_true);
10077 rem_anchor_token(T_throw);
10078 rem_anchor_token(T_this);
10079 rem_anchor_token(T_template);
10080 rem_anchor_token(T_switch);
10081 rem_anchor_token(T_struct);
10082 rem_anchor_token(T_static_cast);
10083 rem_anchor_token(T_static);
10084 rem_anchor_token(T_sizeof);
10085 rem_anchor_token(T_signed);
10086 rem_anchor_token(T_short);
10087 rem_anchor_token(T_return);
10088 rem_anchor_token(T_restrict);
10089 rem_anchor_token(T_reinterpret_cast);
10090 rem_anchor_token(T_register);
10091 rem_anchor_token(T_operator);
10092 rem_anchor_token(T_new);
10093 rem_anchor_token(T_long);
10094 rem_anchor_token(T_int);
10095 rem_anchor_token(T_inline);
10096 rem_anchor_token(T_if);
10097 rem_anchor_token(T_goto);
10098 rem_anchor_token(T_for);
10099 rem_anchor_token(T_float);
10100 rem_anchor_token(T_false);
10101 rem_anchor_token(T_extern);
10102 rem_anchor_token(T_enum);
10103 rem_anchor_token(T_dynamic_cast);
10104 rem_anchor_token(T_do);
10105 rem_anchor_token(T_double);
10106 rem_anchor_token(T_delete);
10107 rem_anchor_token(T_default);
10108 rem_anchor_token(T_continue);
10109 rem_anchor_token(T_const_cast);
10110 rem_anchor_token(T_const);
10111 rem_anchor_token(T_class);
10112 rem_anchor_token(T_char);
10113 rem_anchor_token(T_case);
10114 rem_anchor_token(T_break);
10115 rem_anchor_token(T_bool);
10116 rem_anchor_token(T_auto);
10117 rem_anchor_token(T_asm);
10118 rem_anchor_token(T___real__);
10119 rem_anchor_token(T___label__);
10120 rem_anchor_token(T___imag__);
10121 rem_anchor_token(T___func__);
10122 rem_anchor_token(T___extension__);
10123 rem_anchor_token(T___builtin_va_start);
10124 rem_anchor_token(T___attribute__);
10125 rem_anchor_token(T___PRETTY_FUNCTION__);
10126 rem_anchor_token(T__Thread_local);
10127 rem_anchor_token(T__Imaginary);
10128 rem_anchor_token(T__Complex);
10129 rem_anchor_token(T__Bool);
10130 rem_anchor_token(T__Alignof);
10131 rem_anchor_token(T_STRING_LITERAL);
10132 rem_anchor_token(T_PLUSPLUS);
10133 rem_anchor_token(T_NUMBER);
10134 rem_anchor_token(T_MINUSMINUS);
10135 rem_anchor_token(T_IDENTIFIER);
10136 rem_anchor_token(T_COLONCOLON);
10137 rem_anchor_token(T_CHARACTER_CONSTANT);
10138 rem_anchor_token('~');
10139 rem_anchor_token('{');
10140 rem_anchor_token(';');
10141 rem_anchor_token('-');
10142 rem_anchor_token('+');
10143 rem_anchor_token('*');
10144 rem_anchor_token('(');
10145 rem_anchor_token('&');
10146 rem_anchor_token('!');
10147 rem_anchor_token('}');
10155 * Check for unused global static functions and variables
10157 static void check_unused_globals(void)
10159 if (!is_warn_on(WARN_UNUSED_FUNCTION) && !is_warn_on(WARN_UNUSED_VARIABLE))
10162 for (const entity_t *entity = file_scope->entities; entity != NULL;
10163 entity = entity->base.next) {
10164 if (!is_declaration(entity))
10167 const declaration_t *declaration = &entity->declaration;
10168 if (declaration->used ||
10169 declaration->modifiers & DM_UNUSED ||
10170 declaration->modifiers & DM_USED ||
10171 declaration->storage_class != STORAGE_CLASS_STATIC)
10176 if (entity->kind == ENTITY_FUNCTION) {
10177 /* inhibit warning for static inline functions */
10178 if (entity->function.is_inline)
10181 why = WARN_UNUSED_FUNCTION;
10182 s = entity->function.body != NULL ? "defined" : "declared";
10184 why = WARN_UNUSED_VARIABLE;
10188 warningf(why, &declaration->base.pos, "'%#N' %s but not used", entity, s);
10192 static void parse_global_asm(void)
10194 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10197 add_anchor_token(';');
10198 add_anchor_token(')');
10199 add_anchor_token(T_STRING_LITERAL);
10202 rem_anchor_token(T_STRING_LITERAL);
10203 statement->asms.asm_text = parse_string_literals("global asm");
10204 statement->base.next = unit->global_asm;
10205 unit->global_asm = statement;
10207 rem_anchor_token(')');
10209 rem_anchor_token(';');
10213 static void parse_linkage_specification(void)
10217 position_t const pos = *HERE;
10218 char const *const linkage = parse_string_literals(NULL).begin;
10220 linkage_kind_t old_linkage = current_linkage;
10221 linkage_kind_t new_linkage;
10222 if (streq(linkage, "C")) {
10223 new_linkage = LINKAGE_C;
10224 } else if (streq(linkage, "C++")) {
10225 new_linkage = LINKAGE_CXX;
10227 errorf(&pos, "linkage string \"%s\" not recognized", linkage);
10228 new_linkage = LINKAGE_C;
10230 current_linkage = new_linkage;
10239 assert(current_linkage == new_linkage);
10240 current_linkage = old_linkage;
10243 static void parse_external(void)
10245 switch (token.kind) {
10247 if (look_ahead(1)->kind == T_STRING_LITERAL) {
10248 parse_linkage_specification();
10250 DECLARATION_START_NO_EXTERN
10252 case T___extension__:
10253 /* tokens below are for implicit int */
10254 case '&': /* & x; -> int& x; (and error later, because C++ has no
10256 case '*': /* * x; -> int* x; */
10257 case '(': /* (x); -> int (x); */
10259 parse_external_declaration();
10265 parse_global_asm();
10269 parse_namespace_definition();
10273 if (!strict_mode) {
10274 warningf(WARN_STRAY_SEMICOLON, HERE, "stray ';' outside of function");
10281 errorf(HERE, "stray %K outside of function", &token);
10282 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10283 eat_until_matching_token(token.kind);
10289 static void parse_externals(void)
10291 add_anchor_token('}');
10292 add_anchor_token(T_EOF);
10295 /* make a copy of the anchor set, so we can check if it is restored after parsing */
10296 unsigned short token_anchor_copy[T_LAST_TOKEN];
10297 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10300 while (token.kind != T_EOF && token.kind != '}') {
10302 for (int i = 0; i < T_LAST_TOKEN; ++i) {
10303 unsigned short count = token_anchor_set[i] - token_anchor_copy[i];
10305 /* the anchor set and its copy differs */
10306 internal_errorf(HERE, "Leaked anchor token %k %d times", i, count);
10309 if (in_gcc_extension) {
10310 /* an gcc extension scope was not closed */
10311 internal_errorf(HERE, "Leaked __extension__");
10318 rem_anchor_token(T_EOF);
10319 rem_anchor_token('}');
10323 * Parse a translation unit.
10325 static void parse_translation_unit(void)
10327 add_anchor_token(T_EOF);
10332 if (token.kind == T_EOF)
10335 errorf(HERE, "stray %K outside of function", &token);
10336 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10337 eat_until_matching_token(token.kind);
10342 void set_default_visibility(elf_visibility_tag_t visibility)
10344 default_visibility = visibility;
10350 * @return the translation unit or NULL if errors occurred.
10352 void start_parsing(void)
10354 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10355 label_stack = NEW_ARR_F(stack_entry_t, 0);
10357 print_to_file(stderr);
10359 assert(unit == NULL);
10360 unit = allocate_ast_zero(sizeof(unit[0]));
10362 assert(file_scope == NULL);
10363 file_scope = &unit->scope;
10365 assert(current_scope == NULL);
10366 scope_push(&unit->scope);
10368 create_gnu_builtins();
10370 create_microsoft_intrinsics();
10373 translation_unit_t *finish_parsing(void)
10375 assert(current_scope == &unit->scope);
10378 assert(file_scope == &unit->scope);
10379 check_unused_globals();
10382 DEL_ARR_F(environment_stack);
10383 DEL_ARR_F(label_stack);
10385 translation_unit_t *result = unit;
10390 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
10391 * are given length one. */
10392 static void complete_incomplete_arrays(void)
10394 size_t n = ARR_LEN(incomplete_arrays);
10395 for (size_t i = 0; i != n; ++i) {
10396 declaration_t *const decl = incomplete_arrays[i];
10397 type_t *const type = skip_typeref(decl->type);
10399 if (!is_type_incomplete(type))
10402 position_t const *const pos = &decl->base.pos;
10403 warningf(WARN_OTHER, pos, "array '%#N' assumed to have one element", (entity_t const*)decl);
10405 type_t *const new_type = duplicate_type(type);
10406 new_type->array.size_constant = true;
10407 new_type->array.has_implicit_size = true;
10408 new_type->array.size = 1;
10410 type_t *const result = identify_new_type(new_type);
10412 decl->type = result;
10416 static void prepare_main_collect2(entity_t *const entity)
10418 PUSH_SCOPE(&entity->function.body->compound.scope);
10420 // create call to __main
10421 symbol_t *symbol = symbol_table_insert("__main");
10422 entity_t *subsubmain_ent
10423 = create_implicit_function(symbol, &builtin_position);
10425 expression_t *ref = allocate_expression_zero(EXPR_REFERENCE);
10426 type_t *ftype = subsubmain_ent->declaration.type;
10427 ref->base.pos = builtin_position;
10428 ref->base.type = make_pointer_type(ftype, TYPE_QUALIFIER_NONE);
10429 ref->reference.entity = subsubmain_ent;
10431 expression_t *call = allocate_expression_zero(EXPR_CALL);
10432 call->base.pos = builtin_position;
10433 call->base.type = type_void;
10434 call->call.function = ref;
10436 statement_t *expr_statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10437 expr_statement->base.pos = builtin_position;
10438 expr_statement->expression.expression = call;
10440 statement_t *const body = entity->function.body;
10441 assert(body->kind == STATEMENT_COMPOUND);
10442 compound_statement_t *compounds = &body->compound;
10444 expr_statement->base.next = compounds->statements;
10445 compounds->statements = expr_statement;
10452 lookahead_bufpos = 0;
10453 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10456 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
10457 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
10458 parse_translation_unit();
10459 complete_incomplete_arrays();
10460 DEL_ARR_F(incomplete_arrays);
10461 incomplete_arrays = NULL;
10465 * Initialize the parser.
10467 void init_parser(void)
10469 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10471 init_expression_parsers();
10472 obstack_init(&temp_obst);
10476 * Terminate the parser.
10478 void exit_parser(void)
10480 obstack_free(&temp_obst, NULL);